BATTLE for Bitcoin: Capital-Efficient Optimistic Bridges with Large Committees

• URL: http://arxiv.org/abs/2510.06468v1
• Date: Tue, 07 Oct 2025 21:11:48 GMT
• Title: BATTLE for Bitcoin: Capital-Efficient Optimistic Bridges with Large Committees
• Authors: Sergio Demian Lerner, Ariel Futoransky,
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present BATTLE for Bitcoin, a DoS-resilient dispute layer that secures optimistic bridges between Bitcoin and rollups or sidechains. 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. Disputes are resolved in logarithmic rounds while recycling rewards, keeping the honest asserter's minimum initial capital constant even under many permissionless challengers. The construction is fully contestable (challengers can supply higher-work counter-proofs) and relies only on standard timelocks and pre-signed transaction DAGs, without new opcodes. For $N$ operators, the protocol requires $O(N^2)$ pre-signed transactions, signatures, and message exchanges, yet remains practical at $N\!\gtrsim\!10^3$, enabling high decentralization.

Related papers

• Bithoven: Formal Safety for Expressive Bitcoin Smart Contracts [0.6187780920448871]
  This paper introduces Bithoven, a high-level language designed to bridge the gap between expressiveness and formal safety.<n>By integrating a strict type checker and a resource liveness analyzer with a semantic control-flow analyzer, Bithoven eliminates major categories of consensus and logic defects.
  arXiv  Detail & Related papers  (2026-01-04T08:48:34Z)
• 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)
• Commit-Reveal$^2$: Securing Randomness Beacons with Randomized Reveal Order in Smart Contracts [25.885166716453153]
  We present Commit-Reveal$2$, a layered design for blockchain deployments that cryptographically randomizes the final reveal order.<n>The protocol is architected as a hybrid system, where routine coordination runs off chain for efficiency.<n>We release a publicly verifiable prototype and evaluation artifacts to support replication and adoption in blockchain applications.
  arXiv  Detail & Related papers  (2025-04-04T21:05:51Z)
• Union: A Trust-minimized Bridge for Rootstock [0.3374875022248865]
  We present Union, a trust-minimized bridge protocol that enables secure transfer of BTC between Bitcoin and a secondary blockchain.<n>Union employs a multi-party variant of BitVMX, an optimistic proving system on Bitcoin, to create a bridge that operates securely under the assumption that at least one participant remains honest.
  arXiv  Detail & Related papers  (2025-01-13T16:03:51Z)
• 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)
• 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)
• SmartAxe: Detecting Cross-Chain Vulnerabilities in Bridge Smart Contracts via Fine-Grained Static Analysis [28.420618636956924]
  Cross-chain bridge is a decentralized application for asset exchange across different blockchain platforms. There are a number of recent security incidents with heavy financial losses caused by vulnerabilities in bridge smart contracts. We propose SmartAxe, a new framework to identify vulnerabilities in cross-chain bridge smart contracts.
  arXiv  Detail & Related papers  (2024-06-23T03:25:27Z)
• Your Trust, Your Terms: A General Paradigm for Near-Instant Cross-Chain Transfer [26.61748905524824]
  We introduce the Delegated Ownership Transfer (DOT) paradigm to enable secure, high-performance cross-chain payments.<n>DOT decouples key ownership from value ownership to enable secure, high-performance cross-chain payments.<n>Our prototype shows that cross-chain payments complete in under 16.70 ms and atomic swaps in under 33.09 ms, with costs fully decoupled from Layer-1 gas fees.
  arXiv  Detail & Related papers  (2024-03-22T13:21:09Z)
• How To Save Fees in Bitcoin Smart Contracts: a Simple Optimistic Off-chain Protocol [0.40964539027092906]
  We consider the execution of smart contracts on Bitcoin.<n>We introduce a protocol that moves most of the execution of a Bitcoin contract off-chain.
  arXiv  Detail & Related papers  (2024-03-14T21:20:36Z)
• Bridging BRC-20 to Ethereum [3.2763090690491343]
  We design, implement, and evaluate a lightweight bridge to connect the Bitcoin and networks that were heterogeneously uncontactable before. Inspired by the recently introduced Bitcoin Request Comment (BRC-20) standard, we leverage the flexibility of Bitcoin inscriptions by embedding editable operations within each satoshi. A user can initialize his/her requests from the Bitcoin network, subsequently triggering corresponding actions on the network.
  arXiv  Detail & Related papers  (2023-10-16T04:58:17Z)
• Secure compilation of rich smart contracts on poor UTXO blockchains [0.8192907805418581]
  We present ILLUM, an Intermediate-Level Language for the UTXO Model. We define a compiler from ILLUM to a bare-bone UTXO blockchain with loop-free scripts. We exploit covenants, a mechanism for preserving scripts along chains of transactions.
  arXiv  Detail & Related papers  (2023-05-16T15:40:18Z)
• 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)
• Bitcoin-Enhanced Proof-of-Stake Security: Possibilities and Impossibilities [45.90740335615872]
  Bitcoin is the most secure blockchain in the world, supported by the immense hash power of its Proof-of-Work miners.<n>Proof-of-Stake chains are energy-efficient, have fast finality but face several security issues.<n>We show that these security issues are inherent in any PoS chain without an external trusted source.<n>We propose a new protocol, Babylon, where an off-the-shelf PoS protocol checkpoints onto Bitcoin to resolve these issues.
  arXiv  Detail & Related papers  (2022-07-18T06:01: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.