Fix list split across code block boundary

1 files changed, 11 insertions, 13 deletions

diff --git a/spec/tor-spec/resource-exhaustion.md b/spec/tor-spec/resource-exhaustion.md
index 4b57300..4dddf9f 100644
--- a/spec/tor-spec/resource-exhaustion.md
+++ b/spec/tor-spec/resource-exhaustion.md
@@ -13,21 +13,19 @@ more memory is free again.  We recommend the following algorithm:
 
 - Set a threshold amount of RAM to recover at 10% of the total RAM.
 
-```text
-     - Sort the circuits by their 'staleness', defined as the age of the
-       oldest data queued on the circuit.  This data can be:
+- Sort the circuits by their 'staleness', defined as the age of the
+  oldest data queued on the circuit.  This data can be:
 
-          * Bytes that are waiting to flush to or from a stream on that
-            circuit.
+     * Bytes that are waiting to flush to or from a stream on that
+       circuit.
 
-          * Bytes that are waiting to flush from a connection created with
-            BEGIN_DIR.
+     * Bytes that are waiting to flush from a connection created with
+       BEGIN_DIR.
 
-          * Cells that are waiting to flush or be processed.
+     * Cells that are waiting to flush or be processed.
 
-     - While we have not yet recovered enough RAM:
+- While we have not yet recovered enough RAM:
 
-          * Free all memory held by the most stale circuit, and send DESTROY
-            cells in both directions on that circuit.  Count the amount of
-            memory we recovered towards the total.
-```
+     * Free all memory held by the most stale circuit, and send DESTROY
+       cells in both directions on that circuit.  Count the amount of
+       memory we recovered towards the total.