3 ms·
Just to correct you: the probability is _much_ bigger than (N-1)/2^32. See the birthday problem: http://en.wikipedia.org/wiki/Birthday_problem http://en.wikipe
by maxs 15y ago
Just to correct you: the probability is _much_ bigger than (N-1)/2^32.
See the birthday problem: http://en.wikipedia.org/wiki/Birthday_problem http://en.wikipedia.org/wiki/Birthday_problem
- weaksauce 15y agoThe search space of the object name is a sha1 and is 40 characters long and not 32 bits so it's quite a bit larger than the op was talking about(it's actually 160bits). see: http://book.git-scm.com/1_the_git_object_model.html http://book.git-scm.com/1_the_git_object_model.html