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 230931 Mihai Preda's GpuOwl [prp, special] 1 58.0015 171093 George Woltman's Prime95 [special] 56 57.7016 65750 Jean Penné's LLR [special, plus, minus] 4651 56.7452 31654 Geoffrey Reynolds' srsieve [sieve] 2635 56.0143 17106 Yves Gallot's GeneFer [prp, special] 1896 55.3988 17105 Anand Nair's GFNSvCUDA sieve [sieve] 1894 55.3988 17088 David Underbakke's AthGFNSieve [sieve] 1903 55.3978 16377 Pavel Atnashev's PRST [] 336 55.3553 12186 EMsieve [sieve] 99 55.0597 11570 Anand Nair's CycloSvCUDA sieve [sieve] 37 55.0078 11557 LLR2 [other] 1115 55.0067 11094 Yves Gallot's Cyclo [special] 42 54.9658 7250 Reynolds and Brazier's PSieve [sieve] 1976 54.5404 5956 Geoffrey Reynolds' gcwsieve [sieve] 58 54.3437 3110 MultiSieve/mtsieve [sieve] 41 53.6939 2863 Mikael Klasson's Proth_sieve [sieve] 12 53.6113 2853 Phil Carmody's 'K' sieves [sieve] 7 53.6078 2853 Paul Jobling's SoBSieve [sieve] 7 53.6078 1411 OpenPFGW (a.k.a. PrimeForm) [other, sieve, prp, special, plus, minus, classical] 566 52.9034 343 Yves Gallot's Proth.exe [other, special, plus, minus, classical] 48 51.4887

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.