Hash Function Optimisation

[georgwiese]

Examine if changing a Hash Function could make any difference.

Expected time commitment - 1 day.

Priority: Low
Impact: Medium

[georgwiese]

The hash function is used in the Bloom filter to test for set membership, and a bad hash function would lead to false positives which in turn leads to wrong predictions. So, a simple way to test whether a change to the hash function could bring any improvement would be to use one is that guaranteed not to have any collision (e.g. the identity function), or replace the bloom filter with an explicit set.