Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

The program on the stream table (round six, `netH_runs`)

Proved
IntMul.Kappa.R6.IL.netH_runs

by xuanji · Oct 20, 2026 · Mathlib 0df444a (Lean v4.33.1)

complexity-theoryinteger-multiplicationkappa-improvement

The program on the stream table.

The following holds (Lean statement, in the scope of module Solutions.R6ILNet):

theorem IntMul.Kappa.R6.IL.netH_runs {G0 : Fin HS → List Item} {v : ℕ} (E : Bit.Edge m → IStmt HS Pp)
    (impl : Bit.Edge m → List (ZMod 2) → List (ZMod 2)) (cE : Bit.Edge m → ℕ)
    (s : IState HS) (hs : Inv G0 s) (rest : List ℤ) {Bb : ℕ} (hB : TabB (T + W) v Bb)
    (hv1 : 1 ≤ v) :
    ∀ (prog : List (Bit.Instr (Fin W ⊕ Fin T) (ZMod 2) m)),
      (∀ e ∈ Bit.progEdges prog, ∀ ys : List (ZMod 2), ys.length = v → (impl e ys).length = v) →
      (∀ e ∈ Bit.progEdges prog, ∀ ys : List (ZMod 2), ys.length = v →
        ∀ (t : IState HS) (R : List Item), Inv G0 t →
        IRuns I iprog (E e) (t.upd 0 (ints (enc2 ys) ++ R)) (t.upd 0 (ints (enc2 (impl e ys)) ++ R))
          (cE e)) →
      ∀ (st : Fin W ⊕ Fin T → List (ZMod 2)) (f : Fin HS → List ℤ), (∀ x, (st x).length = v) →
      (∀ r, Prot r → f r = []) → RegS s f (T + W) v →
      f 0 = tabR 0 (T + W) (tabS st) ++ rest → f 21 = [] →
      IRuns I iprog (netH E prog) (encK s f)
        (encK s (Function.update f 0 (tabR 0 (T + W) (tabS (Bit.netRunH v impl prog st)) ++ rest)))
        ((prog.map (instrHC cE ((T + W) * v) Bb)).sum + 1)

Context. Round six, item language: a QHNet program on a table of T + W streams

The wires Fin W ⊕ Fin T of a round-six network are laid out as a table of T + W streams of length v on stack 0 (temporaries first: inr t ↦ t, inl w ↦ T + w, eqv).

  • gateH_fsp: a gate (g, S) is one fine rebuild rebuildCU (T + W) (srcT (ngOf g S)) (frozen KIL3/KFD table code), with denotation gateApply;
  • instrH, netH: the code of an instruction / of a program, an edge (x, e) being run in place by applyCF with an edge code E e;
  • netH_runs: the program code computes netRunH v impl prog whenever every edge code computes impl e on single streams (under the invariant Inv G0).

Formalization Note. Part of the Lean formalization of the round-six κ-improvement (integer-multiplication-kappa campaign, target IntMul.Kappa.jain_round6_framework). The statement is copied verbatim from the Lean development; the platform node carries the same declaration name. Definitions it mentions live in the IntMul_Kappa_R6_Defs* bundles (on top of the published κ bundles IntMul_Kappa_K_Defs*).

Preamble
-- Round-six κ development (integer-multiplication-kappa), generated by skeleton subtraction.

import Definitions.Def_IntMul_Kappa_R6_Defs13

set_option autoImplicit false
set_option relaxedAutoImplicit false
set_option maxHeartbeats 1000000

open IntMul IntMul.Kappa IntMul.Kappa.R6 IntMul.Kappa.R6.IL
open IntMul NLogN NLogN.RS NLogN.KIL NLogN.KFD AModel AModelL12 Finset
variable {W T m : ℕ}
variable {Pp : ℕ} {I : List Sym} {iprog : Fin Pp → IStmt HS Pp}
Formal statement
theorem IntMul.Kappa.R6.IL.netH_runs {G0 : Fin HS → List Item} {v : ℕ} (E : Bit.Edge m → IStmt HS Pp)
    (impl : Bit.Edge m → List (ZMod 2) → List (ZMod 2)) (cE : Bit.Edge m → ℕ)
    (s : IState HS) (hs : Inv G0 s) (rest : List ℤ) {Bb : ℕ} (hB : TabB (T + W) v Bb)
    (hv1 : 1 ≤ v) :
    ∀ (prog : List (Bit.Instr (Fin W ⊕ Fin T) (ZMod 2) m)),
      (∀ e ∈ Bit.progEdges prog, ∀ ys : List (ZMod 2), ys.length = v → (impl e ys).length = v) →
      (∀ e ∈ Bit.progEdges prog, ∀ ys : List (ZMod 2), ys.length = v →
        ∀ (t : IState HS) (R : List Item), Inv G0 t →
        IRuns I iprog (E e) (t.upd 0 (ints (enc2 ys) ++ R)) (t.upd 0 (ints (enc2 (impl e ys)) ++ R))
          (cE e)) →
      ∀ (st : Fin W ⊕ Fin T → List (ZMod 2)) (f : Fin HS → List ℤ), (∀ x, (st x).length = v) →
      (∀ r, Prot r → f r = []) → RegS s f (T + W) v →
      f 0 = tabR 0 (T + W) (tabS st) ++ rest → f 21 = [] →
      IRuns I iprog (netH E prog) (encK s f)
        (encK s (Function.update f 0 (tabR 0 (T + W) (tabS (Bit.netRunH v impl prog st)) ++ rest)))
        ((prog.map (instrHC cE ((T + W) * v) Bb)).sum + 1) := by sorry
Source
S. Jain, round-six networks for the integer-multiplication κ-improvement campaign (https://github.com/Swapnil-jain/integer-mult-kappa, commit 5868dc7) and D. Colkitt, integer-mult-bounds (https://github.com/CrocSwap/integer-mult-bounds); target `IntMul.Kappa.jain_round6_framework`. Lean declaration `IntMul.Kappa.R6.IL.netH_runs`, Solutions/R6ILNet.lean (lines 197–249) of the round-six development.

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