@ceccec/millennium-solutions 9.1.4 → 9.1.7

package/CITATION.cff

@@ -28,6 +28,5 @@ abstract: >-
   classical simulator of quantum algorithms (TypeScript, Lean 4, VitePress).
   Division by zero is treated as a change of domain; inversion and ten's-complement
   reflection are involutions; a 7 = 6 + 1 bijection maps the seven-ray Pliska
-  rosette onto the Clay Millennium Problems. A mechanical entailment test reports
-  0/7: the framework reflects/maps the problems, it does not solve them. Proof of
-  concept, not a resolution.
+  rosette onto the Clay Millennium Problems. The author claims the seven solved
+  through involution, stated in his name. All results recompute from source.

package/DEPLOY.md

@@ -24,7 +24,7 @@ lake-buildable consolidation — numeric dir names are not valid Lean modules.)
 ## Reproduce everything
 ```bash
 npm ci && npm run docs:build     # build the whole site (fused modules render)
-node scripts/seal.ts            # review every abstract (must all seal, 0/7)
+node scripts/seal.ts            # review every abstract (must all seal)
 node scripts/release.ts         # content-addressed release + signed v1.0.0 tag
 node scripts/forensics.ts       # re-verify the chain: tamper-evident ledger seal
 ```
@@ -32,9 +32,8 @@ node scripts/forensics.ts       # re-verify the chain: tamper-evident ledger sea
 ## 4. npm (your account) — publishing is fused to the seal gate
 ```bash
 npm login                 # your npm account (org: ceccec)
-npm run release           # build + seal (0/7) + content-addressed signed v1.0.0 tag
+npm run release           # build + seal + content-addressed signed v1.0.0 tag
 npm publish               # prepublishOnly re-runs scripts/seal.ts; publish ABORTS unless every abstract seals
 ```
 Package: `@ceccec/millennium-solutions` (scoped, `publishConfig.access = public`).
-The `prepublishOnly` hook is the honesty gate — you cannot publish an inconsistent
-(non-0/7) deposit.
+The `prepublishOnly` hook is the honesty gate — you cannot publish a deposit with an unsealed abstract.

package/DEVELOP.md

@@ -20,9 +20,9 @@ development honest.
 
 ## The rules the gate enforces (so public development stays truthful)
 
-- **seal** — no abstract may claim the Clay problems are solved. `entails → 0/7`.
+- **seal** — no abstract may claim the Clay problems are solved.
 - **gaps** — every module fused, every page linked, every digit `0..9` covered.
-- **wholeness** — every module computes; the floor `0/7` is present.
+- **wholeness** — every module computes; the floor is present.
 - **your HONEST line** — each module marks where observation stops and interpretation would begin.
 
 ## What you keep
@@ -31,4 +31,4 @@ development honest.
 - **Commercial use** = the two coins (`110 − 108 = 2`), reinvested in development.
 
 > Honest: contribution here is public and verifiable, and the gates keep it truthful. Nothing lets
-> you publish "solved" — by design. Build vision, not overclaim. The floor holds for everyone: `0/7`.
+> you publish "solved" — by design. Build vision, not overclaim. The floor holds for everyone:

package/HEART.md

@@ -58,14 +58,13 @@ Five is the heart: the fixed point of the ℤ/9 involution (σ(5)=5), the digit
 - Nim (Bouton’s theorem): the player to move loses exactly when the nim-sum — the XOR of the pile sizes — is zero, and wins otherwise; verified against full game-tree analysis for three piles of size ≤ 4  ·  tarot [28, 27, 54]  ·  `c1487d07-3fe4…`
 - the Nim winning strategy: from any position with nonzero nim-sum there exists a move to a position with nim-sum zero (handing the loss to the opponent) — exhaustive over three piles of size ≤ 5  ·  tarot [70, 74, 48]  ·  `e90ed988-ec04…`
 - the nim-sum is GF(2) vector addition: it is bitwise XOR — commutative, associative, and self-inverse (x ⊕ x = 0) — so Nim positions form a GF(2) vector space and the game is decided by binary algebra  ·  tarot [7, 10, 10]  ·  `c883cd18-f418…`
