LLR Version 3.8.6 is available!

[Jean Penné]

Hi All,

The new version 3.8.6 of LLR is now available on my personal site :

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

This version is identical to development Version 3.8.5, but uses Version 26.6 of George Woltman's gwnum library.

Please see Readme.txt file for details.

Best Regards,
Jean

P.S. : I still need help to build the Mac Intel binary...

[fivemack]

I had to poke the Makefile a little to get it to build on Mac Intel:

• I only have /Developer/SDKs/MacOSX10.5.sdk not .4u.sdk so changed .4u to .5 throughout
• multutil.o is no longer present in gwnum.a so the code to pull it out explicitly isn't needed

I have run

./llr -a3 -oVerbose=4 -d -q"3*2^234760-1"

successfully (67.3 sec on not-very-idle i7 iMac)

[paulunderwood]

Jean,

if it easy for you, please add a switch like:

FBase=<number> : The base for the Fermat PRP test (default is 3)

except for the Lucas test, maybe called "LBase". I am only interested in varying P and having Q=1. Of course I am interested in the jacobi symbol of (P^2-4*Q,N) being -1, which does not take long to determine with pari-gp

I am currently using a pfgw64 script, but it runs like treacle

Paul

[Jean Penné]

Originally Posted by paulunderwood

Jean,

if it easy for you, please add a switch like:

FBase=<number> : The base for the Fermat PRP test (default is 3)

except for the Lucas test, maybe called "LBase". I am only interested in varying P and having Q=1. Of course I am interested in the jacobi symbol of (P^2-4*Q,N) being -1, which does not take long to determine with pari-gp

I am currently using a pfgw64 script, but it runs like treacle

Paul

This option does exist, but is not shown in the Readme file, sorry...

It is : PBase=<number>
Note it is only the initial P value, not necessarily the relevant one, that will be computed by the genLucasBaseP() function, starting from this value, and having Q=1 as you requested.

Regards,
Jean

[Thomas11]

Just out of curiosity I tried to compile the latest source (3.8.6) for Linux 64 bit, but I'm getting the following error:

make: *** No rule to make target `factor64p.o', needed by `llr'.  Stop.

Is there something missing in the ZIP file, or do need to run some additional "preparational" commands elsewhere in the source tree?

BTW.: I get the same error for the older 3.8.4 sources.

Kind regards,

Thomas

[rogue]

Originally Posted by Thomas11

Just out of curiosity I tried to compile the latest source (3.8.6) for Linux 64 bit, but I'm getting the following error:

make: *** No rule to make target `factor64p.o', needed by `llr'.  Stop.

Is there something missing in the ZIP file, or do need to run some additional "preparational" commands elsewhere in the source tree?

BTW.: I get the same error for the older 3.8.4 sources.

Simple. LLR cannot be built as a 64-bit app (yet) because a factor routine it relies on is written in 32-bit asm.

[Thomas11]

Originally Posted by rogue

Simple. LLR cannot be built as a 64-bit app (yet) because a factor routine it relies on is written in 32-bit asm.

Ahh, I see. Thanks!
I always wondered why there are only 32-bit binaries while the source tree contains those 64-bit directories and build targets...

[rogue]

Originally Posted by Thomas11

Ahh, I see. Thanks!
I always wondered why there are only 32-bit binaries while the source tree contains those 64-bit directories and build targets...

If you have a 64-bit OS, then use pfgw (if the projects you work on allow it). It will be faster than 32-bit llr in most cases, and in some cases much faster than llr.

[Thomas11]

Originally Posted by rogue

If you have a 64-bit OS, then use pfgw (if the projects you work on allow it). It will be faster than 32-bit llr in most cases, and in some cases much faster than llr.

Thanks for that hint. I will give it a try.

So far I used pfgw only for "pathological" cases, e.g. very large k values (like for Roberts Smith's Very Prime Sequences (VPS), also known as Payam sequences), which cannot be treated by LLR.

[Thomas11]

Originally Posted by rogue

If you have a 64-bit OS, then use pfgw (if the projects you work on allow it). It will be faster than 32-bit llr in most cases, and in some cases much faster than llr.

Meanwhile I did some tests using 64-bit pfgw vs. 32-bit LLR (running both on a 64-bit Core2 Linux machine).
And indeed I found that pfgw performs slightly better, e.g. for base>2 tests it seems to be about 7% faster than LLR.

So, again, thanks for your advise!

[rogue]

Originally Posted by Thomas11

Meanwhile I did some tests using 64-bit pfgw vs. 32-bit LLR (running both on a 64-bit Core2 Linux machine).
And indeed I found that pfgw performs slightly better, e.g. for base>2 tests it seems to be about 7% faster than LLR.

The speed increase appears to be dependent upon the values of k and b and the CPU the software is run on. Some combinations will see more than a 30% increase in speed. Even for base 2, pfgw64 is faster than LLR on my laptop.