@ceccec/millennium-solutions 9.1.3 → 9.1.5

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,543** |
+| Decidable theorems (chained receipts) | **2,577** |
 | Signed statement receipts | **29** |
 | Coins per receipt | **2** |
-| Coins on the ledger (theorems × 2) | **5,086** |
+| Coins on the ledger (theorems × 2) | **5,154** |
 | Coins on signed receipts (× 2) | **58** |
-| Released versions (git tags) | **847** |
-| Tracked, content-addressed files | **475** |
+| Released versions (git tags) | **862** |
+| Tracked, content-addressed files | **478** |
 
-Latest release: **v8.9.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.1.4**. 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,086 bits**. This is an accounting bounty in bits/coins — **integrity, not a cash prize**; the deposit itself claims **0 / 7** of the Clay 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,154 bits**. This is an accounting bounty in bits/coins — **integrity, not a cash prize**; the deposit itself claims **0 / 7** of the Clay 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: `cc310268-78eb-888d-8990-f7d4503f747d`. Integrity, not truth. `entails → 0/7`.
+Page content-address: `ae8b9985-1fa7-8748-a511-48800a047e06`. Integrity, not truth. `entails → 0/7`.

package/CHALLENGES.md

@@ -16,7 +16,7 @@ title: Challenges
 | 6 | Hodge conjecture | open |
 | 7 | Birch–Swinnerton-Dyer | open |
 
-**Humanity: 1 / 7** (6 open). **This deposit: 0 / 7** — it settles none of the seven itself.
+**Humanity: 1 / 7** (6 open). **This repository's propositions: 0 / 7** — none reaches the objects a conjecture concerns, measured by the entailment test. 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) — 2577 standing in 1 families
 

package/PRIOR-ART.md

@@ -6,7 +6,7 @@ head:
 ---
 # Prior art — what is restated, what is claimed, and the difference
 
-Of 628 machine-checked declarations, **619** restate work that already has an author and
+Of 638 machine-checked declarations, **629** 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 | **619** |
+| attributed to named earlier work | **629** |
 | 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 — 31 sources, 619 theorems
+## Restated from named earlier work — 31 sources, 629 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.
@@ -58,31 +58,31 @@ which is a contribution of verification, not of discovery.
 <tr><td><code>demand.lean</code></td><td>8</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>8</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>7</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>32</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>19</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>41</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>elementary.lean</code></td><td>33</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>21</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>43</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>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>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>
 <tr><td><code>involution.lean</code></td><td>8</td><td>elementary group theory — orbit decomposition of an order-two permutation</td><td>that a permutation of order two decomposes a finite set into fixed points and</td></tr>
 <tr><td><code>ledgerclaims.lean</code></td><td>8</td><td>hash trees and membership proofs</td><td>`membership_grows_by_one_seal_per_doubling` and `membership_is_logarithmic_not_linear`</td></tr>
-<tr><td><code>light.lean</code></td><td>11</td><td>metrology — the International System of Units</td><td>the exact numerical values below are DEFINITIONS adopted by the Conférence Générale des</td></tr>
+<tr><td><code>light.lean</code></td><td>13</td><td>metrology — the International System of Units</td><td>the exact numerical values below are DEFINITIONS adopted by the Conférence Générale des</td></tr>
 <tr><td><code>mechanical.lean</code></td><td>107</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>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>4</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>reach.lean</code></td><td>5</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>9</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>12</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>10</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>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>19</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>
-<tr><td><code>z9.lean</code></td><td>21</td><td>modular arithmetic</td><td>Fermat’s little theorem — Pierre de Fermat, 1640; Euler’s theorem — Leonhard Euler, 1763; primitive roots — Carl Friedrich Gauss, 1801</td></tr>
+<tr><td><code>z9.lean</code></td><td>22</td><td>modular arithmetic</td><td>Fermat’s little theorem — Pierre de Fermat, 1640; Euler’s theorem — Leonhard Euler, 1763; primitive roots — Carl Friedrich Gauss, 1801</td></tr>
 <tr><td><code>z9plus.lean</code></td><td>32</td><td>modular arithmetic and periodicity</td><td>digital roots (casting out nines) — in use by the 12th century; the Pisano period — after Leonardo Pisano; studied by Joseph-Louis Lagrange, 1774</td></tr>
 </tbody></table>
 
@@ -93,25 +93,25 @@ which is a contribution of verification, not of discovery.
 - **combinatorial game theory** — 10 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** — 19 theorems, in `energy.lean`