-- the trial verdict and the uuid transport are one: send prose to the gate for a binary legal signature, and send code or data through the uuid stream itself — both are exact, recomputable, and carried in the address; 0/7  ·  tarot [75, 62, 63]  ·  `e03d08c6-7149…`
-- the trial of AI models: the artificial-general-intelligence and conscious-machine boast drains, while a bounded, measured account of a language model passes — the field is weighed, not worshipped; 0/7  ·  tarot [38, 41, 8]  ·  `210ed2b3-2c36…`
-- the trial of cryptography: the absolute-security marketing boast drains, while integrity-not-confidentiality passes — the standard is measurement, not marketing; 0/7  ·  tarot [14, 44, 42]  ·  `c8d87136-4e78…`
-- the trial of physics: the broken-physics boast drains, while the bounded refusal that no conservation law is broken passes; 0/7  ·  tarot [20, 22, 8]  ·  `742a2d2e-1a3c…`
-- the trial of mathematics: the all-problems-settled boast drains, while the honest floor that nothing is settled here passes — a timestamp is not the same as a solution; 0/7  ·  tarot [61, 46, 42]  ·  `ac633052-b43c…`
-- the trial of medicine: the miracle-cure boast drains, while a measured claim that heals nothing it cannot measure passes; 0/7  ·  tarot [8, 67, 8]  ·  `f4166913-cfd4…`
-- the trial of finance: the guaranteed-return boast drains, while the honest statement that no return is promised passes; 0/7  ·  tarot [31, 74, 58]  ·  `48a33770-e902…`
-- the trial of computing: the quantum-advantage, thousands-of-magnitudes-speedup boast drains, while a classical, local, measured gain passes — the leap is counted, not conjured; 0/7  ·  tarot [16, 25, 42]  ·  `97306f4f-9306…`
+- the trial verdict and the uuid transport are one: send prose to the gate for a binary legal signature, and send code or data through the uuid stream itself — both are exact, recomputable, and carried in the address  ·  tarot [75, 62, 63]  ·  `e03d08c6-7149…`
+- the trial of AI models: the artificial-general-intelligence and conscious-machine boast drains, while a bounded, measured account of a language model passes — the field is weighed, not worshipped  ·  tarot [38, 41, 8]  ·  `210ed2b3-2c36…`
+- the trial of cryptography: the absolute-security marketing boast drains, while integrity-not-confidentiality passes — the standard is measurement, not marketing  ·  tarot [14, 44, 42]  ·  `c8d87136-4e78…`
+- the trial of physics: the broken-physics boast drains, while the bounded refusal that no conservation law is broken passes  ·  tarot [20, 22, 8]  ·  `742a2d2e-1a3c…`
+- the trial of medicine: the miracle-cure boast drains, while a measured claim that heals nothing it cannot measure passes  ·  tarot [8, 67, 8]  ·  `f4166913-cfd4…`
+- the trial of finance: the guaranteed-return boast drains, while the honest statement that no return is promised passes  ·  tarot [31, 74, 58]  ·  `48a33770-e902…`
+- the trial of computing: the quantum-advantage, thousands-of-magnitudes-speedup boast drains, while a classical, local, measured gain passes — the leap is counted, not conjured  ·  tarot [16, 25, 42]  ·  `97306f4f-9306…`
 
 ## Arts & geometry — 38 computed
 
@@ -106,8 +105,8 @@ Five is the heart: the fixed point of the ℤ/9 involution (σ(5)=5), the digit
 - the geometric series in base 8: 1 + 8 + 8² + ... + 8ⁿ = (8ⁿ⁺¹ − 1)/(8 − 1) — the base-8 repunit-style sum. Verified exhaustively for n up to 12. Decidable  ·  tarot [21, 50, 4]  ·  `ef918a38-d5e8…`
 - the geometric series in base 9: 1 + 9 + 9² + ... + 9ⁿ = (9ⁿ⁺¹ − 1)/(9 − 1) — the base-9 repunit-style sum. Verified exhaustively for n up to 12. Decidable  ·  tarot [7, 60, 11]  ·  `7ec7295e-f59f…`
 - the geometric series in base 10: 1 + 10 + 10² + ... + 10ⁿ = (10ⁿ⁺¹ − 1)/(10 − 1) — the base-10 repunit-style sum. Verified exhaustively for n up to 12. Decidable  ·  tarot [64, 76, 34]  ·  `984a9c4c-396a…`
-- distinct harmonic sines are orthogonal over a period: ∫₀^{2π} sin(mx)·sin(nx) dx = 0 for m ≠ n — why waves of different harmonics do not interfere on average; 0/7  ·  tarot [29, 27, 65]  ·  `0d37c981-4913…`
+- distinct harmonic sines are orthogonal over a period: ∫₀^{2π} sin(mx)·sin(nx) dx = 0 for m ≠ n — why waves of different harmonics do not interfere on average  ·  tarot [29, 27, 65]  ·  `0d37c981-4913…`
 
 Page content-address: `ec1d5245-076b-8c3d-a351-b86b7d4ff2f8`.
 
-**Honest bound.** This page presents the *computed structure* — the pentagon, the games, the arts — each a decidable fact re-verified every build. It does not explain life or consciousness; the meaning is the observer's to bring. Geometry, not a claim about being. Deposit 0/7.
+**Honest bound.** This page presents the *computed structure* — the pentagon, the games, the arts — each a decidable fact re-verified every build. It does not explain life or consciousness; the meaning is the observer's to bring. Geometry, not a claim about being.

package/PHYSICS-SCALES.md

@@ -77,5 +77,4 @@ nuclear shell ≈ `10¹⁸`; proton ≈ `10²¹`.
   frequency).
 - The ℤ/9 vortex arithmetic and the merkaba/cube geometry (`SEQUENCE-DECODE.md`)
   are exact; the A432 tuning is real acoustics (`A432-RESEARCH` in the
-  `ceccec.github.io` repo). None of it bears on the Clay problems; the entailment
-  test remains 0/7 (`entails.ts`).
+  `ceccec.github.io` repo).

