Skip to content
Shadow Theory

Paper 4 · Section 2Identification

Two realizations of one complete service

The five-register benchmark, the nonlocal recoding, and the realization contracts behind the inherited two-versus-one SPC-2 assignment.

Section 3 of 11

2 Inherited benchmark and conditional assignment

On x=(a0,a1,a2,j0,j1)∈{0,1}5x=(a_0,a_1,a_2,j_0,j_1)\in\B^5, with little-endian indexing, retain

F(x)=(a1,a2,a0⊕a1,¬j1,j0),E(x)=(a0⊕j0,a1,a2,j0⊕a1,j1),E−1(z)=(z0⊕z3⊕z1,z1,z2,z3⊕z1,z4),G(z)=(z1⊕¬z4,z2,z0⊕z3,z2⊕¬z4,z3⊕z1).\begin{align}F(x)&=(a_1,a_2,a_0\oplus a_1,\neg j_1,j_0),\tag{1}\\ E(x)&=(a_0\oplus j_0,a_1,a_2,j_0\oplus a_1,j_1),\tag{2}\\ E^{-1}(z)&=(z_0\oplus z_3\oplus z_1,z_1,z_2,z_3\oplus z_1,z_4),\tag{3}\\ G(z)&=(z_1\oplus\neg z_4,z_2,z_0\oplus z_3,z_2\oplus\neg z_4,z_3\oplus z_1). \tag{4}\end{align}

Thus EF=GEEF=GE. All states and both inverse identities are checked exactly. The original public state is xx; the recoded circuit reports E−1(z)E^{-1}(z). Matching whole-state loads and enable operations preserve complete decoded traces, not merely one trajectory.

Under the inherited register doctrine, the original system has closed recurrent supports {a0,a1,a2}\{a_0,a_1,a_2\} and {j0,j1}\{j_0,j_1\}, with 8 and 4 predictive classes. All ten admissible connected groupings agree. The recoded essential graph is strongly connected; all 38 admissible groupings yield one five-register support with 32 classes. These are inherited conditional results, not observations of subjects [5, Section 4, P4].

Let ribr_i^b denote an elementary overwrite of coordinate ii. FRD-2 P2 characterizes bijections transporting these operations as signed permutations, and P3 transports the complete SPC-2 assignment when clocks, resources, records, preparations, and provenance are also matched [5, Section 3.2, P2–P3]. But EE does not transport this local algebra: changing a1a_1 can change both z1z_1 and z3z_3. The new work therefore seeks evidence for a chart rather than another covariance assertion.

Imported assignment contract.

The finite specialization fixes synchronous Boolean storage, the service tick and permitted preparations, essential-dependence routes, full successor-state records, resources, actual state, and operative provenance. It enumerates the doctrine's connected groupings and tests closure, executable covering return, predictive nontriviality, and certification; uncertified alternatives cannot simply be discarded when asserting whole-family agreement [4, Sections 2–4, FRD-01–FRD-04]. P3 transports the assignment only with those remaining fields matched. The response certificate below does not supply them. The accompanying dependency index locates the full hypotheses, extractor, and preserved failures [20].

The signed control is

H(x)=(¬j1,j0,¬a2,a1,a0),FH=HFH−1.H(x)=(\neg j_1,j_0,\neg a_2,a_1,a_0),\qquad F_H=HFH^{-1}.(5)

CCI-1's official native-grain comparison selected IIT-2023 supports {a1,a2}\{a_1,a_2\} and {j0,j1}\{j_0,j_1\}, each with φs=2\varphi_s=2, versus all five registers after EE, again with φs=2\varphi_s=2. Its complete 2026 preset selected no positive complexes [6, Sections 2–4]. The original support disagreement is therefore already more precise than a difference of counts.