3 papers
cs.DC2026
Multimmit: Extending Blocks for Faster Finality
Andrew Lewis-Pye, Patrick O'Grady
To meet the throughput demands of modern blockchain systems, protocols for State Machine Replication (SMR) increasingly have many processors disseminate blocks of transactions in p…
cs.DC2026
The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus
Andrew Lewis-Pye, Patrick O'Grady
In leader-based State Machine Replication (SMR), the leader's outgoing bandwidth is a natural throughput bottleneck. Erasure coding can alleviate this by letting the leader send ea…
cs.DC2026
Minimmit: Fast Finality with Even Faster Blocks
Brendan Kobayashi Chou, Andrew Lewis-Pye, Patrick O'Grady
Achieving low-latency consensus in geographically distributed systems remains a key challenge for blockchain and distributed database applications. To this end, there has been sign…