English
Related papers

Related papers: Autobahn: Seamless high speed BFT

200 papers

With the increasing deployment of deep neural networks (DNNs) in terrestrial and aerospace safety-critical applications, system reliability has emerged as a co-equal design metric alongside computational efficiency. Algorithm-based fault…

Cryptography and Security · Computer Science 2025-04-22 Xinghua Xue , Cheng Liu , Feng Min , Tao Luo , Yinhe Han

We present new protocols for Byzantine state machine replication and Byzantine agreement in the synchronous and authenticated setting. The celebrated PBFT state machine replication protocol tolerates $f$ Byzantine faults in an asynchronous…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-09-14 Ittai Abraham , Srinivas Devadas , Danny Dolev , Kartik Nayak , Ling Ren

Byzantine fault-tolerant agreement (BFT) in a partially synchronous system usually requires 3f + 1 nodes to tolerate f faulty replicas. Due to their high throughput and finality property BFT algorithms build the core of recent permissioned…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-05-26 Ines Messadi , Markus Horst Becker , Kai Bleeke , Leander Jehl , Sonia Ben Mokhtar , Rüdiger Kapitza

PermitBFT establishes a permissioned byzantine ledger in the partially synchronous networking model. For n replicas, PermitBFT tolerates up to f < n/3 byzantine replicas. It is the first BFT protocol to achieve a latency of just 2 message…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-11-03 Roland Schmid , Roger Wattenhofer

Distributed Software Defined Networking (SDN) controllers aim to solve the issue of single-point-of-failure and improve the scalability of the control plane. Byzantine and faulty controllers, however, may enforce incorrect configurations…

Networking and Internet Architecture · Computer Science 2019-02-25 Ermin Sakic , Wolfgang Kellerer

Modern high-throughput BFT consensus protocols use streamlined push-pull mechanisms to disseminate blocks and keep happy-path performance optimal. Yet state-of-the-art designs lack a principled and efficient way to exchange blocks, which…

Cryptography and Security · Computer Science 2025-11-20 Tasos Kichidis , Lefteris Kokoris-Kogias , Arun Koshy , Ilya Sergey , Alberto Sonnino , Mingwei Tian , Jianting Zhang

DAG-based BFT consensus has attracted growing interest in distributed data management systems for consistent replication in untrusted settings due to its high throughput and resilience to asynchrony. However, existing protocols still suffer…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-02-04 Shaokang Xie , Dakai Kang , Hanzheng Lyu , Jianyu Niu , Mohammad Sadoghi

Production data centers operate under various workload sizes ranging from latency-sensitive mice flows to long-lived elephant flows. However, the predominant load balancing scheme in data center networks, equal-cost multi-path (ECMP), is…

Networking and Internet Architecture · Computer Science 2020-10-05 Sultan Alanazi , Bechir Hamdaoui

The view synchronization problem lies at the heart of many Byzantine Fault Tolerant (BFT) State Machine Replication (SMR) protocols in the partial synchrony model, since these protocols are usually based on views. Liveness is guaranteed if…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-03-19 Andrew Lewis-Pye , Dahlia Malkhi , Oded Naor , Kartik Nayak

Arma is a Byzantine Fault Tolerant (BFT) consensus system designed to achieve horizontal scalability across all hardware resources: network bandwidth, CPU, and disk I/O. As opposed to preceding BFT protocols, Arma separates the…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-05-29 Yacov Manevich , Hagar Meir , Kaoutar Elkhiyaoui , Yoav Tock , May Buzaglo

This paper introduces Slipstream, a Byzantine Fault Tolerance (BFT) protocol where nodes concurrently propose blocks to be added to a Directed Acyclic Graph (DAG) and aim to agree on block ordering. Slipstream offers two types of block…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-04-23 Nikita Polyanskii , Sebastian Muller , Mayank Raikwar

We propose a novel relaxation of the classic asynchronous network model, called the random asynchronous model, which removes adversarial message scheduling while preserving unbounded message delays and Byzantine faults. Instead of an…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-05-27 George Danezis , Jovan Komatovic , Lefteris Kokoris-Kogias , Alberto Sonnino , Igor Zablotchi

Arma is a Byzantine Fault Tolerant (BFT) consensus system designed to achieve linear scalability across all hardware resources: network bandwidth, CPU, and disk I/O. As opposed to preceding BFT protocols, Arma separates the dissemination…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-12-22 Yacov Manevich

Large scale cryptocurrencies require the participation of millions of participants and support economic activity of billions of dollars, which has led to new lines of work in binary Byzantine Agreement (BBA) and consensus. The new work aims…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-04-07 Thaddeus Dryja , Quanquan C. Liu , Neha Narula

With the advancement of blockchain technology, chained Byzantine Fault Tolerant (BFT) protocols have been increasingly adopted in practical systems, making their performance a crucial aspect of the study. In this paper, we introduce a…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-01-08 Yining Tang , Qihang Luo , Runchao Han , Jianyu Niu , Chen Feng , Yinqian Zhang

The success of blockchains has sparked interest in large-scale deployments of Byzantine fault tolerant (BFT) consensus protocols over wide area networks. A central feature of such networks is variable communication bandwidth across nodes…

Networking and Internet Architecture · Computer Science 2024-06-21 Lei Yang , Seo Jin Park , Mohammad Alizadeh , Sreeram Kannan , David Tse

Recent developments in the Byzantine Fault Tolerant consensus protocols have shown the DAG-based protocols to be a very promising technique. While early implementations of DAG-based protocols such as Narwhal/Bullshark trade high throughput…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-08-27 Andrey Chursin

With the rapid development of blockchain, Byzantine fault-tolerant protocols have attracted revived interest recently. To overcome the theoretical bounds of Byzantine fault tolerance, many protocols attempt to use Trusted Execution…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-07-07 Jiashuo Zhang , Jianbo Gao , Ke Wang , Zhenhao Wu , Ying Lan , Zhi Guan , Zhong Chen

There is surge of interest to the blockchain technology not only in the scientific community but in the business community as well. Proof of Work (PoW) and Byzantine Fault Tolerant (BFT) are the two main classes of consensus protocols that…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-06-12 Mohammad M. Jalalzai , Costas Busch

Byzantine Fault Tolerant (BFT) consensus, a cornerstone of blockchain technology, has seen significant advancements. While existing BFT protocols ensure security guarantees, they often suffer from efficiency challenges, particularly under…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-04-15 Qingming Zeng , Mo Li , Ximing Fu , Chuanyi Liu , Hui Jiang