Framework
Shadow Theory begins from a direct claim: the reality we experience is not source reality itself. It is not a simulation hypothesis, and not a Matrix-style illusion. It is a structured shadow of a deeper reality, and physics is the study of what that shadow reveals, what it hides, and what can be reconstructed from it.
The six-paper framework builds the mathematics behind that claim step by step. It explains why observation is not the same thing as underlying realization, when lost structure matters, when completion is possible, and how to state theoretical claims without mistaking the shadow for the source.
Exact readout is not realization equivalence.
Loss obstructs only under certified active closure failure.
Canonical completion is certified initiality — conditional, not automatic.
Completion becomes a public artifact only through statused down-compilation.
Claims are licensed by route, status, residue, and audit calculus.
The stack composes into a scoped closure-fixed law-packet discipline.
A macrostate summarizes a microstate; a measurement outcome summarizes a preparation. Paper 1 proves that even an exact readout presentation need not be realization-structure equivalent to what it summarizes — and pins down precisely when the obstruction applies, including explicit exception classes.
Paper 1 details →It is a recurring error to treat any readout loss as an automatic problem. Paper 2 proves the exact additional condition needed: a certified, active, uncleared failure of an essential public closure slot. Without that certificate, no obstruction claim is licensed.
Paper 2 details →When a completion need is certified, Paper 3 defines when a response is canonical: exactly when it is a certified initial object in the public admissible completion category. Candidate completions, branch completions, and failed proposals remain noncanonical without that certificate.
Paper 3 details →A canonical completion object is not yet a public artifact. Paper 4 defines the down-compiler: total, deterministic, route-legal, gate-cleared, and residue-aware, emitting exactly one statused output — including declared failure and residue outputs when gates do not clear.
Paper 4 details →Paper 5 supplies the runtime calculus: what routes exist, what statuses and residues mean, which claims each output can license, and which promotions are forbidden. Its claim-cap theorems bound every emitted output by route, status, residue, audit outcomes, and obligations.
Paper 5 details →Paper 6 assembles the five upstream interfaces into a single typed synthesis object with a graph-theoretic claim-promotion discipline, and proves the Scoped Shadow Fixed-Point Law-Packet Theorem — the precise, bounded sense in which the stack culminates in a closure-fixed schema.
Paper 6 details →The framework's terms are typed and disciplined; these are their public readings.
This site's historical name comes from this expression. Inside Shadow Theory it has a precise and deliberately modest role: it is a scoped closure-fixed law-packet schema in the synthesis layer. A typed operator chain acts on scoped law packets, and a fixed point is licensed only as a residue-visible, status-certified, claim-bounded closure of that scoped packet.
It is not source-level equality, not empirical validation, not a solved theory of everything, and not a Tier-1 artifact without down-compilation. Shadow Theory culminates in a way of organizing which law packets, closure conditions, runtime statuses, and public artifacts are licensed by the six-paper stack — not in a slogan.