Rollback-Free Cross-Chain Atomicity Through Forward-Only Correction

• URL: http://arxiv.org/abs/2607.16959v1
• Date: Sat, 18 Jul 2026 20:39:00 GMT
• Title: Rollback-Free Cross-Chain Atomicity Through Forward-Only Correction
• Abstract summary: A class of applications now requires smart contracts on separate chains to act as one.<n>Such operations must be atomic, yet immutability makes this fundamentally harder.<n>We introduce a framework that achieves atomicity through forward-only correction.
• Score: 2.9823895566984415
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Blockchain platforms have grown into an ecosystem of independent networks, and a growing class of applications now requires smart contracts on separate chains to act as one. Such operations must be atomic, yet immutability makes this fundamentally harder: a confirmed transaction cannot be reversed, so the rollback on which classical atomic commitment protocols depend is unavailable. Two challenges follow. Contract state must be held across an operation whose outcome is not yet known, and each chain's execution outcome must be established even though no chain can observe another. In response, we introduce a framework that achieves atomicity through forward-only correction, resolving incomplete operations with new on-chain transactions rather than reversal. The framework bounds how long contract state is held and confines contention to the state an operation touches, and it establishes outcomes from an on-chain record of what each chain executed, without relying on any single coordinating party. This work lays the foundation for atomic coordination of general smart contract operations across heterogeneous blockchains.

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)
• BridgeShield: Enhancing Security for Cross-chain Bridge Applications via Heterogeneous Graph Mining [41.291205709614026]
  Cross-chain bridges play a vital role in enabling blockchain interoperability.<n>Due to the inherent design flaws and the enormous value they hold, they have become prime targets for hacker attacks.<n>Existing detection methods mainly address single-chain behaviors and fail to capture cross-chain semantics.<n>We propose BridgeShield, a detection framework that jointly models the source chain, off-chain coordination, and destination chain within a unified graph representation.
  arXiv  Detail & Related papers  (2025-08-28T07:59:20Z)
• Enhancing Blockchain Cross Chain Interoperability: A Comprehensive Survey [39.613235136790244]
  We systematically analyze over 150 high impact sources from academic journals, digital libraries, and grey literature.<n>We offer a classification of interoperability approaches including Atomic Swaps, Sidechains, Light Clients, and so on, which represent the most comprehensive overview to date.<n>Our findings aim to support researchers, policymakers, and industry leaders in harnessing the transformative potential of blockchain interoperability to address current challenges and drive forward a cohesive multi-chain ecosystem.
  arXiv  Detail & Related papers  (2025-05-08T04:24:50Z)
• 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)
• 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)
• Validated Strong Consensus Protocol for Asynchronous Vote-based Blockchains [4.79997217554732]
  Vote-based blockchains use Byzantine Fault Tolerance consensus protocols to transition from one state to another.<n>This paper proposes a emphvalidated strong BFT consensus model that allows leader-based coordination in asynchronous settings.<n>Our protocol greatly reduces message complexity and is the first one to achieve linear view changes without relying on threshold signatures.
  arXiv  Detail & Related papers  (2024-09-12T15:54:40Z)
• Maximizing Blockchain Performance: Mitigating Conflicting Transactions through Parallelism and Dependency Management [0.18641315013048293]
  "Conflicting transactions" contribute to high network latency and transaction failures. We present a novel scheme that integrates transaction parallelism and an intelligent dependency manager. Results show that our scheme outperforms both existing parallel and non-parallel Hyperledger Fabric blockchain networks.
  arXiv  Detail & Related papers  (2024-07-01T16:17:33Z)
• Aegis: Tethering a Blockchain with Primary-Chain Stake [9.499962065972483]
  We present a tethered-chain protocol called Aegis.<n>Aegis uses references from its blocks to primary blocks to define committees, checkpoints on the primary chain to perpetuate decisions, and resets to establish new committees when previous ones become obsolete.
  arXiv  Detail & Related papers  (2024-06-09T19:53:48Z)
• Atomicity and Abstraction for Cross-Blockchain Interactions [2.041399528183464]
  Current methods for multi-chain atomic transactions are limited in scope to cryptocurrency swaps. We first define a uniform, high-level interface for communication between chains. We then formulate a protocol that guarantees atomicity for general transactions whose operations may span several chains.
  arXiv  Detail & Related papers  (2024-03-12T02:13:29Z)
• Synchro: Block-generation Protocol to Synchronously Process Cross-shard Transactions in State Sharding [0.0]
  Nightshade in the NEAR Protocol, a type of state sharding, provides a rollback protocol to cancel the generation of blocks containing inconsistent transaction results. We present a new attack that interferes with the generation of new blocks by repeatedly executing CSTXs. We also propose a block-generation protocol called Synchro to incorporate all the state changes of each CSTX into the same block.
  arXiv  Detail & Related papers  (2023-09-04T03:20:49Z)
• 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)
• Refined Bitcoin Security-Latency Under Network Delay [35.16231062731263]
  We study how secure a block is after it becomes $k$-deep in the chain. We analyze the race between adversarial and honest chains in three different phases. We find the probability distribution of the growth of the adversarial chains under models similar to those in [Guo, Ren; AFT 2022] when a target block becomes $k$-deep in the chain.
  arXiv  Detail & Related papers  (2022-12-02T18:54:30Z)
• Adversarial Skill Chaining for Long-Horizon Robot Manipulation via Terminal State Regularization [65.09725599705493]
  We propose to chain multiple policies without excessively large initial state distributions. We evaluate our approach on two complex long-horizon manipulation tasks of furniture assembly. Our results have shown that our method establishes the first model-free reinforcement learning algorithm to solve these tasks.
  arXiv  Detail & Related papers  (2021-11-15T18:59:03Z)
• 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.