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 ...
Bloom Filter A Bloom filter is a space-efficient probabilistic data structure used to test whether an element is a member of a set. For example, checking the availability of a username is a set ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback