Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

PR #6453: the strictification data and the compiler grid

Definition
Pr6453_Strictification

by gustasmickus · Nov 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

complexity-theoryinteger-multiplication

The data of the strictification and of the compiler grid of the PR #6453 certificate.

The tail of the recursion is charged in blocks: power = 1920 recursive levels, split at cutoff = 12 and rounded by floor = 13, each block decaying by decay = 31/32, against an absorbed reserve reserve = 10⁻²⁹. The complementary capacity is theta = 63/64, raised to logarithm_power = 2100 and compensated by the factor η, whose certified lower end is 22804016729341566/10³⁰. The compiler is run on a grid of size H = 138 100 200 000 000 with integer test exponent 98 643, and the tested saving is 3287019/10⁹.

The three tail ratios are also defined here: α is the ratio of the two rank moments at the tested saving, γ is the paid moment one step 1/7 further out against the split, and δ is the rounding charged against the split.

Definition code
/-
PR #6453: the strictification and compiler data.
-/
import Definitions.Def_Pr6453_RankMoments

set_option autoImplicit false

namespace Pr6453

noncomputable section

/-! ## The strictification data -/

/-- The tested saving `3287019/10⁹`, `complete_cost.tested`. -/
def tested : ℚ := 3287019 / 1000000000

/-- The block length `1920`, `strictification.power`. -/
def power : ℕ := 1920

/-- The split `12`, `strictification.cutoff`. -/
def cutoff : ℕ := 12

/-- The rounding `13`, `strictification.floor`. -/
def floor' : ℕ := 13

/-- The absorbed reserve `10⁻²⁹`, `strictification.reserve`. -/
def reserve : ℚ := 1 / 10 ^ 29

/-- The per-block decay `31/32`, `strictification.tail_decay`. -/
def decay : ℚ := 31 / 32

/-- The complementary capacity `63/64`, `compiler.theta`. -/
def theta : ℚ := 63 / 64

/-- The logarithmic power `2100`, `compiler.logarithm_power`. -/
def logarithmPower : ℕ := 2100

/-- The compiler grid size `138 100 200 000 000`, `compiler.H`. -/
def H : ℕ := 138100200000000

/-- The integer test exponent `98 643`, `compiler.integer_test_exponent`. -/
def integerTestExponent : ℕ := 98643

/-- The lower end of the certified `η`, `compiler.eta.lower`. -/
def etaLower : ℚ := 22804016729341566 / 10 ^ 30

end
end Pr6453
Source
CrocSwap/integer-mult-bounds, PR #6453, head b1a3e525793eca35c56324aa7ffd0b714cf606d4, RESULT.json fields complete_cost.strictification and complete_cost.compiler.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me