Bloom Filter Calculator

Updated: Sep 16, 2018

Calculate the required bloom filter size and optimal number of hashes from the expected number of items in the collection and acceptable false-positive rate.

You can also see the breakdown of how the bloom filter size and optimal number of hashes are calculated.

Optimal Size (m):
Optimal size (number of elements in the bit array)
Optimal Hash Functions (k):
Optimal number of hash functions
Bloom Filter is a space-efficient probabilistic data structure which is used to test whether an element is a member of a set or not. We may get false positive matches, but false negatives are not.


Sep 16, 2018
Calculation formula breakdown
Apr 25, 2018
Tool Launched

Created: Apr 25, 2018
Online Tool Designed For: Windows, OS X, Android, iOS, Linux