20180130, 20:34  #1 
May 2004
FRANCE
2^{4}×5×7 Posts 
LLR Version 3.8.21 Released
Hi All,
I uploaded today the version 3.8.21 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. No new feature in this LLR version, but the AVX threading bug is here fixed. This bug caused often false results after an error recovery, due to a misuse of the POSTFFT feature while calling gwstartnextft() function. This LLR version is linked with the Version 28.14 of George Woltman's gwnum library. The only thing new from 28.13 is better FFT selections for AMD Ryzen CPUs. 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. Best Regards, Jean P.S. : Please note than, now, LLR Versions 3.8.18, 3.8.19 and 3.8.20 are deprecated. 
20180205, 14:33  #2 
May 2004
FRANCE
2^{4}×5×7 Posts 
Hi,
Win64 and MacIntel binaries are now available. Many thanks to Rebirther and Iain Bethune for there help! Best Regards, Jean 
20180402, 14:46  #3 
"Luke Richards"
Jan 2018
Birmingham, UK
100100000_{2} Posts 
Could someone please advise as to how to write an input file?
For example, I would like to test the number by the Pocklington's algorithm: 2*15216263610852268543185996625765085265893373533318525^1+1 Is this possible with LLR? Last fiddled with by lukerichards on 20180402 at 14:46 
20180402, 15:54  #4  
May 2004
FRANCE
1060_{8} Posts 
Quote:
jpenne@crazycomp:~$ llr64 a10 d q"2*15216263610852268543185996625765085265893373533318525^1+1" 2*15216263610852268543185996625765085265893373533318525^1+1 is prime! (53 decimal digits, APRCL test) Time : 8.398 ms. Regards, Jean 

20180403, 22:17  #5  
"Luke Richards"
Jan 2018
Birmingham, UK
100100000_{2} Posts 
Quote:


20180405, 16:14  #6  
"Luke Richards"
Jan 2018
Birmingham, UK
2^{5}×3^{2} Posts 
Quote:
In particular, I'm looking to test a number like x^{1}+1 where x has a lot of known factors. Is this feasible with LLR? 

20180405, 17:53  #7  
May 2004
FRANCE
2^{4}×5×7 Posts 
Quote:
For the numbers you want to test, you will have to write a little wrapper program... Regards, Jean 

20180405, 20:09  #8 
"Luke Richards"
Jan 2018
Birmingham, UK
2^{5}·3^{2} Posts 

20181102, 15:26  #9 
Jul 2003
wear a mask
3×463 Posts 
Should this thread be stickied? Also, the 3.8.20 thread could be unstickied.

20190314, 12:06  #10 
Sep 2002
Database er0rr
5×23×29 Posts 
@Jean. Is there an imminent release of LLR linked against the latest GWNUM with its AVX512 features?

20190314, 20:24  #11  
May 2004
FRANCE
2^{4}×5×7 Posts 
Quote:
Best Regards, Jean 

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.11 released  Jean Penné  Software  37  20140129 16:32 
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 