SpookyHash is significantly faster than lookup3.

In 2011 Jenkins released a new 128-bit hash function called SpookyHash. Note, though, that any speed improvement from the use of this hash is only likely to be useful for large keys, and that the increased complexity may also have speed consequences such as preventing an optimizing compiler from inlining the hash function. It may be appropriate when speed is more important than simplicity. The lookup3 function consumes input in 12 byte (96 bit) chunks. The program that solved the game of kalah used the Jenkins hash function, instead of the Zobrist hashing technique more commonly used for this type of problem the reasons for this choice were the speed of Jenkins' function on the small representations of kalah boards, as well as the fact that the basic rule of kalah can radically alter the board, negating the benefit of Zobrist's incremental computation of hash functions.The resulting system, however, was shown to still be sensitive to hash flooding attacks, even when the Jenkins hash is randomized using a secret key. The Netfilter firewall component of Linux, where it replaced an earlier hash function that was too sensitive to collisions.They study lookup2 and a simple extension of it that produces 96-bit rather than 32-bit hash values. In a paper about this program, researchers Dillinger and Manolios note that lookup2 is 'a popular choice among implementers of hash tables and Bloom filters'. the SPIN model checker, for probabilistic error detection.Applications of this hash function are found in: Dobbs journal article, though it has been obsoleted by subsequent functions that Jenkins has released. It is the function referred to as 'My Hash' in the 1997 Dr. The lookup2 function was an interim successor to one-at-a-time. Standard implementations of the Perl programming language prior to version 5.28 included Jenkins's one-at-a-time hash or a hardened variant of it, which was used by default. Only a few bits in the last byte of the input key are weakly mixed to a minority of bits in the output hash. Colors are chosen by how well the input key bit affects the given output hash bit: a green square indicates good mixing behavior, a yellow square weak mixing behavior, and red would indicate no mixing. The avalanche behavior of this hash is shown on the right.Įach of the 24 rows corresponds to a single bit in the 3-byte input key, and each of the 32 columns corresponds to a bit in the output hash. Avalanche behavior of Jenkins One-at-a-time hash over 3-byte keys

Hashtab x64