Consensus algorithm based on verifiable randomness

Abstract

Consensus algorithms are the core of blockchain technology, which can cause nodes to reach consistency or liveness when there are Byzantine nodes in the network. The generation of public randomness in decentralized networks has been significantly demanding and challenging in terms of the consensus mechanism. Previously, the multi-party random number generator (mRNG), which is a mechanism for creating a single value from the contributions of decentralized multiple parties, was mainly designed based on the verifiable random function. In this study, we first construct novel, efficient verifiable mRNG protocols from any one-way function. The protocols can achieve the properties of fairness, no trusted third party, public verifiability, and manipulation resistance. Subsequently, we propose a delegated PoS (DPoS)-based consensus algorithm that adopts the verifiable mRNG. The new algorithm can solve the problem of low fairness caused by the artificial election of master nodes using DPoS, while addressing the issue of manipulating the consensus process owing to the pseudo-random number generated by the traditional RNG, thereby improving the credibility of the consensus algorithm.