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
Number of items in the filter
p
Probability of false positives, float between 0 and 1 or a number indicating 1-in-p
m
Number of bits in the filter
k
Number of hash functions

n = 10,000, p = 0.001 (1 in 1,000) → m = 143,776 (17.55KB), k = 10