I had looked at Bloom and Cuckoo, but it turns out that even tho B is more compact, C is much better given concurrency requirements, since it stores its filter in one a bucket, not bits all over the header.
I modified the Cuckoo design to store the filter in the hashmap bucket, and avoided a secondary kick of the filter in the case where it is populated, as given this amount of space and the Poisson nature of the hash functions, the simpler approach if much more efficient.