Improved Byzantine fault tolerance with fast consensus

Abstract

AbstractThis article presents an improved Byzantine fault tolerance algorithm to tolerate Byzantine faults rapidly by minimizing the load of the network with a minimum cost that provides a very simple methodology to design Byzantine fault tolerance (BFT) state machine replication protocol with the most favorable flexibility. Although, we have taken the initiative of fault tolerance from earlier works and conversely perform a different approach than them. Our protocol just requires replicas for ffaults instead of in previous Byzantine protocols to mitigate the attacks by faulty primary and replicas. It also improves prior algorithms in terms of different parameters and requires fewer cryptographic techniques. Similar to previous BFT protocols, this protocol also guarantees correctness.