A finite rule with unbounded evolution.
Can physical reality be modeled as a closed, exact, deterministic system of integers? Not approximated by them. Made of them.
One algebraic axiom is assumed. A discrete architecture is declared separately. Every physical reading must be derived, scoped, or left open.
What the system is and what we read off it are two different things.
no output returns to the autonomous update
A typed partial interface, ordered as matter, then geometry, then clock. Its outputs never feed back into U. declared
Its registered reading legs form a dictionary, not a completeness theorem.[D]
One axiom may admit more than one typed physical reading. Completeness means classifying every output-relevant admitted alternative, not forcing the family to contain one member.
No total or physically complete reading family is claimed. Global decoder uniqueness is not a program requirement. Scoped uniqueness and nonuniqueness questions remain local to their declared classes. The specific open obligations are tracked in the Frontier.
The kernel identities are proved at their declared scope. The decoder is the work, and it is where the program can fail. Every claim on this site carries its own status.
j is the twist unit, the primitive fifth root of unity: j⁵ = 1. Four additions per step, zero multiplications, exact integer arithmetic, zero drift. Kernel reference.
Program rule: a successful physical description may be a classified family of typed readings rather than one unique decoder. Every output-relevant alternative, overlap and equivalence must be explicit, and no reading may be selected after seeing the result it is used to explain. The declared architecture contains no fitted dimensionless parameter; its one SI calibration anchor is the electron mass.
The public ledger commits, each claim with its label:
Proof, exact computation and experiment decide.
No summary here is stronger than its row in the Canon. Read the head directly: canon/CANON.md, raw Markdown at the repository head.