Governance constants are theorems
Theorem.Governance constants are theorems.
Proof.every gate threshold DERIVES from a named structure, computed not typed. The flagship: the line ceiling IS the 18th Fibonacci number F(18)=2584=fibonacci(18) (claimed, replacing the derivationless prime 2579 it was hand-ratcheted to). The rest fall out too — file ceiling 2^16, component closure 2^6=4³=8², subfolder cap 2^3=bāguà (powers of two), census bands 55+34+21 = F(10)+F(9)+F(8) (Fibonacci, one octave down). The axioms-become-theorems program turned on the enforcement machinery itself: a threshold with no derivation is a crack.
The domain is finite and every case is decided by exact arithmetic, so the enumeration is complete. ∎
src/earth/architecture/index.ts#governanceConstantsAreTheorems
1 · Classification
finite-complete — self-contained computation, no external lean
2 · Provenance
Documented theorem re-derived by exhaustive computation (humanityNovel=false); first-in-this-registry is the only sense of discovered.
Acknowledgment
"Governance constants are theorems" is a re-derivation, acknowledged to documented mathematics — the original proof is the prior art this re-derivation acknowledges; not new to humanity — the contribution is the reproducible computation governanceConstantsAreTheorems.
- Prior art
- documented mathematics — the original proof is the prior art this re-derivation acknowledges
- Novelty
- not new to humanity — a re-derivation (humanityNovel = false)
- Contribution
- a reproducible computation (governanceConstantsAreTheorems @ src/earth/architecture) that re-derives the result at zero tokens — the contribution is the verifiable recomputation, NOT the theorem
3 · Reproducibility
Recompute from source: npm run theorems:verify recomputes governanceConstantsAreTheorems (src/earth/architecture/index.ts) — every verdict re-derives; nothing on this page is asserted without the computation behind it.