The dBFT consensus algorithm: features

The dBFT consensus algorithm: features

Author: Robert Strickland

The dBFT consensus algorithm: features

The dBFT consensus algorithm
In our past publications, we have already considered such consensus algorithms as Pos and PoW, lPoS, PoB, etc. Today's article is about dBFT algorithm, which is used by NEO cryptocurrency and provides better network scalability and performance compared to other alternatives.


The name dBFT translates from English as delegated tasks of Byzantine generals. Actually, to understand how it works, consider a simplified analogy. Let's assume that there is a state called X (blockchain). It has a certain number of citizens (users), who are given the opportunity to vote by choosing a leader or delegate (a representative of the "voice of the people").

These delegates propose laws for consideration that will be valid in the country. Each citizen makes suggestions about the state's legislative framework, which the delegate can then support or not support.

When it comes time to pass a law, a speaker is chosen at random from all the delegates. In doing so, he calculates how much his decision will affect the level of happiness in the country. Other delegates also estimate this figure and compare it with their own. If more than 66% of the delegates confirm that the happiness level is correct, the law is passed.

If the 66% level of acceptance is not reached, then a new speaker is elected and the process starts all over again. Such a system makes it possible to limit the activities of traitors and leaders with limited computing resources.


If the scheme described above is transferred to the blockchain plane, all blockchain token holders play the role of citizens. They are regular nodes that can perform transactions and exchange currency, but they are not allowed to verify blocks. Delegates represent accounting nodes. They are responsible for validating all blocks that are added to the blockchain.

In order to gain the status of an accounting node, certain requirements must be met. For example, for NEO:

Dedicated hardware.
A dedicated Internet connection.
A certain amount of GAS in the account (at the time of writing, that's 1,000).
If you follow the analogy further, the law is a block in the chain, and the happiness level is its hash.


High speed of transaction confirmation.
Elimination of the probability of unplanned forks.
High throughput.
Complete completeness of the network.
Disadvantages of dBFT

Perhaps the most significant disadvantage of the dBFT consensus algorithm is the partial centralization through the use of these very delegates or accounting nodes. Despite the fact that they are chosen by the users, they concentrate all the power in their hands. In addition, it is likely that most of these nodes will be in the hands of the developers themselves.

To date, dBFT has only been used in the NEO network. In this blockchain, it performs well and keeps the network running.


Other instructions

Cold and hot cryptocurrency wallets. What is the difference and how to create them?
Securing Information: Shamir's Secret Sharing Scheme and Bitcoin
"Reputation Institute. What will happen to blockchain in 30 years
What is Worldcoin? Why the creator of ChatGPT needs a catalog of all the inhabitants of the planet
Measure blockchain. How important is the TVL indicator
What is Lightning Network and how the project solves bitcoin's main problem