Theorem 9 — Ordinary binary multiplication with saving
OpenFastMul.binary_selectedThere exist one deterministic multitape Turing machine , a real constant and an integer threshold , all fixed independently of the inputs, such that every two length- coefficient vectors over , for every , have a halted execution producing their complete ordinary polynomial product.
The literal output contains all coefficients in ascending degree order, including zeros, and then blanks. Whenever , that execution uses at most
transitions. All setup, arithmetic, movement and output steps of the fixed finite program count. Correct termination is required below the threshold too.
Formalization Note The shared platform machine uses one-way tapes, a read-only input and separate output. Conversion from the source/local two-way convention is a proof obligation, not an assumed supplier. This is an open formalization target of an AI-assisted preprint; independent human review and a complete Lean proof remain outstanding.
import Definitions.Def_FastMul_BinaryTask set_option autoImplicit false
theorem FastMul.binary_selected :
FastMulPlatform.BinaryTimeBound (1 / 274877906944 : ℚ) := by sorryConfirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.