{"paper_id":"2402.06731","title":"Closed-form solutions for generic N-token AMM arbitrage","authors":["Matthew Willetts","Christian Harrington"],"paper_date":"2024-02-09","paper_type":"theoretical","paper_url":"https://arxiv.org/pdf/2402.06731v1","page_url":"https://thequant.space/flowcharts/closed-form-solutions-for-generic-n-token-amm-arbitrage/","scores":{"empirical_rigor":3,"math_complexity":8.5,"quadrant":"Lab Rats"},"proposes":{"status":"available","statement":"The paper proposes closed‑form expressions for the optimal arbitrage trade in N‑token geometric mean market maker pools.","quote":"We have described the closed-form expressions for the optimal arbitrage trade for N-token pools.","summary":"Convex optimisation has provided a mechanism to determine arbitrage trades on automated market markets (AMMs) since almost their inception. Here we outline generic closed-form solutions for N-token geometric mean market maker pool arbitrage, that in simulation (with synthetic and historic data)…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"Fees are present and modeled as a multiplicative factor (1‑γ).","type":"model","stated":"explicit","quote":"With fees (1 −γ), for a trade to be accepted it must be the case that N ∑"},{"assumption":"Each token amount traded is non‑negative and a token cannot be traded for itself.","type":"model","stated":"explicit","quote":"The pool contains N tokens, so a trader has a vector ∆ of token amounts being traded to the pool for another set of tokens Λ, where entries in each are ≥0. Where ∆i > 0, Λi = 0: tokens cannot be traded for themselves."},{"assumption":"The trade signature s (indicating which tokens are bought or sold) is known a priori or can be enumerated.","type":"execution","stated":"explicit","quote":"To use our results, it seems we need a priori the arbitrage trade’s signature s."},{"assumption":"For low N (N ⪅7) the number of arithmetic operations is reasonable and faster than convex optimisation.","type":"other","stated":"explicit","quote":"for reasonable numbers of assets (N ⪅7) are substantially quicker to perform than convex optimisation (see Figure 2)."}]},"datasets":{"status":"available","items":[{"name":"synthetic and historic data","provider":null,"kind":"synthetic","access":"unknown","period":null,"universe":null,"quote":"in simulation (with synthetic and historic data) provide better arbitrage opportunities than convex optimisers"}],"known":[],"sample":{"start":null,"end":null,"market":null,"asset_class":null,"frequency":null},"data_resolution":"unclear"},"transaction_costs":{"status":"available","modeled":"unclear","headline_net_of_costs":null,"detail":null,"quote":null,"source":"conflict","rule":"R4b","candidates":{"front_matter":"no","evidence_card":"yes","evidence_card_quoted":true},"conflict_kind":"polarity","card_detail":"Fees are modeled as a multiplicative factor (1‑γ) applied to token amounts in the trade invariant.","card_quote":"With fees (1 −γ), for a trade to be accepted it must be the case that N ∑","meaning":"the platform classifier and the paper-text extraction disagree, so no value is asserted"},"results":{"status":"available","evaluation_type":"trading-pnl","findings":[{"finding":"The closed‑form approach yields better arbitrage opportunities than convex optimisers and can capitalise on them sooner.","kind":"performance","quote":"provide better arbitrage opportunities than convex optimisers and is able to capitalise on those opportunities sooner."},{"finding":"For reasonable numbers of assets (N ⪅7) the closed‑form calculations are substantially quicker than convex optimisation.","kind":"performance","quote":"for reasonable numbers of assets (N ⪅7) are substantially quicker to perform than convex optimisation (see Figure 2)."},{"finding":"The method scales on GPUs due to intrinsic parallelism, enabling higher speeds than numerical‑solver‑based methods.","kind":"performance","quote":"the intrinsic parallelism of the proposed approach (unlike convex optimisation) offers the ability to scale on GPUs"},{"finding":"In experiments the new approach demonstrated speed and arbitrage performance advantages over current approaches.","kind":"performance","quote":"In a range of experiments we have demonstrated the speed and arbitrage performance advantages of this new closed-form approach over current approaches."},{"finding":"Even for low‑N pools, enumerating all trade signatures is still considerably faster than convex optimisation.","kind":"performance","quote":"for low N-token pool running through all variants is still considerably faster than convex optimisation even prior to any other speedups."}],"reported_performance":null,"out_of_sample":{"method":"none","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":29,"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":1,"extracted_at":"2026-11-14T18:15:03Z"},"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/"}