# Minimmit: Fast Finality with Even Faster Blocks

Source: https://arxiv.org/abs/2508.10862

View PDF HTML (experimental) 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-Machine-Replication (SMR) protocols that achieve 2-round finality under the assumption that $5f+1\leq n$, where $n$ is the number of processors and $f$ 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. Submission history From: Andrew Lewis-Pye [view email] [v1] Thu, 14 Aug 2025 17:31:40 UTC (14 KB) [v2] Thu, 25 Sep 2025 12:50:37 UTC (31 KB) [v3] Wed, 19 Nov 2025 13:14:25 UTC (31 KB) [v4] Thu, 20 Nov 2025 10:25:21 UTC (31 KB) [v5] Tue, 25 Nov 2025 15:28:39 UTC (31 KB) [v6] Wed, 7 Jan 2026 10:30:02 UTC (31 KB) [v7] Tue, 27 Jan 2026 14:23:57 UTC (43 KB)

## Comments

**mishaderidder.eth**: Vitalik’s opinion on this https://farcaster.xyz/vitalik.eth/0x902115da