![]() |
![]() |
#573 |
Random Account
Aug 2009
U.S.A.
111000101012 Posts |
![]()
I understand. I see the first post here was in 2004 and things have really come a long way since. Have you abandoned the project?
|
![]() |
![]() |
![]() |
#574 | |
Banned
"Luigi"
Aug 2002
Team Italia
2·3·17·47 Posts |
![]() Quote:
![]() Nobody, down in 2004, could think that such big numbers could be tested for primality, we only used it to test our skills on software. The project was never officially closed, but we decided to stop (at least for a while) when GPUs completed the actual range, as their power could be better used for GIMPS. Nevertheless, the results of OBD (and of its sister project for100M Digits held by Uncwilly) were transferred to GIMPS archives (both .org and .ca) for future reference. |
|
![]() |
![]() |
![]() |
#575 |
Jun 2003
The Computer
22×97 Posts |
![]()
I might add that I started this project way back when and others like William and Luigi assisted. It became dormant as the higher bits necessitated more computing power, but you're welcome to contribute if you like. My thought is that it should go from its current state (Level 19.06) to Level 20 and then convert to k values, similar to double Mersennes. That way, work units could be more "bite sized" and not take several weeks on a GPU.
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
The "one billion minus 999,994,000" digits prime number | a1call | Miscellaneous Math | 179 | 2015-11-12 14:59 |
Ten Billion Digits Mersenne Numbers | aketilander | Operation Billion Digits | 13 | 2013-02-03 21:15 |
Operation Megabit Twin | Oddball | Twin Prime Search | 370 | 2013-01-03 21:26 |
modulo operation for polynomials? | smslca | Math | 3 | 2011-04-18 17:18 |
question range 1 billion to 2 billion? | Unregistered | Information & Answers | 7 | 2010-08-12 06:25 |