Fanom_hash and Lucky777

Couple of hash-sum functions suitable for internal hash tables. Also they could be used for checksumming if no crypto-strong security required. (ie I believe, it is quite hard to produce collisions if no seed nor hashsum are exposed (in contrast to CRC32 and Murmur3_32), but could be easy otherwise).

fanom_hash

FAst NOn-Multiplicative hash :-)

fanom_hash.h contains fast non-multiplicative function for 64bit processor. It passes whole SMHasher.

It is not "fastest function in a world":

SpookyHash is also non-multiplicative, and it is faster for long strings.
But it uses 12 64bit variable and has huge code.
there is bunch of multiplicative hashes that are faster,
(to be fair, SpookyHash is as fast on long strings).
functions on top of hardware AES and CRC are fastest.
(AES ones: Golang x86_64 assembler function, and falkhash).

But performance of fanom64 is comparable, and it is better than Murmur3_x64 So if you need crossplatform and relatively simple function, which works fast despite of absence of fast multiplication or "hardware permutation" instructions, then this function is suitable for you :-).

fanom_hash32.h contains 32bit variant that produce 32bit output. Its performance 2 times better than murmur3_32, it is better than Murmur3_x32_128, and just slightly slower than Murmur3_x64. So, fanom32 is a good function, if you need fast crossplatform hash function which not relies and 64bit arithmetic.

lucky777

lucky777.h contains simple 32bit hash function with 32bit output. It is not as fast as fanom on long strings, but it is still a bit faster than Murmur3_x32 and passes whole SMHasher. It is much simpler than fanom, and has clean separate functions: lucky777_permute(v, &a, &b) and lucky777_finalize(a, b) so you can easily integrate it for hashing data structure different from strings.

There is lucky777 implementation for PicoLISP: https://bitbucket.org/mihailp/tankfeeder/src/default/hash/lucky777.l