@ceccec/millennium-solutions 9.3.0 → 9.3.1

package/speedup.md

@@ -7,7 +7,7 @@ head:
 
 # The real uuidna advantage — measured, in all domains
 
-> Generated from the **2667** ledger entries and **59** domains, recomputed each build. The advantage is
+> Generated from the **2674** ledger entries and **59** domains, recomputed each build. The advantage is
 > real and **measured**, and honestly bounded: a **verification and reuse** complexity reduction — **not**
 > faster original compute, **not** faster than light, **not** quantum.
 
@@ -33,9 +33,9 @@ theorems verify in `⌈log₂N⌉`. So one proof covers the whole [rosetta](/):
 
 ## Discovery lead — a lead, never a verdict
 
-Grouping the 2667 receipts by the digital root of their address, the **sparsest** region is digit
+Grouping the 2674 receipts by the digital root of their address, the **sparsest** region is digit
 **3** (270) — a candidate area to examine, not a finding. The ledger is currently held
-at **2667** (the captain's cap): improving a theorem's name or proof heals the record without changing the
+at **2674** (the captain's cap): improving a theorem's name or proof heals the record without changing the
 count; discovering a new one would require lifting the cap.
 
 A content-address proves **integrity, not truth**.

package/src/proof/address.lean

@@ -88,8 +88,8 @@ theorem addressing_is_not_constant : toUuidBytes [1] ≠ toUuidBytes [2] := by d
 -- ── the four seeds genuinely differ, so the four words are independent draws ──
 theorem the_four_seeds_are_distinct : (SEEDS.eraseDups).length = 4 := by decide
 
-def settledHere : Nat := 17
-theorem address_settles_its_range : settledHere = 17 := rfl
+def settledHere : Nat := 20
+theorem address_settles_its_range : settledHere = 20 := rfl
 
 
 
@@ -114,4 +114,34 @@ theorem the_address_is_not_the_payload :
 theorem the_address_is_order_sensitive :
   toUuidBytes [97, 98] ≠ toUuidBytes [98, 97] := by decide
 
+
+-- ── the stamp's fields, for every byte ──────────────────────────────────────────────────────────────────────
+-- 128 bits − 4 (version) − 2 (variant) = 122 hash bits. Byte 6 keeps its low nibble under the version 8, byte 8
+-- keeps its low six bits under the variant 10, stamping twice is stamping once, and so the third group is always
+-- version 8 over exactly twelve hash bits and the fourth is always variant 10 over exactly fourteen. The address
+-- is a commitment to its content, not a store of it: 122 bits is also all a 122-qubit register could yield (Holevo).
+theorem the_version_stamp_keeps_the_low_nibble_of_every_byte :
+    ∀ b : Nat, b < 256 → or8 (and8 b 15) 128 = 128 + b % 16 := by decide
+
+theorem the_variant_stamp_keeps_the_low_six_bits_of_every_byte :
+    ∀ b : Nat, b < 256 → or8 (and8 b 63) 128 = 128 + b % 64 := by decide
+
+theorem stamping_twice_is_stamping_once :
+    ∀ b : Nat, b < 256 → or8 (and8 (or8 (and8 b 15) 128) 15) 128 = or8 (and8 b 15) 128 ∧
+      or8 (and8 (or8 (and8 b 63) 128) 63) 128 = or8 (and8 b 63) 128 := by decide
+
+theorem the_third_group_is_version_eight_over_twelve_hash_bits :
+    ∀ b6 b7 : Nat, b6 < 256 → b7 < 256 →
+      (or8 (and8 b6 15) 128) * 256 + b7 = 8 * 4096 + (b6 % 16 * 256 + b7) ∧ b6 % 16 * 256 + b7 < 4096 := by
+  intro b6 b7 h6 h7
+  rw [the_version_stamp_keeps_the_low_nibble_of_every_byte b6 h6]
+  exact ⟨by omega, by omega⟩
+
+theorem the_fourth_group_is_variant_two_over_fourteen_hash_bits :
+    ∀ b8 b9 : Nat, b8 < 256 → b9 < 256 →
+      (or8 (and8 b8 63) 128) * 256 + b9 = 2 * 16384 + (b8 % 64 * 256 + b9) ∧ b8 % 64 * 256 + b9 < 16384 := by
+  intro b8 b9 h8 h9
+  rw [the_variant_stamp_keeps_the_low_six_bits_of_every_byte b8 h8]
+  exact ⟨by omega, by omega⟩
+
 end Address

package/src/proof/demand3.lean

@@ -174,4 +174,10 @@ theorem a_repunit_is_divisible_by_seven_exactly_when_six_divides_its_length_for_
   revert j
   decide
 
+
+-- ── the fair-exchange unit, tied to the law above ───────────────────────────────────────────────────────────
+-- The deposit's fare is two coins, 110 − 108 = 2, written until now only in prose (split.lean's comments). χ is
+-- proved for every genus above; at genus 2 its negative is exactly the fare.
+theorem the_two_coin_fare_is_minus_the_euler_characteristic_at_genus_two : (110 : Int) - 108 = - chi 2 := by decide
+
 end Demand3

package/src/proof/discovered.json

@@ -19086,5 +19086,40 @@
     "key": "lean_sequences_thue_morse_doubling_recurrence_for_every_n",
     "name": "lean sequences.lean: thue_morse_doubling_recurrence_for_every_n — ∀ n : Nat, tm (2 * n) = tm n ∧ tm (2 * n + 1) = 1 - tm n — proved by the Lean kernel for every value (by\n  intro), standard axioms only — checked by lean.ts",
     "receipt": "50c8ad36-d08a-835c-8d63-559ac849c2cc"
+  },
+  {
+    "key": "lean_address_the_version_stamp_keeps_the_low_nibble_of_every_byte",
+    "name": "lean address.lean: the_version_stamp_keeps_the_low_nibble_of_every_byte — ∀ b : Nat, b < 256 → or8 (and8 b 15) 128 = 128 + b % 16 — decided by the Lean kernel over its whole finite domain, axiom-free",
+    "receipt": "913d0338-59bc-8288-9605-1d01e8840e56"
+  },
+  {
+    "key": "lean_address_the_variant_stamp_keeps_the_low_six_bits_of_every_byte",
+    "name": "lean address.lean: the_variant_stamp_keeps_the_low_six_bits_of_every_byte — ∀ b : Nat, b < 256 → or8 (and8 b 63) 128 = 128 + b % 64 — decided by the Lean kernel over its whole finite domain, axiom-free",
+    "receipt": "fbc0f2d4-3490-8d68-826a-409a50982c5a"
+  },
+  {
+    "key": "lean_address_stamping_twice_is_stamping_once",
+    "name": "lean address.lean: stamping_twice_is_stamping_once — ∀ b : Nat, b < 256 → or8 (and8 (or8 (and8 b 15) 128) 15) 128 = or8 (and8 b 15) 128 ∧ or8 (and8 (or8 (and8 b 63) 128) 63) 128 = or8 (and8 b 63) 128 — decided by the Lean kernel over its whole finite domain, axiom-free",
+    "receipt": "c397ec59-2a56-80ab-b46d-0635a5fccb92"
+  },
+  {
+    "key": "lean_demand3_the_two_coin_fare_is_minus_the_euler_characteristic_at_genus_two",
+    "name": "lean demand3.lean: the_two_coin_fare_is_minus_the_euler_characteristic_at_genus_two — (110 : Int) - 108 = - chi 2 — decided by the Lean kernel over its whole finite domain, axiom-free",
+    "receipt": "665800be-8ca8-82b8-8b2e-d80ed0b448d9"
+  },
+  {
+    "key": "lean_address_the_third_group_is_version_eight_over_twelve_hash_bits",
+    "name": "lean address.lean: the_third_group_is_version_eight_over_twelve_hash_bits — ∀ b6 b7 : Nat, b6 < 256 → b7 < 256 → (or8 (and8 b6 15) 128) * 256 + b7 = 8 * 4096 + (b6 % 16 * 256 + b7) ∧ b6 % 16 * 256 + b7 < 4096 — proved by the Lean kernel for every value (by\n  intro), standard axioms only — checked by lean.ts",
+    "receipt": "136a86a7-b50b-8cf4-b273-943a5144e674"
+  },
+  {
+    "key": "lean_address_the_fourth_group_is_variant_two_over_fourteen_hash_bits",
+    "name": "lean address.lean: the_fourth_group_is_variant_two_over_fourteen_hash_bits — ∀ b8 b9 : Nat, b8 < 256 → b9 < 256 → (or8 (and8 b8 63) 128) * 256 + b9 = 2 * 16384 + (b8 % 64 * 256 + b9) ∧ b8 % 64 * 256 + b9 < 16384 — proved by the Lean kernel for every value (by\n  intro), standard axioms only — checked by lean.ts",
+    "receipt": "087841c4-271d-88a9-bc1e-0f97cbea43a6"
+  },
+  {
+    "key": "lean_fnv_the_split_multiply_is_the_exact_thirty_two_bit_product",
+    "name": "lean fnv.lean: the_split_multiply_is_the_exact_thirty_two_bit_product — ∀ a b : Nat, (a % 65536 * b + a / 65536 * b % 65536 * 65536) % M32 = mul32 a b — proved by the Lean kernel for every value (by\n  intro), standard axioms only — checked by lean.ts",
+    "receipt": "71d78d5c-0f87-8ff8-84ed-47fb86f64116"
   }
 ]

