Computing & Software
Bloom Filter Bit Budget & Hash Count Calculator
Size a classic Bloom filter for an expected item count and a target approximate false-positive probability.
How the calculation works
Ideal filter size = -items*log(false_positive)/log(2)**2 bits. Whole bytes rounded up = ceil(-items*log(false_positive)/log(2)**2/8) bytes. Continuous optimal hash count = -log(false_positive)/log(2) hashes. Hash count rounded upward = ceil(-log(false_positive)/log(2)) hashes.
Worked example
Example inputs — Expected inserted distinct items: 1000; Target false-positive probability: 0.01. Expected results — Ideal filter size: 9585.058377 bits; Whole bytes rounded up: 1199 bytes; Continuous optimal hash count: 6.64385619 hashes; Hash count rounded upward: 7 hashes.
Assumptions and limits
Analytical software/hardware scenario, not a benchmark or a live provider quote. Use the actual architecture, workload and billing definitions; overheads not named in the model are excluded. Classical independent uniform hashing approximation, no deletions and the expected final item count. Integer hash count and byte rounding alter the actual achieved rate.
Reference and further reading
Read the underlying subject reference. Calculith is an independent implementation; the reference does not endorse or certify this tool.
Related calculators
- Password Entropy & Brute-Force Time Estimate
- CPU Instruction Count & CPI Runtime Calculator
- Amdahl & Gustafson Parallel Speedup Calculator
- Roofline Arithmetic Intensity Performance Calculator
- Memory Bus Theoretical Bandwidth Calculator
Example values are editable. Results are estimates where assumptions apply. Calculations run in your browser. Updated 2026-11-16.