Countering of Dishonest Speaker
- A random speaker will create a new block of transactions
- The random speaker will send the new block to two-thirds of the delegates
- The transactions will be verified and validated by the two-thirds of the delegates
- The delegates can easily understand the validity of the data
- If their blocks don’t match, then the transactions will not be verified and validated due to the dishonesty of the random speaker
- The dishonesty means sending the invalid data to the delegates
- A consensus will be reached by the two-thirds of delegates. The current speaker will be replaced with a new speaker.
Finding Of Dishonest Delegate
1. There is a dishonest delegate in a network
2. If other delegates compare their own versions of the block proposal, then they will be able to determine the validity of the block proposal
3. These delegates can still reach a consensus
4. Transactions of a new block will be verified and validated by the agreement of two-thirds of the delegates
5. The dishonest delegate will be replaced by the agreement of the two-thirds of the delegates
Two-thirds of the delegates can still reach a consensus in spite of the dishonest speaker and the dishonest delegate. Tolerance to malicious nodes can be decreased with the help of dBFT. Therefore, a public blockchain can see dBFT as their right tool.
*Blockchain technology can fail to guarantee privacy due to the lack of anonymity and the need for centralization. If the blockchain doesn’t guarantee privacy, then users will not adopt the blockchain.
- Almost 20 seconds are required for the creation of a new block
- Almost 1,000 Transaction Per Second (TPS) is the transaction throughput. Reaching 100,000 TPS is a hope of NEO. Commercial applications can be supported on a large scale by the network in the future.
- No need to expend energy like Proof-of-Work (PoW)
- The total finality will be received only after two conditions
- The first condition: transactions are included in a new block
- The second condition: the new block is added to the existing blockchain
5. Corrupting data is a difficult task. The control over two-thirds of the delegates is required by a dishonest delegate for the corruption of the data. Every NEO token holder can give their votes to delegates. Nodes provide their real identities.
Nodes have to provide their real identities in dBFT. Working in dBFT by using real identities is a must for a voting process of delegates.
This article is for informational purposes only. The information is provided by What Is Delegated Byzantine Fault Tolerance (dBFT)?- Part 2 and while we endeavor to keep the information up to date and correct, we make no representations or warranties of any kind, express or implied, about the completeness, accuracy, reliability, suitability or availability with respect to the website or the information, products, services, or related graphics contained on the post for any purpose. It is not an offer or solicitation of an offer to buy or sell, or a recommendation, endorsement, or sponsorship of any products, services, or companies. The Blockchain Cafe does not provide investment, tax, legal, or accounting advice. Neither the company nor the author is responsible, directly or indirectly, for any damage or loss caused or alleged to be caused by or in connection with the use of or reliance on any content, goods or services mentioned in this article.