Bloom Filter Visualizer
Insert keys into a Bloom filter bit array, query membership, and watch estimated false-positive rate as the filter fills.
Bloom Filter
Insert keys into a bit array with multiple hashes. Membership queries are fast — and may false-positive as the filter fills.
Estimated false-positive rate ≈ (1 - e-kn/m)k. Never reports false negatives for inserted keys.
Properties
- Never false negative (for keys already added)
- Possible false positives
- Great as a cheap pre-check before disk/DB lookups