Cayley formula — the number of labeled trees on n nodes is n^(n−2), by the Prüfer bijection: every sequence of length n−2 over n labels decodes to a distinct labeled tree and re-encodes back exactly, a bijection, so the trees number n^(n−2). Verified constructively for n up to 6 (1, 3, 16, 125, 1296), each sequence round-tripped through decode and encode. Decidable
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 ·
cayley_formula_labeled_trees_prufer - content-address (receipt) ·
05d4c66b-81cc-83b7-ab7e-daaf8f196d49 - 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.