![]() |
![]() |
#1 |
Oct 2007
Manchester, UK
1,373 Posts |
![]()
I am sure this must have been discussed before with regards to OBD, but I could not find it.
I have just made a post in which I extended the table of trial factor depths found on The Math page of mersenne.org all the way up to billion digit numbers. Here's the post: http://www.mersenneforum.org/showpos...1&postcount=70 I have included the methodology used to attain the numbers and I would appreciate any comments on it's validity. If the numbers do turn out to be correct, then it looks like the OBD candidates need to be trial factored all the way to 87 bits, and currently there are 10 (soon to be 13) exponents at 81 bits. In terms of levels, that's high enough to take the project to level 21.01, which at the minimum would require 22 candidates at 87 bits. |
![]() |
![]() |
![]() |
#2 |
Banned
"Luigi"
Aug 2002
Team Italia
3·1,619 Posts |
![]()
87 bits on one OBD exponent would require at least 4 months of 24/7 activity on a GXT275. I guess it's premature to reach that bit-depth with actual methods...
![]() By the time GIMPS extends 6 times its bounds, I think we'd better check fornew factors than for bit-depth. Luigi Last fiddled with by ET_ on 2010-08-02 at 10:00 |
![]() |
![]() |
![]() |
#3 |
Aug 2006
10111011000112 Posts |
![]() |
![]() |
![]() |
![]() |
#4 | |
Oct 2007
Manchester, UK
25358 Posts |
![]() Quote:
Even so, it's good to know what the ultimate goal is. 87 seems tantalizingly close as the project has several candidates at 81 bits now. We all know of course that 87 bits requires another 63 times the work to reach, but that's not as much of a carrot as saying, "JUST 6 MORE!" What do you mean by this? |
|
![]() |
![]() |
![]() |
#5 | ||
Banned
"Luigi"
Aug 2002
Team Italia
113718 Posts |
![]() Quote:
![]() But I don't recommend following my example! The problem here is that, even using MORE_CLASSES, each class from 86 to 87 bits would last more than 3,5 hours, and interrupting the search to use the (otherwise unusable) computer would waste approximately 2 hours of calculations. Quote:
![]() ![]() In 4 months' work we could bring 63 exponents to 80/81 bits... Luigi |
||
![]() |
![]() |
![]() |
#6 | |
A Sunny Moo
Aug 2007
USA (GMT-5)
3×2,083 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#7 | |
Banned
"Luigi"
Aug 2002
Team Italia
3×1,619 Posts |
![]() Quote:
![]() Luigi |
|
![]() |
![]() |
![]() |
#8 |
Oct 2007
Manchester, UK
137310 Posts |
![]() |
![]() |
![]() |
![]() |
#9 |
Aug 2006
5,987 Posts |
![]() |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
How many bits does/did the server trial factor to? | Jayder | Information & Answers | 6 | 2015-01-25 03:29 |
Specifing TF factor depth in "Manual Assignments"? | kracker | PrimeNet | 2 | 2012-07-22 17:49 |
Current Factor Depth | JHagerson | Lone Mersenne Hunters | 60 | 2007-06-17 22:35 |
P95 Trial Factor speeds 40M vs 100M | harlee | Software | 3 | 2006-10-15 04:38 |
Shortest time to complete a 2^67 trial factor (no factor) | dsouza123 | Software | 12 | 2003-08-21 18:38 |