Bloom filter calculator
m = ceil((n * log(p)) / log(1.0 / (pow(2.0, log(2.0)))));
k = round(log(2.0) * m / n);

- n
**N**umber of items in the filter
- p
**P**robability of false positives, float between 0 and 1 or a number indicating 1-in-p
- m
- Nu
**m**ber of bits in the filter
- k
- Number of hash functions

n = 1,000,000,000, p = 1.0E-20 (1 in 100,000,000,000,000,000,000) → m = 95,850,583,774 (11.16GB), k = 66

n

p