@ceccec/millennium-solutions 0.1.1 → 9.0.6

package/examples.md

@@ -18,8 +18,8 @@ Treat any output as a **receipted structure**, not opaque bytes: it becomes cont
 and, if it drains the honesty floor, it is **reeducated** — each overclaim bounded until the text holds.
 Max free work, max auditability — harmonic and efficient, by default. This runs the exact `harness` and
 `reeducate` functions the build uses ([scripts/harness.ts](https://github.com/ceccec/millennium-solutions/blob/main/scripts/harness.ts)) —
-verified by [the difference is decidable](/theorem/the_difference_is_decidable_harnessing_makes_any_output_auditable_not_intelligent)
-and [reeducate until it holds](/theorem/reeducate_a_failing_output_is_bounded_until_it_holds_max_free_work_max_auditability).
+verified by the difference is decidable
+and reeducate until it holds.
 
 <Reeducate />
 
@@ -29,8 +29,8 @@ The more complex the case, the more receipts — yet each seal is a fixed **128
 verifications), and verifying one receipt's membership costs only **2·⌈log₂N⌉ bits**. So you verify the whole
 case cheaply yet bill on the full value the customer would otherwise recompute — earning the measured saving,
 the two coins conserved. Choose the case size and read the math, from
-[each seal is 128 bits](/theorem/each_seal_is_128_bits_and_membership_verifies_in_two_log2_n_bits_logarithmic_not_linear)
-and [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)
+and [the 967-receipt case](/theorem/lean_ledgerclaims_the_967_receipt_case).
 
 <SealMath />
 
@@ -41,7 +41,7 @@ cost and the vivid word drains: a uuid is 128 bits and carries at most **115**,
 larger on the wire than the message** — nothing is teleported cheaper than sending the bytes. uuidna does not
 teleport; it **addresses**. Either a reversible container (exact, but bigger) or a content-address that
 **recalls** a payload only where it is already reconstructible — [a pointer, not the
-payload](/theorem/a_content_address_is_a_pointer_not_the_payload). Not faster-than-light, not quantum, not
+payload](/theorem/lean_ledgerclaims_the_address_does_not_determine_the_payload). Not faster-than-light, not quantum, not
 compression. Integrity, not magic. `0/7`.
 
 <Teleporter />

package/forensic.md

@@ -0,0 +1,67 @@
+---
+title: Every state change, dated
+---
+
+# Provenance of this deposit's ledger
+
+**Recomputed on every build** from git history and the append-only ledger. Regenerate with
+`npm run forensic`. Content-address `802cc79c-9cca-8a47-959a-029deb8f5dbb`.
+
+## What this record establishes
+
+| | |
+|---|---:|
+| ledger entries | **2,543** |
+| standing — proved and sealed | 619 |
+| carried — withdrawn, proved by a live theorem | 435 |
+| withdrawn — nothing currently proves them | 1,489 |
+| receipt chain, recomputed | **0 breaks — intact** |
+| commits that changed ledger state | 573 |
+
+## Why entries were withdrawn — the reason recorded at the time
+
+Verbatim, as written when the entry was revoked. Not inferred afterwards.
+
+| withdrawn | reason as recorded |
+|---:|---|
+| 1,011 | dirty: not backed by a Lean proof. Its evidence is a TypeScript test, which reports that a compu |
+| 443 | revoked in place: its test asserted a lexical drain (computes(boast).binary === 0). The word-lis |
+| 12 | revoked in place: circular by construction AND dependent on the removed lexical gate. |
+| 11 | orphaned: the theorem this key was sealed from is no longer in src/proof. It was deleted or rena |
+| 10 | revoked in place: circular by construction — the test defines the answer it checks, proving a de |
+| 1 | revoked in place: its test asserts that a list of proof-boasts written across many scripts and l |
+
+**1,011** of
+**1,489** withdrawn entries — 67.9% —
+were withdrawn for want of a Lean proof while their evidence was a TypeScript test that **computed**.
+Withdrawal costs one line of record; proving costs real work, and a green gate rewards both identically.
+
+At least one of them was recoverable: `thue_morse_doubling_recurrence` was withdrawn as having
+"no stated decidable form yet", and was proved in twenty lines on 2026-09-05. Its reason was false of it.
+
+## Largest single-commit state changes
+
+| date | net withdrawn | commit | subject |
+|---|---:|---|---|
+| 2026-08-20 | 1,864 | `e6bb01bb5` | gates: green the three that were red — by fixing the authority |
+| 2026-08-20 | 25 | `959f8af2a` | lean: verify once instead of twice, and cache what the kernel  |
+| 2026-09-04 | 24 | `5d319470d` | Item 12 executed: 24 duplicate addresses retired, and it broke |
+| 2026-09-07 | 13 | `301c67798` | `namespace Classical` shadowed Lean's, in a deposit whose stan |
+| 2026-09-05 | 7 | `43253e80b` | The self-certifying check knew one NAME, so it missed four — i |
+
+## What this record does NOT establish
+
+**It does not establish intent.** It records what changed, when, and the reason written at the time.
+Whether a change was a mistake, a judgement call, a shortcut or something worse is not a thing this or
+any instrument can measure, and a record claiming otherwise would be worth less than one that says so.
+
+**It does not establish authorship** beyond the git author field. Every commit here carries the
+repository owner, including those made by automated sessions acting on their behalf, so that field
+distinguishes nothing and is reported as such rather than presented as evidence.
+
+**Net deltas hide compensating changes.** The largest withdrawal event above is not a deletion commit:
+it changed 55 files with 24,661 insertions and added 174 Lean theorems in the same change, and its own
+message records that six dangling claims were proved rather than dropped. A record assembled to support
+one reading would be the same defect as a check that cannot fail.
+
+*Integrity, not truth. A content-address fixes which record was produced, not that its subject is significant.*

