Bloom Filter

Build a probabilistic set: k hash functions over a bit array give O(1) membership tests with zero false negatives and a tunable false-positive rate. Add fill metrics, unions, and the false-positive formula.