This is a Python implementation of a Bloom filter with a configurable false positive rate. It uses SHA-256 with salting to simulate multiple hash functions and automatically optimizes the filter size ...
The goal of this repository is not just to implement a Bloom Filter, but to understand why it exists, what problem it solves, how it works internally, what trade-offs it introduces, and when it should ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results