English
Related papers

Related papers: Arma: Byzantine Fault Tolerant Consensus with Hori…

200 papers

Recent Byzantine fault-tolerant (BFT) state machine replication (SMR) protocols increasingly focus on scalability to meet the requirements of distributed ledger technology (DLT). Validating the performance of scalable BFT protocol…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-10-02 Christian Berger , Sadok Ben Toumia , Hans P. Reiser

Byzantine Fault Tolerant (BFT) systems are considered by the systems research community to be state of the art with regards to providing reliability in distributed systems. BFT systems provide safety and liveness guarantees with reasonable…

Distributed, Parallel, and Cluster Computing · Computer Science 2011-10-24 Nikos Chondros , Konstantinos Kokordelis , Mema Roussopoulos

The growing interest in reliable multi-party applications has fostered widespread adoption of Byzantine Fault-Tolerant (BFT) consensus protocols. Existing BFT protocols need f more replicas than Paxos-style protocols to prevent equivocation…

Databases · Computer Science 2022-11-03 Suyash Gupta , Sajjad Rahnama , Shubham Pandey , Natacha Crooks , Mohammad Sadoghi

Synchronous consensus protocols offer a significant advantage over their asynchronous and partially synchronous counterparts by providing higher fault tolerance -- an essential benefit in distributed systems, like blockchains, where…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-03-14 Nenad Milošević , Daniel Cason , Zarko Milošević , Robert Soulé , Fernando Pedone

Byzantine-Fault-Tolerant (BFT) systems are rapidly emerging as a viable technology for production-grade systems, notably in closed consortia deployments for nancial and supply-chain applications. Unfortunately, most algorithms proposed so…

Databases · Computer Science 2019-11-11 Loïck Bonniot , Christoph Neumann , François Taïani

Low latency is one of the most desirable features of partially synchronous Byzantine consensus protocols. Existing low-latency protocols have achieved consensus with just two communication steps by reducing the maximum number of faults the…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-01-30 Mohammad M. Jalalzai , Chen Feng , Victoria Lemieux

Byzantine Fault Tolerant (BFT) consensus exhibits higher throughput in comparison to Proof of Work (PoW) in blockchains. But BFT-based protocols suffer from scalability problems with respect to the number of replicas in the network. The…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-04-30 Mohammad M. Jalalzai , Costas Busch , Golden Richard

This paper describes a simple and efficient asynchronous Binary Byzantine faulty tolerant consensus algorithm. In the algorithm, non-faulty nodes perform an initial broadcast followed by a executing a series of rounds each consisting of a…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-02-12 Tyler Crain

It is well known that Byzantine fault tolerant (BFT) consensus cannot be solved in the classic asynchronous message passing model when one-third or more of the processes may be faulty. Since many modern applications require higher fault…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-05-25 Naama Ben-David , Kartik Nayak

Despite years of intensive research, Byzantine fault-tolerant (BFT) systems have not yet been adopted in practice. This is due to additional cost of BFT in terms of resources, protocol complexity and performance, compared with crash…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-11-09 Shengyun Liu , Paolo Viotti , Christian Cachin , Vivien Quéma , Marko Vukolić

LibraBFT is a Byzantine Fault Tolerant (BFT) consensus protocol based on HotStuff. We present an abstract model of the protocol underlying HotStuff / LibraBFT, and formal, machine-checked proofs of their core correctness (safety) property…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-03-30 Harold Carr , Christopher Jenkins , Mark Moir , Victor Cacciari Miraldo , Lisandra Silva

The performance of partially synchronous BFT-based consensus protocols is highly dependent on the primary node. All participant nodes in the network are blocked until they receive a proposal from the primary node to begin the consensus…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-07-02 Mohammad M. Jalalzai , Chen Feng , Costas Busch , Golden G. Richard , Jianyu Niu

Large Language Models (LLMs) have achieved remarkable success across a wide range of applications. However, individual LLMs often produce inconsistent, biased, or hallucinated outputs due to limitations in their training corpora and model…

Cryptography and Security · Computer Science 2025-05-09 Haoxiang Luo , Gang Sun , Yinqiu Liu , Dongcheng Zhao , Dusit Niyato , Hongfang Yu , Schahram Dustdar

Numerous distributed tasks have to be handled in a setting where a fraction of nodes behaves Byzantine, that is, deviates arbitrarily from the intended protocol. Resilient, deterministic protocols rely on the detection of majorities to…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-02-10 Philipp Schneider

Fault-tolerant consensus has been studied extensively in the literature, because it is one of the most important distributed primitives and has wide applications in practice. This paper surveys important results on fault-tolerant consensus…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-08-30 Lewis Tseng

Byzantine fault tolerant protocols enable state replication in the presence of crashed, malfunctioning, or actively malicious processes. Designing such protocols without the assistance of verification tools, however, is remarkably…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-09-23 Joel Wanner , Laurent Chuat , Adrian Perrig

Multi-Byzantine Fault Tolerant (Multi-BFT) consensus allows multiple consensus instances to run in parallel, resolving the leader bottleneck problem inherent in classic BFT consensus. However, the global ordering of Multi-BFT consensus…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-03-04 Hanzheng Lyu , Shaokang Xie , Jianyu Niu , Ivan Beschastnikh , Yinqian Zhang , Mohammad Sadoghi , Chen Feng

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

It is a common belief that Byzantine fault-tolerant solutions for consensus are significantly slower than their crash fault-tolerant counterparts. Indeed, in PBFT, the most widely known Byzantine fault-tolerant consensus protocol, it takes…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-07-28 Petr Kuznetsov , Andrei Tonkikh , Yan X Zhang

Hyperledger Fabric (HLF) is a flexible permissioned blockchain platform designed for business applications beyond the basic digital coin addressed by Bitcoin and other existing networks. A key property of HLF is its extensibility, and in…

Cryptography and Security · Computer Science 2017-09-21 João Sousa , Alysson Bessani , Marko Vukolić