English
Related papers

Related papers: BigBFT: A Multileader Byzantine Fault Tolerance Pr…

200 papers

Streamlined Byzantine Fault Tolerant (BFT) protocols, such as HotStuff [PODC'19], and weighted voting represent two possible strategies to improve consensus in the distributed systems world. Several studies have been conducted on both…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-10-30 Diana Micloiu , Rowdy Chotkan , Jérémie Decouchant

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

Byzantine fault-tolerant systems have been researched for more than four decades, and although shown possible early, the solutions were impractical for a long time. With PBFT the first practical solution was proposed in 1999 and spawned new…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-01-13 Thomas Loruenser , Benjamin Rainer , Florian Wohner

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

Today's practical partially synchronous Byzantine Fault Tolerant (BFT) consensus protocols trade off low latency and high throughput. On the one end, traditional BFT protocols such as PBFT and its derivatives optimize for latency. They…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-03-06 Balaji Arun , Zekun Li , Florian Suri-Payer , Sourav Das , Alexander Spiegelman

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) 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 Blizzard, a Byzantine Fault Tolerant (BFT) distributed ledger protocol that is aimed at making mobile devices first-class citizens in the consensus process. Blizzard introduces a novel two-tier architecture by having the mobile…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-01-07 Mehrdad Kiamari , Bhaskar Krishnamachari , Muhammad Naveed , Seokgu Yun

Fault tolerance of a blockchain is often characterized by the fraction $f$ of "adversarial power" that it can tolerate in the system. Despite the fast progress in blockchain designs in recent years, existing blockchain systems can still…

Cryptography and Security · Computer Science 2021-11-17 Ruomu Hou , Haifeng Yu , Prateek Saxena

Permissioned Blockchains are increasingly considered in enterprise use-cases, many of which do not require geo-distribution, or even disallow it due to legislation. Examples include country-wide networks, such as Alastria, or those deployed…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-07-27 Manuel Bravo , Zsolt István , Man-Kit Sit

As Byzantine Fault Tolerant (BFT) protocols begin to be used in permissioned blockchains for user-facing applications such as payments, it is crucial that they provide low latency. In pursuit of low latency, some recently proposed BFT…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-01-08 Daniel Qian , Xiyu Hao , Jinkun Geng , Yuncheng Yao , Aurojit Panda , Jinyang Li , Anirudh Sivaraman

Achieving agreement among distributed parties is a fundamental task in modern systems, underpinning applications such as consensus in blockchains, coordination in cloud infrastructure, and fault tolerance in critical services. However, this…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-02-18 Andrei Constantinescu , Marc Dufay , Anton Paramonov , Roger Wattenhofer

Multi-BFT consensus runs multiple leader-based consensus instances in parallel, circumventing the leader bottleneck of a single instance. However, it contains an Achilles' heel: the need to globally order output blocks across instances.…

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

We present ChonkyBFT, a partially-synchronous Byzantine fault-tolerant (BFT) consensus protocol used in the ZKsync system. The proposed protocol is a hybrid protocol inspired by FAB Paxos, Fast-HotStuff, and HotStuff-2. It is a…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-03-20 Bruno França , Denis Kolegov , Igor Konnov , Grzegorz Prusak

Byzantine Fault-Tolerant (BFT) protocols play an important role in blockchains. As the deployment of such systems extends to wide-area networks, the scalability of BFT protocols becomes a critical concern. Optimizations that assign specific…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-11-10 Hanish Gogada , Christian Berger , Leander Jehl , Hans P. Reiser , Hein Meling

Byzantine Fault-Tolerant (BFT) protocols have been proposed to tolerate malicious behaviors in state machine replications. With classic BFT protocols, the total number of replicas is known and fixed a priori. The resilience of BFT…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-06-12 Jiangshan Yu

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

Distributed Ledger Technologies (DLTs), when managed by a few trusted validators, require most but not all of the machinery available in public DLTs. In this work, we explore one possible way to profit from this state of affairs. We devise…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-05-10 Marco Benedetti , Francesco De Sclavis , Marco Favorito , Giuseppe Galano , Sara Giammusso , Antonio Muci , Matteo Nardelli

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

Practical Byzantine Fault Tolerance (PBFT) is a seminal state machine replication protocol that achieves a performance comparable to non-replicated systems in realistic environments. A reason for such high performance is the set of…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-07-26 Christian Berger , Hans P. Reiser , Alysson Bessani
‹ Prev 1 3 4 5 6 7 10 Next ›