@ceccec/millennium-solutions 9.0.9 → 9.1.0

package/src/proof/reach.lean

@@ -52,13 +52,14 @@ theorem doubling_the_domain_leaves_the_same_hole :
 
 -- ── 4 · THE DEPOSIT'S OWN LARGEST DOMAIN IS STILL A BOUND ───────────────────────────────────────────────
 -- 152,568,360,000 is the largest case-count any theorem in this tree walks. It is enormous and it is finite,
--- and the naturals do not stop there. Stated with the number so the point cannot be read as rhetorical.
+-- and the naturals do not stop there. Stated as a LAW with its inverse — the successor leaves every bound, the
+-- predecessor brings it back, and the step flips parity — decided at every bound above AND at the largest
+-- domain, so the number is an instance of the law rather than a value read back (2026-09-14).
 def largestDomainHere : Nat := 152568360000
 
-theorem even_the_largest_domain_here_has_an_outside :
-  largestDomainHere + 1 > largestDomainHere
-  ∧ largestDomainHere % 2 = 0
-  ∧ (largestDomainHere + 1) % 2 = 1 := by decide
+theorem the_successor_leaves_every_domain_and_the_predecessor_returns :
+  (bounds ++ [largestDomainHere]).all (fun n =>
+    n + 1 > n && (n + 1) - 1 == n && (n + 1) % 2 != n % 2) := by decide
 
 -- ── 5 · A THEOREM NAMED FOR THE CLAY PROBLEMS THAT DECIDED NOTHING ABOUT THEM — DELETED ─────────────────
 -- `this_file_settles_none_of_the_seven` stood here and decided:

package/src/proof/speed.lean

@@ -68,9 +68,14 @@ theorem no_constant_factor_accounts_for_the_gap :
   ¬ (10000 * 20 ≥ 1048576) ∧ 100 * 10 ≥ 1024 - 24 := by decide
 
 -- ── 4 · THE MEASURED RATIO, from the declared inputs, in the same unit on both sides — the mistake that
---        made an earlier theorem in this deposit compare seal-bits against a leaf count. ──
-theorem the_measured_ratio_at_a_million_leaves :
-  recomputeUs / verifyUs = 567971 ∧ recomputeUs > verifyUs * 500000 := by decide
+--        made an earlier theorem in this deposit compare seal-bits against a leaf count. Read against the
+--        law: the measurement is at least the gap the counting predicts, N over its inclusion path, so the
+--        machine's number agrees with the structure rather than standing beside it; and the ratio multiplies
+--        back to the recompute within one verify. ──
+theorem the_measured_ratio_exceeds_the_counted_gap :
+  (List.range' 1 20).all (fun k => 2 ^ k / rounds 40 (2 ^ k) ≤ recomputeUs / verifyUs) ∧
+  (recomputeUs / verifyUs) * verifyUs ≤ recomputeUs ∧ recomputeUs < (recomputeUs / verifyUs + 1) * verifyUs ∧
+  recomputeUs / verifyUs = 567971 := by decide
 
 -- ── 5 · VERIFY IS NOT FREE, and calling it O(1) would be the easy overclaim. It grows — slowly, and without
 --        bound — so a large enough set costs a longer path. Logarithmic is not constant. ──
@@ -81,8 +86,11 @@ theorem verification_grows_it_is_not_constant :
 -- ── 6 · NOTHING HERE IS SUB-NANOSECOND. The measured verify is 38000 nanoseconds. The claim that it is under
 --        one is off by four and a half orders of magnitude, and this theorem exists so that number sits in
 --        the ledger next to the impressive one rather than only the impressive one being quotable. ──
-theorem the_verify_is_thirty_eight_thousand_nanoseconds_not_one :
-  nsPerVerify = 38000 ∧ nsPerVerify > 1 ∧ nsPerVerify > 10000 := by decide
+--        The nanosecond figure is not a second typed input: it is the microsecond input converted, and the
+--        conversion reads back at every microsecond count below a thousand. ──
+theorem the_verify_in_nanoseconds_reads_back_its_microseconds :
+  (List.range 1000).all (fun u => u * 1000 / 1000 == u) ∧
+  nsPerVerify = verifyUs * 1000 ∧ nsPerVerify / 1000 = verifyUs ∧ nsPerVerify > 10000 := by decide
 
 -- ── 7 · THE WORK PER NODE IS THE SAME on both paths. Recompute and verify run the identical hash; only the
 --        COUNT differs. That is what makes this arithmetic rather than a claim about hardware. ──
@@ -107,12 +115,22 @@ def hexbitChars : Nat := 22     -- the same address over the 64-hexagram lattice
 def hexMs       : Nat := 16     -- median ms for 200,000 encodings, 8-bit table
 def hexbitMs    : Nat := 30     -- the same work, 6-bit lattice
 
--- Shorter: 22 against 32 is a 31% reduction, and that IS what hexbits unlock.
-theorem hexbits_are_shorter_than_hex :
-  hexbitChars < hexChars ∧ hexChars - hexbitChars = 10 ∧ hexbitChars * 100 / hexChars = 68 := by decide
+-- Characters needed for a 128-bit address at b bits per character: the ceiling of 128 / b.
+def charsFor (b : Nat) : Nat := (128 + b - 1) / b
+
+-- Shorter: the width is the ceiling of 128 bits over the symbol, and multiplying back covers the 128 bits
+-- with less than one symbol to spare, at every symbol width from one to eight bits. 32 and 22 are the
+-- instances at four and six bits — derived, not typed — and 22 against 32 is what hexbits unlock.
+theorem the_width_is_the_ceiling_of_128_bits_over_the_symbol :
+  (List.range' 1 8).all (fun b => charsFor b * b ≥ 128 && (charsFor b - 1) * b < 128) ∧
+  charsFor 4 = hexChars ∧ charsFor 6 = hexbitChars ∧
+  hexbitChars < hexChars ∧ hexbitChars * 100 / hexChars = 68 := by decide
 
 -- And slower: the same encodings cost 30 ms against 16, so the density is bought with time, not given.
-theorem hexbits_are_slower_than_hex :
+-- The ratio is a floor division in tenths, and it multiplies back to the timing within one step — at every
+-- divisor and dividend checked, of which the two medians are one instance.
+theorem hexbits_are_slower_and_the_ratio_multiplies_back :
+  (List.range' 1 20).all (fun b => (List.range 400).all (fun a => (a / b) * b ≤ a && a < (a / b + 1) * b)) ∧
   hexbitMs > hexMs ∧ hexbitMs * 10 / hexMs = 18 := by decide
 
 -- A theorem named `an_encoding_changes_width_not_the_count_of_operations` stood here and is DELETED. It

package/src/proof/trial-all.json

@@ -15286,5 +15286,119 @@
     "verdict": "UNVERIFIED",
     "ground": "no candidate in the current space — nothing to recompute",
     "receipt": "35d5dc48-cbc0-8b91-aaaf-2976834a5f5f"
+  },
+  {
+    "key": "lean_energy_any_yield_below_its_cost_reads_under_the_whole",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "64823215-1e97-88ef-ab5f-46f0ed44534a"
+  },
+  {
+    "key": "lean_energy_the_cost_per_litre_multiplies_back_to_the_cost",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "2fafc1e2-f58f-8431-8e73-cfaa3c48dc21"
+  },
+  {
+    "key": "lean_energy_the_mass_balance_is_the_atom_balance",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "2854e1d5-ab5d-8f6f-aae3-a6d17a1f5202"
+  },
+  {
+    "key": "lean_energy_the_atom_table_decides_the_balance",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "98e0c98d-7b0c-8a11-a21f-84b31b36f426"
+  },
+  {
+    "key": "lean_energy_a_part_and_its_rest_read_back_the_whole",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "d4addfa7-6e96-8896-8574-0608cec8caf0"
+  },
+  {
+    "key": "lean_energy_splitting_then_burning_is_the_identity_at_the_ideal",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "f354845f-b6af-8133-a8b0-ac3c1c3c6c18"
+  },
+  {
+    "key": "lean_energy_the_gas_volume_reads_back_its_moles",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "464b601e-4839-8b4d-bdad-e1f82ff6be74"
+  },
+  {
+    "key": "lean_energy_two_parts_in_three_is_two_thirds_at_every_scale",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "6913b23d-5d6d-832c-9992-426fc4755697"
+  },
+  {
+    "key": "lean_energy_the_energy_per_litre_multiplies_back_to_the_energy",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "6ca259eb-a048-889f-953f-ffb3af4e191d"
+  },
+  {
+    "key": "lean_energy_compression_scales_the_energy_per_litre_linearly",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "62f26437-7387-84fc-bed6-8afc5ccf0921"
+  },
+  {
+    "key": "lean_energy_a_ratio_and_its_reciprocal_multiply_back_to_the_whole",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "07ef3913-ea46-810b-85b9-be9b21a8f476"
+  },
+  {
+    "key": "lean_energy_the_loss_and_the_yield_read_back_the_input",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "945f6f02-5f28-8c32-a3a8-226b5a6e37e4"
+  },
+  {
+    "key": "lean_energy_the_residue_ratio_is_the_same_at_every_volume",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "b0b19d5b-1924-8383-b871-740fdb759594"
+  },
+  {
+    "key": "lean_light_the_si_fixes_seven_distinct_nonzero_constants",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "b8191727-00d7-8658-a6ea-e9b71aed9e9d"
+  },
+  {
+    "key": "lean_reach_the_successor_leaves_every_domain_and_the_predecessor_returns",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "e11c16ca-5d37-8dc4-9af3-7a3488c33cd8"
+  },
+  {
+    "key": "lean_speed_the_measured_ratio_exceeds_the_counted_gap",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "f8640798-50bd-8c98-b980-085593d93807"
+  },
+  {
+    "key": "lean_speed_the_verify_in_nanoseconds_reads_back_its_microseconds",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "e8a082ef-9515-8029-bfae-0a73deba82b4"
+  },
+  {
+    "key": "lean_speed_the_width_is_the_ceiling_of_128_bits_over_the_symbol",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "5811891a-d052-8382-8f7c-9a3d6def88cc"
+  },
+  {
+    "key": "lean_speed_hexbits_are_slower_and_the_ratio_multiplies_back",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "91a92ea5-bedd-8b9a-80b7-29130fbe5a93"
   }
 ]