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

rankpersonprimesscore
41 Honza Cholt 25 50.5779
42 Michael Schulz 1 50.5434
43 Peter Benson 48 50.5357
44 Ed Goforth 7 50.5142
45 Karsten Klopffleisch 1 50.5009
46 Roman Vogt 3 50.4948
47 Max Dettweiler 69 50.4805
48 Barry Schnur 4 50.4782
49 Serhiy Gushchak 1 50.4356
50 Peter Harvey 3 50.4233
51 Borys Jaworski 15 50.4207
52 Michael Millerick 13 50.4163
53 Marius Vultur 19 50.4054
54 Florian Piesker 110 50.3695
55 Seonghwan Kim 43 50.3675
56 Yair Givoni 1 50.3617
57 James Krauss 9 50.3521
58 Sai Yik Tang 10 50.3491
59 Cesare Marini 1 50.3029
60 Igor Keller 8 50.2812

move up list ↑
move down list ↓

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

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