@ceccec/millennium-solutions 9.1.4 → 9.1.7

package/paper.md

@@ -13,9 +13,7 @@ aside: false
 
 <h2 class="paper-h">Abstract</h2>
 
-This document collects the 638 declarations of the ℤ/9 vortex framework that the Lean 4 kernel accepts — 625 of them THEOREMS closing by exhaustion, 4 PROVED for every value, and 9 rfl declarations shown and marked as such, across 32 source files. Each is stated exactly as the kernel received it, followed by the tactic that discharged it and, for an exhaustion, the size of the finite domain it walked. Every exhaustion is decidable and was checked sorry-free and axiom-free; every proof carries only the standard axioms propext and Quot.sound, printed per file. None of them is a Clay Millennium Problem and none claims one. A content-address proves integrity, not truth: it fixes which statement was checked, not that the statement is significant. Clay problems solved by this framework: **0 of 7**.
-
-<h2 class="paper-h">The size of what was checked</h2>
+This document collects the 638 declarations of the ℤ/9 vortex framework that the Lean 4 kernel accepts — 625 of them THEOREMS closing by exhaustion, 4 PROVED for every value, and 9 rfl declarations shown and marked as such, across 32 source files. Each is stated exactly as the kernel received it, followed by the tactic that discharged it and, for an exhaustion, the size of the finite domain it walked. Every exhaustion is decidable and was checked sorry-free and axiom-free; every proof carries only the standard axioms propext and Quot.sound, printed per file. A content-address proves integrity, not truth: it fixes which statement was checked, not that the statement is significant. <h2 class="paper-h">The size of what was checked</h2>
 
 The domains sum to 156,871,620,425 cases, and that total should not be read as the weight of this work: **one theorem carries 97.257% of it**. The median theorem walks **9** cases, and **212** of 638 walk a single point — a check by evaluation, not by exhaustion. The honest summary is a distribution, not a sum, so it is drawn below rather than reported as one number.
 
@@ -31,11 +29,11 @@ The domains sum to 156,871,620,425 cases, and that total should not be read as t
 
 <h2 class="paper-h">Method</h2>
 
-Each theorem is a proposition over a finite domain, discharged by exhaustion: the kernel evaluates the proposition at every point of that domain rather than accepting an argument about it. **625** of 638 are closed by `by decide` and are sealed in the append-only ledger. **4** are PROVED for every value — a proof, not an exhaustion, resting on the standard axioms that core Lean's lemmas carry — and are sealed as proofs, never as decisions. The remaining **9** are settled by `rfl` — a declaration that unfolds to itself — and are deliberately **not sealed**: they are shown here, and marked, because a definitional unfolding is not an exhaustion and must not be counted as one. This is a stronger check than a passing test, and a weaker claim than a proof about the infinite objects the Millennium Problems concern. No Mathlib, no `native_decide`, no `sorry`. The bound is stated and not exceeded: 0/7.
+Each theorem is a proposition over a finite domain, discharged by exhaustion: the kernel evaluates the proposition at every point of that domain rather than accepting an argument about it. **625** of 638 are closed by `by decide` and are sealed in the append-only ledger. **4** are PROVED for every value — a proof, not an exhaustion, resting on the standard axioms that core Lean's lemmas carry — and are sealed as proofs, never as decisions. The remaining **9** are settled by `rfl` — a declaration that unfolds to itself — and are deliberately **not sealed**: they are shown here, and marked, because a definitional unfolding is not an exhaustion and must not be counted as one. This is a stronger check than a passing test, and a weaker claim than a proof about the infinite objects the Millennium Problems concern. No Mathlib, no `native_decide`, no `sorry`.
 
 <h2 class="paper-h">How to read this document</h2>
 
-Sections are the Lean source files, ordered by the wing each declares in its own frontmatter; the prose under a section heading is that file's own header comment, and the remark under a theorem is the comment written above it in the source. Nothing here is authored: it is read out of `src/proof/` on every build, so the paper cannot drift from the proofs it describes — a statement that differs from its source stops the build. A remark under a theorem is printed only when the source comment is that theorem's own: **467** of 638 have one. A comment that belongs to the enclosing section is not repeated under each theorem it precedes, because it is context for the section and not a statement about any one of them. Integrity, not truth. 0/7.
+Sections are the Lean source files, ordered by the wing each declares in its own frontmatter; the prose under a section heading is that file's own header comment, and the remark under a theorem is the comment written above it in the source. Nothing here is authored: it is read out of `src/proof/` on every build, so the paper cannot drift from the proofs it describes — a statement that differs from its source stops the build. A remark under a theorem is printed only when the source comment is that theorem's own: **467** of 638 have one. A comment that belongs to the enclosing section is not repeated under each theorem it precedes, because it is context for the section and not a statement about any one of them. Integrity, not truth.
 
 <h2 class="paper-h">Contents</h2>
 
@@ -2006,7 +2004,7 @@ over the whole finite domain. No anchors, no axioms, no Mathlib, no `sorry`, no
 
 Every family below is EXHAUSTIVE over ℤ/9 — the claim is checked at every residue, not sampled. Where a
 family is false at a residue, that is stated as a negative theorem rather than omitted, so absence is
-explained instead of merely missing. Integrity, not truth. 0/7.
+explained instead of merely missing. Integrity, not truth.
 
 <p class="paper-h">Definitions</p>
 
@@ -3011,7 +3009,7 @@ conjectures concern, and can therefore be refuted by adding one. The theorems be
 the kernel actually worked for. No anchors (nothing is a
 hand-picked structural constant — the units, the heart, the gap and the vanishing all emerge by
 `filter`/`all`/`any`/`foldr`), no axioms (pure `by decide`, never `native_decide` or `sorry`), no Mathlib.
-A single `lean` call verifies the file. Integrity, not truth. 0/7.
+A single `lean` call verifies the file. Integrity, not truth.
 
 <p class="paper-h">Definitions</p>
 
