The Machine

A state turns. You compare three lengths, write down the biggest, and — if you are allowed to touch it — the machine rewrites the state around your answer. Nothing here is random.

A demonstration of a mechanism, not a claim about nature. Nothing on this page is quantum mechanics and nothing here claims anything about the world. — Mechanism, exactly as in the research code (repreparation_fold_100_v2.py): a pool of 96 rotors (16 generators × 6 channels) turns forever at rates ω = 2π·frac(√n) for distinct square-free n, screened against near-resonance; the pool is never written to by a measurement. The state is a 3-component complex vector z; between measurements it turns by a fixed diagonal unitary U_S with incommensurate phases 2π(√2−1), 2π(√2+√3−2), −2π(√3−1). A fixed frame Q gives three arrows d_k = ⟨Q_k, z⟩. A measurement takes j = argmax |d_k|², writes j on the tape, and — in FOLD only — reads generator t mod 16, splits its six phases into three sizes and three angles, and rebuilds the state as g·e^2πiw₀Q_j + c₁·e^2πiw₁Q_k + c₂·e^2πiw₂Q_l with g = 1.3125 + 0.0065(v₀−½), c₁ = 0.5368 + 0.8672(v₁−½), c₂ = 0.5108 + 0.5630(v₂−½). In WATCH the same digit is written down and the state is left alone. Every number on screen is counted from the events you can see. The frame Q and the starting state z₀ are 3×3 and 3×1 constants lifted verbatim from the reference run (frame seed 91); everything else is rebuilt from scratch here and was checked digit-for-digit against the Python. back