MD4 is a Message Digest Algorithm developed by Ronald L. Rivest from RSA Data Security, Inc. Currently it's considered insecure, but it's very fast on 32-bit mashines and it's used for calculating EDonkey 2000 hashes in the EDonkey p2p network. MD4 algorithm is described in RFC 1320. Hash length is 32 hexadecimal digits.
MD5 is another Message Digest Algorith developed by Ronald L. Rivest from RSA Data Security, Inc. It's an improved version of MD4. The algorithm is described in RFC 1321. It was an Internet Standart for years, but now it's considered broken. Hash length is 32 hexadecimal digits.
SHA1 (Secure Hash Algorithm 1) is a Hash Function designed by NSA in 1993. It's described in RFC 3174. It's approximately two-three times slower then MD5 algorithm. Hash length is 40 hexadecimal digits.
EDonkey 2000 is one of the fastest hash functions. It is based on deprecated MD4 algorithm and is used in the EDonkey p2p network. See EDonkey network article for details. Hash length is 32 hexadecimal digits.
AICH (Advanced Intelligent Corruption Handler) is a hash used in EDonkey p2p-network and usually included in EDonkey-links. It is calculated in a bynary-tree form using SHA1 algorithm, see description. The hash is a base32 encoded string of 32 alphanumeric symbols.
Tiger is a modern Hash Function developed by Ross Anderson and Eli Biham. It's designed to be fast on 64-bit processors. See Description. Hash length is 48 hexadecimal digits.
TTH (Tiger Tree Hash) is used in several P2P networks such as Direct Connect and Gnutella. TTH is a calculated in a tree-form algorithm based on Tiger hash, see description. The hash is a base32 encoded string consisting of 39 alphanumeric symbols.