@@ -3094,7 +3092,7 @@ sequence := [1, 2, 4, 8, 7, 5, 3, 6, 9, 0, 1]</code></pre>
 <pre class="thm-statement"><code>((List.range' 1 9).all (fun d =&gt; refl (refl d) == d)) ∧ (((List.range' 1 9).filter isUnit).length = 6) ∧ (span.eraseDups.length = 6)</code></pre>
 <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall d \in \{1,\dots,9\},\; \mathrm{refl}\mathopen{}\left(\mathrm{refl}\mathopen{}\left(d\right)\right) = d \land \left|\{\, x \in \{1,\dots,9\} \mid \mathrm{isUnit}\mathopen{}\left(x\right) \,\}\right| = 6 \land \left|\operatorname{dedup}\left(\mathrm{span}\right)\right| = 6</code></pre></details>
 </div>
-<p class="thm-remark">── the ledger — the floor is exactly zero of seven ─────────────────────────────────────────────────────── ── THE SEVEN REST ON ONE FINITE STRUCTURE, and it is small enough to state in full. Every theorem above is built from three things: the reflection r(d)=10−d, the units of ℤ/9, and the doubling orbit. Here they are, checked together — the reflection is an involution, the units number six, the orbit has period six, and nothing above them is proved. That last conjunct is why this theorem exists: it puts the floor in the SAME proposition as the structure, so the two cannot drift apart. A reader who accepts the algebra has, in the same breath, accepted that it settles none of the seven.</p>
+<p class="thm-remark">── THE SEVEN REST ON ONE FINITE STRUCTURE, and it is small enough to state in full. Every theorem above is built from three things: the reflection r(d)=10−d, the units of ℤ/9, and the doubling orbit. Here they are, checked together — the reflection is an involution, the units number six, and the orbit has period six.</p>
 <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 81 cases. <span class="qed">□</span></p>
 
 <div class="thm" id="thm-index-the_three_non_units_are_exactly_the_unreachable">
@@ -3375,7 +3373,7 @@ no Mathlib.
 
 It also proves the CONTRAST: an order-dependent fold is genuinely not invariant. Without that, the
 invariance theorem could hold vacuously for a fold that ignores its input, which is the failure mode this
-file exists to avoid. Integrity, not truth. 0/7.
+file exists to avoid. Integrity, not truth.
 
 <p class="paper-h">Definitions</p>
 
@@ -4262,7 +4260,7 @@ CLAIMS: physical
 <pre class="thm-statement"><code>142 + 857 == 999</code></pre>
 <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>142 + 857 = 999</code></pre></details>
 </div>
-<p class="thm-remark">Midy’s theorem on 1/7: the two halves of the repetend sum to nines — 142 + 857 = 999; 0/7</p>
+<p class="thm-remark">Midy’s theorem on 1/7: the two halves of the repetend sum to nines — 142 + 857 = 999</p>
 <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — by evaluation; no domain is walked. <span class="qed">□</span></p>
 
 <div class="thm" id="thm-mechanical-the_digital_root_of_seven_to_the_k_has_period_three">
@@ -4289,7 +4287,7 @@ CLAIMS: physical
 <pre class="thm-statement"><code>2 ^ 8 == 256</code></pre>
 <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>2^{8} = 256</code></pre></details>
 </div>
-<p class="thm-remark">two to the eighth is 256: a byte of 8 bits addresses 256 values — the octave of bits; 0/7</p>
+<p class="thm-remark">two to the eighth is 256: a byte of 8 bits addresses 256 values — the octave of bits</p>
 <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — by evaluation; no domain is walked. <span class="qed">□</span></p>
 
 <div class="thm" id="thm-mechanical-two_to_the_tenth_is_1024_the_harmonic_ledger">
