From mboxrd@z Thu Jan  1 00:00:00 1970
Message-ID: <80982f1d5df0177187aa8827df5680cf@vitanuova.com>
To: 9fans@cse.psu.edu
Subject: Re: [9fans] compare-by-hash
From: rog@vitanuova.com
In-Reply-To: <Pine.SUN.3.90.1030731132027.10772A-100000@magnum.cooper.edu>
MIME-Version: 1.0
Content-Type: text/plain; charset="US-ASCII"
Content-Transfer-Encoding: 7bit
Date: Thu, 31 Jul 2003 18:53:27 +0100
Topicbox-Message-UUID: 0d093ee0-eacc-11e9-9e20-41e7f4b1d025

> A 160-bit hash (assuming "strong" hashing) has a 50% probabilty of
> collisions after 2^80 entries. Google "birthday paradox" for the math.

2^80 is fairly high... after how many entries does the probability
reach, say, 0.1%?