

In 2019, Phil Daian published "Flash Boys 2.0," exposing an uncomfortable truth: Ethereum's transparent mempool had become a hunting ground. Bots watched. Bots waited. Bots extracted.
By 2022, MEV extraction on Ethereum exceeded $600 million. Sandwich attacks alone accounted for over $200 million in user losses. The "Dark Forest" wasn't a metaphor anymore—it was the default state of decentralized finance.
The community responded. Flashbots created MEV-Share to democratize extraction. Private mempools like MEV Blocker hid transactions from predators. Fair ordering protocols attempted to enforce timestamp-based sequencing. Threshold encryption promised to reveal transactions only after ordering was finalized.
These solutions helped. But none of them solved the fundamental problem.
Why?
Because they all operate on top of the same assumption: blockchain state is deterministic. Given a transaction and a state, exactly one outcome is possible. This determinism is what makes MEV profitable—if you can predict the outcome, you can extract value from the prediction.
What if we challenged that assumption?
Here's something interesting from quantum mechanics.
Probabilities are always non-negative. You can't have a -30% chance of rain. This means when you combine probabilities, they can only add up—never cancel out. If Event A has 40% probability and Event B has 40% probability, the combined space is somewhere between 40% and 80%, depending on correlation.
But amplitudes—the mathematical objects that, when squared, give probabilities—can be negative. More precisely, they can have phases that cause them to point in opposite directions.

When two amplitudes with opposite phases meet, something remarkable happens: destructive interference. The amplitudes cancel, and the resulting probability is zero. Not small. Not unlikely. Mathematically impossible.
This is not speculation. It's how the physical world works at the quantum level. It's why noise-canceling headphones work. It's why certain chemical reactions are forbidden despite having available energy.
ESM asks: what if blockchain state worked the same way?
Entangled State Machine (ESM) is a probabilistic blockchain architecture that represents transaction outcomes as complex amplitudes rather than deterministic values.
In ESM, when you submit a transaction, you're not committing to a single outcome. You're creating a superposition of possible states, each with an associated amplitude. These amplitudes exist in parallel until an observation event—called collapse—selects the final outcome based on the combined probability distribution.
The key innovation: transaction timing determines phase assignment.
When Alice submits a swap transaction, she receives phase P0 (0 degrees). Her amplitude points in the positive direction on the complex plane.
When a MEV bot detects Alice's transaction and attempts to front-run within 100ms, the system automatically assigns phase P180 (180 degrees). The bot's amplitude points in the negative direction.
When these amplitudes combine:
α_Alice = 1.0 × (cos(0°) + i·sin(0°)) = 1.0 + 0i
α_Bot = 1.0 × (cos(180°) + i·sin(180°)) = -1.0 + 0i
α_total = α_Alice + α_Bot = (1.0 - 1.0) + 0i = 0
P_total = |α_total|² = 0
Result: The bot's transaction doesn't just fail—it mathematically vanishes. The interference is destructive and complete.

ESM is built on three atomic primitives:
The PSC replaces traditional key-value storage with multi-branch probabilistic state. Each PSC holds multiple potential outcomes (branches), each with an associated amplitude. Branches can be added, modified, or can interfere with each other until collapse.
VTCF wraps a Verifiable Delay Function (VDF) to enforce time-based finality. The VDF ensures that no one—not even validators—can predict or manipulate the collapse outcome until sufficient time has passed. This makes phase gaming computationally infeasible.
ETPs enable atomic cross-contract operations by correlating PSC collapses. When PSC_A collapses to state X, entangled PSC_B simultaneously collapses to the correlated state—enabling complex DeFi primitives without oracle dependencies.

ESM uses 8 discrete phases (45° increments) for deterministic computation:
Phase | Angle | Effect | Use Case |
P0 | 0° | Full constructive | Normal transactions |
P45 | 45° | Partial constructive | Advanced composition |
P90 | 90° | Orthogonal (independent) | Parallel execution |
P135 | 135° | Partial destructive | Graduated penalties |
P180 | 180° | Full destructive | MEV cancellation |
P225 | 225° | Partial destructive | Advanced |
Phase assignment is determined by transaction timing relative to the original:
0-100ms delay → P180 (full cancellation, likely front-run)
100-500ms delay → P135 (partial cancellation)
500-1000ms delay → P90 (orthogonal, independent)
1000ms delay → P0 (normal, likely legitimate)
This creates a smooth gradient from full MEV resistance to normal operation, rather than a binary allow/deny system that could be gamed.
ESM introduces Proof of Collapse (PoC), a consensus mechanism that validates collapse correctness rather than transaction ordering.
The process:
Commit Phase (Block N+90 to N+95): Validators commit to their calculated collapse outcome using hash commitments
Reveal Phase (Block N+95 to N+100): Validators reveal their commitments
Threshold Judgment: If ≥67% of stake reveals matching outcomes, collapse proceeds
Backup Activation: If threshold isn't met, backup validators activate with elevated slashing (50% vs 10%)
This design balances liveness and security—the system never stalls, but manipulation is economically irrational.
We built a complete ESM simulator and ran 1,000 MEV attack scenarios. As shown in the dashboard (Figure 1), the results are definitive:

