English
Related papers

Related papers: The Hermes BFT for Blockchains

200 papers

Byzantine consensus is a critical component in many permissioned Blockchains and distributed ledgers. We propose a new paradigm for designing BFT protocols called DQBFT that addresses three major performance and scalability challenges that…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-03-01 Balaji Arun , Binoy Ravindran

This paper describes BigBFT, a multi-leader Byzantine fault tolerance protocol that achieves high throughput and scalable consensus in blockchain systems. BigBFT achieves this by (1) enabling every node to be a leader that can propose and…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-01-25 Salem Alqahtani , Murat Demirbas

Threshold cryptography is essential for many blockchain protocols. For example, many protocols rely on threshold common coin to implement asynchronous consensus, leader elections, and provide support for randomized applications. Similarly,…

Cryptography and Security · Computer Science 2025-05-26 Zhuolun Xiang , Sourav Das , Zekun Li , Zhoujun Ma , Alexander Spiegelman

This paper introduces Hamster, a novel synchronous Byzantine Fault Tolerance protocol that achieves better performance and has weaker dependency on synchrony. Specifically, Hamster employs coding techniques to significantly decrease…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-10-01 Ximing Fu , Mo Li , Qingming Zeng , Tianyang Li , Shenghao Yang , Yonghui Guan , Chuanyi Liu

Blockchain systems are designed, built and operated in the presence of failures. There are two dominant failure models, namely crash fault and Byzantine fault. Byzantine fault tolerance (BFT) protocols offer stronger security guarantees,…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-08-04 Mingyuan Gao , Hung Dang , Ee-Chien Chang , Jialin Li

This paper describes a simple and efficient Binary Byzantine faulty tolerant consensus algorithm using a weak round coordinator and the partial synchrony assumption to ensure liveness. In the algorithm, non-faulty nodes perform an initial…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-01-23 Tyler Crain

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

Achieving low-latency consensus in geographically distributed systems remains a key challenge for blockchain and distributed database applications. To this end, there has been significant recent interest in State-Machine-Replication (SMR)…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-01-28 Brendan Kobayashi Chou , Andrew Lewis-Pye , Patrick O'Grady

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 (BFT) protocol descriptions often assume application-layer networking primitives, such as best-effort and reliable broadcast, which are impossible to implement in practice in a Byzantine environment as they require…

Networking and Internet Architecture · Computer Science 2024-11-01 Manu Drijvers , Tim Gretler , Yotam Harchol , Tobias Klenze , Ognjen Maric , Stefan Neamtu , Yvonne-Anne Pignolet , Rostislav Rumenov , Daniel Sharifi , Victor Shoup

Motivated by proof-of-stake (PoS) blockchains such as Ethereum, two key desiderata have recently been studied for Byzantine-fault tolerant (BFT) state-machine replication (SMR) consensus protocols: Finality means that the protocol retains…

Cryptography and Security · Computer Science 2024-01-22 Joachim Neu , Ertem Nusret Tas , David Tse

Consensus is a fundamental building block for constructing reliable and fault-tolerant distributed services. Many Byzantine fault-tolerant consensus protocols designed for partially synchronous systems adopt a pessimistic approach when…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-06-12 Diogo Avelãs , Hasan Heydari , Eduardo Alchieri , Tobias Distler , Alysson Bessani

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

We present Carnot, a leader-based Byzantine Fault Tolerant (BFT) consensus protocol that is responsive and operates under the partially synchronous model. Responsive BFT consensus protocols exhibit wire-speed operation and deliver…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-09-04 Mohammad M. Jalalzai , Alexander Mozeika , Marcin P. Pawlowski , Ganesh Narayanaswamy

In this paper we present an open source, fully asynchronous, leaderless algorithm for reaching consensus in the presence of Byzantine faults in an asynchronous network. We prove the algorithm's correctness provided that less than a third of…

Cryptography and Security · Computer Science 2019-07-29 Pierre Chevalier , Bartlomiej Kaminski , Fraser Hutchison , Qi Ma , Spandan Sharma , Andreas Fackler , William J Buchanan

Tendermint-core blockchains (e.g. Cosmos) are considered today one of the most viable alternatives for the highly energy consuming proof-of-work blockchains such as Bitcoin and Ethereum. Their particularity is that they aim at offering…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-12-14 Yackolley Amoussou-Guenou , Antonella Del Pozzo , Maria Potop-Butucaru , Sara Tucci-Piergiovanni

Parallel Byzantine Fault Tolerant (BFT) protocols based on committee-based sharding improve scalability but weaken safety since smaller node groups are responsible for consensus. Recent approaches integrate trusted execution environments…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-03-17 Yifei Xie , Btissam Er-Rahmadi , Xiao Chen , Tiejun Ma , Jane Hillston

Since the inception of Bitcoin, the distributed systems community has shown interest in the design of efficient blockchain systems. However, initial blockchain applications (like Bitcoin) attain very low throughput, which has promoted the…

Databases · Computer Science 2020-04-28 Suyash Gupta , Sajjad Rahnama , Mohammad Sadoghi

Consensus protocols play a pivotal role to balance security and efficiency in blockchain systems. In this paper, we propose an evaluation framework for blockchain consensus protocols termed as AlphaBlock. In this framework, we compare the…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-07-28 Haitao Xiang , Zhijie Ren , Ziheng Zhou , Ning Wang , Hanqing Jin

Blockchain protocols typically aspire to run in the permissionless setting, in which nodes are owned and operated by a large number of diverse and unknown entities, with each node free to start or stop running the protocol at any time. This…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-03-05 Andrew Lewis-Pye , Tim Roughgarden