Foundation.Hashing

Type with the ability to be hashed

Hashable doesn't have any specific rules, and it's made for raw speed. More specifically don't expect different type representing the same data to hash to the same value

hashMix (1 :: Integer) /= hashMix (1 :: Word8)

True

Incremental Hashing state. Represent an hashing algorithm

the base primitive of this class is hashMix8, append mix a Word8 in the state

The class allow to define faster mixing function that works on bigger Word size and any unboxed array of any PrimType elements

FNV1 32 bit state

FNV1 64 bit state

FNV1a 32 bit state

FNV1a 64 bit state

Sip State 1-3 (1 compression rounds, 3 digest rounds)

Sip State 2-4 (2 compression rounds, 4 digest rounds)