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 :

[url]http://jpenne.free.fr/index2.html[/url]

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

Thank you Jean for your effort.

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

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!).[/quote]

[QUOTE=Cruelty;205516]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]

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

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.

[quote=kar_bon;205715]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.[/quote]
Yeah, I noticed that. Definitely very cool. :cool:

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

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

[QUOTE=Jean Penné;205733]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[/QUOTE]That's some good news... at least for me :smile:

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 :

[url]http://jpenne.free.fr/Development/[/url]

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

Best Regards,
Jean