Why is dpos not easy to cause bifurcation?


A lot of times, we can always hear the term “hard fork”, which makes people turn pale. However, after bitcoin and Ethereum have experienced a certain number of forks, it does not absolutely affect people’s pursuit of these two mainstream digital currencies. However, not all digital currencies will bifurcate, and even some currencies will hardly bifurcate.

In the blockchain consensus algorithm, dpos does not have the characteristics of bifurcation, and EOS uses this consensus mechanism. Today, let’s briefly explore the dpos consensus mechanism.

What is dpos algorithm

Why is dpos not easy to cause bifurcation?

Dpos is a share authorization certification mechanism. Representatives are elected by voting to exercise their bookkeeping rights. If the bookkeeping speed is not fast enough, the bookkeeping authority needs to be handed over to the next representative.

Like pow, the final winning rule in dpos is still the longest chain. Because when an honest node sees an effective longest chain, it will switch from the current fork to the longest chain, thus promoting the longest chain to be longer and longer. But dpos is different from other algorithms. Dpos can run stably in most network conditions, and it can also solve the problems of performance and energy consumption.

Generation of blocks

Why is dpos not easy to cause bifurcation?

In the blockchain, the producers of blocks will produce blocks in turn according to a certain time interval, and any block that is not produced outside the round time is regarded as an invalid block. Therefore, as long as the block can be delivered on time, an effective longest chain will be generated. When a few nodes are attacked maliciously, most honest nodes will generate the longest chain and reach invalid bifurcation because of the slow block speed of a few nodes.

However, blockchain network interruption is also a challenge. In the case of network interruption, there may be only a few blockers on each fork. However, after the network is connected, the blockers on each fork will consciously switch to the longest chain to form the longest chain, and the fork ends there.

Voting supervision

In dpos mechanism, the function of supervision is very important. This mechanism will supervise each node to eliminate dishonesty by making relevant rules and performing them well. In dpos, the stakeholders (token holders) can vote out dishonest blockers and select honest blockers to ensure the stable operation of the network.

On the one hand, when the number of blockers in the network is insufficient, the stakeholders can vote to select a new group of blockers to resume network participation, and the new blockers will form a new longest chain due to the high degree of network participation. Of course, if more than one blocker bifurcates at the same time, he can be eliminated by voting. Only the chain determined by honest nodes can form the longest chain.

On the other hand, because the block producers in dpos network system are pre selected, in order to prevent collusion and cheating, the system will rearrange and integrate the blocks after each round of block output. Through this shuffling method, only one fork can form the longest chain.


Dpos has obvious characteristics, short block time and high efficiency. This is the main reason why EOS chooses this mechanism, but the disadvantage is that dpos is easier to be centralized than POW and POS.

At present, dpos has been applied in many projects, which is enough to prove its own security and reliability. This is also why the public often say that dpos security is not easy to bifurcate.

Why is dpos not easy to cause bifurcation?