Top project sorted by number of primes

The Prover-Account Top 20
Persons by: number score normalized score
Programs by: number score normalized score
Projects by: number score 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)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.

rankprojectprimesscore
1 PrimeGrid 3657 56.0826
2 Conjectures 'R Us 403 53.1729
3 No Prime Left Behind (formerly: PrimeSearch) 181 51.2107
4 Riesel Prime Search 153.5 52.1912
5 Primeform e-group 66 31.3259
6 Twin Prime Search 50 50.2441
7 Prime Internet Eisenstein Search 44 55.0112
8 Great Internet Mersenne Prime Search by Woltman & Kurowski 18 58.5540
9 Private GFN server 17.5 49.3455
10 The Other Prime Search 16 47.8981
11 Seventeen or Bust 6.5 53.0183
12 Sierpinski/Riesel Base 5 6 49.1570
13 Riesel Sieve Project 5.5 48.0096
14 The Prime Sierpinski Problem 3 51.4763
15 Yves Gallot's GFN Search Project 1.5 46.3591
15 12121 Search 1.5 49.3399
15 321search 1.5 47.2705
15 SRBase 1.5 47.1495
15 GFN 2^17 Sieving project 1.5 46.3591
15 Science United 1.5 47.2359
 
 

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.<\p>

Printed from the PrimePages <t5k.org> © Reginald McLean.