Idea for modulo with fixed n in GMP

[Torbjorn Granlund]

Vincent Diepeveen <diep at xs4all.nl> writes:

  So for that single case where the crunchers aren't using Woltman
  code, but GMP, let's give them tools to do it quicker!
  
Absolutely.  GMP 5 will make division (and thereby mod) close to
asymptotically optimal (if not optimal).  The basis for that will be
the code in the gmplib.org/devel/ area, plus any improvements that I
or other contributors make before the release.

-- 
Torbjörn