Talk:Galactic algorithm

Multiplication algorithm

I think this is WP:SYNTH since in no place does that paper claim that $n_{0}=2^{1729^{1}2}\approxeq 10^{2.148\cdot 10^{38}}$ is the lowest such number, and indeed claims that d = 8, with a substantially smaller value of $d^{12}$ is sufficient. We should instead be vaguer, perhaps saying it needs to be bigger than can be written in the observable universe.--Jasper Deng (talk) 00:30, 14 August 2019 (UTC)