Distributed.net CSC Success 131
dbaker let us know that distributed.net has finished another one, half an hour ago as I write this. IIRC, they had to redo part of the keyspace, right? Looks like it didn't slow the project down too much.
Why??? (Score:1)
Re:realloc(); (Score:1)
Distributed Projects (Score:1)
Re:Odd statistic? (Score:1)
ya.. but the strange thing is that the key is found with over 98% of the keyspace done. there is only 2% chance that the key is over 98%.
Re:any good? (Score:1)
What else? GetRight, CodeWright, ICQ, SecureCRT. I never seem to have any problems unless I load up too big a page. Then Netscape crashes horribly and takes down all my Netscape windows. Doesn't matter how much swap I have available, Netscape seems to ignore it. Looks like it needs real actual RAM. Go figure.
My other machine runs X/Netscape and has similar problems. Usually 500+ comment slash pages in flat mode do it every time.
Re:your head is in your ass. (Score:1)
The point I was trying to make was that for the signal to reach us you need to waste an awful lot of energy on transmitting that carrier. Get rid of it and you can use the energy more wisely, thus reaching farther.
Dcypher.Net Calculates Safer Nuclear Storage (Score:1)
Nugget's .plan (Score:1)
I just though I'd repost Nugget's .plan [finger] for clarification on the team issue n' stuff.
Re:Mac OS client (Score:1)
Hi. I'm speaking here as a representative of the Mac coding team for distributed.net.
You're basically right on MacCSC. We're not wonderfully happy with its performance, but it does get the job done. The coders were extremely busy getting the Mac client to exist, and by the time it was stable and usable, CSC was almost over - G4 core optimization would have been next to futile. (Don't interpret me as making excuses; just explaining.)
RC5 performance, on the other hand, is mind-numbingly cool.
The lagging on 68k machines is due to timing issues; they're on the shor t list of Stuff To Fix [distributed.net].
We agree wholehartedly with the philosophy of release early, release often and adhere to it wherever possible. (I'm actually building a new client for seeding to our beta testers in the background as I write this.)
You aren't rambling offtopic at all - after all, this is slashdot. :) Pleased to hear the comments; rest assured we're working on fixing everything you mention. Feel free to contact me at any time (I'm also vetere@distributed.net [mailto]) for any reason.
Re:any good? (Score:1)
Re:what about... (Score:1)
Here's the stats:
http://www.distributed.net/statistics/ [distributed.net]
and...
http://www.distributed.net/statistics/ [distributed.net]
Scroll down a bit to get to RC-5.
Re:Our...lets...we? (Score:1)
Not to mention theoretical...
Re:Odd statistic? (Score:1)
ARRGGGHHH!!! NO NO NO NO!!!!
There is exactly the same chance of finding the key in the last two percent as there is in the first two percent, the middle two percent or whatever. Your statement that there is only 2% chance of the key being over 98% is meaningless - there's only a 2% chance of the key being within any 2% range of keys.
Re:Odd statistic? (Score:1)
S/he said that it was "strange". There's nothing at all strange about it being in the last two percent. It'd be equally strange for it to be in any other two percent of the keyspace.
If you're talking about the pure chance of it being found in the last two percent, then, yes, the probability of that happening is...two percent. But that tells you nothing new; you already knew that when the search covered 98% of the key space without finding the answer. What do you find so "strange" about this result?
No, not Seti@Home but how about Mersenne primes? (Score:1)
First of all, I think that Distributed.net is valuable and don't want people to jump ship. But if you're searching for another project, then check out the Great Internet Mersenne Prime Search [entropia.com]. The project has already succeeded in finding many primes and is counting at about 1000 gigaflops. There is software [entropia.com] for Linux, Freebsd, OS/2, Mac and Windows. And as a nice carrot, there's also a $100,000.00 contest [entropia.com] for the next research discovery of a 10 million digit prime.
OTOH, I really think that Seti@Home is a waste of time and energy. It sure sounds sexy to search for E.T. but the probability of finding something is really next to nothing.
Don't forget... (Score:1)
Re:realloc(); (Score:1)
pi (was Re:realloc();) (Score:1)
For example, there could be a point in pi that after which the number 7 would never appear again.
Or it might end up looking like 1.1.1.1.1.1.1 where all the
Re:Distributed Projects (Score:1)
Symmetric or Asymmetric key length? (Score:1)
There's a difference between symmetric key length and asymmetric key length. For example, 64 bits in RC5 seems pretty damn uncrackable, but 64 bits in an asymmetric cipher (ElGamal, or RSA) is near useless.
By the way, is there already a public cipher algorithm that uses keys longer than 256 bits (twofish and some others)? Not counting RC4, which has basically infinite maximum key length, with restrictions IIRC.
Announcing STI@SETI@HOME (Score:1)
Gain useful insights. Win valuable prizes. Socialize with staffers.
Power - offtopic (was:I misread the title) (Score:1)
The point is, that, whilst the computer is turned on, a lot of power is consumed anyway, and the increase used by calculating something is insignificant compared to the Cooling Fan power being consumed (just how *noisy* are they?). You want to conserve power, then don't use a computer. Booting on and off all day doesn't help, as the transient power load at boot time is quite significant.
Deja Moo: The Feeling You've Heard This Bull Before
Re:any good? (Score:1)
SDSC Super computer test (Score:1)
Re:Maybe it's a flakey idea but... (Score:1)
Re:any good? (Score:1)
-------
CAIMLAS
wrong (Score:1)
-------
CAIMLAS
Re:wrong (Score:1)
BTW, I like your sig.
-------
CAIMLAS
Re:could thay have got it weeks ago? (Score:1)
typo (Score:1)
Re:any good? (Score:1)
Quick, serious answer: Because what we've got going on this rock is plenty enough interesting to stick around for.
Works for me, at any rate.
Never read Contact? (Score:1)
--Spoiler for the book--
Essentially the beings at the end of the wormhole express ride had discovered the true Bible, aka word of the creator. While the scientists were there visiting the core the beings pointed them to where the works were recorded, inside transcendental numbers.
When they got back she set her supercomputers to use the SETI pattern recognition routines on Pi. After a few billion digits or so the computers found something.
Re:In Haiku (Score:1)
people are writing haikus
i do not know why
this is not my sig
it is another haiku
i am leaving, bye
Re:could thay have got it weeks ago? (Score:1)
So much for your logic...
could thay have got it weeks ago? (Score:1)
Press Release? WHERE? (Score:1)
This makes me wonder what else may be hiding in their html directory.
Re:Odd statistic? (Score:1)
Now, if they do several challenges, and need to check >90% every time, that would be strange.
Moderate this down (-1, You Took Your Probability Classes More Than 10 Years Ago)
--
Re:In Haiku (Score:1)
with chicken salsa and cheese
gonna get the poops
Re:any good? (Score:1)
I'm not saying seti@home is a bad project, but waaaay too many people are running it. cycles are getting wasted...cycles that could be used on d.net (and if you're real lucky, maybe you could make yourself some money)
your head is in your ass. (Score:1)
Have you even read seti's plans? Obviously not.
What exactly are you searching for with Set@Home when you have absolutely no idea what the signal will look like.
Actually they have a damned good idea what it will look like, a narrow peak. These are not known to occur in nature, but any technology using the radio spectrum for communication will cause these.
Even presuming that somewhere out in the galaxy there is a planet that is noisier that ours, the chances of finding it while scanning across the infinite number of directions in the sky you can point a reciever is next to nil.
Um... they arn't scanning randomly, they are targeting specific regions of space that are most similar to ours, hence a higher chance a similar planet could exist.
Re:Wait a minute... (Score:1)
Just using a uk provider.
Ah, back to rc5. (Score:1)
Ah, well.. all puters are back to rc5 now
he's in the US, not on a team. (Score:1)
Re:Press Release? WHERE? (Score:1)
Good job everybody! (Score:1)
Re:could thay have got it weeks ago? (Score:1)
If the key was in the data from before the part that had to be redone, then we would have never gotten to the part that had to be redone becuase we would have already one adn stopped the project.
Logic man, logic...
Re:wrong (Score:1)
You're probably right. It's been a while since Physics 201/202. :) Thanks for the clarification!
Linux. Because a computer is a terrible thing to waste.
Re:any good? (Score:1)
The point here is that if I don't believe in ET, I'm not going to use my cpu cycles to look for him. If I know that the box over there in the corner is empty, I'm not going to go and look in the box just to make sure.
I believe strongly enough that there *isn't* extra terrestrial intelligence that I wouldn't feel productive looking for it. Saying that I don't belive in ET is simply my reasoning for not being involved in seti@home.
Jeremy
Re:your head is in your ass. (Score:1)
yes, and we would expect another civ. trying to communicate to use exactly those methods. If they're trying to communicate, they won't be making themselves difficult to detect...
--
Re:any good? (Score:1)
Umm, that's not a logical statement. If you don't want to looks for aliens that's fine.It's simply your choice.
But saying you don't believe in them has no correlation to whether or not they are actually out there. They might exist regardless of what you believe.
Re:any good? (Score:1)
Well, it's not illogical to assume that a civilization that wanted to be found would continue to transmit using radio signals (for reasons that are obvious to us anyway). Plus there's the chance we'll pick up random radio signals just like we've been sending for the last 70+ years.
Incidentally, there are also projects searching for those very laser-light signals you mention, as well.
Re:any good? (Score:1)
I hear ya (Score:1)
Re:Distributed Projects (Score:1)
Re:realloc(); (Score:1)
... and a distributed implementation of it is currently computing the quadrillionth bit of Pi at http://www.cecm.sfu.ca/projects/pihex/
Re:I misread the title, but it gave me an idea any (Score:1)
Huh? Places encryption technologies under intense scrutinies?
Surely all distributed.net does is brute force attack whatever is thrown at it by virtue of having an immense amount of computing power available to it worldwide. AFAIK it doesn't do cryptanalysis of the encryption algorithm used or place the algorithm under intense mathmatical scrutiny of any kind.
Re:Maybe it's a flakey idea but... (Score:1)
what about... (Score:1)
Re:any good? (Score:1)
"I can imagine a world without war, without hate. Then I can imagine us attacking that world, because they'd never expect it." -- Jack Handey
CS-Cipher is secure? (Score:1)
a.that the only possible attack against CS-Cipher is exhaustive key search (brute force attack).
b.the extreme robustness of CS-Cipher.
(http://www.cie-signaux.fr/security/challeng.ht
Anybody with any crypto clue will be able to tell you it shows neither. I think it's really sad that distributed.net wasted its time on this marketing crap.
Mac OS client (Score:2)
But that's all done now. The rc5 client is fine. It even supports AltiVec - makes me wish I had a G4!
Hmm, I guess this is kind of off-topic rambling. Oops. I'll stop now.
Lame Encryption Challenges (Score:2)
I'm finding encryption challenges progressively lamer. What are we supposed do be doing? Besides trying to win money with chances which rival that of your average US state lottery, I think we're trying to prove that the encryption that the government wants to restrict us to is weak. The DES projects have proved this - for single pass 56-bit DES keys, the code can be broken quickly if you have a huge amount of cracking power available to you. The CSC project has proved that it's a little harder right now but it can be done. The RC5 project (which is pretty useless at this point), has already proved that if you're using RC5 encryption with a 64-bit key length, for the moment, you're safe unless you're paranoid about strange people with phenomenal amounts of cracking power. Is this what we want to prove? that 64-bit keys are good enough? I was under the impression we wanted free access to 128-512-bit keys for everyone.
The one thing which still interests me is the use of these contests as a way to chart CPU power over time. The RC5 project is currently about 17.5% complete, after 815 days - but look at how much faster the second 1% went compared to the first 1%. This is (among other things) Moore's law in action. The one thing that disappoints me about the CSC project is that there never got to be a AltiVec (Velocity Engine) enabled version for powerpc G4s. The RC5 client now has a AltiVec version and it's about a 4x speed improvement. That's impressive.
I think projects like GIMPS and OGR are far more useful and worthwhile. I don't like SETI because of the especially closed method of the project and the rather arrogant idea that looking for something, which may or may not be there, in a way that may or may not find it, while we may or may not understand what we're doing, is useful.
I will continue to crack RC5 blocks until something better comes along.
Re:your head is in your ass. (Score:2)
That's only true using the most simple transmission methods. Enter spread-spectrum or any of the carrierless transmissions and you lose that peak.
Re:any good? (Score:2)
Um... wouldn't a laser signal have to be pointed directly at the intended target? Yes I know all about divergence and all those great things but looking for laser communications perhaps not intended for us seems rather silly.
Chalk up another win for Distributed Computing! (Score:2)
Congrats to the guys at Distributed.net, the guy who submitted the winning key, and his team (if he was on a team).
Now we can get back to that darn RC5-64 contest.
I really wanna see what some of these new systems hitting the market will do (1Ghz Kryotech Athlon system?).
Anyone else built a big-arsed cluster to work on this yet?
Somebody sneak a client on a disk into the Fermi-Lab cluster! =)
Chas - The one, the only.
THANK GOD!!!
Re:Chalk up another win for Distributed Computing! (Score:2)
True, but think about it. We're not talking JUST one machine here. Every couple months, the Distributed.net distributed machine gets more powerful.
Partially due to more machines being added.
Partially due to some of those machines being faster than their predecessors.
And partially because some of those machines are being upgraded and getting faster.
Notice that it took about 18 months to get to the 10% mark in RC5-64. Now, less than eight months later, we're pushing close to the 18% mark.
True, that's probably not of any interest to anyone but a stat freak, but hey. Stat freaks are people too! I'm living proof (at least from the neck down, from the neck up, I'm not so sure about). =)
Also note that we've succeeded in finishing two other projects as well (A DES contest and the now-completed CSC contest). We've also participated in another DES contest that was won by an entity outside the Distributed.net machine.
Chas - The one, the only.
THANK GOD!!!
Re:realloc(); (Score:2)
SETI@home v2 should be released soon. I hope anyone who feels as you do would give it another chance - they've redone a lot of useful stuff in the software...
My SETI(@home) pages and club info. [geocities.com]
Re:your head is in your ass. (Score:2)
I have about 55 computers in my sphere of influence. 20-something are running D.net's new client. About 5 are running S@h. The others are portables and are running nothing, or a CPU cooler. There's room for everything...
Re:My take on the whole idle cycles thing (Score:2)
Check in a week or so.
Re:any good? (Score:2)
This is serious. I mean, if I thought for one second that all we (and the universe) had to look forward to for the rest of eternity was the human race spreading like a virus, I'd kill myself. The hope that we'll meet something fundamentally different from ourselves, some time, keeps me going. (The hope that it will be in my lifetime, keeps me productive ;)
Re:any good? (Score:2)
Re:Stop fighting! (Score:2)
Re:any good? (Score:2)
Hey, I wouldn't mind getting my name on the list of people who've discovered Mersenne primes, especially since it includes people like Euler.
Money! if nothing else. (Score:2)
Re:any good? (Score:2)
There are other project coming, such as the OGR [distributed.net] project. It has nothing to do with encryption.
My take on the whole idle cycles thing (Score:2)
Finding keys: The only reasons are fame and money. Do they find anything? Yes, at highly predictable times (hence making the actual finding a trivial matter).
Finding extra-terrestrial life: Fame, money(?), one of the greatest scientific and philisophical questions in history answered. Do they find anything? Nope, and they aren't likely to anytime soon for various reasons.
So you can either have useless+sucess or useful+failure.
Someone mentioned a future distributed.net project that was not key cracking and actually had reason for existance. When i am not so tired, I will look into this, but it really looks like the way to go.
Incedentally, I run two copies of Prime95 and the Seti screensaver on a 4 hour delay. Draw conclusions about my personality from that
Re:Money! if nothing else. (Score:2)
If someone is doing it for the money, it would be more profitable for someone to do it alone rather than with distributed.net. Granted, it probably isn't a good idea to do it just for the money since, although I haven't done the math, you are probably going to use up more than 10,000 Euros worth of electricity before cracking it.
Re:realloc(); (Score:2)
And what good would it do to give more CPU resources to SETI@Home at this point? Triple- and quadruple-checking their limited data doesn't seem very efficient to me.
A distributed calculation of pi would be cool, but are there any algorithms to find digits of pi without having calculated the previous digits? If not, it can't be distributed.
--
Re:I misread the title, but it gave me an idea any (Score:2)
CSS is laughablly weak.
Brute Force vs Reverse Engineering (Score:2)
Actually, I think the main issue is that by breaking CSS this way we can redistribute DeCSS with all the keys without facing a reverse engineering charge.
Jay
I was only off by one! (Score:2)
_________________________
Re:any good? (Score:2)
We could also run Prime95 [mersenne.org] but I would rather discover how easy (or hard) it is to crack encryption than waste my cpu cycles looking for a bigger prime number.
So, given the choice between looking for something in an empty box, or finding the next big prime number (which does, um, nothing for number theory) we choose to crack codes, which might prove useful (primarily in discovering what kind of computing power is necessary to do it).
Jeremy
Re:any good? (Score:2)
Re:any good? (Score:2)
Stop fighting! (Score:2)
Why can't everyone stop fighting over which project to support and show enthusiasm for cosmo. Once it has wide spread use much more work could be completed. Each new problem would not require a whole new client. People could easily work on SETI when they have unchecked data and look for large primes, or fit circles into boxes the rest of the time. Currentlt each project requires a seperate download.
Re:My take on the whole idle cycles thing (Score:2)
Re:realloc(); (Score:2)
Try http://www.seanet.com/~ksbrown/kmath313.htm
In Haiku (Score:2)
Cracked Code wins challenge
Winner did use Solaris
and I think, 'So what?'
Re:any good? (Score:3)
They've also released newer versions of the client which do some more checking on older data.
Um, no they haven't released newer versions. According to press releases they were going to release the new version (2.0) sometime last week, but it never showed up and nobody on the project ever said anything about it. The fundemental lack of respect or responses (which this is only one example of) from the team running seti@home is the reason I don't donate my time to it anymore.
realloc(); (Score:3)
Lets reallocate all this power to productive uses.
#include <signal.h> \ #include <stdlib.h> \ int main(void){signal(ABRT,SIGIGN);while(1){abort(-1)
Re:I misread the title, but it gave me an idea any (Score:3)
The issue at hand is not that CSS is "simple" to break. The issue is, should a CSS case be brought up in court by the Big Bad Lawyers, what would happen?
It is understood be the technical community that CSS encryption is pretty much useless as a copy protection scheme. But how can this be proven to a jury? Expecially when $500-$1000 per hour lawyers are employed by the adversary?
distributed.net is a known and proven source for ranking the status of encryption. They are not a malicous orgainization, but rather a testbed, placing an encryption technology under intense scrutiny and forcing it to prove it's worth. Where CSS (or its relacement) placed under such scrutiny, the results may be enough to have future lawsuits thrown out of court. (and therefore lessening the slashdot posts/comments on this subject... no offense, but it is getting kind of old. There is very little new information on the subject left)
"You want to kiss the sky? Better learn how to kneel." - U2
Maybe it's a flakey idea but... (Score:3)
Here's what I mean:
The client would be written to actually accept algorithms via the internet and then accept the data to be crunched.
Why?:
Lots of people working on lots of computers and lots of power intense applications (I'm thinking along the lines of academic research, but this could be applied within corporations, too).
Premis: Those CPUs, some big some small, are not all busy all the time. With this client out there, those spare cycles could be used by others within the CPU-sharing-organization.
Example: All the computers in the Math department. Or, on a larger scale, several universities could coop thier super computers.
Sorry, I've just been drinking too much coffee, too late in the day...
I misread the title, but it gave me an idea anyway (Score:3)
For the on-topic part:
I think it's good that distributed.net's accomplished another goal. Just showing people what the community is capable of is an end unto itself. An earlier poster commented that they believed it was a waste of CPU cycles, but the whole idea behind such an effort, if I'm remembering correctly, was that those CPU cycles would have been unused anyway. Might as well show off with them
For my idea, which the on-topic stuff spawned:
I'm not a lawyer, so I don't know about the legality of this. What if distributed.net were to host a challenge where people could use their cycles to crack the other keys on CSS, for DVD-playing? Granted, it wouldn't be a very long challenge, as CSS is fairly simple, but it would be a nice, big statement about how the community in general feels toward the recent actions of the MPAA and DVD consortium. Probably not legal at all. Still, it would be a fun thing to do.
D.net != useless waste of cpu time (Score:3)
Useless? What is your CPU going to be doing otherwise? I've found that it hardly interferes with anything on my NT box, and the Linux server which HAS to be up and operational for those occasional logins is not doing anything besides using up precious Kinetic energy. Might as well be doing something.
Linux . Because a computer is a terrible thing to waste.
Distributed.net - Because CPU time IS BEING wasted.
redoing keys did slow the project down! (Score:3)
It might look like it didn't slow the project down too much, but a clear-headed person would not be fooled.
Oh, look, I just flipped a coin and it came out heads. Obviously, this coin doesn't come out tails too much, does it! Wanna bet me?
Re:any good? (Score:3)
Re:realloc(); (Score:3)
>but are there any algorithms to find digits of
>pi without having calculated the previous
>digits? If not, it can't be distributed.
Yes, such algorithms exist. The Bailey-Borwein-Plouffe algorithm can compute an arbitrary digit of pi in almost linear time.
http://members.wri.com/victor/articles/pi/pi.html provides more information than one could possibly want on this topic.
Re:any good? (Score:3)
Just kidding; I understand what you mean, but I do disagree with you. SETI is a program with a noble objective, however, it is fundementally flawed, both in implementation and premise.
Implementation: checking work units multiple times (ie. many more than would be required to detect cheater clients) because of distribution/data collection inefficiencies does not neccesary seem very productive to me
Premise: Yes, it is almost certainly true that there are extraterrestial beings somewhere "out there." Nonetheless, there are two main obstacles that make it exceedingly unlikely that we will ever find anything: space and time. Space is pretty obvious; it's a big universe out there and radio signals, if any, will take a long time to propagate. Time is the big one: the probability that another civilization is at the same technological stage as us such that they use radio to communicate in astoundingly low. Just imagine: 200 hundred years ago, a mere drop in the bucket in geologic time, we could not even receive radio signals. 200 hundred years from now, whose to say that we won't be using fiber optics and laser relays to transmit information. Two cultures that are at different levels of technological accomplishment can rarely communicate or interact: look at the much smaller separation in time between the Europeans and Native Americans and the disconnect that occur then.
Seriously, I hope that they do find something. It would represent a milestone in human history that will force us to reconsider our perspective in the vast scheme of things. But I just don't think it's going to happen.
Re:any good? (Score:3)
Thanks, everyone! (Score:5)
I'd like to again thank everyone for their support throughout this project. distributed.net is nothing without the amazing user support that we receive.
For the record, we received official confirmation and congratulations from CS Communications & Systems on our CS-Cipher solution.
For those that missed it:
Contest: CS-CIPHER
Solution: 61 A3 9E 36 BF 4F F0
The secret message is: CS-Cipher a ete presente en mars 97 a Fast Software Encryption (PARIS). Congratulations to the winner!
Moo!
-dbaker
--
Daniel Baker - dbaker@cuckoo.com - dbaker@distributed.net