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 ...
Overview A Bloom Filter is a probabilistic data structure used to test membership, potentially returning false positives but never false negatives. The Age-Partitioned design extends a standard Bloom ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback