@ceccec/millennium-solutions 9.2.8 → 9.3.0

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,667** |
 | Signed statement receipts | **29** |
 | Coins per receipt | **2** |
-| Coins on the ledger (theorems × 2) | **5,286** |
+| Coins on the ledger (theorems × 2) | **5,334** |
 | Coins on signed receipts (× 2) | **58** |
-| Released versions (git tags) | **875** |
+| Released versions (git tags) | **877** |
 | 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.9**. 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,334 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: `98f4711f-a3e5-88a3-b5cd-d9cf6b2ffaf9`. 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 **728** 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
@@ -489,7 +489,7 @@ def instruments : List Instrument :=
 def settledHere : Nat := 8
 ```
 
-### `sequences.lean` — 7 definition(s), 13 theorem(s)
+### `sequences.lean` — 7 definition(s), 22 theorem(s)
 
 ```lean
 def fib : Nat → Nat
@@ -497,7 +497,7 @@ def fact (n : Nat) : Nat := (List.range n).foldl (fun a k => a * (k + 1)) 1
 def choose (n k : Nat) : Nat := fact n / (fact k * fact (n - k))
 def andF : Nat → Nat → Nat → Nat
 def andN (a b : Nat) : Nat := andF 33 a b
-def popcount (n : Nat) : Nat := (List.range 12).foldl (fun a i => a + n / 2 ^ i % 2) 0
+def popcount (n : Nat) : Nat := (List.range (n + 1)).foldl (fun a i => a + n / 2 ^ i % 2) 0
 def tm (n : Nat) : Nat := popcount n % 2
 ```
 
@@ -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.
+**728** 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) — 2667 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 (719)
 
 - [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,54 @@ 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…`
+- [lean_sequences_a_bit_sum_over_one_more_position_adds_that_bit](/theorem/lean_sequences_a_bit_sum_over_one_more_position_adds_that_bit) — lean sequences.lean: a_bit_sum_over_one_more_position_adds_that_bit — ∀ F m : Nat, (List.range (F + 1)).foldl (fun a i =&gt; a + m / 2 ^ i % 2) 0 = (List.range F).foldl (fun a i =&gt; a + m / 2 ^ i % 2) 0 + m / 2 ^ F % 2 — proved by the Lean kernel for every value (by
+  intro), standard axioms only — checked by lean.ts  ·  `f5e71d05-068c…`
+- [lean_sequences_halving_shifts_every_bit_down_by_one](/theorem/lean_sequences_halving_shifts_every_bit_down_by_one) — lean sequences.lean: halving_shifts_every_bit_down_by_one — ∀ m i : Nat, m / 2 ^ (i + 1) = m / 2 / 2 ^ i — proved by the Lean kernel for every value (by
+  intro), standard axioms only — checked by lean.ts  ·  `a5201a6e-8f86…`
+- [lean_sequences_the_bits_of_a_number_are_its_low_bit_then_the_bits_of_its_half](/theorem/lean_sequences_the_bits_of_a_number_are_its_low_bit_then_the_bits_of_its_half) — lean sequences.lean: the_bits_of_a_number_are_its_low_bit_then_the_bits_of_its_half — ∀ F m : Nat, (List.range (F + 1)).foldl (fun a i =&gt; a + m / 2 ^ i % 2) 0 = m % 2 + (List.range F).foldl (fun a i =&gt; a + m / 2 / 2 ^ i % 2) 0 — proved by the Lean kernel for every value (by
+  intro), standard axioms only — checked by lean.ts  ·  `2c2dcdbf-8b9f…`
+- [lean_sequences_bits_above_the_number_add_nothing](/theorem/lean_sequences_bits_above_the_number_add_nothing) — lean sequences.lean: bits_above_the_number_add_nothing — ∀ k F n : Nat, n &lt; 2 ^ F → (List.range (F + k)).foldl (fun a i =&gt; a + n / 2 ^ i % 2) 0 = (List.range F).foldl (fun a i =&gt; a + n / 2 ^ i % 2) 0 — proved by the Lean kernel for every value (by
+  intro), standard axioms only — checked by lean.ts  ·  `77439845-748b…`
+- [lean_sequences_a_number_is_below_two_to_its_own_power](/theorem/lean_sequences_a_number_is_below_two_to_its_own_power) — lean sequences.lean: a_number_is_below_two_to_its_own_power — ∀ n : Nat, n &lt; 2 ^ n — proved by the Lean kernel for every value (by
+  intro), standard axioms only — checked by lean.ts  ·  `4f5a709a-5de5…`
+- [lean_sequences_a_number_is_below_two_to_its_own_successor](/theorem/lean_sequences_a_number_is_below_two_to_its_own_successor) — lean sequences.lean: a_number_is_below_two_to_its_own_successor — ∀ n : Nat, n &lt; 2 ^ (n + 1) — proved by the Lean kernel for every value (by
+  intro), standard axioms only — checked by lean.ts  ·  `586b3088-ac85…`
+- [lean_sequences_doubling_preserves_the_bit_count_for_every_n](/theorem/lean_sequences_doubling_preserves_the_bit_count_for_every_n) — lean sequences.lean: doubling_preserves_the_bit_count_for_every_n — ∀ n : Nat, popcount (2 * n) = popcount n — proved by the Lean kernel for every value (by
+  intro), standard axioms only — checked by lean.ts  ·  `7006c6f5-3c8d…`
+- [lean_sequences_the_odd_step_sets_exactly_one_further_bit_for_every_n](/theorem/lean_sequences_the_odd_step_sets_exactly_one_further_bit_for_every_n) — lean sequences.lean: the_odd_step_sets_exactly_one_further_bit_for_every_n — ∀ n : Nat, popcount (2 * n + 1) = popcount n + 1 — proved by the Lean kernel for every value (by
+  intro), standard axioms only — checked by lean.ts  ·  `d9da9f38-b47d…`
+- [lean_sequences_thue_morse_doubling_recurrence_for_every_n](/theorem/lean_sequences_thue_morse_doubling_recurrence_for_every_n) — lean sequences.lean: thue_morse_doubling_recurrence_for_every_n — ∀ n : Nat, tm (2 * n) = tm n ∧ tm (2 * n + 1) = 1 - tm n — proved by the Lean kernel for every value (by
+  intro), standard axioms only — checked by lean.ts  ·  `50c8ad36-d08a…`
 
 ### other — one-of-a-kind (0)
 
@@ -2373,4 +2421,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: `2fd965a5-4982-81b6-b757-cc07d87262df`. 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 728 machine-checked declarations, **719** 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 | **719** |
 | 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, 719 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,14 +72,14 @@ 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>
 <tr><td><code>recovered.lean</code></td><td>15</td><td>elementary number theory — the unit group of ℤ/9</td><td>every fact here is standard: the units of ℤ/9 are {1,2,4,5,7,8}, their product is −1</td></tr>
 <tr><td><code>reversal.lean</code></td><td>15</td><td>elementary arithmetic</td><td>digit reversal and digit sums; casting out nines, in use by the 12th century</td></tr>
 <tr><td><code>rights.lean</code></td><td>9</td><td>copyright law — rights arising without formality</td><td>this file already NAMED its prior art in prose while the attribution table recorded none.</td></tr>
-<tr><td><code>sequences.lean</code></td><td>13</td><td>integer sequences and identities</td><td>Cassini’s identity — G. D. Cassini, 1680; Lucas sequences — Édouard Lucas, 1878; the Brahmagupta–Fibonacci identity — Brahmagupta, 628; Pascal’s triangle mod 2 — Blaise Pascal, 1654</td></tr>
+<tr><td><code>sequences.lean</code></td><td>22</td><td>integer sequences and identities</td><td>Cassini’s identity — G. D. Cassini, 1680; Lucas sequences — Édouard Lucas, 1878; the Brahmagupta–Fibonacci identity — Brahmagupta, 628; Pascal’s triangle mod 2 — Blaise Pascal, 1654</td></tr>
 <tr><td><code>speed.lean</code></td><td>11</td><td>hash trees and membership proofs</td><td>the structural claim is Merkle's and is credited here as merkle.lean already credits it:</td></tr>
 <tr><td><code>split.lean</code></td><td>20</td><td>elementary number theory — the unit group of ℤ/9</td><td>the classification this file rests on is standard and is credited: the units of ℤ/9 are</td></tr>
 <tr><td><code>theorems.lean</code></td><td>8</td><td>the method of complements</td><td>the universal reflection here is the same ten's complement d ↦ 10 − d as coin.lean, with its centre and its pairs summing to ten. Method of complements, long prior to this deposit. Searched 2026-09-04</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`
