Hacker News Reader

You don't actually have to do this - you can stick with a power of 2 sized table and just gently mix the hash value to get each additional bit index.

(source - I wrote MurmurHash/SMHasher and have used the above in my own bloom filters and cuckoo hash tables)

View on HN

The one hashing scheme should be technically better.

That said, I suspect you could avoid the coprime partitions and the issues they cause with semi-correlated permutations over block partitions and avoid hash collisions in the process.

Something like this? 64-bit hash, 9 bits to address all the bits in a 64-byte cache line, so 7 hash functions addressing the bits in a cache line can be extracted from a 64-bit hash?

yeah. You also don't need complete independence. You can use partially overlapping bits to get semi-independent hashes.

Reply on news.ycombinator.com