Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Round-eight certificates of the integer-multiplication κ-record (κ = 12612978530233/10¹⁷)

Proved
IntMul.Kappa.round8_certificates

by chstdu · Oct 10, 2026 · Mathlib 0df444a (Lean v4.33.1)

certificatecomplexityinteger-multiplication

The six computational certificates of round eight of the integer-multiplication κ-record (Jain, repository integer-mult-kappa, file lean/Round8.lean), checked exactly as published:

  1. Bit-phase rank sum. For the bit-interchange histogram (one-run histogram, width classes up to 222222 plus a 484484484-class and a 506506506–528528528 tail range), the weighted rank sum ∑w n\sum w\,n∑wn equals 55 395 128 48155\,395\,128\,48155395128481.

  2. Bit-phase moment bound. With savings a=25 367/2⋅108a = 25\,367/2\cdot 10^8a=25367/2⋅108, base width m=529m = 529m=529 and work budget W=104 719 230W = 104\,719\,230W=104719230: every width w<mw < mw<m and aLw<1a L_w < 1aLw​<1 with Lw=lnUp⁡(m/w)L_w = \operatorname{lnUp}(m/w)Lw​=lnUp(m/w), and ∑nw/(m(1−aLw))<W\sum n w/(m(1-a L_w)) < W∑nw/(m(1−aLw​))<W.

  3. Stopped saving. With aold=12 899/2⋅108a_{\text{old}} = 12\,899/2\cdot 10^8aold​=12899/2⋅108 and θ=1/1000\theta = 1/1000θ=1/1000: ab=(1−θ)a+θaold=6 338 633/5⋅1010a_b = (1-\theta)a + \theta a_{\text{old}} = 6\,338\,633/5\cdot 10^{10}ab​=(1−θ)a+θaold​=6338633/5⋅1010 exactly, and ab<θa_b < \thetaab​<θ.

  4. Complex-phase rank sum. For the complex-interchange histogram (completed-core sharing), ∑w n=7 410 813 248\sum w\,n = 7\,410\,813\,248∑wn=7410813248.

  5. Complex-phase exp-moment bound. With a=3 945 999/31 250 000 000a = 3\,945\,999/31\,250\,000\,000a=3945999/31250000000, m=576m = 576m=576, W=12 869 228W = 12\,869\,228W=12869228: every w<mw < mw<m, aLw<4a L_w < 4aLw​<4, and ∑nweaLw/m<W\sum n w e^{a L_w}/m < W∑nweaLw​/m<W.

  6. Parameter assembly. With the two savings above, β=1/1000\beta = 1/1000β=1/1000, ε=399 949 548 085 879/4⋅1014\varepsilon = 399\,949\,548\,085\,879/4\cdot 10^{14}ε=399949548085879/4⋅1014, x=c1=13 093x = c_1 = 13\,093x=c1​=13093, mc=576m_c = 576mc​=576, sc=7 410 813 248s_c = 7\,410\,813\,248sc​=7410813248: the guard kappaOK holds and every cost margin exceeds κ=12 612 978 530 233/1017≈1.26⋅10−4\kappa = 12\,612\,978\,530\,233/10^{17} \approx 1.26\cdot 10^{-4}κ=12612978530233/1017≈1.26⋅10−4.

Round eight is the strongest published κ-record for integer multiplication; the κ-value here is the one targeted by IntMul.Kappa.jain_round8. Every claim is a finite computation over explicit rational data, discharged by decide in the Lean kernel.

Preamble
import Definitions.Def_intmul_certs_arith
import Definitions.Def_intmul_round8_certs_extra
Formal statement
namespace IntMul.Kappa

open IntMul.Certs

