Yhn first seen 13 h ago, last 8 h ago, peak #14
New preprint claims integer multiplication below n log n
Original: Integer multiplication below n log n
A preprint titled 'Integer multiplication below n log n', dated September 23, 2026, has been published in OpenAI's public mathematics repository on GitHub. The claim touches a foundational problem in theoretical computer science: whether integers can be multiplied faster than the long-standing n log n bound achieved by Harvey and van der Hoeven in 2019. If the result holds up to peer review, it would mark a new milestone in algorithmic complexity theory.
Why now: It challenges a major open problem in computer science, with the claimed speedup coming from an unusual source and circulating on Hacker News.
OpenAIHacker NewsHarveyvan der Hoeven
Evidence
- Integer multiplication below n log n · E-Reverance · 88
API: https://socialmediatrends-api.osmike.com/v1/trends/1294560