Calyx: Privacy-Preserving Multi-Token Optimistic-Rollup Protocol

• URL: http://arxiv.org/abs/2510.00164v1
• Date: Tue, 30 Sep 2025 18:35:31 GMT
• Title: Calyx: Privacy-Preserving Multi-Token Optimistic-Rollup Protocol
• Authors: Dominik Apel, Zeta Avarikioti, Matteo Maffei, Yuheng Wang,
• Abstract summary: 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.
• Score: 9.113079192794027
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Rollup protocols have recently received significant attention as a promising class of Layer 2 (L2) scalability solutions. By utilizing the Layer 1 (L1) blockchain solely as a bulletin board for a summary of the executed transactions and state changes, rollups enable secure off-chain execution while avoiding the complexity of other L2 mechanisms. However, to ensure data availability, current rollup protocols require the plaintext of executed transactions to be published on-chain, resulting in inherent privacy limitations. In this paper, we address this problem by introducing Calyx, the first privacy-preserving multi-token optimistic-Rollup protocol. Calyx guarantees full payment privacy for all L2 transactions, revealing no information about the sender, recipient, transferred amount, or token type. The protocol further supports atomic execution of multiple multi-token transactions and introduces a transaction fee scheme to enable broader application scenarios while ensuring the sustainable operation of the protocol. To enforce correctness, Calyx adopts an efficient one-step fraud-proof mechanism. We analyze the security and privacy guarantees of the protocol and provide an implementation and evaluation. Our results show that executing a single transaction costs approximately $0.06 (0.00002 ETH) and incurs only constant-size on-chain cost in asymptotic terms.

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)
• Efficient Bitcoin Meta-Protocol Transaction and Data Discovery Through nLockTime Field Repurposing [0.0]
  We describe a lightweight Bitcoin meta-protocol that enables highly efficient transaction discovery at zero marginal block space cost.<n>The protocol repurposes the mandatory 4-byte nLockTime field of every Bitcoin transaction as a compact metadata header.
  arXiv  Detail & Related papers  (2025-12-18T15:49:28Z)
• Epass: Efficient and Privacy-Preserving Asynchronous Payment on Blockchain [39.093148638790346]
  Buy Now Pay Later (BNPL) is a rapidly proliferating e-commerce model, offering consumers to get the product immediately and defer payments.<n>Emerging blockchain technologies endow BNPL platforms with digital currency transactions, allowing BNPL platforms to integrate with digital wallets.<n>However, the transparency of transactions causes critical privacy concerns because malicious participants may derive consumers' financial statuses from on-chain asynchronous payments.
  arXiv  Detail & Related papers  (2025-06-11T04:32:54Z)
• A Security Framework for General Blockchain Layer 2 Protocols [11.284365017329861]
  We present the first general security framework for Layer 2 (L2) protocols.<n>Our framework is based on the IITM-based Universal Composability (iUC) framework.<n>We analyze an example from each of the three dominant L2 scaling paradigms: a payment channel (Brick), a sidechain (Liquid Network), and a rollup (Arbitrum)
  arXiv  Detail & Related papers  (2025-04-21T08:48:24Z)
• Atomic Transfer Graphs: Secure-by-design Protocols for Heterogeneous Blockchain Ecosystems [7.312229214872541]
  We propose a framework for generating secure-by-design protocols that realize common security and functionality goals.<n>The resulting protocols build upon Timelock Contracts (CTLCs), a novel minimal smart contract functionality.<n>Our framework is the first to provide generic and provably secure protocols for all these use cases while matching or improving the performance of existing use-case-specific protocols.
  arXiv  Detail & Related papers  (2025-01-29T17:25:53Z)
• Pod: An Optimal-Latency, Censorship-Free, and Accountable Generalized Consensus Layer [1.9262692180149905]
  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.
  arXiv  Detail & Related papers  (2025-01-24T21:41:03Z)
• AsyncSC: An Asynchronous Sidechain for Multi-Domain Data Exchange in Internet of Things [38.94331838546716]
  Current state-of-the-art (SOTA) schemes for IoT multi-domain data exchange are constrained by the need for synchronous networks.<n>In this paper, we propose AsyncSC, a novel asynchronous sidechain construction.<n>Results show that AsyncSC outperforms SOTA schemes, improving throughput by an average of 1.21 to 3.96 times, reducing transaction latency by 59.76% to 83.61%, and maintaining comparable resource overhead.
  arXiv  Detail & Related papers  (2024-12-17T09:43:37Z)
• The Latency Price of Threshold Cryptosystem in Blockchains [52.359230560289745]
  We study the interplay between threshold cryptography and a class of blockchains that use Byzantine-fault tolerant (BFT) consensus protocols.<n>Our measurements from the Aptos mainnet show that the optimistic approach reduces latency overhead by 71%.
  arXiv  Detail & Related papers  (2024-07-16T20:53:04Z)
• Fast and Secure Decentralized Optimistic Rollups Using Setchain [1.1534313664323634]
  Layer 2 optimistic rollups (L2) are a faster alternative that offer the same interface in terms of smart contract development and user interaction. We propose a decentralized L2 optimistic rollup based on Setchain, a decentralized Byzantine-tolerant implementation of sets.
  arXiv  Detail & Related papers  (2024-06-04T13:45:12Z)
• Sequencer Level Security [2.756899615600916]
  We introduce the Sequencer Level Security (SLS) protocol, an enhancement to sequencing protocols of rollups. We describe the mechanics of the protocol for both the transactions submitted to the rollup mempool, as well as transactions originating from Layer one. We implement a prototype of the SLS protocol, Zircuit, which is built on top of Geth and the OP stack.
  arXiv  Detail & Related papers  (2024-05-03T02:47:40Z)
• 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)
• Data post-processing for the one-way heterodyne protocol under composable finite-size security [62.997667081978825]
  We study the performance of a practical continuous-variable (CV) quantum key distribution protocol. We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime. This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
  arXiv  Detail & Related papers  (2022-05-20T12:37:09Z)
• Jolteon and Ditto: Network-Adaptive Efficient Consensus with Asynchronous Fallback [46.30924494799245]
  We develop Ditto, a Byzantine SMR protocol that enjoys the best of both worlds: optimal communication on and off the happy path and progress guarantee under asynchrony and DDoS attacks. Specifically, we start from HotStuff, a state-of-the-art linear protocol, and gradually build Ditto. As a separate contribution and an intermediate step, we design a 2-chain version of HotStuff, Jolteon. We implement and experimentally evaluate all our systems. Notably, Jolteon's commit latency outperforms HotStuff by 200-300ms with varying system size.
  arXiv  Detail & Related papers  (2021-06-18T21:34:17Z)

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.