→Examples: replace citation to aggregator with citation to original publication, remove one redundant citation to existing source (the citation also copied too much from the source)
An example of a galactic algorithm is the fastest known way to [[multiplication algorithm|multiply two numbers]],<ref>{{Cite journal|last1=David|first1=Harvey|last2=Hoeven|first2=Joris van der|date=March 2019|title=Integer multiplication in time O(n log n)|url=https://hal.archives-ouvertes.fr/hal-02070778/document|journal=HAL|volume=hal-02070778}}</ref> which is based on a 1729-dimensional [[Fourier transform]].<ref name="quick">{{cite web |urllast1=https://phys.org/news/2019-04-weve-quicker-big.htmlHarvey |first1=David |title=We've found a quicker way to multiply really big numbers |authorurl=Davidhttps://theconversation.com/weve-found-a-quicker-way-to-multiply-really-big-numbers-114923 Harvey|website=The Conversation |date=9 April 2019 |publisheraccess-date=Phys.org9 March 2023 |language=en}}</ref> It needs <math>O(n \log n)</math> bit operations, but as the constants hidden by the [[big O notation]] are large, it is never used in practice.<ref name="conv">{{cite web |url=http://theconversation.com/weve-found-a-quicker-way-to-multiply-really-big-numbers-114923 |title=We've found a quicker way to multiply really big numbers}} Quote, from one of the authors of the algorithm: "The new algorithm is not really practical in its current form, because the proof given in our paper only works for ludicrously large numbers. Even if each digit was written on a hydrogen atom, there would not be nearly enough room available in the observable universe to write them down."</ref> However, it also shows why galactic algorithms may still be useful. The authors state: "we are hopeful that with further refinements, the algorithm might become practical for numbers with merely billions or trillions of digits."<ref name="quick"/>
