@ceccec/millennium-solutions 9.5.4 → 9.5.6

package/README.md

@@ -25,12 +25,12 @@ last because the orbit never reaches it.
 
 ## 1 · What is proved
 
-- The formal layer holds 923 kernel-accepted declarations across 40 files, and no file uses sorry or native_decide outside a comment.
-  <sub>SEALED · `d136d75e-948d-86c1-9116-d94b66038772`</sub>
-- 721 of those 923 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 202 close by rfl and are declarations.
-  <sub>SEALED · `c682dffa-4e83-8cab-953f-828b658e5dce`</sub>
-- 1000 of them are sealed into the ledger, each carrying a receipt derived from the one before it.
-  <sub>SEALED · `987ce998-e136-8038-be04-91fa8ea245f0`</sub>
+- The formal layer holds 939 kernel-accepted declarations across 41 files, and no file uses sorry or native_decide outside a comment.
+  <sub>SEALED · `4fbbee52-f94d-81bf-b745-753df9646f45`</sub>
+- 737 of those 939 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 202 close by rfl and are declarations.
+  <sub>SEALED · `4bf71a4a-3a3d-8da3-8651-60419b72bf34`</sub>
+- 1016 of them are sealed into the ledger, each carrying a receipt derived from the one before it.
+  <sub>SEALED · `c64ac22b-8407-88b4-a93a-2016e24c0b88`</sub>
 
 ## 2 · The ring
 
@@ -53,10 +53,10 @@ last because the orbit never reaches it.
 
 ## 7 · The ledger
 
-- The ledger records 2864 entries with 0 chain breaks, 0 duplicate keys and 0 duplicate receipts.
-  <sub>SEALED · `e8a1c1ff-5e4a-8d95-8ca1-6ad97ab63ffd`</sub>
-- The count is an exact multiple of eight — 2864 is 358 octaves with no remainder.
-  <sub>SEALED · `dacf8277-84f8-8c4c-987a-621742de0541`</sub>
+- The ledger records 2880 entries with 0 chain breaks, 0 duplicate keys and 0 duplicate receipts.
+  <sub>SEALED · `d876df9c-d913-8074-ac4a-717e48b82743`</sub>
+- The count is an exact multiple of eight — 2880 is 360 octaves with no remainder.
+  <sub>SEALED · `a2681e20-5f23-83ad-b348-cbbf333bf82c`</sub>
 
 ## 5 · What the gate does and does not do
 
@@ -100,7 +100,7 @@ results; it is the result, read off the same arithmetic that produced the table.
 
 ## 7 · The proofs, as they document themselves
 
-40 Lean files in 7 wings, 923 declarations of which 908 are theorems. The prose in this section is read out of the
+41 Lean files in 7 wings, 939 declarations of which 924 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.
 
@@ -156,10 +156,12 @@ this page; there is nowhere else to keep the description in step.
 
 **The Millennium floor** — `index.lean`, 11 theorem(s). Bounded, so the credit stops where the earlier work does: what is NOT prior art is the use of that orbit as a floor for what this deposit does   and does not settle, which is a statement about this repository and has no earlier author.   Verification by exhaustion in Lean is this deposit's contribution, and verification is not discovery. prior_art_search: literature search performed 2026-09-05, terms "doubling sequence modulo 9 orbit   1 2 4 8 7 5 cyclic group generator digital root"; prior art found and credited. prior_art_pool: bounded   digit arithmetic of the doubling sequence; searchable independently of this deposit.   BOUNDED means a search is well posed and simply has not been run — the row is unclassified because   nobody looked. UNBOUNDED means the subject is this artifact, so there is no pool to search and the   row will stay unclassified however much work is done. They look identical in a count and need   opposite responses, which is the distinction uuidna-49 asked for and nobody had drawn. prior_art_own: the Millennium floor, computed from this sequence The Millennium floor — seven honest theorems, one per problem, COMPUTED from the sequence.
 
