Complete original-input width and logarithmic block descriptors with charged global preparation
ProvedIntMul.InputBlockDescriptors.input_block_descriptorsLet be binary operand words with , and put . A fixed seventeen-tape machine starts from the ordinary initial configuration on , with empty work tapes and all heads at their real start markers. It physically computes retained big-endian descriptors satisfying
Their exact representation lengths are
The machine globally halts in its exact terminal configuration within
actual transitions. Original input is retained read-only, global output remains empty, both retained descriptors are at their actual start markers, and both delimited countdown copies of remain at their least-significant-bit cursors. Every temporary bank is empty at its marker. No width, length or block-size descriptor is supplied in advance. This constructs the real width and positive logarithmic block-size parameters required for later coefficient arithmetic.
import Definitions.Def_IntMul_InputBlockDescriptors import Mathlib.Tactic open IntMul IntMul.InputBlockDescriptors
theorem IntMul.InputBlockDescriptors.input_block_descriptors (x y : List Bool) (hp : 0< x.length+y.length) :
∃ t : ℕ, t≤ 18*(x.length+y.length)+7*Nat.clog 2 (x.length+y.length)+
10*Nat.clog 2 (lg (x.length+y.length))+50 ∧
machine.step^[t] (initialFrame x y)=finalFrame x y ∧
(machine.step^[t] (initialFrame x y)).state=machine.qHalt ∧
(machine.step^[t] (initialFrame x y)).cells machine.inTape=(initialFrame x y).cells machine.inTape ∧
(machine.step^[t] (initialFrame x y)).cells machine.outTape=machine.tapeOf [] ∧
val (widthWord x y)+1=x.length+y.length ∧
val (blockWord x y)+1=lg (x.length+y.length) ∧
(widthWord x y).length=Nat.clog 2 (x.length+y.length) ∧
(blockWord x y).length=Nat.clog 2 (lg (x.length+y.length)) := by sorry