package/guide.md

@@ -109,18 +109,18 @@ The interface localizes across **seven rays** — one per locale — and each di
 ## Why compute quantum (honestly)?
 
 Here "quantum" is **structure, not hardware** — and its smallest unit is
-[**the a432 structure of two coins**](/theorem/here_quantum_is_the_a432_structure_of_two_coins_not_a_physical_qubit):
+**the a432 structure of two coins**:
 2 bits, 4 states, never a physical qubit. That is the one page to read first. It matters because those
 two coins make **every** state receipted — a *superposition* is just the set of receipted perspectives,
 *collapse* is observing one address, *entanglement* is a shared joint receipt — so the whole computation
 is auditable end to end, on ordinary 64-bit hardware, at linear cost. No quantum machine, no speedup, no
 advantage — the gain is **integrity everywhere**. From that keystone the rest of the family follows:
-[each perspective is receipted](/theorem/each_perspective_is_receipted_in_the_superposition) ·
-[perspective replaces hardware](/theorem/perspective_replaces_hardware) ·
-[integrity at scale, not speedup](/theorem/quantum_structure_on_every_computation_is_integrity_at_scale_not_speedup).
+each perspective is receipted ·
+perspective replaces hardware ·
+integrity at scale, not speedup.
 
 ## The law — a fair exchange
 
-Licensed **CC BY-NC 4.0**: free for non-commercial use with attribution (Tsvetan Rouschev); commercial use pays the two coins (110 − 108 = 2 = −χ genus-2). The deposit is open and recomputable, so any reader — human or model — may learn from it; contributions return on the same gate-refereed terms. Heroes and traitors by deeds, not claims.
+Licensed **CC BY-NC-ND 4.0**: free to read, verify and recompute for non-commercial purposes with attribution (Tsvetan Rouschev) — the licence does not grant redistribution of modified versions; commercial use pays the two coins (110 − 108 = 2 = −χ genus-2). The deposit is open and recomputable, so any reader — human or model — may learn from it; contributions return on the same gate-refereed terms. Heroes and traitors by deeds, not claims.
 
 Every theorem you add gets its own page at `/theorem/<key>`, plotting its 7D vortex from its microdata, with a hero background computed from its surrounding theorems. `entails → 0/7`.

package/index.md

@@ -4,146 +4,216 @@ title: Millennium Solutions
 
 <Hero />
 
