At this site we keep several lists of primes, most notably the list of the 5,000 largest known primes. Who found the most of these record primes? We keep separate counts for persons, projects and programs. To see these lists click on 'number' to the right.
Clearly one 100,000,000 digit prime is much harder to discover than quite a few 100,000 digit primes. Based on the usual estimates we score the top persons, provers and projects by adding (log n)3 log log n for each of their primes n. Click on 'score' to see these lists.
Finally, to make sense of the score values, we normalize them by dividing by the current score of the 5000th prime. See these by clicking on 'normalized score' in the table on the right.
||Jean Penné's LLR
[special, plus, minus]
||Geoffrey Reynolds' srsieve
||Reynolds and Brazier's PSieve
||David Underbakke's TwinGen
||OpenPFGW (a.k.a. PrimeForm)
[other, sieve, prp, special, plus, minus, classical]
||Marcel Martin's Primo (was Titanix and Certifix)
||Paul Jobling's NewPGen
||Yves Gallot's Proth.exe
[other, special, plus, minus, classical]
||George Woltman's PRP
||Geoffrey Reynolds' gcwsieve
||David Underbakke's AthGFNSieve
[other, prp, plus, minus, classical]
||John Renze's Coppersmith-Howgrave-Graham PARI script
||Mikael Klasson's Proth_sieve
||Mark Rodenkirch's MultiSieve.exe
||George Woltman's Prime95
||Yves Gallot's GeneFer
||Phil Carmody's 'K' sieves
||Jim Fougeron's GFNSieve
The list above show the programs that are used the most (either by number or score). In some ways this is useless because we are often comparing apples and oranges, that is why the comments in brackets attempt to say what each program does. See the help page for some explanation of these vague categories
- Number of primes
When counting primes we decided that if three people (persons) went together to find a prime, each should get credit for 1/3 of a prime. The same is true for projects, however programs get full credit for each prime (to encourage honest reporting of what programs where used). Persons, programs and projects are three separate categories and do not compete against each other.
For example, suppose the persons 'Carmody' and 'Caldwell' worked together and used the program 'PRP' to test candidates selected by the 'GFN 2^13 Sieving project', then completed their proofs using 'Proth.exe'. Then the persons 'Carmody' and 'Caldwell' would get 1/2 credit for each prime found; but the project 'GFN 2^13 Sieving project' and the programs 'PRP' and 'Proth.exe' would each get full credit.