Slashdot Mirror
RC5-72 Clients Available on distributed.net
Yoda2 writes "From the distributed.net site... 'The RC5-72 project is now officially up and running, as of 03-Dec-2002! You will need to download a new client in order to participate. Our FAQ-O-matic has been updated with the beginnings of a new RC5-72 section.' Also, there is a $10,000 prize for the winner, but as with the other RC5 projects, the owner of the computer that finds the key does not get all of the money."
the current stats page doesn't seem to be linked from the main page anywhere... anyway, here's the link.
sig.
RC5-64 took 4 years, and this has a keyspace that's 256 times larger. Even if we assume that computers are 4 times faster now than the average speed at which RC5-64 keys were processed, we're still looking at 256 years to completion. It doesn't seem like it makes any sense to start until computers are at least 20 times faster.
How to solve most of our problems: 1.Lots of nuclear plants. 2.Cure aging.
Team Slashdot was 5th overall for RC5-64... maybe it's time to step it up a notch, except that there is no Slashdot.org team yet. :-/
sig.
Althogh that link does work, RC5-72 stats are not yet available, we're still working some bugs out.
Like this ?
1984 was supposed to be a warning, not an instruction manual.
No, no, use your cycles to crack something real like the TiVo password!
A Golomb ruler is a set of integers (marks) a(1) < ... < a(n) such that all
the differences a(i)-a(j) (i > j) are distinct. Clearly we may assume a(1)=0.
Then a(n) is the length of the Golomb ruler. For a given number of marks, n, we
are interested in finding the shortest Golomb rulers. Such rulers are called
optimal.
ambiguous? in what way? They are merely covering their backs because there are cetain technical difficulties in verification, hence, why OGR-24 is not "completed" even though little work is handed out. Because of the branch search method they are using for the calculations, 2 stubs can be scored with different results! Thus, someone has to mathematically verify that one of them is correct. In this case, d.net is claiming they cannot insure that the current OGR is indeed the most optimized if nothing is being returned saying otherwise.
Why are you doing this? Try that.
actually it ASKS you if you want to help but defaults to off
you can turn it on by clicking the DNA icon on the bar
Ave Molech Setting
You'd be right if the goal were just to find a folded state, but well, it's not :) In this case it's to simulate the actual folding process, matching the models (which they are working on) with experimental results.
- Adam L. Beberg - The Cosm Project - http://www.mithral.com/
yeah guys... drop your other distributed computing projects and go for this one. The other ones will never help people as well as this: http://members.ud.com/download/gold/.