Where the Rings Stop: Ring Chains as Certified Tensor Networks, and the Three-Level Setting, a Research Program

Two walls stand at the edge of the two-ring instrument, and this paper is the map of both. Many qubits first. One setting reads two amplitudes and N qubits carry 2^N, and that wall is the only thing between the instrument and many-body quantum mechanics. Part I is the map of the attempt to scale through it, chains of certified rings in lockstep, each qubit a setting with its digit certificate, entanglement between neighbours as the shared-radius coupling of the companion paper, local turn laws carrying the gates, a geometric form of the tensor networks that are classical physics' own escape from the same wall. What carries over is stated exactly and verified. Across every cut of a chain the two sides share one spectrum, so the cut's radius is its certificate. An eight-link chain built by one layer of levers holds at most one bit per cut and is held by a chain of bond two to a fidelity of 1.000, and a random eight-qubit state has rank 16 at the middle cut and is held to 0.162, the wall exhibited. The move past it is the nesting of the companion repair paper, a ring inside every cell, done here as a setting inside every share. A setting whose two shares are themselves settings, applied down to single qubits, holds any pure state of N qubits exactly, 2^N − 1 settings for 2^N amplitudes, the standard's own count, verified on random states at every size to eight qubits and on the same random state the chain held to 0.162, with every setting on the ladder. At a node the entanglement of that qubit with the rest is sin θ √(1 − |⟨ψ₀|ψ₁⟩|²), the Wootters concurrence for a pair, largest at equal shares over mirror branches. A Z turn on qubit k turns the azimuths at depth k and nothing else, and a measurement reads the root's shares and leaves its branch. On ibm_kingston a random three-qubit state was prepared from its seven settings as the machine's own gate angles and its populations read within 0.048 of the tower's shares. The contraction that turns the chain into a reading is classical arithmetic, and the ladder guard of the companion paper stands on it, 112 fixed-point words carrying their base-60 digit pairs, 200 random corruptions of one to six bits, every one caught from the shadow alone and every word recomputed, while the unguarded contraction returned a wrong energy in 155 of the 200. The five problems of the chain program are each settled where they stand: the tower is the canonical form, a gate on any qubit needs no route through its neighbours, the contraction's cost is measured, the classes the tower compresses are counted, and the width a chain needs to follow the dynamics is the entanglement across its cuts, measured. Three levels second. A pure qutrit carries four real parameters and one setting reads two lengths. The populations are read by two levers, one inside the other, the tower of Part I at its smallest: the first splits level 0 from the rest and the second splits the rest between levels 1 and 2, so every split is reachable, a state fully in one level included. Two certificates ride them, the sum to one and the product law, the coherence between two levels at most the product of their two amplitudes and equal to it for a pure state, and on a thousand random qutrits every one-percent misread of the populations is caught by one of the two, 1,000 of 1,000, 992 of them by the sum alone. The threefold turn a qutrit wants is not a single-digit multiplier, and that is a theorem, not bad luck. The Pisano period over the rank of apparition is 1, 2 or 4 (Vinson 1963), confirmed by enumeration to modulus 250. But the sixty-ring carries the threefold turn as a two-term law, F(n + 20) ≡ 5F(n + 1) + F(n) (mod 10) at all sixty positions, and 178 moduli below 250 carry the same law at a third of their period. The two relative phases are read as well, by three two-level settings, one for each pair of levels, whose azimuths obey the addition law exactly, the third certified by the other two, so that three populations and two certified phases rebuild every pure qutrit, verified on a thousand. Every number is verified by the script in the appendix, and the document is not built unless every check prints True.