the imprint codec is an injective lossless encoding with an exact 115-bit capacity: distinct binary messages of length ≤ CAPACITY map to distinct uuids and read back exactly (readImprint(imprint(m)) = m), so the encoding loses nothing; the capacity is exactly 128 − 6 reserved − 7 length-header = 115 bits, and a 116-bit message is rejected — the boundary is exact, not approximate. A bounded codec, integrity not secrecy. Decidable by exhaustion up to the bound
ab3e7c0b-4a21-8c31-a6a2-23155325ebb2Type anything and watch its uuidna recompute — deterministic, reproducible by anyone, no key. A theorem is alive when you interact with it. A content-address proves integrity, not truth. 0/7.
- theorem key ·
the_imprint_codec_is_injective_with_an_exact_115_bit_capacity - content-address (receipt) ·
9ce1e391-865f-8072-9d97-fdc1f1996354 - status · decidable, re-verified on every build — recomputes from
src/
The 7D rosetta-ray vortex is plotted from this theorem's microdata (its content-address); the slowly rotating hero background is computed from its seven surrounding theorems' hues — the mesh, seen locally, in analog rotation of dimensions. Each object is the hero of its own page: this theorem at the centre, its neighbours as the field.
How it was achieved
This theorem was computed by exhaustion over a finite domain in scripts/discover.ts — a test: () => boolean that runs to completion, holding by full enumeration. It was gate-checked (its name and content hold the honesty floor — no over-reach), receipted and chained append-only, and it is re-verified on every build: if it ever stopped holding, the build would fail, not production. That is what achieved means here — not asserted, but recomputable.
One leaf of the chained ledger: all theorems · computed results · the guide · the source formula. The repo and the site cross-link both ways — this hero page points back to the formula that recomputes it. Verify by cloning and running npm run lean-claims. A content-address proves integrity, not truth. entails → 0/7.