This repository contains an implementation of the Practical Byzantine Fault Tolerant (PBFT) consensus algorithm for Sawtooth.
PBFT is designed to tolerate the failure of nodes in a distributed network, as well as nodes sending incorrect messages to other nodes, as long as fewer than one-third of the nodes are considered faulty. PBFT networks need a minimum of four nodes to be Byzantine fault tolerant.
Sawtooth PBFT is based on the algorithm described in Practical Byzantine Fault Tolerance, and is adapted for use in Sawtooth.
For more information, see the Sawtooth PBFT documentation.
To configure a Sawtooth network with PBFT consensus, see the Sawtooth documentation:
-
Application developers: Creating a Sawtooth Test Network
-
System administrators: Setting Up a Sawtooth Network
PBFT was chosen as a Sawtooth consensus algorithm in order to provide Byzantine fault tolerant consensus for a system without a Trusted Execution Environment (TEE). (PoET-SGX consensus requires a TEE.)
The proposal to include PBFT in Sawtooth is located in Sawtooth RFC 0019-pbft-consensus.md.
Sawtooth PBFT uses the Sawtooth consensus API that is described by Sawtooth RFC 0004-consensus-api.md.
Sawtooth software is licensed under the Apache License Version 2.0 software license.