Pith. sign in

REVIEW 1 cited by

Improved Price Oracles: Constant Function Market Makers

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2003.10001 v4 pith:4KI4GAFQ submitted 2020-03-22 q-fin.TR math.OC

classification q-fin.TRmath.OC
keywords marketmakersconstantfunctionpriceassetassetsautomated
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Automated market makers, first popularized by Hanson's logarithmic market scoring rule (or LMSR) for prediction markets, have become important building blocks, called 'primitives,' for decentralized finance. A particularly useful primitive is the ability to measure the price of an asset, a problem often known as the pricing oracle problem. In this paper, we focus on the analysis of a very large class of automated market makers, called constant function market makers (or CFMMs) which includes existing popular market makers such as Uniswap, Balancer, and Curve, whose yearly transaction volume totals to billions of dollars. We give sufficient conditions such that, under fairly general assumptions, agents who interact with these constant function market makers are incentivized to correctly report the price of an asset and that they can do so in a computationally efficient way. We also derive several other useful properties that were previously not known. These include lower bounds on the total value of assets held by CFMMs and lower bounds guaranteeing that no agent can, by any set of trades, drain the reserves of assets held by a given CFMM.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Multi-Path Routing in Decentralized Exchange Networks: Convex Allocation and an Improving-Path Certificate

    math.OC 2026-04 conditional novelty 4.0 of 10

    A gas-aware k-shortest-path generator plus convex flow allocation with a KKT-based certificate produces quotes within 5 bps of the best observed DEX aggregator on WETH-USDT trades.

Pith tools