Physical zero-carry generation and marker rewind with a linear clock
ProvedIntMul.CarryInitialization.initialize_carryFor every finite binary descriptor , let . A fixed four-tape finite controller starts with empty carry bank 12 and two empty countdown banks 3 and 4, with retained on bank 15 at its marker, while retaining arbitrary original input cells and head. It generates the canonical -bit zero carry and physically rewinds its output head to the actual marker, reaching its exact final globally halted frame within
actual transitions. Both countdown/template words are fully restored with their saved cursors; original input cells and head remain unchanged. The final carry bank 12 is with head at cell zero. Empty and leading-zero descriptors are allowed. Both descriptor copies are prepared physically. Relocation into a different bank remains a separate stage.
import Definitions.Def_IntMul_CarryInitialization import Mathlib.Tactic open IntMul IntMul.CarryInitialization
theorem IntMul.CarryInitialization.initialize_carry (base : machine.Cfg) (l : List Bool) :
∃ t : ℕ, t≤ 7*(val l+1)+6*l.length+13 ∧
machine.step^[t] (initialFrame base l)=finalFrame base l ∧
(machine.step^[t] (initialFrame base l)).state=machine.qHalt ∧
(machine.step^[t] (initialFrame base l)).cells machine.inTape=base.cells machine.inTape ∧
(machine.step^[t] (initialFrame base l)).head machine.inTape=base.head machine.inTape ∧
(machine.step^[t] (initialFrame base l)).cells 12=machine.tapeOf ((bin (val l+1) 0).map machine.bitSym) ∧
(machine.step^[t] (initialFrame base l)).head 12=0 ∧
(machine.step^[t] (initialFrame base l)).cells 15=machine.tapeOf (l.map machine.bitSym) ∧
(machine.step^[t] (initialFrame base l)).head 15=0 ∧
(∀ i : Fin 16, i.val≠3 → i.val≠4 → i.val≠12 → i.val≠15 →
(machine.step^[t] (initialFrame base l)).cells i=base.cells i ∧
(machine.step^[t] (initialFrame base l)).head i=base.head i) := by sorry