@ceccec/millennium-solutions 9.3.0 → 9.3.2

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,667** |
+| Decidable theorems (chained receipts) | **2,674** |
 | Signed statement receipts | **29** |
 | Coins per receipt | **2** |
-| Coins on the ledger (theorems × 2) | **5,334** |
+| Coins on the ledger (theorems × 2) | **5,348** |
 | Coins on signed receipts (× 2) | **58** |
-| Released versions (git tags) | **877** |
+| Released versions (git tags) | **879** |
 | Tracked, content-addressed files | **513** |
 
-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.
+Latest release: **v9.3.1**. 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,334 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,348 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: `98f4711f-a3e5-88a3-b5cd-d9cf6b2ffaf9`. Integrity, not truth.
+Page content-address: `e1c80033-23d5-8d55-af4e-f4cd2e657479`. 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 **728** report the same thing:
+axiom fails the build rather than earning a footnote. All **735** 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
@@ -96,7 +96,7 @@ Each of these is a primitive of this deposit — not derived, not proved, chosen
 because a reader checking a theorem must be able to read the definition it is about, and because a
 deposit that reports its axiom count and hides its definition count is reporting the flattering half.
 
-### `address.lean` — 12 definition(s), 18 theorem(s)
+### `address.lean` — 12 definition(s), 23 theorem(s)
 
 ```lean
 def andF : Nat → Nat → Nat → Nat
@@ -110,7 +110,7 @@ def stamp (bs : List Nat) : List Nat :=
 def toUuidBytes (cs : List Nat) : List Nat := stamp (rawBytes cs)
 def A : List Nat := [97]                                    -- "a"
 def UUIDNA : List Nat := [117, 117, 105, 100, 110, 97]      -- "uuidna"
-def settledHere : Nat := 17
+def settledHere : Nat := 20
 ```
 
 ### `coin.lean` — 7 definition(s), 12 theorem(s)
