mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > Software

Reply
 
Thread Tools
Old 2015-08-06, 20:19   #12
pepi37
 
pepi37's Avatar
 
Dec 2011
After milion nines:)

101100000002 Posts
Default

./llr64 -d -q"51956602*63^19370-1"
Base factorized as : 3^2*7
Base prime factor(s) taken : 3, 7
Starting Lucas sequence for 51956602*63^19370-1...
Using zero-padded AVX FFT length 15K, Pass1=320, Pass2=48, P = 10
51956602*63^19370-1 may be prime, trying to compute gcd's
U((N+1)/7) is coprime to N!
51956602*63^19370-1 may be prime, but N divides U((N+1)/3), P = 10
Restarting Lucas sequence with P = 14
Using zero-padded AVX FFT length 15K, Pass1=320, Pass2=48, P = 14
51956602*63^19370-1 may be prime, trying to compute gcd's
51956602*63^19370-1 may be prime, but N divides U((N+1)/3), P = 14
Restarting Lucas sequence with P = 15
Using zero-padded AVX FFT length 15K, Pass1=320, Pass2=48, P = 15
51956602*63^19370-1 may be prime, trying to compute gcd's
51956602*63^19370-1 may be prime, but N divides U((N+1)/3), P = 15
Restarting Lucas sequence with P = 16
Using zero-padded AVX FFT length 15K, Pass1=320, Pass2=48, P = 16
51956602*63^19370-1 may be prime, trying to compute gcd's
51956602*63^19370-1 may be prime, but N divides U((N+1)/3), P = 16
Restarting Lucas sequence with P = 17
Using zero-padded AVX FFT length 15K, Pass1=320, Pass2=48, P = 17
51956602*63^19370-1 may be prime, trying to compute gcd's
51956602*63^19370-1 may be prime, but N divides U((N+1)/3), P = 17
Restarting Lucas sequence with P = 18
Using zero-padded AVX FFT length 15K, Pass1=320, Pass2=48, P = 18
51956602*63^19370-1 may be prime, trying to compute gcd's
51956602*63^19370-1 may be prime, but N divides U((N+1)/3), P = 18
Restarting Lucas sequence with P = 19
Using zero-padded AVX FFT length 15K, Pass1=320, Pass2=48, P = 19
51956602*63^19370-1 may be prime, trying to compute gcd's
51956602*63^19370-1 may be prime, but N divides U((N+1)/3), P = 19
Giving up after 11 restarts...
Time : 141.817 sec.
This is with updated LLR 3.8.16
Why llr cannot confirm this is prime or not?

Also I do test on AVX and FMA3 test of this prime http://primes.utm.edu/primes/page.ph...18946#comments
Sergei told there is mixed bag of results...

Last fiddled with by pepi37 on 2015-08-06 at 20:25
pepi37 is offline   Reply With Quote
Old 2015-08-06, 20:39   #13
wombatman
I moo ablest echo power!
 
wombatman's Avatar
 
May 2013

1,741 Posts
Default

LLR v 3.8.13 does the same.
Code:
Base factorized as : 3^2*7
Base prime factor(s) taken : 3, 7
Starting N+1 prime test of 51956602*63^19370-1
Using zero-padded AVX FFT length 15K, Pass1=320, Pass2=48, a = 3
51956602*63^19370-1 may be prime. Starting Lucas sequence...
Using zero-padded AVX FFT length 15K, Pass1=320, Pass2=48, P = 3
51956602*63^19370-1 may be prime, trying to compute gcd's
U((N+1)/7) is coprime to N!
Restarting Lucas sequence with P = 4
Using zero-padded AVX FFT length 15K, Pass1=320, Pass2=48, P = 4
51956602*63^19370-1 may be prime, trying to compute gcd's
Restarting Lucas sequence with P = 7
Using zero-padded AVX FFT length 15K, Pass1=320, Pass2=48, P = 7
51956602*63^19370-1 may be prime, trying to compute gcd's
Restarting Lucas sequence with P = 9
Using zero-padded AVX FFT length 15K, Pass1=320, Pass2=48, P = 9
51956602*63^19370-1 may be prime, trying to compute gcd's
Restarting Lucas sequence with P = 10
Using zero-padded AVX FFT length 15K, Pass1=320, Pass2=48, P = 10
51956602*63^19370-1 may be prime, trying to compute gcd's
Restarting Lucas sequence with P = 14
Using zero-padded AVX FFT length 15K, Pass1=320, Pass2=48, P = 14
51956602*63^19370-1 may be prime, trying to compute gcd's
Restarting Lucas sequence with P = 15
Using zero-padded AVX FFT length 15K, Pass1=320, Pass2=48, P = 15
51956602*63^19370-1 may be prime, trying to compute gcd's
Restarting Lucas sequence with P = 16
Using zero-padded AVX FFT length 15K, Pass1=320, Pass2=48, P = 16
51956602*63^19370-1 may be prime, trying to compute gcd's
Restarting Lucas sequence with P = 17
Using zero-padded AVX FFT length 15K, Pass1=320, Pass2=48, P = 17
51956602*63^19370-1 may be prime, trying to compute gcd's
Restarting Lucas sequence with P = 18
Using zero-padded AVX FFT length 15K, Pass1=320, Pass2=48, P = 18
51956602*63^19370-1 may be prime, trying to compute gcd's
Restarting Lucas sequence with P = 19
Using zero-padded AVX FFT length 15K, Pass1=320, Pass2=48, P = 19
51956602*63^19370-1 may be prime, trying to compute gcd's
Giving up after 11 restarts...
  Time : 393.591 sec.
