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 -- To unsubscribe from this list: send the line "unsubscribe git" in the body of a message to majordomo@xxxxxxxxxxxxxxx More majordomo info at http://vger.kernel.org/majordomo-info.html