Learned the hard way about how the Birthday Paradox is relevant to bit-depth of hashing algorithms.
If storing in a hash map, once you have √(2 ^ bit-depth) elements, there is 50% probability of a key collision. So for 32-bit hash, that's 65,536 elements (even tho 32-bit uint has >4 billion values)
12 days ago
