Some people tried this hash and found that it worked rather well. FNV hashes are designed to be fast while maintaining a low collision rate. The FNV speed allows one to quickly hash hashing lots of data while maintaining a reasonable collision rate. The high dispersion of the FNV hashes makes them well suited for hashing nearly identical strings such as URLs, hostnames, filenames, text, IP addresses, etc. FNV hash algorithms and source code have been released into the public domain.
Comments are welcome.
The multiplication is performed modulo 2 n where n is the bit length of hash . The FNV-0 is the historic FNV algorithm. Use of the historic FNV-0 hash is not recommended. The FNV-0 hashes all buffers that contain only 0 octets to a hash value of 0. The FNV-1 does not suffer from this minor problem.