i

Blockchain Complete Guide  

Byzantine & Delegated Byzantine Fault Tolerance

Byzantine Fault Tolerance: Based on the Byzantine Generals problem

Some solutions to Byzantine Fault Tolerance

  • Practical Byzantine Fault Tolerance

This approach is suitable for a small number of nodes, and there is an amount of trust required among nodes that nodes are not entirely anonymous to the network.

Used by: Hyperledger

  • Federated Byzantine Agreement

This approach is suited for a comparatively larger number of participants in the network, and relatively less trust is required among nodes
The idea is that each participant trusts a subset of nodes and their internal group reached consensus, and the whole network is created by many of these groups. They likely will have overlap.

We can use an algorithm to calculate the overlap and make sure the whole network reached a good threshold of consensus.

Advantages

  • High Throughput

  • Cost-Efficient

Used by: Ripple, Hyperledger

Delegated Byzantine Fault Tolerance

In this algorithm, ordinary nodes choose a bookkeeper node. These are chosen randomly. They should have some dedicated equipment, internet connection and a certain minimum number of coin staked. The bookkeepers are chosen randomly to add blocks to the chain, and 66% of the network nodes must agree for it to get accepted. This is fast and scalable.

Disadvantages:

  • Bookkeepers identities are disclosed to the network. So, Govt. agencies or regulatory bodies can get to regulate them.

Used in: Neo

Proof of Burn

In this consensus algorithm, unlike Proof of Work, we burn (metaphorically) coins by sending them to an irretrievable address. The more coin we burn; better chances are there for mining next block, but overtime stake in system decays.

So, we have to keep burning token for keep getting chance to add blocks.

There are many more such algorithms

  • Proof of Importance

  • Proof of Authority

  • Proof of Capacity

  • Proof of Weight

  • Proof of Service

  • Proof of Contribution

  • Proof of believability

  • Directed Acyclic Graph