UUID is 124 bits. The collision probability (via the birthday paradox) is 50% after roughly enumerating sqrt(2*2^124) elements. [1] Since sqrt(x) = x^1/2 you ca

UUID is 124 bits. The collision probability (via the birthday paradox) is 50% after roughly enumerating sqrt(2*2^124) elements. [1] Since sqrt(x) = x^1/2 you can say that a n bit hash/id has a collision probability of 50% after enumerating 2^((n+1)/2) elements. 2^n/2 is just the extra handwavey version of that. 1: https://stackoverflow.com/questions/62664761/probability-of-hash-collision https://stackoverflow.com/questions/62664761/probability-of-...