Interesting. AFAICT, Cuckoo hashing:<p>0) Cuckoo hashing is much simpler to implement (correctly).<p>1) look up and delete is also O(1), but Cuckoo is faster (especially if you can exploit the inherent parallelism in the two table probes).<p>2) insert for Cuckoo is O(1) amortized.  It&#x27;s unclear how this compares.<p>3) Cuckoo can mix and match insert, delete, lookup ops.<p>4) Cuckoo uses more memory (as the OP is per definition minimal).<p>Someone please correct me if I&#x27;m wrong, but I think Cuckoo looks pretty favorable to this for most usage.  EDIT: formatting.