Bloom Filter
A tiny probabilistic set that answers “maybe present” or “definitely absent” — no false negatives.
A Bloom filter is a bit array plus k hash functions that tests set membership in far less space than storing the items. It can return false positives but never false negatives, so it guards expensive lookups (databases, crawlers, caches) with a small, tunable error rate.