mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > Five or Bust - The Dual Sierpinski Problem

Reply
 
Thread Tools
Old 2012-12-16, 06:01   #353
Puzzle-Peter
 
Puzzle-Peter's Avatar
 
Jun 2009

2×5×67 Posts
Default

Hi Norman,

thanks! It is the nature of records that they will be broken some day. Let's see who will take primo to the next level.
Puzzle-Peter is offline   Reply With Quote
Old 2012-12-17, 00:19   #354
philmoore
 
philmoore's Avatar
 
"Phil"
Sep 2002
Tracktown, U.S.A.

111710 Posts
Default

Congratulations, Peter and Marcel! Thanks also to Norman, whose previous work helped Marcel update Primo to the current multi-core version. Only 18 more probable primes to certify to prove the dual Sierpinski conjecture as a theorem!
philmoore is offline   Reply With Quote
Old 2013-01-16, 17:12   #355
Puzzle-Peter
 
Puzzle-Peter's Avatar
 
Jun 2009

2×5×67 Posts
Default

I tried the next candidate, 2^73360+10711 but it wouldn't get past test1. It seems we reached the end of primo's useful range.
Puzzle-Peter is offline   Reply With Quote
Old 2013-01-16, 22:09   #356
henryzz
Just call me Henry
 
henryzz's Avatar
 
"David"
Sep 2007
Cambridge (GMT/BST)

165A16 Posts
Default

Might be worth waiting until http://mersenneforum.org/showthread.php?t=17554 is a viable option.

The method needs to be checked and a program needs to be made public. If ecpp ran in O(x) then this runs in O(x^(3/4)). In other words a lot faster once overhead is insignificant.
henryzz is offline   Reply With Quote
Old 2013-01-17, 17:26   #357
philmoore
 
philmoore's Avatar
 
"Phil"
Sep 2002
Tracktown, U.S.A.

1,117 Posts
Default

Quote:
Originally Posted by Puzzle-Peter View Post
I tried the next candidate, 2^73360+10711 but it wouldn't get past test1. It seems we reached the end of primo's useful range.
Thanks for trying this. I had hoped that maybe the next two, 2^73360+10711 and 2^73845+14717, might yield to primo. I wonder if your log file would be of use to Marcel Martin in case he might be interested in extending the capabilities of the program.
philmoore is offline   Reply With Quote
Old 2013-01-17, 22:10   #358
Puzzle-Peter
 
Puzzle-Peter's Avatar
 
Jun 2009

2×5×67 Posts
Default

Quote:
Originally Posted by philmoore View Post
Thanks for trying this. I had hoped that maybe the next two, 2^73360+10711 and 2^73845+14717, might yield to primo. I wonder if your log file would be of use to Marcel Martin in case he might be interested in extending the capabilities of the program.
So did I hope but Marcel Martin did not sound very interested in making major changes to primo. I am afraid this is the end of that path.
Puzzle-Peter is offline   Reply With Quote
Old 2013-01-17, 22:19   #359
henryzz
Just call me Henry
 
henryzz's Avatar
 
"David"
Sep 2007
Cambridge (GMT/BST)

2×2,861 Posts
Default

Quote:
Originally Posted by Puzzle-Peter View Post
So did I hope but Marcel Martin did not sound very interested in making major changes to primo. I am afraid this is the end of that path.
It might be worth trying 2^73845+14717. You were unlucky with the smaller one that there was nowhere to backtrack to since it was the first iteration. Maybe that will be more lucky.
henryzz is offline   Reply With Quote
Old 2013-01-17, 22:48   #360
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

2×33×132 Posts
Default

...and Peter, you probably already cranked the factoring limits to the top (2^32), right?
_______________

P.S. I started an 8-thread test on 2^73845+14717 (no intent to finish!)
and the .cr file says that it moved on to the 2nd test... but look at that gain! ;-)
[1]
Type=4
Gain=3
Index=1.10120
D=-335755
H/G=96/8:12

Last fiddled with by Batalov on 2013-01-18 at 09:17
Batalov is offline   Reply With Quote
Old 2013-01-18, 17:08   #361
Puzzle-Peter
 
Puzzle-Peter's Avatar
 
Jun 2009

67010 Posts
Default

Quote:
Originally Posted by henryzz View Post
It might be worth trying 2^73845+14717. You were unlucky with the smaller one that there was nowhere to backtrack to since it was the first iteration. Maybe that will be more lucky.
The problem is it might well do several iterations, followed by a lot of backtracking and finally give up. This might easily waste several CPU months, even years and I'm still debating with myself about taking the risk.

Quote:
Originally Posted by Batalov View Post
...and Peter, you probably already cranked the factoring limits to the top (2^32), right?
_______________

P.S. I started an 8-thread test on 2^73845+14717 (no intent to finish!)
and the .cr file says that it moved on to the 2nd test... but look at that gain! ;-)
[1]
Type=4
Gain=3
Index=1.10120
D=-335755
H/G=96/8:12
2^32, yes.

Gain=3 woohoo ;-) I'll have to think about this. I'd love to do some real biggies but the risk of losing lots of time is considerable...

Last fiddled with by Puzzle-Peter on 2013-01-18 at 17:09
Puzzle-Peter is offline   Reply With Quote
Old 2013-01-18, 18:55   #362
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

912610 Posts
Default

Actually, as I now look at the primo GUI window (I didn't have access to the terminal before, so I simply read the .CR file) -- the gain is not just 3 bits. The progress is show as "Test 2 | Bits 73784/73846", so I don't have a good grasp of the semantic of the "Gain" line. But of course the stalling scenario like you described would be impossible to predict just yet.

If it gets to say Test 10, I can forward you the package?

Another way in the old "Luhnization" routine would be to deliberately start from the very beginning many times in parallel, avoiding the paths already taken by other "threads".
Batalov is offline   Reply With Quote
Old 2013-01-18, 19:58   #363
Puzzle-Peter
 
Puzzle-Peter's Avatar
 
Jun 2009

12368 Posts
Default

I kept a close eye on my primo runs and so far the "Gain=" value always equalled the bit difference from one test to the next. I have no idea what to think of your numbers.

OK I see you're trying every trick in the book to get me enticed. Right. You win. Take it to test 10 and I'll take over ;)

EDIT: What does the .cr file say now? There might have been a backtrack. First path gave a gain of 3 bits which means the next step will give up and backtrack rather early (backtracking is dependent from various factors, one of them being the gain that is sacrificed by going back one step), then a better Step1 with a larger gain was found.

Last fiddled with by Puzzle-Peter on 2013-01-18 at 20:03
Puzzle-Peter is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
generalized minimal (probable) primes sweety439 sweety439 35 2019-12-07 08:42
probable largest prime. sudaprime Miscellaneous Math 11 2018-02-05 08:10
Hi, how can I test my probable prime number? mohdosa Information & Answers 22 2014-10-10 11:34
2^9092392+40291 is a probable prime! engracio Five or Bust - The Dual Sierpinski Problem 86 2011-03-31 01:11
Record probable prime found! philmoore Five or Bust - The Dual Sierpinski Problem 18 2009-01-28 19:47

All times are UTC. The time now is 06:05.

Fri Sep 25 06:05:55 UTC 2020 up 15 days, 3:16, 0 users, load averages: 1.15, 1.37, 1.36

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, 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.