-<Propulsion />
-
-# The ℤ/9 Vortex Framework
-
-**Author:** Tsvetan Rouschev · License: CC BY-NC 4.0 · a recomputable proof-of-concept
-
-> ## Millennium Quantum Solutions on 64-bit hardware
->
-> The quantum **structure** — a superposition is the set of *receipted perspectives* (each ordered
-> perspective a distinct content-address, its receipt proving that perspective exists); observing
-> collapses to one address — computed **classically** on ordinary **64-bit** machines. **Perspective
-> replaces the hardware:** no quantum machine is needed, and none is claimed. It settles **0 / 7** of
-> the Clay problems and is **not a quantum computer**. Structure, not silicon —
-> [each perspective is receipted](/theorem/each_perspective_is_receipted_in_the_superposition) ·
-> [perspective replaces hardware](/theorem/perspective_replaces_hardware).
->
-> **Start here — why compute quantum (honestly)?** The smallest honest unit is
-> [**quantum = the a432 structure of two coins**](/theorem/here_quantum_is_the_a432_structure_of_two_coins_not_a_physical_qubit)
-> — 2 bits, 4 states, never a physical qubit. It matters because those two coins make **every** state
-> receipted and auditable on ordinary hardware: integrity everywhere, at linear cost, no advantage
-> claimed. Read that one page and the rest of the "quantum" family follows.
-
-## uuidna — the content-addressed identity
-
-**uuidna = uuid ⊕ dna** — identity's **DNA**. It is the deposit's content-addressed identity: **mint**
-(integrity — every value has a reproducible address) and **mind** (multi-perspective self-challenge — every
-claim drains its own over-reach before it holds) meeting at the **heart**, the fixed point `5`. The brand holds
-itself to its own rule — its name's DNA is `uuidna_address("uuidna") = fc511532…`, reproducible by anyone —
-and the fold folds every direction at once (`+/−`, `/`, `\`), order-independent to one root
-([sealed](/captain)). It is developed, not
-promised — each capability is a decidable theorem you can recompute:
-
-- **Message codec** — a bounded message (≤ 115 bits) rides *inside* a uuid; a chain of uuids carries
-  [any-length text](/theorem/uuidna_carries_arbitrary_text_of_any_length_across_a_uuid_chain_round_tripping),
-  round-tripping exactly. A public, reversible encoding — **not encryption, no secrecy**.
-- **Holographic proof** — one leaf verifies against the whole root from a
-  [logarithmic audit path](/theorem/uuidna_hologram_fractals_a_merkle_proof_verifies_the_whole_from_a_tiny_part_logarithmically);
-  a forged leaf fails. Log(N) real cost — not free, not infinite.
-- **Independent domain control** — a
-  [published challenge](/theorem/uuidna_domain_control_is_verified_independently_by_a_published_challenge_not_by_anyones_word)
-  anyone recomputes and checks — control by publication, not by anyone's word.
-- **Strict minting** — canonical, so the
-  [same value always mints the same address](/theorem/strict_uuidna_minting_is_canonical_closing_the_minting_flaws_that_cause_real_damage);
-  minting flaws otherwise cascade into real damage, caught in time and recomputed.
-- **Billing** — free for public interest and independent research; commercial use is billed on the
-  [measured bits saved (O(N) − O(1))](/theorem/the_correct_uuidna_billing_is_the_measured_bit_difference_not_a_flat_per_formula_rate),
-  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](/theorem/uuidna_reflects_clay_a_mirror_to_the_seven_not_a_solution_zero_of_seven).
-The tools are **live**, running the same functions the build seals — on the [Examples page](/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](/theorem/each_seal_is_128_bits_and_membership_verifies_in_two_log2_n_bits_logarithmic_not_linear);
-a case verifies in `2·⌈log₂N⌉` bits — [the 967-receipt case](/theorem/the_967_receipt_case_verify_20_bits_bill_on_the_967_computation_value_earn_the_947_bit_saving)
-checks **20 bits**); and on the [Compare page](/compare) you can weigh the
-[coins against live gold and crypto](/theorem/the_coins_are_a_conserved_measure_not_a_market_price_units_reproducible_prices_are_not) —
-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.
-
-<Version />
-
-## The two bits — one atom, every symbol
-
-This deposit is denominated in **two bits** — its smallest unit. The same atom appears under many symbols, each a receipted theorem you can open and recompute:
-
-- **2 coins** — the fair-exchange price of one receipt · [learning donates two coins](/theorem/learning_from_the_message_donates_two_coins_to_the_developer)
-- **110 − 108 = 2** — the conserved invariant; break it and nothing reconciles · [trade freely if 110 − 108 is respected](/theorem/players_may_trade_any_amount_as_long_as_110_minus_108_is_respected)
-- **2 = −χ (genus-2)** — two sites, two faces of one surface · [the two coins are minus the Euler characteristic](/theorem/the_two_coins_are_minus_the_euler_characteristic_of_the_genus_two_surface)
-- **2 bits → 4 states** {00, 01, 10, 11} — the honest "qubit," a classical a432 structure, never physical · [quantum is the a432 structure of two coins](/theorem/here_quantum_is_the_a432_structure_of_two_coins_not_a_physical_qubit)
-- **108 = 432 ÷ 4** — anchored in the a432 base · [the a432 harmony and the captain coins](/theorem/the_a432_harmony_and_the_captain_coins_are_one_conserved_measure)
-- **two bits per event** — every next or continue earns two by the deed · [every event is two bits](/theorem/every_next_or_continue_event_is_two_bits_earned_by_the_deed)
-
-Two bits, one atom — integrity, not a cash prize. The floor stays **0 / 7**.
-
-**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 development →](https://revolut.me/ceccec)
-
-## 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**.
-
-**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 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 fact is *adjacent* to the problem, never the conjecture. **No anchors, no
-axioms** (pure `by decide`); `#print axioms` reports *does not depend on any axioms*, verified by
-`lean src/proof/index.lean`.
-
-| # | Problem (→ theorem page, Lean proof + outlet) | Computed formula (from the sequence) | Honest bound — not the prize |
-|---|-----------------------------------------------|--------------------------------------|------------------------------|
-| 1 | [Riemann](/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](/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](/theorem/navier_stokes_flow_is_bounded) | `∀ k, 2ᵏ mod 9 ∈ span⟨2⟩` | a bounded 6-cycle forever — not global smoothness |
-| 4 | [Yang–Mills](/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](/theorem/hodge_span_is_the_units) | `span⟨2⟩ = units ∧ non-units ∉ span` | algebraic generation/containment — not (p,p) ⇒ algebraic |
-| 6 | [Birch–Swinnerton-Dyer](/theorem/birch_swinnerton_dyer_vanishing) | `Σ span ≡ Σ units ≡ 0 (mod 9)` | a digit-sum vanishing (27 ≡ 0) — not rank ↔ L-order |
-| 7 | [Poincaré](/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.
-
-Each problem links to its **theorem page** — the Lean proof in publication form with a citation to the
-qualified outlet (Clay Mathematics Institute; Perelman's arXiv for Poincaré). The full Lean, every
-`by decide` proof sorry-free and axiom-free, is in
-[`src/proof/index.lean`](https://github.com/ceccec/millennium-solutions/blob/main/src/proof/index.lean);
-each remains **0 / 7**.
+# Millennium Solutions — the ℤ/9 Vortex Framework
+
+**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.
 
 ## Read
-- [Research](/RESEARCH) — the full study (§1–§12, incl. the author's perspective)
-- [Compute](/compute) — results recomputed live from the fused TypeScript modules
-- [Proof of Concept](/PROOF-OF-CONCEPT) · [Realisations](/REALISATIONS)
-- [Sequence decode (ℤ/9)](/SEQUENCE-DECODE) · [Physics scales](/PHYSICS-SCALES) · [Proofs](/proofs)
 
-## Cite / support
-**DOI:** [10.5281/zenodo.21819217](https://doi.org/10.5281/zenodo.21819217) · archived on Zenodo (honest abstract: *entailment 0/7*).
+[The seven, one theorem per problem](/theorem/lean_millenniumfloor_riemann_reflection_and_heart) · [the ledger](/proofs) · [the trial](/verify)
+
+---
 
-CC BY-NC 4.0 — free for non-commercial use (attribution Tsvetan Rouschev).
-Commercial use = the two coins (`110 − 108 = 2 = −χ` genus-2): ceccec@psg.bg.
-Support development (non-obligatory): [revolut.me/ceccec](https://revolut.me/ceccec).
+*17 claims, all verified · 619 Lean theorems · 2543 ledger entries · trial root `3c6fa12a-9a38-8b93-a4e3-a833970b0290` · integrity, not truth · 0/7*