PRPclient 2.4.7 with LLR 3.8.0 now available! - Page 2

opyrt · 2010-02-09, 17:15

Quote:

Originally Posted by rogue

The problem could be with gwnum. There are issues with gwnum for some numbers.

From what I understand, there are no *known* issues with numbers of the formula k*n^2+1, right? I've tested the two smallest prime numbers from the PSP project (they are detected as prime), and I've also verified that equal residues are produced by LLR 3.7.1c and 3.8.0 on the newer candidates (N=8M). The reason I ask is that I want to know if we should remove LLR 3.8.0 from our PRPclient package for now or if it's safe to run. :)

All input is appreciated!

rogue · 2010-02-09, 19:30

Quote:

Originally Posted by opyrt

From what I understand, there are no *known* issues with numbers of the formula k*n^2+1, right? I've tested the two smallest prime numbers from the PSP project (they are detected as prime), and I've also verified that equal residues are produced by LLR 3.7.1c and 3.8.0 on the newer candidates (N=8M). The reason I ask is that I want to know if we should remove LLR 3.8.0 from our PRPclient package for now or if it's safe to run. :)

All input is appreciated!

Did you mean k*2^n+1? I have not seen the issue with PRP tests. Has anyone tried this with LLR 3.8.0 with the ForcePRP switch turned on?

opyrt · 2010-02-09, 21:52

Quote:

Originally Posted by rogue

Did you mean k*2^n+1?

Yes, I did...

runesk · 2010-02-10, 09:05

Quote:

Originally Posted by rogue

Did you mean k*2^n+1? I have not seen the issue with PRP tests. Has anyone tried this with LLR 3.8.0 with the ForcePRP switch turned on?

I tried:

Code:

$ uname -a; ./llr -v; for INI in ForcePRP LucasPRPtest; do echo $INI=1 > llr.ini; cat llr.ini; ./llr -d -q"2072644824759*2^33333+5"; done
Linux lyng 2.6.24-26-server #1 SMP Tue Dec 1 19:19:20 UTC 2009 i686 GNU/Linux
Primality Testing of k*b^n+/-1 Program - Version 3.8.0
ForcePRP=1
Starting probable prime test of 2072644824759*2^33333+5
2072644824759*2^33333+5 is not prime.  RES64: 20A5CD45B0850A08.  OLD64: 61F167D1118F1E15  Time : 3.262 sec.
LucasPRPtest=1
Starting Lucas sequence
2072644824759*2^33333+5 is not prime(P = 4, Q = 2), Lucas RES64: 83B19B6B999E8557  Time : 8.281 sec.

.R

runesk · 2010-02-10, 09:09

The 2072644824759*2^33333+1 yields:

Code:

ForcePRP=1
Starting probable prime test of 2072644824759*2^33333+1
2072644824759*2^33333+1 is base 3-Strong Fermat PRP!  Time : 3.846 sec.
Starting Lucas sequence
2072644824759*2^33333+1 is Lucas PRP, Starting Frobenius test sequence
2072644824759*2^33333+1 is Frobenius PRP! (P = 5, Q = 2, D = 17)  Time : 11.418 sec.
LucasPRPtest=1
Starting Proth prime test of 2072644824759*2^33333+1
2072644824759*2^33333+1 is prime!  Time : 3.239 sec.

opyrt · 2010-02-10, 09:37

I've verified all these using LLR 3.8.0:

Code:

87743*2^212565+1 is prime!
224027*2^273967+1 is prime!
203761*2^384628+1 is prime!
122149*2^578806+1 is prime!
247099*2^484190+1 is prime!
172127*2^448743+1 is prime!
159503*2^540945+1 is prime!
263927*2^639599+1 is prime!
261917*2^704227+1 is prime!
161957*2^727995+1 is prime!
216751*2^903792+1 is prime!

I feel confident that LLR 3.8.0 is doing its job with k*2^n+1. :)

runesk · 2010-02-10, 09:45

Quote:

Originally Posted by Mini-Geek

I don't know of a good way to independently (i.e. without GWNUM), and in reasonable time, verify which is correct, but it would appear that LLR 3.8.0 has the problem.

GNU MP has the function mpz_probab_prime_p and using the demo applications in the 5.0.1 source, I did the following test:

Code:

$ echo -n "2072644824759*2^33333+5 "; ./expr/run-expr "2072644824759*2**33333+5" | cut -d\  -f5- | xargs ./isprime | cut -d\  -f2-
2072644824759*2^33333+5 is a probable prime

GMP did this test in about 37 seconds.

opyrt · 2010-02-17, 10:45

Tested the rest of the primes from the PSP project aswell:

Code:

241489*2^1365062+1 is prime!  Time : 4385.144 sec.
149183*2^1666957+1 is prime!  Time : 7932.972 sec.
214519*2^1929114+1 is prime!  Time : 9513.151 sec.
222361*2^2854840+1 is prime!  Time : 25216.852 sec.
265711*2^4858008+1 is prime!  Time : 69579.428 sec.
258317*2^5450519+1 is prime!  Time : 101601.551 sec.

So far, so good. I still don't know if it proves anything.

Jean Penné · 2010-02-17, 11:12

Quote:

Originally Posted by opyrt

Tested the rest of the primes from the PSP project aswell:

Code:

241489*2^1365062+1 is prime!  Time : 4385.144 sec.
149183*2^1666957+1 is prime!  Time : 7932.972 sec.
214519*2^1929114+1 is prime!  Time : 9513.151 sec.
222361*2^2854840+1 is prime!  Time : 25216.852 sec.
265711*2^4858008+1 is prime!  Time : 69579.428 sec.
258317*2^5450519+1 is prime!  Time : 101601.551 sec.

So far, so good. I still don't know if it proves anything.

Perhaps you did not see my last post about the |c| !=1 bug in LLR 3.8.0 :

http://www.mersenneforum.org/showthread.php?t=13072

Regards,
Jean

Sloth · 2010-02-17, 12:29

so in english that means we are fine but other projects not using +/- 1 have problems?

S.

Joe O · 2010-02-17, 12:46

Quote:

Originally Posted by Jean Penné

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

Quote:

Originally Posted by Sloth

so in english that means we are fine but other projects not using +/- 1 have problems?
S.

It looks like the problem has been solved!

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
Tired of all the prpclient console windows?	opyrt	Prime Sierpinski Project	4	2010-05-31 08:42

2010-02-17, 12:29	#21
Sloth Mar 2006 2·47 Posts	so in english that means we are fine but other projects not using +/- 1 have problems? S.