It stores usernames in a compact bit array. It uses multiple hash functions to map each username to several bit positions. It can answer membership queries with two possible outcomes: "definitely not ...

This project is a Python implementation of a Bloom Filter, a probabilistic data structure used to efficiently test whether an item may exist in a collection. The Bloom filter in this project uses ...