@ceccec/millennium-solutions 9.2.8 → 9.2.9

package/ACCOUNTING.md

@@ -8,20 +8,20 @@ Every figure recomputes from `src/` and the git tree on each build; nothing is e
 
 | Quantity | Value |
 |---|---|
-| Decidable theorems (chained receipts) | **2,643** |
+| Decidable theorems (chained receipts) | **2,658** |
 | Signed statement receipts | **29** |
 | Coins per receipt | **2** |
-| Coins on the ledger (theorems × 2) | **5,286** |
+| Coins on the ledger (theorems × 2) | **5,316** |
 | Coins on signed receipts (× 2) | **58** |
-| Released versions (git tags) | **875** |
+| Released versions (git tags) | **876** |
 | Tracked, content-addressed files | **513** |
 
-Latest release: **v9.2.7**. The fair-exchange unit is **2 coins = 2 bits** (110 − 108 = 2 = −χ genus-2) per receipt. One 64-bit harmony coin is minted per fused `src` `report()` module — see the [state dashboard](/dashboard) for the harmonic root.
+Latest release: **v9.2.8**. The fair-exchange unit is **2 coins = 2 bits** (110 − 108 = 2 = −χ genus-2) per receipt. One 64-bit harmony coin is minted per fused `src` `report()` module — see the [state dashboard](/dashboard) for the harmonic root.
 
 ## Bounty — denominated in bits
 
-The bounty for each accepted contribution is **2 bits (2 coins)** — the same fair-exchange unit, earned by the deed (a gate-passing, receipted contribution) and owed by commercial use. Total bounty accounted on the ledger so far: **5,286 bits**. This is an accounting bounty in bits/coins — **integrity, not a cash prize**. Heroes and traitors by deeds, not claims.
+The bounty for each accepted contribution is **2 bits (2 coins)** — the same fair-exchange unit, earned by the deed (a gate-passing, receipted contribution) and owed by commercial use. Total bounty accounted on the ledger so far: **5,316 bits**. This is an accounting bounty in bits/coins — **integrity, not a cash prize**. Heroes and traitors by deeds, not claims.
 
 **Not tracked here: tokens.** This repo measures coins (2 per receipt) and 64-bit harmony coins; it does not measure tokens, so no token count or token-to-coin rate is shown — measuring an unmeasured quantity would be an assertion without a receipt. Measure, do not assert.
 
-Page content-address: `ef3135f5-191c-8ca1-bbaf-d55b3ccd656d`. Integrity, not truth.
+Page content-address: `7322551b-ae89-8587-968a-7114d16b4f57`. Integrity, not truth.

package/AXIOMS.md

@@ -5,7 +5,7 @@ title: The axiom index — what is assumed
 # The axiom index
 
 Every declaration in `src/proof` is checked with `#print axioms` on each build, and a dependency on any
-axiom fails the build rather than earning a footnote. All **704** report the same thing:
+axiom fails the build rather than earning a footnote. All **719** report the same thing:
 *does not depend on any axioms*.
 
 That is a real property, and it is not the whole picture. **Axiom-free is not assumption-free.** These
@@ -405,10 +405,10 @@ def perms : List (List Nat) → List (List (List Nat))
 def D : List Nat := toUuidBytes [100]  -- address of "d"
 ```
 
-### `nim.lean` — 7 definition(s), 10 theorem(s)
+### `nim.lean` — 7 definition(s), 25 theorem(s)
 
 ```lean
-def xorN (a b : Nat) : Nat := xorF 33 a b
+def xorN (a b : Nat) : Nat := xorF (a + b + 1) a b
 def N : Nat := 6
 def moves (a b : Nat) : List (Nat × Nat) :=
 def lost : Nat → Nat → Nat → Bool
@@ -569,6 +569,6 @@ def gcd9 (a b : Nat) : Nat := gcdF (a + b + 1) a b
 
 ---
 
