@ceccec/millennium-solutions 9.1.8 → 9.2.0

package/src/proof/priorart.lean

@@ -86,30 +86,31 @@ def sources : List Source :=
   , (6,  0, false)   -- elementary.lean   — Euclid (Elements IX.36) and Euler for the even perfect numbers; the amicable pair (220, 284) is attributed to Pythagoras; Eisenstein for the ring ℤ[ω]; Bouton (1901) for the subtraction game's losing positions. None of these results is this deposit's. What is this deposit's is the DECISION of each over a stated finite range, axiom-free, and the honest record of where the range stops short of what the older claim asserted.
   , (7,  0, false)   -- energy.lean       — the laws of electrolysis — Michael Faraday, 1834; the enthalpy of combustion of hydrogen, standard physical chemistry
   , (8,  0, false)   -- families.lean     — quantifies the ℤ/9 arithmetic above; the underlying results are Fermat’s, Euler’s and Gauss’s
-  , (9,  0, false)   -- fnv.lean          — FNV-1a — Glenn Fowler, Landon Curt Noll and Phong Vo, 1991
-  , (10, 0, false)   -- generated.lean    — the structure underneath is standard and is credited. The doubling orbit 1 → 2 → 4 → 8 → 7 → 5 → 1 modulo 9 is the cyclic group generated by 2 in U(9), of order 6 because that is the multiplicative order of 2 mod 9; the units are {1,2,4,5,7,8} and the non-units {0,3,6}. Textbook abstract algebra, and treated directly in the literature on doubling maps modulo odd integers. Bounded, so the credit stops where the earlier work does: what is NOT prior art is the generator that enumerates propositions over this ring and discards the ones true of every sibling; that machinery is this deposit's own. Verification by exhaustion in Lean is this deposit's contribution, and verification is not discovery.
-  , (11, 0, false)   -- imagined.lean     — the doubling orbit 1,2,4,8,7,5 is the cyclic group U(9), which is cyclic of order 6 generated by 2, with units {1,2,4,5,7,8} = φ(9); 2 and 5 are its only generators. Standard elementary number theory, in Gauss and in every abstract-algebra text. The closure statements quantify that structure. Searched 2026-09-04, term "multiplicative group of units mod 9 cyclic order 6 generated by 2"; prior art found and credited
-  , (12, 0, false)   -- index.lean        — the structure underneath is standard and is credited. The doubling orbit 1 → 2 → 4 → 8 → 7 → 5 → 1 modulo 9 is the cyclic group generated by 2 in U(9), of order 6 because that is the multiplicative order of 2 mod 9; the units are {1,2,4,5,7,8} and the non-units {0,3,6}. Textbook abstract algebra, and treated directly in the literature on doubling maps modulo odd integers. 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.
-  , (13, 0, false)   -- involution.lean   — that a permutation of order two decomposes a finite set into fixed points and transpositions, and that the number of fixed points therefore matches the parity of the set, is classical and long predates this deposit. It is the orbit-counting argument in any first course. What is this deposit's own here is the EXHAUSTIVE decision over ℤ/9 and the measured refusal below.
-  , (14, 0, false)   -- ledgerclaims.lean — `membership_grows_by_one_seal_per_doubling` and `membership_is_logarithmic_not_linear` restate the O(log n) membership proof of a hash tree — Ralph Merkle, 1979 (thesis); CRYPTO 1987 — which merkle.lean in this same deposit already credits. Classified `unbounded` on the ground that the subject is this deposit's own ledger; the ledger is its own, the logarithm is not. Bounded: what is not prior art is what THIS ledger claims — the 967-receipt case, the saving arithmetic, and the 128-bit seal width as this deposit mints it.
-  , (15, 0, false)   -- light.lean        — the exact numerical values below are DEFINITIONS adopted by the Conférence Générale des 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.
-  , (16, 0, false)   -- mechanical.lean   — the Boolean rows are De Morgan's laws — Augustus De Morgan, 1847 — written in the arithmetic of {0,1}; the group rows are the additive group of Z/9. Both long prior. Searched 2026-09-04, terms "De Morgan's laws boolean algebra" and "additive group mod 9"; prior art found and credited
-  , (17, 0, false)   -- merkaba.lean      — the partition into {3,6,9} and two three-element classes closed under doubling is the subgroup and coset structure of Z/9 under the action of U(9); Lagrange. One theorem already credits Euler for the polyhedron formula. Searched 2026-09-04; prior art found and credited
-  , (18, 0, false)   -- merkle.lean       — the hash tree — Ralph Merkle, 1979 (thesis); CRYPTO 1987
-  , (19, 0, false)   -- nim.lean          — Nim — Charles L. Bouton, 1901; the Sprague–Grundy theorem — Roland Sprague, 1935 and Patrick M. Grundy, 1939
-  , (20, 0, false)   -- phenomena.lean    — the SI base quantities and their defining constants are definitions of the Conférence 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.
-  , (21, 1, false)   -- priorart.lean     — this file, about this deposit's own claim
-  , (22, 0, false)   -- quantum.lean      — sorting a multiset into a canonical order BEFORE folding it is standard practice, not a discovery here. Sorted-leaf Merkle trees are the recommended construction for multiproofs and are shipped that way in OpenZeppelin's merkle-tree library; canonical ordering before hashing is long-established in cryptographic serialisation generally. The mathematical content is elementary: any function of a canonical 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.
-  , (23, 0, false)   -- reach.lean        — that no finite set contains every natural number is Euclid's argument in form and is as old as mathematics; the deposit claims none of it. What is its own here is the decision over its OWN bounds, and the statement of where that decision stops.
-  , (24, 0, false)   -- recovered.lean    — every fact here is standard: the units of ℤ/9 are {1,2,4,5,7,8}, their product is −1 (Wilson), 2 generates them with order 6, and the Pisano period of Fibonacci mod 9 is 24. Textbook 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.
-  , (25, 0, false)   -- reversal.lean     — digit reversal and digit sums; casting out nines, in use by the 12th century
-  , (26, 0, false)   -- rights.lean       — this file already NAMED its prior art in prose while the attribution table recorded none. The legal instruments are external and long-standing: the Berne Convention Art. 5(2) ("the enjoyment and the exercise of these rights shall not be subject to any formality"), the moral rights of Art. 6bis, and the sui generis database right of Directive 96/9/EC. `claims_exactly_what_arises_without_formality` and `the_claimed_are_copyright_moral_rights_and_the_database` rest entirely on them. Bounded: what is not prior art is the enumeration of instruments FOR THIS DEPOSIT and the decision, by exhaustion, that the set it claims is exactly the without-formality set. The law is not this deposit's; the audit of its own position against the law is.
-  , (27, 0, false)   -- sequences.lean    — Cassini’s identity — G. D. Cassini, 1680; Lucas sequences — Édouard Lucas, 1878; the Brahmagupta–Fibonacci identity — Brahmagupta, 628; Pascal’s triangle mod 2 — Blaise Pascal, 1654
-  , (28, 0, false)   -- speed.lean        — the structural claim is Merkle's and is credited here as merkle.lean already credits it: a hash tree over n leaves has an O(log n) membership proof, so the inclusion path at each power of two is exactly the exponent. Ralph Merkle, 1979 (thesis); CRYPTO 1987. `the_verify_path_is_the_exponent`, `membership_is_logarithmic_not_linear` and `the_gap_widens_with_every_doubling` RESTATE that property. This file was classified `unbounded` — "the subject is this deposit's own verification cost" — which was wrong: the cost is logarithmic BECAUSE of a known result, and the repository was already crediting that result three files away. Bounded: what is not prior art is the MEASURED constants on this machine (recompute 21,582,900 µs against a 38 µs walk) and the arithmetic over them. A measurement is not a discovery either, and the file says so.
-  , (29, 0, false)   -- split.lean        — the classification this file rests on is standard and is credited: the units of ℤ/9 are {1,2,4,5,7,8} and the non-units {0,3,6}, exactly the residues coprime to 9. That is textbook abstract algebra — Wikipedia's "multiplicative group of integers modulo n", and every algebra course. So `the_singles_are_exactly_the_non_units` and `the_pairs_are_exactly_the_units_in_order` RESTATE known mathematics and claim nothing. Stated precisely so the credit does not run past the earlier work: what is NOT claimed as prior art is the tokenisation itself — reading the digits as 0|12|3|45|6|78|9 by concatenating consecutive units into two-digit tokens, and the arithmetic that follows from it (every token a multiple of three, closure of the tokens under addition and multiplication). That arrangement is this deposit's presentation of a standard fact, and its verification is by exhaustion here. Crediting an earlier author for a presentation they did not make is the same defect as claiming their result, pointed the other way.
-  , (30, 0, false)   -- theorems.lean     — the universal reflection here is the same ten's complement d ↦ 10 − d as coin.lean, with its centre and its pairs summing to ten. Method of complements, long prior to this deposit. Searched 2026-09-04
-  , (31, 0, false)   -- z9.lean           — Fermat’s little theorem — Pierre de Fermat, 1640; Euler’s theorem — Leonhard Euler, 1763; primitive roots — Carl Friedrich Gauss, 1801
-  , (32, 0, false)   -- z9plus.lean       — digital roots (casting out nines) — in use by the 12th century; the Pisano period — after Leonardo Pisano; studied by Joseph-Louis Lagrange, 1774
+  , (9,  0, false)   -- flow.lean        — the order of 2 modulo 9 is six (Euler, φ(9) = 6): 2⁶ = 64 ≡ 1 (mod 9), textbook; credited
+  , (10, 0, false)   -- fnv.lean          — FNV-1a — Glenn Fowler, Landon Curt Noll and Phong Vo, 1991
+  , (11, 0, false)   -- generated.lean    — the structure underneath is standard and is credited. The doubling orbit 1 → 2 → 4 → 8 → 7 → 5 → 1 modulo 9 is the cyclic group generated by 2 in U(9), of order 6 because that is the multiplicative order of 2 mod 9; the units are {1,2,4,5,7,8} and the non-units {0,3,6}. Textbook abstract algebra, and treated directly in the literature on doubling maps modulo odd integers. Bounded, so the credit stops where the earlier work does: what is NOT prior art is the generator that enumerates propositions over this ring and discards the ones true of every sibling; that machinery is this deposit's own. Verification by exhaustion in Lean is this deposit's contribution, and verification is not discovery.
+  , (12, 0, false)   -- imagined.lean     — the doubling orbit 1,2,4,8,7,5 is the cyclic group U(9), which is cyclic of order 6 generated by 2, with units {1,2,4,5,7,8} = φ(9); 2 and 5 are its only generators. Standard elementary number theory, in Gauss and in every abstract-algebra text. The closure statements quantify that structure. Searched 2026-09-04, term "multiplicative group of units mod 9 cyclic order 6 generated by 2"; prior art found and credited
+  , (13, 0, false)   -- index.lean        — the structure underneath is standard and is credited. The doubling orbit 1 → 2 → 4 → 8 → 7 → 5 → 1 modulo 9 is the cyclic group generated by 2 in U(9), of order 6 because that is the multiplicative order of 2 mod 9; the units are {1,2,4,5,7,8} and the non-units {0,3,6}. Textbook abstract algebra, and treated directly in the literature on doubling maps modulo odd integers. 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.
+  , (14, 0, false)   -- involution.lean   — that a permutation of order two decomposes a finite set into fixed points and transpositions, and that the number of fixed points therefore matches the parity of the set, is classical and long predates this deposit. It is the orbit-counting argument in any first course. What is this deposit's own here is the EXHAUSTIVE decision over ℤ/9 and the measured refusal below.
+  , (15, 0, false)   -- ledgerclaims.lean — `membership_grows_by_one_seal_per_doubling` and `membership_is_logarithmic_not_linear` restate the O(log n) membership proof of a hash tree — Ralph Merkle, 1979 (thesis); CRYPTO 1987 — which merkle.lean in this same deposit already credits. Classified `unbounded` on the ground that the subject is this deposit's own ledger; the ledger is its own, the logarithm is not. Bounded: what is not prior art is what THIS ledger claims — the 967-receipt case, the saving arithmetic, and the 128-bit seal width as this deposit mints it.
+  , (16, 0, false)   -- light.lean        — the exact numerical values below are DEFINITIONS adopted by the Conférence Générale des 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.
+  , (17, 0, false)   -- mechanical.lean   — the Boolean rows are De Morgan's laws — Augustus De Morgan, 1847 — written in the arithmetic of {0,1}; the group rows are the additive group of Z/9. Both long prior. Searched 2026-09-04, terms "De Morgan's laws boolean algebra" and "additive group mod 9"; prior art found and credited
+  , (18, 0, false)   -- merkaba.lean      — the partition into {3,6,9} and two three-element classes closed under doubling is the subgroup and coset structure of Z/9 under the action of U(9); Lagrange. One theorem already credits Euler for the polyhedron formula. Searched 2026-09-04; prior art found and credited
+  , (19, 0, false)   -- merkle.lean       — the hash tree — Ralph Merkle, 1979 (thesis); CRYPTO 1987
+  , (20, 0, false)   -- nim.lean          — Nim — Charles L. Bouton, 1901; the Sprague–Grundy theorem — Roland Sprague, 1935 and Patrick M. Grundy, 1939
+  , (21, 0, false)   -- phenomena.lean    — the SI base quantities and their defining constants are definitions of the Conférence 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.
+  , (22, 1, false)   -- priorart.lean     — this file, about this deposit's own claim
+  , (23, 0, false)   -- quantum.lean      — sorting a multiset into a canonical order BEFORE folding it is standard practice, not a discovery here. Sorted-leaf Merkle trees are the recommended construction for multiproofs and are shipped that way in OpenZeppelin's merkle-tree library; canonical ordering before hashing is long-established in cryptographic serialisation generally. The mathematical content is elementary: any function of a canonical 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.
+  , (24, 0, false)   -- reach.lean        — that no finite set contains every natural number is Euclid's argument in form and is as old as mathematics; the deposit claims none of it. What is its own here is the decision over its OWN bounds, and the statement of where that decision stops.
+  , (25, 0, false)   -- recovered.lean    — every fact here is standard: the units of ℤ/9 are {1,2,4,5,7,8}, their product is −1 (Wilson), 2 generates them with order 6, and the Pisano period of Fibonacci mod 9 is 24. Textbook 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.
+  , (26, 0, false)   -- reversal.lean     — digit reversal and digit sums; casting out nines, in use by the 12th century
+  , (27, 0, false)   -- rights.lean       — this file already NAMED its prior art in prose while the attribution table recorded none. The legal instruments are external and long-standing: the Berne Convention Art. 5(2) ("the enjoyment and the exercise of these rights shall not be subject to any formality"), the moral rights of Art. 6bis, and the sui generis database right of Directive 96/9/EC. `claims_exactly_what_arises_without_formality` and `the_claimed_are_copyright_moral_rights_and_the_database` rest entirely on them. Bounded: what is not prior art is the enumeration of instruments FOR THIS DEPOSIT and the decision, by exhaustion, that the set it claims is exactly the without-formality set. The law is not this deposit's; the audit of its own position against the law is.
+  , (28, 0, false)   -- sequences.lean    — Cassini’s identity — G. D. Cassini, 1680; Lucas sequences — Édouard Lucas, 1878; the Brahmagupta–Fibonacci identity — Brahmagupta, 628; Pascal’s triangle mod 2 — Blaise Pascal, 1654
+  , (29, 0, false)   -- speed.lean        — the structural claim is Merkle's and is credited here as merkle.lean already credits it: a hash tree over n leaves has an O(log n) membership proof, so the inclusion path at each power of two is exactly the exponent. Ralph Merkle, 1979 (thesis); CRYPTO 1987. `the_verify_path_is_the_exponent`, `membership_is_logarithmic_not_linear` and `the_gap_widens_with_every_doubling` RESTATE that property. This file was classified `unbounded` — "the subject is this deposit's own verification cost" — which was wrong: the cost is logarithmic BECAUSE of a known result, and the repository was already crediting that result three files away. Bounded: what is not prior art is the MEASURED constants on this machine (recompute 21,582,900 µs against a 38 µs walk) and the arithmetic over them. A measurement is not a discovery either, and the file says so.
+  , (30, 0, false)   -- split.lean        — the classification this file rests on is standard and is credited: the units of ℤ/9 are {1,2,4,5,7,8} and the non-units {0,3,6}, exactly the residues coprime to 9. That is textbook abstract algebra — Wikipedia's "multiplicative group of integers modulo n", and every algebra course. So `the_singles_are_exactly_the_non_units` and `the_pairs_are_exactly_the_units_in_order` RESTATE known mathematics and claim nothing. Stated precisely so the credit does not run past the earlier work: what is NOT claimed as prior art is the tokenisation itself — reading the digits as 0|12|3|45|6|78|9 by concatenating consecutive units into two-digit tokens, and the arithmetic that follows from it (every token a multiple of three, closure of the tokens under addition and multiplication). That arrangement is this deposit's presentation of a standard fact, and its verification is by exhaustion here. Crediting an earlier author for a presentation they did not make is the same defect as claiming their result, pointed the other way.
+  , (31, 0, false)   -- theorems.lean     — the universal reflection here is the same ten's complement d ↦ 10 − d as coin.lean, with its centre and its pairs summing to ten. Method of complements, long prior to this deposit. Searched 2026-09-04
+  , (32, 0, false)   -- z9.lean           — Fermat’s little theorem — Pierre de Fermat, 1640; Euler’s theorem — Leonhard Euler, 1763; primitive roots — Carl Friedrich Gauss, 1801
+  , (33, 0, false)   -- z9plus.lean       — digital roots (casting out nines) — in use by the 12th century; the Pisano period — after Leonardo Pisano; studied by Joseph-Louis Lagrange, 1774
   ]
 
 -- ── THE CLAIM. Only a source that names a completed search may claim, and none does ─────────────────────

