LLR Version 3.8.21 Released

[Jean Penné]

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 Mac-Intel 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.

[Jean Penné]

Hi,

Win64 and MacIntel binaries are now available.
Many thanks to Rebirther and Iain Bethune for there help!

Best Regards,
Jean

[lukerichards]

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?

[Jean Penné]

Originally Posted by lukerichards

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?

Yes, indeed, but for such a small number, an APRCL test is done, not Pocklington :

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

[lukerichards]

Originally Posted by Jean Penné

Yes, indeed, but for such a small number, an APRCL test is done, not Pocklington :

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

Thanks, Jean, that's really helpful. Out of interest - can the input handle a b-value in factored form? e.g. 2*(3*5*13)^1+1?

[lukerichards]

Originally Posted by lukerichards

Could someone please advise as to how to write an input file?

I'm still struggling with writing an input file - does anyone have any advice? Whatever I write, I get the return that it is an invalid entry.

In particular, I'm looking to test a number like x¹+1 where x has a lot of known factors. Is this feasible with LLR?

[Jean Penné]

Originally Posted by lukerichards

I'm still struggling with writing an input file - does anyone have any advice? Whatever I write, I get the return that it is an invalid entry.

In particular, I'm looking to test a number like x¹+1 where x has a lot of known factors. Is this feasible with LLR?

You can see the input file formats accepted by LLR by reading the Readme.txt file.
For the numbers you want to test, you will have to write a little wrapper program...
Regards,
Jean

[lukerichards]

Originally Posted by Jean Penné

You can see the input file formats accepted by LLR by reading the Readme.txt file.
For the numbers you want to test, you will have to write a little wrapper program...
Regards,
Jean

I did read the Readme.txt but I seem to have misinterpreted it.

[masser]

Should this thread be stickied? Also, the 3.8.20 thread could be un-stickied.

[paulunderwood]

@Jean. Is there an imminent release of LLR linked against the latest GWNUM with its AVX512 features?

[Jean Penné]

Originally Posted by paulunderwood

@Jean. Is there an imminent release of LLR linked against the latest GWNUM with its AVX512 features?

I planned to implement the Gerbicz checking on PRP tests in the next LLR release, but it seems there is a lot of work to do that. So, if you think it is really wanted, I will try to make next week a release with only a link against the latest GWNUM library...

Best Regards,
Jean