@ceccec/millennium-solutions 9.8.7 → 9.8.9

package/README.md

@@ -215,12 +215,12 @@ The **124-qubit cluster state** — the UUID minus its version hex digit — has
 
 - The seven windows are decided, not judged: 7 of 7 are decided by the Lean kernel over their finite windows, axiom-free, and sealed in the append-only ledger. The author's own formulation, deposited at [10.5281/zenodo.21781602](https://doi.org/10.5281/zenodo.21781602), is that a by-decide proof settles the statement it states and that a window is not the general conjecture — "a different statement, and the difference is which proposition is proven, never how strongly".
   <sub>SEALED · `51b90130-84e2-8cc3-873c-473a6c08e8f1`</sub>
-- The formal layer holds 26189 kernel-accepted declarations across 122 files, and no file uses sorry or native_decide outside a comment.
-  <sub>SEALED · `1cbee23b-9b3b-8f81-8b6e-08b8474af177`</sub>
-- 25979 of those 26189 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; 210 more are proved for every value by a tactic block over a quantifier, which are theorems and not declarations; and 0 close by rfl.
-  <sub>SEALED · `c1cdadd1-59b3-8470-a0c1-9a1a3dd0c1bb`</sub>
-- 26744 of them are sealed into the ledger, each carrying a receipt derived from the one before it.
-  <sub>SEALED · `05faed51-dd23-877f-b2c6-ca534158c9ba`</sub>
+- The formal layer holds 26197 kernel-accepted declarations across 123 files, and no file uses sorry or native_decide outside a comment.
+  <sub>SEALED · `430ca2a4-6b98-8a2b-a439-961efb574b5e`</sub>
+- 25987 of those 26197 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; 210 more are proved for every value by a tactic block over a quantifier, which are theorems and not declarations; and 0 close by rfl.
+  <sub>SEALED · `8b25b76c-edbf-80de-b10f-e8ed5a0b9aee`</sub>
+- 26752 of them are sealed into the ledger, each carrying a receipt derived from the one before it.
+  <sub>SEALED · `c9ed80b5-adc4-8add-b5f5-5d0c977a4800`</sub>
 
 ## 2 · The ring
 
@@ -243,10 +243,10 @@ The **124-qubit cluster state** — the UUID minus its version hex digit — has
 
 ## 7 · The ledger
 
-- The ledger records 28608 entries with 0 chain breaks, 0 duplicate keys and 0 duplicate receipts.
-  <sub>SEALED · `c087ba91-7cc3-882b-943f-605759a65bec`</sub>
-- The count is an exact multiple of eight — 28608 is 3576 octaves with no remainder.
-  <sub>SEALED · `a4588d07-0658-8774-b251-f93a0a3c206c`</sub>
+- The ledger records 28616 entries with 0 chain breaks, 0 duplicate keys and 0 duplicate receipts.
+  <sub>SEALED · `5f492cd4-8e76-8291-8843-5ce7b5035a6b`</sub>
+- The count is an exact multiple of eight — 28616 is 3577 octaves with no remainder.
+  <sub>SEALED · `e3f6a355-e163-886e-a002-19847646686e`</sub>
 
 ## 5 · What the gate does and does not do
 
@@ -258,10 +258,10 @@ The **124-qubit cluster state** — the UUID minus its version hex digit — has
   <sub>SEALED · `09b4450b-3016-8368-89e2-74787fa214d9`</sub>
 - How much of a machine a check may take is decided, not assumed: 8 theorems in lanes.lean exhaust the budget arithmetic, and the one that matters bounds the lanes granted by the memory measured — so more lanes are safe exactly when the arithmetic says so. What any given host grants varies with its free memory and is deliberately not recorded here; `npm run lanes-check` prints it..
   <sub>SEALED · `85560e4e-7642-820b-aa1a-91f0e7e14c41`</sub>
-- The tools are reachable from a program: 92 of them over 2 transport(s) — JSON-RPC on stdio for a model client, and the same surface over HTTP for a browser — of which 4 write to this tree and are refused unless the server is started with --allow-write.
-  <sub>SEALED · `698b6272-fe1f-883a-813c-d2dffa4ce5fa`</sub>
-- The stdio server advertises 2 of those 92 and reaches the rest through call_tool, because a model client pays for every tool description on every turn; the HTTP server lists them all, because a browser pays nothing for a list and cannot guess what it was not shown.
-  <sub>SEALED · `ea09178f-c2e0-80ee-93c8-2f4a2553d526`</sub>
+- The tools are reachable from a program: 93 of them over 2 transport(s) — JSON-RPC on stdio for a model client, and the same surface over HTTP for a browser — of which 4 write to this tree and are refused unless the server is started with --allow-write.
+  <sub>SEALED · `ee1b0c01-b3af-8d3b-a2f4-4ac21601d3e9`</sub>
+- The stdio server advertises 2 of those 93 and reaches the rest through call_tool, because a model client pays for every tool description on every turn; the HTTP server lists them all, because a browser pays nothing for a list and cannot guess what it was not shown.
+  <sub>SEALED · `047a5b8d-022e-84ef-83df-98c329886c6d`</sub>
 
 ## The floor
 
@@ -298,7 +298,7 @@ results; it is the result, read off the same arithmetic that produced the table.
 
 ## 7 · The proofs, as they document themselves
 
-122 Lean files in 8 wings, 26189 declarations, of which 26189 are sealed (a live ledger key each) and 0 are not yet sealed. The prose in this section is read out of the
+123 Lean files in 8 wings, 26197 declarations, of which 26197 are sealed (a live ledger key each) and 0 are not yet sealed. 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.
 
