20210115, 11:34  #1 
Feb 2019
2^{2}×7 Posts 
How exactly does the GIMPS project work?
Hi there,
I would like to know how the GIMPS project exactly works. Let us assume that my computer does the LL first test. In this case, my computer performs the arithmetic operations 100 percent on its own and only the status of the work is reported to the Prime Net server via the Internet or is the Prime NET Server in the arithmetic operations involved, so that the arithmetic operations are divided (by my computer and the PRIME NET Server), so that here the LL first test is done by several computers? 
20210115, 11:39  #2  
Undefined
"The unspeakable one"
Jun 2006
My evil lair
3^{5}×5^{2} Posts 
Quote:
Later someone else will double check it and do it all again on their computer. 

20210115, 11:44  #3  
Sep 2002
Database er0rr
2^{9}·7 Posts 
Quote:


20210115, 12:56  #4 
Feb 2019
34_{8} Posts 

20210115, 13:10  #5 
Undefined
"The unspeakable one"
Jun 2006
My evil lair
3^{5}×5^{2} Posts 

20210115, 13:12  #6 
Feb 2019
2^{2}·7 Posts 
Ok, I understand. Thank you both for your answers.

20210115, 16:05  #7 
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
2^{2}×5×467 Posts 
The work flow goes like this.
We have a list of primes that will be used as the candidate exponents (p) in 2^{p}1 Trial factoring and then P1 factoring are used to eliminate candidates with small factors. Then the First Time Check is done. (In the past that was an LL test. Now we do PRP with the certificate enhancement which will save the project the cost of a double check for composites. If the PRP test shows that it is a Probable Prime, then the LL tests are done on various CPU architectures by various software types.) If the FTC shows it is not prime then either the cert is run or a LL double check. There is a subproject of looking for full factorizations of composite Mersenne Numbers. If we have a known factor, then a PRP is done on the remaining cofactor. If it is a PRP prime, then we are done. If it isn't there are people that will use TF, P1, then ECM, and eventually a sieve to find all of the factors. Most are content to have a single known factor. Others want to know them all. 
20210116, 12:03  #8 
Feb 2019
2^{2}×7 Posts 

20210116, 13:42  #9 
Romulan Interpreter
Jun 2011
Thailand
59×157 Posts 
Prime 95, Mprime, MLucas, cudaLucas, gpuOwl, gLucas, etc

20210116, 16:45  #10 
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
2^{2}×5×467 Posts 
mprime and Prime95 are twins. mprime is for linux and Prime95 for windows.
I think there are a few how brew programs out there too that are used by just one person and are not nearly as fast as the others mentioned. 
20210116, 17:04  #11  
Feb 2005
Colorado
1001001011_{2} Posts 
Quote:
This instructs mprime to start with the menu, and to provide status output while it is running. I think this confuses a lot of new users, because without those options mprime defaults to looking like it is deaf and mute. 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
GIMPS and Fibonacci prime project?  Shen  Information & Answers  6  20171025 20:59 
i am doing a reasearch project on GIMPS  serge2k  Homework Help  1  20100325 02:24 
so what GIMPS work can single precision do?  ixfd64  Hardware  21  20071016 03:32 
Introduction: ECM work done on Cunningham Project composites  garo  Cunningham Tables  2  20050120 10:06 
A distributedcomputing project to optimize GIMPS FFT? Genetic algorithms  GP2  Software  10  20031209 20:41 