Bloom Filter Tradeoff (with Optimal k)

Bloom Filter Stats

Hash Functions (k): - Bits/Element (m/n): - Optimal k (for this m/n): - Bit Density (1s): - False Positive (p): -

Density = Percentage of bits set to 1.
Red = High Error (Saturated).
Green = Low Error (Sparse).