- space efficient look up for fixed number of static elements.
- may have, definitely no have
n: number of elements
k: number of hash functions, k = n*ln2/m
m: number of bits, >= n*lg(1/E)*lge
E: expected probability of false positive
d-left hash bloom filter