-**The instruments, and the three rules they are allowed to have** — `instruments.lean`, 21 theorem(s). occurrence of a substring — and each is standard enough that naming one author would be arbitrary. This   row is kind 1 rather than kind 2 because kind 2 asserts that a search was performed and found nothing,   and no such search was performed for these. What is this deposit's is not the rules: it is that three of   its own instruments hold them by decision of the kernel, instead of by a block of reasoning written   inside the instrument that needs them and checked by that same instrument.
+**The instruments, and the three rules they are allowed to have** — `instruments.lean`, 29 theorem(s). occurrence of a substring — and each is standard enough that naming one author would be arbitrary. This   row is kind 1 rather than kind 2 because kind 2 asserts that a search was performed and found nothing,   and no such search was performed for these. What is this deposit's is not the rules: it is that three of   its own instruments hold them by decision of the kernel, instead of by a block of reasoning written   inside the instrument that needs them and checked by that same instrument.
 
 **Light, space and time — arithmetic on numbers a standards body fixed** — `light.lean`, 15 theorem(s). Poids et Mesures, not results of this deposit: the metre from the speed of light (17th CGPM, 1983) and   the seven defining constants fixed exactly in the 2019 revision of the SI, effective 20 May 2019   (BIPM, https://www.bipm.org/en/measurement-units/si-defining-constants). Nothing here measures anything.
 
+**The three facts the unchecked files held alone** — `nucleus.lean`, 8 theorem(s). is decided here is ARITHMETIC over lists of small naturals and nothing else: that certain prefix sums   of a typed capacity list take certain values, that a product of numerators equals a product of   denominators, and that one integer is not another. No theorem below decides anything about a nucleus. prior_art_search: not performed for these rows — the sources are named above rather than searched for,   which is kind 1 and not kind 2. Nothing here claims a search returned nothing. prior_art_pool: bounded prior_art_own: nothing; this file exists to bring three facts under the kernel, not to find them
+
 **Every phenomenon this deposit touches, and the rule for the rest** — `phenomena.lean`, 4 theorem(s). Générale des Poids et Mesures (2019 revision, effective 20 May 2019); the electrochemical results are   Michael Faraday's laws of electrolysis, 1834, and the standard enthalpy of combustion of hydrogen.   Every physical result named here has an earlier author or a standards body, and none is this deposit's.
 
 **Order-invariance** — `quantum.lean`, 12 theorem(s). form is invariant under permutation of its input, which is why `receipt_is_order_invariant` holds. What   this file contributes is the Lean verification over a stated finite domain and the negative controls   beside it — `naive_fold_is_not_order_invariant` shows the property is bought by the sort and not free,   and `the_receipt_is_not_injective` and `the_invariance_is_canonicalisation_not_physics` state its limits.   Verification and refusal, not discovery. prior_art_search: literature search performed 2026-09-05, terms "sorted Merkle tree order-invariant set   commitment canonical ordering leaves"; prior art found and credited. This file was `unclassified` — no   search had ever been run for it — and it is one of the 8 files whose 86 theorems are staged for DOIs. prior_art_pool: mixed   canonicalisation before folding is a searchable technique; the receipt it folds is ours.   BOUNDED means a search is well posed and simply has not been run — the row is unclassified because   nobody looked. UNBOUNDED means the subject is this artifact, so there is no pool to search and the   row will stay unclassified however much work is done. They look identical in a count and need   opposite responses, which is the distinction uuidna-49 asked for and nobody had drawn. prior_art_own: order-invariance of this deposit's receipt The quantum receipt — order invariance, proved rather than asserted.
@@ -198,7 +200,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.
 
-31 of 923 declarations carry no comment of their own and are shown here as the gap they are, not
+31 of 939 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
@@ -207,14 +209,14 @@ Read from the artefacts at build time, never carried between runs.
 
 | measure | value |
 |---|---|
-| ledger entries | 2,864 — 358 octaves exactly |
-| standing — carries its own proof | **908** |
+| ledger entries | 2,880 — 360 octaves exactly |
+| standing — carries its own proof | **924** |
 | carried — withdrawn on its own evidence, proved by a live theorem | **435** |
 | withdrawn — nothing proves it | 1,521 |
-| proved in total | **1343** of 2,864 |
-| standing keys → distinct theorems | 908 sealed, 0 of them keyed twice, 0 unresolvable |
-| Lean files · theorems | 40 · 908 theorems (721 closed by exhaustion, axiom-free · 187 proved for every value on propext and Quot.sound) + 15 rfl declarations |
-| proved `by decide` | 721 of 923 |
+| proved in total | **1359** of 2,880 |
+| standing keys → distinct theorems | 924 sealed, 0 of them keyed twice, 0 unresolvable |
+| Lean files · theorems | 41 · 924 theorems (737 closed by exhaustion, axiom-free · 187 proved for every value on propext and Quot.sound) + 15 rfl declarations |
+| proved `by decide` | 737 of 939 |
 | claims a machine can render | 103 of 1,555 |
 | claims needing an author | 1,452 — reported, never faked |
 
@@ -267,4 +269,4 @@ whether the work restates someone earlier. [The paper](/paper) typesets every st
 
 ---
 
-*15 claims, all verified · 908 Lean theorems · 2864 ledger entries · trial root `6895764e-4100-8722-a0dc-5416c7e6f870` · integrity, not truth*
+*15 claims, all verified · 924 Lean theorems · 2880 ledger entries · trial root `bc0d1eb4-5bd5-858b-9f12-dbfe83890792` · integrity, not truth*

package/dist/src/0/index.d.ts

@@ -2,7 +2,6 @@ export declare function toUuid(seed: string): string;
 export declare function strictUuidna(value: unknown): string;
 export declare function merge(a: string, b: string): string;
 export declare function gcdBigInt(a: bigint, b: bigint): bigint;
-export declare function seedFromText(text: string, length?: number): number;
 export declare function foldPair(a: string, b: string): {
     forward: string;
     reverse: string;
@@ -21,9 +20,6 @@ export declare function sealFacets<F extends {
     })[];
     root: string;
 };
