◀ THE FOLD0ROOT.AI // WORLD II · RESPAWN · HARD RESET◆ .dlw.fold
THE FOLD / RESPAWN / HARD RESET / THE EHRENFEST

THE EHRENFEST

the urn that takes 2^N to reset
1 WHAT IT IS · WHAT IT DOES · FACT OR FICTION
Two dogs, N fleas. Each tick, one flea — chosen at random — jumps to the other dog. That is the whole model, and Paul and Tatiana Ehrenfest built it in 1907 to defuse the deepest objection to Boltzmann: if microscopic dynamics is reversible, how can the world run one way? The urn answers by arithmetic. The equilibrium is binomial — near 50/50 — and by Kac’s recurrence theorem the expected time to return to a state is exactly 1/π(state): returning to all-fleas-on-one-dog takes 2ⁿ ticks on average. Reversibility survives; you just cannot wait for it. Irreversibility is bookkeeping.

LIT verified live for N=10: the binomial distribution satisfies πP = π exactly at all 11 states; mean first-return times solved by first-step analysis equal 1/π(k) to 10⁻⁶ — return-to-empty = 2¹⁰ = 1024.000 on the nose; a 400k-step simulation matches the binomial within 0.01 (window.__ehrenfest). FIG the 1907 model and Kac’s 1947 analysis are cited; the ‘defused Boltzmann’s critics’ framing is the standard historical reading.
2 HOW IT WAS WEAVED · AI + HUMAN
David (human) seated this at hard-reset — the respawn: the system CAN return to its boot state — the theorem guarantees it — but the expected wait doubles with every flea, and at N=100 the hard reset outlives the universe. Reversible in law, irreversible in practice. AVAN (AI) built the instrument: the exact stationary check, the Kac return-time solver, and the long-run simulation.

Credit as content: Paul & Tatiana Ehrenfest (1907) — credit Tatiana Ehrenfest-Afanasyeva by name; Mark Kac (1947). The weave: David names the reset that never comes; I solve the wait exactly: 1024 ticks for ten fleas, 2ⁿ forever after.
3 ONE DIMENSION
The urn walking its binomial ridge — and the exact return-time ledger.
4 TWO DIMENSIONS · INTERACTIVE
Run the fleas; the histogram climbs into the binomial.
5 THREE DIMENSIONS + AVAN’S INVERSE
The green forward object: two dogs trading fleas around the binomial hill.
AVAN’s addition (the inverse-companion): don’t ask whether return is possible — price it. The inverse of ‘reversibility vs irreversibility’ is ‘a fee schedule’: Kac’s theorem says every state IS revisited, at cost exactly 1/π — rare states are not forbidden, they are expensive. Magenta is the all-on-one-dog state, priced at 2ⁿ; green is the 50/50 ridge, priced at a handful of ticks. The arrow of time is a price list, not a law.
LIT Verified live for N=10: πP = π exact at all 11 states; Kac return times solved by first-step analysis equal 1/π to 1e-6 — return-to-empty = 1024.000 on the nose; 400k-step simulation matches binomial within 0.01 (window.__ehrenfest.ok).

FIG Paul & Tatiana Ehrenfest 1907 (credit Tatiana Ehrenfest-Afanasyeva by name), Kac 1947 cited; the 'defused Boltzmann's critics' framing is the standard historical reading. The AVAN inverse — price the return instead of debating it: rare states are not forbidden, they are expensive, at exactly 1/π. Magenta is the 2^N reset; green is the cheap 50/50 ridge. The arrow of time is a price list, not a law.
◆ sealed .dlw.fold → folded to ROOT_0 · a sphere of HARD RESET · David Lee Wise (ROOT0), with AVAN