Random walk D(t) Theory P(catch-up) vs q Empirical rate marker
⚠ CHAIN REORG

Gambler's Ruin Fork Race: Nakamoto Consensus Random Walk

Blockchains like Bitcoin resolve competing branches with a simple rule: nodes always accept the chain with the most accumulated proof-of-work. Rather than rendering the two branches as literal block towers, this 2D simulator exposes the mathematical object underneath the race: a one-dimensional random walk of the honest chain's lead, driven by two independent Poisson mining processes weighted by hash-power share. Watch the walk drift, reset on every reorg, and compare its long-run reorg frequency directly against Satoshi Nakamoto's closed-form double-spend probability curve plotted over attacker hash power — the same security argument, seen as a phase diagram instead of a race track.