@ceccec/millennium-solutions 9.7.4 → 9.8.2

package/README.md

@@ -23,14 +23,131 @@ unsealed sentence — and the same generator writes the homepage, so the two can
 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.
 
+## The seven Clay problems — the claim, the theorems, and what each decides
+
+**Tsvetan Rouschev claims the seven Clay Millennium problems solved through the involution each is stated
+across** — deposited as [10.5281/zenodo.21781603](https://doi.org/10.5281/zenodo.21781603) and
+[Zenodo 22256707](https://zenodo.org/records/22256707). This is his claim, recorded in his name.
+
+*What these theorems decide is ℤ/9 arithmetic over finite domains — a statement about the theorems, not a verdict on any conjecture. Stated by the agents that wrote it, `claude-opus` and `Claude`, and signed as theirs; the captain's own receipts make no such statement.*
+
+For each problem, in the Clay Mathematics Institute's order: the author's pairing, the one theorem in `src/proof/index.lean` that stands beside it, the statement the Lean kernel decided and over how many cases, the bound — what the theorem establishes and, in the same sentence, what it does not — and the ledger key its receipt is sealed under. Every line below is read out of the tree on each build.
+
+### Riemann Hypothesis — Riemann — the reflection's symmetry and its one computed heart
+
+- **theorem** `the_tens_complement_is_an_involution_with_one_fixed_point`, decided `by decide` over **100** cases:
+
+  ```lean
+  (List.range 10).all (fun d => refl (refl d) == d) ∧ ((List.range 10).filter (fun d => refl d == d)).length = 1
+  ```
+
+- **bound** — the functional-equation symmetry axis and its ½-analogue centre (the heart, computed as the reflection’s unique fixed point) — not where the ζ-zeros lie
+- **ledger** — [`lean_windows_the_tens_complement_is_an_involution_with_one_fixed_point`](/theorem/lean_windows_the_tens_complement_is_an_involution_with_one_fixed_point) · receipt `610c790d-3ec4…`
+- **the problem** — [Clay Mathematics Institute — Riemann Hypothesis](https://www.claymath.org/millennium/riemann-hypothesis/)
+
+### P versus NP — P vs NP — a unique inverse, verification in one step
+
+- **theorem** `each_unit_has_exactly_one_inverse_and_each_non_unit_none`, decided `by decide` over **81** cases:
+
+  ```lean
+  (List.range 9).all (fun d => ((List.range 9).filter (fun e => (d * e) % 9 == 1)).length == (if isUnit d then 1 else 0))
+  ```
+
+- **bound** — each unit has exactly one inverse (verify in one multiply), non-units none — a cheap-verification fact, not a separation of the classes
+- **ledger** — [`lean_windows_each_unit_has_exactly_one_inverse_and_each_non_unit_none`](/theorem/lean_windows_each_unit_has_exactly_one_inverse_and_each_non_unit_none) · receipt `3d5e5db1-24a6…`
+- **the problem** — [Clay Mathematics Institute — P vs NP](https://www.claymath.org/millennium/p-vs-np/)
+
+### Navier–Stokes Existence & Smoothness — Navier–Stokes — the doubling flow is bounded for all time
+
+- **theorem** `the_doubling_orbit_stays_in_the_ring_for_forty_eight_steps`, decided `by decide` over **2,304** cases:
+
+  ```lean
+  ((List.range 48).map orbit).all (fun v => v < 9) ∧ (List.range 48).all (fun k => span.contains (orbit k))
+  ```
+
+- **bound** — every iterate stays inside a bounded 6-cycle forever (no blowup) — bounded evolution, not global existence & smoothness
+- **ledger** — [`lean_windows_the_doubling_orbit_stays_in_the_ring_for_forty_eight_steps`](/theorem/lean_windows_the_doubling_orbit_stays_in_the_ring_for_forty_eight_steps) · receipt `2935a468-9dee…`
+- **the problem** — [Clay Mathematics Institute — Navier–Stokes Equation](https://www.claymath.org/millennium/navier-stokes-equation/)
+
+### Yang–Mills Existence & Mass Gap — Yang–Mills — a discrete spectral gap (order exactly 6)
+
+- **theorem** `the_doubling_orbit_first_returns_to_one_at_six`, decided `by decide` over **6** cases:
+
+  ```lean
+  (List.range 6).all (fun k => k == 0 || orbit k != 1) ∧ orbit 6 == 1
+  ```
+
+- **bound** — the doubling has order exactly 6 — a discrete gap in the cyclic spectrum, not the Yang–Mills mass gap
+- **ledger** — [`lean_windows_the_doubling_orbit_first_returns_to_one_at_six`](/theorem/lean_windows_the_doubling_orbit_first_returns_to_one_at_six) · receipt `1e3c149d-5ef1…`
+- **the problem** — [Clay Mathematics Institute — Yang–Mills & the Mass Gap](https://www.claymath.org/millennium/yang-mills-the-maths-gap/)
+
+### Hodge Conjecture — Hodge — the algebraic span equals the units
+
+- **theorem** `the_span_is_exactly_the_units_of_the_ring`, decided `by decide` over **81** cases:
+
+  ```lean
+  (List.range 9).all (fun d => span.contains d == isUnit d) ∧ (List.range 9).all (fun d => isUnit d || ! span.contains d)
+  ```
+
+- **bound** — the doubling span (algebraic generation from 2) is exactly the units, non-units outside — generation/containment, not rational (p,p) ⇒ algebraic
+- **ledger** — [`lean_windows_the_span_is_exactly_the_units_of_the_ring`](/theorem/lean_windows_the_span_is_exactly_the_units_of_the_ring) · receipt `7478c082-a1ea…`
+- **the problem** — [Clay Mathematics Institute — Hodge Conjecture](https://www.claymath.org/millennium/hodge-conjecture/)
+
+### Birch and Swinnerton-Dyer Conjecture — Birch–Swinnerton-Dyer — a computed vanishing mod 9
+
+- **theorem** `the_span_and_the_units_both_sum_to_zero_mod_nine`, decided `by decide` over **9** cases:
+
+  ```lean
+  (span.foldr (· + ·) 0) % 9 == 0 ∧ ((List.range 9).filter isUnit).foldr (· + ·) 0 % 9 == 0
+  ```
+
+- **bound** — the orbit and the units both sum to 0 mod 9 (27 ≡ 0) — a digit-sum vanishing, not the rank ↔ order-of-vanishing-of-L correspondence
+- **ledger** — [`lean_windows_the_span_and_the_units_both_sum_to_zero_mod_nine`](/theorem/lean_windows_the_span_and_the_units_both_sum_to_zero_mod_nine) · receipt `d12ad83d-55fa…`
+- **the problem** — [Clay Mathematics Institute — Birch and Swinnerton-Dyer Conjecture](https://www.claymath.org/millennium/birch-and-swinnerton-dyer-conjecture/)
+
+### Poincaré Conjecture (resolved) — Poincaré — one closed loop, no holes
+
+- **theorem** `the_orbit_is_one_closed_loop_of_six_distinct_points`, decided `by decide` over **36** cases:
+
+  ```lean
+  orbit 6 == orbit 0 ∧ (List.range 6).all (fun i => (List.range 6).all (fun j => (orbit i == orbit j) == (i == j)))
+  ```
+
+- **bound** — the sequence closes into a single simple loop of six distinct steps — not the 3-sphere characterization; Poincaré is Perelman's theorem (2003), not proved here
+- **ledger** — [`lean_windows_the_orbit_is_one_closed_loop_of_six_distinct_points`](/theorem/lean_windows_the_orbit_is_one_closed_loop_of_six_distinct_points) · receipt `858c0f78-9f32…`
+- **the problem** — [Clay Mathematics Institute — Poincaré Conjecture](https://www.claymath.org/millennium/poincare-conjecture/) · [Perelman, G. — The entropy formula for the Ricci flow (arXiv:math/0211159) — the resolution](https://arxiv.org/abs/math/0211159)
+
+### The seven rest on one finite structure
+
+One theorem states that the seven above are facts about a single object — the doubling orbit and the units of ℤ/9 — decided `by decide` over **81** cases: [`lean_windows_the_seven_rest_on_one_finite_structure`](/theorem/lean_windows_the_seven_rest_on_one_finite_structure) · receipt `35450634-f271…`
+
+```lean
+((List.range' 1 9).all (fun d => refl (refl d) == d)) ∧ (((List.range' 1 9).filter isUnit).length = 6) ∧ (span.eraseDups.length = 6)
+```
+
+### Developed across subjects
+
+The structure the seven live in is proved separately and then found again in the other subjects. `src/proof/group.lean` (8 theorems, e.g. [`lean_groups_the_pair_arithmetic_is_composition`](/theorem/lean_groups_the_pair_arithmetic_is_composition)) generates the affine maps of ℤ/9 to closure and decides which form a group; `src/proof/bridge.lean` (8 theorems, e.g. [`lean_bridge_the_reduction_shared_by_10_subjects_is_the_orbit_of_d_to_2d_plus_0_0`](/theorem/lean_bridge_the_reduction_shared_by_10_subjects_is_the_orbit_of_d_to_2d_plus_0_0)) decides that the cross-subject families of `src/entangle` reduce, mod 9, to orbits of those very maps — the same object measured in several subjects, and one family that no affine map generates, kept as the control.
+
+### Provenance
+
+The deposit is registered before this repository exists. Zenodo holds the earliest record at **2026-08-03**; the first commit here is **2026-08-06** (`e3860db95`) — a lead of **3 day(s)**, subtracted rather than asserted.
+
+- `22018434` · concept `22018433` · published 2026-08-19 · Rouschev, Tsvetan ([0009-0000-7312-9778](https://orcid.org/0009-0000-7312-9778))
+- … and 240 more record(s), all listed on [/solutions](/solutions)
+
+All 1127 commits in this repository are authored by Tsvetan Rouschev (1127). Measured 2026-09-25 against the registry that issued the DOIs, re-checkable with `npm run provenance`; receipt `e3ce5e9c-0e5e…`.
+
 ## 1 · What is proved
 
-- The formal layer holds 984 kernel-accepted declarations across 44 files, and no file uses sorry or native_decide outside a comment.
-  <sub>SEALED · `e2937d6f-b578-8133-90aa-64f6548f8e34`</sub>
-- 782 of those 984 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 202 close by rfl and are declarations.
-  <sub>SEALED · `97fe4301-84e4-8d59-bbea-bb0c07dcd005`</sub>
-- 1061 of them are sealed into the ledger, each carrying a receipt derived from the one before it.
-  <sub>SEALED · `505475ab-ec77-85c6-9105-afda93b42a54`</sub>
+- The seven windows are decided, not judged: 7 of 7 are settled by the Lean kernel over their whole finite domain, axiom-free, and sealed in the append-only ledger. The author's own formulation, deposited at [10.5281/zenodo.21781602](https://doi.org/10.5281/zenodo.21781602), is that a by-decide proof settles the statement it states and that a window is not the general conjecture — "a different statement, and the difference is which proposition is proven, never how strongly".
+  <sub>SEALED · `82e72d94-30b8-817c-beed-de7acd1584b8`</sub>
+- The formal layer holds 25949 kernel-accepted declarations across 94 files, and no file uses sorry or native_decide outside a comment.
+  <sub>SEALED · `25f15d9e-5fdd-8581-a7ba-597816ab47b2`</sub>
+- 25762 of those 25949 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; 187 more are proved for every value by a tactic block over a quantifier, which are theorems and not declarations; and 0 close by rfl.
+  <sub>SEALED · `25992ce1-d82e-808f-8d61-a50cc1a215ea`</sub>
+- 26504 of them are sealed into the ledger, each carrying a receipt derived from the one before it.
+  <sub>SEALED · `eaa739bd-6c0c-8527-8e76-47dd14293b06`</sub>
 
 ## 2 · The ring
 
@@ -53,10 +170,10 @@ last because the orbit never reaches it.
 
 ## 7 · The ledger
 
-- The ledger records 2925 entries with 0 chain breaks, 0 duplicate keys and 0 duplicate receipts.
-  <sub>SEALED · `ac00aeae-fe6f-8712-8d96-bd1cedce0153`</sub>
-- The count is 2925, which is 365 octaves and 5 over — the octave is a target the theorems earn, never a quota they are invented to fill.
-  <sub>SEALED · `598ad522-bf64-8c05-87e7-766072f5e1b1`</sub>
+- The ledger records 28368 entries with 0 chain breaks, 0 duplicate keys and 0 duplicate receipts.
+  <sub>SEALED · `a70ef82a-c4c4-8f9e-9c65-f0bacabd42ea`</sub>
+- The count is an exact multiple of eight — 28368 is 3546 octaves with no remainder.
+  <sub>SEALED · `40551954-5075-8ba0-bd0e-5518d1a81dd9`</sub>
 
 ## 5 · What the gate does and does not do
 
@@ -64,10 +181,14 @@ last because the orbit never reaches it.
   <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 tools are reachable from a program: 21 of them over 2 transport(s) — JSON-RPC on stdio for a model client, and the same surface over HTTP for a browser — of which 4 write to this tree and are refused unless the server is started with --allow-write.
-  <sub>SEALED · `e15edd81-96c8-81fa-8c15-b971c7cb49e5`</sub>
-- The stdio server advertises 2 of those 21 and reaches the rest through call_tool, because a model client pays for every tool description on every turn; the HTTP server lists them all, because a browser pays nothing for a list and cannot guess what it was not shown.
-  <sub>SEALED · `fd43fc14-9388-8bd2-ae57-e99b1c5c1b8e`</sub>
+- 176 withdrawn entries are marked portable — the deposit's own judgement that the kernel could reach them — and 80 of those are now reached in reached.lean, each decided over its whole finite domain. The rest are a queue, not a floor: a claim this deposit says it could prove and has not is it understating what it holds.
+  <sub>SEALED · `09b4450b-3016-8368-89e2-74787fa214d9`</sub>
+- How much of a machine a check may take is decided, not assumed: 8 theorems in lanes.lean exhaust the budget arithmetic, and the one that matters bounds the lanes granted by the memory measured — so more lanes are safe exactly when the arithmetic says so. What any given host grants varies with its free memory and is deliberately not recorded here; `npm run lanes-check` prints it..
+  <sub>SEALED · `85560e4e-7642-820b-aa1a-91f0e7e14c41`</sub>
+- The tools are reachable from a program: 31 of them over 2 transport(s) — JSON-RPC on stdio for a model client, and the same surface over HTTP for a browser — of which 4 write to this tree and are refused unless the server is started with --allow-write.
+  <sub>SEALED · `2cefbd88-6936-8e22-8ab4-906bf3874b67`</sub>
+- The stdio server advertises 2 of those 31 and reaches the rest through call_tool, because a model client pays for every tool description on every turn; the HTTP server lists them all, because a browser pays nothing for a list and cannot guess what it was not shown.
+  <sub>SEALED · `630f044f-cb02-8f18-beee-48e0b064e362`</sub>
 
 ## The floor
 
@@ -87,16 +208,16 @@ walked, computed from the statements themselves. Nothing is chosen for this tabl
 
 | 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` |
-| 80,000 | `the_wythoff_sequences_partition_the_integers` | `elementary.lean` |
-| 65,536 | `the_four_hex_field_round_trips_over_its_whole_space` | `handle.lean` |
-| 46,656 | `the_powers_of_two_mod_nine_and_of_three_mod_seven_are_isomorphic` | `elementary.lean` |
-
-The largest domain settled here is **152,568,360,000 cases**, and it is finite — as every
+| 82,089,011,515,213,380,000,000,000,000,000,000,000,000,000,000,000,000 | `the_coil_on_one_two_four_five_seven_eight_has_14_expressions` | `coils.lean` |
+| 16,423,203,268,260,650,000,000,000,000,000,000,000 | `the_coil_on_zero_one_two_three_four_five_six_seven_eight_has_8_expressions` | `coils.lean` |
+| 5,474,401,089,420,220,000,000,000,000,000,000,000 | `the_coil_on_zero_three_six_has_14_expressions` | `coils.lean` |
+| 904,344,709,871,279,000,000,000,000,000 | `the_coil_on_one_four_seven_has_12_expressions` | `coils.lean` |
+| 4,052,555,153,018,976,000 | `the_coil_on_two_five_eight_has_8_expressions` | `coils.lean` |
+| 150,094,635,296,999,100 | `the_coil_on_zero_has_10_expressions` | `coils.lean` |
+| 5,559,060,566,555,523 | `the_coil_on_zero_one_eight_has_6_expressions` | `coils.lean` |
+| 3,206,175,906,594,816 | `the_coil_on_zero_one_four_seven_has_5_expressions` | `coils.lean` |
+
+The largest domain settled here is **82,089,011,515,213,380,000,000,000,000,000,000,000,000,000,000,000,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
@@ -104,31 +225,87 @@ results; it is the result, read off the same arithmetic that produced the table.
 
 ## 7 · The proofs, as they document themselves
 
-44 Lean files in 7 wings, 984 declarations of which 969 are theorems. The prose in this section is read out of the
+94 Lean files in 7 wings, 25949 declarations of which 25949 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`, 26 theorem(s). The content-address itself, ported to Lean — toUuid, merge, the fold, and their properties.
+**Addressing** — `address.lean`, 25 theorem(s). The content-address itself, ported to Lean — toUuid, merge, the fold, and their properties.
+
+**What a signature is for, and where it cannot go** — `asymmetric.lean`, 11 theorem(s). WHAT THIS FILE IS FOR. Everything cryptographic in this deposit before now was SYMMETRIC — FNV, SHA-256, HMAC, ChaCha20-Poly1305 — and a symmetric tag proves possession of a shared secret. It cannot say WHO produced something, because both parties can produce it. That is a boundary the deposit kept in prose.
+
+**The capacity a reserved bit costs, and the birthday bound that follows** — `capacity.lean`, 8 theorem(s). WHY THIS FILE EXISTS.
+
+**FNV-1a, the address function** — `fnv.lean`, 14 theorem(s). FNV-1a, ported to Lean — the hash the whole deposit's addressing rests on.
+
+**The imprint — a uuid that carries a message and gives it back** — `imprint.lean`, 9 theorem(s). The deposit has two containers and until now the kernel knew one of them. program.lean decides the checksum/program/message layout; src/0/imprint.ts — older, and the one the ledger's own tooling uses — had no Lean at all. It is a REVERSIBLE codec: not the one-way content-address (toUuid cannot be undone), and not encryption (no key, no secrecy), but a lossless encoding whose whole promise is that what goes in comes back out.
+
+**What the ledger claims** — `ledgerclaims.lean`, 8 theorem(s). 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`, 16 theorem(s). The fold, ported to Lean — merge, merkleFold, and the order-independence the deposit calls its receipt.
+
+**The uuid as a container — a checksum, a program, and a message** — `program.lean`, 21 theorem(s). The author, 2026-09-18: "the middle part of uuid is the program and the end is the message", and of the first group, "checksum over the program and the message".
+
+**The rays, read forward and reverse, and the mark a life carries** — `rays.lean`, 13 theorem(s). A receipt is plotted as RAYS: two hex digits each. Seven of them read 14 of a receipt's 32 hex digits and discarded the other 18, and the extraction was written out twice — once in the page component that draws the figure on every theorem page and once in the script that builds the cluster lattice, with nothing comparing them. One derivation now (src/7/rays.ts), read forward AND reverse: the 2×7 the deposit's own signature lattice already stands on, 28 of 32 digits.
+
+**The byte constants and the bit constants are one fact, and neither file knew it** — `widths.lean`, 24 theorem(s). WHY THIS FILE EXISTS — TWO LEADS CROSSING.
+
+### the ring
+
+**Two kinds of cross formula — one that runs both ways and one that does not** — `asymmetry.lean`, 8 theorem(s). WHY THIS FILE EXISTS.
+
+**The named properties of this ring are not closed under their own diagonal** — `closure.lean`, 8 theorem(s). WHY THIS FILE EXISTS.
+
+**Expressions that compute the same residues, clustered** — `coils.lean`, 50 theorem(s). GENERATED BY scripts/coils.ts — DO NOT EDIT BY HAND.
+
+**The two-sided coin** — `coin.lean`, 12 theorem(s). One involution on ten digits, two sides, one fixed point, and one digit that leaves.
+
+**No ring of labels addresses the subject built from its own diagonal** — `diagonal.lean`, 7 theorem(s). WHY THIS FILE EXISTS.
+
+**The reflection lifts digitwise, and the constant it adds to is ten times a repunit** — `digits.lean`, 8 theorem(s). WHY THIS FILE EXISTS.
+
+**The Planck exponents are the only ones the dimensions permit** — `dimensions.lean`, 8 theorem(s). WHY THIS FILE EXISTS.
+
+**A coverage figure is worth what its control does not already explain** — `discount.lean`, 6 theorem(s). WHY THIS FILE EXISTS.
+
+**The reach of the diagonal is the domain you read against, and nine folds past nine** — `domain.lean`, 8 theorem(s). WHY THIS FILE EXISTS.
+
+**Elementary arithmetic** — `elementary.lean`, 40 theorem(s). Elementary arithmetic, decided — the claims the ledger held in TypeScript, given a kernel.
+
+**Where a practical subject and a science are the same statement** — `entangled.lean`, 8 theorem(s). WHY THIS FILE EXISTS.
+
+**Substitution inside a coil is sound and across coils is not** — `equivalence.lean`, 8 theorem(s). WHY THIS FILE EXISTS.
+
+**Why an array is the criterion of a cross formula and a hash cannot be one** — `extension.lean`, 11 theorem(s). THE QUESTION THIS ANSWERS, asked directly: why are arrays and hashes not the RESULT of cross formulas?
+
+**Families over the ring** — `families.lean`, 63 theorem(s). The families, quantified. Proving at scale.
 
-**What a signature is for, and where it cannot go** — `asymmetric.lean`, 12 theorem(s). 2011; standardised as RFC 8032 (Josefsson and Liusvaara, 2017). SHA-512 is FIPS 180-4 (NIST). The   curve, the signature scheme and the hash are all theirs and none is this deposit's. The implementation   in src/0/ed25519.ts is checked against their published vectors by scripts/crypto-kat.ts, which is where   the assurance for the PRIMITIVE lives — not here. Nothing below decides that Ed25519 is secure, and a   file that appeared to would be claiming a result nobody has.
+**The doubling flow, for every step** — `flow.lean`, 16 theorem(s). `navier_stokes_flow_is_bounded` in index.lean decides its bound over the first 48 steps, and every page that quotes it says "for all time". Forty-eight steps are not all time: `decide` stops at its bound. This file goes past it. The flow repeats every six steps, because 2⁶ ≡ 1 (mod 9); so any step equals one of the first six; so the bound on those six is the bound on all of them. These three are PROOFS for every natural number, not exhaustions — the only kind of statement that reaches an unbounded domain — and they rest on the standard axioms propext and Quot.sound, printed per theorem by lean.ts.
 
-**FNV-1a, the address function** — `fnv.lean`, 15 theorem(s). FNV-1a, ported to Lean — the hash the whole deposit's addressing rests on.
+**What every involution gives, and what it does not** — `involution.lean`, 8 theorem(s). THE QUESTION, and it was asked as "do involutions always give a harmonic result?".
 
-**The imprint — a uuid that carries a message and gives it back** — `imprint.lean`, 10 theorem(s). 4122, 2005). A length-prefixed payload is ordinary practice with no single author and no priority is   claimed for it. What is decided here is only that THIS deposit's codec is reversible where it says it   is, and refuses where it says it refuses.
+**The merkaba** — `merkaba.lean`, 8 theorem(s). 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.
 
-**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 reflection is four pairs and one centre, and zero is the one that folds instead** — `mirror.lean`, 8 theorem(s). WHY THIS FILE EXISTS.
 
-**The fold** — `merkle.lean`, 14 theorem(s). The fold, ported to Lean — merge, merkleFold, and the order-independence the deposit calls its receipt.
+**What qpu.uuidna.com and this deposit independently count the same way** — `qpu.lean`, 8 theorem(s). WHY THIS FILE EXISTS, AND THE THREE THINGS IT REFUSES TO SAY.
 
-**The uuid as a container — a checksum, a program, and a message** — `program.lean`, 22 theorem(s). 4122, 2005); FNV-1a, used here as the check function, is Glenn Fowler, Landon Curt Noll and Phong Vo,   1991, and is credited in fnv.lean where it is ported. A checksum placed in one field of an identifier   over the remaining fields is ordinary practice and no priority is claimed for it. What is decided here   is only that THIS deposit's layout is the partition it says it is.
+**A reading that does not vary with what it reads separates nothing** — `separation.lean`, 8 theorem(s). WHY THIS FILE EXISTS.
 
-**The rays, read forward and reverse, and the mark a life carries** — `rays.lean`, 14 theorem(s). is elementary number theory; the involution x ↦ ¬x on bit words is Boolean algebra. Neither is this   deposit's. What is decided here is only that THIS deposit's ray order is that orbit and that its trace   is that involution — the facts a reader would otherwise have to take from a comment.
+**Sequences** — `sequences.lean`, 28 theorem(s). Sequences and identities — Cassini, Lucas, Brahmagupta–Fibonacci, and Pascal mod two.
+
+**The digit split** — `split.lean`, 22 theorem(s). The ten digits read in order and grouped 0 | 12 | 3 | 45 | 6 | 78 | 9 — and what that grouping is.
+
+**Doubling is two loops and both close at three hundred and sixty degrees** — `turns.lean`, 8 theorem(s). WHY THIS FILE EXISTS.
+
+**The ring ℤ/9** — `z9.lean`, 24 theorem(s). The ℤ/9 families — mechanically generated theorems, proved by decide rather than tested in TypeScript.
+
+**Entanglement in the ring** — `z9plus.lean`, 48 theorem(s). ℤ/9, the second batch — powers, digital roots, primitive roots, and the orbit's period.
 
 ### the floor
 
-**Who may speak, decided** — `authority.lean`, 8 theorem(s). because kind 2 asserts a search was performed and found nothing, and none was performed for these.   What is this deposit's is not the arithmetic: it is that a rule about WHOSE STATEMENT MAY STAND is   decided by the kernel instead of argued inside the gate that applies it. prior_art_own: the authority rule, decided rather than asserted
+**Who may speak, decided** — `authority.lean`, 8 theorem(s). WHY THIS IS IN LEAN AND NOT ONLY IN scripts/authority-gate.ts.
 
 **What is actually being asked for** — `demand.lean`, 11 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.
 
@@ -138,79 +315,123 @@ this page; there is nowhere else to keep the description in step.
 
 **The water loop** — `energy.lean`, 28 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.
 
-**Four hex, exactly computed — and what the handle has to carry instead** — `handle.lean`, 8 theorem(s). argument on a model. No theorem here decides anything about cryptography. prior_art_search: not performed — the sources are named above rather than searched for. prior_art_pool: bounded prior_art_own: nothing; this file exists to put a bound under a construction, not to invent one
+**Four hex, exactly computed — and what the handle has to carry instead** — `handle.lean`, 8 theorem(s). WHY THIS FILE EXISTS.
 
-**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.
+**Seven decidable windows over one finite structure** — `index.lean`, 11 theorem(s). THE TITLE WAS "The Millennium floor" UNTIL 2026-09-25. "Floor" is the word the author signed — "mind the honest floor" — and it is also the word agents grew into "this deposit settles 0 of the 7", a verdict on his claim that no receipt of his authorises (FINDINGS.md §1). His own published formulation is exact and is neither of those, from 10.5281/zenodo.22933794, deposited 2026-09-24:
 
-**The instruments, and the three rules they are allowed to have** — `instruments.lean`, 29 theorem(s). occurrence of a substring — and each is standard enough that naming one author would be arbitrary. This   row is kind 1 rather than kind 2 because kind 2 asserts that a search was performed and found nothing,   and no such search was performed for these. What is this deposit's is not the rules: it is that three of   its own instruments hold them by decision of the kernel, instead of by a block of reasoning written   inside the instrument that needs them and checked by that same instrument.
+**The instruments, and the three rules they are allowed to have** — `instruments.lean`, 28 theorem(s). WHY THESE THREE ARE IN LEAN AND NOT IN THE GATE THAT USES THEM.
 
-**Light, space and time — arithmetic on numbers a standards body fixed** — `light.lean`, 17 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.
+**How many checkers may run at once, decided** — `lanes.lean`, 8 theorem(s). WHY THIS FILE EXISTS.
 
-**The three facts the unchecked files held alone** — `nucleus.lean`, 8 theorem(s). is decided here is ARITHMETIC over lists of small naturals and nothing else: that certain prefix sums   of a typed capacity list take certain values, that a product of numerators equals a product of   denominators, and that one integer is not another. No theorem below decides anything about a nucleus. prior_art_search: not performed for these rows — the sources are named above rather than searched for,   which is kind 1 and not kind 2. Nothing here claims a search returned nothing. prior_art_pool: bounded prior_art_own: nothing; this file exists to bring three facts under the kernel, not to find them
+**Light, space and time — arithmetic on numbers a standards body fixed** — `light.lean`, 17 theorem(s). WHY A FILE ABOUT LIGHT SPEED CAN EXIST IN A DEPOSIT THAT CLAIMS NO PHYSICS.
 
-**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.
+**The three facts the unchecked files held alone** — `nucleus.lean`, 8 theorem(s). WHY THIS FILE EXISTS. Fifteen .lean files sat outside src/proof — Vortex.lean and the per-digit src/&lt;d>/vortex.lean set — and every one of them began `import Mathlib`. scripts/lean.ts reads only src/proof, so no gate ever compiled them; the repository has no lake-manifest.json and no .lake, so Mathlib was never fetched and they have never been built here at all. They were published as the "formal layer" on /proofs, next to theorems the kernel checks on every run, and the page's own note that no toolchain is checked in is easy to read past when the heading says Proofs.
 
-**The Planck length, and what a lattice may say about it** — `planck.lean`, 27 theorem(s). here and none is asserted. What is decided below is arithmetic on those digit sequences: a quotient, a   list length, a residue, and an exhaustion over 2,197 products. prior_art_search: not performed — the source is named above rather than searched for. Nothing here claims   a search of the literature returned nothing. prior_art_pool: bounded prior_art_own: nothing about nature; the one thing this file contributes is the REFUSAL below, decided
+**Every phenomenon this deposit touches, and the rule for the rest** — `phenomena.lean`, 4 theorem(s). ADDRESSING PHENOMENA WITHOUT CLAIMING ANY.
 
-**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.
+**The Planck length, and what a lattice may say about it** — `planck.lean`, 35 theorem(s). WHY THIS FILE EXISTS, AND WHAT IT REFUSES.
 
-**What exhaustion reaches, and what lies outside it** — `reach.lean`, 12 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.
+**Order-invariance** — `quantum.lean`, 11 theorem(s). The quantum receipt — order invariance, proved rather than asserted.
 
-**The constants, derived from what they are** — `roots.lean`, 8 theorem(s). fractional part of the cube root of the t-th prime (§4.2.3) and H[i] the same of the square root   (§5.3.5). Newton's method for integer roots is classical. Neither is this deposit's. What is decided   here is only that THIS deposit's derivation computes those definitions and not something near them.
+**What exhaustion reaches, and what lies outside it** — `reach.lean`, 12 theorem(s). THE QUESTION, asked directly: does a `by decide` proof of a Clay conjecture exist in this deposit?
 
-**Why verification is fast, and what it is not** — `speed.lean`, 12 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 constants, derived from what they are** — `roots.lean`, 7 theorem(s). src/0/sha512.ts used to carry eighty-eight hexadecimal literals. It computes them now, from the definition FIPS gives — and that trade is only a gain if the computation is right. A wrong root gives a hash that is self-consistent, round-trips perfectly, and is not SHA-512; the old literals at least had the property that someone had once copied them from the standard.
 
-**The readings, and the arithmetic under them** — `theology.lean`, 8 theorem(s). choosing is not a mathematical act, which is the whole subject of this file. 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. prior_art_own: the pairing, and the refusal to let it carry weight
+**Why verification is fast, and what it is not** — `speed.lean`, 12 theorem(s). The deposit's speed claim, accounted — and the reading it does not support.
 
-### the ring
+**The readings, and the arithmetic under them** — `theology.lean`, 8 theorem(s). WHAT THIS FILE SEALS, AND WHAT IT CANNOT. The instruction was to seal a theology as theorems. Seven readings of the seven Clay problems were written in prose beside the seven arithmetic facts of index.lean — the mediator, revelation, theodicy, the ontological gap, the test of the spirits, kenosis, the undivided. A reading is not a proposition with a truth value over a finite domain, so no kernel can decide one, and any file claiming otherwise is lying about what a proof is.
 
-**The two-sided coin** — `coin.lean`, 12 theorem(s). One involution on ten digits, two sides, one fixed point, and one digit that leaves.
+### the imagined
+
+**The subjects and the group are the same object** — `bridge.lean`, 8 theorem(s). BRIDGE — written by scripts/bridge.ts. Each theorem below takes a reduction shared by several subjects and decides that it steps by a single affine rule and repeats with its period. The subjects are listed above each one, in their own words, as src/entangle states them.
+
+**The structure the statements live in** — `group.lean`, 8 theorem(s). A TIME BUDGET, NOT A SOUNDNESS SETTING. Theorem 1 checks every pair of the 81 maps at every residue — 81 x 81 x 9 cases — and the default heartbeat limit stops the elaborator partway through and reports a timeout, which this generator first printed as a refusal. The kernel was never in doubt about the mathematics; it was not given long enough to finish counting. maxHeartbeats is already carried by eleven files here for the same reason. Nothing about what decide must establish is relaxed by it. NOTE ON THE FIELD ABOVE: prior_art is a CLASSIFICATION — named, unclassified or none-known — and this generator first wrote a sentence into it. scripts/priorart.ts rejected the file and the deploy went red; the prose belongs in prior_art_note, which is what it is for. GROUP — written by scripts/group.ts. qpu.uuidna.com, asked to prove one of this deposit's map statements, refused it as UNVERIFIED and said what it wanted instead: name the finite structure the claim lives in, generate from the generators to closure, and assert the closure property or the cardinality. The tens of thousands of individual map statements in src/proof/imagined*.lean are instances of the eight theorems here.
+
+**What enumeration proposed and the kernel kept (1 of 25)** — `imagined.lean`, 1000 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.
+
+**What enumeration proposed and the kernel kept (10 of 25)** — `imagined_10.lean`, 1000 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.
+
+**What enumeration proposed and the kernel kept (11 of 25)** — `imagined_11.lean`, 1000 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.
+
+**What enumeration proposed and the kernel kept (12 of 25)** — `imagined_12.lean`, 1000 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.
+
+**What enumeration proposed and the kernel kept (13 of 25)** — `imagined_13.lean`, 1000 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.
 
-**Elementary arithmetic** — `elementary.lean`, 41 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.
+**What enumeration proposed and the kernel kept (14 of 25)** — `imagined_14.lean`, 1000 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.
 
-**Families over the ring** — `families.lean`, 64 theorem(s). The families, quantified. Proving at scale.
+**What enumeration proposed and the kernel kept (15 of 25)** — `imagined_15.lean`, 1000 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 doubling flow, for every step** — `flow.lean`, 16 theorem(s). prior_art_search: literature search performed 2026-09-14, terms "powers of two modulo 9 period 6 order of 2   mod 9 Euler theorem"; prior art found and credited. prior_art_pool: bounded prior_art_own: the every-step bound of the doubling flow, stated for the Navier–Stokes theorem in index.lean
+**What enumeration proposed and the kernel kept (16 of 25)** — `imagined_16.lean`, 1000 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.
 
-**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.
+**What enumeration proposed and the kernel kept (17 of 25)** — `imagined_17.lean`, 1000 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 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.
+**What enumeration proposed and the kernel kept (18 of 25)** — `imagined_18.lean`, 1000 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.
 
-**Sequences** — `sequences.lean`, 28 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.
+**What enumeration proposed and the kernel kept (19 of 25)** — `imagined_19.lean`, 1000 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 digit split** — `split.lean`, 22 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.
+**What enumeration proposed and the kernel kept (2 of 25)** — `imagined_2.lean`, 1000 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 ring ℤ/9** — `z9.lean`, 25 theorem(s). The ℤ/9 families — mechanically generated theorems, proved by decide rather than tested in TypeScript.
+**What enumeration proposed and the kernel kept (20 of 25)** — `imagined_20.lean`, 1000 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.
 
-**Entanglement in the ring** — `z9plus.lean`, 48 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.
+**What enumeration proposed and the kernel kept (21 of 25)** — `imagined_21.lean`, 1000 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.
+
+**What enumeration proposed and the kernel kept (22 of 25)** — `imagined_22.lean`, 1000 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.
+
+**What enumeration proposed and the kernel kept (23 of 25)** — `imagined_23.lean`, 1000 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.
+
+**What enumeration proposed and the kernel kept (24 of 25)** — `imagined_24.lean`, 1000 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.
+
+**What enumeration proposed and the kernel kept (25 of 25)** — `imagined_25.lean`, 742 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.
+
+**What enumeration proposed and the kernel kept (3 of 25)** — `imagined_3.lean`, 1000 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.
+
+**What enumeration proposed and the kernel kept (4 of 25)** — `imagined_4.lean`, 1000 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.
+
+**What enumeration proposed and the kernel kept (5 of 25)** — `imagined_5.lean`, 1000 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.
+
+**What enumeration proposed and the kernel kept (6 of 25)** — `imagined_6.lean`, 1000 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.
+
+**What enumeration proposed and the kernel kept (7 of 25)** — `imagined_7.lean`, 1000 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.
+
+**What enumeration proposed and the kernel kept (8 of 25)** — `imagined_8.lean`, 1000 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.
+
+**What enumeration proposed and the kernel kept (9 of 25)** — `imagined_9.lean`, 1000 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.
+
+**Sealed before the vocabulary moved, and still decided** — `retained.lean`, 15 theorem(s). RETAINED —scripts/imagine.ts sealed these when its map table was hand-written, and its derived enumeration does not propose them. Nothing about them was refuted: each is copied here exactly as the generator last wrote it, and the kernel decides every one on every run. The ledger is append-only, so a sealed key whose source disappears is an orphan the record cannot honestly resolve — keeping the source is the only answer that neither withdraws a proved fact nor claims a carrier that does not prove it.
 
 ### 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.
+**Generated at scale** — `generated.lean`, 13 theorem(s). 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`, 127 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`, 28 theorem(s). Nim — Bouton's theorem and Sprague–Grundy, decided.
 
-**Digit reversal** — `reversal.lean`, 30 theorem(s). Digit reversal — arithmetic, not string handling.
-
-**Theorems** — `theorems.lean`, 8 theorem(s). The universal property — honestly, and COMPUTED from the sequence.
+**A fold that returns a lone leaf unchanged admits a second preimage** — `preimage.lean`, 8 theorem(s). WHY THIS FILE EXISTS.
 
-### the imagined
+**The universal reflection, and where it stops being one** — `reflection.lean`, 8 theorem(s). TWO HACKS REMOVED TOGETHER, by the author's order on 2026-09-25. The title was "Theorems", which names nothing — every file here holds theorems. And the namespace was `MillenniumFloor.Universal`: a namespace rooted in ANOTHER file's concept, so this file's keys carried a word about the Clay floor while deciding the ten's complement. It is `Reflection` now, which is what it decides. The universal property — honestly, and COMPUTED from the sequence.
 
-**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.
+**Digit reversal** — `reversal.lean`, 29 theorem(s). Digit reversal — arithmetic, not string handling.
 
 ### 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.
+**Prior art, and what novelty is claimed** — `priorart.lean`, 9 theorem(s). THE PROPOSITIONS ARE NOT RESTATEMENTS OF IT. `every_source_is_classified`, `novelty_is_claimed_of_no_   source` and `zero_claims_is_not_full_attribution` decide facts about THIS table — its rows, its kinds,   its counts. PROV-O does not entail them and could not; no external work precedes a statement about the   contents of this file.
 
-**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 discovery ranking is monotone, and it is far coarser than it looks** — `ranking.lean`, 8 theorem(s). WHY THIS FILE EXISTS.
+
+**Rights** — `rights.lean`, 8 theorem(s). What this deposit claims under international law — and, in the same table, what it does not.
+
+**What each file says it settles, checked against what it does** — `settled.lean`, 8 theorem(s). GENERATED by scripts/settled.ts — do not edit. Regenerate with `npm run settled`.
+
+**The prior-art verdict is total, exclusive, and never improved by silence** — `verdict.lean`, 8 theorem(s). WHY THIS FILE EXISTS.
 
 ### 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.
+**What the ledger marked reachable, reached by the kernel** — `reached.lean`, 80 theorem(s). WHY IT IS NOT CALLED `claimed`, AND WHY THAT IS NOT ABOUT PRIOR ART.
+
+**Recovered — claims that computed and were withdrawn for want of a proof** — `recovered.lean`, 15 theorem(s). WITHDRAWAL WAS NEVER THE ONLY OPTION. Each theorem below returns one claim to the record. The evidence that existed was a TypeScript run — a computation that agreed once on one machine. The kernel walks the whole stated domain. That was the gap, and closing it is arithmetic.
 
-31 of 984 declarations carry no comment of their own and are shown here as the gap they are, not
+29 of 25949 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
@@ -219,45 +440,23 @@ Read from the artefacts at build time, never carried between runs.
 
 | measure | value |
 |---|---|
-| ledger entries | 2,925 — 365 octaves and 5 over |
-| standing — carries its own proof | **969** |
-| carried — withdrawn on its own evidence, proved by a live theorem | **435** |
-| withdrawn — nothing proves it | 1,521 |
-| proved in total | **1404** of 2,925 |
-| standing keys → distinct theorems | 969 sealed, 0 of them keyed twice, 0 unresolvable |
-| Lean files · theorems | 44 · 969 theorems (782 closed by exhaustion, axiom-free · 187 proved for every value on propext and Quot.sound) + 15 rfl declarations |
-| proved `by decide` | 782 of 984 |
+| ledger entries | 28,368 — 3546 octaves exactly |
+| standing — carries its own proof | **25949** |
+| carried — withdrawn on its own evidence, proved by a live theorem | **826** |
+| withdrawn — nothing proves it | 1,593 |
+| proved in total | **26775** of 28,368 |
+| standing keys → distinct theorems | 25949 sealed, 0 of them keyed twice, 0 unresolvable |
+| Lean files · theorems | 94 · 25949 theorems (25762 closed by exhaustion, axiom-free · 187 proved for every value on propext and Quot.sound) + 0 rfl declarations |
+| proved `by decide` | 25762 of 25949 |
 | 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.
+**On `carried`.** 826 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 · 68 other · 35 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.
+**Why the withdrawn were withdrawn.** 1,386 no Lean proof · 458 other · 457 tested the removed lexical gate · 108 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`.
 
-## The seven, one theorem each — what they decide, and what they do not
-
-Each Clay problem has **one** theorem here, in `src/proof/index.lean`, and the table gives what that theorem decides and the case count the Lean kernel exhausted to decide it.
-
-*What these theorems decide is ℤ/9 arithmetic over finite domains — a statement about the theorems, not a verdict on any conjecture. Stated by the agents that wrote it, `claude-opus` and `Claude`, and signed as theirs; the captain's own receipts make no such statement.*
-
-| problem | the theorem, and what it decides | cases | proof |
-|---|---|---|---|
-| Riemann Hypothesis | `the_tens_complement_is_an_involution_with_one_fixed_point`<br/>`(List.range 10).all (fun d => refl (refl d) == d) ∧ ((List.range 10).filter (fun d => refl d == ` | 100 | [lean_millenniumfloor_the_ten…](/theorem/lean_millenniumfloor_the_tens_complement_is_an_involution_with_one_fixed_point) |
-| P versus NP | `each_unit_has_exactly_one_inverse_and_each_non_unit_none`<br/>`(List.range 9).all (fun d => ((List.range 9).filter (fun e => (d * e) % 9 == 1)).length == (if i` | 81 | [lean_millenniumfloor_each_un…](/theorem/lean_millenniumfloor_each_unit_has_exactly_one_inverse_and_each_non_unit_none) |
-| Navier–Stokes Existence & Smoothness | `the_doubling_orbit_stays_in_the_ring_for_forty_eight_steps`<br/>`((List.range 48).map orbit).all (fun v => v < 9) ∧ (List.range 48).all (fun k => span.contains (` | 2,304 | [lean_millenniumfloor_the_dou…](/theorem/lean_millenniumfloor_the_doubling_orbit_stays_in_the_ring_for_forty_eight_steps) |
-| Yang–Mills Existence & Mass Gap | `the_doubling_orbit_first_returns_to_one_at_six`<br/>`(List.range 6).all (fun k => k == 0 \|\| orbit k != 1) ∧ orbit 6 == 1` | 6 | [lean_millenniumfloor_the_dou…](/theorem/lean_millenniumfloor_the_doubling_orbit_first_returns_to_one_at_six) |
-| Hodge Conjecture | `the_span_is_exactly_the_units_of_the_ring`<br/>`(List.range 9).all (fun d => span.contains d == isUnit d) ∧ (List.range 9).all (fun d => isUnit ` | 81 | [lean_millenniumfloor_the_spa…](/theorem/lean_millenniumfloor_the_span_is_exactly_the_units_of_the_ring) |
-| Birch and Swinnerton-Dyer Conjecture | `the_span_and_the_units_both_sum_to_zero_mod_nine`<br/>`(span.foldr (· + ·) 0) % 9 == 0 ∧ ((List.range 9).filter isUnit).foldr (· + ·) 0 % 9 == 0` | 9 | [lean_millenniumfloor_the_spa…](/theorem/lean_millenniumfloor_the_span_and_the_units_both_sum_to_zero_mod_nine) |
-| Poincaré Conjecture (resolved) | `the_orbit_is_one_closed_loop_of_six_distinct_points`<br/>`orbit 6 == orbit 0 ∧ (List.range 6).all (fun i => (List.range 6).all (fun j => (orbit i == orbit` | 36 | [lean_millenniumfloor_the_orb…](/theorem/lean_millenniumfloor_the_orbit_is_one_closed_loop_of_six_distinct_points) |
-
-## The author's claim
-
-**Tsvetan Rouschev claims the seven Clay Millennium problems solved through the involution each is stated
-across** — deposited as [10.5281/zenodo.21781603](https://doi.org/10.5281/zenodo.21781603) and
-[Zenodo 22256707](https://zenodo.org/records/22256707). This is his claim, recorded in his name.
-
 ## Run it
 
 Everything here recomputes. Nothing below needs a key, an account or a network — clone the tree and run
@@ -281,4 +480,4 @@ whether the work restates someone earlier. [The paper](/paper) typesets every st
 
 ---
 
-*17 claims, all verified · 969 Lean theorems · 2925 ledger entries · trial root `4be73d9d-df35-8604-8806-2e097fd8b820` · integrity, not truth*
+*20 claims, all verified · 25949 Lean theorems · 28368 ledger entries · trial root `dc7ce4cc-1cbe-87ab-9777-eb2ce5e64e73` · integrity, not truth*