On Saturday, July 22, 2017 at 9:19:44 AM UTC-6, Rémy Oudompheng wrote: > > > I wrote a little module (github/remyoudompheng/bigfft) to play with > FFT-based multiplication of huge integers, while maintaining > interoperability with the math/big package. > > I think I saw that on Github and starred it the other day, thanks...
> On my computer, it multiplies 1Gbit numbers (300MB strings when > printed in base 10), in 24 seconds (the GMP library does it in 9.3 > seconds). I assume that it would multiply your 2GB strings (6 Gbit > numbers) in about 2 minutes. > > That is acceptable. Does it ever change speed depending on what type of numbers you feed it? For example adding 1111111111 * 2222222222 Versus some more complex number 4589347587934 * 874589371596 As we all know benchmarks can give a false sense ;-) Depending on inputs/parameters. (but that may be for me to find out!) -- You received this message because you are subscribed to the Google Groups "golang-nuts" group. To unsubscribe from this group and stop receiving emails from it, send an email to golang-nuts+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