@@ -164,7 +164,7 @@ def pp2000 : List Nat := perfectPowersUpTo 2000
 def aliquot (n : Nat) : Nat := ((List.range' 1 (n - 1)).filter (fun d => n % d == 0)).foldl (· + ·) 0
 ```
 
-### `demand3.lean` — 12 definition(s), 14 theorem(s)
+### `demand3.lean` — 12 definition(s), 15 theorem(s)
 
 ```lean
 def isSumOfFour (n : Nat) : Bool :=
@@ -295,7 +295,7 @@ def schlafli : List (Nat × Nat) :=
 def settledHere : Nat := 42
 ```
 
-### `fnv.lean` — 13 definition(s), 13 theorem(s)
+### `fnv.lean` — 13 definition(s), 14 theorem(s)
 
 ```lean
 def xorF : Nat → Nat → Nat → Nat
@@ -569,6 +569,6 @@ def gcd9 (a b : Nat) : Nat := gcdF (a + b + 1) a b
 
 ---
 
-**728** declarations, **0** axiom dependencies, **321** definitions they rest on.
+**735** 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) — 2667 standing in 1 families
+## Discovered theorems (decidable, over ℤ/9) — 2674 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 (719)
+### lean (726)
 
 - [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…`
@@ -837,6 +837,16 @@ Computed by exhaustion, each a monograph with its own page (`/theorem/<key>`) an
   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…`
+- [lean_address_the_version_stamp_keeps_the_low_nibble_of_every_byte](/theorem/lean_address_the_version_stamp_keeps_the_low_nibble_of_every_byte) — lean address.lean: the_version_stamp_keeps_the_low_nibble_of_every_byte — ∀ b : Nat, b &lt; 256 → or8 (and8 b 15) 128 = 128 + b % 16 — decided by the Lean kernel over its whole finite domain, axiom-free  ·  `913d0338-59bc…`
+- [lean_address_the_variant_stamp_keeps_the_low_six_bits_of_every_byte](/theorem/lean_address_the_variant_stamp_keeps_the_low_six_bits_of_every_byte) — lean address.lean: the_variant_stamp_keeps_the_low_six_bits_of_every_byte — ∀ b : Nat, b &lt; 256 → or8 (and8 b 63) 128 = 128 + b % 64 — decided by the Lean kernel over its whole finite domain, axiom-free  ·  `fbc0f2d4-3490…`
+- [lean_address_stamping_twice_is_stamping_once](/theorem/lean_address_stamping_twice_is_stamping_once) — lean address.lean: stamping_twice_is_stamping_once — ∀ b : Nat, b &lt; 256 → or8 (and8 (or8 (and8 b 15) 128) 15) 128 = or8 (and8 b 15) 128 ∧ or8 (and8 (or8 (and8 b 63) 128) 63) 128 = or8 (and8 b 63) 128 — decided by the Lean kernel over its whole finite domain, axiom-free  ·  `c397ec59-2a56…`
+- [lean_demand3_the_two_coin_fare_is_minus_the_euler_characteristic_at_genus_two](/theorem/lean_demand3_the_two_coin_fare_is_minus_the_euler_characteristic_at_genus_two) — lean demand3.lean: the_two_coin_fare_is_minus_the_euler_characteristic_at_genus_two — (110 : Int) - 108 = - chi 2 — decided by the Lean kernel over its whole finite domain, axiom-free  ·  `665800be-8ca8…`
+- [lean_address_the_third_group_is_version_eight_over_twelve_hash_bits](/theorem/lean_address_the_third_group_is_version_eight_over_twelve_hash_bits) — lean address.lean: the_third_group_is_version_eight_over_twelve_hash_bits — ∀ b6 b7 : Nat, b6 &lt; 256 → b7 &lt; 256 → (or8 (and8 b6 15) 128) * 256 + b7 = 8 * 4096 + (b6 % 16 * 256 + b7) ∧ b6 % 16 * 256 + b7 &lt; 4096 — proved by the Lean kernel for every value (by
+  intro), standard axioms only — checked by lean.ts  ·  `136a86a7-b50b…`
+- [lean_address_the_fourth_group_is_variant_two_over_fourteen_hash_bits](/theorem/lean_address_the_fourth_group_is_variant_two_over_fourteen_hash_bits) — lean address.lean: the_fourth_group_is_variant_two_over_fourteen_hash_bits — ∀ b8 b9 : Nat, b8 &lt; 256 → b9 &lt; 256 → (or8 (and8 b8 63) 128) * 256 + b9 = 2 * 16384 + (b8 % 64 * 256 + b9) ∧ b8 % 64 * 256 + b9 &lt; 16384 — proved by the Lean kernel for every value (by
+  intro), standard axioms only — checked by lean.ts  ·  `087841c4-271d…`
+- [lean_fnv_the_split_multiply_is_the_exact_thirty_two_bit_product](/theorem/lean_fnv_the_split_multiply_is_the_exact_thirty_two_bit_product) — lean fnv.lean: the_split_multiply_is_the_exact_thirty_two_bit_product — ∀ a b : Nat, (a % 65536 * b + a / 65536 * b % 65536 * 65536) % M32 = mul32 a b — proved by the Lean kernel for every value (by
+  intro), standard axioms only — checked by lean.ts  ·  `71d78d5c-0f87…`
 
 ### other — one-of-a-kind (0)
 
@@ -2421,4 +2431,4 @@ Each was withdrawn for want of a Lean proof and has since been given one, at a n
 
 </details>
 
-Page content-address: `2fd965a5-4982-81b6-b757-cc07d87262df`. Integrity, not truth.
+Page content-address: `d6ba53ba-1a3b-8cf9-90c0-a7b187457d7f`. Integrity, not truth.

package/PRIOR-ART.md

@@ -6,7 +6,7 @@ head:
 ---
 # Prior art — what is restated, what is claimed, and the difference
 
-Of 728 machine-checked declarations, **719** restate work that already has an author and
+Of 735 machine-checked declarations, **726** 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 | **719** |
+| attributed to named earlier work | **726** |
 | unclassified — no search performed, status unknown | **9** |
 | claimed as novel | **0** |
 
@@ -47,22 +47,22 @@ 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, 719 theorems
+## Restated from named earlier work — 32 sources, 726 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.
 
 <table><thead><tr><th>source</th><th>theorems</th><th>domain</th><th>whose work</th></tr></thead><tbody>
-<tr><td><code>address.lean</code></td><td>18</td><td>content addressing</td><td>composes FNV-1a (Fowler, Noll, Vo, 1991) with the Merkle hash tree (Merkle, 1979)</td></tr>
+<tr><td><code>address.lean</code></td><td>23</td><td>content addressing</td><td>composes FNV-1a (Fowler, Noll, Vo, 1991) with the Merkle hash tree (Merkle, 1979)</td></tr>
 <tr><td><code>coin.lean</code></td><td>12</td><td>the method of complements</td><td>the reflection d ↦ 10 − d is the TEN'S COMPLEMENT, and its sibling 9 − d the nines' complement — the method of complements, used to turn subtraction into addition in Pascal's calculator (1642), the Comptometer and the Curta, and in modern computer arithmetic. That it is an involution with a single fixed point is the property those machines rely on. Searched 2026-09-04, term "method of complements / nines' complement / ten's complement"; prior art found and credited</td></tr>
 <tr><td><code>demand.lean</code></td><td>9</td><td>elementary number theory</td><td>the named results the search data asks for — Bézout’s identity (Étienne Bézout, 1779; Bachet, 1624), the Chinese remainder theorem (Sunzi, c. 3rd–5th century), and others named in their theorems</td></tr>
 <tr><td><code>demand2.lean</code></td><td>11</td><td>elementary number theory, second tier</td><td>Wilson’s theorem — John Wilson; first proved by Joseph-Louis Lagrange, 1771; the Catalan conjecture on consecutive perfect powers — Eugène Catalan, 1844; proved by Preda Mihăilescu, 2002</td></tr>
-<tr><td><code>demand3.lean</code></td><td>14</td><td>elementary number theory, named results</td><td>Legendre’s three-square theorem — Adrien-Marie Legendre, 1797; Carmichael numbers — Robert Carmichael, 1910; amicable pairs — known to antiquity</td></tr>
+<tr><td><code>demand3.lean</code></td><td>15</td><td>elementary number theory, named results</td><td>Legendre’s three-square theorem — Adrien-Marie Legendre, 1797; Carmichael numbers — Robert Carmichael, 1910; amicable pairs — known to antiquity</td></tr>
 <tr><td><code>elementary.lean</code></td><td>37</td><td>elementary number theory and combinatorial game theory</td><td>Euclid (Elements IX.36) and Euler for the even perfect numbers; the amicable pair</td></tr>
 <tr><td><code>energy.lean</code></td><td>22</td><td>electrochemistry and combustion</td><td>the laws of electrolysis — Michael Faraday, 1834; the enthalpy of combustion of hydrogen, standard physical chemistry</td></tr>
 <tr><td><code>families.lean</code></td><td>55</td><td>modular arithmetic, quantified</td><td>quantifies the ℤ/9 arithmetic above; the underlying results are Fermat’s, Euler’s and Gauss’s</td></tr>
 <tr><td><code>flow.lean</code></td><td>3</td><td>elementary number theory — the multiplicative order of 2 modulo 9</td><td>2⁶ = 64 ≡ 1 (mod 9), so the powers of two modulo 9 repeat with period six — Euler's</td></tr>
-<tr><td><code>fnv.lean</code></td><td>13</td><td>non-cryptographic hashing</td><td>FNV-1a — Glenn Fowler, Landon Curt Noll and Phong Vo, 1991</td></tr>
+<tr><td><code>fnv.lean</code></td><td>14</td><td>non-cryptographic hashing</td><td>FNV-1a — Glenn Fowler, Landon Curt Noll and Phong Vo, 1991</td></tr>
 <tr><td><code>generated.lean</code></td><td>13</td><td>elementary number theory — the unit group of ℤ/9 and the doubling orbit</td><td>the structure underneath is standard and is credited. The doubling orbit</td></tr>
 <tr><td><code>imagined.lean</code></td><td>118</td><td>elementary number theory — the unit group of Z/9</td><td>the doubling orbit 1,2,4,8,7,5 is the cyclic group U(9), which is cyclic of order 6 generated by 2, with units {1,2,4,5,7,8} = φ(9); 2 and 5 are its only generators. Standard elementary number theory, in Gauss and in every abstract-algebra text. The closure statements quantify that structure. Searched 2026-09-04, term "multiplicative group of units mod 9 cyclic order 6 generated by 2"; prior art found and credited</td></tr>
 <tr><td><code>index.lean</code></td><td>11</td><td>elementary number theory — the unit group of ℤ/9 and the doubling orbit</td><td>the structure underneath is standard and is credited. The doubling orbit</td></tr>
@@ -92,7 +92,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** — 25 theorems, in `nim.lean`
-- **content addressing** — 18 theorems, in `address.lean`
+- **content addressing** — 23 theorems, in `address.lean`
 - **copyright law — rights arising without formality** — 9 theorems, in `rights.lean`
 - **electrochemistry and combustion** — 22 theorems, in `energy.lean`
 - **elementary arithmetic** — 15 theorems, in `reversal.lean`
@@ -104,7 +104,7 @@ which is a contribution of verification, not of discovery.
 - **elementary number theory — the unit group of Z/9** — 118 theorems, in `imagined.lean`
 - **elementary number theory — the unit group of ℤ/9** — 35 theorems, in `recovered.lean`, `split.lean`
 - **elementary number theory — the unit group of ℤ/9 and the doubling orbit** — 24 theorems, in `generated.lean`, `index.lean`
-- **elementary number theory, named results** — 14 theorems, in `demand3.lean`
+- **elementary number theory, named results** — 15 theorems, in `demand3.lean`
 - **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`
@@ -114,7 +114,7 @@ which is a contribution of verification, not of discovery.
 - **modular arithmetic** — 22 theorems, in `z9.lean`
 - **modular arithmetic and periodicity** — 43 theorems, in `z9plus.lean`
 - **modular arithmetic, quantified** — 55 theorems, in `families.lean`
-- **non-cryptographic hashing** — 13 theorems, in `fnv.lean`
+- **non-cryptographic hashing** — 14 theorems, in `fnv.lean`
 - **the method of complements** — 20 theorems, in `coin.lean`, `theorems.lean`
 
 Each is a field with an existing literature, and each is where this deposit's contribution actually sits: not

package/README.md

@@ -11,12 +11,12 @@ last because the orbit never reaches it.
 
 ## 1 · What is proved
 
-- 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>
+- The formal layer holds 735 kernel-accepted declarations across 33 files, and no file uses sorry or native_decide outside a comment.
+  <sub>SEALED · `70327bfe-a124-8316-8a39-2d90c7a2e3b5`</sub>
+- 629 of those 735 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 106 close by rfl and are declarations.
+  <sub>SEALED · `6a4db423-80e6-8296-a688-c52a7f375436`</sub>
+- 810 of them are sealed into the ledger, each carrying a receipt derived from the one before it.
+  <sub>SEALED · `9250535d-47e0-83a7-b331-bc1114e53b4a`</sub>
 
 ## 2 · The ring
 
@@ -32,17 +32,17 @@ last because the orbit never reaches it.
 
 ## 8 · Addressing
 
-- The content-address is ported to the formal layer in fnv.lean, address.lean, merkle.lean — 43 theorems covering FNV-1a, the four seeded passes, the version and variant nibbles, and the fold, each agreeing with the shipped implementation at published values.
-  <sub>SEALED · `ad9565e8-f0b9-8c94-abca-8c2e954b5b87`</sub>
+- The content-address is ported to the formal layer in fnv.lean, address.lean, merkle.lean — 49 theorems covering FNV-1a, the four seeded passes, the version and variant nibbles, and the fold, each agreeing with the shipped implementation at published values.
+  <sub>SEALED · `ea278ba2-b4aa-864d-b22c-7d1ef73c789f`</sub>
 - The fold does not depend on the order its leaves arrive in, and that is not vacuous because merge itself is proved order-sensitive — the sort is what removes the dependence.
   <sub>SEALED · `7ee1de7d-d218-88d4-8dc9-6eec451ced72`</sub>
 
 ## 7 · The ledger
 
-- The ledger records 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>
+- The ledger records 2674 entries with 0 chain breaks, 0 duplicate keys and 0 duplicate receipts.
+  <sub>SEALED · `7ec9e4e8-4f93-8c59-97a1-feec0fd43baf`</sub>
+- The count is 2674, which is 334 octaves and 2 over — the octave is a target the theorems earn, never a quota they are invented to fill.
+  <sub>SEALED · `d4a804ab-b977-878b-824a-6eb770c050ec`</sub>
 
 ## 5 · What the gate does and does not do
 
@@ -86,15 +86,15 @@ 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, 728 declarations of which 719 are theorems. The prose in this section is read out of the
+33 Lean files in 7 wings, 735 declarations of which 726 are theorems. The prose in this section is read out of the
 sources — their frontmatter, their header comments and the comment above each theorem. Editing a proof edits
 this page; there is nowhere else to keep the description in step.
 
 ### the address
 
-**Addressing** — `address.lean`, 18 theorem(s). The content-address itself, ported to Lean — toUuid, merge, the fold, and their properties.
+**Addressing** — `address.lean`, 23 theorem(s). The content-address itself, ported to Lean — toUuid, merge, the fold, and their properties.
 
-**FNV-1a, the address function** — `fnv.lean`, 13 theorem(s). FNV-1a, ported to Lean — the hash the whole deposit's addressing rests on.
+**FNV-1a, the address function** — `fnv.lean`, 14 theorem(s). FNV-1a, ported to Lean — the hash the whole deposit's addressing rests on.
 
 **What the ledger claims** — `ledgerclaims.lean`, 8 theorem(s). Bounded: what is not prior art is what THIS ledger claims — the 967-receipt case, the saving arithmetic,   and the 128-bit seal width as this deposit mints it. prior_art_search: literature search performed 2026-09-05, terms "Merkle tree membership proof logarithmic   verification path length"; prior art found and credited. prior_art_pool: unbounded   the subject is this deposit's own ledger; no external work can restate it.   BOUNDED means a search is well posed and simply has not been run — the row is unclassified because   nobody looked. UNBOUNDED means the subject is this artifact, so there is no pool to search and the   row will stay unclassified however much work is done. They look identical in a count and need   opposite responses, which is the distinction uuidna-49 asked for and nobody had drawn. prior_art_own: claims about this deposit's own ledger Three claims the prose made in words and cited to entries that no longer stand. Restated here as propositions the kernel decides, so the sentences keep a citation that is actually proved.
 
@@ -128,7 +128,7 @@ this page; there is nowhere else to keep the description in step.
 
 **The next tier of what is asked for** — `demand2.lean`, 11 theorem(s). THE SECOND COURSE OF THE SAME FLOOR. `demand.lean` closed the top eight topics in src/demand/queries.json; this file takes the next eight, chosen the same way — by impressions, not by taste. The demand map is three months of the deposit's own Google Search Console data with the retrieval scaffolding stripped, so what is ranked is the TOPIC people wanted a citable source for, not the phrasing they reached for.
 
-**The named theorems people ask for** — `demand3.lean`, 14 theorem(s). The third and last tier the search data supports. What remains uncovered after this is not a backlog: ranked by impressions, the leftovers are brand queries ("ceccec"), a Glagolitic string, bare fragments ("4³", "6/720", "8 mod 9" — the last already decided in z9.lean), and the real-analysis cluster that was refused in demand2.lean and stays refused. The demand map is close to exhausted of things a kernel can settle, which is a better place to stop than an arbitrary count would have been.
+**The named theorems people ask for** — `demand3.lean`, 15 theorem(s). The third and last tier the search data supports. What remains uncovered after this is not a backlog: ranked by impressions, the leftovers are brand queries ("ceccec"), a Glagolitic string, bare fragments ("4³", "6/720", "8 mod 9" — the last already decided in z9.lean), and the real-analysis cluster that was refused in demand2.lean and stays refused. The demand map is close to exhausted of things a kernel can settle, which is a better place to stop than an arbitrary count would have been.
 
 **The water loop** — `energy.lean`, 22 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.
 
@@ -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 728 declarations carry no comment of their own and are shown here as the gap they are, not
+20 of 735 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,667 — 333 octaves and 3 over |
-| standing — carries its own proof | **719** |
+| ledger entries | 2,674 — 334 octaves and 2 over |
+| standing — carries its own proof | **726** |
 | carried — withdrawn on its own evidence, proved by a live theorem | **434** |
 | withdrawn — nothing proves it | 1,514 |
-| 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 |
+| proved in total | **1160** of 2,674 |
+| standing keys → distinct theorems | 726 sealed, 0 of them keyed twice, 0 unresolvable |
+| Lean files · theorems | 33 · 726 theorems (629 closed by exhaustion, axiom-free · 97 proved for every value on propext and Quot.sound) + 9 rfl declarations |
+| proved `by decide` | 629 of 735 |
 | 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 · 719 Lean theorems · 2667 ledger entries · trial root `b9bdd086-3a49-83ef-b134-ee87429bf324` · integrity, not truth*
+*15 claims, all verified · 726 Lean theorems · 2674 ledger entries · trial root `4bffd265-48f0-8cb1-90f3-968481f2f185` · 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.9</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.3.1</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 `c4f161c6-d6c4-80f1-9aaa-ee9579fddfe1`.
+`npm run forensic`. Content-address `2fc0d808-c0e1-863b-9ce9-21d93a8826fb`.
 
 ## What this record establishes
 
 | | |
 |---|---:|
-| ledger entries | **2,667** |
-| standing — proved and sealed | 719 |
+| ledger entries | **2,674** |
+| standing — proved and sealed | 726 |
 | 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 | 582 |
+| commits that changed ledger state | 584 |
 
 ## 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 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>
+- The formal layer holds 735 kernel-accepted declarations across 33 files, and no file uses sorry or native_decide outside a comment.
+  <sub>SEALED · `70327bfe-a124-8316-8a39-2d90c7a2e3b5`</sub>
+- 629 of those 735 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 106 close by rfl and are declarations.
+  <sub>SEALED · `6a4db423-80e6-8296-a688-c52a7f375436`</sub>
+- 810 of them are sealed into the ledger, each carrying a receipt derived from the one before it.
+  <sub>SEALED · `9250535d-47e0-83a7-b331-bc1114e53b4a`</sub>
 
 ## 2 · The ring
 
@@ -38,17 +38,17 @@ last because the orbit never reaches it.
 
 ## 8 · Addressing
 
-- The content-address is ported to the formal layer in fnv.lean, address.lean, merkle.lean — 43 theorems covering FNV-1a, the four seeded passes, the version and variant nibbles, and the fold, each agreeing with the shipped implementation at published values.
-  <sub>SEALED · `ad9565e8-f0b9-8c94-abca-8c2e954b5b87`</sub>
+- The content-address is ported to the formal layer in fnv.lean, address.lean, merkle.lean — 49 theorems covering FNV-1a, the four seeded passes, the version and variant nibbles, and the fold, each agreeing with the shipped implementation at published values.
+  <sub>SEALED · `ea278ba2-b4aa-864d-b22c-7d1ef73c789f`</sub>
 - The fold does not depend on the order its leaves arrive in, and that is not vacuous because merge itself is proved order-sensitive — the sort is what removes the dependence.
   <sub>SEALED · `7ee1de7d-d218-88d4-8dc9-6eec451ced72`</sub>
 
 ## 7 · The ledger
 
-- The ledger records 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>
+- The ledger records 2674 entries with 0 chain breaks, 0 duplicate keys and 0 duplicate receipts.
+  <sub>SEALED · `7ec9e4e8-4f93-8c59-97a1-feec0fd43baf`</sub>
+- The count is 2674, which is 334 octaves and 2 over — the octave is a target the theorems earn, never a quota they are invented to fill.
+  <sub>SEALED · `d4a804ab-b977-878b-824a-6eb770c050ec`</sub>
 
 ## 5 · What the gate does and does not do
 
@@ -92,15 +92,15 @@ 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, 728 declarations of which 719 are theorems. The prose in this section is read out of the
+33 Lean files in 7 wings, 735 declarations of which 726 are theorems. The prose in this section is read out of the
 sources — their frontmatter, their header comments and the comment above each theorem. Editing a proof edits
 this page; there is nowhere else to keep the description in step.
 
 ### the address
 
-**Addressing** — `address.lean`, 18 theorem(s). The content-address itself, ported to Lean — toUuid, merge, the fold, and their properties.
+**Addressing** — `address.lean`, 23 theorem(s). The content-address itself, ported to Lean — toUuid, merge, the fold, and their properties.
 
-**FNV-1a, the address function** — `fnv.lean`, 13 theorem(s). FNV-1a, ported to Lean — the hash the whole deposit's addressing rests on.
+**FNV-1a, the address function** — `fnv.lean`, 14 theorem(s). FNV-1a, ported to Lean — the hash the whole deposit's addressing rests on.
 
 **What the ledger claims** — `ledgerclaims.lean`, 8 theorem(s). Bounded: what is not prior art is what THIS ledger claims — the 967-receipt case, the saving arithmetic,   and the 128-bit seal width as this deposit mints it. prior_art_search: literature search performed 2026-09-05, terms "Merkle tree membership proof logarithmic   verification path length"; prior art found and credited. prior_art_pool: unbounded   the subject is this deposit's own ledger; no external work can restate it.   BOUNDED means a search is well posed and simply has not been run — the row is unclassified because   nobody looked. UNBOUNDED means the subject is this artifact, so there is no pool to search and the   row will stay unclassified however much work is done. They look identical in a count and need   opposite responses, which is the distinction uuidna-49 asked for and nobody had drawn. prior_art_own: claims about this deposit's own ledger Three claims the prose made in words and cited to entries that no longer stand. Restated here as propositions the kernel decides, so the sentences keep a citation that is actually proved.
 
@@ -134,7 +134,7 @@ this page; there is nowhere else to keep the description in step.
 
 **The next tier of what is asked for** — `demand2.lean`, 11 theorem(s). THE SECOND COURSE OF THE SAME FLOOR. `demand.lean` closed the top eight topics in src/demand/queries.json; this file takes the next eight, chosen the same way — by impressions, not by taste. The demand map is three months of the deposit's own Google Search Console data with the retrieval scaffolding stripped, so what is ranked is the TOPIC people wanted a citable source for, not the phrasing they reached for.
 
-**The named theorems people ask for** — `demand3.lean`, 14 theorem(s). The third and last tier the search data supports. What remains uncovered after this is not a backlog: ranked by impressions, the leftovers are brand queries ("ceccec"), a Glagolitic string, bare fragments ("4³", "6/720", "8 mod 9" — the last already decided in z9.lean), and the real-analysis cluster that was refused in demand2.lean and stays refused. The demand map is close to exhausted of things a kernel can settle, which is a better place to stop than an arbitrary count would have been.
+**The named theorems people ask for** — `demand3.lean`, 15 theorem(s). The third and last tier the search data supports. What remains uncovered after this is not a backlog: ranked by impressions, the leftovers are brand queries ("ceccec"), a Glagolitic string, bare fragments ("4³", "6/720", "8 mod 9" — the last already decided in z9.lean), and the real-analysis cluster that was refused in demand2.lean and stays refused. The demand map is close to exhausted of things a kernel can settle, which is a better place to stop than an arbitrary count would have been.
 
 **The water loop** — `energy.lean`, 22 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.
 
@@ -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 728 declarations carry no comment of their own and are shown here as the gap they are, not
+20 of 735 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,667 — 333 octaves and 3 over |
-| standing — carries its own proof | **719** |
+| ledger entries | 2,674 — 334 octaves and 2 over |
+| standing — carries its own proof | **726** |
 | carried — withdrawn on its own evidence, proved by a live theorem | **434** |
 | withdrawn — nothing proves it | 1,514 |
-| 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 |
+| proved in total | **1160** of 2,674 |
+| standing keys → distinct theorems | 726 sealed, 0 of them keyed twice, 0 unresolvable |
+| Lean files · theorems | 33 · 726 theorems (629 closed by exhaustion, axiom-free · 97 proved for every value on propext and Quot.sound) + 9 rfl declarations |
+| proved `by decide` | 629 of 735 |
 | 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 · 719 Lean theorems · 2667 ledger entries · trial root `b9bdd086-3a49-83ef-b134-ee87429bf324` · integrity, not truth*
+*15 claims, all verified · 726 Lean theorems · 2674 ledger entries · trial root `4bffd265-48f0-8cb1-90f3-968481f2f185` · integrity, not truth*

package/nature.md

@@ -0,0 +1,58 @@
+---
+title: Nature, proved
+description: Where the deposit's proved laws meet nature and daily life — each one labelled as a fact of nature, a practice you can use, or a metaphor, and linked to the theorem the kernel checked.
+head:
+  - ['meta', { name: 'robots', content: 'index, follow' }]
+---
+
+<script setup>
+// Computed from the ledger: an entry is shown only while its theorem is live. Nothing here is typed as a count.
+import { withBase } from 'vitepress'
+import ledger from './src/proof/discovered.json'
+const live = new Map(ledger.filter((e) => !e.revoked).map((e) => [e.key, e]))
+const ENTRIES = [
+  { kind: 'fact', where: 'Sunflowers, pinecones, pineapples', what: 'The spiral counts on a seed head are usually two consecutive Fibonacci numbers — 34 and 55, 55 and 89. Consecutive Fibonacci numbers share no common divisor but 1, at every size, so the two families of spirals never fall into a common sub-rhythm.', keys: ['lean_z9plus_consecutive_fibonacci_are_coprime_for_every_n', 'lean_families_cassinis_identity_for_every_m'] },
+  { kind: 'fact', where: 'Leaves around a stem', what: 'Ratios of neighbouring Fibonacci numbers close in on the golden ratio — each convergent off by exactly one unit in the determinant — the spacing (about 137.5° between leaves) that many plants use to keep leaves from shading each other.', keys: ['lean_families_the_golden_convergents_are_fibonacci_ratios_with_unit_determinant', 'lean_elementary_the_lucas_numbers_are_the_sum_of_the_neighbouring_fibonaccis_for_every_n'] },
+  { kind: 'fact', where: 'Honeycomb', what: 'Six turns of 60° close the circle, so hexagons tile a flat surface; among all tilings into equal cells, the hexagonal one uses the least wall for the area enclosed (the honeycomb theorem, Thomas Hales, 1999 — prior art, not proved here).', keys: ['lean_mechanical_the_regular_hexagon_exterior_angle_is_the_gold_string'] },
+  { kind: 'fact', where: 'Islands, cups, cells — every surface', what: 'χ = 2 − 2g for a surface with g holes: a sphere 2, a doughnut 0, a pretzel of two holes −2. Counting holes tells shapes apart that no stretching can turn into one another.', keys: ['lean_demand3_the_euler_characteristic_of_a_genus_g_surface_for_every_g'] },
+  { kind: 'fact', where: 'Water and energy', what: 'Mass is conserved at every scale, so no closed loop makes water from nothing: every atom that comes out went in. A device that promises more out than in is refuted before it is built.', keys: ['lean_energy_mass_is_conserved_at_every_scale_so_the_loop_cannot_make_water'] },
+  { kind: 'fact', where: 'Your family tree', what: 'Going back, ancestors double each generation: 1 + 2 + 4 + … + 2ⁿ = 2ⁿ⁺¹ − 1. Within a few dozen generations that exceeds everyone who has ever lived, so the branches must meet — we are all related.', keys: ['lean_families_the_powers_of_two_sum_to_one_less_than_the_next_for_every_n'] },
+  { kind: 'fact', where: 'An honest second', what: 'The second reads back exactly from the metre and from the caesium period, for every whole number of seconds — the same measure for everyone, everywhere.', keys: ['lean_light_the_second_returns_from_the_metre_and_the_period_for_every_s'] },
+  { kind: 'practice', where: 'A right angle with a rope', what: 'Knot a loop of rope into 12 equal parts and peg it as 3, 4 and 5: the corner is square. It works at any size (every multiple of 3-4-5), for fields, garden beds and walls, with no instrument.', keys: ['lean_mechanical_every_multiple_of_three_four_five_is_pythagorean'] },
+  { kind: 'practice', where: 'Planting in rows', what: 'Rows of 1, 2, 3, … n plants need n(n + 1)/2 seedlings in all; a square bed grows by one L-shaped border of the next odd number of plants.', keys: ['lean_families_the_numbers_sum_to_their_closed_form_for_every_n', 'lean_families_the_first_n_odd_numbers_sum_to_n_squared_for_every_n'] },
+  { kind: 'practice', where: 'Stacking fruit', what: 'A pile of oranges in triangular layers holds a tetrahedral number: the sum of the triangular numbers, n(n + 1)(n + 2)/6.', keys: ['lean_families_the_sums_of_triangular_numbers_are_the_tetrahedral_numbers_for_every_n'] },
+  { kind: 'practice', where: 'Checking a bill by hand', what: 'Casting out nines: the digit root of a product is the digit root of the product of the roots, for every pair of numbers — a check at the market with no calculator. Its frontier is honest too: a number and its reversal keep the same remainder by nine, so swapped digits slip through; that is why bank and book numbers use weighted checks (mod 97, mod 11).', keys: ['lean_mechanical_casting_out_nines_is_multiplicative_for_every_a_b', 'lean_reversal_reversal_keeps_the_residue_mod_nine_for_every_n'] },
+  { kind: 'practice', where: 'Taking turns fairly', what: 'A B B A B A A B … — the Thue–Morse order — shares first-mover advantage more fairly than A B A B, when children pick teams or neighbours share a well.', keys: ['lean_sequences_thue_morse_doubling_recurrence', 'lean_sequences_thue_morse_doubling_recurrence_for_every_n'] },
+  { kind: 'practice', where: 'A fair price', what: 'The deposit’s fare is two coins, fixed by a theorem rather than by whoever holds power: 110 − 108 = 2 = −χ at genus 2.', keys: ['lean_demand3_the_two_coin_fare_is_minus_the_euler_characteristic_at_genus_two'] },
+  { kind: 'metaphor', where: 'Repair', what: 'Every step of XOR is undone by repeating it: (a ⊕ b) ⊕ b = a, for every a and b. A picture of repair — a metaphor, not a law of people.', keys: ['lean_nim_xor_is_its_own_inverse_for_every_a_b'] },
+  { kind: 'metaphor', where: 'Rhythm', what: 'The Fibonacci numbers repeat their remainders by nine every 24 steps, forever. An arithmetic rhythm — not a claim about days or bodies.', keys: ['lean_z9plus_pisano_period_mod_nine_is_twenty_four_for_every_k'] },
+  { kind: 'metaphor', where: 'Colour', what: 'Nine digits at 40° each close the colour wheel with nine distinct hues. A design mapping, honestly labelled.', keys: ['lean_mechanical_arts_nine_hues_distinct'] },
+]
+const KIND = { fact: 'Facts of nature', practice: 'Practices you can use', metaphor: 'Metaphors, labelled as such' }
+const shown = ENTRIES.map((e) => ({ ...e, proofs: e.keys.filter((k) => live.has(k)).map((k) => ({ key: k, name: live.get(k).name.split('—')[0].trim() })) })).filter((e) => e.proofs.length)
+const groups = Object.entries(KIND).map(([k, title]) => ({ k, title, items: shown.filter((e) => e.kind === k) })).filter((g) => g.items.length)
+</script>
+
+# Nature, proved
+
+> Mathematics does not make a life blissful. What it can do is show the order in what we already see, let anyone
+> check a claim for themselves, and remove the fear of being cheated — so attention is free for the garden, the
+> people, the light. Each entry below links to the theorem the Lean kernel checked, for every value.
+
+<p><strong>{{ shown.length }}</strong> places where a proved law meets nature or daily life, drawn live from the ledger — an entry disappears if its theorem is ever withdrawn.</p>
+
+<template v-for="g in groups" :key="g.k">
+<h2>{{ g.title }}</h2>
+<div v-for="e in g.items" :key="e.where" style="border:1px solid var(--vp-c-divider);border-radius:10px;padding:.6rem 1rem;margin:.8rem 0">
+<strong>{{ e.where }}</strong>
+<p style="margin:.3rem 0">{{ e.what }}</p>
+<small>Proved: <template v-for="(p, i) in e.proofs" :key="p.key"><a :href="withBase('/theorem/' + p.key)">{{ p.name }}</a><span v-if="i < e.proofs.length - 1"> · </span></template></small>
+</div>
+</template>
+
+## The frontier, and where it leads
+
+The laws here are classical — Fibonacci, Pythagoras, Euler, Thue and Morse long before this deposit. What is new is
+only that each is checked by the kernel for every value, where before it was checked up to a bound. That frontier
+leads outward: a law anyone can recompute on a phone is a law no one can use to cheat them — in a market, a land
+record, a water promise. The bliss is not in the proof; the proof clears the way to it.

package/package.json

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