20060818, 19:27  #1 
"Jason Goatcher"
Mar 2005
110110110011_{2} Posts 
Project where the goal is to get the highest Prime Pages score.
I already suggested this at my team's forum, nobody was interested, so I'm coming here, hoping for a better response.
I guess the closest this project comes to any other project would be the 15k project, which I guess could be opened up again if you guys like my idea. I would like to be in a project, and possibly on a team, where the goal is to get the highest Prime Pages score possible. I've been told that, for LLR, using k's from 1 to 31 doesn't slow it down a great deal, so we'd focus on the k's that haven't been scanned a lot yet. I know I'm not much of a cheerleader and this post is about as dry as weekold toast, but if any of you, even specific teams other than FreeDC, which I've been loyal to for about a year and a half, would be interested in this project, please post. I'm not looking to be a leader for this possible project, I just want to be on a team that wants to get a high Prime Pages score. Anyone? 
20060818, 23:42  #2 
Sep 2002
Database er0rr
2×5×467 Posts 
http://primes.utm.edu/bios/top20.php show three categories for "the highest sore" :
The ProverAccount Top 20 Persons by: number score normalized score Programs by: number score normalized score Projects by: number score normalized score By score you are going to find it extremely hard to beat GIMPS it's 7080 thousand computers So I guses you mean by "number of primes". This is a hard task because you find smaller primes quickly but those primes will be falling out of the top5000 as the tide rises. Reisel Prime Search or PIES is your best bet for "by number of primes" records. Small k as in "k*2^n1" are quicker to number crunch  all relative densities taken into account. The 321 project uses 3 which is quiet dense, ie, lots of candidates (5.75% left after sieving optimally) but with hopefully a greater density of primes. But even so it is quite hard to find them. Maybe you should do a couple of 321 files for the project. You will have to have patience because a single core at 3GHz+ will take ten days. If you find a prime it will be 13th largest in the world ( until it is beaten...). Okay it's not #1. But 321 to GIMPS is as pygmy is to a giant. Last fiddled with by paulunderwood on 20060818 at 23:43 
20060819, 01:09  #3 
"Jason Goatcher"
Mar 2005
3·7·167 Posts 
Actually, Mr. Underwood(because of Internet anonymity, I'd rather be too respectful than not respectful enough) I'm not exactly trying to beat GIMPS in terms of score. But it would be nice to have, say, 50 computers on my now imaginary project, and have them do better than GIMPS after size is factored in.
Actually, I haven't studied the issue. There may already be plenty of projects doing better than GIMPS relative to size. I'll look into 321. thanks 
20060821, 08:53  #4 
May 2005
11001011100_{2} Posts 
Why not join RPS project then? We already have two megabit primes and "the third RPS drive" concentrates on several lowweight k's and will take them till n=2000000. You may also try going with some lowweight k on your own, some people have reached n=4000000 with their ks
As far as score is concerned RPS is ranked 8th (321 is 9th so far) 
20060822, 21:04  #5 
"Jason Goatcher"
Mar 2005
6663_{8} Posts 
I'll check it out. At the moment, though, I have two ranges from base5 sieving with about 60 hours left on each of them. You might see me in a couple of days.

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Highest Prime is also a twin prime... NOT  hydeer  Lone Mersenne Hunters  9  20180403 22:54 
Prime Pages How to's  PawnProver44  Information & Answers  29  20160315 05:43 
What's up with the Prime Pages?  Unregistered  Information & Answers  1  20070609 02:44 
Requesting SWAG on what's most likely to score me a Mersenne Prime.  jasong  jasong  1  20070129 21:25 
How do I determine the xthhighest prime on prime pages?  jasong  Data  7  20050913 20:41 