20100930, 05:25  #1 
A Sunny Moo
Aug 2007
USA (GMT5)
14151_{8} Posts 
LLR 3.8.2: more flexible stoponprime option
In addition to the speed boost for most CPUs that is also present in PFGW 3.4.0, I noticed an interesting new addition when perusing LLR 3.8.2's readme:
Code:
5) Main user options (not set by default) : Verbose=1 : Get more details in the results file (default : 1 line/result). StopOnSuccess=1 : Stop the job when a prime or PRP is found. BeepOnSuccess=1 : Make noise at a positive result, if both Stop and Beep are set, make noise until stopped by the user! StopOnPrimedK=<number> : after <number> sucesses with this k value, skip further pairs having the same k value (usually, <number> = 1). StopOnPrimedN=<number> : Same thing, involving the value of n. StopOnPrimedB=<number> : Same thing, involving the base value. Verify=1 : Suppress prefactoring or previous PRP test. NoPrefactoring=1 : Suppress prefactoring (Gaussian Mersenne or Wagstaff). ErrorCheck=1 : Check errors on each iteration (it's time consuming!). Testdiff=1 : Check sum inputs != sum outputs (only for real FFT's, c<0). FacTo=<bits> : Used to launch a prefactoring only job (Wagstaff or GaussianMersenne norms candidates only). 
20100930, 05:55  #2  
May 2004
FRANCE
2^{3}·3·23 Posts 
LLR 3.8.2 features == LLR 3.8.1 ones!
Quote:
It was already available in Version 3.8.1! I did'nt add nor change any feature in this new version... Jean 

20100930, 06:12  #3 
A Sunny Moo
Aug 2007
USA (GMT5)
14151_{8} Posts 

20100930, 09:10  #4 
May 2007
Kansas; USA
3^{2}×7^{2}×23 Posts 
Very cool. Nor did I know that. Thanks for letting us know.

20100930, 16:26  #5 
Quasi Admin Thing
May 2005
1110001111_{2} Posts 
Very cool Jean. Thanks for adding this. Now a question or 2. Is the StopOnPrimedK=<number>, remembering wich k's has previously been primed, in case LLR has to be stopped? Finally, is LLR version 3.8.2 with the latest GWnum build, such that there can be a usefull 10% speedincrease on each tests?
Regards KEP 
20100930, 16:34  #6 
Just call me Henry
"David"
Sep 2007
Cambridge (GMT)
1011000101010_{2} Posts 
That is the only difference to 3.8.1. Compile the 3.8.1 source with the latest GWnum and you should have a 3.8.2 binary(there might be a version number change somewhere).

20100930, 16:37  #7  
Mar 2006
Germany
2^{8}·11 Posts 
Quote:
Code:
StopOnPrimedK=1 ks38=1 Quote:
See the source in gwnum.h Code:
#define GWNUM_VERSION "26.2" #define GWNUM_MAJOR_VERSION 26 #define GWNUM_MINOR_VERSION 2 Last fiddled with by kar_bon on 20100930 at 16:39 

20100930, 16:50  #8 
Just call me Henry
"David"
Sep 2007
Cambridge (GMT)
2×2,837 Posts 

20100930, 19:24  #9  
Quasi Admin Thing
May 2005
911 Posts 
Quote:
Kenneth! 

20100930, 21:41  #10  
A Sunny Moo
Aug 2007
USA (GMT5)
6249_{10} Posts 
Quote:


20101001, 10:59  #11  
Quasi Admin Thing
May 2005
911 Posts 
Quote:
Take care! Kenneth Ps. Btw "Tumo" mentioned something in an email to me, regarding numbers having GCD errors, wich could rule them out very fast from testings. But Jean said to me that it would take almost the same amount of iterations to find the GCD's for a N1 or N+1 test as it would take to do a normal testing. So is Tumo right or is Jean right? My feeling is that Jean is right, but if Tumo is right, does anyone know how to implement a method to find GCD errors, since it sound a lot faster than sieving, if possible... 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Prime generating polynomials that stop?  Orgasmic Troll  Math  61  20170405 19:28 
when does prime seach stop?  Unregistered  Information & Answers  5  20110810 01:38 
How exactly does the I option work?  Andi47  GMPECM  2  20090117 10:11 
mprime b cli option gone?!?  koekie  Software  4  20090102 07:10 
Start and Stop Prime 95 on Large Groups of Windows XP Machines  MarcGetty  Software  3  20060307 07:54 