Galactic Algorithm From Wikipedia the Free Encyclopedia a Galactic Algorithm Is One That Runs Faster Than Any Other Algorithm for Problems That Are Sufficiently Large but Where Sufficiently Large Is So Big That the Algorithm Is Never Used in Practice Galactic Algorithms Were So Named by Richard Lipton and Ken Regan as They Will Never Be Used on Any of the Merely Terrestrial Data Sets We Find Here on Earth an Example of a Galactic Algorithm Is the Fastest Known Way to Multiply Two Numbers2 Which Is Based on a 1729-Dimensional Fourier Transform3l14 This Means It Will Not Reach Its Stated Efficiency Until the Numbers Have at Least 2129 Digits Vastly More Digits Than There Are Atoms in the Universe So This Algorithm Is Never Used in Practice MULTIPLYING TWO INTEGERS BETTER DO a 1729-Dimensional FOURIER TRANSFORM Big Brain