# `Bloom` Filter
![`smart`](BloomFilter_aa_001_20221021.png)
------------------------------------------------------------
Insert:
- Applies multiple hash functions to map the key into multiple locations in a bit vector and sets the bits at these locations to 1.

Check the existence of a given key:
- The key again is hashed to multiple locations. If all of the bits are 1, then the `Bloom` filter reports that the key probably exists.