In this project, we are implementing a hashfilter which works like a bloomfilter for membership testing, while providing better space efficiency.

The hashfilter is based upon a 2-4 cuckoo hashing scheme (meaning 2 candidate positions per key and 4 keys per bucket), which allows us to utilize 93% occupancy of the table.

Also an interesting golomb encoding is applied in each bucket to further reduce the overhead.