dido:public:ra:xapend:xapend.k_consensus:05_algorithm: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:05_algorithm:start [2021/11/09 16:57] char |
dido:public:ra:xapend:xapend.k_consensus:05_algorithm:start [2022/01/15 18:16] (current) nick |
||
|---|---|---|---|
| Line 13: | Line 13: | ||
| ^ [[dido:public:ra:xapend:xapend.k_consensus:02_mechanism:dbft ]] | <WRAP> | ^ [[dido:public:ra:xapend:xapend.k_consensus:02_mechanism:dbft ]] | <WRAP> | ||
| NEO</WRAP> |<WRAP> | NEO</WRAP> |<WRAP> | ||
| - | • Generating a new block on the chain takes between 15 and 20 seconds.\\ | + | * Generating a new block on the chain takes between 15 and 20 seconds. |
| - | • The transaction [[dido:public:ra:xapend:xapend.a_glossary:t:thruput|throughput]] is close to 1,000 TPS. NEO hopes to reach 100,000 TPS, which would allow the network to support large-scale commercial applications.\\ | + | * The transaction [[dido:public:ra:xapend:xapend.a_glossary:t:thruput|throughput]] is close to 1,000 TPS. NEO hopes to reach 100,000 TPS, which would allow the network to support large-scale commercial applications.\\ |
| - | • No expenditure of energy needed (unlike the Proof-of-Work [[dido:public:ra:xapend:xapend.a_glossary:c:consensus_algorithm|consensus algorithm]]).\\ | + | * No expenditure of energy needed (unlike the Proof-of-Work [[dido:public:ra:xapend:xapend.a_glossary:c:consensus_algorithm|consensus algorithm]]). |
| - | • Total finality for transactions after their [[dido:public:ra:xapend:xapend.a_glossary:c:confirmation|confirmation]].\\ | + | * Total finality for transactions after their [[dido:public:ra:xapend:xapend.a_glossary:c:confirmation|confirmation]]. |
| - | • There are no forks on the NEO [[dido:public:ra:xapend:xapend.a_glossary:b:blockchain|blockchain]].\\ | + | * There are no forks on the NEO [[dido:public:ra:xapend:xapend.a_glossary:b:blockchain|blockchain]]. |
| - | \\ | + | |
| [[https://coinrivet.com/delegated-byzantine-fault-tolerance-dbft-explained/]] | [[https://coinrivet.com/delegated-byzantine-fault-tolerance-dbft-explained/]] | ||
| </WRAP> |<WRAP> | </WRAP> |<WRAP> | ||
| Line 34: | Line 34: | ||
| * Less hardware: Participants don’t need costly, specialized equipment. A regular computer is powerful enough. | * Less hardware: Participants don’t need costly, specialized equipment. A regular computer is powerful enough. | ||
| * An incentive to “behave”: [[dido:public:ra:xapend:xapend.a_glossary:b:block_producers|Block producers]] — delegates — can be voted out at any time, so the potential for loss of income and reputation provides a hedge against bad behavior. | * An incentive to “behave”: [[dido:public:ra:xapend:xapend.a_glossary:b:block_producers|Block producers]] — delegates — can be voted out at any time, so the potential for loss of income and reputation provides a hedge against bad behavior. | ||
| - | * Flexibility: Because DPoS unlinks the election of block producers from the block production itself, it allows for a more creative and flexible approach to solving problems with either, in isolation, a recent Coinmonks piece explains. It provides a foundation for implementing “interesting governance models in blockchain applications.” | + | * Flexibility: Because DPoS unlinks the election of block producers from the block production itself, it allows for a more creative and flexible approach to solving problems with either, in isolation, a recent Coinmonks piece explains. It provides a foundation for implementing “interesting [[dido:public:ra:xapend:xapend.a_glossary:g:governance]] models in blockchain applications.” |
| [[https://www.verypossible.com/insights/pros-and-cons-of-the-delegated-proof-of-stake-consensus-model]] | [[https://www.verypossible.com/insights/pros-and-cons-of-the-delegated-proof-of-stake-consensus-model]] | ||
| </WRAP> |<WRAP> | </WRAP> |<WRAP> | ||
| Line 213: | Line 213: | ||
| </table> | </table> | ||
| - | <color><todo @char> in addition to general review of this page, replace all unordered list item asterisks with bullets and linebreaks at the end. Looks better in PDFExport.</todo></color> | + | <color blue><todo @char> Do general review of this page </todo></color> \\ |
| + | <color blue><todo @char> Decide if it's worthwhile to fix the unordered lists so they look better in pdfexport </todo></color> | ||
| /**=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- | /**=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- | ||
dido/public/ra/xapend/xapend.k_consensus/05_algorithm/start.1636495047.txt.gz · Last modified: 2021/11/09 16:57 by char
