Documentation

Hash160(x) = RipEmd160(SHA256(x))

Note: the Show and Ord instances treat them as big-endian integers!

It seems that the most compact representation is unpacked machine words (ForeignPtr has too much overhead even with mallocPlainForeignPtr).

In memory representation: Hash160 w1 w2 w3 means that the w1 represent the first 8 bytes, in little-endian representation, then w2 the second 8 bytes, finally w3 the last 4 bytes. This way, the big-endian comparison can be done fast (first compare w3, if equal compare w2, if that is also equal compare w1)

Hash256(x) = SHA256(SHA256(x))

Note: the Show and Ord instances treat them as big-endian integers!

It seems that the most compact representation is unpacked machine words (ForeignPtr has too much overhead even with mallocPlainForeignPtr).

SHA256(SHA256(x))

RIPEMD160(SHA256(x))

The zero ripemd hash (not really used for anything)

Generation (or "coinbase") transactions have hash set to zero

Creates a 256 bit hash from a big-endian hex string (may fail with exception). This is here primarily for convenience.

Creates a 160 bit hash from a big-endian hex string (may fail with exception). This is here primarily for convenience.