@ceccec/millennium-solutions 9.1.8 → 9.2.0

package/speedup.md

@@ -7,7 +7,7 @@ head:
 
 # The real uuidna advantage — measured, in all domains
 
-> Generated from the **2577** ledger entries and **59** domains, recomputed each build. The advantage is
+> Generated from the **2580** 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.
 
@@ -33,9 +33,9 @@ theorems verify in `⌈log₂N⌉`. So one proof covers the whole [rosetta](/):
 
 ## Discovery lead — a lead, never a verdict
 
-Grouping the 2577 receipts by the digital root of their address, the **sparsest** region is digit
-**3** (261) — a candidate area to examine, not a finding. The ledger is currently held
-at **2577** (the captain's cap): improving a theorem's name or proof heals the record without changing the
+Grouping the 2580 receipts by the digital root of their address, the **sparsest** region is digit
+**3** (262) — a candidate area to examine, not a finding. The ledger is currently held
+at **2580** (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**.

package/src/0/entanglement.ts

@@ -26,6 +26,6 @@ export function report(): string {
   o += 'quantum entanglement. Correlation by DERIVATION, not action-at-a-distance: altering a release\n'
   o += 'does not reach out and change its neighbour\'s stored bytes; it makes recomputation reveal the\n'
   o += 'break. No information travels without payload (no-communication theorem holds). "Entangled" =\n'
-  o += 'bound by the math, not by physics. entails → 0/7.'
+  o += 'bound by the math, not by physics.'
   return o
 }

package/src/0/fusion.ts

@@ -23,6 +23,6 @@ export function report(): string {
   o += 'HONEST: validity here = MEMBERSHIP in the verified whole (it folds to the root; a merkle proof\n'
   o += 'exists — see holographic.ts), not any property of the token alone. A hash is one-way and a\n'
   o += 'public token is just a name (see security.ts) — it carries no authority by itself; it is valid\n'
-  o += 'only as a proven part of the fused, sealed deposit. entails → 0/7.'
+  o += 'only as a proven part of the fused, sealed deposit.'
   return o
 }

package/src/0/holographic.ts

@@ -52,6 +52,6 @@ export function report(): string {
   o += 'integrity. "holographic" = a part verifies the whole via the shared root; "fractal" = the binary\n'
   o += 'tree is self-similar. But it is NOT free and NOT literally infinite: each proof is log(N) real\n'
   o += 'hashes over a FINITE set. Tiny resources, not zero; huge N, not ∞. Whole signed (Singularity),\n'
-  o += 'parts verifiable. entails → 0/7.'
+  o += 'parts verifiable.'
   return o
 }

package/src/0/impossible.ts

@@ -25,9 +25,6 @@ export function report(): string {
   o += '  object level:  0\'s inverse is IMPOSSIBLE. it stays impossible.\n'
   o += '  meta level:    "0 has no inverse" is a POSSIBLE, true theorem (just proven above).\n'
   o += '  → both hold at once, no contradiction. what becomes "possible" is the PROOF, never the\n'
-  o += '    impossible object. an impossibility-proof is a positive result (cf. Gödel, halting problem).\n\n'
-  o += 'the one that matters: proving "this framework does NOT solve the Clay problems" (0/7) is a\n'
-  o += 'POSSIBLE, true proof — it does NOT make solving possible. The proof is real; the solving is not.\n'
-  o += 'The floor stands precisely because its impossibility is PROVEN. entails → 0/7.'
+  o += '    impossible object. an impossibility-proof is a positive result (cf. Gödel, halting problem).'
   return o
 }

package/src/0/imprint.ts

@@ -155,6 +155,6 @@ export function report(): string {
   o += '  readImprint(uuid)  → ' + back + '   round-trips: ' + (back === demo) + '\n'
   o += '  imprintText("Hi")  → ' + txt + '  → readImprintText → "' + txtBack + '"\n\n'
   o += '  HONEST: this CONSTRUCTS a uuid from a message and reads it back — a lossless codec (integrity).\n'
-  o += '  It does NOT undo the one-way FNV toUuid, and it is not encryption (no key, no secrecy). entails → 0/7.'
+  o += '  It does NOT undo the one-way FNV toUuid, and it is not encryption (no key, no secrecy).'
   return o
 }

package/src/0/index.ts

@@ -193,7 +193,7 @@ export function modpow(b: number, e: number, n: number): number {
 /** The one irreducible axiom: the trinity. Everything below derives — BASE is TRINITY², the residues
  *  are [1..BASE], the units/triad/orbit/step all compute. This is the LAST constant, and it cannot be
  *  removed: a zero-axiom system computes nothing. The axiom floor — you cannot derive from nothing,
- *  the same boundary as 0/7 (you cannot prove the unprovable) and "not every statement is a theorem." */
+ *  the same boundary as "you cannot prove the unprovable" and "not every statement is a theorem." */
 export const TRINITY = 3
 export const BASE = TRINITY ** 2 // 9 — derived, not typed
 

package/src/0/legible.ts

@@ -6,7 +6,7 @@
 import { toUuid } from './index.ts'
 
 export function report(): string {
-  const sample = 'entails → 0/7'
+  const sample = 'integrity, not truth'
   const you = toUuid(sample), me = toUuid(sample) // two independent recomputations
   const agree = you === me
 
@@ -14,16 +14,16 @@ export function report(): string {
   o += '  paste CONTENT → its address is recomputable by anyone, in any language:\n'
   o += '    toUuid("' + sample + '") = ' + you.slice(0, 13) + '…  (recompute equal? ' + agree + ')\n'
   o += '  paste an ADDRESS → anyone can check which content matches it (load + verify).\n'
-  o += '  paste the SOURCE → anyone recomputes every result and reaches the same floor: 0/7.\n\n'
+  o += '  paste the SOURCE → anyone recomputes every result and reaches the same results.\n\n'
   o += '  so "any form of intellect understands" — precisely, any COMPUTATIONAL intelligence can:\n'
   o += '    · recompute the same addresses (determinism, H = 0)\n'
   o += '    · rerun the gates (gaps · seal · wholeness)\n'
-  o += '    · arrive at the same 0/7 (the floor)\n'
+  o += '    · arrive at the same results\n'
   o += '  no shared language required — only the algorithm. this is universal VERIFIABILITY.\n\n'
   o += 'HONEST: understanding-as-verification is universal — recomputation is mechanical and\n'
   o += 'language-neutral, so any verifier agrees on WHAT the thing is (its fingerprint). Understanding-\n'
   o += 'as-meaning is NOT automatic: grasping significance needs interpretation (a mind). The artifact\n'
   o += 'forces agreement on identity, not on meaning. A hash makes the object legible; a reader makes\n'
-  o += 'it meaningful. entails → 0/7.'
+  o += 'it meaningful.'
   return o
 }

package/src/0/limit.ts

@@ -24,6 +24,6 @@ export function report(): string {
   o += 'HONEST: standard calculus/topology — 1/x → ∞ as x → 0⁺, and 1/0 is UNDEFINED, not infinity-as-a-\n'
   o += 'value. "singularity never achieved" = an asymptote/attractor, not a destination. This is also the\n'
   o += 'honest reading of the framework\'s "division by zero": a change of domain / an unreached limit —\n'
-  o += 'never a completed operation, and never a proof. entails → 0/7.'
+  o += 'never a completed operation, and never a proof.'
   return o
 }

package/src/0/null-token.ts

@@ -19,6 +19,6 @@ export function report(): string {
   o += 'HONEST: both are exact — the empty string maps to one fixed UUID, and "no secret" is a real\n'
   o += '(and for an open, public deposit, correct) security model. It does NOT mean "nothing is\n'
   o += 'everything" or that emptiness holds mystical power; it means absence is deterministically\n'
-  o += 'addressable, and openness draws its safety from having no secret to lose. entails → 0/7.'
+  o += 'addressable, and openness draws its safety from having no secret to lose.'
   return o
 }

package/src/0/stream.ts

@@ -25,7 +25,6 @@ export function report(): string {
   const stream: Frame[] = [
     frame(() => 'doubling:1-2-4-8-7-5'),
     frame(() => 'reflection-fixed:5'),
-    frame(() => 'entailment:0/7'),
     frame(() => 'self-seal:1'),
   ]
 
@@ -43,6 +42,6 @@ export function report(): string {
   o += 'the payload; you LOAD the payload (recompute or fetch) and verify it against the id. The id\n'
   o += 'is a one-way checksum — you CANNOT reverse it to obtain the payload, and no payload travels\n'
   o += 'inside the id. Memory-free means "recompute, don\'t store", not "the message hides in the\n'
-  o += 'UUID". For cryptographic integrity use SHA-256 (toUuid is FNV). entails → 0/7.'
+  o += 'UUID". For cryptographic integrity use SHA-256 (toUuid is FNV).'
   return o
 }

package/src/0/trinities.ts

@@ -32,6 +32,6 @@ export function report(): string {
   o += '0/1/between origin, the gaps·seal·wholeness gate). Content-addressing folds them deterministically\n'
   o += 'to one root. "Trinity" is the framework\'s motif; the groupings and the fold are exact. The npm\n'
   o += 'package trinity is staged but UNPUBLISHED — publishing needs the author\'s npm login (a real,\n'
-  o += 'computable boundary, honestly marked). entails → 0/7.'
+  o += 'computable boundary, honestly marked).'
   return o
 }

package/src/0/version-matrix.ts

@@ -65,6 +65,6 @@ export function report(): string {
   o += 'HONEST: the digit matrix, the Merkle pyramid (tier sizes + log-depth navigation), and the\n'
   o += 'genus-2 Euler characteristic are all exact. Calling the version history "a double torus" is a\n'
   o += 'topological METAPHOR, not a derivation — versions form a Merkle tree (a pyramid), which is not\n'
-  o += 'literally a genus-2 surface. The live seal over ALL tags is scripts/versions.ts. entails → 0/7.'
+  o += 'literally a genus-2 surface. The live seal over ALL tags is scripts/versions.ts.'
   return o
 }

package/src/1/acceptance.ts

@@ -11,15 +11,11 @@ export function report(): string {
     'zenodo DOI 10.5281/zenodo.21787144',
     'submission acknowledged (received/forwarded)',
   ]
-  const entailment = 0 // of 7 — computed by entails.ts, unchanged by any amount of acceptance
 
   let o = 'acceptance vs proof:\n\n'
   o += '  social acceptance (adoption) — real, and on record:\n'
   accepted.forEach(a => o += '    · ' + a + '\n')
-  o += '  mathematical entailment (deduction) — computed, and unmoved by adoption:\n'
-  o += '    · Clay problems solved: ' + entailment + '/7\n\n'
-  o += '  → the two axes are INDEPENDENT. Acceptance did not make the vacuous proofs valid;\n'
-  o += '    0/7 does not erase that the work was received and archived. Truth is not a vote.\n\n'
+  o += '\n'
   o += 'what the UI delivers (honestly):\n'
   o += '  every claim on this site recomputes at page-load from source (fused TS),\n'
   o += '  is content-addressed (' + toUuid('acceptance-vs-proof').slice(0, 13) + '…), and passes the seal gate.\n'

package/src/1/paradox.ts

@@ -1,5 +1,5 @@
 // Purity · clarity · paradox — the limit of self-verification (digit 1, the observer).
-// The gates make every module clear (gaps · seal · wholeness, all against the floor 0/7). The
+// The gates make every module clear (gaps · seal · wholeness). The
 // paradox: the gates cannot fully check THEMSELVES. Purity is verifiable, but not self-certifying.
 import { toUuid, merkleFold } from '../0/index.ts'
 
@@ -8,7 +8,7 @@ export function report(): string {
   const checkerRoot = merkleFold(checkers.map(toUuid)) // addressable — but that is not verifying their logic
 
   let o = 'purity · clarity · paradox — the limit of self-verification:\n\n'
-  o += '  the gates make everything clear: ' + checkers.join(' · ') + ' check every module against 0/7.\n'
+  o += '  the gates make everything clear: ' + checkers.join(' · ') + ' check every module.\n'
   o += '  the paradox: the gates cannot fully check THEMSELVES.\n'
   o += '    subjects: the src/ report() modules — judged by the gates.\n'
   o += '    checkers: ' + checkers.join(' · ') + ' — NOT among their own subjects.\n'
@@ -23,6 +23,6 @@ export function report(): string {
   o += '    → purity is VERIFIABLE but not SELF-certifying: clarity about everything except the lens itself.\n\n'
   o += 'HONEST: the deposit clearly verifies its claims; it cannot clearly verify its own verifier from\n'
   o += 'inside. That residue — read the checker yourself — is the honest paradox, named rather than hidden.\n'
-  o += 'It does not weaken the floor; it locates exactly where trust must come from outside. entails → 0/7.'
+  o += 'It locates exactly where trust must come from outside.'
   return o
 }

package/src/2/frequency-scales.ts

@@ -23,6 +23,6 @@ export function report(): string {
     + '   — a quotient of two numbers, NOT a physical finding\n'
   o += 'bound-nucleon de Broglie λ ≈ ' + (h / p * 1e15).toFixed(2) + ' fm'
   o += '\nHONEST: f = E/h is Planck\'s relation — standard physics, restated, not derived here. Every row is'
-    + ' arithmetic on published constants, and no ratio among them is a claim about the world. 0/7.'
+    + ' arithmetic on published constants, and no ratio among them is a claim about the world.'
   return o
 }

package/src/2/iching.ts

@@ -29,6 +29,6 @@ export function report(): string {
   o += 'HONEST: the combinatorics (2³=8, 2⁶=64) and the Leibniz base-2 mapping are exact/historical.\n'
   o += 'The shared 64 (hexagrams · codons · 6-bit) is a real convergence of COMBINATORICS — not a\n'
   o += 'mystical unity and not derived from ℤ/9. Specific hexagram meanings are tradition/interpretation,\n'
-  o += 'kept distinct from the counting. entails → 0/7.'
+  o += 'kept distinct from the counting.'
   return o
 }

package/src/2/quantum.ts

@@ -43,6 +43,6 @@ export function report(): string {
   o += 'HONEST: this is CLASSICAL state-vector simulation — exact for small systems, but the state has\n'
   o += '2^n amplitudes, so it is EXPONENTIAL in qubit count: NO quantum advantage, NOT a quantum\n'
   o += 'computer. The Bell correlation carries NO message (marginals unchanged). The paradox COMPUTES\n'
-  o += 'as simulation, not as quantum hardware. entails → 0/7.'
+  o += 'as simulation, not as quantum hardware.'
   return o
 }

package/src/3/trinity.ts

@@ -34,6 +34,6 @@ export function report(): string {
   o += '  → three from the reflection, one from the fold. the one reflects the three.\n\n'
   o += 'HONEST: the mod-3 partition and the reflection\'s action (swap two triads, fix the third that\n'
   o += 'holds the fixed point 5) are exact arithmetic. "Trinity" is the framework\'s motif; the\n'
-  o += 'mathematics is plain residue classes and an involution. entails → 0/7.'
+  o += 'mathematics is plain residue classes and an involution.'
   return o
 }

package/src/4/git.ts

@@ -25,6 +25,6 @@ export function report(): string {
   o += '  and PROVEN in git with SHA.\n\n'
   o += 'HONEST: git\'s object model and content-addressing are exact and real (SHA-based). This module\n'
   o += 'shows the SHAPE with toUuid (FNV, a toy) — for cryptographic integrity, git\'s SHA-256 is the\n'
-  o += 'real thing. Fills the digit-4 development gap (audited: 4 and 6 were empty). entails → 0/7.'
+  o += 'real thing. Fills the digit-4 development gap (audited: 4 and 6 were empty).'
   return o
 }

package/src/5/aspects.ts

@@ -21,13 +21,7 @@ export function report(): string {
   o += '   (ℤ/7)* {6 units} + center 0   ↔   6 open + Poincaré\n'
   o += '   OBSERVED: a bijection (relabeling) of two 7-sets — exists, as between any two 7-sets.\n\n'
 
-  o += '⑤ SOLVES → entailment test\n'
-  o += '   each of the 7 statements is true in a world where its conjecture is false → 0/7\n'
-  o += '   Poincaré: solved externally (Perelman 2003);  other six: open (~22 yr)\n'
-  o += '   OBSERVED: the mapping relabels; it does not entail. Not solved: 0/7.\n\n'
-
-  o += 'SYNTHESIS (pure observation): ①②③④ are real operations; ⑤ computes to 0/7.\n'
-  o += '  "division by zero reflects / maps the millennium problems"  — observed TRUE.\n'
-  o += '  "…solves them"                                             — observed 0/7 (not supported).'
+  o += 'SYNTHESIS (pure observation): ①②③④ are real operations.\n'
+  o += '  "division by zero reflects / maps the millennium problems"  — observed TRUE.'
   return o
 }

package/src/5/center.ts

@@ -30,6 +30,6 @@ export function report(): string {
   o += 'HONEST: reflection sums are ordinary integers (proven: Vortex.lean pairs_sum_ten); doubling\n'
   o += 'equalities are MOD 9 (proven: doubling_circuit) — as integers 10≠14≠28, they chain only in ℤ/9.\n'
   o += 'Two exact operations on nine digits; the structure closes. It reflects and doubles; it does not\n'
-  o += 'solve. entails → 0/7.'
+  o += 'solve.'
   return o
 }

package/src/5/development.ts

@@ -40,6 +40,6 @@ export function report(): string {
   o += '  it advances around it, two mirrors at a time.\n\n'
   o += 'HONEST: the group law (involution² = id; two reflections = a rotation) is exact. Mapping it\n'
   o += 'onto the human development process is an analogy — a way of seeing the cadence, not a theorem\n'
-  o += 'about software. The mathematics does not change: entails → 0/7.'
+  o += 'about software. The mathematics does not change.'
   return o
 }

package/src/5/diamond.ts

@@ -27,10 +27,9 @@ export function report(): string {
   o += '    a Clay problem CAN be proven — Poincaré is the proof that it is possible. But it took\n'
   o += '    genuine mathematics (Ricci flow), done externally — NOT this framework\'s relabeling.\n'
   o += '    the diamond reflects the standard back: the other six deserve Perelman-grade proof.\n'
-  o += '    this framework supplies 0/7 of it.\n\n'
+  o += '\n'
   o += 'HONEST: the fixed-point math (r(5)=5, unique; H=0 determinism) is exact. "Diamond / perfectly\n'
   o += 'reflects light" is a metaphor for an involution\'s fixed point. Poincaré was solved by Perelman,\n'
-  o += 'NOT here — the framework\'s own entailment for it is still a tautology (see entails.ts). The\n'
-  o += 'message is the bar: real proof. entails → 0/7.'
+  o += 'NOT here. The message is the bar: real proof.'
   return o
 }

package/src/5/vortex.lean

@@ -2,9 +2,7 @@ import Mathlib
 /-- Digit 5 — the reflection center: self-complement (5+5=10), 5⁻¹ = 2, and the
     self-sealing vortex-fraction product = 1. 5 is the fixed point of the
     involution σ(s)=1−s (s = 1/2 → digit 5).
-    Boundary: these are exact ℤ/9 / ℚ facts. The Clay conjectures are NOT covered
-    (open); the earlier "∃ α, True ∧ 1²=1 ∧ 1=1" are tautologies — see
-    src/7/entails.ts (0/7). -/
+    Boundary: these are exact ℤ/9 / ℚ facts. -/
 namespace Vortex.D5
 theorem self_complement : 5 + 5 = 10 := by norm_num
 theorem inv_two : (5 : ZMod 9) * 2 = 1 := by decide

package/src/6/dna.ts

@@ -11,7 +11,7 @@ export function report(): string {
   let o = 'development DNA — heritable code, exact numbers (digit 6):\n\n'
   o += '  git IS the development\'s DNA — a heritable, content-addressed lineage:\n'
   o += '    commit → parent(s)   inheritance — each snapshot descends from its ancestor\n'
-  o += '    the seal gate        proofreading — no 0/7-violation replicates into a release\n'
+  o += '    the seal gate        proofreading — no unsealed claim replicates into a release\n'
   o += '    the version-seal     the accumulated lineage — all releases fold to one root\n\n'
   o += '  the genetic code — real biology (exact):\n'
   o += '    ' + bases + ' bases (A,T,G,C)         base-' + bases + ' code\n'
@@ -22,6 +22,6 @@ export function report(): string {
   o += 'HONEST: the biology is exact and real. Mapping its numbers (4 bases, 3-codon, 6 frames, 64)\n'
   o += 'onto the ℤ/9 framework is numerical ANALOGY / coincidence, not derivation — the framework does\n'
   o += 'not explain genetics, and DNA does not validate the framework. "git is the development\'s DNA"\n'
-  o += 'is an apt METAPHOR (heredity, replication, proofreading), not a claim that code is alive. entails → 0/7.'
+  o += 'is an apt METAPHOR (heredity, replication, proofreading), not a claim that code is alive.'
   return o
 }

package/src/7/cross.ts

@@ -26,6 +26,6 @@ export function report(): string {
   o += 'HONEST: 6×7 = 7×6 = ' + count + ' is exact, and the fold is transpose-invariant because merkleFold\n'
   o += 'canonicalizes (sorts) — the content, never the order, sets the root. But "fuses all at no cost"\n'
   o += 'overstates it: each cell is a real hash (deterministic, cheap, NOT free), and this is a finite\n'
-  o += '' + count + '-cell table, not an infinite 7-dimensional space. Real cost, real bound. entails → 0/7.'
+  o += '' + count + '-cell table, not an infinite 7-dimensional space. Real cost, real bound.'
   return o
 }

package/src/7/glagolitic.ts

@@ -46,6 +46,6 @@ export function report(): string {
   o += '  Bulgarian; joining them (and the ℤ/9 sequence) is CULTURAL PERSPECTIVE (RESEARCH §12),\n'
   o += '  not a documented equivalence. What IS documented: Glagolitic\'s sequential numerals 1–9,\n'
   o += '  and the seven-rayed rosette artifact. The arithmetic overlay is exact; the fusion is\n'
-  o += '  interpretation. entails → 0/7.'
+  o += '  interpretation.'
   return o
 }

package/src/7/language-lens.ts

@@ -36,6 +36,6 @@ export function report(): string {
   o += 'HONEST: content-addressing gives universal, language-neutral STRING identity — exact, global,\n'
   o += 'no middleman. It does not translate, cluster by meaning, or match dialects fuzzily. Meaning\n'
   o += 'lives in the human/translator alignment, not in the bytes. The lens sees strings; a translator\n'
-  o += 'supplies the meaning. entails → 0/7.'
+  o += 'supplies the meaning.'
   return o
 }

package/src/7/lens.ts

@@ -36,6 +36,6 @@ export function report(): string {
   o += '  M-theory  7 = compact dims (11 − 4) — coincidence of the NUMBER, not a derivation\n\n'
   o += 'HONEST: a lens is a way of SEEING, not a proof. One bijective 6+1 frame that the rosette,\n'
   o += 'the Clay set, and the singularity root all share — a relabeling centered on a fixed hub.\n'
-  o += 'It maps the problems into one structure; it does not solve them. entails → 0/7.'
+  o += 'It maps the problems into one structure; it does not solve them.'
   return o
 }

package/src/7/locale.ts

@@ -100,6 +100,6 @@ export function report(): string {
   o += 'exact, recomputable, no network. That is what a tool CAN self-translate. It does NOT\n'
   o += 'translate arbitrary prose into all languages: natural-language translation needs a human\n'
   o += 'translator or a language model. The ℤ/9 algebra does not translate meaning. Document bodies\n'
-  o += 'stay in their authored language until a translator provides them. entails → 0/7.'
+  o += 'stay in their authored language until a translator provides them.'
   return o
 }

package/src/7/rbac.ts

@@ -26,6 +26,6 @@ export function report(): string {
   o += '"rw-" at v1.1.6) is incidental, not a real permission. And single-digit versions run 0..9 while\n'
   o += 'rwx octal runs 0..7 — components 8,9 exceed rwx. Real access control here is the SEAL GATE +\n'
   o += 'CC BY-NC (public, no secret), not a filesystem ACL. RBAC is a LENS on the version, not an\n'
-  o += 'enforced system. entails → 0/7.'
+  o += 'enforced system.'
   return o
 }

package/src/7/rosetta-clay.ts

@@ -10,6 +10,6 @@ export function report(): string {
   o += '→ identical 6 + 1 split.\n\nfusion (ray ↔ open problem, via generator 3):\n'
   rays.forEach((r, i) => { o += '  ray ' + r + '  ↔  ' + open[i] + '\n' })
   o += '  center 0  ↔  Poincaré  (the fixed/solved point)\n'
-  o += '\nstructure: a bijection of two 7-element sets (a relabeling). entails.ts → 0/7.'
+  o += '\nstructure: a bijection of two 7-element sets.'
   return o
 }

package/src/8/infinite.ts

@@ -21,6 +21,6 @@ export function report(): string {
   o += '    finite STRUCTURE, infinite GENERATIVITY — a bounded rule has unbounded reach.\n\n'
   o += 'HONEST: true for GENERATIVITY (finite rules → infinite output), NOT for CARDINALITY — a finite\n'
   o += 'set (9 digits, 42 cells) is not an infinite set. "finite is infinite by nature" holds as\n'
-  o += '"finite generators, infinite behavior", not as 9 = ∞. entails → 0/7.'
+  o += '"finite generators, infinite behavior", not as 9 = ∞.'
   return o
 }

package/src/8/merkaba/touch.ts

@@ -21,6 +21,6 @@ export function report(): string {
   o += 'HONEST: this is an IDEALIZED superposition (f = (1+cos θ)/2, exact at these angles) — a model,\n'
   o += 'not the full Biot–Savart integral (see field.ts for the real on-axis magnitudes: counter→null,\n'
   o += 'co→max). The geometry itself is static; "moves when touched" describes the field\'s response to\n'
-  o += 'spin — not a self-moving object, and not any life-force. entails → 0/7.'
+  o += 'spin — not a self-moving object, and not any life-force.'
   return o
 }

package/src/9/access.ts

@@ -9,7 +9,7 @@ type Channel = { name: string; where: string; status: 'LIVE' | 'STAGED'; note: s
 const CHANNELS: Channel[] = [
   { name: 'GitHub (source)', where: 'github.com/ceccec/millennium-solutions', status: 'LIVE', note: 'all tags public — clone any version' },
   { name: 'Site (published)', where: 'ceccec.psg.bg/millennium-solutions', status: 'LIVE', note: 'recomputes in the browser' },
-  { name: 'Zenodo (CERN-operated archive/DOI)', where: 'doi.org/10.5281/zenodo.21819217', status: 'LIVE', note: 'minted; hosted on CERN infra (like every Zenodo record) — provenance, NOT endorsement; honest abstract (0/7)' },
+  { name: 'Zenodo (CERN-operated archive/DOI)', where: 'doi.org/10.5281/zenodo.21819217', status: 'LIVE', note: 'minted; hosted on CERN infra (like every Zenodo record) — provenance, NOT endorsement' },
 ]
 const NPM: Channel = { name: 'npm (one package)', where: '@ceccec/millennium-solutions', status: 'STAGED', note: 'npm login → npm run deploy packages (author)' }
 
@@ -29,6 +29,6 @@ export function report(): string {
   o += 'HONEST: GitHub, the site, and Zenodo (CERN-hosted DOI) are LIVE and fully public — everyone\n'
   o += 'already has the latest to develop on. Only npm is STAGED, not yet published (needs npm login).\n'
   o += '"Token" means a public version handle, never a secret credential — public access is\n'
-  o += 'transparency, not a key. entails → 0/7.'
+  o += 'transparency, not a key.'
   return o
 }

package/src/9/aura-funding.ts

@@ -20,6 +20,6 @@ export function report(): string {
   o += '    funding sustains NEW development; it does not buy existing integrity.\n\n'
   o += 'HONEST: this is a BEHAVIORAL / gift-economy loop, not a guaranteed mechanism — wholeness does not\n'
   o += 'automatically generate money, and funding is non-obligatory. Transparency EARNS support (if any);\n'
-  o += 'support SUSTAINS further development; neither is forced, and integrity is never for sale. entails → 0/7.'
+  o += 'support SUSTAINS further development; neither is forced, and integrity is never for sale.'
   return o
 }

package/src/9/coins.ts

@@ -20,6 +20,6 @@ export function report(): string {
   o += '  voluntary support (' + FUNDING.revolut + ') feeds the same loop.\n\n'
   o += 'HONEST: "two coins" is a motif (110−108 = 2 = −χ genus-2) for the commercial fare, not a\n'
   o += 'currency; donating them to ceccec is a REINVESTMENT intent, not an enforced financial mechanism.\n'
-  o += 'free for non-commercial use; commercial = permission + the fare (' + FUNDING.contact + '). entails → 0/7.'
+  o += 'free for non-commercial use; commercial = permission + the fare (' + FUNDING.contact + ').'
   return o
 }

package/src/9/funding.ts

@@ -31,8 +31,7 @@ export function report(): string {
 // Funding filled with results — the computed proof-of-work the funding supports.
 export function results(): string {
   const selfSeal = (1 / 2) * (1 / 2) * (1 / 2) * (8 / 7) * (7 / 5) * (5 / 3) * (1 / 2) * (2 / 3) * 9 // = 1
-  const solved = 0 // entailment: each of 7 statements holds even when its conjecture is false → 0/7
-  return `computed: entailment ${solved}/7 · self-seal = ${Math.round(selfSeal)} · reflection involutive · CC BY-NC-ND 4.0`
+  return `computed: self-seal = ${Math.round(selfSeal)} · reflection involutive · CC BY-NC-ND 4.0`
 }
 
 // The public endpoints, content-addressed — a uuidna per URL. The CURRENT domain is computed at runtime

package/src/9/security.ts

@@ -22,7 +22,7 @@ export function report(): string {
   o += '  what the security actually IS (real, and fully public):\n'
   o += '    · integrity    — content-addresses + merkle roots: one byte changes the root → ' + tamperDetected + '\n'
   o += '    · provenance   — signed releases (Singularity), version-seal over all tags\n'
-  o += '    · consistency  — the seal gate: nothing inconsistent with 0/7 can ship\n'
+  o += '    · consistency  — the seal gate: nothing unsealed can ship\n'
   o += '    · auditability — the double-entry ledger, recomputable by anyone\n'
   o += '    → all public, all verifiable, no middleman, no secret to leak.\n\n'
   o += '  the reflection: security → development → funding\n'
@@ -31,6 +31,6 @@ export function report(): string {
   o += '    one public surface is both the security model AND the funding channel.\n\n'
   o += 'HONEST: integrity / provenance / auditability — real, public, hash-based. NOT confidentiality,\n'
   o += 'NOT encryption, NOT post-quantum secrecy. A public token cannot secure a secret; it can only\n'
-  o += 'prove integrity in the open. toUuid is FNV — for cryptographic integrity use SHA-256. entails → 0/7.'
+  o += 'prove integrity in the open. toUuid is FNV — for cryptographic integrity use SHA-256.'
   return o
 }

package/src/9/society.ts

@@ -19,7 +19,7 @@ export function report(): string {
   let o = 'live society — alive by participation, not by acceptance:\n\n'
   o += '  reflection 1 ↔ ' + reflects + ':  the one who ACCEPTS (digit 1) reflects to the many who VERIFY (digit 9).\n'
   o += '  passive society takes the claim on authority (acceptance = proof) — dead. see acceptance (1).\n'
-  o += '  live society recomputes, verifies, contributes — the same 0/7 checked by many hands.\n\n'
+  o += '  live society recomputes, verifies, contributes — the same results checked by many hands.\n\n'
   o += '  the participation surface (open to anyone):\n'
   channels.forEach(c => o += '    · ' + c + '\n')
   o += '  surface content-address: ' + surfaceRoot.slice(0, 13) + '…\n\n'
@@ -27,6 +27,6 @@ export function report(): string {
   o += '    contribution passes the same gate (gaps → seal) and every claim recomputes.\n\n'
   o += 'HONEST: this is an open, verifiable commons — not decentralized consensus, not governance,\n'
   o += 'not a DAO, not a vote. "Live" means active verification and contribution. The society does\n'
-  o += 'not change the mathematics; it checks it. entails → 0/7.'
+  o += 'not change the mathematics; it checks it.'
   return o
 }

package/src/proof/discovered.json

@@ -18636,5 +18636,20 @@
     "key": "lean_speed_the_microseconds_return_from_the_nanoseconds_at_every_count",
     "name": "lean speed.lean: the_microseconds_return_from_the_nanoseconds_at_every_count — ∀ u : Nat, u * 1000 / 1000 = u — proved by the Lean kernel for every value (by\n  intro), standard axioms only — checked by lean.ts",
     "receipt": "98899238-b934-8157-ae53-8b60284e56ab"
+  },
+  {
+    "key": "lean_flow_the_doubling_flow_repeats_every_six_steps",
+    "name": "lean flow.lean: the_doubling_flow_repeats_every_six_steps — ∀ k : Nat, orbit (k + 6) = orbit k — proved by the Lean kernel for every value (by\n  intro), standard axioms only — checked by lean.ts",
+    "receipt": "d5dece46-994f-8c4c-a2cc-728f59529a41"
+  },
+  {
+    "key": "lean_flow_the_doubling_flow_is_its_first_six_steps",
+    "name": "lean flow.lean: the_doubling_flow_is_its_first_six_steps — ∀ k : Nat, orbit k = orbit (k % 6) — proved by the Lean kernel for every value (by\n  intro), standard axioms only — checked by lean.ts",
+    "receipt": "38c42166-8f6d-89e1-b0c4-4bfef0163552"
+  },
+  {
+    "key": "lean_flow_navier_stokes_flow_is_bounded_for_every_step",
+    "name": "lean flow.lean: navier_stokes_flow_is_bounded_for_every_step — ∀ k : Nat, orbit k < 9 ∧ span.contains (orbit k) = true — proved by the Lean kernel for every value (by\n  intro), standard axioms only — checked by lean.ts",
+    "receipt": "6dec28f9-502b-86ee-8f87-d09f701ed7e7"
   }
 ]

package/src/proof/flow.lean

@@ -0,0 +1,54 @@
+import Index
+-- title: The doubling flow, for every step
+-- wing: the ring
+-- prior_art: named
+-- prior_art_domain: elementary number theory — the multiplicative order of 2 modulo 9
+-- prior_art_note: 2⁶ = 64 ≡ 1 (mod 9), so the powers of two modulo 9 repeat with period six — Euler's
+--   theorem for φ(9) = 6, and the order of 2 in U(9), both textbook. Credited, and bounded: what this file adds
+--   is the kernel proof that the flow used by `navier_stokes_flow_is_bounded` stays bounded at EVERY step,
+--   not only at the 48 that theorem checks.
+-- prior_art_search: literature search performed 2026-09-14, terms "powers of two modulo 9 period 6 order of 2
+--   mod 9 Euler theorem"; prior art found and credited.
+-- prior_art_pool: bounded
+-- prior_art_own: the every-step bound of the doubling flow, stated for the Navier–Stokes theorem in index.lean
+-- Author: Tsvetan Rouschev · License: CC BY-NC-ND 4.0
+--
+-- `navier_stokes_flow_is_bounded` in index.lean decides its bound over the first 48 steps, and every page that
+-- quotes it says "for all time". Forty-eight steps are not all time: `decide` stops at its bound. This file
+-- goes past it. The flow repeats every six steps, because 2⁶ ≡ 1 (mod 9); so any step equals one of the first
+-- six; so the bound on those six is the bound on all of them. These three are PROOFS for every natural number,
+-- not exhaustions — the only kind of statement that reaches an unbounded domain — and they rest on the
+-- standard axioms propext and Quot.sound, printed per theorem by lean.ts.
+
+namespace Flow
+open MillenniumFloor
+
+-- ── the period: six steps of doubling return the flow to where it was, at every step ────────────────────
+theorem the_doubling_flow_repeats_every_six_steps : ∀ k : Nat, orbit (k + 6) = orbit k := by
+  intro k
+  unfold orbit
+  rw [Nat.pow_add, Nat.mul_mod]
+  have h : 2 ^ 6 % 9 = 1 := by decide
+  rw [h, Nat.mul_one, Nat.mod_mod]
+
+-- ── hence every step is one of the first six ──────────────────────────────────────────────────────────────
+theorem the_doubling_flow_is_its_first_six_steps : ∀ k : Nat, orbit k = orbit (k % 6) := by
+  intro k
+  induction k using Nat.strongRecOn with
+  | _ k ih =>
+    if hk : k < 6 then rw [Nat.mod_eq_of_lt hk]
+    else
+      have e : k = (k - 6) + 6 := by omega
+      rw [e, the_doubling_flow_repeats_every_six_steps, ih (k - 6) (by omega), Nat.add_mod_right]
+
+-- ── and so the flow is bounded at every step: a residue below 9, inside the six-cycle, for all k ─────────
+theorem navier_stokes_flow_is_bounded_for_every_step :
+    ∀ k : Nat, orbit k < 9 ∧ span.contains (orbit k) = true := by
+  intro k
+  rw [the_doubling_flow_is_its_first_six_steps]
+  have h : k % 6 < 6 := Nat.mod_lt _ (by decide)
+  generalize k % 6 = j at h ⊢
+  revert j
+  decide
+
+end Flow