A Bloom filter sets multiple bit positions for each inserted item. At lookup, any zero bit proves the item is absent.
All-one bits do not prove presence because other items may have set them. False positives become more likely as the filter fills, while ordinary insertion and lookup do not produce false negatives.
When to use
Use it to cheaply reject absent keys before querying a large store.