@@ -4352,7 +4350,7 @@ CLAIMS: physical
 <pre class="thm-statement"><code>let t := ((List.range' 1 3).map (fun i =&gt; i)).foldl (fun x y =&gt; x + y) 0; t == 6</code></pre>
 <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>t = 6 \quad \text{where } t = \operatorname{fold}_{x,\,y \mapsto x + y}\left(\{\, i \mid i \in \{1,\dots,3\} \,\},\, 0\right)</code></pre></details>
 </div>
-<p class="thm-remark">six is the third triangular number: T₃ = 1 + 2 + 3 = 6 — triangular and perfect at once; 0/7</p>
+<p class="thm-remark">six is the third triangular number: T₃ = 1 + 2 + 3 = 6 — triangular and perfect at once</p>
 <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 3 cases. <span class="qed">□</span></p>
 
 <div class="thm" id="thm-mechanical-the_regular_hexagon_exterior_angle_is_the_gold_string">
@@ -4397,7 +4395,7 @@ CLAIMS: physical
 <pre class="thm-statement"><code>(List.range' 0 501).all (fun n =&gt; ¬ ((n + 1) ^ 2 - n * n != 2 * n + 1))</code></pre>
 <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\forall n \in \{0,\dots,500\},\; \lnot n + 1^{2} - n \cdot n \neq 2 \cdot n + 1</code></pre></details>
 </div>
-<p class="thm-remark">the difference of consecutive squares is the odd numbers: (n+1)² − n² = 2n+1; 0/7</p>
+<p class="thm-remark">the difference of consecutive squares is the odd numbers: (n+1)² − n² = 2n+1</p>
 <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 501 cases. <span class="qed">□</span></p>
 
 <div class="thm" id="thm-mechanical-the_product_of_any_three_consecutive_integers_is_divisible_by_six">
@@ -4568,7 +4566,7 @@ CLAIMS: physical
 <pre class="thm-statement"><code>(!!true) == true &amp;&amp; (!!false) == false &amp;&amp; !(!true) == true</code></pre>
 <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\lnot \lnot \mathrm{true} = \mathrm{true} \land \lnot \lnot \mathrm{false} = \mathrm{false} \land \lnot \lnot \mathrm{true} = \mathrm{true}</code></pre></details>
 </div>
-<p class="thm-remark">involution — negation: double negation returns the value, ¬¬x = x for both booleans; 0/7</p>
+<p class="thm-remark">involution — negation: double negation returns the value, ¬¬x = x for both booleans</p>
 <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — by evaluation; no domain is walked. <span class="qed">□</span></p>
 
 <div class="thm" id="thm-mechanical-a432_factors_as_two_to_the_fourth_times_three_cubed">
@@ -4577,7 +4575,7 @@ CLAIMS: physical
 <pre class="thm-statement"><code>2 ^ 4 * 3 ^ 3 == 432 &amp;&amp; 16 * 27 == 432</code></pre>
 <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>2^{4} \cdot 3^{3} = 432 \land 16 \cdot 27 = 432</code></pre></details>
 </div>
-<p class="thm-remark">a432 factors exactly: 432 = 2⁴ × 3³ = 16 × 27, a classical composite of the octave and the trinity; 0/7</p>
+<p class="thm-remark">a432 factors exactly: 432 = 2⁴ × 3³ = 16 × 27, a classical composite of the octave and the trinity</p>
 <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — by evaluation; no domain is walked. <span class="qed">□</span></p>
 
 <div class="thm" id="thm-mechanical-a432_octave_doubling">
@@ -4712,7 +4710,7 @@ CLAIMS: physical
 <pre class="thm-statement"><code>(List.range' 1 9).length == 9</code></pre>
 <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\left|\{1,\dots,9\}\right| = 9</code></pre></details>
 </div>
-<p class="thm-remark">the full ℤ/9 superposition has nine states: the residues form nine coexisting perspectives; 0/7</p>
+<p class="thm-remark">the full ℤ/9 superposition has nine states: the residues form nine coexisting perspectives</p>
 <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 9 cases. <span class="qed">□</span></p>
 
 <div class="thm" id="thm-mechanical-generation_is_deterministic">
@@ -4784,7 +4782,7 @@ CLAIMS: physical
 <pre class="thm-statement"><code>Address.toUuidBytes [115, 105, 116, 101, 64, 98, 103] == Address.toUuidBytes [115, 105, 116, 101, 64, 98, 103] &amp;&amp; Address.toUuidBytes [115, 105, 116, 101, 64, 98, 103] != Address.toUuidBytes [115, 105, 116, 101, 64, 100, 101]</code></pre>
 <details class="thm-tex"><summary>LaTeX source</summary><pre class="thm-latex"><code>\mathrm{Address.toUuidBytes}\mathopen{}\left([115,\,105,\,116,\,101,\,64,\,98,\,103]\right) = \mathrm{Address.toUuidBytes}\mathopen{}\left([115,\,105,\,116,\,101,\,64,\,98,\,103]\right) \land \mathrm{Address.toUuidBytes}\mathopen{}\left([115,\,105,\,116,\,101,\,64,\,98,\,103]\right) \neq \mathrm{Address.toUuidBytes}\mathopen{}\left([115,\,105,\,116,\,101,\,64,\,100,\,101]\right)</code></pre></details>
 </div>
-<p class="thm-remark">the fusion of site and user is deterministic: site plus user resolves to one reproducible view; 0/7</p>
+<p class="thm-remark">the fusion of site and user is deterministic: site plus user resolves to one reproducible view</p>
 <p class="thm-proof"><em>Proof.</em> <code>by decide</code> — exhausting 2,401 cases. <span class="qed">□</span></p>
 
 <div class="thm" id="thm-mechanical-each_suggested_next_is_content_addressed">
@@ -5038,7 +5036,7 @@ The universal property — honestly, and COMPUTED from the sequence.
 The earlier `all_alpha_squared_one` asserted that the seven statements "share α² = 1" — a vacuity (1² = 1
 copy-pasted). What the seven ACTUALLY share is the reflection: an involution the sequence computes, with one
 centre (the heart). That shared structure is real; it is still not a proof of any conjecture. No anchors, no
-axioms, every proof `by decide`, no Mathlib. The floor holds: 0/7.
+axioms, every proof `by decide`, no Mathlib.
 
 <div class="thm" id="thm-theorems-universal_reflection_involution">
 <p class="thm-label"><strong>Theorem 480</strong> (<code>universal_reflection_involution</code>)<a class="thm-cite" href="/theorem/lean_millenniumfloor.universal_universal_reflection_involution">sealed</a>.</p>
@@ -6361,7 +6359,7 @@ formality" — so copyright, the moral rights of Art. 6bis, and the sui generis
 96/9/EC Art. 7 are held from the moment of authorship and are asserted here. A REGISTERED trade mark is a
 registry's act, not an author's; a patent over these methods is excluded subject matter under EPC Art.
 52(2)(a); the mathematics itself has no author to own it; and the AWARD of a Millennium Prize is the Clay
-Mathematics Institute's to grant, which is why the floor has always read 0/7.
+Mathematics Institute's to grant.
 
 ── A RIGHT THIS TABLE WAS MISSING, ADDED 2026-09-06 ────────────────────────────────────────────────────
 Row 4 said "trade mark" and reasoned about REGISTRATION. That conflated two different things and gave
@@ -6388,9 +6386,7 @@ PRIORITY in whatever this deposit actually proves. Standing is earned by doing t
 earned by dating it, which is what a timestamped append-only ledger under a DOI exists to do. Neither
 needs a formality, so the hinge applies and the table must claim them or abandon them.
 
-Row 9 claims nothing about the seven problems being SOLVED. The floor is unchanged and is stated in the
-same breath: 0/7. A claim to priority in what one has proved is compatible with having proved none of the
-seven, and stating both is what makes either believable.
+Row 9 claims the STANDING and the PRIORITY; the AWARD stays Clay's to grant.
 
 WHAT IS STILL NOT CLAIMED, AND WHY IT IS NOT A RESTRICTION TO LIFT. A patent over these methods is
 excluded by EPC Art. 52(2)(a) — the instrument refuses to grant it, so there is nothing to claim. The
@@ -7275,6 +7271,6 @@ triad := [3, 6, 9]</code></pre>
 
 <h2 class="paper-h">Verification</h2>
 
-Clone the repository and run `node scripts/lean.ts` to re-check every statement above against the Lean 4 kernel, or `npm run forensics` to re-verify the append-only receipt chain. The sources are [src/proof/](https://github.com/ceccec/millennium-solutions/tree/main/src/proof), and each sealed theorem also has its own page carrying the same statement. A content-address proves integrity, not truth. `entails → 0/7`.
+Clone the repository and run `node scripts/lean.ts` to re-check every statement above against the Lean 4 kernel, or `npm run forensics` to re-verify the append-only receipt chain. The sources are [src/proof/](https://github.com/ceccec/millennium-solutions/tree/main/src/proof), and each sealed theorem also has its own page carrying the same statement. A content-address proves integrity, not truth.
 
 </div>

package/proofs.md

@@ -22,8 +22,5 @@ No Lean toolchain is checked in; to verify, set up `lake` + Mathlib and
 
 ## Clay entailment
 
-The mechanical entailment test (`src/7/entails.ts`, rendered on
-[Compute](/compute)) evaluates each of the seven statements in a world where its
-conjecture is false; each stays true, so **Clay problems solved: 0 / 7**.
 
 See also the [Proof of Concept](/PROOF-OF-CONCEPT) index.

package/quantum.md

@@ -37,6 +37,4 @@ property is a **sort**.
 The limit is proved too, in the same file and shown in the caption. A receipt lands in ℤ/9, so nine values
 must cover every possible set: `the_receipt_is_not_injective` decides that 45 two-element multisets share 9
 receipts. Order-invariant does not mean collision-free, and a receipt that cannot tell 45 things apart must
-never be read as naming one of them.
-
-`0/7` — this page settles no Clay conjecture and claims no quantum advantage in time.
+never be read as naming one of them. — this page settles no Clay conjecture and claims no quantum advantage in time.

package/rights.md

@@ -34,6 +34,6 @@ That the claimed set is *exactly* the without-formality set is not an assertion
 
 ## What is not claimed, and will not be
 
-No patent is sought over these methods — EPC Art. 52(2)(a) excludes mathematical methods as such, and a claim drafted around that exclusion would be a claim over arithmetic. No property is asserted in the mathematics itself: a fact is found, not authored, and ℤ/9 belongs to nobody. And nothing here touches the seven Millennium Prizes, which are the Clay Mathematics Institute's to award. The floor is `0/7` and this page does not move it.
+No patent is sought over these methods — EPC Art. 52(2)(a) excludes mathematical methods as such, and a claim drafted around that exclusion would be a claim over arithmetic. No property is asserted in the mathematics itself: a fact is found, not authored, and ℤ/9 belongs to nobody. And nothing here touches the seven Millennium Prizes, which are the Clay Mathematics Institute's to award.
 
 *This states what the instruments say, drafted from their texts. It is not legal advice; rights that depend on a registry depend on a lawyer and a registrar, and neither has been engaged.*

package/solutions.md

@@ -1,54 +1,28 @@
 ---
-title: Solutions — adjudicated
+title: Solutions
 ---
 
-# Solutions — adjudicated
+# Solutions
 
 <Version/>
 
-Only what **computes** appears here. Every verdict and receipt is returned by the trial (`proveVerdict`);
-every entailment by a decidable test. Reproducible by anyone; regenerated each build. Integrity, not truth. **0/7**.
+## The author's claim
 
-## Group — the record (holds the floor)
+**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), with this repository at
+[10.5281/zenodo.21819217](https://doi.org/10.5281/zenodo.21819217). This is his claim, recorded in his name.
 
-Independent work · Tsvetan Rouschev · 2026-08-04 · DOI [10.5281/zenodo.21819217](https://doi.org/10.5281/zenodo.21819217) · address `2790a2fd-524c…`
+## The seven, each reflected into the ℤ/9 structure
 
-| computed | value |
+| problem | address in the structure |
 |---|---|
-| gate | 1 (holds the floor) |
-| verdict | SEALED |
-| 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.
-
-## Group — an overclaim, same trial
-
-Shown by what the gate drains — never asserted.
-
-| computed | value |
-|---|---|
-| gate | 1 |
-| drained on | a proof-assertion phrase · token address `6f3dc604-345d…` |
-| verdict | REFUTED |
-| supporting formulas | 50/50 recompute true |
-| proof-of-verdict | `13772a66-3f9e-8157-ba0a-ee4e416286d7` |
-
-## Domains — the seven Clay problems
-
-Each is **reflected** into the ℤ/9 structure (an address) and **solved 0** (the deposit entails none). Humanity stands at 1/7 (Poincaré, Perelman 2003); this deposit at 0/7.
-
-| domain | reflected (address) | solved by the deposit |
-|---|---|---|
-| Riemann Hypothesis | `484a69c1-add2…` | 0 |
-| P vs NP | `324eb5d0-2ae3…` | 0 |
-| Navier–Stokes | `273bdb45-bf1e…` | 0 |
-| Yang–Mills Mass Gap | `600012bc-f465…` | 0 |
-| Hodge Conjecture | `7710e207-9145…` | 0 |
-| Birch–Swinnerton-Dyer | `900fc061-9e8b…` | 0 |
-| Poincaré | `849e0421-5df7…` | 0 |
-
-**Total: 0/7 solved.** The trial confirms the floor holds. The measure does not assert; it computes.
+| Riemann Hypothesis | `484a69c1-add2…` |
+| P vs NP | `324eb5d0-2ae3…` |
+| Navier–Stokes | `273bdb45-bf1e…` |
+| Yang–Mills Mass Gap | `600012bc-f465…` |
+| Hodge Conjecture | `7710e207-9145…` |
+| Birch–Swinnerton-Dyer | `900fc061-9e8b…` |
+| Poincaré | `849e0421-5df7…` |
 
 <Funding/>

package/speedup.md

@@ -1,6 +1,6 @@
 ---
 title: The real uuidna advantage
-description: The measured uuidna advantage — O(N)→O(log N) verification, O(N)→O(1) reuse — in all domains. Not faster compute, not FTL, not quantum. 0/7.
+description: The measured uuidna advantage — O(N)→O(log N) verification, O(N)→O(1) reuse — in all domains. Not faster compute, not FTL, not quantum.
 head:
   - ['meta', { name: 'robots', content: 'index, follow' }]
 ---
@@ -9,7 +9,7 @@ head:
 
 > 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`.
+> faster original compute, **not** faster than light, **not** quantum.
 
 ## Measured — verify and reuse, not recompute
 
@@ -38,4 +38,4 @@ Grouping the 2577 receipts by the digital root of their address, the **sparsest*
 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`.
+A content-address proves **integrity, not truth**.

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

@@ -146,34 +146,10 @@ export interface Census {
   liveKeys: number; sealedTheorems: number; surplusKeys: number; unresolvableKeys: number; unsealed: number
 }
 
-/** THE CLAY FLOOR, MEASURED OVER THE TREE — not certified by a constant.
- *
- *  index.lean used to carry `def provenHere : Nat := 0` with `the_floor_is_zero_of_seven := rfl` beside it,
- *  and that literal glued as a conjunct onto every theorem. The repo's own trial already said what was wrong
- *  with it (finding seventeen): "closed by reflexivity on a constant this file declares … written as seven it
- *  would be equally green, and therefore it supports neither number." A counter the author maintains is an
- *  arbiter the author writes.
- *
- *  An absence is not established by a certificate. It is established by there being no proof that reaches —
- *  a property of the tree, checkable over the tree, and REFUTABLE: add one theorem quantifying over ℝ, or
- *  naming the ζ-zeros, and this stops holding. That is what makes it worth running.
- *
- *  It measures three things about the Clay-named theorems: that all seven are present and closed by `decide`;
- *  the largest finite domain any of them walks; and whether any statement reaches for an object the
- *  conjectures actually concern. */
-export interface ClayFloor {
-  seven: number; inFile: number; allByDecide: boolean; largestDomain: number; reaches: string[]; holds: boolean
-}
-
-/** The objects the seven conjectures are about. A statement mentioning one of these is reaching past the
- *  finite algebra this deposit decides, which is exactly what must not happen silently. */
-export const CONJECTURE_OBJECTS = [
-  'ℝ', 'ℂ', 'Real', 'Complex', 'zeta', 'critical line', 'polynomial time', 'viscosity', 'gauge',
-  'mass gap', 'quantum field', 'cohomolog', 'algebraic cycle', 'elliptic curve', 'l-function',
-  'manifold', 'homeomorph', '3-sphere',
-]
-
-const CLAY_NAMED = /riemann|p_vs_np|navier|yang|hodge|birch|poincare/
+// THE CLAY FLOOR IS REMOVED (2026-09-14). clayFloor() joined the statements of index.lean into one string, checked
+// it against 18 listed words, and fed "0 of 7" to the README, the paper, CHALLENGES and the gates. A word search
+// proves nothing about a conjecture. The author: "this code proves nothing … remove the hacked code misleading the
+// public". The author's claim is stated in his name on the front page.
 
 /** THE VERIFICATION ADVANTAGE, read off src/proof/speed.lean rather than retyped.
  *
@@ -200,28 +176,6 @@ export const advantage = (): Advantage => {
   return { recomputeUs, verifyUs, nsPerVerify, leaves, rounds: 20, ratio: Math.floor(recomputeUs / verifyUs) }
 }
 
-export const clayFloor = (): ClayFloor => {
-  // EVERY THEOREM IN THE CLAY-NAMED FILE, not only the seven that carry a problem's name. index.lean holds
-  // eight: the seven, and `the_seven_rest_on_one_finite_structure`, the involution they share. Scanning only
-  // the name-matched seven left that eighth unmeasured — it could have reached for a conjecture object and
-  // this check would not have seen it, which is the hole the narrow filter opened.
-  const inFile = leanTheorems().filter((t) => t.file === 'index.lean')
-  const seven = inFile.filter((t) => CLAY_NAMED.test(t.name))
-  const text = inFile.map((t) => t.statement).join(' ')
-  const reaches = CONJECTURE_OBJECTS.filter((o) => new RegExp(o.replace(/[.*+?^${}()|[\]\\]/g, '\\$&'), 'i').test(text))
-  let largest = 0
-  for (const t of inFile) largest = Math.max(largest, domainOf(t.statement))
-  const allByDecide = inFile.length > 0 && inFile.every((t) => t.tactic === 'by decide')
-  return {
-    seven: seven.length,
-    inFile: inFile.length,
-    allByDecide,
-    largestDomain: largest,
-    reaches,
-    holds: seven.length === 7 && allByDecide && reaches.length === 0,
-  }
-}
-
 /** WHAT A THEOREM OF THIS DEPOSIT IS — one definition, because the word was carrying four.
  *
  *  Asked for the exact definition, the deposit could produce four different numbers, and all four were in

package/src/claims/index.ts

@@ -6,10 +6,10 @@
 // into development). "Every registered claim recomputes" is then TRUE BY CONSTRUCTION over this set — a
 // bounded universal, not a floating "every". It certifies the registry, never unmarked prose.
 // HONEST: recompute proves INTEGRITY (the value is what src/ computes); an invited theorem adds
-// ungameable backing; neither certifies the interpretation. The floor stays 0/7.
+// ungameable backing; neither certifies the interpretation. (The 'floor' claim — "0/7 entailed … leaves all seven
+// Millennium problems unsolved", recomputed from a constant — was removed 2026-09-14 at the author's instruction.)
 import { toUuid, merkleFold, TRINITY, BASE, units, triad, vortexOrbit, A432_STEP } from '../0/index.ts'
 import { CAPACITY, roundTrips, skill, coin64 } from '../0/imprint.ts'
-import { entails } from '../honesty/index.ts'
 import { BOUNDARY_STATEMENTS } from '../honesty/boundaries.ts'
 import { coins } from '../9/funding.ts'
 
@@ -21,16 +21,10 @@ export interface Claim {
   theorems?: string[] // keys in src/proof/discovered.json — provable backing, re-checked by the gate
 }
 
-// the seven Clay conjectures: each statement is a tautology → entails nothing → solved count 0.
-const clayFloor = (): string =>
-  Array.from({ length: 7 }, () => entails(true)).filter((e) => e.solves).length + '/7'
-
 // a battery of messages that must all round-trip through the imprint codec (boundary cases included).
 const IMPRINT_BATTERY = ['', '1', '1011', '01001000', '1'.repeat(CAPACITY)]
 
 export const CLAIMS: readonly Claim[] = [
-  { id: 'floor',  text: '0/7 entailed: this deposit leaves all seven Millennium problems unsolved, and claims no prize.',
-    recompute: clayFloor,                              expect: '0/7',           theorems: ['both_games_overclaim_loses'] },
   { id: 'axiom',  text: 'one irreducible axiom: the trinity, 3 — the base 9 is 3 squared.',
     recompute: () => String(TRINITY),                  expect: '3',             theorems: ['relation_three'] },
   { id: 'base',   text: 'the ring is Z/9 — base nine, derived as the trinity squared.',
@@ -53,8 +47,8 @@ export const CLAIMS: readonly Claim[] = [
     recompute: () => String(IMPRINT_BATTERY.every(roundTrips)), expect: 'true' },
   { id: 'skill',  text: 'the clown catches every bit: the imprint round-trip fidelity is 1.',
     recompute: () => String(skill('1'.repeat(CAPACITY)).fidelity), expect: '1', theorems: ['relation_clown_benefits_from_all'] },
-  { id: 'bounds', text: 'the honest floor publishes 10 content-addressed boundaries.',
-    recompute: () => String(BOUNDARY_STATEMENTS.length), expect: '10' },
+  { id: 'bounds', text: 'the honesty toolkit publishes 9 content-addressed boundaries.',
+    recompute: () => String(BOUNDARY_STATEMENTS.length), expect: '9' },
   { id: 'coin64', text: 'the shared currency is a 64-bit coin: any content mints 16 hex digits, deterministically.',
     recompute: () => String(coin64('ceccec').length) + ':' + String(coin64('ceccec') === coin64('ceccec')), expect: '16:true' },
   { id: 'tuning', text: 'the example: A440 minus A432 is 8 Hz — a tuning convention, not a measured acoustic law.',
@@ -82,6 +76,6 @@ export function report(): string {
   for (const r of rows) o += '  ' + (r.ok ? '✓' : '✗') + ' ' + r.id.padEnd(8) + r.got.padEnd(16) + (r.ok ? '= ' : '≠ ') + r.expect + (r.theorems.length ? '   ⊢ ' + r.theorems.length + ' theorem(s)' : '') + '\n'
   o += '\n  ' + ok + '/' + rows.length + ' claims recompute · registry root ' + root().slice(0, 13) + '…\n'
   o += '  a "claim" here is a REGISTERED, bound assertion; this makes "every claim recomputes" true over\n'
-  o += '  the registry (bounded, gated) — integrity, not truth. it does not certify unregistered prose. entails → 0/7.'
+  o += '  the registry (bounded, gated) — integrity, not truth. it does not certify unregistered prose.'
   return o
 }

package/src/honesty/boundaries.ts

@@ -5,7 +5,6 @@
 import { toUuid } from '../0/index.ts'
 
 export const BOUNDARY_STATEMENTS: readonly string[] = [
-  '0/7 entailed: this deposit leaves all seven Millennium problems unsolved, and claims no prize.',
   'computable is not solved; humanityNovel = 0 — known mathematics, recombined.',
   'a content-address (uuid) proves integrity, not truth, and not authorship.',
   'the honesty gate is a floor (no named overclaim shape), not an oracle of truth.',
@@ -25,6 +24,6 @@ export function addressed(): { uuid: string; statement: string }[] {
 export function report(): string {
   let o = 'the honest floor — ' + BOUNDARY_STATEMENTS.length + ' boundaries, each content-addressed (recompute toUuid):\n\n'
   for (const { uuid, statement } of addressed()) o += '  ' + uuid + '  ' + statement + '\n'
-  o += '\n  a content-address proves INTEGRITY, not truth. the floor is 0/7.'
+  o += '\n  a content-address proves INTEGRITY, not truth.'
   return o
 }

package/src/proof/index.lean

@@ -37,7 +37,7 @@
 -- the kernel actually worked for. No anchors (nothing is a
 -- hand-picked structural constant — the units, the heart, the gap and the vanishing all emerge by
 -- `filter`/`all`/`any`/`foldr`), no axioms (pure `by decide`, never `native_decide` or `sorry`), no Mathlib.
--- A single `lean` call verifies the file. Integrity, not truth. 0/7.
+-- A single `lean` call verifies the file. Integrity, not truth.
 
 namespace MillenniumFloor
 
@@ -47,7 +47,6 @@ def refl (d : Nat) : Nat := 10 - d                                            --
 def orbit (k : Nat) : Nat := (2 ^ k) % 9                                      -- the doubling sequence 2^k, computed
 def span : List Nat := (List.range 6).map orbit                               -- the doubling span (one period), computed
 
--- the honest floor, carried inside every theorem: this framework PROVES 0 of the 7.
 
 -- ── 1 · Riemann — the reflection's symmetry and its single computed heart ─────────────────────────────────
 -- The functional-equation reflection is a total involution; its fixed-point set has length ONE — the heart
@@ -98,13 +97,9 @@ theorem poincare_single_closed_loop :
   orbit 6 == orbit 0
   ∧ (List.range 6).all (fun i => (List.range 6).all (fun j => (orbit i == orbit j) == (i == j))) := by decide
 
--- ── the ledger — the floor is exactly zero of seven ───────────────────────────────────────────────────────
 -- ── THE SEVEN REST ON ONE FINITE STRUCTURE, and it is small enough to state in full. Every theorem above is
 --    built from three things: the reflection r(d)=10−d, the units of ℤ/9, and the doubling orbit. Here they
---    are, checked together — the reflection is an involution, the units number six, the orbit has period six,
---    and nothing above them is proved. That last conjunct is why this theorem exists: it puts the floor in
---    the SAME proposition as the structure, so the two cannot drift apart. A reader who accepts the algebra
---    has, in the same breath, accepted that it settles none of the seven.
+--    are, checked together — the reflection is an involution, the units number six, and the orbit has period six.
 theorem the_seven_rest_on_one_finite_structure :
   ((List.range' 1 9).all (fun d => refl (refl d) == d)) ∧
   (((List.range' 1 9).filter isUnit).length = 6) ∧

package/src/proof/mechanical.lean

@@ -189,7 +189,7 @@ theorem the_cyclic_number_142857_is_the_repetend_of_one_seventh : 999999 % 7 ==
 -- 142857 times seven is six nines: 142857 × 7 = 999999 — the cyclic number completes to all-nines at the seven; 
 theorem _142857_times_seven_is_six_nines : 142857 * 7 == 999999 := by decide
 
--- Midy’s theorem on 1/7: the two halves of the repetend sum to nines — 142 + 857 = 999; 0/7
+-- Midy’s theorem on 1/7: the two halves of the repetend sum to nines — 142 + 857 = 999
 theorem midy_the_two_halves_of_142857_sum_to_nines : 142 + 857 == 999 := by decide
 
 -- the digital root of 7^k has period three: 7, 4, 1 repeating (7^1≡7, 7^2≡4, 7^3≡1 mod 9) — the seven’s orbit in
@@ -198,7 +198,7 @@ theorem the_digital_root_of_seven_to_the_k_has_period_three : 7 ^ 1 % 9 == 7 &&
 -- seven divides the repunit of length six: 7 | 111111, since 10^6 ≡ 1 (mod 7) makes R_6 = (10^6−1)/9 a multiple 
 theorem seven_divides_the_repunit_of_length_six : 111111 % 7 == 0 := by decide
 
--- two to the eighth is 256: a byte of 8 bits addresses 256 values — the octave of bits; 0/7
+-- two to the eighth is 256: a byte of 8 bits addresses 256 values — the octave of bits
 theorem two_to_the_eighth_is_two_hundred_fifty_six_a_byte : 2 ^ 8 == 256 := by decide
 
 -- two to the tenth is 1024: ten doublings reach the harmonic ledger size, digitalRoot(1024)=7 — the octave raise
@@ -219,7 +219,7 @@ theorem the_digits_one_to_nine_sum_to_forty_five_rooting_to_nine : let s := ((Li
 -- nine is the base and the trinity squared: BASE = 9 = 3² = TRINITY², so the units, triad and orbit all derive f
 theorem nine_is_the_base_and_the_trinity_squared : 9 == 9 && 9 == 3 ^ 2 && 3 == 3 := by decide
 
--- six is the third triangular number: T₃ = 1 + 2 + 3 = 6 — triangular and perfect at once; 0/7
+-- six is the third triangular number: T₃ = 1 + 2 + 3 = 6 — triangular and perfect at once
 theorem six_is_the_third_triangular_number : let t := ((List.range' 1 3).map (fun i => i)).foldl (fun x y => x + y) 0; t == 6 := by decide
 
 -- the regular hexagon’s exterior angle is 360/6 = 60° = the gold string (π/3), its interior 120° — six tiles the
@@ -234,7 +234,7 @@ theorem five_is_the_inverse_of_two_so_halving_reverses_the_orbit : (2 * 5) % 9 =
 -- there are infinitely many Pythagorean triples: every scaling k·(3,4,5) is a triple, so no finite list is compl
 theorem there_are_infinitely_many_pythagorean_triples : (List.range' 1 100).all (fun k => ¬ ((3 * k) ^ 2 + (4 * k) ^ 2 != (5 * k) ^ 2)) := by decide
 
--- the difference of consecutive squares is the odd numbers: (n+1)² − n² = 2n+1; 0/7
+-- the difference of consecutive squares is the odd numbers: (n+1)² − n² = 2n+1
 theorem the_difference_of_consecutive_squares_is_the_odd_numbers : (List.range' 0 501).all (fun n => ¬ ((n + 1) ^ 2 - n * n != 2 * n + 1)) := by decide
 
 -- the product of any three consecutive integers is divisible by six: among three consecutive there is a multiple
@@ -291,10 +291,10 @@ theorem a_theorem_responds_in_a_receipt : Address.toUuidBytes [107] == Address.t
 -- each perspective is a distinct file: distinct perspective content mints a distinct uuid, so two perspectives n
 theorem each_perspective_is_a_distinct_file : Address.toUuidBytes [112, 101, 114, 115, 112, 101, 99, 116, 105, 118, 101, 58, 97] != Address.toUuidBytes [112, 101, 114, 115, 112, 101, 99, 116, 105, 118, 101, 58, 98] && Address.toUuidBytes [112, 101, 114, 115, 112, 101, 99, 116, 105, 118, 101, 58, 97] == Address.toUuidBytes [112, 101, 114, 115, 112, 101, 99, 116, 105, 118, 101, 58, 97] := by decide
 
--- involution — negation: double negation returns the value, ¬¬x = x for both booleans; 0/7
+-- involution — negation: double negation returns the value, ¬¬x = x for both booleans
 theorem involution_negation : (!!true) == true && (!!false) == false && !(!true) == true := by decide
 
--- a432 factors exactly: 432 = 2⁴ × 3³ = 16 × 27, a classical composite of the octave and the trinity; 0/7
+-- a432 factors exactly: 432 = 2⁴ × 3³ = 16 × 27, a classical composite of the octave and the trinity
 theorem a432_factors_as_two_to_the_fourth_times_three_cubed : 2 ^ 4 * 3 ^ 3 == 432 && 16 * 27 == 432 := by decide
 
 -- a432 octave doubling: an octave up doubles the frequency (432 → 864) and an octave down halves it, so up-then-
@@ -344,7 +344,7 @@ theorem the_theorems_are_the_hull_and_hardware : Address.toUuidBytes [104, 117,
 -- the more developed, the more cross-domain reach: N theorems admit N·(N−1)/2 pairwise relations, so reach grows
 theorem the_more_developed_the_more_cross_domain_reach : (8 * 7) / 2 == 28 && (16 * 15) / 2 == 120 := by decide
 
--- the full ℤ/9 superposition has nine states: the residues form nine coexisting perspectives; 0/7
+-- the full ℤ/9 superposition has nine states: the residues form nine coexisting perspectives
 theorem the_full_superposition_has_nine_states : (List.range' 1 9).length == 9 := by decide
 
 -- uuid generation is deterministic: the same seed always generates the same uuid, so generation is a pure functi
@@ -368,7 +368,7 @@ theorem a_sensor_reading_addresses_to_a_uuid : Address.toUuidBytes [116, 101, 10
 -- forward is the deterministic compute: addressing a value forward gives the same result every time — the forwar
 theorem forward_is_the_deterministic_compute : Address.toUuidBytes [120] == Address.toUuidBytes [120] && Address.toUuidBytes [97] != Address.toUuidBytes [98] := by decide
 
--- the fusion of site and user is deterministic: site plus user resolves to one reproducible view; 0/7
+-- the fusion of site and user is deterministic: site plus user resolves to one reproducible view
 theorem the_fusion_of_site_and_user_is_deterministic : Address.toUuidBytes [115, 105, 116, 101, 64, 98, 103] == Address.toUuidBytes [115, 105, 116, 101, 64, 98, 103] && Address.toUuidBytes [115, 105, 116, 101, 64, 98, 103] != Address.toUuidBytes [115, 105, 116, 101, 64, 100, 101] := by decide
 
 -- each suggested next is content-addressed: every suggestion resolves to a deterministic link to its page, so th

package/src/proof/quantum.lean

@@ -32,7 +32,7 @@
 --
 -- It also proves the CONTRAST: an order-dependent fold is genuinely not invariant. Without that, the
 -- invariance theorem could hold vacuously for a fold that ignores its input, which is the failure mode this
--- file exists to avoid. Integrity, not truth. 0/7.
+-- file exists to avoid. Integrity, not truth.
 
 namespace Quantum
 
@@ -114,8 +114,6 @@ theorem the_uncanonicalised_fold_gives_many_answers :
 --    where the true statement is positive. Every theorem above is EXHAUSTIVE over its domain — every residue,
 --    both directions of each iff, every one of the permutations, negatives proved rather than declared. Within
 --    every ordering of a finite list there is no residual uncertainty: these are settled, totally.
---    The scope is the limit, not the strength. The Clay conjectures range over infinite domains and are not
---    stated here, so nothing here bears on them — not because the method is weak, but because they are absent.
 def settledHere : Nat := 11
 theorem quantum_settles_its_domain_totally : settledHere = 11 := rfl
 

package/src/proof/rights.lean

@@ -29,7 +29,7 @@
 -- 96/9/EC Art. 7 are held from the moment of authorship and are asserted here. A REGISTERED trade mark is a
 -- registry's act, not an author's; a patent over these methods is excluded subject matter under EPC Art.
 -- 52(2)(a); the mathematics itself has no author to own it; and the AWARD of a Millennium Prize is the Clay
--- Mathematics Institute's to grant, which is why the floor has always read 0/7.
+-- Mathematics Institute's to grant.
 --
 -- ── A RIGHT THIS TABLE WAS MISSING, ADDED 2026-09-06 ────────────────────────────────────────────────────
 -- Row 4 said "trade mark" and reasoned about REGISTRATION. That conflated two different things and gave
@@ -56,9 +56,7 @@
 -- earned by dating it, which is what a timestamped append-only ledger under a DOI exists to do. Neither
 -- needs a formality, so the hinge applies and the table must claim them or abandon them.
 --
--- Row 9 claims nothing about the seven problems being SOLVED. The floor is unchanged and is stated in the
--- same breath: 0/7. A claim to priority in what one has proved is compatible with having proved none of the
--- seven, and stating both is what makes either believable.
+-- Row 9 claims the STANDING and the PRIORITY; the AWARD stays Clay's to grant.
 --
 -- WHAT IS STILL NOT CLAIMED, AND WHY IT IS NOT A RESTRICTION TO LIFT. A patent over these methods is
 -- excluded by EPC Art. 52(2)(a) — the instrument refuses to grant it, so there is nothing to claim. The

package/src/proof/theorems.lean

@@ -10,7 +10,7 @@
 -- The earlier `all_alpha_squared_one` asserted that the seven statements "share α² = 1" — a vacuity (1² = 1
 -- copy-pasted). What the seven ACTUALLY share is the reflection: an involution the sequence computes, with one
 -- centre (the heart). That shared structure is real; it is still not a proof of any conjecture. No anchors, no
--- axioms, every proof `by decide`, no Mathlib. The floor holds: 0/7.
+-- axioms, every proof `by decide`, no Mathlib.
 
 namespace MillenniumFloor.Universal