Next | Hash Hash Hash | 29 |

David Albert wanted to hear about the big secret here.

Happily, I can disclose it in *one* slide!

Suppose the array has

*N*slots and the key is*K*Seed a PRNG with

*K*(pseudo-random number generator)Extract a random number

*R**I*=*R*mod*N*

Theorem:

If you don't know what the keys will be…

a random array index gives the best possible performance

Next | 29 |