Top projects sorted by Number of primes

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.

rank project primes score 1 PrimeGrid 3469 55.1126 2 Conjectures 'R Us 480.5 52.4469 3 Riesel Prime Search 467 52.2984 4 Prime Internet Eisenstein Search 64 52.5391 5 No Prime Left Behind (formerly: PrimeSearch) 61 49.2214 6 Twin Prime Search 36 50.1594 7 The Other Prime Search 25 48.1490 8 Great Internet Mersenne Prime Search by Woltman & Kurowski 17 57.6971 9 Sierpinski/Riesel Base 5 15.5 49.2873 9 Private GFN server 15.5 49.2027 11 Riesel Sieve Project 12.5 48.3321 12 Primeform e-group 12 29.7019 13 Generalized Woodall Prime Search 8 46.8344 14 Seventeen or Bust 6.5 53.0183 15 12121 Search 5 49.3815 15 The Prime Sierpinski Problem 5 51.4787 17 William Garnett's PSearch 4 45.9218 18 Yves Gallot's GFN Search Project 2.5 46.6601 18 321search 2.5 47.4309 18 GFN 2^17 Sieving project 2.5 46.6601

Notes:

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.