Hi Torbjörn,
> The new GMP code "beats GMP" too, in particular when SSFFT's
> coefficients approach the L1d cache size.
I'm looking forward to the new GMP code then...
Best regards,
Paul
___
gmp-devel mailing list
gmp-devel@gmplib.org
https://gm
paul zimmermann writes:
on https://hal.archives-ouvertes.fr/hal-01022383, page 27, table 16, the
3-prime FFT implemented in Mathemagix is faster than GMP for 2^23 to 2^25
bits.
Apparently, they do, but just about 10%... Not impressed. :-)
We have small primes FFT code in several vari
on https://hal.archives-ouvertes.fr/hal-01022383, page 27, table 16, the
3-prime FFT implemented in Mathemagix is faster than GMP for 2^23 to 2^25 bits.
Paul
___
gmp-devel mailing list
gmp-devel@gmplib.org
https://gmplib.org/mailman/listinfo/gmp-devel
