Numerous Times

Inside Stories · Outside Proof

Founders

Founders

The Last Step of the Multiplication Ladder

David Harvey and Joris van der Hoeven have finally reached the theoretical peak of basic arithmetic, proving that large numbers can be multiplied faster than ever.

Numerous Times Founders Desk

The first ten years, in the founder's voice

October 22, 2026 · 3 min read
The Last Step of the Multiplication Ladder
NUMEROUSTIMES

In a recent breakthrough that has rippled through the mathematical world, David Harvey of the University of New South Wales and Joris van der Hoeven of École Polytechnique have published a proof for an $O(n \log n)$ integer multiplication algorithm. While this may sound like the dry residue of a graduate-level seminar, it represents the final resolution of a conjecture that has stood for nearly half a century. The two researchers have effectively discovered the most efficient way to perform the most fundamental operation in mathematics: multiplying two very large numbers.

To understand the significance, one must look back to the mid-20th century. For thousands of years, the world used the "long multiplication" we are taught in grade school, which requires $n^2$ operations. In the 1960s, Anatoly Karatsuba proved we could do better, and in 1971, the Schönhage-Strassen algorithm pushed the limit further, suggesting that a theoretical bound of $n \log n$ was likely the absolute ceiling of efficiency. For decades, researchers edged closer but never quite reached that peak. Harvey and van der Hoeven have now planted the flag, proving that the $n \log n$ speed is not just a dream, but a mathematical certainty.

This matters because multiplication is the bedrock of almost every complex calculation in modern computing. From the encryption that secures your banking data to the massive simulations used in weather forecasting and physics, everything eventually breaks down into simple arithmetic performed at scale. While this specific algorithm is currently more of a theoretical masterpiece than a practical tool—the numbers involved need to be astronomically large, far beyond what current silicon handles, to see the speed benefits—it defines the hard limits of what is possible. It tells the builders of the future exactly how fast their engines can run.

For the operators and engineers in our audience, this is a reminder that the tools we take for granted are still being refined at their most basic levels. The work of Harvey and van der Hoeven represents the quiet, relentless pursuit of perfection that defines the best of the craft. They weren't looking for a quick fix or a marketable product; they were looking for the truth behind the numbers. As we move forward, the focus will shift from the proof to the implementation. Watch for how this logic eventually trickles down into hardware design and library optimization, potentially shaving nanoseconds off the calculations that power the global digital economy.

The Friday Brief

One essay. Every Friday. From operators who actually run things.

Join thousands of founders, partners, and operating leaders. No filler. Unsubscribe anytime.

Reader notes

0 Notes

Sign in to comment. Comments are signed and public.

Sign in →