List of blockchain mining algorithms

Here I will share my thoughts and notes on reading the paper, and everyone is welcome to discuss it together

Below is a list of blockchain mining algorithms. I will share a few of the papers involved later.

SHA-256

Introduction : SHA stands for Secure Hash Algorithm, and SHA-256 is a member of the SHA-2 cryptographic hash function designed by the NSA. A cryptographic hash function is a mathematical operation performed on digital data, and by comparing the calculated "hash" with a known hash value, one can determine the integrity of the data. A one-way hash can be generated from arbitrary data, but data cannot be generated from a hash. It is used in multiple links in multiple blockchain applications such as Bitcoin.

Paper : Courtois, Nicolas T., Marek Grajek, and Rahul Naik. "Optimizing sha256 in bitcoin mining." International Conference on Cryptography and Security Systems. Springer, Berlin, Heidelberg, 2014.

Applications : Bitcoin (BTC), BitcoinCash (BCH), Peercoin (PPC), Zetacoin (ZET), Universal (UNIT), Deutsche eMark (DEM), AUR-SHA (AUR), DGB-SHA (DGB)

Scrypt

Introduction : Scrypt is a memory-dependent hash algorithm. Interestingly, the algorithm was developed by the famous FreeBSD hacker Colin Percival for his backup service Tarsnap. Memory dependency, as the name implies, will take up a lot of memory space, thereby reducing CPU load. Because its memory-dependent design is particularly suitable for the design of anti-professional mining machines at the time, it has become a major application direction for the development of digital currency algorithms.

Paper : Percival, Colin. "Stronger key derivation via sequential memory-hard functions." Self-published (2009): 1-16.

Applications : Litecoin(LTC), Dogecoin(DOGE), DNotes(NOTE), Florin(FLO), Gulden(NLG), DGB-Scrypt(DGB), GameCredits(GAME), Verge-Scrypt(XVG), Einsteinium(EMC2), AUR-Scrypt(AUR)

X11

Introduction : The purpose of launching the X11 algorithm is the same as that of the Scrypt algorithm used by Litecoin, which is to resist the expansion of ASIC mining machines. X11 uses 11 encryption algorithms (BLAKE, BMW, GROESTL, JH, KECCAK, SKEIN, LUFFA, CUBEHASH, SHAVITE, SIMD, ECHO). The data needs to be calculated by 11 different algorithms, which improves security and increases the amount of calculation.

Paper : Duffield, Evan, and Daniel Diaz. "Dash: A PrivacyCentric CryptoCurrency." (2014).

Applications : Dash (DASH), Prime-XI (PXI), Onix (ONX), Startcoin (START), Creamcoin (CRM), Influxcoin (INFX), MonetaryUnit (MUE), Monoeci (XMCC)

Equihash

Introduction : Equihash is a memory-oriented proof-of-work (PoW) algorithm developed by the Interdisciplinary Center of the University of Luxembourg. The core of the algorithm is based on the generalized birthday problem. I personally am optimistic about this algorithm, which improves the cost-effectiveness of customized hardware (ASIC).

Paper : Biryukov, Alex, and Dmitry Khovratovich. "Equihash: Asymmetric proof-of-work based on the generalized birthday problem." Ledger 2 (2017): 1-30.

Applications : Zcash (ZEC), Zencash (ZEN), BitcoinGold (BTG), Zclassic (ZCL), Hush (HUSH), Komodo (KMD)

Tensority

Introduction: Tensority is a new PoW consensus algorithm first proposed by Bytom, which integrates matrix and tensor calculations into the consensus algorithm process, so that AI acceleration chips can participate in blockchain consensus calculations. The characteristic of the Tensority consensus algorithm is that a lot of matrix generation, matrix transformation, matrix multiplication and other operations are interspersed in the algorithm process, and these capabilities are also frequently used in artificial intelligence acceleration. Similarly, mining machines that support matrix operations can be used as artificial intelligence acceleration services to improve the resource utilization of mining machines.