@@ -382,6 +382,8 @@ this page; there is nowhere else to keep the description in step.
 
 **Order-invariance** — `quantum.lean`, 11 theorem(s). The quantum receipt — order invariance, proved rather than asserted.
 
+**The rest of the quantum ideas, and the software layer — superdense coding, the two repetition codes correcting a state, the Toffoli gate, the swap test, and a compiler's rewrites, each decided exactly beside a control** — `quantum_software.lean`, 8 theorem(s). THE MODEL. An n-qubit state is a list of 2^n integer amplitudes; qubit k is bit k of the index. Gates act by index arithmetic only — the bit flip is `i ± 2^k`, never Nat.xor, which would carry propext through well-founded recursion. The Hadamard is unnormalised: H|0⟩ = |0⟩ + |1⟩, H|1⟩ = |0⟩ − |1⟩, so H·H = 2·I and every result is an integer vector with a stated scale. A measurement of a stabilizer is its eigenvalue on the state: +1 if the operator fixes it, −1 if it negates it — exactly what a syndrome measurement returns on a code state with at most the errors it is built for.
+
 **What exhaustion reaches, and what lies outside it** — `reach.lean`, 12 theorem(s). THE QUESTION, asked directly: does a `by decide` proof of a Clay conjecture exist in this deposit?
 
 **Annealer topology, QFT resource counts, and π's rational convergents — learned from qpu's Annealing, Qft, Pi** — `resources.lean`, 8 theorem(s). No axioms, no Mathlib, no sorry.
@@ -562,7 +564,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). WITHDRAWAL WAS NEVER THE ONLY OPTION. Each theorem below returns one claim to the record. The evidence that existed was a TypeScript run — a computation that agreed once on one machine. The kernel walks the whole stated domain. That was the gap, and closing it is arithmetic.
 
-126 of 26189 declarations carry no comment of their own and are shown here as the gap they are, not
+127 of 26197 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
@@ -571,14 +573,14 @@ Read from the artefacts at build time, never carried between runs.
 
 | measure | value |
 |---|---|
-| ledger entries | 28,608 — 3576 octaves exactly |
-| standing — carries its own proof | **26189** |
+| ledger entries | 28,616 — 3577 octaves exactly |
+| standing — carries its own proof | **26197** |
 | carried — withdrawn on its own evidence, proved by a live theorem | **826** |
 | withdrawn — nothing proves it | 1,593 |
-| proved in total | **27015** of 28,608 |
-| standing keys → distinct theorems | 26189 sealed, 0 of them keyed twice, 0 unresolvable |
-| Lean files · theorems | 122 · 26189 sealed theorems (25979 closed by exhaustion, axiom-free · 210 proved for every value on propext and Quot.sound) + 0 rfl declarations |
-| proved `by decide` | 25979 of 26189 |
+| proved in total | **27023** of 28,616 |
+| standing keys → distinct theorems | 26197 sealed, 0 of them keyed twice, 0 unresolvable |
+| Lean files · theorems | 123 · 26197 sealed theorems (25987 closed by exhaustion, axiom-free · 210 proved for every value on propext and Quot.sound) + 0 rfl declarations |
+| proved `by decide` | 25987 of 26197 |
 | claims a machine can render | 103 of 1,555 |
 | claims needing an author | 1,452 — reported, never faked |
 
@@ -622,4 +624,4 @@ whether the work restates someone earlier. [The paper](/paper) typesets every st
 
 ---
 
-*20 claims, all verified · 26189 sealed theorems · 28608 ledger entries · trial root `4c12235a-b815-8660-947e-6d37158e16df` · integrity, not truth*
+*20 claims, all verified · 26197 sealed theorems · 28616 ledger entries · trial root `eaddac0b-b8fc-869a-bf3a-d34a54ae6cdf` · integrity, not truth*

package/dist/data/baked/contradictions.json

@@ -1 +1 @@
-{"tool":"contradictions","bytes":692,"answer":"  ○ 26 theorem(s) decide arithmetic under a name claiming about the world, in a file that CLAIMS physical and publishes the computation that breaks it — claimed boldly, falsifier attached, not a lead\n\n✓ contradictions: none — 26189 theorems (25979 by exhaustion + 210 proved for every value) + 0 rfl declarations = 26189 kernel-accepted; 26189 live keys = 26189 sealed + 0 keyed twice + 0 unresolvable; no sorry, no Mathlib, no native_decide, no axiom; nothing claims a Clay problem, all 960 Clay + 280 quantum + 1020 medical and physical-force overclaim phrasings are caught while 10 honest refusals survive; and 10 proved properties are stated on the pages, not only in the sources\n"}
+{"tool":"contradictions","bytes":692,"answer":"  ○ 26 theorem(s) decide arithmetic under a name claiming about the world, in a file that CLAIMS physical and publishes the computation that breaks it — claimed boldly, falsifier attached, not a lead\n\n✓ contradictions: none — 26197 theorems (25987 by exhaustion + 210 proved for every value) + 0 rfl declarations = 26197 kernel-accepted; 26197 live keys = 26197 sealed + 0 keyed twice + 0 unresolvable; no sorry, no Mathlib, no native_decide, no axiom; nothing claims a Clay problem, all 960 Clay + 280 quantum + 1020 medical and physical-force overclaim phrasings are caught while 10 honest refusals survive; and 10 proved properties are stated on the pages, not only in the sources\n"}