Q-PRISM is the home of the proofs: the 256↔1024 level-transcode round-trip lives here (53023b6 — 5 bytes ⇄ 4 symbols at lcm(8,10)=40 bits, sha256-identical, Rust==Python; MEASURED), alongside the calibrated prism sim (79e8d63, de00aca). The law: every prism/comb operation is a bijection, so H(f(X)) = H(X) — information is re-related with 0 loss, never compressed below Shannon's bound. Scope discipline: only this 256↔1024 rung is MEASURED; the 43+ level ladder is CANON frame; any further rung is UNVERIFIED until its own round-trip proof. E=0 — this index describes, nothing fires.
Estate satellites carrying the law (branch acer/prism-comb-0loss-2026-07-01):
- N-Nest
9a0bac3— the integrity dual: verification = recomputation = the inverse map, at every nesting level. - Waves & cascades
23e56f2— one fabric, two directions: forward comb (avoid collisions) / backward prism (cause them, many→1 search). - Reductions
d8f2ff3— the boundary: referential cubes = infinite ADDRESSING capacity, not lossless infinite compression. - Cubes / after-100B absorption
b8addc9— content-addressed store:H(content | store) = 0; a handle is a coordinate, not a counter. - Algorithms of Asolaria
8f73e7e— CRT prime lanes (D# = prime(n)³): separate forward for isolation, recombine exactly backward.