@@ -4,7 +4,7 @@ title: Foundations of EVM Control Flow
 description: Understanding EVM control flow and its relation to Ethereum's scaling roadmap
 author: Greg Colvin (@gcolvin)
 discussions-to: https://ethereum-magicians.org/t/eip-8173-foundations-of-evm-control-flow/27855
-status: Draft
+status: Review
 type: Informational
 created: 2026-02-16
 ---
@@ -87,26 +87,24 @@ A _complete and sound CFG_ represents all and only the possible paths of program
 
 Consider these three EVM programs with static control flow, chains of two, four, and six blocks.  The number of edges is equal to the number of jumps, no matter the number of blocks — linear, O(N).
 
-```
-   jumpdest    jumpdest    jumpdest    ...
-   push 4      push 4      push 4      ...
-   jump        jump        jump        ...
-   jumpdest    jumpdest    jumpdest    ...
-   stop        push 8      push 8      ...
-               jump        jump        ...
-               jumpdest    jumpdest    ...
-               push 12     push 12     ...
-               jump        jump        ...
-               jumpdest    jumpdest    ...
-               stop        push 16     ...
-                           jump        ...
-                           jumpdest    ...
-                           push 20     ...
-                           jump        ...
-                           jumpdest    ...
-                           stop        ...
-                                       ...
-```
+       jumpdest    jumpdest    jumpdest    ...
+       push 4      push 4      push 4      ...
+       jump        jump        jump        ...
+       jumpdest    jumpdest    jumpdest    ...
+       stop        push 8      push 8      ...
+                   jump        jump        ...
+                   jumpdest    jumpdest    ...
+                   push 12     push 12     ...
+                   jump        jump        ...
+                   jumpdest    jumpdest    ...
+                   stop        push 16     ...
+                               jump        ...
+                               jumpdest    ...
+                               push 20     ...
+                               jump        ...
+                               jumpdest    ...
+                               stop        ...
+                                           ...
 
 ![Control-flow graphs of three static chains](../assets/eip-8173/chain.svg)
 
@@ -116,26 +114,24 @@ _Dynamic jumps_ — whose destinations are known only at runtime — can make st
 
 Consider these EVM programs and the easily generated series of longer programs like them … the really long ones make for nice exploits.  `gas` pushes the gas remaining; it's not important that at runtime this isn't random or that the `jump` will most often fail; what matters is that because the jump destination is taken from the stack it is impossible to know _a priori_ where the jumps go, so every path must be explored.
 
-```
-   jumpdest    jumpdest    jumpdest    ...
-   gas         gas         gas         ...
-   jump        jump        jump        ...
-   jumpdest    jumpdest    jumpdest    ...
-   stop        gas         gas         ...
-               jump        jump        ...
-               jumpdest    jumpdest    ...
-               gas         gas         ...
-               jump        jump        ...
-               jumpdest    jumpdest    ...
-               stop        gas         ...
-                           jump        ...
-                           jumpdest    ...
-                           gas         ...
-                           jump        ...
-                           jumpdest    ...
-                           stop        ...
-                                       ...
-```
+       jumpdest    jumpdest    jumpdest    ...
+       gas         gas         gas         ...
+       jump        jump        jump        ...
+       jumpdest    jumpdest    jumpdest    ...
+       stop        gas         gas         ...
+                   jump        jump        ...
+                   jumpdest    jumpdest    ...
+                   gas         gas         ...
+                   jump        jump        ...
+                   jumpdest    jumpdest    ...
+                   stop        gas         ...
+                               jump        ...
+                               jumpdest    ...
+                               gas         ...
+                               jump        ...
+                               jumpdest    ...
+                               stop        ...
+                                           ...
 
 The control-flow graphs for these programs make the problem clear.  Each node is a block from the programs above — one entry (a `jumpdest`), one exit (a `jump`, or the final `stop`) — and each edge is a step the machine might take.  Edges on the left are backwards branches; edges on the right are forwards branches.  See how the tangle of edges goes up fast, faster than the programs get longer.
 
@@ -245,9 +241,6 @@ By making control flow explicit and enforceable, the EVM becomes compatible with
 
 This Informational proposal itself specifies no changes to the protocol.  Therefore it has no direct security implications.  It does not affect the security considerations of the proposals it describes; rather, it helps to motivate and contextualize them.
 
-<!-- markdownlint-capture -->
-<!-- markdownlint-disable code-block-style -->
-
 [^1]:
     ```csl-json
     {
@@ -638,8 +631,6 @@ This Informational proposal itself specifies no changes to the protocol.  Theref
     }
     ```
 
-<!-- markdownlint-restore -->
-
 ## Copyright
 
 Copyright and related rights waived via [CC0](../LICENSE.md).