Breaking news in the algorithmic/arithmetic world!
Integer multiplication in time O(n · log n). 
It means you can multiply two n-bits integer using roughly n log n operations. It's a *very* important problem because a lot of mathematical software rely on efficient integer multiplication.
It breaks the last best known algorithm  (Schönhage–Strassen), that was in O(n · log n · log log n)