dido:public:ra:xapend:xapend.k_consensus:02_mechanism:pbft
Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
dido:public:ra:xapend:xapend.k_consensus:02_mechanism:pbft [2021/08/06 13:08] murphy |
dido:public:ra:xapend:xapend.k_consensus:02_mechanism:pbft [2021/08/13 15:02] (current) murphy |
||
|---|---|---|---|
| Line 11: | Line 11: | ||
| )) | )) | ||
| - | //The **Practical Byzantine Fault Tolerance (PBFT)** model primarily focuses on providing a practical Byzantine state machine replication that tolerates [[dido:public:ra:xapend:xapend.a_glossary:b:byzantine_fault|Byzantine faults]] (malicious nodes) through an assumption that there are independent node failures and manipulated messages propagated by specific, independent nodes.// | + | //The **Practical Byzantine Fault Tolerance (PBFT)** model primarily focuses on providing a practical Byzantine state machine replication that tolerates [[dido:public:ra:xapend:xapend.a_glossary:b:byzantine_fault|Byzantine faults]] (malicious nodes) through an assumption that there are independent [[dido:public:ra:xapend:xapend.a_glossary:n:node|node]] failures and manipulated messages propagated by specific, independent nodes.// |
| - | //The algorithm is designed to work in asynchronous systems and is optimized to be high-performance with an impressive overhead runtime and only a slight increase in latency.// | + | //The algorithm is designed to work in asynchronous systems and is optimized to be high-[[dido:public:ra:xapend:xapend.a_glossary:p:performance|performance]] with an impressive overhead runtime and only a slight increase in [[dido:public:ra:xapend:xapend.a_glossary:l:latency|latency]].// |
| * //Essentially, all of the nodes in the pBFT model are ordered in a sequence with one node being the primary node (leader) and the others referred to as the backup nodes.// | * //Essentially, all of the nodes in the pBFT model are ordered in a sequence with one node being the primary node (leader) and the others referred to as the backup nodes.// | ||
| Line 34: | Line 34: | ||
| //The requirements for the nodes are that they are deterministic and start in the same state. The final result is that all honest nodes come to an agreement on the order of the record and they either accept it or reject it.// | //The requirements for the nodes are that they are deterministic and start in the same state. The final result is that all honest nodes come to an agreement on the order of the record and they either accept it or reject it.// | ||
| - | //The leader node is changed in a round-robin type format during every view and can even be replaced with a protocol called view change if a specific amount of time has passed without the leader node multicasting the request.// | + | //The leader node is changed in a round-robin type format during every view and can even be replaced with a [[dido:public:ra:xapend:xapend.a_glossary:p:protocol|protocol]] called view change if a specific amount of time has passed without the leader node multicasting the request.// |
| //A supermajority of honest nodes can also decide whether a leader is faulty and remove them with the next leader in line as the replacement.// | //A supermajority of honest nodes can also decide whether a leader is faulty and remove them with the next leader in line as the replacement.// | ||
dido/public/ra/xapend/xapend.k_consensus/02_mechanism/pbft.1628269700.txt.gz ยท Last modified: 2021/08/06 13:08 by murphy
