Appendix K: DIDO Consensus

Return to Reference Architecture (RA) or Return to Appendices

Consensus

Return to Top

Consensus, in DIDOs, is when the entire distributed system agrees upon the state of the data within the system. In other words, the data within the entire system can be relied upon and reflects the “truth”. However, although the data within the DIDO is immutable, it does not mean it is static. Every proposed change in state to any data held within the DIDO is allowed when there is Consensus that the new data state is valid and verified.

The DIDO Network Nodes have Consensus the data state represents “truth”.

Notes

Return to Top

There is a difference between a DIDO Consensus and a Community of Interest (CoI) Consensus. The DIDO Consensus concerns the way Consensus for propagating transactions throughout the DIDO Network. DIDO Consensus is generally inherent to the DIDO Platform. When there is a preference for a particular Consensus Mechanism for a particular project, the preference needs to be addressed as part of the functional requirements for the project.

CoI Consensus is concerned with how decisions are made in the CoI. The details of how Consensus is reached within a COI are generally captured in the Community's (i.e., Ecosphere's ) Policies and Procedures (P&P).

The COI Consensus.

Directed Acyclic Graphs (DAG)

Return to Top

Consensus Protocol

Return to Top

Consensus Protocol, in DIDOs, is developed by a specific DIDO platform to implement Consensus Mechanism over their DIDO network to achieve Consensus.

The relationship between Consensus, Consenus Mecahnism, and Consensus Protocol.

Transaction

Return to Top

All data within the DIDO are immutable with newer values (i.e., data states) being posted using a transaction that provides instructions on how to migrate the original data state to a new data state. Over time, the chain of history of data state changes (i.e., Journal) for one piece of data can become quite long. Given a known data state at a particular time, the current state of the data can be reconstructed using the journaled transactions.

In addition, the new data state also includes references back to the original data state. This allows the navigation of the journal back to the original data state (i.e., Genesis Data).

Transaction move the Data from one state to the next and remember the precious data state.

The following are some examples of Data State change commands. These are not Transactions because they do not include a reference to the original data to be changed (i.e., altered).

CHANGE EmotionState FROM HAPPY TO GLAD
CHANGE AccountBalance BY +5.00

Note: In the example above, to be a transaction, the GLAD data state also has a reference back to HAPPY data state.

Why is it important

Consensus Algorithm are essential in establishing confidence in a DIDO.

Thus there are various types of consensus algorithms in blockchain prospect, some of them are explained below1) Coinjoker, Consensus Algorithms in Blockchain, Accessed: 9 July 2021, https://www.cryptoexchangescript.com/blockchain-consensus-algorithms

Consensus Alorithym	Description	Platform Examples	Pros	Cons	Type
Proof of Work (PoW)	Bitcoin, Litecoin, ZCash, Primecoin, Monero, Vertcoin	Less opportunity for 51% attack Better Security	Greater energy consumption Centralization of Miners	Competitive ConsensusWebpage: SAINI
Proof of Stake (PoS)	Ethereum, Dash, Peercoin, Decred, Reddcoin, PivX	Energy efficient Webpage: SAINIMore expensive to attack for attackers Webpage: SAININot susceptible to economies of scale Webpage: SAINI	nothing-at-stake problem Webpage: SAINI	Competitive Consensus Webpage: SAINI
Delegated Proof of Stake (DPoS)	Steem, EOS, and BitShares Webpage: BHARDWAJBitShares, Steemit, EOS, Lisk, Ark Webpage: SAINI	Energy efficient. Webpage: SAINIFast. Steemit, a high traffic blogging site uses it. EOS has a block-time of 0.5 sec. Webpage: SAINI	A bit centralized.Webpage: SAINIParticipants with high stakes can vote themselves in to become a validator. Something which is seen recently in EOS.Webpage: SAINI	Collaborative consensusWebpage: SAINI
Leased Proof of Stake (LPoS)	Waves
Proof of Elapsed Time (PoET)	Hyperledger Sawtooth, Resource-Efﬁcient Mining (REM)
Practical Byzantine Fault Tolerance (PBFT)	Stellar, Ripple, Hyperledger FabricWebpage: BHARDWAJ
Simplified Byzantine Fault Tolerance (SBFT)	Chain
Delegated Byzantine Fault Tolerance (DBFT)	NEO Webpage: BHARDWAJ
Directed Acyclic Graphs (DAG)	Iota, Hedera Hashgraph Webpage: BHARDWAJ
Proof of Activity (PoA)	Espers and Decred Webpage: BHARDWAJDecred Webpage: SAINI	Collaborative consensusWebpage: SAINI
Proof of Indentity (PoI)
Proof of Importance (PoI)	NEM
Proof of Capacity (PoC) Proof of Space (PoS)	Burstcoin and SpaceMint Webpage: BHARDWAJ	Similar to PoW but uses space instead of computation. Thus much environmental friendly.Can be used for malware detection, by determining whether the L1 cache of a processor is empty (e.g., has enough space to evaluate the PoSpace routine without cache misses) or contains a routine that resisted being evicted.Can be used for anti-spam measures and denial of service attack prevention.	Incentivization can be an issue.	Collaborative consensusWebpage: SAINI
Proof of Burn (PoB)	Slim Coin Webpage: BHARDWAJ
Proof of Weight (PoW)	Algorand, Filecoin, Chia	Energy efficient.Webpage: SAINIHighly Customisable and scalable.Webpage: SAINI	Incentivization can be hard.Webpage: SAINI	Competitive consensus Webpage: SAINI