Cryptographic hash uniquness (was [Haskell-cafe] Simple network client)

Bulat Ziganshin bulat.ziganshin at
Thu Jan 31 12:24:17 EST 2008

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 is just intuition... What does
> computer science tell us about this?

you may be interested to know that widely used rsync algorithms relies
on 128-bit hashes and its author speculated about its reliability:

Best regards,
 Bulat                            mailto:Bulat.Ziganshin at

More information about the Haskell-Cafe mailing list