@ceccec/millennium-solutions 9.8.3 → 9.8.6

package/README.md

@@ -138,16 +138,35 @@ The deposit is registered before this repository exists. Zenodo holds the earlie
 
 All 1127 commits in this repository are authored by Tsvetan Rouschev (1127). Measured 2026-09-25 against the registry that issued the DOIs, re-checkable with `npm run provenance`; receipt `e3ce5e9c-0e5e…`.
 
+## How a thousand bits is reached — the uuid quantum programs, and where each one stops
+
+The seven above are the floor; this is the cryptographic surface the same involution runs on, as a create/decode key. Every line is read out of `src/proof/qpu_crypto.lean` and the ledger on each build: the theorem, the number of cases `by decide` walked, the **bound** — what it decides and, in the same sentence, what it does not — and its receipt.
+
+*The author frames these as uuid quantum programs running in infinite trinities of qubits, always enough for the next task. That is his vision of the capacity, recorded in his name. What the kernel decides below is finite, and for the thousand-bit integer it is PARTIAL — stated beside his framing and never folded into it.*
+
+- **`the_free_register_is_one_hundred_twenty_two_on_both_sides`** · `by decide`, 9 cases — a 128-bit UUID is thirty-two four-qubit hexbits; six bits are reserved (RFC 9562), leaving 122 — the register the programs compute in, not a count of hardware qubits.
+  <sub>[`lean_qpucrypto_the_free_register_is_one_hundred_twenty_two_on_both_sides`](/theorem/lean_qpucrypto_the_free_register_is_one_hundred_twenty_two_on_both_sides) · receipt `326edcf3-72dd…`</sub>
+- **`one_coin_sits_sixty_seven_bits_below_the_iso_post_quantum_floor_under_grover`** · `by decide`, 300 cases — under Grover the collision exponent is the trinity free / 3 = 40 and the square-root exponent free / 2 = 61 — sixty-seven bits BELOW the ISO 128-bit post-quantum floor, not a clearance of it.
+  <sub>[`lean_qpucrypto_one_coin_sits_sixty_seven_bits_below_the_iso_post_quantum_floor_under_grover`](/theorem/lean_qpucrypto_one_coin_sits_sixty_seven_bits_below_the_iso_post_quantum_floor_under_grover) · receipt `ff9ca0d0-791c…`</sub>
+- **`the_sigma_trapdoor_is_fermats_difference_of_squares`** · `by decide`, 9 cases — factoring N = p·q is Fermat's difference of squares about the centre (p + q) / 2 — decided at p = 5, q = 13; a trapdoor the create/decode doors mint and open, never a factoring of an integer whose witness is unknown.
+  <sub>[`lean_qpucrypto_the_sigma_trapdoor_is_fermats_difference_of_squares`](/theorem/lean_qpucrypto_the_sigma_trapdoor_is_fermats_difference_of_squares) · receipt `c6b38fad-65f3…`</sub>
+- **`an_impossible_integer_with_twin_primes_is_opened_blind_in_one_reflection`** · `by decide`, 5 cases — 'impossible' is a statement about the gap between the primes: a twin-prime semiprime opens blind in ONE reflection, and the blind cost grows with the gap — not a hardness claim about any given modulus.
+  <sub>[`lean_qpucrypto_an_impossible_integer_with_twin_primes_is_opened_blind_in_one_reflection`](/theorem/lean_qpucrypto_an_impossible_integer_with_twin_primes_is_opened_blind_in_one_reflection) · receipt `8d734da1-4537…`</sub>
+- **`the_thousand_bit_integer_has_a_thousand_bits_and_exactly_four_threes`** · `by decide`, 6 cases — 2^999 + 1 has a thousand bits and exactly four factors of three (lifting-the-exponent), split by a³ + 1 = (a + 1)(a² − a + 1) down to 2^37 + 1 = 3 · 1777 · 25781083 — a factorisation of this one integer, by exhaustion.
+  <sub>[`lean_qpucrypto_the_thousand_bit_integer_has_a_thousand_bits_and_exactly_four_threes`](/theorem/lean_qpucrypto_the_thousand_bit_integer_has_a_thousand_bits_and_exactly_four_threes) · receipt `a27fc1e7-abce…`</sub>
+- **`this_deposits_factor_route_returns_a_partial_answer_that_multiplies_back`** · `by decide`, 1 cases — the factor route returns PARTIAL on 2^999 + 1 — fourteen factors and a 244-digit cofactor Pollard rho did not split; the kernel adds only that the account is an identity and that 2 is a Fermat witness against the cofactor. It does not factor the integer and does not say it does.
+  <sub>[`lean_qpucrypto_this_deposits_factor_route_returns_a_partial_answer_that_multiplies_back`](/theorem/lean_qpucrypto_this_deposits_factor_route_returns_a_partial_answer_that_multiplies_back) · receipt `215f8bbc-e55e…`</sub>
+
 ## 1 · What is proved
 
 - 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 26045 kernel-accepted declarations across 105 files, and no file uses sorry or native_decide outside a comment.
