Photo by Jake Givens on Unsplash

xxHash … Fast, Fast, Fast

For hashing, we take some data and create a hashed value of the data. It should then not be possible to reverse it back. In some applications, such as with Hashtables and Bloom filters, we often do not need the complexity of the cryptography methods (such as MD5, SHA-1 and SHA-256), and need methods that are fast and efficient. These point towards the non-cryptography methods, and which can be over a 100 times faster than the cryptography…