In the Selection-Stitch Model (SSM), space is a lattice of Bell pairs that builds itself by two local rules: stitch adds a node in a triangle’s plane, and lift adds one above or below it, both at exact close-packed sites, so that every bond has the same length. From one tetrahedron, stitch generates only the face-centered cubic (FCC) lattice spanned by its edges, so FCC order is a closure property of the rules; the simulations measure the defects that growth adds. In 688 simulations of up to 1.2×106 nodes, with the bare rule, about 98% of cluster nodes four or more layers below the surface are FCC. Slabs grown on one close-packed sheet form twin domains and are 84–92% FCC; on a three-layer ABC substrate they grow as one variant. Read as a quantum state, the grown network has an entanglement entropy that counts the bonds crossing a boundary. Node parity checks with local repair turn it deterministically into a state of the FCC stabilizer code. Its distance is at most three, so it protects the lattice locally, cell by cell; checks are intact around 96% of cluster nodes three or more layers deep. The error-correcting lattice emerges from the postulate “what exists is what can persist”: only checked bonds of equal length persist, and the triangle is the smallest network whose bonds check one another.
In the Selection-Stitch Model (SSM), space is a lattice of Bell pairs that builds itself by two local rules: stitch adds a node in a triangle’s plane, and lift adds one above or below it, both at exact close-packed sites, so that every bond has the same length. From one tetrahedron, stitch generates only the face-centered cubic (FCC) lattice spanned by its edges, so FCC order is a closure property of the rules; the simulations measure the defects that growth adds. In 688 simulations of up to 1.2×106 nodes, with the bare rule, about 98% of cluster nodes four or more layers below the surface are FCC. Slabs grown on one close-packed sheet form twin domains and are 84–92% FCC; on a three-layer ABC substrate they grow as one variant. Read as a quantum state, the grown network has an entanglement entropy that counts the bonds crossing a boundary. Node parity checks with local repair turn it deterministically into a state of the FCC stabilizer code. Its distance is at most three, so it protects the lattice locally, cell by cell; checks are intact around 96% of cluster nodes three or more layers deep. The error-correcting lattice emerges from the postulate “what exists is what can persist”: only checked bonds of equal length persist, and the triangle is the smallest network whose bonds check one another.
The loophole-free Bell experiments recognized by the 2022 Nobel Prize established that entangled correlations are real, irreducible, and available across kilometers. In the Selection–Stitch Model the vacuum is a face-centered-cubic lattice grown by crystallization, carrying a stabilizer code, with spatial adjacency emergent from the network. Within the model, the natural vacuum is hypothesized to be an FCC interaction network built from entanglement bonds, whose microscopic verification dynamics produces the observed propagation speed c. A single entanglement provides no causal shortcut, only entanglement correlations — but can an FCC structure of such bonds, assembled into the model's full machinery, become one? We formulate this question without identifying entanglement with interaction. Three graphs are separated: an embedding graph, a correlation graph, and a Hamiltonian interaction graph. We prove that pre-shared Bell pairs, local operations, and unconditioned stabilizer correction cannot transmit a controllable signal; hence an entangled edge is not by itself a spacetime edge. We distinguish the necessary conditions for a signalling claim — an autonomous response with closed causal accounting — from the additional persistence, robustness, and composability conditions required to interpret a collection of dynamical edges as synthetic geometry. A minimal switchable-edge Hamiltonian makes the new assumption explicit and yields an exact influence time, while a Lieb–Robinson analysis shows that a macroscopic shortcut follows only after the interaction edge has been physically established. An FCC network is shown to provide a homogeneous coordination-12 graph and an isotropic leading-order continuum operator, but it does not evade the no-signalling obstruction. The result is conditional and experimentally sharp: ordinary entanglement predicts a null result, whereas a genuine SSM adjacency transition predicts a distance-independent dynamical response. No faster-than-light mechanism is claimed within standard quantum theory.
Abstract We present a CSS quantum error correcting code on the Face-Centered Cubic (FCC) lattice that combines surface-code-compatible K=4 connectivity with native inter-sheet logical gates between co-located CSS code blocks — a combination not previously achieved among well-studied codes. The construction has two parts. First, restricting the [[3L³, 2L³+2, 3]] FCC lattice code to a single triad sheet yields the sheet code with parameters [[L³, 2L, L]] at even L (or [[L³, L, L]] as a planar variant), uniform weight-4 stabilizers, and K=4 per-qubit connectivity. Three triad sheets share the FCC lattice geometry and can be deployed in one of three ways — monolithic 2D for small L, a three-layer stacked architecture for scalable deployment, or native 3D hardware — in each case encoding 6L logical qubits at distance L. Second, we introduce a fault-tolerant lattice surgery protocol that uses local FCC triangle measurements to implement joint Pauli measurements between logical qubits in different sheets. Each surgery operation adds O(L) two-qubit gates to the O(L³) per-round syndrome extraction cost. Under circuit-level depolarizing noise with MWPM decoding, the static memory threshold is p_th ≈ 0.63% and the surgery threshold is p_th ≈ 0.5%, both above the operating range of current quantum processors. Compared to surface code lattice surgery (also K=4, lattice surgery confined within a single patch), the sheet code provides 2L logicals per sheet at the same distance and connectivity; compared to bivariate bicycle codes (which target inter-block gates between physically separated modules at K=6 with long-range couplers), the sheet code achieves inter-sheet gates at K=4 with only short-range couplings between co-located sheets.
In the Selection–Stitch Model (SSM), the vacuum is a quantum error-correcting code, and the mass of a defect is the cost of verifying it. We ask how a verification cost becomes an energy. We let an excitation that fails checks carry a local mass equal to their cost, and define a state's verification cost as the rise in its energy when this mass is switched on. If strong checks fail everywhere outside a region, the strong-coupling form of the quantum Zeno effect makes this cost equal to the lowest mode energy of the field in that region. This energy has the form xħc/L. We read it as an instance of the SSM rule that a defect's verification rate sets its Compton frequency. Landauer's principle, which prices erasure, does not apply to such standing information. For a massless quark, only a mass gives the bag wall. A projector penalty does not, and neither does an electric potential. A wall of finite strength K acts as a hard wall moved outward by about ħ/p_K, so walls for massless particles converge faster as K grows. On the lattice, a color singlet needs a whole tetrahedral cell. With a bond-verification term h added to the code's checks λ, the code maps onto a transverse-field Ising model, and an exact spectral check confirms the mapping. Quantum Monte Carlo on up to 2048 nodes finds free colors below h/λ ≈ 0.09 and a linear potential above 0.11, with a string tension that holds as the box grows. A dark-matter defect in an octahedral void fails twelve checks and shows no string cost, and the calculation gives it no baryon-like cavity energy. A term that moves failed checks turns the code into a field. In one dimension it is exactly a Majorana field whose mass is the check cost minus a balance value. In three dimensions, quantum Monte Carlo finds a scalar analogue, a bosonic field that becomes massless at the confinement transition. A coupling of the code to a fermion field is not derived. For the proton, the measured charge radius fixes the size of its 13-site verification region. In the lowest state of three confined quarks, with the wall fixed by the lattice, the mass is 1059 MeV, 2.4% below the mean of the nucleon and Δ masses and nearly independent of the cavity's shape. Motion of the cluster can only lower it. A projection onto zero total momentum gives the opposite limit, a wall that moves freely with the quarks.
A single stabilizer code on a face-centered-cubic (FCC) vacuum, with a quark a node trapped in a tetrahedral void, protects both the conserved quantities of baryonic matter and its color, and we develop both sectors at one standard of rigor, every quantitative claim reproduced by an accompanying script. The [[192,130,3]] CSS code with weight-twelve vertex and octahedral-void stabilizers is the common origin. In the external sector it makes the defect's winding charge a Gauss-law super-selection invariant, yielding the baryon ladder Δ⁻, n, p, Δ⁺⁺ with charges Q = −1 + W; the void orientation, by contrast, is not protected (a negative result we record); the migrating defect obeys E = γE_rest; and migration is a code-corrected string. In the internal sector the same code protects color. A color qutrit emerges as the symmetric sector of the cage kinetic term T = (J₃ − I₃) ⊗ J₂; the three skew-pair matchings carry an S₃ Weyl symmetry and a rank-two torus, and among the rank-two simple Lie algebras both the Weyl order and the existence of a three-dimensional representation independently select A₂ ≅ su(3); anchor-induced color/dark leakage is a weight-one correctable error. The FCC complex is then gauge-ready — its minimal plaquettes are triangles, each carrying one bond of every color — and supports a genuine ℤ₃ triality code, whose vertex Gauss law enforces q₀ + q₁ + q₂ ≡ 0 (mod 3) and which subsumes the octahedral baryon operator, so one code carries both sectors at the triality level; the non-abelian SU(3) Gauss law at a vertex has a 513-dimensional gauge-invariant space gated by triality, and the triangular plaquette Hamiltonian is gauge-invariant, so a Kogut–Susskind theory is well-posed. Building the color connection from the vacuum's processes gives a two-part dynamical result: the spatial channels transport color only diagonally, an N(T) = T ⋊ S₃ connection short of SU(3) by the root generators because the colors are bond-disjoint; but the temporal link, the cage time evolution with off-diagonal generator J₃ − I₃, supplies the missing direction and with the torus closes the full eight-dimensional su(3). Leading strong-coupling confinement holds on the triangular plaquettes with a positive string tension, and the single-plaquette spectrum has the correct 4/3 mass gap. The color algebra, both protected sectors, and the well-posed gauge theory are thus attained on one code; the continuum dynamics — confinement in the continuum limit, the running coupling, Λ_QCD — are not addressed and remain open.
Abstract The [[3𝐿 3 , 2𝐿 3 +2, 3]] CSS code on the Face-Centered Cubic (FCC) lattice achieves 67.7% encoding rate with weight-12 stabilizers, but its distance is capped at 𝑑 = 3 by weight-3 logical operators sitting at tetrahedral interstitial voids. These logicals carry a geometric fingerprint—one error per triad sheet, all three converging at a known void—that makes them detectable by a flag ancilla measuring the three-body parity 𝑍 𝑒𝑎 𝑍 𝑒𝑏 𝑍 𝑒𝑐 . The weight-3 logical flips this parity from +1 to −1; the stabilizer syndrome stays silent, but the flag sees it. Running 𝑅 independent flag rounds per syndrome cycle pushes the logical failure rate to 𝑝 3+𝑅 , so the effective distance is simply 𝑑eff = 3+𝑅—adjustable at runtime, with no changes to the code or its logical count. At 𝑅 = 4 the FCC+flags code achieves the same 𝑝 7 distance scaling as a distance-7 surface code, with a prefactor 𝑁void = 256 versus ∼ 10 for the surface code—the cost of encoding 130 logical qubits at 29.0% rate versus 1 logical qubit at 1.0%. An adaptive scheduling protocol cuts the flag overhead to under 0.1% of measurement cycles at realistic noise levels.
The Face-Centered Cubic (FCC) lattice supports two CSS quantum error correction codes: the full code [[3L^3, 2L^3+2, 3]] with K=12 connectivity, and the sheet code [[L^3, 2L, L]] obtained by restricting to one of three triad sheets. If the FCC lattice is identified with Planck-scale spacetime geometry, the Bekenstein-Hawking entropy bound S <= A/(4l_P^2) constrains the number of independent degrees of freedom (logical qubits) in any region. We show that the full FCC code violates this bound at every lattice size (k ~ L^3, volume scaling), while the sheet code satisfies it for L >= 4 (k ~ L, sub-area scaling). At L=4, the three-sheet code utilizes a fraction ln 2 ≈ 69% of the holographic capacity, the maximum at any admissible lattice size. The holographic principle thus acts as a code selection rule on the FCC lattice, uniquely selecting the sheet decomposition in which the 3D lattice reduces to 3L independent 2D toric codes as the physically admissible encoding.