constants collapse to their shortest name — the address is the value, the name is the label
Theorem.constants collapse to their shortest name — the address is the value, the name is the label.
Proof.naming gravity on values (user, 2026-07-24: "constants collapse to shorter names as well as any other longer name"): a value has ONE payload and names are addresses, so addressing by the VALUE (toUuid(value), name-independent) makes every name of a constant collide to one slot — the names are aliases, not separate things. Among them the SHORTEST is the attractor and the longer ones collapse to it (methodGravity), one rule for constants and any longer identifier alike: the shortest name that computes the value is canonical, the address is the value/meaning. Composes the crack law (a constant must be canonical/derived/ledgered — its collapsed shortest name is that one accepted form). It dedups aliases, never distinct values (a different value gets a different address). Structural, not physical. HARMONY ≠ TRUTH.
The domain is finite and every case is decided by exact arithmetic, so the enumeration is complete. ∎
src/pair/enforcement/gates/strict/scan/index.ts#constantsCollapseToShortestName
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
"constants collapse to their shortest name — the address is the value, the name is the label" 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 constantsCollapseToShortestName.
- 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 (constantsCollapseToShortestName @ src/pair/enforcement/gates/strict/scan) 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 constantsCollapseToShortestName (src/pair/enforcement/gates/strict/scan/index.ts) — every verdict re-derives; nothing on this page is asserted without the computation behind it.