Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 9 — Ordinary binary multiplication with saving 2−382^{-38}2−38

Open
FastMul.binary_selected

by arpcs · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

characteristic-twocomplexity-theoryfastmul-binaryfinite-fieldspolynomial-multiplication

There exist one deterministic multitape Turing machine MMM, a real constant C>0C>0C>0 and an integer threshold n0n_0n0​, all fixed independently of the inputs, such that every two length-nnn coefficient vectors over F2\mathbb F_2F2​, for every n≥1n\ge1n≥1, have a halted execution producing their complete ordinary polynomial product.

The literal output contains all 2n−12n-12n−1 coefficients in ascending degree order, including zeros, and then blanks. Whenever n≥n0n\ge n_0n≥n0​, that execution uses at most

Cnmax⁡{1,⌈log⁡2n⌉}1−2−38C n\max\{1,\lceil\log_2 n\rceil\}^{1-2^{-38}}Cnmax{1,⌈log2​n⌉}1−2−38

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.

Preamble
import Definitions.Def_FastMul_BinaryTask
set_option autoImplicit false
Formal statement
theorem FastMul.binary_selected :
    FastMulPlatform.BinaryTimeBound (1 / 274877906944 : ℚ) := by sorry
Source
Árpád Csizmadia, Ordinary Binary Polynomial Multiplication below n log n: Controlled tensor routing on fixed tapes, version 0.1.0-preprint (2026), Theorem 9 (label thm:main), main.tex lines 1013–1044; https://github.com/arpcs/finite-field-polynomial-multiplication/blob/fb94421e3e6d9f8348a6e5b963b5a62d9c525e95/papers/03-best-binary/main.tex#L1013 .
Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by arpcs · Oct 31, 2026

    Confirmed by the mission captain (proposal self-audit).

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me