Distributed Consensus

Last updated 4 years ago

Was this helpful?

Distributed Consensus

Good Reference

Lamport describe the byzantine general problem in a paper published in 1982 on

Lamport is one of the father of consensus mechanism for decentralized computing. All his publication are on:

If > 2/3 of the generals are loyal, there is a message algorithm solving the problem and guaranteeing that non corrupted generals can take a common decision , even if distributed. Say othewise one corrupted general can confound 2 non corrupted general

History of article on Algorithm/Research paper to find algorithm solving the Byzantine General Problem

Reaching Agreement in the presence of fault (1980, Lamport) :
The byzantine Generals Strick again (1981, Dolev):
Weak byzantine General (1982, Lamport) : -> too limited and replaced by the bizantine general problem
The bizantine General Problem (1982, Lamport):
The Weak Byzantine Generals Problem (1983, Lamport):

IBFT

Good explanation article:

IBFT has been inspired by the first article of Liskov on PBFT in 1999

Ethereum/CLick PoA:

Ethereum/IBFT: (it has been inspired by Liskov and Click Consensus + This work is also inspired by , , , and .)

Good article from Consensys on IBFT 2.0:

BFT => identiﬁes a class of blockchain consensus protocols that ensure blockchain consistency despite some of the nodes, referred to as Byzantine, being malicious and acting arbitrarily.
PoA => Another way to classify consensus protocols by the technique used to prevent an attacker from conducting a Sybil attack which consists in one node being able to gain power in the system by creating multiples pseudonymous identities

To prevent Sybil attacks you have different technics:

Proof of Work
Proof of Stake
PoA -> we prevent sybil attack by authorizing only authorized node to propose new blocks

So on consorsium network , we have setup the network on PoA mode for the validator node -> but it stays IBFT Robust, meaning that if a node is corrupted, IBFT 2.0 will assure network is not finished.

IBFT is a type of POA, If PoA is a color, IBFT is green, RAFT is blue, And Lamport is Picasso

Sybil attack

PreviousSolid POD NextEthereum 2

Last updated 4 years ago

Was this helpful?

Good Reference

Lamport describe the byzantine general problem in a paper published in 1982 on

Lamport is one of the father of consensus mechanism for decentralized computing. All his publication are on:

History of article on Algorithm/Research paper to find algorithm solving the Byzantine General Problem

Reaching Agreement in the presence of fault (1980, Lamport) :
The byzantine Generals Strick again (1981, Dolev):
Weak byzantine General (1982, Lamport) : -> too limited and replaced by the bizantine general problem
The bizantine General Problem (1982, Lamport):
The Weak Byzantine Generals Problem (1983, Lamport):

IBFT

Good explanation article:

IBFT has been inspired by the first article of Liskov on PBFT in 1999

Ethereum/CLick PoA:

Ethereum/IBFT: (it has been inspired by Liskov and Click Consensus + This work is also inspired by , , , and .)

Good article from Consensys on IBFT 2.0:

BFT => identiﬁes a class of blockchain consensus protocols that ensure blockchain consistency despite some of the nodes, referred to as Byzantine, being malicious and acting arbitrarily.
PoA => Another way to classify consensus protocols by the technique used to prevent an attacker from conducting a Sybil attack which consists in one node being able to gain power in the system by creating multiples pseudonymous identities

To prevent Sybil attacks you have different technics:

Proof of Work
Proof of Stake
PoA -> we prevent sybil attack by authorizing only authorized node to propose new blocks

So on consorsium network , we have setup the network on PoA mode for the validator node -> but it stays IBFT Robust, meaning that if a node is corrupted, IBFT 2.0 will assure network is not finished.

IBFT is a type of POA, If PoA is a color, IBFT is green, RAFT is blue, And Lamport is Picasso

Sybil attack