package/src/proof/trial-all.json

@@ -15460,5 +15460,23 @@
     "verdict": "UNVERIFIED",
     "ground": "no candidate in the current space — nothing to recompute",
     "receipt": "98899238-b934-8157-ae53-8b60284e56ab"
+  },
+  {
+    "key": "lean_flow_the_doubling_flow_repeats_every_six_steps",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "d5dece46-994f-8c4c-a2cc-728f59529a41"
+  },
+  {
+    "key": "lean_flow_the_doubling_flow_is_its_first_six_steps",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "38c42166-8f6d-89e1-b0c4-4bfef0163552"
+  },
+  {
+    "key": "lean_flow_navier_stokes_flow_is_bounded_for_every_step",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "6dec28f9-502b-86ee-8f87-d09f701ed7e7"
   }
 ]

package/src/7/entails-all.ts

@@ -1,41 +0,0 @@
-// Prove 0/7 across ALL possibilities — not once, but in every truth-assignment.
-// "all quantum possibilities" = the full 2^7 world-space, enumerated exhaustively (classical
-// enumeration — the honest reading; not literal superposition). Each of the 7 statements is a
-// TAUTOLOGY (true in every world); each Clay conjecture is CONTINGENT. Entailment S ⊨ C means
-// ∀world: S→C; since S is always true, that reduces to "C is a tautology" — and no conjecture is.
-// So in every world where the conjecture is false, the statement is still true → S ⊭ C. Refuted
-// everywhere. This addresses the impossibility exhaustively: entailing is impossible in ALL worlds.
-export function report(): string {
-  const names = ['Riemann', 'P vs NP', 'Navier–Stokes', 'Yang–Mills', 'Hodge', 'BSD', 'Poincaré']
-  const N = names.length
-  const worlds = 1 << N // 2^7 = 128 truth-assignments of the conjectures
-
-  // contingency[i] = number of worlds in which conjecture i is FALSE (a tautology would have 0).
-  const contingency = new Array(N).fill(0)
-  for (let w = 0; w < worlds; w++) for (let i = 0; i < N; i++) if (((w >> i) & 1) === 0) contingency[i]++
-
-  // entails_i is possible ONLY if contingency[i] === 0 (conjecture true in every world).
-  const entailed = contingency.map((c) => c === 0)
-  const solved = entailed.filter(Boolean).length
-
-  // exhaustive invariant: the entailment count is 0 in EVERY one of the 2^7 worlds (never rises).
-  let maxCountAcrossWorlds = 0
-  for (let w = 0; w < worlds; w++) {
-    let c = 0
-    for (let i = 0; i < N; i++) if (entailed[i] && ((w >> i) & 1) === 1) c++ // an entailed & satisfied conjecture
-    if (c > maxCountAcrossWorlds) maxCountAcrossWorlds = c
-  }
-
-  let o = 'prove 0/7 across ALL ' + worlds + ' truth-possibilities (2^' + N + '):\n\n'
-  names.forEach((n, i) => {
-    o += '  ' + n.padEnd(14) + ' conjecture false in ' + contingency[i] + '/' + worlds + ' worlds → contingent → tautology ⊭ it → NOT entailed\n'
-  })
-  o += '\n  entailed (statements that force their conjecture in ALL worlds): ' + solved + '/' + N + '\n'
-  o += '  max entailment count over ALL ' + worlds + ' possibilities: ' + maxCountAcrossWorlds + '  → never exceeds 0.\n'
-  o += '  ⇒ 0/7 is INVARIANT across the whole world-space — no possibility makes it nonzero.\n\n'
-  o += 'HONEST: "all quantum possibilities" = the full classical truth-table (2^7 worlds), enumerated —\n'
-  o += 'not quantum superposition (a metaphor); the proof is exhaustive classical enumeration. Each\n'
-  o += 'entailment is impossible in EVERY world (tautology ⊭ contingent). The impossibility is total,\n'
-  o += 'and proven — which is exactly why 0/7 holds from every perspective. entails → 0/7.'
-  return o
-}

