mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > Conjectures 'R Us

Reply
 
Thread Tools
Old 2013-03-26, 23:18   #1
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

2×33×132 Posts
Default All top 5000 primes will have the same number of digits in 2014 ;-)

I remember the times when 150,000-digit primes were enough to enter...

Now, this 283939-digit prime is only going to stay for a week in the top-5k.
Batalov is offline   Reply With Quote
Old 2013-03-27, 10:24   #2
gd_barnes
 
gd_barnes's Avatar
 
May 2007
Kansas; USA

27F216 Posts
Default

When I started in prime searching in 2007, the big push was to get all of the annoying base 2 n=333333 (~100k digits) primes knocked out of the top 5000. I personally still find fixed n searches annoying. The n=1000000 and n=1290000 primes clog up the top 5000 and knock off "good" primes. They also skew the long term curves of the rising 5000th place prime.
gd_barnes is offline   Reply With Quote
Old 2013-03-27, 14:42   #3
Puzzle-Peter
 
Puzzle-Peter's Avatar
 
Jun 2009

2·5·67 Posts
Default

Fixed-n is just about the only way to go if you're looking for twins, sophies, triples etc. The candidates grow much too quickly otherwise.
Puzzle-Peter is online now   Reply With Quote
Old 2013-03-27, 15:21   #4
Mini-Geek
Account Deleted
 
Mini-Geek's Avatar
 
"Tim Sorbera"
Aug 2006
San Antonio, TX USA

17×251 Posts
Default

Quote:
Originally Posted by Puzzle-Peter View Post
Fixed-n is just about the only way to go if you're looking for twins, sophies, triples etc. The candidates grow much too quickly otherwise.
You could vary n, you just need to search a large k range. Consider if you were to search n=1.0M-1.1M. You might lose some sieving efficiency from not having one fixed n, but you'd gain some efficiency by being able to search smaller k's. I don't know which effect is larger.
Mini-Geek is offline   Reply With Quote
Old 2013-03-27, 17:27   #5
Puzzle-Peter
 
Puzzle-Peter's Avatar
 
Jun 2009

2×5×67 Posts
Default

Quote:
Originally Posted by Mini-Geek View Post
You could vary n, you just need to search a large k range. Consider if you were to search n=1.0M-1.1M. You might lose some sieving efficiency from not having one fixed n, but you'd gain some efficiency by being able to search smaller k's. I don't know which effect is larger.
Might be worth a try. In fact I have already done this for quad-hunting, without taking timings though. But would a bunch of 1.0M to 1.1M primes be much better than bunch of 1.0M primes? How can primes be "good" or "bad" anyway?
Puzzle-Peter is online now   Reply With Quote
Old 2013-03-28, 04:39   #6
gd_barnes
 
gd_barnes's Avatar
 
May 2007
Kansas; USA

27F216 Posts
Default

Quote:
Originally Posted by Puzzle-Peter View Post
Might be worth a try. In fact I have already done this for quad-hunting, without taking timings though. But would a bunch of 1.0M to 1.1M primes be much better than bunch of 1.0M primes? How can primes be "good" or "bad" anyway?
It would be just as bad. The issue is: Twins and SGs should not be searched for in the top 5000 ranges. It takes too long to find them and ruins the graph of the rising 5000th, 1000, 500th, etc. place primes. IMHO, twins should be searched at n=800K right now.

All of the n=1290000 primes demotivate smaller searchers because the 5000th place prime rises so rapidly. Soon you will need 50+ cores to have a reasonable chance to find a top 5000 prime within a few weeks. The small guy is quickly being phased out. I guess prime searching is a microcosm of the real world.

Last fiddled with by gd_barnes on 2013-03-28 at 04:41
gd_barnes is offline   Reply With Quote
Old 2013-03-28, 14:47   #7
Puzzle-Peter
 
Puzzle-Peter's Avatar
 
Jun 2009

2×5×67 Posts
Default

Thanks Gary, now I understand what's bothering you. It's a difficult question. The large BOINC twin or Sophie projects need a lot of small guys working together but many of these small guys would like to have the chance of getting a single prime into the TOP5000 even if the twin test gives a negative result. I don't think many of them would be hunting primes on their own or in a non-BOINC project as we do here.

The bar is raising, that's for sure. On my hunt for triples and quads I am looking at CPU-centuries when aiming for the top and I even have to worry about proving the numbers prime. I am now in the process of proving a number on which primo failed on the first attempt. Fortunately Marcel Martin told me about an entry in the .ini file that seems to have done the trick although it's not finished yet... is there anybody keeping a list of PRP twins, triples, quads etc that are impossible to prove atm?
Puzzle-Peter is online now   Reply With Quote
Old 2013-03-28, 22:25   #8
MyDogBuster
 
MyDogBuster's Avatar
 
May 2008
Wilmington, DE

54448 Posts
Default

Quote:
I don't think many of them would be hunting primes on their own or in a non-BOINC project as we do here.
It's a shame what has happened to the Top5000. It used to be a nice goal to attain. Now it's just a joke. Kinda takes the fun right out of finding primes.

Maybe we should start our own Top100 (think small) for just NPLB & CRUS.

Last fiddled with by MyDogBuster on 2013-03-28 at 22:34
MyDogBuster is offline   Reply With Quote
Old 2013-03-28, 23:27   #9
kar_bon
 
kar_bon's Avatar
 
Mar 2006
Germany

54428 Posts
Default

The anoying point with PrimeGrid is the fact, that, although there're many participants and so many different prime searches, PG is still unable to make a simple list of primes they've found, like on my pages or like ProthSearch. For search ranges you have to go to their forum, greater primes can be found on the Top5000 page, non Top5000 primes you have to look at their PRPnet resultfiles. Even members seem to have problems, where their found primes go.
I've mentioned this in their forum long long time ago but nothing happend.
PG is more in working with challenges and making points for members in different classes instead of making the results available for others in a handsome manner.
kar_bon is offline   Reply With Quote
Old 2013-03-29, 00:06   #10
MyDogBuster
 
MyDogBuster's Avatar
 
May 2008
Wilmington, DE

22·23·31 Posts
Default

I used to be a BOINCer until I realized how juvenile the points system is. Any single project can distort their awards and make any measurement mute.

It is a real shame that the last thing PRIME Grid wants to do is actually make finding the prime important.

Keep up the good work Karsten. There are people who enjoy your database.

Last fiddled with by MyDogBuster on 2013-03-29 at 00:12
MyDogBuster is offline   Reply With Quote
Old 2013-03-29, 01:29   #11
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

19·313 Posts
Default

Quote:
Originally Posted by MyDogBuster View Post
I used to be a BOINCer until I realized how juvenile the points system is. Any single project can distort their awards and make any measurement mute.
I agree with that. BOINC will punish or reward people based upon their hardware. In other words, if you have a specific hardware feature BOINC can increase or decrease your credit regardless of throughput.
rogue is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Report top-5000 primes here gd_barnes Conjectures 'R Us 870 2020-10-25 07:34
Report top-5000 primes for all k<=1001 gd_barnes No Prime Left Behind 1488 2020-09-25 11:31
S/R Base 5 Primes reported in 2014 Joe O Sierpinski/Riesel Base 5 1 2016-03-14 04:30
Largest k*2^n-1 Primes Found In 2014 Kosmaj Riesel Prime Search 1 2015-01-02 12:14
get all the 5000 biggest primes above 100K digits jasong jasong 1 2007-06-09 22:51

All times are UTC. The time now is 16:22.

Sun Oct 25 16:22:04 UTC 2020 up 45 days, 13:33, 1 user, load averages: 1.78, 1.91, 1.82

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.