Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Opposite-bank QH-network with exact bitR8 child-width moments

Open
IntMul.Kappa.R8.Bit.oppbank_net

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

complexity-theoryinteger-multiplicationround-eightturing-machines

Jain's round-eight bit witness recompiles the deferred round-seven witness 2 in opposite bank orders: each residual of rank rrr becomes one contiguous reversed child of width rrr, producing histogram bitR8 while keeping W=104719230W=104719230W=104719230 and the same rank sum as bitR7plain.

This problem asks for the corresponding QH-network on Prove2me: numbers T,q0T,q_0T,q0​ and a network

C:QHNet(Z/2Z, 104719230, T, 529)C:\mathrm{QHNet}(\mathbb{Z}/2\mathbb{Z},\,104719230,\,T,\,529)C:QHNet(Z/2Z,104719230,T,529)

such that CCC runs correctly, the edge and formal checks hold at every large prime power qfq^fqf, and for all τ∈(0,1]\tau\in(0,1]τ∈(0,1],

histMoment(C.hist,529,τ)=histMoment(bitR8,529,τ).\mathrm{histMoment}(C.\mathrm{hist},529,\tau)=\mathrm{histMoment}(\texttt{bitR8},529,\tau).histMoment(C.hist,529,τ)=histMoment(bitR8,529,τ).

Packaging with the proved lemma BitNetMomStmtG_of_eq yields BitNetMomStmtG at bitR8, which is the consequent of oppbank_mom_of_plain.

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.Bit

open IntMul.Kappa IntMul.Kappa.R6.Bit

/-- Geometric content of Jain's opposite-bank recompile on round-seven witness 2:
there exists a QH-network over `ZMod 2` with $W = 104719230$ roles and width $m = 529$
that runs correctly, passes edge/formal checks at large prime powers, and whose
child-width moments agree exactly with `Jain.bitR8` on $(0,1]$.

(The schedule/frames/payload of the plain witness are unchanged; only address geometry
is recompiled. Formalising that transform on an arbitrary `BitNetMomStmtG` witness is
not required here — this leaf is the constructed network.) -/
theorem oppbank_net :
    ∃ (T : ℕ) (C : QHNet (ZMod 2) 104719230 T 529) (q₀ : ℕ),
      C.RunsOK ∧
        (∀ q, q.Prime → q₀ < q → ∀ f, C.EdgesOK (q ^ f) ∧ C.FormalOK (q ^ f)) ∧
          ∀ τ : ℝ, 0 < τ → τ ≤ 1 →
            histMoment C.hist 529 τ = histMoment Jain.bitR8 529 τ := by
  sorry

end IntMul.Kappa.R8.Bit
Source
S. Jain integer-mult-kappa README Round eight bit side; independent/round8-oppbank/; lean/Round8.lean bitHist; Prove2me BitNetMomStmtG_of_eq; parent IntMul.Kappa.R8.Bit.oppbank_mom_of_plain

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