package/src/proof/fnv.lean

@@ -96,4 +96,21 @@ theorem the_hash_is_order_sensitive :
 theorem the_empty_input_is_still_mixed :
   hash32 0 [] = 2872998923 ∧ hash32 FNV_OFFSET [] = 0 ∧ avalanche 0 = 0 := by decide
 
+
+-- ── the fast multiply, proved exact for every a, b ──────────────────────────────────────────────────────────
+-- A 32-bit product can be taken without big integers: split a into 16-bit halves, and every partial product stays
+-- below 2^53. This is the multiply behind a toUuid that runs 12.5× faster with byte-identical output (measured on
+-- 20,007 inputs); here it is shown equal to mul32 for every a and b, not only on the inputs that were run.
+theorem the_split_multiply_is_the_exact_thirty_two_bit_product :
+    ∀ a b : Nat, (a % 65536 * b + a / 65536 * b % 65536 * 65536) % M32 = mul32 a b := by
+  intro a b
+  unfold mul32 M32
+  have e : a * b = a / 65536 * b * 65536 + a % 65536 * b := by
+    conv => lhs; rw [← Nat.div_add_mod a 65536]
+    rw [Nat.add_mul, Nat.mul_comm 65536 (a / 65536), Nat.mul_right_comm]
+  rw [e]
+  generalize a / 65536 * b = P
+  generalize a % 65536 * b = Q
+  omega
+
 end Fnv

