LibBF Benchmark

Multiplication speed

Test parameters


The comparison is fair because:

LibBF is slower than MPFR/GMP for numbers smaller than 1M digits. However, for larger numbers it is up to 1.2x faster.

LibBF is slower for small numbers because its base case multiplication is not optimized and because it has no specific algorithm for intermediate size numbers (such as Karatsuba, Toom-Cook or floating point FFT multiplication).

Fabrice Bellard -