Top projects sorted by score (Another of the Prime Pages' resources)

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.

rank project primes score 1 Great Internet Mersenne Prime Search by Woltman & Kurowski 15 56.9364 2 PrimeGrid 3639 53.4426 3 Riesel Prime Search 653.5 51.4855 4 Seventeen or Bust 7 51.3934 5 Conjectures 'R Us 136.5 50.9766 6 The Prime Sierpinski Problem 5.5 49.4123 7 No Prime Left Behind (formerly: PrimeSearch) 158 49.3270 8 Prime Internet Eisenstein Search 25 49.2771 9 Sierpinski/Riesel Base 5 22.5 49.0163 10 Riesel Sieve Project 17.5 48.4065 11 The Other Prime Search 31 48.2396 12 12121 Search 6.5 47.7102 13 321search 2.5 47.4309 14 Yves Gallot's GFN Search Project 12 47.1419 15 Generalized Woodall Prime Search 8 46.6734 16 GFN 2^17 Sieving project 2.5 46.6601 17 Free-DC's Prime Search 9 46.0198 18 Twin Prime Search 5.5 45.9613 19 Mat's Prime Search 2 45.1733 20 GFN 2^16 Sieving project 1.5 44.7526

Notes:

Score for Primes

To find the score for a person, program or project's primes, we give each prime n the score (log n)3 log log n; and then find the sum of the scores of their primes. For persons (and for projects), if three go together to find the prime, each gets one-third of the score. Finally we take the log of the resulting sum to narrow the range of the resulting scores. (Throughout this page log is the natural logarithm.)

How did we settle on (log n)3 log log n? For most of the primes on the list the primality testing algorithms take roughly O(log(n)) steps where the steps each take a set number of multiplications. FFT multiplications take about

O( log n . log log n . log log log n )
operations. However, for practical purposes the O(log log log n) is a constant for this range number (it is the precision of numbers used during the FFT, 64 bits suffices for numbers under about 2,000,000 digits).

Next, by the prime number theorem, the number of integers we must test before finding a prime the size of n is O(log n) (only the constant is effected by prescreening using trial division).  So to get a rough estimate of the amount of time to find a prime the size of n, we just multiply these together and we get

O( (log n)3 log log n ).
Finally, for convenience when we add these scores, we take the log of the result.  This is because log n is roughly 2.3 times the number of digits in the prime n, so (log n)3 is quite large for many of the primes on the list. (The number of decimal digits in n is floor((log n)/(log 10)+1)).