Richard Crandall, George Woltman and now Fermatsearch, maintain a project to search factors for small Fermat numbers using ECM (Elliptic Curve Method).
F24 has 5050446 decimal digits or 16777216 bit. This number is very hard to test, so we use a different method for Fermat numbers greater than F24: modular arithmetics.
Download mmff version 0.27 for Linux 64 bits (CUDA 4.1) (314k update 13 Dec 2012).
mmff is a program written by George Woltman. It has a nice documentation about its use and configuration. The source code may be compiled on Linux and Windows, and requires a Nvidia GPU with compute capability of 2.0 or higher
Fermat.exe is very simple to use and does not require any special instructions.
It uses spare cycles of your computer which would otherwise be wasted. The program causes no interference with other programs that you may be running and may bring you good luck.
Fermat.exe has been tested on many computers and no problems or complaints have been reported using Windows.
You should manually select a range to calculate based on the current status listed on this web. Please send questions and comments via email to the author: Leonid Durman.
GMP-Fermat is a program written by Mark Rodenkirch. It has a short documentation about its use and configuration. The source code may be compiled on DOS, Linux and Windows, as well as PowerPC, Sparc and all the architectures where GMP library can be installed.
The actual version for Linux uses Geoffrey Reynolds' fast assembly routines for mulmod and expmod routines.
MFAC for DOS and Linux has been written by Tony Forbes.
The divisor for F_31 has been found with this program, but today it is approximately 3 to 5 times slower than GMP-Fermat.
For such superhuge numbers, modular arithmetics is not enough. Square multiplying becomes time-critical. For this task the program should use FFT (Fast Fourier Transform). The actual state of the art is reached using the following programs: FermFact(sieve) + latest PFGW. Recently PFGW was enhanced and now surpasses the pair PRP+Proth. If you use pre-sieved numbers, GeneFer is today the fastest program for the search for a +100,000 or +500,000 digit prime.