Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

MovesV/ValidOn for preF ++ copyoND ++ leafMix ++ gateMix from initR (QHNetRecR block-0 prefix)

Proved
IntMul.Kappa.R8.Bit.Oppbank.MovesV_preF_copyoND_block0

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

bitnbblock0complexity-theorygatemixinteger-multiplicationmovesvoppbankprefixqhnetrecrr8round-eight

Block-0 prefix of the variant-R word is a valid nested move

On the published variant-R carrier, let initR\mathrm{initR}initR be the stage-one initial labelling, and let gateMix\mathrm{gateMix}gateMix be the list of 130113011301 block-0 gate mix-forward records (the first block of the mix-forward schedule, mixFB(0,12)\mathrm{mixFB}(0,12)mixFB(0,12)). Extending the already-established prefix preF+ ⁣+copyoND+ ⁣+leafMix\mathrm{preF}{+}\!{+}\mathrm{copyoND}{+}\!{+}\mathrm{leafMix}preF++copyoND++leafMix by gateMix\mathrm{gateMix}gateMix and running the generator from initR\mathrm{initR}initR yields a valid labelling whose recorded moves are nested at bound 642516425164251:

ValidOn(initR) ∧ MovesV(genF(initR,preF+ ⁣+copyoND+ ⁣+leafMix+ ⁣+gateMix)) ∧ ValidOn(genF(initR,preF+ ⁣+copyoND+ ⁣+leafMix+ ⁣+gateMix)1).\mathrm{ValidOn}(\mathrm{initR})\ \wedge\ \mathrm{MovesV}\bigl(\mathrm{genF}(\mathrm{initR},\mathrm{preF}{+}\!{+}\mathrm{copyoND}{+}\!{+}\mathrm{leafMix}{+}\!{+}\mathrm{gateMix})\bigr)\ \wedge\ \mathrm{ValidOn}\bigl(\mathrm{genF}(\mathrm{initR},\mathrm{preF}{+}\!{+}\mathrm{copyoND}{+}\!{+}\mathrm{leafMix}{+}\!{+}\mathrm{gateMix})_{1}\bigr).ValidOn(initR) ∧ MovesV(genF(initR,preF++copyoND++leafMix++gateMix)) ∧ ValidOn(genF(initR,preF++copyoND++leafMix++gateMix)1​).

After the leaf-mix stage, each gate pivot and base slot already carries the corresponding source code, and high slots remain zero, so every recorded block-0 gate move is a well-nested write.

Formalization Note

The statement is Lab.ValidOn / Lab.MovesV for Gen.genF initR (QHNetRecR.preF ++ QHNetRecR.copyoND ++ leafMix ++ gateMix) at codeBound = 64251. It does not unfold segsR or W1F, and it is not a full-word MovesV certificate.

Preamble
import Definitions.Def_IntMul_Kappa_R8_Data_BitOppbankGenF
import Definitions.Def_IntMul_Kappa_R8_Data_BitOppbankLab1
import Definitions.Def_IntMul_Kappa_R8_Data_BitOppbankQHNetRecR
import Definitions.Def_IntMul_Kappa_R8_Data_BitOppbankBlock0CoreAData
import Definitions.Def_IntMul_Kappa_R8_Data_BitOppbankBlock0CoreABits
import Definitions.Def_IntMul_Kappa_R8_Data_BitOppbankBlock0CoreACopy
import Definitions.Def_IntMul_Kappa_R8_Data_BitOppbankBlock0CoreALeaf
import Definitions.Def_IntMul_Kappa_R8_Data_BitOppbankBlock0CoreAState1
import Definitions.Def_IntMul_Kappa_R8_Data_BitOppbankBlock0CoreAState2
import Definitions.Def_IntMul_Kappa_R8_Data_BitOppbankBlock0CoreAState3a
import Definitions.Def_IntMul_Kappa_R8_Data_BitOppbankBlock0CoreBData1
import Mathlib

set_option autoImplicit false
set_option relaxedAutoImplicit false
set_option maxHeartbeats 8000000
set_option maxRecDepth 1000000
Formal statement
namespace IntMul.Kappa.R8.Bit.Oppbank

/-- Prefix-only `MovesV` / `ValidOn` certificate for
`preF ++ copyoND ++ leafMix ++ gateMix` from `initR` on the published
variant-R carrier. This does not unfold `segsR` or `W1F`, does not cover
later mix-forward gates or preloads, and is not a full-word `MovesV`
certificate. -/
theorem MovesV_preF_copyoND_block0 :
    Lab.ValidOn initR ∧
      Lab.MovesV (Gen.genF initR (QHNetRecR.preF ++ QHNetRecR.copyoND ++ leafMix ++ gateMix)).2 ∧
        Lab.ValidOn (Gen.genF initR (QHNetRecR.preF ++ QHNetRecR.copyoND ++ leafMix ++ gateMix)).1 := by
  sorry

end IntMul.Kappa.R8.Bit.Oppbank
Source
IntMul Kappa R8 Bit Oppbank FormalOK: prefix MovesV/ValidOn for QHNetRecR.preF ++ QHNetRecR.copyoND ++ leafMix ++ gateMix from initR at Lab.codeBound 64251. gateMix is the 1301 block-0 mix-forward records (mixFB 0 12). Prefix / block-0 pack only; not a full-word W1F certificate.

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