-- The six round-eight certificates of Jain's integer-mult-kappa record, exactly as published
-- in lean/Round8.lean: bit-phase rank sum, moment condition and stopped-saving check, the
-- complex-phase rank sum and exp-form moment condition (completed-core sharing), and the
-- final parameter assembly with savings a_b = 6338633/5·10^10, a_c = 3945999/3.125·10^10,
-- beta = 1/1000, eps = 399949548085879/4·10^14, x = 13093, c_1 = 13093,
-- kappa = 12612978530233/10^17, m_c = 576, s_c = 7410813248.

theorem round8_certificates :
    rankSum [(1, 221936407), (2, 259926128), (3, 38728228), (4, 49343602), (5, 24609816), (6, 8068676), (7, 3818276), (8, 4785242), (9, 2992990), (10, 1211364), (11, 1445136), (12, 1331792), (13, 1080310), (14, 669438), (15, 2755676), (16, 3860780), (17, 1933932), (18, 364826), (19, 13388760), (20, 587972), (21, 1771000), (22, 116886), (484, 6272882), (506, 59760624), (507, 453376), (508, 173558), (509, 421498), (510, 233772), (511, 205436), (512, 226688), (513, 340032), (514, 602140), (515, 173558), (516, 357742), (517, 283360), (518, 690690), (519, 389620), (520, 102718), (521, 184184), (522, 584430), (523, 350658), (524, 3021326), (525, 13448974), (526, 4558554), (527, 5649490), (528, 6233920)] = 55395128481 ∧
    momentOK [(1, 221936407), (2, 259926128), (3, 38728228), (4, 49343602), (5, 24609816), (6, 8068676), (7, 3818276), (8, 4785242), (9, 2992990), (10, 1211364), (11, 1445136), (12, 1331792), (13, 1080310), (14, 669438), (15, 2755676), (16, 3860780), (17, 1933932), (18, 364826), (19, 13388760), (20, 587972), (21, 1771000), (22, 116886), (484, 6272882), (506, 59760624), (507, 453376), (508, 173558), (509, 421498), (510, 233772), (511, 205436), (512, 226688), (513, 340032), (514, 602140), (515, 173558), (516, 357742), (517, 283360), (518, 690690), (519, 389620), (520, 102718), (521, 184184), (522, 584430), (523, 350658), (524, 3021326), (525, 13448974), (526, 4558554), (527, 5649490), (528, 6233920)] (25367, 200000000) 529 104719230 = true ∧
    stopOK (25367, 200000000) (12899, 200000000) (1, 1000) (6338633, 50000000000) = true ∧
    rankSum [(1, 416381328), (2, 279401056), (3, 72936864), (4, 52437792), (5, 23753664), (6, 11617760), (7, 12322112), (8, 28433152), (9, 4938560), (10, 46070288), (11, 9840688), (12, 3206016), (13, 728640), (14, 910800), (15, 1692064), (16, 615296), (17, 1740640), (18, 2574528), (19, 3971088), (20, 1805408), (23, 8318640), (384, 214992), (529, 8193152)] = 7410813248 ∧
    momentExpOK [(1, 416381328), (2, 279401056), (3, 72936864), (4, 52437792), (5, 23753664), (6, 11617760), (7, 12322112), (8, 28433152), (9, 4938560), (10, 46070288), (11, 9840688), (12, 3206016), (13, 728640), (14, 910800), (15, 1692064), (16, 615296), (17, 1740640), (18, 2574528), (19, 3971088), (20, 1805408), (23, 8318640), (384, 214992), (529, 8193152)] (3945999, 31250000000) 576 12869228 = true ∧
    kappaOK (6338633, 50000000000) (3945999, 31250000000) (1, 1000)
      (399949548085879, 400000000000000) (13093, 1) (13093, 1)
      (12612978530233, 100000000000000000) 576 7410813248 = true := by sorry

end IntMul.Kappa
Source
Swapnil Jain, integer-mult-kappa, https://github.com/Swapnil-jain/integer-mult-kappa, file lean/Round8.lean — the six round-eight certificates (generated by lean/gen.py from round8-histograms.json).

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