probability

Let’s imagine we have a truly random hash function that hashes from strings to n-bit numbers. This means that there are 2n possible hash codes, and each string’s hash code is chosen uniformly at random from all of those possibilities. The birthday paradox specifically says that once you’ve seen roughly √(2k) items, there’s a 50% chance … Read more