Work

Repeated Agreement is Cheap! On Weak Accountability and Multishot Byzantine Agreement

Year: 2025

Type: conference-paper

Abstract: Byzantine Agreement (BA) allows n processes to propose input values to reach consensus on a common, valid Lo-bit value, even in the presence of up to t < n faulty processes that can deviate arbitrarily from the protocol. Although strategies like randomization, adaptiveness, and batching have been extensively explored to mitigate the inherent limitations of one-shot agreement tasks, there has been limited progress on achieving good amortized performance for multi-shot agreement, despite its obvious relevance to long-lived functionalities such as state machine replication.

Source: ACM Symposium on Principles of Distributed Computing (PODC)

DOI: 10.1145/3732772.3733520

Authors: Pierre Civit, Muhammad Ayaz Dzulfikar, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, Manuel Vidigueira

Institutions: École Polytechnique Fédérale de Lausanne, National University of Singapore

Language: English

Topic: Distributed systems and fault tolerance

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Funders: Ministry of Education - Singapore, Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung, Ministry of Education, India

Awards: Broker-accelerated Cryptocurrencies, G7724790625, ChopChop: A High Performance Decentralized Execution Platform