![]() |
|
|
#12 | |
|
A Sunny Moo
Aug 2007
USA (GMT-5)
11000011010012 Posts |
Quote:
And, of course, as you were saying, if people want a smaller range, they can just say so, or pull it out of the larger file manually.Max
|
|
|
|
|
|
|
#13 |
|
Apprentice Crank
Mar 2006
1C616 Posts |
I know this might sound greedy, but could I reserve 980K-1M? I want to beat my personal record for largest prime found, which is currently a bit over 275 thousand digits long.
I'm pretty sure that I'll finish the range before this NPLB drive gets there, but if I don't, I'll release the range and post all results found so far. Last fiddled with by MooooMoo on 2008-12-27 at 04:54 |
|
|
|
|
|
#14 | |
|
May 2007
Kansas; USA
33×5×7×11 Posts |
Quote:
Sorry we didn't respond earlier... Max and I had a PM discussion about this and I did a fair amount of thinking about it myself. This would be far too big of a range for us to hand out to a single person at such a high n-range, even if that person was Beyond or Lennart who could likely process it in a few weeks. We would, of course, allow them to reserve a large range but it would have to be at or near the leading edge of our servers and they'd have to guarantee that they could finish it in a few weeks so it wasn't "left behind" for too long. ![]() I'm not personally fond of huge gaps in testing k's. But I realize that everyone has different goals and tastes when it comes to DC and to prime searching so am willing to accomodate those differences. I am also keenly aware that neither NPLB nor anyone or entity owns any part of the math world, which includes the search for prime numbers. Therefore, I'll offer something similar to something that Carlos and I had talked about a little bit previously and that Max brought up independently of that to me in our PM discussion: Consider doing an n=980K-1M search on a small # of k's in the individual-k drive. Here is what I'd suggest: We're going to start a mini-drive on 5 k's of that drive sometime in Jan. They are the 5 lowest remaining unreserved k's that are divisible by 3, that is: 321, 327, 333, 339, and 345. Give those k's a shot to start with. Since all are divisible by 3, they are relatively heavy-weight. You didn't say how many cores you could put on the effort. My perception is that 5 higher-weight k's at such a high n-range should keep a full quad busy for at least a week, perhaps even a month. I haven't done enough searching at that level to remember testing times nor have I done exact calculations on the # of candidates for those k's in those ranges. If you like that idea, we'll only search n=600K-980K with our mini-drive. I like the idea because the gap in the k's will be filled in within a few months. If you want to start with that, please post your reservation in that drive and I'll send you the files. If you'd like to continue after you are done, you can do some more k's in that drive for the same n-range. We'd prefer if you only took pieces that you can complete in 3-6 months at a time so after those 5 k's, you could do 5 more there or even do the same k's for n=960K-980K if our mini-drive hasn't reached that point. That said: We don't want people to get too much in the habit of searching ranges backwards so please limit the "reverse" reservations as much as possible; likely just one reverse reservation per k like I described here. Note to all: I don't want to set a bad prescident here. We're OK with this because it's a range right at the top of our drives. If people start wanting to reserve n=800K-850K or 700K-725K right in the middle of our drives, I/we won't be too fond of that until the drives get there. If people want the very top of our files to search, then let's stick with the individual-k drive and reserve ranges for n=950K or higher thru 1M. Gary Last fiddled with by gd_barnes on 2008-12-29 at 08:01 |
|
|
|
|
|
|
#15 | |
|
Apprentice Crank
Mar 2006
2×227 Posts |
Quote:
Since you thought that it was too big of a range to be handed to a single person, could I take the smaller range of n=999K - 1M then? Once that's done, then I'll move to n=998K - 999K, and so on until I find a prime or until this drive gets there. Anyway, I'll probably put only 2 cores on the effort. What little (compared to some people here) computing power I have is going to be stretched thin - one is on k=313, the other is on k=173, and I'll be putting my two remaining cores on this near n=1M effort. |
|
|
|
|
|
|
#16 | |
|
May 2007
Kansas; USA
101000100110112 Posts |
Quote:
I figured that was why you wanted the big range: To have a good chance at a prime. That's why I suggested doing the 5 individual-drive k's, then another 5 k's, etc. No, I'd prefer not on these big drives. It's more than size of the reservation. It will simply take us too long to fill in the gaps. Can you imagine Karsten having to show n=999K-1M on 300 k's in addition to the current search limit? That's a big part of the issue. It's better to do fewer k's for larger n-ranges. How about this: Do the 5 individual k's that I suggested, but do them for n=960K-1M instead on the 1st pass. You wouldn't have to do such a small piece as n=980K-1M. After you're done, whether you have a prime or not, you can do another 5 k's for n=960K-1M. I haven't calculated the odds but off the top of my head, I can say that would likely give you a 80-90%+ chance at a prime, especially if all of the k's are heavier-than-average weight. If you still don't have a prime, you can try another 5 k's if available or do n=920K-960K on the k's you've already done. I can virtually guarantee there should still be plenty of k's available after you're done with the first 5 k's. But just in case, keep an eye on that drive. Personally, I'm not all that fond of high-n searches and I'll likely keep 2-3 average to above-average weight k's there reserved at all times. I wouldn't have any problem letting you take n=960K-1M for the k's that I reserve in the future. Doing it this way makes it far more easy for Karsten to maintain his pages, still gives you a virtual lock on finding the prime that you want, and leaves gaps in k's that it won't take us too long to fill in. Everyone wins! ![]() One other benefit to doing k=300-400 vs. k=800-1001. The testing time's may be shorter because the k's are smaller. I haven't checked where the fftlen changes are but that possibility does exist here. Gary Last fiddled with by gd_barnes on 2008-12-30 at 01:53 |
|
|
|
|
|
|
#17 | |
|
May 2008
Wilmington, DE
22·23·31 Posts |
Quote:
|
|
|
|
|
|
|
#18 | |
|
May 2007
Kansas; USA
101000100110112 Posts |
Quote:
OK, shall do. That's why I was suggesting he do them 5 k's at a time. I think there will be enough high-n ranges to go around for everyone. |
|
|
|
|
|
|
#19 | |
|
Apprentice Crank
Mar 2006
45410 Posts |
Quote:
|
|
|
|
|
|
|
#20 | |
|
May 2007
Kansas; USA
33·5·7·11 Posts |
Quote:
OK. That works. Can you give me an ETA? Use this for estimating: Look at the # of candidates in each of the 5 k's in the individual-k drive and multiply each by 1/5th (since 80K/400K = 20%). Then run a test on your machine at n=975K and use that as an average test time. The higher-than average n-range test accounts for a possible fftlen change. 6 months or less is preferred for any reservation as suggested in that drive. If it's a little over, it's no big deal. We'll likely look to complete the mini-drive in about that time frame, perhaps a little longer. I think the bottom line here is: I'm pretty confident that you can find an n=920K-1M prime in < 6 months on 2 cores (assuming >= 2 Ghz) so I'm guessing that you'll be in good shape with that reservation. After you calculate an estimate, I'll send you the files. Ian, the 5 k's that I'm recommending are what we're going to put in a mini-drive so they won't take from other individual k's that are still available. I think this is a good solution for all involved. Also, it will shorten the mini-drive quite a bit, which won't bother me at all. lol Gary |
|
|
|
|
|
|
#21 |
|
Apprentice Crank
Mar 2006
2×227 Posts |
|
|
|
|
|
|
#22 |
|
May 2007
Kansas; USA
242338 Posts |
Better load 'er up Max.
![]() With Ian on here full-time, n=10K is fine. |
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Team drive #14: k=600-1001 n=1M-2M | mdettweiler | No Prime Left Behind | 10 | 2021-03-13 22:32 |
| Team drive #6 k=600-800 n=600K-1M | gd_barnes | No Prime Left Behind | 89 | 2011-03-10 12:34 |
| Team drive #5: k=400-600 n=600K-1M | gd_barnes | No Prime Left Behind | 135 | 2010-11-23 14:27 |
| Team drive #1: k=400-1001 n=333.2K-600K | gd_barnes | No Prime Left Behind | 675 | 2009-02-24 16:37 |
| Team drive #4, 15 k's < 300 for n=600K-1M | gd_barnes | No Prime Left Behind | 38 | 2008-10-22 16:20 |