Bloom Filter

2024-10-29

The false positive probability p as a function of number of elements n in the filter and the filter size m. An optimal number of hash functions k = (m / n) ln 2 has been assumed.

Reference:

Bloom filterWikipedia

Bloom Filter | Brilliant Math & Science Wikibrilliantorg