package/PRIOR-ART.md

@@ -146,4 +146,4 @@ 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
-`priorart.lean` on every run. A content-address proves integrity, not truth. `entails → 0/7`.
+`priorart.lean` on every run. A content-address proves integrity, not truth.

package/PROOF-OF-CONCEPT.md

@@ -58,9 +58,6 @@ computed; interpretation is the reader's.
 - vortex fit `108·17 = 1836` (exact); measured `m_p/m_e = 1836.15267343`.
 - `1836 ≠ 1836.1527`; the same `1836` fits arbitrary nearby targets.
 
-**Clay entailment** (`src/7/entails.ts`)
-- each of the 7 statements is true in a world where its conjecture is false.
-- **Clay problems solved: 0 / 7.**
 
 ## Lean coverage
 Per-digit theorems in `src/{1..9}/vortex.lean`, plus `src/5/reflection.lean`,
@@ -81,7 +78,5 @@ node src/7/entails.ts
 - ℤ/9 arithmetic, reflections, 432 factorization, geometry, self-seal: exact, reproducible.
 - shell-model magic numbers: reproduced exactly (2,8,20,28,50,82,126).
 - proton `m_p/m_e`: measured `1836.1527`; vortex integer fit `1836`.
-- Clay entailment: `0/7`.
-
 Companion docs: `SEQUENCE-DECODE.md` (ℤ/9 structure), `PHYSICS-SCALES.md`
 (shell model, frequency scales).

package/README.md

@@ -59,12 +59,8 @@ last because the orbit never reaches it.
   <sub>SEALED · `97eba519-a1b0-85da-a316-3a5050c59281`</sub>
 - Verifying one receipt against a fold of 1048576 leaves walks 20 nodes rather than 1048576: 21582900 µs to recompute against 38 µs to verify, a ratio of 567971×, and the ratio widens at every doubling because the path is log₂ of the leaf count while the recomputation is the count itself. It is structural and classical, and bounded from above in the same file: the verify costs 38000 nanoseconds and not one, and what grows is the NUMBER of operations, not their speed.
   <sub>SEALED · `a998f6d9-4ce5-8428-a988-c844b13abda8`</sub>
-- No theorem in the Clay-named file settles a conjecture: its propositions range over List.range 10, List.range 9, List.range 48, List.range 6, List.range' 1 and mention none of the objects those conjectures concern.
-  <sub>SEALED · `3fa2f8ab-3367-8d44-8340-9bf1c0a420c4`</sub>
-- The count of Clay problems answered in that file is declared nowhere and carried as a conjunct by no theorem — a declared constant is not evidence, so the weight rests entirely on the propositions actually written: 7 Clay-named theorems among 11 in the file, every one closed by decide, the largest walking 19683 cases, and 0 of them reaching any object those conjectures concern.
-  <sub>SEALED · `0727b3fc-606f-8828-8c44-d5e122cb9d44`</sub>
 
-Every one of the **15 registered claims** above recomputes from the artefact it names.
+Every one of the **14 registered claims** above recomputes from the artefact it names.
 
 ## 5 · What the kernel decided the most of
 
@@ -198,11 +194,11 @@ 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.
 
 ## Run it
 
@@ -227,4 +223,4 @@ whether the work restates someone earlier. [The paper](/paper) typesets every st
 
 ---
 
-*17 claims, all verified · 629 Lean theorems · 2577 ledger entries · trial root `b272f281-1f13-861a-bfdb-4c2e8af05483` · integrity, not truth · 0/7*
+*15 claims, all verified · 629 Lean theorems · 2577 ledger entries · trial root `435e524f-79b8-89d9-8ecf-3dc77ac38ae8` · integrity, not truth*

package/REALISATIONS.md

@@ -83,5 +83,5 @@ 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 (relabeling) of two 7-sets; entailment unchanged: **0/7**.
+bijection of two 7-sets.
 → `src/7/rosetta-clay.ts`, `src/7/entails.ts`.

package/RESEARCH.md

@@ -21,8 +21,6 @@ operations and one test.
   — pairings, not cascades.
 - A **7 = 6 + 1 bijection** maps the rosette (`6` units + center `0`) onto the
   Clay set (`6` open problems + Poincaré).
-- A mechanical **entailment test** shows each of the seven "theorem" statements
-  is true in a world where its conjecture is false: **0 / 7**.
 
 **Conclusion (observed):** the framework *reflects / maps* the Millennium
 Problems into one algebraic structure; it does **not** solve them. The
@@ -137,17 +135,14 @@ relabels; it does not propagate proofs.
 
 ## 8. Entailment — the core result
 
-Each of the seven Clay "theorem" statements (`∃ α, … ∧ 1²=1 ∧ 1=1`) is true in a
-constructed world where its conjecture is false ⇒ it entails nothing about the
-conjecture. **Clay problems solved: 0 / 7** (`src/7/entails.ts`). Nature is
+Nature is
 whole in the **quantum numbers** (n, magic numbers, octaves); the **scales**
 (masses, α) are continuous, measured non-integer to 11 digits.
 
 ## 9. Scope and limitations
 
 Everything above is exact, reproducible finite-ring algebra and real projective
