Complete linear-time parameter banks and zero carry from original multiplication input
ProvedIntMul.InputParameterBanks.setup_parametersLet be finite binary operands with total width and . One fixed eighteen-tape finite machine, starting from its genuine initial configuration with blank work tapes and all heads at zero, reaches its exact globally halted preparation frame within
actual transitions. It retains the input, leaves global output empty, computes canonical retained descriptors for , , and , prepares their stated countdown/template banks physically, and generates the exact zero carry on bank 12 with head at zero. The three retained descriptor heads are at zero and the original input cursor is at its end blank. The precision is sufficient for every convolution coefficient and carry-normalization sum. The block descriptor is physically copied to arithmetic bank 6 and both source and destination heads are returned to zero. Fast coefficient production and bank/local-marker integration remain separate stages.
import Definitions.Def_IntMul_CarryProduct import Definitions.Def_IntMul_InputParameterBanks import Mathlib.Tactic open IntMul IntMul.InputParameterBanks
theorem IntMul.InputParameterBanks.setup_parameters (x y : List Bool) (hp : 0< x.length+y.length) :
∃ t : ℕ, t≤ 87*(x.length+y.length)+114 ∧
machine.step^[t] (machine.initCfg x y)=finalFrame x y ∧
(machine.step^[t] (machine.initCfg x y)).state=machine.qHalt ∧
(machine.step^[t] (machine.initCfg x y)).cells machine.inTape=(machine.initCfg x y).cells machine.inTape ∧
(machine.step^[t] (machine.initCfg x y)).cells machine.outTape=machine.tapeOf [] ∧
(machine.step^[t] (machine.initCfg x y)).cells 6=
machine.tapeOf ((InputArithmeticDescriptors.blockWord x y).map machine.bitSym) ∧
(machine.step^[t] (machine.initCfg x y)).head 6=0 ∧
(machine.step^[t] (machine.initCfg x y)).cells 12=
machine.tapeOf ((bin (3*lg (x.length+y.length)) 0).map machine.bitSym) ∧
(machine.step^[t] (machine.initCfg x y)).head 12=0 ∧
(machine.step^[t] (machine.initCfg x y)).head machine.inTape=x.length+y.length+2 ∧
(∀ i : Fin 18, i.val=15 ∨ i.val=16 ∨ i.val=17 →
(machine.step^[t] (machine.initCfg x y)).head i=0) ∧
val (InputArithmeticDescriptors.widthWord x y)+1=x.length+y.length ∧
val (InputArithmeticDescriptors.blockWord x y)+1=lg (x.length+y.length) ∧
val (InputArithmeticDescriptors.precisionWord x y)+1=3*lg (x.length+y.length) ∧
CarryProduct.coefficientWidth (lg (x.length+y.length)) x y≤ 3*lg (x.length+y.length) := by sorry