Fast hash function. Suitable for file and large data hashing (checksums).
Fast hash function Fast-Hash [3] 32 or 64 bits xorshift operations SpookyHash 32, 64, or 128 bits see Jenkins hash function: CityHash [4] 32, 64, 128, or 256 bits FarmHash [5] 32, 64 or 128 bits MetroHash [6] 64 or 128 bits numeric hash (nhash) [7] variable division/modulo xxHash [8] 32, 64 or 128 bits product/rotation t1ha (Fast Positive Hash) [9] 64 or 128 bits The answer below does not answer the question as asked, since it does not recommend hash functions. FNV-1a algorithm. If you are willing to relax the See full list on github. There are also fast non-cryptographic hash algorithms such as xxHash capable of reaching a throughput of 31. Suitable for file and large data hashing (checksums). It successfully completes the SMHasher test suite which evaluates collision, dispersion and randomness qualities of hash functions. The FNV1 hash comes in variants that return 32, 64, 128, 256, 512 and 1024 bit hashes. Function's . h file implements a very fast 64-bit hash function, mainly designed for hash-table, hash-map, and bloom-filter uses; produces identical hashes on both big- and little-endian systems. com And then it turned into making sure that the hash functions were sufficiently random. Code is highly portable, and hashes are identical on all platforms (little / big endian). 5 GB/s per core, sometimes faster than memcpy, but due to the high risk of collision, the possibility of finding a message m2 such that hash(m2) == hash(m1), they should be used in a few, very precise cases and will not be studied here. The komihash() function available in the komihash. " (Wikipedia) The answer below recommends transformations that do not guarantee fixed-size results. Remember, "A hash function is any function that can be used to map data of arbitrary size to fixed-size values. xxHash is an Extremely fast Hash algorithm, running at RAM speed limits. The FNV-1a algorithm is: hash = FNV_offset_basis for each octetOfData to be hashed hash = hash xor octetOfData hash = hash * FNV_prime return hash xxHash - Extremely fast hash algorithm. wvqxdctsaqyltvimqtbhxsslgnqmxwcifcmsgjdksdsenrmlh