Pod: An Optimal-Latency, Censorship-Free, and Accountable Generalized Consensus Layer
Orestis Alpos, Bernardo David, Jakov Mitrovski, Odysseas Sofikitis, Dionysis Zindros

TL;DR
This paper introduces pod, a consensus protocol designed to achieve the lowest possible latency of one round-trip, by eliminating inter-replica communication and enabling clients to directly process logs, thus improving blockchain scalability and responsiveness.
Contribution
The paper proposes a novel consensus primitive called pod that achieves optimal latency, censorship resistance, and accountability, with a protocol satisfying these properties and supporting various applications.
Findings
Achieves transaction confirmation within 2δ latency
Provides censorship resistance against Byzantine replicas
Supports applications like single-shot auctions
Abstract
This work addresses the inherent issues of high latency in blockchains and low scalability in traditional consensus protocols. We present pod, a novel notion of consensus whose first priority is to achieve the physically-optimal latency of , or one round-trip, i.e., requiring only one network trip (duration ) for writing a transaction and one for reading it. To accomplish this, we first eliminate inter-replica communication. Instead, clients send transactions directly to all replicas, which independently process transactions and append them to local logs. Replicas assigns a timestamp and a sequence number to each transaction in their logs, allowing clients to extract valuable metadata about the transactions and the system state. Later on, clients retrieve these logs and extract transactions (and associated metadata) from them. Necessarily, this construction achieves…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
