
forcing the circuit to scale strictly with the defect’s topological footprint. For the FCC cluster: a
1D footprint (single edge) engages E
s
= 1 edge and C
s
= 1 constraint; a 3D footprint engages the
full cuboctahedral cluster with E
s
= 36, C
s
= f
0
+ f
2
= 13 + 38 = 51.
Axiom 2 (Sector Completeness). The active sub-matrix of stabilizer checks must fully cover all
stabilizers capable of detecting the defect.
Physical derivation. This is the standard fault-tolerance requirement of Shor [11] and Chao–
Reichardt [12]. If any stabilizer capable of detecting the defect is omitted, hook errors introduced
by the extraction circuit may propagate through the omitted stabilizer and go undetected, breaking
fault tolerance. A nucleon spanning the full 3-sheet cluster must trigger all V +F = 51 constraints;
it cannot selectively ignore the 6 square faces (F
□
) to save cost, because those faces can detect
hook errors from the colour-flux tubes. The full verification cost is therefore C
p
= E
s
× C
s
=
36 × 51 = 1836.
Axiom 3 (Holonomy Constraint). A topologically stable excitation must have self-consistent
gauge holonomy: the boundary loop of its verification circuit closes without residue. The holonomy
class is a Z
2
charge. Odd holonomy (Z
e
= −1) assigns parity bit p = 1; even holonomy (Z
e
= +1)
assigns parity bit p = 0.
Physical derivation. In lattice gauge theory [13, 14], gauge invariance requires ∇ ·E = ρ at every
vertex (Gauss’s law). The gauge holonomy around a defect’s boundary loop is the product of
link variables on that loop; it must equal the charge enclosed. The proton’s verification circuit
encloses non-trivial colour charge: its boundary loop has odd holonomy, assigning parity bit
p
p
= 1. The neutron’s boundary is electrically neutral and colour-singlet: its boundary loop closes
evenly, assigning p
n
= 0. These assignments follow from the cuboctahedral defect classification in
Part I [1]; they are geometric facts about the FCC code, not empirical inputs.
Axiom 4 (Boundary Closure for Deduplication). Two nucleons can share a stabilizer boundary
— and thereby reduce their combined verification cost below the sum of the parts — if and only
if their combined boundary parity is non-trivial: p
12
= p
1
⊕ p
2
= 1. When p
12
= 0, the shared
boundary registers as vacuum: no stabilizers are shared, no verification cost is saved.
Physical derivation. This extends the Boundary Closure axiom of Part I (which requires a closed
gauge boundary for confinement) to the two-nucleon system. XOR is the correct composition
law because each parity bit is a Z
2
charge; composite charges add modulo 2 under the gauge
group. A shared boundary with p
12
= 1 (non-trivial) satisfies Gauss’s law for the composite
system: the combined colour flux is non-vanishing and the boundary persists, allowing joint
syndrome extraction and verification cost deduplication. A shared boundary with p
12
= 0 (trivial)
has vanishing combined flux; it is indistinguishable from the vacuum code state and dissolves
immediately.
Axiom 3 assigns p
p
= 1 and p
n
= 0 from the holonomy of each defect’s boundary loop — a
geometric consequence of the FCC code, not an observation about the nuclear force. Axiom 4
then classifies all nucleon pairs:
• p-n: p
12
= 1 ⊕ 0 = 1 (non-trivial) ⇒ boundary survives ⇒ deduplication ⇒ binding.
• p-p: p
12
= 1 ⊕ 1 = 0 (trivial) ⇒ boundary dissolves ⇒ no deduplication ⇒ no binding.
• n-n: p
12
= 0 ⊕ 0 = 0 (trivial) ⇒ boundary dissolves ⇒ no deduplication ⇒ no binding.
This is the parity theorem: a theorem of the CSS code structure, not an empirical observation
about the nuclear force.
2.3 The five Weizsäcker terms from FCC geometry
The five SEMF terms emerge from the Max-Cut structure and the FCC cluster topology:
Volume. Interior FCC nodes have coordination K = 12, so each interior nucleon contributes
∼ Kα/2 to the Max-Cut. The volume energy scales as a
v
A, consistent with any lattice model.
3