Get the latest tech news
Breaking CityHash64, MurmurHash2/3, wyhash, and more
... Hash functions are incredibly neat mathematical objects.
The ideal hash function would choose an output completely at random for each input, remembering that choice for future calls. Unlike regular hash functions, being slow is actually a safety feature here to protect against brute forcing passwords. In fact, MurmurHash64A is so weak that Jean-Philippe Aumasson, Daniel J. Bernstein and Martin Boßlet published an attack that creates sets of strings which collide regardless of the random seed used.
Or read this on Hacker News