dido:public:ra:xapend:xapend.k_consensus:start
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:start [2021/07/20 18:23] nick |
dido:public:ra:xapend:xapend.k_consensus:start [2022/04/18 21:21] (current) nick |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| - | ====== Appendix K: DIDO Consensus ====== | + | ====== Appendix K: DIDO Consensus Algorithms ====== |
| [[dido:public:ra | Return to Reference Architecture (RA)]] or [[dido:public:ra:xapend | Return to Appendices]] | [[dido:public:ra | Return to Reference Architecture (RA)]] or [[dido:public:ra:xapend | Return to Appendices]] | ||
| - | [[dido:public:ra:xapend:xapend.a_glossary:c:consensus_algorithm]] are essential in establishing confidence in a DIDO. Consensus helps overcome the Two Generals Problem and the Byzantine Generals problem. Two Generals' Problem is about establishing trust between the endpoints to ensure the data has not been tampered with. This is usually accomplished by encrypting the data flows between the two generals where each has a key to access the data. | + | [[dido:public:ra:xapend:xapend.a_glossary:c:consensus_algorithm | Consensus Algorithms ]] are essential in establishing confidence in a DIDO. Consensus helps overcome the Two Generals Problem and the [[dido:public:ra:xapend:xapend.a_glossary:b:byzantine_generals_problem|Byzantine Generals problem]]. Two Generals' Problem is about establishing trust between the endpoints to ensure the data has not been tampered with. This is usually accomplished by encrypting the data flows between the two generals where each has a key to access the data. |
| - | The Byzantine Generals problem ensures that everyone gets the same updates (i.e., transactions) and that the transactions are verified. This is generally accomplished by obtaining Consensus among all the generals about any decision (i.e., transaction). There are currently 30+ Consensus mechanisms in use within the DIDO communities (i.e., Blockchain, Distributed Ledger, Directed Acyclical Graphs, etc). See: | + | The Byzantine Generals problem ensures that everyone gets the same updates (i.e., transactions) and that the transactions are verified. This is generally accomplished by obtaining Consensus among all the generals about any decision (i.e., transaction). There are currently 30+ Consensus mechanisms in use within the DIDO communities (i.e., Blockchain, [[dido:public:ra:xapend:xapend.a_glossary:d:distributed_ledgers|Distributed Ledger]], Directed Acyclical Graphs, etc). See: [[dido:public:ra:xapend:xapend.k_consensus:09_ref:saini]]. |
| Line 16: | Line 16: | ||
| )) | )) | ||
| - | * [[dido:public:ra:xapend:xapend.k_consensus:01_definition:start]] | ||
| - | * [[dido:public:ra:xapend:xapend.k_consensus:02_mechanism:start]] | ||
| - | * [[dido:public:ra:xapend:xapend.k_consensus:05_algorithm:start]] | ||
| - | * [[dido:public:ra:xapend:xapend.k_consensus:09_ref:start]] | ||
| - | * [[dido:public:ra:xapend:xapend.k_consensus:platform]] | ||
| + | <nspages -tree dido:public:ra:xapend:xapend.k_consensus: -exclude -subns -pagesInNs -h1 -textNs=""> | ||
| + | |||
| + | <color blue><todo @char>New Section -- review </todo></color> \\ | ||
| + | <color blue><todo @char #char:2021-11-09>change the list above to nspages</todo></color> \\ | ||
| + | <color blue><todo @char #char:2021-11-09> Change the subsection page names to K.1, K.2, etc. similar to App F</todo></color> | ||
| /**=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- | /**=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- | ||
dido/public/ra/xapend/xapend.k_consensus/start.1626819831.txt.gz · Last modified: 2021/07/20 18:23 by nick