-**704** declarations, **0** axiom dependencies, **321** definitions they rest on.
+**719** declarations, **0** axiom dependencies, **321** definitions they rest on.
 A content-address proves integrity, not truth, and an axiom index proves neither: it states what was
 assumed, so a reader can disagree with the assumptions rather than guess at them.

package/CHALLENGES.md

@@ -18,11 +18,11 @@ title: Challenges
 
 **Humanity: 1 / 7** (6 open). The author's own claim, that the seven are solved through involution, is stated in his name on the front page.
 
-## Discovered theorems (decidable, over ℤ/9) — 2643 standing in 1 families
+## Discovered theorems (decidable, over ℤ/9) — 2658 standing in 1 families
 
 Computed by exhaustion, each a monograph with its own page (`/theorem/<key>`) and chained receipt. Grouped by family (largest first) — easy to spot; use the search box for any keyword:
 
-### lean (695)
+### lean (710)
 
 - [lean_address_raw_bytes_of_a](/theorem/lean_address_raw_bytes_of_a) — lean address.lean: raw_bytes_of_a — rawBytes A = [88, 118, 248, 251, 63, 149, 14, 202, 10, 251, 189, 97, 221, 134, 206, 204] — decided by the Lean kernel over its whole finite domain, axiom-free  ·  `211de25d-e843…`
 - [lean_address_to_uuid_bytes_of_a](/theorem/lean_address_to_uuid_bytes_of_a) — lean address.lean: to_uuid_bytes_of_a — toUuidBytes A = [88, 118, 248, 251, 63, 149, 142, 202, 138, 251, 189, 97, 221, 134, 206, 204] — decided by the Lean kernel over its whole finite domain, axiom-free  ·  `c3f88cb7-dd38…`
@@ -789,6 +789,36 @@ Computed by exhaustion, each a monograph with its own page (`/theorem/<key>`) an
   have), standard axioms only — checked by lean.ts  ·  `43b9cdd8-7110…`
 - [lean_sequences_cassinis_identity_for_every_m](/theorem/lean_sequences_cassinis_identity_for_every_m) — lean sequences.lean: cassinis_identity_for_every_m — ∀ m : Nat, fib (2 * m + 1) * fib (2 * m + 3) = fib (2 * m + 2) * fib (2 * m + 2) + 1 ∧ fib (2 * m) * fib (2 * m + 2) + 1 = fib (2 * m + 1) * fib (2 * m + 1) — proved by the Lean kernel for every value (by
   intro), standard axioms only — checked by lean.ts  ·  `3b815427-42b8…`
