Which hash function makes the fastest bloom filter?

Modelling KV data in LSM-trees with Rust