That and even faster algorithms are mentioned in the video, including David Harvey and Joris van der Hoeven’s O(n log n) algorithm which is only faster for numbers having more than 2^(1729^12) bits.

To multiply two numbers by hand takes a few steps but it's something we're taught in school. When dealing with big numbers, really big numbers, we need to a quicker way to do things.

The algorithm is able to re-discover older matrix multiplication algorithms and improve upon its own to discover newer and faster algorithms. “AlphaTensor is the first AI system for discovering novel, ...

Engineers from BitEnergy AI, a firm specializing in AI inference technology, has developed a means of artificial intelligence processing that replaces floating-point multiplication (FPM) with ...