In the earlier post, I wrote about non-crypto hash functions, and did some performance exams. Seems, it’s nice to jot down about stuff! Folks at the feedback/twitter/internets pointed out extra things I should check. So here’s a observe-up publish. That is about algorithms for "hashing some amount of bytes", for use both in hashtables or for checksum / uniqueness detection. Depending in your state of affairs, there’s a whole family of algorithms for that, and I'm specializing in only one: non-cryptographic fast hash capabilities. This post just isn't about cryptographic hashes. Do not read under if you have to hash passwords, sensitive data going by means of untrusted medium and so forth. Use SHA-1, SHA-2, BLAKE2 and pals. Also, I’m not specializing in algorithms that are designed to stop attainable hashtable Denial-of-Service attacks. If one thing comes from the other aspect of the web and ends up inserted into your hashtable, then to stop possible worst-case O(N) hashtable behavior you’re most likely off by using a hash operate that doesn't have known "hash flooding" assaults.