https://www.omgwiki.org/dido/ 2026-06-06T07:17:15-0400 https://www.omgwiki.org/dido/ https://www.omgwiki.org/dido/lib/tpl/dokuwiki/images/favicon.ico text/html 2021-07-16T23:29:58-0400 Anonymous (anonymous@undisclosed.example.com) https://www.omgwiki.org/dido/doku.php?id=dido:public:ra:xapend:xapend.k_consensus:02_mechanism:cellular&rev=1626492598&do=diff Cellular Automaton Consensus Return to Consensus Mechanism Cellular Consensus is ... text/html 2022-07-07T13:55:48-0400 Anonymous (anonymous@undisclosed.example.com) https://www.omgwiki.org/dido/doku.php?id=dido:public:ra:xapend:xapend.k_consensus:02_mechanism:dag&rev=1657216548&do=diff Directed Acyclical Graphs (DAGs) Return to Consensus Mechanism Directed Acyclic Graph (DAG) is the DIDO that does not look like a chain of transactions or blocks, but rather as the name suggests, more like a graph. It’s possible that the DAG model may substitute blockchains because of they are the more effective structure for storing data and processing transactions online. text/html 2021-08-13T14:01:53-0400 Anonymous (anonymous@undisclosed.example.com) https://www.omgwiki.org/dido/doku.php?id=dido:public:ra:xapend:xapend.k_consensus:02_mechanism:dbft&rev=1628877713&do=diff Delegated Byzantine Fault Tolerance (dBFT) Return to Consensus Mechanism Delegated Byzantine Fault Tolerance (dBFT) is a sophisticated algorithm meant to facilitate consensus on a blockchain. Although it is not in common use as of yet, it represents an alternative to simpler proof of stake, proof of importance, and text/html 2021-08-18T10:22:46-0400 Anonymous (anonymous@undisclosed.example.com) https://www.omgwiki.org/dido/doku.php?id=dido:public:ra:xapend:xapend.k_consensus:02_mechanism:dpos&rev=1629296566&do=diff Delegated Proof of Stake (DPoS) Return to Consensus Mechanism Delegated Proof of Stake (DPoS) is a mechanism where the participants stake their coin and vote for a certain number of delegates such that the more they invest, the more weightage they receive. For example: if user A spends 10 text/html 2021-08-13T14:15:02-0400 Anonymous (anonymous@undisclosed.example.com) https://www.omgwiki.org/dido/doku.php?id=dido:public:ra:xapend:xapend.k_consensus:02_mechanism:fpc&rev=1628878502&do=diff Fast Probabilistic Consensus (FPC) Return to Consensus Mechanism Fast Probabilistic Consensus (FPC) is a leaderless protocol within Byzantine Infrastructures with low communicational complexity and which allows a set of nodes to come to a consensus on a value of a single bit. It makes the assumption that part of the nodes are Byzantine, and are thus controlled by an adversary who intends to either delay the consensus or break it (this defines that at least a couple of honest nodes come to di… text/html 2021-08-13T13:57:12-0400 Anonymous (anonymous@undisclosed.example.com) https://www.omgwiki.org/dido/doku.php?id=dido:public:ra:xapend:xapend.k_consensus:02_mechanism:lpos&rev=1628877432&do=diff Leased Proof of Stake (LPoS) Return to Consensus Mechanism Leased Proof of Stake (LPoS) is an enhanced version of the Proof of Stake (PoS) consensus mechanism that operates on the Waves platform. Unlike the regular Proof-of-Stake method where each node with some amount of cryptocurrency is entitled to add the next blockchain, users can lease their balance to text/html 2021-07-18T12:21:01-0400 Anonymous (anonymous@undisclosed.example.com) https://www.omgwiki.org/dido/doku.php?id=dido:public:ra:xapend:xapend.k_consensus:02_mechanism:other&rev=1626625261&do=diff Other Consensus Methodologies Return to Consensus Mechanism text/html 2021-08-13T15:02:54-0400 Anonymous (anonymous@undisclosed.example.com) https://www.omgwiki.org/dido/doku.php?id=dido:public:ra:xapend:xapend.k_consensus:02_mechanism:pbft&rev=1628881374&do=diff Practical Byzantine Fault Tolerance (pBFT) Return to Consensus Mechanism The following definition/explanation is provided by Curran The text/html 2021-08-13T14:01:18-0400 Anonymous (anonymous@undisclosed.example.com) https://www.omgwiki.org/dido/doku.php?id=dido:public:ra:xapend:xapend.k_consensus:02_mechanism:poa&rev=1628877678&do=diff Proof of Activity (PoA) Return to Consensus Mechanism Seth provides the following definition: Proof of Activity (PoA) is a blockchain consensus algorithm used in cryptocurrencies and similar systems. It is used to ensure that all transactions occurring on the blockchain are genuine, as well as to ensure that all miners arrive at a consensus. PoA is a combination of two other blockchain consensus algorithms: text/html 2021-08-13T13:56:53-0400 Anonymous (anonymous@undisclosed.example.com) https://www.omgwiki.org/dido/doku.php?id=dido:public:ra:xapend:xapend.k_consensus:02_mechanism:poauth&rev=1628877413&do=diff Nicolò De Sandre, Leiden Institute of Advanced Computer Science (LIACS) Leiden University, A Multicriteria Evaluation of Blockchain Technologies in the Healthcare System, page 35, 2 November 2018, Accessed 18 July 2021, text/html 2021-08-18T10:15:03-0400 Anonymous (anonymous@undisclosed.example.com) https://www.omgwiki.org/dido/doku.php?id=dido:public:ra:xapend:xapend.k_consensus:02_mechanism:pob&rev=1629296103&do=diff Proof of Burn (PoB) Return to Consensus Mechanism The definition is provided by Reiff: Proof of Burn (PoB) is one of the several consensus mechanism algorithms implemented by a text/html 2021-08-13T15:37:40-0400 Anonymous (anonymous@undisclosed.example.com) https://www.omgwiki.org/dido/doku.php?id=dido:public:ra:xapend:xapend.k_consensus:02_mechanism:poc&rev=1628883460&do=diff Proof of Capacity (PoC) Return to Consensus Mechanism The definition is provided by Hayes: Proof of Capacity (PoC) is a consensus mechanism algorithm used in blockchains that allow for text/html 2021-08-13T12:55:27-0400 Anonymous (anonymous@undisclosed.example.com) https://www.omgwiki.org/dido/doku.php?id=dido:public:ra:xapend:xapend.k_consensus:02_mechanism:poet&rev=1628873727&do=diff Proof of Elapsed Time (PoET) Return to Consensus Mechanism The definition is provided by Frankenfield: Proof of Elapsed Time (PoET) is a blockchain network consensus mechanism algorithm that prevents high resource utilization and high energy consumption and keeps the process more efficient by following a fair lottery system. The algorithm uses a randomly generated elapsed time to decide text/html 2021-08-13T14:01:40-0400 Anonymous (anonymous@undisclosed.example.com) https://www.omgwiki.org/dido/doku.php?id=dido:public:ra:xapend:xapend.k_consensus:02_mechanism:poimport&rev=1628877700&do=diff Proof of Importance (PoI) Return to Consensus Mechanism Proof of Importance (PoI) is a system used to determine which users are eligible to perform the calculations necessary to add a new block of data to a blockchain and receive the associated payment. A PoI algorithm prioritizes miners based on the number of transactions in the corresponding text/html 2021-08-13T14:01:05-0400 Anonymous (anonymous@undisclosed.example.com) https://www.omgwiki.org/dido/doku.php?id=dido:public:ra:xapend:xapend.k_consensus:02_mechanism:pos&rev=1628877665&do=diff Proof of Stake (PoS) Return to Consensus Mechanism The definition is provided by Frankenfiels: The Proof of Stake (PoS) concept states that a person can mine or validate block transactions according to how many text/html 2021-08-17T13:46:27-0400 Anonymous (anonymous@undisclosed.example.com) https://www.omgwiki.org/dido/doku.php?id=dido:public:ra:xapend:xapend.k_consensus:02_mechanism:pow&rev=1629222387&do=diff Proof of Work (PoW) Return to Consensus Mechanism The definition is provided by Frankenfiels: Proof of Work (PoW) describes a system that requires a not-insignificant but feasible amount of effort in order to deter frivolous or malicious uses of computing power, such as sending spam emails or launching denial of service attacks. The concept was subsequently adapted to securing digital money by Hal Finney in 2004 through the idea of text/html 2021-08-13T13:57:30-0400 Anonymous (anonymous@undisclosed.example.com) https://www.omgwiki.org/dido/doku.php?id=dido:public:ra:xapend:xapend.k_consensus:02_mechanism:poweight&rev=1628877450&do=diff Proof of Weight (PoW) Return to Consensus Mechanism Proof of Weight (PoW) is a variant of Proof-of-Stake but adds other factors for the determination of stake. For example, Filecoin considers the amount of IPFS data. Other factors are Proof-of-Spacetime and Proof-of-Reputation. text/html 2021-11-09T16:56:54-0400 Anonymous (anonymous@undisclosed.example.com) https://www.omgwiki.org/dido/doku.php?id=dido:public:ra:xapend:xapend.k_consensus:02_mechanism:start&rev=1636495014&do=diff K.3 Consensus Mechanisms Return to DIDO Consensus Overview Return to Top Consensus Mechanism, in DIDOs, is any of a number of general-purpose Consensus Mechanisms that have been developed with each DIDO Platform choosing the mechanism best suited for its needs. Some examples are Proof of Work (PoW), Proof of State (PoS), PoS, etc.