Algorithm 1 Insert $(x)$

$f=\mathrm{fingerprint}(x)$; $i_1=H_4(x)$; $i_2=i_1\oplus H_4(x)$; If bucket $[i_1]$ or bucket $[i_2]$ has an empty entry then add f to that bucket; return Done; i = randomly pick $i_1$ or $i_2$; For $n=0$; $n<\mathrm{MaxMumKicks}$; $n++$ do randomly select an entry e from bucket $[i]$; swap f and fingerprint stored in entry e; $i=i\oplus H_4(f)$; If bucket $[i]$ has an empty entry then add f to bucket $[i]$; return done; return False.