Cuckoo Hashing

Why it matters

Cuckoo achieves O(1) worst-case lookup dynamically. Understanding shapes hash choice.

The architecture

Two tables T1, T2 with hash h1, h2.

Insert: place in T1[h1]. If taken, evict old to T2[h2]. Repeat.

How it works end to end

Two hash functions.

Insert may trigger chain of evictions.

Rebuild on cycle.

Cuckoo filter: hash-based alternative to Bloom.