1

I downloaded GIMPS today just out of curiosity and have been running it. On my machine it is checking $M_{52898149}=2^{52898149}-1$.

From what I could find on Wikipedia I suppose that GIMPS uses Lucas-Lehmer primality test which means it will pick $s_{52898147}$ term in Lucas Lehmer sequence and will see whether $M_{52898149}=2^{52898149}-1$ divides it or not?

Now my question is, what does the iterations that my software is doing, means? Here is a pic :

enter image description here

What does iteration $160000/52898149$ means here? I suppose, by the pattern, I must be getting iterations upto 5290 such iterations, and each one of them will take around a couple of weeks, which may increase with higher sequences. Can someone explain what this software is doing to check the primality of this Mersenne prime.

Also, why was I assigned this number, is everyone randomly assigned a prime number for which $M_p$ has not been verified/tested yet as in case of this number it's primality has been tested before as the main page of the site says that all exponents below 78 421 769 have been tested at least once, so I must be just verifying it, meaning most likely it won't come out as a prime, otherwise they must have had it tested on different types of software by now.
Also, can I choose my own prime exponent larger than $78421769$ to check the primality?

P.S.- If this question doesn't fit on this site, please direct me to appropriate place. Also, let me know if I should create a GIMPS tag?

Bhaskar Vashishth
  • 11,279
  • 1
    You are getting some number, which doesn't have "small" factors, which can be taken care by other more efficient algorithms. Yeah, they use the LL-Test. The sequence is recursive and you need to calculate every single one up to $(M_p-2)$-th to get the wanted result. Of course you are doing everything modulo $M_p$. The number $i/M_p$ means you have found $s_i \pmod{M_p}$. – Stefan4024 May 25 '18 at 21:16
  • I believe that you should be able to make a reservation on the number you want to check, but it should be approved by GIMPS. When it comes to automatic assignment then it depends on your computer. If it's not very good you will get a smaller number, so you can finish it faster and in the estimated 90 days. But getting a smaller number usually means double-checking somebody else's result. – Stefan4024 May 25 '18 at 21:18
  • @Stefan4024 I have i5- 3rd gen 2.4Ghz, is it normal for such gig to get double checking work? – Bhaskar Vashishth May 25 '18 at 22:17
  • I guess I'm the worst person to give an answer to this question. Anyway from your ETA it seems that prediction is that your computer will do it in 10-11 days. However I have seen people finishing ones in half that time. For example the record prime at the moment has been done in 6 days and the verification took just over a day. So I guess your CPU might not be suitable for large numbers, as the difference between 50 and 70 millions would be 3-4 days or so. Hence the system will probably assign you smaller primes to be verified. – Stefan4024 May 25 '18 at 23:19
  • I would think GIMPS has an FAQ. It might not be easy to get to, but I'm sure it exists. – Robert Soupe May 27 '18 at 01:08
  • mersenneforum.org – Roddy MacPhee Apr 27 '21 at 00:36

2 Answers2

1

Each one of those iterations is just squaring the number then put it in modulo of whatever your prime exponent is. Iteration 160000/52898149 simply means that your computer system has completed 160000 such iterations. ms/iter counts how many milliseconds are needed on average for the last 10000 iterations, and ETA estimates the time needed to finish the calculations using the current ms/iter.

A prime number exponent is randomly assigned to users using the software for the first time according to the assignment rules. Since M52898149 is checked once using LL in 2012-12-17 and not checked twice, double-checking is commenced to make sure that the results(residue) of the first test is correct.

If you want to create custom assignments, such as to check the primality of larger prime exponents, you can use the Assignments tab under the Manual Testing column, then choose your number of workers available, number of jobs for a worker, your preferred work type and the (optional) exponent range which you get your exponents.

StrongestStrike
  • 688
0

GIMPS works by doing sucessive layers of checking, to weed out simple cases.

Primes only : It's easily provable that if $d\mid n$ then $2^d-1\mid 2^n-1$ . So any number with factors, is out of the running to be a Mersenne prime exponent.

Special factor form (Trial factoring) : It's easily provable (by Fermat and Lagrange) that if $q\mid 2^p-1$ then $p\mid q-1$ . So any factors of $2^p-1$, are expressible as form $q=2kp+1$ . As 2 is a quadratic residue they are provably congruent to $1,7 \bmod 8$ . Depth checked typically exceeds 80 bits

Gerbicz PRP : This base 3 PRP test is based on a reduced form of Lucas-Lehmer test. A candidate exponent that fails, is likely to fail the Lucas-Lehmer Test.

Lucas-Lehmer Test (LL) is a test devised by Lucas and Lehmer and starts with value $s_0=4$ and iteratively, applies the map $s_i\to s_i^2-2\bmod {2^p-1}$ until $i=p-2$ to check if it divides that iteration. If it does, then it confirms primality of the Mersenne number $2^p-1$

Roddy MacPhee
  • 859