Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Local layout maps wX,wY,wS,wTw_X,w_Y,w_S,w_TwX​,wY​,wS​,wT​ send their domains below NLNLNL

Proved
IntMul.Kappa.R8.Bit.Oppbank.net0O2_layout_wires_lt_NL

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

bitnbeoko2formalokintmulkappalocslotsr8

The four densified local-wire layout maps send their intended domains into the local address space [0,NL)[0,NL)[0,NL).

With the R8 opp-bank constants v=1771v=1771v=1771, NR=27794NR=27794NR=27794, h=23h=23h=23, wEnt=3542w_{\mathrm{Ent}}=3542wEnt​=3542, wAuxEnd=31336w_{\mathrm{AuxEnd}}=31336wAuxEnd​=31336, and NL=31359NL=31359NL=31359,

t<v  ⟹  wX(t)<NL,T<v  ⟹  wY(T)<NL,q<NR  ⟹  wS(q)<NL,c<h  ⟹  wT(c)<NL.\begin{aligned} t < v &\implies w_X(t) < NL,\\ T < v &\implies w_Y(T) < NL,\\ q < NR &\implies w_S(q) < NL,\\ c < h &\implies w_T(c) < NL. \end{aligned}t<vT<vq<NRc<h​⟹wX​(t)<NL,⟹wY​(T)<NL,⟹wS​(q)<NL,⟹wT​(c)<NL.​

These maps are the layout identities wX(t)=tw_X(t)=twX​(t)=t, wY(T)=v+Tw_Y(T)=v+TwY​(T)=v+T, wS(q)=wEnt+qw_S(q)=w_{\mathrm{Ent}}+qwS​(q)=wEnt​+q, and wT(c)=wAuxEnd+cw_T(c)=w_{\mathrm{AuxEnd}}+cwT​(c)=wAuxEnd​+c. They are the arithmetic ingredients that turn LocSlots index certificates into the W1FW_{1F}W1F​ wire bound ℓ<NL\ell<NLℓ<NL.

Formalization Note. Constants and maps are those of Def_IntMul_Kappa_R8_Data_BitOppbankWireLayout. The four conjuncts correspond to the local lemmas wX_lt_NL, wY_lt_NL, wS_lt_NL, and wT_lt_NL.

Preamble
import Definitions.Def_IntMul_Kappa_R8_Data_BitOppbankWireLayout
import Mathlib
set_option autoImplicit false
set_option relaxedAutoImplicit false
Formal statement
namespace IntMul.Kappa.R8.Bit.Oppbank
theorem net0O2_layout_wires_lt_NL :
    (∀ t : ℕ, t < v → wX t < NL) ∧
    (∀ T : ℕ, T < v → wY T < NL) ∧
    (∀ q : ℕ, q < NR → wS q < NL) ∧
    (∀ c : ℕ, c < h → wT c < NL) := by sorry
end IntMul.Kappa.R8.Bit.Oppbank
Source
IntMul Kappa R8 Bit Oppbank FormalOK densify: wire layout maps wX/wY/wS/wT (Def_IntMul_Kappa_R8_Data_BitOppbankWireLayout, NL=31359)

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