Home

Awesome

Meow hash 0.5/calico

This is the official x64 implementation of the Meow hash, a fast hash taking 128 bytes of seed and producing 128 bits of output. It is designed to be faster than currently available hashes in the "non-cryptographic" category. See https://mollyrocket.com/meowhash for usage, implementation, and analysis details.

This version is v0.5 and is a proposal for the final hash construction. Please provide as much testing, analysis, and commentary on the hash function as you can. If we cannot substantially improve the hash function from here, this construction will be used for v1.0.

This version builds on Windows/MSVC, Windows/CLANG, and Linux/CLANG, with support for x64 AES-NI processors.

Important Security Notice

Due to recent discoveries by Peter Schmidt-Nielsen, we have decided to reclassify Meow hash 0.5/calico from level 3 to level 1. This means that we recommend not to use this hash for message authentication codes, or for hash tables in scenarios where collision induced denial-of-service attacks are a concern.

We have seen no evidence that the hash is unfit for non-adversarial/non-cryptographic purposes, and continue to believe that it is amongst the best in this regard.

For level 3/MAC capabilities consider migrating to SipHash. Do not migrate to any hash not advertising MAC capabilities as these are almost certainly much weaker than Meow 0.5. If the performance of SipHash is not satisfying, continuing to use Meow 0.5 for hash tables is better than migrating to another fast hash. While Meow 0.5 also continue to provide some useful strength for message authentication codes, we have to stress that we strongly recommend migration in this case.

Unofficial Ports

We do not maintain or vet these ports in any way. Their correctness and performance may differ from the official Meow Hash. They may also have different, more restrictive licenses than Meow Hash itself. Use at your own risk.

If you have ported Meow Hash to another language, and would like to link to your repository here, please open an issue an include the information and link.