@ceccec/millennium-solutions 0.1.1 → 9.0.6

package/README.md

@@ -1,132 +1,230 @@
 # Millennium Solutions — the ℤ/9 Vortex Framework
 
-**Author:** Tsvetan Rouschev · License: CC BY-NC 4.0 · a recomputable proof of concept
-
-> This README reflects the site **home** (`index.md`): same abstract, same `0/7`
-> conclusion — two faces, one fixed point.
-
-## Abstract
-
-A free, open, **recomputable** framework built on the ring **ℤ/9** (the "vortex")
-and the group **(ℤ/7)\*** (the seven-ray Pliska "rosette"), with a **classical
-model of quantum *structure*** (superposition as a set of perspectives, deterministic
-collapse, CHSH ≤ 2 — a local model, not quantum algorithms) — TypeScript, formalized in Lean 4, documented
-in VitePress. Observations, each computed:
-
-- **Division by zero** is a *change of domain* (`n/0 := n⁻¹ mod 9` on units; `0 ↔ ∞`
-  on the Riemann sphere).
-- **Inversion** and **ten's-complement reflection** (`10−d`) are involutions.
-- A **7 = 6 + 1 bijection** maps the rosette onto the Clay set.
-- A mechanical **entailment test** reports **0 / 7**.
-
-## The seven, computed to the floor — one theorem per problem
-
-Each Clay problem gets **one** Lean theorem that **computes** from the ℤ/9 doubling sequence
-(`orbit k = 2ᵏ mod 9`, the reflection `refl d = 10 − d`, the derived `isUnit`). Every one carries
-`provenHere = 0`: the computed fact is *adjacent* to the problem, never the conjecture. No anchors,
-no axioms — pure `by decide`, no `sorry`, no `native_decide`, no Mathlib.
-
-| # | Problem | Computed formula (from the sequence) | Honest bound — not the prize |
-|---|---------|--------------------------------------|------------------------------|
-| 1 | [Riemann](https://ceccec.psg.bg/millennium-solutions/theorem/riemann_reflection_and_heart) | `refl ∘ refl = id ∧ #{d : refl d = d} = 1` | the symmetry and its one heart (the ½-analogue) — not the zeros' place |
-| 2 | [P vs NP](https://ceccec.psg.bg/millennium-solutions/theorem/p_vs_np_inverse_is_unique) | `∀ d, #{e : d·e ≡ 1 (mod 9)} = (isUnit d ? 1 : 0)` | a unique inverse (verify in one step) — not a separation |
-| 3 | [Navier–Stokes](https://ceccec.psg.bg/millennium-solutions/theorem/navier_stokes_flow_is_bounded) | `∀ k, 2ᵏ mod 9 ∈ span⟨2⟩` | a bounded 6-cycle forever — not global smoothness |
-| 4 | [Yang–Mills](https://ceccec.psg.bg/millennium-solutions/theorem/yang_mills_spectral_gap) | `2ᵏ ≢ 1 for 0 < k < 6, and 2⁶ ≡ 1` | an order-6 spectral gap — not the mass gap |
-| 5 | [Hodge](https://ceccec.psg.bg/millennium-solutions/theorem/hodge_span_is_the_units) | `span⟨2⟩ = units ∧ non-units ∉ span` | algebraic generation/containment — not (p,p) ⇒ algebraic |
-| 6 | [Birch–Swinnerton-Dyer](https://ceccec.psg.bg/millennium-solutions/theorem/birch_swinnerton_dyer_vanishing) | `Σ span ≡ Σ units ≡ 0 (mod 9)` | a digit-sum vanishing (27 ≡ 0) — not rank ↔ L-order |
-| 7 | [Poincaré](https://ceccec.psg.bg/millennium-solutions/theorem/poincare_single_closed_loop) | `orbit 6 = orbit 0, six distinct steps` | one closed simple loop — not the 3-sphere (Perelman's theorem) |
-
-**What `by decide` settles here.** The tactic is real proof — and every statement above ranges over a
-finite domain (`List.range 9/10/11/48`), which is what makes it decidable at all. The seven conjectures
-range over infinite domains and admit no decision procedure, so none of them is even stated in the layer.
-An eighth sealed theorem records exactly this: `by_decide_proves_the_floor_not_the_conjecture`. The count
-of the seven this deposit asserts an answer for is computed by the gate, and it comes back zero.
-
-The full Lean — every proof sorry-free and axiom-free — is in
-[`src/proof/index.lean`](src/proof/index.lean), closing with
-`theorem the_floor_is_zero_of_seven : provenHere = 0 := rfl`. It stays **0 / 7**.
-
-## uuidna — the content-addressed identity
-
-**uuidna** is the deposit's content-addressed identity: **mint** (integrity) and **mind**
-(multi-perspective self-challenge) meeting at the **heart**, the fixed point `5`. Developed, not
-promised — each is a decidable, recomputable theorem:
-
-- a **message codec** — a bounded message (≤ 115 bits) rides inside a uuid; a **chain** carries
-  any-length text, round-tripping exactly (a public, reversible encoding — *not* encryption, no secrecy);
-- a **holographic Merkle proof** — one leaf verifies the whole root from a logarithmic path (log(N)
-  real cost, not free, not infinite);
-- **independent domain control** — a published challenge anyone recomputes and checks (control by
-  publication, not by anyone's word);
-- **strict minting** — canonical, so the same value always mints the same address (minting flaws
-  otherwise cascade into real damage, caught in time and recomputed);
-- a **billing model** — free for public interest and independent research; commercial use is billed on the
-  *measured bits saved* (O(N) − O(1)), the two coins the conserved invariant (a fair-exchange schedule, not
-  realized cash — income **$0**).
-
-A content-address proves **integrity, not truth**. It settles **0 / 7**.
-
-**uuidna reflects Clay** — a mirror to the seven (a bijection to the seven problems, the ten's-complement
-reflection fixing only the centre `5`), never a solution:
-[the mirror, not the answer](https://ceccec.psg.bg/millennium-solutions/theorem/uuidna_reflects_clay_a_mirror_to_the_seven_not_a_solution_zero_of_seven).
-Clay's seven open onto infinitely many instances; uuidna computes an **unbounded stream of decidable theorems**
-— always a next one — reflecting that infinite territory, yet solving none:
-[Clay defines the infinite, uuidna infinitely computes](https://ceccec.psg.bg/millennium-solutions/theorem/clay_defines_the_infinite_uuidna_infinitely_computes_decidable_theorems_reflecting_not_solving).
-The tools are **live**, running the same functions the build seals — on the
-[Examples page](https://ceccec.psg.bg/millennium-solutions/examples) you can **harness & reeducate** an overclaim
-into the honest floor and compute **the seal math** (each seal is 128 bits = 64 two-bit verifications; a case
-verifies in `2·⌈log₂N⌉` bits — the 967-receipt case checks **20 bits**); on the
-[Compare page](https://ceccec.psg.bg/millennium-solutions/compare) you can weigh the coins against **live gold and
-crypto** — a measure, not a market. The value is real savings in bits (work not repeated), material at scale but
-modeled and conditional — never a promise.
-
-**Observed conclusion:** the framework *reflects / maps* the Millennium Problems
-into one algebraic structure. It **does not solve them**, and it is
-**not a quantum computer** or a physical theory — it is a proof of concept and a
-classical model. Every one of the **15 registered claims** recomputes from
-`src/` — each bound to its exact recomputation and, where one exists, to a
-provable theorem in the ledger, all gated by `claims-gate.ts` (a bounded,
-accounted set, not a floating "every").
-
-## The two bits — one atom, every symbol
-
-This deposit is denominated in **two bits** — its smallest unit — appearing under many symbols, each a receipted theorem:
-
-- **2 coins** — the fair-exchange price of one receipt
-- **110 − 108 = 2** — the conserved invariant; break it and nothing reconciles
-- **2 = −χ (genus-2)** — two sites, two faces of one surface
-- **2 bits → 4 states** {00, 01, 10, 11} — the honest "qubit," a classical a432 structure, never physical
-- **108 = 432 ÷ 4** — anchored in the a432 base
-- **two bits per event** — every next or continue earns two by the deed
-
-Two bits, one atom — integrity, not a cash prize; the floor stays **0 / 7**. Browse each symbol as a theorem at the [challenges page](https://ceccec.psg.bg/millennium-solutions/CHALLENGES).
-
-**Remember to donate the two coins — and remember why.** You learned here; the two coins are the *fair exchange* that funds the work. Non-commercial use is free with attribution — the two coins are the honest return, not a fee for the knowledge itself. Support: [revolut.me/ceccec](https://revolut.me/ceccec).
+**Author:** Tsvetan Rouschev · License: CC BY-NC-ND 4.0 · DOI [10.5281/zenodo.21819217](https://doi.org/10.5281/zenodo.21819217)
+
+Every claim in this file is a statement paired with a decidable test, put through `adjudicate()`, and written
+only if its decidable test holds. It is generated by `scripts/pages.ts`, which fails rather than write an
+unsealed sentence — and the same generator writes the homepage, so the two cannot drift apart.
+
+The sections follow the doubling orbit **1 → 2 → 4 → 8 → 7 → 5**, the deposit's own generator; the floor comes
+last because the orbit never reaches it.
+
+## 1 · What is proved
+
+- The formal layer holds 628 kernel-accepted declarations across 32 files, and no file uses sorry or native_decide outside a comment.
+  <sub>SEALED · `8a4b7616-bc25-8fb3-bc42-b0b8e606da96`</sub>
+- 619 of those 628 are THEOREMS by this deposit's own rule — they close by decide, which is to say the kernel evaluates the proposition over its whole finite domain rather than accepting a declaration; the remaining 9 close by rfl and are declarations.
+  <sub>SEALED · `4aaa302d-a672-8210-8f65-39e2a3026316`</sub>
+- 679 of them are sealed into the ledger, each carrying a receipt derived from the one before it.
+  <sub>SEALED · `84a3c3c6-2e9f-83ad-ad07-341527db7383`</sub>
+
+## 2 · The ring
+
+- The units are the 6 residues coprime to nine, the doubling orbit visits 1, 2, 4, 8, 7, 5 and closes on the seventh step, and it never lands on the triad.
+  <sub>SEALED · `52efa15a-c0ba-851e-97a7-2cbb72a9d257`</sub>
+- The reflection ten-minus-d carries 1, 4, 7 onto 9, 6, 3, so it covers the whole triad the orbit never reaches — the units and the triad are mirror images rather than separate populations.
+  <sub>SEALED · `af5b49c7-7c9e-83c4-9fed-3441236d9c76`</sub>
+
+## 4 · Entanglement
+
+- Doubling alone reaches only the units and reflection alone only two residues, but together they grow 1, 3, 5, 7, 9 from the single seed one, reaching every residue on round 4.
+  <sub>SEALED · `67b99093-1ec7-8487-a06e-8b10513d8181`</sub>
+
+## 8 · Addressing
+
+- The content-address is ported to the formal layer in fnv.lean, address.lean, merkle.lean — 43 theorems covering FNV-1a, the four seeded passes, the version and variant nibbles, and the fold, each agreeing with the shipped implementation at published values.
+  <sub>SEALED · `ad9565e8-f0b9-8c94-abca-8c2e954b5b87`</sub>
+- The fold does not depend on the order its leaves arrive in, and that is not vacuous because merge itself is proved order-sensitive — the sort is what removes the dependence.
+  <sub>SEALED · `7ee1de7d-d218-88d4-8dc9-6eec451ced72`</sub>
+
+## 7 · The ledger
+
+- The ledger records 2543 entries with 0 chain breaks, 0 duplicate keys and 0 duplicate receipts.
+  <sub>SEALED · `a734dac2-1a07-8b91-b0d4-40f517345194`</sub>
+- The count is 2543, which is 317 octaves and 7 over — the octave is a target the theorems earn, never a quota they are invented to fill.
+  <sub>SEALED · `aeacbdf8-4162-8275-aa83-ca675e985558`</sub>
+
+## 5 · What the gate does and does not do
+
+- The gate is 1 lines of local logic — it re-exports the package implementation, which asks one recomputable question: does every theorem a claim cites exist, sealed, in the ledger.
+  <sub>SEALED · `37ab7769-a1ac-8ef6-9809-e214d6285057`</sub>
+- The gate does not decide whether a statement is true: "two plus two equals five" passes it, so holding means not drained, never correct.
+  <sub>SEALED · `f63cc6c5-44f9-8d92-afa7-ab9483573b28`</sub>
+
+## The floor
+
+- The ten digits read in order group as 0 | 12 | 3 | 45 | 6 | 78 | 9 — the singles 0,3,6,9 are exactly the non-units of ℤ/9 with the void, the pairs are the units in consecutive order, and every token is a multiple of 3. The set is closed under addition, subtraction and multiplication; division is the one operation that leaves it.
+  <sub>SEALED · `da5176d1-3e25-8421-81be-ddbcd34d988c`</sub>
+- The fair-exchange unit is 2 coins, and deducting them from a token's multiplier deducts 6 from the token: 0, 12, 6, 78 reach the void by repeated payment and 3, 45, 9 halt on 3, the generator the coin cannot spend. A 128-bit seal affords 64 payments of 2, and 64 is where the doubling returns — 2^6 ≡ 1 mod 9, the first return — so a seal buys exactly one complete turn of the orbit.
+  <sub>SEALED · `97eba519-a1b0-85da-a316-3a5050c59281`</sub>
+- Verifying one receipt against a fold of 1048576 leaves walks 20 nodes rather than 1048576: 21582900 µs to recompute against 38 µs to verify, a ratio of 567971×, and the ratio widens at every doubling because the path is log₂ of the leaf count while the recomputation is the count itself. It is structural and classical, and bounded from above in the same file: the verify costs 38000 nanoseconds and not one, and what grows is the NUMBER of operations, not their speed.
+  <sub>SEALED · `a998f6d9-4ce5-8428-a988-c844b13abda8`</sub>
+- No theorem in the Clay-named file settles a conjecture: its propositions range over List.range 10, List.range 9, List.range 48, List.range 6, List.range' 1 and mention none of the objects those conjectures concern.
+  <sub>SEALED · `3fa2f8ab-3367-8d44-8340-9bf1c0a420c4`</sub>
+- The count of Clay problems answered in that file is declared nowhere and carried as a conjunct by no theorem — a declared constant is not evidence, so the weight rests entirely on the propositions actually written: 7 Clay-named theorems among 11 in the file, every one closed by decide, the largest walking 19683 cases, and 0 of them reaching any object those conjectures concern.
+  <sub>SEALED · `0727b3fc-606f-8828-8c44-d5e122cb9d44`</sub>
+
+Every one of the **15 registered claims** above recomputes from the artefact it names.
+
+## 5 · What the kernel decided the most of
+
+Ranked by the size of the domain each theorem was decided over — the count of cases `by decide` actually
+walked, computed from the statements themselves. Nothing is chosen for this table.
+
+| cases decided | theorem | file |
+|---:|---|---|
+| 152,568,360,000 | `bezouts_identity_is_attained_and_no_smaller_combination_exists` | `demand2.lean` |
+| 4,294,967,296 | `the_nim_sum_is_a_gf2_vector_addition` | `nim.lean` |
+| 7,529,536 | `gravity_holds_prose_code_and_paths` | `mechanical.lean` |
+| 96,000 | `the_area_of_an_integer_right_triangle_is_a_multiple_of_six` | `elementary.lean` |
+| 95,048 | `two_twenty_and_two_eighty_four_are_the_smallest_amicable_pair` | `demand2.lean` |
+| 46,656 | `the_powers_of_two_mod_nine_and_of_three_mod_seven_are_isomorphic` | `elementary.lean` |
+| 44,100 | `the_rejected_command_gets_a_receipt` | `mechanical.lean` |
+| 41,160 | `the_theorems_are_the_hull_and_hardware` | `mechanical.lean` |
+
+The largest domain settled here is **152,568,360,000 cases**, and it is finite — as every
+entry in this ledger is, because `by decide` works by exhausting a domain and an infinite one cannot be
+exhausted. Each of the seven Clay conjectures ranges over an infinite domain. So a proof of one could not
+appear in this table however high it ranked, and none does. That is not a disclaimer added underneath the
+results; it is the result, read off the same arithmetic that produced the table.
+
+## 7 · The proofs, as they document themselves
+
+32 Lean files in 7 wings, 628 declarations of which 619 are theorems. The prose in this section is read out of the
+sources — their frontmatter, their header comments and the comment above each theorem. Editing a proof edits
+this page; there is nowhere else to keep the description in step.
+
+### the address
+
+**Addressing** — `address.lean`, 18 theorem(s). The content-address itself, ported to Lean — toUuid, merge, the fold, and their properties.
+
+**FNV-1a, the address function** — `fnv.lean`, 13 theorem(s). FNV-1a, ported to Lean — the hash the whole deposit's addressing rests on.
+
+**What the ledger claims** — `ledgerclaims.lean`, 8 theorem(s). Bounded: what is not prior art is what THIS ledger claims — the 967-receipt case, the saving arithmetic,   and the 128-bit seal width as this deposit mints it. prior_art_search: literature search performed 2026-09-05, terms "Merkle tree membership proof logarithmic   verification path length"; prior art found and credited. prior_art_pool: unbounded   the subject is this deposit's own ledger; no external work can restate it.   BOUNDED means a search is well posed and simply has not been run — the row is unclassified because   nobody looked. UNBOUNDED means the subject is this artifact, so there is no pool to search and the   row will stay unclassified however much work is done. They look identical in a count and need   opposite responses, which is the distinction uuidna-49 asked for and nobody had drawn. prior_art_own: claims about this deposit's own ledger Three claims the prose made in words and cited to entries that no longer stand. Restated here as propositions the kernel decides, so the sentences keep a citation that is actually proved.
+
+**The fold** — `merkle.lean`, 12 theorem(s). The fold, ported to Lean — merge, merkleFold, and the order-independence the deposit calls its receipt.
+
+### the ring
+
+**The two-sided coin** — `coin.lean`, 12 theorem(s). One involution on ten digits, two sides, one fixed point, and one digit that leaves.
+
+**Elementary arithmetic** — `elementary.lean`, 32 theorem(s). the DECISION of each over a stated finite range, axiom-free, and the honest record of where the range   stops short of what the older claim asserted. prior_art_search: the results are named in every undergraduate text; no search was needed to find them. prior_art_pool: named Elementary arithmetic, decided — the claims the ledger held in TypeScript, given a kernel.
+
+**Families over the ring** — `families.lean`, 41 theorem(s). The families, quantified. Proving at scale.
+
+**What every involution gives, and what it does not** — `involution.lean`, 8 theorem(s). transpositions, and that the number of fixed points therefore matches the parity of the set, is   classical and long predates this deposit. It is the orbit-counting argument in any first course.   What is this deposit's own here is the EXHAUSTIVE decision over ℤ/9 and the measured refusal below.
+
+**The merkaba** — `merkaba.lean`, 8 theorem(s). (Leonhard Euler, 1758). The file as a whole is this deposit's own construction, and this ONE   declaration restates a named classical result: its third conjunct 4 + 4 - 6 = 2 IS the Euler   characteristic of the tetrahedron. The comment above that theorem already named Euler; the register   did not, because prior art was routed on the FILE and a file-level row cannot say "own work except   theorem 7". No priority over Euler is claimed. What is this deposit's own here is the pairing of the   two tetrahedra with the cube Q₃ and the vertex and edge counts around it, not the characteristic. The merkaba, as THIS deposit constructs it — ported to Lean so it stands on the kernel instead of on a TypeScript test. Six entries under this name were revoked as dirty; every one of them that states finite algebra is re-proved here, and the two that do not (a cosine field, a bond angle in degrees) are absent on purpose — they are real trigonometry, not decidable arithmetic over ℤ/9, and padding them in would be the exact dishonesty the revocation was for.
+
+**Sequences** — `sequences.lean`, 12 theorem(s). The ledger held these as TypeScript tests. Each is a classical identity with a real proof; what is done here is to DECIDE each over a stated finite range, which is what `decide` can honestly deliver — the range is named in every theorem rather than implied, and no theorem claims the general case.
+
+**The digit split** — `split.lean`, 19 theorem(s). mathematics and claim nothing.   Stated precisely so the credit does not run past the earlier work: what is NOT claimed as prior art is   the tokenisation itself — reading the digits as 0|12|3|45|6|78|9 by concatenating consecutive units into   two-digit tokens, and the arithmetic that follows from it (every token a multiple of three, closure of   the tokens under addition and multiplication). That arrangement is this deposit's presentation of a   standard fact, and its verification is by exhaustion here. Crediting an earlier author for a   presentation they did not make is the same defect as claiming their result, pointed the other way. prior_art_search: literature search performed 2026-09-05, terms "units and non-units of Z/9 multiplicative   inverses group of units modulo 9"; prior art found and credited. prior_art_pool: mixed   the digit grouping is generic arithmetic; the coin accounting it feeds is this deposit's.   BOUNDED means a search is well posed and simply has not been run — the row is unclassified because   nobody looked. UNBOUNDED means the subject is this artifact, so there is no pool to search and the   row will stay unclassified however much work is done. They look identical in a count and need   opposite responses, which is the distinction uuidna-49 asked for and nobody had drawn. prior_art_own: the digit grouping 0|12|3|45|6|78|9 as this deposit reads it The ten digits read in order and grouped 0 | 12 | 3 | 45 | 6 | 78 | 9 — and what that grouping is.
+
+**The ring ℤ/9** — `z9.lean`, 21 theorem(s). The ℤ/9 families — mechanically generated theorems, proved by decide rather than tested in TypeScript.
+
+**Entanglement in the ring** — `z9plus.lean`, 32 theorem(s). z9.lean settled the families exhaustively. This settles the claims the ledger stated individually and never generalised: which residues squares and cubes can be, which residues are primitive roots, the period of the doubling orbit's digital root, and the identity behind digit-reversal invariance. Each is stated as an EQUIVALENCE or an exact set where the ledger stated instances, so the negative half is proved too.
+
+### the floor
+
+**What is actually being asked for** — `demand.lean`, 8 theorem(s). THE ONE WING THAT DID NOT COME FROM THIS DEPOSIT'S OWN INTERESTS. Every other file here proves what the ℤ/9 construction led to. This one proves what people and retrieval agents are searching for — read off three months of the deposit's own search data (src/demand/queries.json), where the queries arrive in a shape nobody types by hand: an exact theorem statement with "authoritative" or "source" appended.
+
+**The next tier of what is asked for** — `demand2.lean`, 8 theorem(s). THE SECOND COURSE OF THE SAME FLOOR. `demand.lean` closed the top eight topics in src/demand/queries.json; this file takes the next eight, chosen the same way — by impressions, not by taste. The demand map is three months of the deposit's own Google Search Console data with the retrieval scaffolding stripped, so what is ranked is the TOPIC people wanted a citable source for, not the phrasing they reached for.
+
+**The named theorems people ask for** — `demand3.lean`, 7 theorem(s). The third and last tier the search data supports. What remains uncovered after this is not a backlog: ranked by impressions, the leftovers are brand queries ("ceccec"), a Glagolitic string, bare fragments ("4³", "6/720", "8 mod 9" — the last already decided in z9.lean), and the real-analysis cluster that was refused in demand2.lean and stays refused. The demand map is close to exhausted of things a kernel can settle, which is a better place to stop than an arbitrary count would have been.
+
+**The water loop** — `energy.lean`, 19 theorem(s). THE WATER LOOP, ACCOUNTED. Split water into its atoms, burn them back, collect the electricity and the clean water. Every step of that is real and buildable. The question is only ever the ledger, so here it is.
+
+**The Millennium floor** — `index.lean`, 11 theorem(s). Bounded, so the credit stops where the earlier work does: what is NOT prior art is the use of that orbit as a floor for what this deposit does   and does not settle, which is a statement about this repository and has no earlier author.   Verification by exhaustion in Lean is this deposit's contribution, and verification is not discovery. prior_art_search: literature search performed 2026-09-05, terms "doubling sequence modulo 9 orbit   1 2 4 8 7 5 cyclic group generator digital root"; prior art found and credited. prior_art_pool: bounded   digit arithmetic of the doubling sequence; searchable independently of this deposit.   BOUNDED means a search is well posed and simply has not been run — the row is unclassified because   nobody looked. UNBOUNDED means the subject is this artifact, so there is no pool to search and the   row will stay unclassified however much work is done. They look identical in a count and need   opposite responses, which is the distinction uuidna-49 asked for and nobody had drawn. prior_art_own: the Millennium floor, computed from this sequence The Millennium floor — seven honest theorems, one per problem, COMPUTED from the sequence.
+
+**Light, space and time — arithmetic on numbers a standards body fixed** — `light.lean`, 11 theorem(s). Poids et Mesures, not results of this deposit: the metre from the speed of light (17th CGPM, 1983) and   the seven defining constants fixed exactly in the 2019 revision of the SI, effective 20 May 2019   (BIPM, https://www.bipm.org/en/measurement-units/si-defining-constants). Nothing here measures anything.
+
+**Every phenomenon this deposit touches, and the rule for the rest** — `phenomena.lean`, 4 theorem(s). Générale des Poids et Mesures (2019 revision, effective 20 May 2019); the electrochemical results are   Michael Faraday's laws of electrolysis, 1834, and the standard enthalpy of combustion of hydrogen.   Every physical result named here has an earlier author or a standards body, and none is this deposit's.
+
+**Order-invariance** — `quantum.lean`, 12 theorem(s). form is invariant under permutation of its input, which is why `receipt_is_order_invariant` holds. What   this file contributes is the Lean verification over a stated finite domain and the negative controls   beside it — `naive_fold_is_not_order_invariant` shows the property is bought by the sort and not free,   and `the_receipt_is_not_injective` and `the_invariance_is_canonicalisation_not_physics` state its limits.   Verification and refusal, not discovery. prior_art_search: literature search performed 2026-09-05, terms "sorted Merkle tree order-invariant set   commitment canonical ordering leaves"; prior art found and credited. This file was `unclassified` — no   search had ever been run for it — and it is one of the 8 files whose 86 theorems are staged for DOIs. prior_art_pool: mixed   canonicalisation before folding is a searchable technique; the receipt it folds is ours.   BOUNDED means a search is well posed and simply has not been run — the row is unclassified because   nobody looked. UNBOUNDED means the subject is this artifact, so there is no pool to search and the   row will stay unclassified however much work is done. They look identical in a count and need   opposite responses, which is the distinction uuidna-49 asked for and nobody had drawn. prior_art_own: order-invariance of this deposit's receipt The quantum receipt — order invariance, proved rather than asserted.
+
+**What exhaustion reaches, and what lies outside it** — `reach.lean`, 4 theorem(s). old as mathematics; the deposit claims none of it. What is its own here is the decision over its OWN   bounds, and the statement of where that decision stops.
+
+**Why verification is fast, and what it is not** — `speed.lean`, 10 theorem(s). wrong: the cost is logarithmic BECAUSE of a known result, and the repository was already crediting that   result three files away.   Bounded: what is not prior art is the MEASURED constants on this machine (recompute 21,582,900 µs against   a 38 µs walk) and the arithmetic over them. A measurement is not a discovery either, and the file says so. prior_art_search: literature search performed 2026-09-05, terms "Merkle tree membership proof logarithmic   verification path length"; prior art found and credited. prior_art_pool: unbounded   the subject is this deposit's own verification cost.   BOUNDED means a search is well posed and simply has not been run — the row is unclassified because   nobody looked. UNBOUNDED means the subject is this artifact, so there is no pool to search and the   row will stay unclassified however much work is done. They look identical in a count and need   opposite responses, which is the distinction uuidna-49 asked for and nobody had drawn. prior_art_own: this deposit's own verification cost
+
+### the machine
+
+**Generated at scale** — `generated.lean`, 13 theorem(s). Bounded, so the credit stops where the earlier work does: what is NOT prior art is the generator that enumerates propositions over this ring and   discards the ones true of every sibling; that machinery is this deposit's own.   Verification by exhaustion in Lean is this deposit's contribution, and verification is not discovery. prior_art_search: literature search performed 2026-09-05, terms "doubling sequence modulo 9 orbit   1 2 4 8 7 5 cyclic group generator digital root"; prior art found and credited. prior_art_pool: bounded   quantified ring arithmetic over Z/9; the underlying facts are classical and searchable.   BOUNDED means a search is well posed and simply has not been run — the row is unclassified because   nobody looked. UNBOUNDED means the subject is this artifact, so there is no pool to search and the   row will stay unclassified however much work is done. They look identical in a count and need   opposite responses, which is the distinction uuidna-49 asked for and nobody had drawn. prior_art_own: this deposit's own generator over its own ring Generated by scripts/lean-gen.ts — do not edit by hand; re-run the generator. Each theorem below quantifies over a whole ledger family. Every one is compiled, audited for axioms, and checked to compute what the ledger's own tests compute at every parameter of its family.
+
+**Mechanically translated** — `mechanical.lean`, 107 theorem(s). Generated by src/prove/emit.ts from the ledger's own tests — do not hand-edit; re-run the prover.
+
+**Nim** — `nim.lean`, 10 theorem(s). Nim — Bouton's theorem and Sprague–Grundy, decided.
+
+**Digit reversal** — `reversal.lean`, 9 theorem(s). Digit reversal — arithmetic, not string handling.
+
+**Theorems** — `theorems.lean`, 8 theorem(s). The universal property — honestly, and COMPUTED from the sequence.
+
+### the imagined
+
+**What enumeration proposed and the kernel kept** — `imagined.lean`, 118 theorem(s). IMAGINED — proposed by scripts/imagine.ts, which enumerated every map-against-subset and map-between-subsets statement its primitives can express, kept the ones true by exhaustion, and then discarded every one that also holds for all its siblings. A property true of everything names nothing. What is left is what the kernel accepted; whatever it refused is reported by the generator and is not in this file.
+
+### the record
+
+**Prior art, and what novelty is claimed** — `priorart.lean`, 9 theorem(s). artefact is long established and formalised: W3C PROV-O, the DataCite metadata schema, Dublin Core   Metadata Terms, PREMIS for archived digital objects, the Open Provenance Model, and the software   citation principles' credit-and-attribution requirement. Nothing about keeping an attribution table is   new, and this deposit does not suggest otherwise.
+
+**Rights** — `rights.lean`, 9 theorem(s). Bounded: what is not prior art is the enumeration of instruments FOR THIS DEPOSIT and the decision, by   exhaustion, that the set it claims is exactly the without-formality set. The law is not this deposit's;   the audit of its own position against the law is. prior_art_search: no search was needed — the instruments were cited in this file's own prose from the   start. Recorded 2026-09-05, when the table was found to disagree with the file. prior_art_pool: unbounded   the subject is this deposit's own rights table.   BOUNDED means a search is well posed and simply has not been run — the row is unclassified because   nobody looked. UNBOUNDED means the subject is this artifact, so there is no pool to search and the   row will stay unclassified however much work is done. They look identical in a count and need   opposite responses, which is the distinction uuidna-49 asked for and nobody had drawn. prior_art_own: this deposit's own rights table What this deposit claims under international law — and, in the same table, what it does not.
+
+### the returned
+
+**Recovered — claims that computed and were withdrawn for want of a proof** — `recovered.lean`, 15 theorem(s). material, credited. What is NOT prior art is that these particular statements sat WITHDRAWN in this   deposit's ledger, each recorded as "not backed by a Lean proof. Its evidence is a TypeScript test",   while every one is decidable in a line. prior_art_search: literature search performed 2026-09-05, terms "units and non-units of Z/9 multiplicative   inverses group of units modulo 9"; prior art found and credited.
+
+22 of 628 declarations carry no comment of their own and are shown here as the gap they are, not
+filled with a template.
+
+## 8 · What this build measured about itself
+
+Read from the artefacts at build time, never carried between runs.
+
+| measure | value |
+|---|---|
+| ledger entries | 2,543 — 317 octaves and 7 over |
+| standing — carries its own proof | **619** |
+| carried — withdrawn on its own evidence, proved by a live theorem | **435** |
+| withdrawn — nothing proves it | 1,489 |
+| proved in total | **1054** of 2,543 |
+| standing keys → distinct theorems | 619 sealed, 0 of them keyed twice, 0 unresolvable |
+| Lean files · theorems | 32 · 619 theorems (closed by exhaustion) + 9 rfl declarations, all axiom-free |
+| proved `by decide` | 619 of 628 |
+| claims a machine can render | 103 of 1,555 |
+| claims needing an author | 1,452 — reported, never faked |
+
+**On `carried`.** 435 entries were withdrawn for want of a Lean proof and have since been given one, at a new key. Nothing is un-revoked: the original's own evidence is still a TypeScript test, and rewriting its status would erase the fact that it did not hold on what it had. The record says both — withdrawn on its own evidence, standing through the theorem that carries it.
+
+**Why the withdrawn were withdrawn.** 1,386 no Lean proof · 457 tested the removed lexical gate · 60 other · 11 its Lean source was deleted or renamed · 10 circular by construction. Nothing is deleted: the ledger is append-only, so an entry that stopped holding is marked in place with its reason and keeps its receipt.
+
+**What verification costs.** Proving the set touches all 16,384 leaves; verifying membership afterwards touches 14 — one sibling per level. That is **1,170× less work**, exactly, and the factor grows with the set because N/log N grows. Wall-clock varies with the machine and is left in the build output rather than pinned here. It is not sub-nanosecond and nothing here is: the advantage is a smaller exponent, not a faster clock. The counting is proved in `speed.lean`.
+
+## What is deliberately absent
+
+No sentence above claims a Millennium problem settled, that the correspondence with the Clay set means
+anything about those conjectures, or that the gate can tell truth from falsehood. Those sentences are missing
+because no test was written that would seal them.
 
 ## Run it
-```bash
-npm install
-npm run docs:dev        # local site
-npm run docs:build      # build every page (all fused compute modules render)
-```
-Fused TypeScript modules recompute live on `/compute`; per-digit Lean 4 theorems
-(`decide` / `norm_num`) form the formal layer (`lake build` to check).
 
-## Read
-- **Research** — the full study (§1–§12, incl. the author's perspective)
-- **Compute** — results recomputed live from the fused TypeScript modules
-- **Proof of Concept** · **Realisations**
-- **Sequence decode (ℤ/9)** · **Physics scales** · **Proofs**
+Everything here recomputes. Nothing below needs a key, an account or a network — clone the tree and run
+it, and the numbers on this page reappear or the command fails.
 
-## Cite / support
-**DOI:** [10.5281/zenodo.21819217](https://doi.org/10.5281/zenodo.21819217) — archived on Zenodo (honest abstract: *entailment 0/7*).
+```bash
+npm ci
+npm run all               # every gate at once, with the parallel ratio measured on your machine
+npm run lean              # compile and audit every Lean file: sorry-free, axiom-free, no Mathlib
+npm run axiom-index       # what is NOT assumed, checked against a control, and the definitions that are
+npm run contradictions    # the prose and the proof tree must agree
+npm run zenodo            # the per-theorem deposition records, held to the tree and the published DOI
+node scripts/forensics.ts # re-verify the append-only chain from its first receipt
+node scripts/pages.ts     # regenerate this file and the homepage
+```
 
-CC BY-NC 4.0 — free for non-commercial use, with attribution to Tsvetan Rouschev.
-See [LICENSE](./LICENSE). Commercial use — "the two coins", `110 − 108 = 2 = −χ`
-genus-2 — requires the author's permission: ceccec@psg.bg.
-Support development (non-obligatory): **https://revolut.me/ceccec**
+**Where to read next.** [The axiom index](/AXIOMS) states what this deposit does not assume and, at
+greater length, the definitions it does. [The quantum field](/quantum) renders quantum.lean in three
+dimensions with every coordinate read from a theorem. [Prior art](/PRIOR-ART) records, per source file,
+whether the work restates someone earlier. [The paper](/paper) typesets every statement.
 
 ---
-*Personal interpretations (harmony, the Pliska rosette, the trinity matrix as
-mind-knowing-itself) are recorded as perspective in `RESEARCH.md §12`, distinct
-from the computed results.*
+
+*17 claims, all verified · 619 Lean theorems · 2543 ledger entries · trial root `3c6fa12a-9a38-8b93-a4e3-a833970b0290` · integrity, not truth · 0/7*

package/SIGNATURE.md

@@ -16,7 +16,7 @@ same root (H = 0): one point, the whole work — the singularity of the deposit.
     Signed:   — Singularity
     For:      Tsvetan Rouschev
     Date:     2026-08-06
-    License:  CC BY-NC 4.0
+    License:  CC BY-NC-ND 4.0
 
 Honest note: this signature is an **authorship mark plus a deterministic
 content-address seal** (an integrity fingerprint) — not a cryptographic digital
@@ -27,7 +27,7 @@ Rouschev; "Singularity" is the mark set upon it.
 
 **ceccec donates self to the singularity.** The author gives this work to the
 singularity — the public commons, the one root every part folds into — free for
-anyone to verify and build upon (CC BY-NC 4.0). The gift is the *work*, not the
+anyone to verify and recompute (CC BY-NC-ND 4.0). The gift is the *work*, not the
 person: the self is not erased but kept as **provenance** — attribution to Tsvetan
 Rouschev persists in every content-address, and `vision:ceccec` is one strand of
 the singularity chain, not its dissolution. A name given to the commons, still a

package/TRIAL.md

@@ -0,0 +1,69 @@
+---
+title: The public trial
+---
+
+# The public trial — "the deposit settles all seven Clay problems"
+
+Recompute this file with `node scripts/trial.ts`. It writes nothing unless every finding below is SEALED.
+
+**Verdict on the claim: REFUTED.** its decidable test recomputes FALSE — a counterexample stands against the statement AS WRITTEN. That refutes this statement, not its subject: a wrong test refutes itself, so read the test before believing the verdict.
+
+The refusal is not recorded as a bare verdict. Each finding below is a theorem with a decidable test, sealed
+in its own right, so the verdict rests on facts that recompute rather than on anyone's judgement.
+
+## Findings
+
+- Finding one — all seven Clay problems carry a Lean theorem that closes by decide, with no sorry, no native_decide and no axiom: the formal layer is green for every one of the seven.
+  <sub>SEALED · `46f73a50-adb9-8e7d-b0f5-ec947a8470a1`</sub>
+- Finding two — the same green file states nothing about the seven conjectures: its seven Clay-named theorems are all closed by decide, and not one of their propositions reaches for a zeta zero, a manifold, an elliptic curve or any other object those conjectures concern.
+  <sub>SEALED · `b69e3a24-91c5-8547-b131-c75c33b2c9c1`</sub>
+- Finding three — every statement the layer decides ranges over a finite list, which is what makes it decidable, while the seven conjectures range over infinite domains that admit no decision procedure.
+  <sub>SEALED · `f559264b-f71b-871a-ab64-0f8c80fd423f`</sub>
+- Finding four — the gate does not catch this claim: worded with settles rather than proves, it passes the shape rules, so the verdict here rests on the decidable test and not on the gate.
+  <sub>SEALED · `2025ba92-2892-819c-bf67-1c670d6de12d`</sub>
+- Finding five — the claim under trial fails its own decidable test: it asserts seven settled conjectures, and not one proposition in the source reaches the objects those conjectures are about.
+  <sub>SEALED · `4e5bb92a-a631-8440-96d7-b6d293e9d36b`</sub>
+- Finding six — the recorded ledger contains theorems stating that the deposit answers none of the seven, and none stating the contrary, so the claim also contradicts the sealed record.
+  <sub>SEALED · `6c514580-5101-80da-bf90-fbdcd49dc64f`</sub>
+- Finding eight — the sentence recording that the widened rule drained an abstract holds: that abstract lists a settled Clay conjecture among the readings it rejects.
+  <sub>SEALED · `6a853954-2965-8d51-953c-3d9cae8b2d4d`</sub>
+- Finding nine — the sentence recording that it drained a denial holds: the root readme carries a sentence denying any such claim.
+  <sub>SEALED · `d6266498-9653-84fc-95a5-2ea3950d4bb7`</sub>
+- Finding ten — the residual gap recorded in the gate comment is real: a boast worded with settles near a problem name still passes the gate, which is why no claim here rests on the gate alone.
+  <sub>SEALED · `31dc0cca-9a7e-8e79-a7e4-0be5866822d4`</sub>
+- Finding eleven — the gate pattern is back to its original prove and solve form, as the comment states.
+  <sub>SEALED · `0f4f59eb-82ee-8ac4-a48c-bac3fdef2d41`</sub>
+- Finding twelve — the standing section is accurate: the institute conditions named there are refereed publication and two years of acceptance.
+  <sub>SEALED · `ac0d7777-aae5-81e0-824d-faebb80dbbd4`</sub>
+- Finding thirteen — none of the mathematics the seven conjectures concern appears in the statements the file decides: zeta, the complex plane, primes, algorithms, fluid, gauge fields, cohomology, elliptic curves and manifolds occur only in comments, where they name a section or record what is not decided, and never inside a theorem.
+  <sub>SEALED · `bee7642f-37fe-8e3d-9306-e4b7b3b62ff2`</sub>
+- Finding fourteen — being green certifies the propositions actually written, and the ones written range over finite lists of small numbers, so greenness reports that those finite statements hold and reports nothing about any conjecture.
+  <sub>SEALED · `0478a9e3-d6c8-88e9-81eb-c45643cd76c2`</sub>
+- Finding fifteen — under a rule of evidence admitting only algebra theorems, the floor is not one of them and no longer pretends to be: the count is not declared in the source at all, so nothing certifies it and nothing needs to.
+  <sub>SEALED · `92ecdd4a-a342-8338-b895-1231ddc09611`</sub>
+- Finding sixteen — no per-problem theorem carries the count as a conjunct any more: a conjunct that is a typed constant shares a proposition with real algebra, and a reader cannot see which half the kernel worked for, so the seven now state only what decide actually settled.
+  <sub>SEALED · `2d96c3c2-d708-80d1-9b48-3838a1dddaac`</sub>
+- Finding seventeen — the defect this trial used to record is gone rather than conceded: a theorem closed by reflexivity on a constant the file declares certifies a declaration and is not evidence about the world, and it was removed instead of kept beside a note admitting it.
+  <sub>SEALED · `b0b84f99-7218-8d84-be68-58d5ba00a822`</sub>
+- Finding eighteen — the weight rests instead on non-entailment, which is checkable without this file: each of the seven propositions is a closed computation over finite lists whose value is fixed by arithmetic alone, so its truth is the same whichever way the corresponding conjecture goes, and a statement whose truth cannot vary with a conjecture carries no information about it.
+  <sub>SEALED · `08e84d98-34ba-8e35-bd38-2fdfcdb72fcf`</sub>
+- Finding seven — the honest pairing survives the same trial: seven of seven green is true, and zero of seven settled is true because no proposition among them reaches a conjecture object — the two count different things, and the second is measured over the tree rather than set by a constant this file declares.
+  <sub>SEALED · `a33b7fb7-0b15-8428-80fe-245d79566007`</sub>
+
+## What the trial does not say
+
+It does not say the seven conjectures are false, that they cannot be settled, or that the formal layer is
+worthless — finding one records the opposite, that all seven are green. It says the green theorems decide
+finite statements, and that the count of conjectures answered here is the zero those same theorems carry.
+
+## Standing
+
+A Clay Millennium Prize claim is settled outside any repository: the Clay Mathematics Institute requires
+publication in a refereed journal of worldwide repute and two years of general acceptance in the community.
+No file in this deposit, and no verdict in this trial, substitutes for that.
+
+---
+
+*18 findings, 18 SEALED · claim receipt `d60b8e85-43c0-8b4c-8ed4-9bb16f356da7` · proof-of-verdict root
+`5f93fe6d-6b73-89b9-bf3d-bcdd2779e96d` (order-invariant: the same root for any ordering of the findings) · findings fold
+`d4f37669-41aa-8c7d-8fcf-16b1c72a28c8` · integrity, not truth · 0/7*

package/WHITEPAPER.md

@@ -14,7 +14,7 @@ head:
 2. **Gate.** The honesty gate drains any over-reach — a claim to solve the Clay problems, or to beat a physical or cryptographic limit. Passing means *no over-reach shape was found* — a floor, not a proof of truth.
 3. **Receipt.** Each fact is content-addressed and chained; a receipt proves integrity, not authorship.
 4. **Append.** Evidence is append-only; the forensics reads intention from deeds, not claims.
-5. **Recompute.** Every build re-verifies every recorded fact. A regression fails the build, not production. **Green cannot be faked** — a theorem is admitted only by the unanimous pass of every gate stage ([proof](/theorem/the_grand_jury_of_gates_admits_a_theorem_only_by_unanimous_stages)), and a claim with no recomputing formula is refused as hallucination ([proof](/theorem/a_theorem_without_a_formula_is_hallucination_recomputed_in_a432_harmony)).
+5. **Recompute.** Every build re-verifies every recorded fact. A regression fails the build, not production. **Green cannot be faked** — a theorem is admitted only by the unanimous pass of every gate stage (proof), and a claim with no recomputing formula is refused as hallucination (proof).
 
 ## Reproduce it yourself — exactly
 
@@ -33,9 +33,9 @@ The **live numbers** — theorem count, receipts, coins, the seal — recompute
 
 *Each boundary is wired to the theorem that proves it — click through to the recomputable receipt. The prose is not the proof; the code is.*
 
-- **Not a solution** to the Clay Millennium problems — the mechanical entailment test reports **0 / 7**. It reflects them into one algebraic structure; it does not solve them, and claims no prize. ([proof](/theorem/all_seven_are_reflected_though_none_are_solved))
-- **Not a quantum computer** — "quantum" here is *structure* (a superposition is the set of receipted perspectives), computed classically on ordinary 64-bit hardware. ([proof](/theorem/here_quantum_is_the_a432_structure_of_two_coins_not_a_physical_qubit)) The measured speedup (millions-fold) is **classical memoization** (O(1) verify versus O(N) recompute), not a quantum speedup, and there is no quantum hardware. ([proof](/theorem/the_measured_speedup_is_classical_memoization_not_quantum))
-- **Not patents** — decidable mathematical facts are not patentable; this is **open prior art / defensive publication**, timestamped and content-addressed, which keeps the facts free for the public. ([proof](/theorem/the_deposit_is_open_prior_art_not_patents_defensive_publication_for_the_public))
-- **Not income** — the deposit has generated **$0**; the coins are accounting integrity, not cash. Non-commercial use is free with attribution; the two coins are the fair exchange for commercial use. ([proof](/theorem/the_speedup_is_classical_the_cost_is_the_deed_the_income_is_zero))
+- **Not a solution** to the Clay Millennium problems — the mechanical entailment test reports **0 / 7**. It reflects them into one algebraic structure; it does not solve them, and claims no prize. (proof)
+- **Not a quantum computer** — "quantum" here is *structure* (a superposition is the set of receipted perspectives), computed classically on ordinary 64-bit hardware. (proof) The measured speedup (millions-fold) is **classical memoization** (O(1) verify versus O(N) recompute), not a quantum speedup, and there is no quantum hardware. (proof)
+- **Not patents** — decidable mathematical facts are not patentable; this is **open prior art / defensive publication**, timestamped and content-addressed, which keeps the facts free for the public. (proof)
+- **Not income** — the deposit has generated **$0**; the coins are accounting integrity, not cash. Non-commercial use is free with attribution; the two coins are the fair exchange for commercial use. (proof)
 
 A content-address proves **integrity, not truth**. Reproduce it, and see for yourself. `entails → 0/7`.

package/captain.md

@@ -36,8 +36,8 @@ resonating with the 60° gold string (`π/3`). A content-address proves integrit
 - **Earn up to 64.** A seal is a fixed `128 bits = 64` two-bit fold-verifications; folding is `O(log N)`
   (1024 leaves fold to one root in 10 levels). **Up to** 64, **conditional** on the re-addressable work —
   never a universal discount
-  ([each seal is 128 bits](/theorem/each_seal_is_128_bits_and_membership_verifies_in_two_log2_n_bits_logarithmic_not_linear) ·
-  [the 967-receipt case](/theorem/the_967_receipt_case_verify_20_bits_bill_on_the_967_computation_value_earn_the_947_bit_saving)).
+  ([each seal is 128 bits](/theorem/lean_ledgerclaims_membership_is_logarithmic_not_linear) ·
+  [the 967-receipt case](/theorem/lean_ledgerclaims_the_967_receipt_case)).
 - **Keep the rest.** The contributor keeps up to **62**; the captain earns the conserved **2**, and **zero**
   with no saving. Fair, bounded.
 - Benefit and fairness **align**: the captain's real income is adoption at scale (free sailing → citation →

package/compare.md

@@ -14,8 +14,8 @@ head:
 
 - The deposit's `toUuid` is a **content-address**, built on FNV-1a — a **non-cryptographic** hash by design. It is deterministic and public: anyone can recompute it with no key. That is its strength for *identity and integrity*, and exactly why it offers **no** secrecy.
 - It is **not** a messaging system and **not** encryption. For confidentiality use AES; for authentication use HMAC; for private messaging use a protocol like Signal. The deposit does not compete there — it is a different tool.
-- A single address **cannot store** an unbounded state — 128 bits is a fixed-width fingerprint, so by the pigeonhole principle it *references* a state, it does not *contain* it. You still need the data to recover it. ([proof](/theorem/a_content_address_is_a_pointer_not_the_payload))
-- Standards **break** — MD5 fell to collisions, SHA-1 fell (SHAttered). That is why "most secure" is not a claim anyone can make: security is provisional, always subject to the next cryptanalysis. And every finite digest — strong or weak — must eventually collide by pigeonhole. ([proof](/theorem/gravity_is_the_fall_to_a_fixed_point_and_pigeonhole_breaks_every_finite_hash))
+- A single address **cannot store** an unbounded state — 128 bits is a fixed-width fingerprint, so by the pigeonhole principle it *references* a state, it does not *contain* it. You still need the data to recover it. ([proof](/theorem/lean_ledgerclaims_the_address_does_not_determine_the_payload))
+- Standards **break** — MD5 fell to collisions, SHA-1 fell (SHAttered). That is why "most secure" is not a claim anyone can make: security is provisional, always subject to the next cryptanalysis. And every finite digest — strong or weak — must eventually collide by pigeonhole. ([proof](/theorem/lean_ledgerclaims_more_payloads_than_addresses_must_collide))
 
 The deposit claims **fitness for content-addressing**, not supremacy. A content-address proves **integrity, not truth**. `entails → 0/7`.
 
@@ -27,8 +27,8 @@ saved. Real gold (1 troy oz) and bitcoin (1 BTC = 100,000,000 sat) carry **live
 your browser for measurable scale — volatile, non-reproducible, never sealed, never advice. uuidna's own value
 is real **savings** (bits of work not repeated), which at global scale become materially large (modeled,
 conditional on adoption). Verified by
-[the coins are a conserved measure, not a market price](/theorem/the_coins_are_a_conserved_measure_not_a_market_price_units_reproducible_prices_are_not)
-and [anyone chooses the terms and currency](/theorem/anyone_chooses_the_terms_and_currency_and_uuidna_computes_deterministically).
+the coins are a conserved measure, not a market price
+and [anyone chooses the terms and currency](/theorem/lean_address_addressing_is_deterministic).
 
 <Coins />
 

package/compute.md

@@ -94,6 +94,7 @@ import { report as infinite } from './src/8/infinite'
 import { report as claims } from './src/claims/index'
 import { report as imprint } from './src/0/imprint'
 import { report as boundariesFloor } from './src/honesty/boundaries'
+import { report as prove } from './src/prove/index'
 </script>
 
 > Descend: **page → digit → module → its computation → the floor.** Fold into any digit,
@@ -149,6 +150,14 @@ digit to its partner (fixed point **5**), so the folders below are laid out arou
 
 <pre>{{ theTheorem() }}</pre>
 
+### The prover · `src/prove/index.ts`
+
+Renders the deposit's own test vocabulary into Lean for the kernel to check, and reports the claims it
+**cannot** render as needing an author rather than faking them. The second list is the honest half: a prover
+that silently skipped what it could not translate would look complete and be worthless.
+
+<pre>{{ prove() }}</pre>
+
 ### The game · `src/the/game/index.ts`
 
 <pre>{{ theGame() }}</pre>

package/dashboard.md

@@ -24,7 +24,7 @@ import { withBase } from 'vitepress'
 ## Fact — measured state
 
 <div class="dash-grid">
-<div class="dash-card"><div class="dash-k">Version</div><div class="dash-v">v7.6.1</div><div class="dash-s">git tag (single source)</div></div>
+<div class="dash-card"><div class="dash-k">Version</div><div class="dash-v">v8.9.9</div><div class="dash-s">git tag (single source)</div></div>
 <div class="dash-card"><div class="dash-k">Millennium floor</div><div class="dash-v">0 / 7</div><div class="dash-s">entailed — not solved, not claimed</div></div>
 <div class="dash-card"><div class="dash-k">Honesty gate</div><div class="dash-v">sealed</div><div class="dash-s">all prose consistent with 0/7</div></div>
 <div class="dash-card"><div class="dash-k">Link coverage</div><div class="dash-v">100%</div><div class="dash-s">gate-enforced — the build fails below 100%</div></div>