chickadee
»
bloom-filter
»
optimum-k
Identifier search
optimum-k
N
M
procedure
Optimal count of hashes for the given population size
N
and
M
bits of discrimination.