+- [lean_nim_the_xor_of_two_bits_is_their_sum_mod_two](/theorem/lean_nim_the_xor_of_two_bits_is_their_sum_mod_two) — lean nim.lean: the_xor_of_two_bits_is_their_sum_mod_two — ∀ x y : Nat, (if x % 2 == y % 2 then 0 else 1) = (x + y) % 2 — proved by the Lean kernel for every value (by
+  intro), standard axioms only — checked by lean.ts  ·  `322304d5-f000…`
+- [lean_nim_xor_commutes_at_every_fuel](/theorem/lean_nim_xor_commutes_at_every_fuel) — lean nim.lean: xor_commutes_at_every_fuel — ∀ f a b : Nat, xorF f a b = xorF f b a — proved by the Lean kernel for every value (by
+  intro), standard axioms only — checked by lean.ts  ·  `b091d5a8-4e4a…`
+- [lean_nim_one_more_step_of_fuel_changes_nothing_once_it_exceeds_an_argument](/theorem/lean_nim_one_more_step_of_fuel_changes_nothing_once_it_exceeds_an_argument) — lean nim.lean: one_more_step_of_fuel_changes_nothing_once_it_exceeds_an_argument — ∀ f a b : Nat, (a &lt; f ∨ b &lt; f) → xorF (f + 1) a b = xorF f a b — proved by the Lean kernel for every value (by
+  intro), standard axioms only — checked by lean.ts  ·  `adf2ef5a-ef44…`
+- [lean_nim_more_fuel_changes_nothing_once_it_exceeds_an_argument](/theorem/lean_nim_more_fuel_changes_nothing_once_it_exceeds_an_argument) — lean nim.lean: more_fuel_changes_nothing_once_it_exceeds_an_argument — ∀ k f a b : Nat, (a &lt; f ∨ b &lt; f) → xorF (f + k) a b = xorF f a b — proved by the Lean kernel for every value (by
+  intro), standard axioms only — checked by lean.ts  ·  `961d94be-959c…`
+- [lean_nim_xor_reads_the_same_at_every_sufficient_fuel](/theorem/lean_nim_xor_reads_the_same_at_every_sufficient_fuel) — lean nim.lean: xor_reads_the_same_at_every_sufficient_fuel — ∀ g a b : Nat, (a &lt; g ∨ b &lt; g) → xorN a b = xorF g a b — proved by the Lean kernel for every value (by
+  intro), standard axioms only — checked by lean.ts  ·  `e04a45b5-8834…`
+- [lean_nim_a_number_xored_with_itself_is_zero_at_every_fuel](/theorem/lean_nim_a_number_xored_with_itself_is_zero_at_every_fuel) — lean nim.lean: a_number_xored_with_itself_is_zero_at_every_fuel — ∀ f b : Nat, xorF f b b = 0 — proved by the Lean kernel for every value (by
+  intro), standard axioms only — checked by lean.ts  ·  `409e78df-b565…`
+- [lean_nim_xor_splits_off_its_lowest_bit](/theorem/lean_nim_xor_splits_off_its_lowest_bit) — lean nim.lean: xor_splits_off_its_lowest_bit — ∀ g x c : Nat, 1 ≤ g → xorF (g + 1) x c = (x + c) % 2 + 2 * xorF g (x / 2) (c / 2) — proved by the Lean kernel for every value (by
+  intro), standard axioms only — checked by lean.ts  ·  `fa8f797f-95fa…`
+- [lean_nim_xor_undoes_itself_when_the_fuel_suffices](/theorem/lean_nim_xor_undoes_itself_when_the_fuel_suffices) — lean nim.lean: xor_undoes_itself_when_the_fuel_suffices — ∀ f a b g : Nat, (a &lt; f ∨ b &lt; f) → b &lt; g → xorF g (xorF f a b) b = a — proved by the Lean kernel for every value (by
+  intro), standard axioms only — checked by lean.ts  ·  `ba799e13-9cb6…`
+- [lean_nim_xor_is_commutative_for_every_a_b](/theorem/lean_nim_xor_is_commutative_for_every_a_b) — lean nim.lean: xor_is_commutative_for_every_a_b — ∀ a b : Nat, xorN a b = xorN b a — proved by the Lean kernel for every value (by
+  intro), standard axioms only — checked by lean.ts  ·  `e62bc467-f90b…`
+- [lean_nim_xor_zero_is_identity_for_every_a](/theorem/lean_nim_xor_zero_is_identity_for_every_a) — lean nim.lean: xor_zero_is_identity_for_every_a — ∀ a : Nat, xorN a 0 = a — proved by the Lean kernel for every value (by
+  intro), standard axioms only — checked by lean.ts  ·  `667bd69d-51ea…`
+- [lean_nim_xor_is_its_own_inverse_for_every_a_b](/theorem/lean_nim_xor_is_its_own_inverse_for_every_a_b) — lean nim.lean: xor_is_its_own_inverse_for_every_a_b — ∀ a b : Nat, xorN (xorN a b) b = a — proved by the Lean kernel for every value (by
+  intro), standard axioms only — checked by lean.ts  ·  `e2f6d0f1-2fa2…`
+- [lean_nim_xor_is_the_sum_of_the_bits_plus_twice_the_xor_of_the_halves](/theorem/lean_nim_xor_is_the_sum_of_the_bits_plus_twice_the_xor_of_the_halves) — lean nim.lean: xor_is_the_sum_of_the_bits_plus_twice_the_xor_of_the_halves — ∀ a b : Nat, xorN a b = (a + b) % 2 + 2 * xorN (a / 2) (b / 2) — proved by the Lean kernel for every value (by
+  intro), standard axioms only — checked by lean.ts  ·  `07c467d9-8226…`
+- [lean_nim_xor_is_associative_below_every_bound](/theorem/lean_nim_xor_is_associative_below_every_bound) — lean nim.lean: xor_is_associative_below_every_bound — ∀ n a b c : Nat, a + b + c ≤ n → xorN (xorN a b) c = xorN a (xorN b c) — proved by the Lean kernel for every value (by
+  intro), standard axioms only — checked by lean.ts  ·  `0c3ef805-2811…`
+- [lean_nim_xor_is_associative_for_every_a_b_c](/theorem/lean_nim_xor_is_associative_for_every_a_b_c) — lean nim.lean: xor_is_associative_for_every_a_b_c — ∀ a b c : Nat, xorN (xorN a b) c = xorN a (xorN b c) — proved by the Lean kernel for every value (by
+  intro), standard axioms only — checked by lean.ts  ·  `d2a922d9-f09d…`
+- [lean_nim_the_nim_sum_is_a_gf2_vector_addition_for_every_a_b_c](/theorem/lean_nim_the_nim_sum_is_a_gf2_vector_addition_for_every_a_b_c) — lean nim.lean: the_nim_sum_is_a_gf2_vector_addition_for_every_a_b_c — ∀ a b c : Nat, xorN a b = xorN b a ∧ xorN (xorN a b) c = xorN a (xorN b c) ∧ xorN (xorN a b) b = a ∧ xorN a 0 = a — proved by the Lean kernel for every value (by
+  intro), standard axioms only — checked by lean.ts  ·  `caa5c327-62cf…`
 
 ### other — one-of-a-kind (0)
 
