In late March, David Harvey and Joris van der Hoeven showed that multiplying large integers takes "quasi-linear" time. The question had remained open since 1971! We now know that two n-digit integers can be multiplied using a number of elementary operations proportional to n ln(n), where ln denotes the natural logarithm. But perhaps even better is possible: no one has ever proved that multiplication cannot be "linear"! An article explaining how the new algorithm works will appear in our next issue.