The numbers:
Metric | Traditional | ESM | Change |
Total MEV Profit | $165,594 | $1,140 | -99.3% |
Average per Attack | $166 | $1.14 | -99.3% |
Successful Attacks | 1,000 | 12 | -98.8% |
Dominant Phase | N/A | P180 (95.4%) | — |
The residual 0.7% comes from attacks with timing >1000ms—so slow they're indistinguishable from legitimate transactions. At that point, they're not really "attacks" anymore; they're just normal market participants.
ESM enables application patterns that are impossible or impractical on deterministic blockchains:

MEV-Resistant DEX: Trades enter as PSC branches with automatic phase assignment. Front-running attempts receive P180, causing complete cancellation.
Privacy Transfer: Sender specifies multiple potential recipients as branches. Actual recipient unknown until collapse—mixer-like privacy without a mixer.
Prediction Market: Outcomes exist as amplitude-weighted branches. Betting creates interference patterns that naturally adjust odds.
Decentralized Insurance: Claim conditions exist in superposition until oracle confirmation. Payouts collapse atomically with verification.
Sealed-Bid Auction: Bids committed as branches, revealed at VDF completion. Winner determined at collapse—no two-phase UX required.
Quantum NFT: Properties remain in superposition until first observation. Rarity determined at mint, not pre-determined—provably fair.
ESM is research, not a finished product. We acknowledge significant challenges:
Challenge | Severity | Current Status |
Finality Delay (~100 blocks) | Medium | Exploring fast/slow path separation |
Scaling O(n²) interference | High | Branch pool limits, sparse matrix research |
VDF Hardware Requirements | Medium | Class group VDF, multi-algorithm fallback |
Complexity for Developers | Medium | SDK abstraction in progress |
Oracle Dependency | Medium | Impact mitigation, built-in oracle roadmap |
We're not claiming to have solved these. We're claiming they're worth solving.
MEV is often framed as an optimization problem: how do we minimize extraction, redistribute profits, or hide information?
ESM frames it as a design problem: what if the architecture itself made extraction mathematically irrational?
We're not trying to make the Dark Forest friendlier. We're trying to change the rules of physics inside it.
Probabilities are always positive. But amplitudes can cancel.
That's the insight. The rest is implementation.
—hoddukzoa
January 2026
Links:
P270 | 270° | Orthogonal | Advanced |
P315 | 315° | Partial constructive | Advanced |
<100 subscribers


In 2019, Phil Daian published "Flash Boys 2.0," exposing an uncomfortable truth: Ethereum's transparent mempool had become a hunting ground. Bots watched. Bots waited. Bots extracted.
By 2022, MEV extraction on Ethereum exceeded $600 million. Sandwich attacks alone accounted for over $200 million in user losses. The "Dark Forest" wasn't a metaphor anymore—it was the default state of decentralized finance.
The community responded. Flashbots created MEV-Share to democratize extraction. Private mempools like MEV Blocker hid transactions from predators. Fair ordering protocols attempted to enforce timestamp-based sequencing. Threshold encryption promised to reveal transactions only after ordering was finalized.
These solutions helped. But none of them solved the fundamental problem.
Why?
Because they all operate on top of the same assumption: blockchain state is deterministic. Given a transaction and a state, exactly one outcome is possible. This determinism is what makes MEV profitable—if you can predict the outcome, you can extract value from the prediction.
What if we challenged that assumption?
Here's something interesting from quantum mechanics.
Probabilities are always non-negative. You can't have a -30% chance of rain. This means when you combine probabilities, they can only add up—never cancel out. If Event A has 40% probability and Event B has 40% probability, the combined space is somewhere between 40% and 80%, depending on correlation.
But amplitudes—the mathematical objects that, when squared, give probabilities—can be negative. More precisely, they can have phases that cause them to point in opposite directions.

When two amplitudes with opposite phases meet, something remarkable happens: destructive interference. The amplitudes cancel, and the resulting probability is zero. Not small. Not unlikely. Mathematically impossible.
This is not speculation. It's how the physical world works at the quantum level. It's why noise-canceling headphones work. It's why certain chemical reactions are forbidden despite having available energy.
ESM asks: what if blockchain state worked the same way?
Entangled State Machine (ESM) is a probabilistic blockchain architecture that represents transaction outcomes as complex amplitudes rather than deterministic values.
In ESM, when you submit a transaction, you're not committing to a single outcome. You're creating a superposition of possible states, each with an associated amplitude. These amplitudes exist in parallel until an observation event—called collapse—selects the final outcome based on the combined probability distribution.
The key innovation: transaction timing determines phase assignment.
When Alice submits a swap transaction, she receives phase P0 (0 degrees). Her amplitude points in the positive direction on the complex plane.
When a MEV bot detects Alice's transaction and attempts to front-run within 100ms, the system automatically assigns phase P180 (180 degrees). The bot's amplitude points in the negative direction.
When these amplitudes combine:
α_Alice = 1.0 × (cos(0°) + i·sin(0°)) = 1.0 + 0i
α_Bot = 1.0 × (cos(180°) + i·sin(180°)) = -1.0 + 0i
α_total = α_Alice + α_Bot = (1.0 - 1.0) + 0i = 0
P_total = |α_total|² = 0
Result: The bot's transaction doesn't just fail—it mathematically vanishes. The interference is destructive and complete.