wombatman is offline   Reply With Quote
Old 2015-08-06, 23:33   #14
rebirther
 
rebirther's Avatar
 
Sep 2011
Germany

272510 Posts
Default

Quote:
Originally Posted by pepi37 View Post
./llr64 -d -q"51956602*63^19370-1"
Base factorized as : 3^2*7
Base prime factor(s) taken : 3, 7
Starting Lucas sequence for 51956602*63^19370-1...
Using zero-padded AVX FFT length 15K, Pass1=320, Pass2=48, P = 10
51956602*63^19370-1 may be prime, trying to compute gcd's
U((N+1)/7) is coprime to N!
51956602*63^19370-1 may be prime, but N divides U((N+1)/3), P = 10
Restarting Lucas sequence with P = 14
Using zero-padded AVX FFT length 15K, Pass1=320, Pass2=48, P = 14
51956602*63^19370-1 may be prime, trying to compute gcd's
51956602*63^19370-1 may be prime, but N divides U((N+1)/3), P = 14
Restarting Lucas sequence with P = 15
Using zero-padded AVX FFT length 15K, Pass1=320, Pass2=48, P = 15
51956602*63^19370-1 may be prime, trying to compute gcd's
51956602*63^19370-1 may be prime, but N divides U((N+1)/3), P = 15
Restarting Lucas sequence with P = 16
Using zero-padded AVX FFT length 15K, Pass1=320, Pass2=48, P = 16
51956602*63^19370-1 may be prime, trying to compute gcd's
51956602*63^19370-1 may be prime, but N divides U((N+1)/3), P = 16
Restarting Lucas sequence with P = 17
Using zero-padded AVX FFT length 15K, Pass1=320, Pass2=48, P = 17
51956602*63^19370-1 may be prime, trying to compute gcd's
51956602*63^19370-1 may be prime, but N divides U((N+1)/3), P = 17
Restarting Lucas sequence with P = 18
Using zero-padded AVX FFT length 15K, Pass1=320, Pass2=48, P = 18
51956602*63^19370-1 may be prime, trying to compute gcd's
51956602*63^19370-1 may be prime, but N divides U((N+1)/3), P = 18
Restarting Lucas sequence with P = 19
Using zero-padded AVX FFT length 15K, Pass1=320, Pass2=48, P = 19
51956602*63^19370-1 may be prime, trying to compute gcd's
51956602*63^19370-1 may be prime, but N divides U((N+1)/3), P = 19
Giving up after 11 restarts...
Time : 141.817 sec.
This is with updated LLR 3.8.16
Why llr cannot confirm this is prime or not?

Also I do test on AVX and FMA3 test of this prime http://primes.utm.edu/primes/page.ph...18946#comments
Sergei told there is mixed bag of results...
Jean gave me this option last time for this situation:

-oMaxrestarts=20

Increase it to 40, this could be enough.
rebirther is offline   Reply With Quote
Old 2015-08-07, 08:04   #15
IBethune
 
Nov 2010

52 Posts
Default

Quote:
Originally Posted by pepi37 View Post
./llr64 -d -q"51956602*63^19370-1"
...
Giving up after 11 restarts...
Time : 141.817 sec.
This is with updated LLR 3.8.16
Why llr cannot confirm this is prime or not?

Also I do test on AVX and FMA3 test of this prime http://primes.utm.edu/primes/page.ph...18946#comments
Sergei told there is mixed bag of results...
Quote:
Originally Posted by rebirther View Post
Jean gave me this option last time for this situation:

-oMaxrestarts=20

