so it turns out that knuth hash is the same as not hashing at all. Because the input is a random number from a fixed range, and I'm getting the hash index by masking the lower bits nothing much is going to improve the distribution.
-
-
This one is perfect distribution, take any bits you want, ~1 byte per cycle. You can reduce the number of aesdecs if you want more speed and don't care about slightly more potential collisions (this one needed to _never_ collide).
-
These also overlap, so if you do multiple hashes at the same time, it goes from 1 byte per cycle to 4 bytes per cycle.
- Show replies
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.