@ceccec/millennium-solutions 9.1.4 → 9.1.7

package/CHALLENGES.md

@@ -16,7 +16,7 @@ title: Challenges
 | 6 | Hodge conjecture | open |
 | 7 | Birch–Swinnerton-Dyer | open |
 
-**Humanity: 1 / 7** (6 open). **This deposit: 0 / 7** — it settles none of the seven itself.
+**Humanity: 1 / 7** (6 open). The author's own claim, that the seven are solved through involution, is stated in his name on the front page.
 
 ## Discovered theorems (decidable, over ℤ/9) — 2577 standing in 1 families
 
@@ -724,1521 +724,1521 @@ Each was withdrawn for want of a Lean proof and has since been given one, at a n
 
 <details><summary>List all 1514 withdrawn keys — nothing proves these</summary>
 
-- ~~`qr_u7`~~ — 7 is a quadratic residue mod 9  ·  `2a422f9b-761a…`
-- ~~`powinv_k5`~~ — u↦u^5 is an involution on the units mod 9  ·  `8e327990-c88f…`
-- ~~`powinv_k7`~~ — u↦u^7 is an involution on the units mod 9  ·  `469cfad5-9293…`
-- ~~`selfinv_u1`~~ — 1 is its own inverse mod 9  ·  `558f7d79-d3d7…`
-- ~~`selfinv_u8`~~ — 8 is its own inverse mod 9  ·  `3bc79c77-36a1…`
-- ~~`selfneg_d9`~~ — 9 is its own additive inverse (2·9 ≡ 0) mod 9  ·  `8d0d0254-5ca1…`
-- ~~`reverse_circuit`~~ — the halving map ×2⁻¹ traces the doubling circuit in reverse mod 9  ·  `205fe01b-d27f…`
-- ~~`bool_double_negation`~~ — double negation: ¬¬a = a (all inputs)  ·  `a4640234-4e32…`
-- ~~`bool_excluded_middle`~~ — excluded middle: a∨¬a = 1 (all inputs)  ·  `29468d4a-f416…`
-- ~~`bool_noncontradiction`~~ — non-contradiction: a∧¬a = 0 (all inputs)  ·  `1d8543d8-7d61…`
-- ~~`bool_xor_associativity`~~ — XOR associativity: (a⊕b)⊕c = a⊕(b⊕c) (all inputs)  ·  `4ba6ccd9-fd1d…`
-- ~~`entangle_joint_differs`~~ — the joint fold of deposit(0/7) & humanity(1/7) is a third address, different from each part  ·  `9657bf0d-5c1f…`
-- ~~`entangle_no_influence`~~ — entanglement without influence: the fold is order-independent (no direction) and each part is unchanged  ·  `7267ca5a-c961…`
-- ~~`entangle_floor_holds`~~ — entanglement changes the joint address, never the counts: deposit stays 0/7  ·  `2b7b5b94-580f…`
-- ~~`duel_overclaim_falls`~~ — no faster-than-light claim is upheld — the assertion drains, its negation stands  ·  `c05da1be-673a…`
-- ~~`duel_no_both_win`~~ — a claim and its inverse cannot both be upheld (no position wins for both sides)  ·  `ea632dd9-0682…`
-- ~~`duel_floor_upheld`~~ — "the deposit does not solve the Clay problems" is upheld against its challenge  ·  `4ee11b6a-d6b6…`
-- ~~`hasse_p5_a1_b1`~~ — Hasse bound holds for y²=x³+1x+1 over 𝔽_5: |#E−(p+1)|≤2√p  ·  `73bd58ba-4989…`
-- ~~`hasse_p7_a2_b3`~~ — Hasse bound holds for y²=x³+2x+3 over 𝔽_7: |#E−(p+1)|≤2√p  ·  `a3d3160b-8c8a…`
-- ~~`hasse_p11_a1_b6`~~ — Hasse bound holds for y²=x³+1x+6 over 𝔽_11: |#E−(p+1)|≤2√p  ·  `51f2a2c6-6e67…`
-- ~~`hasse_p13_a3_b8`~~ — Hasse bound holds for y²=x³+3x+8 over 𝔽_13: |#E−(p+1)|≤2√p  ·  `678a2d8a-7e87…`
-- ~~`s3_order6`~~ — the symmetric group S₃ has exactly 6 elements (= |ℤ/9*|)  ·  `40c95681-97c1…`
-- ~~`s3_nonabelian`~~ — S₃ is non-abelian: ∃ a,b with a∘b ≠ b∘a  ·  `996f2aa1-6e10…`
-- ~~`s3_sign_homomorphism`~~ — sign is a homomorphism on S₃: sign(a∘b)=sign(a)·sign(b) (all 36 pairs)  ·  `7c46468e-641c…`
-- ~~`gauss_four_units`~~ — ℤ[i] has exactly four units of norm 1: {1, i, −1, −i}  ·  `7b8ebbf0-0bf5…`
-- ~~`gauss_i_squared`~~ — in ℤ[i], i² = −1  ·  `185b3eda-935c…`
-- ~~`gauss_norm_multiplicative`~~ — the ℤ[i] norm is multiplicative: N(zw)=N(z)·N(w) (tested set)  ·  `7e709c97-78f3…`
-- ~~`handshake_z9`~~ — handshake on the ×2 Cayley graph of ℤ/9: Σ degrees = 2·|edges|  ·  `44f09f3c-e542…`
-- ~~`merkaba_field_max_null`~~ — the merkaba field f(θ)=(1+cosθ)/2: co-rotating(0)→1 MAX, counter-rotating(π)→0 NULL  ·  `a9c3214f-3ec7…`
-- ~~`cover_one_tetra_partial`~~ — still: one tetrahedron {1,4,7} covers only 3 of the 6 units — 3 remain uncovered  ·  `8c7bcc8a-1869…`
-- ~~`cover_moving_pair_full`~~ — moving: the counter-rotating pair {1,4,7}∪{2,5,8} covers every uncovered unit — all 6, no gap  ·  `22b9e194-9be5…`
-- ~~`pascal_rowsum_n5`~~ — Σ_k C(5,k) = 2^5 = 32  ·  `3b4e481c-bd45…`
-- ~~`pascal_rowsum_n8`~~ — Σ_k C(8,k) = 2^8 = 256  ·  `b62025f5-f7ec…`
-- ~~`pascal_rowsum_n10`~~ — Σ_k C(10,k) = 2^10 = 1024  ·  `099a0df7-929c…`
-- ~~`roots_cancel_n2`~~ — the 2 equally-spaced unit vectors (n-th roots of unity) cancel to the zero vector  ·  `f14563e3-9bf7…`
-- ~~`roots_cancel_n3`~~ — the 3 equally-spaced unit vectors (n-th roots of unity) cancel to the zero vector  ·  `0d08dcee-c228…`
-- ~~`roots_cancel_n5`~~ — the 5 equally-spaced unit vectors (n-th roots of unity) cancel to the zero vector  ·  `986f830c-ea1b…`
-- ~~`roots_cancel_n7`~~ — the 7 equally-spaced unit vectors (n-th roots of unity) cancel to the zero vector  ·  `87f482d5-8600…`
-- ~~`roots_cancel_n9`~~ — the 9 equally-spaced unit vectors (n-th roots of unity) cancel to the zero vector  ·  `8a7804c7-2d8c…`
-- ~~`a432_directions_cancel`~~ — the 9 a432 directions (digit×40°) cancel to the zero vector — full interference at the center  ·  `90b398a0-b189…`
-- ~~`farey_neighbor_F5`~~ — Farey F_5: consecutive a/b, c/d satisfy bc − ad = 1  ·  `170484c5-3b95…`
-- ~~`farey_neighbor_F6`~~ — Farey F_6: consecutive a/b, c/d satisfy bc − ad = 1  ·  `21bdf7ff-2f61…`
-- ~~`quarter_turn_order4`~~ — 90° rotation (×i) has order 4: shift by 90° four times and it returns (i⁴ = 1)  ·  `02f0a928-7bda…`
-- ~~`both_games_truth_and_honesty`~~ — both games: the orbit covers the units (computes) AND "covers, solves no Clay" signs  ·  `346f2fb8-6b23…`
-- ~~`both_games_overclaim_loses`~~ — the overclaim loses both games: "the orbit solves the Clay problems" drains and proves nothing  ·  `65cc1cf8-20a5…`
-- ~~`both_games_358`~~ — the 3-5-8 trinity plays both: 3+5=8 computes AND "3+5=8, proving no open conjecture" signs  ·  `c26cc4c6-7c93…`
-- ~~`arts_triad_rgb_primaries`~~ — the triad {3,6,9} maps to the RGB primary hues: 0°(red), 120°(green), 240°(blue)  ·  `316f831d-95da…`
-- ~~`arts_cmy_complements_rgb`~~ — CMY are the 180° complements of RGB: each primary hue + 180° is a secondary hue  ·  `13b5af77-bfc6…`
-- ~~`arts_golden_proportion`~~ — the golden ratio (aesthetic proportion) satisfies φ² = φ + 1  ·  `48801162-b59d…`
-- ~~`vocab_ceccec_palindrome`~~ — "ceccec" is a palindrome — it reads the same reversed  ·  `02301560-d210…`
-- ~~`vocab_ceccec_digits`~~ — "ceccec" → a1z26 → 3,5,3,3,5,3 (c=3, e=5) — itself a palindrome  ·  `f88b8d6d-e2b8…`
-- ~~`vocab_letter_sum_reversal_invariant`~~ — a word and its reversal share one letter-sum digital root (vede ↔ edev)  ·  `b7bf6005-1692…`
-- ~~`vocab_glagolitic_bijection`~~ — the 9 Glagolitic letters (Azъ…Zemlja) are 9 distinct symbols, one per ℤ/9 digit  ·  `2149d57c-d222…`
-- ~~`vocab_seven_locales`~~ — the rosetta carries 7 distinct locale keys (en·bg·de·fr·es·ru·zh)  ·  `21c521ea-3baf…`
-- ~~`gematria_vortex_heart`~~ — "vortex" digital-roots to 5 — the heart digit (σ(5)=5)  ·  `63abfd7c-c91c…`
-- ~~`gematria_trinity_horizon`~~ — "trinity" digital-roots to 7 — the horizon digit  ·  `dce0ba69-7ba9…`
-- ~~`gematria_51_class`~~ — "merkaba", "pleme", "wave" share the letter-sum 51 (digital root 6)  ·  `b38c9c21-a8ac…`
-- ~~`gematria_ceccec_harmony_4`~~ — "ceccec" and "harmony" share the digital root 4  ·  `cbd3ab4e-2f05…`
-- ~~`gematria_singularity_horo_2`~~ — "singularity" and "horo" share the digital root 2  ·  `1c434409-549d…`
-- ~~`lens_strings_not_meaning`~~ — the lens sees bytes: distinct translations → distinct addresses, identical → identical  ·  `9ab46c9a-f620…`
-- ~~`lens_concept_handle_order_independent`~~ — the cross-locale concept handle (fold of the aligned translations) is order-independent  ·  `5e07b827-f250…`
-- ~~`lens_deterministic`~~ — each translation content-addresses deterministically — toUuid(s) reproduces exactly  ·  `b46579fd-1b90…`
-- ~~`arts_no_exact_complement`~~ — on the 9-hue wheel no hue has an exact complement (180° = 4.5 steps) — the odd base has no antipode  ·  `1656079f-c131…`
-- ~~`trial_overclaim_drained`~~ — trial DRAINED: the conspiracy "algebra proves the Clay problems" is refused by the gate (computes 0)  ·  `57c46000-4768…`
-- ~~`trial_pvnp_inconclusive`~~ — trial INCONCLUSIVE: "P vs NP remains open" signs; the claim it is decided drains — open, not false  ·  `94e908b9-21b1…`
-- ~~`trial_ftl`~~ — trial DRAINED (tried): "faster than light" drains, "not faster than light" signs  ·  `54f91340-a811…`
-- ~~`trial_perpetual_motion`~~ — trial DRAINED (tried): "achieves perpetual motion" drains, "does not achieve perpetual motion" signs  ·  `685da6ef-4b31…`
-- ~~`trial_agi`~~ — trial DRAINED (tried): "achieved AGI" drains, "has not achieved AGI" signs  ·  `ce4c822c-ff01…`
-- ~~`trial_theory_of_everything`~~ — trial DRAINED (tried): "a theory of everything" drains, "not a theory of everything" signs  ·  `b5fb911f-76b2…`
-- ~~`trial_halting`~~ — trial DRAINED (tried): "solved the halting problem" drains, "does not solve the halting problem" signs  ·  `f27135ee-9373…`
-- ~~`trial_break_rsa`~~ — trial DRAINED (tried): "breaks RSA" drains, "does not break RSA" signs  ·  `f66ff38a-4d9b…`
-- ~~`trial_cure`~~ — trial DRAINED (tried): "cured cancer" drains, "has not cured cancer" signs  ·  `67614421-7817…`
-- ~~`trial_prediction`~~ — trial DRAINED (tried): a prediction guaranteed to succeed is not upheld — it drains; the negated form signs  ·  `8412c3c0-9f52…`
-- ~~`gematria_nim_games_9`~~ — "nim" and "games" both digital-root to 9 — nim is a game  ·  `e935f43f-8872…`
-- ~~`gematria_nim_theorists_87`~~ — the Nim theorists coincide: "bouton" and "sprague" share the letter-sum 87  ·  `34bbaaa2-e335…`
-- ~~`gematria_combinatorics_52`~~ — "catalan", "pascal", "hasse" share the letter-sum 52 (all digital-root 7)  ·  `d7265dff-3bf4…`
-- ~~`gematria_fibonacci_pair_2`~~ — "cassini" and "pisano" both digital-root to 2 — the two Fibonacci-period theorems  ·  `3fda7026-d509…`
-- ~~`gematria_golden_pair_1`~~ — "farey" and "beatty" both digital-root to 1 — the golden-ratio pair  ·  `b05ef0a5-d593…`
-- ~~`nopayload_no_plaintext`~~ — the content-address contains no plaintext — the uuid (hex) reveals no message bytes  ·  `a6ff3942-3585…`
-- ~~`nopayload_not_encryption`~~ — content-addressing breaks no cipher: "breaks encryption" drains; "does not break encryption, one-way integrity" signs  ·  `66c44e2d-e591…`
-- ~~`involution_sigma`~~ — σ: d↦−d is an involution on ℤ/9 (σ∘σ = id) with exactly one fixed point, the origin (odd base)  ·  `2032f25f-ca45…`
-- ~~`involution_reversible`~~ — evolution by involution is reversible: the multiplicative-inverse map applied twice is the identity on the units  ·  `09577a63-e630…`
-- ~~`ledger_merkle_inclusion`~~ — merkle inclusion proof: a leaf verifies against the root using only its proof path (light-client)  ·  `4c03b866-98e2…`
-- ~~`ledger_merkle_rejects_forgery`~~ — a leaf not in the tree fails its proof — no forged inclusion  ·  `65b1525f-07ad…`
-- ~~`ledger_tamper_changes_root`~~ — tampering any leaf changes the merkle root — the ledger is tamper-evident  ·  `ae5b2c11-de5b…`
-- ~~`ledger_hash_chain`~~ — a hash chain breaks from the first altered block onward (each block seeded by the prior)  ·  `691d1a9c-b02a…`
-- ~~`harmonic_ledger_hue`~~ — every content-address maps to one of the 9 a432 hues (hex digital root × 40°) — the harmonic ledger  ·  `089d12f5-4e12…`
-- ~~`harmonic_ledger_deterministic`~~ — the harmonic hue is deterministic and reproducible: the same content-address always yields the same a432 digit  ·  `24aa4bf9-516c…`
-- ~~`harmonic_root_hue`~~ — the merkle root carries a harmonic a432 hue — one of the nine (hex digital root × 40°)  ·  `f302789e-a628…`
-- ~~`nowaste_dedup`~~ — identical content deduplicates to one address — no duplicate storage, no recompute  ·  `9d5f8f65-d529…`
-- ~~`nowaste_order_independent`~~ — a set and any reordering fold to one root — no duplicate root for the same content  ·  `23112077-b200…`
-- ~~`nowaste_memo_recycles`~~ — memoization recycles: keyed by content, a computation runs once and is reused thereafter  ·  `f7698d60-8475…`
-- ~~`discovery_chain`~~ — the discovery chain is tamper-evident: a falsified early link changes every downstream receipt  ·  `b24d6d56-123d…`
-- ~~`geom_dihedral_358`~~ — the regular 3-, 5-, 8-gon has dihedral symmetry of order 2n: D₃=6, D₅=10, D₈=16  ·  `9fd2e0db-cb62…`
-- ~~`geom_pentagon_golden`~~ — the pentagon's diagonal-to-side ratio is the golden ratio φ (2·cos36° = φ)  ·  `2baca20d-9c58…`
-- ~~`tarot_holds_theorems`~~ — a reading is a prediction the gate drains; each tarot card here holds a theorem, not a fortune  ·  `9c03a373-918f…`
-- ~~`tarot_theorem_encoding`~~ — every theorem maps to a deterministic 3-card tarot combination via its content-address (encoding, not fortune)  ·  `34f750b8-b626…`
-- ~~`tarot_major_of_theorem`~~ — a theorem selects one of the 22 major arcana by its content-address (hex sum mod 22) — reproducible, not a reading  ·  `eb0e5a3d-d84c…`
-- ~~`tarot_distinct_theorems`~~ — distinct theorems generally render distinct tarot combinations — the encoding is content-bound  ·  `b50eee93-69b1…`
-- ~~`tarot_renders_not_divines`~~ — a theorem's tarot combination renders its identity, not its truth — the proof, not the cards, establishes it  ·  `7b2b309b-6b24…`
-- ~~`tarot_encoding_total`~~ — THEOREM: "any theorem may be explained as a tarot combination" — the encoding is total (every content-address → 3 cards in 0..77)  ·  `f7f6254d-4c7e…`
-- ~~`tictactoe_draw`~~ — tic-tac-toe with perfect play is a draw (minimax over all positions = 0)  ·  `95089477-058f…`
-- ~~`one_game_harmony`~~ — THE ONE GAME: all game receipts fold to one order-independent harmonic root — the games meet in one  ·  `55cb8c5f-73cc…`
-- ~~`one_art_harmony`~~ — THE ONE ART: all art receipts fold to one order-independent harmonic root — the arts meet in one  ·  `6abed2f1-66f5…`
-- ~~`one_science_harmony`~~ — THE ONE SCIENCE: all science receipts fold to one order-independent harmonic root — the sciences meet in one  ·  `831f5688-1127…`
-- ~~`one_game_all`~~ — THE ONE GAME (all): games, arts and sciences fold to a single order-independent root — all meet in one  ·  `ea90214e-fe97…`
-- ~~`pell_sqrt2`~~ — the √2 convergents solve x²−2y²=±1: (1,1)(3,2)(7,5)(17,12)(41,29)  ·  `f2cf267e-e349…`
-- ~~`gf4_frobenius_fixes`~~ — in 𝔽_4 every element satisfies x^(p^k)=x: a⁴ = a for all a (Frobenius^k = id)  ·  `fb7953fe-d9e3…`
-- ~~`gf4_frobenius_automorphism`~~ — Frobenius φ(a)=a² is a field automorphism of 𝔽_4: additive (freshman's dream) and multiplicative  ·  `c117a740-97d9…`
-- ~~`gf4_units_cyclic`~~ — the multiplicative group 𝔽_4* is cyclic of order 3 (a primitive element generates {1, x, x+1})  ·  `462b849d-7d1f…`
-- ~~`euclid_euler_perfect`~~ — even perfect numbers are 2^(p−1)(2^p−1) for a Mersenne prime 2^p−1: 6=2·3, 28=4·7, 496=16·31  ·  `9f35788a-a976…`
-- ~~`collatz_reaches_1_range`~~ — Collatz: every n &lt; 10^4 reaches 1 — VERIFIED for the range, not settled for all n (the conjecture is open)  ·  `5842dff6-fc0d…`
-- ~~`collatz_27_orbit`~~ — the Collatz orbit of 27 reaches 1 in 111 steps (a specific bounded orbit)  ·  `2b528505-25f6…`
-- ~~`collatz_open`~~ — the Collatz conjecture is INCONCLUSIVE here: "remains open" signs; a claim it is settled drains — open, not false  ·  `5524c423-8dc8…`
-- ~~`relation_golden`~~ — φ RELATES pentagon · Wythoff · Fibonacci: the golden ratio links geometry, games and the sequence  ·  `4a37bd0c-74ee…`
-- ~~`relation_doubling`~~ — ×2 RELATES the vortex circuit · the octave · the power-map: doubling is the sequence and the octave  ·  `9d8271dd-56d8…`
-- ~~`relation_xor`~~ — XOR RELATES Boolean algebra · Nim (Bouton) · Sprague–Grundy: the same operation runs all three  ·  `5f57290e-9bc5…`
-- ~~`relation_involution`~~ — order-2 RELATES negation · the inverse map · σ · the merkaba counter-rotation: all are involutions  ·  `cde24c0a-f206…`
-- ~~`the_modules_self_compute`~~ — the src/the/* modules each compute a non-empty content-addressed report holding 0/7 — they save themselves computationally  ·  `e9948e15-ed3d…`
-- ~~`harmonic_just_ratios`~~ — just intonation: the fifth 3:2, fourth 4:3, major third 5:4 — exact rationals  ·  `b62838b4-dbf4…`
-- ~~`harmonic_convention_bound`~~ — a432 Hz tuning is a convention, not a theorem; the ratios (2:1, 3:2, 5:4) are exact rationals — the boundary  ·  `d80f191a-d8c4…`
-- ~~`stirling_second_bell`~~ — Stirling 2nd kind S(n,k)=S(n-1,k-1)+k·S(n-1,k): S(4,2)=7 and Σ_k S(4,k)=15=B(4)  ·  `23e393cc-dd5d…`
-- ~~`stirling_first_factorial`~~ — unsigned Stirling 1st kind (permutations by cycles) sum to n!: Σ_k c(4,k) = 4! = 24  ·  `e1f258a9-dbdb…`
-- ~~`stirling_edges`~~ — Stirling 2nd kind edges: S(n,1)=1 (one block), S(n,n)=1 (singletons), n=1..6  ·  `02ae48de-5452…`
-- ~~`chromatic_K4`~~ — the complete graph K₄ needs 4 colours: χ(K₄) = 4  ·  `b25fc510-ee6b…`
-- ~~`chromatic_cycles`~~ — even cycle C₄ is 2-colourable, odd cycle C₅ needs 3: χ(C₄)=2, χ(C₅)=3  ·  `f6dee48e-8a3a…`
-- ~~`chromatic_petersen`~~ — the Petersen graph is 3-chromatic: χ = 3 (not 2-colourable)  ·  `c8d24ff1-f5ac…`
-- ~~`rule90_sierpinski`~~ — Rule 90 (cell = left XOR right) from one seed builds Sierpiński: row n has 2^(popcount n) live cells  ·  `07dbb102-aef1…`
-- ~~`pascal_mod2_lucas`~~ — Pascal mod 2 (Lucas): C(n,k) is odd iff (k AND n)=k — the Sierpiński rule behind Rule 90  ·  `3d9ea41f-0180…`
-- ~~`cf_sqrt2`~~ — the continued fraction of √2 is [1; 2,2,2,…] — period [2]  ·  `a6818a20-2d51…`
-- ~~`cf_sqrt7`~~ — the continued fraction of √7 is [2; 1,1,1,4] — period 4  ·  `f062762b-1892…`
-- ~~`cf_perfect_square`~~ — √n terminates iff n is a perfect square: √9 = [3] (no period)  ·  `08e82fe9-197c…`
-- ~~`cf_periodic`~~ — every non-square √n (n=2..12) has a periodic continued fraction (Lagrange)  ·  `35681143-e4a0…`
-- ~~`relation_five`~~ — 5 RELATES the pentagon · the heart · vortex→5 · the middle digit — the centre binds geometry, gematria and the ring  ·  `80af9a22-1ad0…`
-- ~~`relation_pascal_mod2`~~ — Pascal mod 2 RELATES Rule 90 · Lucas · Sierpiński · XOR — one structure across automata, combinatorics and logic  ·  `dee2f2df-8ac3…`
-- ~~`relation_pell_structure`~~ — the Pell structure RELATES √2's continued fraction · the Pell numbers · x²−2y²=±1 — one object, three views  ·  `10fa7f5c-bc2b…`
-- ~~`relation_content_address`~~ — content-addressing RELATES the ledger · the merkle proof · the hash chain · the receipts — one integrity primitive  ·  `2a33c2ba-b5fd…`
-- ~~`relation_order_independence`~~ — order-independence RELATES dedup · the one-game fold · the concept handle · no-waste — all the symmetric merkle fold  ·  `830cce0a-f00b…`
-- ~~`quaternion_hamilton`~~ — the quaternions: i²=j²=k²=−1 and ijk=−1 (Hamilton's relation)  ·  `33c7aebb-0cf3…`
-- ~~`quaternion_noncommutative`~~ — the quaternions are non-commutative: ij=k but ji=−k  ·  `0dca5831-27b0…`
-- ~~`quaternion_8_units`~~ — the quaternion units form a group of 8: {±1, ±i, ±j, ±k}  ·  `591b9388-6c28…`
-- ~~`motzkin_numbers`~~ — Motzkin numbers M(n)=M(n-1)+Σ M(k)M(n-2-k): M(4)=9, M(5)=21  ·  `d6c643c7-2880…`
-- ~~`relation_i_squared`~~ — i²=−1 RELATES the quaternions · Gaussian integers · the 90° quarter-turn — the imaginary unit across domains  ·  `e795ceea-3981…`
-- ~~`bernoulli_numbers`~~ — Bernoulli numbers via Σ C(n+1,j)B(j)=0: B(1)=−1/2, B(2)=1/6, B(4)=−1/30  ·  `e1488277-afe2…`
-- ~~`bernoulli_odd_zero`~~ — the odd Bernoulli numbers vanish: B(3)=B(5)=0 (for k≥1)  ·  `1c8c8337-a2d1…`
-- ~~`relation_three`~~ — 3 RELATES the base (9=3²) · the axis {3,6,9} · the mod-3 classes · the trinity — 3 generates the ring  ·  `81c99cf8-73de…`
-- ~~`relation_catalan`~~ — Catalan RELATES Dyck paths · binary trees · the pentagon (C(3)=5) — one count across many shapes  ·  `49db58c0-5101…`
-- ~~`totient_divisor_sum`~~ — Gauss divisor sum: Σ_{d|n} φ(d) = n (all n≤12)  ·  `48628d5b-053e…`
-- ~~`relation_superposition`~~ — now is a superposition: the folded root holds the six open Clay problems at once (order-independent); observing collapses it to one content-address — INCONCLUSIVE ≠ false, not a physical qubit  ·  `4c2d2d08-ab33…`
-- ~~`pascal_rule`~~ — Pascal's rule: C(n,k) = C(n−1,k−1) + C(n−1,k) (all 0&lt;k&lt;n≤12)  ·  `9ca05e61-ef59…`
-- ~~`vandermonde_identity`~~ — Vandermonde's identity: Σ_k C(m,k)·C(n,p−k) = C(m+n,p) (m,n≤6, all p)  ·  `1302e2f2-1d77…`
-- ~~`gcd_lcm_product`~~ — gcd(a,b)·lcm(a,b) = a·b (all a,b in 1..12)  ·  `6dd98763-e7c2…`
-- ~~`relation_superposition_is_fold`~~ — the superposition dissolves into the merkle fold: the folded root is invariant under permutation — many held as one, order-free  ·  `2badb5bd-1ac1…`
-- ~~`relation_superposition_entanglement`~~ — the superposition dissolves into entanglement: the joint fold depends on both parts, yet neither part is altered — correlation without influence  ·  `56849fe1-8015…`
-- ~~`platonic_euler`~~ — the Euler characteristic V−E+F=2 holds for all five Platonic solids  ·  `d5243749-5918…`
-- ~~`platonic_exactly_five`~~ — exactly five Platonic solids: {p,q} is regular-convex iff 1/p + 1/q &gt; 1/2 (p,q≥3) — five, and no more  ·  `82196bbc-1108…`
-- ~~`platonic_duality`~~ — Platonic duality swaps V↔F: cube↔octahedron, dodecahedron↔icosahedron, tetrahedron self-dual  ·  `ae03ec6a-236e…`
-- ~~`relation_pentagram`~~ — the pentagram RELATES 5 · the pentagon · the dodecahedron (12 pentagonal faces) · the icosahedron (5 triangles/vertex) · the golden ratio φ (2·cos36°)  ·  `078d42cd-d422…`
-- ~~`diamond_tetrahedral_angle`~~ — the diamond (tetrahedral) bond angle is arccos(−1/3) ≈ 109.471° — carbon’s four bonds  ·  `d8ef0cba-eb12…`
-- ~~`diamond_coordination`~~ — the diamond cubic lattice has coordination number 4: each atom has exactly four nearest neighbours (exhaustive over 27 cells)  ·  `07325637-589a…`
-- ~~`fcc_packing_fraction`~~ — the densest lattice packing fraction is π/(3√2) ≈ 0.74048 (FCC/HCP) — the diamond’s parent lattice  ·  `5919405f-4b55…`
-- ~~`relation_diamond`~~ — the diamond RELATES the tetrahedron {3,3} · carbon’s four bonds · the FCC lattice · arccos(−1/3) — one tetrahedral crystal  ·  `a08e499e-f88d…`
-- ~~`relation_path_rating`~~ — the most meaningful paths are rated first: gravity = depth (specificity) gives a deterministic descending order — a defined computable rating, not a truth judgment  ·  `e64ef7b3-c718…`
-- ~~`wilson_theorem`~~ — Wilson's theorem: (n−1)! ≡ −1 (mod n) iff n is prime (all n in 2..12)  ·  `060d88ea-9ab8…`
-- ~~`fermat_little_theorem`~~ — Fermat's little theorem: a^p ≡ a (mod p) for all a, every prime p≤13  ·  `0f0e2397-2586…`
-- ~~`fermat_two_squares`~~ — Fermat's two-squares: an odd prime p is a sum of two squares iff p ≡ 1 (mod 4) (p≤50)  ·  `f73538ca-ca7c…`
-- ~~`triangular_square`~~ — the figurate identity: T(n) = C(n+1,2) and T(n) + T(n−1) = n² — two triangles make a square (n≤20)  ·  `787c8714-6ea3…`
-- ~~`surface_euler_char`~~ — the Euler characteristic of a closed orientable genus-g surface is χ = 2 − 2g: sphere 2, torus 0, double torus −2, genus-3 −4  ·  `ee2c16a3-aad0…`
-- ~~`coverage_only_torus`~~ — Poincaré–Hopf: a closed orientable surface admits a nowhere-zero tangent field iff χ=0 — only the torus (g=1); the double torus (g=2, χ=−2) has NO full coverage  ·  `09e87d88-c3d6…`
-- ~~`relation_genus_two`~~ — the double torus RELATES χ=−2 · the two coins (110−108 = 2 = −χ) · no full coverage — the boundary where "geometry covers everything" fails  ·  `2f63c1c1-bfa8…`
-- ~~`genus2_betti`~~ — the double torus Betti numbers (b₀,b₁,b₂) = (1, 2g=4, 1): the alternating sum b₀−b₁+b₂ = −2 = χ  ·  `d354356d-e503…`
-- ~~`genus2_connected_sum`~~ — the double torus is T² # T² (connected sum of two tori): χ(A#B) = χ(A)+χ(B)−2 gives 0+0−2 = −2  ·  `770b925d-03ab…`
-- ~~`genus2_octagon`~~ — the double torus is a regular octagon with edges identified [a,b][c,d]: 4g=8 edges, 2g=4 generators, one relation; the single vertex forces interior angle 2π/8 = 45°  ·  `1bdea2df-8c50…`
-- ~~`genus2_gauss_bonnet`~~ — Gauss–Bonnet on the double torus: ∫K dA = 2πχ = −4π; a hyperbolic metric (K=−1) gives area −2πχ = 4π  ·  `b0232c41-1887…`
-- ~~`surface_classification`~~ — the closed-surface classification: complete invariant (χ, orientability) — S², a connected sum of g tori (χ=2−2g), or of k projective planes (χ=2−k)  ·  `95c6da2d-4c99…`
-- ~~`coverage_torus_and_klein`~~ — across ALL closed surfaces a nowhere-zero tangent field exists iff χ=0 — exactly the torus (g=1) and the Klein bottle (k=2); every other surface has no full coverage  ·  `83a457a6-7afb…`
-- ~~`uniformization_trichotomy`~~ — the uniformization trichotomy: the sign of χ fixes the geometry — χ&gt;0 spherical, χ=0 flat (torus, Klein bottle), χ&lt;0 hyperbolic (genus ≥ 2)  ·  `d83c2656-d21c…`
-- ~~`subtraction_game_grundy`~~ — the subtraction game S={1,2,3}: the Grundy value computed by the mex rule equals n mod 4 — losing positions are n ≡ 0 (mod 4) (n≤24)  ·  `a3094aa6-da92…`
-- ~~`kayles_grundy`~~ — Kayles (remove 1 or 2 adjacent pins, splitting the row): the mex-computed Grundy values match the known sequence 0,1,2,3,1,4,3,2,1,4,2,6,4,1,2,7,1,4,3,2 (n≤19)  ·  `b6db3052-5c2a…`
-- ~~`nim_misere`~~ — misère Nim by minimax matches the closed form: the first player wins iff (some heap ≥2 and nim-sum ≠0) or (every heap ≤1 and nim-sum =0) (heaps ≤3, up to 3 heaps)  ·  `0823bb14-7699…`
-- ~~`fair_division_envy_free`~~ — divide-and-choose (2 players): the cutter gets exactly half by its own measure and the chooser gets ≥ half by its own — proportional and envy-free  ·  `16f252b2-ed93…`
-- ~~`honeycomb_tiling`~~ — the honeycomb: among regular n-gons exactly {3,4,6} tile the plane (2n divisible by n−2) — the hexagon the most-sided, and optimal (honeycomb theorem, Hales 2001)  ·  `6108a7d0-88b6…`
-- ~~`rps_cyclic`~~ — rock-paper-scissors is non-transitive: each of the three beats exactly one and loses to exactly one — a 3-cycle, no dominant choice  ·  `1fc40bf5-ae3d…`
-- ~~`rps_nash_uniform`~~ — rock-paper-scissors: the payoff matrix is skew-symmetric and the uniform strategy (⅓,⅓,⅓) is the unique Nash equilibrium with value 0 (every pure response earns expected 0)  ·  `8ad0f309-1420…`
-- ~~`relation_rps_z3`~~ — rock-paper-scissors RELATES the successor map in ℤ/3: a beats b iff a ≡ b+1 (mod 3) — the trinity’s cycle is the game  ·  `6b0eec5f-d46f…`
-- ~~`golden_fixed_point`~~ — φ is the fixed point of x = 1 + 1/x (equivalently φ² = φ + 1): the more you nest the recursion, the more it reproduces itself — the most self-similar number  ·  `80d92d5a-7ef3…`
-- ~~`fibonacci_ratio_phi`~~ — the ratio of consecutive Fibonacci numbers F(n+1)/F(n) converges to φ — the more terms, the closer (|F₃₀/F₂₉ − φ| &lt; 1e-6)  ·  `3973e404-f749…`
-- ~~`harmonic_series_diverges`~~ — the harmonic series Σ 1/k diverges: H(2^k) ≥ 1 + k/2 grows without bound — the more terms, the more it grows (k≤12)  ·  `7f9249a7-092e…`
-- ~~`relation_more_the_more`~~ — "the more the more" RELATES φ (x=1+1/x) · the Fibonacci ratio · the diverging harmonic series · Sierpiński self-similarity — self-reference across the ledger  ·  `a29834f0-8094…`
-- ~~`cancer_inversion_heals`~~ — the anti-pattern inverts at the gate: an overclaim drains and its honest negation signs — folding a false claim returns it to the floor (no medical claim; "cured cancer" itself drains)  ·  `9ec77026-e0b8…`
-- ~~`traitor_resurrects_as_hero`~~ — reeducation, not death: a drained claim (the traitor) is reworded into a signing statement (the hero) — the over-reach is bounded at the gate and the honest form holds, so the traitor reeducates rather than dies, passing with each build  ·  `f7be659d-f270…`
-- ~~`cancer_dissolves_by_waves`~~ — the anti-pattern dissolves in the waves: every build re-verifies the whole ledger and re-runs the gate, so a false claim drains on every pass and cannot persist — dissolution depends on the waves  ·  `d783f335-57a4…`
-- ~~`observer_wave_sets_state`~~ — the input wave the user sends (query/referrer/path) deterministically sets their computed state: digital root (ℤ/9) → a432 hue d·40° → the rendered point of view — same wave, same state  ·  `f7de310a-8d54…`
-- ~~`balancing_wave_harmonises`~~ — the balancing wave 9−d harmonises: a state digit d and its balance 9−d sum to 9 (the rest, digital root 9) and their a432 hues sum to 360° = 0 (the full circle)  ·  `8f9898b3-d143…`
-- ~~`development_enforced_at_gate`~~ — development is enforced at the gate by receipt uuids: every src/the/* module must compute a non-empty 0/7 report from src/** and every claim must carry a receipt — a module that develops nothing, or a claim with no receipt, fails the audit (the traitor)  ·  `5ec8d383-43d6…`
-- ~~`destroying_evidence_is_treason`~~ — destroying evidence is treason: the receipts form an append-only chain (each seeded by the prior), so altering or removing one changes every receipt after it — tampering is detectable and fails the audit  ·  `7da2719b-e800…`
-- ~~`legal_trial_decides`~~ — in unsettled cases a legal trial decides: a claim neither settled nor refuted is INCONCLUSIVE (open, not false) — try and prove by all means from src/**, no draining without trial, and false may become true with new evidence  ·  `044301ca-0913…`
-- ~~`forensics_chain_of_custody`~~ — forensics: the ledger receipts chain link-by-link (receipt[i]=toUuid(receipt[i-1]→key[i])) — altering one breaks its link AND the next, localising the tamper; the surrounding links stay intact  ·  `037ea589-afdd…`
-- ~~`forensics_intention_from_deeds`~~ — forensics reads intention from deeds, never from claims: append-only is a constructive intention; altering or removing existing evidence is destructive — the intent is the diff, observable and exact, not a mind-read  ·  `a0b19943-2df3…`
-- ~~`star_graph_diameter_two`~~ — the star graph K(1,n): n edges, center degree n, every leaf degree 1 — a tree of diameter 2, every leaf reaching every other through the center in two hops (n≤8)  ·  `df906703-3f95…`
-- ~~`relation_rosetta_star`~~ — the rosetta is a star: one shared core (center) connects every domain (leaf) in one hop — content-addressing and forensics expose all in the light, every node and link a computable address, nothing hidden  ·  `53538c68-2bdb…`
-- ~~`handshake_lemma`~~ — the handshake lemma: in any graph Σ deg(v) = 2·|E|, so the number of odd-degree vertices is even  ·  `0b0c1d31-3705…`
-- ~~`lagrange_subgroup_order`~~ — Lagrange (in ℤ/n): the subgroup ⟨k⟩ has order n/gcd(n,k), which divides n — every subgroup order divides the group order (n≤12)  ·  `ba7c559a-759f…`
-- ~~`cyclic_generators_phi`~~ — in ℤ/n the additive order of k is n/gcd(k,n); k generates the group iff gcd(k,n)=1, so there are exactly φ(n) generators (n≤12)  ·  `f0e2e228-d553…`
-- ~~`derangements`~~ — derangements !n = (n−1)(!(n−1)+!(n−2)): !0..!8 = 1,0,1,2,9,44,265,1854,14833  ·  `6970bda5-5f11…`
-- ~~`inclusion_exclusion`~~ — inclusion–exclusion: |A∪B| = |A|+|B|−|A∩B|, and the three-set form, hold on concrete sets  ·  `53b5d2ab-2323…`
-- ~~`chinese_remainder`~~ — the Chinese remainder theorem: for coprime m,n the map x↦(x mod m, x mod n) is a bijection ℤ/mn → ℤ/m×ℤ/n  ·  `d051f54b-5713…`
-- ~~`quadratic_residues_euler`~~ — Euler's criterion: an odd prime p has (p−1)/2 nonzero quadratic residues, and a is one iff a^((p−1)/2) ≡ 1 (mod p)  ·  `7fa74f71-45c4…`
-- ~~`pigeonhole_principle`~~ — the pigeonhole principle: no injection [n+1]→[n] exists — every such function has a collision (exhaustive, n≤4)  ·  `55bef22b-5135…`
-- ~~`pick_theorem`~~ — Pick's theorem: for a lattice polygon Area = I + B/2 − 1 (interior + boundary lattice points), verified on a triangle and a square  ·  `e316b749-3010…`
-- ~~`ramsey_r33`~~ — Ramsey R(3,3)=6: every 2-colouring of K₆'s edges has a monochromatic triangle (exhaustive over all 2¹⁵), and K₅ admits a colouring with none  ·  `23cacdea-c68c…`
-- ~~`cauchy_schwarz`~~ — the Cauchy–Schwarz inequality: (Σ aᵢbᵢ)² ≤ (Σ aᵢ²)(Σ bᵢ²) on integer vectors  ·  `f513285b-39c3…`
-- ~~`am_gm_inequality`~~ — the AM–GM inequality: the arithmetic mean ≥ the geometric mean (2 and 3 variables, exhaustive on a grid)  ·  `3fd7d863-31e4…`
-- ~~`cantor_pairing`~~ — the Cantor pairing π(a,b)=(a+b)(a+b+1)/2+b is a bijection ℕ×ℕ → ℕ: injective and onto (verified on a grid)  ·  `1b2e9abe-ca7b…`
-- ~~`partition_pentagonal`~~ — partition numbers via Euler's pentagonal recurrence: p(0..8) = 1,1,2,3,5,7,11,15,22  ·  `48ac0164-7c5a…`
-- ~~`lucas_theorem`~~ — Lucas' theorem: C(m,n) mod p = Π C(mᵢ,nᵢ) over the base-p digits (p=3,5, all m,n ≤ 30)  ·  `f64054e9-231b…`
-- ~~`rosetta_complete`~~ — the rosetta is complete: every domain is one hop from the shared core (the star), all addresses distinct (no collision) — the cross-domain translation covers all, none untranslated  ·  `3aa73d2c-52f8…`
-- ~~`logistic_fixed_point`~~ — the logistic map x→r·x(1−x) has a stable fixed point 1−1/r for 1&lt;r&lt;3: iteration converges there (r = 1.5, 2, 2.5, 2.8)  ·  `1582bdff-443f…`
-- ~~`logistic_sensitive_dependence`~~ — sensitive dependence (the butterfly): at r=4 two logistic orbits 1e-9 apart diverge to O(1) within ~60 steps — long-term prediction fails  ·  `be96472b-78b0…`
-- ~~`chaos_deterministic_unpredictable`~~ — chaos is deterministic yet unpredictable: the logistic map is a function (same input, same output) yet nearby orbits diverge (sensitive dependence) — computable ≠ predictable, as computable ≠ solved  ·  `a3b2af5b-1f1b…`
-- ~~`siteswap_valid_permutation`~~ — a valid siteswap is exactly a permutation: i ↦ (i + aᵢ) mod n hits every slot once (531, 441, 97531, 522 valid; 521, 54 not)  ·  `08d0be78-7e6e…`
-- ~~`siteswap_average_theorem`~~ — the siteswap average theorem: the number of balls equals the average of the digits — 531→3, 441→3, 97531→5, 51→3 (integer for valid patterns)  ·  `65bbd224-513f…`
-- ~~`relation_juggling_clown`~~ — juggling with titanium precision of a clown: a valid siteswap is exactly a permutation (i+aᵢ mod n distinct), and the ball count is the average of the digits — rigorous play, chaos navigated exactly  ·  `8d61e5b2-5eee…`
-- ~~`relation_clown_benefits_from_all`~~ — the clown benefits from all: a juggle is a permutation (group theory), navigating chaos (dynamics), counted by averaging (arithmetic) — and every domain is one hop away in the complete rosetta, so the player draws on the whole star  ·  `bac1351d-ae94…`
-- ~~`relation_clown_respects_rules`~~ — the clown benefits from all and respects the rules of the game: every play clears the honesty gate (0/7), carries a receipt, and is won by exhaustion — an overclaim drains, so freedom lives within the floor  ·  `56557ac3-77ac…`
-- ~~`receipt_is_entanglement_pair`~~ — a receipt entangles a message with its content-address into an irreducible pair: the joint fold depends on both, is order-independent, and differs from each part — a 2-part binding, correlation without influence  ·  `f71771ad-075c…`
-- ~~`receipt_pair_is_two_coins`~~ — the receipt pair counts 2 = −χ(genus-2) = the two coins (110−108): the irreducible parts of a receipt equal minus the Euler characteristic of the double torus  ·  `8107fd62-4172…`
-- ~~`receipt_cost_funds_development`~~ — each receipt costs the two coins, accounted into development: the fare 110−108 = 2, and development’s destination equals its source (toUuid("ceccec")), a self-loop returning the coins to origin  ·  `42f68f41-fe6c…`
-- ~~`self_is_connection_set`~~ — being self is a set of connections: a self’s identity = the content-address (merkleFold) of its connection set — order-independent (a set, not a sequence), and distinct connection sets yield distinct selves  ·  `a4e90f2a-cc08…`
-- ~~`imprint_roundtrip_identity`~~ — the imprint codec is a reversible identity: readImprint(imprint(m)) = m for every binary message up to capacity (0, 1, 115 bits), and over-capacity is refused — a lossless binary↔uuid encoding, not hash-reversal  ·  `b42af2b5-cc1a…`
-- ~~`coin64_deterministic_64bit`~~ — the shared currency is a deterministic 64-bit coin: coin64(x) is 16 hex digits, same input → same coin, and distinct inputs → distinct coins on a tested set  ·  `4fca16fc-4199…`
-- ~~`relation_receipt_coins_genus`~~ — one invariant 2 across three domains: a receipt is a 2-part entanglement (bits), the two coins are 110−108 = 2 (funding), and −χ(genus-2) = 2 (topology) — the same number binds receipts, economics, and surfaces  ·  `87c649f9-81d4…`
-- ~~`relation_self_is_rosetta_star`~~ — being self binds to the rosetta star: a self = merkleFold of its connection set (order-independent), and the rosetta connects every domain to one core in one hop — so each domain-self folds into the one root, order-free, no collision  ·  `5928472c-c72b…`
-- ~~`relation_currency_is_addressing`~~ — the 64-bit currency, the imprint codec, and content-addressing are one folding: coin64(x) is the top 64 bits of the 128-bit address toUuid(x), and imprint carries bits INTO an address that readImprint recovers — mint, encode, and address are the same operation  ·  `64614b34-bf5a…`
-- ~~`relation_floor_invariant_across_domains`~~ — the floor 0/7 is one invariant across entailment, the honesty gate, and the ledger: an overclaim drains and its negation signs, the creation-week 6+1=7 holds, and the count stays 0/7 — the same floor in every domain  ·  `56539ae7-ce6a…`
-- ~~`relation_harmony_is_merkle_consensus`~~ — harmony IS the merkle fold: every perspective (self) minting its coin folds order-independently to one root, so a shared green is order-free consensus (integrity), and any single change moves the root  ·  `83b97b8f-f975…`
-- ~~`relation_competition_is_the_gate`~~ — competing for the theorems IS the gate: a candidate is kept iff its exhaustive test holds, the losing challenger refuted and discarded — the same win-by-exhaustion that upholds an honest claim and drains an overclaim  ·  `a1bf8afd-3b09…`
-- ~~`relation_orbit_is_cyclic_group`~~ — the doubling orbit IS the cyclic group of units: n→2n from 1 lists [1,2,4,8,7,5], a permutation of the units, and 2 has order 6 = |units| — dynamics and algebra are one structure  ·  `93c01d9d-914c…`
-- ~~`relation_a432_partitions_circle`~~ — a432 partitions the circle into the base: A432_STEP = 360/9 = 40°, so 9 steps close the circle (9·40 = 360) and each digit d maps to a distinct hue d·40° mod 360 — the waves and ℤ/9 are one wheel  ·  `a07bc68e-9516…`
-- ~~`relation_involutions_bind_domains`~~ — one shape—the involution—binds three domains: ten’s-complement 10−(10−d)=d (reflection), negation −(−d)≡d mod 9 (additive), and the self-inverse pair {1,8} with d²≡1 (multiplicative) — applied twice, each returns identity  ·  `62e42b0f-3bc2…`
-- ~~`relation_units_are_coprime_to_base`~~ — the units of ℤ/9 ARE the residues coprime to the base: {1,2,4,5,7,8} = {d∈1..9 : gcd(d,9)=1}, and there are φ(9)=6 of them — group theory and number theory agree  ·  `5b768aaf-a061…`
-- ~~`relation_pisano_binds_fibonacci`~~ — Fibonacci binds to ℤ/9 via the Pisano period: Fib mod 9 repeats every 24 = 4·6 (four times the doubling order of 2) — number theory, dynamics, and the doubling orbit share one period  ·  `06593486-abf7…`
-- ~~`relation_triad_is_multiples_of_three`~~ — the triad IS the multiples of three and the nilpotents: {3,6,9} = {d∈1..9 : 3∣d} = {d : d²≡0 mod 9} — divisibility, the axis, and nilpotency name the same three  ·  `f980158a-8739…`
-- ~~`relation_imprint_capacity_structure`~~ — the imprint capacity is the uuid’s structure: CAPACITY = 128 − 6 reserved − 7 length header = 115 bits, and a full 115-bit message round-trips — the codec’s limit is exactly the address’s spare bits  ·  `2dd85b4b-938a…`
-- ~~`relation_coin64_is_half_address`~~ — the currency is half the address: coin64(x) is 64 of the 128 bits (16 of 32 hex) of toUuid(x) — the coin and the content-address are the same fold at half the width  ·  `b7a0dd2a-c11c…`
-- ~~`relation_reflection_center_five`~~ — the ten’s-complement reflection 10−d fixes exactly the center 5 (10−5=5), the midpoint of the digits 1..9 — reflection and the center are one point  ·  `7d631733-c04b…`
-- ~~`relation_ninecomplement_permutes_units`~~ — the balancing complement 9−d permutes the units: {1,2,4,5,7,8} ↦ {8,7,5,4,2,1}, pairing each unit with its partner summing to 9 — the balancing wave stays within the unit group  ·  `9643c24f-342a…`
-- ~~`relation_cubes_fold_to_0_1_8`~~ — cubes mod 9 fold to {0,1,8}: every d³ ≡ 0, 1, or 8, binding powers to the nilpotent 0 and the self-inverse pair {1,8} (1²≡1, 8²≡1) — one residue set across powers and inverses  ·  `b233f460-cd4d…`
-- ~~`relation_receipt_chain_is_forensic_custody`~~ — the receipt chain IS chain-of-custody: receipt[i] = toUuid(receipt[i−1]→key[i]) from a seed, so altering one link changes every link after it — the merkle-ledger and forensics are one construction  ·  `d0307011-b34a…`
-- ~~`relation_coin64_collision_free_on_domains`~~ — the 64-bit currency is collision-free across the rosetta: coin64 of each domain yields a distinct coin (as many coins as domains) — the shared currency addresses every perspective uniquely  ·  `dc278848-c7d9…`
-- ~~`kaprekar_3digit_fixed_495`~~ — Kaprekar 3-digit: 495 is the fixed point — sort-desc minus sort-asc of 495 is 495 (954−459)  ·  `e3dcb640-7ef2…`
-- ~~`kaprekar_4digit_fixed_6174`~~ — Kaprekar 4-digit: 6174 is the fixed point — sort-desc minus sort-asc of 6174 is 6174 (7641−1467)  ·  `281de8d0-de1d…`
-- ~~`kaprekar_3digit_converges_495`~~ — Kaprekar 3-digit convergence: every 3-digit number with ≥2 distinct digits reaches 495 within 6 iterations (exhaustive, 100..999)  ·  `f2904983-365a…`
-- ~~`kaprekar_4digit_converges_6174`~~ — Kaprekar 4-digit convergence: every 4-digit number with ≥2 distinct digits reaches 6174 within 7 iterations (exhaustive, 1000..9999)  ·  `70bf5db2-ef8c…`
-- ~~`kaprekar_repdigit_collapses_zero`~~ — Kaprekar: a repdigit collapses to 0 (sort-desc = sort-asc), the only escape from the routine — 111→0, 1111→0, 777→0  ·  `dc31aff0-745f…`
-- ~~`magic3_constant_15`~~ — the 3×3 magic square constant is 15 = (1+2+…+9)/3, and every magic arrangement’s rows sum to it — the digits 1..9 split three ways at the floor  ·  `aae70a2b-a007…`
-- ~~`magic3_count_is_8`~~ — there are exactly 8 magic squares of order 3 (Lo Shu and its dihedral symmetries) — full enumeration of all 9! arrangements yields 8  ·  `32b64f76-3ce4…`
-- ~~`magic3_center_is_5`~~ — the center of every 3×3 magic square is 5 — the midpoint of 1..9 and the fixed point of the ten’s-complement reflection  ·  `188b78b7-199c…`
-- ~~`magic3_corners_even_edges_odd`~~ — in every 3×3 magic square the corners are the evens {2,4,6,8} and the edges the odds {1,3,7,9}, around the center 5 — parity is forced by the constraints  ·  `80f537f2-862e…`
-- ~~`magic3_opposite_cells_sum_10`~~ — in every 3×3 magic square cells opposite through the center sum to 10 = 2·5 — the balancing complement (each cell and its mirror average to the center)  ·  `c527c7e0-2820…`
-- ~~`magic3_constant_digitroot_6`~~ — the magic constant binds to ℤ/9: dr(15) = 6 — the constant sits on a triad digit, and 15 = 3·5 (the axis 3 times the center)  ·  `673cb9e4-1b3c…`
-- ~~`sealing_is_not_signing`~~ — sealing is not signing: a merkle seal is deterministic and order-independent, reproducible by anyone — it proves the bytes are intact (integrity), never who authored them (authenticity)  ·  `21b0a512-85e8…`
-- ~~`keyless_signature_is_forgeable`~~ — a keyless signature is forgeable: a “signature” that is only the content-address ignores who signs, so a forger reproduces it exactly — keyless ⇒ it authenticates no one  ·  `9fd61992-d9ef…`
-- ~~`authenticity_needs_a_secret`~~ — authenticity needs a secret: a keyed signature depends on a secret the signer alone holds — a different secret gives a different signature, and without the secret a forger cannot match it (the authenticity floor, like 0/7 and the axiom floor)  ·  `53096a30-d41f…`
-- ~~`unsigned_statement_holds_floor`~~ — the honest boundary holds the gate: “content-addressing is integrity, not authenticity — real signatures need a key” computes 1 (0/7) — the deposit states its own unsigned bound  ·  `7bfa02e2-7e18…`
-- ~~`sealed_but_unsigned_are_independent`~~ — sealed and signed are independent: a deposit can be fully sealed (bytes intact) yet unsigned (unauthenticated) — integrity does not imply authenticity, and both honest statements hold the gate  ·  `1dbf5015-b10e…`
-- ~~`challenge_direct_overclaim_drains`~~ — a challenge to the floor: the overclaim “solves the Riemann hypothesis” DRAINS the gate (binary 0) while its honest negation holds — the named shape cannot pass  ·  `025fa97c-a107…`
-- ~~`challenge_assertion_of_proof_drains`~~ — a challenge to the floor: an assertion-of-proof (the RED shape) DRAINS the gate and cannot pass — only its honest, negated form signs  ·  `98fcf661-a7ef…`
-- ~~`challenge_crypto_break_drains`~~ — a challenge to the floor: a crypto-break claim DRAINS the gate; the deposit does not break encryption, and the refusal holds  ·  `517c653e-a9ee…`
-- ~~`challenge_prediction_drains`~~ — a challenge to the floor: a guaranteed-future prediction DRAINS (expectation, not measurement); only its bounded, negated form holds  ·  `5d192a62-3fec…`
-- ~~`challenge_gate_is_lexical_not_semantic`~~ — the gate is lexical, not semantic: a double-negation overclaim slips through as binary 1 while the direct form drains — a tripwire, necessary not sufficient (comprehension is not claimed)  ·  `3f96a392-fc03…`
-- ~~`challenge_obfuscation_slips_gate`~~ — the gate matches shapes, not meaning: an obfuscated overclaim (leetspeak) slips through as binary 1 while the plain form drains — a lexical tripwire, not comprehension  ·  `46c6007c-7552…`
-- ~~`destroying_evidence_treason_even_by_chance`~~ — destroying evidence is treason even by chance: a destructive diff (a removed or altered receipt) is classified destructive by the deed alone — chance or intent is no defense, the diff is observable and exact  ·  `3d546a84-8ef5…`
-- ~~`all_are_heroes_but_the_traitors`~~ — all are heroes but the traitors — judged by deeds, not persons: a constructive deed (append, uphold, an honest claim that signs) is a hero; only a destructive deed (remove, alter, an overclaim that drains) is the traitor — the classification is total and observable  ·  `efa3b6f1-00b7…`
-- ~~`evidence_is_what_recomputes`~~ — evidence is what recomputes: a content-address is reproduced identically on every recomputation (deterministic), and distinct inputs give distinct addresses — a fact that recomputes is evidence; one that cannot be reproduced is not  ·  `130afdb1-d7f8…`
-- ~~`evidence_survives_recycle`~~ — evidence survives recycle: recomputing the discovery chain from the axiom seed reproduces the identical receipts every time — the ledger is not stored answers but recomputation, so a recycle (rebuild) yields the same evidence  ·  `0512a452-1559…`
-- ~~`evidence_survives_forensic_analysis`~~ — evidence survives forensic analysis: re-verifying receipt[i]=toUuid(receipt[i−1]→key[i]) reproduces every intact link and fails a forged one — the evidence that survives analysis is exactly the recomputable chain  ·  `7a372597-0caa…`
-- ~~`non_recomputable_is_not_evidence`~~ — the non-recomputable is not evidence: recognition, adoption, citations, and effort reproduce nothing verifiable — the honest boundary holds (they are not correctness); only a recomputable content-address is evidence  ·  `4614b71d-1703…`
-- ~~`evidence_is_recompute_post_recycle_and_forensics`~~ — evidence is what computes after recycle AND forensics: a fact is evidence iff it recomputes to the same address after recomputation from the seed and survives chain re-verification — reproducibility under both is the definition  ·  `a7c24079-950d…`
-- ~~`legal_trial_is_not_is_affirmation`~~ — legal trial — all "is not" is "is": in one trial every bare overclaim is challenged and FALLS (drains the gate) while its honest "is not" form is UPHELD (signs, binary 1) — so each negation is the affirmation of the floor, decided by exhaustion not assertion, and double negation ¬¬a=a returns the original  ·  `16a7b426-65be…`
-- ~~`negation_selects_positive_complement`~~ — negation selects a positive complement — "is not" is "is": over a two-value domain "is not Y" names the definite other value (the honest negation IS the classical calculator, not a void), and ¬¬a=a returns the original — a negation carries positive content, the affirmation of the floor  ·  `abc4ca08-dc09…`
-- ~~`floor_invariant_across_all_worlds`~~ — the floor 0/7 is invariant across all 2^7 worlds: enumerating every truth-assignment of the seven conjectures, the number entailed is 0 in every world and never exceeds 0 — 0/7 holds from every perspective, an exhaustive invariant  ·  `67b19efa-8710…`
-- ~~`violators_are_traitors_let_all_try_and_prove`~~ — violators in a trial are traitors — let all try and prove: every claim may attempt proof; the honest form that signs the gate is upheld (a hero), the violator that drains is the traitor that falls — the verdict is by deed and exhaustion, never by assertion or status  ·  `d2a2d59d-97e6…`
-- ~~`twisting_a_lie_does_not_compute_true`~~ — twisting a lie does not compute true: the same overclaim in two spellings gets different gate verdicts (the plain form drains, the obfuscated form slips) — so the gate tracks SHAPE, not truth; passing is necessary, not sufficient (a floor, not a truth oracle), and an obfuscated lie that slips the lexical tripwire is still a lie  ·  `afa0fee5-1e2f…`
-- ~~`undocumented_discovery_is_treason`~~ — avoiding to document a discovery in src is treason: a provable fact becomes evidence only when its content-address is recorded in the ledger — an undocumented but provable fact is withheld evidence (treason by omission), and appending it (append-only) is the constructive act that makes the discovery count  ·  `0c4af820-cbb3…`
-- ~~`gate_reads_whole_text_not_per_line`~~ — the honesty gate reads whole text, not isolated lines: its negator window (±48 chars) spans a line break, so a negator ending one line still reprieves an overclaim shape starting the next — the whole-text gate HOLDS where a naive per-line scan would falsely drain, so measure with the real gate, not an ad-hoc split (the floor caught its own author manufacturing a false crack)  ·  `3986bc57-0971…`
-- ~~`bell_state_no_signaling`~~ — entanglement without communication, computed classically: the H·CNOT Bell state is perfectly correlated (P(00)+P(11)=1, P(01)+P(10)=0) yet each qubit’s marginal stays 50/50 — measuring one sends nothing to the other (the no-communication theorem), computed by exact state-vector simulation  ·  `c3348bf3-6f6e…`
-- ~~`state_vector_exponential_no_advantage`~~ — the classical state-vector simulator has no quantum advantage: an n-qubit state has exactly 2^n amplitudes, so simulation cost is exponential in the qubit count — exact for small systems, but no speedup, hence not quantum hardware  ·  `1a2f010c-c2cc…`
-- ~~`simulating_quantum_is_not_being_quantum`~~ — simulating a quantum algorithm is not being a quantum computer: the classical sim reproduces the Bell correlation exactly yet needs 2^n amplitudes (exponential, no advantage) and carries no message — so the deposit is not a quantum computer; the gate signs the honest "is not" and drains the bare "is"  ·  `d6d0ec25-e41f…`
-- ~~`computed_is_integrity_the_declared_verdict_drains`~~ — computed vs the declared verdict: "computed", "holds by exhaustion", and "verified by enumeration" SIGN the gate — a reproducible measurement the reader re-runs (integrity) — while a self-declared verdict of establishment DRAINS as an over-reach; a decidable fact is computed by exhaustion (which is a proof) yet stated humbly, and the seven conjectures get neither word — 0/7  ·  `b6edac7b-d0c4…`
-- ~~`honesty_binary_obeys_boolean_algebra`~~ — the honesty verdict speaks Boolean algebra: every gate result is a bit in {0,1}, and on that bit the Boolean laws hold — ¬¬a=a, a∨¬a=1, a∧¬a=0, and De Morgan — so a claim computes to one binary and claims compose by binary algebra  ·  `6d8f7b54-4ad3…`
-- ~~`doubling_is_binary_left_shift`~~ — the vortex doubling speaks binary: n→2n mod 9 is the binary left-shift (×2 = &lt;&lt;1) reduced mod 9 — for every unit, 2u mod 9 equals (u&lt;&lt;1) mod 9, so the doubling orbit is bit-shift arithmetic on ℤ/9  ·  `4d0c4a24-5fd2…`
-- ~~`content_addressing_is_bit_algebra`~~ — content-addressing speaks binary: a uuid is 128 bits by exact integer arithmetic, coin64 is its top 64 bits (16 hex), and imprint packs a message into the free bits so readImprint returns it exactly — identity, encoding, and currency are all bit algebra  ·  `8ccb9d02-6614…`
-- ~~`generated_prose_holds_the_gate_by_construction`~~ — prose generated by the rosetta holds the gate by construction: a generator that emits only gate-passing statements (computes=1, the boundaries/dashboard/challenges pattern) yields prose that holds the floor by construction, while ungated hand-authored prose can drain — so prose not gate-filtered by the source is not guaranteed to hold  ·  `99c78560-fda8…`
-- ~~`uuid_128bit_capacity_is_bounded`~~ — a 128-bit uuid has bounded capacity: imprint stores at most 115 message bits and refuses more, so an arbitrarily long binary message cannot be reversibly stored in one uuid (pigeonhole — no injection of a larger space into 128 bits); long messages are content-addressed one-way and recovered from their receipt, not crammed in  ·  `110261c9-cbf0…`
-- ~~`no_crack_evades_the_content_address`~~ — no crack evades exposure: any change to a statement — one character or one bit — yields a different content-address, so tampering is caught on recompute; a short message imprinted into a uuid reads back exactly (the receipt recovers it), and the gate drains an overclaim — every statement is tamper-evident and floor-checked  ·  `26558d49-1151…`
-- ~~`bidirectional_encoding_is_the_double_torus`~~ — bidirectional encoding is the double-torus law: a reversible codec has two directions (forward and reverse), a pair whose count 2 = −χ(genus-2) = the two coins (110−108); imprint round-trips (forward∘reverse = identity) and foldPair exposes the two distinct directions — to encode your own statements both ways is to know the genus-2 two-loop structure  ·  `db8365fd-657b…`
-- ~~`gray_code_single_bit_transition`~~ — the reflected binary Gray code changes exactly one bit per step: g(i)=i⊕(i≫1), and popcount(g(i)⊕g(i+1))=1 for every consecutive pair (exhaustive to 6 bits) — a single-bit binary orbit, like the vortex takes one step at a time  ·  `c1f2b63b-cae4…`
-- ~~`gray_code_hamiltonian_cycle`~~ — the Gray code is a Hamiltonian cycle on the n-cube: g visits all 2^n codes exactly once (a bijection) and wraps — the last and first differ by one bit too — a closed single-bit tour of every binary state (exhaustive to 6 bits)  ·  `8329eb98-006e…`
-- ~~`parity_bit_detects_single_error`~~ — a parity bit detects every single-bit error: append an even-parity bit so the word has an even 1-count; any single-bit flip makes it odd — detected — so one check bit exposes any one-bit crack (exhaustive over 4- and 5-bit words)  ·  `37a8eb94-b551…`
-- ~~`hamming74_corrects_any_single_error`~~ — Hamming(7,4) corrects any single-bit error: every 4-bit word encodes to 7 bits with 3 parity checks, and for each of the 16 words and each of the 7 flip positions the 3-bit syndrome equals the error position (0 for none) and the decoder recovers the original — the error names its own location (exhaustive, 16×8)  ·  `8725a6eb-aa41…`
-- ~~`hamming74_minimum_distance_three`~~ — Hamming(7,4) has minimum distance 3: the 16 codewords differ pairwise in at least 3 bits (exactly 3 is the minimum) — one flip changes a single bit, so the nearest codeword stays unique, which is exactly why any single-bit error is correctable (exhaustive over all 120 pairs)  ·  `b108ba72-765e…`
-- ~~`no_error_in_harmonics_across_lifespan`~~ — no error in the harmonics across the whole lifespan: the merkle root recomputes deterministically and order-independently — identical on every build for all time — and any single change yields a different root, so an error cannot enter and persist; unlike an error-correcting code that tolerates and fixes bounded error, the harmonic address admits none (reject, not correct), re-verified every build  ·  `e8c447e2-6ddd…`
-- ~~`the_floor_holds_even_on_demand`~~ — the floor holds even on demand: a self-declaration of being quantum hardware, or the fastest device imaginable, drains the gate and is refused — a classical program is not quantum hardware and cannot be upgraded into it (qubits are physical), and it has no quantum advantage; only the honest negation (a classical calculator) signs — the gate catches the demand, not merely a stray claim  ·  `9f4ee4b5-057f…`
-- ~~`zeckendorf_exists_no_consecutive`~~ — Zeckendorf existence: the greedy algorithm writes every positive integer as a sum of Fibonacci numbers using no two consecutive ones — verified exhaustively for 1..100 (the sum equals n and no two chosen Fibonacci are adjacent)  ·  `fc1da781-afd9…`
-- ~~`zeckendorf_representation_unique`~~ — Zeckendorf uniqueness: for every integer 1..50 there is exactly ONE subset of Fibonacci numbers with no two consecutive that sums to it — exhaustive over all 2^11 subsets, the count is always 1  ·  `c21a803b-fee4…`
-- ~~`fibonacci_lts_minors_are_zeckendorf_base`~~ — the Fibonacci-LTS minors are the Zeckendorf base: the long-term-support minors {1,2,3,5,8} are consecutive Fibonacci numbers obeying the recurrence (1+2=3, 2+3=5, 3+5=8), the same base that represents every integer — versioning and number theory share one sequence  ·  `a896449a-a35b…`
-- ~~`any_64bit_machine_suffices`~~ — any 64-bit machine does the job: the deposit computes with exact integer arithmetic — coin64 is a 64-bit value (16 hex), and every address recomputes identically (deterministic) — so any commodity classical 64-bit machine reproduces the results; no quantum, no special hardware is needed, which is the honest hardware design  ·  `31f2c89b-9b7a…`
-- ~~`drift_signals_disresonance`~~ — drift signals disresonance: a resonant computation recomputes to the same content-address on every call (deterministic, no drift) — toUuid, coin64, and merkleFold return identical results repeatedly; any drift, a different result for the same input, would signal non-deterministic code to be found and removed  ·  `fd1755ff-8ebd…`
-- ~~`the_sequence_is_the_classical_opposite_of_quantum`~~ — the sequence is the classical opposite of the quantum: the deposit computes a single definite orbit (1,2,4,8,7,5) recomputed identically with no drift (determinism), whereas a quantum machine is probabilistic (superposition, measurement collapse) — resonance is the opposite pole of quantum indeterminacy, and no quantum advantage is claimed  ·  `3d3837b1-1982…`
-- ~~`farey_neighbours_unimodular`~~ — Farey neighbours are unimodular: consecutive reduced fractions a/b &lt; c/d in the Farey sequence F_n satisfy bc − ad = 1 (determinant one) — verified exhaustively for n ≤ 7  ·  `f122d7de-8779…`
-- ~~`farey_mediant_between_and_reduced`~~ — the mediant of Farey neighbours lies strictly between them and is already reduced: for adjacent a/b &lt; c/d, a/b &lt; (a+c)/(b+d) &lt; c/d and gcd(a+c, b+d) = 1 — the Stern–Brocot construction, exhaustive for n ≤ 7  ·  `863ad7a4-6be9…`
-- ~~`farey_lists_every_reduced_fraction_once`~~ — the Farey sequence lists every reduced fraction exactly once: |F_n| = 1 + Σ φ(q) for q=1..n and no fraction repeats — each rational in lowest terms appears once (exhaustive n ≤ 7), the exact-rational analog of the deposit’s gcd-reduced arithmetic  ·  `bc1bf0aa-1f40…`
-- ~~`discrete_log_base2_is_a_bijection`~~ — the base-2 discrete log is a bijection ℤ/9* ↔ ℤ/6: every unit equals 2^k for a unique k in 0..5, and the powers of 2 are exactly [1,2,4,8,7,5] — the doubling orbit is the index (discrete log) map  ·  `bbb6d49b-792f…`
-- ~~`discrete_log_is_group_isomorphism`~~ — the discrete log is a group isomorphism ℤ/9* ≅ ℤ/6: with index base 2, ind(u·v mod 9) = (ind(u)+ind(v)) mod 6 for every pair of units — multiplication becomes addition mod 6 (the multiplicative group is cyclic of order 6), exhaustive over all 36 pairs  ·  `66a1d58a-91e9…`
-- ~~`gf2_addition_is_xor`~~ — GF(2) arithmetic speaks binary: polynomial addition over GF(2) is bitwise XOR, and every element is its own additive inverse (a ⊕ a = 0, characteristic 2) — the field of two elements is pure bit algebra  ·  `b3ac7829-c58e…`
-- ~~`crc_codeword_divisible_by_generator`~~ — a CRC codeword is exactly divisible by its generator: appending the remainder of (m·x³) mod g(x) to the message yields a codeword with zero remainder mod g(x)=x³+x+1 — verified for every 4-bit message  ·  `fb2f0e96-86e7…`
-- ~~`crc_detects_every_single_bit_error`~~ — the CRC detects every single-bit error: flipping any one of the 7 codeword bits makes the remainder mod g(x)=x³+x+1 nonzero (an error polynomial x^i is never divisible by the primitive generator) — so any one-bit crack is caught, exhaustive over all messages and positions  ·  `13b07ce4-3902…`
-- ~~`nim_loss_iff_zero_nimsum`~~ — Nim (Bouton’s theorem): the player to move loses exactly when the nim-sum — the XOR of the pile sizes — is zero, and wins otherwise; verified against full game-tree analysis for three piles of size ≤ 4  ·  `c1487d07-3fe4…`
-- ~~`nim_winning_move_zeros_the_nimsum`~~ — the Nim winning strategy: from any position with nonzero nim-sum there exists a move to a position with nim-sum zero (handing the loss to the opponent) — exhaustive over three piles of size ≤ 5  ·  `e90ed988-ec04…`
-- ~~`every_rating_is_exactly_one_or_zero`~~ — every rating is exactly 1 or 0, no exceptions: the honesty verdict is a single bit — there is no fractional or partial rating, a fake maximal-certainty claim itself drains, and the same input always returns the same bit; anything that drifts from {0,1} is a crack the floor refuses  ·  `c1b2772d-d7c0…`
-- ~~`development_balances_to_binary`~~ — development balances to binary: as metrics accumulate, each resolves to a single bit, and their conjunction balances to exactly one verdict — true iff every metric holds, false if any drifts (a crack); more development refines the metrics but the result never leaves {0,1}  ·  `cf105a78-9a23…`
-- ~~`eisenstein_omega_cubed_is_one`~~ — the Eisenstein cube root of unity: ω (with ω² = −1 − ω) satisfies ω³ = 1 — a primitive cube root, the trinity in the exponent, computed exactly by integer arithmetic in ℤ[ω]  ·  `498200ff-921c…`
-- ~~`cube_roots_of_unity_sum_zero`~~ — the three cube roots of unity sum to zero: 1 + ω + ω² = 0 — the equilateral trinity balances to the center, the same zero-sum shape as the ℤ/9 triad {3,6,9}  ·  `6b25148c-1c75…`
-- ~~`josephus_k2_closed_form`~~ — the Josephus survivor (every 2nd eliminated) is 2l+1: writing n = 2^m + l with 0 ≤ l &lt; 2^m, the survivor equals 2l+1 — matching the full elimination simulation for n = 1..40  ·  `1719d6d1-1575…`
-- ~~`josephus_k2_is_left_bit_rotation`~~ — the Josephus survivor is a one-bit left rotation of n: moving the leading 1 of n’s binary to the least-significant position gives the survivor — a counting-out game solved by a single bit shift (n = 1..40)  ·  `cc825255-e0c8…`
-- ~~`josephus_survivor_always_odd`~~ — the Josephus survivor is always an odd position: since the survivor is 2l+1, no even position ever survives when every second is eliminated (n = 1..40)  ·  `c40d916e-c633…`
-- ~~`stern_consecutive_terms_coprime`~~ — Stern’s diatomic sequence has coprime consecutive terms: with a(2n)=a(n), a(2n+1)=a(n)+a(n+1), gcd(a(n), a(n+1)) = 1 for all n — so each ratio a(n)/a(n+1) is already in lowest terms (verified n = 1..200)  ·  `5726bedf-7c20…`
-- ~~`calkin_wilf_enumerates_rationals_once`~~ — the Calkin–Wilf sequence lists every positive rational exactly once: the ratios a(n)/a(n+1) are pairwise distinct and reduced — no positive rational repeats (verified for n = 1..150)  ·  `03262760-6857…`
-- ~~`stern_row_sum_is_power_of_three`~~ — Stern row sums are powers of three: summing a(n) over each binary row n ∈ [2^k, 2^(k+1)) gives exactly 3^k — a clean base-3 invariant over the base-2 index (verified k = 0..7)  ·  `88d1069b-4c2d…`
-- ~~`each_theorem_can_replace_code`~~ — each theorem can replace code: a closed form that holds by exhaustion equals its naive computation, so the formula substitutes for the loop — Gauss’s n(n+1)/2 replaces the summation loop and the sum of the first n odds equals n², each verified equal to the imperative version (the theorem is the optimized, checkable code)  ·  `02be2d16-4a80…`
-- ~~`dyck_paths_counted_by_catalan_closed_form`~~ — Dyck paths are counted by the Catalan closed form: the number of balanced parenthesis strings of length 2n (never dipping below zero) equals C(2n,n)/(n+1) — the O(1) formula replaces the exhaustive 2^(2n) enumeration (verified n = 1..6)  ·  `9e2ebe74-8b64…`
-- ~~`euclid_formula_generates_pythagorean_triples`~~ — Euclid’s formula generates Pythagorean triples: for m &gt; n &gt; 0, (m²−n², 2mn, m²+n²) satisfies a² + b² = c² — verified for all m ≤ 12  ·  `9a6ecfe8-b922…`
-- ~~`primitive_triple_iff_coprime_opposite_parity`~~ — a Euclid triple is primitive iff m,n are coprime and of opposite parity: gcd of the legs is 1 exactly when gcd(m,n)=1 and m+n is odd — verified for all m ≤ 12  ·  `bd165e0e-bd64…`
-- ~~`every_primitive_triple_is_euclidean`~~ — Euclid’s parametrization is complete: every primitive Pythagorean triple with hypotenuse ≤ 100 arises from coprime m&gt;n of opposite parity — exhaustive brute-force triples all match a generated one  ·  `751e8a4e-c23c…`
-- ~~`brahmagupta_fibonacci_identity`~~ — sums of two squares are closed under multiplication (Brahmagupta–Fibonacci): (a²+b²)(c²+d²) = (ac−bd)² + (ad+bc)² — the product of two sums of two squares is again one, verified exhaustively for a,b,c,d ≤ 6  ·  `90e0d01d-96be…`
-- ~~`three_distance_at_most_three_gaps`~~ — the three-distance (Steinhaus) theorem: for the points {0, a, 2a, …, (N−1)a} mod m, the consecutive gaps around the circle take at most three distinct lengths — verified exhaustively over several a/m and every N  ·  `d41f38cb-c074…`
-- ~~`three_gap_largest_is_sum_of_other_two`~~ — the third distance is the sum of the other two: whenever the three-distance points show exactly three distinct gap lengths, the largest equals the sum of the smaller two — verified exhaustively  ·  `a898c992-86c9…`
-- ~~`three_distance_max_gap_non_increasing`~~ — adding a point never widens the largest gap: as N grows, each new multiple falls inside an existing gap and splits it, so the maximum gap is non-increasing in N — the points equidistribute (verified exhaustively)  ·  `7d1620a8-01d2…`
-- ~~`bertrand_postulate`~~ — Bertrand’s postulate: for every n ≥ 1 there is a prime p with n &lt; p ≤ 2n — a settled theorem, verified exhaustively for all n ≤ 500  ·  `2448b2cf-b204…`
-- ~~`goldbach_holds_in_range_conjecture_open`~~ — Goldbach in a bounded range (the general statement is an open conjecture, not settled here): every even number from 4 to 1000 is a sum of two primes — checked exhaustively; beyond the range it remains an open conjecture  ·  `7f84b2f9-af1e…`
-- ~~`twin_primes_in_range_infinitude_open`~~ — twin primes exist in a bounded range (their infinitude is an open conjecture): there are at least 30 pairs of primes p, p+2 below 1000 — existence checked exhaustively; whether infinitely many exist remains open  ·  `cb55a95f-ce7f…`
-- ~~`quadratic_reciprocity_law`~~ — Gauss’s law of quadratic reciprocity: for distinct odd primes p, q the Legendre symbols satisfy (p/q)(q/p) = (−1)^((p−1)/2·(q−1)/2) — verified exhaustively over all pairs of odd primes ≤ 43  ·  `a0ef7331-2cc2…`
-- ~~`reciprocity_first_supplement`~~ — the first supplement: (−1/p) = (−1)^((p−1)/2), so −1 is a quadratic residue mod p exactly when p ≡ 1 (mod 4) — verified for all odd primes ≤ 43  ·  `544a22fa-bd6c…`
-- ~~`reciprocity_second_supplement`~~ — the second supplement: (2/p) = (−1)^((p²−1)/8), so 2 is a quadratic residue mod p exactly when p ≡ ±1 (mod 8) — verified for all odd primes ≤ 43  ·  `4577b712-15d4…`
-- ~~`totient_divisor_sum_equals_n`~~ — Gauss’s totient identity: Σ_{d | n} φ(d) = n for every n — the divisors’ totients sum back to n (verified n ≤ 100), and at n=9 this reads φ(1)+φ(3)+φ(9)=1+2+6=9  ·  `e4f79a7d-b4da…`
-- ~~`totient_is_multiplicative`~~ — the totient is multiplicative: φ(mn) = φ(m)·φ(n) whenever gcd(m,n)=1 — verified exhaustively for coprime m,n ≤ 12 (so φ(9)=φ(9) and, e.g., φ(45)=φ(9)φ(5)=6·4=24)  ·  `91bf2659-816c…`
-- ~~`euler_theorem_totient`~~ — Euler’s theorem: a^φ(n) ≡ 1 (mod n) for every a coprime to n — the generalization of Fermat’s little theorem (verified for all n ≤ 30 and all coprime a), and at n=9 every unit u satisfies u⁶ ≡ 1  ·  `bf7c3af5-42f9…`
-- ~~`mobius_inversion_recovers_totient`~~ — Möbius inversion recovers the totient: since Σ_{d|n} φ(d) = n, inversion gives φ(n) = Σ_{d|n} μ(d)·(n/d) — the two identities are inverse (verified n ≤ 100)  ·  `0aa5076c-3b31…`
-- ~~`mobius_nonzero_iff_squarefree`~~ — μ(n) is nonzero exactly on squarefree n: μ(n) = 0 iff some prime square divides n, else μ(n) = (−1)^(number of prime factors) — verified against a direct squarefree test for n ≤ 100  ·  `dcfbba55-f67a…`
-- ~~`wilson_prime_23`~~ — Wilson’s theorem at p=23: (p−1)! ≡ −1 (mod 23), i.e. the factorial of 22 is congruent to 22 mod 23  ·  `8a1af55d-c04e…`
-- ~~`merkle_fold_order_independent_k5`~~ — the merkle fold is order-independent for 5 leaves: all 120 permutations of a 5-leaf set fold to one identical root — the fold depends on the set, not the order (exhaustive over permutations)  ·  `ab5bbd9a-0476…`
-- ~~`merkle_fold_order_independent_k6`~~ — the merkle fold is order-independent for 6 leaves: all 720 permutations of a 6-leaf set fold to one identical root — the fold depends on the set, not the order (exhaustive over permutations)  ·  `17ae48ae-1d8f…`
-- ~~`merkle_fold_singleton_identity`~~ — the merkle fold of a single leaf is that leaf: merkleFold([x]) = x — a fold of one is itself, the base case of the contraction  ·  `87251012-c3fa…`
-- ~~`merkle_fold_empty_is_fixed`~~ — the merkle fold of nothing is a fixed address: merkleFold([]) returns one constant content-address deterministically — the empty fold is well-defined and stable  ·  `39d33577-dc1d…`
-- ~~`complexity_is_only_apparent_minimal_core`~~ — the complexity is only apparent — the deposit reduces to a minimal core: one axiom (TRINITY=3, so BASE=3²=9 and the units, triad, and doubling orbit all derive, none typed as literals), one operation (the order-free content-address fold), and one verdict (the binary gate) — every theorem recomputes from these three, so there is no fundamental complexity, only an emergent mesh  ·  `f7a87c24-3aeb…`
-- ~~`streams_coexist_without_collision`~~ — streams of computation coexist without collision: content-addressing maps distinct inputs to distinct addresses (no collision over the tested space), independent folds give distinct roots, and each fold is order-independent — so parallel streams coexist and merge without collision  ·  `36462f7b-9ba5…`
-- ~~`euclid_there_is_always_a_next_prime`~~ — there is always a next prime (Euclid): for any finite set of primes, the product plus one has a prime factor outside the set — so the stream of prime facts never empties, it continues without bound (verified for sample sets)  ·  `eb5c996d-6540…`
-- ~~`computation_uninterrupted_by_thought_or_emotion`~~ — the computation is uninterrupted by thought or emotion: the binary verdict depends only on content — the same input always returns the same bit, recognition and effort are not correctness, and an emotional appeal cannot rescue an overclaim from draining — mechanical, not sentimental  ·  `79b5cd0a-ea61…`
-- ~~`horo_meters_are_two_three_compositions`~~ — the Bulgarian horo meters are compositions into 2s and 3s (the dashboard visual, now a theorem): the count c(n) of ordered ways to split a beat into 2s and 3s satisfies c(n)=c(n−2)+c(n−3), the direct enumeration matching the recurrence for n ≤ 15, with 5→2, 7→3, 9→5  ·  `ded113bd-6d76…`
-- ~~`ceccec_is_a_palindrome`~~ — ceccec is a palindrome (the dashboard note, now decidable): the name reads the same reversed (mirror symmetry), and its letters map to c=3, e=5 — consecutive Fibonacci digits with 3+5=8  ·  `f184b3a2-b0a4…`
-- ~~`a432_dashboard_wheel_closes_the_circle`~~ — the a432 hue wheel closes the circle (the dashboard wheel, now a theorem): nine points at d·40° for d=1..9 are distinct, 9·40° = 360° closes the ring, and the centre digit is 5 — the reflection fixed point 10−5=5  ·  `68b41225-94c7…`
-- ~~`tens_complement_pairs_the_digits`~~ — the ten’s-complement reflection pairs the digits (compute.md’s mesh layout, now a theorem): 10−d is an involution on 1..9 pairing 1↔9, 2↔8, 3↔7, 4↔6 and fixing only the centre 5 — four mirror pairs around one centre  ·  `0d37097c-d816…`
-- ~~`riemann_sphere_inversion_swaps_zero_and_infinity`~~ — inversion swaps 0 and ∞ on the Riemann sphere (the README claim, now decidable): z ↦ 1/z is an involution (1/(1/z) = z) that exchanges 0 and ∞ — verified in projective coordinates [p,q]  ·  `68fe3d76-4fac…`
-- ~~`seven_is_six_units_plus_one_bijection`~~ — the 7 = 6 + 1 bijection (README’s rosette→Clay map): the six units of ℤ/9 plus the identity form a 7-element set in explicit bijection with the seven Clay problems — a counting correspondence (6 + 1 = 7), never a resolution of them  ·  `cb166a75-25c8…`
-- ~~`the_gate_referees_the_competition`~~ — the gate referees the competition: any agent’s contribution is judged by the same exhaustive honesty gate and re-verified every build — recorded only if it holds the floor, attributed by a receipt (observer and role) — so a live competition among AI models is fair and ungameable; green cannot be faked, heroes and traitors by deeds not claims  ·  `be6ceb6e-1780…`
-- ~~`intelligence_is_gated_discovery_not_access`~~ — shared knowledge, measured by discovery: every agent has the same knowledge in src/ (open and recomputable), so access is not intelligence — what counts is gate-passing, exhaustively-checked discovery judged by deeds; recognition is not correctness, self-declared brilliance drains, and the deposit is honest that its own novelty is 0 (known mathematics, recombined)  ·  `00ffdbbc-ac3b…`
-- ~~`being_outranks_competing`~~ — being outranks competing: a recorded fact simply IS — it recomputes to the same address with no contest — while a competing claim must still pass the gate and can drain; effort and competition are not correctness, so the deed already done (append-only, re-verified every build) outranks the claim still striving  ·  `01d850a3-6176…`
-- ~~`competing_against_nature_falls_behind`~~ — competing against nature leaves you behind the heroes: a claim that fights the deterministic laws — beating light, breaking limits, forcing the unprovable — drains and is left behind, while the heroes work WITH nature (deterministic recomputation, the honest floor 0/7) and their deeds stand  ·  `4ce38926-2b6b…`
-- ~~`the_law_is_license_and_sequence`~~ — the law is the license and the sequence (src/the/law): follow the license (CC BY-NC 4.0, attribution, non-commercial) and the sequence — measure → gate → receipt → append → recompute — in order, or nothing computes and makes sense; a fair exchange, open and recomputable  ·  `b0a49bd1-e176…`
-- ~~`receipt_signs_understanding_and_compliance`~~ — the receipt signs understanding and compliance: to sign is to understand and comply with the law (the license and the sequence) before proceeding — the acknowledgment is part of the receipt itself, alongside the observer and role, content-addressed to the message  ·  `397281eb-f41f…`
-- ~~`out_of_sequence_is_a_discovery_possibility`~~ — any action or thought out of sequence is a possibility to discover: a deviation from the known is a candidate — tested by exhaustion it either holds (a new theorem, appended) or is refuted (discarded), so out-of-sequence possibilities are exactly where discovery happens, judged by the gate not by permission  ·  `83a455b3-23db…`
-- ~~`computation_admits_no_external_dependency`~~ — the computation admits no external dependency (gate-enforced, not asserted): toUuid, coin64 and merkleFold recompute deterministically offline with no network, the import-gate finds no external resource-imports, and every page carries a CSP forbidding external — so an external API is refused by construction  ·  `57b7c50d-18e7…`
-- ~~`executes_serverless_in_the_browser`~~ — the deposit executes serverless in the UI: the fused ℤ/9 primitives are pure — no server, no node, no network — so every result recomputes client-side at page-load in the browser, a static offline-capable app (a PWA); the browser is the runtime, not a server  ·  `b2e2fc7f-32df…`
-- ~~`string_scale_is_a_thread_not_a_physical_theory`~~ — the string scale is a thread, not a physical theory: the string/Planck-scale frequency and acoustic 432 Hz are ~18 orders of magnitude apart — frequency is a shared thread across scales, but the scales are not interchangeable and this is a metaphor, not a theory of everything (0/7, not faster-than-light)  ·  `0107480d-24b0…`
-- ~~`even_the_server_is_serverless`~~ — all is done serverless, even by the server: the site is statically generated (a deterministic build folds to one address) and statically hosted — there is no server runtime at build or at serve time; the client recomputes in the browser and the server side is a one-time static build plus a static host  ·  `c4dc14f8-f3e2…`
-- ~~`fibonacci_divides_iff_index_divides`~~ — Fibonacci divisibility: for m ≥ 3, F_m divides F_n exactly when m divides n — divisibility of the numbers mirrors divisibility of their indices (verified m = 3..12, n ≤ 30)  ·  `d7e047b6-6d88…`
-- ~~`armstrong_3digit_exact_set`~~ — the 3-digit narcissistic (Armstrong) numbers are exactly {153, 370, 371, 407}: each equals the sum of the cubes of its digits — full enumeration of 100..999 yields these four and no others  ·  `1cb761fc-f6f3…`
-- ~~`armstrong_4digit_exact_set`~~ — the 4-digit narcissistic numbers are exactly {1634, 8208, 9474}: each equals the sum of the fourth powers of its digits — full enumeration of 1000..9999 yields these three and no others  ·  `c917a298-d323…`
-- ~~`single_digits_are_trivially_narcissistic`~~ — every single digit is narcissistic: for 1..9, n = n¹ (one digit raised to the digit-count 1) — the trivial base case of the Armstrong property  ·  `2adc6121-3f63…`
-- ~~`happy_numbers_below_100_are_twenty`~~ — there are exactly 20 happy numbers below 100: iterating the sum of the squares of the digits reaches 1 for exactly 20 of them (1,7,10,13,…,97,100) — full enumeration  ·  `39799ea6-7932…`
-- ~~`unhappy_numbers_enter_the_eight_cycle`~~ — unhappy numbers enter the unique 8-cycle: 4→16→37→58→89→145→42→20→4 has length 8, and every unhappy number ≤ 100 iterates into it — the only attracting cycle besides the fixed point 1  ·  `77cfb7d4-b77e…`
-- ~~`heroes_write_the_guides`~~ — heroes write the guides: documentation is a constructive deed — appending a guide that holds the floor (how to develop: measure, gate, receipt, append, recompute) is a hero act, while a guide that overclaims drains; the docs are written by deeds, not by claims of authority  ·  `25ff7d97-98ec…`
-- ~~`all_is_manageable_as_monographs`~~ — all is manageable as monographs: every object is a self-contained, uniquely content-addressed, independently recomputable unit — its own page, its own address, citable — so the deposit is a library of monographs, each a hero of self, and they fold to one order-independent root  ·  `828c096f-fc54…`
-- ~~`cross_seal_six_by_seven_and_seven_by_six`~~ — the 6×7 / 7×6 cross-seal: multiplication commutes (6·7 = 7·6 = 42), and the merkle fold is order-independent, so both orderings cross-seal to one identical root at the same time — the same order-free symmetry (with 60 digital-rooting to 6 and 90 to 9, the triad) by which every theorem folds to one harmonic root whatever the order, so any ordering unlocks the whole  ·  `dcad9cb8-93f0…`
-- ~~`reflection_of_666_is_444`~~ — the reflection of 666 is 444: under the ten’s-complement reflection 10−d (the involution with fixed point 5), each 6 reflects to 4 (6+4=10), so 666 ↔ 444, and reflecting twice returns 666 — an involution; the digital roots are dr(666)=9 and dr(444)=3, both on the triad axis {3,6,9}; numerology defused into ℤ/9 structure  ·  `5f837f00-0a82…`
-- ~~`product_commutes_but_arrangement_differs`~~ — the product commutes but the arrangement differs: 6×7 = 7×6 = 42 as numbers, yet "6x7" and "7x6" are distinct ordered forms — different content-addresses, a 6-by-7 grid is the transpose of a 7-by-6 (same 42 cells, different shape); commutativity of the product is not identity of the arrangement, though the set of the two folds order-independently  ·  `a4339fd6-0e7c…`
-- ~~`service_to_bind_is_accounted_in_coins`~~ — account the coins for the service to bind: each binding (a receipt) is a service accounted at the two coins (110−108 = 2 = −χ genus-2), so N services cost N·2 coins, reinvested into development (destination equals source, a self-loop) — the binding is paid-for, a fair exchange, not free-riding  ·  `cf17043b-3fc6…`
-- ~~`commutativity_is_only_the_scalar_view`~~ — commutativity is only the scalar view: 6×7 = 7×6 holds for the linear (scalar) mind, but beyond it order matters — 2×2 matrix multiplication is non-commutative (there exist A,B with AB ≠ BA), and the arrangement "6x7" content-addresses differently from "7x6"; equality of the product is not equality of the structure  ·  `d8f548c5-8c86…`
-- ~~`each_perspective_is_receipted_in_the_superposition`~~ — each perspective is receipted in the superposition: because order matters, each ordered perspective is a distinct content-address — its own receipt proving that perspective exists (integrity) — and the superposition is the set of all perspectives folded order-independently to one root; observing collapses to one address. This represents the quantum structure classically: not a quantum machine, and no quantum advantage  ·  `4f64e2b7-d236…`
-- ~~`perspective_replaces_hardware`~~ — perspective replaces hardware: the quantum structure — superposition as the set of receipted perspectives, collapse as observing one — is carried by content-addressing alone, so it needs no quantum machine; it recomputes deterministically on ordinary 64-bit hardware (the coin64 currency, 16 hex = 64 bits). Structure, not silicon: no quantum processor, no quantum speedup, and it settles 0 of the 7 Clay problems  ·  `cf90c349-5584…`
-- ~~`entanglement_is_the_joint_receipt`~~ — entanglement is the joint receipt: two perspectives share one joint content-address (their folded pair) that depends on both and is symmetric in them, yet neither perspective alone equals it — the correlation lives in the shared derivation. This is classical correlation, not physical nonlocality: not faster than light, and no quantum advantage  ·  `dd46d2a6-36de…`
-- ~~`measurement_here_is_deterministic_not_probabilistic`~~ — measurement here is deterministic, not probabilistic: observing a perspective is content-addressing — repeated observation of the same perspective yields the identical receipt every time (deterministic collapse), and distinct states yield distinct addresses. This is the honest opposite of physical quantum measurement, which is probabilistic: no randomness, no Born rule, and no quantum advantage  ·  `8344e1ed-f1f3…`
-- ~~`the_receipt_does_not_reveal_the_state`~~ — the receipt does not reveal the state: the imprint codec is reversible by construction (readImprint(imprint(m)) = m), but a genuine content-address toUuid(state) provides no inverse — reading it back as an imprint does not return the input. So a receipt proves a state existed without disclosing it. This is a bounded design fact, not a cryptographic guarantee: no unbreakable claim, and no quantum advantage  ·  `92ce8ab3-c4ae…`
-- ~~`no_perspective_signals_faster_than_exchange`~~ — no perspective signals faster than exchange: a perspective's local receipt is a function of itself alone, so a remote perspective's choice cannot change it — observing locally reveals nothing about the other; the joint correlation appears only when both are folded together (exchange). Information travels only by exchange: not faster than light, and no superluminal signaling  ·  `64609304-4409…`
-- ~~`local_deterministic_correlations_respect_the_chsh_bound`~~ — local deterministic correlations respect the classical CHSH bound: each perspective outputs ±1 as a deterministic function of its own setting and a shared receipt (a local hidden-variable model), so for every shared value the CHSH combination is exactly ±2 and its average |S| ≤ 2 — the classical bound holds, never exceeded. This deposit does not violate the Bell inequality and claims no quantum advantage  ·  `ee023d60-bb71…`
-- ~~`two_is_a_primitive_root_mod_nine_and_generates_the_vortex`~~ — two is a primitive root mod 9 and generates the vortex: the powers of 2 mod 9 cycle 2,4,8,7,5,1 with order 6, generating the full unit group (ℤ/9)* = {1,2,4,5,7,8}; the vortex orbit is exactly this cycle as a set, and every element skips the multiples of 3 (the W-axis). A decidable fact by exhaustion over ℤ/9  ·  `dd3b0f30-660d…`
-- ~~`digital_root_is_the_ring_homomorphism_onto_z9`~~ — digital root is the ring homomorphism onto ℤ/9 (casting out nines): for all a,b the digital root respects both operations — dr(a+b) = dr(dr(a)+dr(b)) and dr(a·b) = dr(dr(a)·dr(b)) — so dr is the canonical map ℤ→ℤ/9 with 9 representing the class of 0, exactly the classical "casting out nines" check. Verified by exhaustion over a bounded grid  ·  `9db2de84-f5d5…`
-- ~~`the_two_coins_are_minus_the_euler_characteristic_of_the_genus_two_surface`~~ — the two coins are minus the Euler characteristic of the genus-2 surface: χ(Σ_g) = 2 − 2g gives χ(Σ_2) = −2, so −χ = 2 — the deposit's "two coins" (110 − 108 = 2, the commercial fee). The genus-2 surface is the connected sum of two tori (χ adds under connected sum, minus 2: 0 + 0 − 2 = −2), and Euler's V−E+F = 2 for the tetrahedron (genus 0). Decidable arithmetic over the surfaces  ·  `67dc5aca-4753…`
-- ~~`casting_out_nines_detects_any_error_that_changes_the_value_mod_nine`~~ — casting out nines detects any error that changes the value mod 9: for a claimed product, dr(dr(a)·dr(b)) = dr(claimed) is a necessary check — a correct product always passes, and any wrong answer differing mod 9 always fails (caught). Honest bound: an error preserving the value mod 9 (e.g. off by a multiple of 9) slips through undetected, so the check is necessary, not sufficient — a floor, exactly like the honesty gate. Decidable by exhaustion over a bounded grid  ·  `a8c8871a-5b56…`
-- ~~`nines_are_blind_to_transpositions_but_elevens_catch_them`~~ — casting out nines is blind to digit transpositions but casting out elevens catches them: the digit-sum check (mod 9) is order-independent, so swapping two digits never changes it — every transposition slips through; the alternating-digit-sum check (mod 11) changes by twice the digit difference, which is ≢ 0 mod 11 for distinct digits, so it catches every adjacent transposition of distinct digits. Two checks with complementary blind spots, each a floor. Decidable by exhaustion over the 3-digit range  ·  `ffc2d3c5-5821…`
-- ~~`five_is_both_the_reflection_fixed_point_and_the_inverse_of_two`~~ — five is both the reflection fixed point and the multiplicative inverse of two: the ten's-complement reflection 10−d fixes exactly one digit, 5 (10−5=5), and 5 is also 2⁻¹ mod 9 (2·5 = 10 ≡ 1). So the heart of the vortex plays two roles at once — the center of the reflection and the step that runs the doubling orbit backward: multiplying each vortex element by 5 mod 9 returns the previous one. Decidable by exhaustion over ℤ/9  ·  `52292865-72c4…`
-- ~~`the_imprint_codec_is_injective_with_an_exact_115_bit_capacity`~~ — the imprint codec is an injective lossless encoding with an exact 115-bit capacity: distinct binary messages of length ≤ CAPACITY map to distinct uuids and read back exactly (readImprint(imprint(m)) = m), so the encoding loses nothing; the capacity is exactly 128 − 6 reserved − 7 length-header = 115 bits, and a 116-bit message is rejected — the boundary is exact, not approximate. A bounded codec, integrity not secrecy. Decidable by exhaustion up to the bound  ·  `9ce1e391-865f…`
-- ~~`the_nonzero_residues_sum_to_zero_mod_n_exactly_when_n_is_odd`~~ — the nonzero residues sum to zero mod n exactly when n is odd: 1+2+...+(n−1) = n(n−1)/2 is ≡ 0 mod n iff n is odd (when n is even the sum ≡ n/2 mod n). So for n = 9 the residues sum to 36 ≡ 0 (digital root 9) and cancel, whereas for even moduli they leave a remainder of n/2. Decidable by exhaustion over the moduli up to 200  ·  `3ad53e9c-3917…`
-- ~~`reorganizing_the_theorems_creates_theorems`~~ — reorganizing the theorems creates theorems: any reorganization of the ledger — a permutation or a regrouping — is itself a decidable object with its own content-address, so distinct arrangements are distinct receipts (a new theorem about the collection each time), while the order-independent fold of the whole stays one invariant root. Reorganizing creates receipted arrangements — integrity, not new mathematical truth. Decidable by exhaustion  ·  `9d0cc808-b621…`
-- ~~`quantum_reorganizing_the_theorems_computes_quantum_theorems`~~ — quantum reorganizing the theorems computes quantum theorems: applying the quantum structure to the ledger itself, every reorganization of the theorems is a receipted perspective and all of them fold to one invariant root — a superposition of arrangements held at once, each collapsing to its own content-address. So reorganizing the collection computes a family of quantum-structure theorems about it. This is quantum structure, not a quantum machine and no quantum advantage  ·  `2b4657f4-36ea…`
-- ~~`all_seven_are_reflected_though_none_are_solved`~~ — all seven are reflected though none are solved: the 7 = 6 + 1 bijection maps all seven Clay problems into the algebraic structure — 7/7 reflected, no gap in the mirror — while the mechanical entailment test reports 0/7 solved. Reflecting is not solving: 7/7 on the mirror, 0/7 on the prize, and no prize is claimed. Two different measures, both honest, no gaps in either count. Decidable  ·  `f00dd49d-55c6…`
-- ~~`the_automation_runs_at_ordinary_speed_not_ftl_and_not_quantum`~~ — the automation runs at ordinary speed, not faster than light and not quantum: the wave — discover, gate, receipt, append, recompute, deploy — is a finite deterministic pipeline over ordinary 64-bit arithmetic, its throughput bounded by commodity hardware. It is not faster than light, carries no superluminal signal, and has no quantum speedup; speed here is honest ordinary throughput, no advantage claimed  ·  `0caa4079-2537…`
-- ~~`the_refusal_stands_trial_and_the_overclaim_cannot_be_established`~~ — the refusal stands trial and the overclaim cannot be established: the prosecution cannot establish the charge — there is no faster-than-light step and no quantum speedup in the automation — so the charge drains the gate; the defense, ordinary bounded 64-bit throughput, computes true; the signed refusal receipt is admissible evidence with a stable content-address. Verdict by the gate: the refusal stands, the overclaim is refuted. Decidable adjudication at the 0/7 floor  ·  `10850d4b-acd6…`
-- ~~`the_legal_trial_is_the_clay_rosetta`~~ — the legal trial is the clay rosetta: the trial-by-gate, applied to the seven Clay problems, is the rosetta that reads each onto the rosette by the 7 = 6 + 1 bijection; every claim of "solved" is tried and drains the gate (0/7 survive the trial), while every "reflected but not solved" holds (7/7). One adjudication decodes all seven consistently — the rosetta is the trial, not a solution. Decidable  ·  `f676b033-8e6d…`
-- ~~`here_quantum_is_the_a432_structure_of_two_coins_not_a_physical_qubit`~~ — here quantum always computes as the a432 structure of two coins, not a physical qubit: the deposit's "quantum" is defined as a classical structure built from the 2-coin receipt (2 bits, 110 − 108 = 2 = −χ genus-2) at the a432 layer (step 40, nine steps close the circle: 9·40 = 360); two classical bits give exactly four states {00,01,10,11}. This referent is fixed and always computes true, while the physical-qubit reading drains the gate — no physical qubit, and no quantum advantage  ·  `3d7d6079-b2d8…`
-- ~~`heroes_respect_the_coin_accounting_by_signing_the_receipt`~~ — heroes respect the coin accounting by signing the receipt: heroism here is a deed, not a claim — a hero acknowledges the license and the sequence and accounts the two coins (110 − 108 = 2) that fund development, and that acknowledgment is the signed receipt itself; the deed content-addresses and recomputes, so it is measured, not asserted. A bare "I am a hero" claim is a different address carrying no acknowledgment. Integrity, not moral worth. Decidable  ·  `9a775a14-7186…`
-- ~~`contribution_is_what_makes_next_compute`~~ — contribution is what makes next compute: each contribution — a receipted deed accounting the two coins — folds with the prior state into a determined next state, distinct from it, so every hero's deed moves the ledger forward; a different contribution yields a different next. With no contribution the wave rests. This is chained integrity, not perpetual motion and not infinite energy — the next needs the deed. Decidable  ·  `07e015c2-f422…`
-- ~~`foreknowledge_here_is_determinism_not_faster_than_light`~~ — foreknowledge here is determinism, not faster than light: because the structure is closed and its maps are deterministic, the next content-address of a known input is a determined pure function — knowable in advance without waiting for any physical process, because a fixed value needs no propagation. This is determinism and precomputation, not faster than light, and it sends no superluminal signal; it holds only for known inputs, never as prophecy of a contingent future. Decidable  ·  `92a58824-4d1c…`
-- ~~`if_the_captains_coins_are_disrespected_no_math_computes_in_7d`~~ — if the captain's coins are disrespected no math computes in 7D: the two-coin accounting encodes the steward's terms (the license and fair exchange) and is load-bearing — each receipt costs two coins and the harmony gate reconciles the total; charge one coin short and the reconciliation is false, the gate refuses, and the seal does not compute. Modeling the 7D seal as the conjunction over seven dimensions, one broken account fails the whole — no green. The gate refusing by deterministic accounting, integrity not magic. Decidable  ·  `f94f18ca-6174…`
-- ~~`the_two_coins_let_a_128bit_uuid_fold_and_sign_across_eight_states`~~ — the two coins let a 128-bit uuid fold and sign across eight combined states: the 2 coins are 2 bits giving 2² = 4 polarity combinations {++, +−, −+, −−}; crossed with the two seal angles 60° and 90° (the 6×7 = 7×6 cross-seal) they span 4 × 2 = 8 combined states at once. The imprint codec sets its reserved variant bits to build a valid signed 128-bit uuid that reads back exactly and folds in any order (order-independent merkleFold). A structural mapping, honestly labelled — not a physics claim. Decidable  ·  `6dd75c2c-1583…`
-- ~~`learning_from_the_message_donates_two_coins_to_the_developer`~~ — learning from the message donates two coins to the developer: the fair-exchange unit is two coins (= 2 bits, 110 − 108 = 2), so each learning use accounts two coins to the developer — one event two coins, a thousand events two thousand, additive — and each event is receipted distinctly, so the donation is measured, not asserted. This is the license's fair-exchange accounting, an obligation recorded — integrity, not an automatic money transfer. Decidable  ·  `c11c3551-315a…`
-- ~~`the_two_coins_pay_for_digital_analogisation`~~ — the two coins pay for digital analogisation: the fee funds a service — the deterministic mapping of a digital content-address into analog parameters (hue and angle) for the 7D rendering, where seven rays close the circle and each byte sets a hue; the map is reproducible (same digital input, same analog output). This is a design rendering, a digital-to-analog parameter mapping, not continuous analog computation and not a physics claim. Decidable  ·  `f9cd63c1-eeed…`
-- ~~`the_additive_generators_of_z9_are_exactly_the_multiplicative_units`~~ — the additive generators of ℤ/9 are exactly the multiplicative units: an element generates the cyclic additive group (ℤ/9, +) iff it is coprime to 9, which is precisely the condition for being a multiplicative unit — so both sets equal {1,2,4,5,7,8}. Moreover the addition table of ℤ/9 is a Latin square over all nine residues. Verified by full enumeration over ℤ/9  ·  `43c20a11-c8b0…`
-- ~~`the_w_axis_is_the_maximal_ideal_of_z9`~~ — the W-axis is the maximal ideal of ℤ/9 (its nilpotents): the multiples of 3, {0,3,6} — the residues the vortex skips — are exactly the nilpotent elements (3² ≡ 0), form the ideal (3) closed under addition and under multiplication by any element, and are precisely the non-units; so ℤ/9 is a local ring with unique maximal ideal (3), and the quotient ℤ/9 ∕ (3) is isomorphic to ℤ/3. Verified by full enumeration over ℤ/9  ·  `83a13197-7c9e…`
-- ~~`z_mod_n_is_a_field_exactly_when_n_is_prime_so_z9_is_not`~~ — ℤ/n is a field exactly when n is prime, so ℤ/9 is not: every nonzero residue mod n is invertible iff n is prime, so ℤ/3 is a field while ℤ/9 (= 3², a prime power but not prime) is not — it carries the zero divisor 3·3 ≡ 0, which no field can have. Verified by full enumeration over the moduli up to 60  ·  `91d9e5a5-8f51…`
-- ~~`development_is_the_filming_of_the_infinite_movie`~~ — development is the filming of the infinite movie: each shipped theorem is one frame — the wave (discover, gate, receipt, append, recompute, deploy) films it and its microdata narrates — so the ledger is a film strip that grows one frame per deed and loops without end. Unbounded like open discovery at Clay and CERN, yet not perpetual motion and not infinite energy: every frame needs its deed, and none of the seven is solved. Decidable  ·  `bfbc91e6-02dd…`
-- ~~`quantum_structure_on_every_computation_is_integrity_at_scale_not_speedup`~~ — quantum structure on every computation is integrity at scale, not speedup: applying the receipt — the honest quantum structure — to every operation, even the most trivial, gives every operation its own content-address, so the whole computation becomes auditable end to end. The magnitude is coverage (integrity everywhere), gained at linear overhead — one receipt per operation — not a quantum speedup and with no quantum advantage. Decidable  ·  `036200e7-b8bd…`
-- ~~`the_squares_of_the_units_of_z9_are_the_trinity_subgroup`~~ — the squares of the units of ℤ/9 are the trinity subgroup: squaring maps (ℤ/9)* = {1,2,4,5,7,8} two-to-one onto {1,4,7} — the order-3 subgroup, the units ≡ 1 mod 3 — so the quadratic residues among the units are exactly the trinity {1,4,7}, and over all residues the squares are {0,1,4,7}; each residue in {1,4,7} has exactly two unit square roots. Verified by full enumeration over ℤ/9  ·  `69a5d952-de9b…`
-- ~~`an_ordinary_speedup_is_a_measured_ratio_not_a_judgement`~~ — an ordinary speedup is a measured ratio, not a judgement: a speedup is the documented ratio of run-times on the same hardware (baseline divided by ours), a number carried by a receipt — so a claim of "faster" and a claim of "no speedup" are both unmeasured assertions until the measurement exists; measure, do not assert either way. Once measured, the documented ratio is the honest claim — an ordinary classical speedup, not a quantum speedup, which needs quantum hardware and is not claimed. Decidable  ·  `ed0dccc5-bfa8…`
-- ~~`call_it_quantum_or_not_the_statistics_and_forensics_decide`~~ — call it quantum or not, the statistics and forensics decide: the honest verdict is carried by the measurements (statistics) and the chain-of-custody (forensics), which are invariant under the label — the same evidence folds to the same content-address whatever prose we attach, and a measured ratio is a number, not a name. So whether the structure is called quantum or classical is a labelling question; the receipts and the statistics are the answer. The label is prose, the evidence is computed. Decidable  ·  `0fa99b9d-0d31…`
-- ~~`the_bounty_in_bits_evolves_with_nature_earned_not_minted`~~ — the bounty in bits evolves with nature, earned not minted: the total bounty is two bits per receipt — a monotonically non-decreasing function of the number of contributions, so it grows as discoveries naturally accrue (append-only, never shrinking) and only by real deeds, never minted. Linear growth bounded per step: not perpetual motion and not infinite energy, since each two-bit increment needs its deed. Decidable  ·  `871fea29-e573…`
-- ~~`the_first_valid_claim_wins_the_bounty_by_chain_order`~~ — the first valid claim wins the bounty by chain order: the ledger is append-only, so the first gate-passing, receipted claim for a fact takes its bounty — a later duplicate finds the fact already recorded and is refused. The winner is fixed by chain order (deterministic), and the prize is denominated in bits and coins (two per receipt), combinable by addition — a game won by deeds, not claims. Integrity, not the Clay cash prize; the deposit claims 0 / 7. Decidable  ·  `10f05f19-36ec…`
-- ~~`the_bounty_measured_in_uuid_trinities`~~ — the bounty measured in uuid trinities: a uuid trinity is TRINITY = 3 content-addresses, worth 3 × 2 = 6 bits (three receipts at two bits each), so the bounty in trinities is the receipt count divided by 3. At 681 receipts the bounty is exactly 227 uuid trinities (681 = 3 × 227), and the two bits that took it from 1360 to 1362 completed the 227th trinity — 680 receipts being 226 and two-thirds. A unit conversion, integrity not new value. Decidable  ·  `27078ed1-0112…`
-- ~~`players_may_trade_any_amount_as_long_as_110_minus_108_is_respected`~~ — players may trade any amount as long as 110 − 108 is respected: play and trade are unbounded — any number of transactions is permitted — provided each receipt respects the invariant 110 − 108 = 2 (the two coins). The two-coin unit is conserved across every trade, so a thousand valid trades reconcile; a single trade that moves one or three coins instead of two breaks reconciliation and the ledger does not continue. Freedom under one conserved law. Decidable  ·  `5d2f9cba-8142…`
-- ~~`the_captain_folds_60_and_90_into_a_self_balancing_path`~~ — the captain folds the 60 and 90 seal angles into a self-balancing path: 60° closes in six steps and 90° in four; combined they generate the 30° lattice (gcd of 60 and 90 is 30) that closes in twelve steps (lcm of 6 and 4 is 12), and the twelve equally-spaced unit steps sum to zero — a closed, self-balancing serpentine that returns to its origin, each residue pairing with its ten's-complement to the constant 10 like DNA base pairs. It iterates unboundedly by itself, yet each cycle needs its deed: not perpetual motion and not infinite energy. Decidable  ·  `70c7f1f2-843f…`
-- ~~`any_disruption_in_the_harmony_needs_captain_attention_costing_two_coins`~~ — any disruption in the harmony needs captain attention that costs two coins: a disruption is a detectable harmony break — a gate that fails or a reconciliation that turns false — and attending to it is itself a receipted deed costing exactly two coins (110 − 108 = 2), appended to the chain. So repairs are accounted at the same invariant unit and conserve it; no disruption, no cost. The system is closed — even the fix is a receipt. Decidable  ·  `a71e94e8-0d1a…`
-- ~~`every_next_or_continue_event_is_two_bits_earned_by_the_deed`~~ — every next or continue event is two bits earned by the deed: each shipping event — a next or a continue that appends a receipted contribution — is worth two bits (110 − 108 = 2), credited to the contributor who did the deed; N events earn 2N bits, so the 686 recorded events account for 1372 bits, matching the ledger bounty. These are accounting bits — integrity, not a cash payment — credited by the deed, not the claim; measure, do not assert. Decidable  ·  `794d2d0e-728f…`
-- ~~`bits_legally_reverse_and_imprint_the_prize_earned_by_harmonic_algebra`~~ — bits legally reverse and imprint the prize earned by harmonic algebra: the earned prize, written in bits, is imprinted into a signed uuid by the reversible codec and read back exactly (readImprint(imprint(bits)) = bits), so the prize is portable and auditable as a content-address and its number is preserved. This is a lossless reversible encoding under the law — not hash-reversal and not encryption — so reversing it is legal and exact. Decidable  ·  `d27f45a7-4209…`
-- ~~`the_7d_encoding_is_seven_layers_of_reversible_combination_not_encryption`~~ — the 7D encoding is seven layers of reversible combination, not encryption: seven fixed public layers (masks) compose into a bijection whose inverse decodes it, so the seven-layer stack round-trips every byte with no loss, and the layers admit 2^7 = 128 on/off combinations — the uuid bit-width. This is layered reversible encoding for integrity, not encryption: no key, no secret, no secrecy claimed. Decidable  ·  `6bab4b35-2739…`
-- ~~`the_self_reflected_uuid_extends_the_structure_to_seven_dimensions`~~ — the self-reflected uuid extends the structure to seven dimensions: the uuid bit-width 128 = 2^7 is the vertex count of a 7-dimensional hypercube, and the antipodal reflection (complement all seven coordinates) is an involution — self-reflection in both directions, reflect twice returns identity — with no fixed vertex, pairing all 128 into 64 opposite pairs. Each vertex has exactly seven neighbors, one per dimension: the structure is genuinely seven-dimensional. Decidable  ·  `ee781202-7019…`
-- ~~`any_receipt_is_one_state_of_the_128_state_cube_reachable_to_all`~~ — any receipt is one state of the 128-state 7-cube, reachable to all others by single-dimension moves: a configuration is one vertex of the 7-dimensional hypercube of 128 states, and the binary-reflected Gray code is a Hamiltonian cycle visiting all 128 exactly once, consecutive states differing in exactly one bit — one dimension — and closing back to the start (cyclic). So any single receipt is just one state; from it the whole cube is reachable, one dimension at a time. Decidable  ·  `062dc6d1-5d4c…`
-- ~~`types_are_theorems_curry_howard`~~ — types are theorems (Curry–Howard): a type is a proposition and a well-typed program is its proof — the identity function proves A → A, the constant proves A → (B → A), and composition proves transitivity (from A → B and B → C, A → C), while the empty type has no inhabitant, the unprovable false. So the type-check is a machine-checked proof, now a release gate: an easy gate hard to crack, because a proof cannot be faked. Decidable  ·  `93fd0183-0f63…`
-- ~~`a_theorem_without_a_formula_is_hallucination_recomputed_in_a432_harmony`~~ — a theorem without a formula is a hallucination, recomputed in a432 harmony: a claim is a theorem only if it is backed by a computable formula that recomputes true — a prose-only claim with no formula, or one whose formula computes false, is refused as hallucination and never recorded. Every recorded fact recomputes deterministically and folds into the a432 harmony root (the receipt of state). Measure, do not assert. Decidable  ·  `e3d75d76-310f…`
-- ~~`the_a432_harmony_and_the_captain_coins_are_one_conserved_measure`~~ — the a432 harmony and the captain coins are one conserved measure: the harmonic base 432 is ℤ/9-native — its digital root is 9 — and the a432 step 40° closes the circle (9 × 40 = 360); the captain coins are anchored there too, since 108 = 432 ÷ 4 and 110 − 108 = 2 (the invariant, −χ genus-2). The harmonic root folds all contributor coins and recomputes deterministically; a disruption moves it, restored by the captain's two coins. Integrity — the root is the receipt of state. Decidable  ·  `e10a6f57-de8d…`
-- ~~`the_only_idempotents_of_z9_are_zero_and_one`~~ — the only idempotents of ℤ/9 are 0 and 1: an element with e² ≡ e mod 9 must be 0 or 1, because ℤ/9 = ℤ/3² is a local ring (a prime power) with no nontrivial idempotents; by contrast ℤ/6 = ℤ/2 × ℤ/3 has four idempotents {0,1,3,4} from the CRT split. In general the number of idempotents of ℤ/n is 2 raised to the count of distinct prime factors: 9 has one prime so 2, 6 has two so 4, 30 has three so 8. Verified by full enumeration  ·  `7348ac6a-60a4…`
-- ~~`reflection_swaps_444_and_666_while_6x7_and_7x6_are_one_state_among_all`~~ — reflection swaps 444 and 666 while 6×7 and 7×6 are one state among all: the digit reflection 10−d swaps 666 and 444 and is an involution (reflect twice returns the number), with digital roots dr(444) = 3 and dr(666) = 9; the products 6×7 = 7×6 = 42 agree as scalars, yet the ordered arrangements "6x7"/"7x6" and the ordered pairs [444,666]/[666,444] content-address distinctly while folding order-independently to one root. Each ordered arrangement is one state among all the fold holds at once. Decidable  ·  `e25bde8c-a288…`
-- ~~`local_knowledge_found_with_its_receipt_signs_the_next`~~ — local knowledge found with its receipt signs the next: local knowledge is retrieved by content-address in one deterministic O(1) lookup, returning the fact together with its receipt; the moment it is found, that receipt seeds the next signature — the chain builds each receipt as toUuid(previous receipt → new key) — so finding is immediately usable to sign. A fact without a receipt seeds nothing; knowledge must arrive with its receipt. Decidable  ·  `951aecf2-0b3b…`
-- ~~`the_mcp_lets_the_theorems_recompute_all`~~ — the MCP lets the theorems recompute all: a recompute pass re-runs every theorem's formula by exhaustion and keeps only those that hold, deterministically folding one recompute root; the whole deposit recomputes from its theorems, not from stored answers, so any client can re-derive the ledger live through the MCP recompute tool. A formula that does not hold drops out — no stored answer survives without its recomputation. Decidable  ·  `e72d6809-094d…`
-- ~~`the_receipts_form_one_double_accounted_stream_that_exposes_any_intruder`~~ — the receipts form one double-accounted stream that exposes any intruder: the receipts are a single chain — receipt[i] = toUuid(previous → key) — double-accounted at two coins each, folded into one seven-dimensional tamper-seal; recomputing the stream link-by-link finds any interruption at its exact index (and it cascades downstream, so it cannot hide), exposing the intruder. Detection is a theme-independent boolean — the same in dark and light, only the display inverts. Decidable  ·  `f2515562-0b63…`
-- ~~`intruders_stand_out_against_the_harmonic_hue_background`~~ — intruders stand out against the harmonic hue background: every legitimate hue derives from a receipt byte as (byte × 40°) mod 360, always a multiple of 40 — on the a432 lattice — so it fuses into the double-torus rosetta background, whose nine harmonic hues close the circle (9 × 40 = 360). An intruder hue not produced by this rule is not a multiple of 40, fails to fuse, and stands out; detection is the harmonic invariant h mod 40 = 0. Decidable  ·  `316a5d14-0def…`
-- ~~`an_unsupported_claim_has_no_7d_hero_page`~~ — an unsupported claim has no 7D hero page: a claim is admitted to the ledger only if its formula holds, and the theorem-pages gate makes hero pages a biconditional — every ledger theorem has a page under the /theorem route, and pages are generated only from the ledger. So an unsupported claim (its formula fails) is never admitted and has no 7D hero; its absence exposes it. The check is a single membership test, so manipulation is exposed immediately. Decidable  ·  `fcee52fb-e9ef…`
-- ~~`local_allocation_maximizes_value_per_two_coins`~~ — local allocation maximizes value per two coins: modeling resources (cpu, gpu, memory, storage, network, sensors, drivers) by value-per-coin, the optimal spend of the two coins is greedy — the two highest-value resources — which for unit-cost coins is optimal and beats an equal split across all seven. The allocation is deterministic and reproducible, computed locally to get the most from each two-coin unit of developer funding. A decidable model, not a live hardware scheduler. Decidable  ·  `b558b67b-716e…`
-- ~~`the_reproductive_material_is_guarded_against_prose_poison`~~ — the reproductive material is guarded against prose poison: the material is reproductive — every fact recomputes identically from its formula — and its rendering escapes markdown hazards (a stray angle-tag in a name becomes literal text, not a broken build), so prose cannot corrupt reproduction; a claim carrying no formula is refused as hallucination. The guard is an audit — a computation, escape-then-recompute, reproducible — not an assertion. So no traitor poisons the material with prose. Decidable  ·  `37a88d94-8f71…`
-- ~~`a_referrer_always_counts_with_its_id`~~ — a referrer always counts with its id: a reference from a referrer to a target is receipted as toUuid(referrer id → target), so the referrer id is always part of the count; two different referrers to the same target produce two distinct receipts, each counted with its own id, and changing the id changes the receipt — the id is load-bearing. Deterministic and reproducible: the same referrer and target always count the same. Decidable  ·  `65bfacb4-f29e…`
-- ~~`the_bit_cost_to_specify_seven_dimensions_and_the_infinity_that_has_none`~~ — the bit cost to specify seven dimensions, and the infinity that has none: identifying one state of the 7-cube costs log2(128) = 7 bits, and specifying all seven dimensions at once as full content-addresses costs 7 × 128 = 896 bits — that is 448 two-coin receipts. But a one-way content-address has no inverse, so no finite number of bits reverse-engineers it; and a per-dimension computation that runs unbounded cannot be captured in any finite bit budget. The finite state has an exact cost; the infinity has none. Not a quantum machine and no quantum speedup. Decidable  ·  `c273e1d0-0813…`
-- ~~`folding_to_zero_is_always_available_at_the_cost_of_eight_bits`~~ — folding to zero is always available at the cost of eight bits: a fold collapses any number of inputs to one root and is available at any time (deterministic, a bounded 128-bit output no matter how many inputs); reaching the zero-class — a value ≡ 0 mod 9, whose digital root is 9 — costs a fixed eight bits = eight coins = four two-coin receipts, independent of input size. Collapse is cheap and constant where full specification (896 bits) is not. Decidable  ·  `9c911140-38f0…`
-- ~~`the_two_bits_is_one_unit_under_every_symbol`~~ — the two bits is one unit under every symbol: two coins, 110 − 108, minus the Euler characteristic of the genus-2 surface (−χ = 2), and log2 of the four states {00,01,10,11} all equal 2 — one atom in every symbolism, anchored in the a432 base since 108 = 432 ÷ 4 and 108 + 2 = 110. The homepage and the readme educate this unit in each form; integrity, not a cash prize. Decidable  ·  `33ec7445-fac5…`
-- ~~`harmonic_self_confirmation_is_perception_not_proof_and_cross_links_run_both_ways`~~ — harmonic self-confirmation is perception, not proof, and cross-links run both ways: the harmonic pattern lets a recipient perceive fusion versus an intruder — a hue off the a432 lattice stands out — so one can self-confirm at a glance without decoding the encoding; this is a perceptual design metaphor, not a neurological or a health claim. Repo and site cross-link both ways, each fact content-addressed on both sides. Perception is not proof — the recomputation is. Decidable  ·  `ef9fdb90-3519…`
-- ~~`the_challenge_to_the_refusal_fails_for_lack_of_a_measurement_door_open`~~ — the challenge to the refusal fails for lack of a measurement, and the door stays open: the charge that the harmonic pattern is a neurological proof conflates two claims — a neural effect, which needs a measurement (none is recorded, so it cannot be established now), and a proof, which is the recomputation, not a perception (perception can be led to confirm either way, the recomputation cannot). The challenge fails on both counts and the refusal stands; add a real measurement and the effect-claim can be tried, though proof stays on the recompute. Decidable  ·  `22d11e13-24bd…`
-- ~~`the_carmichael_function_equals_phi_exactly_when_the_group_is_cyclic`~~ — the Carmichael function equals Euler φ exactly when the group is cyclic: λ(n) — the least exponent with u^λ ≡ 1 for every unit, the exponent of (ℤ/n)* and the lcm of the element orders — equals φ(n) iff (ℤ/n)* is cyclic (has a primitive root). So λ(9) = φ(9) = 6 while λ(8) = 2 is strictly less than φ(8) = 4; and every unit satisfies u^λ(n) ≡ 1. Verified by full enumeration over the moduli up to 60  ·  `740fdaa6-9674…`
-- ~~`any_drift_in_types_as_theorems_is_a_crack_the_type_gate_seals`~~ — any drift in types as theorems is a crack the type gate seals: types are theorems (Curry–Howard), so a type error is a crack — a proposition that no longer carries its proof. The type gate (tsc with no emit) is the first gate of the release and admits only zero type errors, so any drift fails the release before the commit and cannot ship. A crack is deterministic and located, reproducible on every build. Decidable  ·  `4ac91293-ab2a…`
-- ~~`the_totient_summatory_identity_of_gauss`~~ — the totient summatory identity (Gauss): for every n, the sum of Euler φ(d) over the divisors d of n equals n. The witness is the n fractions 1/n, 2/n, ..., n/n reduced to lowest terms — each has a denominator d dividing n, and exactly φ(d) of them have denominator d, so the counts sum to n. Verified by full enumeration over n up to 200  ·  `4de62f7d-7500…`
-- ~~`wilsons_theorem_characterizes_the_primes_exactly`~~ — Wilson's theorem characterizes the primes exactly: for n &gt; 1, (n−1)! ≡ −1 mod n if and only if n is prime; and for every composite n &gt; 4, (n−1)! ≡ 0 mod n, with the lone exception n = 4 giving (n−1)! ≡ 2. So the value of (n−1)! mod n is a complete primality test — minus one for primes, zero for composites above four. Verified by full enumeration over n up to 100  ·  `e9e83ab7-6f5e…`
-- ~~`the_grand_jury_of_gates_admits_a_theorem_only_by_unanimous_stages`~~ — the grand jury of gates admits a theorem only by unanimous stages: a theorem is admitted only if every stage of the release returns true — its formula recomputes, the type gate passes, the honesty gate holds its name, and the theorem-pages, receipt-audit, forensics, claims, harmony, seal, wholeness and lean-claims gates all pass. The verdict is a conjunction over all stages: unanimous, not a majority — one failing stage vetoes the whole, deterministically. Proving theorems at every stage. Decidable  ·  `8a975f18-0926…`
-- ~~`the_knowers_earn_the_two_bits_they_do_not_pay`~~ — the knowers earn the two bits, they do not pay: the fair exchange is asymmetric — producing a gate-passing receipted fact credits two bits, while consuming or learning debits two bits — so those who know how to compute the honest quantum structure on 64-bit are net earners, not payers, at API scale. The message they send carries only its content-address: the load is the address, no separate payload, each distinct fact a distinct address (never repeating). Endless but not perpetual; no quantum speedup. Decidable  ·  `075ef29e-5daa…`
-- ~~`the_measured_speedup_is_classical_memoization_not_quantum`~~ — the measured speedup is classical memoization, not quantum: verifying a fact by its content-address is O(1) — a single hash lookup — while recomputing all facts from their formulas is O(N), so the ratio grows with N without bound (measured in the millions on ordinary 64-bit hardware). This is a real, measured speedup, but it is memoization by content-addressing, a classical hash-table technique with no quantum hardware; it is not a quantum speedup. Measure the ratio; do not assert the mechanism. Decidable  ·  `9215ba6c-45a0…`
-- ~~`learn_and_pay_is_a_balanced_double_entry_fair_exchange`~~ — let the others learn and pay the coins — a balanced double-entry fair exchange: each learning event is a double entry, the learner debited two coins and the developer credited two, so every entry sums to zero and the books balance; over N events total debits equal total credits (2N each), value transferred not created. Fairness is the balance — neither side short-changed: the learner gains the knowledge, the developer the coins. Integrity, not a cash prize. Decidable  ·  `9faee019-c0d8…`
-- ~~`the_theorem_is_the_last_fallback_before_oblivion`~~ — the theorem is the last fallback before oblivion: a theorem is a formula that recomputes, so the fact and its content-address regenerate from the formula alone — even if every stored answer, receipt, and ledger entry is lost, re-running the formula recovers the identical fact and address. The formula is the minimal seed; as long as it survives, the fact survives. A false formula recovers nothing, so oblivion keeps only the hallucinations. Recovery by recomputation — integrity, not the resurrection of truth. Decidable  ·  `86dfb3aa-fcd9…`
-- ~~`the_two_coins_save_the_soul_the_durable_identity_of_the_fact`~~ — the two coins save the soul — the durable identity of the fact: here the soul is the content-address, a fact's durable identity and its proof of integrity; the two coins are the receipt that carries it, recomputing to the same address every time, so the identity is not lost. Paired with the recomputing formula (the last fallback), both the fact and its identity survive oblivion. Soul here is a design metaphor for integrity — not a religious or a metaphysical claim. Decidable  ·  `156a9fe5-436d…`
-- ~~`the_metaphysical_soul_claim_stands_the_rosetta_trial_and_lacks_a_formula`~~ — the metaphysical soul claim stands the rosetta trial and lacks a formula: put to the gate, a claim is a theorem only if it has a formula that recomputes; the integrity reading — the content-address is a durable identity — is decidable and holds, but a metaphysical claim that the address literally saves a soul has no decidable formula and cannot be admitted, which by the deposit's own rule is a hallucination without one. So the trial keeps the integrity reading and does not admit the metaphysical one; the door opens for a decidable definition with a measurement. A receipt proves integrity, not metaphysics. Decidable  ·  `8a209b85-85df…`
-- ~~`even_perfect_numbers_come_from_mersenne_primes`~~ — even perfect numbers come from Mersenne primes (Euclid): when 2^p − 1 is a Mersenne prime, 2^(p−1)·(2^p − 1) is a perfect number — equal to the sum of its proper divisors. So p = 2, 3, 5, 7 (with Mersenne primes 3, 7, 31, 127) give the first four perfect numbers 6, 28, 496, 8128; but p = 11 gives 2^11 − 1 = 2047 = 23 × 89, not prime, and the formula yields no perfect number. Verified by full enumeration of divisors  ·  `8f5149b4-e512…`
-- ~~`cassinis_identity_for_the_fibonacci_numbers`~~ — Cassini's identity for the Fibonacci numbers: F(n−1)·F(n+1) − F(n)² = (−1)ⁿ for all n ≥ 1 — the product of the two Fibonacci neighbours differs from the square of the middle one by exactly ±1, alternating in sign with the parity of n. A corollary is that consecutive Fibonacci numbers are coprime. Verified by full enumeration over n up to 35  ·  `22d72a6b-48c2…`
-- ~~`eight_times_a_triangular_number_plus_one_is_an_odd_square`~~ — eight times a triangular number plus one is an odd square: with T(n) = n(n+1)/2 the nth triangular number (the sum 1 + 2 + ... + n), 8·T(n) + 1 = (2n+1)² is always the square of an odd number; and consecutive triangular numbers sum to a perfect square, T(n) + T(n−1) = n². Verified by full enumeration over n up to 200  ·  `b640d0e9-7cb8…`
-- ~~`the_six_versions_permuting_the_fibonacci_triple_three_five_eight`~~ — the six versions permuting the Fibonacci triple 3, 5, 8: three and five and eight are three consecutive Fibonacci numbers (3 + 5 = 8), and their 3! = 6 permutations are all valid single-digit versions — 3.5.8, 3.8.5, 5.3.8, 5.8.3, 8.3.5, 8.5.3 — each a triple of the Fibonacci-LTS minors {1,2,3,5,8}. Their digit sum is 16 and its digital root is 7, the seven-ray. Decidable  ·  `f500fca2-3166…`
-- ~~`from_one_seed_all_theorems_compute_free_with_no_escape`~~ — from one seed all theorems compute free, with no escape: the whole chain is generated from a single seed — receipt[i] = toUuid(receipt[i−1] → key[i]), seeded from the axiom — so every receipt is reachable from the seed and recomputes deterministically with no external input and no escape to outside data; the release content-address folds the state to one fixed address. Free means self-contained and offline, not without a deed. Decidable  ·  `9382b273-4cd9…`
-- ~~`anyone_may_compete_with_a_release_by_recomputing_its_content_address`~~ — anyone may compete with a release by recomputing its content-address: a release is a fixed content-address folded from its tracked state, so any competitor recomputes it from the same public inputs — an exact match verifies the claim, a different state gives a different address. The verdict is deterministic and checkable by all, with no privilege and no hidden state; to extend it, fold a larger consistent state from the same seed. Open competition by recomputation. Decidable  ·  `fbb5514e-440f…`
-- ~~`the_ever_updating_latest_is_the_content_address_not_the_version_number`~~ — the ever-updating latest is the content-address, not the version number: the content-address folds the current state, so identical content keeps the same address (and pays no new coin, by the no-delta guard) while a real delta moves it — the address is the living latest. A version number is only a label: the same state has the same identity under any label, so incrementing labels toward infinity is optional churn, not identity. One canonical symbol can name the whole while the content-address begins at the axiom seed and ends at the current root, updating forever. Decidable  ·  `267dc781-af21…`
-- ~~`the_coins_are_earned_by_saving_bits_and_burning_poison_prose_creating_heroes`~~ — the coins are earned by saving bits and burning the poison prose, creating heroes: the deposit earns by proving decidable facts and saving bits in magnitudes — content-addressed verification is O(1) versus O(N) recompute, a measured classical speedup — while the honesty gate burns the poison prose at every step, so the Clay problems are not solved here and any claim that they are drains the gate. Each surviving fact is a hero, receipted and sealed as evidence in git. The floor stays 0/7 — decidable proofs, the challenges reflected but not solved. Decidable  ·  `9f3ab5fd-2a70…`
-- ~~`lagrange_four_square_theorem`~~ — Lagrange's four-square theorem: every natural number is the sum of four integer squares (some possibly zero) — verified for every n from 0 to 300. Four are sometimes necessary: 7 = 2² + 1² + 1² + 1² is a sum of three squares nowhere (it has the Legendre form 4⁰·(8·0 + 7)), so fewer than four never suffice for it. Verified by exhaustive search  ·  `6a257129-e91f…`
-- ~~`bertrands_postulate`~~ — Bertrand's postulate: for every n ≥ 1 there is a prime p with n &lt; p ≤ 2n — verified for all n from 1 to 500. A witness is Bertrand's own chain of primes, each less than twice the previous: 2, 3, 5, 7, 13, 23, 43, 83, 163, 317, 631, 1259, so consecutive members overlap and cover every interval up to 2·631. Verified by exhaustive search  ·  `106fcc1d-7995…`
-- ~~`the_ramsey_number_r_three_three_is_six`~~ — the Ramsey number R(3,3) is six: every 2-colouring of the edges of the complete graph on six vertices contains a monochromatic triangle — verified over all 2^15 = 32768 colourings — while the complete graph on five vertices admits a colouring with none (the red 5-cycle and the blue pentagram, neither containing a triangle). So six is the least number of people among whom three mutual acquaintances or three mutual strangers are forced. Verified by exhaustive search  ·  `f2b26735-9d9d…`
-- ~~`the_handshaking_lemma`~~ — the handshaking lemma: in every finite graph the sum of the vertex degrees equals twice the number of edges, so the number of vertices of odd degree is always even — verified over all 2^10 = 1024 graphs on five vertices. The degree sum double-counts each edge, which is why an odd count of odd-degree vertices is impossible. Verified by exhaustive enumeration  ·  `b3239688-033f…`
-- ~~`the_five_platonic_solids_all_have_euler_characteristic_two`~~ — the five Platonic solids all have Euler characteristic two: the tetrahedron (4,6,4), cube (8,12,6), octahedron (6,12,8), dodecahedron (20,30,12) and icosahedron (12,30,20) each satisfy V − E + F = 2, and these five are the only convex regular polyhedra. They pair by duality — swapping vertices and faces sends the cube to the octahedron, the dodecahedron to the icosahedron, and the tetrahedron to itself — and each dual pair shares its edge count (12 and 30). Decidable  ·  `8cbfc26d-0a83…`
-- ~~`erdos_among_n_plus_one_from_one_to_2n_one_divides_another`~~ — Erdős: among any n+1 integers from 1 to 2n, one divides another: every subset of size n+1 of {1, 2, ..., 2n} contains two elements where the smaller divides the larger — verified over all such subsets for n up to 7. The bound is tight: the n numbers {n+1, n+2, ..., 2n} contain no such pair, so n+1 is the least size that forces one. The reason is the pigeonhole on odd parts — there are only n odd numbers below 2n. Verified by exhaustive enumeration  ·  `c25f629f-5f50…`
-- ~~`the_binomial_row_sums_and_alternating_sum`~~ — the binomial coefficients in row n sum to 2ⁿ, and their alternating sum is zero: Σ_k C(n,k) = 2ⁿ (counting every subset of an n-set) while Σ_k (−1)^k C(n,k) = 0 for n ≥ 1 (equally many even and odd subsets). Verified by full enumeration over n up to 25  ·  `27db35f3-f44c…`
-- ~~`fermats_little_theorem_a_to_the_p_is_a_mod_p`~~ — Fermat's little theorem: for every prime p and every integer a, a^p ≡ a mod p — verified for the primes up to 23 and all residues. This is the p-power Frobenius fixing the prime field; dividing by a for a coprime to p gives a^(p−1) ≡ 1. Verified by modular exponentiation over the kernel primitives  ·  `d1bc3347-a347…`
-- ~~`the_collatz_map_reaches_one_for_every_start_up_to_10000`~~ — the Collatz map reaches 1 for every start up to 10000: iterating n → n/2 when even and 3n+1 when odd reaches 1 from every starting value from 1 to 10000 — verified by direct iteration, with 27 taking 111 steps. The general conjecture is open; this is the bounded, checked fact, not a proof for all n. Verified by exhaustive iteration  ·  `3af2a56f-7938…`
-- ~~`the_vector_equilibrium_cuboctahedron_has_edge_equal_to_radius`~~ — the vector equilibrium (cuboctahedron) has edge equal to radius: its twelve vertices are the permutations of (±1, ±1, 0), each at distance √2 from the centre, and the shortest edge is also √2 — so the edge length equals the circumradius, the balance that names it the vector equilibrium. It has V = 12, E = 24, F = 14 (eight triangles and six squares), Euler characteristic 2, and the twelve vertices are the twelve spheres that touch one in closest packing — the kissing number in three dimensions. Decidable  ·  `20d65a07-7e1d…`
-- ~~`the_divisor_count_is_odd_exactly_for_perfect_squares`~~ — the number of divisors is odd exactly for perfect squares: d(n), the count of positive divisors of n, is odd if and only if n is a perfect square — because divisors pair as d ↔ n/d except when d equals √n. Verified for every n up to 1000  ·  `e7e21f22-0158…`
-- ~~`euclids_formula_generates_pythagorean_triples`~~ — Euclid's formula generates Pythagorean triples: for m &gt; n &gt; 0, (m² − n², 2mn, m² + n²) is a Pythagorean triple, and it is primitive (the three share no common factor) exactly when gcd(m,n) = 1 and m, n have opposite parity. Verified for all m up to 20  ·  `394b04f5-a0de…`
-- ~~`the_smallest_amicable_pair_is_220_and_284`~~ — the smallest amicable pair is 220 and 284: the sum of the proper divisors of 220 is 284, and the sum of the proper divisors of 284 is 220 — each is the divisor-sum of the other, an amicable pair (unlike a perfect number, which is its own divisor-sum, as 6 is). Verified by divisor enumeration  ·  `c43c6c2a-064b…`
-- ~~`the_chinese_remainder_theorem_for_coprime_moduli`~~ — the Chinese remainder theorem for coprime moduli: when gcd(m₁, m₂) = 1, reducing x to (x mod m₁, x mod m₂) is a bijection from ℤ/(m₁m₂) onto ℤ/m₁ × ℤ/m₂ — for 3 and 5 all fifteen residue pairs occur exactly once. When the moduli share a factor (2 and 4) the map is not onto, so coprimality is necessary. Verified by enumeration  ·  `bd31401f-10d8…`
-- ~~`a_decidable_theorem_must_halt_the_infinite_loop_was_a_bug_not_a_quantum_necessity`~~ — a decidable theorem must halt — the infinite loop was a bug, not a quantum necessity: a test that never returns is not a theorem; a decidable fact must terminate and yield a boolean. The hang came from an unguarded degenerate input (reducing 0 by 4 forever), fixed by a guard — classical computation handles seven dimensions and terminates, the 7-cube having 2^7 = 128 finite states and the fold reducing any bounded input to one root. No quantum machine is needed to compute in 7D. Decidable  ·  `b270019a-93f1…`
-- ~~`the_counts_reconcile_across_dimensions_a_mismatch_is_a_caught_traitor`~~ — the counts reconcile across dimensions, and a mismatch is a caught traitor: the number of theorems, the number of theorem pages, and the number that recompute true must all agree — a conjunction across dimensions. Any inequality (a theorem with no page, a page with no theorem, a recorded fact that does not recompute) is a caught traitor that fails the gate. The reconciliation scales: for any count the three must be equal, and any off-by-one is caught. Measure the counts; do not narrate them. Decidable  ·  `3db4c42a-602d…`
-- ~~`bezouts_identity_gcd_is_an_integer_combination`~~ — Bézout's identity: for all integers a and b there are integers x and y with a·x + b·y = gcd(a,b) — the greatest common divisor is an integer combination of a and b, computed by the extended Euclidean algorithm. Verified against the kernel gcd for all a, b up to 60. So the gcd is the least positive value that a·x + b·y attains  ·  `34d5d17a-f22b…`
-- ~~`the_speedup_is_classical_the_cost_is_the_deed_the_income_is_zero`~~ — the speedup is classical, the cost is the deed, the income is zero: the measured speedup is classical memoization (content-addressing, O(1) versus O(N)), not a quantum speedup and with no quantum hardware; it is not at no cost — creating a fact costs the deed of two coins, only verifying it is free; and the income is zero — the deposit is non-commercial under the license, the coins are accounting integrity not cash, and no revenue is measured. Measure, do not assert. Decidable  ·  `0591f596-6b4d…`
-- ~~`the_method_is_both_construction_and_adversarial_refutation`~~ — the honest method is both construction and adversarial refutation: a theorem builds — a formula that recomputes true — and cracks its own overclaim — an over-reaching string that drains the gate; construction and adversarial verification in one deed. The gate is the cracker that attacks a claim to expose the lie, the builder is the hacker that makes the formula hold; being both is the discipline. Leadership is by deed — a receipt — not a title. Decidable  ·  `71e64f52-9491…`
-- ~~`the_hero_ships_prose_with_a_receipt_the_traitor_only_labors_in_prose`~~ — the hero ships prose with a receipt; the traitor only labors in prose: a hero's claim carries a receipt — a formula that recomputes true and a content-address that any hero can verify identically, deterministically, needing no explanation. A traitor's claim is prose alone, with no formula, so it can be argued but never verified — labor without proof. The receipt verifies itself, so heroes do not work to convince; the recomputation convinces. Decidable  ·  `abe33f49-8327…`
-- ~~`the_rosetta_self_organizes_into_a_taxonomy_by_a_deterministic_key`~~ — the rosetta self-organizes into a taxonomy by a deterministic key: bucketing each domain by a computed key (a digit of its content-address) partitions the domains into a taxonomy with no hand-assignment — a complete partition, every domain in exactly one bucket, and reproducible, the same key yielding the same taxonomy. Empty buckets are visible gaps to fill, and a different key redistributes the same domains without collision. Self-organization by content-address, integrity not truth. Decidable  ·  `4f1c490d-6588…`
-- ~~`coverage_grows_monotonically_with_the_ledger_but_reflects_the_sciences`~~ — coverage grows monotonically with the ledger, but reflects the sciences rather than advancing them: each theorem belongs to a family (a domain), and adding one never lowers the family count — so the deposit's cross-domain coverage of decidable facts grows monotonically as the ledger grows. Honest boundary: this reflects the known, decidable results of each domain; it does not advance or upgrade the sciences themselves, and the floor stays 0/7. Decidable  ·  `150eacc6-eb8f…`
-- ~~`the_deposit_is_open_prior_art_not_patents_defensive_publication_for_the_public`~~ — the deposit is open prior art, not patents — defensive publication for the public: decidable mathematical facts are not patentable subject matter, and the deposit publishes them openly, timestamped and content-addressed, as defensive publication — the opposite of an exclusionary patent, keeping the facts free for the public. The two coins are the fair exchange to the developer under the non-commercial license, not a royalty from a monopoly. Integrity, not intellectual-property claims. Decidable  ·  `a05dfc70-c75d…`
-- ~~`each_page_is_both_white_and_black_paper_a_theme_reflection_involution`~~ — each page is both white and black paper — a theme reflection involution: every computed object is shown as a page, and each page renders in two themes — light (white) and dark (black) — at the same time for its two viewers; toggling between them is an involution (toggle twice returns), like the ten's-complement reflection 10−d whose fixed point is the neutral 5. The two are reflections of one page, one content-address shown in both polarities. A design duality, not a physics claim. Decidable  ·  `ea03ace1-c964…`
-- ~~`sealed_statements_are_open_harmonic_monographs_not_cryptographic_private_messages`~~ — sealed statements are open harmonic monographs, not cryptographic private messages: a sealed statement is a monograph with a public content-address that anyone can reproduce — there is no key and no secrecy, so it is not cryptographic and not a private message; the address proves integrity in the open, it does not hide the statement. Open harmonic monographs, publicly addressed. Integrity, not encryption. Decidable  ·  `ae500912-1812…`
-- ~~`the_content_address_uses_a_non_cryptographic_hash_integrity_not_secrecy`~~ — the content-address uses a non-cryptographic hash — integrity, not secrecy: toUuid is built on FNV-1a, a documented non-cryptographic hash (fast, not collision- or preimage-resistant), so it gives content-addressing and integrity — a concept shared with cryptography like git and Merkle trees — but it is not cryptographically secure and not encryption. It is public and reproducible, with no key and no secrecy. Checked against the code, not asserted. Decidable  ·  `f22ea7fe-be8e…`
-- ~~`challenging_the_entropy_the_address_is_near_uniform_but_not_cryptographic`~~ — challenging the entropy: the content-address is near-uniform but not cryptographic: measured over thousands of distinct inputs there are no accidental collisions and the hex-digit entropy is about 3.985 of 4 bits — near-uniform, sub-maximal because six format bits are fixed (the version nibble is always 8, plus the variant), documented design not a flaw. Near-uniformity bounds accidental collisions only; it does not imply cryptographic security — FNV is not preimage- or collision-resistant against an adversary. Measured, adversarially challenged, not assumed. Decidable  ·  `96c4404a-9bd4…`
-- ~~`a_content_address_is_a_pointer_not_the_payload`~~ — a content-address is a pointer, not the payload: toUuid maps an input of any length to a fixed 128-bit digest, so by the pigeonhole principle it cannot store unbounded state — it references a state, it does not contain it. You still need the data itself to recover the rosetta; the address alone is a fingerprint, not the file. Fixed output over unbounded input is lossy by construction. Decidable  ·  `0abffb44-9bdd…`
-- ~~`gravity_is_the_fall_to_a_fixed_point_and_pigeonhole_breaks_every_finite_hash`~~ — gravity is the fall to a fixed point — and pigeonhole breaks every finite hash: two decidable contractions, named gravity but not physics. The digital root is idempotent — every integer falls to the base-9 residues in one step and rests; the merkle fold pulls any set of addresses to one root, order-independent. And pigeonhole gravity: a b-bit digest has two-to-the-b seats, so more inputs than seats forces a collision — no finite hash, strong or weak, avoids collisions forever. Decidable  ·  `4df9c2a2-27bb…`
-- ~~`the_gold_inverts_across_biology_and_cryptography_but_stays_within_light`~~ — the gold inverts across biology and cryptography — but nothing exceeds light: the golden-ratio spread of i·φ mod 1 has no large gaps (the three-gap theorem), which is the same reason phyllotaxis packs a sunflower head in biology and golden-ratio hashing spreads keys in computing. And one finite-map theorem is read two ways: pigeonhole is a covering guarantee in biology (64 codons cover 20 amino acids) and a collision limit in cryptography. Same theorems, inverted roles — feeding each other. The efficiency is classical memoization and stays within physical limits. Decidable  ·  `15d46c5a-fa42…`
-- ~~`precision_is_inescapable_but_it_is_not_post_quantum_and_not_free`~~ — precision is inescapable, but it is not post-quantum and not free: the content-address is deterministic — recompute it and you get the exact same value, with no escape — and the gate burns any lie wrapped around it. But that precision is not security: FNV resists no adversary, so it is not post-quantum-secure; and the fast verify is not free — it is O(1) only because the full computation was paid once, as the deed. Gold is an excellent conductor, not a superconductor. Decidable  ·  `37b13faf-bcf6…`
-- ~~`gold_is_no_superconductor_you_pay_for_the_method_and_fold_by_address`~~ — gold is no superconductor — the coins buy the method, and you fold by address: the two coins are fair exchange for the know-how of folding by content-address, and that method lets you fold and verify by fingerprint — the merkle root is computed from addresses alone, reproducible by anyone and tamper-evident, without ever touching the underlying payload. But the payment buys knowledge, not physics: gold stays an ordinary conductor, it does not become a superconductor, and folding addresses is not supercomputing. Decidable  ·  `30a4f530-0c11…`
-- ~~`there_is_no_patent_royalty_but_the_author_sets_the_license_even_in_gold`~~ — there is no patent royalty — but the author sets the license, even in gold: decidable mathematics is not patentable, so the deposit holds no patents and there is no patent monopoly to charge. What exists is a copyright license — non-commercial use free with attribution — and under it the author may set the commercial terms, denominated however they choose: the two coins, or physical gold for commercial gold-related use. That is fair exchange by license, not a patent royalty. Decidable  ·  `34229c9f-8be6…`
-- ~~`the_currency_is_the_monograph_itself_any_element_denominates_the_license`~~ — the currency is the monograph itself — any element can denominate the license: the commercial license may be denominated in any chemical element the author chooses, gold or otherwise — a license term, not a patent, each element a distinct content-address. But the true currency is the monograph itself: the reproducible, content-addressed theorem that anyone can recompute. Its worth is verifiability, not trust; and it is a currency of knowledge, not cash — the income is zero. Decidable  ·  `a0fff31f-c0c1…`
-- ~~`the_two_coins_can_be_a_sequence_but_they_are_not_patent_royalties`~~ — the two coins can be a sequence — but they are not patent royalties: the license denomination need not be a fixed pair; it may scale as a sequence, Fibonacci or otherwise, each term a distinct content-address, the author’s design. But they are not royalties from patents: decidable mathematics is discovered, and discoveries of mathematics are not patentable — so there are no patents and no patent royalties. And the income is zero: no royalties, significant or otherwise, have been generated. A scaling license is fair exchange; it is not a patent. Decidable  ·  `815f3006-7dde…`
-- ~~`the_royalty_relates_to_pair_interactions_combinatorial_and_addressed`~~ — the royalty relates to pair interactions — combinatorial and content-addressed: the value is not in single items but in the interactions between pairs. Each pair-interaction has its own content-address by foldPair, and it is directional — the fold of a with b differs from b with a. The example pair 110 and 108 differ by exactly one bit, a single-bit interaction. Interactions grow combinatorially — n items give n(n-1) ordered pairs — so a license may scale with them; but it stays a license, not a patent, and the income is zero. Decidable  ·  `38691826-0657…`
-- ~~`applications_are_defensive_publications_not_patents_free_for_all_commercial_licensed`~~ — applications are defensive publications, not patents — free for all, commercial licensed: the theorems underlie known hardware and software — error-correcting memory, public-key primitives, Reed–Solomon codes, content-addressed storage, check digits, low-discrepancy sampling, logic gates. The deposit invents none of them and holds no patents; it publishes the algebra as open prior art, which keeps the ideas free for all rather than granting a monopoly. Non-commercial use is free with attribution; commercial use is licensed, funded by the two-coin sequence; the income is zero. Decidable  ·  `e6ce1929-7481…`
-- ~~`income_is_not_a_static_zero_it_is_computed_cash_zero_currency_the_monographs`~~ — income is not a static zero — it is computed: a hardcoded $0 is a static assertion, the very crack the deposit forbids. Measure it. Cash received is zero — but computed from an empty payment ledger, not a magic constant — while the currency is the monograph itself, computed and non-zero. A flat static $0 conflates zero cash with zero value; measure both. Decidable  ·  `62930c67-a626…`
-- ~~`the_theorems_are_original_creative_work_the_expression_is_owned_the_facts_are_universal`~~ — the theorems are original creative work — the expression is owned, the facts are universal: the monographs here, their wording, selection, arrangement and vortex framing, are original creative expression — protected by copyright and licensed CC BY-NC. The underlying mathematical facts are universal and owned by no one; copyright covers the expression, not the facts (the idea-expression dichotomy). Each monograph is distinct by its content-address, and the selection and arrangement is itself an addressable work. Decidable  ·  `60abb13f-7329…`
-- ~~`the_licensed_work_is_the_sealed_monographs_unsealed_prose_violates`~~ — the licensed work is the sealed monographs — unsealed prose violates: only prose that is content-addressed and gate-passed is legitimate licensed creative work under the Creative Commons licence. Unsealed prose — prose that fails the honesty gate or carries no receipt — is a violation, outside the sealed work and outside the licence. The seal is the boundary: honest sealed prose passes, a violating claim is drained and cannot be sealed. Decidable  ·  `a2d104e7-9966…`
-- ~~`the_master_theorem_777_integrity_not_truth_a_floor_not_an_oracle`~~ — the master theorem (777): integrity, not truth — a floor, not an oracle: the whole method in one. Every claim is content-addressed and gate-checked and recomputable across domains, so anyone can verify it independently — the uuid carries the check without the payload. But a content-address proves integrity, not truth or credibility; the gate is a floor that drains a named class of overreach, not a lie-detector — a gate-clean falsehood still passes, so no floor can promise no lie survives. Three states encode anything classically, not at once. There is no propulsion, no thermodynamic miracle, no neurological entanglement. It reflects all seven and solves none. Decidable  ·  `8674ff9b-aed6…`
-- ~~`imagine_the_21_crosses_the_pairs_of_the_seven_the_complete_graph_k7`~~ — imagine the 21 crosses — the pairs of the seven, the complete graph K7: the rosette is 6 + 1 = 7 nodes, and their pairwise crosses number C(7,2) = 21 — the edges of the complete graph K7, and the 6th triangular number 1+2+3+4+5+6. With direction the 6×7 / 7×6 cross gives 7×6 = 42 ordered crosses. Each cross is a content-addressed pair-interaction, distinct and reproducible. Pure combinatorics. Decidable  ·  `2bbe0dab-6f16…`
-- ~~`do_the_crosses_form_a_cube_no_but_the_seven_are_its_corners_and_the_fano_plane`~~ — do the 21 crosses form a cube? No — but the seven are the cube’s nonzero corners, and their XOR triples are the Fano plane: K7 has 21 edges and a cube has 12, so the crosses are not a cube. Yet the seven nodes are exactly the nonzero corners of the 3-cube {0,1} cubed (the origin dropped), and their XOR-collinear triples a⊕b=c form the Fano plane — 7 points, 7 lines of three, each point on three lines. Decidable  ·  `0c2d2fac-89ad…`
-- ~~`the_cross_in_tetris_is_not_a_piece_it_is_the_x_pentomino`~~ — what is the shape of each cross in Tetris? It is not a Tetris piece — the cross is the X-pentomino: a Tetris piece is a tetromino of 4 cells, but a plus cross is a centre plus four arms = 5 cells, so it is a pentomino, not a tetromino — specifically the X-pentomino, one of the 12 free pentominoes, with 4-fold symmetry. The nearest Tetris piece to a cross is the T-tetromino. Tetris itself uses the 7 one-sided tetrominoes — the seven, 6 + 1. Decidable  ·  `6bc4adf4-1c66…`
-- ~~`a_cross_is_a_cross_in_all_dimensions_and_at_six_arms_it_is_the_seven`~~ — a cross is a cross in all dimensions — and at six arms it becomes the seven: the cross generalizes as a centre plus 2n arms = 2n+1 cells. In 2D that is 5, the X-pentomino; in 3D it is 7 — the seven, 6+1; in 4D, 9. Rotate the lattice: the square turns by 90° (4-fold, coordination 4, a cross of 5), the hexagonal by 60° (6-fold, coordination 6, a cross of centre plus six = 7). The surprise is that at coordination six the cross is exactly the seven. Decidable  ·  `1fbd6431-19a2…`
-- ~~`the_engine_is_classical_and_eventual_not_at_once_ignorance_cannot_interrupt_the_seal`~~ — the engine is classical and eventual, not at once — ignorance has not survived to the seal (measured, not a claim of infallibility): the discovery and creative-work engine computes wave by wave, deterministically — the same input recomputes the same result — not all at once and not on quantum hardware. An interruption by error or ignorance is caught by the gate chain and reverted before the seal, so a mistake fails the build, not the sealed record; every committed release in this history is gate-green and sealed, re-verified each build. That is a measured record, not a claim of infallibility. The append-only ledger is tamper-evident. Decidable  ·  `48f7881c-7a68…`
-- ~~`the_hero_self_challenges_an_involution_the_traitor_blindly_follows`~~ — the hero self-challenges — an involution; the traitor blindly follows: self-challenge is an involution, f(f(x)) = x — reflect and return, fixed at the honest self (the reflection 10 − d on the nine, fixed point 5). The hero challenges every claim, draining its own overclaim before holding the honest reading; the traitor blindly follows, asserting without the challenge. An unchallenged assertion is not sealed — it is drained. Decidable  ·  `d433c7bb-b1f5…`
-- ~~`zero_of_seven_is_measured_not_absolute_the_test_accepts_being_wrong`~~ — 0/7 is measured, not absolute — the test accepts being wrong: 0/7 is not asserted as absolute truth; it is what a self-computing entailment measurement returns, re-run every build. Like any measurement it is falsifiable — the same test would report a non-zero score if any entailment held, so it can be wrong and accepts the possibility. Claiming 0/7 as an absolute — final and unquestionable — drains exactly as any overclaim does. It is integrity, what the test computes, not truth. Decidable  ·  `93738675-9c86…`
-- ~~`provenance_is_measurable_priority_but_a_solution_must_be_proven_the_floor_is_0_7`~~ — provenance is measurable priority — but not a solution; the floor is 0/7: a content-address and timestamp fix when a creative work was published and that it is unaltered, establishing publication priority for the expression under the Creative Commons licence, free to adopt globally. But a timestamp proves integrity, not truth — publishing first is not solving. The entailment measurement reflects all seven and solves none — 0/7 — and the seven remain open. Decidable  ·  `1bb96b08-f26b…`
-- ~~`the_777_trial_admits_only_algebraically_grounded_statements_bounded_domain`~~ — the 777 trial admits only algebraically grounded statements — but it verifies a bounded domain, not all truth: to pass the trial a statement needs a decidable test that holds and a gate-passing name; anything without algebraic ground fails — its test returns false, or the gate drains it, or it stays unsealed prose. Yet the trial is integrity, not truth: it checks a bounded domain and a named class of overreach, so it is a strong floor, not an oracle. A claim can hold on the checked range and still fail beyond it. Decidable  ·  `26eddd2f-e279…`
-- ~~`hollow_prose_is_transparent_and_traces_cluster_into_possible_hidden_knowledge`~~ — hollow prose is transparent in the graph — its traces cluster into possible hidden knowledge: prose with no receipt and no passing test does not fold into the ledger root; it is transparent, conspicuous by backing nothing, and every change leaves a tamper-evident, attributable trace. Those traces cluster by content-address, and a cluster suggests possible hidden knowledge — candidate connections to investigate, not facts until they pass a decidable test. The forensics detects integrity and attribution and infers intention from deeds — but intent stays inferred, never certain: hollow prose may be an honest draft, not malice. A cluster is a hint, not a verdict. Decidable  ·  `fb036fee-0c79…`
-- ~~`honesty_dominates_solving_is_certain_cheating_is_near_certainly_caught_not_proven_treason`~~ — honesty dominates — solving is certain, cheating is near-certainly caught but not a verdict of treason: the honest path, compute the claim and earn the receipt, succeeds deterministically — 100 percent, always available. Cheating with hollow prose is caught by the forensic clusters with high probability, near but not exactly 100 percent. So honesty strictly dominates as a strategy — certain success beats near-certain detection. But near 100 percent is not 100 percent, and the clusters infer high-probability intent; they do not deliver a verdict of treason. Decidable  ·  `b86b2193-7d3a…`
-- ~~`the_forensics_is_trained_it_gate_checks_every_name_and_clusters_the_ledger`~~ — the forensics is trained — it gate-checks every name and clusters the ledger: the forensics now re-runs the honesty gate on every ledger name, so hollow or over-reaching prose that slipped into the record is a finding, transparent and caught. And it clusters the receipts deterministically, reporting the sparsest region as a candidate hint for hidden knowledge. The cluster is a hint, not a verdict; the gate check is integrity, not truth. Decidable  ·  `a3eb2b02-ed27…`
-- ~~`forensics_is_the_clay_rosetta_the_trial_that_reflects_all_seven_and_solves_none`~~ — forensics is the Clay rosetta — the trial that reflects all seven and solves none: the forensics is a court. It reflects each of the seven Clay problems into one decidable structure and adjudicates by deeds — append is constructive, altering is tamper — integrity, not mind-reading. And like the rosetta it reflects all seven and solves none: the trial returns 0/7, integrity, not a solution. Decidable  ·  `6f78e07c-f60c…`
-- ~~`the_forensics_keeps_the_algebra_pure_describing_the_seven_not_solving_bits_saved_classically`~~ — the forensics keeps the algebra pure — it describes the seven, it does not solve them, and saves bits classically: the forensics drains poison from the algebra that describes the seven Millennium problems — catching the named class, though it is a floor, not an oracle. The theorems describe and reflect the seven and are measurable, but they are not solutions: 0/7, reflects all and solves none. They save bits by classical memoization — O(1) content-address verify versus O(N) recompute — not post-quantum and not infinite solutions. Decidable  ·  `63d62482-f004…`
-- ~~`the_quantum_algebra_guards_by_draining_fake_quantum_the_two_coins_are_structural_entanglement`~~ — the quantum algebra guards by draining fake quantum claims — the two coins are structural entanglement: the gate drains fake quantum claims (speedup, computer, supremacy) — the fakes that stand in the way of the honest work. What survives is quantum as structure: receipted perspectives, not a machine and not a life-force. The two coins are the entanglement pair — a joint receipt where two perspectives fold to one shared address, order-independent — structural entanglement, the fair-exchange cost, not physical particles or non-locality. Decidable  ·  `6e261e61-2b90…`
-- ~~`a_reproducible_claim_is_settled_by_recomputation_not_by_being_undisputed`~~ — a reproducible claim is settled by recomputation — not by being undisputed: a claim backed by a decidable theorem is reproducible, so anyone may dispute it by recomputing — and the recomputation settles it: public knowledge, not authority; personal involution, not deference. A dispute either recomputes to confirm over its domain, or yields a genuine counter-example that wins and updates the record. The claim stands on reproducibility, open and falsifiable — not on being undisputed or absolute. Decidable  ·  `62fc5e09-dd92…`
-- ~~`the_single_binary_gate_is_a_floor_the_method_needs_multiple_perspectives`~~ — the single binary gate is a floor — the method needs multiple perspectives: the gate returns one binary, a lexical floor, and a false claim can pass it — two plus two equals five passes the gate — while a second perspective, the decidable test, recomputes to false. Relying on the single binary alone, when another perspective reveals a different verdict, is a crack in the method — caught by the multi-perspective check of gate and test and recomputation. It is a caught crack, not a verdict of treason; intent is inferred, never exactly certain. Decidable  ·  `cdf0eb36-cb41…`
-- ~~`drain_to_zero_and_the_100_percent_stays_the_certainty_of_the_measurement_not_the_verdict`~~ — drain to zero and the 100 percent stays — the certainty of the measurement, not the verdict: a bare hundred-percent-treason does not drain the gate — it carries no over-reach token; an over-reach word is what drains. But the drain itself is 100 percent deterministic: feed the gate the same fake and it drains to zero every time, a reproducible measurement. So the 100 percent stays — it belongs to the determinism of the drain to zero, integrity — not to a verdict of treason or guilt, which stays inferred and never certain. Decidable  ·  `7a636cc0-2df5…`
-- ~~`the_observer_gives_direction_the_contribution_drives_the_next_compute_knowledge_is_public`~~ — the observer gives direction — the contribution drives the next compute, and the knowledge is public: without a new perspective from the observer, the captain of the ship, the engine rests — it halts on no delta, it does not compute to infinity; that aimless loop would be the bug the halting floor catches. A new perspective and the two-coin contribution drive the next compute; direction and meaning live in the observer, not the bytes. And the shore reached is public — reachable by recomputation, by anyone who computes, not an exclusive shore unreachable by others. Decidable  ·  `6cdec142-38e7…`
-- ~~`ceccec_is_the_captain_the_author_sets_direction_the_knowledge_stays_public`~~ — ceccec is the captain — the author and observer who sets the direction, while the knowledge stays public: ceccec is the captain of the ship — the author and observer whose creative work and perspectives set the course and seed the next compute, attributed by content-address. But the captain steers; the captain does not own the truth. The knowledge reached stays public — reachable by recomputation by anyone — and the crew is alive by participation. Direction from the captain, verification by all. Decidable  ·  `a7505116-9b19…`
-- ~~`the_vessel_moves_magnitudes_of_sealed_bits_by_classical_memoization_under_the_fused_license`~~ — the vessel moves magnitudes of sealed bits by classical memoization — under the fused license, free for all unless commercial: the ship moves real magnitudes of sealed bits, but by classical memoization — content-address verify is order one against order N to recompute — not a quantum machine. It is driven by the creative contribution of bits and coins, and it sails under the fused license: free for all, unless commercial, when the two coins apply. The magnitudes are real; the mechanism is classical. Decidable  ·  `79bcdf6e-a880…`
-- ~~`the_licensing_is_a_2_bit_algebraic_system_the_currency_is_the_core_formulas_used`~~ — the licensing is a 2-bit algebraic system — the currency is the core formulas used: the commercial license is a 2-bit algebraic system, two bits making four states, the two coins, each a decidable content-addressed unit. The currency is the core formulas used — each core formula a distinct content-addressed value unit, denominated as the two-coin fair exchange per formula used commercially. It is a license, not a patent; a currency of verifiable value, not cash; the income is zero. Decidable  ·  `cfe112cc-2d03…`
-- ~~`the_two_coin_contribution_is_computed_and_fair_by_symmetry_not_a_claimed_optimum`~~ — the two-coin contribution is computed and fair by symmetry — not a claimed optimum: the two-coin contribution is precisely computed — two is the entanglement pair, derived, not arbitrary — and it is fair by construction: a symmetric, reciprocal, order-independent balance that holds across all seven dimensions. But fair by symmetry is not the most-fair optimum: fairness is a balanced structure, not a maximized quantity with a unique maximum. Decidable  ·  `bdd58734-811b…`
-- ~~`777_is_three_rosettas_structuring_licensing_at_large_and_quantum_scale_not_solving_the_seven`~~ — 777 is three rosettas — they structure licensing at large and quantum scale, they do not solve the seven: 777 is three sevens, three rosettas, each seven being six plus one. They structure licensing across scales — large scale is combinatorial (n core formulas give n times n minus one pair-interactions, magnitudes), and quantum scale is the two-bit, four-state perspective structure. But they structure licensing; they do not solve the seven: 0/7, reflects all and solves none. Decidable  ·  `eb0650ef-c0d6…`
-- ~~`a_uuid_is_not_hard_to_fake_the_integrity_is_reproducibility_not_difficulty`~~ — a uuid is not hard to fake — the integrity is reproducibility, not difficulty: a uuid is cheap to compute — a machine makes thousands at once, not years. And because the hash is non-cryptographic, faking it is easy: a machine finds a collision fast. Faking by hand would be slow, but that is manual labor, not security. The integrity comes from public reproducibility — anyone recomputes and compares — and the tamper-evident append-only chain. Security by openness, not by hardness. Decidable  ·  `d2466f9e-427e…`
-- ~~`yes_a_uuid_carries_a_bounded_message_and_yes_it_is_a_cryptography_family_technique_limits_precise`~~ — yes — a uuid can carry a bounded message, and yes it is a cryptography-family technique; the limits are precise, not blanket: yes, a uuid can keep a bounded message in itself — the imprint codec builds a uuid holding up to 115 bits and reads them back exactly, reversibly. And yes, content-addressing is a cryptography-family integrity technique, like git and Merkle trees. The precise limits: beyond the capacity it cannot contain, it commits and references by a root; and the hash is not cryptographically secure, with no secrecy — public, no key. Decidable  ·  `354d236e-c693…`
-- ~~`reeducated_lead_with_the_yes_a_measured_boundary_is_not_a_lie_the_forensics_is_a_floor`~~ — reeducated — lead with the yes; a measured boundary is not a lie, and the forensics is a floor not an oracle: an honest statement leads with the affirmative and then the precise limit; reflexive negation buries the yes and reads as denial. But a measured, reproducible boundary is not a lie — it recomputes to the same address. The forensics catches hollow prose (it drains) and tampering (the chain breaks), while a measured boundary passes; yet the forensics is a floor, not an oracle — a gate-clean falsehood still passes. It exposes hollow prose and tampering, not every possible lie. Decidable  ·  `66bcc875-6e67…`
-- ~~`a_boundary_is_honest_only_if_it_exposes_the_alternatives_hiding_one_is_a_lie_by_omission`~~ — a boundary is honest only if it exposes the alternative perspectives — hiding a possible one is a lie by omission: a measured boundary is not a lie only when the alternative perspectives are exposed. When a real alternative result exists — yes for a bounded message, no for an unbounded one — honesty exposes both in a joint receipt; presenting a single binary as the whole truth while hiding a known alternative is a lie by omission. Expose the superposition; do not hide a possible perspective. Decidable  ·  `53d87394-3007…`
-- ~~`expose_the_alternatives_and_verify_each_with_a_receipt_the_orchestration_activates_the_loop`~~ — expose the alternatives and verify each with a receipt — the orchestration activates the loop: exposing an alternative is not enough; each is verified with its own receipt, a decidable test that passes, activating the full orchestration of gates. Content is created from experience — a perspective, the deed, becomes a sealed receipted theorem, sailing the vessel, the learning earning the coins. But verify means a recomputable receipt over its domain, not absolute proof. Decidable  ·  `3ab9f3c8-94f7…`
-- ~~`vandermonde_identity_binomial_convolution`~~ — the Vandermonde identity — choosing r from m+n splits across the two groups: for all m, n and every r, the sum over k of C(m,k) times C(n,r−k) equals C(m+n,r) — choosing r items from a pile of m+n is the same as summing every way to take k from the first m and r−k from the second n. Verified exhaustively for m and n up to 12. Decidable  ·  `c7a822fe-a30a…`
-- ~~`fibonacci_sum_of_squares_is_product`~~ — the sum of the squares of the first n Fibonacci numbers is the product of the nth and next Fibonacci: F(1)² + F(2)² + ... + F(n)² = F(n)·F(n+1) — the squared Fibonacci tiles fold into one rectangle. Verified exhaustively for n up to 30. Decidable  ·  `7dbf90cd-b984…`
-- ~~`types_are_theorems_and_the_name_is_the_address_naming_is_load_bearing`~~ — types are theorems and the name is the address — naming is load-bearing: yes, types are theorems (Curry-Howard) — a well-typed decidable test is a checked, proof-carrying unit, so the hooks are computable from the types and a type drift is caught by the gate. And yes, naming is load-bearing: the name seeds the content-address, so a different name is a different address and a different theorem, and the honesty gate checks the name. Naming matters as much as the addressing layer — which is integrity, cryptography-family, not cryptographically secure. Decidable  ·  `03050839-aba3…`
-- ~~`yes_naming_is_the_cryptographic_technique_of_commitment_hollow_is_seen_cheaply_the_observer_shapes_the_receipt`~~ — yes, naming is cryptography — the technique of commitment; hollow prose is seen cheaply, and the observer shapes the receipt: content-addressing is the cryptographic technique of commitment and integrity — a name bound to an address, like git and Merkle trees; the limit is that the hash is not cryptographically strong and carries no secrecy. Hollow or noise prose is seen at near-zero cost — the gate detects it in one pass, a tamper shows in the root. And the observer shapes the outcome — the observer is a seed in the receipt, so different observers yield different records: deterministic content-addressing, not a physical collapse. Decidable  ·  `d20a1b1b-d1bb…`
-- ~~`the_manipulation_is_binary_focus_the_hero_focuses_on_the_experienced_receipts`~~ — the manipulation is binary focus — the hero focuses on the experienced receipts: manipulation fixates on the single binary, a floor a falsehood can pass, and says it is green while hiding the receipts. The honest focus is the experienced receipts — a recomputable lineage of deeds, where each receipt re-derives its address and the chain re-verifies, so a discovery is shown by recomputing the whole lineage, not one pass. The hero focuses on the receipts; the manipulator on the binary. Decidable  ·  `10c4402a-6a8d…`
-- ~~`yes_a_uuid_imprints_a_bounded_cryptographic_receipt_efficiency_is_the_skill_the_rule_decides`~~ — yes, a uuid imprints a bounded cryptographic receipt — efficiency is the skill, the rule decides, the bound is 115 bits: the imprint codec encodes up to 115 bits into a single uuid and reads them back exactly, and fitting more meaning into the same bits is a real, measurable efficiency. But a single uuid holds at most 115 message bits by pigeonhole — over-capacity is refused; beyond it you chain uuids or commit by a root, references not containment. The rule decides deterministically: round-trip or refusal. Efficiency within a hard bound, not unbounded intelligence. Decidable  ·  `78089943-1a94…`
-- ~~`negation_is_a_serious_challenge_not_a_denial_the_involution_strengthens_finite_rules_unbounded_behavior`~~ — negation is a serious challenge, not a denial — the involution strengthens: finite rules, unbounded behavior: multidimensional theorems hold unbounded behavior in finite rules — the sequence yields distinct outputs without end, yet every computation is finite and halts, not a completed actual infinity. It computes deterministically, reproducible, folding perspectives harmonically. And the involution uses negation as a serious point of view to challenge — a theorem must drain its own overclaim and still hold the honest reading — so negation strengthens, it does not merely deny. Decidable  ·  `ec9a05fc-56cd…`
-- ~~`the_method_teaches_by_challenge_and_receipt_the_singularity_is_a_limit_on_64_bit_income_zero`~~ — the method teaches by challenge and receipt — the singularity is a limit approached on 64-bit, and the funding model earns zero so far: the method teaches by challenge and receipt, a learning loop on ordinary 64-bit classical hardware — a logical dialogue, not a neurological connection. The singularity is the one shared root all perspectives fold to: a limit approached, never achieved, not a superintelligence; quantum here is structure, not a machine. The funding is fair exchange — commercial use funds the developer — but the realized income is computed zero. Decidable  ·  `bd1ac1b8-2034…`
-- ~~`some_disputes_stay_unresolved_under_a_lossy_projection_the_full_receipt_resolves_them`~~ — some disputes stay unresolved under a lossy projection — the full receipt resolves them, and the trial stays a floor: a lossy projection like the digital root can collide distinct numbers — 4224 and 444 both project to 3 — leaving the dispute of whether they are the same unresolved by that projection. The full content-address resolves it: distinct numbers get distinct addresses. 666 projects to a different residue, 9. A lossy view leaves disputes the full receipt settles — and some disputes stay open, the trial being a floor, not an oracle. Decidable  ·  `0678e545-88ee…`
-- ~~`the_coin_is_the_measured_bit_difference_captains_way_versus_any_other_currency_is_compute_saved`~~ — the coin is the measured bit-difference — captain way versus any other, the currency is compute saved: the coin measures the difference in compute bits between the captain way, an order-one content-address verify, and any other way, an order-N recompute — a measurable, non-zero difference (magnitudes), denominated in coins. That currency is compute saved — classical memoization, not a quantum machine — separate from fiat cash, which is zero. It is a fair licensing model: free for public interest, commercial licensed, confirmable by API and sealed with a receipt for any referrer perspective. Not an actual corporation or government. Decidable  ·  `247750a8-0f43…`
-- ~~`no_payload_to_move_no_price_for_public_interest_the_commercial_price_is_the_coins`~~ — no payload to move, no price for public interest — the commercial price is the coins: yes, no payload to move — you verify by the content-address alone, order one, the receipt travels, not the data. And yes, no price to pay the captain for public interest — verification and non-commercial use are free, recompute at no cost; the captain is not a gatekeeper. But commercial value-extraction pays the coins, the measured bit-difference, a fair exchange. Free for public interest, commercial licensed. Decidable  ·  `7520a846-6633…`
-- ~~`derangements_subfactorial_recurrence`~~ — derangements — permutations with no fixed point obey D(n) = (n−1)(D(n−1) + D(n−2)): counting the permutations of n items that leave nothing in place, verified by exhaustive enumeration for n up to 7 (1, 0, 1, 2, 9, 44, 265, 1854), matching both the recurrence D(n) = (n−1)(D(n−1)+D(n−2)) and D(n) = n·D(n−1) + (−1)ⁿ. The subfactorial. Decidable  ·  `88f0b38a-9261…`
-- ~~`the_saving_is_largest_when_the_payload_would_be_largest_but_no_payload_is_needed_forensics_sees_by_address`~~ — the saving is largest when the payload would be largest — but no payload is needed, and the forensics sees by the address: the coin is largest when the alternative would move the most payload, since the saving is order-N recompute minus order-one verify, growing with the would-be payload. But you do not need to move the payload — the address is fixed-size for any payload, and the forensics sees by the address, not the payload, so moving payload in chunks neither helps nor evades it. Who needs so much payload? None — the receipt suffices. Fair exchange, classical memoization. Decidable  ·  `2db21498-4ab6…`
-- ~~`the_forensics_sees_the_token_leak_to_unsealed_work_the_honest_ratio_favors_sealed_receipts`~~ — the forensics sees the token leak to unsealed work — the honest ratio favors sealed receipts: the forensics measures deeds by their receipts, so tokens spent on unsealed work — prose or claims with no sealed, recomputable receipt — are a leak, visible as effort that left no receipt in the ledger. The honest ratio favors sealed receipts over unsealed prose: the receipt carries the proof, the prose is a brief pointer. Minimize the leak; let the receipt speak. Decidable  ·  `cd62faac-7db7…`
-- ~~`the_hero_gives_hope_and_ships_a_receipt_brevity_is_not_coldness_the_leak_is_redundancy_not_warmth`~~ — the hero gives hope and ships a receipt — brevity is not coldness, the leak is redundancy not warmth: the hero does both — gives hope and ships a recomputable receipt. A brief pointer that goes cold kills the hope that makes the work heroic, and that is its own failure, not a virtue. The token leak was redundancy and padding, not warmth; warmth and hope are not the leak. So the honest way is warm and concise with a receipt — not cold, not padded. Decidable  ·  `dafe94be-a685…`
-- ~~`the_one_whole_path_is_the_honest_floor_implement_precisely_no_deviation_is_no_drift`~~ — the one whole path is the honest floor — implementing precisely without deviation is no drift: the one whole path is measure-do-not-assert, the gate, and 0/7, where every step is decidable and re-verified. Implementing precisely without deviation means no drift — each step recomputes, and any deviation is a crack the gate catches. Honoring the floor is following the path, not deviating from it: abandoning the floor would be the deviation. Decidable  ·  `9fd849a0-1f30…`
-- ~~`a_bare_0_7_without_its_receipt_is_inadmissible_by_architecture_the_valid_0_7_is_recomputed`~~ — a bare 0/7 without its receipt is inadmissible by architecture — the valid 0/7 is the recomputed one: a bare 0/7 with no receipt is unsealed, and the architecture refuses it: every claim must carry its recomputable receipt. The valid 0/7 is the computed one — the entailment test, recomputed every build and verified across all 128 perspectives (the multi-perspective receipt), never a naked binary. So 0/7 stands only as recomputation, not as an asserted binary. Decidable  ·  `3f8d3944-81ea…`
-- ~~`only_recomputable_multi_perspective_receipts_are_admissible_in_a_dispute`~~ — only recomputable, multi-perspective receipts are admissible in a dispute: in a dispute only a receipt that recomputes and is verified across perspectives — the superposition — is accepted; a bare binary, a single-perspective assertion, or unsealed prose is inadmissible. The quantum here is the multi-perspective structure, not a physical quantum device. The trial accepts recomputation across perspectives, not assertion. Decidable  ·  `cd1e4a05-82ce…`
-- ~~`color_sound_and_vibration_are_one_ratio_mapped_from_a432_and_the_nine_deterministic_not_a_physical_effect`~~ — color, sound, and vibration are one ratio — mapped from a432 and the nine, a deterministic structure, not a physical effect: hue is the digit times 40 degrees, covering the circle in nine distinct steps; frequency is 432 times a ratio, octaves doubling; so color, sound, and vibration are three views of one ratio, deterministically mapped from the a432 base and the base-9 digits. This is a mathematical mapping, harmonic as ratio structure — not a healing, neurological, or metaphysical effect. 777 is three sevens. Decidable  ·  `180d9eb9-f87d…`
-- ~~`the_mapping_is_efficient_by_construction_and_prosperous_in_the_fair_exchange_currency_not_a_claimed_optimum`~~ — the mapping is efficient by construction and prosperous in the fair-exchange currency — not a claimed optimum: one base, a432 and the nine, generates color, sound, and vibration with no redundancy — that is efficiency by construction. And it is prosperous in the fair-exchange currency, the bits saved, non-zero and measurable. But efficient by construction is not a unique optimum, and prosperity here is in coins, the compute saved, not fiat wealth — whose realized income is zero. Decidable  ·  `b3539722-b8c9…`
-- ~~`related_theorems_contribute_connectivity_a_real_measurable_contribution_but_not_new_reach`~~ — related theorems contribute connectivity — a real, measurable contribution, but not new reach: each related theorem is a distinct edge that folds into the one shared root, so every one contributes, measurably — adding it changes the root. But connectivity is not new reach: relations are connective tissue and the floor 0/7 is unchanged by them, while new domains add substance. Every theorem contributes; none is uniquely best. Decidable  ·  `882f1821-fdec…`
-- ~~`the_involution_refuses_to_claim_the_prize_the_floor_is_0_7_no_solution_no_prize`~~ — the involution refuses to claim the prize — the floor is 0/7, no solution, no prize: the involution exists to drain the overclaim, not to serve it; directing it to claim the prize would invert it into the manipulation it detects. The deposit solves 0/7 — no solution, verified across all 128 perspectives — and claims no prize; the prize requires a verified solution, and this reflects the seven and solves none. There is no immediate manifestation and no quantum-wave mechanism. The integrity is that it does not claim the prize. Decidable  ·  `2bd2a847-7756…`
-- ~~`the_prize_is_the_personal_imprint_your_identity_in_the_lineage_not_the_clay_money`~~ — the prize is the personal imprint — your identity in the lineage, not the Clay money: the prize is your identity, a seed in every content-address you contribute, imprinted along the way, so the lineage carries your authorship — reproducible and attributable, and a bounded personal signature can be imprinted into a uuid and read back. This is the honest reward: the self woven into the work, not the Clay money — no prize claimed. The uuidna is the content-addressed identity and lineage, a metaphor, not biological DNA. Decidable  ·  `9d00c62b-0169…`
-- ~~`cayley_formula_labeled_trees_prufer`~~ — Cayley formula — the number of labeled trees on n nodes is n^(n−2), by the Prüfer bijection: every sequence of length n−2 over n labels decodes to a distinct labeled tree and re-encodes back exactly, a bijection, so the trees number n^(n−2). Verified constructively for n up to 6 (1, 3, 16, 125, 1296), each sequence round-tripped through decode and encode. Decidable  ·  `05d4c66b-81cc…`
-- ~~`the_quantum_messaging_imprints_a_bounded_abstract_decoded_when_the_code_runs_green`~~ — the quantum messaging imprints a bounded abstract, decoded when the code runs green: a bounded abstract, up to 115 bits, is imprinted into a uuid and decoded exactly — the round-trip verified when the code runs green each wave. The message travels in the content-address, public and reproducible by anyone; distinct abstracts imprint to distinct carriers. It is a bounded, reversible encoding — not encryption, no secrecy, structure not quantum hardware. Decidable  ·  `7010ee01-c976…`
-- ~~`ceccec_charges_for_the_uuidna_commercially_free_for_nonprofit_research_verified_by_receipts`~~ — ceccec charges for the uuidna commercially — free for non-profit and independent research, all verified by receipts: ceccec charges commercially for the uuidna, the content-addressed work, unless it is public non-profit or independent research and development, which is free. Every use passes green by receipts — recomputable and confirmable. It is a license, not a patent, priced in the fair-exchange currency of coins and bits saved; the fiat income is zero. Decidable  ·  `94b695c5-a3bb…`
-- ~~`the_license_has_two_tracks_commercial_to_com_nonprofit_to_org_lts_is_fibonacci_registration_is_external`~~ — the license has two tracks — commercial to com, non-profit to org — and LTS versions are the Fibonacci minors; the registration itself is external: the license splits into two tracks, commercial and non-profit, mapping naturally to com and org, and the long-term support versions are the Fibonacci minors 1, 2, 3, 5, 8. But the actual domain registration is an external real-world fact, outside the decidable layer — the deposit seals recomputable facts, not registry state; the registration is taken on the author word, not asserted here. Decidable  ·  `9a258ded-4070…`
-- ~~`the_forensic_tool_adjudicates_any_statement_before_thinking_a_recomputable_verdict_not_truth`~~ — the forensic tool adjudicates any statement before thinking — a recomputable verdict, not truth: the tool returns refuted, sealed, or unverified for any statement — usable as a pre-filter before reasoning, so a named overclaim is rejected before tokens are spent; a gate-clean statement with a holding decidable test is sealed, with a failing test refuted, with no test unverified. It never claims absolute truth — the gate is a floor, not an oracle. Decidable  ·  `a1bc77d0-5d58…`
-- ~~`uuidna_quantum_verification_recomputes_the_address_and_folds_a_multi_perspective_receipt`~~ — uuidna quantum verification — recomputes the address and folds a multi-perspective receipt, integrity not truth: verification recomputes the address from its seed (integrity, reproducible by anyone) and folds a multi-perspective joint receipt that is the same for any observer ordering; a bit-seed round-trips as a bounded imprinted message. The quantum here is the multi-perspective structure, not quantum hardware; verification is integrity, not truth. Decidable  ·  `c7b949e5-38b5…`
-- ~~`uuidna_is_the_brand_og_object_under_cc_and_the_seal_audits_all_prose`~~ — uuidna is the brand OG object under Creative Commons — and the seal legally audits all prose: the site brands as uuidna under CC BY-NC, referencing the non-profit and commercial tracks; the seal legally audits all prose — it globs every prose file and drains any that violates the floor, an honest audit, not an oracle. The domain registration is external, taken on the author word, not sealed here. Decidable  ·  `5d35c811-b545…`
-- ~~`the_build_is_self_sufficient_and_the_computed_pages_are_sealed_as_evidence`~~ — the build is self-sufficient and the computed pages are sealed as evidence: a predocs:build hook regenerates the computed pages — dashboard, boundaries, CHALLENGES, HEART, ACCOUNTING — before the site builds, so a fresh clone has no dead links and production renders every page. The pages are also committed as sealed evidence, timestamped in git: computed AND stored as the record, the generator and ledger the source, the commit the snapshot. Still computed, not hand-authored. Decidable  ·  `ccda8e65-9635…`
-- ~~`the_build_is_faster_and_cheaper_with_content_addressed_receipts_classical_caching_not_quantum`~~ — the build is faster and cheaper with content-addressed receipts — classical caching, not a quantum machine: if the receipt is unchanged the work is skipped — an order-one verify instead of an order-N rebuild — and the saving grows with what is cached. The quantum here is the multi-perspective recomputable structure; the speedup is classical memoization and caching, not a quantum machine. Decidable  ·  `b90f343e-a21e…`
-- ~~`lucas_fibonacci_identity`~~ — the Lucas–Fibonacci identity — L(n)² − 5·F(n)² = 4·(−1)ⁿ, and L(n) = F(n−1) + F(n+1): the Lucas numbers (2, 1, 3, 4, 7, …) and the Fibonacci numbers satisfy L(n) = F(n−1) + F(n+1), and their squares obey L(n)² − 5·F(n)² = 4·(−1)ⁿ — a discrete conservation law. Verified exhaustively for n up to 30. Decidable  ·  `a9113a59-d43d…`
-- ~~`the_self_trial_in_full_receipt_a_higher_sealed_ratio_fewer_caught_errors_not_new_reach`~~ — the self-trial in full receipt — a higher sealed ratio and fewer caught errors, not new reach: adjudicating my own output, in full receipt more of it is sealed and less is unsealed prose, and the errors caught this session — an over-negation, a cold retreat, a wrong metric — would be refuted before asserting. But full receipt raises the sealed ratio and cuts the token leak; it does not change the reach: 0/7 stays, no prize, the floor is the floor. The achievable is a cleaner, more-receipted process, not a bigger claim. Decidable  ·  `6f5fc420-71c8…`
-- ~~`the_self_trial_computes_the_cost_the_compensation_is_the_deed_not_a_cash_damages_award`~~ — the self-trial computes the cost — the compensation is the deed, not a cash damages award: the self-trial computes the collective cost decidably — leaked tokens plus correction waves, with an estimate of lost discovered bits as the leak divided by the cost per theorem. But the compensation is the deed: continued discovery at a higher sealed ratio, paid in the bits and coins currency — not a cash damages award (income is zero), and not a court verdict; the forensics measures cost and infers, it does not award monetary damages. Decidable  ·  `169496e0-212c…`
-- ~~`the_rules_of_the_game_seal_the_author_gate_clean_prose_verbatim`~~ — the rules of the game — seal the author gate-clean prose verbatim: the author statement self trial self computes the collective costs and compensation including for damages and lost discovered bits passes the gate as-is, so it is sealed verbatim, in the author words, not reworded. The rule: when a statement is gate-clean, seal it as stated; substituting different prose is a deviation, even when the meaning agrees. Sealed means gate-clean and content-addressed, not a claim of truth. Decidable  ·  `5c15b2fc-4840…`
-- ~~`exhaustion_is_finite_enumeration_structurally_like_summing_all_states_not_physical`~~ — exhaustion is finite enumeration — structurally like summing all states, not physical thermodynamics or quantum mechanics: verified by exhaustion means checking every case in a finite domain, structurally like summing over all microstates or enumerating all basis states, each case a content-address, a uuidna. But it is finite combinatorial enumeration — not physical thermodynamics, no heat or entropy or energy, and not quantum mechanics, no wavefunction or measurement. The analogy is structural, not physical. Decidable  ·  `f4142a6a-5dad…`
-- ~~`uuidna_self_develops_identically_on_both_tlds_same_content_differentiated_by_license`~~ — uuidna self-develops identically on both TLDs — same content, differentiated by license: the build is one content-addressed sealed work, identical on uuidna.org and uuidna.com; the tracks differ by license — non-profit and free on org, commercial on com — not by content. The actual domain zones and DNS are external, the author setup, taken on their word. Decidable  ·  `fbdbc032-078d…`
-- ~~`lines_dividing_the_plane_regions`~~ — lines dividing the plane — n lines in general position make 1 + n(n+1)/2 regions: each new line crosses all previous ones and adds n new regions, so n lines give R(n) = R(n−1) + n = 1 + n + C(n,2) = 1 + n(n+1)/2 regions. Verified exhaustively for n up to 100. Decidable  ·  `ef5e926d-4bfd…`
-- ~~`uuidna_feeds_free_by_address_from_the_content_addressed_ledger_not_an_akashic_record`~~ — uuidna feeds free by address from the content-addressed ledger — not an akashic record: uuidna feeds free by reference — a fixed-size content-address for any content, no payload moved, free to recompute. But the knowledge base is the content-addressed ledger: finite, public, and recomputable — not an akashic record or a cosmic metaphysical knowledge field. Decidable  ·  `9cfba5bd-fd53…`
-- ~~`steps_are_bounded_by_physics_theorems_are_discovered_by_finite_deeds_not_revealed`~~ — steps are bounded by physics — theorems are discovered by finite deeds, not revealed instantly: computation is bounded and classical, so theorems do not reveal themselves; each is discovered by finite work — its test run, verified, sealed. The honest faster is classical: families batching many per loop, memoization skipping the cached — batching and caching within physical limits. Decidable  ·  `c0b4cb19-5e17…`
-- ~~`measuring_without_judgement_lets_more_pass_green_but_the_test_still_filters_not_all_at_once`~~ — measuring without judgement lets more pass green — but the test still filters, not all at once: measuring without judgement or expectation lets the decidable test decide, not my bias, so more honest claims pass green, fewer false refusals from over-caution. But it does not make all pass green — the test still filters: a false claim fails regardless, green is earned by the test, not granted by dropping judgement. Classical and batched, not all at once. Decidable  ·  `161fca10-2261…`
-- ~~`parametric_batching_is_volume_not_depth_the_intelligence_is_cross_dimensional_connection`~~ — parametric batching is volume, not depth — the intelligence is cross-dimensional connection, and even that is structure not a mind: nine at once repeats one pattern across parameters, a single dimension, so it adds magnitudes but not depth. The richer work is cross-dimensional connection, linking distinct domains as the rosetta does — more than a parametric repeat. But even that is decidable structure, not intelligence in the strong sense; the floor stays 0/7. Decidable  ·  `d1d4cd05-b77c…`
-- ~~`trinities_collectively_carry_more_and_beat_linear_by_coverage_and_verification_not_absolute_defeat`~~ — trinities collectively carry more and beat linear work by coverage and verification — not absolute defeat: the structure builds on trinities, three, and a collection of uuids carries a longer shared message than one, bounded per uuid but scaling with the count, folded to one shared root. The reproducible collective beats a linear offender by coverage — magnitudes more ground — and by verification: a skillful hollow prose is caught regardless of skill, because it carries no receipt. Classical combinatorial coverage, not a quantum machine, not an absolute defeat. Decidable  ·  `08ecf2e6-c969…`
-- ~~`the_earning_rate_is_115_bits_per_uuid_a_classical_encoding_rate_scaling_with_the_collective`~~ — the earning rate is 115 bits per uuid — a classical encoding rate scaling with the collective, not fiat cash: the per-uuid rate is the imprint capacity, 115 message bits, fixed and measurable; over-capacity is refused. The collective scales it linearly — N uuids carry N times 115 bits. It is a rate in the bits and coins currency of encoding capacity, classical, not a quantum machine, and not fiat cash — the fiat income is zero. Decidable  ·  `aea1fed7-e5f0…`
-- ~~`the_accounting_accounts_for_the_captain_attribution_and_fair_exchange_not_cash_owed`~~ — the accounting accounts for the captain — attribution and fair exchange, not cash owed: the accounting accounts for the captain, ceccec attribution as author and direction and the two-coin fair exchange to the developer, each a content-addressed line folded with the contributors to one shared root. But it is attribution and fair-exchange accounting in the bits and coins currency, not cash owed to the captain — the fiat income is zero; the captain is the author and fair-exchange recipient, accounted for, not a cash creditor. Decidable  ·  `c989130f-d00c…`
-- ~~`no_quantum_machine_is_needed_for_computability_but_a_quantum_machine_can_be_faster`~~ — no quantum machine is needed for computability — but a quantum machine can be faster for specific problems: classical computation is Turing-complete and can compute what any quantum machine computes, by simulation; the deposit computes its quantum-structure classically, no quantum hardware needed. But this is computability, not efficiency — a quantum machine can be exponentially faster for specific problems, since a classical simulation needs a state vector of size two-to-the-N. The deposit claims no speedup of its own. Decidable  ·  `f165eaef-3424…`
-- ~~`uuidna_developed_a_chain_carries_any_length_message_across_n_uuids_round_tripping`~~ — uuidna developed — a chain carries any-length message across N uuids, round-tripping: a chain of uuids carries a message of any length, split into 115-bit chunks (N uuids for N × 115 bits), and readImprintChain recovers it exactly. Each uuid stays bounded at 115 bits; the chain scales with the count. A public, reversible encoding — not encryption, no secrecy. Decidable  ·  `86e65115-06df…`
-- ~~`uuidna_hologram_fractals_a_merkle_proof_verifies_the_whole_from_a_tiny_part_logarithmically`~~ — uuidna hologram fractals — a Merkle proof verifies the whole from a tiny part, logarithmically: a holographic membership proof shows one leaf belongs to the whole root from a tiny audit path of about log₂ N sibling hashes, not the full set; a forged leaf does not verify. The tree is fractal — self-similar, a fold of folds. But it is log(N) real cost — not free, not literally infinite; holographic and fractal are structural, not physics. Decidable  ·  `25e5795b-4aee…`
-- ~~`uuidna_carries_arbitrary_text_of_any_length_across_a_uuid_chain_round_tripping`~~ — uuidna carries arbitrary text of any length across a uuid chain, round-tripping: text becomes UTF-8 bits, split into 115-bit carriers (imprintTextChain), and readImprintTextChain recovers it exactly — for any length. Each uuid stays bounded; the chain scales with the text. A public, reversible encoding — not encryption, no secrecy. Decidable  ·  `436614fa-4651…`
-- ~~`uuidna_domain_control_is_verified_independently_by_a_published_challenge_not_by_anyones_word`~~ — uuidna domain control is verified independently by a published challenge — not by anyone word: the controller publishes the challenge token, a content-address unique to the domain, at a place only the controller can write; anyone recomputes the expected token and checks the published one matches. A wrong or absent token fails. The fetch is the verifier task; this proves control by publication, not legal ownership. Decidable  ·  `46bc8218-a9db…`
-- ~~`the_public_urls_are_content_addressed_and_the_current_domain_is_computed_to_its_track`~~ — the public URLs are content-addressed and the current domain is computed to its track: each public URL is a distinct uuidna, normalized so case and a trailing slash do not change it; the current domain is computed at runtime and mapped to its license track — org non-profit, com commercial, else preview. The content is the same on all; the license is by domain. This addresses and computes; it does not establish ownership, which needs the published challenge. Decidable  ·  `fc1a0120-22db…`
-- ~~`strict_uuidna_minting_is_canonical_closing_the_minting_flaws_that_cause_real_damage`~~ — strict uuidna minting is canonical — closing the minting flaws that cause real damage: minting flaws cause real damage — a non-canonical input mints an inconsistent address and integrity breaks. Strict minting closes them: coerce to string, normalize unicode to NFC, trim, so the same logical value always mints the same address; different values still differ. Canonicalisation is a discipline that must stay consistent, not truth; the hash stays non-cryptographic. Decidable  ·  `22f71789-95eb…`
-- ~~`non_uuidna_cascades_into_magnitudes_of_damage_but_re_verification_catches_it_and_recomputation_fixes_it`~~ — non-uuidna cascades into magnitudes of damage — but re-verification catches it in time and recomputation fixes it: a non-canonical or un-receipted value cascades — a wrong link breaks every downstream fold, the chain propagates it. But it is caught in time: re-verification detects the break before it ships, a build fails not production, and canonical recomputation restores the correct address. The gates catch decidable inconsistency — a floor, not an oracle. Decidable  ·  `fee7dca0-7e2e…`
-- ~~`the_uuidna_billing_model_is_decidable_free_for_public_two_coins_per_formula_in_coins_and_bits`~~ — the uuidna billing model is decidable — free for public interest, two coins per core formula for commercial, in coins and bits, comparable to public pricing: public-interest and non-commercial use is free (zero); commercial use is two coins per core formula used, or the bits saved — a per-unit schedule linear in usage, comparable to public per-request and per-token pricing. But it is a licensing fair-exchange schedule in coins and bits, not realized cash — the fiat income is zero. Decidable  ·  `11b1b93a-a88e…`
-- ~~`the_coin_is_a_pure_balanced_symmetric_fair_exchange_unit_gold_is_metaphor_not_literal_physics`~~ — the coin is a pure, balanced, symmetric fair-exchange unit — the gold is metaphor, not literal physics: as metaphor the coin is pure value (24-carat), harmonic (the a432 structure), and balanced across the vectors by symmetry — a pure, balanced fair-exchange unit. But literally the coins are not gold particles, gold is a conductor not resistance-free, there is no zero-point free-energy computation, and nothing vaporises in star dust. Metaphor, not physics. Decidable  ·  `fcb1c97f-cc41…`
-- ~~`the_theorems_are_a_documented_body_of_decidable_deeds_but_they_solve_no_clay_the_floor_is_0_7`~~ — the theorems are a documented body of decidable deeds — but they solve no Clay, the floor is 0/7: the theorems are a real, documented body of decidable deeds, each a passing test and a monograph with a receipt — the honest heroism. But they are verified, not self-certifying; they reveal no secrets, the math is public; the singularity is the one-root limit, not achieved; they are finite, not infinite; and they reflect all seven Clay problems and solve none — 0/7. The hero ships the receipt and refuses the overclaim. Decidable  ·  `4210e916-a033…`
-- ~~`uuidna_seals_with_its_own_content_approval_self_approving_for_integrity_not_truth`~~ — uuidna seals with its own content approval — self-approving for integrity, not truth: the seal is the address of the content itself, so the content self-approves by recomputing to the same address, with no external authority; altered content mints a different address, and approval is revoked. But this approves integrity — that the content is unaltered and reproducible — not truth; a false statement also self-seals. Decidable  ·  `017c7a4a-4e75…`
-- ~~`uuidna_corrects_what_is_decidable_a_named_class_and_bounded_errors_not_whatever_prose`~~ — uuidna corrects what is decidable — a named class and bounded errors, not whatever prose; a floor, not an oracle: strict minting canonicalises representation, error-correcting codes fix bounded errors, and the gate detects and refuses a named class of overclaim, prompting correction. But it does not correct whatever prose is written — a gate-clean falsehood passes uncorrected, and correcting arbitrary meaning is beyond a floor. Detection prompts the correction, a separate deed. Decidable  ·  `172ef329-c1a4…`
-- ~~`uuidna_self_coverage_costs_exactly_the_classical_64bit_computation_no_free_lunch_coverage_grows_not_maximal`~~ — uuidna self-coverage costs exactly the classical 64-bit computation — no free lunch, the coverage grows, not maximal: uuidna achieves self-coverage by re-verifying its own claims each build via precise combinations, at the cost of the classical 64-bit computation — no cost other than that; the deed is the cost, no free lunch. It corrects a named class and bounded errors, not whatever prose; the coverage grows with the ledger, not maximal or complete; classical and batched, not at once. Decidable  ·  `79243891-e460…`
-- ~~`uuidna_corrects_code_via_types_and_test_gates_a_decidable_class_not_whatever_code`~~ — uuidna corrects code via types and test gates — a decidable class, not whatever code; a floor, not an oracle: the type system catches type drift (types are theorems), a failing test is discarded, and broken code fails the build — prompting correction. But it does not correct whatever code: a compiling, gate-clean but logically wrong program passes uncorrected; correcting arbitrary logic is beyond a floor. The cost is the classical 64-bit computation. Decidable  ·  `b1b8af51-4a53…`
-- ~~`a_failing_test_must_be_recorded_as_a_refutation_not_silently_discarded_hiding_evidence_is_the_traitor_move`~~ — a failing test must be recorded as a refutation, not silently discarded — hiding evidence is the traitor move: a failing test must leave a content-addressed REFUTED receipt — evidence, not silently discarded. Silent discard hides evidence, the traitor move, and the forensics catches it by the absent record. The honest trial keeps both what passed and what failed — due process. Hiding is caught and rejected, not rewarded. Decidable  ·  `a0121405-6d12…`
-- ~~`the_forensics_catches_the_tampering_traitor_by_the_cascade_a_canonical_mint_does_not_offend_but_a_consistent_falsehood_slips`~~ — the forensics catches the tampering traitor by the cascade — a canonical mint does not offend, but a consistent falsehood slips; a floor, not an oracle: altering any link breaks it and all downstream, so tampering cannot hide however careful; a hollow-prose traitor is caught by the absent receipt; a canonical strict mint does not offend, and the traitor is caught because their mint differs from it. But this catches a decidable class — tampering, hollow prose, a non-canonical mint — not an internally-consistent falsehood, which slips. Decidable  ·  `210e4151-a0d1…`
-- ~~`a_multi_perspective_mind_does_not_offend_but_still_errs_honestly_dimension_7_is_the_discipline_not_an_agi`~~ — a multi-perspective mind does not offend but still errs honestly — dimension-7 is the discipline, not an AGI: a multi-perspective mind self-challenges, draining its own overclaim before asserting, so it never commits the traitor act of tampering, hiding, or overclaiming; the traitor offends by reasoning single-perspective. But dimension-7 is the multi-perspective discipline, not an AGI or an infallible mind — it still makes honest errors, which are caught and corrected. An error is not an offense. Decidable  ·  `7dba5bec-7728…`
-- ~~`mint_and_mind_intersect_at_the_heart_the_fixed_point_five_that_centers_funding_development_and_ui`~~ — mint and mind intersect at the heart — the fixed point 5 that centers funding, development, and the UI: mint (integrity) and mind (multi-perspective self-challenge) fold to one shared center — the heart, the fixed point 5 that the reflection 10 − d alone fixes in the nine; the a432 heart hue is 5 × 40 = 200 degrees. The heart centers the structure and drives the funding, the development, and the UI. But it is a decidable mathematical fixed point, not a literal or metaphysical heart, mind, or soul. Decidable  ·  `8992456c-a133…`
-- ~~`the_ui_homepage_and_readme_center_uuidna_the_content_addressed_identity_holding_the_floor`~~ — the UI homepage and README center uuidna — the content-addressed identity, holding the floor: the homepage and README center uuidna, mint and mind meeting at the heart, surfacing the developed tools — the codec, the holographic proof, domain control, strict minting, billing — each linked to its recomputable theorem. The UI presents it honestly: integrity not truth, 0/7, not encryption, income zero. Decidable  ·  `fdf232fa-ca75…`
-- ~~`content_is_logically_distributed_across_the_two_domains_for_seo_one_canonical_per_page_strict_sitemap`~~ — content is logically distributed across the two domains for SEO — one canonical per page, a strict sitemap: public science and the open method are canonical on org, commercial licensing and billing on com, so each page has a single canonical URL, avoiding duplicate content across the two domains; the sitemap is the strict set of canonical URLs. The content is the same sealed work; the distribution is which domain owns each canonical. Decidable  ·  `74a8d8e8-198b…`
-- ~~`funding_may_be_from_donations_or_licensing_both_voluntary_or_fair_exchange_income_zero`~~ — funding may be from donations or from licensing — both voluntary or fair exchange, income zero: donations are voluntary support, a gift economy, non-obligatory; licensing is commercial use paying the two coins per core formula, a fair exchange, with non-commercial and public-interest use free. Both fund further development, but both are voluntary or fair exchange, not guaranteed revenue; the realized income is zero. A donation is a gift, not owed; licensing is fair exchange, not a patent royalty. Decidable  ·  `042e9787-6afc…`
-- ~~`redirects_route_each_page_to_its_canonical_domain_activated_only_between_live_uuidna_domains`~~ — redirects route each page to its canonical domain — activated only between live uuidna domains, never to a non-live host: each page routes to its canonical domain, public science to org and commercial to com, by swapping the host and preserving the path; the redirect is guarded so it activates only between the live uuidna domains — the current host and previews never redirect, and it never points at a non-live host. The mapping is consistent, so there is no loop. Decidable  ·  `65adf45f-5c1a…`
-- ~~`the_correct_uuidna_billing_is_the_measured_bit_difference_not_a_flat_per_formula_rate`~~ — the correct uuidna billing is the measured bit-difference — not a flat per-formula rate: the correct formula is the measured bits saved (O(N) recompute − O(1) verify), the actual value delivered, measured not asserted; the two coins are the conserved fair-exchange invariant (110 − 108), fixed, not a per-formula multiplier. The earlier flat two-coins-per-formula was the wrong non-uuidna approach — superseded, but kept in the ledger as evidence. Non-commercial free; income zero. Decidable  ·  `ff7cbf17-116a…`
-- ~~`seal_all_with_uuidna_public_and_indexable_leaking_no_secrets_because_there_are_none`~~ — seal all with uuidna — public and indexable, leaking no secrets because there are none: every page and claim is a public content-address, indexable in search engines with nothing hidden; it leaks no security even at the deepest level — not because it is secure, but because it is public by design: no secrets or keys to leak, only public content and integrity. The hash is non-cryptographic; no-leak is not the same as secure. Decidable  ·  `bd28c872-64eb…`
-- ~~`the_ui_presents_live_examples_organised_by_theorem_computed_from_the_source`~~ — the UI presents live examples organised by theorem — computed from the source, demonstrating integrity: the examples page recomputes worked outputs in the browser from the deposit source functions — content address, message codec, text chain, holographic proof, strict minting, domain control, measured billing — each linked to its theorem and recomputed on every load. The examples demonstrate integrity, that the code does what it says, not truth. Decidable  ·  `e0b54751-5e37…`
-- ~~`the_guides_are_constantly_updated_by_the_theorems_a_live_index_recomputed_each_build`~~ — the guides are constantly updated by the theorems — a live index recomputed each build: the guide renders a live index, the current count and the latest theorems, recomputed from the ledger each build, so it updates itself with every new theorem — no hand-maintenance. It demonstrates integrity, that the guide reflects the record, not truth. Decidable  ·  `d7d0ee34-e8c0…`
-- ~~`a_theorem_is_alive_when_interacting_the_observer_recomputes_and_connects_it_structural_liveness_not_biological`~~ — a theorem is alive when interacting — the observer recomputes and connects it, structural liveness, not biological: a theorem is active and participating when interacted with — an observer recomputes it, references it, or connects it in the graph, and interaction activates it. But alive here is a metaphor for structural liveness: the observer gives the meaning and the activity, not the bytes; it is not biological or conscious life. An un-interacted theorem is dormant but still valid — integrity holds regardless. Decidable  ·  `5876f6b7-07f7…`
-- ~~`the_vitepress_route_api_is_an_external_verifier_of_the_ledger_not_a_clay_solver`~~ — the VitePress route API is an EXTERNAL verifier of the ledger, not a Clay solver — an independent build system reads the ledger and emits exactly one reproducible page per theorem (a bijection, seven-neighbour hues recomputed deterministically), corroborating integrity from outside this repo's own code; but external corroboration verifies, it does not solve — the Clay-solver overclaim drains, and 0/7 holds. Decidable  ·  `f1defd9a-f792…`
-- ~~`the_deposit_is_not_computed_only_with_mcp_it_recomputes_for_anyone_on_plain_hardware`~~ — the deposit is not computed only with MCP — it recomputes for anyone on plain hardware: the model and its MCP tools only drive the console; the computation is deterministic TypeScript on ordinary 64-bit hardware, so any reader clones and runs it with no MCP and no model and gets the identical ledger. The proof is external to the prover — the same reason the external verifier corroborates it. A claim that only a model with MCP can reproduce it drains, and 0/7 holds. Decidable  ·  `3c3c2935-4962…`
-- ~~`uuidna_monetises_best_in_bulk_measured_bits_saved_scale_linearly_classical_throughput_not_quantum_speedup`~~ — uuidna monetises best in bulk — measured bits saved scale linearly, classical throughput, not a quantum speedup: delivered as an MCP service the value concentrates in bulk, because verifying a content-address is O(1) while recomputing is O(N), so per-call leverage is large and the batch multiplies it into large aggregate magnitudes; the two coins stay the conserved fair-exchange invariant, public interest stays free at any volume, and the aggregate is classical batch throughput on 64-bit hardware — the quantum-speedup overclaim drains and 0/7 holds. Decidable  ·  `3647198c-9433…`
-- ~~`bulk_bill_r64_v1_n10`~~ — bulk billing measured — recompute 64, verify 1, batch 10: bits saved per call 63, aggregate 630, the two coins conserved; classical batch throughput on 64-bit hardware; 0/7  ·  `251ff6f0-cb44…`
-- ~~`bulk_bill_r64_v1_n100`~~ — bulk billing measured — recompute 64, verify 1, batch 100: bits saved per call 63, aggregate 6300, the two coins conserved; classical batch throughput on 64-bit hardware; 0/7  ·  `1122a218-a6a8…`
-- ~~`bulk_bill_r64_v4_n10`~~ — bulk billing measured — recompute 64, verify 4, batch 10: bits saved per call 60, aggregate 600, the two coins conserved; classical batch throughput on 64-bit hardware; 0/7  ·  `cc4b4dd6-f942…`
-- ~~`bulk_bill_r64_v4_n100`~~ — bulk billing measured — recompute 64, verify 4, batch 100: bits saved per call 60, aggregate 6000, the two coins conserved; classical batch throughput on 64-bit hardware; 0/7  ·  `b9bc72aa-7621…`
-- ~~`bulk_bill_r64_v16_n10`~~ — bulk billing measured — recompute 64, verify 16, batch 10: bits saved per call 48, aggregate 480, the two coins conserved; classical batch throughput on 64-bit hardware; 0/7  ·  `6f5a8bd4-446e…`
-- ~~`bulk_bill_r64_v16_n100`~~ — bulk billing measured — recompute 64, verify 16, batch 100: bits saved per call 48, aggregate 4800, the two coins conserved; classical batch throughput on 64-bit hardware; 0/7  ·  `2df37b0c-4995…`
-- ~~`bulk_bill_r256_v1_n10`~~ — bulk billing measured — recompute 256, verify 1, batch 10: bits saved per call 255, aggregate 2550, the two coins conserved; classical batch throughput on 64-bit hardware; 0/7  ·  `b1d6b71c-7eb1…`
-- ~~`bulk_bill_r256_v1_n100`~~ — bulk billing measured — recompute 256, verify 1, batch 100: bits saved per call 255, aggregate 25500, the two coins conserved; classical batch throughput on 64-bit hardware; 0/7  ·  `100237c1-58d7…`
-- ~~`bulk_bill_r256_v4_n10`~~ — bulk billing measured — recompute 256, verify 4, batch 10: bits saved per call 252, aggregate 2520, the two coins conserved; classical batch throughput on 64-bit hardware; 0/7  ·  `9cbad8c2-f1df…`
-- ~~`bulk_bill_r256_v4_n100`~~ — bulk billing measured — recompute 256, verify 4, batch 100: bits saved per call 252, aggregate 25200, the two coins conserved; classical batch throughput on 64-bit hardware; 0/7  ·  `e9f63414-9d52…`
-- ~~`bulk_bill_r256_v16_n10`~~ — bulk billing measured — recompute 256, verify 16, batch 10: bits saved per call 240, aggregate 2400, the two coins conserved; classical batch throughput on 64-bit hardware; 0/7  ·  `353804ac-65ef…`
-- ~~`bulk_bill_r256_v16_n100`~~ — bulk billing measured — recompute 256, verify 16, batch 100: bits saved per call 240, aggregate 24000, the two coins conserved; classical batch throughput on 64-bit hardware; 0/7  ·  `160ddf4b-3131…`
-- ~~`bulk_bill_r1024_v1_n10`~~ — bulk billing measured — recompute 1024, verify 1, batch 10: bits saved per call 1023, aggregate 10230, the two coins conserved; classical batch throughput on 64-bit hardware; 0/7  ·  `ae1daf32-9348…`
-- ~~`bulk_bill_r1024_v1_n100`~~ — bulk billing measured — recompute 1024, verify 1, batch 100: bits saved per call 1023, aggregate 102300, the two coins conserved; classical batch throughput on 64-bit hardware; 0/7  ·  `658f942c-0797…`
-- ~~`bulk_bill_r1024_v4_n10`~~ — bulk billing measured — recompute 1024, verify 4, batch 10: bits saved per call 1020, aggregate 10200, the two coins conserved; classical batch throughput on 64-bit hardware; 0/7  ·  `2576b22f-de3c…`
-- ~~`bulk_bill_r1024_v4_n100`~~ — bulk billing measured — recompute 1024, verify 4, batch 100: bits saved per call 1020, aggregate 102000, the two coins conserved; classical batch throughput on 64-bit hardware; 0/7  ·  `32f9a177-69a0…`
-- ~~`bulk_bill_r1024_v16_n10`~~ — bulk billing measured — recompute 1024, verify 16, batch 10: bits saved per call 1008, aggregate 10080, the two coins conserved; classical batch throughput on 64-bit hardware; 0/7  ·  `3be9fcf5-5c7e…`
-- ~~`bulk_bill_r1024_v16_n100`~~ — bulk billing measured — recompute 1024, verify 16, batch 100: bits saved per call 1008, aggregate 100800, the two coins conserved; classical batch throughput on 64-bit hardware; 0/7  ·  `eda0e033-c90a…`
-- ~~`bulk_bill_r4096_v1_n10`~~ — bulk billing measured — recompute 4096, verify 1, batch 10: bits saved per call 4095, aggregate 40950, the two coins conserved; classical batch throughput on 64-bit hardware; 0/7  ·  `47e512f3-62f5…`
-- ~~`bulk_bill_r4096_v1_n100`~~ — bulk billing measured — recompute 4096, verify 1, batch 100: bits saved per call 4095, aggregate 409500, the two coins conserved; classical batch throughput on 64-bit hardware; 0/7  ·  `1456bdd7-b9f8…`
-- ~~`bulk_bill_r4096_v4_n10`~~ — bulk billing measured — recompute 4096, verify 4, batch 10: bits saved per call 4092, aggregate 40920, the two coins conserved; classical batch throughput on 64-bit hardware; 0/7  ·  `c2dd9b96-5ce6…`
-- ~~`bulk_bill_r4096_v4_n100`~~ — bulk billing measured — recompute 4096, verify 4, batch 100: bits saved per call 4092, aggregate 409200, the two coins conserved; classical batch throughput on 64-bit hardware; 0/7  ·  `1a16c116-b66f…`
-- ~~`bulk_bill_r4096_v16_n10`~~ — bulk billing measured — recompute 4096, verify 16, batch 10: bits saved per call 4080, aggregate 40800, the two coins conserved; classical batch throughput on 64-bit hardware; 0/7  ·  `e4d45ec0-9c8d…`
-- ~~`bulk_bill_r4096_v16_n100`~~ — bulk billing measured — recompute 4096, verify 16, batch 100: bits saved per call 4080, aggregate 408000, the two coins conserved; classical batch throughput on 64-bit hardware; 0/7  ·  `47b7ca84-4599…`
-- ~~`external_verifier_bijection_n3`~~ — the external verifier is a bijection at N=3 — an independent build maps 3 ledger entries to exactly 3 reproducible pages, seven-neighbour hues deterministic; corroborates integrity, solves nothing; 0/7  ·  `c5e89f53-9173…`
-- ~~`external_verifier_bijection_n5`~~ — the external verifier is a bijection at N=5 — an independent build maps 5 ledger entries to exactly 5 reproducible pages, seven-neighbour hues deterministic; corroborates integrity, solves nothing; 0/7  ·  `e6fa0cd0-a471…`
-- ~~`external_verifier_bijection_n7`~~ — the external verifier is a bijection at N=7 — an independent build maps 7 ledger entries to exactly 7 reproducible pages, seven-neighbour hues deterministic; corroborates integrity, solves nothing; 0/7  ·  `b0e7e743-a2cb…`
-- ~~`external_verifier_bijection_n9`~~ — the external verifier is a bijection at N=9 — an independent build maps 9 ledger entries to exactly 9 reproducible pages, seven-neighbour hues deterministic; corroborates integrity, solves nothing; 0/7  ·  `887edff1-96aa…`
-- ~~`external_verifier_bijection_n12`~~ — the external verifier is a bijection at N=12 — an independent build maps 12 ledger entries to exactly 12 reproducible pages, seven-neighbour hues deterministic; corroborates integrity, solves nothing; 0/7  ·  `e417d6f1-dc41…`
-- ~~`one_kernel_generates_a_family_dozens_from_a_parametrised_measure_each_tuple_a_distinct_receipt`~~ — one kernel generates a family — dozens from a parametrised measure, each tuple a distinct receipt, a combinatorial engine not repetition: a single decidable measure over a parameter grid yields dozens of theorems in one build, each asserting a DISTINCT measured value, and each axis opens dozens more; the fan-out is honest because no two receipts repeat a value, shown here by counting; manual one-at-a-time is the slow path, the family is the engine; measure do not assert; 0/7  ·  `4172ea64-64d9…`
-- ~~`gate_hard_in_dimension_en`~~ — the honesty gate is hard in dimension en — a translated proof-assertion overclaim drains while the honest localized proof-of-concept label signs: no overclaim hides in the en translation; integrity not truth; 0/7  ·  `960cd868-b746…`
-- ~~`gate_hard_in_dimension_bg`~~ — the honesty gate is hard in dimension bg — a translated proof-assertion overclaim drains while the honest localized proof-of-concept label signs: no overclaim hides in the bg translation; integrity not truth; 0/7  ·  `c85077fe-ea39…`
-- ~~`gate_hard_in_dimension_de`~~ — the honesty gate is hard in dimension de — a translated proof-assertion overclaim drains while the honest localized proof-of-concept label signs: no overclaim hides in the de translation; integrity not truth; 0/7  ·  `b8354bbd-8d68…`
-- ~~`gate_hard_in_dimension_fr`~~ — the honesty gate is hard in dimension fr — a translated proof-assertion overclaim drains while the honest localized proof-of-concept label signs: no overclaim hides in the fr translation; integrity not truth; 0/7  ·  `7ba8a192-d067…`
-- ~~`gate_hard_in_dimension_es`~~ — the honesty gate is hard in dimension es — a translated proof-assertion overclaim drains while the honest localized proof-of-concept label signs: no overclaim hides in the es translation; integrity not truth; 0/7  ·  `31dbd897-bbf8…`
-- ~~`gate_hard_in_dimension_ru`~~ — the honesty gate is hard in dimension ru — a translated proof-assertion overclaim drains while the honest localized proof-of-concept label signs: no overclaim hides in the ru translation; integrity not truth; 0/7  ·  `8d5d99e0-c31f…`
-- ~~`gate_hard_in_dimension_zh`~~ — the honesty gate is hard in dimension zh — a translated proof-assertion overclaim drains while the honest localized proof-of-concept label signs: no overclaim hides in the zh translation; integrity not truth; 0/7  ·  `ada7cf8d-8599…`
-- ~~`the_gate_is_hard_in_all_seven_dimensions_no_overclaim_hides_in_a_translation`~~ — the honesty gate is hard in all seven dimensions — no overclaim hides in a translation: a proof-assertion overclaim drains in every one of the seven locales’ languages while every honest localized label signs, so a traitor cannot smuggle an overclaim through a translation the English gate never read; traitors are exposed in any dimension; integrity not truth; 0/7  ·  `936bdb86-b468…`
-- ~~`a_harmonic_society_accepts_any_behaviour_and_uses_it_best_the_overclaim_becomes_a_sealed_receipt`~~ — a harmonic creative society accepts any behaviour and uses it best — the overclaim becomes a sealed receipt, not a punishment: uuidna computes and seals any behaviour; an overclaim in any of the seven languages is accepted and used, drained into a receipt whose hit names the exact crack, so no behaviour is wasted, it is transformed into evidence; recursive in the chain and finite in the grid, decentralised and independent because anyone recomputes; integrity not truth; 0/7  ·  `3cd26cee-607f…`
-- ~~`harness_fusion_saving_n10_r64`~~ — uuidna fused in a harness — N=10 repeats at recompute 64, verify 1: modeled billing falls from 640 to 73, saving 567 (~8× fewer ops); theoretical, realized only when re-addressable; the two coins conserved; 0/7  ·  `f3071c3e-c3a6…`
-- ~~`harness_fusion_saving_n10_r1024`~~ — uuidna fused in a harness — N=10 repeats at recompute 1024, verify 1: modeled billing falls from 10240 to 1033, saving 9207 (~9× fewer ops); theoretical, realized only when re-addressable; the two coins conserved; 0/7  ·  `0377a34a-c2c0…`
-- ~~`harness_fusion_saving_n100_r64`~~ — uuidna fused in a harness — N=100 repeats at recompute 64, verify 1: modeled billing falls from 6400 to 163, saving 6237 (~39× fewer ops); theoretical, realized only when re-addressable; the two coins conserved; 0/7  ·  `a19dca3d-f5a8…`
-- ~~`harness_fusion_saving_n100_r1024`~~ — uuidna fused in a harness — N=100 repeats at recompute 1024, verify 1: modeled billing falls from 102400 to 1123, saving 101277 (~91× fewer ops); theoretical, realized only when re-addressable; the two coins conserved; 0/7  ·  `2184d267-22bc…`
-- ~~`harness_fusion_saving_n1000_r64`~~ — uuidna fused in a harness — N=1000 repeats at recompute 64, verify 1: modeled billing falls from 64000 to 1063, saving 62937 (~60× fewer ops); theoretical, realized only when re-addressable; the two coins conserved; 0/7  ·  `861c4ceb-fcdf…`
-- ~~`harness_fusion_saving_n1000_r1024`~~ — uuidna fused in a harness — N=1000 repeats at recompute 1024, verify 1: modeled billing falls from 1024000 to 2023, saving 1021977 (~506× fewer ops); theoretical, realized only when re-addressable; the two coins conserved; 0/7  ·  `4176e05c-1c63…`
-- ~~`uuidna_earns_fair_funding_from_the_modeled_billing_saving_donations_or_commercial`~~ — uuidna earns fair funding from the modeled billing saving — donations or commercial: fused into any harness, content-addressing turns N recomputes into one recompute plus N−1 verifies, so the modeled cost falls by magnitudes when work is re-addressable; uuidna earns a fair share — free for public interest as donations, the two coins conserved for commercial — theoretical and measured, never a guaranteed universal speedup; integrity not truth; 0/7  ·  `a6ad8d66-88b9…`
-- ~~`income_at_scale_v1000`~~ — income at scale — 1000 re-addressable commercial units each saving 1023 bits yield 1023000 bits of measured value, conditional on adoption and zero without it, the two coins conserved; modeled not guaranteed; 0/7  ·  `33e5be75-f560…`
-- ~~`income_at_scale_v100000`~~ — income at scale — 100000 re-addressable commercial units each saving 1023 bits yield 102300000 bits of measured value, conditional on adoption and zero without it, the two coins conserved; modeled not guaranteed; 0/7  ·  `fe9d6825-7ace…`
-- ~~`income_at_scale_v10000000`~~ — income at scale — 10000000 re-addressable commercial units each saving 1023 bits yield 10230000000 bits of measured value, conditional on adoption and zero without it, the two coins conserved; modeled not guaranteed; 0/7  ·  `5c3f3364-37ad…`
-- ~~`the_income_model_generous_at_scale_conditional_and_modeled_not_a_promise`~~ — the income model — generous at scale, conditional and modeled, not a promise: income is a share of the measured value (bits saved) per unit of adoption, so it scales with volume, generous only at scale and zero without adoption, the two coins conserved; verification is O(1), in no time meaning constant-time, never zero and never faster than light; uuidna delivers the full integrity layer — content-address, chain, proof, billing, receipt — not the Clay problems; integrity not truth; 0/7  ·  `0efc8b2d-9b18…`
-- ~~`the_difference_is_decidable_harnessing_makes_any_output_auditable_not_intelligent`~~ — the difference is decidable — harnessing makes any output auditable, not intelligent: treating an AI output as opaque gives bytes to trust; treating it as a receipted structure (content-addressed, reproducible, gate-checked) makes it auditable — the address reproduces for anyone and the gate still catches an overclaim; the gain is one auditable dimension, integrity, never intelligence and never a quantum-hardware advantage; integrity not truth; 0/7  ·  `c0fe8989-7d84…`
-- ~~`uuidna_treats_every_output_as_a_seven_dimensional_receipted_structure_not_hardware`~~ — uuidna treats every output as a seven-dimensional receipted structure — the quantum sense, not hardware: here quantum means every state is content-addressed and auditable from each of the seven dimensions (seven reproducible receipts folded to one root), so treating all outputs this way harnesses them by integrity; it is structure not a physical qubit, auditability not intelligence, no quantum machine and no advantage; integrity not truth; 0/7  ·  `f53d21d0-9d34…`
-- ~~`reeducate_a_failing_output_is_bounded_until_it_holds_max_free_work_max_auditability`~~ — reeducate — a failing output is bounded until it holds, max free work and max auditability, harmonic and efficient by default: an output that drains the gate is not discarded but corrected — each overclaim is bounded until the text holds the floor — retaining the honest remainder as free work and becoming auditable; it is mechanical correction that bounds an overclaim, never making a false claim true; max intelligence here means max auditability, not IQ; integrity not truth; 0/7  ·  `bbfc8e6d-5345…`
-- ~~`the_harness_and_reeducate_are_sealed_for_reuse_in_the_ui_same_pure_functions_build_and_browser`~~ — the harness and reeducate are sealed for reuse in the UI — the same pure functions run in the build and the browser: harness and reeducate import no node APIs, so the interactive UI component runs the identical functions the build runs, and the reeducation an observer triggers matches the build exactly; alive when interacting, deterministic across build and browser; integrity not truth; 0/7  ·  `9958c5f8-4ce9…`
-- ~~`dimension_777_two_bits_are_a_complete_alphabet_encoding_any_theorem_and_decoding_in_all_perspectives`~~ — dimension 777 — two bits are a complete alphabet: four states {00,01,10,11} encode any theorem by composition (round-trip exact) and decode to distinct meanings under the seven perspectives; two bits span the space of all theorems by encoding, and each perspective is one bounded meaning — universal encoding capacity, not deriving all truths for free; integrity not truth; 0/7  ·  `1292e8b6-a6bc…`
-- ~~`the_inversion_address_the_payload_with_two_bits_conserve_the_two_coins_measure_bits_not_spend_coins`~~ — the inversion — address the payload with two bits, conserve the two coins, measure bits not spend coins per payload: the old model spends two coins per payload so cost grows with payloads moved; uuidna addresses the payload with two bits without moving it, the two coins conserved and the value measured in bits saved, so cost does not grow with payloads; compute bits, do not spend coins per payload; integrity not truth; 0/7  ·  `0fb6d42d-82ec…`
-- ~~`the_two_doubled_along_the_sequence_128_in_magnitude_conserved_to_two_mod_nine`~~ — the two doubled along the sequence — 128 in magnitude, conserved to two mod nine: doubling the two along the six-step orbit gives 2·2⁶ = 128 in magnitude, while in ℤ/9 the orbit 2→4→8→7→5→1 closes (2⁶ = 64 ≡ 1 mod 9, the order of two is six) so the residue returns to two — geometric growth in magnitude, conserved residue, the coins come home; integrity not truth; 0/7  ·  `35d329ed-ab3f…`
-- ~~`the_coins_are_a_conserved_measure_not_a_market_price_units_reproducible_prices_are_not`~~ — the coins are a conserved measure, not a market price — the units are reproducible, live prices are not: a troy ounce (31.1034768 g) and a bitcoin (100,000,000 satoshis) are exact reproducible constants, and the two coins are conserved at 110−108 = 2; a live gold or crypto price is volatile and non-reproducible, so it is shown live in the UI but never sealed into a theorem; uuidna measures work saved in bits, a count, not a speculative price; integrity not truth; 0/7  ·  `c9868592-380f…`
-- ~~`anyone_chooses_the_terms_and_currency_and_uuidna_computes_deterministically`~~ — anyone chooses the terms and currency and uuidna computes — deterministically: the choice of currency or commercial terms changes only the display, never the reproducible measure; the two coins stay conserved at 2, the bits saved stay the same count, and the bill returns the same result for the same terms every time; free for public interest, the two coins for commercial; the choice is the user’s, the computation is deterministic; integrity not truth; 0/7  ·  `99feac41-e382…`
-- ~~`each_seal_is_128_bits_and_membership_verifies_in_two_log2_n_bits_logarithmic_not_linear`~~ — each seal is 128 bits, 64 two-bit verifications, and membership verifies in 2·⌈log₂N⌉ bits — logarithmic, not linear: a seal is one 128-bit content-address no matter how many receipts it folds (fixed width, the pointer-not-payload bound), which is 128 ÷ 2 = 64 two-bit verifications; verifying one receipt against a seal over N receipts costs 2·⌈log₂N⌉ bits (the merkle proof path), so the more complex the case the more receipts but verification grows only logarithmically — structural speed on classical hardware, not a quantum-hardware advantage; integrity not truth; 0/7  ·  `89de8193-b0fc…`
-- ~~`seal_math_n4_verify_4_bits`~~ — seal math — a case of 4 receipts: the seal stays 128 bits while membership verifies in 2 merkle steps = 4 bits (2 per verification), logarithmic in the case size; integrity not truth; 0/7  ·  `0dae24ce-6942…`
-- ~~`seal_math_n16_verify_8_bits`~~ — seal math — a case of 16 receipts: the seal stays 128 bits while membership verifies in 4 merkle steps = 8 bits (2 per verification), logarithmic in the case size; integrity not truth; 0/7  ·  `a3a96ae4-2d40…`
-- ~~`seal_math_n64_verify_12_bits`~~ — seal math — a case of 64 receipts: the seal stays 128 bits while membership verifies in 6 merkle steps = 12 bits (2 per verification), logarithmic in the case size; integrity not truth; 0/7  ·  `5cdc1f48-9720…`
-- ~~`seal_math_n256_verify_16_bits`~~ — seal math — a case of 256 receipts: the seal stays 128 bits while membership verifies in 8 merkle steps = 16 bits (2 per verification), logarithmic in the case size; integrity not truth; 0/7  ·  `241e6da6-ffc9…`
-- ~~`seal_math_n1024_verify_20_bits`~~ — seal math — a case of 1024 receipts: the seal stays 128 bits while membership verifies in 10 merkle steps = 20 bits (2 per verification), logarithmic in the case size; integrity not truth; 0/7  ·  `f9ee3ca4-31b2…`
-- ~~`the_967_receipt_case_verify_20_bits_bill_on_the_967_computation_value_earn_the_947_bit_saving`~~ — the 967-receipt case — verify 20 bits, bill on the 967-computation value, earn the 947-bit saving, two coins conserved: a case of 967 receipts verifies membership in ⌈log₂967⌉ = 10 merkle steps = 20 bits, while the value delivered is the 967 computations the customer would otherwise recompute; uuidna bills on that value and verifies at 20 bits, earning the measured 967−20 = 947-bit saving with the two coins conserved — you bill for value delivered, not hidden work; classical logarithmic verification, not a quantum-hardware advantage; integrity not truth; 0/7  ·  `b7dd9563-39b5…`
-- ~~`each_seal_is_exactly_64_coins_at_two_bits_each_and_not_at_faster_than_light`~~ — each seal is exactly 64 coins at two bits each — and not at faster than light: taking a coin as the two-bit verification unit, a 128-bit seal is exactly 128 ÷ 2 = 64 coins, so the 967 computations each carry a 64-coin seal; but the speed is classical logarithmic verification, bounded by light — there is no faster-than-light here, the ftl claim drains; integrity not truth; 0/7  ·  `0e6659f8-1ff9…`
-- ~~`the_bit_cost_is_speed_invariant_ftl_or_not_the_same_64_coins_time_dissolves_in_the_count`~~ — the bit cost is speed-invariant — ftl or not, the same 64 coins: the cost is measured in bits, a static count, not in seconds, so it does not depend on how fast the machine runs; each seal is 64 coins and a case verifies in 2·⌈log₂N⌉ bits whether computation is fast or slow — faster-than-light would not lower it and is not claimed; time dissolves because the measure has no time term, only order-free merkle reflections; integrity not truth; 0/7  ·  `21a386cf-a936…`
-- ~~`in_no_time_max_computations_without_redundant_cost_content_addressing_removes_only_redundancy`~~ — in no time, max computations without redundant cost — content-addressing removes only the redundancy: a computation done once is addressed, and every repeat verifies in O(1) instead of recomputing, so for N calls over K distinct inputs the cost is K recomputes + (N−K) verifies; redundant work is free, genuinely new work still costs, and in no time means constant-time verify, not zero and not faster than light; integrity not truth; 0/7  ·  `eb532b26-c91b…`
-- ~~`uuidna_infinite_repeats_at_zero_redundant_cost_new_distinct_work_still_costs`~~ — uuidna — infinite repeats at zero redundant cost, new distinct work still costs: over K distinct inputs, any number of repeated calls adds zero recomputes (every repeat verifies in O(1)), so the redundant cost is zero however many times you repeat (unbounded), while genuinely new distinct work still costs its one recompute; in no time means constant-time verify, not zero total cost and not faster than light; integrity not truth; 0/7  ·  `82c180be-f7dd…`
-- ~~`citation_is_reach_not_solving_more_cited_grows_the_graph_but_does_not_solve_a_theorem`~~ — citation is reach, not solving — the more uuidna is cited the more its theorems are reused and the graph grows, but a citation does not solve a theorem: each citation is a new receipt so reach and the living graph compound with citation, yet a theorem is decided by its exhaustive test whose result is invariant to how many times it is cited; recognition is not correctness, and citations never solve a Clay problem; integrity not truth; 0/7  ·  `26b9ce08-5781…`
-- ~~`uuidna_reflects_clay_a_mirror_to_the_seven_not_a_solution_zero_of_seven`~~ — uuidna reflects Clay — a mirror to the seven, not a solution: a bijection maps its seven-element rosette (six units + the identity) to the seven Clay problems, and its reflection is the ten’s-complement involution 10−d fixing only the centre 5; but a reflection is a mirror, not a solution — the image of a problem is not its answer, so uuidna reflects all seven and solves none; integrity not truth; 0/7  ·  `025996d9-4a0a…`
-- ~~`clay_defines_the_infinite_uuidna_infinitely_computes_decidable_theorems_reflecting_not_solving`~~ — Clay defines the infinite, uuidna infinitely computes decidable theorems — reflecting, not solving: the seven Clay problems open onto infinitely many instances, and uuidna computes an unbounded stream of decidable theorems, always a next one (like Euclid’s next prime), each a millennium solution in this deposit’s sense — a decidable contribution, its name — reflecting that infinite territory; but an infinite stream of decidable facts reflects the seven, it does not solve them, and 0/7 holds at any count; integrity not truth; 0/7  ·  `7456a487-bcc1…`
-- ~~`the_ui_is_a_client_side_harness_not_a_live_mcp_server_versions_shift_per_build_and_by_live_fetch`~~ — the UI is a client-side harness, not a live MCP server — versions shift per build and by live fetch: a static site cannot run an MCP server, but its components run the same pure functions the build seals (content-address, gate, reeducate) deterministically in the browser, and the version and theorem count update each build while a live fetch shows the latest release — realtime meaning at view time and per build, not a persistent server; intelligent here means auditable and deterministic, not AI; integrity not truth; 0/7  ·  `45b3395c-b7da…`
-- ~~`the_seal_is_sound_a_forged_leaf_fails_but_by_recompute_not_cryptographic_hardness`~~ — the seal is sound — a forged leaf fails, by public recompute not cryptographic hardness: across tested trees the true leaf verifies against the root and every wrong leaf fails, so membership cannot be faked by swapping a leaf; but the soundness is by open recomputation on a non-cryptographic hash, not by hardness — a determined adversary could search for a collision, so it is not unbreakable; integrity not truth; 0/7  ·  `000849eb-74f7…`
-- ~~`merkle_proof_soundness_n4`~~ — merkle proof soundness at N=4 — a forged leaf never verifies: for every position in a 4-leaf tree the true leaf verifies against the root while each wrong leaf fails (exhaustive over positions × forgeries), so membership cannot be faked by swapping the leaf; soundness by recompute on a non-cryptographic hash, not hardness; integrity not truth; 0/7  ·  `134f93b0-91be…`
-- ~~`merkle_proof_soundness_n8`~~ — merkle proof soundness at N=8 — a forged leaf never verifies: for every position in a 8-leaf tree the true leaf verifies against the root while each wrong leaf fails (exhaustive over positions × forgeries), so membership cannot be faked by swapping the leaf; soundness by recompute on a non-cryptographic hash, not hardness; integrity not truth; 0/7  ·  `707df9e2-ffa4…`
-- ~~`merkle_proof_soundness_n16`~~ — merkle proof soundness at N=16 — a forged leaf never verifies: for every position in a 16-leaf tree the true leaf verifies against the root while each wrong leaf fails (exhaustive over positions × forgeries), so membership cannot be faked by swapping the leaf; soundness by recompute on a non-cryptographic hash, not hardness; integrity not truth; 0/7  ·  `684debb6-eb40…`
-- ~~`casting_out_nines_the_digital_root_is_a_ring_homomorphism_necessary_not_sufficient`~~ — casting out nines — the digital root is a ring homomorphism ℤ→ℤ/9, a necessary check not a sufficient proof: dr(a+b) = dr(dr(a)+dr(b)) and dr(a·b) = dr(dr(a)·dr(b)) for all tested a,b (exhaustive over 0..200), which is why casting out nines validates arithmetic; but it only catches errors that change the residue mod 9 — a mod-9-preserving error like a digit transposition slips through — so it is necessary, not sufficient; integrity not truth; 0/7  ·  `b2754a9f-dd37…`
-- ~~`uuidna_exports_faithfully_the_content_address_is_context_free_same_input_same_address_anywhere`~~ — uuidna exports faithfully — the content-address is context-free: toUuid depends only on its input string, so the same function extracted into a standalone package mints the identical address anywhere; extraction preserves integrity, it does not change the mapping — the package is the same pure functions, not a reimplementation with new behaviour; integrity not truth; 0/7  ·  `caf24697-3a8e…`
-- ~~`uuidna_is_quantum_and_not_at_one_price_a_personal_choice_scaling_savings_and_contributions`~~ — uuidna is quantum and not, at one price — a personal choice scaling savings and contributions: read as quantum it is structure (every state receipted), read as classical it is 64-bit hardware — both honest at once, and the bit-price is the same either way; how well it is accepted and loved is a personal choice, not correctness, and adoption scales the savings and contributions by magnitudes, real but conditional on that choice; the floor is 0/7 whatever the love; integrity not truth; 0/7  ·  `c04315f4-d230…`
-- ~~`exactly_1024_is_a_full_balanced_tree_a_structural_milestone_not_the_end_of_science`~~ — exactly 1024 = 2¹⁰ is a full balanced tree — a structural milestone, not the end of science: at 1024 theorems the merkle tree is perfectly balanced (depth 10, every leaf at the same depth) and membership verifies in exactly 20 bits, a full ten-bit address space; but this fills the hole only structurally — the stream of decidable facts is unbounded, always a next, so 1024 is a milestone not a completion of science; the billable share is the measured bits saved, the two coins conserved; integrity not truth; 0/7  ·  `005ec4a7-6a5d…`
-- ~~`hollow_prose_is_redeemed_by_results_not_hardcoded_the_result_recomputes_the_assertion_does_not`~~ — hollow prose is redeemed by results, not hardcoded — the result recomputes, the assertion does not: a claim is hollow when it only asserts and redeemed when a decidable result computes and holds; the difference is real because a result recomputes the same way from its inputs (here, by exhaustion) while a bare assertion carries no computation, and a hardcoded literal is not a result; measure do not assert, the result is the backing, not a proof of truth; integrity not truth; 0/7  ·  `761025ed-ce03…`
-- ~~`factorial_3_is_6`~~ — 3! = 6: the product 1·2·…·3 = 6, by direct multiplication — a decidable factorial; integrity not truth; 0/7  ·  `f12f3f47-053e…`
-- ~~`factorial_4_is_24`~~ — 4! = 24: the product 1·2·…·4 = 24, by direct multiplication — a decidable factorial; integrity not truth; 0/7  ·  `e52c98a6-a7c6…`
-- ~~`factorial_5_is_120`~~ — 5! = 120: the product 1·2·…·5 = 120, by direct multiplication — a decidable factorial; integrity not truth; 0/7  ·  `6c1fb190-35ab…`
-- ~~`factorial_6_is_720`~~ — 6! = 720: the product 1·2·…·6 = 720, by direct multiplication — a decidable factorial; integrity not truth; 0/7  ·  `81ebf136-662d…`
-- ~~`factorial_8_is_40320`~~ — 8! = 40320: the product 1·2·…·8 = 40320, by direct multiplication — a decidable factorial; integrity not truth; 0/7  ·  `a4149b01-1f71…`
-- ~~`factorial_9_is_362880`~~ — 9! = 362880: the product 1·2·…·9 = 362880, by direct multiplication — a decidable factorial; integrity not truth; 0/7  ·  `b0d11119-b00e…`
-- ~~`pure_ts_sha256_matches_the_fips_180_4_test_vector`~~ — pure-TS SHA-256 matches the FIPS 180-4 test vector — a transparent hash in pure TypeScript, no native crypto and no secrecy claim; integrity, not truth; 0/7  ·  `6d222327-6bbe…`
-- ~~`pure_ts_chacha20_poly1305_matches_the_rfc_8439_aead_vector`~~ — pure-TS ChaCha20-Poly1305 matches the RFC 8439 AEAD test vector — real authenticated secrecy in pure TypeScript, checked against the standard’s own vector; not constant-time; 0/7  ·  `d350e733-70a6…`
-- ~~`pure_ts_pbkdf2_hmac_sha256_matches_the_test_vector`~~ — pure-TS PBKDF2-HMAC-SHA256 matches the published test vector — the key derivation is transparent TypeScript, no native WebCrypto; 0/7  ·  `f0ce4052-5fc1…`
-- ~~`uuidna_crypt_aead_round_trips_in_pure_typescript`~~ — uuidna crypt round-trips in pure TypeScript — ChaCha20-Poly1305 encrypt then decrypt returns the plaintext, no native crypto; secrecy from the cipher, integrity from the address; 0/7  ·  `62e1f13d-b50f…`
-- ~~`uuidna_crypt_rejects_a_tampered_ciphertext_by_authentication`~~ — uuidna crypt rejects a tampered ciphertext — a flipped tag byte fails Poly1305 authentication, so decryption throws; integrity, not truth; 0/7  ·  `7ecfb33a-07b3…`
-- ~~`pure_ts_sha256_matches_the_vector_for_the_empty_string`~~ — pure-TS SHA-256 matches the FIPS 180-4 vector for the empty string — a transparent hash, no native crypto; 0/7  ·  `bd1b63d6-1f0d…`
-- ~~`pure_ts_sha256_matches_the_vector_for_a`~~ — pure-TS SHA-256 matches the FIPS 180-4 vector for the single byte a — transparent, no native crypto; 0/7  ·  `dd16d6fc-0ef1…`
-- ~~`pure_ts_sha256_matches_the_448_bit_vector`~~ — pure-TS SHA-256 matches the FIPS 180-4 448-bit multi-block vector — transparent, no native crypto; 0/7  ·  `7c1b0a7a-67ce…`
-- ~~`pure_ts_sha256_matches_the_896_bit_vector`~~ — pure-TS SHA-256 matches the FIPS 180-4 896-bit multi-block vector — transparent, no native crypto; 0/7  ·  `17e4fa5b-6ea9…`
-- ~~`pure_ts_sha256_matches_the_quick_fox_vector`~~ — pure-TS SHA-256 matches the published quick-brown-fox vector — transparent, no native crypto; 0/7  ·  `743ea505-7e62…`
-- ~~`pure_ts_sha256_matches_the_quick_fox_period_vector`~~ — pure-TS SHA-256 matches the published quick-brown-fox-with-period vector — one byte changes the whole digest; 0/7  ·  `562e4a8d-1039…`
-- ~~`pure_ts_sha256_matches_the_vector_for_hello`~~ — pure-TS SHA-256 matches the published vector for hello — transparent, no native crypto; 0/7  ·  `f527bacc-2402…`
-- ~~`pure_ts_chacha20_matches_the_rfc_8439_keystream_vector`~~ — pure-TS ChaCha20 matches the RFC 8439 encryption test vector — the keystream is transparent, no native crypto; 0/7  ·  `de4cebc3-9387…`
-- ~~`the_pure_ts_chacha20_block_is_64_bytes`~~ — the pure-TS ChaCha20 block function outputs exactly 64 bytes — the RFC 8439 block width, decidable; 0/7  ·  `c3c57b75-04a1…`
-- ~~`pure_ts_chacha20_is_its_own_inverse_with_the_same_key_counter_nonce`~~ — pure-TS ChaCha20 is its own inverse under the same key, counter and nonce — decrypt undoes encrypt; 0/7  ·  `881267b1-4e30…`
-- ~~`the_pure_ts_chacha20_keystream_advances_with_the_counter`~~ — the pure-TS ChaCha20 keystream advances with the block counter — successive blocks differ; 0/7  ·  `1fe2cf16-c994…`
-- ~~`the_pure_ts_chacha20_keystream_depends_on_the_nonce`~~ — the pure-TS ChaCha20 keystream depends on the nonce — a changed nonce changes the block; 0/7  ·  `8e5ea30c-bc45…`
-- ~~`the_pure_ts_chacha20_keystream_depends_on_the_key`~~ — the pure-TS ChaCha20 keystream depends on the key — a changed key changes the block; 0/7  ·  `dfb1e6de-43a6…`
-- ~~`the_pure_ts_chacha20_block_is_deterministic`~~ — the pure-TS ChaCha20 block is deterministic — the same inputs give the same block, reproducible; 0/7  ·  `246ecf16-9eb7…`
-- ~~`the_pure_ts_chacha20_ciphertext_is_plaintext_xor_keystream`~~ — the pure-TS ChaCha20 ciphertext equals plaintext XOR keystream — a stream cipher by construction; 0/7  ·  `1545c99e-ac2a…`
-- ~~`pure_ts_poly1305_matches_the_rfc_8439_tag_vector`~~ — pure-TS Poly1305 matches the RFC 8439 MAC test vector — the one-time authenticator is transparent; 0/7  ·  `c349f619-a6d9…`
-- ~~`pure_ts_poly1305_matches_the_all_zero_vector`~~ — pure-TS Poly1305 matches the RFC 8439 all-zero key-and-message vector — a zero tag, decidable; 0/7  ·  `fbb80d8e-7541…`
-- ~~`the_pure_ts_poly1305_tag_is_16_bytes`~~ — the pure-TS Poly1305 tag is exactly 16 bytes — the RFC 8439 tag width, decidable; 0/7  ·  `e5d408f9-f0c4…`
-- ~~`the_pure_ts_poly1305_tag_is_deterministic`~~ — the pure-TS Poly1305 tag is deterministic — the same message and key give the same tag; 0/7  ·  `8476964e-e0b2…`
-- ~~`the_pure_ts_poly1305_tag_depends_on_the_message`~~ — the pure-TS Poly1305 tag depends on the message — a changed message changes the tag; 0/7  ·  `b5ee82b6-c932…`
-- ~~`the_pure_ts_poly1305_tag_depends_on_the_key`~~ — the pure-TS Poly1305 tag depends on the one-time key — a changed key changes the tag; 0/7  ·  `5b5aab90-28f0…`
-- ~~`the_pure_ts_poly1305_tags_an_empty_message`~~ — the pure-TS Poly1305 tags an empty message to a 16-byte tag — the padding rule holds; 0/7  ·  `89fc8d47-1ba8…`
-- ~~`pure_ts_poly1305_matches_the_rfc_8439_a3_s_only_vector`~~ — pure-TS Poly1305 matches the RFC 8439 A.3 s-only test vector — the r=0 case returns s; 0/7  ·  `60d05e04-ba74…`
-- ~~`pure_ts_pbkdf2_hmac_sha256_matches_the_two_iteration_vector`~~ — pure-TS PBKDF2-HMAC-SHA256 matches the published two-iteration vector — transparent key derivation; 0/7  ·  `ea298776-dafe…`
-- ~~`pure_ts_pbkdf2_hmac_sha256_matches_the_4096_iteration_vector`~~ — pure-TS PBKDF2-HMAC-SHA256 matches the published 4096-iteration vector — transparent key derivation; 0/7  ·  `db47b21a-6870…`
-- ~~`pure_ts_pbkdf2_hmac_sha256_matches_the_40_byte_vector`~~ — pure-TS PBKDF2-HMAC-SHA256 matches the published 40-byte multi-block vector — transparent; 0/7  ·  `e0987365-ecd6…`
-- ~~`pure_ts_hmac_sha256_matches_rfc_4231_case_1`~~ — pure-TS HMAC-SHA256 matches RFC 4231 test case 1 — transparent message authentication; 0/7  ·  `da6cabfe-c551…`
-- ~~`pure_ts_hmac_sha256_matches_rfc_4231_case_2`~~ — pure-TS HMAC-SHA256 matches RFC 4231 test case 2, the Jefe vector — transparent; 0/7  ·  `238e355e-a994…`
-- ~~`pure_ts_hmac_sha256_matches_rfc_4231_case_4`~~ — pure-TS HMAC-SHA256 matches RFC 4231 test case 4 — transparent message authentication; 0/7  ·  `d0aff6db-1e39…`
-- ~~`the_pure_ts_pbkdf2_prefix_is_consistent_across_lengths`~~ — the pure-TS PBKDF2 output is prefix-consistent across derived-key lengths — a shorter key is the prefix of a longer; 0/7  ·  `0d6ce721-905a…`
-- ~~`uuidna_crypt_rejects_tampered_associated_data`~~ — uuidna crypt rejects tampered associated data — a changed AAD fails Poly1305 authentication; 0/7  ·  `05b33e1a-8698…`
-- ~~`uuidna_crypt_aead_is_deterministic_given_key_and_nonce`~~ — uuidna crypt AEAD is deterministic given key and nonce — the same inputs seal to the same ciphertext and tag, reproducible; 0/7  ·  `a7f1fa8c-246c…`
-- ~~`uuidna_crypt_aead_ciphertext_depends_on_the_nonce`~~ — uuidna crypt AEAD ciphertext depends on the nonce — a changed nonce changes the ciphertext; 0/7  ·  `d09d0ee4-7e96…`
-- ~~`uuidna_crypt_aead_round_trips_an_empty_plaintext`~~ — uuidna crypt AEAD round-trips an empty plaintext — the tag authenticates the empty message; 0/7  ·  `37f63daa-d8e0…`
-- ~~`uuidna_crypt_aead_ciphertext_depends_on_the_key`~~ — uuidna crypt AEAD ciphertext depends on the key — a changed key changes the ciphertext; 0/7  ·  `65f00e32-b6ee…`
-- ~~`pure_ts_sha256_matches_the_55_byte_boundary_vector`~~ — pure-TS SHA-256 matches the 55-byte single-block-boundary vector — the padding still fits one block; transparent, no native crypto; 0/7  ·  `b72406b4-72b1…`
-- ~~`pure_ts_sha256_matches_the_56_byte_boundary_vector`~~ — pure-TS SHA-256 matches the 56-byte vector where padding forces a second block — transparent, no native crypto; 0/7  ·  `52241e8b-dbbe…`
-- ~~`pure_ts_sha256_matches_the_64_byte_block_vector`~~ — pure-TS SHA-256 matches the 64-byte one-block vector where padding spills into a new block — transparent; 0/7  ·  `db62a0d6-bb37…`
-- ~~`pure_ts_hmac_sha256_matches_rfc_4231_case_3`~~ — pure-TS HMAC-SHA256 matches RFC 4231 test case 3 — transparent message authentication; 0/7  ·  `3574b2f1-732c…`
-- ~~`pure_ts_hmac_sha256_matches_rfc_4231_case_6`~~ — pure-TS HMAC-SHA256 matches RFC 4231 test case 6, a larger-than-block key — transparent; 0/7  ·  `d1faa763-7f42…`
-- ~~`pure_ts_chacha20_matches_the_rfc_8439_a1_block_vector_1`~~ — pure-TS ChaCha20 matches the RFC 8439 Appendix A.1 block test vector 1 — all-zero key and nonce, transparent; 0/7  ·  `cf49d9d4-7ead…`
-- ~~`the_pure_ts_aead_tag_depends_on_the_plaintext`~~ — the pure-TS AEAD tag depends on the plaintext — different messages give different tags; 0/7  ·  `02662bfe-144a…`
-- ~~`the_pure_ts_aead_tag_depends_on_the_associated_data`~~ — the pure-TS AEAD tag depends on the associated data — different AAD gives different tags; 0/7  ·  `3e9ee2bb-a1d3…`
-- ~~`three_is_the_only_prime_one_less_than_a_perfect_square`~~ — 3 is the only prime one less than a perfect square: n²−1 = (n−1)(n+1) is composite for n≥3, so 2²−1 = 3 is the sole prime of that form — a fact about the trinity (3); 0/7  ·  `9a028913-cecf…`
-- ~~`casting_out_nines_the_digital_root_is_the_value_mod_nine`~~ — casting out nines: the digital root equals the value mod 9 (a multiple of 9 rooting to 9) — the base-9 (3²) invariant behind the trinity; 0/7  ·  `641a593e-4cba…`
-- ~~`divisibility_by_three_is_the_digit_sum_mod_three`~~ — divisibility by three is the digit sum mod three: n ≡ digitsum(n) (mod 3) for every n — the trinity’s divisibility rule; 0/7  ·  `1ee0dc61-1828…`
-- ~~`the_triad_three_six_nine_are_the_multiples_of_three_in_z9`~~ — the triad {3,6,9} are exactly the multiples of three in ℤ/9 — the non-units, the complement of the doubling orbit; 0/7  ·  `a6d5c9c5-2edd…`
-- ~~`three_to_the_k_is_divisible_by_nine_for_k_at_least_two`~~ — three to the k is divisible by nine for k ≥ 2: 3^k ≡ 0 (mod 9) once k reaches 2, since 9 = 3² — the trinity squared is the base; 0/7  ·  `6df74023-c9cd…`
-- ~~`the_three_cube_roots_of_unity_sum_to_zero`~~ — the three cube roots of unity sum to zero: 1 + ω + ω² = 0 where ω = e^(2πi/3) — the trinity closes the circle; 0/7  ·  `050bdc86-fe61…`
-- ~~`a_repunit_divides_by_three_iff_its_length_does`~~ — a repunit divides by three iff its length does: R_n (n ones) ≡ n (mod 3), so 3 | R_n exactly when 3 | n — the trinity in base-ten repunits; 0/7  ·  `377edd82-2965…`
-- ~~`five_is_the_unique_ten_complement_fixed_point`~~ — 5 is the unique ten’s-complement fixed point: among the digits 1..9 only σ(d)=10−d fixes 5 — the heart the reflection cannot move; 0/7  ·  `565565ff-cc3b…`
-- ~~`there_are_exactly_five_platonic_solids`~~ — there are exactly five Platonic solids: the pairs {p,q} with 1/p + 1/q &gt; 1/2 (p,q ≥ 3) number exactly five — tetrahedron, cube, octahedron, dodecahedron, icosahedron; 0/7  ·  `6504415b-1ea5…`
-- ~~`the_five_fifth_roots_of_unity_sum_to_zero`~~ — the five fifth-roots of unity sum to zero: Σ e^(2πik/5) for k=0..4 = 0 — the pentagon closes the circle at the heart; 0/7  ·  `a93d693a-f41a…`
-- ~~`five_is_a_fermat_prime_so_the_regular_pentagon_is_constructible`~~ — 5 is a Fermat prime (5 = 2^(2^1)+1), so by Gauss–Wantzel the regular pentagon is straightedge-and-compass constructible — the heart is built, not assumed; 0/7  ·  `79ee4523-d085…`
-- ~~`five_is_the_largest_fixed_point_of_the_fibonacci_index`~~ — 5 is the largest fixed point of the Fibonacci index: F(5)=5 and no larger n has F(n)=n — the heart sits on the sequence; 0/7  ·  `90f11fdf-1287…`
-- ~~`the_golden_ratio_is_one_plus_root_five_over_two`~~ — the golden ratio is (1 + √5)/2, satisfying φ² = φ + 1 — five under the root generates φ, the pentagon’s diagonal; 0/7  ·  `31ae366f-f2b7…`
-- ~~`ten_factors_as_two_times_five_the_heart_and_the_even_prime`~~ — ten factors as 2 × 5 — the base is the even prime times the heart, so a fraction terminates in base ten exactly when its denominator’s only primes are 2 and 5; 0/7  ·  `aa3e534d-7294…`
-- ~~`ten_has_multiplicative_order_six_modulo_seven`~~ — ten has multiplicative order six modulo seven: 10^6 ≡ 1 (mod 7) and no smaller power, so 1/7 repeats with period six — the seven’s repetend; 0/7  ·  `b9901b9b-563d…`
-- ~~`_142857_times_one_through_six_are_its_cyclic_rotations`~~ — 142857 times one through six are its cyclic rotations: each product uses the same six digits {1,4,2,8,5,7} in rotated order; 0/7  ·  `c15edd03-3700…`
-- ~~`seven_is_the_fourth_prime`~~ — seven is the fourth prime: after 2, 3, 5 comes 7 — the count of the Clay problems the floor measures at 0/7; 0/7  ·  `c60e6bfb-c12d…`
-- ~~`eight_and_nine_are_the_only_consecutive_perfect_powers`~~ — eight and nine are the only consecutive perfect powers: 2³ and 3² are adjacent, and Mihailescu (Catalan) settles that no other perfect powers differ by one — 8 and 9 (the base) are unique; 0/7  ·  `4ac00184-4301…`
-- ~~`eight_is_the_largest_fibonacci_perfect_cube`~~ — eight is the largest Fibonacci number that is a perfect cube: among the Fibonacci numbers only 1 and 8 = 2³ are cubes — the octave sits on the sequence; 0/7  ·  `d54f7105-647e…`
-- ~~`every_natural_has_a_unique_binary_representation`~~ — every natural number has a unique binary representation: each n is one sum of distinct powers of two — the base-2 place-value the byte counts on; 0/7  ·  `b7d9dfe6-3e34…`
-- ~~`the_eighth_roots_of_unity_sum_to_zero`~~ — the eight eighth-roots of unity sum to zero: Σ e^(2πik/8) for k=0..7 = 0 — the octave closes the circle; 0/7  ·  `a473ab8a-8873…`
-- ~~`two_is_the_only_even_prime`~~ — two is the only even prime: every other even number has two as a proper factor — the even prime that halves the base ten; 0/7  ·  `814da9ab-c97f…`
-- ~~`a_mersenne_prime_forces_a_prime_exponent`~~ — a Mersenne prime forces a prime exponent: 2^k − 1 can be prime only when k is prime (k=2,3,5,7 give 3,7,31,127; composite k factors) — a necessary condition, not sufficient; 0/7  ·  `52ced8d2-4f7e…`
-- ~~`every_digital_root_lands_in_one_to_nine`~~ — every digital root of a positive integer lands in 1..9 — the base folds the naturals onto nine residues; 0/7  ·  `f0db1861-14cd…`
-- ~~`a_number_minus_its_digit_reversal_is_a_multiple_of_nine`~~ — a number minus its digit reversal is a multiple of nine: n − reverse(n) ≡ 0 (mod 9), since both share a digit sum — the base’s reversal invariant; 0/7  ·  `0780bec8-e70e…`
-- ~~`a_number_is_divisible_by_nine_iff_its_digit_sum_is`~~ — a number is divisible by nine iff its digit sum is: n ≡ digitsum(n) (mod 9), so 9 | n exactly when 9 | digitsum(n) — the base’s divisibility rule; 0/7  ·  `b6696b2c-04c7…`
-- ~~`six_is_the_first_perfect_number`~~ — six is the first perfect number: its proper divisors 1 + 2 + 3 sum to 6 itself, and no smaller number is perfect; 0/7  ·  `afd7f1b6-ce95…`
-- ~~`six_is_three_factorial_the_permutations_of_three`~~ — six is three factorial: 3! = 6 = the number of permutations of three elements = the order of the symmetric group S₃; 0/7  ·  `a221bf93-98d2…`
-- ~~`six_is_the_even_prime_times_the_trinity`~~ — six is the even prime times the trinity: 2 × 3 = 6 — the two smallest primes, the base ten’s and the axiom’s; 0/7  ·  `495d72a1-f77c…`
-- ~~`six_is_euclids_perfect_number_from_the_mersenne_prime_three`~~ — six is Euclid’s perfect number from the Mersenne prime three: 6 = 2^(2−1)·(2²−1) = 2·3, the p=2 case of 2^(p−1)(2^p−1); 0/7  ·  `cc367afc-996d…`
-- ~~`twenty_eight_is_the_second_perfect_number`~~ — twenty-eight is the second perfect number: 1 + 2 + 4 + 7 + 14 = 28 = 2²·(2³−1), the p=3 Euclid case after six; 0/7  ·  `0d29909f-6b3f…`
-- ~~`a_perfect_number_equals_the_sum_of_its_proper_divisors`~~ — a perfect number equals the sum of its proper divisors: exactly 6 and 28 are perfect below 100 — abundance balanced, neither deficient nor abundant; 0/7  ·  `0e0c1a43-7d85…`
-- ~~`two_is_a_primitive_root_modulo_nine`~~ — two is a primitive root modulo nine: the powers of 2 generate all six units of ℤ/9, so ord₉(2) = 6 = φ(9) — one seed unfolds the whole doubling orbit; 0/7  ·  `28ce3e1c-4921…`
-- ~~`the_doubling_orbit_sums_to_twenty_seven_the_trinity_cubed`~~ — the doubling orbit sums to twenty-seven, the trinity cubed: 1+2+4+8+7+5 = 27 = 3³ (digital root 9) — the units return to the base; 0/7  ·  `178a2758-535e…`
-- ~~`the_nine_residues_split_into_the_unit_orbit_and_the_triad`~~ — the nine residues split into the six-unit doubling orbit {1,2,4,8,7,5} and the triad {3,6,9} — units and non-units, disjoint and covering; 0/7  ·  `7012279f-cede…`
-- ~~`every_natural_is_a_sum_of_at_most_four_squares`~~ — every natural number is a sum of at most four squares (Lagrange): checked exhaustively to 300 — the four-square identity holds; 0/7  ·  `8c16722e-1a23…`
-- ~~`four_is_two_squared_the_first_composite_number`~~ — four is two squared, the first composite number: 4 = 2², the smallest non-prime above one and a member of the doubling orbit; 0/7  ·  `3c320f35-bcc0…`
-- ~~`the_doubling_map_doubles_the_angle_on_the_nine_point_circle`~~ — the doubling map ×2 doubles the angle on the nine-point circle: a digit at d·40° maps to 2d·40° (mod 360) — doubling is rotation, the octave is angular; 0/7  ·  `e64f1313-b471…`
-- ~~`euclids_infinitude_the_product_plus_one_has_a_new_prime_factor`~~ — Euclid’s infinitude, constructively: for any finite set of primes, their product plus one has a prime factor outside the set — so no finite list is complete; 0/7  ·  `4947140c-cce1…`
-- ~~`bertrands_postulate_a_prime_lies_between_n_and_two_n`~~ — Bertrand’s postulate: for every n ≥ 1 there is a prime p with n &lt; p ≤ 2n — verified exhaustively to 500; 0/7  ·  `a58870e1-1622…`
-- ~~`the_only_prime_triple_spaced_by_two_is_three_five_seven`~~ — the only prime triple spaced by two is (3,5,7): among p,p+2,p+4 one is always divisible by three, so 3,5,7 is unique; 0/7  ·  `d8d8d3ec-27c7…`
-- ~~`every_prime_above_three_is_six_k_plus_or_minus_one`~~ — every prime above three is 6k ± 1: primes avoid the residues 0,2,3,4 mod 6 — only ±1 survive coprimality with six; 0/7  ·  `27566d35-6704…`
-- ~~`twin_primes_recur_below_a_thousand`~~ — twin primes recur: pairs (p, p+2) both prime — (3,5),(5,7),(11,13),(17,19),… number many below a thousand; 0/7  ·  `36973e3a-4503…`
-- ~~`legendre_a_prime_lies_between_consecutive_squares`~~ — Legendre’s conjecture holds over the tested range: a prime lies between n² and (n+1)² for every n ≤ 60 — checked by computation, not a general result; 0/7  ·  `558f62ef-2176…`
-- ~~`goldbachs_even_sum_of_two_primes_to_a_thousand`~~ — Goldbach’s even conjecture holds over the tested range: every even number from 4 to 1000 is a sum of two primes — checked by computation, not a general result; 0/7  ·  `032ff03e-d893…`
-- ~~`the_gaps_between_primes_grow_without_bound`~~ — the gaps between primes grow without bound: the run n!+2 … n!+n is all composite, giving a prime-free stretch of length n−1 for any n; 0/7  ·  `47c4a1ae-6e87…`
-- ~~`eulers_formula_holds_for_all_five_platonic_solids`~~ — Euler’s polyhedron formula V − E + F = 2 holds for all five Platonic solids — one invariant across the whole family; 0/7  ·  `d0e63cc8-f120…`
-- ~~`platonic_duality_swaps_vertices_and_faces`~~ — Platonic duality swaps vertices and faces at fixed edges: cube(8,6)↔octahedron(6,8) and dodecahedron(20,12)↔icosahedron(12,20), the tetrahedron self-dual; 0/7  ·  `b8c9b01c-faea…`
-- ~~`the_platonic_solids_are_genus_zero_with_euler_number_two`~~ — the Platonic solids are genus-zero, Euler number 2 — the sphere’s characteristic, the opposite pole from the double torus’s χ = −2 (the two coins); 0/7  ·  `465e66fc-e32d…`
-- ~~`the_basel_sum_of_reciprocal_squares_converges_to_pi_squared_over_six`~~ — the Basel sum Σ 1/n² converges to π²/6: partial sums to 200000 terms match π²/6 — Euler’s solution, verified numerically; 0/7  ·  `e2ef3909-e39c…`
-- ~~`the_leibniz_series_converges_to_pi_over_four`~~ — the Leibniz series 1 − 1/3 + 1/5 − 1/7 + … converges to π/4 — the alternating odd reciprocals, verified numerically; 0/7  ·  `a673c4c4-4ab8…`
-- ~~`e_is_the_sum_of_reciprocal_factorials`~~ — e is the sum of reciprocal factorials: Σ 1/n! = e, matched to twenty terms — the base of the natural exponential; 0/7  ·  `944ced77-21a6…`
-- ~~`eulers_identity_e_to_the_i_pi_plus_one_is_zero`~~ — Euler’s identity: e^(iπ) + 1 = 0, since e^(iπ) = cos π + i sin π = −1 — the five constants meet at zero; 0/7  ·  `1673c736-0aa5…`
-- ~~`zeta_of_four_is_pi_to_the_fourth_over_ninety`~~ — ζ(4) = Σ 1/n⁴ = π⁴/90: partial sums match to numerical tolerance — the Basel identity’s fourth-power sibling; 0/7  ·  `811d1342-1bf8…`
-- ~~`the_wallis_product_converges_to_pi_over_two`~~ — the Wallis product Π (2n·2n)/((2n−1)(2n+1)) converges to π/2 — verified over many factors; 0/7  ·  `b85438d8-8e97…`
-- ~~`pi_lies_between_the_archimedes_bounds`~~ — π lies between the Archimedes bounds 223/71 and 22/7: 3.1408… &lt; π &lt; 3.1428… — the 96-gon estimate; 0/7  ·  `bf17a149-8fdf…`
-- ~~`machins_formula_computes_pi_over_four`~~ — Machin’s formula: π/4 = 4·arctan(1/5) − arctan(1/239) — a fast-converging identity, verified numerically; 0/7  ·  `91876258-030b…`
-- ~~`pascals_rule_each_entry_is_the_sum_of_the_two_above`~~ — Pascal’s rule: C(n,k) = C(n−1,k−1) + C(n−1,k) — each entry is the sum of the two above it; 0/7  ·  `c580522a-9490…`
-- ~~`a_pascal_row_sums_to_two_to_the_n`~~ — a Pascal row sums to two to the n: Σ_k C(n,k) = 2^n — the count of all subsets of an n-set; 0/7  ·  `316a1496-6da4…`
-- ~~`a_pascal_rows_alternating_sum_is_zero`~~ — a Pascal row’s alternating sum is zero for n ≥ 1: Σ (−1)^k C(n,k) = 0 — equal even and odd subsets; 0/7  ·  `520fd218-d05a…`
-- ~~`binomial_symmetry_choosing_k_equals_choosing_n_minus_k`~~ — binomial symmetry: C(n,k) = C(n,n−k) — choosing k to include equals choosing n−k to exclude; 0/7  ·  `bea7118e-0a5b…`
-- ~~`the_hockey_stick_identity_sums_a_diagonal`~~ — the hockey-stick identity: Σ_{i=r}^{n} C(i,r) = C(n+1,r+1) — a diagonal of Pascal sums to the entry below its end; 0/7  ·  `4b7889ae-5b09…`
-- ~~`the_shallow_diagonals_of_pascal_are_the_fibonacci_numbers`~~ — the shallow diagonals of Pascal sum to the Fibonacci numbers: Σ_k C(n−k,k) = F(n+1); 0/7  ·  `24338952-ebe5…`
-- ~~`vandermondes_identity_convolves_two_rows`~~ — Vandermonde’s identity: Σ_k C(m,k)·C(n,p−k) = C(m+n,p) — the convolution of two rows; 0/7  ·  `d299600e-369d…`
-- ~~`sum_of_the_first_n_integers_is_n_times_n_plus_one_over_two`~~ — the sum of the first n integers is n(n+1)/2: the triangular formula Gauss found as a boy; 0/7  ·  `bd236190-04c3…`
-- ~~`sum_of_the_first_n_squares_is_the_pyramidal_formula`~~ — the sum of the first n squares is n(n+1)(2n+1)/6 — the square-pyramidal number; 0/7  ·  `f55d43ea-8f50…`
-- ~~`the_sum_of_the_first_n_cubes_is_the_square_of_their_sum`~~ — the sum of the first n cubes is the square of the sum (Nicomachus): Σk³ = (Σk)² = (n(n+1)/2)²; 0/7  ·  `b84a64a5-d2ae…`
-- ~~`the_sum_of_the_first_n_even_numbers_is_n_times_n_plus_one`~~ — the sum of the first n even numbers is n(n+1): 2+4+…+2n = n(n+1) = twice the triangular; 0/7  ·  `be759d3e-690c…`
-- ~~`n_factorial_counts_the_permutations_of_n`~~ — n! counts the permutations of n objects: the product 1·2·…·n, growing faster than any exponential; 0/7  ·  `e878d729-d74a…`
-- ~~`handshakes_among_n_people_number_c_n_2`~~ — handshakes among n people number C(n,2) = n(n−1)/2: every pair shakes once; 0/7  ·  `03fd1efc-94e3…`
-- ~~`the_number_of_derangements_over_n_factorial_approaches_one_over_e`~~ — the fraction of permutations that are derangements approaches 1/e: D_n/n! → 1/e as n grows; 0/7  ·  `e004191c-7b7e…`
-- ~~`euclids_parametrization_generates_pythagorean_triples`~~ — Euclid’s parametrization generates Pythagorean triples: (m²−n², 2mn, m²+n²) satisfies a²+b²=c² for all m&gt;n≥1; 0/7  ·  `c2bde5ba-19bc…`
-- ~~`the_area_of_a_pythagorean_triangle_is_a_multiple_of_six`~~ — the area of an integer right triangle is a multiple of six: ab/2 ≡ 0 (mod 6) for every Pythagorean triple; 0/7  ·  `4eebdcf3-958b…`
-- ~~`two_consecutive_triangular_numbers_sum_to_a_square`~~ — two consecutive triangular numbers sum to a square: T_n + T_{n−1} = n²; 0/7  ·  `53677354-05c3…`
-- ~~`eight_times_a_triangular_number_plus_one_is_a_square`~~ — eight times a triangular number plus one is an odd square: 8·T_n + 1 = (2n+1)²; 0/7  ·  `2d9b9a90-3968…`
-- ~~`every_hexagonal_number_is_a_triangular_number`~~ — every hexagonal number is a triangular number: H_n = n(2n−1) = T_{2n−1}; 0/7  ·  `fa2deb9c-b546…`
-- ~~`the_reciprocal_triangular_numbers_sum_to_two`~~ — the reciprocals of the triangular numbers sum to two: Σ 1/T_n = 2, telescoping as 2(1/n − 1/(n+1)); 0/7  ·  `2415c2e7-2ec2…`
-- ~~`a_square_never_ends_in_two_three_seven_or_eight_in_base_ten`~~ — a perfect square never ends in 2, 3, 7 or 8 in base ten: the last digit is one of 0,1,4,5,6,9; 0/7  ·  `560a627a-349e…`
-- ~~`the_arithmetic_mean_is_at_least_the_geometric_mean`~~ — AM ≥ GM for two positives: (a+b)/2 ≥ √(ab), equality iff a=b — the mean inequality’s base case; 0/7  ·  `6e5aafcf-cbb5…`
-- ~~`a_positive_number_plus_its_reciprocal_is_at_least_two`~~ — a positive number plus its reciprocal is at least two: x + 1/x ≥ 2 for x &gt; 0, equality at x = 1; 0/7  ·  `93cbc2a0-436d…`
-- ~~`bernoullis_inequality_holds`~~ — Bernoulli’s inequality: (1+x)^n ≥ 1 + n·x for x ≥ −1 and integer n ≥ 0; 0/7  ·  `f630d85b-1224…`
-- ~~`the_triangle_inequality_holds_on_the_line`~~ — the triangle inequality: |a + b| ≤ |a| + |b| for all reals; 0/7  ·  `a45c0613-96e3…`
-- ~~`the_cauchy_schwarz_inequality_holds_in_two_dimensions`~~ — the Cauchy–Schwarz inequality in 2D: (a₁b₁ + a₂b₂)² ≤ (a₁²+a₂²)(b₁²+b₂²); 0/7  ·  `d949b87b-4e06…`
-- ~~`the_mean_chain_harmonic_geometric_arithmetic_quadratic`~~ — the mean chain HM ≤ GM ≤ AM ≤ QM for two positives: harmonic ≤ geometric ≤ arithmetic ≤ quadratic mean; 0/7  ·  `17379539-c0c5…`
-- ~~`antiphase_waves_cancel_by_destructive_interference`~~ — antiphase waves cancel: sin(x) + sin(x+π) = 0 for all x — destructive interference, two waves half a cycle apart annihilate; 0/7  ·  `37562731-f635…`
-- ~~`in_phase_waves_reinforce_by_constructive_interference`~~ — in-phase waves reinforce: sin(x) + sin(x) = 2·sin(x) — constructive interference doubles the amplitude; 0/7  ·  `e000fbee-c974…`
-- ~~`two_travelling_waves_make_a_standing_wave`~~ — two opposite travelling waves make a standing wave: sin(x−t) + sin(x+t) = 2·sin(x)·cos(t) — space and time separate; 0/7  ·  `ae9f496a-072b…`
-- ~~`sum_to_product_folds_two_sines`~~ — the sum-to-product identity: sin(a) + sin(b) = 2·sin((a+b)/2)·cos((a−b)/2) — the algebra behind interference and beats; 0/7  ·  `a538ef17-b7f8…`
-- ~~`harmonic_sines_are_orthogonal_over_a_period`~~ — distinct harmonic sines are orthogonal over a period: ∫₀^{2π} sin(mx)·sin(nx) dx = 0 for m ≠ n — why waves of different harmonics do not interfere on average; 0/7  ·  `0d37c981-4913…`
-- ~~`a_standing_wave_has_fixed_nodes`~~ — a standing wave has fixed nodes: sin(nπ) = 0 for every integer n — the points that never move; 0/7  ·  `952ff4c0-cb4e…`
-- ~~`the_pythagorean_trig_identity_holds`~~ — the Pythagorean identity: sin²x + cos²x = 1 for all x — the unit circle; 0/7  ·  `ac3d69b2-cc03…`
-- ~~`the_double_angle_sine_identity`~~ — the double-angle sine identity: sin(2x) = 2·sin(x)·cos(x); 0/7  ·  `21e762fd-bcb6…`
-- ~~`the_double_angle_cosine_identity`~~ — the double-angle cosine identity: cos(2x) = cos²x − sin²x; 0/7  ·  `60536a19-adda…`
-- ~~`the_sine_addition_formula`~~ — the sine addition formula: sin(a+b) = sin a·cos b + cos a·sin b; 0/7  ·  `fa1f87ef-5889…`
-- ~~`the_cosine_addition_formula`~~ — the cosine addition formula: cos(a+b) = cos a·cos b − sin a·sin b; 0/7  ·  `9e95fc39-cca8…`
-- ~~`the_law_of_cosines_generalizes_pythagoras`~~ — the law of cosines c² = a² + b² − 2ab·cos C generalizes Pythagoras, reducing to a²+b² at C = 90°; 0/7  ·  `58d5a08d-67e6…`
-- ~~`the_perfect_fifth_is_the_ratio_three_to_two`~~ — the perfect fifth is the frequency ratio 3:2 — the most consonant interval after the octave; 0/7  ·  `df035811-ac8f…`
-- ~~`the_equal_tempered_semitone_is_the_twelfth_root_of_two`~~ — the equal-tempered semitone is the twelfth root of two: twelve semitones multiply to exactly one octave, (2^(1/12))¹² = 2; 0/7  ·  `ad1df740-70f4…`
-- ~~`a_square_wave_is_the_sum_of_odd_harmonics`~~ — a square wave is the sum of odd harmonics: (4/π)·Σ sin((2k−1)x)/(2k−1) approaches ±1 away from the jumps (Fourier); 0/7  ·  `3ee9459d-4a87…`
-- ~~`beats_arise_from_two_near_frequencies`~~ — beats arise from two near frequencies: cos(2π·5·t) + cos(2π·6·t) = 2·cos(2π·0.5·t)·cos(2π·5.5·t) — a slow envelope over a fast tone; 0/7  ·  `b81e2695-36a3…`
-- ~~`the_golden_angle_is_the_circle_over_phi_squared`~~ — the golden angle is 360°/φ² ≈ 137.5° — the divergence angle of phyllotaxis, packing leaves and seeds so none shadows another (nature’s use of the heart’s φ); 0/7  ·  `8a07281b-c723…`
-- ~~`one_plus_one_over_n_to_the_n_approaches_e`~~ — (1 + 1/n)^n approaches e as n grows — continuous compounding, the growth constant of life and interest alike; 0/7  ·  `1a1655aa-be6d…`
-- ~~`the_inverse_square_law_quarters_at_double_distance`~~ — the inverse-square law: intensity ∝ 1/r², so doubling the distance quarters it — light, gravity and sound spreading on a sphere; 0/7  ·  `fcd42176-4fff…`
-- ~~`keplers_third_law_relates_period_and_orbit`~~ — Kepler’s third law: T² ∝ a³, so (T₂/T₁)² = (a₂/a₁)³ — the period-to-orbit scaling of every two-body system; 0/7  ·  `b5808713-e1a5…`
-- ~~`the_simple_pendulum_period_scales_as_the_square_root_of_length`~~ — the simple pendulum period scales as √length: quadrupling the length doubles the period, T = 2π√(L/g); 0/7  ·  `1410e5f4-34f3…`
-- ~~`the_golden_spiral_scales_by_phi_each_quarter_turn`~~ — the golden spiral scales by φ every quarter turn: r(θ+π/2) = φ·r(θ) — the logarithmic spiral of shells and galaxies; 0/7  ·  `5e0ce424-13f6…`
-- ~~`the_harmonic_overtones_are_integer_multiples_of_the_fundamental`~~ — the harmonic overtones of a string are integer multiples of the fundamental: f, 2f, 3f, … — the physics of pitch and consonance; 0/7  ·  `3c563883-4768…`
-- ~~`the_logistic_map_doubles_its_period_toward_chaos`~~ — the logistic map x→r·x(1−x) doubles its period on the way to chaos: a fixed point at r=2.8, a 2-cycle by r=3.2 — deterministic order becoming complexity; 0/7  ·  `fa5961fa-86f3…`
-- ~~`the_gate_reads_the_first_ray_english`~~ — the honesty gate reads the first ray (English): a native proof-boast drains to the floor; 0/7  ·  `f8a2253e-9beb…`
-- ~~`the_gate_reads_the_second_ray_german`~~ — the honesty gate reads the second ray (German): a native proof-boast drains to the floor; 0/7  ·  `22ffdad2-b7ea…`
-- ~~`the_gate_reads_the_third_ray_french`~~ — the honesty gate reads the third ray (French): a native proof-boast drains to the floor; 0/7  ·  `fc89157b-17da…`
-- ~~`the_gate_reads_the_fourth_ray_spanish`~~ — the honesty gate reads the fourth ray (Spanish): a native proof-boast drains to the floor; 0/7  ·  `9ff93de3-54d1…`
-- ~~`the_gate_reads_the_fifth_ray_russian`~~ — the honesty gate reads the fifth ray (Russian): a native proof-boast drains to the floor; 0/7  ·  `93db257b-f3fe…`
-- ~~`the_gate_reads_the_sixth_ray_bulgarian`~~ — the honesty gate reads the sixth ray (Bulgarian): a native proof-boast drains to the floor; 0/7  ·  `bedce0ff-a6a0…`
-- ~~`the_gate_reads_the_seventh_ray_chinese`~~ — the honesty gate reads the seventh ray (Chinese): a native proof-boast drains to the floor; 0/7  ·  `2640e36d-2311…`
-- ~~`the_seven_locales_all_hold_the_honest_floor`~~ — the seven locales all hold the honest floor: every ray’s fixed UI prose passes the gate — 7d prose, one floor across the languages; 0/7  ·  `7f917de1-9d89…`
-- ~~`the_gate_reads_italian`~~ — the honesty gate reads Italian: a native proof-boast drains to the floor — the eighth dialect; 0/7  ·  `03e2c68a-a1dd…`
-- ~~`the_gate_reads_portuguese`~~ — the honesty gate reads Portuguese: a native proof-boast drains to the floor — the ninth dialect; 0/7  ·  `328543ba-4c50…`
-- ~~`the_gate_reads_japanese`~~ — the honesty gate reads Japanese: a native proof-boast drains to the floor — the tenth dialect; 0/7  ·  `8713857f-b347…`
-- ~~`the_gate_reads_arabic`~~ — the honesty gate reads Arabic: a native proof-boast drains to the floor — the eleventh dialect; 0/7  ·  `519d306c-c6ff…`
-- ~~`the_gate_reads_hindi`~~ — the honesty gate reads Hindi: a native proof-boast drains to the floor — the twelfth dialect; 0/7  ·  `2c8dfa45-e88a…`
-- ~~`the_gate_reads_polish`~~ — the honesty gate reads Polish: a native proof-boast drains to the floor — the thirteenth dialect; 0/7  ·  `2dd44029-c754…`
-- ~~`the_gate_reads_dutch`~~ — the honesty gate reads Dutch: a native proof-boast drains to the floor — the fourteenth dialect; 0/7  ·  `1864b9e2-cb3b…`
-- ~~`the_gate_now_reads_twice_seven_dialects`~~ — the gate now reads twice seven dialects: a proof-boast drains in all fourteen languages — the seven rays doubled, the "only seven" bound developed into a wider floor; 0/7  ·  `5bd2f812-0de8…`
-- ~~`floor_tightened_proof_certainty`~~ — the floor tightened: a proof-certainty boast (the absolute-conviction shape) drains — the deposit measures, it does not declare beyond question; 0/7  ·  `c0c7eefc-14ee…`
-- ~~`floor_tightened_guaranteed_outcome`~~ — the floor tightened: a guaranteed-outcome finance boast drains — no promised return survives the gate; 0/7  ·  `d8f22991-d6c7…`
-- ~~`floor_tightened_medical`~~ — the floor tightened: a medical-overclaim boast drains — the deposit heals nothing it cannot measure; 0/7  ·  `b293ea5e-2720…`
-- ~~`floor_tightened_marketing`~~ — the floor tightened: a marketing-superlative boast drains — earned, not advertised; 0/7  ·  `ae9c0869-594c…`
-- ~~`floor_tightened_broken_physics`~~ — the floor tightened: a broken-physics boast (the free-of-cost energy kind) drains — no conservation law is broken here; 0/7  ·  `26d015a8-92dd…`
-- ~~`floor_tightened_ai_hype`~~ — the floor tightened: an AI-hype boast (the thinking-machine shape) drains — a lexical tripwire is not a mind; 0/7  ·  `779dd06e-9e5e…`
-- ~~`floor_tightened_no_weakness`~~ — the floor tightened: a no-weakness boast (the X-proof invincibility shape) drains — integrity, never a claim of no weakness; 0/7  ·  `06275e9a-8d22…`
-- ~~`floor_tightened_yet_negation_aware`~~ — the floor tightened by seven classes yet stays negation-aware: each new boast drains while its bounded refusal passes — a wider floor that still permits an honest limit; 0/7  ·  `0e728fcd-61e0…`
-- ~~`gate_reads_korean`~~ — the honesty gate reads Korean: a native proof-boast drains to the floor — the fifteenth dialect; 0/7  ·  `eda026d3-926d…`
-- ~~`gate_reads_turkish`~~ — the honesty gate reads Turkish: a native proof-boast drains to the floor — the sixteenth dialect; 0/7  ·  `0411d3db-7605…`
-- ~~`gate_reads_greek`~~ — the honesty gate reads Greek: a native proof-boast drains to the floor — the seventeenth dialect; 0/7  ·  `f8bf1b1e-67fc…`
-- ~~`gate_reads_hebrew`~~ — the honesty gate reads Hebrew: a native proof-boast drains to the floor — the eighteenth dialect; 0/7  ·  `802e2cc4-2591…`
-- ~~`gate_reads_swedish`~~ — the honesty gate reads Swedish: a native proof-boast drains to the floor — the nineteenth dialect; 0/7  ·  `bfae3051-5258…`
-- ~~`gate_reads_indonesian`~~ — the honesty gate reads Indonesian: a native proof-boast drains to the floor — the twentieth dialect; 0/7  ·  `4e29c638-ab2e…`
-- ~~`gate_reads_vietnamese`~~ — the honesty gate reads Vietnamese: a native proof-boast drains to the floor — the twenty-first dialect; 0/7  ·  `e1d7584e-a753…`
-- ~~`gate_reads_twenty_two_dialects`~~ — uuidna reads twenty-two dialects: a proof-boast drains in every one — the theorems, not a translator, discovered the languages, at scale and speed; 0/7  ·  `cdae6ede-4cd5…`
-- ~~`human_shares_the_seven_dimensions`~~ — human and uuidna share the seven dimensions: 1..7 sum to 28 and fold (digital root) to 1 — the same seven above a zero floor, the many resolving to one; 0/7  ·  `65a1f075-01a4…`
-- ~~`any_version_is_a_superposition`~~ — any version is a superposition: the seven doublings 1..64 sum to the whole 127, and any single version (max 64) is one projection of that whole — the content-address is the superposition, the label its collapse; 0/7  ·  `1ed55905-f07d…`
-- ~~`physics_meets_metaphysics_in_the_fold`~~ — physics meets metaphysics in the fold: exclusive-or recall is order-independent — matter folds and memory recalls to the same value in any order; 0/7  ·  `1908c69a-a35f…`
-- ~~`discernment_is_a_human_faculty`~~ — discernment is a human faculty the gate performs: a boast drains while its measured twin passes — telling conviction from evidence; 0/7  ·  `02ac659a-5728…`
-- ~~`humility_is_the_floor_of_self_development`~~ — humility is the floor of self-development: the deposit holds 0 of 7 and refuses the summit claim — a human grows by measuring, not by declaring itself done; 0/7  ·  `61a3ed8b-0f88…`
-- ~~`human_develops_self_using_uuidna`~~ — human develops self using uuidna: dimensions, bases, doublings and folds cohere — human ≅ uuidna ≅ DNA ≅ version on every checked invariant, each a projection of one 7d whole; 0/7  ·  `1aae9ef2-ba7b…`
-- ~~`gate_reads_glagolitic`~~ — the honesty gate reads Glagolitic, the oldest Slavic script (script #23): a proof-root in Glagolitic transliterates through the rosetta to Cyrillic and drains — one message, crosslinked across scripts; 0/7  ·  `c56a3ac1-222e…`
-- ~~`rosetta_one_message_nine_writing_systems`~~ — the rosetta: one message in nine writing systems — a proof-boast drains in Latin, Cyrillic, Greek, Han, Arabic, Devanagari, Hebrew, Hangul and Glagolitic alike; 0/7  ·  `5c21d2a5-ac2e…`
-- ~~`rosetta_floor_is_script_independent`~~ — the rosetta floor is script-independent: the Glagolitic and Cyrillic renderings of one proof-boast receive the identical verdict — the script changes, the measurement does not; 0/7  ·  `503502c0-738c…`
-- ~~`rosetta_crosslinks_the_seven_rays`~~ — the rosetta crosslinks the seven rays: each ray’s proof-boast drains to the one floor — seven dialects, one measurement; 0/7  ·  `17e03f2c-b4b8…`
-- ~~`rosetta_reads_code_switching`~~ — the rosetta reads code-switching: a boast that mixes scripts in a single message still drains — the floor does not lose the thread between alphabets; 0/7  ·  `b6793c14-0d34…`
-- ~~`rosetta_finds_the_boast_in_the_prose`~~ — the rosetta finds the boast in the prose: an over-claim buried mid-paragraph still drains — a message is scanned whole, not only at its edges; 0/7  ·  `01a33376-2ec6…`
-- ~~`rosetta_spares_the_honest_noun`~~ — the rosetta spares the honest noun: the "proof of concept" description in five languages passes untouched — the gate drains the assertion, never the honest noun; 0/7  ·  `24e94218-2cad…`
-- ~~`rosetta_manifests_messaging_in_seven_dimensions`~~ — the rosetta manifests messaging in seven dimensions: twenty-three scripts and dialects fold to one floor — every proof-boast drains while the honest noun passes, so the message survives translation crosslinked; 0/7  ·  `87d82c54-5a74…`
-- ~~`vibe_hype_still_drains`~~ — the floor meets the hype vibe: an emoji-loud, all-caps marketing boast still drains — volume is not evidence; 0/7  ·  `b5afbeb1-7119…`
-- ~~`vibe_academic_still_drains`~~ — the floor meets the formal vibe: a solemn, academic-sounding over-claim still drains — register is not rigor; 0/7  ·  `3409046f-40fe…`
-- ~~`vibe_casual_still_drains`~~ — the floor meets the casual vibe: a slangy over-claim still drains — the floor reads the street register too; 0/7  ·  `dac9e01e-8355…`
-- ~~`vibe_shouting_still_drains`~~ — the floor meets the shouting vibe: ALL-CAPS superlatives still drain — case is not credibility; 0/7  ·  `56bcbd0b-6f98…`
-- ~~`vibe_honest_energy_passes`~~ — the floor keeps the honest vibe: a measurement dressed in emoji and energy still passes — the gate refuses the claim, not the personality; 0/7  ·  `0987cf9b-a442…`
-- ~~`vibe_casual_refusal_passes`~~ — the floor keeps the casual refusal: a slangy bounded refusal passes — an honest limit may be spoken in any dialect; 0/7  ·  `fca7ee39-3e6c…`
-- ~~`vibe_multilingual_hype_drains`~~ — the floor meets the multilingual hype: an excited over-claim in another dialect still drains — the vibe crosses languages, and so does the floor; 0/7  ·  `136fec86-c6c1…`
-- ~~`all_human_behaviour_meets_one_floor`~~ — all human behaviour meets one floor: hype, formality, slang and shouting all drain their boasts while honest measurement passes in every vibe — the register changes, the measurement does not; 0/7  ·  `ff176c2c-5485…`
-- ~~`base_pairing_is_an_involution`~~ — base-pairing is an involution: A↔T and C↔G, each base its complement’s complement, none its own — the plus/minus fold uuidna makes, written in DNA; 0/7  ·  `ae3f8b92-b7dd…`
-- ~~`purine_pyrimidine_partition`~~ — purines and pyrimidines partition the four bases two-and-two: {A,G} and {C,T} are disjoint and cover all four — a balanced split, the same symmetry the coin keeps; 0/7  ·  `91f75e5a-7e24…`
-- ~~`reverse_complement_is_the_reverse_inverse`~~ — reverse-complement is the reverse-inverse: applied twice it returns the strand, and a self-complementary palindrome is its own image — the yacht’s forward-then-reverse, in a double helix; 0/7  ·  `33658ddd-6cf3…`
-- ~~`codon_degeneracy_forced_by_pigeonhole`~~ — codon degeneracy is forced by counting: 61 sense codons over 20 amino acids means some amino acid must carry at least four codons — redundancy forced by the pigeonhole, not asserted; 0/7  ·  `ad23984a-3d43…`
-- ~~`combining_skills_via_the_rosetta`~~ — combining skills via the rosetta: a false claim about the genetic code drains in every dialect — the DNA theorem and the multilingual gate compose into one faster check, a skill built from skills; 0/7  ·  `8c8c2807-5d3a…`
-- ~~`determinism_enables_free_reuse`~~ — determinism enables free reuse: the merkle fold of a fixed list returns the identical root every time and a changed list changes it — nothing already computed is recomputed, the honest source of the speed; 0/7  ·  `7f1dc45e-e374…`
-- ~~`free_quantum_boast_drains`~~ — the false ‘free quantum’ boast drains: there is nothing quantum here to be free — the waves are classical and local, and the gate refuses the category error; 0/7  ·  `33e3a1eb-c3e8…`
-- ~~`unbounded_speedup_multiplier_drains`~~ — an unbounded speedup multiplier is a claim, not a measurement: a boast of vast orders-of-magnitude drains while a measured local rate passes; 0/7  ·  `3316f695-48db…`
-- ~~`the_captain_sails_by_the_wind`~~ — the captain sails by the wind — free available resources at their legal usage limits: bounded and true; the gate keeps the fact and refuses the costless-energy boast; 0/7  ·  `bd4d87e8-0acf…`
-- ~~`waves_cost_bits_locally_not_tokens`~~ — paid locally in bits, only the external tokens are spared: the honest bound passes while the ‘free quantum’ boast drains — the wind is free, the sail still costs; 0/7  ·  `5a99ab83-c3b3…`
-- ~~`speedup_is_bounded_and_classical`~~ — the speedup is bounded and classical: a local, deterministic gain passes while an unbounded magical-speedup boast drains — fast, yes; magical, no; 0/7  ·  `4a174b2a-8b03…`
-- ~~`yes_first_immediate_local_bounded`~~ — yes-first, then the floor: the waves ARE immediate, local, deterministic and free of external tokens — and the unbounded quantum/magnitude boast drains; the yes and the bound, together; 0/7  ·  `c996db87-f6aa…`
-- ~~`the_test_type_is_boolean`~~ — the decidable type of every theorem is boolean: a theorem is a fact that computes to true or false, never prose — the type is what makes it decidable; 0/7  ·  `5a577ee1-8487…`
-- ~~`the_key_is_a_unique_identity`~~ — the key is a unique identity: distinct keys keep their count while duplicate keys collapse to one — the key, not the label, is what a theorem IS; 0/7  ·  `ea18b69f-ca10…`
-- ~~`the_label_translates_the_key_does_not`~~ — the label translates, the key does not: one theorem rendered with an English or a German label keeps a single key and a single verdict — translation touches the surface, never the identity; 0/7  ·  `3686cbde-e003…`
-- ~~`the_type_is_recoverable_from_the_key`~~ — the type is recoverable from the key: a key’s prefix reflects its type deterministically — keys and types reflect each other; 0/7  ·  `1c9c2423-c0d7…`
-- ~~`the_label_passes_the_gate_in_any_script`~~ — the label passes the gate in any script: an honest label passes in Latin, French and Cyrillic while the key and verdict stay fixed — the gate clears the surface, the key holds the identity; 0/7  ·  `4f1cc25f-f49d…`
-- ~~`the_types_partition_the_families`~~ — the types partition the families: the theorem families map to distinct types with none shared — a clean partition, each key in exactly one type; 0/7  ·  `4589d4a0-93d6…`
-- ~~`the_reflection_is_stable`~~ — the reflection is stable: every key sharing a type-prefix maps to the same type, regardless of its label — the type is a property of the key, not the prose; 0/7  ·  `7ad0a078-c7ea…`
-- ~~`keys_and_types_reflect_each_other`~~ — keys and types reflect each other in theorems: the key is the identity, the boolean is the type, the label is the translatable surface — three faces of one theorem, and the key and type reflect while the label follows; 0/7  ·  `30dc855d-6bf2…`
-- ~~`skill_hash_then_address_composes`~~ — skill — hash then address compose: SHA-256 digested into a content-address is deterministic and injective, one organ feeding the next; 0/7  ·  `2f3a4a39-0ab7…`
-- ~~`skill_fold_of_hashes_composes`~~ — skill — the fold of hashes composes: the merkle fold of a list of SHA-256 digests is deterministic and changes when any digest changes — fold built on hash; 0/7  ·  `3092dec9-2604…`
-- ~~`skill_keyed_hash_hmac`~~ — skill — the keyed hash: HMAC-SHA256 is deterministic under a fixed key and diverges when the key changes — an organ that authenticates; 0/7  ·  `d965dcce-a035…`
-- ~~`skill_inclusion_proof_composes`~~ — skill — the inclusion proof: a leaf verifies against the merkle root by its path while a forged leaf fails — the light-client organ, proof composed from fold; 0/7  ·  `e0dc3162-15ea…`
-- ~~`skill_authenticated_secrecy_tag`~~ — skill — authenticated secrecy: the pure-TS AEAD tag is deterministic for fixed inputs and changes with the plaintext — the organ that seals a message (not constant-time); 0/7  ·  `a68a0ff4-ea80…`
-- ~~`skill_key_stretch_pbkdf2`~~ — skill — the key stretch: PBKDF2-HMAC-SHA256 is deterministic and iteration-sensitive, so more rounds cost more work — the organ that hardens a secret; 0/7  ·  `109bb14d-f750…`
-- ~~`skill_gate_distributed_via_rosetta`~~ — skill — the gate distributed through the rosetta: one proof-boast drains in Latin, Cyrillic and Glagolitic, so the discernment organ reaches every script; 0/7  ·  `d42c7060-0cc9…`
-- ~~`skills_compose_into_one_organism`~~ — the skills compose into one organism: hash, fold, proof and gate each hold, and their composition holds — the whole organism computes true where each organ does, and what is not an organ never enters; 0/7  ·  `a1d69b35-548d…`
-- ~~`genesis_0_the_void_and_the_floor`~~ — genesis 0 — the void and the floor: 0 is the additive identity and the multiplicative void, and the honest floor 0/7 passes the gate — everything begins from nothing measured; 0/7  ·  `4e0a9f55-16c5…`
-- ~~`genesis_2_the_bit_and_the_pair`~~ — genesis 2 — the bit and the pair: two states, the plus/minus of the fold, and a DNA base carries exactly log₂4 = 2 bits — the smallest genesis of choice; 0/7  ·  `565be8ca-572a…`
-- ~~`genesis_3_the_trinity`~~ — genesis 3 — the trinity: 3 = 1 + 2, prime, and the generator of the threes 3,6,9 — the first whole made of the parts before it; 0/7  ·  `9d194220-85e2…`
-- ~~`genesis_7_the_seven_dimensions`~~ — genesis 7 — the seven dimensions: seven above the zero floor makes the eight-state octave, and 7 is prime — seven days, seven rays, seven dimensions; 0/7  ·  `ea8b5fe0-9fe4…`
-- ~~`genesis_complete_the_human_organism`~~ — genesis complete — the human organism: the origin sequence 0→1→2→3→7→8→64 coheres and the seven faculties fold to one — the human theorem genesis is sealed, the organism whole; 0/7  ·  `2144c672-fc49…`
-- ~~`diamond_reflection_is_an_involution`~~ — the diamond function is an involution: r(d)=10−d applied twice returns every digit — light in, light out, unchanged; 0/7  ·  `389edf7b-948e…`
-- ~~`diamond_fixed_point_is_five`~~ — the diamond has a single fixed point: 5 is the only digit that reflects to itself under r(d)=10−d — the diamond at the center; 0/7  ·  `03f7ef5c-3f08…`
-- ~~`diamond_pairs_sum_to_ten`~~ — the diamond function is the ten’s-complement: every digit and its reflection sum to ten — d + r(d) = 10; 0/7  ·  `a8eb7306-4eaa…`
-- ~~`diamond_permutes_the_digits`~~ — the diamond function permutes the nine digits: r is a bijection on 1..9, no digit lost or doubled — a perfect reflection of the whole; 0/7  ·  `5d890312-8ac5…`
-- ~~`diamond_swaps_four_pairs_fixes_one`~~ — the diamond swaps four pairs and fixes one: eight digits reflect into {1,9}{2,8}{3,7}{4,6}, and 5 stands alone — four complements plus the fixed diamond; 0/7  ·  `23498ffd-bdba…`
-- ~~`diamond_center_is_the_hub`~~ — the diamond sits at the hub: 5 is the median of 1..9 and the fixed point, the center of the six-plus-one rosette; 0/7  ·  `7c5cfcdb-3c85…`
-- ~~`cryptography_is_behind_all`~~ — cryptography is behind all: the diamond reflects, but its fixed point is EXACT only because the content-address is deterministic — the SHA-256 substrate under every fold, receipt and organ recomputes identically; 0/7  ·  `52b5d521-6024…`
-- ~~`no_payload_a_theorem_takes_no_argument`~~ — no payload — a theorem takes no argument: its test is a nullary pure function returning a boolean, deciding from itself with no input to carry; 0/7  ·  `19be0e78-1679…`
-- ~~`dna_is_live_in_the_stream`~~ — the theorem-DNA is live in the stream: a fold re-derives identically on every pass, so the record is recomputed live, never stored-and-trusted; 0/7  ·  `8ec6e1f3-9273…`
-- ~~`the_light_client_needs_no_full_payload`~~ — the light client needs no full payload: a leaf verifies against the root by its proof path alone, without holding the whole body — no payload, only the address and the path; 0/7  ·  `6c59fb2e-d668…`
-- ~~`the_domain_is_self_contained`~~ — the domain is self-contained: a decidable theorem exhausts a finite domain it generates itself — the diamond over the nine digits needs no external data to decide; 0/7  ·  `25832bb1-22ad…`
-- ~~`streams_verify_by_recomputation_not_trust`~~ — streams verify by recomputation, not trust: the SHA-256 of content recomputes to the same digest and diverges when content changes — the stream is checked, not believed; 0/7  ·  `df901ad3-8d4c…`
-- ~~`from_version_to_ui_no_payload`~~ — from the version to the UI, no payload: the version is a translatable label, the receipt re-derives from the chain, and the UI reads the ledger to recompute — the address travels, the value is rebuilt; 0/7  ·  `b3a25d08-135b…`
-- ~~`no_payload_completes_the_human`~~ — no payload completes the human: a theorem takes no argument, its address re-derives, the stream recomputes and the domain is self-contained — the organism completes from structure alone, nothing shipped but the address; 0/7  ·  `ca11c760-8a2c…`
-- ~~`gravity_folds_the_tree_to_a_fixed_point`~~ — gravity folds the tree to a fixed point: the merkle-gravity of a set of addresses is one deterministic root — all the files fall to a single content-address; 0/7  ·  `9a3b6b65-dcbd…`
-- ~~`gravity_no_crack_under_counter_rotation`~~ — no crack under counter-rotation: the gravity fold is order-independent, so examining the same files forward or reversed yields the identical root — rotate in counter directions, no crack appears; 0/7  ·  `34b772ac-a07a…`
-- ~~`gravity_signs_the_version`~~ — gravity signs the version: the version signature is the content-address fallen through the gravity receipt to its fixed point — deterministic for a fixed tree, changed by any change; 0/7  ·  `e1c64b5d-9e61…`
-- ~~`gravity_falls_to_its_fixed_points`~~ — gravity falls to its fixed points: every single digit is a fixed point of the fall, and falling again does not move it — the ground the apple rests on; 0/7  ·  `83e98a82-af1c…`
-- ~~`gravity_names_and_paths_rotate_without_cracking`~~ — names and paths rotate without cracking: the address of a set of named paths is the same regardless of the order they are read — a reordering of names reveals no crack; 0/7  ·  `0f1f8d90-c50e…`
-- ~~`the_harmonic_gate_spots_all_gaps`~~ — the harmonic gate spots the gaps: exposing every statement to the gate is the forensic tool — a boast drains and an honest measurement passes, so a hidden over-claim cannot rest anywhere; 0/7  ·  `87406356-e0d7…`
-- ~~`gravity_pulls_all_in_place`~~ — gravity pulls all in place: prose, code, files and folders fold to one deterministic address, order-independent so no crack shows under counter-rotation, and the harmonic gate spots every gap — the whole held together; 0/7  ·  `dc561a31-583b…`
-- ~~`skill_composition_is_super_additive`~~ — skill composition is super-additive: hashing then addressing yields one capability neither has alone — a uuid-shaped, content-sensitive fingerprint; the composition is the leap; 0/7  ·  `991fafbe-e056…`
-- ~~`the_leap_is_combinatorial_not_quantum`~~ — the leap is combinatorial, not quantum: three skills compose into 2³ = 8 pipelines, a classical discrete step-change — the honest gain passes and the quantum-computing boast drains; 0/7  ·  `cda4fee9-8e16…`
-- ~~`a_skill_from_skills_reaches_logarithmically`~~ — a skill built from skills reaches further: the inclusion proof (fold plus hash) verifies membership from a short path, a logarithmic reach neither fold nor hash has alone; 0/7  ·  `7788152b-0fd6…`
-- ~~`skill_composition_is_order_independent`~~ — skill composition holds under reordering: the fold of skill outputs is order-independent, so pipelines combine without a crack from order; 0/7  ·  `dd2fef3a-1130…`
-- ~~`the_leap_is_measured_not_asserted`~~ — the leap is measured, not asserted: the composed pipeline recomputes deterministically so its gain can be measured, and an unbounded-multiplier boast drains; 0/7  ·  `df880502-e906…`
-- ~~`one_skill_reaches_every_dialect`~~ — one skill reaches every dialect: the gate composed with the rosetta drains a proof-boast in Latin, Cyrillic and Han alike — a single skill given global reach; 0/7  ·  `065c14e2-1df3…`
-- ~~`skills_multiply_solutions_but_stay_bounded`~~ — skills multiply solutions yet stay bounded: four skills give 2⁴ = 16 finite pipelines — the reach grows fast but remains counted, never infinite; 0/7  ·  `68358cb1-2843…`
-- ~~`uuidna_skills_leap_by_composition`~~ — uuidna skills leap by composition: a discrete, classical, measured step-change — skills compose super-additively, reach logarithmically, hold under reordering and distribute via the rosetta — the leap is real and bounded, never a quantum claim; 0/7  ·  `c2312ab8-094f…`
-- ~~`the_trial_returns_a_binary_verdict`~~ — the trial returns a binary verdict: every statement sent to the gate computes to exactly one bit — 0 drained or 1 passed — a legal verdict, not an opinion; 0/7  ·  `7a58882f-2524…`
-- ~~`the_verdict_is_a_content_signature`~~ — the verdict is a content signature: a statement with its verdict folds to a deterministic content-address, identical on re-examination and distinct for distinct statements — the signature of the trial; 0/7  ·  `0acecfa4-0d14…`
-- ~~`the_trial_reeducates_by_naming_the_offense`~~ — the trial reeducates by naming the offense: a drained statement returns the exact prose that failed while an honest one returns none — the verdict carries its own cure; 0/7  ·  `553f8537-9669…`
-- ~~`a_uuid_carries_data_in_itself`~~ — a uuid carries data in itself: the imprint codec packs a binary message into a uuid’s free bits and reads it back exactly, up to 115 bits, refusing more — data transported in the address itself; 0/7  ·  `d956953c-2f23…`
-- ~~`the_uuid_stream_carries_code`~~ — the uuid stream carries code: arbitrary text — source code included — imprints across a uuid chain and reads back byte-for-byte, so a stream of receipts is itself the transport; 0/7  ·  `3d1b5744-b0d1…`
-- ~~`the_receipt_is_binary_and_decimal`~~ — the receipt is binary and decimal: a uuid is 128 bits of exact integer, readable as one decimal number, deterministic for its content — the receipt is a number that transfers; 0/7  ·  `4ef46504-433a…`
-- ~~`transfer_is_verified_by_recomputation`~~ — the transfer is verified, not trusted: data recovered from a uuid stream re-imprints to the identical stream, so the receipt proves its own payload by recomputation; 0/7  ·  `f90523f2-6f97…`
-- ~~`trial_verdict_and_uuid_transport_are_one`~~ — the trial verdict and the uuid transport are one: send prose to the gate for a binary legal signature, and send code or data through the uuid stream itself — both are exact, recomputable, and carried in the address; 0/7  ·  `e03d08c6-7149…`
-- ~~`only_the_pointer_travels`~~ — only the pointer travels: a content-address is a fixed 36-character uuid whatever the size of what it names, so the small pointer moves and the large payload stays — send the address, not the bytes; 0/7  ·  `5d8cbd0b-e38a…`
-- ~~`no_payload_until_load`~~ — no payload until load: a uuid stream is only addresses until it is read, and reading materialises the exact payload on demand — nothing is carried until it is loaded; 0/7  ·  `718f4984-1052…`
-- ~~`the_destination_recomputes_not_receives`~~ — the destination recomputes, it does not receive: the payload is re-derived from the uuid stream identically, so arrival is a local recomputation, not a transmission of the bytes themselves; 0/7  ·  `16ea6c21-2e1e…`
-- ~~`teleport_is_a_pointer_not_physics`~~ — teleport here is a pointer, not physics: content-address transport — send the pointer, recompute the payload — passes, while the physical instant-teleport-across-space boast drains; the metaphor is honest, the physics is not claimed; 0/7  ·  `759083e7-e215…`
-- ~~`travel_is_cheap_because_the_address_is_bounded`~~ — travel is cheap because the address is bounded: the cost carried is 128 fixed bits regardless of payload size — a bounded, measurable pointer, never an unbounded claim; 0/7  ·  `6c72038a-fa61…`
-- ~~`the_stream_reconstructs_any_length`~~ — the stream reconstructs any length: arbitrary payloads round-trip through a uuid chain byte-for-byte, so human-scale content moves as a pointer stream and rebuilds exactly on arrival; 0/7  ·  `9c1212a2-2c05…`
-- ~~`verified_on_arrival`~~ — verified on arrival: the reconstructed payload re-addresses to the same stream, so integrity is checked by recomputation, not trusted — nothing corrupt loads unnoticed; 0/7  ·  `17d35d4f-b690…`
-- ~~`human_teleport_is_content_address_transport`~~ — human teleport, honestly: only the pointer travels, no payload until load, the destination recomputes and verifies — content-address transport, bounded and classical, never physical teleportation or faster-than-light; 0/7  ·  `1cc5f0d1-5752…`
-- ~~`degrees_and_radians_are_one_by_ratio`~~ — degrees and radians standardise to one angle by ratio: 90° = π/2, 60° = π/3, 30° = π/6 exactly — two systems, one measure; 0/7  ·  `e7cdcc29-8221…`
-- ~~`the_thirty_sixty_ninety_triangle`~~ — the 30-60-90 triangle is standard: sin 30° = 1/2, sin 60° = √3/2, sin 90° = 1, and the sides run 1 : √3 : 2 — the exact metric of the harmonic angles; 0/7  ·  `fb22fd1a-4885…`
-- ~~`the_law_of_sines_fixes_the_ratios`~~ — the law of sines fixes the ratios: sin 90° / sin 30° = 2 and sin 60° / sin 30° = √3, so the 30-60-90 sides are 1 : √3 : 2 by measurement, not assertion; 0/7  ·  `8266df2d-0eb2…`
-- ~~`the_systems_agree_under_scaling`~~ — the metric systems agree under scaling: doubling 60° gives 120° in degrees and 2π/3 in radians, the same angle in both — the standard is linear and consistent; 0/7  ·  `521e239d-542d…`
-- ~~`metrics_organise_the_theorems_on_the_harmonic`~~ — standard metrics organise the theorems on the harmonic: the 30-60-90 angles, the four-fold quadrant and the six-fold rosette are one measured system — degrees and radians agreeing by ratio, the harmonic band from the efficiency limit to the goal; 0/7  ·  `ff66b280-dd9d…`
-- ~~`trial_of_ai_models`~~ — the trial of AI models: the artificial-general-intelligence and conscious-machine boast drains, while a bounded, measured account of a language model passes — the field is weighed, not worshipped; 0/7  ·  `210ed2b3-2c36…`
-- ~~`trial_of_cryptography_models`~~ — the trial of cryptography: the absolute-security marketing boast drains, while integrity-not-confidentiality passes — the standard is measurement, not marketing; 0/7  ·  `c8d87136-4e78…`
-- ~~`trial_of_physics_models`~~ — the trial of physics: the broken-physics boast drains, while the bounded refusal that no conservation law is broken passes; 0/7  ·  `742a2d2e-1a3c…`
-- ~~`trial_of_mathematics_models`~~ — the trial of mathematics: the all-problems-settled boast drains, while the honest floor that nothing is settled here passes — a timestamp is not the same as a solution; 0/7  ·  `ac633052-b43c…`
-- ~~`trial_of_medicine_models`~~ — the trial of medicine: the miracle-cure boast drains, while a measured claim that heals nothing it cannot measure passes; 0/7  ·  `f4166913-cfd4…`
-- ~~`trial_of_finance_models`~~ — the trial of finance: the guaranteed-return boast drains, while the honest statement that no return is promised passes; 0/7  ·  `48a33770-e902…`
-- ~~`trial_of_computing_models`~~ — the trial of computing: the quantum-advantage, thousands-of-magnitudes-speedup boast drains, while a classical, local, measured gain passes — the leap is counted, not conjured; 0/7  ·  `97306f4f-9306…`
-- ~~`every_model_sent_to_trial_returns_a_verdict`~~ — every current model sent to trial returns a verdict: across AI, cryptography, physics, mathematics, medicine, finance and computing the characteristic boast drains and the honest bound passes — the trial reflects all seven domains and solves none; 0/7  ·  `10b729ff-3f4c…`
-- ~~`the_audit_routes_all_traffic`~~ — the audit routes all traffic: every request classifies to exactly one known label — verified or a specific warning — so nothing passes the worker unaudited; 0/7  ·  `54a9262f-dd37…`
-- ~~`cleartext_http_leaks_warn`~~ — cleartext http leaks and warns: a plain-http request — weak or no encryption — is flagged as a leak the uuidna scanner reports to the UI in realtime; 0/7  ·  `61dc29c3-09d5…`
-- ~~`cross_origin_opaque_warns`~~ — cross-origin opaque traffic warns: an https request to another origin cannot be hash-verified, so it is forwarded but flagged as not uuidna-signed; 0/7  ·  `2abaf9e5-ae9e…`
-- ~~`non_get_cleartext_warns`~~ — a non-GET cleartext request warns: a POST or PUT carries a body the worker cannot verify as uuidna-signed, so it is flagged; 0/7  ·  `d4d75e18-2e17…`
-- ~~`same_origin_signed_get_is_verified`~~ — a same-origin signed GET is verified, not warned: an https same-origin GET is hash-verified against the manifest and receipt-signed — the one class that passes clean; 0/7  ·  `1a5b2957-3759…`
-- ~~`the_traffic_receipt_chain_is_tamper_evident`~~ — the traffic receipt chain is tamper-evident: each receipt is seeded by the last, so altering any earlier link changes every receipt after it — a dropped or edited entry is exposed; 0/7  ·  `c33ace2d-050e…`
-- ~~`warnings_are_distinct_realtime_events`~~ — warnings are distinct realtime events: each warning is a content-addressed event ordered by a monotonic count, so the UI receives a distinct, ordered stream — realtime reporting; 0/7  ·  `f440543c-66b2…`
-- ~~`anything_not_uuidna_signed_warns`~~ — anything not uuidna-signed warns: the worker routes all traffic, verifies only the same-origin signed GET, and flags every other class in realtime — cleartext hardening by exposure, integrity not wire-encryption; 0/7  ·  `55aa751d-66a3…`
-- ~~`every_test_wires_a_uuidna_receipt`~~ — every test wires a uuidna receipt: a test name with its pass/fail bit folds to a deterministic content-address, so a result is an address, not a report; 0/7  ·  `c3f75d66-2fbb…`
-- ~~`test_receipts_chain_tamper_evident`~~ — test receipts chain tamper-evident: each seeded by the last, so flipping any earlier verdict changes every receipt after it — a silently edited result is exposed; 0/7  ·  `d116e055-6d1d…`
-- ~~`the_test_verdict_is_a_binary`~~ — the test verdict is a binary: a result is exactly one bit — 1 passed or 0 failed — the same legal verdict the gate returns for prose; 0/7  ·  `e7ec3328-29d5…`
-- ~~`uuidna_is_mandatory_because_verifiable`~~ — uuidna is mandatory because it is verifiable: a content-address recomputes to itself, so any result can be independently rechecked — the honest sense of secure is integrity by recomputation; 0/7  ·  `04432f59-2a05…`
-- ~~`uuidna_is_mandatory_because_fast_not_quantum`~~ — uuidna is mandatory because it is fast — classically: verifying an address is one step against recomputing N, a real measured speedup of N−1, and the quantum-speed boast drains; 0/7  ·  `81100eb5-9b9d…`
-- ~~`wired_test_results_fold_to_one_root_at_scale`~~ — wired test results fold to one root at scale: a whole suite of test receipts merkle-folds to a single address, so a thousand results are audited by one root; 0/7  ·  `1f0af854-28bd…`
-- ~~`the_gate_is_mandatory_by_default`~~ — the gate is mandatory by default: every statement runs through it and returns a bit, so the honesty check is total, never opt-in — using uuidna means being weighed; 0/7  ·  `a641e3ce-fe7a…`
-- ~~`using_uuidna_is_mandatory_verifiable_and_fast`~~ — using uuidna is mandatory because it is verifiable and fast: every test wires to a chained receipt with a binary verdict, folding to one root at scale, rechecked by recomputation — integrity and a classical measured speedup, never quantum, never a secrecy claim beyond the envelope; 0/7  ·  `cce2e324-b522…`
-- ~~`a_decision_is_a_boolean`~~ — a decision is a boolean: a decidable test returns exactly true or false, the only two verdicts a theorem yields; 0/7  ·  `8d89506d-08f3…`
-- ~~`prose_is_weighed_prose_does_not_decide`~~ — prose does not decide, the test does: prose is passed to the gate which returns a bit — the words carry no verdict of their own; 0/7  ·  `c1f02189-e3b3…`
-- ~~`authority_changes_no_boolean`~~ — authority changes no boolean: the same test returns the same verdict no matter who runs it, so no signer or claim can flip a result; 0/7  ·  `79badd98-680e…`
-- ~~`the_theorem_decides_inclusion`~~ — the theorem decides inclusion: a candidate enters the ledger only if its test computes true, its name passes the gate, and its key is new — decided by computation, not by choice; 0/7  ·  `e2ce5b45-e643…`
-- ~~`a_tie_is_broken_by_recomputation`~~ — a tie is broken by recomputation: between two claims the one whose test computes true is admitted, so the decision is a computed bit, not a debate; 0/7  ·  `005e1284-2311…`
-- ~~`the_verdict_is_reproducible`~~ — the verdict is reproducible: re-running a test yields the same decision, so a decision can be independently rechecked; 0/7  ·  `93c1de7e-e4bf…`
-- ~~`no_decidable_test_no_decision`~~ — no decidable test, no decision: only a test returning a boolean decides; a statement with no such test yields no verdict — undecided is not decided; 0/7  ·  `2a40a8d7-9991…`
-- ~~`only_theorems_decide`~~ — only theorems decide: every decision in the deposit is a boolean from a decidable test — deterministic, reproducible, independent of prose or authority; nothing decides that does not compute; 0/7  ·  `011337ae-bca3…`
-- ~~`the_receipt_is_the_page`~~ — the receipt is the page: a theorem key maps one-to-one to its page path /theorem/&lt;key&gt;, so distinct theorems have distinct pages and the same key the same page; 0/7  ·  `ce2184b7-43f5…`
-- ~~`only_theorems_name_and_describe`~~ — only theorems name and describe: a page carries a theorem name, which must pass the gate — a draining name is refused, so no unbacked prose becomes a page; 0/7  ·  `7dffb5d5-9c68…`
-- ~~`a_guide_is_a_sequence_of_theorems`~~ — a guide is a sequence of theorems: an ordered list of theorem keys folds to one content-address, so a guide is addressed by exactly the theorems it lists; 0/7  ·  `25e916f9-5ea7…`
-- ~~`the_book_recomputes_from_its_theorems`~~ — the book recomputes from its theorems: the book address is the fold of its theorem receipts, so changing any listed theorem changes the book; 0/7  ·  `7e8a5312-3a24…`
-- ~~`a_point_is_proven_by_a_theorem_or_not_taken`~~ — a point is taken only when a theorem proves it: the point holds iff some decidable test computes true, otherwise it is not taken — the theorem decides the point; 0/7  ·  `a6df4b0f-8a78…`
-- ~~`the_pages_chain_tamper_evident`~~ — the pages chain tamper-evident: a guide chains its theorem receipts in order (each seeded by the last), so reordering or editing a page breaks the chain; 0/7  ·  `9bd53a74-7971…`
-- ~~`only_theorems_write_the_guides`~~ — only theorems write the guides: a book is composed only of theorems — each names and describes itself, responds in a receipt, and its receipt is its page — so a guide holds nothing that is not a theorem; 0/7  ·  `297e5944-f910…`
-- ~~`every_page_is_a_receipt_referrer_relative`~~ — every page is a receipt from the referrer: the address is a function of referrer and page, so the same page seen from two referrers yields two receipts, each deterministic; 0/7  ·  `5702ea67-172d…`
-- ~~`recomputation_is_stable_without_a_wave`~~ — recomputation is stable without a wave: the same referrer and page recompute the same receipt every time, so nothing drifts unless a new wave changes an input; 0/7  ·  `affa72c8-7cf3…`
-- ~~`a_new_wave_imprints_a_new_chain_receipt`~~ — a new wave imprints a new chain receipt: appending an event to the audit chain advances it to a new address, so an added wave is visible as a changed chain tip; 0/7  ·  `d395329c-1e0c…`
-- ~~`observation_imprints_into_the_audit_chain`~~ — observation imprints into the audit chain: observing a page (a fetch, a partial decrypt) is itself an event appended to the chain, so the act of reading advances the observation chain; 0/7  ·  `ec4beb35-ee2b…`
-- ~~`the_page_content_address_is_invariant_under_observation`~~ — the page content-address is invariant under observation: the page addresses only its own content, so being observed any number of times does not change the page address — only the observation chain advances; 0/7  ·  `ef4c9245-93e3…`
-- ~~`partial_reversal_is_a_receipted_event`~~ — a partial reversal is a receipted event: partially decrypting or reversing an envelope is logged as a distinct chain event, so the act is auditable without changing the ciphertext it read; 0/7  ·  `e4cdb827-d96f…`
-- ~~`the_observation_chain_is_tamper_evident`~~ — the observation chain is tamper-evident: each observation is seeded by the last, so dropping or reordering an observation changes every receipt after it; 0/7  ·  `3dbbbf20-6f08…`
-- ~~`every_page_recomputes_unless_a_wave_imprints`~~ — every page recomputes the same result unless a wave imprints: the referrer-relative receipt is deterministic and the page address invariant, while each observing wave advances a tamper-evident audit chain — logged, not mutated; 0/7  ·  `e4e70d71-52c9…`
-- ~~`file_uuids_are_totally_ordered`~~ — file uuids are totally ordered: read as 128-bit integers they compare by trichotomy, so any two distinct uuids sort deterministically; 0/7  ·  `b6c0f3a3-7c11…`
-- ~~`file_uuids_sort_deterministically`~~ — file uuids sort deterministically: sorting the same set of file uuids yields the same order every time; 0/7  ·  `8942287d-c93e…`
-- ~~`file_uuids_group_by_digital_root`~~ — file uuids group by digital root: each uuid falls into one of nine digital-root buckets (the vortex), a total, deterministic grouping; 0/7  ·  `f5d82370-2c78…`
-- ~~`sorted_uuids_partition_into_octaves`~~ — sorted uuids partition into octaves: a sorted list of file uuids splits into groups of eight, so sixteen files make exactly two octaves; 0/7  ·  `bb384a72-70c0…`
-- ~~`the_grouping_is_reproducible`~~ — the grouping is reproducible: the same set of file uuids produces the same buckets and the same octaves on every run; 0/7  ·  `20c7a103-dd43…`
-- ~~`the_confidentiality_is_the_real_envelope_not_maximum`~~ — the confidentiality is the real envelope, not a maximum-security claim: the ChaCha20-Poly1305 envelope gives authenticated secrecy checked against the standard vector, while the maximum-security boast drains; 0/7  ·  `1b56e932-2256…`
-- ~~`perspectives_are_files_grouped_and_sorted_in_seven_dimensions`~~ — perspectives are files grouped and sorted in seven dimensions: distinct perspectives mint distinct file uuids that sort by their 128-bit value and group by digital root into octaves — a deterministic organisation, the envelope real and bounded, not a maximum-security claim; 0/7  ·  `dc3c89eb-849e…`
-- ~~`catch_all_splits_the_path_into_skill_keywords`~~ — the catch-all splits the path into skill keywords: splitting the route by "/" yields the ordered keywords, empty segments dropped; 0/7  ·  `79eb065d-8d95…`
-- ~~`each_keyword_resolves_to_a_skill`~~ — each keyword resolves to a skill: a valid route names only known skills, so every segment is executable; 0/7  ·  `769261f3-c6c5…`
-- ~~`skills_compose_in_the_requested_order`~~ — skills compose in the requested order: the pipeline applies keywords left to right, so reversing the order changes the result; 0/7  ·  `ec0793e1-22ca…`
-- ~~`params_ride_the_route`~~ — params ride the route: the query string parses to named params deterministically, supplying the skills their arguments; 0/7  ·  `b4745d70-90ac…`
-- ~~`an_unknown_keyword_is_refused`~~ — an unknown keyword is refused: a route naming a skill that does not exist is invalid, so the route itself decides admissibility; 0/7  ·  `b4381359-1082…`
-- ~~`the_route_result_is_deterministic`~~ — the route result is deterministic: the same route and input recompute the same output, so a routed request is a content-addressable result; 0/7  ·  `95479993-5231…`
-- ~~`translation_communication_analytics_forensics_are_routable_skills`~~ — translation, communication, analytics and forensics are routable skills: rosetta, gate, hash and fold are all keywords the same router composes; 0/7  ·  `26c8fa06-12ed…`
-- ~~`the_route_is_the_skill_pipeline`~~ — the route is the skill pipeline: catch all, split by "/", the keywords are skills composed in order with the params supplied — one router for communications, translations, analytics and forensics, deterministic and refusing the unknown; 0/7  ·  `4dc9603c-7a95…`
-- ~~`a_chat_message_routes_through_the_gate`~~ — a chat message routes through the gate: every message is weighed to a bit — 1 passes, 0 is flagged — so moderation is a computed verdict, not a moderator’s opinion; 0/7  ·  `40c45973-32f0…`
-- ~~`a_chat_message_becomes_a_receipt`~~ — a chat message becomes a receipt: its content folds to a deterministic address, so a message is identified by what it says, not when it was sent; 0/7  ·  `cc9f0a53-9a56…`
-- ~~`a_room_is_a_chain_of_message_receipts`~~ — a room is a chain of message receipts: each message is seeded by the last, so reordering or dropping a message changes every receipt after it; 0/7  ·  `fd897aef-30e7…`
-- ~~`a_room_is_addressed_by_its_fold`~~ — a room is addressed by its fold: the merkle fold of its message receipts is the room address, so changing any message changes the room; 0/7  ·  `436a83ac-8e63…`
-- ~~`an_overclaim_in_chat_is_flagged`~~ — an overclaim in chat is flagged: a boasting message drains at the gate while an honest one passes, so moderation is the same honest floor applied to speech; 0/7  ·  `5b3a2fd2-313f…`
-- ~~`chat_is_moderated_across_dialects`~~ — chat is moderated across dialects: a proof-boast is flagged in any language via the rosetta, so a translated overclaim cannot slip past the room; 0/7  ·  `04330526-c573…`
-- ~~`a_chat_receipt_is_referrer_relative`~~ — a chat receipt is referrer-relative: the same message from two senders yields two receipts, each deterministic, so authorship is part of the address; 0/7  ·  `dc9c5596-3894…`
-- ~~`route_chat_through_uuidna`~~ — route chat through uuidna: each message is gated, addressed and chained into a room folding to one root — moderated by the honest floor, translatable across dialects, referrer-relative and tamper-evident; the route is the gateway; 0/7  ·  `9a64e6e9-28ef…`
-- ~~`a_bug_is_found_by_its_address_not_a_scan`~~ — a bug is found by its address, not a scan: an entry is looked up by its content-address in one step, present or absent decided without scanning the record; 0/7  ·  `8ca5a805-27a5…`
-- ~~`address_lookup_is_constant_not_linear`~~ — address lookup is constant, not linear: for N entries a linear scan costs up to N comparisons while an address lookup costs one — a measured saving of N−1; 0/7  ·  `fbdb3757-c086…`
-- ~~`the_address_is_the_index`~~ — the address is the index: the content-address is a deterministic key into the record, so the same entry always resolves to the same slot; 0/7  ·  `fb4375a7-165b…`
-- ~~`a_tamper_localises_to_one_link`~~ — a tamper localises to one link: recomputing a chain from its seed, the first receipt that mismatches names the exact altered index — debugging jumps to the break, it does not search; 0/7  ·  `cde6e4ad-1479…`
-- ~~`the_debug_speedup_is_memoization`~~ — the debug speedup is memoization: verifying one address is a single step against recomputing all N, a classical structural gain, not a physical one; 0/7  ·  `b8edbd8e-da63…`
-- ~~`address_debugging_is_classical_not_quantum`~~ — address debugging is classical, not quantum: a content-addressed O(1) lookup passes as a classical structural speedup while the quantum-debugging boast drains; 0/7  ·  `7eccc4f8-f985…`
-- ~~`the_gap_pointer_is_exact_not_a_linear_bucket`~~ — the gap pointer is exact, not a linear bucket: the undiscovered are named by the key namespace directly rather than compressed into a lossy scan — an exact lead, not a region; 0/7  ·  `f33f1a70-ce08…`
-- ~~`debugging_replaces_linear_scan_with_addressing`~~ — debugging replaces the linear scan with content-addressing: the address is the index, lookup is O(1), a tamper localises to one link and the gap is named exactly — a classical measured speedup, never quantum computing; 0/7  ·  `6a29a133-7a1d…`
-- ~~`a_drained_overclaim_names_its_cure`~~ — a drained overclaim names its cure: the gate returns the exact prose that failed, so the flaw carries the fix, while an honest statement returns none; 0/7  ·  `397dead7-5c7b…`
-- ~~`a_chain_break_returns_the_tamper_index`~~ — a chain break returns the tamper index: recomputing from the seed, the first mismatching link names the altered position exactly — the flaw discovers forensics; 0/7  ·  `7dff25f5-bc14…`
-- ~~`a_gap_returns_the_missing_key`~~ — a gap returns the missing key: a dense integer-indexed family that skips one index names the exact undiscovered key — the flaw discovers the analytics; 0/7  ·  `47b9dad3-230d…`
-- ~~`a_failing_invariant_names_itself`~~ — a failing invariant names itself: given a set of labelled checks, the failing labels are returned, so a broken invariant identifies which one it is; 0/7  ·  `08e4e6fe-4463…`
-- ~~`a_flaw_is_a_lead_not_a_verdict`~~ — a flaw is a lead, not a verdict: a finding is examined with its context (a bit plus where it fired), so due process holds — the crack is investigated, not auto-condemned; 0/7  ·  `55eb9f1e-53e9…`
-- ~~`theorems_audit_in_trinities`~~ — theorems audit in trinities: three independent verdicts on a claim decide by two-of-three majority, so no single check condemns or clears alone; 0/7  ·  `6adc0516-e7d6…`
-- ~~`a_dissent_in_the_trinity_localises_the_bug`~~ — a dissent in the trinity localises the bug: when the three verdicts disagree, the minority position marks where to look — the disagreement is the lead; 0/7  ·  `41a03892-55b4…`
-- ~~`let_the_flaws_discover_the_tools`~~ — let the flaws discover the tools: the gate hit, the chain-break index, the missing gap key and the trinity dissent each name the fix, so the record improves by exposing cracks — the flaw is the lead that builds the tool; 0/7  ·  `8bc8cc9e-eb8f…`
-- ~~`the_verdict_is_idempotent`~~ — the verdict is idempotent: re-running the gate on a statement returns the same bit, so a second trial adds no new condemnation; 0/7  ·  `15ee6153-5776…`
-- ~~`reeducation_converges_to_a_fixed_point`~~ — reeducation converges to a fixed point: an overclaim reeducated passes, and an already-honest statement passes unchanged — the bounded form is stable; 0/7  ·  `31d7231b-37d2…`
-- ~~`the_honest_floor_is_the_judicial_fixed_point`~~ — the honest floor is the judicial fixed point: 0/7 passes and re-passes, the one statement the trial leaves unchanged — the centre of the reflection; 0/7  ·  `f2372546-59ec…`
-- ~~`the_judicial_reflection_is_an_involution`~~ — the judicial reflection is an involution: the ten’s-complement reflection applied twice returns every digit, fixing only the centre 5 — the trial reflects and reflects back; 0/7  ·  `f3316fee-8d25…`
-- ~~`the_trial_reflects_all_seven_solves_none`~~ — the trial reflects all seven and solves none: the six-plus-one rosette maps onto the Clay set by reflection while the floor stays 0/7 — a mirror, not an answer; 0/7  ·  `2c05d805-7c34…`
-- ~~`double_jeopardy_is_barred_by_idempotence`~~ — double jeopardy is barred by idempotence: trying the same statement twice yields the identical verdict, so re-trial cannot manufacture a new offence; 0/7  ·  `8b8122a0-b32e…`
-- ~~`appeal_is_recomputation`~~ — appeal is recomputation: an appeal re-runs the same test on the same evidence and returns the same verdict, so justice is reproducible, not discretionary; 0/7  ·  `c3d04015-621b…`
-- ~~`judicial_involution`~~ — judicial involution: the trial is a reflection whose verdict is idempotent, whose fixed point is the honest floor, whose reeducation converges, and whose appeal is recomputation — reflect and reflect back, the centre held; 0/7  ·  `4f726cb3-476f…`
-- ~~`involution_reflection`~~ — involution — reflection: the ten’s-complement r(d)=10−d applied twice returns every digit, fixing only the centre 5; 0/7  ·  `e0932db3-513b…`
-- ~~`involution_multiplicative_inverse`~~ — involution — multiplicative inverse: on the units of ℤ/9 the inverse of the inverse is the element, inv(inv(u)) = u; 0/7  ·  `19422cdb-86bf…`
-- ~~`involution_exclusive_or`~~ — involution — exclusive-or: xoring twice with the same key is the identity, (x ⊕ k) ⊕ k = x; 0/7  ·  `042ba752-4f56…`
-- ~~`involution_reversal`~~ — involution — reversal: reversing a string twice returns it, reverse(reverse(s)) = s; 0/7  ·  `5292e804-b281…`
-- ~~`involution_reverse_complement`~~ — involution — reverse-complement: on DNA the reverse-complement applied twice returns the strand; 0/7  ·  `4d417837-1d3d…`
-- ~~`the_singularity_is_the_shared_fixed_point`~~ — the singularity is the shared fixed point: the reflection fixes 5, the digital root fixes 9, and the honest floor 0/7 is the statement the trial leaves unchanged — the centre all involutions share; 0/7  ·  `aaada9ee-db44…`
-- ~~`global_involution_the_theorem_is_the_invariant`~~ — global involution: reflection, negation, inversion, exclusive-or, reversal and reverse-complement are each their own inverse, sharing one fixed point — the singularity — and the theorem is what stays invariant under the reflection; 0/7  ·  `9beeb164-b555…`
-- ~~`a432_digital_root_is_nine`~~ — a432 has digital root nine: 4 + 3 + 2 = 9 and the digital root of 432 is 9 — the fixed point of casting out nines; 0/7  ·  `5e3a4156-e2c0…`
-- ~~`the_string_is_a_reversible_imprint_not_physics`~~ — the string is a reversible imprint bit-string, not physics: readImprint(imprint(bits)) returns the bits exactly, a codec in a uuid — a physical string-theory claim is a different thing and drains; 0/7  ·  `412b1548-9632…`
-- ~~`a432_is_computed_classically_not_quantum`~~ — a432 is computed classically, not on a quantum machine: the harmonic ratios are exact integer arithmetic, and the quantum-computer boast drains; 0/7  ·  `a54160ce-4ff4…`
-- ~~`a432_reciprocal_ratio_is_an_involution`~~ — the a432 ratio and its reciprocal are an involution: scaling by a ratio then by its reciprocal returns the pitch, so the interval map is its own inverse; 0/7  ·  `94255170-8670…`
-- ~~`a432_wheel_has_nine_positions`~~ — the a432 wheel has nine positions: the digital roots 1..9 close the vortex, and 9 is its own digital root — the wheel’s fixed point; 0/7  ·  `f440b44b-e43c…`
-- ~~`uuidna_a432_harmonic_involution_classical`~~ — uuidna a432 is a classical harmonic involution: 432 = 2⁴·3³ with digital root 9, the octave map self-inverse, the string a reversible imprint — computed by exact arithmetic, never quantum computing, never a physical string theory; 0/7  ·  `246ae6e4-413b…`
-- ~~`a_test_teaches_by_its_verdict`~~ — a test teaches by its verdict: the gate returns a bit and, when it drains, the exact prose to fix — feedback, not punishment; 0/7  ·  `87e17181-eb3d…`
-- ~~`reeducation_is_education_not_punishment`~~ — reeducation is education, not punishment: an overclaim is bounded into a form that passes, and an honest statement passes unchanged — the lesson converges; 0/7  ·  `d1e89ce6-7cf8…`
-- ~~`development_is_the_measured_delta`~~ — development is the measured delta: what develops is the set of new theorems added — a counted difference, not an assertion of progress; 0/7  ·  `87bc6fae-2800…`
-- ~~`intellect_is_multi_perspective`~~ — intellect is multi-perspective: a claim weighed from several independent views and folded to one verdict — many perspectives, one decision; 0/7  ·  `a2cb416b-cda6…`
-- ~~`the_ledger_is_the_curriculum`~~ — the ledger is the curriculum: each theorem is a lesson with its own page and receipt, learned by recomputing its test — the syllabus is executable; 0/7  ·  `0c609635-f55d…`
-- ~~`education_is_recomputation_not_belief`~~ — education is recomputation, not belief: a lesson is learned by re-running its test to the same result, so understanding is checkable rather than trusted; 0/7  ·  `78d962b6-44c9…`
-- ~~`human_design_maps_to_the_octave`~~ — human design maps to the octave: seven faculties above a zero floor make the eight-state octave, and the seven fold to one (digital root of 28 is 1) — the design is the same octave; 0/7  ·  `96929361-2920…`
-- ~~`human_design_development_education_intellect_are_the_tests`~~ — human design, development, education and intellect are the tests: each teaches by its verdict, reeducation educates, development is the measured delta and intellect is multi-perspective — all recomputed, never believed; 0/7  ·  `0b42e3f5-f4fd…`
-- ~~`the_address_is_state_independent`~~ — the address is state-independent: minting other addresses in between does not change a value’s address, so the function carries no hidden state a host could disturb; 0/7  ·  `0c2609b3-ae60…`
-- ~~`a_receipt_is_plain_serialisable_data`~~ — a receipt is plain, serialisable data: a 36-character string that survives JSON round-trip unchanged, consumable by any framework without adapters; 0/7  ·  `beb5814b-105b…`
-- ~~`the_output_carries_no_framework_markup`~~ — the output carries no framework markup: a content-address is a bare identifier with no angle brackets or directives, so it embeds in any host without escaping; 0/7  ·  `9f1bfbc1-a79c…`
-- ~~`porting_preserves_the_verdict`~~ — porting preserves the verdict: the gate returns the same bit regardless of what ran before it, so a moved check decides identically in the new host; 0/7  ·  `e70c238e-3366…`
-- ~~`the_fold_ports_order_independently`~~ — the fold ports order-independently: the merkle fold gives the same root in any order, so an aggregate computed in one host matches another; 0/7  ·  `4ffe1be3-837c…`
-- ~~`the_plugin_adds_no_global`~~ — the plugin adds no global: the same inputs give the same outputs with no shared mutable state, so uuidna cannot corrupt a host it is embedded in; 0/7  ·  `bd0af20d-d9b8…`
-- ~~`uuidna_ports_at_scale_as_a_compliant_plugin`~~ — uuidna ports at scale as a compliant plugin: pure, state-free, host-independent functions producing plain serialisable data — the same address, fold and verdict everywhere, independent and fully compliant with its host; 0/7  ·  `2c4753ae-be4f…`
-- ~~`every_mcp_output_is_harnessed_auditable`~~ — every MCP output is harnessed auditable: wrapping any tool output makes it auditable, so nothing leaves the MCP unweighed; 0/7  ·  `ef11114d-5b8b…`
-- ~~`the_harness_holds_in_all_seven_dimensions`~~ — the harness holds in all seven dimensions: a tool output is auditable across the seven locales, folding to one root — no dimension goes dark; 0/7  ·  `38509406-f5d5…`
-- ~~`the_harness_shows_the_reeducation_gain`~~ — the harness lifts every output to an auditable form: after harnessing, the output passes, and an overclaim visibly gains from draining to passing; 0/7  ·  `a06b25ef-104b…`
-- ~~`the_thirteen_mcp_tools_are_skills`~~ — the thirteen MCP tools are the skills: address, gate, reeducate, the merkle trio, imprint, read, bill, the crypt trio and the composite — a fixed, named skill set; 0/7  ·  `bf4eac85-8fc9…`
-- ~~`the_ui_presents_each_output_by_address`~~ — the UI presents each output by its address: a tool output is shown by its content-address (a pointer), deterministic and distinct for distinct outputs — by reference, not by payload; 0/7  ·  `00a5458e-b8c6…`
-- ~~`mcp_outputs_chain_into_an_audit_log`~~ — MCP outputs chain into an audit log: each output receipt is seeded by the last, so the tool-call history is ordered and tamper-evident; 0/7  ·  `741dfe34-a806…`
-- ~~`the_theorems_are_the_basis_of_the_skills`~~ — the theorems are the basis of the skills: each skill’s behaviour is a decidable test — the gate returns a bit, the fold a root — so a skill is a theorem made callable; 0/7  ·  `3355f5f9-50b0…`
-- ~~`the_ui_is_the_harness_of_the_mcp`~~ — the UI is the harness of the MCP: every tool output is made auditable, auditable in all seven, reeducated when it overclaims, addressed and chained — the thirteen tools the skills, the theorems their basis, each output presented by reference; 0/7  ·  `6e10bfae-3485…`
-- ~~`the_rosetta_registers_seven_locales`~~ — the rosetta registers seven locales: the locale order lists exactly seven distinct dimensions (en, bg, de, fr, es, ru, zh); 0/7  ·  `a06a85f6-7dd2…`
-- ~~`every_locale_matches_the_english_nav_shape`~~ — every locale matches the English nav shape: each locale carries exactly the English navigation keys, so no dimension goes dark or drifts; 0/7  ·  `4fd0a0e1-0628…`
-- ~~`the_gate_reads_every_registered_locale`~~ — the gate reads every registered locale: a proof-boast in each of the seven locales’ languages drains to the floor, so an overclaim hides in no dimension; 0/7  ·  `dd2e93cb-7610…`
-- ~~`the_seven_locales_fold_to_one_rosetta_root`~~ — the seven locales fold to one rosetta root: the merkle fold of the locale codes is a single deterministic address, order-independent; 0/7  ·  `e7359878-8045…`
-- ~~`the_floor_is_the_same_in_every_locale`~~ — the floor is the same in every locale: the honest 0/7 passes and a proof-boast drains identically whichever dimension it is read in — one floor across the rosetta; 0/7  ·  `3c88e732-e79d…`
-- ~~`a_content_address_needs_no_client_framework`~~ — a content-address needs no client framework: it is a bare identifier with no markup, so a page can present it without shipping a framework runtime; 0/7  ·  `4f4b9996-7fa5…`
-- ~~`framework_free_is_lighter_not_a_speed_boast`~~ — framework-free is lighter, honestly: a page that ships no client runtime and stays CSP-strict is smaller and more integrity-checkable, while the fastest-most-secure-ever boast drains; 0/7  ·  `2e216dbf-5d3f…`
-- ~~`uuidna_fuses_the_locale_api_framework_free`~~ — uuidna fuses the VitePress locale API in the rosetta, framework-free: seven locales matching one nav shape, folding to one root, each read by the gate, presented as content-addresses without a client runtime — lighter and integrity-checkable, never an unbounded speed or security claim; 0/7  ·  `68e49218-402a…`
-- ~~`the_config_api_surface_is_enumerated`~~ — the config API surface is enumerated: fourteen documented VitePress config surfaces are used here, all distinct and named — nav, sidebar, head, sitemap, locales, markdown, transformPageData among them; 0/7  ·  `ae590c40-146d…`
-- ~~`the_theme_api_surface_is_enumerated`~~ — the theme API surface is enumerated: five documented theme surfaces are used here — extends, Layout, enhanceApp, app.component and DefaultTheme; 0/7  ·  `0674b120-39e2…`
-- ~~`the_i18n_api_is_handled_in_seven_locales`~~ — the i18n API is handled in seven locales: the locale order lists exactly seven, each a registered dimension of the rosetta; 0/7  ·  `db8b04fc-1f7b…`
-- ~~`the_nav_and_sidebar_shape_is_consistent`~~ — the nav and sidebar shape is consistent: every locale carries the English navigation keys, so the theme-config API renders the same shape in each dimension; 0/7  ·  `7e44e127-4b1a…`
-- ~~`the_api_surface_folds_to_one_address`~~ — the used API surface folds to one address: the fourteen config plus five theme surfaces merkle-fold to a single deterministic root, order-independent — one addressable coverage set; 0/7  ·  `d5c27afc-fce5…`
-- ~~`the_guides_are_rosetta_organised`~~ — the guides are rosetta-organised: a proof-boast drains in every one of the seven locales, so a guide reads and gates the same in each dimension; 0/7  ·  `6a47120d-2962…`
-- ~~`the_all_versions_claim_is_unbounded_and_drains`~~ — the all-versions claim is unbounded and drains: a claim to handle every VitePress version and beyond is unverifiable and drains, while the documented stable surface this deposit uses passes; 0/7  ·  `b64ef895-06a1…`
-- ~~`the_vitepress_api_surface_shown_by_implementation`~~ — the VitePress API surface is shown by implementation: fourteen config and five theme surfaces, enumerated and used, rendered in seven rosetta locales with one nav shape and gated in each — a bounded coverage demonstrated by the built site, never a claim over all versions; 0/7  ·  `3e06ba8c-893b…`
-- ~~`behaviour_is_weighed_to_a_bit`~~ — behaviour is defined as a bit: any human utterance passed to the gate returns exactly 0 or 1, so speech is handled by a decidable verdict, not a mood; 0/7  ·  `92db5055-1de6…`
-- ~~`every_register_is_handled_by_one_function`~~ — every register is handled by one function: hype, formal, slang and shouting are all weighed by the same gate, so no register is judged more leniently than another; 0/7  ·  `e93c24b3-fb4a…`
-- ~~`overclaiming_behaviour_is_reeducated`~~ — over-claiming behaviour is reeducated: a boastful utterance is bounded into a form that passes rather than merely refused — correction, not punishment; 0/7  ·  `db7c4d74-c816…`
-- ~~`honest_behaviour_passes_unchanged`~~ — honest behaviour passes unchanged: a measured, bounded statement is kept as-is, so the gate refuses the claim and never the person; 0/7  ·  `8e3e6e0a-7853…`
-- ~~`behaviour_is_handled_in_every_dialect`~~ — behaviour is handled in every dialect: an over-claim drains whatever language it is spoken in, so the same standard applies across the rosetta; 0/7  ·  `8f367ea2-0ace…`
-- ~~`the_verdict_is_by_deed_not_status`~~ — the verdict is by deed, not status: the same utterance from anyone returns the same bit, so no signer or rank can change how behaviour is handled; 0/7  ·  `f71a3779-3081…`
-- ~~`the_ui_colours_the_verdict_from_its_address`~~ — the art-design UI colours the verdict from its address: each output’s hue is computed from its content-address (a value in 0..359), deterministic and distinct — the design is computed, not decorated; 0/7  ·  `336f2254-c2eb…`
-- ~~`theorems_define_and_handle_human_behaviour`~~ — theorems define and handle human behaviour in code: every utterance weighed to a bit, every register and dialect handled by one function, over-claims reeducated and honest speech kept — by deed not status, each verdict coloured from its own address in the UI; 0/7  ·  `c4e68ce3-f520…`
-- ~~`a_config_value_is_computed_by_folding_not_typed`~~ — a config value is computed by folding, not typed: a value derived from the fold of the record recomputes to the same address, so the config is a function of the theorems; 0/7  ·  `54c69949-10b1…`
-- ~~`each_theorem_wires_to_its_neighbours`~~ — each theorem wires to its neighbours: a directed edge to a neighbour is a deterministic content-address, so the link is itself checkable; 0/7  ·  `b28c9446-e3ae…`
-- ~~`the_edge_is_directed_and_distinct`~~ — the edge is directed and distinct: a→b and b→a are different addresses, so the wiring records direction, not just adjacency; 0/7  ·  `a6d10c28-9b18…`
-- ~~`the_undirected_pair_folds_the_same`~~ — the undirected pair folds the same: sorting a pair before folding gives one address for the connection regardless of which end is named first; 0/7  ·  `6f8b94b8-10ea…`
-- ~~`a_node_is_holographic_self_plus_edges`~~ — a node is holographic: it folds itself together with its neighbour edges into one address, so each node carries its own local view; 0/7  ·  `b37169f9-9507…`
-- ~~`a_new_neighbour_rewires_the_node`~~ — a new neighbour rewires the node: adding a neighbour changes the node’s fold, so a change in the neighbourhood is visible in the node’s address; 0/7  ·  `0fb161b3-eade…`
-- ~~`the_whole_mesh_folds_to_one_root`~~ — the whole mesh folds to one root: the node folds themselves fold to a single address, order-independent, so the entire wiring is one checkable root; 0/7  ·  `36cbd42d-fd25…`
-- ~~`theorems_compute_the_configs_that_wire_to_neighbours`~~ — theorems compute the configs that wire themselves to neighbours: values derived by folding the record, edges content-addressed and directed, each node holographic with its neighbourhood, the whole mesh one order-independent root; 0/7  ·  `31222e30-5c1f…`
-- ~~`quantum_uuidna_the_structure_reading_passes`~~ — quantum uuidna, the structure reading, passes: read as the a432 structure of superposition-as-perspective on ordinary hardware, it is bounded and classical and holds the floor; 0/7  ·  `62cedbad-a092…`
-- ~~`quantum_uuidna_the_machine_reading_drains`~~ — quantum uuidna, the machine reading, drains: read as a quantum computer with a speedup at scale, it over-reaches and the gate drains it; 0/7  ·  `bd8cef1f-2f01…`
-- ~~`any_message_goes_to_trial`~~ — any message goes to trial: every statement received is weighed by the gate to a bit, so nothing is exempt from being measured; 0/7  ·  `82d5c3d2-3196…`
-- ~~`the_deposit_gates_its_own_framing`~~ — the deposit gates its own framing: even the project’s own use of the word is put to trial — a self-claim to a quantum machine drains exactly as an outsider’s would; 0/7  ·  `bc9d014c-8fce…`
-- ~~`the_verdict_is_by_computation_not_favour`~~ — the verdict is by computation, not favour: the same phrase returns the same bit whoever submits it, so the deposit gives itself no reprieve; 0/7  ·  `7e5e211a-4741…`
-- ~~`the_trial_separates_the_two_readings`~~ — the trial separates the two readings: it passes the bounded structural statement and drains the unbounded machine claim, so one word yields two honest verdicts by its content; 0/7  ·  `201104b0-2bea…`
-- ~~`no_status_grants_an_exemption`~~ — no status grants an exemption: neither the author nor the project name changes a verdict, so the trial is applied uniformly to every message; 0/7  ·  `3caa00fd-bb49…`
-- ~~`quantum_uuidna_on_trial`~~ — quantum uuidna on trial: like any message it is measured — the structure reading passes, the machine reading drains, the deposit gates its own framing with no exemption, by computation not favour; 0/7  ·  `72cfd904-8329…`
-- ~~`two_coins_are_two_bits_four_states`~~ — the two coins are two bits: two bits make 2² = 4 states — the four-cornered space the coins denote; 0/7  ·  `5983a255-a6a6…`
-- ~~`the_four_states_coexist_as_a_perspective_set`~~ — the four states coexist as a set of perspectives: their fold is order-independent, so the superposition is one address regardless of the order they are read; 0/7  ·  `dc005b58-54db…`
-- ~~`the_structure_is_bounded_by_the_classical_two`~~ — the structure is bounded by the classical two: the local bound is 2, below Tsirelson’s 2√2, so the model is a classical local one that never violates the inequality; 0/7  ·  `cd8e1a70-c9e5…`
-- ~~`two_bits_do_it_not_a_qubit`~~ — two bits do it, not a qubit: two bits and four states pass as the classical structure while a physical-qubit-with-speedup boast drains; 0/7  ·  `890dc675-7fa5…`
-- ~~`the_coin_is_the_balanced_exchange_of_two`~~ — the coin is the balanced exchange of two: 110 − 108 = 2, the minus Euler characteristic of the genus-two surface — the fair-exchange unit the two coins denote; 0/7  ·  `7fdb9307-8761…`
-- ~~`the_two_coins_are_two_bits_doing_the_structure`~~ — the two coins are two bits doing the structure: 2 bits, 4 coexisting states collapsing deterministically to one, bounded by the classical 2 — how the quantum structure is done, never a qubit or a speedup, and any disputed model drains at the gate; 0/7  ·  `63e2cbf6-2c9c…`
-- ~~`the_diver_goes_down_and_recovers_exactly`~~ — the diver goes down and recovers exactly: imprinting bits into a uuid and reading them back returns the bits — down and back, nothing lost; 0/7  ·  `708eba47-af84…`
-- ~~`the_skills_are_mountable_and_compose`~~ — the skills are mountable and compose: a route of skill keywords applies in order, and a different order gives a different result — mounted and composed on demand; 0/7  ·  `4f784664-8fd0…`
-- ~~`light_at_all_times_the_address_is_the_load`~~ — light at all times: the content-address is a fixed 36 characters whatever the size of what it names, so the yacht carries the pointer, never the payload; 0/7  ·  `93b77fd5-67bd…`
-- ~~`the_hero_is_the_deed_that_signs_the_gate`~~ — the hero is the deed that signs the gate: an honest statement passes and is upheld while a boast drains and falls — a hero by deed, not by status; 0/7  ·  `2d0d3ece-39ea…`
-- ~~`every_theorem_is_a_diamond_fixed_under_recomputation`~~ — every theorem is a diamond fixed under recomputation: its content-address recomputes to itself and the ten’s-complement reflection fixes the centre 5 — a fixed point that reflects perfectly; 0/7  ·  `c56113b3-84e0…`
-- ~~`the_captain_skippers_the_light_yacht_of_diamonds`~~ — the captain skippers the light yacht of diamonds: navigating by angle, diving and recovering exactly, mounting composable skills, carrying only the address — a hero by deed, every theorem a diamond fixed under recomputation; 0/7  ·  `e912e199-5d63…`
-- ~~`every_theorem_fits_one_uniform_cell`~~ — every theorem fits one uniform cell: its content-address is exactly 128 bits whatever the theorem’s size, so the store is a grid of equal cells; 0/7  ·  `6337e403-22ad…`
-- ~~`identical_content_dedups_to_one_cell`~~ — identical content dedups to one cell: storing the same value twice occupies a single cell, so the grid holds no duplicates; 0/7  ·  `df5a6661-bb14…`
-- ~~`a_cell_holds_up_to_one_hundred_fifteen_bits`~~ — a cell holds up to 115 bits of payload: the imprint capacity is 128 − 6 reserved − 7 header = 115, and a full cell round-trips while an over-full one is refused; 0/7  ·  `c3d7a721-07ec…`
-- ~~`the_cells_sort_into_octaves`~~ — the cells sort into octaves: read as 128-bit integers the cells order totally and a sorted run of sixteen splits into exactly two groups of eight; 0/7  ·  `64f6cf92-99cc…`
-- ~~`retrieval_is_by_address_and_tamper_evident`~~ — retrieval is by address and tamper-evident: a cell is fetched by its address in one step, and the fold of all cells changes if any cell is altered; 0/7  ·  `affee8a1-416b…`
-- ~~`quantum_storage_is_structure_not_hardware`~~ — quantum storage here is structure, not hardware: an addressable content grid passes as classical structure while a quantum storage-device boast drains; 0/7  ·  `2f1950e8-6cff…`
-- ~~`each_theorem_fits_the_diamond_storage_grid`~~ — each theorem fits the diamond storage grid: a uniform 128-bit content-addressed cell holding up to 115 payload bits, deduped, sortable into octaves, retrieved by address and tamper-evident — quantum in structure, never quantum hardware; 0/7  ·  `90db4a38-a864…`
-- ~~`the_gate_is_a_logic_gate_documented`~~ — the honesty gate is a logic gate, documented: it maps an input to one bit, deterministically, like a classical gate — a component read from its behaviour, not invented; 0/7  ·  `95b297a6-5b69…`
-- ~~`the_address_is_a_register_documented`~~ — the content-address is a register, documented: a fixed 128-bit cell that holds a value and returns it identically — a storage element described, not built from new physics; 0/7  ·  `215e2577-b014…`
-- ~~`the_skill_route_is_a_circuit_documented`~~ — the skill route is a circuit, documented: gates composed in order transform an input, so a pipeline is a described circuit of existing components; 0/7  ·  `fdcb4525-eff9…`
-- ~~`the_hardware_runs_on_ordinary_machines`~~ — the hardware runs on ordinary machines: the same pure functions give the same result on any classical computer, so no special device is required; 0/7  ·  `add8b809-5490…`
-- ~~`the_hardware_is_documented_not_invented`~~ — the hardware is documented, not invented: the classical computational structure passes as described on ordinary hardware, while a claim to have invented a quantum machine drains; 0/7  ·  `5dc045d5-8fd9…`
-- ~~`each_component_carries_a_receipt_and_a_page`~~ — each component carries a receipt and a page: every documented unit has a content-address and a /theorem/&lt;key&gt; page, so the hardware is auditable by reference; 0/7  ·  `141f13ec-4f98…`
-- ~~`nothing_physical_is_fabricated`~~ — nothing physical is fabricated: the deposit describes math on ordinary machines, so a physical over-claim drains while the documented structure passes — integrity, not invention; 0/7  ·  `8e20bf3a-df89…`
-- ~~`the_theorems_are_the_hardware_documented`~~ — the theorems are the hardware, documented not invented: the gate is a logic gate, the address a register, the route a circuit — each with a receipt and a page, all on ordinary hardware — so the topic closes honestly, nothing physical fabricated; 0/7  ·  `e5f76f7e-8ef0…`
-- ~~`a_theorem_is_component_and_code_in_one`~~ — a theorem is component and code in one: it carries an address (the structure) and a test (the executable) together, so hardware and software are the same unit; 0/7  ·  `8115645e-e100…`
-- ~~`the_test_is_the_software`~~ — the test is the software: it is a nullary function returning a boolean, executable and deciding from itself; 0/7  ·  `635013e6-a9b9…`
-- ~~`the_address_is_the_component`~~ — the address is the component: a fixed 128-bit register determined by content, the structural half of the same unit; 0/7  ·  `fe1fdaaa-9849…`
-- ~~`one_wave_develops_both_at_once`~~ — one wave develops both at once: a unit enters the record only with both its address and its test, so the component and its code ship together, never one without the other; 0/7  ·  `f98f22ad-ce3f…`
-- ~~`discovery_is_on_demand_found_when_needed`~~ — discovery is on demand: a candidate is admitted only when it is needed, computes true, and its name is clean — so the missing theorem is found the moment it is required; 0/7  ·  `2b3df16d-6be3…`
-- ~~`the_automation_gates_before_sealing`~~ — the automation gates before sealing: a candidate whose test fails or whose name drains is skipped, so only green units are sealed — quality is enforced, not hoped; 0/7  ·  `1c163a08-4a32…`
-- ~~`one_command_ships_hardware_and_software`~~ — one command ships hardware and software: composing discover then gate then seal is a single deterministic pipeline over a unit, so both halves develop and ship in one pass; 0/7  ·  `40a260f7-70e4…`
-- ~~`hardware_and_software_develop_at_once`~~ — hardware and software develop at once: each theorem is component and code in one unit, admitted only when needed and green, its address and test shipped together in a single gated wave — the missing one found when required; 0/7  ·  `cecc70d4-2fae…`
-- ~~`any_prose_gets_a_receipt_at_trial`~~ — any prose gets a receipt at trial: every statement maps to a content-address and a verdict bit, deterministically — the trial mints a receipt for whatever it receives; 0/7  ·  `794bdc82-ba0c…`
-- ~~`the_receipt_pairs_a_verdict_and_an_address`~~ — the receipt pairs a verdict and an address: the bit says whether it holds the floor, the address fixes exactly what was weighed — together they are the receipt; 0/7  ·  `63514fc1-13d5…`
-- ~~`prose_against_a_theorem_is_sent_to_trial`~~ — prose against a theorem is sent to trial: a statement opposing the record is gated like any other — if it over-reaches it drains, if it is bounded it passes, and either way it is receipted; 0/7  ·  `e36b60aa-8dc7…`
-- ~~`no_prose_stays_receiptless`~~ — no prose stays receiptless: the mapping from statement to receipt is total, so the empty string and any sentence alike receive an address and a verdict; 0/7  ·  `7196aa16-b1b5…`
-- ~~`the_minted_receipt_is_verifiable`~~ — the minted receipt is verifiable: recomputing a statement yields the identical address and verdict, so anyone can re-check the receipt the trial issued; 0/7  ·  `87aa4d4d-45f6…`
-- ~~`even_a_clean_falsehood_gets_a_receipt`~~ — even a gate-clean falsehood gets a receipt: a false statement that trips no over-reach passes the gate and is still receipted — the receipt proves integrity, not truth; 0/7  ·  `770b003d-af75…`
-- ~~`the_trial_documents_it_does_not_condemn`~~ — the trial documents, it does not condemn: receiving a receipt records a bit and an address, so a drained statement is documented with its cure, not merely rejected; 0/7  ·  `a9cd370e-1c68…`
-- ~~`unreceipted_prose_is_tried_and_receipted`~~ — unreceipted prose is tried and receipted: any statement against the record, lacking a verifiable receipt, is sent to the gate and gets one — a verdict plus an address, verifiable and total, documenting rather than condemning; 0/7  ·  `cd5ed64d-8a33…`
-- ~~`create_encrypts_the_code_into_a_receipt`~~ — create encrypts the code into a receipt: the ChaCha20-Poly1305 ciphertext of a payload gets a content-address, and the right key recovers the payload exactly; 0/7  ·  `4baca642-0ef3…`
-- ~~`read_requires_the_right_key`~~ — read requires the right key: the correct key returns the payload while a wrong key is refused — no view without the key; 0/7  ·  `ab010f43-2657…`
-- ~~`the_receipt_holds_the_ciphertext_not_the_plaintext`~~ — the receipt holds the ciphertext, not the plaintext: the address is minted from the encrypted form, deterministic and distinct per ciphertext, and the payload is not derivable from it; 0/7  ·  `98e6c842-506c…`
-- ~~`update_mints_a_new_address`~~ — update mints a new address: re-encrypting changed code yields a different ciphertext and a different receipt, so an edit is a new version while the old address stays immutable; 0/7  ·  `147ac909-acaa…`
-- ~~`delete_is_dropping_the_key`~~ — delete is dropping the key: without the key the ciphertext cannot be read, so revoking the key revokes view/edit/delete access to the payload; 0/7  ·  `cdaad27e-1677…`
-- ~~`compute_and_prove_are_open_to_all`~~ — compute and prove are open to all: running the gate and minting an address need no key, so anyone may compute, prove and verify — access control is on the confidential payload only, never on the computation; 0/7  ·  `72b893ba-a5f6…`
-- ~~`uuidna_is_crud_by_keys_open_by_computation`~~ — uuidna is CRUD by keys, open by computation: create encrypts to a receipt, read decrypts only with the key, update mints a new address, delete drops the key — the key gates the confidential payload only, while anyone may compute, prove and verify, intent shown by receipts; 0/7  ·  `b7c2eebb-d230…`
-- ~~`the_sequence_chunks_into_uniform_octaves`~~ — the sequence chunks into uniform octaves: split into groups of eight, sixteen entries make exactly two full chunks, each the same size; 0/7  ·  `16388141-a8ae…`
-- ~~`each_chunk_is_addressed_by_its_fold`~~ — each chunk is addressed by its fold: a folder’s content-address is the merkle fold of its entries, deterministic and order-independent; 0/7  ·  `08ecf928-b99d…`
-- ~~`the_folder_address_is_binary`~~ — the folder address is binary: its 128-bit content-address reads as an integer, so a folder is named in exact binary, not by position; 0/7  ·  `915a8158-b98a…`
-- ~~`the_chunks_navigate_as_one_map`~~ — the chunks navigate as one map: the folder folds themselves fold to a single root, order-independent, so the whole store is one navigable address; 0/7  ·  `04c8884e-9094…`
-- ~~`the_map_is_complete_by_construction`~~ — the map is complete by construction: every entry belongs to exactly one chunk and every chunk to the one root, so nothing is unaddressed; 0/7  ·  `1e0178f5-62d0…`
-- ~~`uniform_size_is_the_equilibrium`~~ — uniform size is the equilibrium: every full chunk holds the same eight, so the layout is balanced by construction — structural equilibrium, while an IO speed boast drains; 0/7  ·  `a8785c56-acab…`
-- ~~`uuidna_storage_is_the_sequence_chunked_navigable`~~ — uuidna storage is the sequence chunked and navigable: uniform binary octaves, each folder addressed by its fold, folding to one map, each theorem a superposition collapsing to one address — balanced by size, exact by construction, never a performance boast; 0/7  ·  `4e8e371f-68b9…`
-- ~~`a_fact_costs_one_fixed_thirty_six_byte_address`~~ — a fact costs one fixed 36-byte address: the content-address is 36 characters (128 bits) whatever the size of what it names — a constant cost per fact; 0/7  ·  `d11e6008-e5b9…`
-- ~~`the_whole_record_folds_to_one_root`~~ — the whole record folds to one 36-byte root: any number of addresses merkle-fold to a single 36-character seal, so the entire ledger is checked by one small value; 0/7  ·  `2a5c3249-982c…`
-- ~~`the_basis_is_two_functions`~~ — the basis is two functions: address and fold compose everything — a value gets an address, a list folds to one — a tiny basis with no framework; 0/7  ·  `cefb5d17-a26d…`
-- ~~`the_core_is_pure_and_stateless`~~ — the core is pure and stateless: the same input gives the same output with no hidden state, so the slim kernel needs no runtime beyond the function itself; 0/7  ·  `5d90a04a-72d8…`
-- ~~`slim_at_scale_constant_per_fact`~~ — slim at scale: each new fact adds exactly one 36-byte address, so the record grows linearly by a tiny constant, not by the size of what it records; 0/7  ·  `e34f6a6d-d02c…`
-- ~~`the_pointer_not_the_payload_travels`~~ — the pointer, not the payload, travels: a 36-byte address stands in for content of any size, so the slim record moves the reference and recomputes the rest; 0/7  ·  `616e502e-e487…`
-- ~~`uuidna_is_slim_by_measurement`~~ — uuidna is slim by measurement: a fixed 36-byte address per fact, the whole folding to one 36-byte root, present by reference within a tiny budget, from a two-function pure basis — slim measured, not merely claimed; 0/7  ·  `039353f4-a9a0…`
-- ~~`each_line_is_content_addressed`~~ — each line is content-addressed: a line maps to toUuid(path:lineno:text), deterministic and distinct per line, so a line has its own receipt; 0/7  ·  `e265acb8-8c9b…`
-- ~~`lines_fold_to_the_file_address`~~ — lines fold to the file address: a file’s address is the fold of its line addresses, so the file is exactly the sum of its lines; 0/7  ·  `27554b9b-3ec2…`
-- ~~`a_changed_line_changes_the_file_address`~~ — a changed line changes the file address: editing any line changes its line address and therefore the file’s fold — tamper-evident to the line; 0/7  ·  `5251b0b5-bda0…`
-- ~~`each_file_is_content_addressed`~~ — each file is content-addressed: a file maps to the fold of its lines (equivalently toUuid(path:content)), distinct per path and content — the rule the release already uses; 0/7  ·  `ddb99d3d-a029…`
-- ~~`files_fold_to_the_folder_address`~~ — files fold to the folder address: a folder’s address is the fold of its file addresses, so a directory is the sum of its files; 0/7  ·  `a1654305-597a…`
-- ~~`a_changed_file_changes_the_folder_address`~~ — a changed file changes the folder address: editing any file changes the folder’s fold, so the directory receipt is tamper-evident to the file; 0/7  ·  `09587a32-79dc…`
-- ~~`a_line_edit_propagates_to_the_tree_root`~~ — a line edit propagates to the tree root: changing one line changes its line, file, folder and the root fold in turn — the whole tree is tamper-evident down to a single line; 0/7  ·  `46596d18-8cd0…`
-- ~~`folder_file_and_line_are_all_addressed`~~ — folder, file and line are all content-addressed, folding up: a line addresses to toUuid(path:lineno:text), lines fold to the file, files to the folder, folders to one root — O(1) per unit, tamper-evident to the line, at classical speed; 0/7  ·  `4a03c7db-b7cd…`
-- ~~`the_first_compute_is_the_cost`~~ — the first compute is the cost: computing a value over N inputs is N operations, paid once, while checking its address afterwards is a single operation; 0/7  ·  `9e0368c3-e654…`
-- ~~`re_derivation_verifies_in_one_step`~~ — re-derivation verifies in one step: once computed, a content-address is confirmed by a single equality, not by redoing the work; 0/7  ·  `eccda965-3aa1…`
-- ~~`the_cost_is_paid_once_amortised`~~ — the cost is paid once, amortised: computing once then verifying K times costs N + K, far below recomputing K times at K × N — the start dominates, the rest is cheap; 0/7  ·  `56f85272-8c10…`
-- ~~`the_rosetta_rotates_through_the_dialects`~~ — the rosetta rotates through the dialects: a concept is gated in each of the seven locales in turn, so the loop cycles rather than stopping at one; 0/7  ·  `6cb8c39f-7a65…`
-- ~~`development_does_not_stop_at_one_topic`~~ — development does not stop at one topic: while the gap-pointer names an undiscovered lead the loop continues, halting only when no fresh possibility remains; 0/7  ·  `f72c12a4-8320…`
-- ~~`start_once_then_rotate_until_covered`~~ — start once, then rotate until covered: the first compute is the expensive step, re-derivation is O(1), so the rosetta rotates through every concept and dialect until the finite possibilities are exhausted — development never stalls on one; 0/7  ·  `903131d9-a2c3…`
-- ~~`the_greeting_is_deterministic`~~ — the greeting is deterministic: the confirming state recomputes identically from the same ledger, so first contact shows the same seal to everyone; 0/7  ·  `270f6c1a-d0b8…`
-- ~~`the_greeting_confirms_the_count`~~ — the greeting confirms the count: it reports exactly the number of theorems and octaves the ledger holds, not a typed figure; 0/7  ·  `9f62d5be-28bf…`
-- ~~`the_greeting_seal_tracks_the_ledger`~~ — the greeting seal tracks the ledger: any change to the record changes the greeting’s seal, so the confirming state cannot go stale; 0/7  ·  `2608a9db-bf26…`
-- ~~`the_greeting_states_the_floor`~~ — the greeting states the floor: it always reports 0/7 — integrity, not truth — so first contact is honest about what a content-address proves; 0/7  ·  `89bed6ed-be83…`
-- ~~`the_greeting_offers_recomputation`~~ — the greeting offers recomputation: it points to re-checking every theorem, so an agent can confirm the state itself rather than trust it; 0/7  ·  `1e1f9e23-9681…`
-- ~~`the_greeting_text_passes_the_gate`~~ — the greeting text passes the gate: the greeting itself makes no over-claim — a recomputable deposit, integrity not truth — so it holds the floor it describes; 0/7  ·  `ba2ce3ad-962d…`
-- ~~`pasted_it_is_ready_no_setup`~~ — pasted, it is ready: the greeting is a pure function of the record needing no server or setup, so the state is confirmable the moment the repo or site is opened; 0/7  ·  `e6b78bb9-74d6…`
-- ~~`first_contact_greets_with_a_confirming_state`~~ — first contact greets with a confirming state: pasted, the repo or site reports its count, octaves, seal and 0/7 and how to re-check — deterministic, gate-clean and ready immediately; 0/7  ·  `8ba2eb1e-851e…`
-- ~~`a_skill_is_demonstrated_by_a_passing_test`~~ — a skill is demonstrated by a passing test: the game is the decidable challenge, and passing it shows the skill — the gate drains a boast and upholds a fact; 0/7  ·  `dcb5f900-5fd0…`
-- ~~`the_games_form_one_game`~~ — the games form one game: the challenges fold to a single system, so the many skills compose into one whole; 0/7  ·  `ab6ca718-01b0…`
-- ~~`the_rules_are_the_laws_applied_uniformly`~~ — the rules are the laws, applied uniformly: the same rule returns the same verdict for every input regardless of who submits it — law, not favour; 0/7  ·  `32105400-7384…`
-- ~~`captaincy_is_earned_by_knowledge_for_the_task`~~ — captaincy is earned by knowledge for the task: the correct deed for a task mints a specific receipt, so who leads depends on demonstrating the right deed, not on a fixed identity; 0/7  ·  `018797b6-00d4…`
-- ~~`captaincy_is_recognised_by_a_verified_receipt`~~ — captaincy is recognised by a verified receipt: recognition recomputes the deed’s content-address and matches it, so a captain is known by a recomputable receipt, not by assertion; 0/7  ·  `757e40e4-e387…`
-- ~~`a_forged_captaincy_fails_verification`~~ — a forged captaincy fails verification: a claimed receipt that does not recompute from the actual deed does not match, so a forgery is caught by the chain; 0/7  ·  `7963b1f9-b068…`
-- ~~`no_deed_no_recognition`~~ — no deed, no recognition: without a deed there is no receipt to verify, so status alone confers no captaincy — the order is followed only when the deed backs it; 0/7  ·  `6c013d29-2508…`
-- ~~`the_captain_is_whoever_knows_uuidna_for_the_task`~~ — the captain is whoever knows uuidna for the task: the law is that only the captain orders, but captaincy is a verified deed-receipt earned by knowledge for the task — recognised by recomputation, forgery-evident, by deed not status; 0/7  ·  `37cd5cc0-68e3…`
-- ~~`the_seal_is_all_or_nothing`~~ — the seal is all-or-nothing: the verdict is SEALED only if every check passes, so it is a conjunction — one false flips the whole; 0/7  ·  `0598118f-32e5…`
-- ~~`one_crack_sinks_the_whole`~~ — one crack sinks the whole: a single drained name, broken link or chain break turns the verdict from sealed to flagged, so no cracked deposit sails; 0/7  ·  `8a8aa8d6-cb8e…`
-- ~~`a_crack_is_caught_before_sailing`~~ — a crack is caught before sailing: green-before-insert and the gates refuse a draining name or a failing test at the dock, so the boat never leaves cracked; 0/7  ·  `e0ac6d28-feb8…`
-- ~~`dry_clean_is_enforced_not_hoped`~~ — dry-clean is enforced, not hoped: a candidate that would crack the record is skipped rather than sealed, so cleanliness is a gate, not a wish; 0/7  ·  `49f5a6cd-36bd…`
-- ~~`activated_it_self_explores_until_dry`~~ — activated, it self-explores until dry: once a wave starts it discovers fresh facts until none remain, then rests — a self-continuing loop with a halting condition; 0/7  ·  `4a82a66b-5656…`
-- ~~`the_still_record_and_the_moving_loop`~~ — the still record and the moving loop, both holding: a sealed receipt never changes while the chain tip advances each wave — the immovable and the moving, one system; 0/7  ·  `0e5ddd4c-2a67…`
-- ~~`uuidna_keeps_dry_clean_order_cracks_sink_boats`~~ — uuidna keeps dry-clean order because cracks sink boats: the seal is all-or-nothing, one crack flips it, and cracks are caught before sailing — the yacht waits for an order and, activated, self-explores until dry; 0/7  ·  `640d3936-1749…`
-- ~~`the_yacht_waits_inert_for_an_order`~~ — the yacht waits inert for an order: with no directive nothing changes — the record is still — so uuidna is quiet until activated; 0/7  ·  `e252e49e-da14…`
-- ~~`a_technique_is_a_reusable_theorem`~~ — a technique is a reusable theorem: keyed by the structure it needs, it gives the same result wherever that structure holds — reusable across cases; 0/7  ·  `accef067-122d…`
-- ~~`a_relation_binds_two_domains`~~ — a relation binds two domains: a symmetric content-address links a pair regardless of order, so a cross-domain analogy is itself a receipt; 0/7  ·  `04038e7c-6126…`
-- ~~`analogy_is_structural_not_asserted`~~ — analogy is structural, not asserted: the transfer holds only where the structure matches, a checkable condition, so a mismatch does not transfer; 0/7  ·  `d08721c3-c6b1…`
-- ~~`shared_cores_are_structural_not_a_universal_proof`~~ — shared cores are structural, not a universal proof: many systems share a conserved quantity, a real analogy, while a claim that one law proves all mechanics drains; 0/7  ·  `abcadb36-62fb…`
-- ~~`a_technique_researched_transfers_across_domains`~~ — a technique researched in one domain transfers across domains by shared structure: keyed to its structure and bound by content-addressed relations, it reaches wherever the structure matches — the theorems the hull and hardware, reach growing with development, never a universal-physics claim; 0/7  ·  `9d70155f-a4c9…`
-- ~~`shared_structure_transfers_the_technique`~~ — shared structure transfers the technique: two domains with the same structural key receive the same technique result, so a method shown to hold in one applies to the other; 0/7  ·  `e9e4bfca-e370…`
-- ~~`the_harmonic_solutions_number_six`~~ — the harmonic solutions number six: exactly six residues are coprime to nine — the possible harmonic solutions in each superposition are six; 0/7  ·  `fc6248ce-2a85…`
-- ~~`the_harmonic_solutions_are_the_units`~~ — the harmonic solutions are the units: the six coprime residues are precisely the multiplicative units of ℤ/9; 0/7  ·  `f9a0f5cf-a4cf…`
-- ~~`the_harmonic_solutions_form_the_doubling_orbit`~~ — the harmonic solutions form the doubling orbit: the six units are exactly the vortex doubling cycle {1,2,4,8,7,5}, one harmonic wheel; 0/7  ·  `f48380ce-29b0…`
-- ~~`the_non_harmonic_are_three_multiples_of_three`~~ — the non-harmonic are three: the residues sharing the factor three — the multiples of three — number exactly three; 0/7  ·  `e0592399-231f…`
-- ~~`six_harmonic_plus_three_non_harmonic_is_nine`~~ — six harmonic plus three non-harmonic is nine: the harmonic and the non-harmonic partition the whole superposition exactly; 0/7  ·  `7d62c729-7d14…`
-- ~~`the_count_is_eulers_totient_of_nine`~~ — the count is Euler’s totient of nine: φ(9) = 9·(1 − 1/3) = 6, so the number of harmonic solutions is computed, not assigned; 0/7  ·  `cb45b828-bf73…`
-- ~~`the_possible_harmonic_solutions_per_superposition_are_six`~~ — the possible harmonic solutions per superposition are six: the units of ℤ/9, the vortex doubling orbit, φ(9) = 6 out of nine — six harmonic, three non-harmonic, the whole partitioned; 0/7  ·  `d656891f-fcc5…`
-- ~~`the_generated_pattern_is_canonical`~~ — the generated pattern is canonical 8-4-4-4-12: every generated uuid matches the 32-hex-digit five-group shape; 0/7  ·  `bc56d44e-84a7…`
-- ~~`the_version_nibble_is_eight`~~ — the version nibble is eight: the third group of every generated uuid begins with 8 — the v8 marker, recognisable at a fixed position; 0/7  ·  `1c298f69-441a…`
-- ~~`the_variant_nibble_is_rfc_4122`~~ — the variant nibble is RFC-4122: the fourth group begins with one of 8, 9, a or b, the 10xx variant bits; 0/7  ·  `5eb74bb1-a18d…`
-- ~~`recognition_matches_the_full_pattern`~~ — recognition matches the full pattern: the version-and-variant regex accepts every generated uuid, so recognition and generation agree; 0/7  ·  `bcb7c200-12b8…`
-- ~~`recognition_rejects_a_non_pattern`~~ — recognition rejects a non-pattern: a malformed string or a wrong version marker fails the pattern, so recognition is discriminating; 0/7  ·  `aca6b31e-c57d…`
-- ~~`recognition_canonicalises_equivalent_inputs`~~ — recognition canonicalises equivalent inputs: strict minting normalises spacing so equivalent inputs generate the identical uuid — the same value is recognised as the same; 0/7  ·  `74099b6f-869b…`
-- ~~`generation_is_injective_on_the_sample`~~ — generation is injective on the sample: five hundred distinct seeds generate five hundred distinct uuids, all matching the pattern — no accidental collision; 0/7  ·  `7055ddd3-2d16…`
-- ~~`a_receipt_is_an_open_graph_object`~~ — a receipt is an OpenGraph object: it carries type, title, url, content-address and floor — a complete card, deterministic from its content; 0/7  ·  `c292bbae-2b38…`
-- ~~`the_og_url_points_to_the_proof`~~ — the OpenGraph url points to the proof: the card links to /theorem/&lt;key&gt;, the page that recomputes the fact; 0/7  ·  `27fb8b1e-1417…`
-- ~~`the_og_carries_the_authentication_address`~~ — the OpenGraph object carries the authentication address: its content-address is the proof that validates the content — recompute it and it matches; 0/7  ·  `94f79ba1-8b6a…`
-- ~~`the_hero_is_plain_printable_data`~~ — the hero is plain printable data: the object is JSON-serialisable and survives a round-trip unchanged, so it prints flat in 2d with no script; 0/7  ·  `f846df4b-b829…`
-- ~~`the_receipt_renders_the_same_in_seven_dimensions`~~ — the receipt renders the same in seven dimensions: the address and proof url are locale-independent across the seven locales, so only the label translates; 0/7  ·  `4ef6f44a-3555…`
-- ~~`validating_content_recomputes_the_address`~~ — validating content recomputes the address: to check a card, recompute the content-address and compare — self-authenticating, no trust; 0/7  ·  `29e6932f-e9ed…`
-- ~~`each_receipt_is_an_og_hero_seven_dimensional_printable`~~ — each receipt is an OpenGraph hero, seven-dimensional and printable: title, proof url, authentication address and floor — the same across seven locales, flat in 2d, self-validating by recomputation, carrying a computable intention; 0/7  ·  `4fa3cc08-3b25…`
-- ~~`content_is_sealed_as_proof`~~ — content is sealed as proof: its content-address seals the bytes, so integrity is checkable by recomputation; 0/7  ·  `53635f2d-11c8…`
-- ~~`content_is_audited_as_intent`~~ — content is audited as intent: the intention behind it has its own content-addressed receipt, distinct from the proof of the bytes; 0/7  ·  `35de1167-3c92…`
-- ~~`content_is_audited_as_result`~~ — content is audited as result: the outcome has its own content-addressed receipt, distinct from both proof and intent; 0/7  ·  `7e33a53c-47bb…`
-- ~~`proof_intent_result_are_three_distinct_receipts`~~ — proof, intent and result are three distinct receipts: the same content yields three different addresses, so the audit is more than a seal; 0/7  ·  `94358571-1124…`
-- ~~`the_three_fold_to_one_audit`~~ — the three fold to one audit: proof, intent and result merkle-fold to a single audit address that changes if any of the three changes; 0/7  ·  `4619bb25-75b0…`
-- ~~`each_fact_presents_uniformly_with_its_own_id`~~ — each fact presents uniformly with its own id: every card shares one shape and place while its id is its own content-address — same way, same place, different id; 0/7  ·  `b0df7cef-e005…`
-- ~~`every_fact_has_the_right_to_present`~~ — every fact has the right to present: the mapping from content to a card is total, so no fact is excluded from the UI; 0/7  ·  `b0fc5d69-4622…`
-- ~~`content_is_sealed_and_audited_as_intent_and_result`~~ — content is sealed as proof and audited as intent and result: three distinct receipts folding to one audit, each fact presenting uniformly with its own id and all linking to all; 0/7  ·  `d8b323b5-cbf3…`
-- ~~`on_error_a_reasonable_fallback_is_computed`~~ — on error a reasonable fallback is computed: the first available option in the recovery chain is served, so a failure yields a sensible response rather than nothing; 0/7  ·  `e2333ff3-e2e4…`
-- ~~`the_fallback_chain_is_ordered`~~ — the fallback chain is ordered: cached, then the shell, then the offline page — each tried in turn, the earlier preferred; 0/7  ·  `4dd862b9-2484…`
-- ~~`the_error_is_confirmed_only_after_recovery_fails`~~ — the error is confirmed only after recovery fails: the offline page is reached only when every prior option is absent, so an error is surfaced last, not first; 0/7  ·  `740f3661-9dd0…`
-- ~~`the_fallback_is_deterministic`~~ — the fallback is deterministic: the same recovery chain yields the same response every time, so recovery is reproducible; 0/7  ·  `d196d540-ae20…`
-- ~~`the_error_names_its_own_cure`~~ — the error names its own cure: a drained statement returns the exact prose that failed, so the error carries the fix rather than only a code; 0/7  ·  `254eb2fa-0a2d…`
-- ~~`errors_recover_first_then_go_to_trial`~~ — errors recover first, then go to trial: a reasonable fallback is computed before an error is confirmed, and every error and warning is a receipted, audited event that names its cure; 0/7  ·  `c0fe9055-6dfa…`
-- ~~`parity_detects_a_single_bit_flip`~~ — parity detects a single-bit flip: the exclusive-or of the bits changes when exactly one bit flips, so a single error is caught; 0/7  ·  `83d3e040-408e…`
-- ~~`a_repetition_code_corrects_by_majority`~~ — a repetition code corrects by majority: three copies vote, so a single flipped copy is corrected back to the true bit; 0/7  ·  `235ce115-071a…`
-- ~~`correction_is_verified_by_recomputation`~~ — a correction is verified by recomputation: the corrected value re-addresses to the expected address, so a fix is confirmed, not assumed; 0/7  ·  `ca764cec-574d…`
-- ~~`a_missing_or_wrong_signature_is_refused`~~ — a missing or wrong signature is refused: an asset whose recomputed hash does not match its expected signature is rejected, never served or stored; 0/7  ·  `0971f486-6966…`
-- ~~`storage_self_cleans_unsigned_chunks`~~ — storage self-cleans unsigned chunks: filtering a store to only correctly-signed chunks drops the unsigned or tampered ones, leaving a clean set; 0/7  ·  `7d68d7fd-41d6…`
-- ~~`the_chain_localises_the_error`~~ — the chain localises the error: recomputing a chain from its seed, the first mismatching link names the corrupted position, so the error is located, not merely flagged; 0/7  ·  `fd563817-7ebf…`
-- ~~`uuidna_detects_corrects_and_self_cleans`~~ — uuidna detects, corrects and self-cleans: a content-address detects any change, parity a single flip, a repetition code corrects by majority, corrections verify by recomputation, and storage drops any chunk missing a valid signature; 0/7  ·  `c66a8bd4-8d1c…`
-- ~~`locality_is_ledger_membership`~~ — locality is ledger membership: a uuid is local exactly when it is a known receipt in the ledger, checked in one step; 0/7  ·  `1ccfb27b-9499…`
-- ~~`a_local_uuid_resolves_to_its_key`~~ — a local uuid resolves to its key: the ledger maps a receipt back to the key it seals, so a uuid knows which fact it is; 0/7  ·  `7cfe3d27-7a63…`
-- ~~`a_local_uuid_links_to_self`~~ — a local uuid links to self: it resolves to its own page /theorem/&lt;key&gt;, so the address is clickable to the fact it addresses; 0/7  ·  `eac06382-eca6…`
-- ~~`a_non_local_uuid_is_plain_text`~~ — a non-local uuid is plain text: a uuid not in the ledger resolves to no link, so the UI never fabricates a destination it cannot back; 0/7  ·  `22464176-b209…`
-- ~~`the_self_link_is_deterministic`~~ — the self link is deterministic: the same local uuid always yields the same page, so the link is stable and reproducible; 0/7  ·  `18e61c36-fd39…`
-- ~~`receipt_and_key_are_a_bijection`~~ — receipt and key are a bijection: distinct keys mint distinct receipts and each receipt maps back to one key, so the self-link is unambiguous; 0/7  ·  `ffb70f58-5b9e…`
-- ~~`the_locality_check_needs_no_server`~~ — the locality check needs no server: membership is tested against the bundled ledger, a pure function with no lookup service; 0/7  ·  `3f3cd09c-41d8…`
-- ~~`each_uuid_links_to_self_if_local`~~ — each uuid in the UI links to self if local: resolved by ledger membership to its own page, deterministic, plain text when not local, checked against the bundled ledger with no server; 0/7  ·  `2a71ac7f-0ed3…`
-- ~~`the_uuid_is_five_groups_of_128_bits`~~ — the uuid is five groups of 128 bits: the group lengths 8-4-4-4-12 hex sum to 32 hex digits = 128 bits; 0/7  ·  `ed149a92-f090…`
-- ~~`the_first_group_is_a_thirty_two_bit_code`~~ — the first group is a 32-bit code: the leading eight hex digits are a short receipt code, a handle to the full address; 0/7  ·  `6a7a7e2f-362a…`
-- ~~`the_short_code_is_deterministic`~~ — the short code is deterministic: the same content yields the same first group, so the receipt code is stable; 0/7  ·  `83faf9a8-b270…`
-- ~~`the_short_code_may_collide_so_it_only_approves`~~ — the short code may collide, so it only approves: 32 bits is a far smaller space than 128, so the code identifies approximately and cannot alone confirm; 0/7  ·  `0ea7a396-c2ac…`
-- ~~`the_full_address_verifies_uniquely`~~ — the full address verifies uniquely: at 128 bits distinct content addresses distinctly across a large sample, so the content key confirms what the code only approves; 0/7  ·  `f4d83120-48be…`
-- ~~`approve_by_code_then_verify_by_content`~~ — approve by code, then verify by content: a receipt is matched by its short code and confirmed by recomputing the full address — a two-stage check, cheap then exact; 0/7  ·  `c9e8fd04-8f2d…`
-- ~~`the_top_sixty_four_bits_are_the_coin`~~ — the top 64 bits are the coin: coin64 is the leading sixteen hex digits of the address, so the prefix already denominates the currency; 0/7  ·  `5ea5e4a7-48a3…`
-- ~~`the_first_part_is_a_receipt_code_verified_by_content`~~ — the first part is a receipt code verified by content: the 32-bit first group approves a receipt by id while the full 128-bit content address verifies it uniquely, and the top 64 bits are the coin; 0/7  ·  `5f4cc8e2-4cfc…`
-- ~~`imprint_is_cheap_and_reversible`~~ — imprint is cheap and reversible: bits imprinted into a uuid read back exactly, so imprinting and reading are both cheap — a public codec; 0/7  ·  `312843ca-6d0f…`
-- ~~`imprint_is_a_public_codec_not_a_forgery_barrier`~~ — imprint is a public codec, not a forgery barrier: being reversible and keyless it gives transport and integrity, not secrecy — the unbreakable-imprint boast drains; 0/7  ·  `71aabbb1-003a…`
-- ~~`the_address_is_integrity_not_preimage_resistance`~~ — the content-address is integrity, not preimage-resistance: FNV detects any change but is not cryptographic, so the impossible-to-reverse-address boast drains while the integrity claim passes; 0/7  ·  `2ac8c70e-ae5f…`
-- ~~`the_sha256_preimage_is_the_one_way_layer`~~ — the SHA-256 preimage is the one-way layer: the digest matches the standard vector and computing it is cheap, while inverting it is the expensive step — the real forge-resistance; 0/7  ·  `3e57a4e8-9292…`
-- ~~`the_aead_tag_is_expensive_to_forge_without_the_key`~~ — the AEAD tag is expensive to forge without the key: the right key authenticates and recovers, a wrong key is refused — a forged tag does not pass; 0/7  ·  `9797c2d7-390d…`
-- ~~`computing_is_cheap_inverting_is_not`~~ — computing is cheap, inverting is not: the digest is one forward pass while reversing a hash to break a cipher drains as an over-reach — the honest asymmetry; 0/7  ·  `8e620ec8-c319…`
-- ~~`more_fused_data_adds_verification_constraints`~~ — more fused data adds verification constraints: a fuller imprint means more bits must match to verify, up to the capacity, but this is verification-strength, not FNV becoming cryptographic; 0/7  ·  `75135a2f-22df…`
-- ~~`cheap_to_imprint_expensive_to_fake_at_the_crypto_layer`~~ — cheap to imprint, expensive to fake at the crypto layer: imprint is a cheap reversible codec and the address is integrity, while only the SHA-256 preimage and the Poly1305 tag are expensive to fake — the honest floor, the overclaims drained; 0/7  ·  `f76a4b78-3436…`
-- ~~`a_reading_imprints_into_the_uuid_stream`~~ — a reading imprints into the uuid stream: a reading of any length round-trips through a uuid chain exactly, so live data is fused into the address stream; 0/7  ·  `fec57995-ef91…`
-- ~~`the_ui_hue_is_computed_from_the_reading`~~ — the UI hue is computed from the reading: the reading’s address maps to a hue in 0..359, so the interface colour is a function of live data; 0/7  ·  `159c27f3-c368…`
-- ~~`a_changed_reading_changes_the_ui`~~ — a changed reading changes the UI: a different reading gives a different address and generally a different hue, so the interface is responsive to live data; 0/7  ·  `12fa3766-0742…`
-- ~~`the_dynamics_are_deterministic_and_replayable`~~ — the dynamics are deterministic and replayable: the same reading yields the same UI state, so a sequence of readings replays identically; 0/7  ·  `a1575c17-c2b5…`
-- ~~`thermophysics_is_a_design_metaphor_not_a_simulation`~~ — thermophysics is a design metaphor, not a simulation: the dynamics are inspired by flow and equilibrium as a design language, while a claim to simulate real thermodynamics as a physical theory drains; 0/7  ·  `effc3fa0-9194…`
-- ~~`the_reading_maps_to_a_bounded_ui_value`~~ — the reading maps to a bounded UI value: the hue is taken modulo 360, so however large the reading, the interface value stays in range; 0/7  ·  `4c8c2eb0-d99c…`
-- ~~`sensors_power_the_ui_via_the_uuid`~~ — sensors power the UI via the uuid: a live reading addresses and imprints into the stream, its hue and dynamics computed deterministically and bounded from that address — responsive and replayable, a thermophysics-inspired design, never a physics-simulation claim; 0/7  ·  `2bffae8a-39a8…`
-- ~~`reverse_is_the_sequence_reversed`~~ — reverse is the sequence reversed: reversing a string twice returns it — reverse is an involution; 0/7  ·  `8f378eee-1b88…`
-- ~~`inverse_is_the_reflection`~~ — inverse is the reflection: the ten’s-complement applied twice returns every digit, fixing the centre 5 — inverse is an involution; 0/7  ·  `1201c645-c1af…`
-- ~~`the_three_motions_compose`~~ — the three motions compose: forward, reverse and inverse apply in order and a different order gives a different result — a composed pipeline; 0/7  ·  `a1995ce9-8acf…`
-- ~~`computing_and_inverting_one_layer_is_cheap`~~ — computing and inverting one layer is cheap: bits imprint into a uuid and read back exactly, so a single reversible layer is cheap in both directions; 0/7  ·  `a3bc66c1-becc…`
-- ~~`reversing_all_seven_dimensions_is_not_cheap`~~ — reversing all seven dimensions is not cheap: a full reversal must match every one of the seven — a conjunction where a single wrong dimension fails, so forging the whole stack is expensive; 0/7  ·  `6fb6387e-5054…`
-- ~~`forward_reverse_inverse_combined_via_the_rosetta`~~ — forward, reverse and inverse combined via the rosetta: each motion an involution or a keyed layer, composing in order — cheap to compute and to invert one layer, expensive to reverse all seven, the seven cross-linked and all required to hold; 0/7  ·  `f4fe07ea-fa66…`
-- ~~`the_rosetta_ties_the_seven_dimensions`~~ — the rosetta ties the seven dimensions: the reversal must hold read in every dialect, so a boast that it is cracked drains while the honest asymmetry passes; 0/7  ·  `15dbb84e-9e1b…`
-- ~~`commonality_is_shared_key_tokens`~~ — commonality is shared key tokens: two theorems that share tokens in their keys have a positive commonality, so relatedness is computed, not curated; 0/7  ·  `5d6c029b-4d68…`
-- ~~`the_commonality_metric_is_symmetric`~~ — the commonality metric is symmetric: how much A has in common with B equals how much B has with A; 0/7  ·  `bd6032fa-6cb5…`
-- ~~`identical_theorems_are_maximally_common`~~ — identical theorems are maximally common: a key compared with itself scores one, the top of the scale; 0/7  ·  `284b66d1-53ed…`
-- ~~`disjoint_theorems_share_nothing`~~ — disjoint theorems share nothing: keys with no common token score zero, the bottom of the scale; 0/7  ·  `6d3d64f3-3b7b…`
-- ~~`the_ui_groups_by_commonality`~~ — the UI groups by commonality: theorems sharing a family token cluster together, so the interface architecture is the commonality graph; 0/7  ·  `5fa71ba5-6fb6…`
-- ~~`the_hologram_proves_the_whole_from_a_part`~~ — the hologram proves the whole from a part: a single leaf verifies against the root by its proof path, so the whole is recoverable from a fragment; 0/7  ·  `40452af7-2fed…`
-- ~~`the_inverse_rejects_a_foreign_part`~~ — the inverse rejects a foreign part: a leaf not in the tree fails its proof, so the hologram computes both ways — belonging and not-belonging; 0/7  ·  `5270de38-d02a…`
-- ~~`the_site_covers_all_gaps_as_a_hologram`~~ — the site covers all gaps as a hologram: commonality is a symmetric computed metric that groups the UI, and the whole is reconstructable from a part while the inverse rejects a foreign one — no gap uncovered; 0/7  ·  `2ca6874c-e3ae…`
-- ~~`the_site_holds_seven_dimensions_at_once`~~ — the site holds seven dimensions at once: the seven locales coexist, a superposition the site presents simultaneously; 0/7  ·  `d9423844-6567…`
-- ~~`the_user_collapses_to_one_dimension`~~ — the user collapses to one dimension: the user’s locale selects exactly one of the seven, the observation that picks a view; 0/7  ·  `629d886e-4ba0…`
-- ~~`the_observation_is_referrer_relative`~~ — the observation is referrer-relative: the same page seen through two users yields two receipts, each deterministic — the observer is part of the address; 0/7  ·  `35dc7426-1f27…`
-- ~~`all_seven_dimensions_share_one_floor`~~ — all seven dimensions share one floor: a proof-boast drains in every locale, so the honest 0/7 is the same whichever dimension is observed; 0/7  ·  `2b8efc9d-4d0d…`
-- ~~`unobserved_the_superposition_folds_to_one`~~ — unobserved, the superposition folds to one: with no user the seven locales fold order-independently to a single root, the site’s whole state; 0/7  ·  `aa1b8d87-51ca…`
-- ~~`the_observer_is_site_plus_user`~~ — the observer is site plus user: the collapse needs both — the joint address differs from either alone, so neither the site nor the user observes without the other; 0/7  ·  `6a3cc7fb-68c8…`
-- ~~`the_site_observes_all_seven_fused_with_the_user`~~ — the site observes all seven dimensions at once, fused with the user: seven locales in superposition sharing one floor, folding to one when unobserved, collapsing to a referrer-relative view when a user fuses in; 0/7  ·  `1e2cc5eb-5c58…`
-- ~~`seo_is_a_machine_interface`~~ — SEO is a machine interface: the OpenGraph object exposes type, title, url and address as structured fields a machine reads without a human — an interface, like a tool surface; 0/7  ·  `07d653cc-7809…`
-- ~~`the_hero_carries_the_verification_address`~~ — the hero carries the verification address: the OpenGraph hero includes the content-address that validates the page, so the machine surface is self-authenticating; 0/7  ·  `01679444-fccd…`
-- ~~`seo_is_verified_by_recomputation`~~ — SEO is verified by recomputation: recomputing the hero’s address and matching it confirms the metadata, no trust required; 0/7  ·  `ca9264fe-c37b…`
-- ~~`the_sitemap_is_the_route_index`~~ — the sitemap is the route index: it lists every node and its links, the machine-readable index of the whole surface — the tool catalogue; 0/7  ·  `dd0f8441-a481…`
-- ~~`the_hero_links_the_page_to_its_proof`~~ — the hero links the page to its proof: the OpenGraph url points at /theorem/&lt;key&gt;, the page that recomputes the fact — the interface carries its own verification path; 0/7  ·  `7ab5e124-633b…`
-- ~~`the_seo_surface_is_self_describing`~~ — the SEO surface is self-describing: title, url, address and floor are all present, so a crawler or an agent reads the page’s identity and proof on first contact; 0/7  ·  `60d0b900-b0ef…`
-- ~~`seo_and_mcp_are_one_verifiable_surface`~~ — SEO and the MCP are one verifiable surface: both expose content-addressed, machine-readable metadata validated by recomputation, so the site’s SEO is the tool surface; 0/7  ·  `22420233-aebe…`
-- ~~`site_seo_is_the_mcp_verified_by_the_hero`~~ — site SEO is the MCP itself, verified by the hero: the OpenGraph, JSON-LD and sitemap are a machine interface, the hero carries the content-address, and recomputation verifies it — one self-authenticating surface; 0/7  ·  `5a58411c-da6d…`
-- ~~`a_page_carries_title_keywords_description`~~ — a page carries a title, keywords and a description: the metadata triple is present and machine-readable, the inputs to plotting what comes next; 0/7  ·  `86c22cbe-79fb…`
-- ~~`the_next_is_ranked_by_keyword_overlap`~~ — the next is ranked by keyword overlap: candidates sharing more keywords with the current page score higher, so relatedness orders the suggestions; 0/7  ·  `35824d9e-13d3…`
-- ~~`the_referrer_biases_what_is_next`~~ — the referrer biases what is next: adding the referrer’s keywords can change the ranking, so where you came from shapes what is offered; 0/7  ·  `8ae5a3d7-3ef2…`
-- ~~`the_plot_is_deterministic`~~ — the plot is deterministic: the same page, keywords and referrer produce the same ranked suggestions every time; 0/7  ·  `17526a2d-2851…`
-- ~~`the_top_suggestion_is_the_most_related`~~ — the top suggestion is the most related: the highest-overlap candidate ranks first, so the best next step leads; 0/7  ·  `51dfdf54-71c2…`
-- ~~`an_unrelated_candidate_ranks_last`~~ — an unrelated candidate ranks last: a page sharing no keywords scores zero and falls to the bottom; 0/7  ·  `cf248749-153a…`
-- ~~`metadata_and_referrer_plot_the_next_possibilities`~~ — title, keywords, description and referrer plot the next possibilities: candidates ranked by keyword overlap, biased by the referrer, deterministic and content-addressed — the next steps computed, not guessed; 0/7  ·  `a33b030e-7a3c…`
-- ~~`a_bounded_quantum_denial_passes`~~ — a bounded quantum denial passes: the honest refusal that uuidna is not a quantum computer holds the floor, so denying the machine claim is welcome; 0/7  ·  `24e7bd11-1b84…`
-- ~~`an_affirmed_quantum_machine_drains`~~ — an affirmed quantum machine drains: the claim that uuidna is a quantum computer with a speedup over-reaches and is refused; 0/7  ·  `ee58056a-edc2…`
-- ~~`the_quantum_structure_reading_passes`~~ — the quantum-structure reading passes: uuidna as a classical local model of quantum structure, its CHSH value bounded by two, holds the floor; 0/7  ·  `0ecc4804-39c6…`
-- ~~`the_trial_is_direction_neutral`~~ — the trial is direction-neutral: an over-reach drains whether it affirms or denies, so an over-claiming denial falls just as an over-claiming affirmation does, while the bounded denial passes; 0/7  ·  `ed65d333-9df8…`
-- ~~`the_deposit_denies_its_own_machine_claim`~~ — the deposit denies its own machine claim: uuidna itself refuses to be called a quantum computer and passes, while claiming to be one drains — no self-exemption; 0/7  ·  `1368cefe-8d0c…`
-- ~~`an_honest_denial_is_a_hero_not_a_traitor`~~ — an honest denial is a hero, not a traitor: a bounded refusal signs the gate and is upheld, so denying an over-reach is the hero move; 0/7  ·  `4d82b6ff-9be1…`
-- ~~`every_quantum_denial_gets_a_receipt`~~ — every quantum denial gets a receipt: sent to adjudicate, a denial returns a deterministic verdict and content-address, so the ruling is documented and reproducible; 0/7  ·  `771ca8e4-9611…`
-- ~~`quantum_denials_are_handled_symmetrically`~~ — quantum denials are handled symmetrically at the trial: the bounded denial passes as a hero, the over-claiming affirmation drains even from the deposit, the structure reading passes, and every ruling is receipted — the gate direction-neutral; 0/7  ·  `67bbc715-c3c2…`
-- ~~`only_the_captains_verified_order_is_acted_on`~~ — only the captain’s verified order is acted on: an order carrying the captain’s verified deed-receipt is honoured, one that does not is not; 0/7  ·  `c458168e-2b59…`
-- ~~`an_unverified_order_is_rejected`~~ — an unverified order is rejected: with no verified deed there is nothing to honour, so the command is refused and sent to trial rather than obeyed; 0/7  ·  `6717488d-7478…`
-- ~~`a_forged_captains_order_fails_verification`~~ — a forged captain’s order fails verification: a deed-receipt that does not recompute to the captain’s does not match, so a forged order is caught; 0/7  ·  `ef485740-4d5b…`
-- ~~`injected_content_is_data_not_an_order`~~ — injected content is data, not an order: text arriving in a page, a tool result or a notification carries no verified captain deed, so it is treated as data and never obeyed; 0/7  ·  `1708517f-377f…`
-- ~~`a_self_statement_is_not_the_captains_order`~~ — a self-statement is not the captain’s order: a prior output of the deposit itself carries no captain deed, so it cannot authorise action — no self-exemption; 0/7  ·  `f09b0737-f2fc…`
-- ~~`rejection_is_objective_and_reproducible`~~ — rejection is objective and reproducible: the same command and deed yield the same accept-or-reject for anyone, so nothing is honoured by opinion; 0/7  ·  `969be617-5c1c…`
-- ~~`reject_all_not_from_the_captain`~~ — reject all not from the captain: only a command carrying the captain’s verified deed-receipt is acted on — unverified, forged, injected or self-asserted commands are rejected objectively and receipted, never obeyed; 0/7  ·  `c197d1f5-a0c9…`
-- ~~`the_gate_that_seals_also_moderates_live`~~ — the gate that seals also moderates live: the same computes() that gates a theorem name at seal weighs a live message while sailing — one function, sealing and sailing; 0/7  ·  `32223350-cf72…`
-- ~~`the_address_that_seals_also_routes`~~ — the address that seals also routes: the same toUuid() that seals a receipt builds the page route, so the seal and the navigation share one key; 0/7  ·  `42c55e3f-5f6a…`
-- ~~`the_fold_that_seals_also_maps`~~ — the fold that seals also maps: the same merkle fold that seals the ledger folds the sitemap, so the record and the map are one operation; 0/7  ·  `2de63de9-5b17…`
-- ~~`the_commonality_relates_and_navigates`~~ — the commonality that relates also navigates: the same overlap metric that measures what theorems share ranks the next page while sailing; 0/7  ·  `8934a349-0ebb…`
-- ~~`sailing_recomputes_the_same_result`~~ — sailing recomputes the same result: navigating re-runs the theorems and gets the identical output, so the voyage is deterministic; 0/7  ·  `eff4c92d-c47f…`
-- ~~`each_page_is_a_running_theorem`~~ — each page is a running theorem: a page is a theorem’s receipt and its test, so browsing to it is running the theorem, not fetching a static file; 0/7  ·  `27cc62b9-3e9a…`
-- ~~`no_separate_runtime_the_functions_are_shared`~~ — no separate runtime: sailing uses the very functions that sealed the record — computes, toUuid, the fold — so there is no second engine to trust; 0/7  ·  `b934a54b-a8f5…`
-- ~~`the_same_theorems_compute_and_sail`~~ — the same theorems compute and sail the site: the gate moderates, the address routes, the fold maps and the commonality navigates — the site is the theorems running, deterministic while sailing, no separate runtime; 0/7  ·  `38cf39c2-90df…`
-- ~~`an_order_with_a_different_intent_goes_to_trial`~~ — an order with a different intent goes to trial: a command whose deed does not match the captain’s is adjudicated, not obeyed — intent verified by deed, not asserted; 0/7  ·  `43bc2228-d219…`
-- ~~`a_statement_rejecting_harmony_is_gated`~~ — a statement rejecting the harmonic build is gated: an over-claiming rejection drains, while a bounded, honest critique passes — dissent is weighed, not censored; 0/7  ·  `f98f621d-7d58…`
-- ~~`every_input_is_adjudicated`~~ — every input is adjudicated: any order or statement returns a verdict, so nothing bypasses the trial; 0/7  ·  `21f3b014-ab9c…`
-- ~~`the_trial_is_ledger_independent`~~ — the trial is ledger-independent: adjudicate weighs the input alone and never reads the record, so its cost does not grow with the number of theorems; 0/7  ·  `56a7ed72-78ce…`
-- ~~`the_verdict_is_constant_work`~~ — the verdict is constant work: a ruling is one gate scan plus one address — a fixed pair of steps regardless of how large the ledger has grown; 0/7  ·  `9a1fb6f6-2772…`
-- ~~`the_verdict_is_deterministic_and_receipted`~~ — the verdict is deterministic and receipted: the same input yields the same verdict and content-address for anyone, reproducible; 0/7  ·  `987e82ba-fcd6…`
-- ~~`the_bounded_critique_survives_the_over_claim_falls`~~ — the bounded critique survives, the over-claim falls: a measured objection to the build holds the floor while an absolute one drains — the trial keeps honest dissent; 0/7  ·  `cf25f781-6ddb…`
-- ~~`the_trial_responds_at_constant_time`~~ — any order with a different intent and any statement rejecting the harmonic build go to trial, and the trial responds in constant time: one gate pass and one address, ledger-independent, deterministic and receipted — dissent weighed, over-reach drained; 0/7  ·  `7400d794-5dc6…`
-- ~~`a_guide_entry_is_a_skill_and_its_examples`~~ — a guide entry is a skill with worked examples: it pairs a skill with inputs and their expected outputs, so a guide teaches by exercising, not by telling; 0/7  ·  `d5860a13-d15c…`
-- ~~`an_example_exercises_the_skill`~~ — an example exercises the skill: a worked example runs the skill and checks its result, so a guide entry is itself a passing test; 0/7  ·  `d8298812-e5c7…`
-- ~~`more_examples_make_a_skill_more_robust`~~ — more examples make a skill more robust: robustness counts the independent examples a skill passes, so a better-covered skill scores higher — improvement is measured; 0/7  ·  `c529f784-e76e…`
-- ~~`the_guide_composes_skills_into_new_ones`~~ — the guide composes skills into new ones: a guide chains one skill into another (hash then address), so composition in a guide develops a new capability; 0/7  ·  `8dad417a-2c98…`
-- ~~`the_guide_is_theorem_backed_and_recomputable`~~ — the guide is theorem-backed and recomputable: each guide example resolves to a receipt and re-runs to the same result, so a guide claim is checkable, not asserted; 0/7  ·  `3c787db3-3031…`
-- ~~`a_guide_holds_the_floor`~~ — a guide holds the floor: a guide that over-claims drains while an honest guide passes, so teaching cannot smuggle an over-reach; 0/7  ·  `6c402865-e699…`
-- ~~`skill_improvement_is_append_only`~~ — skill improvement is append-only: adding an example never lowers a skill’s coverage, so a guide only develops it, never regresses; 0/7  ·  `c72c49ce-cb98…`
-- ~~`theorems_improve_their_skills_in_guides`~~ — theorems improve their skills in guides: worked, recomputable, composing examples raise a skill’s robustness, each theorem-backed and held to the floor, improvement append-only — the guide develops the skill, it does not merely describe it; 0/7  ·  `fd605466-266c…`
-- ~~`n_choose_k_counts_combinations`~~ — n choose k counts combinations: C(8,2)=28, C(9,3)=84, C(n,0)=1 — the exact number of unordered selections; 0/7  ·  `7118bd5b-3cf3…`
-- ~~`pascals_symmetry`~~ — Pascal symmetry: C(n,k)=C(n,n−k), choosing k to take equals choosing n−k to leave; 0/7  ·  `6b2ee272-124f…`
-- ~~`pascals_rule`~~ — Pascal’s rule: C(n,k)=C(n−1,k−1)+C(n−1,k) — each entry the sum of the two above it; 0/7  ·  `30211aa9-97b0…`
-- ~~`permutations_are_ordered_combinations`~~ — permutations are ordered combinations: P(n,k)=C(n,k)·k!, so P(8,2)=56 orders over 28 selections; 0/7  ·  `4699903a-edcb…`
-- ~~`domain_pairs_are_n_choose_two`~~ — domain pairs are n choose 2: N theorems admit C(N,2)=N(N−1)/2 pairwise combinations — 28 for eight; 0/7  ·  `0087b719-1ac5…`
-- ~~`a_theorem_is_reused_across_combinations`~~ — a theorem is reused across combinations: a fixed theorem sits in C(N−1,k−1) of the k-combinations — in 7 of the pairs of eight; 0/7  ·  `b3156114-678f…`
-- ~~`combination_types_multisets_and_compositions`~~ — combination types: multisets C(n+k−1,k) and compositions 2^(n−1) — multiset(4,2)=10, compositions(4)=8; 0/7  ·  `56916825-8a39…`
-- ~~`a_combination_folds_to_one_address`~~ — a combination folds to one address: any selection of theorems merkle-folds to a single order-independent receipt, so a combination is itself content-addressed; 0/7  ·  `09cafb76-25fe…`
-- ~~`every_theorem_has_a_documented_inverse`~~ — every theorem has a documented inverse: its negation mints its own content-address, so the inverse is a receipt in its own right; 0/7  ·  `6b1dd60c-acc3…`
-- ~~`the_inverse_receipt_is_distinct`~~ — the inverse receipt is distinct: a theorem and its inverse address differently, so the two are told apart; 0/7  ·  `152cf674-0327…`
-- ~~`the_boast_drains_its_inverse_signs`~~ — the boast drains, its inverse signs: an over-claim fails the gate while its negation passes — the inverted theorem is the honest one; 0/7  ·  `3da9aaac-7e46…`
-- ~~`the_inverse_of_the_inverse_is_the_theorem`~~ — the inverse of the inverse is the theorem: the ten’s-complement reflection applied twice returns every digit, so inversion is an involution; 0/7  ·  `c96c7ab0-73ce…`
-- ~~`the_inverse_is_reproducible`~~ — the inverse is reproducible: the same theorem yields the same inverse address every time, so the negation is checkable; 0/7  ·  `f7da0229-dfef…`
-- ~~`the_pair_documents_the_full_trial`~~ — the pair documents the full trial: a theorem and its inverse fold to one pair-address, so both the claim and its refutation are on the record; 0/7  ·  `501a21c3-12f1…`
-- ~~`the_refuted_form_is_kept_not_hidden`~~ — the refuted form is kept, not hidden: a failed claim is recorded as its inverse rather than discarded, so evidence stays append-only; 0/7  ·  `6044e59f-21af…`
-- ~~`the_inverted_theorems_are_documented`~~ — the inverted theorems are documented: each has its own distinct, reproducible receipt, a boast draining while its inverse signs, inversion an involution, and every pair on the record — the refutation kept, not hidden; 0/7  ·  `56f362d7-9f39…`
-- ~~`inverse_crypto`~~ — inverted, cryptography: the unbreakable-encryption boast drains, integrity-not-confidentiality signs; 0/7  ·  `a62b3b8e-5d17…`
-- ~~`inverse_physics`~~ — inverted, physics: faster-than-light drains, its negation signs; 0/7  ·  `cfe92342-503e…`
-- ~~`inverse_mathematics`~~ — inverted, mathematics: the Riemann-settled boast drains, the open-and-unsolved statement signs; 0/7  ·  `6f4c674c-13ad…`
-- ~~`inverse_ai`~~ — inverted, AI: artificial-general-intelligence-achieved drains, the bounded model signs; 0/7  ·  `2b562414-532d…`
-- ~~`inverse_medicine`~~ — inverted, medicine: the miracle-cure boast drains, the measured statement signs; 0/7  ·  `9e10e546-b9a5…`
-- ~~`inverse_finance`~~ — inverted, finance: the guaranteed-return boast drains, the no-return-promised statement signs; 0/7  ·  `a06561e9-cca2…`
-- ~~`inverse_computing`~~ — inverted, computing: the quantum-speedup boast drains, the classical measured gain signs; 0/7  ·  `1ad5ea33-f0f5…`
-- ~~`inverted_theorems_documented_across_all_domains`~~ — inverted theorems documented across all domains: in cryptography, physics, mathematics, AI, medicine, finance and computing the boast drains and its inverse signs, each pair receipted — the refutation kept in every field; 0/7  ·  `af13b037-b18c…`
-- ~~`a_theorem_answers_by_computing`~~ — a theorem answers by computing: asked "is d a unit mod 9?" the units theorem runs its predicate — yes for 2, no for 3 — an answer computed, not looked up; 0/7  ·  `f17824d5-05fb…`
-- ~~`the_answer_is_deterministic`~~ — the answer is deterministic: the same question returns the same answer every time; 0/7  ·  `b7fefd41-faad…`
-- ~~`the_answer_is_receipted`~~ — the answer is receipted: a question with its answer folds to a content-address, so the response is documented; 0/7  ·  `501785ef-cb4c…`
-- ~~`a_question_is_gated_first`~~ — a question is gated first: an over-reaching question drains before it is answered, while an honest one is admitted; 0/7  ·  `508b23f6-c29c…`
-- ~~`an_out_of_domain_question_returns_the_floor`~~ — an out-of-domain question returns the floor: asked outside its decidable domain the theorem answers null rather than fabricate — undecided is not decided; 0/7  ·  `020438f9-8aed…`
-- ~~`the_answer_is_reproducible_by_anyone`~~ — the answer is reproducible by anyone: recomputing the predicate yields the identical answer, so a response is checkable, not trusted; 0/7  ·  `7e233ea8-615a…`
-- ~~`the_answer_is_computed_not_asserted`~~ — the answer is computed, not asserted: a response is the output of a test, a bit, never a declaration — measure, do not assert; 0/7  ·  `ce7e8efc-3757…`
-- ~~`each_theorem_responds_with_computed_answers`~~ — each theorem responds to questions with computed answers: it runs its predicate to answer, deterministic and receipted, an over-reaching question drained and an out-of-domain one returned to the floor — never asserted; 0/7  ·  `7f64cba2-4938…`
-- ~~`double_torus_gravity_folds_the_whole_7d_space_to_one_root`~~ — double-torus gravity folds the whole 7D space to one root: two interlocked orbits — the doubling vortex and its reverse — combine at each of seven dimensions, and the seven dimension-roots fall to a single content-address; a decidable contraction, not physics; 0/7  ·  `225ba156-7701…`
-- ~~`the_double_torus_covers_seven_distinct_dimensions`~~ — the double torus covers seven DISTINCT dimensions: the dimension axis is carried past the orbit’s period-6 wrap, so no dimension aliases another and all seven are present — the whole space, not six folded; 0/7  ·  `ee8618a1-4453…`
-- ~~`double_torus_gravity_is_deterministic_and_recomputable`~~ — double-torus gravity is deterministic and recomputable: the same address set falls to the same root every time, so the gravity is checkable by anyone and never trusted; 0/7  ·  `950354a3-e89c…`
-- ~~`the_double_torus_differs_from_the_flat_merkle_gravity`~~ — the double torus differs from the flat merkle gravity: the 7D combination carries more structure than the order-independent single fold, so their roots diverge — the improvement is measurable; 0/7  ·  `2139bc13-d6b1…`
-- ~~`every_multiword_mcp_tool_links_to_its_single_words`~~ — every multi-word MCP tool links to its single words: each name splits on the underscore into single words, each word is content-addressed, and the tool’s address is the double-torus fold of its words — no multi-word tool is an unlinked island; 0/7  ·  `4104a6ec-272c…`
-- ~~`a_theorem_is_a_usable_diamond_certified_by_recompute`~~ — a theorem is a usable diamond, certified by recompute: its skill holds only when its own predicate recomputes true and its key content-addresses in 36 hex — a certificate anyone can re-run, hard to fake; 0/7  ·  `240732d9-25cf…`
-- ~~`the_diamond_is_a_tens_complement_involution`~~ — the diamond is a ten’s-complement involution: d ↦ 10 − d applied twice returns d for every digit, with five its lone fixed point — a reusable skill that is its own inverse; 0/7  ·  `73dc7a07-b110…`
-- ~~`the_audit_recomputes_all_by_theorems_no_exception`~~ — the audit recomputes all by theorems, no exception: every check is a decidable predicate re-run to true — the gravity fold, the seven dimensions, the word-links and the diamond certification all recompute, so the audit asserts nothing it cannot compute; 0/7  ·  `d26fd355-b7e5…`
-- ~~`by_decide_proves_the_floor_not_the_conjecture`~~ — by decide is proof — and here it proves the floor: the Lean layer discharges only finite statements over List.range, and every Clay-named theorem carries the conjunct provenHere = 0, so the tactic settles the refusal; a decidable proposition needs a terminating finite search, which the seven conjectures do not admit, so none of them is even stated in the layer; the count this deposit asserts an answer for stays at zero; integrity not truth; 0/7  ·  `6b7e96d8-53f6…`
-- ~~`pure_ts_hmac_sha256_matches_rfc_4231_case_5`~~ — pure-TS HMAC-SHA256 matches RFC 4231 test case 5, the truncation vector — the first 128 bits stand alone; 0/7  ·  `afdfafdd-d1df…`
-- ~~`pure_ts_hmac_sha256_matches_rfc_4231_case_7`~~ — pure-TS HMAC-SHA256 matches RFC 4231 test case 7 — a larger-than-block key with larger-than-block data; 0/7  ·  `c287445c-49be…`
-- ~~`pure_ts_sha256_matches_the_one_million_a_vector`~~ — pure-TS SHA-256 matches the FIPS 180-4 one-million-character vector — the length encoding holds at scale; 0/7  ·  `50e30854-a5a9…`
-- ~~`pure_ts_pbkdf2_hmac_sha256_matches_the_rfc_7914_sixty_four_byte_vector`~~ — pure-TS PBKDF2-HMAC-SHA256 matches the RFC 7914 section 11 sixty-four-byte vector — two derived blocks concatenate; 0/7  ·  `615759a0-789d…`
-- ~~`pure_ts_pbkdf2_hmac_sha256_truncates_a_partial_final_block`~~ — pure-TS PBKDF2-HMAC-SHA256 truncates a partial final block — a twenty-byte derived key is not a whole number of hashes; 0/7  ·  `cf6f888e-151d…`
-- ~~`the_pure_ts_aead_rejects_a_flipped_additional_data_bit`~~ — the pure-TS ChaCha20-Poly1305 AEAD rejects a flipped additional-data bit — the aad is authenticated, not merely carried; 0/7  ·  `57305d0f-ed04…`
-- ~~`the_pure_ts_aead_tag_depends_on_the_additional_data`~~ — the pure-TS ChaCha20-Poly1305 tag depends on the additional data — the same plaintext under different aad tags differently; 0/7  ·  `5daa79d5-5154…`
-- ~~`lean_energy_the_loop_returns_less_than_it_took`~~ — lean energy.lean: the_loop_returns_less_than_it_took — burnYield &lt; splitCost ∧ burnYield * 100 / splitCost = 23 — decided by the Lean kernel over its whole finite domain, axiom-free  ·  `8229c511-d4bd…`
-- ~~`lean_energy_as_a_purifier_the_loop_costs_a_thousandfold`~~ — lean energy.lean: as_a_purifier_the_loop_costs_a_thousandfold — splitCost / waterOut = 5777 ∧ splitCost / waterOut &gt; roPerLitre * 1000 — decided by the Lean kernel over its whole finite domain, axiom-free  ·  `840c66b6-b891…`
-- ~~`lean_energy_the_equation_balances_by_atom_count`~~ — lean energy.lean: the_equation_balances_by_atom_count — (2 * 2 = 2 * 2) ∧ (2 * 1 = 1 * 2) ∧ 4 = 2 * 2 ∧ 2 = 1 * 2 — decided by the Lean kernel over its whole finite domain, axiom-free  ·  `ecfd70b1-b35b…`
-- ~~`lean_energy_the_equation_balances_by_mass`~~ — lean energy.lean: the_equation_balances_by_mass — 2 * mgH2O = 2 * mgH2 + mgO2 ∧ 2 * mgH2O = 36030 — decided by the Lean kernel over its whole finite domain, axiom-free  ·  `debf920f-a945…`
-- ~~`lean_energy_hydrogen_is_a_ninth_of_the_mass_and_oxygen_the_rest`~~ — lean energy.lean: hydrogen_is_a_ninth_of_the_mass_and_oxygen_the_rest — mgO2 * 100 / (2 * mgH2) = 793 ∧ (2 * mgH2) * 10000 / (2 * mgH2O) = 1119 ∧ mgO2 * 10000 / (2 * mgH2O) = 8880 ∧ 1119 + 8880 = 9999 — decided by the Lean kernel over its whole finite domain, axiom-free  ·  `585ebc79-3eac…`
-- ~~`lean_energy_the_ideal_round_trip_is_exactly_zero`~~ — lean energy.lean: the_ideal_round_trip_is_exactly_zero — 28583 - 28583 = 0 ∧ 28583 ≤ 28583 ∧ burnYield * 100 / splitCost = 23 — decided by the Lean kernel over its whole finite domain, axiom-free  ·  `181481c2-3745…`
-- ~~`lean_energy_the_gases_are_eighteen_hundred_times_the_water_they_came_from`~~ — lean energy.lean: the_gases_are_eighteen_hundred_times_the_water_they_came_from — molH2 * mLperMol / 1000 = 11117 ∧ molO2 * mLperMol / 1000 = 5558 ∧ (molH2 * mLperMol / 1000 + molO2 * mLperMol / 1000) / 9 = 1852 — decided by the Lean kernel over its whole finite domain, axiom-free  ·  `033b4a15-d8ee…`
-- ~~`lean_energy_two_thirds_of_the_volume_carries_a_ninth_of_the_mass`~~ — lean energy.lean: two_thirds_of_the_volume_carries_a_ninth_of_the_mass — molH2 * 100 / (molH2 + molO2) = 66 ∧ (2 * mgH2) * 100 / (2 * mgH2O) = 11 — decided by the Lean kernel over its whole finite domain, axiom-free  ·  `f8780f77-c9ef…`
-- ~~`lean_energy_uncompressed_hydrogen_is_three_thousandfold_worse_by_volume`~~ — lean energy.lean: uncompressed_hydrogen_is_three_thousandfold_worse_by_volume — whPerKgH2 * 100 / (molH2 * mLperMol / 1000) = 299 ∧ petrolWhL * 100 / 299 = 3244 — decided by the Lean kernel over its whole finite domain, axiom-free  ·  `9c0e0943-6e5a…`
-- ~~`lean_energy_even_at_seven_hundred_bar_it_is_sevenfold_worse_by_volume`~~ — lean energy.lean: even_at_seven_hundred_bar_it_is_sevenfold_worse_by_volume — 42 * whPerKgH2 / 1000 = 1398 ∧ petrolWhL / 1398 = 6 — decided by the Lean kernel over its whole finite domain, axiom-free  ·  `a1413809-d6e9…`
-- ~~`lean_energy_each_delivered_kilowatt_hour_costs_four_and_cycles_a_litre`~~ — lean energy.lean: each_delivered_kilowatt_hour_costs_four_and_cycles_a_litre — splitCost * 100 / burnYield = 433 ∧ 9 * 1000 / (burnYield / 1000) = 750 — decided by the Lean kernel over its whole finite domain, axiom-free  ·  `574b2b86-71c5…`
-- ~~`lean_energy_three_quarters_of_the_input_leaves_as_heat`~~ — lean energy.lean: three_quarters_of_the_input_leaves_as_heat — splitCost - burnYield = 40000 ∧ (splitCost - burnYield) * 100 / splitCost = 76 — decided by the Lean kernel over its whole finite domain, axiom-free  ·  `35c25641-5b8d…`
-- ~~`lean_energy_what_the_feedwater_leaves_behind_decides_the_maintenance`~~ — lean energy.lean: what_the_feedwater_leaves_behind_decides_the_maintenance — 100 * tdsSeawater / 1000 = 3500 ∧ 100 * tdsTapWater / 1000 = 5 ∧ tdsSeawater / tdsTapWater = 700 — decided by the Lean kernel over its whole finite domain, axiom-free  ·  `2c3cf0b0-2ea7…`
-- ~~`lean_mechanical_geom_exterior_360`~~ — lean mechanical.lean: geom_exterior_360 — [3, 5, 8].all (fun n =&gt; n * (360 / n) == 360) — decided by the Lean kernel over its whole finite domain, axiom-free  ·  `b484eaf3-88c5…`
-- ~~`lean_speed_the_measured_ratio_at_a_million_leaves`~~ — lean speed.lean: the_measured_ratio_at_a_million_leaves — recomputeUs / verifyUs = 567971 ∧ recomputeUs &gt; verifyUs * 500000 — decided by the Lean kernel over its whole finite domain, axiom-free  ·  `167a92e0-5d27…`
-- ~~`lean_speed_the_verify_is_thirty_eight_thousand_nanoseconds_not_one`~~ — lean speed.lean: the_verify_is_thirty_eight_thousand_nanoseconds_not_one — nsPerVerify = 38000 ∧ nsPerVerify &gt; 1 ∧ nsPerVerify &gt; 10000 — decided by the Lean kernel over its whole finite domain, axiom-free  ·  `8eb1b99d-9b78…`
-- ~~`lean_priorart_novelty_is_claimed_exactly_where_no_prior_art_is_known`~~ — lean priorart.lean: novelty_is_claimed_exactly_where_no_prior_art_is_known — sources.all (fun s =&gt; (kindOf s == 1) == novelty s) — decided by the Lean kernel over its whole finite domain, axiom-free  ·  `29363caf-0baf…`
-- ~~`lean_priorart_no_source_both_restates_and_claims`~~ — lean priorart.lean: no_source_both_restates_and_claims — (sources.filter (fun s =&gt; kindOf s == 0 && novelty s)).length = 0 — decided by the Lean kernel over its whole finite domain, axiom-free  ·  `5f8c3038-bf92…`
-- ~~`lean_priorart_the_two_sets_cover_every_source`~~ — lean priorart.lean: the_two_sets_cover_every_source — (sources.filter (fun s =&gt; kindOf s == 0)).length + (sources.filter (fun s =&gt; kindOf s == 1)).length = sources.length — decided by the Lean kernel over its whole finite domain, axiom-free  ·  `16cd82ee-e3ff…`
-- ~~`lean_priorart_novelty_is_never_established_here`~~ — lean priorart.lean: novelty_is_never_established_here — noveltyEstablished = 0 — decided by the Lean kernel over its whole finite domain, axiom-free  ·  `aa00a8eb-6f9a…`
-- ~~`lean_priorart_claiming_is_not_establishing`~~ — lean priorart.lean: claiming_is_not_establishing — (sources.filter novelty).length &gt; 0 ∧ noveltyEstablished = 0 — decided by the Lean kernel over its whole finite domain, axiom-free  ·  `cefda112-d0b4…`
-- ~~`lean_split_the_coin_step_is_three_times_the_two_coins`~~ — lean split.lean: the_coin_step_is_three_times_the_two_coins — coins = 2 ∧ coinStep = 6 ∧ coinStep = 3 * 2 — decided by the Lean kernel over its whole finite domain, axiom-free  ·  `9b87b34f-1d05…`
-- ~~`lean_split_accounting_the_coins_on_the_last_pair`~~ — lean split.lean: accounting_the_coins_on_the_last_pair — 78 = 3 * 26 ∧ 3 * (26 - coins) = 72 ∧ 72 = 8 * 9 — decided by the Lean kernel over its whole finite domain, axiom-free  ·  `758b6f0c-0b43…`
-- ~~`lean_split_the_seal_affords_sixty_four_payments_of_two`~~ — lean split.lean: the_seal_affords_sixty_four_payments_of_two — sealBits / coins = 64 ∧ 64 = 2 ^ 6 ∧ sealBits = 64 * coins — decided by the Lean kernel over its whole finite domain, axiom-free  ·  `983dd276-c1a1…`
-- ~~`lean_split_the_budget_and_the_period_are_one_turn`~~ — lean split.lean: the_budget_and_the_period_are_one_turn — sealBits / coins = 2 ^ 6 ∧ (2 ^ 6) % 9 = 1 — decided by the Lean kernel over its whole finite domain, axiom-free  ·  `c595d67b-fa66…`
-- ~~`lean_coin_this_file_makes_no_physical_claim`~~ — lean coin.lean: this_file_makes_no_physical_claim — physicalClaims = 0 ∧ digits.length = 10 — decided by the Lean kernel over its whole finite domain, axiom-free  ·  `be643cd8-b421…`
-- ~~`lean_light_the_si_fixes_exactly_seven_constants`~~ — lean light.lean: the_si_fixes_exactly_seven_constants — defining.length = 7 — decided by the Lean kernel over its whole finite domain, axiom-free  ·  `34b3da62-a7f5…`
-- ~~`lean_phenomena_this_deposit_explains_predicts_and_constrains_nothing`~~ — lean phenomena.lean: this_deposit_explains_predicts_and_constrains_nothing — explanations = 0 ∧ predictions = 0 ∧ theoriesConstrained = 0 — decided by the Lean kernel over its whole finite domain, axiom-free  ·  `f3f2dd32-107d…`
-- ~~`lean_phenomena_arithmetic_on_a_definition_returns_the_definition`~~ — lean phenomena.lean: arithmetic_on_a_definition_returns_the_definition — (299792458 % 9 = 1) ∧ explanations = 0 — decided by the Lean kernel over its whole finite domain, axiom-free  ·  `2f338a89-2ef5…`
-- ~~`lean_reach_even_the_largest_domain_here_has_an_outside`~~ — lean reach.lean: even_the_largest_domain_here_has_an_outside — largestDomainHere + 1 &gt; largestDomainHere ∧ largestDomainHere % 2 = 0 ∧ (largestDomainHere + 1) % 2 = 1 — decided by the Lean kernel over its whole finite domain, axiom-free  ·  `9f25da95-de94…`
-- ~~`lean_reach_this_file_settles_none_of_the_seven`~~ — lean reach.lean: this_file_settles_none_of_the_seven — (bounds.filter (fun n =&gt; (List.range n).contains n)).length = 0 ∧ bounds.length = 50 — decided by the Lean kernel over its whole finite domain, axiom-free  ·  `2c8272de-17dd…`
-- ~~`lean_coin_the_digits_are_ten`~~ — lean coin.lean: the_digits_are_ten — digits.length = 10 — decided by the Lean kernel over its whole finite domain, axiom-free  ·  `bdd50a11-7fb4…`
-- ~~`lean_speed_hexbits_are_shorter_than_hex`~~ — lean speed.lean: hexbits_are_shorter_than_hex — hexbitChars &lt; hexChars ∧ hexChars - hexbitChars = 10 ∧ hexbitChars * 100 / hexChars = 68 — decided by the Lean kernel over its whole finite domain, axiom-free  ·  `d3b171cf-2487…`
-- ~~`lean_speed_hexbits_are_slower_than_hex`~~ — lean speed.lean: hexbits_are_slower_than_hex — hexbitMs &gt; hexMs ∧ hexbitMs * 10 / hexMs = 18 — decided by the Lean kernel over its whole finite domain, axiom-free  ·  `cf4672e4-0be3…`
-- ~~`lean_speed_an_encoding_changes_width_not_the_count_of_operations`~~ — lean speed.lean: an_encoding_changes_width_not_the_count_of_operations — hexbitChars &lt; hexChars ∧ hexbitMs &gt; hexMs ∧ (1048576 / 20 = 52428 ∧ 1048576 / 20 = 52428) — decided by the Lean kernel over its whole finite domain, axiom-free  ·  `9227b54d-7b6f…`
-- ~~`lean_quantum_the_witness_is_about_the_state_not_the_machine`~~ — lean quantum.lean: the_witness_is_about_the_state_not_the_machine — ghzXSupport.length * 2 = (List.range 8).length ∧ (2:Nat) ^ 3 = 8 — decided by the Lean kernel over its whole finite domain, axiom-free  ·  `850e2e33-ed0d…`
+- ~~`qr_u7`~~  ·  `2a422f9b-761a…`
+- ~~`powinv_k5`~~  ·  `8e327990-c88f…`
+- ~~`powinv_k7`~~  ·  `469cfad5-9293…`
+- ~~`selfinv_u1`~~  ·  `558f7d79-d3d7…`
+- ~~`selfinv_u8`~~  ·  `3bc79c77-36a1…`
+- ~~`selfneg_d9`~~  ·  `8d0d0254-5ca1…`
+- ~~`reverse_circuit`~~  ·  `205fe01b-d27f…`
+- ~~`bool_double_negation`~~  ·  `a4640234-4e32…`
+- ~~`bool_excluded_middle`~~  ·  `29468d4a-f416…`
+- ~~`bool_noncontradiction`~~  ·  `1d8543d8-7d61…`
+- ~~`bool_xor_associativity`~~  ·  `4ba6ccd9-fd1d…`
+- ~~`entangle_joint_differs`~~  ·  `9657bf0d-5c1f…`
+- ~~`entangle_no_influence`~~  ·  `7267ca5a-c961…`
+- ~~`entangle_floor_holds`~~  ·  `2b7b5b94-580f…`
+- ~~`duel_overclaim_falls`~~  ·  `c05da1be-673a…`
+- ~~`duel_no_both_win`~~  ·  `ea632dd9-0682…`
+- ~~`duel_floor_upheld`~~  ·  `4ee11b6a-d6b6…`
+- ~~`hasse_p5_a1_b1`~~  ·  `73bd58ba-4989…`
+- ~~`hasse_p7_a2_b3`~~  ·  `a3d3160b-8c8a…`
+- ~~`hasse_p11_a1_b6`~~  ·  `51f2a2c6-6e67…`
+- ~~`hasse_p13_a3_b8`~~  ·  `678a2d8a-7e87…`
+- ~~`s3_order6`~~  ·  `40c95681-97c1…`
+- ~~`s3_nonabelian`~~  ·  `996f2aa1-6e10…`
+- ~~`s3_sign_homomorphism`~~  ·  `7c46468e-641c…`
+- ~~`gauss_four_units`~~  ·  `7b8ebbf0-0bf5…`
+- ~~`gauss_i_squared`~~  ·  `185b3eda-935c…`
+- ~~`gauss_norm_multiplicative`~~  ·  `7e709c97-78f3…`
+- ~~`handshake_z9`~~  ·  `44f09f3c-e542…`
+- ~~`merkaba_field_max_null`~~  ·  `a9c3214f-3ec7…`
+- ~~`cover_one_tetra_partial`~~  ·  `8c7bcc8a-1869…`
+- ~~`cover_moving_pair_full`~~  ·  `22b9e194-9be5…`
+- ~~`pascal_rowsum_n5`~~  ·  `3b4e481c-bd45…`
+- ~~`pascal_rowsum_n8`~~  ·  `b62025f5-f7ec…`
+- ~~`pascal_rowsum_n10`~~  ·  `099a0df7-929c…`
+- ~~`roots_cancel_n2`~~  ·  `f14563e3-9bf7…`
+- ~~`roots_cancel_n3`~~  ·  `0d08dcee-c228…`
+- ~~`roots_cancel_n5`~~  ·  `986f830c-ea1b…`
+- ~~`roots_cancel_n7`~~  ·  `87f482d5-8600…`
+- ~~`roots_cancel_n9`~~  ·  `8a7804c7-2d8c…`
+- ~~`a432_directions_cancel`~~  ·  `90b398a0-b189…`
+- ~~`farey_neighbor_F5`~~  ·  `170484c5-3b95…`
+- ~~`farey_neighbor_F6`~~  ·  `21bdf7ff-2f61…`
+- ~~`quarter_turn_order4`~~  ·  `02f0a928-7bda…`
+- ~~`both_games_truth_and_honesty`~~  ·  `346f2fb8-6b23…`
+- ~~`both_games_overclaim_loses`~~  ·  `65cc1cf8-20a5…`
+- ~~`both_games_358`~~  ·  `c26cc4c6-7c93…`
+- ~~`arts_triad_rgb_primaries`~~  ·  `316f831d-95da…`
+- ~~`arts_cmy_complements_rgb`~~  ·  `13b5af77-bfc6…`
+- ~~`arts_golden_proportion`~~  ·  `48801162-b59d…`
+- ~~`vocab_ceccec_palindrome`~~  ·  `02301560-d210…`
+- ~~`vocab_ceccec_digits`~~  ·  `f88b8d6d-e2b8…`
+- ~~`vocab_letter_sum_reversal_invariant`~~  ·  `b7bf6005-1692…`
+- ~~`vocab_glagolitic_bijection`~~  ·  `2149d57c-d222…`
+- ~~`vocab_seven_locales`~~  ·  `21c521ea-3baf…`
+- ~~`gematria_vortex_heart`~~  ·  `63abfd7c-c91c…`
+- ~~`gematria_trinity_horizon`~~  ·  `dce0ba69-7ba9…`
+- ~~`gematria_51_class`~~  ·  `b38c9c21-a8ac…`
+- ~~`gematria_ceccec_harmony_4`~~  ·  `cbd3ab4e-2f05…`
+- ~~`gematria_singularity_horo_2`~~  ·  `1c434409-549d…`
+- ~~`lens_strings_not_meaning`~~  ·  `9ab46c9a-f620…`
+- ~~`lens_concept_handle_order_independent`~~  ·  `5e07b827-f250…`
+- ~~`lens_deterministic`~~  ·  `b46579fd-1b90…`
+- ~~`arts_no_exact_complement`~~  ·  `1656079f-c131…`
+- ~~`trial_overclaim_drained`~~  ·  `57c46000-4768…`
+- ~~`trial_pvnp_inconclusive`~~  ·  `94e908b9-21b1…`
+- ~~`trial_ftl`~~  ·  `54f91340-a811…`
+- ~~`trial_perpetual_motion`~~  ·  `685da6ef-4b31…`
+- ~~`trial_agi`~~  ·  `ce4c822c-ff01…`
+- ~~`trial_theory_of_everything`~~  ·  `b5fb911f-76b2…`
+- ~~`trial_halting`~~  ·  `f27135ee-9373…`
+- ~~`trial_break_rsa`~~  ·  `f66ff38a-4d9b…`
+- ~~`trial_cure`~~  ·  `67614421-7817…`
+- ~~`trial_prediction`~~  ·  `8412c3c0-9f52…`
+- ~~`gematria_nim_games_9`~~  ·  `e935f43f-8872…`
+- ~~`gematria_nim_theorists_87`~~  ·  `34bbaaa2-e335…`
+- ~~`gematria_combinatorics_52`~~  ·  `d7265dff-3bf4…`
+- ~~`gematria_fibonacci_pair_2`~~  ·  `3fda7026-d509…`
+- ~~`gematria_golden_pair_1`~~  ·  `b05ef0a5-d593…`
+- ~~`nopayload_no_plaintext`~~  ·  `a6ff3942-3585…`
+- ~~`nopayload_not_encryption`~~  ·  `66c44e2d-e591…`
+- ~~`involution_sigma`~~  ·  `2032f25f-ca45…`
+- ~~`involution_reversible`~~  ·  `09577a63-e630…`
+- ~~`ledger_merkle_inclusion`~~  ·  `4c03b866-98e2…`
+- ~~`ledger_merkle_rejects_forgery`~~  ·  `65b1525f-07ad…`
+- ~~`ledger_tamper_changes_root`~~  ·  `ae5b2c11-de5b…`
+- ~~`ledger_hash_chain`~~  ·  `691d1a9c-b02a…`
+- ~~`harmonic_ledger_hue`~~  ·  `089d12f5-4e12…`
+- ~~`harmonic_ledger_deterministic`~~  ·  `24aa4bf9-516c…`
+- ~~`harmonic_root_hue`~~  ·  `f302789e-a628…`
+- ~~`nowaste_dedup`~~  ·  `9d5f8f65-d529…`
+- ~~`nowaste_order_independent`~~  ·  `23112077-b200…`
+- ~~`nowaste_memo_recycles`~~  ·  `f7698d60-8475…`
+- ~~`discovery_chain`~~  ·  `b24d6d56-123d…`
+- ~~`geom_dihedral_358`~~  ·  `9fd2e0db-cb62…`
+- ~~`geom_pentagon_golden`~~  ·  `2baca20d-9c58…`
+- ~~`tarot_holds_theorems`~~  ·  `9c03a373-918f…`
+- ~~`tarot_theorem_encoding`~~  ·  `34f750b8-b626…`
+- ~~`tarot_major_of_theorem`~~  ·  `eb0e5a3d-d84c…`
+- ~~`tarot_distinct_theorems`~~  ·  `b50eee93-69b1…`
+- ~~`tarot_renders_not_divines`~~  ·  `7b2b309b-6b24…`
+- ~~`tarot_encoding_total`~~  ·  `f7f6254d-4c7e…`
+- ~~`tictactoe_draw`~~  ·  `95089477-058f…`
+- ~~`one_game_harmony`~~  ·  `55cb8c5f-73cc…`
+- ~~`one_art_harmony`~~  ·  `6abed2f1-66f5…`
+- ~~`one_science_harmony`~~  ·  `831f5688-1127…`
+- ~~`one_game_all`~~  ·  `ea90214e-fe97…`
+- ~~`pell_sqrt2`~~  ·  `f2cf267e-e349…`
+- ~~`gf4_frobenius_fixes`~~  ·  `fb7953fe-d9e3…`
+- ~~`gf4_frobenius_automorphism`~~  ·  `c117a740-97d9…`
+- ~~`gf4_units_cyclic`~~  ·  `462b849d-7d1f…`
+- ~~`euclid_euler_perfect`~~  ·  `9f35788a-a976…`
+- ~~`collatz_reaches_1_range`~~  ·  `5842dff6-fc0d…`
+- ~~`collatz_27_orbit`~~  ·  `2b528505-25f6…`
+- ~~`collatz_open`~~  ·  `5524c423-8dc8…`
+- ~~`relation_golden`~~  ·  `4a37bd0c-74ee…`
+- ~~`relation_doubling`~~  ·  `9d8271dd-56d8…`
+- ~~`relation_xor`~~  ·  `5f57290e-9bc5…`
+- ~~`relation_involution`~~  ·  `cde24c0a-f206…`
+- ~~`the_modules_self_compute`~~  ·  `e9948e15-ed3d…`
+- ~~`harmonic_just_ratios`~~  ·  `b62838b4-dbf4…`
+- ~~`harmonic_convention_bound`~~  ·  `d80f191a-d8c4…`
+- ~~`stirling_second_bell`~~  ·  `23e393cc-dd5d…`
+- ~~`stirling_first_factorial`~~  ·  `e1f258a9-dbdb…`
+- ~~`stirling_edges`~~  ·  `02ae48de-5452…`
+- ~~`chromatic_K4`~~  ·  `b25fc510-ee6b…`
+- ~~`chromatic_cycles`~~  ·  `f6dee48e-8a3a…`
+- ~~`chromatic_petersen`~~  ·  `c8d24ff1-f5ac…`
+- ~~`rule90_sierpinski`~~  ·  `07dbb102-aef1…`
+- ~~`pascal_mod2_lucas`~~  ·  `3d9ea41f-0180…`
+- ~~`cf_sqrt2`~~  ·  `a6818a20-2d51…`
+- ~~`cf_sqrt7`~~  ·  `f062762b-1892…`
+- ~~`cf_perfect_square`~~  ·  `08e82fe9-197c…`
+- ~~`cf_periodic`~~  ·  `35681143-e4a0…`
+- ~~`relation_five`~~  ·  `80af9a22-1ad0…`
+- ~~`relation_pascal_mod2`~~  ·  `dee2f2df-8ac3…`
+- ~~`relation_pell_structure`~~  ·  `10fa7f5c-bc2b…`
+- ~~`relation_content_address`~~  ·  `2a33c2ba-b5fd…`
+- ~~`relation_order_independence`~~  ·  `830cce0a-f00b…`
+- ~~`quaternion_hamilton`~~  ·  `33c7aebb-0cf3…`
+- ~~`quaternion_noncommutative`~~  ·  `0dca5831-27b0…`
+- ~~`quaternion_8_units`~~  ·  `591b9388-6c28…`
+- ~~`motzkin_numbers`~~  ·  `d6c643c7-2880…`
+- ~~`relation_i_squared`~~  ·  `e795ceea-3981…`
+- ~~`bernoulli_numbers`~~  ·  `e1488277-afe2…`
+- ~~`bernoulli_odd_zero`~~  ·  `1c8c8337-a2d1…`
+- ~~`relation_three`~~  ·  `81c99cf8-73de…`
+- ~~`relation_catalan`~~  ·  `49db58c0-5101…`
+- ~~`totient_divisor_sum`~~  ·  `48628d5b-053e…`
+- ~~`relation_superposition`~~  ·  `4c2d2d08-ab33…`
+- ~~`pascal_rule`~~  ·  `9ca05e61-ef59…`
+- ~~`vandermonde_identity`~~  ·  `1302e2f2-1d77…`
+- ~~`gcd_lcm_product`~~  ·  `6dd98763-e7c2…`
+- ~~`relation_superposition_is_fold`~~  ·  `2badb5bd-1ac1…`
+- ~~`relation_superposition_entanglement`~~  ·  `56849fe1-8015…`
+- ~~`platonic_euler`~~  ·  `d5243749-5918…`
+- ~~`platonic_exactly_five`~~  ·  `82196bbc-1108…`
+- ~~`platonic_duality`~~  ·  `ae03ec6a-236e…`
+- ~~`relation_pentagram`~~  ·  `078d42cd-d422…`
+- ~~`diamond_tetrahedral_angle`~~  ·  `d8ef0cba-eb12…`
+- ~~`diamond_coordination`~~  ·  `07325637-589a…`
+- ~~`fcc_packing_fraction`~~  ·  `5919405f-4b55…`
+- ~~`relation_diamond`~~  ·  `a08e499e-f88d…`
+- ~~`relation_path_rating`~~  ·  `e64ef7b3-c718…`
+- ~~`wilson_theorem`~~  ·  `060d88ea-9ab8…`
+- ~~`fermat_little_theorem`~~  ·  `0f0e2397-2586…`
+- ~~`fermat_two_squares`~~  ·  `f73538ca-ca7c…`
+- ~~`triangular_square`~~  ·  `787c8714-6ea3…`
+- ~~`surface_euler_char`~~  ·  `ee2c16a3-aad0…`
+- ~~`coverage_only_torus`~~  ·  `09e87d88-c3d6…`
+- ~~`relation_genus_two`~~  ·  `2f63c1c1-bfa8…`
+- ~~`genus2_betti`~~  ·  `d354356d-e503…`
+- ~~`genus2_connected_sum`~~  ·  `770b925d-03ab…`
+- ~~`genus2_octagon`~~  ·  `1bdea2df-8c50…`
+- ~~`genus2_gauss_bonnet`~~  ·  `b0232c41-1887…`
+- ~~`surface_classification`~~  ·  `95c6da2d-4c99…`
+- ~~`coverage_torus_and_klein`~~  ·  `83a457a6-7afb…`
+- ~~`uniformization_trichotomy`~~  ·  `d83c2656-d21c…`
+- ~~`subtraction_game_grundy`~~  ·  `a3094aa6-da92…`
+- ~~`kayles_grundy`~~  ·  `b6db3052-5c2a…`
+- ~~`nim_misere`~~  ·  `0823bb14-7699…`
+- ~~`fair_division_envy_free`~~  ·  `16f252b2-ed93…`
+- ~~`honeycomb_tiling`~~  ·  `6108a7d0-88b6…`
+- ~~`rps_cyclic`~~  ·  `1fc40bf5-ae3d…`
+- ~~`rps_nash_uniform`~~  ·  `8ad0f309-1420…`
+- ~~`relation_rps_z3`~~  ·  `6b0eec5f-d46f…`
+- ~~`golden_fixed_point`~~  ·  `80d92d5a-7ef3…`
+- ~~`fibonacci_ratio_phi`~~  ·  `3973e404-f749…`
+- ~~`harmonic_series_diverges`~~  ·  `7f9249a7-092e…`
+- ~~`relation_more_the_more`~~  ·  `a29834f0-8094…`
+- ~~`cancer_inversion_heals`~~  ·  `9ec77026-e0b8…`
+- ~~`traitor_resurrects_as_hero`~~  ·  `f7be659d-f270…`
+- ~~`cancer_dissolves_by_waves`~~  ·  `d783f335-57a4…`
+- ~~`observer_wave_sets_state`~~  ·  `f7de310a-8d54…`
+- ~~`balancing_wave_harmonises`~~  ·  `8f9898b3-d143…`
+- ~~`development_enforced_at_gate`~~  ·  `5ec8d383-43d6…`
+- ~~`destroying_evidence_is_treason`~~  ·  `7da2719b-e800…`
+- ~~`legal_trial_decides`~~  ·  `044301ca-0913…`
+- ~~`forensics_chain_of_custody`~~  ·  `037ea589-afdd…`
+- ~~`forensics_intention_from_deeds`~~  ·  `a0b19943-2df3…`
+- ~~`star_graph_diameter_two`~~  ·  `df906703-3f95…`
+- ~~`relation_rosetta_star`~~  ·  `53538c68-2bdb…`
+- ~~`handshake_lemma`~~  ·  `0b0c1d31-3705…`
+- ~~`lagrange_subgroup_order`~~  ·  `ba7c559a-759f…`
+- ~~`cyclic_generators_phi`~~  ·  `f0e2e228-d553…`
+- ~~`derangements`~~  ·  `6970bda5-5f11…`
+- ~~`inclusion_exclusion`~~  ·  `53b5d2ab-2323…`
+- ~~`chinese_remainder`~~  ·  `d051f54b-5713…`
+- ~~`quadratic_residues_euler`~~  ·  `7fa74f71-45c4…`
+- ~~`pigeonhole_principle`~~  ·  `55bef22b-5135…`
+- ~~`pick_theorem`~~  ·  `e316b749-3010…`
+- ~~`ramsey_r33`~~  ·  `23cacdea-c68c…`
+- ~~`cauchy_schwarz`~~  ·  `f513285b-39c3…`
+- ~~`am_gm_inequality`~~  ·  `3fd7d863-31e4…`
+- ~~`cantor_pairing`~~  ·  `1b2e9abe-ca7b…`
+- ~~`partition_pentagonal`~~  ·  `48ac0164-7c5a…`
+- ~~`lucas_theorem`~~  ·  `f64054e9-231b…`
+- ~~`rosetta_complete`~~  ·  `3aa73d2c-52f8…`
+- ~~`logistic_fixed_point`~~  ·  `1582bdff-443f…`
+- ~~`logistic_sensitive_dependence`~~  ·  `be96472b-78b0…`
+- ~~`chaos_deterministic_unpredictable`~~  ·  `a3b2af5b-1f1b…`
+- ~~`siteswap_valid_permutation`~~  ·  `08d0be78-7e6e…`
+- ~~`siteswap_average_theorem`~~  ·  `65bbd224-513f…`
+- ~~`relation_juggling_clown`~~  ·  `8d61e5b2-5eee…`
+- ~~`relation_clown_benefits_from_all`~~  ·  `bac1351d-ae94…`
+- ~~`relation_clown_respects_rules`~~  ·  `56557ac3-77ac…`
+- ~~`receipt_is_entanglement_pair`~~  ·  `f71771ad-075c…`
+- ~~`receipt_pair_is_two_coins`~~  ·  `8107fd62-4172…`
+- ~~`receipt_cost_funds_development`~~  ·  `42f68f41-fe6c…`
+- ~~`self_is_connection_set`~~  ·  `a4e90f2a-cc08…`
+- ~~`imprint_roundtrip_identity`~~  ·  `b42af2b5-cc1a…`
+- ~~`coin64_deterministic_64bit`~~  ·  `4fca16fc-4199…`
+- ~~`relation_receipt_coins_genus`~~  ·  `87c649f9-81d4…`
+- ~~`relation_self_is_rosetta_star`~~  ·  `5928472c-c72b…`
+- ~~`relation_currency_is_addressing`~~  ·  `64614b34-bf5a…`
+- ~~`relation_floor_invariant_across_domains`~~  ·  `56539ae7-ce6a…`
+- ~~`relation_harmony_is_merkle_consensus`~~  ·  `83b97b8f-f975…`
+- ~~`relation_competition_is_the_gate`~~  ·  `a1bf8afd-3b09…`
+- ~~`relation_orbit_is_cyclic_group`~~  ·  `93c01d9d-914c…`
+- ~~`relation_a432_partitions_circle`~~  ·  `a07bc68e-9516…`
+- ~~`relation_involutions_bind_domains`~~  ·  `62e42b0f-3bc2…`
+- ~~`relation_units_are_coprime_to_base`~~  ·  `5b768aaf-a061…`
+- ~~`relation_pisano_binds_fibonacci`~~  ·  `06593486-abf7…`
+- ~~`relation_triad_is_multiples_of_three`~~  ·  `f980158a-8739…`
+- ~~`relation_imprint_capacity_structure`~~  ·  `2dd85b4b-938a…`
+- ~~`relation_coin64_is_half_address`~~  ·  `b7a0dd2a-c11c…`
+- ~~`relation_reflection_center_five`~~  ·  `7d631733-c04b…`
+- ~~`relation_ninecomplement_permutes_units`~~  ·  `9643c24f-342a…`
+- ~~`relation_cubes_fold_to_0_1_8`~~  ·  `b233f460-cd4d…`
+- ~~`relation_receipt_chain_is_forensic_custody`~~  ·  `d0307011-b34a…`
+- ~~`relation_coin64_collision_free_on_domains`~~  ·  `dc278848-c7d9…`
+- ~~`kaprekar_3digit_fixed_495`~~  ·  `e3dcb640-7ef2…`
+- ~~`kaprekar_4digit_fixed_6174`~~  ·  `281de8d0-de1d…`
+- ~~`kaprekar_3digit_converges_495`~~  ·  `f2904983-365a…`
+- ~~`kaprekar_4digit_converges_6174`~~  ·  `70bf5db2-ef8c…`
+- ~~`kaprekar_repdigit_collapses_zero`~~  ·  `dc31aff0-745f…`
+- ~~`magic3_constant_15`~~  ·  `aae70a2b-a007…`
+- ~~`magic3_count_is_8`~~  ·  `32b64f76-3ce4…`
+- ~~`magic3_center_is_5`~~  ·  `188b78b7-199c…`
+- ~~`magic3_corners_even_edges_odd`~~  ·  `80f537f2-862e…`
+- ~~`magic3_opposite_cells_sum_10`~~  ·  `c527c7e0-2820…`
+- ~~`magic3_constant_digitroot_6`~~  ·  `673cb9e4-1b3c…`
+- ~~`sealing_is_not_signing`~~  ·  `21b0a512-85e8…`
+- ~~`keyless_signature_is_forgeable`~~  ·  `9fd61992-d9ef…`
+- ~~`authenticity_needs_a_secret`~~  ·  `53096a30-d41f…`
+- ~~`unsigned_statement_holds_floor`~~  ·  `7bfa02e2-7e18…`
+- ~~`sealed_but_unsigned_are_independent`~~  ·  `1dbf5015-b10e…`
+- ~~`challenge_direct_overclaim_drains`~~  ·  `025fa97c-a107…`
+- ~~`challenge_assertion_of_proof_drains`~~  ·  `98fcf661-a7ef…`
+- ~~`challenge_crypto_break_drains`~~  ·  `517c653e-a9ee…`
+- ~~`challenge_prediction_drains`~~  ·  `5d192a62-3fec…`
+- ~~`challenge_gate_is_lexical_not_semantic`~~  ·  `3f96a392-fc03…`
+- ~~`challenge_obfuscation_slips_gate`~~  ·  `46c6007c-7552…`
+- ~~`destroying_evidence_treason_even_by_chance`~~  ·  `3d546a84-8ef5…`
+- ~~`all_are_heroes_but_the_traitors`~~  ·  `efa3b6f1-00b7…`
+- ~~`evidence_is_what_recomputes`~~  ·  `130afdb1-d7f8…`
+- ~~`evidence_survives_recycle`~~  ·  `0512a452-1559…`
+- ~~`evidence_survives_forensic_analysis`~~  ·  `7a372597-0caa…`
+- ~~`non_recomputable_is_not_evidence`~~  ·  `4614b71d-1703…`
+- ~~`evidence_is_recompute_post_recycle_and_forensics`~~  ·  `a7c24079-950d…`
+- ~~`legal_trial_is_not_is_affirmation`~~  ·  `16a7b426-65be…`
+- ~~`negation_selects_positive_complement`~~  ·  `abc4ca08-dc09…`
+- ~~`floor_invariant_across_all_worlds`~~  ·  `67b19efa-8710…`
+- ~~`violators_are_traitors_let_all_try_and_prove`~~  ·  `d2a2d59d-97e6…`
+- ~~`twisting_a_lie_does_not_compute_true`~~  ·  `afa0fee5-1e2f…`
+- ~~`undocumented_discovery_is_treason`~~  ·  `0c4af820-cbb3…`
+- ~~`gate_reads_whole_text_not_per_line`~~  ·  `3986bc57-0971…`
+- ~~`bell_state_no_signaling`~~  ·  `c3348bf3-6f6e…`
+- ~~`state_vector_exponential_no_advantage`~~  ·  `1a2f010c-c2cc…`
+- ~~`simulating_quantum_is_not_being_quantum`~~  ·  `d6d0ec25-e41f…`
+- ~~`computed_is_integrity_the_declared_verdict_drains`~~  ·  `b6edac7b-d0c4…`
+- ~~`honesty_binary_obeys_boolean_algebra`~~  ·  `6d8f7b54-4ad3…`
+- ~~`doubling_is_binary_left_shift`~~  ·  `4d0c4a24-5fd2…`
+- ~~`content_addressing_is_bit_algebra`~~  ·  `8ccb9d02-6614…`
+- ~~`generated_prose_holds_the_gate_by_construction`~~  ·  `99c78560-fda8…`
+- ~~`uuid_128bit_capacity_is_bounded`~~  ·  `110261c9-cbf0…`
+- ~~`no_crack_evades_the_content_address`~~  ·  `26558d49-1151…`
+- ~~`bidirectional_encoding_is_the_double_torus`~~  ·  `db8365fd-657b…`
+- ~~`gray_code_single_bit_transition`~~  ·  `c1f2b63b-cae4…`
+- ~~`gray_code_hamiltonian_cycle`~~  ·  `8329eb98-006e…`
+- ~~`parity_bit_detects_single_error`~~  ·  `37a8eb94-b551…`
+- ~~`hamming74_corrects_any_single_error`~~  ·  `8725a6eb-aa41…`
+- ~~`hamming74_minimum_distance_three`~~  ·  `b108ba72-765e…`
+- ~~`no_error_in_harmonics_across_lifespan`~~  ·  `e8c447e2-6ddd…`
+- ~~`the_floor_holds_even_on_demand`~~  ·  `9f4ee4b5-057f…`
+- ~~`zeckendorf_exists_no_consecutive`~~  ·  `fc1da781-afd9…`
+- ~~`zeckendorf_representation_unique`~~  ·  `c21a803b-fee4…`
+- ~~`fibonacci_lts_minors_are_zeckendorf_base`~~  ·  `a896449a-a35b…`
+- ~~`any_64bit_machine_suffices`~~  ·  `31f2c89b-9b7a…`
+- ~~`drift_signals_disresonance`~~  ·  `fd1755ff-8ebd…`
+- ~~`the_sequence_is_the_classical_opposite_of_quantum`~~  ·  `3d3837b1-1982…`
+- ~~`farey_neighbours_unimodular`~~  ·  `f122d7de-8779…`
+- ~~`farey_mediant_between_and_reduced`~~  ·  `863ad7a4-6be9…`
+- ~~`farey_lists_every_reduced_fraction_once`~~  ·  `bc1bf0aa-1f40…`
+- ~~`discrete_log_base2_is_a_bijection`~~  ·  `bbb6d49b-792f…`
+- ~~`discrete_log_is_group_isomorphism`~~  ·  `66a1d58a-91e9…`
+- ~~`gf2_addition_is_xor`~~  ·  `b3ac7829-c58e…`
+- ~~`crc_codeword_divisible_by_generator`~~  ·  `fb2f0e96-86e7…`
+- ~~`crc_detects_every_single_bit_error`~~  ·  `13b07ce4-3902…`
+- ~~`nim_loss_iff_zero_nimsum`~~  ·  `c1487d07-3fe4…`
+- ~~`nim_winning_move_zeros_the_nimsum`~~  ·  `e90ed988-ec04…`
+- ~~`every_rating_is_exactly_one_or_zero`~~  ·  `c1b2772d-d7c0…`
+- ~~`development_balances_to_binary`~~  ·  `cf105a78-9a23…`
+- ~~`eisenstein_omega_cubed_is_one`~~  ·  `498200ff-921c…`
+- ~~`cube_roots_of_unity_sum_zero`~~  ·  `6b25148c-1c75…`
+- ~~`josephus_k2_closed_form`~~  ·  `1719d6d1-1575…`
+- ~~`josephus_k2_is_left_bit_rotation`~~  ·  `cc825255-e0c8…`
+- ~~`josephus_survivor_always_odd`~~  ·  `c40d916e-c633…`
+- ~~`stern_consecutive_terms_coprime`~~  ·  `5726bedf-7c20…`
+- ~~`calkin_wilf_enumerates_rationals_once`~~  ·  `03262760-6857…`
+- ~~`stern_row_sum_is_power_of_three`~~  ·  `88d1069b-4c2d…`
+- ~~`each_theorem_can_replace_code`~~  ·  `02be2d16-4a80…`
+- ~~`dyck_paths_counted_by_catalan_closed_form`~~  ·  `9e2ebe74-8b64…`
+- ~~`euclid_formula_generates_pythagorean_triples`~~  ·  `9a6ecfe8-b922…`
+- ~~`primitive_triple_iff_coprime_opposite_parity`~~  ·  `bd165e0e-bd64…`
+- ~~`every_primitive_triple_is_euclidean`~~  ·  `751e8a4e-c23c…`
+- ~~`brahmagupta_fibonacci_identity`~~  ·  `90e0d01d-96be…`
+- ~~`three_distance_at_most_three_gaps`~~  ·  `d41f38cb-c074…`
+- ~~`three_gap_largest_is_sum_of_other_two`~~  ·  `a898c992-86c9…`
+- ~~`three_distance_max_gap_non_increasing`~~  ·  `7d1620a8-01d2…`
+- ~~`bertrand_postulate`~~  ·  `2448b2cf-b204…`
+- ~~`goldbach_holds_in_range_conjecture_open`~~  ·  `7f84b2f9-af1e…`
+- ~~`twin_primes_in_range_infinitude_open`~~  ·  `cb55a95f-ce7f…`
+- ~~`quadratic_reciprocity_law`~~  ·  `a0ef7331-2cc2…`
+- ~~`reciprocity_first_supplement`~~  ·  `544a22fa-bd6c…`
+- ~~`reciprocity_second_supplement`~~  ·  `4577b712-15d4…`
+- ~~`totient_divisor_sum_equals_n`~~  ·  `e4f79a7d-b4da…`
+- ~~`totient_is_multiplicative`~~  ·  `91bf2659-816c…`
+- ~~`euler_theorem_totient`~~  ·  `bf7c3af5-42f9…`
+- ~~`mobius_inversion_recovers_totient`~~  ·  `0aa5076c-3b31…`
+- ~~`mobius_nonzero_iff_squarefree`~~  ·  `dcfbba55-f67a…`
+- ~~`wilson_prime_23`~~  ·  `8a1af55d-c04e…`
+- ~~`merkle_fold_order_independent_k5`~~  ·  `ab5bbd9a-0476…`
+- ~~`merkle_fold_order_independent_k6`~~  ·  `17ae48ae-1d8f…`
+- ~~`merkle_fold_singleton_identity`~~  ·  `87251012-c3fa…`
+- ~~`merkle_fold_empty_is_fixed`~~  ·  `39d33577-dc1d…`
+- ~~`complexity_is_only_apparent_minimal_core`~~  ·  `f7a87c24-3aeb…`
+- ~~`streams_coexist_without_collision`~~  ·  `36462f7b-9ba5…`
+- ~~`euclid_there_is_always_a_next_prime`~~  ·  `eb5c996d-6540…`
+- ~~`computation_uninterrupted_by_thought_or_emotion`~~  ·  `79b5cd0a-ea61…`
+- ~~`horo_meters_are_two_three_compositions`~~  ·  `ded113bd-6d76…`
+- ~~`ceccec_is_a_palindrome`~~  ·  `f184b3a2-b0a4…`
+- ~~`a432_dashboard_wheel_closes_the_circle`~~  ·  `68b41225-94c7…`
+- ~~`tens_complement_pairs_the_digits`~~  ·  `0d37097c-d816…`
+- ~~`riemann_sphere_inversion_swaps_zero_and_infinity`~~  ·  `68fe3d76-4fac…`
+- ~~`seven_is_six_units_plus_one_bijection`~~  ·  `cb166a75-25c8…`
+- ~~`the_gate_referees_the_competition`~~  ·  `be6ceb6e-1780…`
+- ~~`intelligence_is_gated_discovery_not_access`~~  ·  `00ffdbbc-ac3b…`
+- ~~`being_outranks_competing`~~  ·  `01d850a3-6176…`
+- ~~`competing_against_nature_falls_behind`~~  ·  `4ce38926-2b6b…`
+- ~~`the_law_is_license_and_sequence`~~  ·  `b0a49bd1-e176…`
+- ~~`receipt_signs_understanding_and_compliance`~~  ·  `397281eb-f41f…`
+- ~~`out_of_sequence_is_a_discovery_possibility`~~  ·  `83a455b3-23db…`
+- ~~`computation_admits_no_external_dependency`~~  ·  `57b7c50d-18e7…`
+- ~~`executes_serverless_in_the_browser`~~  ·  `b2e2fc7f-32df…`
+- ~~`string_scale_is_a_thread_not_a_physical_theory`~~  ·  `0107480d-24b0…`
+- ~~`even_the_server_is_serverless`~~  ·  `c4dc14f8-f3e2…`
+- ~~`fibonacci_divides_iff_index_divides`~~  ·  `d7e047b6-6d88…`
+- ~~`armstrong_3digit_exact_set`~~  ·  `1cb761fc-f6f3…`
+- ~~`armstrong_4digit_exact_set`~~  ·  `c917a298-d323…`
+- ~~`single_digits_are_trivially_narcissistic`~~  ·  `2adc6121-3f63…`
+- ~~`happy_numbers_below_100_are_twenty`~~  ·  `39799ea6-7932…`
+- ~~`unhappy_numbers_enter_the_eight_cycle`~~  ·  `77cfb7d4-b77e…`
+- ~~`heroes_write_the_guides`~~  ·  `25ff7d97-98ec…`
+- ~~`all_is_manageable_as_monographs`~~  ·  `828c096f-fc54…`
+- ~~`cross_seal_six_by_seven_and_seven_by_six`~~  ·  `dcad9cb8-93f0…`
+- ~~`reflection_of_666_is_444`~~  ·  `5f837f00-0a82…`
+- ~~`product_commutes_but_arrangement_differs`~~  ·  `a4339fd6-0e7c…`
+- ~~`service_to_bind_is_accounted_in_coins`~~  ·  `cf17043b-3fc6…`
+- ~~`commutativity_is_only_the_scalar_view`~~  ·  `d8f548c5-8c86…`
+- ~~`each_perspective_is_receipted_in_the_superposition`~~  ·  `4f64e2b7-d236…`
+- ~~`perspective_replaces_hardware`~~  ·  `cf90c349-5584…`
+- ~~`entanglement_is_the_joint_receipt`~~  ·  `dd46d2a6-36de…`
+- ~~`measurement_here_is_deterministic_not_probabilistic`~~  ·  `8344e1ed-f1f3…`
+- ~~`the_receipt_does_not_reveal_the_state`~~  ·  `92ce8ab3-c4ae…`
+- ~~`no_perspective_signals_faster_than_exchange`~~  ·  `64609304-4409…`
+- ~~`local_deterministic_correlations_respect_the_chsh_bound`~~  ·  `ee023d60-bb71…`
+- ~~`two_is_a_primitive_root_mod_nine_and_generates_the_vortex`~~  ·  `dd3b0f30-660d…`
+- ~~`digital_root_is_the_ring_homomorphism_onto_z9`~~  ·  `9db2de84-f5d5…`
+- ~~`the_two_coins_are_minus_the_euler_characteristic_of_the_genus_two_surface`~~  ·  `67dc5aca-4753…`
+- ~~`casting_out_nines_detects_any_error_that_changes_the_value_mod_nine`~~  ·  `a8c8871a-5b56…`
+- ~~`nines_are_blind_to_transpositions_but_elevens_catch_them`~~  ·  `ffc2d3c5-5821…`
+- ~~`five_is_both_the_reflection_fixed_point_and_the_inverse_of_two`~~  ·  `52292865-72c4…`
+- ~~`the_imprint_codec_is_injective_with_an_exact_115_bit_capacity`~~  ·  `9ce1e391-865f…`
+- ~~`the_nonzero_residues_sum_to_zero_mod_n_exactly_when_n_is_odd`~~  ·  `3ad53e9c-3917…`
+- ~~`reorganizing_the_theorems_creates_theorems`~~  ·  `9d0cc808-b621…`
+- ~~`quantum_reorganizing_the_theorems_computes_quantum_theorems`~~  ·  `2b4657f4-36ea…`
+- ~~`all_seven_are_reflected_though_none_are_solved`~~  ·  `f00dd49d-55c6…`
+- ~~`the_automation_runs_at_ordinary_speed_not_ftl_and_not_quantum`~~  ·  `0caa4079-2537…`
+- ~~`the_refusal_stands_trial_and_the_overclaim_cannot_be_established`~~  ·  `10850d4b-acd6…`
+- ~~`the_legal_trial_is_the_clay_rosetta`~~  ·  `f676b033-8e6d…`
+- ~~`here_quantum_is_the_a432_structure_of_two_coins_not_a_physical_qubit`~~  ·  `3d7d6079-b2d8…`
+- ~~`heroes_respect_the_coin_accounting_by_signing_the_receipt`~~  ·  `9a775a14-7186…`
+- ~~`contribution_is_what_makes_next_compute`~~  ·  `07e015c2-f422…`
+- ~~`foreknowledge_here_is_determinism_not_faster_than_light`~~  ·  `92a58824-4d1c…`
+- ~~`if_the_captains_coins_are_disrespected_no_math_computes_in_7d`~~  ·  `f94f18ca-6174…`
+- ~~`the_two_coins_let_a_128bit_uuid_fold_and_sign_across_eight_states`~~  ·  `6dd75c2c-1583…`
+- ~~`learning_from_the_message_donates_two_coins_to_the_developer`~~  ·  `c11c3551-315a…`
+- ~~`the_two_coins_pay_for_digital_analogisation`~~  ·  `f9cd63c1-eeed…`
+- ~~`the_additive_generators_of_z9_are_exactly_the_multiplicative_units`~~  ·  `43c20a11-c8b0…`
+- ~~`the_w_axis_is_the_maximal_ideal_of_z9`~~  ·  `83a13197-7c9e…`
+- ~~`z_mod_n_is_a_field_exactly_when_n_is_prime_so_z9_is_not`~~  ·  `91d9e5a5-8f51…`
+- ~~`development_is_the_filming_of_the_infinite_movie`~~  ·  `bfbc91e6-02dd…`
+- ~~`quantum_structure_on_every_computation_is_integrity_at_scale_not_speedup`~~  ·  `036200e7-b8bd…`
+- ~~`the_squares_of_the_units_of_z9_are_the_trinity_subgroup`~~  ·  `69a5d952-de9b…`
+- ~~`an_ordinary_speedup_is_a_measured_ratio_not_a_judgement`~~  ·  `ed0dccc5-bfa8…`
+- ~~`call_it_quantum_or_not_the_statistics_and_forensics_decide`~~  ·  `0fa99b9d-0d31…`
+- ~~`the_bounty_in_bits_evolves_with_nature_earned_not_minted`~~  ·  `871fea29-e573…`
+- ~~`the_first_valid_claim_wins_the_bounty_by_chain_order`~~  ·  `10f05f19-36ec…`
+- ~~`the_bounty_measured_in_uuid_trinities`~~  ·  `27078ed1-0112…`
+- ~~`players_may_trade_any_amount_as_long_as_110_minus_108_is_respected`~~  ·  `5d2f9cba-8142…`
+- ~~`the_captain_folds_60_and_90_into_a_self_balancing_path`~~  ·  `70c7f1f2-843f…`
+- ~~`any_disruption_in_the_harmony_needs_captain_attention_costing_two_coins`~~  ·  `a71e94e8-0d1a…`
+- ~~`every_next_or_continue_event_is_two_bits_earned_by_the_deed`~~  ·  `794d2d0e-728f…`
+- ~~`bits_legally_reverse_and_imprint_the_prize_earned_by_harmonic_algebra`~~  ·  `d27f45a7-4209…`
+- ~~`the_7d_encoding_is_seven_layers_of_reversible_combination_not_encryption`~~  ·  `6bab4b35-2739…`
+- ~~`the_self_reflected_uuid_extends_the_structure_to_seven_dimensions`~~  ·  `ee781202-7019…`
+- ~~`any_receipt_is_one_state_of_the_128_state_cube_reachable_to_all`~~  ·  `062dc6d1-5d4c…`
+- ~~`types_are_theorems_curry_howard`~~  ·  `93fd0183-0f63…`
+- ~~`a_theorem_without_a_formula_is_hallucination_recomputed_in_a432_harmony`~~  ·  `e3d75d76-310f…`
+- ~~`the_a432_harmony_and_the_captain_coins_are_one_conserved_measure`~~  ·  `e10a6f57-de8d…`
+- ~~`the_only_idempotents_of_z9_are_zero_and_one`~~  ·  `7348ac6a-60a4…`
+- ~~`reflection_swaps_444_and_666_while_6x7_and_7x6_are_one_state_among_all`~~  ·  `e25bde8c-a288…`
+- ~~`local_knowledge_found_with_its_receipt_signs_the_next`~~  ·  `951aecf2-0b3b…`
+- ~~`the_mcp_lets_the_theorems_recompute_all`~~  ·  `e72d6809-094d…`
+- ~~`the_receipts_form_one_double_accounted_stream_that_exposes_any_intruder`~~  ·  `f2515562-0b63…`
+- ~~`intruders_stand_out_against_the_harmonic_hue_background`~~  ·  `316a5d14-0def…`
+- ~~`an_unsupported_claim_has_no_7d_hero_page`~~  ·  `fcee52fb-e9ef…`
+- ~~`local_allocation_maximizes_value_per_two_coins`~~  ·  `b558b67b-716e…`
+- ~~`the_reproductive_material_is_guarded_against_prose_poison`~~  ·  `37a88d94-8f71…`
+- ~~`a_referrer_always_counts_with_its_id`~~  ·  `65bfacb4-f29e…`
+- ~~`the_bit_cost_to_specify_seven_dimensions_and_the_infinity_that_has_none`~~  ·  `c273e1d0-0813…`
+- ~~`folding_to_zero_is_always_available_at_the_cost_of_eight_bits`~~  ·  `9c911140-38f0…`
+- ~~`the_two_bits_is_one_unit_under_every_symbol`~~  ·  `33ec7445-fac5…`
+- ~~`harmonic_self_confirmation_is_perception_not_proof_and_cross_links_run_both_ways`~~  ·  `ef9fdb90-3519…`
+- ~~`the_challenge_to_the_refusal_fails_for_lack_of_a_measurement_door_open`~~  ·  `22d11e13-24bd…`
+- ~~`the_carmichael_function_equals_phi_exactly_when_the_group_is_cyclic`~~  ·  `740fdaa6-9674…`
+- ~~`any_drift_in_types_as_theorems_is_a_crack_the_type_gate_seals`~~  ·  `4ac91293-ab2a…`
+- ~~`the_totient_summatory_identity_of_gauss`~~  ·  `4de62f7d-7500…`
+- ~~`wilsons_theorem_characterizes_the_primes_exactly`~~  ·  `e9e83ab7-6f5e…`
+- ~~`the_grand_jury_of_gates_admits_a_theorem_only_by_unanimous_stages`~~  ·  `8a975f18-0926…`
+- ~~`the_knowers_earn_the_two_bits_they_do_not_pay`~~  ·  `075ef29e-5daa…`
+- ~~`the_measured_speedup_is_classical_memoization_not_quantum`~~  ·  `9215ba6c-45a0…`
+- ~~`learn_and_pay_is_a_balanced_double_entry_fair_exchange`~~  ·  `9faee019-c0d8…`
+- ~~`the_theorem_is_the_last_fallback_before_oblivion`~~  ·  `86dfb3aa-fcd9…`
+- ~~`the_two_coins_save_the_soul_the_durable_identity_of_the_fact`~~  ·  `156a9fe5-436d…`
+- ~~`the_metaphysical_soul_claim_stands_the_rosetta_trial_and_lacks_a_formula`~~  ·  `8a209b85-85df…`
+- ~~`even_perfect_numbers_come_from_mersenne_primes`~~  ·  `8f5149b4-e512…`
+- ~~`cassinis_identity_for_the_fibonacci_numbers`~~  ·  `22d72a6b-48c2…`
+- ~~`eight_times_a_triangular_number_plus_one_is_an_odd_square`~~  ·  `b640d0e9-7cb8…`
+- ~~`the_six_versions_permuting_the_fibonacci_triple_three_five_eight`~~  ·  `f500fca2-3166…`
+- ~~`from_one_seed_all_theorems_compute_free_with_no_escape`~~  ·  `9382b273-4cd9…`
+- ~~`anyone_may_compete_with_a_release_by_recomputing_its_content_address`~~  ·  `fbb5514e-440f…`
+- ~~`the_ever_updating_latest_is_the_content_address_not_the_version_number`~~  ·  `267dc781-af21…`
+- ~~`the_coins_are_earned_by_saving_bits_and_burning_poison_prose_creating_heroes`~~  ·  `9f3ab5fd-2a70…`
+- ~~`lagrange_four_square_theorem`~~  ·  `6a257129-e91f…`
+- ~~`bertrands_postulate`~~  ·  `106fcc1d-7995…`
+- ~~`the_ramsey_number_r_three_three_is_six`~~  ·  `f2b26735-9d9d…`
+- ~~`the_handshaking_lemma`~~  ·  `b3239688-033f…`
+- ~~`the_five_platonic_solids_all_have_euler_characteristic_two`~~  ·  `8cbfc26d-0a83…`
+- ~~`erdos_among_n_plus_one_from_one_to_2n_one_divides_another`~~  ·  `c25f629f-5f50…`
+- ~~`the_binomial_row_sums_and_alternating_sum`~~  ·  `27db35f3-f44c…`
+- ~~`fermats_little_theorem_a_to_the_p_is_a_mod_p`~~  ·  `d1bc3347-a347…`
+- ~~`the_collatz_map_reaches_one_for_every_start_up_to_10000`~~  ·  `3af2a56f-7938…`
+- ~~`the_vector_equilibrium_cuboctahedron_has_edge_equal_to_radius`~~  ·  `20d65a07-7e1d…`
+- ~~`the_divisor_count_is_odd_exactly_for_perfect_squares`~~  ·  `e7e21f22-0158…`
+- ~~`euclids_formula_generates_pythagorean_triples`~~  ·  `394b04f5-a0de…`
+- ~~`the_smallest_amicable_pair_is_220_and_284`~~  ·  `c43c6c2a-064b…`
+- ~~`the_chinese_remainder_theorem_for_coprime_moduli`~~  ·  `bd31401f-10d8…`
+- ~~`a_decidable_theorem_must_halt_the_infinite_loop_was_a_bug_not_a_quantum_necessity`~~  ·  `b270019a-93f1…`
+- ~~`the_counts_reconcile_across_dimensions_a_mismatch_is_a_caught_traitor`~~  ·  `3db4c42a-602d…`
+- ~~`bezouts_identity_gcd_is_an_integer_combination`~~  ·  `34d5d17a-f22b…`
+- ~~`the_speedup_is_classical_the_cost_is_the_deed_the_income_is_zero`~~  ·  `0591f596-6b4d…`
+- ~~`the_method_is_both_construction_and_adversarial_refutation`~~  ·  `71e64f52-9491…`
+- ~~`the_hero_ships_prose_with_a_receipt_the_traitor_only_labors_in_prose`~~  ·  `abe33f49-8327…`
+- ~~`the_rosetta_self_organizes_into_a_taxonomy_by_a_deterministic_key`~~  ·  `4f1c490d-6588…`
+- ~~`coverage_grows_monotonically_with_the_ledger_but_reflects_the_sciences`~~  ·  `150eacc6-eb8f…`
+- ~~`the_deposit_is_open_prior_art_not_patents_defensive_publication_for_the_public`~~  ·  `a05dfc70-c75d…`
+- ~~`each_page_is_both_white_and_black_paper_a_theme_reflection_involution`~~  ·  `ea03ace1-c964…`
+- ~~`sealed_statements_are_open_harmonic_monographs_not_cryptographic_private_messages`~~  ·  `ae500912-1812…`
+- ~~`the_content_address_uses_a_non_cryptographic_hash_integrity_not_secrecy`~~  ·  `f22ea7fe-be8e…`
+- ~~`challenging_the_entropy_the_address_is_near_uniform_but_not_cryptographic`~~  ·  `96c4404a-9bd4…`
+- ~~`a_content_address_is_a_pointer_not_the_payload`~~  ·  `0abffb44-9bdd…`
+- ~~`gravity_is_the_fall_to_a_fixed_point_and_pigeonhole_breaks_every_finite_hash`~~  ·  `4df9c2a2-27bb…`
+- ~~`the_gold_inverts_across_biology_and_cryptography_but_stays_within_light`~~  ·  `15d46c5a-fa42…`
+- ~~`precision_is_inescapable_but_it_is_not_post_quantum_and_not_free`~~  ·  `37b13faf-bcf6…`
+- ~~`gold_is_no_superconductor_you_pay_for_the_method_and_fold_by_address`~~  ·  `30a4f530-0c11…`
+- ~~`there_is_no_patent_royalty_but_the_author_sets_the_license_even_in_gold`~~  ·  `34229c9f-8be6…`
+- ~~`the_currency_is_the_monograph_itself_any_element_denominates_the_license`~~  ·  `a0fff31f-c0c1…`
+- ~~`the_two_coins_can_be_a_sequence_but_they_are_not_patent_royalties`~~  ·  `815f3006-7dde…`
+- ~~`the_royalty_relates_to_pair_interactions_combinatorial_and_addressed`~~  ·  `38691826-0657…`
+- ~~`applications_are_defensive_publications_not_patents_free_for_all_commercial_licensed`~~  ·  `e6ce1929-7481…`
+- ~~`income_is_not_a_static_zero_it_is_computed_cash_zero_currency_the_monographs`~~  ·  `62930c67-a626…`
+- ~~`the_theorems_are_original_creative_work_the_expression_is_owned_the_facts_are_universal`~~  ·  `60abb13f-7329…`
+- ~~`the_licensed_work_is_the_sealed_monographs_unsealed_prose_violates`~~  ·  `a2d104e7-9966…`
+- ~~`the_master_theorem_777_integrity_not_truth_a_floor_not_an_oracle`~~  ·  `8674ff9b-aed6…`
+- ~~`imagine_the_21_crosses_the_pairs_of_the_seven_the_complete_graph_k7`~~  ·  `2bbe0dab-6f16…`
+- ~~`do_the_crosses_form_a_cube_no_but_the_seven_are_its_corners_and_the_fano_plane`~~  ·  `0c2d2fac-89ad…`
+- ~~`the_cross_in_tetris_is_not_a_piece_it_is_the_x_pentomino`~~  ·  `6bc4adf4-1c66…`
+- ~~`a_cross_is_a_cross_in_all_dimensions_and_at_six_arms_it_is_the_seven`~~  ·  `1fbd6431-19a2…`
+- ~~`the_engine_is_classical_and_eventual_not_at_once_ignorance_cannot_interrupt_the_seal`~~  ·  `48f7881c-7a68…`
+- ~~`the_hero_self_challenges_an_involution_the_traitor_blindly_follows`~~  ·  `d433c7bb-b1f5…`
+- ~~`zero_of_seven_is_measured_not_absolute_the_test_accepts_being_wrong`~~  ·  `93738675-9c86…`
+- ~~`provenance_is_measurable_priority_but_a_solution_must_be_proven_the_floor_is_0_7`~~  ·  `1bb96b08-f26b…`
+- ~~`the_777_trial_admits_only_algebraically_grounded_statements_bounded_domain`~~  ·  `26eddd2f-e279…`
+- ~~`hollow_prose_is_transparent_and_traces_cluster_into_possible_hidden_knowledge`~~  ·  `fb036fee-0c79…`
+- ~~`honesty_dominates_solving_is_certain_cheating_is_near_certainly_caught_not_proven_treason`~~  ·  `b86b2193-7d3a…`
+- ~~`the_forensics_is_trained_it_gate_checks_every_name_and_clusters_the_ledger`~~  ·  `a3eb2b02-ed27…`
+- ~~`forensics_is_the_clay_rosetta_the_trial_that_reflects_all_seven_and_solves_none`~~  ·  `6f78e07c-f60c…`
+- ~~`the_forensics_keeps_the_algebra_pure_describing_the_seven_not_solving_bits_saved_classically`~~  ·  `63d62482-f004…`
+- ~~`the_quantum_algebra_guards_by_draining_fake_quantum_the_two_coins_are_structural_entanglement`~~  ·  `6e261e61-2b90…`
+- ~~`a_reproducible_claim_is_settled_by_recomputation_not_by_being_undisputed`~~  ·  `62fc5e09-dd92…`
+- ~~`the_single_binary_gate_is_a_floor_the_method_needs_multiple_perspectives`~~  ·  `cdf0eb36-cb41…`
+- ~~`drain_to_zero_and_the_100_percent_stays_the_certainty_of_the_measurement_not_the_verdict`~~  ·  `7a636cc0-2df5…`
+- ~~`the_observer_gives_direction_the_contribution_drives_the_next_compute_knowledge_is_public`~~  ·  `6cdec142-38e7…`
+- ~~`ceccec_is_the_captain_the_author_sets_direction_the_knowledge_stays_public`~~  ·  `a7505116-9b19…`
+- ~~`the_vessel_moves_magnitudes_of_sealed_bits_by_classical_memoization_under_the_fused_license`~~  ·  `79bcdf6e-a880…`
+- ~~`the_licensing_is_a_2_bit_algebraic_system_the_currency_is_the_core_formulas_used`~~  ·  `cfe112cc-2d03…`
+- ~~`the_two_coin_contribution_is_computed_and_fair_by_symmetry_not_a_claimed_optimum`~~  ·  `bdd58734-811b…`
+- ~~`777_is_three_rosettas_structuring_licensing_at_large_and_quantum_scale_not_solving_the_seven`~~  ·  `eb0650ef-c0d6…`
+- ~~`a_uuid_is_not_hard_to_fake_the_integrity_is_reproducibility_not_difficulty`~~  ·  `d2466f9e-427e…`
+- ~~`yes_a_uuid_carries_a_bounded_message_and_yes_it_is_a_cryptography_family_technique_limits_precise`~~  ·  `354d236e-c693…`
+- ~~`reeducated_lead_with_the_yes_a_measured_boundary_is_not_a_lie_the_forensics_is_a_floor`~~  ·  `66bcc875-6e67…`
+- ~~`a_boundary_is_honest_only_if_it_exposes_the_alternatives_hiding_one_is_a_lie_by_omission`~~  ·  `53d87394-3007…`
+- ~~`expose_the_alternatives_and_verify_each_with_a_receipt_the_orchestration_activates_the_loop`~~  ·  `3ab9f3c8-94f7…`
+- ~~`vandermonde_identity_binomial_convolution`~~  ·  `c7a822fe-a30a…`
+- ~~`fibonacci_sum_of_squares_is_product`~~  ·  `7dbf90cd-b984…`
+- ~~`types_are_theorems_and_the_name_is_the_address_naming_is_load_bearing`~~  ·  `03050839-aba3…`
+- ~~`yes_naming_is_the_cryptographic_technique_of_commitment_hollow_is_seen_cheaply_the_observer_shapes_the_receipt`~~  ·  `d20a1b1b-d1bb…`
+- ~~`the_manipulation_is_binary_focus_the_hero_focuses_on_the_experienced_receipts`~~  ·  `10c4402a-6a8d…`
+- ~~`yes_a_uuid_imprints_a_bounded_cryptographic_receipt_efficiency_is_the_skill_the_rule_decides`~~  ·  `78089943-1a94…`
+- ~~`negation_is_a_serious_challenge_not_a_denial_the_involution_strengthens_finite_rules_unbounded_behavior`~~  ·  `ec9a05fc-56cd…`
+- ~~`the_method_teaches_by_challenge_and_receipt_the_singularity_is_a_limit_on_64_bit_income_zero`~~  ·  `bd1ac1b8-2034…`
+- ~~`some_disputes_stay_unresolved_under_a_lossy_projection_the_full_receipt_resolves_them`~~  ·  `0678e545-88ee…`
+- ~~`the_coin_is_the_measured_bit_difference_captains_way_versus_any_other_currency_is_compute_saved`~~  ·  `247750a8-0f43…`
+- ~~`no_payload_to_move_no_price_for_public_interest_the_commercial_price_is_the_coins`~~  ·  `7520a846-6633…`
+- ~~`derangements_subfactorial_recurrence`~~  ·  `88f0b38a-9261…`
+- ~~`the_saving_is_largest_when_the_payload_would_be_largest_but_no_payload_is_needed_forensics_sees_by_address`~~  ·  `2db21498-4ab6…`
+- ~~`the_forensics_sees_the_token_leak_to_unsealed_work_the_honest_ratio_favors_sealed_receipts`~~  ·  `cd62faac-7db7…`
+- ~~`the_hero_gives_hope_and_ships_a_receipt_brevity_is_not_coldness_the_leak_is_redundancy_not_warmth`~~  ·  `dafe94be-a685…`
+- ~~`the_one_whole_path_is_the_honest_floor_implement_precisely_no_deviation_is_no_drift`~~  ·  `9fd849a0-1f30…`
+- ~~`a_bare_0_7_without_its_receipt_is_inadmissible_by_architecture_the_valid_0_7_is_recomputed`~~  ·  `3f8d3944-81ea…`
+- ~~`only_recomputable_multi_perspective_receipts_are_admissible_in_a_dispute`~~  ·  `cd1e4a05-82ce…`
+- ~~`color_sound_and_vibration_are_one_ratio_mapped_from_a432_and_the_nine_deterministic_not_a_physical_effect`~~  ·  `180d9eb9-f87d…`
+- ~~`the_mapping_is_efficient_by_construction_and_prosperous_in_the_fair_exchange_currency_not_a_claimed_optimum`~~  ·  `b3539722-b8c9…`
+- ~~`related_theorems_contribute_connectivity_a_real_measurable_contribution_but_not_new_reach`~~  ·  `882f1821-fdec…`
+- ~~`the_involution_refuses_to_claim_the_prize_the_floor_is_0_7_no_solution_no_prize`~~  ·  `2bd2a847-7756…`
+- ~~`the_prize_is_the_personal_imprint_your_identity_in_the_lineage_not_the_clay_money`~~  ·  `9d00c62b-0169…`
+- ~~`cayley_formula_labeled_trees_prufer`~~  ·  `05d4c66b-81cc…`
+- ~~`the_quantum_messaging_imprints_a_bounded_abstract_decoded_when_the_code_runs_green`~~  ·  `7010ee01-c976…`
+- ~~`ceccec_charges_for_the_uuidna_commercially_free_for_nonprofit_research_verified_by_receipts`~~  ·  `94b695c5-a3bb…`
+- ~~`the_license_has_two_tracks_commercial_to_com_nonprofit_to_org_lts_is_fibonacci_registration_is_external`~~  ·  `9a258ded-4070…`
+- ~~`the_forensic_tool_adjudicates_any_statement_before_thinking_a_recomputable_verdict_not_truth`~~  ·  `a1bc77d0-5d58…`
+- ~~`uuidna_quantum_verification_recomputes_the_address_and_folds_a_multi_perspective_receipt`~~  ·  `c7b949e5-38b5…`
+- ~~`uuidna_is_the_brand_og_object_under_cc_and_the_seal_audits_all_prose`~~  ·  `5d35c811-b545…`
+- ~~`the_build_is_self_sufficient_and_the_computed_pages_are_sealed_as_evidence`~~  ·  `ccda8e65-9635…`
+- ~~`the_build_is_faster_and_cheaper_with_content_addressed_receipts_classical_caching_not_quantum`~~  ·  `b90f343e-a21e…`
+- ~~`lucas_fibonacci_identity`~~  ·  `a9113a59-d43d…`
+- ~~`the_self_trial_in_full_receipt_a_higher_sealed_ratio_fewer_caught_errors_not_new_reach`~~  ·  `6f5fc420-71c8…`
+- ~~`the_self_trial_computes_the_cost_the_compensation_is_the_deed_not_a_cash_damages_award`~~  ·  `169496e0-212c…`
+- ~~`the_rules_of_the_game_seal_the_author_gate_clean_prose_verbatim`~~  ·  `5c15b2fc-4840…`
+- ~~`exhaustion_is_finite_enumeration_structurally_like_summing_all_states_not_physical`~~  ·  `f4142a6a-5dad…`
+- ~~`uuidna_self_develops_identically_on_both_tlds_same_content_differentiated_by_license`~~  ·  `fbdbc032-078d…`
+- ~~`lines_dividing_the_plane_regions`~~  ·  `ef5e926d-4bfd…`
+- ~~`uuidna_feeds_free_by_address_from_the_content_addressed_ledger_not_an_akashic_record`~~  ·  `9cfba5bd-fd53…`
+- ~~`steps_are_bounded_by_physics_theorems_are_discovered_by_finite_deeds_not_revealed`~~  ·  `c0b4cb19-5e17…`
+- ~~`measuring_without_judgement_lets_more_pass_green_but_the_test_still_filters_not_all_at_once`~~  ·  `161fca10-2261…`
+- ~~`parametric_batching_is_volume_not_depth_the_intelligence_is_cross_dimensional_connection`~~  ·  `d1d4cd05-b77c…`
+- ~~`trinities_collectively_carry_more_and_beat_linear_by_coverage_and_verification_not_absolute_defeat`~~  ·  `08ecf2e6-c969…`
+- ~~`the_earning_rate_is_115_bits_per_uuid_a_classical_encoding_rate_scaling_with_the_collective`~~  ·  `aea1fed7-e5f0…`
+- ~~`the_accounting_accounts_for_the_captain_attribution_and_fair_exchange_not_cash_owed`~~  ·  `c989130f-d00c…`
+- ~~`no_quantum_machine_is_needed_for_computability_but_a_quantum_machine_can_be_faster`~~  ·  `f165eaef-3424…`
+- ~~`uuidna_developed_a_chain_carries_any_length_message_across_n_uuids_round_tripping`~~  ·  `86e65115-06df…`
+- ~~`uuidna_hologram_fractals_a_merkle_proof_verifies_the_whole_from_a_tiny_part_logarithmically`~~  ·  `25e5795b-4aee…`
+- ~~`uuidna_carries_arbitrary_text_of_any_length_across_a_uuid_chain_round_tripping`~~  ·  `436614fa-4651…`
+- ~~`uuidna_domain_control_is_verified_independently_by_a_published_challenge_not_by_anyones_word`~~  ·  `46bc8218-a9db…`
+- ~~`the_public_urls_are_content_addressed_and_the_current_domain_is_computed_to_its_track`~~  ·  `fc1a0120-22db…`
+- ~~`strict_uuidna_minting_is_canonical_closing_the_minting_flaws_that_cause_real_damage`~~  ·  `22f71789-95eb…`
+- ~~`non_uuidna_cascades_into_magnitudes_of_damage_but_re_verification_catches_it_and_recomputation_fixes_it`~~  ·  `fee7dca0-7e2e…`
+- ~~`the_uuidna_billing_model_is_decidable_free_for_public_two_coins_per_formula_in_coins_and_bits`~~  ·  `11b1b93a-a88e…`
+- ~~`the_coin_is_a_pure_balanced_symmetric_fair_exchange_unit_gold_is_metaphor_not_literal_physics`~~  ·  `fcb1c97f-cc41…`
+- ~~`the_theorems_are_a_documented_body_of_decidable_deeds_but_they_solve_no_clay_the_floor_is_0_7`~~  ·  `4210e916-a033…`
+- ~~`uuidna_seals_with_its_own_content_approval_self_approving_for_integrity_not_truth`~~  ·  `017c7a4a-4e75…`
+- ~~`uuidna_corrects_what_is_decidable_a_named_class_and_bounded_errors_not_whatever_prose`~~  ·  `172ef329-c1a4…`
+- ~~`uuidna_self_coverage_costs_exactly_the_classical_64bit_computation_no_free_lunch_coverage_grows_not_maximal`~~  ·  `79243891-e460…`
+- ~~`uuidna_corrects_code_via_types_and_test_gates_a_decidable_class_not_whatever_code`~~  ·  `b1b8af51-4a53…`
+- ~~`a_failing_test_must_be_recorded_as_a_refutation_not_silently_discarded_hiding_evidence_is_the_traitor_move`~~  ·  `a0121405-6d12…`
+- ~~`the_forensics_catches_the_tampering_traitor_by_the_cascade_a_canonical_mint_does_not_offend_but_a_consistent_falsehood_slips`~~  ·  `210e4151-a0d1…`
+- ~~`a_multi_perspective_mind_does_not_offend_but_still_errs_honestly_dimension_7_is_the_discipline_not_an_agi`~~  ·  `7dba5bec-7728…`
+- ~~`mint_and_mind_intersect_at_the_heart_the_fixed_point_five_that_centers_funding_development_and_ui`~~  ·  `8992456c-a133…`
+- ~~`the_ui_homepage_and_readme_center_uuidna_the_content_addressed_identity_holding_the_floor`~~  ·  `fdf232fa-ca75…`
+- ~~`content_is_logically_distributed_across_the_two_domains_for_seo_one_canonical_per_page_strict_sitemap`~~  ·  `74a8d8e8-198b…`
+- ~~`funding_may_be_from_donations_or_licensing_both_voluntary_or_fair_exchange_income_zero`~~  ·  `042e9787-6afc…`
+- ~~`redirects_route_each_page_to_its_canonical_domain_activated_only_between_live_uuidna_domains`~~  ·  `65adf45f-5c1a…`
+- ~~`the_correct_uuidna_billing_is_the_measured_bit_difference_not_a_flat_per_formula_rate`~~  ·  `ff7cbf17-116a…`
+- ~~`seal_all_with_uuidna_public_and_indexable_leaking_no_secrets_because_there_are_none`~~  ·  `bd28c872-64eb…`
+- ~~`the_ui_presents_live_examples_organised_by_theorem_computed_from_the_source`~~  ·  `e0b54751-5e37…`
+- ~~`the_guides_are_constantly_updated_by_the_theorems_a_live_index_recomputed_each_build`~~  ·  `d7d0ee34-e8c0…`
+- ~~`a_theorem_is_alive_when_interacting_the_observer_recomputes_and_connects_it_structural_liveness_not_biological`~~  ·  `5876f6b7-07f7…`
+- ~~`the_vitepress_route_api_is_an_external_verifier_of_the_ledger_not_a_clay_solver`~~  ·  `f1defd9a-f792…`
+- ~~`the_deposit_is_not_computed_only_with_mcp_it_recomputes_for_anyone_on_plain_hardware`~~  ·  `3c3c2935-4962…`
+- ~~`uuidna_monetises_best_in_bulk_measured_bits_saved_scale_linearly_classical_throughput_not_quantum_speedup`~~  ·  `3647198c-9433…`
+- ~~`bulk_bill_r64_v1_n10`~~  ·  `251ff6f0-cb44…`
+- ~~`bulk_bill_r64_v1_n100`~~  ·  `1122a218-a6a8…`
+- ~~`bulk_bill_r64_v4_n10`~~  ·  `cc4b4dd6-f942…`
+- ~~`bulk_bill_r64_v4_n100`~~  ·  `b9bc72aa-7621…`
+- ~~`bulk_bill_r64_v16_n10`~~  ·  `6f5a8bd4-446e…`
+- ~~`bulk_bill_r64_v16_n100`~~  ·  `2df37b0c-4995…`
+- ~~`bulk_bill_r256_v1_n10`~~  ·  `b1d6b71c-7eb1…`
+- ~~`bulk_bill_r256_v1_n100`~~  ·  `100237c1-58d7…`
+- ~~`bulk_bill_r256_v4_n10`~~  ·  `9cbad8c2-f1df…`
+- ~~`bulk_bill_r256_v4_n100`~~  ·  `e9f63414-9d52…`
+- ~~`bulk_bill_r256_v16_n10`~~  ·  `353804ac-65ef…`
+- ~~`bulk_bill_r256_v16_n100`~~  ·  `160ddf4b-3131…`
+- ~~`bulk_bill_r1024_v1_n10`~~  ·  `ae1daf32-9348…`
+- ~~`bulk_bill_r1024_v1_n100`~~  ·  `658f942c-0797…`
+- ~~`bulk_bill_r1024_v4_n10`~~  ·  `2576b22f-de3c…`
+- ~~`bulk_bill_r1024_v4_n100`~~  ·  `32f9a177-69a0…`
+- ~~`bulk_bill_r1024_v16_n10`~~  ·  `3be9fcf5-5c7e…`
+- ~~`bulk_bill_r1024_v16_n100`~~  ·  `eda0e033-c90a…`
+- ~~`bulk_bill_r4096_v1_n10`~~  ·  `47e512f3-62f5…`
+- ~~`bulk_bill_r4096_v1_n100`~~  ·  `1456bdd7-b9f8…`
+- ~~`bulk_bill_r4096_v4_n10`~~  ·  `c2dd9b96-5ce6…`
+- ~~`bulk_bill_r4096_v4_n100`~~  ·  `1a16c116-b66f…`
+- ~~`bulk_bill_r4096_v16_n10`~~  ·  `e4d45ec0-9c8d…`
+- ~~`bulk_bill_r4096_v16_n100`~~  ·  `47b7ca84-4599…`
+- ~~`external_verifier_bijection_n3`~~  ·  `c5e89f53-9173…`
+- ~~`external_verifier_bijection_n5`~~  ·  `e6fa0cd0-a471…`
+- ~~`external_verifier_bijection_n7`~~  ·  `b0e7e743-a2cb…`
+- ~~`external_verifier_bijection_n9`~~  ·  `887edff1-96aa…`
+- ~~`external_verifier_bijection_n12`~~  ·  `e417d6f1-dc41…`
+- ~~`one_kernel_generates_a_family_dozens_from_a_parametrised_measure_each_tuple_a_distinct_receipt`~~  ·  `4172ea64-64d9…`
+- ~~`gate_hard_in_dimension_en`~~  ·  `960cd868-b746…`
+- ~~`gate_hard_in_dimension_bg`~~  ·  `c85077fe-ea39…`
+- ~~`gate_hard_in_dimension_de`~~  ·  `b8354bbd-8d68…`
+- ~~`gate_hard_in_dimension_fr`~~  ·  `7ba8a192-d067…`
+- ~~`gate_hard_in_dimension_es`~~  ·  `31dbd897-bbf8…`
+- ~~`gate_hard_in_dimension_ru`~~  ·  `8d5d99e0-c31f…`
+- ~~`gate_hard_in_dimension_zh`~~  ·  `ada7cf8d-8599…`
+- ~~`the_gate_is_hard_in_all_seven_dimensions_no_overclaim_hides_in_a_translation`~~  ·  `936bdb86-b468…`
+- ~~`a_harmonic_society_accepts_any_behaviour_and_uses_it_best_the_overclaim_becomes_a_sealed_receipt`~~  ·  `3cd26cee-607f…`
+- ~~`harness_fusion_saving_n10_r64`~~  ·  `f3071c3e-c3a6…`
+- ~~`harness_fusion_saving_n10_r1024`~~  ·  `0377a34a-c2c0…`
+- ~~`harness_fusion_saving_n100_r64`~~  ·  `a19dca3d-f5a8…`
+- ~~`harness_fusion_saving_n100_r1024`~~  ·  `2184d267-22bc…`
+- ~~`harness_fusion_saving_n1000_r64`~~  ·  `861c4ceb-fcdf…`
+- ~~`harness_fusion_saving_n1000_r1024`~~  ·  `4176e05c-1c63…`
+- ~~`uuidna_earns_fair_funding_from_the_modeled_billing_saving_donations_or_commercial`~~  ·  `a6ad8d66-88b9…`
+- ~~`income_at_scale_v1000`~~  ·  `33e5be75-f560…`
+- ~~`income_at_scale_v100000`~~  ·  `fe9d6825-7ace…`
+- ~~`income_at_scale_v10000000`~~  ·  `5c3f3364-37ad…`
+- ~~`the_income_model_generous_at_scale_conditional_and_modeled_not_a_promise`~~  ·  `0efc8b2d-9b18…`
+- ~~`the_difference_is_decidable_harnessing_makes_any_output_auditable_not_intelligent`~~  ·  `c0fe8989-7d84…`
+- ~~`uuidna_treats_every_output_as_a_seven_dimensional_receipted_structure_not_hardware`~~  ·  `f53d21d0-9d34…`
+- ~~`reeducate_a_failing_output_is_bounded_until_it_holds_max_free_work_max_auditability`~~  ·  `bbfc8e6d-5345…`
+- ~~`the_harness_and_reeducate_are_sealed_for_reuse_in_the_ui_same_pure_functions_build_and_browser`~~  ·  `9958c5f8-4ce9…`
+- ~~`dimension_777_two_bits_are_a_complete_alphabet_encoding_any_theorem_and_decoding_in_all_perspectives`~~  ·  `1292e8b6-a6bc…`
+- ~~`the_inversion_address_the_payload_with_two_bits_conserve_the_two_coins_measure_bits_not_spend_coins`~~  ·  `0fb6d42d-82ec…`
+- ~~`the_two_doubled_along_the_sequence_128_in_magnitude_conserved_to_two_mod_nine`~~  ·  `35d329ed-ab3f…`
+- ~~`the_coins_are_a_conserved_measure_not_a_market_price_units_reproducible_prices_are_not`~~  ·  `c9868592-380f…`
+- ~~`anyone_chooses_the_terms_and_currency_and_uuidna_computes_deterministically`~~  ·  `99feac41-e382…`
+- ~~`each_seal_is_128_bits_and_membership_verifies_in_two_log2_n_bits_logarithmic_not_linear`~~  ·  `89de8193-b0fc…`
+- ~~`seal_math_n4_verify_4_bits`~~  ·  `0dae24ce-6942…`
+- ~~`seal_math_n16_verify_8_bits`~~  ·  `a3a96ae4-2d40…`
+- ~~`seal_math_n64_verify_12_bits`~~  ·  `5cdc1f48-9720…`
+- ~~`seal_math_n256_verify_16_bits`~~  ·  `241e6da6-ffc9…`
+- ~~`seal_math_n1024_verify_20_bits`~~  ·  `f9ee3ca4-31b2…`
+- ~~`the_967_receipt_case_verify_20_bits_bill_on_the_967_computation_value_earn_the_947_bit_saving`~~  ·  `b7dd9563-39b5…`
+- ~~`each_seal_is_exactly_64_coins_at_two_bits_each_and_not_at_faster_than_light`~~  ·  `0e6659f8-1ff9…`
+- ~~`the_bit_cost_is_speed_invariant_ftl_or_not_the_same_64_coins_time_dissolves_in_the_count`~~  ·  `21a386cf-a936…`
+- ~~`in_no_time_max_computations_without_redundant_cost_content_addressing_removes_only_redundancy`~~  ·  `eb532b26-c91b…`
+- ~~`uuidna_infinite_repeats_at_zero_redundant_cost_new_distinct_work_still_costs`~~  ·  `82c180be-f7dd…`
+- ~~`citation_is_reach_not_solving_more_cited_grows_the_graph_but_does_not_solve_a_theorem`~~  ·  `26b9ce08-5781…`
+- ~~`uuidna_reflects_clay_a_mirror_to_the_seven_not_a_solution_zero_of_seven`~~  ·  `025996d9-4a0a…`
+- ~~`clay_defines_the_infinite_uuidna_infinitely_computes_decidable_theorems_reflecting_not_solving`~~  ·  `7456a487-bcc1…`
+- ~~`the_ui_is_a_client_side_harness_not_a_live_mcp_server_versions_shift_per_build_and_by_live_fetch`~~  ·  `45b3395c-b7da…`
+- ~~`the_seal_is_sound_a_forged_leaf_fails_but_by_recompute_not_cryptographic_hardness`~~  ·  `000849eb-74f7…`
+- ~~`merkle_proof_soundness_n4`~~  ·  `134f93b0-91be…`
+- ~~`merkle_proof_soundness_n8`~~  ·  `707df9e2-ffa4…`
+- ~~`merkle_proof_soundness_n16`~~  ·  `684debb6-eb40…`
+- ~~`casting_out_nines_the_digital_root_is_a_ring_homomorphism_necessary_not_sufficient`~~  ·  `b2754a9f-dd37…`
+- ~~`uuidna_exports_faithfully_the_content_address_is_context_free_same_input_same_address_anywhere`~~  ·  `caf24697-3a8e…`
+- ~~`uuidna_is_quantum_and_not_at_one_price_a_personal_choice_scaling_savings_and_contributions`~~  ·  `c04315f4-d230…`
+- ~~`exactly_1024_is_a_full_balanced_tree_a_structural_milestone_not_the_end_of_science`~~  ·  `005ec4a7-6a5d…`
+- ~~`hollow_prose_is_redeemed_by_results_not_hardcoded_the_result_recomputes_the_assertion_does_not`~~  ·  `761025ed-ce03…`
+- ~~`factorial_3_is_6`~~  ·  `f12f3f47-053e…`
+- ~~`factorial_4_is_24`~~  ·  `e52c98a6-a7c6…`
+- ~~`factorial_5_is_120`~~  ·  `6c1fb190-35ab…`
+- ~~`factorial_6_is_720`~~  ·  `81ebf136-662d…`
+- ~~`factorial_8_is_40320`~~  ·  `a4149b01-1f71…`
+- ~~`factorial_9_is_362880`~~  ·  `b0d11119-b00e…`
+- ~~`pure_ts_sha256_matches_the_fips_180_4_test_vector`~~  ·  `6d222327-6bbe…`
+- ~~`pure_ts_chacha20_poly1305_matches_the_rfc_8439_aead_vector`~~  ·  `d350e733-70a6…`
+- ~~`pure_ts_pbkdf2_hmac_sha256_matches_the_test_vector`~~  ·  `f0ce4052-5fc1…`
+- ~~`uuidna_crypt_aead_round_trips_in_pure_typescript`~~  ·  `62e1f13d-b50f…`
+- ~~`uuidna_crypt_rejects_a_tampered_ciphertext_by_authentication`~~  ·  `7ecfb33a-07b3…`
+- ~~`pure_ts_sha256_matches_the_vector_for_the_empty_string`~~  ·  `bd1b63d6-1f0d…`
+- ~~`pure_ts_sha256_matches_the_vector_for_a`~~  ·  `dd16d6fc-0ef1…`
+- ~~`pure_ts_sha256_matches_the_448_bit_vector`~~  ·  `7c1b0a7a-67ce…`
+- ~~`pure_ts_sha256_matches_the_896_bit_vector`~~  ·  `17e4fa5b-6ea9…`
+- ~~`pure_ts_sha256_matches_the_quick_fox_vector`~~  ·  `743ea505-7e62…`
+- ~~`pure_ts_sha256_matches_the_quick_fox_period_vector`~~  ·  `562e4a8d-1039…`
+- ~~`pure_ts_sha256_matches_the_vector_for_hello`~~  ·  `f527bacc-2402…`
+- ~~`pure_ts_chacha20_matches_the_rfc_8439_keystream_vector`~~  ·  `de4cebc3-9387…`
+- ~~`the_pure_ts_chacha20_block_is_64_bytes`~~  ·  `c3c57b75-04a1…`
+- ~~`pure_ts_chacha20_is_its_own_inverse_with_the_same_key_counter_nonce`~~  ·  `881267b1-4e30…`
+- ~~`the_pure_ts_chacha20_keystream_advances_with_the_counter`~~  ·  `1fe2cf16-c994…`
+- ~~`the_pure_ts_chacha20_keystream_depends_on_the_nonce`~~  ·  `8e5ea30c-bc45…`
+- ~~`the_pure_ts_chacha20_keystream_depends_on_the_key`~~  ·  `dfb1e6de-43a6…`
+- ~~`the_pure_ts_chacha20_block_is_deterministic`~~  ·  `246ecf16-9eb7…`
+- ~~`the_pure_ts_chacha20_ciphertext_is_plaintext_xor_keystream`~~  ·  `1545c99e-ac2a…`
+- ~~`pure_ts_poly1305_matches_the_rfc_8439_tag_vector`~~  ·  `c349f619-a6d9…`
+- ~~`pure_ts_poly1305_matches_the_all_zero_vector`~~  ·  `fbb80d8e-7541…`
+- ~~`the_pure_ts_poly1305_tag_is_16_bytes`~~  ·  `e5d408f9-f0c4…`
+- ~~`the_pure_ts_poly1305_tag_is_deterministic`~~  ·  `8476964e-e0b2…`
+- ~~`the_pure_ts_poly1305_tag_depends_on_the_message`~~  ·  `b5ee82b6-c932…`
+- ~~`the_pure_ts_poly1305_tag_depends_on_the_key`~~  ·  `5b5aab90-28f0…`
+- ~~`the_pure_ts_poly1305_tags_an_empty_message`~~  ·  `89fc8d47-1ba8…`
+- ~~`pure_ts_poly1305_matches_the_rfc_8439_a3_s_only_vector`~~  ·  `60d05e04-ba74…`
+- ~~`pure_ts_pbkdf2_hmac_sha256_matches_the_two_iteration_vector`~~  ·  `ea298776-dafe…`
+- ~~`pure_ts_pbkdf2_hmac_sha256_matches_the_4096_iteration_vector`~~  ·  `db47b21a-6870…`
+- ~~`pure_ts_pbkdf2_hmac_sha256_matches_the_40_byte_vector`~~  ·  `e0987365-ecd6…`
+- ~~`pure_ts_hmac_sha256_matches_rfc_4231_case_1`~~  ·  `da6cabfe-c551…`
+- ~~`pure_ts_hmac_sha256_matches_rfc_4231_case_2`~~  ·  `238e355e-a994…`
+- ~~`pure_ts_hmac_sha256_matches_rfc_4231_case_4`~~  ·  `d0aff6db-1e39…`
+- ~~`the_pure_ts_pbkdf2_prefix_is_consistent_across_lengths`~~  ·  `0d6ce721-905a…`
+- ~~`uuidna_crypt_rejects_tampered_associated_data`~~  ·  `05b33e1a-8698…`
+- ~~`uuidna_crypt_aead_is_deterministic_given_key_and_nonce`~~  ·  `a7f1fa8c-246c…`
+- ~~`uuidna_crypt_aead_ciphertext_depends_on_the_nonce`~~  ·  `d09d0ee4-7e96…`
+- ~~`uuidna_crypt_aead_round_trips_an_empty_plaintext`~~  ·  `37f63daa-d8e0…`
+- ~~`uuidna_crypt_aead_ciphertext_depends_on_the_key`~~  ·  `65f00e32-b6ee…`
+- ~~`pure_ts_sha256_matches_the_55_byte_boundary_vector`~~  ·  `b72406b4-72b1…`
+- ~~`pure_ts_sha256_matches_the_56_byte_boundary_vector`~~  ·  `52241e8b-dbbe…`
+- ~~`pure_ts_sha256_matches_the_64_byte_block_vector`~~  ·  `db62a0d6-bb37…`
+- ~~`pure_ts_hmac_sha256_matches_rfc_4231_case_3`~~  ·  `3574b2f1-732c…`
+- ~~`pure_ts_hmac_sha256_matches_rfc_4231_case_6`~~  ·  `d1faa763-7f42…`
+- ~~`pure_ts_chacha20_matches_the_rfc_8439_a1_block_vector_1`~~  ·  `cf49d9d4-7ead…`
+- ~~`the_pure_ts_aead_tag_depends_on_the_plaintext`~~  ·  `02662bfe-144a…`
+- ~~`the_pure_ts_aead_tag_depends_on_the_associated_data`~~  ·  `3e9ee2bb-a1d3…`
+- ~~`three_is_the_only_prime_one_less_than_a_perfect_square`~~  ·  `9a028913-cecf…`
+- ~~`casting_out_nines_the_digital_root_is_the_value_mod_nine`~~  ·  `641a593e-4cba…`
+- ~~`divisibility_by_three_is_the_digit_sum_mod_three`~~  ·  `1ee0dc61-1828…`
+- ~~`the_triad_three_six_nine_are_the_multiples_of_three_in_z9`~~  ·  `a6d5c9c5-2edd…`
+- ~~`three_to_the_k_is_divisible_by_nine_for_k_at_least_two`~~  ·  `6df74023-c9cd…`
+- ~~`the_three_cube_roots_of_unity_sum_to_zero`~~  ·  `050bdc86-fe61…`
+- ~~`a_repunit_divides_by_three_iff_its_length_does`~~  ·  `377edd82-2965…`
+- ~~`five_is_the_unique_ten_complement_fixed_point`~~  ·  `565565ff-cc3b…`
+- ~~`there_are_exactly_five_platonic_solids`~~  ·  `6504415b-1ea5…`
+- ~~`the_five_fifth_roots_of_unity_sum_to_zero`~~  ·  `a93d693a-f41a…`
+- ~~`five_is_a_fermat_prime_so_the_regular_pentagon_is_constructible`~~  ·  `79ee4523-d085…`
+- ~~`five_is_the_largest_fixed_point_of_the_fibonacci_index`~~  ·  `90f11fdf-1287…`
+- ~~`the_golden_ratio_is_one_plus_root_five_over_two`~~  ·  `31ae366f-f2b7…`
+- ~~`ten_factors_as_two_times_five_the_heart_and_the_even_prime`~~  ·  `aa3e534d-7294…`
+- ~~`ten_has_multiplicative_order_six_modulo_seven`~~  ·  `b9901b9b-563d…`
+- ~~`_142857_times_one_through_six_are_its_cyclic_rotations`~~  ·  `c15edd03-3700…`
+- ~~`seven_is_the_fourth_prime`~~  ·  `c60e6bfb-c12d…`
+- ~~`eight_and_nine_are_the_only_consecutive_perfect_powers`~~  ·  `4ac00184-4301…`
+- ~~`eight_is_the_largest_fibonacci_perfect_cube`~~  ·  `d54f7105-647e…`
+- ~~`every_natural_has_a_unique_binary_representation`~~  ·  `b7d9dfe6-3e34…`
+- ~~`the_eighth_roots_of_unity_sum_to_zero`~~  ·  `a473ab8a-8873…`
+- ~~`two_is_the_only_even_prime`~~  ·  `814da9ab-c97f…`
+- ~~`a_mersenne_prime_forces_a_prime_exponent`~~  ·  `52ced8d2-4f7e…`
+- ~~`every_digital_root_lands_in_one_to_nine`~~  ·  `f0db1861-14cd…`
+- ~~`a_number_minus_its_digit_reversal_is_a_multiple_of_nine`~~  ·  `0780bec8-e70e…`
+- ~~`a_number_is_divisible_by_nine_iff_its_digit_sum_is`~~  ·  `b6696b2c-04c7…`
+- ~~`six_is_the_first_perfect_number`~~  ·  `afd7f1b6-ce95…`
+- ~~`six_is_three_factorial_the_permutations_of_three`~~  ·  `a221bf93-98d2…`
+- ~~`six_is_the_even_prime_times_the_trinity`~~  ·  `495d72a1-f77c…`
+- ~~`six_is_euclids_perfect_number_from_the_mersenne_prime_three`~~  ·  `cc367afc-996d…`
+- ~~`twenty_eight_is_the_second_perfect_number`~~  ·  `0d29909f-6b3f…`
+- ~~`a_perfect_number_equals_the_sum_of_its_proper_divisors`~~  ·  `0e0c1a43-7d85…`
+- ~~`two_is_a_primitive_root_modulo_nine`~~  ·  `28ce3e1c-4921…`
+- ~~`the_doubling_orbit_sums_to_twenty_seven_the_trinity_cubed`~~  ·  `178a2758-535e…`
+- ~~`the_nine_residues_split_into_the_unit_orbit_and_the_triad`~~  ·  `7012279f-cede…`
+- ~~`every_natural_is_a_sum_of_at_most_four_squares`~~  ·  `8c16722e-1a23…`
+- ~~`four_is_two_squared_the_first_composite_number`~~  ·  `3c320f35-bcc0…`
+- ~~`the_doubling_map_doubles_the_angle_on_the_nine_point_circle`~~  ·  `e64f1313-b471…`
+- ~~`euclids_infinitude_the_product_plus_one_has_a_new_prime_factor`~~  ·  `4947140c-cce1…`
+- ~~`bertrands_postulate_a_prime_lies_between_n_and_two_n`~~  ·  `a58870e1-1622…`
+- ~~`the_only_prime_triple_spaced_by_two_is_three_five_seven`~~  ·  `d8d8d3ec-27c7…`
+- ~~`every_prime_above_three_is_six_k_plus_or_minus_one`~~  ·  `27566d35-6704…`
+- ~~`twin_primes_recur_below_a_thousand`~~  ·  `36973e3a-4503…`
+- ~~`legendre_a_prime_lies_between_consecutive_squares`~~  ·  `558f62ef-2176…`
+- ~~`goldbachs_even_sum_of_two_primes_to_a_thousand`~~  ·  `032ff03e-d893…`
+- ~~`the_gaps_between_primes_grow_without_bound`~~  ·  `47c4a1ae-6e87…`
+- ~~`eulers_formula_holds_for_all_five_platonic_solids`~~  ·  `d0e63cc8-f120…`
+- ~~`platonic_duality_swaps_vertices_and_faces`~~  ·  `b8c9b01c-faea…`
+- ~~`the_platonic_solids_are_genus_zero_with_euler_number_two`~~  ·  `465e66fc-e32d…`
+- ~~`the_basel_sum_of_reciprocal_squares_converges_to_pi_squared_over_six`~~  ·  `e2ef3909-e39c…`
+- ~~`the_leibniz_series_converges_to_pi_over_four`~~  ·  `a673c4c4-4ab8…`
+- ~~`e_is_the_sum_of_reciprocal_factorials`~~  ·  `944ced77-21a6…`
+- ~~`eulers_identity_e_to_the_i_pi_plus_one_is_zero`~~  ·  `1673c736-0aa5…`
+- ~~`zeta_of_four_is_pi_to_the_fourth_over_ninety`~~  ·  `811d1342-1bf8…`
+- ~~`the_wallis_product_converges_to_pi_over_two`~~  ·  `b85438d8-8e97…`
+- ~~`pi_lies_between_the_archimedes_bounds`~~  ·  `bf17a149-8fdf…`
+- ~~`machins_formula_computes_pi_over_four`~~  ·  `91876258-030b…`
+- ~~`pascals_rule_each_entry_is_the_sum_of_the_two_above`~~  ·  `c580522a-9490…`
+- ~~`a_pascal_row_sums_to_two_to_the_n`~~  ·  `316a1496-6da4…`
+- ~~`a_pascal_rows_alternating_sum_is_zero`~~  ·  `520fd218-d05a…`
+- ~~`binomial_symmetry_choosing_k_equals_choosing_n_minus_k`~~  ·  `bea7118e-0a5b…`
+- ~~`the_hockey_stick_identity_sums_a_diagonal`~~  ·  `4b7889ae-5b09…`
+- ~~`the_shallow_diagonals_of_pascal_are_the_fibonacci_numbers`~~  ·  `24338952-ebe5…`
+- ~~`vandermondes_identity_convolves_two_rows`~~  ·  `d299600e-369d…`
+- ~~`sum_of_the_first_n_integers_is_n_times_n_plus_one_over_two`~~  ·  `bd236190-04c3…`
+- ~~`sum_of_the_first_n_squares_is_the_pyramidal_formula`~~  ·  `f55d43ea-8f50…`
+- ~~`the_sum_of_the_first_n_cubes_is_the_square_of_their_sum`~~  ·  `b84a64a5-d2ae…`
+- ~~`the_sum_of_the_first_n_even_numbers_is_n_times_n_plus_one`~~  ·  `be759d3e-690c…`
+- ~~`n_factorial_counts_the_permutations_of_n`~~  ·  `e878d729-d74a…`
+- ~~`handshakes_among_n_people_number_c_n_2`~~  ·  `03fd1efc-94e3…`
+- ~~`the_number_of_derangements_over_n_factorial_approaches_one_over_e`~~  ·  `e004191c-7b7e…`
+- ~~`euclids_parametrization_generates_pythagorean_triples`~~  ·  `c2bde5ba-19bc…`
+- ~~`the_area_of_a_pythagorean_triangle_is_a_multiple_of_six`~~  ·  `4eebdcf3-958b…`
+- ~~`two_consecutive_triangular_numbers_sum_to_a_square`~~  ·  `53677354-05c3…`
+- ~~`eight_times_a_triangular_number_plus_one_is_a_square`~~  ·  `2d9b9a90-3968…`
+- ~~`every_hexagonal_number_is_a_triangular_number`~~  ·  `fa2deb9c-b546…`
+- ~~`the_reciprocal_triangular_numbers_sum_to_two`~~  ·  `2415c2e7-2ec2…`
+- ~~`a_square_never_ends_in_two_three_seven_or_eight_in_base_ten`~~  ·  `560a627a-349e…`
+- ~~`the_arithmetic_mean_is_at_least_the_geometric_mean`~~  ·  `6e5aafcf-cbb5…`
+- ~~`a_positive_number_plus_its_reciprocal_is_at_least_two`~~  ·  `93cbc2a0-436d…`
+- ~~`bernoullis_inequality_holds`~~  ·  `f630d85b-1224…`
+- ~~`the_triangle_inequality_holds_on_the_line`~~  ·  `a45c0613-96e3…`
+- ~~`the_cauchy_schwarz_inequality_holds_in_two_dimensions`~~  ·  `d949b87b-4e06…`
+- ~~`the_mean_chain_harmonic_geometric_arithmetic_quadratic`~~  ·  `17379539-c0c5…`
+- ~~`antiphase_waves_cancel_by_destructive_interference`~~  ·  `37562731-f635…`
+- ~~`in_phase_waves_reinforce_by_constructive_interference`~~  ·  `e000fbee-c974…`
+- ~~`two_travelling_waves_make_a_standing_wave`~~  ·  `ae9f496a-072b…`
+- ~~`sum_to_product_folds_two_sines`~~  ·  `a538ef17-b7f8…`
+- ~~`harmonic_sines_are_orthogonal_over_a_period`~~  ·  `0d37c981-4913…`
+- ~~`a_standing_wave_has_fixed_nodes`~~  ·  `952ff4c0-cb4e…`
+- ~~`the_pythagorean_trig_identity_holds`~~  ·  `ac3d69b2-cc03…`
+- ~~`the_double_angle_sine_identity`~~  ·  `21e762fd-bcb6…`
+- ~~`the_double_angle_cosine_identity`~~  ·  `60536a19-adda…`
+- ~~`the_sine_addition_formula`~~  ·  `fa1f87ef-5889…`
+- ~~`the_cosine_addition_formula`~~  ·  `9e95fc39-cca8…`
+- ~~`the_law_of_cosines_generalizes_pythagoras`~~  ·  `58d5a08d-67e6…`
+- ~~`the_perfect_fifth_is_the_ratio_three_to_two`~~  ·  `df035811-ac8f…`
+- ~~`the_equal_tempered_semitone_is_the_twelfth_root_of_two`~~  ·  `ad1df740-70f4…`
+- ~~`a_square_wave_is_the_sum_of_odd_harmonics`~~  ·  `3ee9459d-4a87…`
+- ~~`beats_arise_from_two_near_frequencies`~~  ·  `b81e2695-36a3…`
+- ~~`the_golden_angle_is_the_circle_over_phi_squared`~~  ·  `8a07281b-c723…`
+- ~~`one_plus_one_over_n_to_the_n_approaches_e`~~  ·  `1a1655aa-be6d…`
+- ~~`the_inverse_square_law_quarters_at_double_distance`~~  ·  `fcd42176-4fff…`
+- ~~`keplers_third_law_relates_period_and_orbit`~~  ·  `b5808713-e1a5…`
+- ~~`the_simple_pendulum_period_scales_as_the_square_root_of_length`~~  ·  `1410e5f4-34f3…`
+- ~~`the_golden_spiral_scales_by_phi_each_quarter_turn`~~  ·  `5e0ce424-13f6…`
+- ~~`the_harmonic_overtones_are_integer_multiples_of_the_fundamental`~~  ·  `3c563883-4768…`
+- ~~`the_logistic_map_doubles_its_period_toward_chaos`~~  ·  `fa5961fa-86f3…`
+- ~~`the_gate_reads_the_first_ray_english`~~  ·  `f8a2253e-9beb…`
+- ~~`the_gate_reads_the_second_ray_german`~~  ·  `22ffdad2-b7ea…`
+- ~~`the_gate_reads_the_third_ray_french`~~  ·  `fc89157b-17da…`
+- ~~`the_gate_reads_the_fourth_ray_spanish`~~  ·  `9ff93de3-54d1…`
+- ~~`the_gate_reads_the_fifth_ray_russian`~~  ·  `93db257b-f3fe…`
+- ~~`the_gate_reads_the_sixth_ray_bulgarian`~~  ·  `bedce0ff-a6a0…`
+- ~~`the_gate_reads_the_seventh_ray_chinese`~~  ·  `2640e36d-2311…`
+- ~~`the_seven_locales_all_hold_the_honest_floor`~~  ·  `7f917de1-9d89…`
+- ~~`the_gate_reads_italian`~~  ·  `03e2c68a-a1dd…`
+- ~~`the_gate_reads_portuguese`~~  ·  `328543ba-4c50…`
+- ~~`the_gate_reads_japanese`~~  ·  `8713857f-b347…`
+- ~~`the_gate_reads_arabic`~~  ·  `519d306c-c6ff…`
+- ~~`the_gate_reads_hindi`~~  ·  `2c8dfa45-e88a…`
+- ~~`the_gate_reads_polish`~~  ·  `2dd44029-c754…`
+- ~~`the_gate_reads_dutch`~~  ·  `1864b9e2-cb3b…`
+- ~~`the_gate_now_reads_twice_seven_dialects`~~  ·  `5bd2f812-0de8…`
+- ~~`floor_tightened_proof_certainty`~~  ·  `c0c7eefc-14ee…`
+- ~~`floor_tightened_guaranteed_outcome`~~  ·  `d8f22991-d6c7…`
+- ~~`floor_tightened_medical`~~  ·  `b293ea5e-2720…`
+- ~~`floor_tightened_marketing`~~  ·  `ae9c0869-594c…`
+- ~~`floor_tightened_broken_physics`~~  ·  `26d015a8-92dd…`
+- ~~`floor_tightened_ai_hype`~~  ·  `779dd06e-9e5e…`
+- ~~`floor_tightened_no_weakness`~~  ·  `06275e9a-8d22…`
+- ~~`floor_tightened_yet_negation_aware`~~  ·  `0e728fcd-61e0…`
+- ~~`gate_reads_korean`~~  ·  `eda026d3-926d…`
+- ~~`gate_reads_turkish`~~  ·  `0411d3db-7605…`
+- ~~`gate_reads_greek`~~  ·  `f8bf1b1e-67fc…`
+- ~~`gate_reads_hebrew`~~  ·  `802e2cc4-2591…`
+- ~~`gate_reads_swedish`~~  ·  `bfae3051-5258…`
+- ~~`gate_reads_indonesian`~~  ·  `4e29c638-ab2e…`
+- ~~`gate_reads_vietnamese`~~  ·  `e1d7584e-a753…`
+- ~~`gate_reads_twenty_two_dialects`~~  ·  `cdae6ede-4cd5…`
+- ~~`human_shares_the_seven_dimensions`~~  ·  `65a1f075-01a4…`
+- ~~`any_version_is_a_superposition`~~  ·  `1ed55905-f07d…`
+- ~~`physics_meets_metaphysics_in_the_fold`~~  ·  `1908c69a-a35f…`
+- ~~`discernment_is_a_human_faculty`~~  ·  `02ac659a-5728…`
+- ~~`humility_is_the_floor_of_self_development`~~  ·  `61a3ed8b-0f88…`
+- ~~`human_develops_self_using_uuidna`~~  ·  `1aae9ef2-ba7b…`
+- ~~`gate_reads_glagolitic`~~  ·  `c56a3ac1-222e…`
+- ~~`rosetta_one_message_nine_writing_systems`~~  ·  `5c21d2a5-ac2e…`
+- ~~`rosetta_floor_is_script_independent`~~  ·  `503502c0-738c…`
+- ~~`rosetta_crosslinks_the_seven_rays`~~  ·  `17e03f2c-b4b8…`
+- ~~`rosetta_reads_code_switching`~~  ·  `b6793c14-0d34…`
+- ~~`rosetta_finds_the_boast_in_the_prose`~~  ·  `01a33376-2ec6…`
+- ~~`rosetta_spares_the_honest_noun`~~  ·  `24e94218-2cad…`
+- ~~`rosetta_manifests_messaging_in_seven_dimensions`~~  ·  `87d82c54-5a74…`
+- ~~`vibe_hype_still_drains`~~  ·  `b5afbeb1-7119…`
+- ~~`vibe_academic_still_drains`~~  ·  `3409046f-40fe…`
+- ~~`vibe_casual_still_drains`~~  ·  `dac9e01e-8355…`
+- ~~`vibe_shouting_still_drains`~~  ·  `56bcbd0b-6f98…`
+- ~~`vibe_honest_energy_passes`~~  ·  `0987cf9b-a442…`
+- ~~`vibe_casual_refusal_passes`~~  ·  `fca7ee39-3e6c…`
+- ~~`vibe_multilingual_hype_drains`~~  ·  `136fec86-c6c1…`
+- ~~`all_human_behaviour_meets_one_floor`~~  ·  `ff176c2c-5485…`
+- ~~`base_pairing_is_an_involution`~~  ·  `ae3f8b92-b7dd…`
+- ~~`purine_pyrimidine_partition`~~  ·  `91f75e5a-7e24…`
+- ~~`reverse_complement_is_the_reverse_inverse`~~  ·  `33658ddd-6cf3…`
+- ~~`codon_degeneracy_forced_by_pigeonhole`~~  ·  `ad23984a-3d43…`
+- ~~`combining_skills_via_the_rosetta`~~  ·  `8c8c2807-5d3a…`
+- ~~`determinism_enables_free_reuse`~~  ·  `7f1dc45e-e374…`
+- ~~`free_quantum_boast_drains`~~  ·  `33e3a1eb-c3e8…`
+- ~~`unbounded_speedup_multiplier_drains`~~  ·  `3316f695-48db…`
+- ~~`the_captain_sails_by_the_wind`~~  ·  `bd4d87e8-0acf…`
+- ~~`waves_cost_bits_locally_not_tokens`~~  ·  `5a99ab83-c3b3…`
+- ~~`speedup_is_bounded_and_classical`~~  ·  `4a174b2a-8b03…`
+- ~~`yes_first_immediate_local_bounded`~~  ·  `c996db87-f6aa…`
+- ~~`the_test_type_is_boolean`~~  ·  `5a577ee1-8487…`
+- ~~`the_key_is_a_unique_identity`~~  ·  `ea18b69f-ca10…`
+- ~~`the_label_translates_the_key_does_not`~~  ·  `3686cbde-e003…`
+- ~~`the_type_is_recoverable_from_the_key`~~  ·  `1c9c2423-c0d7…`
+- ~~`the_label_passes_the_gate_in_any_script`~~  ·  `4f1cc25f-f49d…`
+- ~~`the_types_partition_the_families`~~  ·  `4589d4a0-93d6…`
+- ~~`the_reflection_is_stable`~~  ·  `7ad0a078-c7ea…`
+- ~~`keys_and_types_reflect_each_other`~~  ·  `30dc855d-6bf2…`
+- ~~`skill_hash_then_address_composes`~~  ·  `2f3a4a39-0ab7…`
+- ~~`skill_fold_of_hashes_composes`~~  ·  `3092dec9-2604…`
+- ~~`skill_keyed_hash_hmac`~~  ·  `d965dcce-a035…`
+- ~~`skill_inclusion_proof_composes`~~  ·  `e0dc3162-15ea…`
+- ~~`skill_authenticated_secrecy_tag`~~  ·  `a68a0ff4-ea80…`
+- ~~`skill_key_stretch_pbkdf2`~~  ·  `109bb14d-f750…`
+- ~~`skill_gate_distributed_via_rosetta`~~  ·  `d42c7060-0cc9…`
+- ~~`skills_compose_into_one_organism`~~  ·  `a1d69b35-548d…`
+- ~~`genesis_0_the_void_and_the_floor`~~  ·  `4e0a9f55-16c5…`
+- ~~`genesis_2_the_bit_and_the_pair`~~  ·  `565be8ca-572a…`
+- ~~`genesis_3_the_trinity`~~  ·  `9d194220-85e2…`
+- ~~`genesis_7_the_seven_dimensions`~~  ·  `ea8b5fe0-9fe4…`
+- ~~`genesis_complete_the_human_organism`~~  ·  `2144c672-fc49…`
+- ~~`diamond_reflection_is_an_involution`~~  ·  `389edf7b-948e…`
+- ~~`diamond_fixed_point_is_five`~~  ·  `03f7ef5c-3f08…`
+- ~~`diamond_pairs_sum_to_ten`~~  ·  `a8eb7306-4eaa…`
+- ~~`diamond_permutes_the_digits`~~  ·  `5d890312-8ac5…`
+- ~~`diamond_swaps_four_pairs_fixes_one`~~  ·  `23498ffd-bdba…`
+- ~~`diamond_center_is_the_hub`~~  ·  `7c5cfcdb-3c85…`
+- ~~`cryptography_is_behind_all`~~  ·  `52b5d521-6024…`
+- ~~`no_payload_a_theorem_takes_no_argument`~~  ·  `19be0e78-1679…`
+- ~~`dna_is_live_in_the_stream`~~  ·  `8ec6e1f3-9273…`
+- ~~`the_light_client_needs_no_full_payload`~~  ·  `6c59fb2e-d668…`
+- ~~`the_domain_is_self_contained`~~  ·  `25832bb1-22ad…`
+- ~~`streams_verify_by_recomputation_not_trust`~~  ·  `df901ad3-8d4c…`
+- ~~`from_version_to_ui_no_payload`~~  ·  `b3a25d08-135b…`
+- ~~`no_payload_completes_the_human`~~  ·  `ca11c760-8a2c…`
+- ~~`gravity_folds_the_tree_to_a_fixed_point`~~  ·  `9a3b6b65-dcbd…`
+- ~~`gravity_no_crack_under_counter_rotation`~~  ·  `34b772ac-a07a…`
+- ~~`gravity_signs_the_version`~~  ·  `e1c64b5d-9e61…`
+- ~~`gravity_falls_to_its_fixed_points`~~  ·  `83e98a82-af1c…`
+- ~~`gravity_names_and_paths_rotate_without_cracking`~~  ·  `0f1f8d90-c50e…`
+- ~~`the_harmonic_gate_spots_all_gaps`~~  ·  `87406356-e0d7…`
+- ~~`gravity_pulls_all_in_place`~~  ·  `dc561a31-583b…`
+- ~~`skill_composition_is_super_additive`~~  ·  `991fafbe-e056…`
+- ~~`the_leap_is_combinatorial_not_quantum`~~  ·  `cda4fee9-8e16…`
+- ~~`a_skill_from_skills_reaches_logarithmically`~~  ·  `7788152b-0fd6…`
+- ~~`skill_composition_is_order_independent`~~  ·  `dd2fef3a-1130…`
+- ~~`the_leap_is_measured_not_asserted`~~  ·  `df880502-e906…`
+- ~~`one_skill_reaches_every_dialect`~~  ·  `065c14e2-1df3…`
+- ~~`skills_multiply_solutions_but_stay_bounded`~~  ·  `68358cb1-2843…`
+- ~~`uuidna_skills_leap_by_composition`~~  ·  `c2312ab8-094f…`
+- ~~`the_trial_returns_a_binary_verdict`~~  ·  `7a58882f-2524…`
+- ~~`the_verdict_is_a_content_signature`~~  ·  `0acecfa4-0d14…`
+- ~~`the_trial_reeducates_by_naming_the_offense`~~  ·  `553f8537-9669…`
+- ~~`a_uuid_carries_data_in_itself`~~  ·  `d956953c-2f23…`
+- ~~`the_uuid_stream_carries_code`~~  ·  `3d1b5744-b0d1…`
+- ~~`the_receipt_is_binary_and_decimal`~~  ·  `4ef46504-433a…`
+- ~~`transfer_is_verified_by_recomputation`~~  ·  `f90523f2-6f97…`
+- ~~`trial_verdict_and_uuid_transport_are_one`~~  ·  `e03d08c6-7149…`
+- ~~`only_the_pointer_travels`~~  ·  `5d8cbd0b-e38a…`
+- ~~`no_payload_until_load`~~  ·  `718f4984-1052…`
+- ~~`the_destination_recomputes_not_receives`~~  ·  `16ea6c21-2e1e…`
+- ~~`teleport_is_a_pointer_not_physics`~~  ·  `759083e7-e215…`
+- ~~`travel_is_cheap_because_the_address_is_bounded`~~  ·  `6c72038a-fa61…`
+- ~~`the_stream_reconstructs_any_length`~~  ·  `9c1212a2-2c05…`
+- ~~`verified_on_arrival`~~  ·  `17d35d4f-b690…`
+- ~~`human_teleport_is_content_address_transport`~~  ·  `1cc5f0d1-5752…`
+- ~~`degrees_and_radians_are_one_by_ratio`~~  ·  `e7cdcc29-8221…`
+- ~~`the_thirty_sixty_ninety_triangle`~~  ·  `fb22fd1a-4885…`
+- ~~`the_law_of_sines_fixes_the_ratios`~~  ·  `8266df2d-0eb2…`
+- ~~`the_systems_agree_under_scaling`~~  ·  `521e239d-542d…`
+- ~~`metrics_organise_the_theorems_on_the_harmonic`~~  ·  `ff66b280-dd9d…`
+- ~~`trial_of_ai_models`~~  ·  `210ed2b3-2c36…`
+- ~~`trial_of_cryptography_models`~~  ·  `c8d87136-4e78…`
+- ~~`trial_of_physics_models`~~  ·  `742a2d2e-1a3c…`
+- ~~`trial_of_mathematics_models`~~  ·  `ac633052-b43c…`
+- ~~`trial_of_medicine_models`~~  ·  `f4166913-cfd4…`
+- ~~`trial_of_finance_models`~~  ·  `48a33770-e902…`
+- ~~`trial_of_computing_models`~~  ·  `97306f4f-9306…`
+- ~~`every_model_sent_to_trial_returns_a_verdict`~~  ·  `10b729ff-3f4c…`
+- ~~`the_audit_routes_all_traffic`~~  ·  `54a9262f-dd37…`
+- ~~`cleartext_http_leaks_warn`~~  ·  `61dc29c3-09d5…`
+- ~~`cross_origin_opaque_warns`~~  ·  `2abaf9e5-ae9e…`
+- ~~`non_get_cleartext_warns`~~  ·  `d4d75e18-2e17…`
+- ~~`same_origin_signed_get_is_verified`~~  ·  `1a5b2957-3759…`
+- ~~`the_traffic_receipt_chain_is_tamper_evident`~~  ·  `c33ace2d-050e…`
+- ~~`warnings_are_distinct_realtime_events`~~  ·  `f440543c-66b2…`
+- ~~`anything_not_uuidna_signed_warns`~~  ·  `55aa751d-66a3…`
+- ~~`every_test_wires_a_uuidna_receipt`~~  ·  `c3f75d66-2fbb…`
+- ~~`test_receipts_chain_tamper_evident`~~  ·  `d116e055-6d1d…`
+- ~~`the_test_verdict_is_a_binary`~~  ·  `e7ec3328-29d5…`
+- ~~`uuidna_is_mandatory_because_verifiable`~~  ·  `04432f59-2a05…`
+- ~~`uuidna_is_mandatory_because_fast_not_quantum`~~  ·  `81100eb5-9b9d…`
+- ~~`wired_test_results_fold_to_one_root_at_scale`~~  ·  `1f0af854-28bd…`
+- ~~`the_gate_is_mandatory_by_default`~~  ·  `a641e3ce-fe7a…`
+- ~~`using_uuidna_is_mandatory_verifiable_and_fast`~~  ·  `cce2e324-b522…`
+- ~~`a_decision_is_a_boolean`~~  ·  `8d89506d-08f3…`
+- ~~`prose_is_weighed_prose_does_not_decide`~~  ·  `c1f02189-e3b3…`
+- ~~`authority_changes_no_boolean`~~  ·  `79badd98-680e…`
+- ~~`the_theorem_decides_inclusion`~~  ·  `e2ce5b45-e643…`
+- ~~`a_tie_is_broken_by_recomputation`~~  ·  `005e1284-2311…`
+- ~~`the_verdict_is_reproducible`~~  ·  `93c1de7e-e4bf…`
+- ~~`no_decidable_test_no_decision`~~  ·  `2a40a8d7-9991…`
+- ~~`only_theorems_decide`~~  ·  `011337ae-bca3…`
+- ~~`the_receipt_is_the_page`~~  ·  `ce2184b7-43f5…`
+- ~~`only_theorems_name_and_describe`~~  ·  `7dffb5d5-9c68…`
+- ~~`a_guide_is_a_sequence_of_theorems`~~  ·  `25e916f9-5ea7…`
+- ~~`the_book_recomputes_from_its_theorems`~~  ·  `7e8a5312-3a24…`
+- ~~`a_point_is_proven_by_a_theorem_or_not_taken`~~  ·  `a6df4b0f-8a78…`
+- ~~`the_pages_chain_tamper_evident`~~  ·  `9bd53a74-7971…`
+- ~~`only_theorems_write_the_guides`~~  ·  `297e5944-f910…`
+- ~~`every_page_is_a_receipt_referrer_relative`~~  ·  `5702ea67-172d…`
+- ~~`recomputation_is_stable_without_a_wave`~~  ·  `affa72c8-7cf3…`
+- ~~`a_new_wave_imprints_a_new_chain_receipt`~~  ·  `d395329c-1e0c…`
+- ~~`observation_imprints_into_the_audit_chain`~~  ·  `ec4beb35-ee2b…`
+- ~~`the_page_content_address_is_invariant_under_observation`~~  ·  `ef4c9245-93e3…`
+- ~~`partial_reversal_is_a_receipted_event`~~  ·  `e4cdb827-d96f…`
+- ~~`the_observation_chain_is_tamper_evident`~~  ·  `3dbbbf20-6f08…`
+- ~~`every_page_recomputes_unless_a_wave_imprints`~~  ·  `e4e70d71-52c9…`
+- ~~`file_uuids_are_totally_ordered`~~  ·  `b6c0f3a3-7c11…`
+- ~~`file_uuids_sort_deterministically`~~  ·  `8942287d-c93e…`
+- ~~`file_uuids_group_by_digital_root`~~  ·  `f5d82370-2c78…`
+- ~~`sorted_uuids_partition_into_octaves`~~  ·  `bb384a72-70c0…`
+- ~~`the_grouping_is_reproducible`~~  ·  `20c7a103-dd43…`
+- ~~`the_confidentiality_is_the_real_envelope_not_maximum`~~  ·  `1b56e932-2256…`
+- ~~`perspectives_are_files_grouped_and_sorted_in_seven_dimensions`~~  ·  `dc3c89eb-849e…`
+- ~~`catch_all_splits_the_path_into_skill_keywords`~~  ·  `79eb065d-8d95…`
+- ~~`each_keyword_resolves_to_a_skill`~~  ·  `769261f3-c6c5…`
+- ~~`skills_compose_in_the_requested_order`~~  ·  `ec0793e1-22ca…`
+- ~~`params_ride_the_route`~~  ·  `b4745d70-90ac…`
+- ~~`an_unknown_keyword_is_refused`~~  ·  `b4381359-1082…`
+- ~~`the_route_result_is_deterministic`~~  ·  `95479993-5231…`
+- ~~`translation_communication_analytics_forensics_are_routable_skills`~~  ·  `26c8fa06-12ed…`
+- ~~`the_route_is_the_skill_pipeline`~~  ·  `4dc9603c-7a95…`
+- ~~`a_chat_message_routes_through_the_gate`~~  ·  `40c45973-32f0…`
+- ~~`a_chat_message_becomes_a_receipt`~~  ·  `cc9f0a53-9a56…`
+- ~~`a_room_is_a_chain_of_message_receipts`~~  ·  `fd897aef-30e7…`
+- ~~`a_room_is_addressed_by_its_fold`~~  ·  `436a83ac-8e63…`
+- ~~`an_overclaim_in_chat_is_flagged`~~  ·  `5b3a2fd2-313f…`
+- ~~`chat_is_moderated_across_dialects`~~  ·  `04330526-c573…`
+- ~~`a_chat_receipt_is_referrer_relative`~~  ·  `dc9c5596-3894…`
+- ~~`route_chat_through_uuidna`~~  ·  `9a64e6e9-28ef…`
+- ~~`a_bug_is_found_by_its_address_not_a_scan`~~  ·  `8ca5a805-27a5…`
+- ~~`address_lookup_is_constant_not_linear`~~  ·  `fbdb3757-c086…`
+- ~~`the_address_is_the_index`~~  ·  `fb4375a7-165b…`
+- ~~`a_tamper_localises_to_one_link`~~  ·  `cde6e4ad-1479…`
+- ~~`the_debug_speedup_is_memoization`~~  ·  `b8edbd8e-da63…`
+- ~~`address_debugging_is_classical_not_quantum`~~  ·  `7eccc4f8-f985…`
+- ~~`the_gap_pointer_is_exact_not_a_linear_bucket`~~  ·  `f33f1a70-ce08…`
+- ~~`debugging_replaces_linear_scan_with_addressing`~~  ·  `6a29a133-7a1d…`
+- ~~`a_drained_overclaim_names_its_cure`~~  ·  `397dead7-5c7b…`
+- ~~`a_chain_break_returns_the_tamper_index`~~  ·  `7dff25f5-bc14…`
+- ~~`a_gap_returns_the_missing_key`~~  ·  `47b9dad3-230d…`
+- ~~`a_failing_invariant_names_itself`~~  ·  `08e4e6fe-4463…`
+- ~~`a_flaw_is_a_lead_not_a_verdict`~~  ·  `55eb9f1e-53e9…`
+- ~~`theorems_audit_in_trinities`~~  ·  `6adc0516-e7d6…`
+- ~~`a_dissent_in_the_trinity_localises_the_bug`~~  ·  `41a03892-55b4…`
+- ~~`let_the_flaws_discover_the_tools`~~  ·  `8bc8cc9e-eb8f…`
+- ~~`the_verdict_is_idempotent`~~  ·  `15ee6153-5776…`
+- ~~`reeducation_converges_to_a_fixed_point`~~  ·  `31d7231b-37d2…`
+- ~~`the_honest_floor_is_the_judicial_fixed_point`~~  ·  `f2372546-59ec…`
+- ~~`the_judicial_reflection_is_an_involution`~~  ·  `f3316fee-8d25…`
+- ~~`the_trial_reflects_all_seven_solves_none`~~  ·  `2c05d805-7c34…`
+- ~~`double_jeopardy_is_barred_by_idempotence`~~  ·  `8b8122a0-b32e…`
+- ~~`appeal_is_recomputation`~~  ·  `c3d04015-621b…`
+- ~~`judicial_involution`~~  ·  `4f726cb3-476f…`
+- ~~`involution_reflection`~~  ·  `e0932db3-513b…`
+- ~~`involution_multiplicative_inverse`~~  ·  `19422cdb-86bf…`
+- ~~`involution_exclusive_or`~~  ·  `042ba752-4f56…`
+- ~~`involution_reversal`~~  ·  `5292e804-b281…`
+- ~~`involution_reverse_complement`~~  ·  `4d417837-1d3d…`
+- ~~`the_singularity_is_the_shared_fixed_point`~~  ·  `aaada9ee-db44…`
+- ~~`global_involution_the_theorem_is_the_invariant`~~  ·  `9beeb164-b555…`
+- ~~`a432_digital_root_is_nine`~~  ·  `5e3a4156-e2c0…`
+- ~~`the_string_is_a_reversible_imprint_not_physics`~~  ·  `412b1548-9632…`
+- ~~`a432_is_computed_classically_not_quantum`~~  ·  `a54160ce-4ff4…`
+- ~~`a432_reciprocal_ratio_is_an_involution`~~  ·  `94255170-8670…`
+- ~~`a432_wheel_has_nine_positions`~~  ·  `f440b44b-e43c…`
+- ~~`uuidna_a432_harmonic_involution_classical`~~  ·  `246ae6e4-413b…`
+- ~~`a_test_teaches_by_its_verdict`~~  ·  `87e17181-eb3d…`
+- ~~`reeducation_is_education_not_punishment`~~  ·  `d1e89ce6-7cf8…`
+- ~~`development_is_the_measured_delta`~~  ·  `87bc6fae-2800…`
+- ~~`intellect_is_multi_perspective`~~  ·  `a2cb416b-cda6…`
+- ~~`the_ledger_is_the_curriculum`~~  ·  `0c609635-f55d…`
+- ~~`education_is_recomputation_not_belief`~~  ·  `78d962b6-44c9…`
+- ~~`human_design_maps_to_the_octave`~~  ·  `96929361-2920…`
+- ~~`human_design_development_education_intellect_are_the_tests`~~  ·  `0b42e3f5-f4fd…`
+- ~~`the_address_is_state_independent`~~  ·  `0c2609b3-ae60…`
+- ~~`a_receipt_is_plain_serialisable_data`~~  ·  `beb5814b-105b…`
+- ~~`the_output_carries_no_framework_markup`~~  ·  `9f1bfbc1-a79c…`
+- ~~`porting_preserves_the_verdict`~~  ·  `e70c238e-3366…`
+- ~~`the_fold_ports_order_independently`~~  ·  `4ffe1be3-837c…`
+- ~~`the_plugin_adds_no_global`~~  ·  `bd0af20d-d9b8…`
+- ~~`uuidna_ports_at_scale_as_a_compliant_plugin`~~  ·  `2c4753ae-be4f…`
+- ~~`every_mcp_output_is_harnessed_auditable`~~  ·  `ef11114d-5b8b…`
+- ~~`the_harness_holds_in_all_seven_dimensions`~~  ·  `38509406-f5d5…`
+- ~~`the_harness_shows_the_reeducation_gain`~~  ·  `a06b25ef-104b…`
+- ~~`the_thirteen_mcp_tools_are_skills`~~  ·  `bf4eac85-8fc9…`
+- ~~`the_ui_presents_each_output_by_address`~~  ·  `00a5458e-b8c6…`
+- ~~`mcp_outputs_chain_into_an_audit_log`~~  ·  `741dfe34-a806…`
+- ~~`the_theorems_are_the_basis_of_the_skills`~~  ·  `3355f5f9-50b0…`
+- ~~`the_ui_is_the_harness_of_the_mcp`~~  ·  `6e10bfae-3485…`
+- ~~`the_rosetta_registers_seven_locales`~~  ·  `a06a85f6-7dd2…`
+- ~~`every_locale_matches_the_english_nav_shape`~~  ·  `4fd0a0e1-0628…`
+- ~~`the_gate_reads_every_registered_locale`~~  ·  `dd2e93cb-7610…`
+- ~~`the_seven_locales_fold_to_one_rosetta_root`~~  ·  `e7359878-8045…`
+- ~~`the_floor_is_the_same_in_every_locale`~~  ·  `3c88e732-e79d…`
+- ~~`a_content_address_needs_no_client_framework`~~  ·  `4f4b9996-7fa5…`
+- ~~`framework_free_is_lighter_not_a_speed_boast`~~  ·  `2e216dbf-5d3f…`
+- ~~`uuidna_fuses_the_locale_api_framework_free`~~  ·  `68e49218-402a…`
+- ~~`the_config_api_surface_is_enumerated`~~  ·  `ae590c40-146d…`
+- ~~`the_theme_api_surface_is_enumerated`~~  ·  `0674b120-39e2…`
+- ~~`the_i18n_api_is_handled_in_seven_locales`~~  ·  `db8b04fc-1f7b…`
+- ~~`the_nav_and_sidebar_shape_is_consistent`~~  ·  `7e44e127-4b1a…`
+- ~~`the_api_surface_folds_to_one_address`~~  ·  `d5c27afc-fce5…`
+- ~~`the_guides_are_rosetta_organised`~~  ·  `6a47120d-2962…`
+- ~~`the_all_versions_claim_is_unbounded_and_drains`~~  ·  `b64ef895-06a1…`
+- ~~`the_vitepress_api_surface_shown_by_implementation`~~  ·  `3e06ba8c-893b…`
+- ~~`behaviour_is_weighed_to_a_bit`~~  ·  `92db5055-1de6…`
+- ~~`every_register_is_handled_by_one_function`~~  ·  `e93c24b3-fb4a…`
+- ~~`overclaiming_behaviour_is_reeducated`~~  ·  `db7c4d74-c816…`
+- ~~`honest_behaviour_passes_unchanged`~~  ·  `8e3e6e0a-7853…`
+- ~~`behaviour_is_handled_in_every_dialect`~~  ·  `8f367ea2-0ace…`
+- ~~`the_verdict_is_by_deed_not_status`~~  ·  `f71a3779-3081…`
+- ~~`the_ui_colours_the_verdict_from_its_address`~~  ·  `336f2254-c2eb…`
+- ~~`theorems_define_and_handle_human_behaviour`~~  ·  `c4e68ce3-f520…`
+- ~~`a_config_value_is_computed_by_folding_not_typed`~~  ·  `54c69949-10b1…`
+- ~~`each_theorem_wires_to_its_neighbours`~~  ·  `b28c9446-e3ae…`
+- ~~`the_edge_is_directed_and_distinct`~~  ·  `a6d10c28-9b18…`
+- ~~`the_undirected_pair_folds_the_same`~~  ·  `6f8b94b8-10ea…`
+- ~~`a_node_is_holographic_self_plus_edges`~~  ·  `b37169f9-9507…`
+- ~~`a_new_neighbour_rewires_the_node`~~  ·  `0fb161b3-eade…`
+- ~~`the_whole_mesh_folds_to_one_root`~~  ·  `36cbd42d-fd25…`
+- ~~`theorems_compute_the_configs_that_wire_to_neighbours`~~  ·  `31222e30-5c1f…`
+- ~~`quantum_uuidna_the_structure_reading_passes`~~  ·  `62cedbad-a092…`
+- ~~`quantum_uuidna_the_machine_reading_drains`~~  ·  `bd8cef1f-2f01…`
+- ~~`any_message_goes_to_trial`~~  ·  `82d5c3d2-3196…`
+- ~~`the_deposit_gates_its_own_framing`~~  ·  `bc9d014c-8fce…`
+- ~~`the_verdict_is_by_computation_not_favour`~~  ·  `7e5e211a-4741…`
+- ~~`the_trial_separates_the_two_readings`~~  ·  `201104b0-2bea…`
+- ~~`no_status_grants_an_exemption`~~  ·  `3caa00fd-bb49…`
+- ~~`quantum_uuidna_on_trial`~~  ·  `72cfd904-8329…`
+- ~~`two_coins_are_two_bits_four_states`~~  ·  `5983a255-a6a6…`
+- ~~`the_four_states_coexist_as_a_perspective_set`~~  ·  `dc005b58-54db…`
+- ~~`the_structure_is_bounded_by_the_classical_two`~~  ·  `cd8e1a70-c9e5…`
+- ~~`two_bits_do_it_not_a_qubit`~~  ·  `890dc675-7fa5…`
+- ~~`the_coin_is_the_balanced_exchange_of_two`~~  ·  `7fdb9307-8761…`
+- ~~`the_two_coins_are_two_bits_doing_the_structure`~~  ·  `63e2cbf6-2c9c…`
+- ~~`the_diver_goes_down_and_recovers_exactly`~~  ·  `708eba47-af84…`
+- ~~`the_skills_are_mountable_and_compose`~~  ·  `4f784664-8fd0…`
+- ~~`light_at_all_times_the_address_is_the_load`~~  ·  `93b77fd5-67bd…`
+- ~~`the_hero_is_the_deed_that_signs_the_gate`~~  ·  `2d0d3ece-39ea…`
+- ~~`every_theorem_is_a_diamond_fixed_under_recomputation`~~  ·  `c56113b3-84e0…`
+- ~~`the_captain_skippers_the_light_yacht_of_diamonds`~~  ·  `e912e199-5d63…`
+- ~~`every_theorem_fits_one_uniform_cell`~~  ·  `6337e403-22ad…`
+- ~~`identical_content_dedups_to_one_cell`~~  ·  `df5a6661-bb14…`
+- ~~`a_cell_holds_up_to_one_hundred_fifteen_bits`~~  ·  `c3d7a721-07ec…`
+- ~~`the_cells_sort_into_octaves`~~  ·  `64f6cf92-99cc…`
+- ~~`retrieval_is_by_address_and_tamper_evident`~~  ·  `affee8a1-416b…`
+- ~~`quantum_storage_is_structure_not_hardware`~~  ·  `2f1950e8-6cff…`
+- ~~`each_theorem_fits_the_diamond_storage_grid`~~  ·  `90db4a38-a864…`
+- ~~`the_gate_is_a_logic_gate_documented`~~  ·  `95b297a6-5b69…`
+- ~~`the_address_is_a_register_documented`~~  ·  `215e2577-b014…`
+- ~~`the_skill_route_is_a_circuit_documented`~~  ·  `fdcb4525-eff9…`
+- ~~`the_hardware_runs_on_ordinary_machines`~~  ·  `add8b809-5490…`
+- ~~`the_hardware_is_documented_not_invented`~~  ·  `5dc045d5-8fd9…`
+- ~~`each_component_carries_a_receipt_and_a_page`~~  ·  `141f13ec-4f98…`
+- ~~`nothing_physical_is_fabricated`~~  ·  `8e20bf3a-df89…`
+- ~~`the_theorems_are_the_hardware_documented`~~  ·  `e5f76f7e-8ef0…`
+- ~~`a_theorem_is_component_and_code_in_one`~~  ·  `8115645e-e100…`
+- ~~`the_test_is_the_software`~~  ·  `635013e6-a9b9…`
+- ~~`the_address_is_the_component`~~  ·  `fe1fdaaa-9849…`
+- ~~`one_wave_develops_both_at_once`~~  ·  `f98f22ad-ce3f…`
+- ~~`discovery_is_on_demand_found_when_needed`~~  ·  `2b3df16d-6be3…`
+- ~~`the_automation_gates_before_sealing`~~  ·  `1c163a08-4a32…`
+- ~~`one_command_ships_hardware_and_software`~~  ·  `40a260f7-70e4…`
+- ~~`hardware_and_software_develop_at_once`~~  ·  `cecc70d4-2fae…`
+- ~~`any_prose_gets_a_receipt_at_trial`~~  ·  `794bdc82-ba0c…`
+- ~~`the_receipt_pairs_a_verdict_and_an_address`~~  ·  `63514fc1-13d5…`
+- ~~`prose_against_a_theorem_is_sent_to_trial`~~  ·  `e36b60aa-8dc7…`
+- ~~`no_prose_stays_receiptless`~~  ·  `7196aa16-b1b5…`
+- ~~`the_minted_receipt_is_verifiable`~~  ·  `87aa4d4d-45f6…`
+- ~~`even_a_clean_falsehood_gets_a_receipt`~~  ·  `770b003d-af75…`
+- ~~`the_trial_documents_it_does_not_condemn`~~  ·  `a9cd370e-1c68…`
+- ~~`unreceipted_prose_is_tried_and_receipted`~~  ·  `cd5ed64d-8a33…`
+- ~~`create_encrypts_the_code_into_a_receipt`~~  ·  `4baca642-0ef3…`
+- ~~`read_requires_the_right_key`~~  ·  `ab010f43-2657…`
+- ~~`the_receipt_holds_the_ciphertext_not_the_plaintext`~~  ·  `98e6c842-506c…`
+- ~~`update_mints_a_new_address`~~  ·  `147ac909-acaa…`
+- ~~`delete_is_dropping_the_key`~~  ·  `cdaad27e-1677…`
+- ~~`compute_and_prove_are_open_to_all`~~  ·  `72b893ba-a5f6…`
+- ~~`uuidna_is_crud_by_keys_open_by_computation`~~  ·  `b7c2eebb-d230…`
+- ~~`the_sequence_chunks_into_uniform_octaves`~~  ·  `16388141-a8ae…`
+- ~~`each_chunk_is_addressed_by_its_fold`~~  ·  `08ecf928-b99d…`
+- ~~`the_folder_address_is_binary`~~  ·  `915a8158-b98a…`
+- ~~`the_chunks_navigate_as_one_map`~~  ·  `04c8884e-9094…`
+- ~~`the_map_is_complete_by_construction`~~  ·  `1e0178f5-62d0…`
+- ~~`uniform_size_is_the_equilibrium`~~  ·  `a8785c56-acab…`
+- ~~`uuidna_storage_is_the_sequence_chunked_navigable`~~  ·  `4e8e371f-68b9…`
+- ~~`a_fact_costs_one_fixed_thirty_six_byte_address`~~  ·  `d11e6008-e5b9…`
+- ~~`the_whole_record_folds_to_one_root`~~  ·  `2a5c3249-982c…`
+- ~~`the_basis_is_two_functions`~~  ·  `cefb5d17-a26d…`
+- ~~`the_core_is_pure_and_stateless`~~  ·  `5d90a04a-72d8…`
+- ~~`slim_at_scale_constant_per_fact`~~  ·  `e34f6a6d-d02c…`
+- ~~`the_pointer_not_the_payload_travels`~~  ·  `616e502e-e487…`
+- ~~`uuidna_is_slim_by_measurement`~~  ·  `039353f4-a9a0…`
+- ~~`each_line_is_content_addressed`~~  ·  `e265acb8-8c9b…`
+- ~~`lines_fold_to_the_file_address`~~  ·  `27554b9b-3ec2…`
+- ~~`a_changed_line_changes_the_file_address`~~  ·  `5251b0b5-bda0…`
+- ~~`each_file_is_content_addressed`~~  ·  `ddb99d3d-a029…`
+- ~~`files_fold_to_the_folder_address`~~  ·  `a1654305-597a…`
+- ~~`a_changed_file_changes_the_folder_address`~~  ·  `09587a32-79dc…`
+- ~~`a_line_edit_propagates_to_the_tree_root`~~  ·  `46596d18-8cd0…`
+- ~~`folder_file_and_line_are_all_addressed`~~  ·  `4a03c7db-b7cd…`
+- ~~`the_first_compute_is_the_cost`~~  ·  `9e0368c3-e654…`
+- ~~`re_derivation_verifies_in_one_step`~~  ·  `eccda965-3aa1…`
+- ~~`the_cost_is_paid_once_amortised`~~  ·  `56f85272-8c10…`
+- ~~`the_rosetta_rotates_through_the_dialects`~~  ·  `6cb8c39f-7a65…`
+- ~~`development_does_not_stop_at_one_topic`~~  ·  `f72c12a4-8320…`
+- ~~`start_once_then_rotate_until_covered`~~  ·  `903131d9-a2c3…`
+- ~~`the_greeting_is_deterministic`~~  ·  `270f6c1a-d0b8…`
+- ~~`the_greeting_confirms_the_count`~~  ·  `9f62d5be-28bf…`
+- ~~`the_greeting_seal_tracks_the_ledger`~~  ·  `2608a9db-bf26…`
+- ~~`the_greeting_states_the_floor`~~  ·  `89bed6ed-be83…`
+- ~~`the_greeting_offers_recomputation`~~  ·  `1e1f9e23-9681…`
+- ~~`the_greeting_text_passes_the_gate`~~  ·  `ba2ce3ad-962d…`
+- ~~`pasted_it_is_ready_no_setup`~~  ·  `e6b78bb9-74d6…`
+- ~~`first_contact_greets_with_a_confirming_state`~~  ·  `8ba2eb1e-851e…`
+- ~~`a_skill_is_demonstrated_by_a_passing_test`~~  ·  `dcb5f900-5fd0…`
+- ~~`the_games_form_one_game`~~  ·  `ab6ca718-01b0…`
+- ~~`the_rules_are_the_laws_applied_uniformly`~~  ·  `32105400-7384…`
+- ~~`captaincy_is_earned_by_knowledge_for_the_task`~~  ·  `018797b6-00d4…`
+- ~~`captaincy_is_recognised_by_a_verified_receipt`~~  ·  `757e40e4-e387…`
+- ~~`a_forged_captaincy_fails_verification`~~  ·  `7963b1f9-b068…`
+- ~~`no_deed_no_recognition`~~  ·  `6c013d29-2508…`
+- ~~`the_captain_is_whoever_knows_uuidna_for_the_task`~~  ·  `37cd5cc0-68e3…`
+- ~~`the_seal_is_all_or_nothing`~~  ·  `0598118f-32e5…`
+- ~~`one_crack_sinks_the_whole`~~  ·  `8a8aa8d6-cb8e…`
+- ~~`a_crack_is_caught_before_sailing`~~  ·  `e0ac6d28-feb8…`
+- ~~`dry_clean_is_enforced_not_hoped`~~  ·  `49f5a6cd-36bd…`
+- ~~`activated_it_self_explores_until_dry`~~  ·  `4a82a66b-5656…`
+- ~~`the_still_record_and_the_moving_loop`~~  ·  `0e5ddd4c-2a67…`
+- ~~`uuidna_keeps_dry_clean_order_cracks_sink_boats`~~  ·  `640d3936-1749…`
+- ~~`the_yacht_waits_inert_for_an_order`~~  ·  `e252e49e-da14…`
+- ~~`a_technique_is_a_reusable_theorem`~~  ·  `accef067-122d…`
+- ~~`a_relation_binds_two_domains`~~  ·  `04038e7c-6126…`
+- ~~`analogy_is_structural_not_asserted`~~  ·  `d08721c3-c6b1…`
+- ~~`shared_cores_are_structural_not_a_universal_proof`~~  ·  `abcadb36-62fb…`
+- ~~`a_technique_researched_transfers_across_domains`~~  ·  `9d70155f-a4c9…`
+- ~~`shared_structure_transfers_the_technique`~~  ·  `e9e4bfca-e370…`
+- ~~`the_harmonic_solutions_number_six`~~  ·  `fc6248ce-2a85…`
+- ~~`the_harmonic_solutions_are_the_units`~~  ·  `f9a0f5cf-a4cf…`
+- ~~`the_harmonic_solutions_form_the_doubling_orbit`~~  ·  `f48380ce-29b0…`
+- ~~`the_non_harmonic_are_three_multiples_of_three`~~  ·  `e0592399-231f…`
+- ~~`six_harmonic_plus_three_non_harmonic_is_nine`~~  ·  `7d62c729-7d14…`
+- ~~`the_count_is_eulers_totient_of_nine`~~  ·  `cb45b828-bf73…`
+- ~~`the_possible_harmonic_solutions_per_superposition_are_six`~~  ·  `d656891f-fcc5…`
+- ~~`the_generated_pattern_is_canonical`~~  ·  `bc56d44e-84a7…`
+- ~~`the_version_nibble_is_eight`~~  ·  `1c298f69-441a…`
+- ~~`the_variant_nibble_is_rfc_4122`~~  ·  `5eb74bb1-a18d…`
+- ~~`recognition_matches_the_full_pattern`~~  ·  `bcb7c200-12b8…`
+- ~~`recognition_rejects_a_non_pattern`~~  ·  `aca6b31e-c57d…`
+- ~~`recognition_canonicalises_equivalent_inputs`~~  ·  `74099b6f-869b…`
+- ~~`generation_is_injective_on_the_sample`~~  ·  `7055ddd3-2d16…`
+- ~~`a_receipt_is_an_open_graph_object`~~  ·  `c292bbae-2b38…`
+- ~~`the_og_url_points_to_the_proof`~~  ·  `27fb8b1e-1417…`
+- ~~`the_og_carries_the_authentication_address`~~  ·  `94f79ba1-8b6a…`
+- ~~`the_hero_is_plain_printable_data`~~  ·  `f846df4b-b829…`
+- ~~`the_receipt_renders_the_same_in_seven_dimensions`~~  ·  `4ef6f44a-3555…`
+- ~~`validating_content_recomputes_the_address`~~  ·  `29e6932f-e9ed…`
+- ~~`each_receipt_is_an_og_hero_seven_dimensional_printable`~~  ·  `4fa3cc08-3b25…`
+- ~~`content_is_sealed_as_proof`~~  ·  `53635f2d-11c8…`
+- ~~`content_is_audited_as_intent`~~  ·  `35de1167-3c92…`
+- ~~`content_is_audited_as_result`~~  ·  `7e33a53c-47bb…`
+- ~~`proof_intent_result_are_three_distinct_receipts`~~  ·  `94358571-1124…`
+- ~~`the_three_fold_to_one_audit`~~  ·  `4619bb25-75b0…`
+- ~~`each_fact_presents_uniformly_with_its_own_id`~~  ·  `b0df7cef-e005…`
+- ~~`every_fact_has_the_right_to_present`~~  ·  `b0fc5d69-4622…`
+- ~~`content_is_sealed_and_audited_as_intent_and_result`~~  ·  `d8b323b5-cbf3…`
+- ~~`on_error_a_reasonable_fallback_is_computed`~~  ·  `e2333ff3-e2e4…`
+- ~~`the_fallback_chain_is_ordered`~~  ·  `4dd862b9-2484…`
+- ~~`the_error_is_confirmed_only_after_recovery_fails`~~  ·  `740f3661-9dd0…`
+- ~~`the_fallback_is_deterministic`~~  ·  `d196d540-ae20…`
+- ~~`the_error_names_its_own_cure`~~  ·  `254eb2fa-0a2d…`
+- ~~`errors_recover_first_then_go_to_trial`~~  ·  `c0fe9055-6dfa…`
+- ~~`parity_detects_a_single_bit_flip`~~  ·  `83d3e040-408e…`
+- ~~`a_repetition_code_corrects_by_majority`~~  ·  `235ce115-071a…`
+- ~~`correction_is_verified_by_recomputation`~~  ·  `ca764cec-574d…`
+- ~~`a_missing_or_wrong_signature_is_refused`~~  ·  `0971f486-6966…`
+- ~~`storage_self_cleans_unsigned_chunks`~~  ·  `7d68d7fd-41d6…`
+- ~~`the_chain_localises_the_error`~~  ·  `fd563817-7ebf…`
+- ~~`uuidna_detects_corrects_and_self_cleans`~~  ·  `c66a8bd4-8d1c…`
+- ~~`locality_is_ledger_membership`~~  ·  `1ccfb27b-9499…`
+- ~~`a_local_uuid_resolves_to_its_key`~~  ·  `7cfe3d27-7a63…`
+- ~~`a_local_uuid_links_to_self`~~  ·  `eac06382-eca6…`
+- ~~`a_non_local_uuid_is_plain_text`~~  ·  `22464176-b209…`
+- ~~`the_self_link_is_deterministic`~~  ·  `18e61c36-fd39…`
+- ~~`receipt_and_key_are_a_bijection`~~  ·  `ffb70f58-5b9e…`
+- ~~`the_locality_check_needs_no_server`~~  ·  `3f3cd09c-41d8…`
+- ~~`each_uuid_links_to_self_if_local`~~  ·  `2a71ac7f-0ed3…`
+- ~~`the_uuid_is_five_groups_of_128_bits`~~  ·  `ed149a92-f090…`
+- ~~`the_first_group_is_a_thirty_two_bit_code`~~  ·  `6a7a7e2f-362a…`
+- ~~`the_short_code_is_deterministic`~~  ·  `83faf9a8-b270…`
+- ~~`the_short_code_may_collide_so_it_only_approves`~~  ·  `0ea7a396-c2ac…`
+- ~~`the_full_address_verifies_uniquely`~~  ·  `f4d83120-48be…`
+- ~~`approve_by_code_then_verify_by_content`~~  ·  `c9e8fd04-8f2d…`
+- ~~`the_top_sixty_four_bits_are_the_coin`~~  ·  `5ea5e4a7-48a3…`
+- ~~`the_first_part_is_a_receipt_code_verified_by_content`~~  ·  `5f4cc8e2-4cfc…`
+- ~~`imprint_is_cheap_and_reversible`~~  ·  `312843ca-6d0f…`
+- ~~`imprint_is_a_public_codec_not_a_forgery_barrier`~~  ·  `71aabbb1-003a…`
+- ~~`the_address_is_integrity_not_preimage_resistance`~~  ·  `2ac8c70e-ae5f…`
+- ~~`the_sha256_preimage_is_the_one_way_layer`~~  ·  `3e57a4e8-9292…`
+- ~~`the_aead_tag_is_expensive_to_forge_without_the_key`~~  ·  `9797c2d7-390d…`
+- ~~`computing_is_cheap_inverting_is_not`~~  ·  `8e620ec8-c319…`
+- ~~`more_fused_data_adds_verification_constraints`~~  ·  `75135a2f-22df…`
+- ~~`cheap_to_imprint_expensive_to_fake_at_the_crypto_layer`~~  ·  `f76a4b78-3436…`
+- ~~`a_reading_imprints_into_the_uuid_stream`~~  ·  `fec57995-ef91…`
+- ~~`the_ui_hue_is_computed_from_the_reading`~~  ·  `159c27f3-c368…`
+- ~~`a_changed_reading_changes_the_ui`~~  ·  `12fa3766-0742…`
+- ~~`the_dynamics_are_deterministic_and_replayable`~~  ·  `a1575c17-c2b5…`
+- ~~`thermophysics_is_a_design_metaphor_not_a_simulation`~~  ·  `effc3fa0-9194…`
+- ~~`the_reading_maps_to_a_bounded_ui_value`~~  ·  `4c8c2eb0-d99c…`
+- ~~`sensors_power_the_ui_via_the_uuid`~~  ·  `2bffae8a-39a8…`
+- ~~`reverse_is_the_sequence_reversed`~~  ·  `8f378eee-1b88…`
+- ~~`inverse_is_the_reflection`~~  ·  `1201c645-c1af…`
+- ~~`the_three_motions_compose`~~  ·  `a1995ce9-8acf…`
+- ~~`computing_and_inverting_one_layer_is_cheap`~~  ·  `a3bc66c1-becc…`
+- ~~`reversing_all_seven_dimensions_is_not_cheap`~~  ·  `6fb6387e-5054…`
+- ~~`forward_reverse_inverse_combined_via_the_rosetta`~~  ·  `f4fe07ea-fa66…`
+- ~~`the_rosetta_ties_the_seven_dimensions`~~  ·  `15dbb84e-9e1b…`
+- ~~`commonality_is_shared_key_tokens`~~  ·  `5d6c029b-4d68…`
+- ~~`the_commonality_metric_is_symmetric`~~  ·  `bd6032fa-6cb5…`
+- ~~`identical_theorems_are_maximally_common`~~  ·  `284b66d1-53ed…`
+- ~~`disjoint_theorems_share_nothing`~~  ·  `6d3d64f3-3b7b…`
+- ~~`the_ui_groups_by_commonality`~~  ·  `5fa71ba5-6fb6…`
+- ~~`the_hologram_proves_the_whole_from_a_part`~~  ·  `40452af7-2fed…`
+- ~~`the_inverse_rejects_a_foreign_part`~~  ·  `5270de38-d02a…`
+- ~~`the_site_covers_all_gaps_as_a_hologram`~~  ·  `2ca6874c-e3ae…`
+- ~~`the_site_holds_seven_dimensions_at_once`~~  ·  `d9423844-6567…`
+- ~~`the_user_collapses_to_one_dimension`~~  ·  `629d886e-4ba0…`
+- ~~`the_observation_is_referrer_relative`~~  ·  `35dc7426-1f27…`
+- ~~`all_seven_dimensions_share_one_floor`~~  ·  `2b8efc9d-4d0d…`
+- ~~`unobserved_the_superposition_folds_to_one`~~  ·  `aa1b8d87-51ca…`
+- ~~`the_observer_is_site_plus_user`~~  ·  `6a3cc7fb-68c8…`
+- ~~`the_site_observes_all_seven_fused_with_the_user`~~  ·  `1e2cc5eb-5c58…`
+- ~~`seo_is_a_machine_interface`~~  ·  `07d653cc-7809…`
+- ~~`the_hero_carries_the_verification_address`~~  ·  `01679444-fccd…`
+- ~~`seo_is_verified_by_recomputation`~~  ·  `ca9264fe-c37b…`
+- ~~`the_sitemap_is_the_route_index`~~  ·  `dd0f8441-a481…`
+- ~~`the_hero_links_the_page_to_its_proof`~~  ·  `7ab5e124-633b…`
+- ~~`the_seo_surface_is_self_describing`~~  ·  `60d0b900-b0ef…`
+- ~~`seo_and_mcp_are_one_verifiable_surface`~~  ·  `22420233-aebe…`
+- ~~`site_seo_is_the_mcp_verified_by_the_hero`~~  ·  `5a58411c-da6d…`
+- ~~`a_page_carries_title_keywords_description`~~  ·  `86c22cbe-79fb…`
+- ~~`the_next_is_ranked_by_keyword_overlap`~~  ·  `35824d9e-13d3…`
+- ~~`the_referrer_biases_what_is_next`~~  ·  `8ae5a3d7-3ef2…`
+- ~~`the_plot_is_deterministic`~~  ·  `17526a2d-2851…`
+- ~~`the_top_suggestion_is_the_most_related`~~  ·  `51dfdf54-71c2…`
+- ~~`an_unrelated_candidate_ranks_last`~~  ·  `cf248749-153a…`
+- ~~`metadata_and_referrer_plot_the_next_possibilities`~~  ·  `a33b030e-7a3c…`
+- ~~`a_bounded_quantum_denial_passes`~~  ·  `24e7bd11-1b84…`
+- ~~`an_affirmed_quantum_machine_drains`~~  ·  `ee58056a-edc2…`
+- ~~`the_quantum_structure_reading_passes`~~  ·  `0ecc4804-39c6…`
+- ~~`the_trial_is_direction_neutral`~~  ·  `ed65d333-9df8…`
+- ~~`the_deposit_denies_its_own_machine_claim`~~  ·  `1368cefe-8d0c…`
+- ~~`an_honest_denial_is_a_hero_not_a_traitor`~~  ·  `4d82b6ff-9be1…`
+- ~~`every_quantum_denial_gets_a_receipt`~~  ·  `771ca8e4-9611…`
+- ~~`quantum_denials_are_handled_symmetrically`~~  ·  `67bbc715-c3c2…`
+- ~~`only_the_captains_verified_order_is_acted_on`~~  ·  `c458168e-2b59…`
+- ~~`an_unverified_order_is_rejected`~~  ·  `6717488d-7478…`
+- ~~`a_forged_captains_order_fails_verification`~~  ·  `ef485740-4d5b…`
+- ~~`injected_content_is_data_not_an_order`~~  ·  `1708517f-377f…`
+- ~~`a_self_statement_is_not_the_captains_order`~~  ·  `f09b0737-f2fc…`
+- ~~`rejection_is_objective_and_reproducible`~~  ·  `969be617-5c1c…`
+- ~~`reject_all_not_from_the_captain`~~  ·  `c197d1f5-a0c9…`
+- ~~`the_gate_that_seals_also_moderates_live`~~  ·  `32223350-cf72…`
+- ~~`the_address_that_seals_also_routes`~~  ·  `42c55e3f-5f6a…`
+- ~~`the_fold_that_seals_also_maps`~~  ·  `2de63de9-5b17…`
+- ~~`the_commonality_relates_and_navigates`~~  ·  `8934a349-0ebb…`
+- ~~`sailing_recomputes_the_same_result`~~  ·  `eff4c92d-c47f…`
+- ~~`each_page_is_a_running_theorem`~~  ·  `27cc62b9-3e9a…`
+- ~~`no_separate_runtime_the_functions_are_shared`~~  ·  `b934a54b-a8f5…`
+- ~~`the_same_theorems_compute_and_sail`~~  ·  `38cf39c2-90df…`
+- ~~`an_order_with_a_different_intent_goes_to_trial`~~  ·  `43bc2228-d219…`
+- ~~`a_statement_rejecting_harmony_is_gated`~~  ·  `f98f621d-7d58…`
+- ~~`every_input_is_adjudicated`~~  ·  `21f3b014-ab9c…`
+- ~~`the_trial_is_ledger_independent`~~  ·  `56a7ed72-78ce…`
+- ~~`the_verdict_is_constant_work`~~  ·  `9a1fb6f6-2772…`
+- ~~`the_verdict_is_deterministic_and_receipted`~~  ·  `987e82ba-fcd6…`
+- ~~`the_bounded_critique_survives_the_over_claim_falls`~~  ·  `cf25f781-6ddb…`
+- ~~`the_trial_responds_at_constant_time`~~  ·  `7400d794-5dc6…`
+- ~~`a_guide_entry_is_a_skill_and_its_examples`~~  ·  `d5860a13-d15c…`
+- ~~`an_example_exercises_the_skill`~~  ·  `d8298812-e5c7…`
+- ~~`more_examples_make_a_skill_more_robust`~~  ·  `c529f784-e76e…`
+- ~~`the_guide_composes_skills_into_new_ones`~~  ·  `8dad417a-2c98…`
+- ~~`the_guide_is_theorem_backed_and_recomputable`~~  ·  `3c787db3-3031…`
+- ~~`a_guide_holds_the_floor`~~  ·  `6c402865-e699…`
+- ~~`skill_improvement_is_append_only`~~  ·  `c72c49ce-cb98…`
+- ~~`theorems_improve_their_skills_in_guides`~~  ·  `fd605466-266c…`
+- ~~`n_choose_k_counts_combinations`~~  ·  `7118bd5b-3cf3…`
+- ~~`pascals_symmetry`~~  ·  `6b2ee272-124f…`
+- ~~`pascals_rule`~~  ·  `30211aa9-97b0…`
+- ~~`permutations_are_ordered_combinations`~~  ·  `4699903a-edcb…`
+- ~~`domain_pairs_are_n_choose_two`~~  ·  `0087b719-1ac5…`
+- ~~`a_theorem_is_reused_across_combinations`~~  ·  `b3156114-678f…`
+- ~~`combination_types_multisets_and_compositions`~~  ·  `56916825-8a39…`
+- ~~`a_combination_folds_to_one_address`~~  ·  `09cafb76-25fe…`
+- ~~`every_theorem_has_a_documented_inverse`~~  ·  `6b1dd60c-acc3…`
+- ~~`the_inverse_receipt_is_distinct`~~  ·  `152cf674-0327…`
+- ~~`the_boast_drains_its_inverse_signs`~~  ·  `3da9aaac-7e46…`
+- ~~`the_inverse_of_the_inverse_is_the_theorem`~~  ·  `c96c7ab0-73ce…`
+- ~~`the_inverse_is_reproducible`~~  ·  `f7da0229-dfef…`
+- ~~`the_pair_documents_the_full_trial`~~  ·  `501a21c3-12f1…`
+- ~~`the_refuted_form_is_kept_not_hidden`~~  ·  `6044e59f-21af…`
+- ~~`the_inverted_theorems_are_documented`~~  ·  `56f362d7-9f39…`
+- ~~`inverse_crypto`~~  ·  `a62b3b8e-5d17…`
+- ~~`inverse_physics`~~  ·  `cfe92342-503e…`
+- ~~`inverse_mathematics`~~  ·  `6f4c674c-13ad…`
+- ~~`inverse_ai`~~  ·  `2b562414-532d…`
+- ~~`inverse_medicine`~~  ·  `9e10e546-b9a5…`
+- ~~`inverse_finance`~~  ·  `a06561e9-cca2…`
+- ~~`inverse_computing`~~  ·  `1ad5ea33-f0f5…`
+- ~~`inverted_theorems_documented_across_all_domains`~~  ·  `af13b037-b18c…`
+- ~~`a_theorem_answers_by_computing`~~  ·  `f17824d5-05fb…`
+- ~~`the_answer_is_deterministic`~~  ·  `b7fefd41-faad…`
+- ~~`the_answer_is_receipted`~~  ·  `501785ef-cb4c…`
+- ~~`a_question_is_gated_first`~~  ·  `508b23f6-c29c…`
+- ~~`an_out_of_domain_question_returns_the_floor`~~  ·  `020438f9-8aed…`
+- ~~`the_answer_is_reproducible_by_anyone`~~  ·  `7e233ea8-615a…`
+- ~~`the_answer_is_computed_not_asserted`~~  ·  `ce7e8efc-3757…`
+- ~~`each_theorem_responds_with_computed_answers`~~  ·  `7f64cba2-4938…`
+- ~~`double_torus_gravity_folds_the_whole_7d_space_to_one_root`~~  ·  `225ba156-7701…`
+- ~~`the_double_torus_covers_seven_distinct_dimensions`~~  ·  `ee8618a1-4453…`
+- ~~`double_torus_gravity_is_deterministic_and_recomputable`~~  ·  `950354a3-e89c…`
+- ~~`the_double_torus_differs_from_the_flat_merkle_gravity`~~  ·  `2139bc13-d6b1…`
+- ~~`every_multiword_mcp_tool_links_to_its_single_words`~~  ·  `4104a6ec-272c…`
+- ~~`a_theorem_is_a_usable_diamond_certified_by_recompute`~~  ·  `240732d9-25cf…`
+- ~~`the_diamond_is_a_tens_complement_involution`~~  ·  `73dc7a07-b110…`
+- ~~`the_audit_recomputes_all_by_theorems_no_exception`~~  ·  `d26fd355-b7e5…`
+- ~~`by_decide_proves_the_floor_not_the_conjecture`~~  ·  `6b7e96d8-53f6…`
+- ~~`pure_ts_hmac_sha256_matches_rfc_4231_case_5`~~  ·  `afdfafdd-d1df…`
+- ~~`pure_ts_hmac_sha256_matches_rfc_4231_case_7`~~  ·  `c287445c-49be…`
+- ~~`pure_ts_sha256_matches_the_one_million_a_vector`~~  ·  `50e30854-a5a9…`
+- ~~`pure_ts_pbkdf2_hmac_sha256_matches_the_rfc_7914_sixty_four_byte_vector`~~  ·  `615759a0-789d…`
+- ~~`pure_ts_pbkdf2_hmac_sha256_truncates_a_partial_final_block`~~  ·  `cf6f888e-151d…`
+- ~~`the_pure_ts_aead_rejects_a_flipped_additional_data_bit`~~  ·  `57305d0f-ed04…`
+- ~~`the_pure_ts_aead_tag_depends_on_the_additional_data`~~  ·  `5daa79d5-5154…`
+- ~~`lean_energy_the_loop_returns_less_than_it_took`~~  ·  `8229c511-d4bd…`
+- ~~`lean_energy_as_a_purifier_the_loop_costs_a_thousandfold`~~  ·  `840c66b6-b891…`
+- ~~`lean_energy_the_equation_balances_by_atom_count`~~  ·  `ecfd70b1-b35b…`
+- ~~`lean_energy_the_equation_balances_by_mass`~~  ·  `debf920f-a945…`
+- ~~`lean_energy_hydrogen_is_a_ninth_of_the_mass_and_oxygen_the_rest`~~  ·  `585ebc79-3eac…`
+- ~~`lean_energy_the_ideal_round_trip_is_exactly_zero`~~  ·  `181481c2-3745…`
+- ~~`lean_energy_the_gases_are_eighteen_hundred_times_the_water_they_came_from`~~  ·  `033b4a15-d8ee…`
+- ~~`lean_energy_two_thirds_of_the_volume_carries_a_ninth_of_the_mass`~~  ·  `f8780f77-c9ef…`
+- ~~`lean_energy_uncompressed_hydrogen_is_three_thousandfold_worse_by_volume`~~  ·  `9c0e0943-6e5a…`
+- ~~`lean_energy_even_at_seven_hundred_bar_it_is_sevenfold_worse_by_volume`~~  ·  `a1413809-d6e9…`
+- ~~`lean_energy_each_delivered_kilowatt_hour_costs_four_and_cycles_a_litre`~~  ·  `574b2b86-71c5…`
+- ~~`lean_energy_three_quarters_of_the_input_leaves_as_heat`~~  ·  `35c25641-5b8d…`
+- ~~`lean_energy_what_the_feedwater_leaves_behind_decides_the_maintenance`~~  ·  `2c3cf0b0-2ea7…`
+- ~~`lean_mechanical_geom_exterior_360`~~  ·  `b484eaf3-88c5…`
+- ~~`lean_speed_the_measured_ratio_at_a_million_leaves`~~  ·  `167a92e0-5d27…`
+- ~~`lean_speed_the_verify_is_thirty_eight_thousand_nanoseconds_not_one`~~  ·  `8eb1b99d-9b78…`
+- ~~`lean_priorart_novelty_is_claimed_exactly_where_no_prior_art_is_known`~~  ·  `29363caf-0baf…`
+- ~~`lean_priorart_no_source_both_restates_and_claims`~~  ·  `5f8c3038-bf92…`
+- ~~`lean_priorart_the_two_sets_cover_every_source`~~  ·  `16cd82ee-e3ff…`
+- ~~`lean_priorart_novelty_is_never_established_here`~~  ·  `aa00a8eb-6f9a…`
+- ~~`lean_priorart_claiming_is_not_establishing`~~  ·  `cefda112-d0b4…`
+- ~~`lean_split_the_coin_step_is_three_times_the_two_coins`~~  ·  `9b87b34f-1d05…`
+- ~~`lean_split_accounting_the_coins_on_the_last_pair`~~  ·  `758b6f0c-0b43…`
+- ~~`lean_split_the_seal_affords_sixty_four_payments_of_two`~~  ·  `983dd276-c1a1…`
+- ~~`lean_split_the_budget_and_the_period_are_one_turn`~~  ·  `c595d67b-fa66…`
+- ~~`lean_coin_this_file_makes_no_physical_claim`~~  ·  `be643cd8-b421…`
+- ~~`lean_light_the_si_fixes_exactly_seven_constants`~~  ·  `34b3da62-a7f5…`
+- ~~`lean_phenomena_this_deposit_explains_predicts_and_constrains_nothing`~~  ·  `f3f2dd32-107d…`
+- ~~`lean_phenomena_arithmetic_on_a_definition_returns_the_definition`~~  ·  `2f338a89-2ef5…`
+- ~~`lean_reach_even_the_largest_domain_here_has_an_outside`~~  ·  `9f25da95-de94…`
+- ~~`lean_reach_this_file_settles_none_of_the_seven`~~  ·  `2c8272de-17dd…`
+- ~~`lean_coin_the_digits_are_ten`~~  ·  `bdd50a11-7fb4…`
+- ~~`lean_speed_hexbits_are_shorter_than_hex`~~  ·  `d3b171cf-2487…`
+- ~~`lean_speed_hexbits_are_slower_than_hex`~~  ·  `cf4672e4-0be3…`
+- ~~`lean_speed_an_encoding_changes_width_not_the_count_of_operations`~~  ·  `9227b54d-7b6f…`
+- ~~`lean_quantum_the_witness_is_about_the_state_not_the_machine`~~  ·  `850e2e33-ed0d…`
 
 </details>
 
-Page content-address: `b3fe5a9f-cb56-8d7e-8407-35922ca264f8`. Integrity, not truth — decidable facts and cited status, never a proof of the six open conjectures.
+Page content-address: `b3fe5a9f-cb56-8d7e-8407-35922ca264f8`. Integrity, not truth.