![Screenshot of web.maths.unsw.edu.au: The recently proposed o(n log n) integer multiplication algorithm [pdf]](https://hn.urlbox.com/shots/renders/2026/10/22/031b3473-91fb-4202-9bf2-aa9a7fb3e59c.jpg)
The recently proposed o(n log n) integer multiplication algorithm [pdf](web.maths.unsw.edu.au)
295 points by craigcitro | 290 comments
A PDF by David Harvey (UNSW) on the recently proposed O(n log n) algorithm for integer multiplication.
#integer-multiplication on Hacker News
4 stories tagged integer-multiplication, newest first.
Κ = 0.003 for integer multiplication crossed(github.com)
31 points by aleph_minus_one | 22 comments
A GitHub pull request in CrocSwap/integer-mult-bounds claiming a conditional integer multiplication bound O(n (log n)^(1-0.00300105)) by combining query thinning and helper retiming.
Auto Research: Integer multiplication below n log n(app.getsupers.com)
73 points by swesnow | 37 comments
An Auto Research dashboard by Super tracking reviewed progress on open math problems, here the exponent saving for integer multiplication below n log n.
Integer multiplication below n log n(github.com)
88 points by E-Reverance | 59 comments
GitHub directory in OpenAI's math repository containing a preprint paper and README on integer multiplication algorithms faster than n log n.