I love this stuff. Ok, so I did some quick calculations:
In one of my virtual machines (2.33GHz dedicated CPU) it took 12.6 seconds to loop through and calculate 10,000,000 hashes. Being that there are 16^32 possibilities, it would take the follow amount of time for my wee VM to try all possible hashes on its own: Seconds: 4.29012530041888e+32 Minutes: 7.15020883403146e+30 Hours: 1.19170147233858e+29 Days: 4.96542280141074e+27 Years: 1.36038980860568e+25 Decades: 1.36038980860568e+24 Centuries: 1.36038980860568e+23 Millennia: 1.36038980860568e+22 Assuming that my calculations are correct (I just threw them together, so errors may exist), you would want a few million machines doing the processing and a central distribution point to make sure that work isn't being repeated. With inflation, I wonder how little the US$100 will be worth in 1.36038980860568e+22 ish years? :) Thanks, Nathan http://www.kennedytechnology.com -----Original Message----- From: [email protected] [mailto:[email protected]] On Behalf Of Elliott Kember Sent: Friday, 8 May 2009 6:47 a.m. To: NZ PHP Users Group Subject: [phpug] Some fun with MD5 Hey guys, It's been a while since I've posted on here since I'm living in the UK now, but I thought I'd tell you all about a project I've started. It's the search for the "Kember Identity"; a string which, when MD5 hashed, returns itself - such that md5(x) == x. The project is at http://www.elliottkember.com/kember_identity.html And all the code is at http://github.com/elliottkember/The-Kember-Identity/tree/master I've put US$100 towards the prize pool. I don't really expect anybody to pay - hacking together some perl seems to be easier than paying to enter. The chances of someone finding it are so slim that my money's fairly safe. So best of luck - it might only take a few hundred million years! Thanks, Elliott --~--~---------~--~----~------------~-------~--~----~ NZ PHP Users Group: http://groups.google.com/group/nzphpug To post, send email to [email protected] To unsubscribe, send email to [email protected] -~----------~----~----~----~------~----~------~--~---
