Bug in LLR with a small exponent (< 34000)

SaneMur · 2011-10-30, 02:42

I was doing some LLR runs on some smaller exponents recently, to see if I wanted to use my prime generator formula in the hunt for a top 5000 prime, and it has been failing on this one exponent. My errors occur on several different computers, so that pretty much eliminates hardware as the cause. My errors are:

Code:

Iter: 1/109814, ERROR: ROUND OFF (0.5) > 0.4
Continuing from last save file.
Unrecoverable error, Restarting with next larger FFT length...
Iter: 1/109814, ERROR: ROUND OFF (0.4999961853) > 0.4
Continuing from last save file.
Unrecoverable error, Restarting with next larger FFT length...
Iter: 1/109814, ERROR: ROUND OFF (0.4999818802) > 0.4
Continuing from last save file.
Unrecoverable error, Restarting with next larger FFT length...
Iter: 1/109814, ERROR: ROUND OFF (0.4999983311) > 0.4
Continuing from last save file.
Unrecoverable error, Restarting with next larger FFT length...
Iter: 1/109814, ERROR: ROUND OFF (0.4999961853) > 0.4
Continuing from last save file.
Unrecoverable error, Restarting with next larger FFT length...
Fatal error at setup : Number sent to gwsetup is too large for the FFTs to handle.

The exponent it was testing was only 33039.

Is there someway to contact the author?

Dubslow · 2011-10-30, 05:11

Try posting in this thread over in the software forum. I don't know how responsive the author will be, but you're more likely to get a response there.

SaneMur · 2011-10-30, 13:34

Quote:

Originally Posted by Dubslow

Try posting in this thread over in the software forum. I don't know how responsive the author will be, but you're more likely to get a response there.

Thanks, both George and Jean have emailed me about it. I am sending them more data.

Kosmaj · 2011-11-02, 23:36

Can you kindly post the exact number(s) so that we can try ourselves, using the current and older versions of LLR.

Thanks!

SaneMur · 2011-11-05, 01:13

Quote:

Originally Posted by Kosmaj

Can you kindly post the exact number(s) so that we can try ourselves, using the current and older versions of LLR.

Thanks!

Sure, paste this into a text file, save it, then run LLR on it. BTW, this is a base-10 project I was just messing around with. LLR will find all of the primes except for the last one (which is also prime). You will get roundoff errors for the last one.

Code:

24637167299:P:1:10:257
18446744073709551253 18
18446744073709551253 45
18446744073709551253 213
18446744073709551253 306
18446744073709551253 365
18446744073709551253 420
18446744073709551253 509
18446744073709551253 1021
18446744073709551253 1314
18446744073709551253 1459
18446744073709551253 2705
18446744073709551253 10203
18446744073709551253 10578
18446744073709551253 12941
18446744073709551253 16701
18446744073709551253 21073
18446744073709551253 30799
18446744073709551253 33039

SaneMur · 2011-11-05, 01:17

And, just wondering, is there a program where you can use a k > 2^64 for a Riesel Prime test? I can't seem to get any of my large k's to work with the ones I have.

I also can't seem to find a siever that works for k > 2^64 also.

rogue · 2011-11-05, 03:10

Quote:

Originally Posted by SaneMur

And, just wondering, is there a program where you can use a k > 2^64 for a Riesel Prime test? I can't seem to get any of my large k's to work with the ones I have.

I also can't seem to find a siever that works for k > 2^64 also.

pfgw

Nothing that I know off of the top of my head.

SaneMur · 2011-11-05, 04:57

Quote:

Originally Posted by rogue

pfgw

I am not so convinced pfgw can accept a k > 2^64. A simple test to demonstrate:

Code:

9999999:M:1:2:258
18446744073709551617 2

...will generate the output:

1*2^2-1 is prime!

(It thinks 18446744073709551617 = 1 since 64 bits were overflowed.)

kar_bon · 2011-11-05, 08:31

Calling

Code:

pfgw -q"18446744073709551617*2^2-1"

will produce the correct result, the same as LLR V3.8.6 (RES64 1E1DF1A8370FB1D5).

There seems only a reading/converting-issue when calling "pfgw <filename>" with a newpgen format file.

Create a ABCD-format file like

Code:

ABC $a*2^$b-1
18446744073709551617 2

and pfgw will do this one correct.

NewPGen can handle bigger k-values by using the Primorial Mode (k not prime):

So instead writing k as "2419275534239148308295" input the factored value "1043827764761*3*5*11*13*19*29*37*53".

See here for some big values.

SaneMur · 2011-11-05, 13:36

Quote:

Originally Posted by kar_bon

Calling
There seems only a reading/converting-issue when calling "pfgw <filename>" with a newpgen format file.

Yes, but that is a BIG problem!

I was able to use NewpGen to create a sieved file using a factored form, thanks for the tip! Such a shame that I can't get any prime testing program to read it though. How are other people doing it?? I am perplexed!

I followed your link and would like to "join the hunt" for efficient k values for Riesel Prime generation. I am trying to get in touch with Robert, if you know how, pass the word.

That project is too cool to resist!

rogue · 2011-11-05, 13:43

Quote:

Originally Posted by kar_bon

Calling

Code:

pfgw -q"18446744073709551617*2^2-1"

will produce the correct result, the same as LLR V3.8.6 (RES64 1E1DF1A8370FB1D5).

There seems only a reading/converting-issue when calling "pfgw <filename>" with a newpgen format file.

Interesting. I'll look into it.

2011-11-05, 08:31	#9
kar_bon Mar 2006 Germany 2²×727 Posts	Calling Code: pfgw -q"184467440737095516172^2-1" will produce the correct result, the same as LLR V3.8.6 (RES64 1E1DF1A8370FB1D5). There seems only a reading/converting-issue when calling "pfgw <filename>" with a newpgen format file. Create a ABCD-format file like Code: ABC $a2^$b-1 18446744073709551617 2 and pfgw will do this one correct. NewPGen can handle bigger k-values by using the Primorial Mode (k not prime): So instead writing k as "2419275534239148308295" input the factored value "104382776476135111319293753". See here for some big values. Last fiddled with by kar_bon on 2011-11-05 at 08:46 Reason: newpgen comment

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
Sieving with powers of small primes in the Small Prime variation of the Quadratic Sieve	mickfrancis	Factoring	2	2016-05-06 08:13
Small gaps 4,000 - 60,000	henryzz	Prime Gap Searches	18	2016-02-15 18:58
Small request	fivemack	Factoring	1	2009-03-02 03:07
Small(ish) exponent without LL????	Graff	PrimeNet	3	2009-01-26 04:08
Small set of 12	GP2	Completed Missions	2	2003-10-03 18:30

2011-10-30, 05:11	#2
Dubslow Basketry That Evening! "Bunslow the Bold" Jun 2011 40<A<43 -89<O<-88 1C35₁₆ Posts	Try posting in this thread over in the software forum. I don't know how responsive the author will be, but you're more likely to get a response there.

2011-11-02, 23:36	#4
Kosmaj Nov 2003 2·1,811 Posts	Can you kindly post the exact number(s) so that we can try ourselves, using the current and older versions of LLR. Thanks!

2011-11-05, 01:17	#6
SaneMur Jul 2011 117₁₀ Posts	And, just wondering, is there a program where you can use a k > 2^64 for a Riesel Prime test? I can't seem to get any of my large k's to work with the ones I have. I also can't seem to find a siever that works for k > 2^64 also.