Bloom filters are a very useful probabilistic data structure which helps you check very quickly and with a constant memory footprint whether, with 100% confidence, something does not belong to a set or with high confidence whether it does. This blog explains how to build them and how they work.