This is a very late response ... but I did some calculations as part of some
work I did a while ago:
http://www.ietf.org/rfc/rfc2938.txt
(See appendix A The birthday paradox)
#g
--
Peter Verswyvelen wrote:
winds up having a write cache, which is mutable in practice. The
interesting thing
Graham Klyne wrote:
This is a very late response ... but I did some calculations as part of
some work I did a while ago:
http://www.ietf.org/rfc/rfc2938.txt
(See appendix A The birthday paradox)
#g
A memorable summary of the birthday paradox being :
There is a 50% chance of a collision
Bulat Ziganshin wrote:
Hello Peter,
Thursday, January 31, 2008, 8:01:36 PM, you wrote:
files with different content generating the same hash)... My
intuition told me that the odds of two cryptographic hashes (on
meaningful content) colliding was much less than the earth being
destroyed by an
winds up having a write cache, which is mutable in practice. The
interesting thing is that the block's location is the cryptographic
hash of its contents, which leads to all sorts of neat properties (as
well as requiring immutability).
That's interesting. When I developed a version control
Hello Peter,
Thursday, January 31, 2008, 8:01:36 PM, you wrote:
files with different content generating the same hash)... My
intuition told me that the odds of two cryptographic hashes (on
meaningful content) colliding was much less than the earth being
destroyed by an asteroid... But this
Depending on which hash you use you can get upwards of document
hask keys won't collide before the heat-death of the universe.
There is of course a lot more to it than that. Google around
about hashing, cryptography, and cryptographic hash functions.
There are many good websites that will go
On 1/31/08, Peter Verswyvelen [EMAIL PROTECTED] wrote:
winds up having a write cache, which is mutable in practice. The
interesting thing is that the block's location is the cryptographic
hash of its contents, which leads to all sorts of neat properties (as
well as requiring immutability).
