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 project primes score 4102225 Great Internet Mersenne Prime Search by Woltman & Kurowski 13 55.8432 47957 Seventeen or Bust 11 51.3943 13121 PrimeGrid 1018 50.0982 3955 Riesel Prime Search 956 48.8990 2336 Riesel Sieve Project 31 48.3724 2223 No Prime Left Behind (formerly: PrimeSearch) 966 48.3227 2028 The Prime Sierpinski Problem 12 48.2312 968 321search 8.5 47.4915 759 Yves Gallot's GFN Search Project 30 47.2487 449 Free-DC's Prime Search 330 46.7233 438 Prime Internet Eisenstein Search 160 46.6993 422 GFN 2^17 Sieving project 2.5 46.6601 378 12121 Search 15 46.5517 188 Conjectures 'R Us 33 45.8530 113 Mat's Prime Search 4 45.3451 94 15k*2^n-1 search 36 45.1604 90 GFN 2^16 Sieving project 3 45.1137 84 Riesel Base 5 31 45.0522 32 Generalized Woodall Prime Search 21 44.0824 19 GFN 2^15 Sieving project 5.5 43.5407

Notes:

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 project 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 project's primes are pushed off the list.