Paper: Tensority: an ASIC-friendly Proof of Work Algorithm Based on Temsor

Applications: Bytom(BTM), RRChain(RRC)

NeoScrypt

Introduction : NeoScrypt is a next-generation proof-of-work algorithm that replaces Scrypt. It consumes less memory than the latter, but is more memory-intensive and cryptographically stronger. It combines the functions of the stream cipher algorithm Salsa20, Salsa20-modified ChaCha20, BLAKE2s, and FastKDF into a secure ASIC-resistant solution.

Paper : Doering, John. "NeoScrypt, a Strong Memory Intensive Key Derivation Function." (2014).

Applications : GoByte(GBX), Innova(INN), Trezarcoin(TZC), Vivo(VIVO), Crowdcoin(CRC), Phoenixcoin(PXC)

Lyra2REv2

Introduction : Vertcoin uses Lyra2REv2 as a proof-of-work algorithm to improve Bitcoin, also for the purpose of resisting ASIC. Vertcoin introduces an "adaptive N factor" to the Scrypt algorithm. The N factor component of Scrypt determines how much memory is required to calculate the hash function. Vertcoin's N factor increases over time to discourage the development of dedicated "mining" hardware and encourage the distribution of verification tasks on individual users' computers. The current LyraREv2 consists of BLAKE, Keccak, CubeHash, Lyra2, Skein and Blue Midnight Wish hash algorithms.

Paper : Lyra2RE – A new PoW algorithm for an ASIC-free future

Applications : Vertcoin (VTC), Monacoin (MONA), Verge-Lyra2REv2 (XVG)

Ethash

Introduction : Ethash uses DAG (directed acyclic graph) for the proof-of-work algorithm, and blocks dedicated chips by sharing memory, reducing the role of mining machines. This algorithm is the current transition algorithm of Ethereum, and its predecessor is Dagger-Hashimoto. After the implementation of Casper the Friendly Finality Gadget (FFG), Ethereum will change from probabilistic finality to deterministic finality.

Paper : Buterin, Vitalik. "A next-generation smart contract and decentralized application platform." white paper (2014).

Applications : Ethereum(ETH), EthereumClassic(ETC), Pirl(PIRL), Musicoin(MUSIC), Expanse(EXP), Metaverse(ETP)

X11Gost

Introduction : x11GOST consists of 10 SHA3 algorithms and Stribog hash functions to form a hash value. Each algorithm is calculated one by one to effectively prevent the probability of ASIC winning.

Thesis : CRYPTO CURRENCY ON THE BASIS OF DELEGATED NODES (MASTERNODS) WITH QUICK SCALE TECHNOLOGY

Application : Sibcoin(SIB)

CryptoNight

Introduction : CryptoNight is a proof-of-work algorithm. It is designed to work on common PC CPUs, taking advantage of existing CPUs (native AES encryption and fast 64-bit multipliers - tuned to use a scratchpad comparable to the size of the per-core L3 cache on Intel CPUs, about 2MB), so CryptoNight can only be mined with CPUs, and there are currently no specialized mining devices designed for it. CryptoNight relies on random access to slow memory and emphasizes latency dependency, with each new block depending on all previous blocks (unlike scrypt).

Paper : CryptoNight Hash Function

Applications : Dinastycoin(DCY), Dinastycoin(DCY), Electroneum(ETN), Karbo(KRB), Bytecoin(BCN), Monero(XMR)

Blake (14r)

Introduction : BLAKE and BLAKE2 are cryptographic hash functions based on Dan Bernstein's ChaCha stream cipher, but add a permuted copy of the input block before each ChaCha round, with some constant XOR'ed. The two main instances of BLAKE are BLAKE-256 and BLAKE-512. They use 32-bit and 64-bit words, respectively, and produce 256-bit and 512-bit digests.

Paper : Aumasson, Jean-Philippe, et al. "Sha-3 proposal blake." Submission to NIST (2008).

Application : Decred(DCR)