Documentation

"Less Hashing, Same Performance: Building a Better Bloom Filter" by
Kirsch and Mitzenmacher demonstrated that for many use-cases, especially
involving Bloom filters, we can use pairwise independent hashes to
generate a family of related hash functions with good characteristics.