20131220, 21:44  #1 
May 2004
FRANCE
2·307 Posts 
LLR Version 3.8.11 released
Hi All,
I uploaded today the stable (I hope!) version 3.8.11 of the LLR program. You can find it now on my personal site : http://jpenne.free.fr/ The 32bit Windows and Linux compressed binaries are available as usual. The Linux 64bit binaries are also released here. I uploaded also the complete source in a compressed file ; it may be used to build the MacIntel executable and also the 64bit Windows binary. This LLR version is linked with the Version 27.9 of George Woltman's gwnum library. I released also a cllrd binary, which is linked with the debug version of the gwnum library. The main new feature in this version is it can now test the primality of numbers of the form b^nb^m +/ 1 with n > m ; the header of the input file must then be ABC$a^$b$a^$c +1 or 1, respectively. If n > 2*m, only a strong PRP test can be done, but the factored part of the candidate is shown, if the number is PRP. If the factored part is at least 33%, the PFGW program can then be used to complete the proof. If the factored part is lower, it may be necessary to build an helper file, or to use a more general prover... As usual, I need help to build the 32bit Mac Intel binary, and also the 64bit Mac Intel and Windows ones. Please, inform me if you encountered any problem while using this new version. Merry Christmas, Happy new year and Best Regards, Jean 
20131221, 01:51  #2 
Sep 2002
Database er0rr
29×151 Posts 
Merry Christmas and a Happy New Year to you, Jean.
I have proved a couple of primes: 10^27720010^2577681 and 10^27720010^990881 On an Intel 4770k, hovering around 4.1GHz, the PRP tests run at 1.43msec/bit and the full proving test at 3.4msec/bit. The PRP tests are as quick as OpenPFGW. We were hoping for a bigger speed up, because R*b^n==R*b^m+R (mod b^nb^m1) and for smaller "m" I think a quicker special modular reduction is possible, by way of base conversions and an added shift. One bug is that if "ForcePRP=1" is put llr.ini then I get: Code:
Starting probable prime test of 10^2577681 Last fiddled with by paulunderwood on 20131221 at 01:51 
20131222, 10:38  #3  
May 2004
FRANCE
2×307 Posts 
Quote:
Yes, it is a bug and I will fix it! However, would you excuse me, but I don't understand why you need to use the ForcePRP option... Regards, Jean 

20131222, 14:05  #4 
Sep 2002
Database er0rr
29×151 Posts 

20131222, 14:40  #5 
May 2004
FRANCE
2·307 Posts 

20131222, 20:08  #6 
May 2004
FRANCE
2·307 Posts 
LLR 3.8.11
Hi,
The bug is now fixed on all released binaries, and on the source. Regards, Jean 
20131223, 22:21  #7 
"Carlos Pinho"
Oct 2011
Milton Keynes, UK
13FB_{16} Posts 
Seems to be that 3.8.11 is slower than 3.8.9 on LLR for k=5 at n=3.7M.

20131224, 17:20  #8 
Quasi Admin Thing
May 2005
11×89 Posts 
Have you checked that the FFT length hasn't increased? I have tested hundreds of base 2 tests for a total of 13 different k's and there hasn't been any significant difference in speed, but what you are reporting should of course be investigated, however an explanation could be that you have hit an FFT jump, wich will slow down your testing
Last fiddled with by KEP on 20131224 at 17:21 
20131224, 19:50  #9  
"Carlos Pinho"
Oct 2011
Milton Keynes, UK
3·5·11·31 Posts 
Quote:
Last fiddled with by pinhodecarlos on 20131224 at 19:59 

20131224, 23:24  #10 
Quasi Admin Thing
May 2005
11·89 Posts 

20131224, 23:33  #11 
"Carlos Pinho"
Oct 2011
Milton Keynes, UK
3·5·11·31 Posts 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
LLR Version 3.8.20 released  Jean Penné  Software  30  20180813 20:00 
LLR Version 3.8.19 released  Jean Penné  Software  11  20170223 08:52 
LLR Version 3.8.15 released  Jean Penné  Software  28  20150804 04:51 
LLR Version 3.8.9 released  Jean Penné  Software  37  20131031 08:45 
llr 3.8.2 released as devversion  opyrt  Prime Sierpinski Project  11  20101118 18:24 