@ceccec/millennium-solutions 9.1.8 → 9.2.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,577** |
+| Decidable theorems (chained receipts) | **2,580** |
 | Signed statement receipts | **29** |
 | Coins per receipt | **2** |
-| Coins on the ledger (theorems × 2) | **5,154** |
+| Coins on the ledger (theorems × 2) | **5,160** |
 | Coins on signed receipts (× 2) | **58** |
-| Released versions (git tags) | **865** |
-| Tracked, content-addressed files | **478** |
+| Released versions (git tags) | **867** |
+| Tracked, content-addressed files | **476** |
 
-Latest release: **v9.1.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.1.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,154 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,160 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: `3b63fbb0-4ba1-8cdc-9bb7-c59d76625d2b`. Integrity, not truth.
+Page content-address: `c7845d00-7d45-8b17-b214-0e76a85166b5`. 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 **638** report the same thing:
+axiom fails the build rather than earning a footnote. All **641** 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
@@ -569,6 +569,6 @@ def gcd9 (a b : Nat) : Nat := gcdF (a + b + 1) a b
 
 ---
 
-**638** declarations, **0** axiom dependencies, **321** definitions they rest on.
+**641** 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) — 2577 standing in 1 families
+## Discovered theorems (decidable, over ℤ/9) — 2580 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 (629)
+### lean (632)
 
 - [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…`
@@ -657,6 +657,12 @@ Computed by exhaustion, each a monograph with its own page (`/theorem/<key>`) an
   intro), standard axioms only — checked by lean.ts  ·  `a1d55ab6-baca…`
 - [lean_speed_the_microseconds_return_from_the_nanoseconds_at_every_count](/theorem/lean_speed_the_microseconds_return_from_the_nanoseconds_at_every_count) — lean speed.lean: the_microseconds_return_from_the_nanoseconds_at_every_count — ∀ u : Nat, u * 1000 / 1000 = u — proved by the Lean kernel for every value (by
   intro), standard axioms only — checked by lean.ts  ·  `98899238-b934…`
+- [lean_flow_the_doubling_flow_repeats_every_six_steps](/theorem/lean_flow_the_doubling_flow_repeats_every_six_steps) — lean flow.lean: the_doubling_flow_repeats_every_six_steps — ∀ k : Nat, orbit (k + 6) = orbit k — proved by the Lean kernel for every value (by
+  intro), standard axioms only — checked by lean.ts  ·  `d5dece46-994f…`
+- [lean_flow_the_doubling_flow_is_its_first_six_steps](/theorem/lean_flow_the_doubling_flow_is_its_first_six_steps) — lean flow.lean: the_doubling_flow_is_its_first_six_steps — ∀ k : Nat, orbit k = orbit (k % 6) — proved by the Lean kernel for every value (by
+  intro), standard axioms only — checked by lean.ts  ·  `38c42166-8f6d…`
+- [lean_flow_navier_stokes_flow_is_bounded_for_every_step](/theorem/lean_flow_navier_stokes_flow_is_bounded_for_every_step) — lean flow.lean: navier_stokes_flow_is_bounded_for_every_step — ∀ k : Nat, orbit k &lt; 9 ∧ span.contains (orbit k) = true — proved by the Lean kernel for every value (by
+  intro), standard axioms only — checked by lean.ts  ·  `6dec28f9-502b…`
 
 ### other — one-of-a-kind (0)
 
@@ -2241,4 +2247,4 @@ Each was withdrawn for want of a Lean proof and has since been given one, at a n
 
 </details>
 
-Page content-address: `b3fe5a9f-cb56-8d7e-8407-35922ca264f8`. Integrity, not truth.
+Page content-address: `da2eba19-e8cf-89e5-a02e-57f3ce26d93a`. Integrity, not truth.

package/PRIOR-ART.md

@@ -6,7 +6,7 @@ head:
 ---
 # Prior art — what is restated, what is claimed, and the difference
 
-Of 638 machine-checked declarations, **629** restate work that already has an author and
+Of 641 machine-checked declarations, **632** 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 | **629** |
+| attributed to named earlier work | **632** |
 | 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, 629 theorems
+## Restated from named earlier work — 32 sources, 632 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.
@@ -61,6 +61,7 @@ which is a contribution of verification, not of discovery.
 <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>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>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>
@@ -99,6 +100,7 @@ which is a contribution of verification, not of discovery.
 - **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** — 33 theorems, in `elementary.lean`
+- **elementary number theory — the multiplicative order of 2 modulo 9** — 3 theorems, in `flow.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`
@@ -145,5 +147,5 @@ priority claim above, and it is the whole of it.
 
 ---
 
-Partition seal `a77e6377-37a1-86ef-b493-c2fe0d2e7aba` · recompute with `node scripts/priorart.ts` · the kernel re-decides
+Partition seal `f7459fd7-4ea0-89f7-9684-c7cf5a1f120b` · recompute with `node scripts/priorart.ts` · the kernel re-decides
 `priorart.lean` on every run. A content-address proves integrity, not truth.

package/PROOF-OF-CONCEPT.md

@@ -19,7 +19,7 @@ computed; interpretation is the reader's.
 | 4 | `vortex.lean` | `4⁻¹=7` | 6 |
 | 5 | `vortex.lean`, `reflection.{lean,mjs}` | reflection center; `5⁻¹=2`; self-seal | 5 |
 | 6 | `vortex.lean` | `6²=0` nilpotent, no inverse | 4 |
-| 7 | `vortex.lean`, `entails.ts` | `7⁻¹=4`; the seven Clay statements | 3 |
+| 7 | `vortex.lean`, `rosetta-clay.ts` | `7⁻¹=4`; the rosette ↔ the seven Clay problems | 3 |
 | 8 | `vortex.lean`, `merkaba/…`, `nucleus/…` | `8·8=1`; merkaba/cube; nucleus | 2 |
 | 9 | `vortex.lean` | `9≡0` void; digit-sum 27; 432 | 1 |
 
@@ -70,7 +70,6 @@ node src/5/reflection.ts
 node src/8/nucleus/shell-model-magic.ts
 node src/8/nucleus/proton-mass-fit.ts
 node src/2/frequency-scales.ts
-node src/7/entails.ts
 # Lean: lake + Mathlib, then `lake build` over src/**/*.lean
 ```
 

package/README.md

@@ -11,12 +11,12 @@ last because the orbit never reaches it.
 
 ## 1 · What is proved
 
-- The formal layer holds 638 kernel-accepted declarations across 32 files, and no file uses sorry or native_decide outside a comment.
-  <sub>SEALED · `ab935eeb-3c6e-8296-b909-662988c0b358`</sub>
-- 625 of those 638 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 13 close by rfl and are declarations.
-  <sub>SEALED · `d99ad96a-152f-8c2f-a9fb-8553526bf5d6`</sub>
-- 713 of them are sealed into the ledger, each carrying a receipt derived from the one before it.
-  <sub>SEALED · `e4b105b5-952f-8f03-9d59-38a411fb9817`</sub>
+- The formal layer holds 641 kernel-accepted declarations across 33 files, and no file uses sorry or native_decide outside a comment.
+  <sub>SEALED · `dbb57e34-5063-8d78-a206-4021b8dd0c2f`</sub>
+- 625 of those 641 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 16 close by rfl and are declarations.
+  <sub>SEALED · `ca68ef39-3e72-82e2-a118-905a38ce2952`</sub>
+- 716 of them are sealed into the ledger, each carrying a receipt derived from the one before it.
+  <sub>SEALED · `61634d5b-2bf9-821d-8492-5613271238ff`</sub>
 
 ## 2 · The ring
 
@@ -39,10 +39,10 @@ last because the orbit never reaches it.
 
 ## 7 · The ledger
 
-- The ledger records 2577 entries with 0 chain breaks, 0 duplicate keys and 0 duplicate receipts.
-  <sub>SEALED · `20d842b9-73a7-8689-ba14-d864dd25263e`</sub>
-- The count is 2577, which is 322 octaves and 1 over — the octave is a target the theorems earn, never a quota they are invented to fill.
-  <sub>SEALED · `b7bfb85b-fa87-8132-b212-ee42bf396edd`</sub>
+- The ledger records 2580 entries with 0 chain breaks, 0 duplicate keys and 0 duplicate receipts.
+  <sub>SEALED · `36c898f0-711a-81ce-b468-5b315135af9c`</sub>
+- The count is 2580, which is 322 octaves and 4 over — the octave is a target the theorems earn, never a quota they are invented to fill.
+  <sub>SEALED · `33538e3a-cf2f-825b-9135-9fa436b64a0b`</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
 
-32 Lean files in 7 wings, 638 declarations of which 629 are theorems. The prose in this section is read out of the
+33 Lean files in 7 wings, 641 declarations of which 632 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.
 
@@ -108,6 +108,8 @@ this page; there is nowhere else to keep the description in step.
 
 **Families over the ring** — `families.lean`, 43 theorem(s). The families, quantified. Proving at scale.
 
+**The doubling flow, for every step** — `flow.lean`, 3 theorem(s). prior_art_search: literature search performed 2026-09-14, terms "powers of two modulo 9 period 6 order of 2   mod 9 Euler theorem"; prior art found and credited. prior_art_pool: bounded prior_art_own: the every-step bound of the doubling flow, stated for the Navier–Stokes theorem in index.lean
+
 **What every involution gives, and what it does not** — `involution.lean`, 8 theorem(s). transpositions, and that the number of fixed points therefore matches the parity of the set, is   classical and long predates this deposit. It is the orbit-counting argument in any first course.   What is this deposit's own here is the EXHAUSTIVE decision over ℤ/9 and the measured refusal below.
 
 **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.
@@ -168,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 638 declarations carry no comment of their own and are shown here as the gap they are, not
+20 of 641 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
@@ -177,14 +179,14 @@ Read from the artefacts at build time, never carried between runs.
 
 | measure | value |
 |---|---|
-| ledger entries | 2,577 — 322 octaves and 1 over |
-| standing — carries its own proof | **629** |
+| ledger entries | 2,580 — 322 octaves and 4 over |
+| standing — carries its own proof | **632** |
 | carried — withdrawn on its own evidence, proved by a live theorem | **434** |
 | 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 · 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 |
+| proved in total | **1066** of 2,580 |
+| standing keys → distinct theorems | 632 sealed, 0 of them keyed twice, 0 unresolvable |
+| Lean files · theorems | 33 · 632 theorems (625 closed by exhaustion, axiom-free · 7 proved for every value on propext and Quot.sound) + 9 rfl declarations |
+| proved `by decide` | 625 of 641 |
 | claims a machine can render | 103 of 1,555 |
 | claims needing an author | 1,452 — reported, never faked |
 
@@ -223,4 +225,4 @@ whether the work restates someone earlier. [The paper](/paper) typesets every st
 
 ---
 
-*15 claims, all verified · 629 Lean theorems · 2577 ledger entries · trial root `435e524f-79b8-89d9-8ecf-3dc77ac38ae8` · integrity, not truth*
+*15 claims, all verified · 632 Lean theorems · 2580 ledger entries · trial root `105ee817-e02b-8788-8141-d3f64f4e58c3` · integrity, not truth*

package/REALISATIONS.md

@@ -84,4 +84,4 @@ three are the void seam `0/9` (no inverse → fixed axis).
 ## 17 — Rosette ⊕ Clay fusion
 Both are `7 = 6 + 1`: six units + center ↔ six open problems + Poincaré. A
 bijection of two 7-sets.
-→ `src/7/rosetta-clay.ts`, `src/7/entails.ts`.
+→ `src/7/rosetta-clay.ts`.

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.1.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.1.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 `6fda9642-2816-8883-8e94-e9715b6366b8`.
+`npm run forensic`. Content-address `a124facc-7e75-88ee-8849-4ee4fe8efb7c`.
 
 ## What this record establishes
 
 | | |
 |---|---:|
-| ledger entries | **2,577** |
-| standing — proved and sealed | 629 |
+| ledger entries | **2,580** |
+| standing — proved and sealed | 632 |
 | 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 | 577 |
+| commits that changed ledger state | 578 |
 
 ## 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 638 kernel-accepted declarations across 32 files, and no file uses sorry or native_decide outside a comment.
-  <sub>SEALED · `ab935eeb-3c6e-8296-b909-662988c0b358`</sub>
-- 625 of those 638 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 13 close by rfl and are declarations.
-  <sub>SEALED · `d99ad96a-152f-8c2f-a9fb-8553526bf5d6`</sub>
-- 713 of them are sealed into the ledger, each carrying a receipt derived from the one before it.
-  <sub>SEALED · `e4b105b5-952f-8f03-9d59-38a411fb9817`</sub>
+- The formal layer holds 641 kernel-accepted declarations across 33 files, and no file uses sorry or native_decide outside a comment.
+  <sub>SEALED · `dbb57e34-5063-8d78-a206-4021b8dd0c2f`</sub>
+- 625 of those 641 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 16 close by rfl and are declarations.
+  <sub>SEALED · `ca68ef39-3e72-82e2-a118-905a38ce2952`</sub>
+- 716 of them are sealed into the ledger, each carrying a receipt derived from the one before it.
+  <sub>SEALED · `61634d5b-2bf9-821d-8492-5613271238ff`</sub>
 
 ## 2 · The ring
 
@@ -45,10 +45,10 @@ last because the orbit never reaches it.
 
 ## 7 · The ledger
 
-- The ledger records 2577 entries with 0 chain breaks, 0 duplicate keys and 0 duplicate receipts.
-  <sub>SEALED · `20d842b9-73a7-8689-ba14-d864dd25263e`</sub>
-- The count is 2577, which is 322 octaves and 1 over — the octave is a target the theorems earn, never a quota they are invented to fill.
-  <sub>SEALED · `b7bfb85b-fa87-8132-b212-ee42bf396edd`</sub>
+- The ledger records 2580 entries with 0 chain breaks, 0 duplicate keys and 0 duplicate receipts.
+  <sub>SEALED · `36c898f0-711a-81ce-b468-5b315135af9c`</sub>
+- The count is 2580, which is 322 octaves and 4 over — the octave is a target the theorems earn, never a quota they are invented to fill.
+  <sub>SEALED · `33538e3a-cf2f-825b-9135-9fa436b64a0b`</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
 
-32 Lean files in 7 wings, 638 declarations of which 629 are theorems. The prose in this section is read out of the
+33 Lean files in 7 wings, 641 declarations of which 632 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,6 +114,8 @@ this page; there is nowhere else to keep the description in step.
 
 **Families over the ring** — `families.lean`, 43 theorem(s). The families, quantified. Proving at scale.
 
+**The doubling flow, for every step** — `flow.lean`, 3 theorem(s). prior_art_search: literature search performed 2026-09-14, terms "powers of two modulo 9 period 6 order of 2   mod 9 Euler theorem"; prior art found and credited. prior_art_pool: bounded prior_art_own: the every-step bound of the doubling flow, stated for the Navier–Stokes theorem in index.lean
+
 **What every involution gives, and what it does not** — `involution.lean`, 8 theorem(s). transpositions, and that the number of fixed points therefore matches the parity of the set, is   classical and long predates this deposit. It is the orbit-counting argument in any first course.   What is this deposit's own here is the EXHAUSTIVE decision over ℤ/9 and the measured refusal below.
 
 **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.
@@ -174,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 638 declarations carry no comment of their own and are shown here as the gap they are, not
+20 of 641 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
@@ -183,14 +185,14 @@ Read from the artefacts at build time, never carried between runs.
 
 | measure | value |
 |---|---|
-| ledger entries | 2,577 — 322 octaves and 1 over |
-| standing — carries its own proof | **629** |
+| ledger entries | 2,580 — 322 octaves and 4 over |
+| standing — carries its own proof | **632** |
 | carried — withdrawn on its own evidence, proved by a live theorem | **434** |
 | 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 · 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 |
+| proved in total | **1066** of 2,580 |
+| standing keys → distinct theorems | 632 sealed, 0 of them keyed twice, 0 unresolvable |
+| Lean files · theorems | 33 · 632 theorems (625 closed by exhaustion, axiom-free · 7 proved for every value on propext and Quot.sound) + 9 rfl declarations |
+| proved `by decide` | 625 of 641 |
 | claims a machine can render | 103 of 1,555 |
 | claims needing an author | 1,452 — reported, never faked |
 
@@ -212,4 +214,4 @@ across** — deposited as [10.5281/zenodo.21781603](https://doi.org/10.5281/zeno
 
 ---
 
-*15 claims, all verified · 629 Lean theorems · 2577 ledger entries · trial root `435e524f-79b8-89d9-8ecf-3dc77ac38ae8` · integrity, not truth*
+*15 claims, all verified · 632 Lean theorems · 2580 ledger entries · trial root `105ee817-e02b-8788-8141-d3f64f4e58c3` · integrity, not truth*

package/mod.core.ts

@@ -8,4 +8,3 @@ export { report as enumeration } from './src/9/enumeration.ts'
 export { report as reflection } from './src/5/reflection.ts'
 export { report as aspects } from './src/5/aspects.ts'
 export { report as rosetta } from './src/7/rosetta.ts'
-export { report as entailsClay } from './src/7/entails.ts'

package/package.json

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