package/src/proof/trial-all.json

@@ -16000,5 +16000,47 @@
     "verdict": "UNVERIFIED",
     "ground": "no candidate in the current space — nothing to recompute",
     "receipt": "50c8ad36-d08a-835c-8d63-559ac849c2cc"
+  },
+  {
+    "key": "lean_address_the_version_stamp_keeps_the_low_nibble_of_every_byte",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "913d0338-59bc-8288-9605-1d01e8840e56"
+  },
+  {
+    "key": "lean_address_the_variant_stamp_keeps_the_low_six_bits_of_every_byte",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "fbc0f2d4-3490-8d68-826a-409a50982c5a"
+  },
+  {
+    "key": "lean_address_stamping_twice_is_stamping_once",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "c397ec59-2a56-80ab-b46d-0635a5fccb92"
+  },
+  {
+    "key": "lean_demand3_the_two_coin_fare_is_minus_the_euler_characteristic_at_genus_two",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "665800be-8ca8-82b8-8b2e-d80ed0b448d9"
+  },
+  {
+    "key": "lean_address_the_third_group_is_version_eight_over_twelve_hash_bits",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "136a86a7-b50b-8cf4-b273-943a5144e674"
+  },
+  {
+    "key": "lean_address_the_fourth_group_is_variant_two_over_fourteen_hash_bits",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "087841c4-271d-88a9-bc1e-0f97cbea43a6"
+  },
+  {
+    "key": "lean_fnv_the_split_multiply_is_the_exact_thirty_two_bit_product",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "71d78d5c-0f87-8ff8-84ed-47fb86f64116"
   }
 ]