integer multiplication

A new result claims integer multiplication can be performed in time below n log n, long regarded as a natural barrier after recent advances had only approached that bound. The claim is circulating among programmers and theoretical computer science enthusiasts, who are debating whether the analysis is sound and what it would mean for the practical speed of basic arithmetic on very large numbers.