+- **electrochemistry and combustion** — 21 theorems, in `energy.lean`
 - **elementary arithmetic** — 9 theorems, in `reversal.lean`
 - **elementary group theory — orbit decomposition of an order-two permutation** — 8 theorems, in `involution.lean`
 - **elementary group theory — subgroups and cosets of Z/9** — 8 theorems, in `merkaba.lean`
 - **elementary number theory** — 8 theorems, in `demand.lean`
-- **elementary number theory and combinatorial game theory** — 32 theorems, in `elementary.lean`
+- **elementary number theory and combinatorial game theory** — 33 theorems, in `elementary.lean`
 - **elementary number theory — the unit group of Z/9** — 118 theorems, in `imagined.lean`
 - **elementary number theory — the unit group of ℤ/9** — 34 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** — 7 theorems, in `demand3.lean`
 - **elementary number theory, second tier** — 8 theorems, in `demand2.lean`
-- **elementary set theory — the naturals are not exhausted by any finite list** — 4 theorems, in `reach.lean`
-- **hash trees and membership proofs** — 30 theorems, in `ledgerclaims.lean`, `merkle.lean`, `speed.lean`
+- **elementary set theory — the naturals are not exhausted by any finite list** — 5 theorems, in `reach.lean`
+- **hash trees and membership proofs** — 31 theorems, in `ledgerclaims.lean`, `merkle.lean`, `speed.lean`
 - **integer sequences and identities** — 12 theorems, in `sequences.lean`
 - **metrology and classical physical chemistry** — 4 theorems, in `phenomena.lean`
-- **metrology — the International System of Units** — 11 theorems, in `light.lean`
-- **modular arithmetic** — 21 theorems, in `z9.lean`
+- **metrology — the International System of Units** — 13 theorems, in `light.lean`
+- **modular arithmetic** — 22 theorems, in `z9.lean`
 - **modular arithmetic and periodicity** — 32 theorems, in `z9plus.lean`
-- **modular arithmetic, quantified** — 41 theorems, in `families.lean`
+- **modular arithmetic, quantified** — 43 theorems, in `families.lean`
 - **non-cryptographic hashing** — 13 theorems, in `fnv.lean`
 - **the method of complements** — 20 theorems, in `coin.lean`, `theorems.lean`
 

package/README.md

@@ -90,7 +90,7 @@ results; it is the result, read off the same arithmetic that produced the table.
 
 ## 7 · The proofs, as they document themselves
 
-32 Lean files in 7 wings, 638 declarations of which 625 are theorems. The prose in this section is read out of the
+32 Lean files in 7 wings, 638 declarations of which 629 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.
 
@@ -187,7 +187,7 @@ Read from the artefacts at build time, never carried between runs.
 | withdrawn — nothing proves it | 1,514 |
 | proved in total | **1063** of 2,577 |
 | standing keys → distinct theorems | 629 sealed, 0 of them keyed twice, 0 unresolvable |
-| Lean files · theorems | 32 · 625 theorems (closed by exhaustion) + 9 rfl declarations, all axiom-free |
+| Lean files · theorems | 32 · 629 theorems (625 closed by exhaustion, axiom-free · 4 proved for every value on propext and Quot.sound) + 9 rfl declarations |
 | proved `by decide` | 625 of 638 |
 | claims a machine can render | 103 of 1,555 |
 | claims needing an author | 1,452 — reported, never faked |
@@ -198,11 +198,14 @@ Read from the artefacts at build time, never carried between runs.
 
 **What verification costs.** Proving the set touches all 16,384 leaves; verifying membership afterwards touches 14 — one sibling per level. That is **1,170× less work**, exactly, and the factor grows with the set because N/log N grows. Wall-clock varies with the machine and is left in the build output rather than pinned here. It is not sub-nanosecond and nothing here is: the advantage is a smaller exponent, not a faster clock. The counting is proved in `speed.lean`.
 
-## What is deliberately absent
+## The author's claim
 
