Top project sorted by 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.

rank project primes score 1 Great Internet Mersenne Prime Search by Woltman & Kurowski 17 57.6971 2 PrimeGrid 3398 55.7626 3 Prime Internet Eisenstein Search 53 55.0111 4 Seventeen or Bust 6.5 53.0183 5 Conjectures 'R Us 447.5 52.8397 6 Riesel Prime Search 242 52.2487 7 The Prime Sierpinski Problem 3 51.4763 8 No Prime Left Behind (formerly: PrimeSearch) 238 51.1888 9 Twin Prime Search 50 50.2441 10 12121 Search 3.5 49.3675 11 Private GFN server 18 49.3530 12 Sierpinski/Riesel Base 5 10 49.2306 13 Riesel Sieve Project 9.5 48.2529 14 The Other Prime Search 17 47.9632 15 321search 2.5 47.4309 16 SRBase 2 47.2254 17 Science United 1 46.7531 18 Yves Gallot's GFN Search Project 2.5 46.6601 18 GFN 2^17 Sieving project 2.5 46.6601 20 Rechenkraft.net e.V. 0.5 46.2171

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