Theoremcore
Optimal number of Bloom filter hash functions
Also called optimal k for Bloom filters.
The false positive rate is minimized at k = (m/n) ln 2 hash functions for m bits and n items.
The false positive rate is minimized at k = (m/n) ln 2 hash functions for m bits and n items.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag HQ75X7 Edit this page History Report an error