LLR Version 3.8.0 is now available!

Jean Penné · 2010-02-08, 21:11

Hi All,

The new LLR Version 3.8.0 is now available to download on my site :

http://jpenne.free.fr/index2.html

This version uses the most recent release (25.13) of George Woltman's Gwnum
library, to do fast multiplications and squarings of large integers modulo N.

Since version 25.11, gwnum library is no longer restricted to base two for
efficient computing modulo k*b^n+c numbers (but SSE2 is required if b != 2),
and LLR greatly takes advantage of this improvement.

Please see the Readme.txt file attached with the binaries for more details.
Note : the binary for Mac OS X is not yet available because I cannot build it,
but you can build it yourselves after downloading the source directory.
Please, let me know if you have any difficulty to use this code...

Best Regards,
Jean

em99010pepe · 2010-02-08, 21:16

Thank you Jean for your effort.

Mini-Geek · 2010-02-09, 23:25

It seems that the LLRnetuser= option has been removed/deactivated. (it no longer outputs the additional info to lresults.txt) Was this intentional?

Cruelty · 2010-02-12, 23:45

Does newest LLR perform an intermittent error checking by default (similar to PFGW or Prime95)?
In the newest "readme" file, I have found only one reference to error checking:

Quote:

ErrorCheck=1 : Check errors on each iteration (it's time consuming!).

Jean Penné · 2010-02-13, 07:18

Quote:

Originally Posted by Cruelty

Does newest LLR perform an intermittent error checking by default (similar to PFGW or Prime95)?
In the newest "readme" file, I have found only one reference to error checking:

Yes, every 128th iterations, and also for a few ones (30 or 50) at the beginning and at the end.
Regards,
Jean

kar_bon · 2010-02-15, 16:37

i don't know if this was mentioned before or anyone is aware of it:

LLR now saves the running-time for a test, so if this test will be continued, the resulting time for the test will not be the time from the last startpoint.

that's why the savefile-format for the versions < 3.8 are not compatible.

mdettweiler · 2010-02-15, 17:09

Quote:

Originally Posted by kar_bon

i don't know if this was mentioned before or anyone is aware of it:

LLR now saves the running-time for a test, so if this test will be continued, the resulting time for the test will not be the time from the last startpoint.

that's why the savefile-format for the versions < 3.8 are not compatible.

Yeah, I noticed that. Definitely very cool.

Cybertronic · 2010-02-15, 18:08

This version of LLR have still a bug.

I think , Jean has published the old version.

Here some triplets with False und True results:

1052508160:T:0:2:131
1820553 128 True
3067947 128 True
10002611463 256 True
10008060363 256 True

1052508160:T:0:11:131
42941022 200 False
50193498 200 False
173823762 200 False
1866948 100 True
14653122 100 True

1052508160:T:0:2:131
21507 50 True
23877 50 "
79383 50 "
91833 50 "
2539167 500 False
5853987 500 "
32538663 500 "
47227743 500 "
16160127 498 "
28307277 498 "

Best

Jean Penné · 2010-02-15, 20:39

Hi,
I can now be more specific : LLR Version 3.8.0 has a bug that affects only
the PRP tests of k*b^n+c numbers such as abs(c) != 1
For abs(c) == 1 numbers, I think we may now be confident in this version.

I fixed this bug in the development version, but I have not yet released it on my
personal pages. I shall do that in one or two days maximum, and then post a message on this thread, so the users testing c != +1 or -1 would use this version. When the development version will be upgraded enough, it will probably become the official 3.8.1...
Sorry for this drawback,
Jean

Cruelty · 2010-02-15, 20:48

Quote:

Originally Posted by Jean Penné

Hi,
I can now be more specific : LLR Version 3.8.0 has a bug that affects only
the PRP tests of k*b^n+c numbers such as abs(c) != 1
For abs(c) == 1 numbers, I think we may now be confident in this version.

I fixed this bug in the development version, but I have not yet released it on my
personal pages. I shall do that in one or two days maximum, and then post a message on this thread, so the users testing c != +1 or -1 would use this version. When the development version will be upgraded enough, it will probably become the official 3.8.1...
Sorry for this drawback,
Jean

That's some good news... at least for me

Jean Penné · 2010-02-16, 06:19

Hi,

Users who are testing k*b^n+c numbers with |c| !=1 can now download the
fixed development version from my development directory :

http://jpenne.free.fr/Development/

Please, let me know if any problem is remaining...

Best Regards,
Jean

2010-02-08, 21:11	#1
Jean Penné May 2004 FRANCE 1104₈ Posts	LLR Version 3.8.0 is now available! Hi All, The new LLR Version 3.8.0 is now available to download on my site : http://jpenne.free.fr/index2.html This version uses the most recent release (25.13) of George Woltman's Gwnum library, to do fast multiplications and squarings of large integers modulo N. Since version 25.11, gwnum library is no longer restricted to base two for efficient computing modulo k*b^n+c numbers (but SSE2 is required if b != 2), and LLR greatly takes advantage of this improvement. Please see the Readme.txt file attached with the binaries for more details. Note : the binary for Mac OS X is not yet available because I cannot build it, but you can build it yourselves after downloading the source directory. Please, let me know if you have any difficulty to use this code... Best Regards, Jean

2010-02-09, 23:25	#3
Mini-Geek Account Deleted "Tim Sorbera" Aug 2006 San Antonio, TX USA 17×251 Posts	It seems that the LLRnetuser= option has been removed/deactivated. (it no longer outputs the additional info to lresults.txt) Was this intentional? Last fiddled with by Mini-Geek on 2010-02-09 at 23:54 Reason: typo

2010-02-15, 20:39	#9
Jean Penné May 2004 FRANCE 2²×5×29 Posts	LLR 3.8.0 and c != +1 or -1 Hi, I can now be more specific : LLR Version 3.8.0 has a bug that affects only the PRP tests of k*b^n+c numbers such as abs(c) != 1 For abs(c) == 1 numbers, I think we may now be confident in this version. I fixed this bug in the development version, but I have not yet released it on my personal pages. I shall do that in one or two days maximum, and then post a message on this thread, so the users testing c != +1 or -1 would use this version. When the development version will be upgraded enough, it will probably become the official 3.8.1... Sorry for this drawback, Jean

2010-02-16, 06:19	#11
Jean Penné May 2004 FRANCE 2²×5×29 Posts	LLR 3.8.0 development version is now updated! Hi, Users who are testing k*b^n+c numbers with \|c\| !=1 can now download the fixed development version from my development directory : http://jpenne.free.fr/Development/ Please, let me know if any problem is remaining... Best Regards, Jean

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
LLR Version 3.8.5 is available!	Jean Penné	Software	11	2011-02-20 18:22
Which version for P-III's?	richs	Software	41	2009-01-07 14:40
LLR - new version	Cruelty	Riesel Prime Search	8	2006-05-16 15:00
Version 24.14	Prime95	Software	13	2006-02-15 16:32
Which LLR version to use...	Cruelty	Riesel Prime Search	1	2005-11-10 15:17

2010-02-08, 21:16	#2
em99010pepe Sep 2004 2×5×283 Posts	Thank you Jean for your effort.

2010-02-15, 16:37	#6
kar_bon Mar 2006 Germany B58₁₆ Posts	i don't know if this was mentioned before or anyone is aware of it: LLR now saves the running-time for a test, so if this test will be continued, the resulting time for the test will not be the time from the last startpoint. that's why the savefile-format for the versions < 3.8 are not compatible.

2010-02-15, 18:08	#8
Cybertronic Jan 2007 Germany 2³·41 Posts	This version of LLR have still a bug. I think , Jean has published the old version. Here some triplets with False und True results: 1052508160:T:0:2:131 1820553 128 True 3067947 128 True 10002611463 256 True 10008060363 256 True 1052508160:T:0:11:131 42941022 200 False 50193498 200 False 173823762 200 False 1866948 100 True 14653122 100 True 1052508160:T:0:2:131 21507 50 True 23877 50 " 79383 50 " 91833 50 " 2539167 500 False 5853987 500 " 32538663 500 " 47227743 500 " 16160127 498 " 28307277 498 " Best