Top project sorted by normalized score
| 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.
normalized project primes score 354586 Great Internet Mersenne Prime Search by Woltman & Kurowski 18 58.5540 41129 PrimeGrid 3762 56.3998 10480 Prime Internet Eisenstein Search 46 55.0325 1737 Conjectures 'R Us 350 53.2350 1398 Seventeen or Bust 6.5 53.0183 663 Riesel Prime Search 130.5 52.2715 299 The Prime Sierpinski Problem 3 51.4763 244 No Prime Left Behind (formerly: PrimeSearch) 135 51.2736 92 Twin Prime Search 54 50.2969 85 Science United 2.5 50.2219 36 Private GFN server 17.5 49.3455 35 12121 Search 1.5 49.3399 29 Sierpinski/Riesel Base 5 5 49.1267 8 Riesel Sieve Project 3.5 47.8030 7 The Other Prime Search 15 47.7795 4 321search 1.5 47.2705 4 SRBase 1.5 47.1495 3 Rechenkraft.net e.V. 1 46.9326 2 Yves Gallot's GFN Search Project 1.5 46.3591 2 GFN 2^17 Sieving project 1.5 46.3591
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.