PBFT is a Byzantine Fault Tolerance model and has the advantage of resolving the drawbacks of PoW and PoS, such as the uncertainty in the penalty and efficiency issues. of resolving the drawbacks of PoW and PoS, such as the uncertainty in the penalty and efficiency issues. As with the Hyperledge Fabric, as the block is generated after a majority decision is made, there’s no branching that ensures finality. The PBFT operates as follows: firstly, the client broadcasts the request to all nodes. The Leader becomes the Primary and will consecutively deliver the instructions to the other nodes. When each node receives the instructions broadcasted, it will proceed to send a response to all nodes, including the Leader. When each node receives the delivered instructions above a certain number, then it will re-send the received signal to all nodes including the leader. When each node receives above a certain number of received instructions, then it will perform the received instructions and register the block and return the replayed message to the client. Because the block is generated by a majority decision as compared to PoW or PoS, there is no branching of the blockchain. As such, a block once confirmed will not be changed and can ensure finality. Further, as compared to PoW, there is no need to repeat the calculation until the conditions are satisfied, so there is an advantage of rapid processing. Should an attempt of improper use be made, there still needs to be a majority vote, and even if the Primary sends false information, if all participants monitoring the Leader’s movement determine that it is false, then they can request to change the Leader on a majority vote. As such, it is an algorithm with very strong fault tolerance.