Minimmit: fast finality with even faster blocks

Chou, Brendan Kobayashi, Lewis-Pye, Andrew and O'Grady, Patrick (2025) Minimmit: fast finality with even faster blocks. In: Financial Cryptography and Data Security 2026, 2026-03-02 - 2026-03-06.

Text (2508.10862v5) - Published Version Available under License Creative Commons Attribution. Download (644kB)

Abstract

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-MachineReplication (SMR) protocols that achieve 2-round finality under the assumption that 5 + 1 ≤ , where is the number of processors and bounds the number of processors that may exhibit Byzantine faults. In these protocols, instructions are organised into views, each led by a different designated leader, and 2-round finality means that a leader’s proposal can be finalised after just a single round of voting, meaning two rounds overall (one round for the proposal and one for voting). We introduce Minimmit, a Byzantine-fault-tolerant SMR protocol with lower latency than previous 2-round finality approaches. Our key insight is that view progression and transaction finality can operate on different quorum thresholds without compromising safety or liveness. Experiments simulating a globally distributed network of 50 processors, uniformly assigned across ten virtual regions, show that the approach leads to a 23.1% reduction in view latency and a 10.7% reduction in transaction latency compared to the state-of-the-art

Item Type:	Conference or Workshop Item (Paper)
Additional Information:	© 2025 The Author(s)
Divisions:	Mathematics
Subjects:	H Social Sciences > HG Finance Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Date Deposited:	28 Nov 2025 11:39
Last Modified:	08 Dec 2025 17:21
URI:	http://eprints.lse.ac.uk/id/eprint/130361

Actions (login required)

View Item