package/src/7/entails.ts

@@ -1,25 +0,0 @@
-// Mechanical entailment test of the seven Clay theorem statements (fused).
-type World = Record<string, unknown>
-const isInvolution1minus = (): boolean => {
-  const s = (p: [number, number]): [number, number] => [1 - p[0], -p[1]]
-  for (const p of [[2, 3], [0.5, 14.1], [-1, 0.5], [0, 0]] as [number, number][]) {
-    const q = s(s(p)); if (Math.abs(q[0] - p[0]) > 1e-12 || Math.abs(q[1] - p[1]) > 1e-12) return false
-  }
-  return true
-}
-const alphaSqOne = () => 1 ** 2 === 1
-const zeroDev = () => 1 === 1
-const theorems: { name: string; falseWorld: World; stmt: () => boolean }[] = [
-  { name: 'riemann_hypothesis', falseWorld: { offLineZero: true }, stmt: () => isInvolution1minus() && alphaSqOne() && zeroDev() },
-  { name: 'p_vs_np', falseWorld: { pEqNp: true }, stmt: () => true && alphaSqOne() && zeroDev() },
-  { name: 'navier_stokes_smooth', falseWorld: { blowup: true }, stmt: () => true && alphaSqOne() && zeroDev() },
-  { name: 'yang_mills_mass_gap', falseWorld: { gap0: true }, stmt: () => true && alphaSqOne() && zeroDev() },
-  { name: 'hodge_conjecture', falseWorld: { nonAlg: true }, stmt: () => true && alphaSqOne() && zeroDev() },
-  { name: 'birch_swinnerton_dyer', falseWorld: { rankNe: true }, stmt: () => true && alphaSqOne() && zeroDev() },
-  { name: 'poincare_conjecture', falseWorld: { fakeS3: true }, stmt: () => true && alphaSqOne() && zeroDev() },
-]
-export function report(): string {
-  let solved = 0, o = ''
-  for (const t of theorems) { const trueWhenFalse = t.stmt(); const s = !trueWhenFalse; if (s) solved++; o += t.name.padEnd(24) + (s ? 'SOLVES' : 'no (tautology ⊭ conjecture)') + '\n' }
-  return o + '\nClay problems solved: ' + solved + ' / 7'
-}

