LLR Version 3.8.14 released (deprecated)
 

Hi All,

I uploaded today the version 3.8.14 of the LLR program.
You can find it now on my personal site :

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

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 Mac-Intel executable and also the 64bit Windows binary.
This LLR version is linked with the Version 28.5 of George Woltman's gwnum library.
I released also a cllrd binary, which is linked with the debug version of this
gwnum library.
You can see in the Readme.text file, what is new in this release.
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

Thank you Jean.

Thanks you!
I read few times txt file, but cannot find what is new...

[QUOTE=pepi37;398340]Thanks you!
I read few times txt file, but cannot find what is new...[/QUOTE]

No much is new...
- gwnum library is the very last one( 28.5, not beta).
- when several roundoff errors accur, the save file is removed, to force restarting from the beginning ; it may be important for the
rare problems which seem to be linked with "pathologic" patterns...
- This version uses an APRCL prime test code (called as a child process), when available, to make a primality test on general format small candidates (typically smaller than 100 decimal digits). This is also used, if necessary, to complete the factoring of a large base, while testing k*b^n+-1 candidates.

I have compiled it for 64bit console and GUI with xp platform tool set. If someone can test it if its running on xp let me know.

[URL]http://www.bc-team.org/downloads.php?cat=7[/URL]

Some updates on LLR 3.8.14
 

Hi,

Thanks to Rebirther, the Win64 GUI and console applications are now available (presently without the APRCL test possibility).
Thanks to Iain Bethune, the Mac Intel 32-bit and 64-bit applications are now available.
On the other hand, David Cleaver, the author of the mpz_aprcl code, informed me that I was using an old version, so, I downloaded the last version from SourceForge, and updated the win32, and Linux binaries, and also the source directory accordingly, for future builds
The consequence is that the APRCL test of a prime number is now two times faster!


I wish to thank you very much for all the help I received.
Best Regards,
Jean

LLR 3.8.14 now linked with gwnum V28.6
 

Hi All,

I am happy to inform you that LLR Version 3.8.14 is now linked with the last V28.6 gwnum library that George released after correcting the AVX bug.
Thanks to the help of Iain and Reb, all the binaries are updated accordingly.
I updated also the source directory, but, as I made no change on the LLR code, I prefer to left the version number also unchanged.
The next V3.8.15 will com soon, but needs still some tests...

Many thanks to your help, and to all persons wo successfully worked on this difficult problem.
Jean

Jean could you in 3.8.15 for Linux make that line with K length of candidate stay all time (like on Windows version)
On linux then llring started that line is deleted and replaced with iteration line

[I]Using AVX FFT length 40K, Pass1=512, Pass2=80, a = 3 [/I]- windows version

Possible bug?
 

Why is LLR crashing?

[CODE]Log Name: Application
Source: Application Error
Date: 4/13/2015 4:43:09 PM
Event ID: 1000
Task Category: (100)
Level: Error
Keywords: Classic
User: N/A
Computer: Cody-PC
Description:
Faulting application name: LLR.exe, version: 3.8.14.0, time stamp: 0x5523b993
Faulting module name: LLR.exe, version: 3.8.14.0, time stamp: 0x5523b993
Exception code: 0xc0000005
Fault offset: 0x000000000233ea04
Faulting process id: 0xee8
Faulting application start time: 0x01d0762a73579165
Faulting application path: C:\Users\<username>\Downloads\llr38ewin64\LLR.exe
Faulting module path: C:\Users\<username>\Downloads\llr38ewin64\LLR.exe
Report Id: b113bc88-e21d-11e4-8412-54bef70e43ef
[/CODE]NewPGen output file and ini file attached.

If the input is of the form:

[CODE]ABC$a*2^$b+1
6954410083 1000000
[/CODE]

it will work :smile:

From the Help screen:

[code] This new version can be built on 64bit platforms, but then, the prefactoring
code is no more available. This affects only the Gaussian-Mersenne norm and
Wagstaff tests, for which the prefactoring must be done using a 32bit program.[/code]Why is that?