1fb98189____Rusty_Russell_s_Coding_Blog__Name
[Num Bits] Any [Benefits] Avoids lookups on hash collisions: each bit halves number of lookups. May avoid hash recalculation when pushing entries down into subtable. [Name] 
Extra Hash Bits
S u b t a b l e B i t
E x t r a H a s h B i t s
H a s h T r u n c a t e d B i t
H o m e B u c k e t
I n H o m e B u c k e t
S h a r e d B u c k e t
D e l e t e d B i t
C o l l i s i o n B i t
Back To Cacheline Tree Hash Tables - Rusty Russell's Coding Blog
Name