Home News How ? Download Bench Status Reserve Submit Results Producers Math. Algo. Stat. Fun Links Credits Feedback |
Download the Program and sieved dataFor Windows 95, 98, Me, NT, 2000, XP,Download the latest version of Proth.exe at The prime Pages site and a prefiltered file on Phil Carmody's site. For Linux,Download the latest version of Proth.exe at The prime Pages site and a prefiltered file on Phil Carmody's site and Wine . Proth is as fast under Linux/Wine as under Windows and the 188,194 digit prime 55360232768+1 was found this way. NEW: you can download the binary of GeneFer. It's written in assembler and is as fast as Proth.exe on a PIII. A full 80-bit version of GeneFer is also available for Linux and Windows.. If you use pre-sieved numbers, it's today the fastest program for the search for a +100,000 or +500,000 digit prime! For Unix and other OS,Download the C source code of "GeneFer". The probable test of GFN is implemented: a DWT and a Four Step FFT with no transposition and no bit reversal are used to test quickly large numbers. A test and a bench is included in. The most up-to-date algorithm for GFN sievingis available here. But you don't need it if you use already a prefiltered file. Benchmarks,You can compare your computer to other architectures here.
|