Paper: arXiv 2507.10149

Authors: Abhimanyu Nag, Madhur Prabhakar, Tanuj Behl

Abstract

We propose a mathematically rigorous framework for identifying and completing Coincidence of Wants (CoW) cycles in decentralized exchange (DEX) aggregators. Unlike existing auction based systems such as CoWSwap, our approach introduces an asset matrix formulation that not only verifies feasibility using oracle prices and formal conservation laws but also completes partial CoW cycles of swap orders that are discovered using graph traversal and are settled using imbalance correction. We define bridging orders and show that the resulting execution is slippage free and capital preserving for LPs. Applied to real world Arbitrum swap data, our algorithm demonstrates efficient discovery of CoW cycles and supports the insertion of synthetic orders for atomic cycle closure. This work can be thought of as the detailing of a potential delta-neutral strategy by liquidity providing market makers: a structured CoW cycle execution.

Complexity vs Empirical Score

  • Math Complexity: 8.5/10
  • Empirical Rigor: 7.0/10
  • Quadrant: Holy Grail — high math complexity, high empirical rigor

Why this score: The paper presents a dense, graph-theoretic and linear-algebraic framework with formal definitions, matrix formulations, and proofs, indicating high mathematical complexity. It is applied to real-world Arbitrum swap data with algorithmic simulations and discusses implementation for synthetic order insertion, demonstrating significant empirical rigor.

Research Flowchart

  flowchart TD
  A["Research Goal"] --> B["Methodology"]
  B --> C["Data/Inputs"]
  C --> D["Computation"]
  D --> E["Outcomes"]
  
  A["Research Goal<br>Identify CoW cycles<br>for slippage-free execution"]
  
  B["Methodology<br>1. Asset Matrix Formulation<br>2. Graph Traversal<br>3. Imbalance Correction<br>4. Bridging Orders"]
  
  C["Data/Inputs<br>Oracle Prices<br>Conservation Laws<br>Real World Swap Data<br>(Arbitrum)"]
  
  D["Computation<br>Feasibility Verification<br>Partial Cycle Completion<br>Synthetic Order Insertion"]
  
  E["Outcomes<br>Slippage-Free Execution<br>Capital Preservation for LPs<br>Delta-Neutral Strategy Framework"]

Evidence Card

What the authors claim, on what data, and who has checked it. Read from the paper's own text by a language model: every quote is verbatim, nothing was re-run. How to read this card

Proposes

The paper proposes a mathematically rigorous framework for identifying and completing Coincidence of Wants (CoW) cycles in decentralized exchange aggregators.

Source sentence
We propose a mathematically rigorous framework for identifying and completing Coincidence of Wants (CoW) cycles in decentralized exchange (DEX) aggregators.

Assumes 6

  • All trades execute at quoted amounts with no slippage, zero protocol fee, and ideal matching. execution
    Source sentence
    Ignoring market frictions and assuming all trades execute at quoted amounts (i.e., no slippage, zero protocol fee, and ideal matching), let the orders be specified as: o1 : (A = ETH, B = USDC, a1 = 1, b1 = 3000) o2 : (A = USDC, B = ARB, a2 = 3000, b2 = 1500) o3 : (A = ARB, B = ETH, a3 = 1500, b3 = 1) In this case, let L1 be an ETH Vault, L2 is a USDC Vault and L3 is an ARB Vault.
  • A price oracle provides external reference prices to ensure value neutrality and prevent slippage. market
    Source sentence
    A price oracle ensures value neutrality by anchoring trades to external reference valuations, thereby preventing slippage-induced losses [7] and preserving the integrity of LP vault balances.
  • Trader‑specific exchange rate bounds and oracle pricing are used for partial fills to prevent slippage. model
    Source sentence
    and propose completion orders algebraically. • We define exact feasibility constraints using trader-specific exchange rate bounds for partial fills and oracle pricing to prevent slippage and handle CoW cycles of arbitrary length.
  • The study focuses exclusively on swap orders. model
    Source sentence
    3 Coincidence of Wants in Swap Systems For the concept to work, we focus only on swap orders.
Show 2 more
  • LP vaults provide assets and preserve their capital, with net asset flow zero for each vault across a cycle. execution
    Source sentence
    The net asset flow into and out of each vault in the cycle is zero: for every asset T ∈χ, the total amount of T received by any vault equals the total amount of T it supplies in the cycle. This ensures that each Lj ends up with the same inventory they started with, preserving their capital over the atomic execution of the cycle.
  • Ideal exchange rates and perfect asset quantity matching are assumed in examples. other
    Source sentence
    Assuming exchange rates are ideal and asset quantities match perfectly, each LP ends with their original asset and quantity.

