Minor style fixes

Author: adlrocha

beyond-bitswap/rfc/rfcBBL102.md

@@ -1,6 +1,6 @@
-#  RFC| BB | L1-02: TTLs for rebroadcasting WANT messages
-Status: `Draft`
-Implementation here:
+#  RFC|BB|L1-02: TTLs for rebroadcasting WANT messages
+* Status: `Draft`
+* Implementation here:
 
 ## Abstract
 

beyond-bitswap/rfc/rfcBBL104.md

@@ -1,14 +1,13 @@
 #  RFC|BB|L1-04: Track WANT messages for future queries
-Status: `Draft`
+* Status: `Draft`
+* Implementation here: https://github.com/adlrocha/go-bitswap/tree/feature/rfcBBL104
 
 ## Abstract
 
 This RFC proposes to leverage the knowledge acquired when receiving WANT messages sent by others in future requests issued by the peer tracking them. By keeping track of the WANT messages received, a peer will have the possibility to assert the likelihood of a peer having a block after a period of time, the rationale being: if someone asked for this in the past, they probably have it by now. With this information, a peer can issue queries to the peers that might have the block without having to enter in a discovery phase.
 
 <!-- Full description here: https://docs.google.com/document/d/1zjJCZel8zJzgK3XuHK0YZlNffEHThq7tUOssGgRTryY/edit#heading=h.6qnrq913vou6 -->
 
-Implementation here: https://github.com/adlrocha/go-bitswap/tree/feature/rfcBBL104
-
 ## Shortcomings
 Bitswap nodes currently send WANT messages blindly to all its connected peers. On the other hand, WANT messages include a lot of useful information about “recently accessed content” of a nodes’ connected peers. By tracking this information more directed and efficient searches of content can be performed.
 

beyond-bitswap/rfc/rfcBBL1201.md

@@ -1,7 +1,6 @@
-#  RFC| BB | L12-01: Bitswap/Graphsync exchange messages extension and transmission choice
-Status: `Draft`
-
-Implementation here: https://github.com/
+#  RFC|BB|L12-01: Bitswap/Graphsync exchange messages extension and transmission choice
+* Status: `Draft`
+* Implementation here: https://github.com/
 
 ## Abstract
 This RFC proposes expanding Bitswap and Graphsync exchange messages with additional information. This information is used in content requests for receivers to be able to understand clearly the content requested; and in responses so responders can share his specific level of fulfillment of the request to the requestor. With this information the requestor can select the best nodes to perform the actual request to have the best performance possible in the transmission.

beyond-bitswap/rfc/rfcBBL203A.md

@@ -1,7 +1,6 @@
 #  RFC|BB|L2-03A: Use of compression and adjustable block size
-Status: `Draft`
-
-Implementation here: https://github.com/adlrocha/go-bitswap/tree/feature/rfcBBL203A
+* Status: `Draft`
+* Implementation here: https://github.com/adlrocha/go-bitswap/tree/feature/rfcBBL203A
 
 ## Abstract
 This RFC proposes the exploration of using compression in block transmission. These techniques go from:

beyond-bitswap/rfc/rfcBBL207.md

@@ -1,7 +1,6 @@
-#  RFC|BB | L2-07: Request minimum piece size and content protocol extension
-Status: `Brainstorm`
-
-Implementation here: https://github.com/
+#  RFC|BB|L2-07: Request minimum piece size and content protocol extension
+* Status: `Brainstorm`
+* Implementation here: https://github.com/
 
 <!-- Full description here: https://docs.google.com/document/d/1zjJCZel8zJzgK3XuHK0YZlNffEHThq7tUOssGgRTryY/edit#heading=h.6qnrq913vou6 -->
 

beyond-bitswap/rfc/template.md

@@ -1,9 +1,8 @@
 #  RFC|\<code>: \<name>
-## Abstract
-Status: `Draft`
-
-Implementation here: https://github.com/
+* Status: `Draft`
+* Implementation here: https://github.com/adlrocha/
 
+## Abstract
 <!-- Full description here: https://docs.google.com/document/d/1zjJCZel8zJzgK3XuHK0YZlNffEHThq7tUOssGgRTryY/edit#heading=h.6qnrq913vou6 -->