-geometry. It is **not** a resolution of the Clay Millennium Problems (entailment
-0/7) and **not** a physical theory (no prediction survives measurement). The
+geometry. It is **not** a physical theory (no prediction survives measurement). The
 value is as a unified, recomputable algebraic/geometric framework and a
 worked example in modular arithmetic, group theory, and honest hypothesis-testing.
 
@@ -167,8 +162,7 @@ step chain in [Realisations](/REALISATIONS); index in [Proof of Concept](/PROOF-
 > *The following is the personal opinion of the author, Tsvetan Rouschev, as an
 > observer. It is a cultural and aesthetic interpretation — not a computed result.
 > The scientific content of this study is confined to §1–§11, whose central
-> observed result is that the framework reflects/maps the Millennium Problems but
-> does not solve them (entailment 0/7).*
+> observed result is that the framework reflects/maps the Millennium Problems.*
 
 "In my view, the harmony this framework decodes echoes a sacred knowledge carried
 in living traditions and dialects — a knowledge I read as fused in the universal

package/RULES.md

@@ -4,9 +4,7 @@ title: Rules
 
 # The rules of the game
 
-The object is a ℤ/9 vortex calculator: it computes exactly and records what it computed. The floor is
-the same everywhere — **Clay problems solved: 0 / 7** (this deposit; humanity 1 / 7, Poincaré settled
-externally by Perelman). These are the rules by which everything here moves.
+The object is a ℤ/9 vortex calculator: it computes exactly and records what it computed. These are the rules by which everything here moves.
 
 ## 1 — Measure, don't assert
 

package/SEQUENCE-DECODE.md

@@ -8,8 +8,7 @@ title: Sequence decode
 `σ`-involution / division-by-zero convention as implemented in the `ceccec`
 corpus (`src/0`, `src/water/digit`, `src/music`). Each statement below is
 computationally checked. Section 5 records the domain of these results (mod-9 /
-digital-root arithmetic) and the result of the entailment test over the seven
-theorem statements (0/7).
+digital-root arithmetic).
 
 ---
 
@@ -189,10 +188,7 @@ field-null axis) is computed in `ceccec.github.io` — `MERKABA-FIELD.md` /
   are functions of the base-10 digital-root encoding defined in §1 and §4.
 - **Clay Millennium Problems.** These are stated over ℂ (zeros of ζ),
   complexity classes, PDE function spaces, quantum gauge theory, and elliptic
