English
Related papers

Related papers: Leopard: Towards High Throughput-Preserving BFT fo…

200 papers

Byzantine fault tolerance (BFT) has been extensively studied in distributed trustless systems to guarantee system's functioning when up to 1/3 Byzantine processes exist. Despite a plethora of previous work in BFT systems, they are mainly…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-02-11 Quan Nguyen , Andre Cronje

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

Modern Byzantine Fault-Tolerant State Machine Replication (BFT-SMR) solutions focus on reducing communication complexity, improving throughput, or lowering latency. This work explores the energy efficiency of BFT-SMR protocols. First, we…

Cryptography and Security · Computer Science 2023-10-17 Adithya Bhat , Akhil Bandarupalli , Manish Nagaraj , Saurabh Bagchi , Aniket Kate , Michael K. Reiter

The spectacular success of Bitcoin and Blockchain Technology in recent years has provided enough evidence that a widespread adoption of a common cryptocurrency system is not merely a distant vision, but a scenario that might come true in…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-08-30 Adam Gągol , Damian Leśniak , Damian Straszak , Michał Świętek

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

In this note, we revisit EZBFT[2] and present safety, liveness and execution consistency violations in the protocol. To demonstrate these violations, we present simple scenarios, involving only four replicas, two clients, and one or two…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-09-10 Nibesh Shrestha , Mohan Kumar

Simultaneously supporting latency- and throughout-sensitive workloads in a shared environment is an increasingly more common challenge in big data clusters. Despite many advances, existing cluster schedulers force the same performance goal…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-12-10 Tan N. Le , Xiao Sun , Mosharaf Chowdhury , Zhenhua Liu

Several research projects have shown that Byzantine fault tolerance (BFT) is practical today in terms of performance. Deficiencies in other aspects might still be an obstacle to a more wide-spread deployment in real-world applications. One…

Cryptography and Security · Computer Science 2012-04-12 Benedikt Höfling , Hans P. Reiser

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ć

To maximize performance, many modern blockchain systems rely on eventually-synchronous, Byzantine fault-tolerant (BFT) consensus protocols. Two protocol designs have emerged in this space: protocols that minimize latency using a leader that…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-01-21 Qianyu Yu , Giuliano Losa , Nibesh Shrestha , Xuechao Wang

Financial institutions are currently looking into technologies for permissioned blockchains. A major effort in this direction is Hyperledger, an open source project hosted by the Linux Foundation and backed by a consortium of over a hundred…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-06-11 Kfir Lev-Ari , Alexander Spiegelman , Idit Keidar , Dahlia Malkhi

One approach to robust control for linear plants with structured uncertainty as well as for linear parameter-varying (LPV) plants (where the controller has on-line access to the varying plant parameters) is through…

Optimization and Control · Mathematics 2008-08-20 J. A. Ball , Q. Fang , G. J. Groenewald , S. ter Horst

Storage scalability is paramount in the era of big data blockchain. A storage-scalable blockchain can effectively scale out state storage to an arbitrary number of nodes and reduce the storage pressure on each, similar to distributed…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-03-26 Guangda Sun , Jialin Li

Paxos is a prominent theory of state machine replication. Recent data intensive Systems those implement state machine replication generally require high throughput. Earlier versions of Paxos as few of them are classical Paxos, fast Paxos…

Distributed, Parallel, and Cluster Computing · Computer Science 2014-07-07 Vinit Kumar , Ajay Agarwal

Existing Byzantine fault tolerance (BFT) protocols face significant challenges in the consortium blockchain scenario. On the one hand, we can make little assumptions about the reliability and security of the underlying Internet. On the…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-02-06 Peilun Li , Guosai Wang , Xiaoqi Chen , Wei Xu

Agreement protocols have been typically deployed at small scale, e.g., using three to five machines. This is because these protocols seem to suffer from a sharp performance decay. More specifically, as the size of a deployment---i.e.,…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-11-20 Rachid Guerraoui , Jad Hamza , Dragos-Adrian Seredinschi , Marko Vukolic

Scaling training compute, measured in FLOPs, has long been shown to improve the accuracy of large language models, yet training remains resource-intensive. Prior work shows that increasing test-time compute (TTC)-for example through…

Computation and Language · Computer Science 2026-01-06 Hossam Amer , Maryam Dialameh , Hossein Rajabzadeh , Walid Ahmed , Weiwei Zhang , Yang Liu

In this paper we propose Aleph, a leaderless, fully asynchronous, Byzantine fault tolerant consensus protocol for ordering messages exchanged among processes. It is based on a distributed construction of a partially ordered set and the…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-08-30 Adam Gągol , Michał Świętek

Byzantine fault-tolerant (BFT) state machine replication (SMR) has been studied for over 30 years. Recently it has received more attention due to its application in permissioned blockchain systems. A sequence of research efforts focuses on…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-05-03 Ittai Abraham , Kartik Nayak , Ling Ren , Zhuolun Xiang

Byzantine fault tolerant (BFT) state machine replication (SMR) is an important building block for constructing permissioned blockchain systems. In contrast to Nakamoto Consensus where any block obtains higher assurance as buried deeper in…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-01-12 Zhuolun Xiang , Dahlia Malkhi , Kartik Nayak , Ling Ren