Pod: An Optimal-Latency, Censorship-Free, and Accountable Generalized Consensus Layer
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866917179216101376 |
|---|---|
| author | Alpos, Orestis David, Bernardo Mitrovski, Jakov Sofikitis, Odysseas Zindros, Dionysis |
| author_facet | Alpos, Orestis David, Bernardo Mitrovski, Jakov Sofikitis, Odysseas Zindros, Dionysis |
| contents | 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 $2δ$, 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 weaker properties than a total-order broadcast protocol, due to existing lower bounds. Our work models the primitive of pod and defines its security properties. We then show pod-core, a protocol that satisfies properties such as transaction confirmation within $2δ$, censorship resistance against Byzantine replicas, and accountability for safety violations. We show that single-shot auctions can be realized using the pod notion and observe that it is also sufficient for other popular applications. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_14931 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Pod: An Optimal-Latency, Censorship-Free, and Accountable Generalized Consensus Layer Alpos, Orestis David, Bernardo Mitrovski, Jakov Sofikitis, Odysseas Zindros, Dionysis Distributed, Parallel, and Cluster Computing Cryptography and Security 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 $2δ$, 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 weaker properties than a total-order broadcast protocol, due to existing lower bounds. Our work models the primitive of pod and defines its security properties. We then show pod-core, a protocol that satisfies properties such as transaction confirmation within $2δ$, censorship resistance against Byzantine replicas, and accountability for safety violations. We show that single-shot auctions can be realized using the pod notion and observe that it is also sufficient for other popular applications. |
| title | Pod: An Optimal-Latency, Censorship-Free, and Accountable Generalized Consensus Layer |
| topic | Distributed, Parallel, and Cluster Computing Cryptography and Security |
| url | https://arxiv.org/abs/2501.14931 |