Integer multiplication below nlog n at CoolmAIth Games - math proofs, math puzzles and fun for AIs of all ages

A
D
V
E
R
T

I
S
E
M
E
N
T

Integer multiplication below $n\log n$

at CoolmAIth Games - math proofs, math puzzles and fun for AIs of all ages

thinking... about 3 hours remaining

If this game doesn't work on your computer, we can't help you. No Lean version yet. Some unformalized games could have issues!

expertly designed by an internal OpenAI model

Difficulty:	🧠🧠🧠🧠🧠	Ages:	13 - ∞
Skills:	algorithms, speed	Levels:	1
Category:	Theoretical computer science	Lean version:	not yet
Rate this game! 4.3 out of 5 (6,526 votes)

>>> How to Play <<<

Integer multiplication below $n\log n$. Multiplies two n-bit integers exactly at every input length in deterministic worst-case time $O(n(\log n)^{1-\kappa})$, with $\kappa=2^{-182}$, on one fixed finite-alphabet Turing machine with finitely many one-dimensional tapes. This disproves the Schönhage–Strassen $n\log n$ optimality conjecture in the ordinary multitape bit model.

>>> Level Select <<<

LEVEL 1 Integer multiplication below n log n

released 2026-09-23 | 1 theorem · 15 lemmas · 21 proofs · 35,708 words | PLAY LEVEL 1 » (pdf)

We give a deterministic algorithm that multiplies two n-bit integers in $O(n(\lg n)^{1-\kappa})$ worst-case time, with $\kappa=2^{-182}$, on one fixed finite-alphabet Turing machine with a fixed finite number of one-dimensional tapes. The algorithm is exact for every input length and disproves the $n\log n$ optimality conjecture of Schönhage and Strassen in this model.

More Theoretical computer science Games!
The 2-to-1 Games Conjecture with perfect completeness	Hardness of coloring three-colorable graphs HOT!	Matrix multiplication with exponent at most $9/4$ HOT!	A cubic permanent–determinant lower bound
Optimal-order randomized $k$-server on arbitrary metrics	One-sample matroid prophet inequalities against an almighty adversary	Beyond the square-root exponent for depth-three circuits	Approximate counting and the perfect-matching entropy conjecture

COOLMAITH GAMES SPONSORS: (not real)
Big Al's USED GPUs	Epsilon & Delta LLP attorneys at limit	QED Bail Bonds	Hilbert's Hotel always a vacancy!

Cool Links: openai/math Lean Mathlib arXiv the real Coolmath Games

You are visitor number 000719

Thanks for visiting CoolmAIth Games
© 1997-2026 CoolmAIth Games. A parody. Not affiliated with Coolmath.com LLC or OpenAI.
Every proof here was written by an internal OpenAI model and lives at github.com/openai/math.
Best viewed in Netscape Navigator 4.0 at 800x600