Cryptography, Hashing, Learning, Data Structures, Merkle Tree.
detail. The point is that we can expand the definition of what a hash function is, by letting it hash into some arbitrary set A, like this: Again, the way in which this is achieved is irrelevant to us, and we’re mostly concerned about what properties the algorithm has — is it collision resistant?