Increase it to 40, this could be enough.
Re: 51956602*63^19370-1 - this number is prime, and can be proven with both LLR 3.8.15 and 3.8.16 - this is not a bug, but rather for an N+1 test as well as showing a^(n+1) == 1 (mod n), there is also a divisibility test (see eq 4 in http://www.curtisbright.com/bln/2013...imality-tests/). For this candidate, lots of values of a (called P by LLr) fail this test, so it must make repeated attempts to find an a that satisfies both equations.

Re: 1024*3^1877301+1, which was discussed in http://primes.utm.edu/primes/page.ph...18946#comments - this is prime, and LLR 3.8.16 confirms it is prime. The uncertainty was due to a bug in gwnum which was fixed in the previous release.

- Iain
IBethune is offline   Reply With Quote
Old 2015-08-07, 16:57   #16
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

32×17×61 Posts
Default

It reminds me to ping Chris who was waiting for the software to mature to replace his UTM server side LLR and PFGW and then trigger the standard re-processing and have the 'External' tag removed. I'll email him that LLR 3.8.16 is what he wants to use from now on. As well as the latest PFGW.
Batalov is offline   Reply With Quote
Old 2015-08-08, 03:53   #17
LaurV
Romulan Interpreter
 
LaurV's Avatar
 
Jun 2011
Thailand

100100001110112 Posts
Default

Quote:
Originally Posted by Batalov View Post
LLR 3.8.16 is what he wants to use from now on. As well as the latest PFGW.
Is this valid for us (small CRUS hunters) too? i.e should I get a new cllr/pfgw too? (the old one seems to be ok and I usually don't crunch over n=200-300k or so).

(edit: I didn't follow all technical discussion but I have learned to pay attention to your posts )

Last fiddled with by LaurV on 2015-08-08 at 03:55
LaurV is offline   Reply With Quote
Old 2015-08-13, 15:39   #18
rebirther
 
rebirther's Avatar
 
Sep 2011
Germany

52×109 Posts
Default

I have found some errors in results:

Number sent to gwsetup is too large for the FFTs to handle.

Happened on a GenuineIntel Intel(R) Celeron(R) D CPU 3.46GHz [Family 15 Model 6 Stepping 5]

After 5 sec it has finished the WU.
rebirther is offline   Reply With Quote
Old 2015-08-13, 16:12   #19
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

6,247 Posts
Default

Quote:
Originally Posted by rebirther View Post
I have found some errors in results:

Number sent to gwsetup is too large for the FFTs to handle.

Happened on a GenuineIntel Intel(R) Celeron(R) D CPU 3.46GHz [Family 15 Model 6 Stepping 5]

After 5 sec it has finished the WU.
What was the number that this failed on?
rogue is offline   Reply With Quote
Old 2015-08-13, 16:26   #20
rebirther
 
rebirther's Avatar
 
Sep 2011
Germany

52·109 Posts
Default

Quote:
Originally Posted by rogue View Post
What was the number that this failed on?
Different, some S6 and 1 R430:

34910*430^153946-1
112783*6^1607505+1
rebirther is offline   Reply With Quote
Old 2015-08-13, 20:05   #21
Jean Penné
 
Jean Penné's Avatar
 
May 2004
FRANCE

571 Posts
Default Updated Win64 binaries now uploaded

Hi,

Thanks to Rebirther, the two Win64 binaries are now also updated accordingly to the minor change I made on the 06/08/15.

Regards,
Jean
Jean Penné is offline   Reply With Quote
Old 2015-08-13, 20:35   #22
pepi37
 
pepi37's Avatar
 
Dec 2011
After milion nines:)

26008 Posts
Default

Quote:
Originally Posted by Jean Penné View Post
Hi,

Thanks to Rebirther, the two Win64 binaries are now also updated accordingly to the minor change I made on the 06/08/15.

Regards,
Jean
Linux binaries on your page is newest?
pepi37 is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
LLR Version 3.8.20 released Jean Penné Software 30 2018-08-13 20:00
LLR Version 3.8.19 released Jean Penné Software 11 2017-02-23 08:52
LLR Version 3.8.11 released Jean Penné Software 37 2014-01-29 16:32
LLR Version 3.8.9 released Jean Penné Software 37 2013-10-31 08:45
llr 3.8.2 released as dev-version opyrt Prime Sierpinski Project 11 2010-11-18 18:24

All times are UTC. The time now is 23:14.

Sun Mar 7 23:14:21 UTC 2021 up 94 days, 19:25, 0 users, load averages: 2.25, 2.06, 2.10

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.