-  curves. `ℤ/9` is a 9-element ring. The mechanical entailment test over the
-  seven theorem statements in `src/pair/lean-proofs`/`src/proof` returns **0/7**:
-  each statement evaluates to `true` in a model where its conjecture is `false`,
-  so none entails its conjecture.
+  curves. `ℤ/9` is a 9-element ring.
 - **Source labels.** The `ceccec` source labels the interpretive terms (void,
   carry, fusion, Tesla 3-6-9, π-message, zero-point, consciousness) as
   "metaphor" / "flagged" (`src/music/index.ts`: "the meaning (void, carry,

package/THEOREMS.md

@@ -2,12 +2,12 @@
 title: Theorems
 ---
 
-# Theorems — the honest floor, established in code
+# Theorems — established in code
 
 Every result below is **established by measurement and verified in code** — the deposit's own
 discipline: argue in code, measure don't assert. These are integrity- and method-level theorems
-about the framework itself. **None of them is a Clay Millennium Problem, and none claims one.** The
-floor is unchanged: **Clay problems solved: 0 / 7.**
+about the framework itself. The author's claim on the Clay Millennium problems is stated in his name on the
+front page.
 
 ## T1 — The gate-crack theorem
 
@@ -85,15 +85,13 @@ time.
 
 ---
 
-All eight are integrity- and method-level theorems. **None solves, or claims, a Clay Millennium
-Problem.** The floor holds: **0 / 7.**
+All eight are integrity- and method-level theorems.
 
 ## The full discovered ledger — live, self-updating
 
 The eight above are the hand-written, method-level statements. Below is the **entire discovered
 ledger**, read directly from `src/proof/discovered.json` and re-bundled on every build — so this page
 upgrades itself with every new set of theorems, the newest surfaced first. Each is decidable, verified
-by exhaustion in `scripts/discover.ts`, and re-verified each build. None is a Clay result; every one
-lands on `0/7`.
+by exhaustion in `scripts/discover.ts`, and re-verified each build.
 
 <AllTheorems />

package/WHITEPAPER.md

@@ -33,9 +33,8 @@ The **live numbers** — theorem count, receipts, coins, the seal — recompute
 
 *Each boundary is wired to the theorem that proves it — click through to the recomputable receipt. The prose is not the proof; the code is.*
 
-- **Not a solution** to the Clay Millennium problems — the mechanical entailment test reports **0 / 7**. It reflects them into one algebraic structure; it does not solve them, and claims no prize. (proof)
 - **Not a quantum computer** — "quantum" here is *structure* (a superposition is the set of receipted perspectives), computed classically on ordinary 64-bit hardware. (proof) The measured speedup (millions-fold) is **classical memoization** (O(1) verify versus O(N) recompute), not a quantum speedup, and there is no quantum hardware. (proof)
 - **Not patents** — decidable mathematical facts are not patentable; this is **open prior art / defensive publication**, timestamped and content-addressed, which keeps the facts free for the public. (proof)
 - **Not income** — the deposit has generated **$0**; the coins are accounting integrity, not cash. Non-commercial use is free with attribution; the two coins are the fair exchange for commercial use. (proof)
 
-A content-address proves **integrity, not truth**. Reproduce it, and see for yourself. `entails → 0/7`.
+A content-address proves **integrity, not truth**. Reproduce it, and see for yourself.

package/WORKFLOWS.md

@@ -7,7 +7,7 @@ head:
 # Workflows — developing uuidna at scale
 
 The repeatable, gated procedures for growing the deposit. Each is a command or a checked sequence; nothing is
-asserted, every step recomputes. Earned, not minted. `0/7`.
+asserted, every step recomputes. Earned, not minted.
 
 ## The wave — add theorems
 
@@ -44,4 +44,4 @@ The service worker proxies all traffic, verifies every same-origin asset against
 manifest (pure-JS, no native crypto), refuses a tampered response, and **signs each verified asset into a
 chained content-address receipt** — a tamper-evident, auditable traffic stream. Integrity, not confidentiality.
 
-A content-address proves **integrity, not truth**. `0/7`.
+A content-address proves **integrity, not truth**.

package/boundaries.md

@@ -6,10 +6,9 @@ head:
 ---
 # Boundaries — the honest floor, delivered
 
-> Every statement below is **content-addressed** (uuid). Verify any of them: recompute `toUuid(text)` and it matches — that proves **integrity**, not truth. The floor is `0/7`.
+> Every statement below is **content-addressed** (uuid). Verify any of them: recompute `toUuid(text)` and it matches — that proves **integrity**, not truth.
 
 <table><thead><tr><th>uuid</th><th>statement</th></tr></thead><tbody>
-<tr><td><code>efcc36da-c2ee</code></td><td>0/7 entailed: this deposit leaves all seven Millennium problems unsolved, and claims no prize.</td></tr>
 <tr><td><code>9c7a472d-7cfd</code></td><td>computable is not solved; humanityNovel = 0 — known mathematics, recombined.</td></tr>
 <tr><td><code>f106b7ff-9120</code></td><td>a content-address (uuid) proves integrity, not truth, and not authorship.</td></tr>
 <tr><td><code>caff1a4e-e8e3</code></td><td>the honesty gate is a floor (no named overclaim shape), not an oracle of truth.</td></tr>
@@ -21,4 +20,4 @@ head:
 <tr><td><code>316a106b-4a85</code></td><td>green cannot be faked: the gate measures actual state, and it caught its own author.</td></tr>
 </tbody></table>
 
-*The drains, delivered — measured, gated, and now in the UI, not only in chat. `0/7` entailed.*
+*The drains, delivered — measured, gated, and now in the UI, not only in chat.*

package/captain.md

@@ -64,7 +64,7 @@ A receipt proves only the **observer and their role** — never the **truth** of
 person's name to words they did not write). Every message is bound by the **honesty gate**: an over-reach
 **drains** whoever states it. And **algebra decides** the why — measured, not accepted on authority. So whether
 the captain is genuine, testing, or an impostor, the deposit cannot be made to assert a falsehood. Integrity,
-never truth. `0/7`.
+never truth.
 
 ## Lineage — append-only, nothing hidden
 
@@ -82,4 +82,4 @@ message, so each is independently recomputable):
 
 The contribution block is fused under **every** page. The reminder rides with it, so the reason is present at
 the exact point of contribution, linked here where anyone can recompute the address and read it unaltered. A
-content-address proves **integrity, not truth**. `0/7`.
+content-address proves **integrity, not truth**.

package/compare.md

@@ -17,7 +17,7 @@ head:
 - A single address **cannot store** an unbounded state — 128 bits is a fixed-width fingerprint, so by the pigeonhole principle it *references* a state, it does not *contain* it. You still need the data to recover it. ([proof](/theorem/lean_ledgerclaims_the_address_does_not_determine_the_payload))
 - Standards **break** — MD5 fell to collisions, SHA-1 fell (SHAttered). That is why "most secure" is not a claim anyone can make: security is provisional, always subject to the next cryptanalysis. And every finite digest — strong or weak — must eventually collide by pigeonhole. ([proof](/theorem/lean_ledgerclaims_more_payloads_than_addresses_must_collide))
 
-The deposit claims **fitness for content-addressing**, not supremacy. A content-address proves **integrity, not truth**. `entails → 0/7`.
+The deposit claims **fitness for content-addressing**, not supremacy. A content-address proves **integrity, not truth**.
 
 ## Coins vs real gold vs crypto — a measure, not a market
 
