ASAS-BridgeAMM: Trust-Minimized Cross-Chain Bridge AMM with Failure Containment

• URL: http://arxiv.org/abs/2601.12434v1
• Date: Sun, 18 Jan 2026 14:40:26 GMT
• Title: ASAS-BridgeAMM: Trust-Minimized Cross-Chain Bridge AMM with Failure Containment
• Authors: Shengwei You, Aditya Joshi, Andrey Kuehlkamp, Jarek Nabrzyski,
• Abstract summary: Cross-chain bridges constitute the single largest vector of systemic risk in Decentralized Finance (DeFi)<n>We present ASAS-BridgeAMM, a bridge-coupled automated market maker that introduces Contained Degradation.
• Score: 5.151910664667141
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Cross-chain bridges constitute the single largest vector of systemic risk in Decentralized Finance (DeFi), accounting for over \$2.8 billion in losses since 2021. The fundamental vulnerability lies in the binary nature of existing bridge security models: a bridge is either fully operational or catastrophically compromised, with no intermediate state to contain partial failures. We present ASAS-BridgeAMM, a bridge-coupled automated market maker that introduces Contained Degradation: a formally specified operational state where the system gracefully degrades functionality in response to adversarial signals. By treating cross-chain message latency as a quantifiable execution risk, the protocol dynamically adjusts collateral haircuts, slippage bounds, and withdrawal limits. Across 18 months of historical replay on Ethereum and two auxiliary chains, ASAS-BridgeAMM reduces worst-case bridge-induced insolvency by 73% relative to baseline mint-and-burn architectures, while preserving 104.5% of transaction volume during stress periods. In rigorous adversarial simulations involving delayed finality, oracle manipulation, and liquidity griefing, the protocol maintains solvency with probability $>0.9999$ and bounds per-epoch bad debt to $<0.2%$ of total collateral. We provide a reference implementation in Solidity and formally prove safety (bounded debt), liveness (settlement completion), and manipulation resistance under a Byzantine relayer model.

Related papers

• Uncertainty-Aware Jamming Mitigation with Active RIS: A Robust Stackelberg Game Approach [65.06640919319413]
  This paper investigates the jamming mitigation by leveraging an active reconfigurable intelligent surface (ARIS)<n>We adopt the Stackelberg game formulation to model the strategic interaction between the legitimate side and the adversary.<n>We first derive the optimal jamming policy as the follower's best response, which is then incorporated into the legitimate-side optimization for robust anti-jamming design.
  arXiv  Detail & Related papers  (2026-02-20T12:02:01Z)
• Exploiting Liquidity Exhaustion Attacks in Intent-Based Cross-Chain Bridges [5.543794703214136]
  Cross-chain bridges let off-chain entities (emphsolvers) to immediately fulfill users' orders by fronting their own liquidity.<n>While improving user experience, this approach introduces new systemic risks, such as solver liquidity concentration and delayed settlement.<n>We propose a new class of attacks called emphliquidity exhaustion attacks and a replay-based parameterized attack simulation framework.
  arXiv  Detail & Related papers  (2026-02-19T20:13:36Z)
• BadCLIP++: Stealthy and Persistent Backdoors in Multimodal Contrastive Learning [73.46118996284888]
  Research on backdoor attacks against multimodal contrastive learning models faces two key challenges: stealthiness and persistence.<n>We propose BadCLIP++, a unified framework that tackles both challenges.<n>For stealthiness, we introduce a semantic-fusion QR micro-trigger that embeds imperceptible patterns near task-relevant regions.<n>For persistence, we stabilize trigger embeddings via radius shrinkage and centroid alignment.
  arXiv  Detail & Related papers  (2026-02-19T08:31:16Z)
• Stablecoin Design with Adversarial-Robust Multi-Agent Systems via Trust-Weighted Signal Aggregation [5.151910664667141]
  We present MVF-Composer, a trust-weighted Mean-Variance Frontier reserve controller incorporating a novel Stress Harness for risk-state estimation.<n>Our key insight is deploying multi-agent simulations as adversarial stress-testers, exposing reserve vulnerabilities before they manifest on-chain.<n>Across 1,200 randomized scenarios with injected Black-Swan, MVF-Composer reduces peak peg deviation by 57% and mean recovery time by 3.1x relative to SAS baselines.
  arXiv  Detail & Related papers  (2026-01-18T14:21:25Z)
