The Geometric Computer · v23 stack

Fold a state into a number.
Ask which folds hold.

Two layers, both gated. L1 folds a state losslessly into one integer (the primorial codec). L2 — Entropic Torus Harmonics — decides which fold-signatures are stable torus-harmonics: golden windings hold, resonant ones cancel. Every number below is computed by the same proof-of-play'd kernel the tests run against.

① L1 · geometry as data — the primorial fold codec

Which rings are lit → one number, reversible.

Toggle the seven prime rings ψ. The lit set folds to a squarefree divisor of Ω=510510 (17#). Empty = 1 (unity) · all seven = 510510 (primorial) · 128 blooms in all, so 127 = M₇ = the shield.

1
bloom (folded)
1
shield · mod 127
unity (empty)
unfolds back to

② L2 · geometry as dynamics — torus-harmonic stability

Golden holds. Resonance cancels.

A winding rides the stability map x → d − x² (κ=1/φ is its fixed point at d=1). A quasi-periodic (golden/noble) winding lands in the attractor band → stable. A low-order-rational winding is resonant → escapes (overloaded). A dead mode starves.

—

③ The empirical why — measured live, in your browser

If this doesn't discriminate, the engine is decoration.

Stable-rate over many windings of each kind, computed right now by the L2 kernel. The test suite asserts this every run — golden must hold, rationals must cancel, and it must beat random.