XXH3, world's fastest hash algorithm, has reached stable status

Note to readers: This is a non-crypto hash algorithm. It's not meant to be cryptographically secure, but collision is rare enough for databases and similar applications, and is really fast. A real crypto hash like SipHash or BLAKE is already considered lightning fast (1-3 GB/s) in crypto applications, but XXH is faster than a RAM sequential read (30+ GB/s).

If you’re interested in diving deeper, the SMhasher benchmark suite tests a much more exhaustive list of hash functions (including wyhash) - <a href="https:&#x2F;&#x2F;github.com&#x2F;rurban&#x2F;smhasher" rel="nofollow">https:&#x2F;&#x2F;github.com&#x2F;rurban&#x2F;smhasher</a><p><a href="https:&#x2F;&#x2F;www.strchr.com&#x2F;hash_functions" rel="nofollow">https:&#x2F;&#x2F;www.strchr.com&#x2F;hash_functions</a> Is also a great write up of how some of the classic hashing algorithms perform of various data sets.<p><a href="https:&#x2F;&#x2F;nullprogram.com&#x2F;blog&#x2F;2018&#x2F;07&#x2F;31&#x2F;" rel="nofollow">https:&#x2F;&#x2F;nullprogram.com&#x2F;blog&#x2F;2018&#x2F;07&#x2F;31&#x2F;</a> is an interesting approach on generating hashing functions automatically.

So if you are confused like me how someone came up with an algorithm faster than anything else currently available: This is from the mastermind behind the lz4 and zstd compression.

Noob question: how do they even measure performance faster than RAM sequential read?

faster than RAM sequential read...<p>i wonder if anything above sse2 would offer even more performance improvements?

I wonder how it compares to AES-NI. Technically that&#x27;s not a hash, but it can be abused to be, and due to the hardware support the bandwidth is pretty good.