ESM is built on three atomic primitives:
The PSC replaces traditional key-value storage with multi-branch probabilistic state. Each PSC holds multiple potential outcomes (branches), each with an associated amplitude. Branches can be added, modified, or can interfere with each other until collapse.
VTCF wraps a Verifiable Delay Function (VDF) to enforce time-based finality. The VDF ensures that no one—not even validators—can predict or manipulate the collapse outcome until sufficient time has passed. This makes phase gaming computationally infeasible.
ETPs enable atomic cross-contract operations by correlating PSC collapses. When PSC_A collapses to state X, entangled PSC_B simultaneously collapses to the correlated state—enabling complex DeFi primitives without oracle dependencies.

ESM uses 8 discrete phases (45° increments) for deterministic computation:
Phase | Angle | Effect | Use Case |
P0 | 0° | Full constructive | Normal transactions |
P45 | 45° | Partial constructive | Advanced composition |
P90 | 90° | Orthogonal (independent) | Parallel execution |
P135 | 135° | Partial destructive | Graduated penalties |
P180 | 180° | Full destructive | MEV cancellation |
P225 | 225° | Partial destructive | Advanced |
P270 | 270° | Orthogonal | Advanced |
P315 | 315° | Partial constructive | Advanced |
Phase assignment is determined by transaction timing relative to the original:
0-100ms delay → P180 (full cancellation, likely front-run)
100-500ms delay → P135 (partial cancellation)
500-1000ms delay → P90 (orthogonal, independent)
1000ms delay → P0 (normal, likely legitimate)
This creates a smooth gradient from full MEV resistance to normal operation, rather than a binary allow/deny system that could be gamed.
ESM introduces Proof of Collapse (PoC), a consensus mechanism that validates collapse correctness rather than transaction ordering.
The process:
Commit Phase (Block N+90 to N+95): Validators commit to their calculated collapse outcome using hash commitments
Reveal Phase (Block N+95 to N+100): Validators reveal their commitments
Threshold Judgment: If ≥67% of stake reveals matching outcomes, collapse proceeds
Backup Activation: If threshold isn't met, backup validators activate with elevated slashing (50% vs 10%)
This design balances liveness and security—the system never stalls, but manipulation is economically irrational.
We built a complete ESM simulator and ran 1,000 MEV attack scenarios. As shown in the dashboard (Figure 1), the results are definitive:

The numbers:
Metric | Traditional | ESM | Change |
Total MEV Profit | $165,594 | $1,140 | -99.3% |
Average per Attack | $166 | $1.14 | -99.3% |
Successful Attacks | 1,000 | 12 | -98.8% |
Dominant Phase | N/A | P180 (95.4%) | — |
The residual 0.7% comes from attacks with timing >1000ms—so slow they're indistinguishable from legitimate transactions. At that point, they're not really "attacks" anymore; they're just normal market participants.
ESM enables application patterns that are impossible or impractical on deterministic blockchains:

MEV-Resistant DEX: Trades enter as PSC branches with automatic phase assignment. Front-running attempts receive P180, causing complete cancellation.
Privacy Transfer: Sender specifies multiple potential recipients as branches. Actual recipient unknown until collapse—mixer-like privacy without a mixer.
Prediction Market: Outcomes exist as amplitude-weighted branches. Betting creates interference patterns that naturally adjust odds.
Decentralized Insurance: Claim conditions exist in superposition until oracle confirmation. Payouts collapse atomically with verification.
Sealed-Bid Auction: Bids committed as branches, revealed at VDF completion. Winner determined at collapse—no two-phase UX required.
Quantum NFT: Properties remain in superposition until first observation. Rarity determined at mint, not pre-determined—provably fair.
ESM is research, not a finished product. We acknowledge significant challenges:
Challenge | Severity | Current Status |
Finality Delay (~100 blocks) | Medium | Exploring fast/slow path separation |
Scaling O(n²) interference | High | Branch pool limits, sparse matrix research |
VDF Hardware Requirements | Medium | Class group VDF, multi-algorithm fallback |
Complexity for Developers | Medium | SDK abstraction in progress |
Oracle Dependency | Medium | Impact mitigation, built-in oracle roadmap |
We're not claiming to have solved these. We're claiming they're worth solving.
MEV is often framed as an optimization problem: how do we minimize extraction, redistribute profits, or hide information?
ESM frames it as a design problem: what if the architecture itself made extraction mathematically irrational?
We're not trying to make the Dark Forest friendlier. We're trying to change the rules of physics inside it.
Probabilities are always positive. But amplitudes can cancel.
That's the insight. The rest is implementation.
—hoddukzoa
January 2026
Links:
Share Dialog
Share Dialog
No comments yet