Bloom Filter
A Bloom filter is a compact probabilistic set-membership data structure — ~10 bits per element for 1% false positives, zero false negatives. Notes on how it works, the math for picking parameters, where real systems use it (Cassandra, HBase, Chrome, CDNs), and when to reach for counting / cuckoo / quotient variants instead.
