From: Jeff King <peff@peff.net>
Date: Fri, 11 Mar 2011 05:33:12 GMT
Subject: Re: [PATCH] find_unique_abbrev(): honor caller-supplied "len" better
Message-ID: <20110311053312.GC16605@sigill.intra.peff.net>
In-Reply-To: <20110311052235.GA16605@sigill.intra.peff.net>

On Fri, Mar 11, 2011 at 12:22:35AM -0500, Jeff King wrote:

> This is basically the birthday problem used in hash collision analysis.
> Which means that if we decide on some acceptable probability of
> collision, we can figure out the hash-length required to keep the
> probability of collision below that acceptable level for a repository
> with objects.

Urgh, that was supposed to be "...for a repository with _n_ objects".
But hopefully that became clear as you read on.

-Peff