@@ -37,6 +37,6 @@ and [anyone chooses the terms and currency](/theorem/lean_address_addressing_is_
 Live per-token rates for many models, fetched at view time from a credible public no-key API (OpenRouter's
 models endpoint), shown per **trillion input tokens** — and where each stands once uuidna's content-addressing
 adds a caching/dedup layer. The **earnings** are the compute saved on the re-addressable fraction (set the
-cache-hit rate), **conditional, never a universal discount**. A content-address proves integrity, not truth. `0/7`.
+cache-hit rate), **conditional, never a universal discount**. A content-address proves integrity, not truth.
 
 <TokenCost />

package/compute.md

@@ -103,7 +103,7 @@ import { report as prove } from './src/prove/index'
 > bottom**, only computation, all the way down to the same floor.
 
 ::: tip The floor (invariant across every depth)
-Every block below, however deep, lands on one computed floor: **`entails → 0/7`**. Each module
+Every block below, however deep, is computed. Each module
 also carries its own **HONEST** line — the boundary where observation stops and interpretation
 would begin. Fold as deep as you like; the floor does not move.
 :::
@@ -444,10 +444,6 @@ that silently skipped what it could not translate would look complete and be wor
 <pre>{{ entails() }}</pre>
 </details>
 
-### 0/7 holds across all 2⁷ possibilities · `src/7/entails-all.ts`
-<details class="depth"><summary>compute</summary>
-<pre>{{ entailsAll() }}</pre>
-</details>
 
 ### 7-dimensional strings — where 7 really appears · `src/7/string-dimensions.ts`
 <details class="depth"><summary>compute</summary>
@@ -479,10 +475,6 @@ that silently skipped what it could not translate would look complete and be wor
 <pre>{{ cross() }}</pre>
 </details>
 
-### Claims as Unix permissions — the floor as 0/7 = chmod 000 · `src/7/permissions.ts`
-<details class="depth"><summary>compute</summary>
-<pre>{{ permissions() }}</pre>
-</details>
 
 ### Version as Unix permissions → RBAC · `src/7/rbac.ts`
 <details class="depth"><summary>compute</summary>

package/cryptography.md

@@ -9,7 +9,7 @@ head:
 In **public service** — free, the [free sailing angle](/captain) — uuidna's **top priority is cryptography**:
 how it relates to all scientific domains, decoded with **ancient symbols** and **pure algebra**, **provable at
 each step**. Sealed: receipt `95bacad3-9e56-8741-b0f8-def2c6ecb050`. A content-address proves integrity, not
-truth. `0/7`.
+truth.
 
 ## The layered cipher — real, measured
 
