{"paper_id":"2507.10149","title":"A Coincidence of Wants Mechanism for Swap Trade Execution in Decentralized Exchanges","authors":["Abhimanyu Nag","Madhur Prabhakar","Tanuj Behl"],"paper_date":"2025-07-14","paper_type":"methodological","paper_url":"https://arxiv.org/pdf/2507.10149v1","page_url":"https://thequant.space/flowcharts/a-coincidence-of-wants-mechanism-for-swap-trade-execution-in/","scores":{"empirical_rigor":7,"math_complexity":8.5,"quadrant":"Holy Grail"},"proposes":{"status":"available","statement":"The paper proposes a mathematically rigorous framework for identifying and completing Coincidence of Wants (CoW) cycles in decentralized exchange aggregators.","quote":"We propose a mathematically rigorous framework for identifying and completing Coincidence of Wants (CoW) cycles in decentralized exchange (DEX) aggregators.","summary":"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…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"All trades execute at quoted amounts with no slippage, zero protocol fee, and ideal matching.","type":"execution","stated":"explicit","quote":"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.","support":"full"},{"assumption":"A price oracle provides external reference prices to ensure value neutrality and prevent slippage.","type":"market","stated":"explicit","quote":"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.","support":"full"},{"assumption":"Trader‑specific exchange rate bounds and oracle pricing are used for partial fills to prevent slippage.","type":"model","stated":"explicit","quote":"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.","support":"full"},{"assumption":"The study focuses exclusively on swap orders.","type":"model","stated":"explicit","quote":"3 Coincidence of Wants in Swap Systems For the concept to work, we focus only on swap orders.","support":"full"},{"assumption":"LP vaults provide assets and preserve their capital, with net asset flow zero for each vault across a cycle.","type":"execution","stated":"explicit","quote":"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.","support":"full"},{"assumption":"Ideal exchange rates and perfect asset quantity matching are assumed in examples.","type":"other","stated":"implied","quote":"Assuming exchange rates are ideal and asset quantities match perfectly, each LP ends with their original asset and quantity.","support":"full"}]},"datasets":{"status":"available","items":[{"name":"Arbitrum swap data","provider":"1inch aggregator","kind":"crypto-onchain","access":"public","period":null,"universe":null,"quote":"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","support":"full"}],"known":[],"sample":{"start":null,"end":null,"market":null,"asset_class":null,"frequency":null},"data_resolution":"unclear"},"transaction_costs":{"status":"available","modeled":"no","headline_net_of_costs":null,"detail":null,"quote":"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.","source":"evidence_card","rule":"R2","candidates":{"front_matter":"unclear","evidence_card":"no","evidence_card_quoted":true},"card_detail":null,"card_quote":"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.","meaning":"a trading or execution result is reported without costs"},"results":{"status":"available","evaluation_type":"unclear","findings":[{"finding":"Applied to real‑world Arbitrum swap data, the algorithm efficiently discovers CoW cycles and supports insertion of synthetic orders for atomic cycle closure.","kind":"theoretical","quote":"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.","support":"full"},{"finding":"Even sparse, unstructured order flow can yield non‑trivial CoW opportunities.","kind":"performance","quote":"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.","support":"full"},{"finding":"Three valid CoW cycles were identified in the empirical analysis, including cycles closed with bridging orders.","kind":"performance","quote":"Three valid CoW cycles were identified: 1. 2. aArbWETH-based cycle (closed using a 0.34 USD bridging order). 3.","support":"full"},{"finding":"The proposed method improves capital efficiency, mitigates MEV, and enables off‑chain matching.","kind":"theoretical","quote":"These structures improve capital efficiency, mitigate MEV, and facilitate off-chain matching.","support":"full"},{"finding":"The algorithm maintains tractability through bounded cycle size, sparse asset graphs, and early feasibility pruning.","kind":"theoretical","quote":"The proposed algorithm maintains tractability in practice through bounded cycle size, sparse asset graphs, and early feasibility pruning.","support":"full"}],"reported_performance":null,"out_of_sample":{"method":"none","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":20,"citations":{"cited_by_in_corpus":0,"by_independent_authors":0,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":0,"unclassified":0},"independent_papers":[],"scope":"Citations between papers in this corpus only; citations from outside it are not counted."}},"implementation":{"status":"available","public":false,"code_url":null,"note":"No repository presented by the authors as their own was found in the paper. Absence here is not proof that no code exists."},"replication":{"status":"none_found","card":null,"note":"No replication of this paper has been run by thequant.space yet."},"extraction":{"text_source":"fulltext","model":"openai/gpt-oss-120b","version":2,"extracted_at":"2026-11-14T19:49:08Z"},"provenance":{"claims":"Everything here is what the authors state in the paper. Nothing was re-run or reproduced by the platform.","quotes":"Assumptions, datasets, cost detail and findings were extracted by a language model. Every quote is verbatim paper text. Where an item has `support`, \"full\" means every figure in it appears in the quoted sentences and \"partial\" means a figure is stated elsewhere in the paper; items with a figure found nowhere in the paper were discarded.","datasets_known":"datasets.known lists well-known vendors and public datasets by a stable id, found by a dictionary over the full text where the sentence says the data is used; it is independent of the model and covers only names in the dictionary.","flags":"transaction_costs.modeled, results.evaluation_type and results.out_of_sample.method are platform classifications (structured-decision models); see https://thequant.space/score-guide/#penalty-flags","comparisons":"supports / contradicts / qualifies are a language model's reading of two papers' quoted findings, restricted to closely related papers that share no author. They are pointers to read, not verified replications, and coverage is partial.","implementation":"code_url is a repository the paper itself presents as its own (rule-scored, ambiguous cases judged by a model), checked for liveness when it was recorded."},"docs":"https://thequant.space/agents/"}