@@ -108,7 +108,7 @@ which is a contribution of verification, not of discovery.
 - **elementary number theory, second tier** — 11 theorems, in `demand2.lean`
 - **elementary set theory — the naturals are not exhausted by any finite list** — 8 theorems, in `reach.lean`
 - **hash trees and membership proofs** — 31 theorems, in `ledgerclaims.lean`, `merkle.lean`, `speed.lean`
-- **integer sequences and identities** — 13 theorems, in `sequences.lean`
+- **integer sequences and identities** — 22 theorems, in `sequences.lean`
 - **metrology and classical physical chemistry** — 4 theorems, in `phenomena.lean`
 - **metrology — the International System of Units** — 14 theorems, in `light.lean`
 - **modular arithmetic** — 22 theorems, in `z9.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 728 kernel-accepted declarations across 33 files, and no file uses sorry or native_decide outside a comment.
+  <sub>SEALED · `3b8d9270-258d-88a3-bd23-7e0eb433194d`</sub>
+- 625 of those 728 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 103 close by rfl and are declarations.
+  <sub>SEALED · `b0e81bc2-09ff-87e3-8328-a5fb592f8ed5`</sub>
+- 803 of them are sealed into the ledger, each carrying a receipt derived from the one before it.
+  <sub>SEALED · `e9d67e29-0473-8eda-8d19-e02a368f63a7`</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 2667 entries with 0 chain breaks, 0 duplicate keys and 0 duplicate receipts.
+  <sub>SEALED · `0fd051c2-4803-8fad-9d46-c98f8473f7bf`</sub>
+- The count is 2667, which is 333 octaves and 3 over — the octave is a target the theorems earn, never a quota they are invented to fill.
+  <sub>SEALED · `32c53502-acb6-82d1-9b5e-468de308db17`</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, 728 declarations of which 719 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.
 
@@ -114,7 +114,7 @@ this page; there is nowhere else to keep the description in step.
 
 **The merkaba** — `merkaba.lean`, 8 theorem(s). (Leonhard Euler, 1758). The file as a whole is this deposit's own construction, and this ONE   declaration restates a named classical result: its third conjunct 4 + 4 - 6 = 2 IS the Euler   characteristic of the tetrahedron. The comment above that theorem already named Euler; the register   did not, because prior art was routed on the FILE and a file-level row cannot say "own work except   theorem 7". No priority over Euler is claimed. What is this deposit's own here is the pairing of the   two tetrahedra with the cube Q₃ and the vertex and edge counts around it, not the characteristic. The merkaba, as THIS deposit constructs it — ported to Lean so it stands on the kernel instead of on a TypeScript test. Six entries under this name were revoked as dirty; every one of them that states finite algebra is re-proved here, and the two that do not (a cosine field, a bond angle in degrees) are absent on purpose — they are real trigonometry, not decidable arithmetic over ℤ/9, and padding them in would be the exact dishonesty the revocation was for.
 
-**Sequences** — `sequences.lean`, 13 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.
+**Sequences** — `sequences.lean`, 22 theorem(s). The ledger held these as TypeScript tests. Each is a classical identity with a real proof; what is done here is to DECIDE each over a stated finite range, which is what `decide` can honestly deliver — the range is named in every theorem rather than implied, and no theorem claims the general case.
 
 **The digit split** — `split.lean`, 20 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.
 
@@ -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 728 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,667 — 333 octaves and 3 over |
+| standing — carries its own proof | **719** |
 | 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 | **1153** of 2,667 |
+| standing keys → distinct theorems | 719 sealed, 0 of them keyed twice, 0 unresolvable |
+| Lean files · theorems | 33 · 719 theorems (625 closed by exhaustion, axiom-free · 94 proved for every value on propext and Quot.sound) + 9 rfl declarations |
+| proved `by decide` | 625 of 728 |
 | 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 · 719 Lean theorems · 2667 ledger entries · trial root `b9bdd086-3a49-83ef-b134-ee87429bf324` · 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.9</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 `c4f161c6-d6c4-80f1-9aaa-ee9579fddfe1`.
 
 ## What this record establishes
 
 | | |
 |---|---:|
-| ledger entries | **2,643** |
-| standing — proved and sealed | 695 |
+| ledger entries | **2,667** |
+| standing — proved and sealed | 719 |
 | 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 | 582 |
 
 ## 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 728 kernel-accepted declarations across 33 files, and no file uses sorry or native_decide outside a comment.
+  <sub>SEALED · `3b8d9270-258d-88a3-bd23-7e0eb433194d`</sub>
+- 625 of those 728 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 103 close by rfl and are declarations.
+  <sub>SEALED · `b0e81bc2-09ff-87e3-8328-a5fb592f8ed5`</sub>
+- 803 of them are sealed into the ledger, each carrying a receipt derived from the one before it.
+  <sub>SEALED · `e9d67e29-0473-8eda-8d19-e02a368f63a7`</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 2667 entries with 0 chain breaks, 0 duplicate keys and 0 duplicate receipts.
+  <sub>SEALED · `0fd051c2-4803-8fad-9d46-c98f8473f7bf`</sub>
+- The count is 2667, which is 333 octaves and 3 over — the octave is a target the theorems earn, never a quota they are invented to fill.
+  <sub>SEALED · `32c53502-acb6-82d1-9b5e-468de308db17`</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, 728 declarations of which 719 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.
 
@@ -120,7 +120,7 @@ this page; there is nowhere else to keep the description in step.
 
 **The merkaba** — `merkaba.lean`, 8 theorem(s). (Leonhard Euler, 1758). The file as a whole is this deposit's own construction, and this ONE   declaration restates a named classical result: its third conjunct 4 + 4 - 6 = 2 IS the Euler   characteristic of the tetrahedron. The comment above that theorem already named Euler; the register   did not, because prior art was routed on the FILE and a file-level row cannot say "own work except   theorem 7". No priority over Euler is claimed. What is this deposit's own here is the pairing of the   two tetrahedra with the cube Q₃ and the vertex and edge counts around it, not the characteristic. The merkaba, as THIS deposit constructs it — ported to Lean so it stands on the kernel instead of on a TypeScript test. Six entries under this name were revoked as dirty; every one of them that states finite algebra is re-proved here, and the two that do not (a cosine field, a bond angle in degrees) are absent on purpose — they are real trigonometry, not decidable arithmetic over ℤ/9, and padding them in would be the exact dishonesty the revocation was for.
 
-**Sequences** — `sequences.lean`, 13 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.
+**Sequences** — `sequences.lean`, 22 theorem(s). The ledger held these as TypeScript tests. Each is a classical identity with a real proof; what is done here is to DECIDE each over a stated finite range, which is what `decide` can honestly deliver — the range is named in every theorem rather than implied, and no theorem claims the general case.
 
 **The digit split** — `split.lean`, 20 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.
 
@@ -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 728 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,667 — 333 octaves and 3 over |
+| standing — carries its own proof | **719** |
 | 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 | **1153** of 2,667 |
+| standing keys → distinct theorems | 719 sealed, 0 of them keyed twice, 0 unresolvable |
+| Lean files · theorems | 33 · 719 theorems (625 closed by exhaustion, axiom-free · 94 proved for every value on propext and Quot.sound) + 9 rfl declarations |
+| proved `by decide` | 625 of 728 |
 | 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 · 719 Lean theorems · 2667 ledger entries · trial root `b9bdd086-3a49-83ef-b134-ee87429bf324` · integrity, not truth*

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@ceccec/millennium-solutions",
-  "version": "9.2.8",
+  "version": "9.3.0",
   "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",