PRISM
PRISM · v1.2.0
Parity-Reduced Invariant Symmetry Model
What can a few parity values tell us about a much larger binary state? PRISM studies exact reductions in a family of finite update systems, with the assumptions and limits made explicit.
PDF · v1.2.0 · Manuscript snapshot: November 18, 2026
One finite example · n = 3 · fixed common shift
Scope and formal verification
PRISM investigates a family of coupled affine systems over 𝔽₂. For every odd node size and known fixed common shift, the two initial parity bits determine every state from the second update onward. The first update equates the two nodes' internal even-parity components; the second cancels them modulo 2. On multi-node graphs, parities evolve under A while internal coordinates evolve under I + A, with fixed shifts contributing translations. The construction connects this exact four-state factor with the antipodal classes of the binary hypercube. A comparison with general projectors delineates which properties follow specifically from the parity choice. For the central identities, the manuscript documents the corresponding Lean 4 proofs.
The formal results establish consequences of explicit mathematical assumptions. They do not establish a physical interpretation.
Inside PRISM
A small rule. A precise construction.
PRISM starts with a small rule on binary states: flip every bit when the total parity is odd. The work asks what this rule preserves, what changes when systems are coupled, and when a few parity values determine a later state.
Two ways to read
The mathematical account (PDF) ↗Definitions, assumptions and proofs in the current manuscript.
The PDF and Lean sources (ZIP)The same manuscript, formal sources and recorded build evidence for closer review.
Release provenance and SHA-256 hashesPRISM media
Visual and recorded introductions to PRISM.