Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

SegsR midA pack simple bounds decide

Definition
IntMul_Kappa_R8_Data_BitOppbankSegsRMidADecPackBounds

by Ethan Cheung Wang · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

bitnbcomplexity-theoryinteger-multiplicationmidaoppbankqhnetrecrr8round-eightsegsr

SegsR midA pack simple bounds decide

Decide-certified simple bounds on densified midAPack: piv and bp-1 < 11099, 1 ≤ bp, nf ≤ 5, tp/tb < 1771, n ≤ 61313. Later-segs midA helper only; not a full-word W1F certificate.

Formalization Note

Lean definition name: IntMul_Kappa_R8_Data_BitOppbankSegsRMidADecPackBounds.

Definition code
-- Later-segs midA helper only; not a full-word W1F / segsR / preloadHits certificate.
-- Imports densified MidADataD (not raw-n MidAData).
import Definitions.Def_IntMul_Kappa_R8_Data_BitOppbankSegsRMidADataD

set_option autoImplicit false
set_option relaxedAutoImplicit false
set_option maxHeartbeats 8000000
set_option maxRecDepth 1000000

open IntMul.Kappa.R8.Bit.Oppbank
open IntMul.Kappa.R8.Bit.Oppbank.Gen (genF genStepF mvF)
open IntMul.Kappa.R8.Bit.Oppbank.Lab (ValidOn MovesV)
open IntMul.Kappa.R8.Bit.Oppbank.Pnd (nestOK argRel isND)
open IntMul.Kappa.R8.Bit.Oppbank.QHNetRecR

theorem midAPack_simple_bounds :
    ∀ g ∈ midAPack,
      gatePiv g < 11099 ∧
      1 ≤ gateBp g ∧ gateBp g - 1 < 11099 ∧
      gateNf g ≤ 5 ∧
      gateTp g < 1771 ∧ gateTb g < 1771 ∧
      gateN g ≤ 61313 := by
  decide
Source
IntMul Kappa R8 Bit Oppbank FormalOK: IntMul_Kappa_R8_Data_BitOppbankSegsRMidADecPackBounds. Later-segs midA helper only; not a full-word W1F certificate. Uses densified MidADataD.

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