NEO, a non-profit community-driven blockchain design which employs blockchain technology and digital identification to digitize assets has kicked off the year 2019 by getting an update. The company is about to complete the improved NEO consensus algorithm dBFT, said Erik Zhang, the founder and core developer of Neo.
Zhang tweeted
After half a year of development, the improved NEO consensus algorithm dBFT is about to be completed. dBFT will become the best consensus mechanism for blockchains.
Zhang further explained that with this development, dBFT will have more stringent entirety. Users only require to expect for one certification (15 seconds) to secure the irreversibility of the transactions and limit double-spending. This is particularly proper for commercial applications.
To know consensus protocol configuration of Blockchain networks, one needs to first understand the fundamental knowledge about a well-known dilemma known as the Byzantine General Problem.
What is the Byzantine General Problem?
The Byzantine Generals Problem is a phrase drawn from the computer science classification of an event where concerned participants must believe on a particular policy in order to evade total collapse, but where some of the concerned factions are unreliable and distributing fake data or are contrarily misleading. It tenders for an exceptional primary case of how Bitcoin’s Proof-of-Work consensus algorithm works and knowing it usually raises your understanding of other consensus algorithms.
NEO’s Delegated Byzantine Fault Tolerance(“DBFT”)
The dBFT (Delegated Byzantine Fault Tolerance) algorithm is a consensus algorithm realized within the NEO blockchain to ensure fault tolerance. The consensus is about attempting to keep one variant of precision. As blockchains operate decentralized around the world, and they accept various transactions at various times, they can frequently differ about what is the precision. The solution is to reach consensus one means or different, otherwise, all kinds of unfortunate things such as double spending can occur.
NEO executes a Delegated Byzantine Fault Tolerance consensus algorithm which gets the benefit of PoS-like characteristics(NEO holders vote on Consensus Nodes) which preserves the network from Byzantine faults utilizing minimum resources while discarding any of its problems. This explication approaches execution and scalability problems linked with prevailing blockchain implementations without a meaningful influence to the fault tolerance. The effective implementation of DBFT in NEO applies an iterative consensus process to confirm that consensus is touched. The realization of the algorithm is ancillary on the part of honest nodes in the conformity.
In the NEO consensus algorithm, Consensus Nodes are chosen by NEO owners and decide on the legality of transactions. These nodes have also been attributed to as ‘Bookkeepers’. Going ahead, they will be regarded as Consensus Nodes.
Within NEO, there are three basic elements for consensus fault tolerance:
After sweating on the NEO consensus algorithm dBFT for half a year, the plan is about to be finished. The development, Zhang says “dBFT more strict finality.” Furthermore, activities are expected to get approval in about 15 seconds to assure that the activity will not be reversible, which would stop double spending. Zhang said NEO will be highly proper for economic applications.
NEO was established in 2014 and was open sourced on GitHub in June 2015. It has a tremendous developer society around the world, such as CoZ, NEL, and NeoResearch, who contribute to NEO improvement.
Disclaimer: This information should not be interpreted as an endorsement of any cryptocurrency. It is not a recommendation to trade. The crypto market is full of surprises and overhyped assets. Do your research before buying anything. Do not invest more than you can afford to lose.
Follow us on Twitter, Facebook, Steemit, and join our Telegram channel for the latest blockchain and cryptocurrency news.
