Fwd: Mlucas + GMP

[Torbjörn Granlund]

Win C <winsto003 at hotmail.com> writes:

  I have tested this FFT program for doing large multiplications, and it
  turns out that it is much faster starting from numbers like
  2^400000. Should we consider integrating it into the GMP? That would
  definitely give us a boost. :D
  
Much time has been spent on improved FFT multiplication (and squaring)
for GMP; in fact we have developed much faster code ourselves based on
FFTs in multiple small-order prime fields.  (Some of that code is in the
GMP repo area.)

I am not familiar with the packages you mention, nor do I know their
relative performance.

I suppose the main issue with improving GMPs huge operand multiplication
performance is that somebody will need to spend an awful lot of time on
integrating, testing, and tuning the new code.

-- 
Torbjörn
Please encrypt, key id 0xC8601622