Round-eight bit network dominates Jain.bitR8 moments
OpenIntMul.Kappa.R8.bitNetR8_momcomplexity-theoryinteger-multiplicationround-eightturing-machines
Round-eight bit network, moment-dominance form.
There exists a QH-network over with roles and width , together with a prime cutoff , such that:
- runs correctly (
RunsOK); - for every prime and every exponent , the edge and formal checks hold at the prime power ;
- for every exponent , the child-width moment of is at most that of Jain's round-eight bit histogram:
where is the opposite-bank-order bit interchange of round eight (width classes up to , a -class, and the – tail).
In the platform vocabulary this is exactly
At the round-six constants the same predicate is Bit.BitNetR6MomStmt, already proved as IntMul.Kappa.R6.Bit.NB.bitNetR6_mom_exp.
This is the bit-network machine interface needed to feed Jain's round-eight histogram into the parametric assembly IntMul.Kappa.R6.kappa_finalG_at, and thence into IntMul.Kappa.jain_round8_framework.
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-eight bit interchange (opposite bank orders on the round-seven witness 2): a QH-network over `ZMod 2` with $W = 104719230$ roles and width $m = 529$ whose child-width moments are dominated by `Jain.bitR8`. -/ theorem bitNetR8_mom : BitNetMomStmtG 104719230 529 Jain.bitR8 := by sorry end IntMul.Kappa.R8
Source
S. Jain, integer-mult-kappa, https://github.com/Swapnil-jain/integer-mult-kappa/tree/5868dc701a9bec375c9dc5391d992ab3b8c35f3f — README 'Round eight' (bit side: opposite bank orders on round-seven witness 2; W=104719230, m=529), lean/Round8.lean (bitHist), independent/round8-oppbank/; machine interface shape from Prove2me IntMul.Kappa.R6.Bit.BitNetMomStmtG (Def_IntMul_Kappa_RG_Defs) and the proved round-six instance 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