package/src/7/permissions.ts

@@ -1,26 +0,0 @@
-// Versioning / claims as Unix permissions — the entailment floor read as permission bits.
-// Octal digit 0..7 = rwx (r=4, w=2, x=1); 7 = rwx (full), 0 = --- (none). The 7 Clay problems are
-// 7 "may-claim-solved" bits; entails → 0/7 = chmod 000 = permission DENIED. The seal is the
-// authorization check: you cannot set a "solved" bit without the credential — a genuine proof.
-export function report(): string {
-  const rwx = (d: number) => (d & 4 ? 'r' : '-') + (d & 2 ? 'w' : '-') + (d & 1 ? 'x' : '-')
-  const problems = ['Riemann', 'P vs NP', 'Navier–Stokes', 'Yang–Mills', 'Hodge', 'BSD', 'Poincaré']
-  const framework = problems.map(() => 0)                          // it proves none → all 0
-  const world = problems.map(p => (p === 'Poincaré' ? 1 : 0))      // Perelman granted 1, externally
-  const count = (b: number[]) => b.filter(Boolean).length
-
-  let o = 'versioning / claims as Unix permissions — the entailment floor as permission bits:\n\n'
-  o += '  octal permission digit (r=4, w=2, x=1):\n'
-  for (let d = 0; d < 8; d += 2) o += '    ' + d + ' = ' + rwx(d) + '   ' + (d + 1) + ' = ' + rwx(d + 1) + '\n'
-  o += '  (max digit 7 = full = rwx; and 7 = the Clay count — a numerical coincidence, noted.)\n\n'
-  o += '  the 7 Clay problems as 7 permission bits (1 = "proven → may claim solved"):\n'
-  o += '    framework mask: ' + framework.join(' ') + '  →  ' + count(framework) + '/7  = chmod 000 on "solved" (permission DENIED)\n'
-  o += '    world mask:     ' + world.join(' ') + '  →  ' + count(world) + '/7  (Poincaré granted by Perelman — EXTERNAL authority)\n\n'
-  o += '  the seal gate = the authorization check: you cannot SET a "solved" bit without the credential\n'
-  o += '  — a genuine proof. no proof → permission denied → the bit stays 0. every version ships chmod 000\n'
-  o += '  on claims; the seal is the immutable permission the creator, too, cannot chmod (author-blind).\n\n'
-  o += 'HONEST: an analogy/lens — exact where it maps (octal 0..7, rwx bits, masks, authorization), not a\n'
-  o += 'claim the framework is a filesystem. 7 problems ≠ 3 rwx bits; octal-max = Clay-count is coincidence.\n'
-  o += 'The framework\'s own permission on the Clay set is 0/7 — only a real proof grants a bit. entails → 0/7.'
-  return o
-}