Integer multiplication can beat n log n, shaking faith in 'lower bounds', researchers react

deanwball · x · 2026-10-07

New work shows integer multiplication can be done faster than n log n, long assumed to be a lower bound. Observers marvel that such "neat" lower bounds may just be weak approximations from our limited human faculties.

Related event: Integer Multiplication Breaks the n log n Barrier, with AI Leading the Way(11 posts)→

Original post →

More from Research

Research channel →