Pod: An Optimal-Latency, Censorship-Free, and Accountable Generalized Consensus Layer

• URL: http://arxiv.org/abs/2501.14931v4
• Date: Fri, 19 Sep 2025 08:06:57 GMT
• Title: Pod: An Optimal-Latency, Censorship-Free, and Accountable Generalized Consensus Layer
• Authors: Orestis Alpos, Bernardo David, Jakov Mitrovski, Odysseas Sofikitis, Dionysis Zindros,
• Abstract summary: pod is a novel notion of consensus whose first priority is to achieve the physically-optimal latency of $2delta$.<n>Clients send transactions directly to all replicas, which independently process transactions and append them to local logs.<n>We show pod-core, a protocol that satisfies properties such as transaction confirmation within $2delta$, censorship resistance against Byzantine replicas, and accountability for safety violations.
• Score: 1.9262692180149905
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• 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 $2\delta$, or one round-trip, i.e., requiring only one network trip (duration $\delta$) 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\delta$, 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.

Related papers

• Sedna: Sharding transactions in multiple concurrent proposer blockchains [42.71280924071485]
  We present Sedna, a user-facing protocol that replaces naive transaction replication with verifiable, rateless coding.<n>We prove Sedna guarantees liveness and emphuntil-decode privacy, significantly reducing MEV exposure.
  arXiv  Detail & Related papers  (2025-12-18T20:12:55Z)
• Calyx: Privacy-Preserving Multi-Token Optimistic-Rollup Protocol [9.113079192794027]
  We introduce Calyx, the first privacy-preserving multi-token optimistic-Rollup protocol.<n>Calyx guarantees full payment privacy for all L2 transactions, revealing no information about the sender, recipient, transferred amount, or token type.<n>We analyze the security and privacy guarantees of the protocol and provide an implementation and evaluation.
  arXiv  Detail & Related papers  (2025-09-30T18:35:31Z)
• Stingray: Fast Concurrent Transactions Without Consensus [3.664375550590193]
  Recent advances have improved the throughput and latency of blockchains by processing transactions accessing different parts of the state concurrently.<n>We present Stingray, a novel blockchain architecture that addresses these limitations.<n>We prove Stingray's security in an asynchronous network with Byzantine faults and demonstrate on a global testbed that Stingray achieves 10,000 times the throughput of prior systems for commutative workloads.
  arXiv  Detail & Related papers  (2025-01-11T12:41:46Z)
• Scalable UTXO Smart Contracts via Fine-Grained Distributed State [0.8192907805418581]
  UTXO-based smart contract platforms face an efficiency bottleneck.<n>Any transaction sent to a contract must specify the entire updated contract state.<n>We propose a technique to efficiently execute smart contracts on an extended UTXO blockchain.
  arXiv  Detail & Related papers  (2024-06-11T20:28:27Z)
• Federated Contextual Cascading Bandits with Asynchronous Communication and Heterogeneous Users [95.77678166036561]
  We propose a UCB-type algorithm with delicate communication protocols. We give sub-linear regret bounds on par with those achieved in the synchronous framework. Empirical evaluation on synthetic and real-world datasets validates our algorithm's superior performance in terms of regrets and communication costs.
  arXiv  Detail & Related papers  (2024-02-26T05:31:14Z)
• Blockchain Large Language Models [65.7726590159576]
  This paper presents a dynamic, real-time approach to detecting anomalous blockchain transactions. The proposed tool, BlockGPT, generates tracing representations of blockchain activity and trains from scratch a large language model to act as a real-time Intrusion Detection System.
  arXiv  Detail & Related papers  (2023-04-25T11:56:18Z)
• Reference Twice: A Simple and Unified Baseline for Few-Shot Instance Segmentation [103.90033029330527]
  Few-Shot Instance (FSIS) requires detecting and segmenting novel classes with limited support examples. We introduce a unified framework, Reference Twice (RefT), to exploit the relationship between support and query features for FSIS.
  arXiv  Detail & Related papers  (2023-01-03T15:33:48Z)
• CITADEL: Conditional Token Interaction via Dynamic Lexical Routing for Efficient and Effective Multi-Vector Retrieval [72.90850213615427]
  Multi-vector retrieval methods combine the merits of sparse (e.g. BM25) and dense (e.g. DPR) retrievers. These methods are orders of magnitude slower and need much more space to store their indices compared to their single-vector counterparts. We propose conditional token interaction via dynamic lexical routing, namely CITADEL, for efficient and effective multi-vector retrieval.
  arXiv  Detail & Related papers  (2022-11-18T18:27:35Z)
• A Simple and Provably Efficient Algorithm for Asynchronous Federated Contextual Linear Bandits [77.09836892653176]
  We study federated contextual linear bandits, where $M$ agents cooperate with each other to solve a global contextual linear bandit problem with the help of a central server. We consider the asynchronous setting, where all agents work independently and the communication between one agent and the server will not trigger other agents' communication. We prove that the regret of textttFedLinUCB is bounded by $tildeO(dsqrtsum_m=1M T_m)$ and the communication complexity is $tildeO(dM
  arXiv  Detail & Related papers  (2022-07-07T06:16:19Z)
• Autoregressive Entity Retrieval [55.38027440347138]
  Entities are at the center of how we represent and aggregate knowledge. The ability to retrieve such entities given a query is fundamental for knowledge-intensive tasks such as entity linking and open-domain question answering. We propose GENRE, the first system that retrieves entities by generating their unique names, left to right, token-by-token in an autoregressive fashion.
  arXiv  Detail & Related papers  (2020-10-02T10:13:31Z)
• An Efficient Permissioned Blockchain with Provable Reputation Mechanism [2.579878570919875]
  We study a hierarchical scenario to include three types of participants: providers, collectors, and governors. We introduce a reputation protocol as a measure of the reliability of collectors in the permissioned blockchain environment.
  arXiv  Detail & Related papers  (2020-02-17T09:25:59Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.