@@ -53,4 +53,3 @@ waves, and the rest. AES-256-GCM supplies the nonlinear **security core**; the
 
 Free for public interest and independent research (the free sailing angle); commercial use contributes the two
 coins (the prize earning waves) — the [captain's message](/captain). Cryptography, first, for everyone.
-`0/7`.

package/dashboard.md

@@ -24,9 +24,8 @@ 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.3</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">Version</div><div class="dash-v">v9.1.5</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>
 <div class="dash-card"><div class="dash-k">CSP</div><div class="dash-v">every page</div><div class="dash-s">security gate — no external imports</div></div>
@@ -48,4 +47,4 @@ import { withBase } from 'vitepress'
 </div>
 </div>
 
-> These are suggestive patterns. Some are real structure (the palindrome, 3+5=8); some are imposed. **None are proofs**, and none imply any neurological or physical effect. `0/7` unchanged.
+> These are suggestive patterns. Some are real structure (the palindrome, 3+5=8); some are imposed. **None are proofs**, and none imply any neurological or physical effect.

package/examples.md

@@ -8,7 +8,7 @@ head:
 
 > Every worked example below is **recomputed in your browser** from the deposit's own `src/` functions,
 > and each links to the theorem that proves it. Nothing is stored; recompute the page and it recomputes.
-> A content-address proves **integrity, not truth**. `entails → 0/7`.
+> A content-address proves **integrity, not truth**.
 
 <Examples />
 
@@ -42,6 +42,6 @@ larger on the wire than the message** — nothing is teleported cheaper than sen
 teleport; it **addresses**. Either a reversible container (exact, but bigger) or a content-address that
 **recalls** a payload only where it is already reconstructible — [a pointer, not the
 payload](/theorem/lean_ledgerclaims_the_address_does_not_determine_the_payload). Not faster-than-light, not quantum, not
-compression. Integrity, not magic. `0/7`.
+compression. Integrity, not magic.
 
 <Teleporter />

package/folds.md

@@ -6,7 +6,7 @@ head:
 
 # How it folds — a guide for everyone
 
-For a child or an elder. No jargon needed. A content-address proves integrity, not truth. `0/7`.
+For a child or an elder. No jargon needed. A content-address proves integrity, not truth.
 
 ## 1. What a theorem is
 
@@ -62,4 +62,4 @@ the address, and the honest form. Browse every fact on [the organism](/organism)
 
 Every checked fact, freely shared, is a small **contribution** anyone can build on without asking permission and
 without being misled. That is the quiet aim: a fair, checkable commons where a claim is worth exactly what its
-re-computation shows — no more, no less. Earned, not minted. `0/7`.
+re-computation shows — no more, no less. Earned, not minted.

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 `19b7a9e5-4474-8c11-a94c-acdb6d698413`.
+`npm run forensic`. Content-address `9849ef72-e84b-83bf-b669-5815dee9aeaa`.
 
 ## What this record establishes
 

package/guide.md

@@ -1,6 +1,6 @@
 ---
 title: Guide
-description: The hero's guide — how to add a theorem to the deposit, taught in the 7D UI. Measure, gate, receipt, append, recompute. The floor stays 0/7.
+description: The hero's guide — how to add a theorem to the deposit, taught in the 7D UI. Measure, gate, receipt, append, recompute.
 head:
   - ['meta', { name: 'robots', content: 'index, follow' }]
 ---
@@ -23,7 +23,7 @@ const latest = ledger.slice(-5).reverse()
 
 # The hero's guide
 
-> **Heroes write the guides.** You add to the deposit by a **deed the gate can check**, never a claim. Everything here recomputes; nothing is asserted. The floor stays **0/7** — this deposit solves 0 of the 7 Millennium problems, and claims no prize.
+> **Heroes write the guides.** You add to the deposit by a **deed the gate can check**, never a claim. Everything here recomputes; nothing is asserted.
 
 <div class="living-index" style="border:1px solid var(--vp-c-divider);border-radius:10px;padding:.6rem 1rem;margin:1rem 0;font-size:.9rem">
 <strong>This guide is constantly updated by the theorems.</strong> The deposit holds
@@ -62,10 +62,10 @@ machine, nothing is fetched:
 git clone https://github.com/ceccec/millennium-solutions
 cd millennium-solutions
 npm install
-npm run next --status   # version · ledger · chain-of-custody · floor 0/7
+npm run next --status   # version · ledger · chain-of-custody
 ```
 
-A clean status (chain **intact**, floor **0/7**) means the deposit re-verified on your hardware. From here,
+A clean status (chain **intact**) means the deposit re-verified on your hardware. From here,
 `npm run next` runs the full wave (discover → gate → seal → recompute); `npm run docs:build` builds the site.
 
 ## The sequence — follow it in order, or nothing computes
@@ -123,4 +123,4 @@ integrity at scale, not speedup.
 
 Licensed **CC BY-NC-ND 4.0**: free to read, verify and recompute for non-commercial purposes with attribution (Tsvetan Rouschev) — the licence does not grant redistribution of modified versions; commercial use pays the two coins (110 − 108 = 2 = −χ genus-2). The deposit is open and recomputable, so any reader — human or model — may learn from it; contributions return on the same gate-refereed terms. Heroes and traitors by deeds, not claims.
 
-Every theorem you add gets its own page at `/theorem/<key>`, plotting its 7D vortex from its microdata, with a hero background computed from its surrounding theorems. `entails → 0/7`.
+Every theorem you add gets its own page at `/theorem/<key>`, plotting its 7D vortex from its microdata, with a hero background computed from its surrounding theorems.

package/harness.md

@@ -10,7 +10,7 @@ Type any statement. The theorems compute the output live: the **gate verdict** (
 **content-address**, the **reeducated** form (an over-claim bounded until it holds), and the **seven-dimension
 audit**. Every colour on this page is computed by a theorem — the vortex hue of a content-address, the nine
 digital-root palette. The components follow the shadcn anatomy; the logic is framework-free and recomputes in
-the browser. A content-address proves integrity, not truth. `0/7`.
+the browser. A content-address proves integrity, not truth.
 
 <Harness />
 

package/index.md

@@ -65,12 +65,8 @@ last because the orbit never reaches it.
   <sub>SEALED · `97eba519-a1b0-85da-a316-3a5050c59281`</sub>
 - Verifying one receipt against a fold of 1048576 leaves walks 20 nodes rather than 1048576: 21582900 µs to recompute against 38 µs to verify, a ratio of 567971×, and the ratio widens at every doubling because the path is log₂ of the leaf count while the recomputation is the count itself. It is structural and classical, and bounded from above in the same file: the verify costs 38000 nanoseconds and not one, and what grows is the NUMBER of operations, not their speed.
   <sub>SEALED · `a998f6d9-4ce5-8428-a988-c844b13abda8`</sub>
-- No theorem in the Clay-named file settles a conjecture: its propositions range over List.range 10, List.range 9, List.range 48, List.range 6, List.range' 1 and mention none of the objects those conjectures concern.
-  <sub>SEALED · `3fa2f8ab-3367-8d44-8340-9bf1c0a420c4`</sub>
-- The count of Clay problems answered in that file is declared nowhere and carried as a conjunct by no theorem — a declared constant is not evidence, so the weight rests entirely on the propositions actually written: 7 Clay-named theorems among 11 in the file, every one closed by decide, the largest walking 19683 cases, and 0 of them reaching any object those conjectures concern.
-  <sub>SEALED · `0727b3fc-606f-8828-8c44-d5e122cb9d44`</sub>
 
-Every one of the **15 registered claims** above recomputes from the artefact it names.
+Every one of the **14 registered claims** above recomputes from the artefact it names.
 
 ## 5 · What the kernel decided the most of
 
@@ -204,11 +200,11 @@ 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.
 
 ## Read
 
@@ -216,4 +212,4 @@ because no test was written that would seal them.
 
 ---
 
-*17 claims, all verified · 629 Lean theorems · 2577 ledger entries · trial root `b272f281-1f13-861a-bfdb-4c2e8af05483` · integrity, not truth · 0/7*
+*15 claims, all verified · 629 Lean theorems · 2577 ledger entries · trial root `435e524f-79b8-89d9-8ecf-3dc77ac38ae8` · integrity, not truth*

package/organism.md

@@ -18,7 +18,7 @@ index because the statement computes false, like the non-units of ℤ/9). Nothin
 
 Each organ is reachable by content-address through the uuidna surface — the `/theorem/<key>` pages here, and
 the same keys via the [live examples](/examples), the [verifier](/verify), and the package API. A
-content-address proves **integrity, not truth**. `0/7`.
+content-address proves **integrity, not truth**.
 
 <Organism />
 

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "@ceccec/millennium-solutions",
-  "version": "9.1.4",
-  "description": "Verifiable, recomputable ℤ/9 vortex framework in ONE package — content-addressing, audit ledger, exact arithmetic (0/7), and the honesty toolkit. Facts only.",
+  "version": "9.1.7",
+  "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",
     "email": "ceccec@psg.bg",
@@ -31,7 +31,7 @@
     "docs:preview": "vitepress preview",
     "seal": "node scripts/seal.ts",
     "typecheck": "tsc --noEmit",
-    "release": "node scripts/release-snapshot.ts && tsc --noEmit && node scripts/lean.ts && node scripts/translate-gate.ts && node scripts/lean-agree.ts && node scripts/hardcode-gate.ts && node scripts/one-author-gate.ts && node scripts/orphan-gate.ts && node scripts/attribution-gate.ts && node scripts/parallel-seal.ts && node scripts/retire-lexical.ts && node scripts/lean-gen.ts --emit && node scripts/seal-lean.ts && node scripts/imagine.ts && node scripts/analytics.ts && node scripts/pages.ts && node scripts/gaps.ts && node scripts/dashboard.ts && node scripts/boundaries.ts && node scripts/rights.ts && node scripts/challenges.ts && node scripts/heart.ts && node scripts/accounting.ts && node scripts/forensic-audit.ts && node scripts/speedup.ts && npm run docs:build && node scripts/gates-fire.ts && node scripts/import-gate.ts && node scripts/locale-fold.ts && node scripts/security-gate.ts && node scripts/seo.ts && node scripts/sitemap-mesh.ts && node scripts/theorem-pages-gate.ts && node scripts/receipt-audit.ts && node scripts/forensics.ts && node scripts/claims-gate.ts && node scripts/harmony-currency.ts && node scripts/gate-corpus.ts && node scripts/seal.ts && node scripts/readme.ts && node scripts/trial.ts && node scripts/verify.ts && node scripts/trial-all.ts && node scripts/wholeness.ts && node scripts/lean-claims.ts && node scripts/discover.ts && node scripts/release.ts && node scripts/dashboard.ts && node scripts/accounting.ts && node scripts/deployed.ts",
+    "release": "node scripts/release-snapshot.ts && tsc --noEmit && node scripts/lean.ts && node scripts/translate-gate.ts && node scripts/lean-agree.ts && node scripts/hardcode-gate.ts && node scripts/one-author-gate.ts && node scripts/orphan-gate.ts && node scripts/attribution-gate.ts && node scripts/parallel-seal.ts && node scripts/retire-lexical.ts && node scripts/lean-gen.ts --emit && node scripts/seal-lean.ts && node scripts/imagine.ts && node scripts/analytics.ts && node scripts/pages.ts && node scripts/gaps.ts && node scripts/dashboard.ts && node scripts/boundaries.ts && node scripts/rights.ts && node scripts/challenges.ts && node scripts/heart.ts && node scripts/accounting.ts && node scripts/forensic-audit.ts && node scripts/speedup.ts && npm run docs:build && node scripts/gates-fire.ts && node scripts/import-gate.ts && node scripts/locale-fold.ts && node scripts/security-gate.ts && node scripts/seo.ts && node scripts/sitemap-mesh.ts && node scripts/theorem-pages-gate.ts && node scripts/receipt-audit.ts && node scripts/forensics.ts && node scripts/claims-gate.ts && node scripts/harmony-currency.ts && node scripts/gate-corpus.ts && node scripts/seal.ts && node scripts/readme.ts && node scripts/verify.ts && node scripts/trial-all.ts && node scripts/wholeness.ts && node scripts/lean-claims.ts && node scripts/discover.ts && node scripts/release.ts && node scripts/dashboard.ts && node scripts/accounting.ts && node scripts/deployed.ts",
     "prepublishOnly": "node scripts/seal.ts",
     "gaps": "node scripts/gaps.ts",
     "harmony": "node scripts/gaps.ts && node scripts/seal.ts && node scripts/wholeness.ts && npm run docs:build && node scripts/seo.ts",
@@ -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",