Data

  • Arbitrum swap data · 1inch aggregator crypto-onchain public
    Source sentence
    5 Simulation: Applying the CoW Algorithm to Real Swap Data To demonstrate the practical application of the Coincidence of Wants (CoW) mechanism, we con-duct a simulation using real-world swap data through 1inch aggregator3 collected from the Arbitrum blockchain on June 25, 2025. The dataset, shown in Table 1, includes ten swap transactions routed through decentralized aggregators, capturing source and destination

Costs

Not modeled A trading or execution result is reported without costs.

Source sentence
Ignoring market frictions and assuming all trades execute at quoted amounts (i.e., no slippage, zero protocol fee, and ideal matching), let the orders be specified as: o1 : (A = ETH, B = USDC, a1 = 1, b1 = 3000) o2 : (A = USDC, B = ARB, a2 = 3000, b2 = 1500) o3 : (A = ARB, B = ETH, a3 = 1500, b3 = 1) In this case, let L1 be an ETH Vault, L2 is a USDC Vault and L3 is an ARB Vault.

Finds 5

  • Applied to real‑world Arbitrum swap data, the algorithm efficiently discovers CoW cycles and supports insertion of synthetic orders for atomic cycle closure. theoretical
    Source sentence
    Applied to real world Arbitrum swap data, our algorithm demonstrates efficient discovery of CoW cycles and supports the insertion of synthetic orders for atomic cycle closure. By simulating our algorithm over real-world Arbitrum [3] swap data, we show that even sparse, unstructured order flow can yield non-trivial CoW opportunities.
  • Even sparse, unstructured order flow can yield non‑trivial CoW opportunities. performance
    Source sentence
    By simulating our algorithm over real-world Arbitrum [3] swap data, we show that even sparse, unstructured order flow can yield non-trivial CoW opportunities.
  • Three valid CoW cycles were identified in the empirical analysis, including cycles closed with bridging orders. performance
    Source sentence
    Three valid CoW cycles were identified: 1. 2. aArbWETH-based cycle (closed using a 0.34 USD bridging order). 3.
  • The proposed method improves capital efficiency, mitigates MEV, and enables off‑chain matching. theoretical
    Source sentence
    These structures improve capital efficiency, mitigate MEV, and facilitate off-chain matching.
  • The algorithm maintains tractability through bounded cycle size, sparse asset graphs, and early feasibility pruning. theoretical
    Source sentence
    The proposed algorithm maintains tractability in practice through bounded cycle size, sparse asset graphs, and early feasibility pruning.

Checked by others

No other paper in the archive has been found to support or contradict these findings (compared with 20 related papers). Coverage is partial, so this is neither replication nor refutation.

Code

No repository by the authors found in the paper.

Extracted 2026-11-14 · same card as JSON · A language model chose these items: check the source sentence before relying on one.

Cited References (17)

  1. Decentralized exchange (2017)
  2. Automated market makers and decentralized exchanges: a DeFi primer (2022)
  3. An analysis of intent-based markets (2024) — link
  4. Maximal Extractable Value (MEV) (2023)
  5. A coincidence of wants: The novel and neoclassical economics (2014)
  6. Decentralized finance (2020)
  7. The costs of swapping on decentralized exchanges (2024)
  8. A theory of atomic transactions (1988)
and 9 more
  1. Competitive solvers in action: strategic optimization across CoWs and multi-chain AMMs (2025)
  2. SoK: Decentralized Finance (DeFi)–Fundamentals, Taxonomy and Risks (2024) — link
  3. Arbitrum nitro: A second-generation optimistic rollup (2022)
  4. Uniswap v3 core (2021)
  5. Balancer (2023)
  6. Analysis and Evaluation of the CoW Protocol for MEV Mitigation on the Ethereum Blockchain (2023) — link
  7. Maximal Extractable Value in Batch Auctions (2025)
  8. Impermanent loss and slippage in Automated Market Makers (AMMs) with constant-product formula (2022)
  9. Efficient algorithms for shortest paths in sparse networks (1977)

0 of 17 cited works are in the corpus; resolved via arXiv source bundles, Semantic Scholar and OpenAlex. Corpus-wide: 2596 linked papers.