Research Article

Survey of Consensus Algorithms for Proof of Stake in Blockchain

Table 2

Comparison of the hybrid consensus algorithms based on PoS and PoW.

ConsensusMain ideaSolution effectExisting problems

CasperAllocates and controls the margin to drive verifier validation and consensus. In the event of an “invalid” action, the deposit is forfeited, and participation in the consensus is not possibleSolves the “nothing-at-stake” problem. Ensures that the benefits are maximised in the alliance composed of 100% consensus nodes to resist the attack of the majority alliance

CTFGAllocates and controls the margin to drive verifier validation and consensus. If an “invalid” action occurs, the deposit is forfeitedSolves the “nothing-at-stake” problem and resists the attack of the majority alliance

CFFGThe probability of a node being selected is proportional to the weight of the deposit, and at least two-thirds of the validators’ legal votes are obtained in each roundMakes the nodes fully online, maintaining the security of the Ethereum networkMany nodes participate in betting on the verification of the initiative to reduce, preferring not to act

2-hopPoS rights are introduced on the basis of PoW computing power so that blockchain security is built on the basis that honest nodes occupy the majority of joint resourcesSolves 51% attacks and greatly improves the security of the blockchain

PoAThe principle of the longest main chain is used to suppress forks. Parts of the PoW tokens are distributed to active nodes in a lottery. The rights and interests of nodes are proportional to the probability of winningHas security higher than that of PoW and PoS, which encourages miners to keep running online and is conducive to the healthy operation of the currencyThe verification of nodes in the entire network has become complicated, and there is no specific profit distribution plan

CoAWithin a certain period of time, a stakeholder is randomly selected to create a new block, similar to an online lotteryOvercomes the fork problem of PoS to a certain extentThere is no clear plan for the distribution of specific benefits

PoBBy burning tokens to compete for the right to produce new blocks, PoB makes the probability of a node being selected proportional to the number of burned tokensReduces dependence on low bit rate external randomnessThere is a waste of token resources; mining capacity is gradually controlled by those who have more resources and are willing to burn tokens

PoSVPoW is used to realise token distribution and uses PoSV to maintain long-term network security. The linear function of coin age and time is modified into an exponential decay functionEliminates the phenomenon of currency hoarding by currency holders

PoWaSThe difficulty of hash calculation is reduced; the upper limits for coin age and effective holding time are set; and the package accounting rights are determined by the time spent looking for random numbers, coin age, and credit valueIncreases the difficulty of double spending and forks and prevents replay attacksThe stability of block speed is not ideal, and the adjustment of credit value needs to be further studied