12 papers
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…
Volition-Guarded Multiagent Atomic Transactions: Describing People and their Machines
Andy Lewis-Pye, Ehud Shapiro
Formal models for concurrent and distributed systems describe machines; the people who operate them are either ignored or treated as external environment. Yet, key distributed syst…
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…
Constitutional Consensus for Democratic Governance
Idit Keidar, Andrew Lewis-Pye, Ehud Shapiro +1
Permissionless-consensus-based Decentralised Autonomous Organisations (DAOs) are the prevailing paradigm for participant-governed digital organisations. As participants have verifi…
Reaching Univalency with Subquadratic Communication
Andrew Lewis-Pye
The Dolev-Reischuk lower bound establishes that any deterministic Byzantine Agreement (BA) protocol for processors tolerating faults requires messages. But what…
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…