Block Proposer Election Method Based on Verifiable Random Function in Consensus Mechanism

The consensus mechanism, as one of the most important technologies of the blockchain, always faces the balance of security, efficiency and consistency. The generation of block proposer in the existing consensus algorithm is predictive, and the target of malicious nodes is clear. In response to these problems, this paper introduces a non-interactive verifiable random node extraction method, using a verifiable random function (VRF) to randomly generate block proposer. This method makes it impossible to know the identity of key nodes before the proposal block is broadcast, and realizes the unpredictability and verifiability of the node identity. At the same time, the reputation model in this article is constructed to adjust node status dynamically, and to select nodes with higher credibility to form a consensus group. Analysis and experiments show that the optimized consensus algorithm has higher security and reliability, and the influence of malicious nodes on the system delay is negligible. Simultaneously, It can play better performance in systems where malicious nodes exist.