Module hash 

Double hashing for bloom filters.

Bloom filters need k independent hash functions to set k bit positions per element. Rather than computing k separate cryptographic hashes, double hashing generates k positions from just two hash values without any loss to asymptotic false positive rate. Kirsch-Mitzenmacher 2006

This hasher takes a single SipHash-1-3 call to produce one 64-bit hash, which is split into h1 and h2 components. Subsequent positions use enhanced double hashing with rotation. fastbloom

Structs

DoubleHasher

Double hasher for bloom filter position generation.

Functions

check_bit

set_bit