Cryptographic hash uniquness (was [Haskell-cafe] Simple network
magnus at therning.org
Thu Jan 31 13:13:39 EST 2008
On 1/31/08, Peter Verswyvelen <bf3 at telenet.be> 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).
> That's interesting. When I developed a version control system for a
> customer, I also used a cryptographic hash as the database key of
> file+content in question, but I was afraid I might have clashes (two 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 is
> just intuition... What does computer science tell us about this?
Tongue firmly in cheek...
Well, if you would turn to software engineering you would probably find that
"never ever, happens sooner than you think" ;-)
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the Haskell-Cafe