So what is the value of the "proof of universality"? I'm a bit confused as to what the value pitch is when compared to xxhash3, for example, which runs ~twice as fast and has a large user base (it's used when hashing in dotnet now).
From a dev perspective though, it seems very nice. Short and clean code with decent comments. Although I'm struggling to understand what `polymur_hash_poly611` is doing.
You can construct sets of keys that make xxhash collide much more often than average. With provable universal hashing, you know you get a good distribution for all sets of input keys.
From a dev perspective though, it seems very nice. Short and clean code with decent comments. Although I'm struggling to understand what `polymur_hash_poly611` is doing.