dido:public:ra:xapend:xapend.k_consensus:02_mechanism:dbft
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:dbft [2021/08/13 13:58] murphy |
dido:public:ra:xapend:xapend.k_consensus:02_mechanism:dbft [2021/08/13 14:01] (current) murphy |
||
|---|---|---|---|
| Line 2: | Line 2: | ||
| [[dido:public:ra:xapend:xapend.k_consensus:02_mechanism:start | Return to Consensus Mechanism ]] | [[dido:public:ra:xapend:xapend.k_consensus:02_mechanism:start | Return to Consensus Mechanism ]] | ||
| - | **Delegated Byzantine Fault Tolerance (dBFT)** is a sophisticated algorithm meant to facilitate consensus on a [[dido:public:ra:xapend:xapend.a_glossary:b:blockchain|blockchain]]. Although it is not in common use as of yet, it represents an alternative to simpler [[dido:public:ra:xapend:xapend.a_glossary:p:proof_of_stake_pos|proof of stake]], proof of importance, and proof of work methods. | + | **Delegated Byzantine Fault Tolerance (dBFT)** is a sophisticated algorithm meant to facilitate consensus on a [[dido:public:ra:xapend:xapend.a_glossary:b:blockchain|blockchain]]. Although it is not in common use as of yet, it represents an alternative to simpler [[dido:public:ra:xapend:xapend.a_glossary:p:proof_of_stake_pos|proof of stake]], proof of importance, and [[dido:public:ra:xapend:xapend.a_glossary:p:proof_of_work|proof of work]] methods. |
| [[https://www.techopedia.com/definition/33598/delegated-byzantine-fault-tolerance-dbft]] | [[https://www.techopedia.com/definition/33598/delegated-byzantine-fault-tolerance-dbft]] | ||
dido/public/ra/xapend/xapend.k_consensus/02_mechanism/dbft.1628877494.txt.gz ยท Last modified: 2021/08/13 13:58 by murphy
