Context
Anonymous overlap types can all agree while the cards still fail to share one coherent naming. The smallest computed witness converts that mismatch into an equivariant matching defect.
Proof or evidence
Every synchronization has 4,096 candidate row namings. All 4,096 are coherent for each of the six synchronizations, and none is coherent for any of the twelve synchronizations.
Verification notes
An independent implementation reconstructed all 18 type-slot synchronizations, all 73,728 candidate row namings, the two symmetry orbits, all 864 S2 x S4 equivariance actions, and the 52-graph marked-orbit control through order five.
Limitations
- The theorem concerns the declared type-slot quotient, not the full reconstruction conjecture.