Hyperloglog, Probability, Hash Function, Cardinality Estimation, Dynamic Programming.
trailing zeros, let the expected number of hashes be E. Then If we see an event with K trailing zeros, then we add the term 1*p, else if we do not see this event, then we repeat again, thus if we do not see K trailing zeros, then the number of trials is 1+E. Solving for E, we get: Thus the expected