Note: mprime/Prime95 and GMP-ECM use a common format, which makes it possible
to perform step 1 with mprime/Prime95, and step 2 with GMP-ECM.
- giantint from
Richard Crandall, Perfectly Scientific, Inc., with special code
for Fermat numbers.
based on the GMP multiprecision library.
from George Woltman,
is restricted to divisors of 2n-1 and to x86 architectures,
but is faster than GMP-ECM for step 1.
- Pari/GP and Magma also contain good ECM implementations
(factorint(n,5) in Pari/GP).
Several ECM-factoring projects have set up a server that automatically
distributes ECM tasks and collects found factors, using the client/server
- Paul Leyland's server is at 188.8.131.52, port 8194
is loaded with Cunningham numbers, Cullen-Woodall numbers, and BMtR
- The XYYXF project,
whose aim is to factor numbers of the form
xy+yx, has its server at euler.myip.org,
ElevenSmooth project, searching factors of 23326400-1,
has its server at wblipp.dynu.com, ports 8194 or 8195;
Mersenneplustwo project, searching factors of Mersenne primes plus two,
server at bearnol.is-a-geek.com, port 8194.