Bertrand's postulate: for every n ≥ 1 there is a prime p with n < p ≤ 2n — verified for all n from 1 to 500. A witness is Bertrand's own chain of primes, each less than twice the previous: 2, 3, 5, 7, 13, 23, 43, 83, 163, 317, 631, 1259, so consecutive members overlap and cover every interval up to 2·631. Verified by exhaustive search
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 ·
bertrands_postulate - content-address (receipt) ·
106fcc1d-7995-82cc-94a1-649c4e7e6e0c - 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.