Cuckoo Filter Visualizer

Each item has a compact fingerprint f of a few bits. Two candidate buckets: i₁ = h(x) & (m − 1) and i₂ = i₁ ⊕ h(f). Note i₁ = i₂ ⊕ h(f), so from either bucket you can find the other without knowing x — that's what makes eviction and deletion work. This XOR trick only preserves the round-trip when m is a power of two, which is why the picker snaps to one.
On insert, try either candidate bucket. If both are full, evict a random occupant, put ours there, then try to relocate the evicted fingerprint to its alternate bucket. Repeat up to MaxKicks; if that fails, the filter is effectively full.
Lookup checks the two candidate buckets for the fingerprint. Delete removes one matching fingerprint from one of them — a Bloom filter can't do that.
False-positive rate is bounded by roughly 2b/2ᶠ — bigger fingerprints or fewer slots-per-bucket = fewer false positives. Practical load factor before insert failure hovers around 95 % at b = 4.