Next Article in Journal
An Analysis of the Supply of Open Government Data
Next Article in Special Issue
Pulverization in Cyber-Physical Systems: Engineering the Self-Organizing Logic Separated from Deployment
Previous Article in Journal
Browser Forensic Investigations of WhatsApp Web Utilizing IndexedDB Persistent Storage
Previous Article in Special Issue
Challenges of PBFT-Inspired Consensus for Blockchain and Enhancements over Neo dBFT
Article

A MILP Model for a Byzantine Fault Tolerant Blockchain Consensus

1
OptBlocks, Avenida Jo ao Pinheiro, 274 Sala 201-Lourdes, Belo Horizonte-MG 30130-186, Brazil
2
Graduate Program in Computational Sciences (PPG-CComp), Universidade do Estado do Rio de Janeiro, Rua S ao Francisco Xavier, 524-Maracan a, Rio de Janeiro-RJ 20550-013, Brazil
3
Department of Computer Science, Universidade Federal de Ouro Preto, Campus Morro do Cruzeiro, Ouro Preto-MG 35400-000, Brazil
4
Research & Development Department, Neo Global Development, 80, Zhengxue Rd, Shanghai 200082, China
5
Institute of Computing, Universidade Federal Fluminense, Av. Gal. Milton Tavares de Souza, São Domingos, Niterói-RJ 24210-310, Brazil
*
Authors to whom correspondence should be addressed.
Future Internet 2020, 12(11), 185; https://doi.org/10.3390/fi12110185
Received: 30 September 2020 / Revised: 20 October 2020 / Accepted: 26 October 2020 / Published: 29 October 2020
Mixed-integer mathematical programming has been widely used to model and solve challenging optimization problems. One interesting feature of this technique is the ability to prove the optimality of the achieved solution, for many practical scenarios where a linear programming model can be devised. This paper explores its use to model very strong Byzantine adversaries, in the context of distributed consensus systems. In particular, we apply the proposed technique to find challenging adversarial conditions on a state-of-the-art blockchain consensus: the Neo dBFT. Neo Blockchain has been using the dBFT algorithm since its foundation, but, due to the complexity of the algorithm, it is challenging to devise definitive algebraic proofs that guarantee safety/liveness of the system (and adjust for every change proposed by the community). Core developers have to manually devise and explore possible adversarial attacks scenarios as an exhaustive task. The proposed multi-objective model is intended to assist the search of possible faulty scenario, which includes three objective functions that can be combined as a maximization problem for testing one-block finality or a minimization problem for ensuring liveness. Automated graphics help developers to visually observe attack conditions and to quickly find a solution. This paper proposes an exact adversarial model that explores current limits for practical blockchain consensus applications such as dBFT, with ideas that can also be extended to other decentralized ledger technologies. View Full-Text
Keywords: byzantine fault tolerance; consensus; distributed ledger technology; exact adversarial model; integer programming; Neo Blockchain byzantine fault tolerance; consensus; distributed ledger technology; exact adversarial model; integer programming; Neo Blockchain
Show Figures

Figure 1

MDPI and ACS Style

Nazário Coelho, V.; Pereira Araújo, R.; Gambini Santos, H.; Yong Qiang, W.; Machado Coelho, I. A MILP Model for a Byzantine Fault Tolerant Blockchain Consensus. Future Internet 2020, 12, 185. https://doi.org/10.3390/fi12110185

AMA Style

Nazário Coelho V, Pereira Araújo R, Gambini Santos H, Yong Qiang W, Machado Coelho I. A MILP Model for a Byzantine Fault Tolerant Blockchain Consensus. Future Internet. 2020; 12(11):185. https://doi.org/10.3390/fi12110185

Chicago/Turabian Style

Nazário Coelho, Vitor, Rodolfo Pereira Araújo, Haroldo Gambini Santos, Wang Yong Qiang, and Igor Machado Coelho. 2020. "A MILP Model for a Byzantine Fault Tolerant Blockchain Consensus" Future Internet 12, no. 11: 185. https://doi.org/10.3390/fi12110185

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop