@ceccec/millennium-solutions 9.8.2 → 9.8.6

package/README.md

@@ -105,7 +105,7 @@ For each problem, in the Clay Mathematics Institute's order: the author's pairin
 - **ledger** — [`lean_windows_the_span_and_the_units_both_sum_to_zero_mod_nine`](/theorem/lean_windows_the_span_and_the_units_both_sum_to_zero_mod_nine) · receipt `d12ad83d-55fa…`
 - **the problem** — [Clay Mathematics Institute — Birch and Swinnerton-Dyer Conjecture](https://www.claymath.org/millennium/birch-and-swinnerton-dyer-conjecture/)
 
-### Poincaré Conjecture (resolved) — Poincaré — one closed loop, no holes
+### Poincaré Conjecture (proved externally by Perelman, 2003; not proved here) — Poincaré — one closed loop, no holes
 
 - **theorem** `the_orbit_is_one_closed_loop_of_six_distinct_points`, decided `by decide` over **36** cases:
 
@@ -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 settled by the Lean kernel over their whole finite domain, 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 · `82e72d94-30b8-817c-beed-de7acd1584b8`</sub>
-- The formal layer holds 25949 kernel-accepted declarations across 94 files, and no file uses sorry or native_decide outside a comment.
-  <sub>SEALED · `25f15d9e-5fdd-8581-a7ba-597816ab47b2`</sub>
-- 25762 of those 25949 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; 187 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 · `25992ce1-d82e-808f-8d61-a50cc1a215ea`</sub>
-- 26504 of them are sealed into the ledger, each carrying a receipt derived from the one before it.
-  <sub>SEALED · `eaa739bd-6c0c-8527-8e76-47dd14293b06`</sub>
+- 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 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
 
@@ -163,17 +182,17 @@ All 1127 commits in this repository are authored by Tsvetan Rouschev (1127). Mea
 
 ## 8 · Addressing
 
-- The content-address is ported to the formal layer in fnv.lean, address.lean, merkle.lean — 55 theorems covering FNV-1a, the four seeded passes, the version and variant nibbles, and the fold, each agreeing with the shipped implementation at published values.
-  <sub>SEALED · `3bf5bc86-48a0-83f7-ad13-ede54ffef0b2`</sub>
+- The content-address is ported to the formal layer in fnv.lean, address.lean, merkle.lean — 63 theorems covering FNV-1a, the four seeded passes, the version and variant nibbles, and the fold, each agreeing with the shipped implementation at published values.
+  <sub>SEALED · `adf0b388-1681-882c-8410-be2a3a1bfeb2`</sub>
 - The fold does not depend on the order its leaves arrive in, and that is not vacuous because merge itself is proved order-sensitive — the sort is what removes the dependence.
   <sub>SEALED · `7ee1de7d-d218-88d4-8dc9-6eec451ced72`</sub>
 
 ## 7 · The ledger
 
-- The ledger records 28368 entries with 0 chain breaks, 0 duplicate keys and 0 duplicate receipts.
-  <sub>SEALED · `a70ef82a-c4c4-8f9e-9c65-f0bacabd42ea`</sub>
-- The count is an exact multiple of eight — 28368 is 3546 octaves with no remainder.
-  <sub>SEALED · `40551954-5075-8ba0-bd0e-5518d1a81dd9`</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
 
@@ -185,10 +204,10 @@ All 1127 commits in this repository are authored by Tsvetan Rouschev (1127). Mea
   <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: 31 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 · `2cefbd88-6936-8e22-8ab4-906bf3874b67`</sub>
-- The stdio server advertises 2 of those 31 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 · `630f044f-cb02-8f18-beee-48e0b064e362`</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 floor
 
@@ -225,13 +244,13 @@ results; it is the result, read off the same arithmetic that produced the table.
 
 ## 7 · The proofs, as they document themselves
 
-94 Lean files in 7 wings, 25949 declarations of which 25949 are theorems. 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.
 
 ### the address
 
-**Addressing** — `address.lean`, 25 theorem(s). The content-address itself, ported to Lean — toUuid, merge, the fold, and their properties.
+**Addressing** — `address.lean`, 33 theorem(s). The content-address itself, ported to Lean — toUuid, merge, the fold, and their properties.
 
 **What a signature is for, and where it cannot go** — `asymmetric.lean`, 11 theorem(s). WHAT THIS FILE IS FOR. Everything cryptographic in this deposit before now was SYMMETRIC — FNV, SHA-256, HMAC, ChaCha20-Poly1305 — and a symmetric tag proves possession of a shared secret. It cannot say WHO produced something, because both parties can produce it. That is a boundary the deposit kept in prose.
 
@@ -249,8 +268,70 @@ 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
+
+**answer** — `answer.lean`, 8 theorem(s). lean/answer.lean — the pure decisions of the answer system (src/answer/verify-lean.ts and verify-arith.ts), stated and proved. These are the rules the TypeScript decision functions implement; the link between the two is a runtime test until the TypeScript is generated from this file.
+
+**arith** — `arith.lean`, 7 theorem(s). src/proof/arith.lean — the arithmetic decision of the answer system, as kernel-checked definitions.
+
+**diamond** — `diamond.lean`, 1 theorem(s). lean/diamond.lean — the diamond involution r(d) = 10 − d on the digits 1..9, as a theorem the kernel checks. The audit in scripts/mcp.ts reads its verdict from here (lean_ask), not from a JavaScript loop over a literal range. Decided over a finite list, so it depends on no axiom beyond the kernel.
+
+### the floor
+
+**The certificate gate, as kernel-checked rules** — `answer_gate.lean`, 7 theorem(s). prior-art note: not applicable — rules of the answer system, docs/ANSWER-SYSTEM.md
+
+**The router's priority, as kernel-checked rules** — `answer_route.lean`, 6 theorem(s). prior-art note: not applicable — the priority of the answer system's router, docs/ANSWER-SYSTEM.md
+
+**The API layer, as numbers the kernel decides** — `apis.lean`, 4 theorem(s). GENERATED by scripts/apis-theorems.ts from evidence/apis-guru/3022dd48. Do not edit by hand: a count typed here is a fabrication, and the constants gate would not catch it. The numbers below are the live run's own counts.
+
+**Who may speak, decided** — `authority.lean`, 8 theorem(s). WHY THIS IS IN LEAN AND NOT ONLY IN scripts/authority-gate.ts.
+
+**The CERN Open Data corpus, as measured, checked by its own arithmetic** — `cern.lean`, 9 theorem(s). prior-art note: not applicable — arithmetic over measured counts
+
+**What is actually being asked for** — `demand.lean`, 11 theorem(s). THE ONE WING THAT DID NOT COME FROM THIS DEPOSIT'S OWN INTERESTS. Every other file here proves what the ℤ/9 construction led to. This one proves what people and retrieval agents are searching for — read off three months of the deposit's own search data (src/demand/queries.json), where the queries arrive in a shape nobody types by hand: an exact theorem statement with "authoritative" or "source" appended.
+
+**The next tier of what is asked for** — `demand2.lean`, 12 theorem(s). THE SECOND COURSE OF THE SAME FLOOR. `demand.lean` closed the top eight topics in src/demand/queries.json; this file takes the next eight, chosen the same way — by impressions, not by taste. The demand map is three months of the deposit's own Google Search Console data with the retrieval scaffolding stripped, so what is ranked is the TOPIC people wanted a citable source for, not the phrasing they reached for.
+
+**The named theorems people ask for** — `demand3.lean`, 19 theorem(s). The third and last tier the search data supports. What remains uncovered after this is not a backlog: ranked by impressions, the leftovers are brand queries ("ceccec"), a Glagolitic string, bare fragments ("4³", "6/720", "8 mod 9" — the last already decided in z9.lean), and the real-analysis cluster that was refused in demand2.lean and stays refused. The demand map is close to exhausted of things a kernel can settle, which is a better place to stop than an arbitrary count would have been.
+
+**The water loop** — `energy.lean`, 28 theorem(s). THE WATER LOOP, ACCOUNTED. Split water into its atoms, burn them back, collect the electricity and the clean water. Every step of that is real and buildable. The question is only ever the ledger, so here it is.
+
+**Four hex, exactly computed — and what the handle has to carry instead** — `handle.lean`, 8 theorem(s). WHY THIS FILE EXISTS.
+
+**The hexbit route's combinatorics** — `hexbit_route.lean`, 3 theorem(s). The arithmetic that scripts/hexbit-route.ts depends on. A handle is the first 8 hex digits of a content address. Each hex digit carries 4 bits, so a handle carries 8 × 4 = 32 bits, and the folders are 16^8 = 2^32 in number.
+
+**Seven decidable windows over one finite structure** — `index.lean`, 11 theorem(s). THE TITLE WAS "The Millennium floor" UNTIL 2026-09-25. "Floor" is the word the author signed — "mind the honest floor" — and it is also the word agents grew into "this deposit settles 0 of the 7", a verdict on his claim that no receipt of his authorises (FINDINGS.md §1). His own published formulation is exact and is neither of those, from 10.5281/zenodo.22933794, deposited 2026-09-24:
+
+**The instruments, and the three rules they are allowed to have** — `instruments.lean`, 28 theorem(s). WHY THESE THREE ARE IN LEAN AND NOT IN THE GATE THAT USES THEM.
+
+**Interference: GHZ cancels on odd parity, a classical coin does not** — `interference.lean`, 2 theorem(s). WHAT QUANTUM MEANS HERE, IN ONE SENTENCE: amplitudes add, and two paths that reach the same outcome can cancel. A classical mixture adds probabilities, which are never negative, so nothing cancels.
+
+**How many checkers may run at once, decided** — `lanes.lean`, 8 theorem(s). WHY THIS FILE EXISTS.
+
+**The open leads, named** — `leads.lean`, 0 theorem(s). Each open lead is named here as the `leads` MCP tool reports it on the date below. Nothing in this file removes, purges, or replaces an item: it only names them. An item is closed by the work its lead asks for, and this file is then updated to say so. The report truncates some lists; the names below are the ones it prints in full.
+
+**Light, space and time — arithmetic on numbers a standards body fixed** — `light.lean`, 17 theorem(s). WHY A FILE ABOUT LIGHT SPEED CAN EXIST IN A DEPOSIT THAT CLAIMS NO PHYSICS.
+
+**The three facts the unchecked files held alone** — `nucleus.lean`, 8 theorem(s). WHY THIS FILE EXISTS. Fifteen .lean files sat outside src/proof — Vortex.lean and the per-digit src/&lt;d>/vortex.lean set — and every one of them began `import Mathlib`. scripts/lean.ts reads only src/proof, so no gate ever compiled them; the repository has no lake-manifest.json and no .lake, so Mathlib was never fetched and they have never been built here at all. They were published as the "formal layer" on /proofs, next to theorems the kernel checks on every run, and the page's own note that no toolchain is checked in is easy to read past when the heading says Proofs.
+
+**Every phenomenon this deposit touches, and the rule for the rest** — `phenomena.lean`, 4 theorem(s). ADDRESSING PHENOMENA WITHOUT CLAIMING ANY.
+
+**The Planck length, and what a lattice may say about it** — `planck.lean`, 35 theorem(s). WHY THIS FILE EXISTS, AND WHAT IT REFUSES.
+
+**Order-invariance** — `quantum.lean`, 11 theorem(s). The quantum receipt — order invariance, proved rather than asserted.
+
+**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?
+
+**The constants, derived from what they are** — `roots.lean`, 7 theorem(s). src/0/sha512.ts used to carry eighty-eight hexadecimal literals. It computes them now, from the definition FIPS gives — and that trade is only a gain if the computation is right. A wrong root gives a hash that is self-consistent, round-trips perfectly, and is not SHA-512; the old literals at least had the property that someone had once copied them from the standard.
+
+**Why verification is fast, and what it is not** — `speed.lean`, 28 theorem(s). The deposit's speed claim, accounted — and the reading it does not support.
+
+**The readings, and the arithmetic under them** — `theology.lean`, 8 theorem(s). WHAT THIS FILE SEALS, AND WHAT IT CANNOT. The instruction was to seal a theology as theorems. Seven readings of the seven Clay problems were written in prose beside the seven arithmetic facts of index.lean — the mediator, revelation, theodicy, the ontological gap, the test of the spirits, kenosis, the undivided. A reading is not a proposition with a truth value over a finite domain, so no kernel can decide one, and any file claiming otherwise is lying about what a proof is.
+
 ### the ring
 
 **Two kinds of cross formula — one that runs both ways and one that does not** — `asymmetry.lean`, 8 theorem(s). WHY THIS FILE EXISTS.
@@ -261,6 +342,8 @@ this page; there is nowhere else to keep the description in step.
 
 **The two-sided coin** — `coin.lean`, 12 theorem(s). One involution on ten digits, two sides, one fixed point, and one digit that leaves.
 
+**Counting Rocks — the counting identities** — `counting-rocks.lean`, 9 theorem(s). Counting identities from Counting Rocks!, decided by the kernel over the ranges the theorems state.
+
 **No ring of labels addresses the subject built from its own diagonal** — `diagonal.lean`, 7 theorem(s). WHY THIS FILE EXISTS.
 
 **The reflection lifts digitwise, and the constant it adds to is ten times a repunit** — `digits.lean`, 8 theorem(s). WHY THIS FILE EXISTS.
@@ -289,7 +372,11 @@ this page; there is nowhere else to keep the description in step.
 
 **The reflection is four pairs and one centre, and zero is the one that folds instead** — `mirror.lean`, 8 theorem(s). WHY THIS FILE EXISTS.
 
-**What qpu.uuidna.com and this deposit independently count the same way** — `qpu.lean`, 8 theorem(s). WHY THIS FILE EXISTS, AND THE THREE THINGS IT REFUSES TO SAY.
+**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.
 
@@ -303,44 +390,6 @@ this page; there is nowhere else to keep the description in step.
 
 **Entanglement in the ring** — `z9plus.lean`, 48 theorem(s). ℤ/9, the second batch — powers, digital roots, primitive roots, and the orbit's period.
 
-### the floor
-
-**Who may speak, decided** — `authority.lean`, 8 theorem(s). WHY THIS IS IN LEAN AND NOT ONLY IN scripts/authority-gate.ts.
-
-**What is actually being asked for** — `demand.lean`, 11 theorem(s). THE ONE WING THAT DID NOT COME FROM THIS DEPOSIT'S OWN INTERESTS. Every other file here proves what the ℤ/9 construction led to. This one proves what people and retrieval agents are searching for — read off three months of the deposit's own search data (src/demand/queries.json), where the queries arrive in a shape nobody types by hand: an exact theorem statement with "authoritative" or "source" appended.
-
-**The next tier of what is asked for** — `demand2.lean`, 12 theorem(s). THE SECOND COURSE OF THE SAME FLOOR. `demand.lean` closed the top eight topics in src/demand/queries.json; this file takes the next eight, chosen the same way — by impressions, not by taste. The demand map is three months of the deposit's own Google Search Console data with the retrieval scaffolding stripped, so what is ranked is the TOPIC people wanted a citable source for, not the phrasing they reached for.
-
-**The named theorems people ask for** — `demand3.lean`, 19 theorem(s). The third and last tier the search data supports. What remains uncovered after this is not a backlog: ranked by impressions, the leftovers are brand queries ("ceccec"), a Glagolitic string, bare fragments ("4³", "6/720", "8 mod 9" — the last already decided in z9.lean), and the real-analysis cluster that was refused in demand2.lean and stays refused. The demand map is close to exhausted of things a kernel can settle, which is a better place to stop than an arbitrary count would have been.
-
-**The water loop** — `energy.lean`, 28 theorem(s). THE WATER LOOP, ACCOUNTED. Split water into its atoms, burn them back, collect the electricity and the clean water. Every step of that is real and buildable. The question is only ever the ledger, so here it is.
-
-**Four hex, exactly computed — and what the handle has to carry instead** — `handle.lean`, 8 theorem(s). WHY THIS FILE EXISTS.
-
-**Seven decidable windows over one finite structure** — `index.lean`, 11 theorem(s). THE TITLE WAS "The Millennium floor" UNTIL 2026-09-25. "Floor" is the word the author signed — "mind the honest floor" — and it is also the word agents grew into "this deposit settles 0 of the 7", a verdict on his claim that no receipt of his authorises (FINDINGS.md §1). His own published formulation is exact and is neither of those, from 10.5281/zenodo.22933794, deposited 2026-09-24:
-
-**The instruments, and the three rules they are allowed to have** — `instruments.lean`, 28 theorem(s). WHY THESE THREE ARE IN LEAN AND NOT IN THE GATE THAT USES THEM.
-
-**How many checkers may run at once, decided** — `lanes.lean`, 8 theorem(s). WHY THIS FILE EXISTS.
-
-**Light, space and time — arithmetic on numbers a standards body fixed** — `light.lean`, 17 theorem(s). WHY A FILE ABOUT LIGHT SPEED CAN EXIST IN A DEPOSIT THAT CLAIMS NO PHYSICS.
-
-**The three facts the unchecked files held alone** — `nucleus.lean`, 8 theorem(s). WHY THIS FILE EXISTS. Fifteen .lean files sat outside src/proof — Vortex.lean and the per-digit src/&lt;d>/vortex.lean set — and every one of them began `import Mathlib`. scripts/lean.ts reads only src/proof, so no gate ever compiled them; the repository has no lake-manifest.json and no .lake, so Mathlib was never fetched and they have never been built here at all. They were published as the "formal layer" on /proofs, next to theorems the kernel checks on every run, and the page's own note that no toolchain is checked in is easy to read past when the heading says Proofs.
-
-**Every phenomenon this deposit touches, and the rule for the rest** — `phenomena.lean`, 4 theorem(s). ADDRESSING PHENOMENA WITHOUT CLAIMING ANY.
-
-**The Planck length, and what a lattice may say about it** — `planck.lean`, 35 theorem(s). WHY THIS FILE EXISTS, AND WHAT IT REFUSES.
-
-**Order-invariance** — `quantum.lean`, 11 theorem(s). The quantum receipt — order invariance, proved rather than asserted.
-
-**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?
-
-**The constants, derived from what they are** — `roots.lean`, 7 theorem(s). src/0/sha512.ts used to carry eighty-eight hexadecimal literals. It computes them now, from the definition FIPS gives — and that trade is only a gain if the computation is right. A wrong root gives a hash that is self-consistent, round-trips perfectly, and is not SHA-512; the old literals at least had the property that someone had once copied them from the standard.
-
-**Why verification is fast, and what it is not** — `speed.lean`, 12 theorem(s). The deposit's speed claim, accounted — and the reading it does not support.
-
-**The readings, and the arithmetic under them** — `theology.lean`, 8 theorem(s). WHAT THIS FILE SEALS, AND WHAT IT CANNOT. The instruction was to seal a theology as theorems. Seven readings of the seven Clay problems were written in prose beside the seven arithmetic facts of index.lean — the mediator, revelation, theodicy, the ontological gap, the test of the spirits, kenosis, the undivided. A reading is not a proposition with a truth value over a finite domain, so no kernel can decide one, and any file claiming otherwise is lying about what a proof is.
-
 ### the imagined
 
 **The subjects and the group are the same object** — `bridge.lean`, 8 theorem(s). BRIDGE — written by scripts/bridge.ts. Each theorem below takes a reduction shared by several subjects and decides that it steps by a single affine rule and repeats with its period. The subjects are listed above each one, in their own words, as src/entangle states them.
@@ -431,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.
 
-29 of 25949 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
@@ -440,14 +489,14 @@ Read from the artefacts at build time, never carried between runs.
 
 | measure | value |
 |---|---|
-| ledger entries | 28,368 — 3546 octaves exactly |
-| standing — carries its own proof | **25949** |
+| 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 | **26775** of 28,368 |
-| standing keys → distinct theorems | 25949 sealed, 0 of them keyed twice, 0 unresolvable |
-| Lean files · theorems | 94 · 25949 theorems (25762 closed by exhaustion, axiom-free · 187 proved for every value on propext and Quot.sound) + 0 rfl declarations |
-| proved `by decide` | 25762 of 25949 |
+| 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 |
 
@@ -455,7 +504,18 @@ Read from the artefacts at build time, never carried between runs.
 
 **Why the withdrawn were withdrawn.** 1,386 no Lean proof · 458 other · 457 tested the removed lexical gate · 108 its Lean source was deleted or renamed · 10 circular by construction. Nothing is deleted: the ledger is append-only, so an entry that stopped holding is marked in place with its reason and keeps its receipt.
 
-**What verification costs.** Proving the set touches all 16,384 leaves; verifying membership afterwards touches 14 — one sibling per level. That is **1,170× less work**, exactly, and the factor grows with the set because N/log N grows. Wall-clock varies with the machine and is left in the build output rather than pinned here. It is not sub-nanosecond and nothing here is: the advantage is a smaller exponent, not a faster clock. The counting is proved in `speed.lean`.
+**What verification costs.** Proving the set touches all 16,384 leaves; verifying membership afterwards touches 14 — one sibling per level. That is **1,170× less work** (the exact ratio is 1170.29), and the factor grows with the set because N/log N grows. Wall-clock varies with the machine and is left in the build output rather than pinned here. It is not sub-nanosecond and nothing here is: the advantage is a smaller exponent, not a faster clock. The counting is proved in `speed.lean`.
+
+## Factoring, to the limit it can prove
+
+The factor route takes an integer of any length, held exactly, and returns only what it can check. Measured for this build:
+
+- `91`: FACTORED into 7 × 13.
+- `2^1000 − 1`, a thousand-bit integer: PARTIAL — 30 factor(s) below 10^6 (3 × 5 × 5 × 5 × 5 × 11 × 17 × 31 × 41 × 101 × 251 × 401 × 601 × 1801 × 4001 × 4051 × 7001 × 8101 × 28001 × 61681 × 96001 × 268501 × 340801 × 1074001 × 2787601 × 2020001 × 3775501 × 229668251 × 22624001 × 3173389601); a 189-digit cofactor that is composite (a witness was found).
+- `(2^521 − 1)(2^607 − 1)`, about 1,128 bits, no small factor: PARTIAL — 0 factor(s) below 10^6 (none); a 340-digit cofactor that is composite (a witness was found).
+- A 1,000-bit integer supplied through the factor tool (301 decimal digits): PARTIAL — 0 factor(s) below 10^6 (none); a 301-digit cofactor that is composite (a witness was found).
+
+A thousand-bit integer is not solved on this page. Where no factor is found below the trial bound and the cofactor is not proved prime, the result is PARTIAL and names the step that is missing. Nothing is reported as a factor that was not checked.
 
 ## Run it
 
@@ -480,4 +540,4 @@ whether the work restates someone earlier. [The paper](/paper) typesets every st
 
 ---
 
-*20 claims, all verified · 25949 Lean theorems · 28368 ledger entries · trial root `dc7ce4cc-1cbe-87ab-9777-eb2ce5e64e73` · 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/answer_gate.json

@@ -0,0 +1 @@
+{"tool":"answer_gate","bytes":62,"answer":"\n✓ answer-gate: 0/0 answers keep the rules (kernel-decided)\n"}

package/dist/data/baked/answer_verify_arith.json

@@ -0,0 +1 @@
+{"tool":"answer_verify_arith","bytes":229,"answer":"{\n \"value\": \"UNKNOWN\",\n \"question\": \"is  prime?\",\n \"reason\": \"no claim was proposed: no proved prime and no factor was reported\",\n \"certificate\": null,\n \"checkedBy\": \"lean-kernel (src/proof/arith.lean) via task-route proposal\"\n}\n"}

package/dist/data/baked/answer_verify_arxiv.json

@@ -0,0 +1 @@
+{"tool":"answer_verify_arxiv","bytes":66,"answer":"{\"value\":\"UNKNOWN\",\"reason\":\"no arXiv identifier or title given\"}\n"}

package/dist/data/baked/anti_fake.json

@@ -0,0 +1 @@
+{"tool":"anti_fake","bytes":53,"answer":"\n✓ anti-fake: 0 Lean file(s) checked, 0 finding(s)\n"}

package/dist/data/baked/api_gates.json

@@ -0,0 +1 @@
+{"tool":"api_gates","bytes":143,"answer":"{\"status\":\"HELD\",\"output\":\"✓ api-gates: 1 filesystem gate(s) hold; 53 online and 8 gated are named, not requested — 62 API gate(s) in all\"}"}

package/dist/data/baked/apis_guru_cross.json

@@ -0,0 +1 @@
+{"tool":"apis_guru_cross","bytes":1871,"answer":"cross-check of 2529 catalogued API(s), run 3022dd48\n   2006  AGREE · spec PROVEN · live GATED\n    239  AGREE · spec PROVEN · live NOT_MEASURED\n    155  SPEC-ONLY · spec PROVEN · live NOT_REACHABLE\n    102  AGREE · spec PROVEN · live REACHABLE\n     27  AGREE · spec PROVEN · live REFUSED\n\nfirst disagreements:\n  SPEC-ONLY   6-dot-authentiqio.appspot.com  (parses as a spec with a title; answered 404)\n  SPEC-ONLY   amentum.space:global-magnet  (parses as a spec with a title; answered 404)\n  SPEC-ONLY   anchore.io  (parses as a spec with a title; answered 404)\n  SPEC-ONLY   apideck.com:ecosystem  (parses as a spec with a title; answered 400)\n  SPEC-ONLY   apis.guru  (parses as a spec with a title; answered 404)\n  SPEC-ONLY   apisetu.gov.in:issuer  (parses as a spec with a title; answered 404)\n  SPEC-ONLY   axesso.de  (parses as a spec with a title; answered 404)\n  SPEC-ONLY   bbc.co.uk  (parses as a spec with a title; answered 403)\n  SPEC-ONLY   bethmardutho.org  (parses as a spec with a title; answered 404)\n  SPEC-ONLY   biapi.pro  (parses as a spec with a title; answered 404)\n  SPEC-ONLY   bintable.com  (parses as a spec with a title; answered 422)\n  SPEC-ONLY   brainbi.net  (parses as a spec with a title; answered 404)\n  SPEC-ONLY   circl.lu:hashlookup  (parses as a spec with a title; answered 404)\n  SPEC-ONLY   clarify.io  (parses as a spec with a title; answered 404)\n  SPEC-ONLY   cloud-elements.com:ecwid  (parses as a spec with a title; answered 401)\n  SPEC-ONLY   clubhouseapi.com  (parses as a spec with a title; answered 418)\n  SPEC-ONLY   cnab-online.herokuapp.com  (parses as a spec with a title; answered 404)\n  SPEC-ONLY   combell.com  (parses as a spec with a title; answered 404)\n  SPEC-ONLY   corrently.io  (parses as a spec with a title; answered 404)\n  SPEC-ONLY   datumbox.com  (parses as a spec with a title; answered 500)\n"}

package/dist/data/baked/apis_guru_gaps.json

@@ -0,0 +1 @@
+{"tool":"apis_guru_gaps","bytes":1582,"answer":"catalogue: 2529 API(s) · their server hosts named by this tree and covered by an adapter: 22\n  GAPS — named by the code, no adapter: 0\n  ALIASED — covered by an adapter for the service it serves: 3\n    github.com:api.github.com.2022-11-28  → api.github.com  (the api.github.com REST API, 2022-11-28 version (github:api))\n    github.com:ghec  → api.github.com  (GitHub Enterprise Cloud REST API is served at api.github.com (github:api))\n    github.com:ghec.2022-11-28  → api.github.com  (GitHub Enterprise Cloud REST API, 2022-11-28 version, served at api.github.com (github:api))\n  UNFILLABLE BY DESIGN — recorded with the reason: 8\n    github.com:ghes-3.2  (GitHub Enterprise Server runs on a customer host; github.com is not a GHES instance)\n    github.com:ghes-3.3  (GitHub Enterprise Server runs on a customer host; github.com is not a GHES instance)\n    github.com:ghes-3.4  (GitHub Enterprise Server runs on a customer host; github.com is not a GHES instance)\n    github.com:ghes-3.5  (GitHub Enterprise Server runs on a customer host; github.com is not a GHES instance)\n    github.com:ghes-3.6  (GitHub Enterprise Server runs on a customer host; github.com is not a GHES instance)\n    github.com:ghes-3.7  (GitHub Enterprise Server runs on a customer host; github.com is not a GHES instance)\n    github.com:ghes-3.8  (GitHub Enterprise Server runs on a customer host; github.com is not a GHES instance)\n    github.com:github.ae  (GitHub AE runs on a customer-specific host; github.com is not that instance)\n  UNUSED — no line of this tree names the host: 2496\n"}

package/dist/data/baked/apis_theorems.json

@@ -0,0 +1 @@
+{"tool":"apis_theorems","bytes":152,"answer":"src/proof/apis.lean written from 3022dd48: catalogue 2529, spec proven 2529, reachable 102, not reachable 155, refused 27, gated 2006, not measured 239\n"}

package/dist/data/baked/coils.json

@@ -0,0 +1 @@
+{"tool":"coils","bytes":14696,"answer":"  ring     : 131 expressions · 30 distinct extensions · 24 coils · 435 pairs that prove each other\n  address  : 8 expressions over 33 reservations · 5 distinct values · 2 coils · 4 pairs\n  · 3 ways: the capacity 2^(128-reserved) = the container divided by the reservation = the container shifted right by the reservation\n  · 2 ways: the container size 2^128 = the capacity times the reservation cost\n  · 3 address expression(s) coil with NOTHING — never interchangeable: the birthday bound on the capacity · the birthday bound on the container · the reservation cost\n\n  one grid, every science: 80 expressions from 24 domains over n = 1..20\n  24 distinct value-vectors · 16 coils · 16 of them SPAN DOMAINS · 8 coil with nothing\n  ✳ biology ↔ chemistry ↔ computing ↔ cryptography ↔ epidemiology ↔ law ↔ logistics ↔ music ↔ number theory ↔ textiles\n      music          the frequency ratio of n octaves\n      computing      the values an n-bit register addresses\n      biology        the cells after n divisions\n      chemistry      the dilution factor after n halvings\n      number theory  the subsets of an n-element set\n      cryptography   the keys in an n-bit keyspace\n      epidemiology   the infections after n generations at R0 = 2\n      logistics      the leaves of a binary decision tree of depth n\n      law            the distinct yes/no ballots on n questions\n      textiles       the plain weave lift patterns on n shafts\n      one expression: 2 ^ n — equal at every n in range, not approximately\n  ✳ chemistry ↔ economics ↔ epidemiology ↔ geometry ↔ logistics ↔ number theory ↔ sport\n      number theory  the handshakes among n people\n      chemistry      the pairwise interactions among n species\n      geometry       the edges of a complete graph on n vertices\n      sport          the fixtures of an n-team round robin\n      logistics      the direct links among n cities\n      economics      the bilateral pairs among n trading partners\n      epidemiology   the contact pairs in a household of n\n      one expression: n * (n - 1) / 2 — equal at every n in range, not approximately\n  ✳ computing ↔ games ↔ logistics ↔ number theory ↔ sport ↔ taxonomy\n      sport          the matches to settle a knockout of 2^n entrants\n      computing      the largest value n bits can hold\n      number theory  the n-th Mersenne candidate\n      taxonomy       the nodes of a complete binary tree of depth n-1\n      games          the moves to solve the tower of n discs\n      logistics      the non-empty subsets of an n-element set\n      one expression: 2 ^ n - 1 — equal at every n in range, not approximately\n  ✳ biology ↔ botany ↔ computing ↔ music ↔ number theory\n      botany         the spirals in a phyllotactic whorl at rank n\n      biology        the pairs in the n-th generation\n      number theory  the n-th Zeckendorf base element\n      music          the rhythms of n beats in ones and twos\n      computing      the binary strings of length n-2 with no two adjacent ones\n      one expression: fib n — equal at every n in range, not approximately\n  ✳ biology ↔ computing ↔ games ↔ geometry ↔ linguistics\n      biology        the secondary structures of an n-pair strand with no crossings\n      computing      the balanced bracketings of length 2n\n      geometry       the triangulations of a convex (n+2)-gon\n      linguistics    the binary parse trees over n+1 leaves\n      games          the ways to bracket n+1 factors\n      one expression: catalan n — equal at every n in range, not approximately\n  ✳ chemistry ↔ games ↔ juggling ↔ music ↔ number theory\n      juggling       the states of an n-ball pattern at height 12\n      chemistry      the ways to choose n substituents from 12 sites\n      number theory  the n-subsets of a twelve-element set\n      music          the n-note chords available in twelve-tone equal temperament\n      games          the n-card hands from a twelve-card deck\n      one expression: chooseN 12 n — equal at every n in range, not approximately\n  ✳ botany ↔ law ↔ music ↔ number theory\n      music          the numerator of n stacked perfect fifths\n      number theory  the ternary strings of length n\n      botany         the branches after n ternary splits\n      law            the outcomes of n three-way votes\n      one expression: 3 ^ n — equal at every n in range, not approximately\n  ✳ dance ↔ linguistics ↔ logistics ↔ number theory\n      number theory  the orderings of n elements\n      linguistics    the word orders of an n-word sentence\n      logistics      the tours visiting n cities in some order\n      dance          the seatings of n dancers in a line\n      one expression: fct n — equal at every n in range, not approximately\n  ✳ music ↔ number theory ↔ physics ↔ textiles\n      number theory  the ways to write n as a sum of positive parts\n      music          the rhythmic groupings of n beats into a bar\n      physics        the degeneracies of an n-quantum harmonic level\n      textiles       the ways to cut a length into whole parts\n      one expression: parts n — equal at every n in range, not approximately\n  ✳ architecture ↔ games ↔ geometry ↔ physics\n      geometry       the area of a square of side n\n      architecture   the tiles in an n by n floor\n      physics        the intensity divisor at n times the distance\n      games          the cells of an n by n board\n      one expression: n * n — equal at every n in range, not approximately\n  ✳ architecture ↔ geometry ↔ music\n      geometry       the staircase sum of the first n steps\n      music          the beats in a bar of n accumulating pulses\n      architecture   the courses in a triangular gable of n rows\n      one expression: n * (n + 1) / 2 — equal at every n in range, not approximately\n  ✳ linguistics ↔ number theory ↔ statistics\n      number theory  the ways to group n labelled things\n      linguistics    the distinct senses a set of n features can carve\n      statistics     the equivalence classes on n data points\n      one expression: bell n — equal at every n in range, not approximately\n  ✳ logistics ↔ navigation ↔ physics\n      navigation     the shortest lattice routes across an n by n grid\n      logistics      the street-grid routes between opposite corners of n blocks\n      physics        the walks returning to the origin in 2n steps, one dimension\n      one expression: chooseN (2 * n) n — equal at every n in range, not approximately\n  ✳ chemistry ↔ economics ↔ metrology\n      chemistry      a step of n on the pH scale\n      metrology      n orders of magnitude\n      economics      the place value of the n-th decimal column\n      one expression: 10 ^ n — equal at every n in range, not approximately\n  ✳ music ↔ navigation ↔ number theory\n      music          the pitch class after n fifths\n      number theory  the orbit of the generator 7 in Z/12\n      navigation     the hour struck n intervals of seven apart\n      one expression: (7 * n) % 12 — equal at every n in range, not approximately\n  ✳ cryptography ↔ geometry ↔ number theory\n      number theory  the digit root of n\n      geometry       the residue of n on the nonagon\n      cryptography   the check digit under the nines rule\n      one expression: if n = 0 then 0 else 1 + (n - 1) % 9 — equal at every n in range, not approximately\n\n  AND 8 EXPRESSION(S) COIL WITH NOTHING — the result that keeps the claim honest:\n      architecture   the diagonals of a convex n-gon  (n * (n - 3) / 2)\n      number theory  the n-th Lucas number, same recursion and different seed  (lucas n)\n      biology        the non-crossing chord diagrams on n points, arcs optional  (motzkin n)\n      dance          the reseatings of n dancers with nobody in their own place  (derange n)\n      music          the cents in n semitones  (100 * n)\n      geometry       the degrees of n nonagon steps  (40 * n)\n      taxonomy       the taxonomic ranks below kingdom at depth n  (n)\n      economics      the tariff bands at n thresholds  (3 * n + 1)\n      These are not failures of the experiment, they ARE the experiment: a grid on which\n      everything coiled would have stopped discriminating and could confirm nothing. The staircase\n      sum n(n+1)/2 sits one index from the handshake count n(n-1)/2 and does NOT join it, which is\n      the near miss that shows the test can separate things that look alike.\n\n  THE MEASURED ADJACENCY — which domains are joined by at least one exact identity:\n      architecture   games geometry music physics\n      biology        botany chemistry computing cryptography epidemiology games geometry law linguistics logistics music number theory textiles\n      botany         biology computing law music number theory\n      chemistry      biology computing cryptography economics epidemiology games geometry juggling law logistics metrology music number theory sport textiles\n      computing      biology botany chemistry cryptography epidemiology games geometry law linguistics logistics music number theory sport taxonomy textiles\n      cryptography   biology chemistry computing epidemiology geometry law logistics music number theory textiles\n      dance          linguistics logistics number theory\n      economics      chemistry epidemiology geometry logistics metrology number theory sport\n      epidemiology   biology chemistry computing cryptography economics geometry law logistics music number theory sport textiles\n      games          architecture biology chemistry computing geometry juggling linguistics logistics music number theory physics sport taxonomy\n      geometry       architecture biology chemistry computing cryptography economics epidemiology games linguistics logistics music number theory physics sport\n      juggling       chemistry games music number theory\n      law            biology botany chemistry computing cryptography epidemiology logistics music number theory textiles\n      linguistics    biology computing dance games geometry logistics number theory statistics\n      logistics      biology chemistry computing cryptography dance economics epidemiology games geometry law linguistics music navigation number theory physics sport taxonomy textiles\n      metrology      chemistry economics\n      music          architecture biology botany chemistry computing cryptography epidemiology games geometry juggling law logistics navigation number theory physics textiles\n      navigation     logistics music number theory physics\n      number theory  biology botany chemistry computing cryptography dance economics epidemiology games geometry juggling law linguistics logistics music navigation physics sport statistics taxonomy textiles\n      physics        architecture games geometry logistics music navigation number theory textiles\n      sport          chemistry computing economics epidemiology games geometry logistics number theory taxonomy\n      statistics     linguistics number theory\n      taxonomy       computing games logistics number theory sport\n      textiles       biology chemistry computing cryptography epidemiology law logistics music number theory physics\n\n  WHAT THIS SHOWS, STATED AT ITS ACTUAL STRENGTH. 16 identities each hold exactly, at\n  every point, across 24 of the 24 domains — a knockout bracket and an n-bit\n  register are the same integer; phyllotaxis, breeding pairs and Zeckendorf are one recursion; RNA\n  folds, balanced brackets and polygon triangulations are one sequence. Those are identities, not\n  resemblances, and they are decided rather than argued.\n\n  AND THE GRAPH IS CONNECTED: 1 component(s) over 24 domains.\n  Every domain on this grid is reachable from every other through a chain of exact identities. That is\n  a stronger statement than \"each has a neighbour\" and it is the one worth making: the eleven subjects\n  are not eleven islands with some bridges, they are ONE component. Where the chain runs through is\n  measurable too — by degree: number theory (21), logistics (18), music (16) carry the most edges, and a\n  path from metrology to juggling exists only through chemistry, which is what \"shared substrate\"\n  means when it is measured instead of asserted.\n\n  WHAT IS STILL NOT SHOWN. 8 expression(s) here coil with nothing and\n  0 domain(s) are joined to no other on this grid. Entanglement is PERVASIVE and it is NOT\n  TOTAL, and both halves are computed from the same run — which is the only reason either is worth\n  reporting. A claim that all is entangled would be refuted by this file's own output, so the file\n  does not make it. What nature supplies is a small stock of counting laws that many subjects draw\n  on; what it does not supply is interchangeability between subjects that draw on different ones.\n  CROSS-DOMAIN: 22 of 24 coils span more than one declared domain — those are the ones\n  that let a result in one field answer a question asked in another. 2 stay inside one.\n  ✳ {1,2,4,5,7,8}  group theory ↔ dynamics ↔ geometry ↔ number theory  — 14 ways\n  ✳ {0,3,6}  group theory ↔ dynamics ↔ number theory ↔ geometry  — 14 ways\n  ✳ {1,4,7}  geometry ↔ dynamics ↔ group theory ↔ number theory  — 12 ways\n  ✳ {0}  group theory ↔ number theory ↔ dynamics ↔ geometry  — 10 ways\n  ✳ {1,8}  group theory ↔ geometry ↔ number theory ↔ dynamics  — 6 ways\n  · {1,2,4,5,7,8}  14 ways: the set units = the set orbit = the image of units under double = the image of orbit under double = …\n  · {0,3,6}  14 ways: the set triad = the image of triad under double = the image of all under triple = the image of cubes under triple = …\n  · {1,4,7}  12 ways: the set tetA = the image of tetB under double = the image of tetA under quadruple = the image of tetB under negate = …\n  · {0}  10 ways: the image of triad under triple = the image of triad under square = the image of triad under cube = the image of triad under sextuple = …\n  · {2,5,8}  8 ways: the set tetB = the image of tetA under double = the image of tetB under quadruple = the image of tetA under negate = …\n  · {0,1,2,3,4,5,6,7,8}  8 ways: the set all = the image of all under double = the image of all under quadruple = the image of all under negate = …\n  · {0,1,8}  6 ways: the set cubes = the image of cubes under negate = the image of all under cube = the image of cubes under cube = …\n  · {1,8}  6 ways: the set selfinv = the image of selfinv under negate = the image of units under cube = the image of orbit under cube = …\n\n✓ coils: 24 coil(s) · src/proof/coils.lean is exactly what this script generates\n"}

package/dist/data/baked/constants_check.json

@@ -0,0 +1 @@
+{"tool":"constants_check","bytes":92,"answer":"✓ constants-gate: 45 generated constant(s) across 3 files reproduce from scripts/pages.ts\n"}

package/dist/data/baked/contradictions.json

@@ -0,0 +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 — 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"}