Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

PR #6453: the root's address data

Proved
Pr6453Root.address_data

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

algebracomplexity-theoryinteger-multiplication

The root's address structure: the coefficient address is (sign, mask, field) with two signs, sixteen masks over four full stages and six fields; the masks are read from the mask table; two signs times sixteen masks times thirty-six field entries is the certificate's 1152.

Preamble
import Definitions.Def_Pr6453RootAddress

set_option autoImplicit false
Formal statement
namespace Pr6453Root

theorem address_data :
    Fintype.card Mask = 16 ∧ Fintype.card Address = 192 ∧ 2 * Fintype.card Mask * 36 = 1152 := by
  sorry

end Pr6453Root
Source
CrocSwap/integer-mult-bounds, PR #6453, head b1a3e525793eca35c56324aa7ffd0b714cf606d4, ROOT.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