@@ -2373,4 +2403,4 @@ Each was withdrawn for want of a Lean proof and has since been given one, at a n
 
 </details>
 
-Page content-address: `3778356e-7bfa-806f-8d89-3df0fc8dd2d0`. Integrity, not truth.
+Page content-address: `5a2e0a2b-7098-8bae-a674-038aab427755`. Integrity, not truth.

package/PRIOR-ART.md

@@ -6,7 +6,7 @@ head:
 ---
 # Prior art — what is restated, what is claimed, and the difference
 
-Of 704 machine-checked declarations, **695** restate work that already has an author and
+Of 719 machine-checked declarations, **710** restate work that already has an author and
 **9** are about this deposit's own construction. Each source file declares which it is, in its own
 frontmatter; [`src/proof/priorart.lean`](https://github.com/ceccec/millennium-solutions/blob/main/src/proof/priorart.lean)
 holds the same partition as a table the kernel decides over, and the build fails if the two disagree.
@@ -27,7 +27,7 @@ fact about the world, and this deposit does not assert it.
 
 | | theorems |
 |---|---|
-| attributed to named earlier work | **695** |
+| attributed to named earlier work | **710** |
 | unclassified — no search performed, status unknown | **9** |
 | claimed as novel | **0** |
 
@@ -47,7 +47,7 @@ searched, where, and when. An earlier version of this page claimed novelty for 1
 that nothing earlier exists because no one went to check is the same defect as asserting a proof because no
 one went to read it.
 
-## Restated from named earlier work — 32 sources, 695 theorems
+## Restated from named earlier work — 32 sources, 710 theorems
 
 No novelty is claimed over any of these. What is done here is to decide each over a stated finite domain,
 which is a contribution of verification, not of discovery.
@@ -72,7 +72,7 @@ which is a contribution of verification, not of discovery.
 <tr><td><code>mechanical.lean</code></td><td>119</td><td>Boolean algebra and elementary modular arithmetic</td><td>the Boolean rows are De Morgan's laws — Augustus De Morgan, 1847 — written in the arithmetic of {0,1}; the group rows are the additive group of Z/9. Both long prior. Searched 2026-09-04, terms "De Morgan's laws boolean algebra" and "additive group mod 9"; prior art found and credited</td></tr>
 <tr><td><code>merkaba.lean</code></td><td>8</td><td>elementary group theory — subgroups and cosets of Z/9</td><td>the partition into {3,6,9} and two three-element classes closed under doubling is the subgroup and coset structure of Z/9 under the action of U(9); Lagrange. One theorem already credits Euler for the polyhedron formula. Searched 2026-09-04; prior art found and credited</td></tr>
 <tr><td><code>merkle.lean</code></td><td>12</td><td>hash trees and membership proofs</td><td>the hash tree — Ralph Merkle, 1979 (thesis); CRYPTO 1987</td></tr>
-<tr><td><code>nim.lean</code></td><td>10</td><td>combinatorial game theory</td><td>Nim — Charles L. Bouton, 1901; the Sprague–Grundy theorem — Roland Sprague, 1935 and Patrick M. Grundy, 1939</td></tr>
+<tr><td><code>nim.lean</code></td><td>25</td><td>combinatorial game theory</td><td>Nim — Charles L. Bouton, 1901; the Sprague–Grundy theorem — Roland Sprague, 1935 and Patrick M. Grundy, 1939</td></tr>
 <tr><td><code>phenomena.lean</code></td><td>4</td><td>metrology and classical physical chemistry</td><td>the SI base quantities and their defining constants are definitions of the Conférence</td></tr>
 <tr><td><code>quantum.lean</code></td><td>12</td><td>canonical forms and order-invariant commitments</td><td>sorting a multiset into a canonical order BEFORE folding it is standard practice, not a</td></tr>
 <tr><td><code>reach.lean</code></td><td>8</td><td>elementary set theory — the naturals are not exhausted by any finite list</td><td>that no finite set contains every natural number is Euclid's argument in form and is as</td></tr>
@@ -91,7 +91,7 @@ which is a contribution of verification, not of discovery.
 
 - **Boolean algebra and elementary modular arithmetic** — 119 theorems, in `mechanical.lean`
 - **canonical forms and order-invariant commitments** — 12 theorems, in `quantum.lean`
-- **combinatorial game theory** — 10 theorems, in `nim.lean`
+- **combinatorial game theory** — 25 theorems, in `nim.lean`
 - **content addressing** — 18 theorems, in `address.lean`
 - **copyright law — rights arising without formality** — 9 theorems, in `rights.lean`
 - **electrochemistry and combustion** — 22 theorems, in `energy.lean`

package/README.md

@@ -11,12 +11,12 @@ last because the orbit never reaches it.
 
 ## 1 · What is proved
 
-- The formal layer holds 704 kernel-accepted declarations across 33 files, and no file uses sorry or native_decide outside a comment.
-  <sub>SEALED · `e4bd2d16-b7aa-8e7d-850a-9fb467ef588f`</sub>
-- 625 of those 704 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 79 close by rfl and are declarations.
-  <sub>SEALED · `0f333153-13b1-82ed-842d-5fb0ab0fc0f2`</sub>
-- 779 of them are sealed into the ledger, each carrying a receipt derived from the one before it.
-  <sub>SEALED · `0199dfbb-e1a6-819d-968d-ae5d42634e6e`</sub>
+- The formal layer holds 719 kernel-accepted declarations across 33 files, and no file uses sorry or native_decide outside a comment.
+  <sub>SEALED · `05adc83d-6246-8e72-9bc1-0780946929bc`</sub>
+- 625 of those 719 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 94 close by rfl and are declarations.
+  <sub>SEALED · `38d7a6f8-0290-8be1-8675-48a7525a385f`</sub>
+- 794 of them are sealed into the ledger, each carrying a receipt derived from the one before it.
+  <sub>SEALED · `8a5ba31c-e558-8006-a966-3af22a873101`</sub>
 
 ## 2 · The ring
 
@@ -39,10 +39,10 @@ last because the orbit never reaches it.
 
 ## 7 · The ledger
 
-- The ledger records 2643 entries with 0 chain breaks, 0 duplicate keys and 0 duplicate receipts.
-  <sub>SEALED · `4e1db028-dd3b-8957-bf46-c3a1699d2ba0`</sub>
-- The count is 2643, which is 330 octaves and 3 over — the octave is a target the theorems earn, never a quota they are invented to fill.
-  <sub>SEALED · `c07a1cee-06bd-8427-bae0-b30d2f9602ea`</sub>
+- The ledger records 2658 entries with 0 chain breaks, 0 duplicate keys and 0 duplicate receipts.
+  <sub>SEALED · `9cea92b5-8b5f-8d3f-b5d4-bdb8e1640ef5`</sub>
+- The count is 2658, which is 332 octaves and 2 over — the octave is a target the theorems earn, never a quota they are invented to fill.
+  <sub>SEALED · `8bea7052-b60e-8430-8762-e3958d7d550e`</sub>
 
 ## 5 · What the gate does and does not do
 
@@ -86,7 +86,7 @@ results; it is the result, read off the same arithmetic that produced the table.
 
 ## 7 · The proofs, as they document themselves
 
-33 Lean files in 7 wings, 704 declarations of which 695 are theorems. The prose in this section is read out of the
+33 Lean files in 7 wings, 719 declarations of which 710 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.
 
@@ -150,7 +150,7 @@ this page; there is nowhere else to keep the description in step.
 
 **Mechanically translated** — `mechanical.lean`, 119 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.
+**Nim** — `nim.lean`, 25 theorem(s). Nim — Bouton's theorem and Sprague–Grundy, decided.
 
 **Digit reversal** — `reversal.lean`, 15 theorem(s). Digit reversal — arithmetic, not string handling.
 
@@ -170,7 +170,7 @@ this page; there is nowhere else to keep the description in step.
 
 **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.
 
-20 of 704 declarations carry no comment of their own and are shown here as the gap they are, not
+20 of 719 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
@@ -179,14 +179,14 @@ Read from the artefacts at build time, never carried between runs.
 
 | measure | value |
 |---|---|
-| ledger entries | 2,643 — 330 octaves and 3 over |
-| standing — carries its own proof | **695** |
+| ledger entries | 2,658 — 332 octaves and 2 over |
+| standing — carries its own proof | **710** |
 | carried — withdrawn on its own evidence, proved by a live theorem | **434** |
 | withdrawn — nothing proves it | 1,514 |
-| proved in total | **1129** of 2,643 |
-| standing keys → distinct theorems | 695 sealed, 0 of them keyed twice, 0 unresolvable |
-| Lean files · theorems | 33 · 695 theorems (625 closed by exhaustion, axiom-free · 70 proved for every value on propext and Quot.sound) + 9 rfl declarations |
-| proved `by decide` | 625 of 704 |
+| proved in total | **1144** of 2,658 |
+| standing keys → distinct theorems | 710 sealed, 0 of them keyed twice, 0 unresolvable |
+| Lean files · theorems | 33 · 710 theorems (625 closed by exhaustion, axiom-free · 85 proved for every value on propext and Quot.sound) + 9 rfl declarations |
+| proved `by decide` | 625 of 719 |
 | claims a machine can render | 103 of 1,555 |
 | claims needing an author | 1,452 — reported, never faked |
 
@@ -225,4 +225,4 @@ whether the work restates someone earlier. [The paper](/paper) typesets every st
 
 ---
 
-*15 claims, all verified · 695 Lean theorems · 2643 ledger entries · trial root `e916095e-0d38-804d-aae2-1b9ebec084d2` · integrity, not truth*
+*15 claims, all verified · 710 Lean theorems · 2658 ledger entries · trial root `1f154b05-f0a9-891d-823d-28e71708b84e` · integrity, not truth*

package/dashboard.md

@@ -24,7 +24,7 @@ import { withBase } from 'vitepress'
 ## Fact — measured state
 
 <div class="dash-grid">
-<div class="dash-card"><div class="dash-k">Version</div><div class="dash-v">v9.2.7</div><div class="dash-s">git tag (single source)</div></div>
+<div class="dash-card"><div class="dash-k">Version</div><div class="dash-v">v9.2.8</div><div class="dash-s">git tag (single source)</div></div>
 <div class="dash-card"><div class="dash-k">Honesty gate</div><div class="dash-v">sealed</div><div class="dash-s">every citation live in the ledger</div></div>
 <div class="dash-card"><div class="dash-k">Link coverage</div><div class="dash-v">100%</div><div class="dash-s">gate-enforced — the build fails below 100%</div></div>
 <a class="dash-card" :href="withBase('/sitemap.json')" style="text-decoration:none;display:block"><div class="dash-k">Seal root</div><div class="dash-v" style="color:var(--vp-c-brand-1)">live →</div><div class="dash-s">merkle of the whole, current at /sitemap.json</div></a>

package/forensic.md

@@ -5,18 +5,18 @@ 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 `2fcd5658-f204-8aaa-8b95-be61446d03bc`.
+`npm run forensic`. Content-address `15ae86d6-8d9e-8ef4-8a0e-fad4023ea1a4`.
 
 ## What this record establishes
 
 | | |
 |---|---:|
-| ledger entries | **2,643** |
-| standing — proved and sealed | 695 |
+| ledger entries | **2,658** |
+| standing — proved and sealed | 710 |
 | carried — withdrawn, proved by a live theorem | 434 |
 | withdrawn — nothing currently proves them | 1,514 |
 | receipt chain, recomputed | **0 breaks — intact** |
-| commits that changed ledger state | 580 |
+| commits that changed ledger state | 581 |
 
 ## Why entries were withdrawn — the reason recorded at the time
 

package/index.md

@@ -17,12 +17,12 @@ last because the orbit never reaches it.
 
 ## 1 · What is proved
 
-- The formal layer holds 704 kernel-accepted declarations across 33 files, and no file uses sorry or native_decide outside a comment.
-  <sub>SEALED · `e4bd2d16-b7aa-8e7d-850a-9fb467ef588f`</sub>
-- 625 of those 704 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 79 close by rfl and are declarations.
-  <sub>SEALED · `0f333153-13b1-82ed-842d-5fb0ab0fc0f2`</sub>
-- 779 of them are sealed into the ledger, each carrying a receipt derived from the one before it.
-  <sub>SEALED · `0199dfbb-e1a6-819d-968d-ae5d42634e6e`</sub>
+- The formal layer holds 719 kernel-accepted declarations across 33 files, and no file uses sorry or native_decide outside a comment.
+  <sub>SEALED · `05adc83d-6246-8e72-9bc1-0780946929bc`</sub>
+- 625 of those 719 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 94 close by rfl and are declarations.
+  <sub>SEALED · `38d7a6f8-0290-8be1-8675-48a7525a385f`</sub>
+- 794 of them are sealed into the ledger, each carrying a receipt derived from the one before it.
+  <sub>SEALED · `8a5ba31c-e558-8006-a966-3af22a873101`</sub>
 
 ## 2 · The ring
 
@@ -45,10 +45,10 @@ last because the orbit never reaches it.
 
 ## 7 · The ledger
 
-- The ledger records 2643 entries with 0 chain breaks, 0 duplicate keys and 0 duplicate receipts.
-  <sub>SEALED · `4e1db028-dd3b-8957-bf46-c3a1699d2ba0`</sub>
-- The count is 2643, which is 330 octaves and 3 over — the octave is a target the theorems earn, never a quota they are invented to fill.
-  <sub>SEALED · `c07a1cee-06bd-8427-bae0-b30d2f9602ea`</sub>
+- The ledger records 2658 entries with 0 chain breaks, 0 duplicate keys and 0 duplicate receipts.
+  <sub>SEALED · `9cea92b5-8b5f-8d3f-b5d4-bdb8e1640ef5`</sub>
+- The count is 2658, which is 332 octaves and 2 over — the octave is a target the theorems earn, never a quota they are invented to fill.
+  <sub>SEALED · `8bea7052-b60e-8430-8762-e3958d7d550e`</sub>
 
 ## 5 · What the gate does and does not do
 
@@ -92,7 +92,7 @@ results; it is the result, read off the same arithmetic that produced the table.
 
 ## 7 · The proofs, as they document themselves
 
-33 Lean files in 7 wings, 704 declarations of which 695 are theorems. The prose in this section is read out of the
+33 Lean files in 7 wings, 719 declarations of which 710 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.
 
@@ -156,7 +156,7 @@ this page; there is nowhere else to keep the description in step.
 
 **Mechanically translated** — `mechanical.lean`, 119 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.
+**Nim** — `nim.lean`, 25 theorem(s). Nim — Bouton's theorem and Sprague–Grundy, decided.
 
 **Digit reversal** — `reversal.lean`, 15 theorem(s). Digit reversal — arithmetic, not string handling.
 
@@ -176,7 +176,7 @@ this page; there is nowhere else to keep the description in step.
 
 **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.
 
-20 of 704 declarations carry no comment of their own and are shown here as the gap they are, not
+20 of 719 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
@@ -185,14 +185,14 @@ Read from the artefacts at build time, never carried between runs.
 
 | measure | value |
 |---|---|
-| ledger entries | 2,643 — 330 octaves and 3 over |
-| standing — carries its own proof | **695** |
+| ledger entries | 2,658 — 332 octaves and 2 over |
+| standing — carries its own proof | **710** |
 | carried — withdrawn on its own evidence, proved by a live theorem | **434** |
 | withdrawn — nothing proves it | 1,514 |
-| proved in total | **1129** of 2,643 |
-| standing keys → distinct theorems | 695 sealed, 0 of them keyed twice, 0 unresolvable |
-| Lean files · theorems | 33 · 695 theorems (625 closed by exhaustion, axiom-free · 70 proved for every value on propext and Quot.sound) + 9 rfl declarations |
-| proved `by decide` | 625 of 704 |
+| proved in total | **1144** of 2,658 |
+| standing keys → distinct theorems | 710 sealed, 0 of them keyed twice, 0 unresolvable |
+| Lean files · theorems | 33 · 710 theorems (625 closed by exhaustion, axiom-free · 85 proved for every value on propext and Quot.sound) + 9 rfl declarations |
+| proved `by decide` | 625 of 719 |
 | claims a machine can render | 103 of 1,555 |
 | claims needing an author | 1,452 — reported, never faked |
 
@@ -214,4 +214,4 @@ across** — deposited as [10.5281/zenodo.21781603](https://doi.org/10.5281/zeno
 
 ---
 
-*15 claims, all verified · 695 Lean theorems · 2643 ledger entries · trial root `e916095e-0d38-804d-aae2-1b9ebec084d2` · integrity, not truth*
+*15 claims, all verified · 710 Lean theorems · 2658 ledger entries · trial root `1f154b05-f0a9-891d-823d-28e71708b84e` · integrity, not truth*

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@ceccec/millennium-solutions",
-  "version": "9.2.8",
+  "version": "9.2.9",
   "description": "Verifiable, recomputable ℤ/9 vortex framework in ONE package — content-addressing, audit ledger, exact arithmetic, and the honesty toolkit. Facts only.",
   "author": {
     "name": "Tsvetan Rouschev",