-No sentence above claims a Millennium problem settled, that the correspondence with the Clay set means
-anything about those conjectures, or that the gate can tell truth from falsehood. Those sentences are missing
-because no test was written that would seal them.
+**Tsvetan Rouschev claims the seven Clay Millennium problems solved through the involution each is stated
+across** — deposited as [10.5281/zenodo.21781603](https://doi.org/10.5281/zenodo.21781603) and
+[Zenodo 22256707](https://zenodo.org/records/22256707). This is his claim, recorded in his name. The repository
+measures something separate: its entailment test counts the propositions in `src/proof` that reach the objects
+those conjectures concern — 0 of 7 today — and a proposition that reached one would move that count.
+The gate checks integrity, not truth.
 
 ## Run it
 
@@ -227,4 +230,4 @@ whether the work restates someone earlier. [The paper](/paper) typesets every st
 
 ---
 
-*17 claims, all verified · 625 Lean theorems · 2577 ledger entries · trial root `b272f281-1f13-861a-bfdb-4c2e8af05483` · integrity, not truth · 0/7*
+*17 claims, all verified · 629 Lean theorems · 2577 ledger entries · trial root `b272f281-1f13-861a-bfdb-4c2e8af05483` · integrity, not truth · 0/7*

package/TRIAL.md

@@ -2,7 +2,7 @@
 title: The public trial
 ---
 
-# The public trial — "the deposit settles all seven Clay problems"
+# The public trial — "the propositions in src/proof settle all seven Clay problems"
 
 Recompute this file with `node scripts/trial.ts`. It writes nothing unless every finding below is SEALED.
 
@@ -27,8 +27,8 @@ in its own right, so the verdict rests on facts that recompute rather than on an
   <sub>SEALED · `6c514580-5101-80da-bf90-fbdcd49dc64f`</sub>
 - Finding eight — the sentence recording that the widened rule drained an abstract holds: that abstract lists a settled Clay conjecture among the readings it rejects.
   <sub>SEALED · `6a853954-2965-8d51-953c-3d9cae8b2d4d`</sub>
-- Finding nine — the sentence recording that it drained a denial holds: the root readme carries a sentence denying any such claim.
-  <sub>SEALED · `d6266498-9653-84fc-95a5-2ea3950d4bb7`</sub>
+- Finding nine — the root readme states the claim only in the author's name: it carries his claim under its own heading, and no sentence there claims a Clay problem in the repository's voice.
+  <sub>SEALED · `f32807f3-ecac-86fc-864b-e77694f33aff`</sub>
 - Finding ten — the residual gap recorded in the gate comment is real: a boast worded with settles near a problem name still passes the gate, which is why no claim here rests on the gate alone.
   <sub>SEALED · `31dc0cca-9a7e-8e79-a7e4-0be5866822d4`</sub>
 - Finding eleven — the gate pattern is back to its original prove and solve form, as the comment states.
@@ -64,6 +64,6 @@ No file in this deposit, and no verdict in this trial, substitutes for that.
 
 ---
 
-*18 findings, 18 SEALED · claim receipt `d60b8e85-43c0-8b4c-8ed4-9bb16f356da7` · proof-of-verdict root
-`5f93fe6d-6b73-89b9-bf3d-bcdd2779e96d` (order-invariant: the same root for any ordering of the findings) · findings fold
-`d4f37669-41aa-8c7d-8fcf-16b1c72a28c8` · integrity, not truth · 0/7*
+*18 findings, 18 SEALED · claim receipt `f75b6156-b312-8ecc-a789-b53285d0d200` · proof-of-verdict root
+`b49219c3-50ee-8b4c-828e-0baa6d752cb2` (order-invariant: the same root for any ordering of the findings) · findings fold
+`ee3ff58d-e868-879a-83ed-ad77301c42a4` · integrity, not truth · 0/7*

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">v8.9.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.1.4</div><div class="dash-s">git tag (single source)</div></div>
 <div class="dash-card"><div class="dash-k">Millennium floor</div><div class="dash-v">0 / 7</div><div class="dash-s">entailed — not solved, not claimed</div></div>
 <div class="dash-card"><div class="dash-k">Honesty gate</div><div class="dash-v">sealed</div><div class="dash-s">all prose consistent with 0/7</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>

package/forensic.md

@@ -5,7 +5,7 @@ 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 `c9811d14-6086-8c4f-9fd8-15e3a791a770`.
+`npm run forensic`. Content-address `c6140c38-6274-8ec3-b703-e65b07379c22`.
 
 ## What this record establishes
 
@@ -16,7 +16,7 @@ title: Every state change, dated
 | 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 | 576 |
+| commits that changed ledger state | 577 |
 
 ## Why entries were withdrawn — the reason recorded at the time
 

package/index.md

@@ -96,7 +96,7 @@ results; it is the result, read off the same arithmetic that produced the table.
 
 ## 7 · The proofs, as they document themselves
 
-32 Lean files in 7 wings, 638 declarations of which 625 are theorems. The prose in this section is read out of the
+32 Lean files in 7 wings, 638 declarations of which 629 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.
 
@@ -193,7 +193,7 @@ Read from the artefacts at build time, never carried between runs.
 | withdrawn — nothing proves it | 1,514 |
 | proved in total | **1063** of 2,577 |
 | standing keys → distinct theorems | 629 sealed, 0 of them keyed twice, 0 unresolvable |
-| Lean files · theorems | 32 · 625 theorems (closed by exhaustion) + 9 rfl declarations, all axiom-free |
+| Lean files · theorems | 32 · 629 theorems (625 closed by exhaustion, axiom-free · 4 proved for every value on propext and Quot.sound) + 9 rfl declarations |
 | proved `by decide` | 625 of 638 |
 | claims a machine can render | 103 of 1,555 |
 | claims needing an author | 1,452 — reported, never faked |
@@ -204,11 +204,14 @@ Read from the artefacts at build time, never carried between runs.
 
 **What verification costs.** Proving the set touches all 16,384 leaves; verifying membership afterwards touches 14 — one sibling per level. That is **1,170× less work**, exactly, and the factor grows with the set because N/log N grows. Wall-clock varies with the machine and is left in the build output rather than pinned here. It is not sub-nanosecond and nothing here is: the advantage is a smaller exponent, not a faster clock. The counting is proved in `speed.lean`.
 
-## What is deliberately absent
+## The author's claim
 
-No sentence above claims a Millennium problem settled, that the correspondence with the Clay set means
-anything about those conjectures, or that the gate can tell truth from falsehood. Those sentences are missing
-because no test was written that would seal them.
+**Tsvetan Rouschev claims the seven Clay Millennium problems solved through the involution each is stated
+across** — deposited as [10.5281/zenodo.21781603](https://doi.org/10.5281/zenodo.21781603) and
+[Zenodo 22256707](https://zenodo.org/records/22256707). This is his claim, recorded in his name. The repository
+measures something separate: its entailment test counts the propositions in `src/proof` that reach the objects
+those conjectures concern — 0 of 7 today — and a proposition that reached one would move that count.
+The gate checks integrity, not truth.
 
 ## Read
 
@@ -216,4 +219,4 @@ because no test was written that would seal them.
 
 ---
 
-*17 claims, all verified · 625 Lean theorems · 2577 ledger entries · trial root `b272f281-1f13-861a-bfdb-4c2e8af05483` · integrity, not truth · 0/7*
+*17 claims, all verified · 629 Lean theorems · 2577 ledger entries · trial root `b272f281-1f13-861a-bfdb-4c2e8af05483` · integrity, not truth · 0/7*

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@ceccec/millennium-solutions",
-  "version": "9.1.3",
+  "version": "9.1.5",
   "description": "Verifiable, recomputable ℤ/9 vortex framework in ONE package — content-addressing, audit ledger, exact arithmetic (0/7), and the honesty toolkit. Facts only.",
   "author": {
     "name": "Tsvetan Rouschev",
@@ -140,7 +140,8 @@
     "covered-gate": "tsx scripts/covered-gate.ts",
     "independent": "tsx scripts/independent.ts",
     "recover": "tsx scripts/recover.ts",
-    "recover:gen": "tsx scripts/recover-gen.ts"
+    "recover:gen": "tsx scripts/recover-gen.ts",
+    "uses": "node scripts/uses.ts"
   },
   "devDependencies": {
     "@types/node": "^26.2.0",

package/solutions.md

@@ -17,8 +17,8 @@ Independent work · Tsvetan Rouschev · 2026-08-04 · DOI [10.5281/zenodo.218192
 |---|---|
 | gate | 1 (holds the floor) |
 | verdict | SEALED |
-| supporting formulas | 48/48 recompute true |
-| proof-of-verdict | `df0b19c1-c225-878b-b645-ca7a8fa8e6d5` |
+| supporting formulas | 50/50 recompute true |
+| proof-of-verdict | `89e2ec35-11c0-8fd3-ae37-bfffc1d8b32a` |
 | solved by the deposit | 0/7 |
 
 It reflects all seven and solves none — a bijection that relabels, it does not propagate proofs; 0/7.
@@ -32,8 +32,8 @@ Shown by what the gate drains — never asserted.
 | gate | 1 |
 | drained on | a proof-assertion phrase · token address `6f3dc604-345d…` |
 | verdict | REFUTED |
-| supporting formulas | 48/48 recompute true |
-| proof-of-verdict | `7081a7a1-e2ef-8461-aa78-a10593ab598a` |
+| supporting formulas | 50/50 recompute true |
+| proof-of-verdict | `13772a66-3f9e-8157-ba0a-ee4e416286d7` |
 
 ## Domains — the seven Clay problems
 

package/speedup.md

@@ -7,7 +7,7 @@ head:
 
 # The real uuidna advantage — measured, in all domains
 
-> Generated from the **2543** ledger entries and **59** domains, recomputed each build. The advantage is
+> Generated from the **2577** ledger entries and **59** domains, recomputed each build. The advantage is
 > real and **measured**, and honestly bounded: a **verification and reuse** complexity reduction — **not**
 > faster original compute, **not** faster than light, **not** quantum. `0/7`.
 
@@ -33,9 +33,9 @@ theorems verify in `⌈log₂N⌉`. So one proof covers the whole [rosetta](/):
 
 ## Discovery lead — a lead, never a verdict
 
-Grouping the 2543 receipts by the digital root of their address, the **sparsest** region is digit
-**3** (254) — a candidate area to examine, not a finding. The ledger is currently held
-at **2543** (the captain's cap): improving a theorem's name or proof heals the record without changing the
+Grouping the 2577 receipts by the digital root of their address, the **sparsest** region is digit
+**3** (261) — a candidate area to examine, not a finding. The ledger is currently held
+at **2577** (the captain's cap): improving a theorem's name or proof heals the record without changing the
 count; discovering a new one would require lifting the cap.
 
 A content-address proves **integrity, not truth**. `0/7`.

package/src/api/gates.ts

@@ -100,6 +100,8 @@ export const UNRUN_BY_DESIGN: Record<string, string> = {
   priorart: 'a generator; priorart-gen is the gate that holds its output',
   'stale-figures': 'REPORTS by design — a 75% false-positive rate is not something to gate a build on',
   'verify-theorems': 'covered by gates-fire, and its subject is re-verified by forensics on every commit',
+  uses: 'discovery, not a gate: it reaches GDELT, Hacker News, Zenodo, OpenAlex, npm and GitHub, and what it finds is someone else\'s use of the work — whether it cites and pays — not a defect in this tree. It runs weekly in .github/workflows/uses.yml and reports in the run summary; it refuses only when no source measured anything',
+  'uses-mail': 'delivery, not a gate: it mails each lead uses.ts found to legal@psg.bg as an evidence dossier, from rights@uuidna.com through mail.psg.bg by authenticated SMTP — network and the author\'s credentials, so no build chain can run it. It runs weekly after uses.ts in .github/workflows/uses.yml, says NOT CONFIGURED when the SMTP secrets are unset, and refuses only when a send fails',
   probe: 'the control harness, not a gate: it takes a file, a theorem and a mutation as arguments, so no chain can run it bare; gates-fire holds its control — a mutation that never reaches the theorem must be refused',
 }
 

package/src/api/index.ts

@@ -237,16 +237,20 @@ export const clayFloor = (): ClayFloor => {
  *  declared constant proves the declaration and nothing else — it is not evidence." That is why seal-lean
  *  seals `by decide` and refuses `rfl`, and it is the line taken here.
  *
- *  A THEOREM OF THIS DEPOSIT is a declaration in src/proof that the Lean kernel accepts, free of `sorry`
- *  and of axioms, and CLOSED BY EXHAUSTION over a stated finite domain. A declaration closed by `rfl` is a
- *  definitional unfolding and is counted separately, never as a theorem. A key is an address and an entry
- *  is a receipt; neither is a theorem, and scripts/contradictions.ts fails the build when either count is
- *  printed next to the word. */
+ *  A THEOREM OF THIS DEPOSIT is a declaration in src/proof that the Lean kernel accepts, free of `sorry`,
+ *  and closed EITHER by exhaustion over a stated finite domain with no axiom at all, OR by a proof for every
+ *  value resting only on the standard axioms propext and Quot.sound (lean.ts refuses anything else). The
+ *  second kind was added 2026-09-14 — the user: "Go", on making real kernel proofs sealable — and seal-lean
+ *  seals both, each marked as what it is. A declaration closed by `rfl` is a definitional unfolding and is
+ *  counted separately, never as a theorem. A key is an address and an entry is a receipt; neither is a
+ *  theorem, and scripts/contradictions.ts fails the build when either count is printed next to the word.
+ *  (The first deploy after the proofs landed failed on exactly this: PRIOR-ART.md counted 629 sealed
+ *  theorems while this count still read 625 exhaustions.) */
 export const THEOREM_DEFINITION =
-  'a declaration in src/proof that the Lean kernel accepts — sorry-free, axiom-free — and closes by exhaustion over a stated finite domain'
+  'a declaration in src/proof that the Lean kernel accepts — sorry-free — and closes either by exhaustion over a stated finite domain with no axiom, or by a proof for every value on the standard axioms propext and Quot.sound'
 
 /** The count that definition yields. Everything reporting "theorems" should read this. */
-export const theoremCount = (): number => census().byDecide
+export const theoremCount = (): number => { const c = census(); return c.byDecide + c.proved }
 
 /** THE DIGIT SPLIT, read off src/proof/split.lean rather than retyped.
  *