SBFT+DPOS

The core consensus module of Fibonacci replaces PBFT with the faster and more efficient SBFT. Experiments show that after using SBFT, the theoretical TPS of Fibonacci reaches 100,000/s. SBFT implements dual consensus modes that can seamlessly switch between fast consensus and normal consensus. In Fibonacci SBFT, three system models are supported:

• Standard asynchronous model: In this model, there are up to f Byzantine nodes (malicious nodes) in the network. The SBFT algorithm can ensure security in this case, and any two replica nodes will execute the same block in the same order.

• Synchronous model: In this model, there are up to f Byzantine nodes (malicious nodes) in the network, and the network is synchronous. The SBFT algorithm can ensure liveness in this case, and client requests will receive responses.

• General model: In this model, up to c nodes (can only crash or act slowly) in the network may crash or slow down, but do not maliciously attack. The SBFT algorithm can ensure high efficiency in this case, submitting one block requires a fixed number of messages.

Fibonacci SBFT uses threshold signatures. For n replica nodes, only a subset of replica nodes needs to sign the block for verification. That is, the replica nodes in the subset use their own private keys to sign separately and then combine them. Finally, the verification node only needs to verify once. After adopting the threshold signature mechanism, the client communication volume can be reduced from O(n) to O(1).