←back to thread

140 points subset | 1 comments | | HN request time: 0.205s | source
Show context
j-pb ◴[] No.44374203[source]
The fun part is when you take that approximation and apply it to 2^n.

If you have n bits, your collision probability is 0.5 at generating 2^(n/2) values.

Or put differently: a 128bit uuid gives you a "good enough" 64bit distributed autoincrement.

replies(1): >>44374416 #
1. bravesoul2 ◴[] No.44374416[source]
Good rule of thumb there