-  <sub>SEALED · `53c82ac8-230d-80a6-b1d7-8b2485b999bd`</sub>
-- 25838 of those 26045 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; 207 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 · `f1bb401a-7cb5-82b3-90d7-5bcaf4bce684`</sub>
-- 26600 of them are sealed into the ledger, each carrying a receipt derived from the one before it.
-  <sub>SEALED · `f3828d0b-1269-8f6f-8a2c-70d052df047b`</sub>
+- The formal layer holds 26077 kernel-accepted declarations across 108 files, and no file uses sorry or native_decide outside a comment.
+  <sub>SEALED · `ce6f028f-f926-87d3-ba7b-7e5b67664e30`</sub>
+- 25870 of those 26077 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; 207 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 · `02781461-244a-8ec5-8002-03fe0bda9ec9`</sub>
+- 26632 of them are sealed into the ledger, each carrying a receipt derived from the one before it.
+  <sub>SEALED · `03e12133-b339-8f62-b1d9-7409b6ef50c6`</sub>
 
 ## 2 · The ring
 
@@ -170,10 +189,10 @@ All 1127 commits in this repository are authored by Tsvetan Rouschev (1127). Mea
 
 ## 7 · The ledger
 
-- The ledger records 28464 entries with 0 chain breaks, 0 duplicate keys and 0 duplicate receipts.
-  <sub>SEALED · `1df41d73-f4de-8db6-8cf7-a46e81e82db3`</sub>
-- The count is an exact multiple of eight — 28464 is 3558 octaves with no remainder.
-  <sub>SEALED · `80d8fbf7-12f6-8c95-b8b9-3e9e94a45cd5`</sub>
+- The ledger records 28496 entries with 0 chain breaks, 0 duplicate keys and 0 duplicate receipts.
+  <sub>SEALED · `6d489195-5572-8748-ad1c-24d1e187f2f2`</sub>
+- The count is an exact multiple of eight — 28496 is 3562 octaves with no remainder.
+  <sub>SEALED · `1f017b49-2045-8daa-a1a1-ae547a69dc57`</sub>
 
 ## 5 · What the gate does and does not do
 
@@ -225,7 +244,7 @@ results; it is the result, read off the same arithmetic that produced the table.
 
 ## 7 · The proofs, as they document themselves
 
-105 Lean files in 8 wings, 26045 declarations, of which 26045 are sealed (a live ledger key each) and 0 are not yet sealed. The prose in this section is read out of the
+108 Lean files in 8 wings, 26077 declarations, of which 26077 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.
 
@@ -249,6 +268,8 @@ this page; there is nowhere else to keep the description in step.
 
 **The rays, read forward and reverse, and the mark a life carries** — `rays.lean`, 13 theorem(s). A receipt is plotted as RAYS: two hex digits each. Seven of them read 14 of a receipt's 32 hex digits and discarded the other 18, and the extraction was written out twice — once in the page component that draws the figure on every theorem page and once in the script that builds the cluster lattice, with nothing comparing them. One derivation now (src/7/rays.ts), read forward AND reverse: the 2×7 the deposit's own signature lattice already stands on, 28 of 32 digits.
 
