Top program sorted by normalized score

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)³ 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.

normalized program primes score 327538 George Woltman's Prime95 [special] 59 57.7004 107812 Jean Penné's LLR [special, plus, minus] 4824 56.5892 38994 Geoffrey Reynolds' srsieve [sieve] 3224 55.5722 23250 EMsieve [sieve] 80 55.0551 22191 Anand Nair's CycloSvCUDA sieve [sieve] 49 55.0085 21271 Yves Gallot's Cyclo [special] 51 54.9662 19560 David Underbakke's AthGFNSieve [sieve] 1227 54.8823 19285 Anand Nair's GFNSvCUDA sieve [sieve] 1217 54.8682 19277 Yves Gallot's GeneFer [prp, special] 1218 54.8678 16407 LLR2 [other] 1109 54.7065 12701 Reynolds and Brazier's PSieve [sieve] 2510 54.4506 9047 Pavel Atnashev's PRST [] 108 54.1112 7177 Geoffrey Reynolds' gcwsieve [sieve] 58 53.8797 5495 Mikael Klasson's Proth_sieve [sieve] 17 53.6126 5468 Phil Carmody's 'K' sieves [sieve] 7 53.6078 5468 Paul Jobling's SoBSieve [sieve] 7 53.6078 2236 MultiSieve/mtsieve [sieve] 39 52.7136 1529 OpenPFGW (a.k.a. PrimeForm) [other, sieve, prp, special, plus, minus, classical] 411 52.3337 654 Yves Gallot's Proth.exe [other, special, plus, minus, classical] 57 51.4847 643 George Woltman's PRP [prp] 29 51.4673

Notes:

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

normalized score

Just how do you make sense out of something as vague as our 'score' for primes? One possibility is to compare the amount of effort involved in earning that score, with the effort required to find the 5000th prime on the list. The normalized score does this: it is the number of primes that are the size of the 5000th, required to earn the same score (rounded to the nearest integer).

Note that if a program stops finding primes, its normalized score will steadily drop as the size of the 5000th primes steadily increases. The non-normalized scores drop too, but not as quickly because they only drop when the program's primes are pushed off the list.