Research Article

Survey of Consensus Algorithms for Proof of Stake in Blockchain

Table 1

Comparison of the consensus algorithms based on PoS.

ConsensusMain ideaSolution effectExisting problems

DPoSWitnesses take turns to generate blocks in sequence, and other witnesses verify the blocksProvides higher security, can verify transactions in seconds, and can resist 51% attacksOrdinary nodes do not actively participate in voting; corruption and bribery occur

Snow WhiteIn each reconfiguration process, the nearest interest owner in the system is selected as the active member set, and the blocker is randomly selected according to the equity ratioMeets the needs of nodes to join and exit the network randomly to achieve fairnessThe network model is a sleepy model, and nodes cannot permanently remain online

Sleepy ConsensusThe distributed protocol is studied in the “sleep” computing model; the online status of each node can be changed at any timeCan guarantee security and robustness when the number of active honest nodes reaches more than half or the number of honest online nodes exceeds the number of failed nodes

OuroborosThe reward mechanism encourages nodes to join the blockchain; a random function randomly selects block producers for each round of a period from the set of all current legal block producersRandomly selects bookkeepers according to the stake, solving the long-range attacksMay be subject to bribery attacks or DDoS attacks

Ouroboros PraosThe block producer is determined privately, and other nodes cannot determine the block producer in this round before successfully generating a new blockEffectively prevents block producers from being attacked by bribery or DDoS attacks

Ouroboros GenesisWhen a new node joins the network, the selected blockchain needs to have a common prefix with the other chains and be the longest chainAddresses long-range attacks, allowing parties to join and leave the system at will

Ouroboros CrypsinousThe SNARK mechanism of “transaction injection” in Zerocash is extended to an environment where the currency does not depreciate so that no additional information is disclosed in the processImplements for the first time analogue-based privacy that is universally composable and secure in the forward direction. Ensures consistency and mobility and is resistant to adaptive attacks

EOSBallot holders elect the representatives they support by voting, and the witness network composed of these representatives reaches consensus through BFTMakes the block generation interval reach 0.5 s and shortens the delay to 1.5 s, reaching millions of transactions per secondThe actual throughput and decentralisation are not ideal

Improvement of DPoSThe voting incentive mechanism and the checkpoint protocol of PBFT are introduced to enhance community activity; malicious nodes are removed and punished in a timely mannerAccelerates the processing speed of malicious nodes, boosts operation efficiency, and generates block quickly

Improvement of DPoSVoting is used to reward incentive nodes actively participating in the voting, and reporting is used to reward incentive nodes actively reporting bribery nodesImproves the enthusiasm of nodes to vote and strengthens the resistance of ordinary nodes to the bribery of malicious nodes

Improvement of DPoSThe transaction fee of a node is shared with its voters, and it is difficult for a malicious node to become a representative node as the calculation of the voting results is optimisedReduces the probability of the successful election of malicious nodes and improves the security of the systemThroughput and consensus delay are not ideal