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 | |||
|
dido:public:ra:xapend:xapend.k_consensus:02_mechanism:pbft [2021/08/13 11:20] murphy |
dido:public:ra:xapend:xapend.k_consensus:02_mechanism:pbft [2021/08/13 15:02] (current) murphy |
||
|---|---|---|---|
| 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.1628868024.txt.gz ยท Last modified: 2021/08/13 11:20 by murphy