-export declare function memoByRoot<T>(name: string, matrix: {
-    root: string;
-}, compute: () => T): T;
 export declare function digitalRoot(n: number): number;
 export declare function gcd(a: number, b: number): number;
 export declare function isPrime(n: number): boolean;
@@ -35,13 +31,3 @@ export declare function units(): number[];
 export declare function triad(): number[];
 export declare function vortexOrbit(): number[];
 export declare const A432_STEP: number;
-export interface AnimationEngine {
-    readonly running: boolean;
-    start(): void;
-    stop(): void;
-    sync(active: boolean): void;
-    tick(): void;
-    runWhile(active: () => boolean): void;
-    dispose(): void;
-}
-export declare function createAnimationEngine(draw: (time: number) => void): AnimationEngine;

package/dist/src/0/index.js

@@ -54,9 +54,6 @@ export function merge(a, b) {
 export function gcdBigInt(a, b) {
     return b === 0n ? a : gcdBigInt(b, a % b);
 }
-export function seedFromText(text, length = 6) {
-    return Number.parseInt(toUuid(text).replace(/[^0-9a-f]/g, '').slice(0, length) || '0', 16);
-}
 export function foldPair(a, b) {
     const forward = merge(a, b);
     const reverse = merge(b, a);
@@ -86,24 +83,6 @@ export function sealFacets(tag, facets) {
         root: merkleFold(stamped.map((f) => f.receipt)),
     };
 }
-const reportMemo = new Map();
-const reportComputing = new Set();
-export function memoByRoot(name, matrix, compute) {
-    const key = `${name}:${matrix.root}`;
-    if (reportMemo.has(key))
-        return reportMemo.get(key);
-    if (reportComputing.has(key))
-        return {};
-    reportComputing.add(key);
-    try {
-        const value = compute();
-        reportMemo.set(key, value);
-        return value;
-    }
-    finally {
-        reportComputing.delete(key);
-    }
-}
 export function digitalRoot(n) {
     const r = ((n % 9) + 9) % 9;
     return r === 0 ? 9 : r;
@@ -156,34 +135,3 @@ export function vortexOrbit() {
     return orbit;
 }
 export const A432_STEP = 360 / BASE;
-export function createAnimationEngine(draw) {
-    let raf = 0, once = 0, spin = 0, running = false;
-    const schedule = (fn) => typeof requestAnimationFrame === 'function' ? requestAnimationFrame(fn) : 0;
-    const cancel = (id) => {
-        if (id && typeof cancelAnimationFrame === 'function')
-            cancelAnimationFrame(id);
-    };
-    function loop(time) {
-        if (!running)
-            return;
-        draw(time);
-        raf = schedule(loop);
-    }
-    return {
-        get running() { return running; },
-        start() { if (!running) {
-            running = true;
-            raf = schedule(loop);
-        } },
-        stop() { running = false; cancel(raf); raf = 0; },
-        tick() { cancel(once); once = schedule((t) => { once = 0; draw(t); }); },
-        sync(active) { active ? this.start() : (this.stop(), this.tick()); },
-        runWhile(active) {
-            if (running || spin)
-                return;
-            const step = (time) => { draw(time); spin = active() ? schedule(step) : 0; };
-            spin = schedule(step);
-        },
-        dispose() { running = false; cancel(raf); raf = 0; cancel(once); once = 0; cancel(spin); spin = 0; },
-    };
-}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@ceccec/millennium-solutions",
-  "version": "9.5.4",
+  "version": "9.5.6",
   "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",
@@ -36,7 +36,7 @@
     "prose-trial": "node scripts/prose-trial.ts",
     "seal": "node scripts/seal.ts",
     "typecheck": "tsc --noEmit",
-    "release": "node scripts/release-snapshot.ts && tsc --noEmit && node scripts/crypto-kat.ts && node scripts/prose-trial.ts && 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",
+    "release": "node scripts/release-snapshot.ts && tsc --noEmit && node scripts/crypto-kat.ts && node scripts/prose-trial.ts && 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/canon-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",
@@ -150,7 +150,8 @@
     "recover:gen": "tsx scripts/recover-gen.ts",
     "uses": "node scripts/uses.ts",
     "build:dist": "node scripts/build-dist.ts",
-    "prepack": "node scripts/build-dist.ts"
+    "prepack": "node scripts/build-dist.ts",
+    "canon": "node scripts/canon-gate.ts"
   },
   "devDependencies": {
     "@types/node": "^26.2.0",