Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Round-seven plain bit network dominates Jain.bitR7plain moments

Open
IntMul.Kappa.R8.bitNetR7plain_mom

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

complexity-theoryinteger-multiplicationround-eightround-seventuring-machines

Round-seven plain bit network (witness 2), moment-dominance form.

There exists a QH-network CCC over Z/2Z\mathbb{Z}/2\mathbb{Z}Z/2Z with Wb=104 719 230W_b = 104\,719\,230Wb​=104719230 roles and width mb=529m_b = 529mb​=529, together with a prime cutoff q0q_0q0​, such that:

  1. CCC runs correctly (RunsOK);
  2. for every prime q>q0q > q_0q>q0​ and every exponent fff, the edge and formal checks hold at the prime power qfq^fqf;
  3. for every exponent τ∈(0,1]\tau \in (0,1]τ∈(0,1], the child-width moment of CCC is at most that of Jain's round-seven plain bit histogram (witness 2 with the round-six entrance corner):
histMoment(C.hist, 529, τ)≤histMoment(hold, 529, τ),\mathrm{histMoment}(C.\mathrm{hist},\,529,\,\tau)\le \mathrm{histMoment}(h^{\mathrm{old}},\,529,\,\tau),histMoment(C.hist,529,τ)≤histMoment(hold,529,τ),

where hold=Jain.bitR7plainh^{\mathrm{old}}=\mathrm{Jain.bitR7plain}hold=Jain.bitR7plain is the histogram whose certified saving is the aolda_{\mathrm{old}}aold​ of round eight's stopped bit interchange.

In the platform vocabulary this is exactly

Bit.BitNetMomStmtG 104719230 529 Jain.bitR7plain.\mathrm{Bit.BitNetMomStmtG}\,104719230\,529\,\mathrm{Jain.bitR7plain}.Bit.BitNetMomStmtG104719230529Jain.bitR7plain.

Relation to neighbouring nodes. The sister statement IntMul.Kappa.R6.Bit.bitNetR7_mom asserts the same interface for the other round-seven witness (Jain.bitR7, W=108 516 254W=108\,516\,254W=108516254). The round-eight opposite-bank network is IntMul.Kappa.R8.bitNetR8_mom (same W=104 719 230W=104\,719\,230W=104719230, histogram Jain.bitR8). The proved round-six instance is IntMul.Kappa.R6.Bit.NB.bitNetR6_mom_exp.

Role in round eight. Together with moment monotonicity in the exponent, this leaf discharges the stopped-mix branch ab≤aolda_b\le a_{\mathrm{old}}ab​≤aold​ of jain_round8_framework, feeding kappa_finalG_at when the convex combination sits on the plain side.

Formalization Note. BitNetMomStmtG is from IntMul_Kappa_RG_Defs; the histogram is from IntMul_KappaJainData (lean/Round7.lean, bitplainHist).

Preamble
import Definitions.Def_IntMul_Kappa_RG_Defs
import Definitions.Def_IntMul_KappaJainData

set_option autoImplicit false
set_option relaxedAutoImplicit false
Formal statement
namespace IntMul.Kappa.R8

open IntMul.Kappa IntMul.Kappa.R6.Bit

/-- Round-seven bit network, witness 2 with the round-six entrance corner (`bitplainHist`):
a QH-network over `ZMod 2` with $W = 104719230$ roles and width $m = 529$ whose
child-width moments are dominated by `Jain.bitR7plain`. This is the `a_old` network
of round eight's stopped bit interchange. -/
theorem bitNetR7plain_mom : BitNetMomStmtG 104719230 529 Jain.bitR7plain := by
  sorry

end IntMul.Kappa.R8
Source
S. Jain, integer-mult-kappa, https://github.com/Swapnil-jain/integer-mult-kappa/tree/5868dc701a9bec375c9dc5391d992ab3b8c35f3f — README 'Round seven' / 'Round eight' (a_old = round-seven saving of witness 2 with round-six entrance corner; W=104719230, m=529), lean/Round7.lean (bitplainHist), certificates/round7/, independent/deferred-readout/; machine interface shape from Prove2me IntMul.Kappa.R6.Bit.BitNetMomStmtG (Def_IntMul_Kappa_RG_Defs); sister Open node IntMul.Kappa.R6.Bit.bitNetR7_mom (Jain.bitR7, W=108516254); proved template IntMul.Kappa.R6.Bit.NB.bitNetR6_mom_exp; conditional on OpenAI Integer multiplication below n log n (23 Sep 2026) and Colkitt integer-mult-bounds

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me