
A Bloom filter trades absolute precision for spatial efficiency by mapping elements through multiple hash functions into a shared bit array. Because the resulting bits inevitably overlap, the structure can definitively prove that an item has never been seen, but can only probabilistically guess that it might have been. False positives are tolerated; false negatives are impossible. The absence is the only certainty.