BFT2Chain
Design and validation of scalable, Byzantine fault tolerant consensus algorithms for blockchains
(Third Party Funds Single)
Project leader:
Project members:
Start date: 1. September 2022
End date: 1. September 2025
Acronym: BFT2Chain
Funding source: Deutsche Forschungsgemeinschaft (DFG)
Abstract:
Distributed Ledger Technologies (DLTs), often referred to as blockchains, enable the realisation of reliable and attack-resilient services without a central infrastructure. However, the widely used proof-of-work mechanisms for DLTs suffer from high latencies of operations and enormous energy costs. Byzantine fault-tolerant (BFT) consensus protocols prove to be a potentially energy-efficient alternative to proof-of-work. However, current BFT protocols also present challenges that still limit their practical use in production systems. This research project addresses these challenges by (1) improving the scalability of BFT consensus protocols without reducing their resilience, (2) applying modelling approaches for making the expected performance and timing behaviour of these protocols more predictable, even under attacks, taking into consideration environmental conditions, and (3) supporting the design process for valid, automated testable BFT systems from specification to deployment in a blockchain infrastructure. The topic of scalability aims at finding practical solutions that take into account challenges such as recovery from major outages or upgrades, as well as reconfigurations at runtime. We also want to design a resilient communication layer that decouples the choice of a suitable communication topology from the actual BFT consensus protocol and thus reduces its complexity.This should be supported by the use of trusted hardware components. In addition, we want to investigate combinations of these concepts with suitable cryptographic primitives to further improve scalability. Using systematic modelling techniques, we want to be able to analyse the efficiency of scalable, complex BFT protocols (for example, in terms of throughput and latency of operations), already before deploying them in a real environment, based on knowledge of system size, computational power of nodes, and basic characteristics of the communication links. We also want to investigate robust countermeasures that help defending against targeted attacks in large-scale blockchain systems. The third objective is to support the systematic and valid implementation in a practical system, structured into a constructive, modular approach, in which a validatable BFT protocol is assembled based on smaller, validatable building blocks; the incorporation of automated test procedures based on a heuristic algorithm which makes the complex search space of misbehaviour in BFT systems more manageable; and a tool for automated deployment with accompanying benchmarking and stress testing in large-scale DLTs.
Publications:
Generic Checkpointing Support for Stream-based State-Machine Replication
Proceedings of the 10th Workshop on Principles and Practice of Consistency for Distributed Data (PaPoC '23) (Rome, 8. May 2023 - 8. May 2023)
DOI: 10.1145/3578358.3591329
URL: https://sys.cs.fau.de/publications/2023/lawniczak_23_papoc.pdf , , :
Micro Replication
53rd Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN '23) (Porto, Portugal, 27. June 2023 - 30. June 2023)
In: Proceedings of the 53rd Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN '23) 2023
DOI: 10.1109/DSN58367.2023.00024 , , :
Probabilistic Byzantine Fault Tolerance
43rd Symposium on Principles of Distributed Computing (PODC 2024) (Nantes, 17. June 2024 - 21. June 2024)
In: Proceedings of the 43rd Symposium on Principles of Distributed Computing (PODC 2024) 2024 , , , , :