Ark: Offchain Transaction Batching in Bitcoin

• URL: http://arxiv.org/abs/2605.20952v1
• Date: Wed, 20 May 2026 09:40:20 GMT
• Title: Ark: Offchain Transaction Batching in Bitcoin
• Abstract summary: We present Ark, the first Bitcoin-compatible commit-chain.<n>A distinctive feature of Ark is its ease of deployment: users can receive offchain payments without locking any funds beforehand.
• Score: 7.848925686243984
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Bitcoin is the cryptocurrency with the largest market capitalisation, but its widespread adoption is fundamentally limited by the scalability constraints of its consensus algorithm, which requires every transaction to be confirmed onchain. To address this, several Layer-2 scalability solutions have been proposed to move payments offchain -- most notably, the Lightning Network. However, their deployment remains hindered by cumbersome setup requirements: users must lock funds onchain to participate and engage in complex auxiliary protocols (e.g., for channel rebalancing, top-ups, and routing). Other solutions, like payment pools, sidechains and rollups, cannot be implemented in a non-custodial way on Bitcoin due to its limited scripting capabilities, or require all protocol participants to update the offchain state. In this work, we present Ark, the first Bitcoin-compatible commit-chain. Ark enables offchain transactions of virtual UTXOs (VTXOs), through an untrusted operator who aggregates them into succinct onchain commitments. A distinctive feature of Ark is its ease of deployment: users can receive offchain payments without locking any funds beforehand and Ark state updates can be performed only requiring the users involved in that update. We formally define the Ark protocol and prove its security. During this process, we identified two attacks affecting the testnet implementation, which we responsibly disclosed and proposed fixes for, which have been now integrated into the mainnet implementation. Our experimental evaluation demonstrates that Ark can commit onchain to batches of arbitrarily many VTXOs with a constant-sized footprint of approximately 200 vB. Cooperative exits add one output per user, while unilateral exits require $\mathcal{O}(\log n)$ transactions of roughly 150 vB per VTXO for a batch of $n$ VTXOs.

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)
• BATTLE for Bitcoin: Capital-Efficient Optimistic Bridges with Large Committees [0.0]
  Battle for Bitcoin is a DoS-resilient dispute layer that secures optimistic bridges between Bitcoin and rollups or sidechains.<n>Our design adapts the BATTLE tournament protocol to Bitcoin's UTXO model using BitVM-style FLEX components and garbled circuits with on-demand L1 security bonds.
  arXiv  Detail & Related papers  (2025-10-07T21:11:48Z)
• Privacy-Preserving Smart Contracts for Permissioned Blockchains: A zk-SNARK-Based Recipe Part-1 [1.7265013728931]
  This work proposes a solution utilizing zk-SNARKs to provide privacy in smart contracts and blockchains.<n>The proposal includes a new type of transactions, called delegated transactions, which enable use cases like Delivery vs Payment (DvP)
  arXiv  Detail & Related papers  (2025-01-06T21:16:33Z)
• BrokerChain: A Blockchain Sharding Protocol by Exploiting Broker Accounts [30.62752646978089]
  We propose BrokerChain, a cross-shard protocol dedicated to account-based state sharding.<n>We show that BrokerChain outperforms other baselines in terms of transaction throughput, transaction confirmation latency, the queue size of the transaction pool, and workload balance.
  arXiv  Detail & Related papers  (2024-12-10T05:41:59Z)
• MAP the Blockchain World: A Trustless and Scalable Blockchain Interoperability Protocol for Cross-chain Applications [18.33587076597966]
  interoperability protocols enable cross-chain asset transfers or data retrievals between isolated chains. Existing protocols either face severe scalability issues due to high on-chain and off-chain costs, or suffer from trust concerns because of centralized designs. We propose textttMAP, a trustless blockchain interoperability protocol that relays cross-chain transactions across heterogeneous chains with high scalability.
  arXiv  Detail & Related papers  (2024-11-01T07:43:11Z)
• 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)
• CroCoDai: A Stablecoin for Cross-Chain Commerce [3.5504432743253633]
  Decentralized Finance (DeFi) has grown rapidly in value in recent years. The global DeFi ecosystem is fragmented into multiple blockchains, fueling the demand for cross-chain commerce. Existing approaches for cross-chain transactions, e.g., bridges and cross-chain deals, achieve atomicity by locking assets in escrow. We present CroCoDai to address these challenges.
  arXiv  Detail & Related papers  (2023-06-16T10:41:28Z)
• TxAllo: Dynamic Transaction Allocation in Sharded Blockchain Systems [37.22526235663589]
  This paper focuses on the transaction allocation problem to reduce the number of cross-shard transactions. A deterministic and fast allocation scheme TxAllo is proposed to dynamically infer the allocation of accounts. For a blockchain with 60 shards, TxAllo reduces the cross-shard transaction ratio from 98% to about 12%.
  arXiv  Detail & Related papers  (2022-12-22T10:22:31Z)
• Quantum-resistance in blockchain networks [46.63333997460008]
  This paper describes the work carried out by the Inter-American Development Bank, the IDB Lab, LACChain, Quantum Computing (CQC), and Tecnologico de Monterrey to identify and eliminate quantum threats in blockchain networks. The advent of quantum computing threatens internet protocols and blockchain networks because they utilize non-quantum resistant cryptographic algorithms.
  arXiv  Detail & Related papers  (2021-06-11T23:39:25Z)
• Quantum Multi-Solution Bernoulli Search with Applications to Bitcoin's Post-Quantum Security [67.06003361150228]
  A proof of work (PoW) is an important cryptographic construct enabling a party to convince others that they invested some effort in solving a computational task. In this work, we examine the hardness of finding such chain of PoWs against quantum strategies. We prove that the chain of PoWs problem reduces to a problem we call multi-solution Bernoulli search, for which we establish its quantum query complexity.
  arXiv  Detail & Related papers  (2020-12-30T18:03:56Z)

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.