+**The register is a dial — a wider hexbit width clears the ISO floor, and costs exactly that much more to simulate** — `width.lean`, 8 theorem(s). No axioms, no Mathlib, no sorry.
+
 **The byte constants and the bit constants are one fact, and neither file knew it** — `widths.lean`, 24 theorem(s). WHY THIS FILE EXISTS — TWO LEADS CROSSING.
 
 ### unfiled
@@ -353,6 +374,10 @@ this page; there is nowhere else to keep the description in step.
 
 **What qpu.uuidna.com and this deposit independently count the same way** — `qpu.lean`, 24 theorem(s). WHY THIS FILE EXISTS, AND THE THREE THINGS IT REFUSES TO SAY.
 
+**What qpu.uuidna.com's cryptographic surface is, decided on its own integers** — `qpu_crypto.lean`, 16 theorem(s). WHY THIS FILE EXISTS, AND WHAT IT REFUSES TO SAY.
+
+**The two gateway bits are constant, so the teleport analogy has no bits to send** — `qpu_gateway.lean`, 8 theorem(s). WHY THIS FILE EXISTS.
+
 **A reading that does not vary with what it reads separates nothing** — `separation.lean`, 8 theorem(s). WHY THIS FILE EXISTS.
 
 **Sequences** — `sequences.lean`, 28 theorem(s). Sequences and identities — Cassini, Lucas, Brahmagupta–Fibonacci, and Pascal mod two.
@@ -455,7 +480,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.
 
-62 of 26045 declarations carry no comment of their own and are shown here as the gap they are, not
+62 of 26077 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
@@ -464,14 +489,14 @@ Read from the artefacts at build time, never carried between runs.
 
 | measure | value |
 |---|---|
-| ledger entries | 28,464 — 3558 octaves exactly |
-| standing — carries its own proof | **26045** |
+| ledger entries | 28,496 — 3562 octaves exactly |
+| standing — carries its own proof | **26077** |
 | carried — withdrawn on its own evidence, proved by a live theorem | **826** |
 | withdrawn — nothing proves it | 1,593 |
-| proved in total | **26871** of 28,464 |
-| standing keys → distinct theorems | 26045 sealed, 0 of them keyed twice, 0 unresolvable |
-| Lean files · theorems | 105 · 26045 sealed theorems (25838 closed by exhaustion, axiom-free · 207 proved for every value on propext and Quot.sound) + 0 rfl declarations |
-| proved `by decide` | 25838 of 26045 |
+| proved in total | **26903** of 28,496 |
+| standing keys → distinct theorems | 26077 sealed, 0 of them keyed twice, 0 unresolvable |
+| Lean files · theorems | 108 · 26077 sealed theorems (25870 closed by exhaustion, axiom-free · 207 proved for every value on propext and Quot.sound) + 0 rfl declarations |
+| proved `by decide` | 25870 of 26077 |
 | claims a machine can render | 103 of 1,555 |
 | claims needing an author | 1,452 — reported, never faked |
 
@@ -515,4 +540,4 @@ whether the work restates someone earlier. [The paper](/paper) typesets every st
 
 ---
 
-*20 claims, all verified · 26045 sealed theorems · 28464 ledger entries · trial root `dd3dccac-a6c7-8c5f-8617-9728f4ae814f` · integrity, not truth*
+*20 claims, all verified · 26077 sealed theorems · 28496 ledger entries · trial root `4aaaeead-9f4f-8251-b326-ef1da131d6f9` · 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 — 26045 theorems (25838 by exhaustion + 207 proved for every value) + 0 rfl declarations = 26045 kernel-accepted; 26045 live keys = 26045 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 — 26077 theorems (25870 by exhaustion + 207 proved for every value) + 0 rfl declarations = 26077 kernel-accepted; 26077 live keys = 26077 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"}