A Concatenated Quantum Code with Topologically-Protected Outer Structure on the Q3 Hypercube: Channel-Friction Semantics and Applications to Particle Physics
Major revision, 19 October 2026. This revision separates three objects previously conflated: a classical [8,4,4] code, its one-code CSS stabilizer state, and a nonlinear set of 48 allowed eight-bit register words. The register admits a 32+16 partition by one generation bit. A declared evolution preserves that partition if its operators commute with the corresponding parity. This elementary conservation statement is retained; it does not establish a concatenated quantum code, a noise threshold or topological protection. The channel-friction ansatz, golden-ratio fixed point and XOR bookkeeping are given their proper conditional scope. Claims of CKM predictions and a derived particle-mass mechanism are withdrawn, as is the claim that the legacy walk is native to the corrected geometry. Changes from earlier versions: The revision removes concatenated-code/topological-protection claims and CKM/mass predictions unsupported by the declared register and retired transport law. The revision separates 16 codewords, a one-dimensional CSS stabilizer space and 48 allowed register words; the latter has Hamming distance one. The revision corrects the geodesic/line-graph count. The revision states a real recovery criterion and the hypotheses of the commutation argument. Retained result: Classical code facts, the nonlinear register count, a conditional sector-conservation proposition and explicitly conditional scalar/graph identities. Previously titled: A Concatenated Quantum Code with Topologically-Protected Outer Structure on the Q3 Hypercube: Channel-Friction Semantics and Applications to Particle Physics. The preceding version and earlier versions remain available. This is a revised preprint, not an independently peer-reviewed result. It uses existing evidence; no new scientific calculations were run and research branches remain frozen. AI assistance is acknowledged in the manuscript. Revision guide for all twelve papers. The attached PUBLICATION_UPDATES.csv provides old and new titles, DOIs and replacement descriptions for catalogue and website updates.
Major revision, 19 October 2026. This revision separates three objects previously conflated: a classical [8,4,4] code, its one-code CSS stabilizer state, and a nonlinear set of 48 allowed eight-bit register words. The register admits a 32+16 partition by one generation bit. A declared evolution preserves that partition if its operators commute with the corresponding parity. This elementary conservation statement is retained; it does not establish a concatenated quantum code, a noise threshold or topological protection. The channel-friction ansatz, golden-ratio fixed point and XOR bookkeeping are given their proper conditional scope. Claims of CKM predictions and a derived particle-mass mechanism are withdrawn, as is the claim that the legacy walk is native to the corrected geometry. Changes from earlier versions: The revision removes concatenated-code/topological-protection claims and CKM/mass predictions unsupported by the declared register and retired transport law. The revision separates 16 codewords, a one-dimensional CSS stabilizer space and 48 allowed register words; the latter has Hamming distance one. The revision corrects the geodesic/line-graph count. The revision states a real recovery criterion and the hypotheses of the commutation argument. Retained result: Classical code facts, the nonlinear register count, a conditional sector-conservation proposition and explicitly conditional scalar/graph identities. Previously titled: A Concatenated Quantum Code with Topologically-Protected Outer Structure on the Q3 Hypercube: Channel-Friction Semantics and Applications to Particle Physics. The preceding version and earlier versions remain available. This is a revised preprint, not an independently peer-reviewed result. It uses existing evidence; no new scientific calculations were run and research branches remain frozen. AI assistance is acknowledged in the manuscript. Revision guide for all twelve papers. The attached PUBLICATION_UPDATES.csv provides old and new titles, DOIs and replacement descriptions for catalogue and website updates.
Major revision, 19 October 2026. A total ordering of tensor-product sites permits the standard Jordan-Wigner construction of anticommuting dressed operators. We retain the explicit exchange-sign calculation and the finite K_3 colour-label matrix identity, while separating both from particle statistics and colour confinement. An ordering-dependent parity string does not by itself select a physical fermionic algebra or local transport law. The earlier same-register product of orthogonal colour projectors is not a baryon creation operator, and the symmetric vector of a three-colour label space is not an SU(3) singlet. Fermionic matter remains an explicit premise in the later framework; the calculation is a conditional representation of exchange algebra, not a derivation of the spin-statistics connection. Changes from earlier versions: The revision withdraws derivation of baryon statistics, local fermion transport and colour confinement from XOR closure. The revision distinguishes Hermitian Majorana-like operators from nilpotent creation operators; a product of orthogonal same-register colour projectors is zero. A symmetric three-colour vector is not an SU(3) singlet; an anti-Hermitian square is not an energy argument. Retained result: Finite Jordan-Wigner anticommutation calculation and K3 matrix identities. Previously titled: Pauli Antisymmetry from F2 XOR-Closure: A Discrete-Geometric Derivation of Composite Baryon Statistics. The preceding version and earlier versions remain available. This is a revised preprint, not an independently peer-reviewed result. It uses existing evidence; no new scientific calculations were run and research branches remain frozen. AI assistance is acknowledged in the manuscript. Revision guide for all twelve papers. The attached PUBLICATION_UPDATES.csv provides old and new titles, DOIs and replacement descriptions for catalogue and website updates.
This paper establishes the algebraic and geometric structure of the [[13,7,3]]_3 ternary CSS quantum stabilizer code and its dimension-indexed family, arising from the Topological Vortex Logic (TVL) framework introduced in "T³ as a Closed Information-Processing Environment" (Zenodo DOI: 10.5281/zenodo.19682633). The 26 stable winding states of TVL on the three-torus T³ form 13 antipodal pairs {w, −w}. These pairs are in natural bijection with the 13 points of the projective plane P²(F₃), and the Z₃ charge structure of TVL induces a parity-check matrix making the antipodal pairs the physical qutrits of the [[13,7,3]]_3 ternary CSS quantum Hamming code (Ketkar et al. 2006). This paper studies the structural properties of this code and its dimension-indexed family [[(3^d−1)/2, (3^d−1)/2 − 2d, 3]]_3 for d ≥ 2. Ten structural results are established: (1) Family construction and self-orthogonality: The CSS construction is valid at every level d ≥ 2, with H·H^T = 0 over F₃ proved for all d. (2) Double distinction of d=3: The TVL code is the smallest family member with positive logical dimension and the unique member among d ≤ 6 with prime physical qutrit count (n=13; the next occurs at d=7, n=1093). (3) PSL irreducibility (iff d=3): PSL(d,F₃) acts absolutely irreducibly on the logical space L_d = C_d/C_d^⊥ if and only if d=3 — proved at d=3 via Burnside's criterion (the 7-dimensional logical module). For every d ≥ 4 the action is reducible: L_d is a uniserial F₃[SL(d,F₃)]-module with exactly d−2 composition factors, by the Bardoe–Sin submodule structure of the GL(n,F_q) permutation module on PG(n−1,q). The earlier converse-of-Schur argument fails in defining characteristic, where dim End_G = 1 does not imply irreducibility. The logical space exists only on the self-orthogonal range q ∈ {2,3}, where the same d−2-factor structure holds in both fields — the binary factors being the trivial module and the exterior powers Λ^k V of the natural module — so that L_d is irreducible exactly for (q,d) ∈ {(3,3),(2,3)}: the TVL code and the Steane code [[7,1,3]] (Proposition 7). (4) σ-structural properties of the family: The shift automorphism σ_d is an isometry of F₃^(n_d) for the weight form; its eigenspaces are mutually symplectically orthogonal; its maximum Jordan block size on the logical space L_d equals 3^(ν₃(d)) (the 3-adic valuation of d); the σ-fixed Gram matrix has rank 1; and the construction is self-orthogonal over F_q if and only if q ∈ {2,3} (the Q-Scope theorem, via a Gauss power-sum identity). (5) Stabilizer weight enumerator: The distribution {A₀=1, A₉=104, A₁₂=624} is derived entirely from the line-incidence geometry of P²(F₃), with each sub-case verified independently. (6) Closed-form weight enumerator: A(ω) = i^(d mod 2) · 3^(n_d/2) for all d ≥ 2, with |A(ω)|² = 3^(n_d) an exact integer. The formula is specific to q=3: the magnitude equality |1+(q−1)ω| = |1−ω| = √3 holds uniquely at q=3. (7) Quantum weight enumerators: The Shor–Laflamme stabilizer and normalizer weight enumerators of the family are given in closed form. The stabilizer enumerator A_d(z) generalizes the d=3 line-incidence count to hyperplanes in PG(d−1, F₃); the normalizer enumerator B_d(z) is its F₉ MacWilliams transform; and the minimum distance d_min = 3 is recovered directly. (8) Non-standard quadratic form: The weight-mod-3 function on C_d/C_d^⊥ defines a non-degenerate quadratic form of Witt class +1 for d ∈ {3,4,5}. At d=3 this differs from the standard sum-of-squares form on F₃^7 (Witt class −1); at d=4 both forms coincide at Witt class +1. (9) Shell stratification as level sets: TVL's face, edge, and corner shells (|w|²=1, 2, 3) correspond precisely to the level sets Q₃=1, 2, 0 of the standard quadratic form on the parity-check space F₃³. (10) Polar duality and parabolic nesting: The q₃=0 sector of TVL is the polar of the corner point (1,1,1) with respect to the absolute conic. The q₃=0 line is σ-invariant. The family nesting d→d+1 corresponds to maximal parabolic subgroup actions in PSL(d+1,F₃). The paper applies the automorphism-group-action framework of Grassl and Rötteler (2013) to the ternary projective Hamming family and identifies three structural features not studied in that context: the closed-form weight enumerator, the family-wide Witt-class result, and the q=3 exceptionality identity. Five Python verification scripts with accompanying README are included as ancillary files, reproducing the computational results cited in the paper. Published in conjunction with the TVL framework archived at: 10.5281/zenodo.19682633 (Concept DOI, always resolves to latest version). Note on this record. Every computational claim in this version is reproduced from first principles by the five ancillary scripts, and the central results have each been re-derived by an independent method. The revisions reflect that standard: open characterization questions were resolved one by one, and the result shown to be overstated — the PSL-irreducibility characterization — was corrected in the open, sharpening the paper's central claim that [[13,7,3]]₃ is the unique ternary code in its family with an irreducible logical space. Version 1.0.7 is the current, self-contained version. Changelog v1.0.7 (June 2026) Self-contained version: the version-history scaffolding is removed and one result is added to Section 4.1. Version-history scaffolding removed from the paper. The version note (which documented the v1.0.5 PSL-irreducibility correction and the v1.0.6 weight-enumerator additions) is removed, and the title page no longer carries a version marker or version-note pointer; the paper now reads as a standalone work. The full revision history is retained in this changelog (below) and in the Zenodo version record.2. Section 4 — composition structure across the self-orthogonal range (Proposition 7, new). The former "General q" remark — which had incorrectly stated that L_d = C_d/C_d^⊥ is defined for general q and that the ternary d=3 code is the unique irreducible instance — is replaced by Proposition 7: L_d exists only for q ∈ {2,3} (the self-orthogonal range); in both fields it has exactly d−2 composition factors (for q=3 of dimensions [x^j](1+x+x²)^d; for q=2 the trivial module together with the exterior powers Λ^k V of the natural module); and it is irreducible exactly for (q,d) ∈ {(3,3),(2,3)} — the TVL code [[13,7,3]]₃ and the Steane code [[7,1,3]]. The q=2 structure is classical (Bardoe–Sin for all q; the exterior filtration of the elementary-abelian group algebra) and is cited, not claimed as new. The dim End_G(L_d) = 1 remark — explaining why this does not force irreducibility in defining characteristic (3 | |SL(d,F₃)|, so L_d need not be semisimple; at d=4 reducible-but-indecomposable with End_G(L_d) = F₃) — is retained as a standalone caution. A previously unnumbered remark becomes a numbered proposition (Proposition 7), so the subsequent theorems, propositions, and corollaries shift up by one — for example the closed-form weight-enumerator theorem is now Theorem 14 and the family-wide Witt-class theorem is now Theorem 19 (it was Theorem 18 in v1.0.6). All cross-references are symbolic and update automatically; the ancillary verification scripts and README are updated to the new numbers. The paper remains 19 pages and compiles with no undefined references.3. The open-questions section is streamlined to the single genuinely open item, physical realisation; the questions resolved in earlier revisions (the closed-form classical and quantum weight enumerators, the family-wide d≥4 minimum distance, general PSL irreducibility, and now the general-q module structure via Proposition 7) are presented as results in the body.4. Conclusions item 3 is extended to record the two-field characterization and the Steane instance.5. Verification scripts: a fifth ancillary script, verify_logical_both_fields.py, is added; it reproduces the Proposition 7 q=2 composition factors, the well-posedness q ∈ {2,3}, and the irreducibility criterion by an independent method (exterior filtration and short exact sequences). The four earlier scripts are unchanged.6. Title page and date updated to v1.0.7. v1.0.6 (June 2026) Completes the weight-enumerator treatment and refines the open questions. This revision adds results: subsequent theorems and propositions are renumbered upward (for example the family-wide Witt-class theorem is now Theorem 18), with all cross-references symbolic and updating automatically.1. Classical weight enumerator (Theorem 13). The closed-form weight enumerator of the family is given as the complete polynomial W_d(z), with its value at omega = e^{2 pi i/3} — the Gauss-sum value i^{d mod 2} 3^{n_d/2} — recorded as Corollary 14. The d=3 expansion is given explicitly; its coefficient of z^11 is |PSL(3,3)| = 5616.2. Quantum weight enumerators (new Section 6.4). The Shor–Laflamme stabilizer and normalizer weight enumerators of the family are given in closed form (Propositions 15 and 16). The stabilizer enumerator A_d(z) generalizes the d=3 line-incidence count of the stabilizer-enumerator proposition (Section 6.1) to hyperplanes in PG(d−1,3); the normalizer enumerator B_d(z) is its F_9 MacWilliams transform; and the minimum distance d_min = 3 is recovered directly from the pair (Corollary 17).3. Open Question 2 closed. Items 1 and 2 together close the open question on the closed-form classical and quantum weight enumerators for the family.4. Open Question 1 narrowed (general q). The general q = p^t module structure is determined by Bardoe–Sin (already cited in the paper): Frobenius-twisted composition factors, irreducible only in special cases, the prime-field case uniserial; the genuinely remaining item is a self-contained description of the logical subquotient C_d/C_d^⊥ for general q.5. Open Question 5 closed (minimum distance). The family-wide d_min = 3 is established in Ketkar, Klappenecker, Kumar, and Sarvepalli (2006), and is now also exhibit
This work explores the composition of Microsoft's 4D geometric error-correcting codes — built on the 24-cell honeycomb cellulation — into higher-dimensional logical structures targeting 24D stability. While 4D codes have demonstrated 1,000-fold error rate reduction and single-shot correction on neutral atom arrays, this work asks how these codes compose when stacked or tensored into 8D, 12D, or 24D logical architectures. We investigate the stabilizer structure under composition, whether single-shot correctability survives dimensional lifting, and the mapping of composed code geometries onto neutral atom hardware with all-to-all connectivity. This bridges the gap between demonstrated 4D fault-tolerant codes and the theoretical framework for topological codes beyond dimension 2. Update, 30 July 2026 — constructive resolution. The distance question raised here is now settled by direct construction in 10.5281/zenodo.21698294, which builds the 4D toric code from its cubical chain complex and obtains [[96,6,4]] at L=2: k=6 exactly by GF(2) rank, and distance 4 proven exhaustively over every error pattern of weight ≤4. Distance 8 is therefore not obtainable from the 4D toric construction. That bounds the 4D toric family only and does not establish that no [[96,6,8]] code exists in another family — the quantum Singleton bound permits it comfortably at these parameters. An earlier wording of this note, added and corrected on 30 July 2026, overstated the scope. That work was carried out independently, from first principles, and reaches the same conclusion. Erratum, 2026-07-31 — the novelty claim is withdrawn, and what replaces it. The deposited file states that "nobody has published on composing 4D geometric codes into higher-dimensional logical structures" and that the bridge paper "has not been written." That is false. Composing chain-complex CSS codes is the homological (tensor) product of chain complexes, and the cellular chain complex of a product complex is the tensor product of the factors', so the composition of two 4D cubic toric codes is the 8D cubic toric code — a published family, and the subject of this record's own reference #9. This was checked, not assumed: an explicitly composed 8D code and an independently built 8D cubic toric code agree at all 8 grades on shape, nonzero count, both check-weight spectra and exact GF(2) rank. The composition constructs no new code. What replaces the claim is a quantitative answer to the question the record was actually reaching for. For the balanced hypercubic toric code at middle grade, n/k = L^D exactly and independently of D — verified in 8 of 8 computed cases, with the qubit count a combinatorial count and the logical count a measured pair of GF(2) ranks, up to n = 459,270 where both ranks were measured directly. Composing therefore changes how many logical qubits sit in one block and changes nothing else. Head to head at the same distance 81, the 8D composite [[459270, 70, d ≤ 81]] and the plain 4D code [[39366, 6, d ≤ 81]] both spend 6,561 physical qubits per logical qubit, to the digit — with the 8D version paying weight-10 stabilizers where the 4D pays weight-6. Distance does not rescue it either: by Künneth the distance of a product is bounded by the minimum over grade splittings, not the product of the factors' distances, so each added dimension is a chance to lose distance — the 5D product of [[486,6,9]] at grade 1 is [[1215, 5, 3]], proved exactly. On single-shot correction: there is nothing to lift. D = 4 at q = 2 already has metachecks in both sectors (ranks 80 and 80 for [[486,6,9]]), so 8D, 12D and 24D add no sector that was not already covered — and lifting can lose it, the 5D product at grade 1 having no X-sector metachecks at all (rank d₀ = 0). On hardware: all-to-all connectivity is real but was never the binding constraint. The smallest possible balanced 24D hypercubic toric code needs 4.5 × 10¹³ physical qubits, 1.5 × 10¹⁰ times the 3,000-atom array cited above. What stands: the homological product is the correct composition operation and the framework is well-posed; composition genuinely does raise dimension and does buy more logical qubits per block (6 → 70 from 4D to 8D); the metacheck question was the right one to ask; and the reference library is accurate. Two limits on the erratum itself: all computation uses the cubic 4-torus code [[486,6,9]], not Microsoft's 24-cell honeycomb code, whose parity-check matrices were never obtained — so nothing here is a statement about that code; and no exact distance is claimed at n ≥ 2430, the 8D figures being certified upper bounds with no lower bound proved. The 1,000-fold error-rate reduction and the neutral-atom hardware results were not tested and are neither confirmed nor refuted. Full computation, code and logs: 10.5281/zenodo.20808710 and branch writeup at /home/voodoo/branch_work/18779369_composition/RESULT.md. Note: the source file QEC_Neutral_Atom_24D_Research.md itself still contains the withdrawn claim verbatim (a published file cannot be edited in place) — this erratum is the authoritative correction until a new version replaces the file text.
The NEXUS Quantum Compiler Mathematical-Space Execution and Constrained Molecular Folding Native reversible routes · quantum-sector reduction · legal molecular transformations · classical execution Driven by Dean A. Kulik · October 2026 ABSTRACT A quantum-compatible mathematical state space can be compiled and executed on ordinary classical hardware when its constraints, return paths, and observable symmetry sectors are explicitly represented. This manuscript integrates two complementary NEXUS studies without replacing either with a shorter summary. The first examines the exact native ring and E/G return machinery and audits an earlier quantum lattice-protein simulation whose eight-address mixer introduced four transitions through invalid padding states. It derives the short-time leakage coefficient 49/75, explains the distinction between finite penalties and exact subspace preservation, identifies the disconnected projected graph, and records the approximation and environmental-return requirements. The second advances to a self-avoiding honeycomb-chain compiler in which turn words construct geometry and admissible bit rewrites construct the transition graph. Global complement is an exact mirror symmetry; for a complement-stable Hamiltonian it separates the quantum space into even and odd sectors, retaining the necessary sheet sign and inverse readout. In the 12-residue HP example, 776 legal conformations form 388 mirror pairs. Classical propagation in the full Hilbert space and its independently assembled mirror-even sector agrees after reconstruction to machine precision under the reported sparse solver; the precise rounding error is implementation dependent. Local four-turn hexagon rewrites are reversible but fragment the legal graph; unrestricted pivots reconnect it while sacrificing bounded spatial support. Together these results establish a rigorous, finite compiler architecture and a precise reduction in the resources needed for symmetry-selected states. They do not establish experimentally validated molecular kinetics, a general quantum-simulation speedup, or measured low electrical power. The remaining link is an independently constrained molecular transition generator, its environmental coupling, and a resource benchmark carried out under the same input–output contract. Keywords: NEXUS; reversible routing; quantum-inspired classical simulation; parity decomposition; Hilbert-space reduction; self-avoiding walks; hydrophobic-polar models; constrained transitions; local moves; protein folding. Figure 1. The integrated compiler path: binary word → geometric legality → admissible transition graph → symmetry sectors → classical propagation. The route back to full state is explicit. PART I / THE NATIVE STATE SPACE AND WHAT “QUANTUM COMPILER” MEANS 1. Problem statement: computation before hardware The motivating hypothesis is that a sufficiently explicit mathematical relation space can execute useful quantum-style calculations on conventional, low-power hardware. In its strongest form, this would make special-purpose quantum machines unnecessary for the targeted tasks. A physically meaningful version of that hypothesis must distinguish three different propositions: an algebraic operator can be represented classically; a specified quantum evolution can be simulated faithfully; and the simulation has an advantageous cost in time, memory, or joules. The first two are demonstrated here in a finite structured family. The third remains subject to benchmarking. The Nexus program approaches problems from legal transformations and their return paths rather than from cataloged answers. Earlier One Inverter and twisted-partner-ring work constructed involutions, native addresses, temporal center reads, and odd-lane locks [1, 2]. The honeycomb extensions (§§144–146) supply a particularly instructive domain: a word is a conformation-generating route, while a molecular move is determined by geometry rather than by neighboring values in an address table [2]. Classical simulation of quantum subfamilies is established mathematical territory. Stabilizer circuits admit efficient classical simulation [6], and quantum-inspired linear algebra can dequantize some low-rank algorithms under explicit data-access assumptions [7, 8]. The point of the present work is narrower: show where the Nexus native-route and reflection machinery gives a concrete geometry-respecting Hilbert-space reduction, with complete return information and negative controls. The governing research hypothesis is stronger than an indexing engine. The compiler is proposed as a transformation architecture: a molecular sequence and surroundings determine lawful continuations, and a fold is the realized trajectory rather than a catalog match. The scientific question is whether a native, local, reversible transformation system reproduces a molecular process without placing the answer in a chosen transition matrix. Three different “one answer” statements must remain typed. A fully specified deterministic calculation has one result. A fully specified quantum experiment has a definite predicted probability distribution but may have multiple measurement outcomes. A protein may have an ensemble of conformations that changes with conditions. The route does not license substituting one for the others. For this paper, “compilation” has a testable meaning: construct a state domain, certify lawful transformations, select a representation that makes required relations visible, propagate that declared operator, and preserve an inverse or a residual route. Classical hardware is sufficient to carry out these finite algebraic steps. Whether it is efficient for an enlarging family depends on the structure of that family, not on a claim that all quantum amplitudes can be recovered from one address. 2. Native ring: partner, face, canonical address, and exact return For an n-bit word, J is bit reversal and C is bitwise complement. Define P(x)=J(x) unless x is palindromic, in which case P(x)=C(x). P²=I, P has no fixed word, and the native ring pairs addresses antipodally: PTP=T⁻¹, where T is the ring’s own successor. The inward E/G route ends at width two, retaining each branch and middle qualifier and a face bit. The complete code is n bits for an n-bit word; reconstruction is exact but not generic compression. P(x) = J(x) if J(x) ≠ x; P(x) = C(x) otherwise. The canonical address is an exact re-labeling of word space. T is a native address successor. A raw k-bit transport shift, a partner read, and T are separate operators. In particular, declaring an edge between successive catalog addresses does not establish that the corresponding conformations are molecular neighbors. Three interfaces must not be conflated. The native ring successor T is a step in canonical address order. The geometric word rewrite is a change of chain conformation. A measurement/readout R extracts a specified property of the state. In particular, T does not become a protein move simply because it is a reversible permutation. The twisted one-inverter clock and temporal reader The “One Inverter” paper derives the affine twisted rotation τ(x₀…xₙ₋₁)=x₁…xₙ₋₁¬x₀, so after k ticks the first k departing bits are returned complemented. At k=n it is global complement; at k=2n the state returns. The inward terminal reader is exactly the XOR of the two central word bits. Under τ, its temporal trace reads each adjacent difference around the cyclic word, with one known inverted crossing. τᵏ(x) = rotlₖ(x) ⊕ (2ᵏ − 1), 0 ≤ k ≤ n; τⁿ = C, τ²ⁿ = I. r(x) = xₙ/₂₋₁ ⊕ xₙ/₂ ; ⊕ₜ₌₀ⁿ⁻¹ r(τᵗ x) = 1. [even n] The n−1 independent adjacent differences plus one native face bit recover the word. The two-bit closed complement-feedback rule is τ², not a new primitive. None of this creates a physical molecule; it gives a provably executable, invertible substrate for how a local reader can obtain and return distinctions. Odd-lane locks and relational deviations For odd q and n=qs, the alternating-complement lift Λq(u)=u‖Cu‖u‖…‖u is invariant under the twisted clock and intertwines J, C, and P. A center trace of period s identifies this lock and supports exact reconstruction through the first s-bit lane. In the full q-lane state, de-staggered lane differences and one anchor preserve all n bits. τₙ Λq = Λq τₛ ; Pₙ Λq = Λq Pₛ ; dH(Λq u,Λq v) = q · dH(u,v). These differences were formerly called “defects.” They are lawful relational deviations from a selected lock—not failures of the transformation. Under common affine transport, differences rotate and preserve weight. An external input can alter them at a known boundary, but selecting an input law is not already derived by the native permutation. The native address T, the twisted clock τ, and the geometric pivot defined later remain separate typed operators. The exact E/G route has n bits for a general n-bit input. A locked multi-lane family instead requires only its independent local state and the stated lift rule; the reduction comes from a demonstrated invariant restriction, not from labeling an arbitrary large input “locked.” Which operations the embedding preserves The One Inverter temporal read is an operational return path, not just a yes/no label. For n=2h, define the cyclic adjacent differences Dᵢ=xᵢ⊕xᵢ₊₁ (indices modulo n) and the observed center trace yₜ=r(τᵗx). The twisted boundary contributes exactly one inverted crossing. Over n ticks the center presents n relations; their XOR equals one, and n−1 of them together with the retained canonical face bit reconstruct the entire original word. The E/G inward/outward route supplies a separate exact return by retained qualifiers. Neither return is compression of arbitrary n-bit words. yₜ = D₍ₕ₋₁₊ₜ₎ mod n ⊕ [t=h], ⊕ₜ₌₀ⁿ⁻¹ yₜ = 1; (y₀,…,yₙ₋₂, face) ↔ x. The two masks must not be conflated. The mirror shell lamps are gⱼ=xⱼ⊕xₙ₋₁₋ⱼ, the paired entries in x⊕J(x). The dist
This update consolidates the formal, numerical, and publication-level corrections identified after Revision 3.0 of the FEINMAN 2 project and after direct execution of its reproducibility package. The underlying proposal remains a typed directed operator-graph calculus organized through the locked 4S-11S operator-space chain. The update does not introduce a new interaction or a confirmed deviation from standard quantum mechanics or quantum electrodynamics. Its main contribution is instead evidential and methodological: the complete package was checked by exact SHA-256 verification and rerun in the frozen environment (Python 3.13.5, NumPy 2.3.5, Linux x86_64/glibc 2.41), producing STATE=DONE and TESTS=PASS. The run reproduces the Cl(0,8) eight-generator certificate, the 32x32 extended Pauli certificate, the standard-QED anomalous-frequency checksum, the TERRA/ZERRA finite-grid count, and the frozen H2/H3+ finite-basis molecular outputs. The update corrects the benchmark-contract hash to c006873e...db777, distinguishes a recovery checksum from an independent one-loop integration, replaces the ambiguous bridge limit B->I by an explicitly declared identification or isometry between Hilbert spaces, and separates verified implementation claims from open physical claims. It also records incomplete executable coverage for graph-schema rejection tests, numerical no-signalling regression, and the TERRA/ZERRA norm-residual certificate. FEYNMAN-2 is therefore supported as a reproducible formal and computational research platform, while promotion to a physical theory still requires a nonidentity operator assignment frozen before a sealed holdout and independently replicated.
WITHDRAWAL NOTICE (18 October 2026). This paper is withdrawn and should no longer be cited as a result. It is built on a lattice geometry — the 4.8.8 tiling ("circlette") and the truncated cubic honeycomb, with octagonal faces and regular-octahedron cells — that the framework retired between June and September 2026. The theorems and mechanisms tied to that geometry were withdrawn [G81, G84]. Its headline results — among them the fine-structure constant and the Planck mass — have since been withdrawn [K13, G99]; later accounts are 10.5281/zenodo.20962395 and 10.5281/zenodo.22650175. The research programme was concluded in October 2026; its review found the framework's Standard-Model content assigned rather than derived. The original description is kept below for the record. Original description (kept for the record): What if empty space is not empty — and not continuous? What if the vacuum is a crystal, built from quantum error-correcting codes, whose geometry produces the particles and forces of nature as naturally as ice produces snowflakes? This nine-part series traces a path from the measured reality of the quantum vacuum — the Casimir effect, the Lamb shift, the 10¹²¹ catastrophe — through the Standard Model's extraordinary successes and stubborn failures, to a specific, concrete proposal: an 8-qubit code on the faces of octahedral voids, self-organised into a three-dimensional honeycomb lattice, reproducing the 45 known fermions of the Standard Model from three Boolean rules and a single quantum logic gate. The series derives fundamental constants (including the fine-structure constant to 3 parts per billion) from counting faces and bridges, demonstrates spontaneous crystallisation of the lattice from unstructured qubit soups via simulated annealing, and dissolves the famous paradoxes of quantum mechanics — entanglement, wave function collapse, the double slit, Bell's theorem — into mechanical consequences of qubits propagating through a discrete geometry. Each article is self-contained and accessible to any numerate reader. Full mathematical derivations are linked as companion documents. Fourteen falsifiable predictions are stated explicitly, and every open problem is honestly catalogued. The framework may be wrong — but it is precise enough to be shown wrong, and that is what separates physics from philosophy. The title nods to Richard Feynman's "Six Easy Pieces." Feynman needed six. The octahedron needed eight. The paradoxes needed one more. Keywords For the series as a whole (use the five most relevant per article, rotating as needed): Quantum Physics, Quantum Computing, Particle Physics, Information Theory, Mathematics, Theoretical Physics, Cosmology, Science, Standard Model, Error Correction, Quantum Mechanics, Dark Matter, Dark Energy