Crypto Coin Information - Algorithms


Algorithm Name Information Read More
Bcrypt Bcrypt is a password hashing function designed by Niels Provos and David Mazieres, based on the Blowfish cipher, and presented at USENIX in 1999. Read More
Blake-256 BLAKE and BLAKE2 are cryptographic hash functions based on Dan Bernstein's ChaCha stream cipher, but a permuted copy of the input block, XORed with some round constants, is added before each ChaCha round. Read More
Brainpower Information Unavailable Read More
CryptoNight CryptoNight is the proof-of-work algorithm used in CryptoNote and Bytecoin (BCN). It is designed to be egalitarian, being suitable for ordinary PC CPUs, but not the special purpose devices for mining. Read More
Dcrypt The Dcrypt hashing algorithm uses SHA256 as a back end, but in such a way that makes it extremely ASIC/FPGA resistant. Read More
Dijkstra Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks. It was conceived by computer scientist Edsger W. Dijkstra in 1956 and published three years later. Read More
FRESH The FRESH algorithm cherry picked and combined the most low energy hashing algorithms (SHAVITE, SIMD & ECHO) which results in the most ENERGY efficient hashing solution available. The combination of 5 rounds of multiple algorithms stand for high security and will keep ASIC miners away. Read More
Fugue256 Fugue is a cryptographic hash function submitted by IBM to the NIST hash function competition. It was designed by Shai Halevi, William E. Hall, and Charanjit S. Jutla. Fugue takes an arbitrary-length message and compresses it down to a fixed bit-length (either 224, 256, 384 or 512 bits). The hash functions for the different output lengths are called Fugue-224, Fugue-256, Fugue-384 and Fugue-512. Read More
Hefty1 Hefty1 is an ultra-secure hashing algorithm that employs multiple redundant cryptographic hash functions to secure its block chain. Read More
Momentum Momentum is the proprietary mining algorithm used by Protoshares (PTS). At the heart of Momentum is the SHA-512 protocol, which means the hash generated by Momentum is created in 512-bit pieces. Read More
JH JH is a cryptographic hash function submitted to the NIST hash function competition by Hongjun Wu. Though chosen as one of the five finalists of the competition, JH ultimately lost to NIST hash candidate Keccak. JH has a 1024-bit state, and works on 512-bit input blocks. Read More
Multi-Algo Information Unavailable Read More
NeoScrypt NeoScrypt is a modified version of scrypt, founded by someone known as BLANK, intended to address known scrypt weaknesses. NeoScrypt uses non-reduced Salsa20/20 as well as ChaCha20/20 instead of Salsa20/8, and BLAKE2s instead of SHA-256. Read More
Quark Quark is super secure and uses a different hashing algorithm with 9 rounds of hashing from 6 unique hashing functions (blake, groestl, blue midnight wish, jh, SHA-3, skein). 3 rounds deliver a random hashing function. Read More
Qubit Super secure hashing: 5 rounds of hashing functions (luffa, cubehash, shavite, simd, echo). Read More
Ramhog ramhog, an innovative proof-of-work algorithm. ASIC resistant, GPU resistant, and botnet resistant2 minute proof-of-stake block time, starting three months inBlock reward starts at 1 SHC, scales quadratically over 2 days to 400 SHC, then decays according to 1 / (block_height/26280)^2Shiny Gravity Wave difficulty adjustment algorithm Read More
Scrypt Scrypt is a multi-layered algorithm that begins by running data through the SHA-256 hash process. It then uses elements of the Stochastic Approach for Link-Structure Analysis (SALSA) algorithm to complete hash generation. Read More
Scrypt-HTC Scrypt is a multi-layered algorithm that begins by running data through the SHA-256 hash process. It then uses elements of the Stochastic Approach for Link-Structure Analysis (SALSA) algorithm to complete hash generation. Read More
Scrypt-Jane Scrypt is a multi-layered algorithm that begins by running data through the SHA-256 hash process. It then uses elements of the Stochastic Approach for Link-Structure Analysis (SALSA) algorithm to complete hash generation. Read More
Scrypt-N Scrypt is a multi-layered algorithm that begins by running data through the SHA-256 hash process. It then uses elements of the Stochastic Approach for Link-Structure Analysis (SALSA) algorithm to complete hash generation. Read More
Scrypt-OG Scrypt is a multi-layered algorithm that begins by running data through the SHA-256 hash process. It then uses elements of the Stochastic Approach for Link-Structure Analysis (SALSA) algorithm to complete hash generation. Read More
Scrypt-PGC Scrypt is a multi-layered algorithm that begins by running data through the SHA-256 hash process. It then uses elements of the Stochastic Approach for Link-Structure Analysis (SALSA) algorithm to complete hash generation. Read More
SHA-1 To date, the only digital currency that uses this algorithm is IxCoin (IXC). SHA-1 is an older algorithm, and it differs from SHA-256 in that the hash in generates is only 160 bits, as opposed to 256. Read More
SHA-256 The SHA-2 set of algorithms was developed and issued as a security standard by the United States National Security Agency (NSA) in 2001. SHA-256 is a member of the SHA-2 family. Read More
SHA-3 SHA-3 (Secure Hash Algorithm 3) is a cryptographic hash function designed by Guido Bertoni, Joan Daemen, Michael Peeters, and Gilles Van Assche, building upon RadioGatun. Read More
SHA512 The SHA-2 set of algorithms was developed and issued as a security standard by the United States National Security Agency (NSA) in 2001. SHA-256 is a member of the SHA-2 family. Read More
Skein-SHA2 Skeincoin uses a new Proof of Work (POW) algorithm that is energy efficient and secure. The first round of hashing is done using Skein, the second using SHA256 (Skein-SHA2). Read More
Twister The Mersenne Twister is a pseudorandom number generator (PRNG). It is by far the most widely used general-purpose PRNG. Its name derives from the fact that its period length is chosen to be a Mersenne prime. Read More
X11 X11 is a chained hashing algorithm approach, taking 11 hashing algorithms from the sphlib. Created by Evan Duffield, X11 consists of blake, bmw, groestl, jh, keccak, skein, luffa, cubehash, shavite, simd, and echo. Read More
X13 Information Unavailable Read More
X15 Information Unavailable Read More
X17 Information Unavailable Read More
X4 Information Unavailable Read More
C11 C11 uses an algorithm similar to X11 with 11 hashes, but in a different order. Read More
Cuckoo Cycle This PoW requires finding a 42-cycle in a huge graph whose edges are generated by the siphash-2-4 hash function. Read More
Wild Keccack Wild Keccak is a Keccak hybrid which uses blockchain data as scratchpad. After each Keccak round, pseudo-randomly addressed [state vector used as addresses] data is taken from scratchpad and XORed with state. Read More
Lyra2REv2 Information Unavailable Read More
Chacha ChaCha replaces the basic Salsa20 round primitive Read More