Secure Hashing Algorithm (SHA) -256 is the hash function and mining algorithm of the Bitcoin protocol that outputs a 256 bits long value. It moderates the creation and management of addresses, and is also used for transaction verification.

Blake2s is a cryptographic hash function which is optimized for smaller architectures such as 8 to 32 bit platforms. The main advantage of Blake2s is that it is simpler, secure and faster and due to these features there are some mining advantages to it.

X11 is a hashing algorithm much complex than Bitcoin’s SHA-256 and it works by combining 11 different hashing algorithms: Blake, BMW, Groestl, JH, Keccak, Skein, Luffa, Cubehash, Shavite, Simd, Echo.

Based on sponge construction, Eaglesong is a hash algorithm that requires a huge number of operations like modular addition, cyclic rotation and Exclusive-OR (XOR) to generate the 256-bit hash data.

Equihash is an asymmetric memory-oriented proof-of-work mining algorithm that is based on a computer science and cryptography concept known as the generalized birthday problem. It permits the miners to mine the crypto with the help of standard PC.

Scrypt is a password-based key derivation function specifically designed to hinder large-scale custom hardware attacks by requiring large amounts of memory. Scrypt offers high level of security and is one of the safest hash functions out there.

Handshake is based on two algorithms: Blake2B and SHA3. Blake2b is a fast and secure hash function optimized for 64-bit platforms. SHA-3 is a cryptographic function used for authentication, encryption and pseudo-random number generation.

Ethash is a Proof of Work hashing algorithm created specifically for and by Ethereum. It is an updated version of the Dagger-Hashimoto algorithm. Ethash was designed to require more memory, making it Application-Specific Integrated Circuit mining resistant.

KHeavyHash is a modified form of the “optical-miner” ready HeavyHash algorithm. The KHeavyHash procedure involves matrix multiplication positioned between a pair of conventional Keccak hashes, commonly known as SHA-3.

Cuckatoo32 is a variation of Cuckoo Cycle meant to be ASIC-friendly. Cuckoo Cycle is the first graph-theoretic proof-of-work, and the most memory bound, yet with instant verification and is immune from quantum speedup by Grover's search algorithm.