Indexing the archive…
Your Universe of Digital Possibilities
Three pegs, sixty-four disks, and the one deep-time number on the rack that is exact: 2⁶⁴ − 1 moves, 585 billion years at one a second — no dice, no error bars, a legend’s apocalypse computed to the last digit. Solve three by hand, watch the doubling eat the axis, and meet the state space’s secret shape: the Sierpiński triangle, with the solution as its edge.
To move n disks, move n − 1 out of the way, move the largest once, and move the n − 1 back on top: the count doubles and adds one, so it is 2ⁿ − 1 — and no solution is shorter. Each disk doubles the wait; sixty-four of them at one move a second outlast the stars.
With a fourth peg, park the top k disks using all four, move the other n − k with three, and bring the k back: choose k to minimise. The wait stops doubling per disk — 64 disks fall from 1.8×10¹⁹ moves to 18,433. Optimal for four pegs (Bousch 2014); open beyond.
Exponential cost needs no randomness and no complexity — one self-referencing rule suffices. The Tape owns the other extreme of counting steps: the busy beaver, whose counts cannot even be known; here the count is the knowable extreme. The Cascade owns doubling in parameter space. In the Zeno Edition this EXACT stamp is the calibration for the DERIVED ones that follow — The Recurrence’s tower and The Proton’s patience.