A Byzantine Fault Tolerant Consensus Method Based on Distributed Key

The invention belongs to the field of security authentication in the discipline of cyberspace security, and relates to a distributed key-based Byzantine fault-tolerant consensus method; the method includes selecting super nodes participating in the consensus, and generating system public parameters; according to the public Parameters, generate system public-private key pairs and public-private keys of candidate nodes through mutual interactive authentication; select the master node from the super nodes to initiate a proposal request, and start a new round of consensus; the sub-nodes perform individual verification and aggregation on the proposal request Verification, to finally determine whether to agree to send the block; after the ordinary node receives the block, the completion time triggers the next round of consensus. In this process, if the secondary node waits for the master node’s proposal request or proposal response to Broadcast the view change request and replace the master node; the invention can greatly improve the efficiency in the consensus process.