English
Related papers

Related papers: Minimmit: Fast Finality with Even Faster Blocks

200 papers

The practical Byzantine fault tolerant (PBFT) consensus mechanism is one of the most basic consensus algorithms (or protocols) in blockchain technologies, thus its performance evaluation is an interesting and challenging topic due to a…

Cryptography and Security · Computer Science 2021-07-02 Fan-Qi Ma , Quan-Lin Li , Yi-Han Liu , Yan-Xia Chang

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

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

The recent surge of blockchain systems has renewed the interest in traditional Byzantine fault-tolerant consensus protocols. Many such consensus protocols have a primary-backup design in which an assigned replica, the primary, is…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-08-07 Suyash Gupta , Jelle Hellings , Mohammad Sadoghi

Despite being under development for over 15 years, transaction throughput remains one of the key challenges confronting blockchains, which typically has a cap of a limited number of transactions per second. A fundamental factor limiting…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-01-16 Evangelos Kolyvas , Alexandros Antonov , Spyros Voulgaris

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

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

View synchronisation is an important component of many modern Byzantine Fault Tolerant State Machine Replication (SMR) systems in the partial synchrony model. Roughly, the efficiency of view synchronisation is measured as the word…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-11-08 Andrew Lewis-Pye , Ittai Abraham

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

We propose a new protocol for the generalized consensus problem in asynchronous systems subject to Byzantine server failures. The protocol solves the consensus problem in a setting in which information about conflict between transactions is…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-05-29 Rida Bazzi , Maurice Herlihy

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

Gasper, the consensus protocol currently employed by Ethereum, typically requires 64 to 95 slots -- the units of time during which a new chain extending the previous one by one block is proposed and voted -- to finalize. This means that…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-11-04 Francesco D'Amato , Roberto Saltini , Thanh-Hai Tran , Luca Zanolini

Reconfiguration of long-lived blockchain and Byzantine fault-tolerant (BFT) systems poses fundamental security challenges. In case of state-of-the-art Proof-of-Stake (PoS) blockchains, stake reconfiguration enables so-called long-range…

Cryptography and Security · Computer Science 2021-09-10 Selma Steinhoff , Chrysoula Stathakopoulou , Matej Pavlovic , Marko Vukolić

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

The paper presents Tendermint, a new protocol for ordering events in a distributed network under adversarial conditions. More commonly known as Byzantine Fault Tolerant (BFT) consensus or atomic broadcast, the problem has attracted…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-11-25 Ethan Buchman , Jae Kwon , Zarko Milosevic

FastPay allows a set of distributed authorities, some of which are Byzantine, to maintain a high-integrity and availability settlement system for pre-funded payments. It can be used to settle payments in a native unit of value…

Cryptography and Security · Computer Science 2020-11-04 Mathieu Baudet , George Danezis , Alberto Sonnino

With the advancement of blockchain systems, many recent research works have proposed distributed ledger technology~(DLT) that employs Byzantine fault-tolerant~(BFT) consensus protocols to decide which block to append next to the ledger.…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-03-21 Christian Berger , Signe Schwarz-Rüsch , Arne Vogel , Kai Bleeke , Leander Jehl , Hans P. Reiser , Rüdiger Kapitza

Byzantine fault tolerance (BFT) consensus is a fundamental primitive for distributed computation. However, BFT protocols suffer from the ordering manipulation, in which an adversary can make front-running. Several protocols are proposed to…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-09-20 Guangren Wang , Liang Cai , Fangyu Gai , Jianyu Niu

Blockchain technology has been proposed as a new infrastructure technology for a wide variety of novel applications. Blockchains provide an immutable record of transactions, making them useful when business actors do not trust each other.…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-08-27 Joerg Evermann , Henry Kim

End-to-end blockchain latency has become a critical topic of interest in both academia and industry. However, while modern blockchain systems process transactions through multiple stages, most research has primarily focused on optimizing…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-01-22 Zhuolun Xiang , Zekun Li , Balaji Arun , Teng Zhang , Alexander Spiegelman
‹ Prev 1 4 5 6 7 8 10 Next ›