Integer multiplication in O(nlog⁡n)O(n \log n) time on a single two-dimensional grid, with a formally verified proof

Get email updates

Piaoyang Cui, Yiming Liu, David P. Woodruff

A uniform multitape Turing machine multiplies two n-bit integers in O(nlog⁡n)O(n \log n) steps using a single two-dimensional grid for its main convolution. The paper provides a separate C implementation and compares its outputs with GMP.

What was already known

The O(nlog⁡n)O(n \log n) bit-complexity order was already known. This work achieves it with a different, single-grid construction.

AI involvement AI-centered

The paper reports that agents, primarily Gemini 4, helped develop the algorithm, its proofs, the implementation and the formalization under author direction. Google credits a separate multi-agent effort with the new algorithm.

Importance Notable

The paper supplies a formally checked multiplier using a simpler geometric layout and an implementation that can be tested independently.

Technical verification Formal (Lean + human)

The authors checked the written proofs and the formal statements for the machine, its uniformity, step bound and encodings. The Lean project checks the theorem and the paper reports separate output comparisons with GMP.

Independent checking

Checked the written proofs and formal target statements for uniformity, complexity and encodings.

Checker
Paper authors
Scope
A uniform multitape Turing machine multiplies two n-bit integers in O(nlog⁡n)O(n \log n) steps using a single two-dimensional grid for its main convolution. The paper provides a separate C implementation and compares its outputs with GMP.
Basis
Reported by the linked checker

Formal checking

Checked the uniform multitape machine’s multiplication correctness and O(nlog⁡n)O(n \log n) step bound.

Checker
Lean 4 kernel
Scope
A uniform multitape Turing machine multiplies two n-bit integers in O(nlog⁡n)O(n \log n) steps using a single two-dimensional grid for its main convolution. The paper provides a separate C implementation and compares its outputs with GMP.
Basis
Reported by the linked checker

Human understanding Few

The authors checked the written proof. The disclosure leaves their independent reconstruction of the model-assisted algorithmic steps undocumented.

Other useful sources

Correction and publication history