Hyperloglog, Probability, Hash Function, Cardinality Estimation, Dynamic Programming.
zeros in the binary representation of the hash. The number of possible hashes with trailing K bits as 0 is 2^(N-K) because we can place 0 or 1 in each of the remaining N-K places. Thus the probability that a hash ends with K zeros is : To calculate the expected number of hashes before we see K