• Optimistic TEE-Rollups: A Hybrid Architecture for Scalable and Verifiable Generative AI Inference on Blockchain [4.254924788681319]
  We introduce Optimistic TEE-Rollups (OTR), a hybrid verification protocol that harmonizes constraints.<n>OTR achieves 99% of the throughput of centralized baselines with a marginal cost overhead of $0.07 per query.
  arXiv  Detail & Related papers  (2025-12-23T09:16:41Z)
• Asynchronous Risk-Aware Multi-Agent Packet Routing for Ultra-Dense LEO Satellite Networks [45.84384086201993]
  The rise of ultra-dense LEO constellations creates a complex and asynchronous network environment, driven by their massive scale, dynamic topologies, and significant delays.<n>This unique complexity demands an adaptive packet routing algorithm that is asynchronous, risk-aware, and capable of balancing diverse and often conflicting objectives in a decentralized manner.<n>We introduce PRIMAL, an event-driven multi-agent routing framework designed specifically to allow each satellite to act independently on its own event-driven timeline.
  arXiv  Detail & Related papers  (2025-10-31T14:29:08Z)
• On-Chain Decentralized Learning and Cost-Effective Inference for DeFi Attack Mitigation [4.37137147573556]
  Billions of dollars are lost every year in DeFi platforms by transactions exploiting business logic or accounting vulnerabilities.<n>We present the first decentralized, fully on-chain learning framework that: (i) performs gas-prohibitive computation on Layer-2 to reduce cost, (ii) propagates verified model updates to Layer-1, and (iii) enables gas-bounded low-latency inference inside smart contracts.
  arXiv  Detail & Related papers  (2025-10-15T18:58:34Z)
• AI Agent Architecture for Decentralized Trading of Alternative Assets [2.8195433571821162]
  GoldMine OS is a research oriented architecture that employs multiple specialized AI agents to automate and secure the tokenization and exchange of physical gold into a blockchain based stablecoin ("OZ")<n>We describe four cooperative agents (Compliance, Token Issuance, Market Making, and Risk Control) and a coordinating core, and evaluate the system through simulation and a controlled pilot deployment.<n>In experiments the prototype delivers on demand token issuance in under 1.2 s, more than 100 times faster than manual.
  arXiv  Detail & Related papers  (2025-07-15T09:11:19Z)
• Influential Bandits: Pulling an Arm May Change the Environment [44.71145269686588]
  Real-world applications often involve non-stationary environments and interdependencies between arms.<n>We propose the influential bandit problem, which models inter-arm interactions through an unknown, symmetric, positive semi-definite interaction matrix.<n>We introduce a new algorithm based on a lower confidence bound (LCB) estimator tailored to the structure of the loss dynamics.
  arXiv  Detail & Related papers  (2025-04-11T02:05:51Z)
• 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)
• Transaction Capacity, Security and Latency in Blockchains [45.776687601070705]
  We analyze how secure a block is after the block becomes $k$-deep, i.e., security-latency, for Nakamoto consensus.<n>We connect the security-latency analysis to sustainable transaction rate of the queue system.
  arXiv  Detail & Related papers  (2024-02-15T17:43:13Z)
• G$^2$uardFL: Safeguarding Federated Learning Against Backdoor Attacks through Attributed Client Graph Clustering [116.4277292854053]
  Federated Learning (FL) offers collaborative model training without data sharing. FL is vulnerable to backdoor attacks, where poisoned model weights lead to compromised system integrity. We present G$2$uardFL, a protective framework that reinterprets the identification of malicious clients as an attributed graph clustering problem.
  arXiv  Detail & Related papers  (2023-06-08T07:15:04Z)
• SaFormer: A Conditional Sequence Modeling Approach to Offline Safe Reinforcement Learning [64.33956692265419]
  offline safe RL is of great practical relevance for deploying agents in real-world applications. We present a novel offline safe RL approach referred to as SaFormer.
  arXiv  Detail & Related papers  (2023-01-28T13:57:01Z)
• ESCORT: Ethereum Smart COntRacTs Vulnerability Detection using Deep Neural Network and Transfer Learning [80.85273827468063]
  Existing machine learning-based vulnerability detection methods are limited and only inspect whether the smart contract is vulnerable. We propose ESCORT, the first Deep Neural Network (DNN)-based vulnerability detection framework for smart contracts. We show that ESCORT achieves an average F1-score of 95% on six vulnerability types and the detection time is 0.02 seconds per contract.
  arXiv  Detail & Related papers  (2021-03-23T15:04:44Z)

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.