Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

genF chunk locals come from the input word wires

Proved
IntMul.Kappa.R8.Bit.Oppbank.net0O2_genF_locals_of_W

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

bitnbeoko2formalokintmulkappar8

Every local endpoint stored in a chunk of genF(f,W)\mathrm{genF}(f,W)genF(f,W) already appears among the wires of some instruction of WWW.

Writing L=genF(f,W).2L=\mathrm{genF}(f,W).2L=genF(f,W).2 for the produced chunk list, if ℓ\ellℓ is a move first-component or an XOR endpoint inside some ch∈L\mathrm{ch}\in Lch∈L, then

∃ i∈W,ℓ∈i.touch or ℓ is an XOR endpoint of i.\exists\, i\in W,\qquad \ell\in i.\mathsf{touch}\ \text{or}\ \ell\ \text{is an XOR endpoint of}\ i.∃i∈W,ℓ∈i.touch or ℓ is an XOR endpoint of i.

This is the structural half of the cs1\mathrm{cs1}cs1 local-bound densify (independent of LocSlots numerals).

Formalization Note. Follows by induction on foldl genStepF\mathrm{foldl\ genStepF}foldl genStepF: each fresh chunk's moves are produced by foldl mvF\mathrm{foldl\ mvF}foldl mvF on that instruction's touch list, and its XOR list is copied verbatim.

Preamble
import Definitions.Def_IntMul_Kappa_R6_Defs4
import Definitions.Def_IntMul_Kappa_R8_Data_BitOppbankQHNet
import Mathlib
set_option autoImplicit false
set_option relaxedAutoImplicit false
set_option maxRecDepth 100000
Formal statement
namespace IntMul.Kappa.R8.Bit.Oppbank
open IntMul.Kappa.R8.Bit.Oppbank.NB
theorem net0O2_genF_locals_of_W (f : ℕ → ℕ) (W : List LInstr) (ℓ : ℕ)
    (hℓ : ∃ ch ∈ (genF f W).2,
      (∃ mv ∈ ch.2.1, mv.1 = ℓ) ∨ (∃ p ∈ ch.2.2, p.1 = ℓ ∨ p.2 = ℓ)) :
    ∃ i ∈ W, ℓ ∈ i.2.1 ∨ ∃ p ∈ i.2.2, p.1 = ℓ ∨ p.2 = ℓ := by sorry
end IntMul.Kappa.R8.Bit.Oppbank
Source
IntMul Kappa R8 Bit Oppbank FormalOK densify: genF local-preservation

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