Hyperloglog, Probability, Hash Function, Cardinality Estimation, Dynamic Programming.
the Murmur3 family of hash functions, then the 32 bit hash of the string “Hello world” is: hsh = mmh3.hash("Hello world", 42, signed=False) & ((1 << 32)-1) print(bin(hsh)) 0b10010000010010111101110011111100 We can see that the number of trailing zeros is 2. Let X be the event that we saw K trailing