One-Way Coupling of Prediction Markets to Automated Market Makers
Abstract
Can a prediction market improve an automated market maker’s prices without creating an uncontrolled source of trading profit? The forecast can convey information about an event that affects asset value, but a trader may also manipulate that forecast. We study a coupling in which the forecast changes spot prices while the prediction reward remains independent of spot trading. For added prediction payments independent of the event outcome, we characterize exactly when the reward for truthful reporting survives.
We then bound reporting distortion from finite outside positions and derive exact fees and trade limits for reversible trading cycles. The required protection depends on whether fees remain in the pool and whether traders can split their orders.
A sponsor account can fund price adjustments, with bounded net spending when trades and forecast changes restore the initial inventory and pricing rule. These constructions retain a nonzero response to the forecast. Under independent Gaussian signal errors, a bounded correction strictly reduces mean squared log-price error. A synthetic study measures its trading effects. Market usefulness and endogenous participation remain separate empirical and equilibrium questions.
The author has a commercial interest in systems of the kind this paper describes.
1 Introduction
An automated market maker (AMM) uses its asset and cash reserves to quote trades. Suppose an asset’s value depends on whether a binary event occurs. A prediction market trades claims on that event and supplies a forecast of its probability. When spot trading is too thin to update the price within the current trade window, the forecast may supply useful information. For an asset with two possible terminal values, a changed event probability changes the corresponding expected value. The question is how to make the AMM respond without giving traders an uncontrolled way to extract its reserves.
A trader active in both markets can benefit from manipulating the forecast. A trader can buy the asset, raise the forecast used in its quote, and sell the asset back at the changed price. The trader may then reverse the prediction trade as well. A charge recovered on reversal does not pay for the gain on the asset cycle. A reporter who already owns the asset can also benefit from an inflated forecast without completing such a cycle. These incentives arise even when the prediction market, considered alone, rewards truthful forecasts.
A strictly proper score gives a reporter the highest expected payment for stating the reporter’s actual belief. An outcome-independent payment preserves that property, for every belief, exactly when it stays constant along the states that a report can move. One-way coupling achieves it by allowing the forecast to change the AMM price while keeping spot state out of the prediction reward. Separate asset positions still create outside incentives, whose effect we bound for contracts held until the event resolves.
To bound trading gains, we limit the forecast’s effect on price and compute the exact cash transfers when that forecast changes between trades. The destination of the fees matters because fees retained in the pool change the reserves used for the next quote. Order splitting also matters: protection against two complete legs can fail across a longer sequence of partial fills. We derive fee thresholds for these cases and a finite-horizon alternative that limits total reserve movement.
A sponsor can fund changes to the pricing rule by transferring the required cash into or out of the pool at fixed inventory. Closed inventory and control sequences can then consume only the admitted sponsor balance. This construction keeps a nonzero response to the forecast, including coupling values below one. Its statistical value is conditional: a bounded correction reduces estimation error under the specified Gaussian signal law. The synthetic evaluation measures the resulting price error and trading outcomes under that law.
Proper scoring rules and cost-function prediction markets provide the base elicitation mechanism [1, 2, 3]. The failure caused by payoff feedback is related to decision markets and outside incentives [4, 5, 6]. The spot venue is a constant-function market maker of the type analysed by Angeris and co-authors [7, 8]. We study how these two mechanisms compose.
Assumption 1.1 (Trade-window boundary).
The set of trades used in a price calculation is committed before the event result is revealed. This is a ledger-confirmation assumption for price formation. Ledger confirmation, legal finality, funding, and beneficiary receipt remain distinct events. The formulas below do not merge them.
This boundary follows the distinction between trade processing and settlement in the Principles for Financial Market Infrastructures [9]. Du’s payment-rail analysis also separates asset transfer from the liquidity, compliance, dispute, and service functions of a complete payment product [10, 11].
Event-Collect BFT defines the event-atomic ledger transition that fixes the trade window before plaintext is visible [12]. Parlay Identification of Ising Couplings in Correlated Binary Event Markets studies pairwise prediction inputs and the observations needed to identify them [13].
2 When the Prediction Reward Remains Truthful
A report can change both the prediction reward and the price of the underlying asset. We first hold the AMM reserves fixed and study only the prediction reward. The reporter may also trade the asset. We account for outside positions separately below.
Let Y\in\{0,1\} be an event, p\in(0,1) a trader’s belief, and r\in(0,1) the trader’s report. A scoring rule S(r,Y) is strictly proper when \Phi_p(r):=pS(r,1)+(1-p)S(r,0) has the unique maximum r=p for every p. We assume that \Phi_p is continuously differentiable in r.
Write R_{\!M} for the AMM’s cash reserve and R_{\!B} for its asset reserve. Cash uses a common unit of account, called the numeraire. The marginal price is the cash required per asset unit for an infinitesimal purchase. At fixed reserves (R_{\!M},R_{\!B}), let G be a positive continuously differentiable coupling factor. It sets the AMM marginal price P^c(r)=G(r)\frac{R_{\!M}}{R_{\!B}}. \tag{1}
An outcome-independent, continuously differentiable transfer H(r,P) may also enter the prediction payoff. The report therefore traces the coupled path r\longmapsto \bigl(r,P^c(r)\bigr), \qquad \gamma(r):=H\bigl(r,P^c(r)\bigr). The scalar function \gamma is the added prediction payoff along that path. Only this added payment must be constant. The proper score still depends on the report and the eventual outcome.
Theorem 2.1 (Coupled-path characterization).
At fixed reserves, the adjusted prediction payoff S(r,Y)+H\bigl(r,P^c(r)\bigr) preserves truthful reporting for every belief p\in(0,1) if and only if \gamma is constant on (0,1).
Proof. The expected adjusted payoff is \Phi_p(r)+\gamma(r). If \gamma is constant, its addition does not change the unique maximiser of \Phi_p. Conversely, suppose r=p remains optimal for every p. The first-order condition at r=p is 0=\Phi_p'(p)+\gamma'(p)=\gamma'(p), because strict properness gives \Phi_p'(p)=0. This holds for every p\in(0,1), so \gamma is constant. ◻
Outcome-dependent changes to a scoring rule require the full proper-scoring-rule characterization. The theorem covers only outcome-independent transfers.
Corollary 2.2 (One-way coupling).
If the prediction payoff does not read spot state and carries no separate report-dependent transfer, then H is constant and the coupling is admissible. The prediction signal may still move the AMM price through G.
Corollary 2.3 (Admissible spot-state dependence).
The admissible class is larger than the one-way subclass. For any differentiable \psi, the transfer H(r,P)=\psi\!\left(\frac{P}{G(r)}\right) \tag{2} is constant along the path in (1), because P^c(r)/G(r)=R_{\!M}/R_{\!B}.
Bidirectional dependence can therefore preserve truthful reporting. What matters is whether the added payoff varies along the path that the report can move.
2.1 Outside positions
Path invariance prevents report-induced changes in the added prediction payoff. A separate asset position can still make one report more valuable than another. We compare this incentive with the local cost of misstating a belief.
Odds express an event probability as the ratio of occurrence to nonoccurrence. The logit, the logarithm of those odds, converts probabilities into an unrestricted real coordinate. The logarithmic market scoring rule rewards probability reports through changes in a logarithmic score. Its depth scales those payments in the numeraire.
Proposition 2.4 (Local bias from a pre-existing spot position).
Let u=\mathop{\mathrm{logit}}r:=\log(r/(1-r)) and u_*=\mathop{\mathrm{logit}}p. Suppose the prediction market uses a logarithmic market scoring rule (LMSR) with depth b, the one-way factor is locally \log G(r)=\alpha u+\text{constant}, and Q is the signed numeraire value of the trader’s spot position at u_*. If the prediction position is held to resolution, then, to first order, \hat u-u_*=\frac{\alpha Q}{b\,p(1-p)}, \qquad \hat p-p=\frac{\alpha Q}{b}. \tag{3} Thus b\geq |\alpha|Q_{\max}/\varepsilon bounds the first-order probability bias by \varepsilon for |Q|\leq Q_{\max}.
Proof. In logit coordinates, the expected LMSR payoff has the local expansion \Phi_p(u)=\Phi_p(u_*)-\frac12 b\,p(1-p)(u-u_*)^2 +O\bigl((u-u_*)^3\bigr). A spot position of notional Q has local derivative \alpha Q with respect to u. The first-order condition gives the first expression in (3). Write \sigma(u)=1/(1+e^{-u}). Since d\sigma(u)/du=p(1-p) at u_*, the second expression follows. ◻
This is a local, held-to-resolution result. A complete cost-function round trip that restores the prediction-market share vector has zero path cost before fees. LMSR depth therefore supplies no corresponding friction for a reversible cross-venue cycle.
3 Choosing a Price Response from Noisy Signals
The AMM’s response should depend on how much information the forecast adds to the spot observation, even when the prediction reward is truthful. A logit factor follows from a model in which both observations measure the same underlying log value with independent Gaussian errors. Log value means the natural logarithm of asset value.
Let v be latent log value. Suppose the spot venue and the prediction market provide independent unbiased Gaussian observations X_A=v+\varepsilon_A, \qquad X_P=a+s u=v+\varepsilon_P, \tag{4} with error variances \sigma_A^2 and \sigma_P^2. Here u=\mathop{\mathrm{logit}}p.
The constants a and s specify the intercept and slope that convert the logit observation into log-value units. The affine relation v=a+s u describes the noiseless calibration, not a universal valuation law. In the observation model, a+s u includes the error \varepsilon_P shown in (4). We weight the observations to minimize variance among unbiased linear estimates.
Proposition 3.1 (Prediction-side factor).
Under (4), the best linear unbiased estimate of v is \hat v=(1-\kappa)X_A+\kappa X_P, \qquad \kappa=\frac{\sigma_A^2}{\sigma_A^2+\sigma_P^2}. \tag{5} After exponentiation, its prediction-side factor is \left(\frac{p}{1-p}\right)^{\alpha}, \qquad \alpha=\kappa s. \tag{6}
Proof. Among linear unbiased estimators (1-w)X_A+wX_P, independence gives variance (1-w)^2\sigma_A^2+w^2\sigma_P^2. Differentiation gives the unique minimiser w=\kappa. Substitution of X_P=a+s\mathop{\mathrm{logit}}p into e^{\hat v} yields (6). ◻
The full estimator is e^{\hat v}=e^{\kappa a}\,e^{(1-\kappa)X_A} \left(\frac{p}{1-p}\right)^{\kappa s}. The weight \kappa increases as the spot observation becomes less precise relative to the prediction observation. This estimate changes both observation weights. An overlay that multiplies an unchanged spot price by the prediction-side factor does not inherit the minimum-variance claim.
For a binary asset, the event may determine one of two values directly. Their probability-weighted value determines the local sensitivity to the forecast. An operating probability is the point at which this linear approximation is fixed.
Proposition 3.2 (Fixed-operating-point binary map).
Let a binary event imply value V(p)=V_0+(V_1-V_0)p>0. At an operating probability p_*, define s_*:=\left.\frac{d\log V(p)}{d\mathop{\mathrm{logit}}p}\right|_{p=p_*} =\frac{(V_1-V_0)p_*(1-p_*)}{V(p_*)}. \tag{7} If logit noise has variance \sigma_u^2, then its induced first-order log-value variance is s_*^2\sigma_u^2. The fixed-operating-point prediction factor is G_*(p)=\exp\!\left(\alpha_*[\mathop{\mathrm{logit}}p-\mathop{\mathrm{logit}}p_*]\right), \quad \alpha_*=s_*\frac{\sigma_A^2} {\sigma_A^2+s_*^2\sigma_u^2}. \tag{8}
Proof. Equation (7) is the chain rule. Linearising \log V(p) in u=\mathop{\mathrm{logit}}p gives a Gaussian observation with slope s_* and variance s_*^2\sigma_u^2. Proposition 3.1 then gives the weight and (8). The normalisation makes G_*(p_*)=1. ◻
This fixed-operating-point extended-Kalman map in one dimension has a local interpretation [14, 15]. It does not establish global optimality for a nonlinear value function, a clipped factor, or an overlay on a different base price.
4 Bounded One-Way Coupling
The logit factor in (6) is unbounded as p approaches zero or one. An extreme report could therefore move the quote by an arbitrarily large factor. Clipping keeps the central response and limits the price effect of extreme reports.
Write u for the logit of the signal supplied to the AMM. When that signal is the report r, the earlier factor is G(r)=g(\mathop{\mathrm{logit}}r). At truthful reporting it instead reads u=\mathop{\mathrm{logit}}p. A factor of one gives the reserve-ratio price. At fixed reserves, a factor below or above one lowers or raises that price.
The centre u_0 specifies the neutral signal, \delta_{\max} caps the logit adjustment, and w sets the width of its smooth transition. The parameter \alpha converts that bounded adjustment into a change in log price.
Definition 4.1 (Continuously differentiable clipper).
For 0<w<\delta_{\max}, define the odd function h(y)= \begin{cases} y, & |y|\leq\delta_{\max}-w,\\ \mathop{\mathrm{sgn}}(y)\left[\delta_{\max}-\dfrac{(\delta_{\max}+w-|y|)^2}{4w}\right], & \delta_{\max}-w<|y|<\delta_{\max}+w,\\ \mathop{\mathrm{sgn}}(y)\delta_{\max}, & |y|\geq\delta_{\max}+w. \end{cases} \tag{9} For a centre u_0, set g(u)=\exp\!\bigl(\alpha h(u-u_0)\bigr), \qquad \alpha>0. \tag{10}
Lemma 4.2 (Smoothness).
The function h in (9) is non-decreasing, takes values in [-\delta_{\max},\delta_{\max}], and belongs to C^1(\mathbb{R}).
Proof. Odd symmetry reduces the junction check to the positive side. At y=\delta_{\max}-w, the linear and quadratic pieces both have value \delta_{\max}-w and derivative one. At y=\delta_{\max}+w, the quadratic and constant pieces both have value \delta_{\max} and derivative zero. On the transition interval the derivative is (\delta_{\max}+w-y)/(2w), which lies in [0,1]. ◻
Theorem 4.3 (Static impact bounds).
At fixed reserves, let P(u)=g(u)R_{\!M}/R_{\!B}. Relative to the centred state u=u_0, \left|\frac{P(u)-P(u_0)}{P(u_0)}\right| \leq e^{\alpha\delta_{\max}}-1. \tag{11} Between any two clipped states u_0',u_1', one has e^{-2\alpha\delta_{\max}} \leq\frac{P(u_1')}{P(u_0')} \leq e^{2\alpha\delta_{\max}}. \tag{12} The bound depends on the single product \alpha\delta_{\max}.
Proof. Since |h|\leq\delta_{\max}, one has |\log g|\leq\alpha\delta_{\max}. The centred bound follows from g(u_0)=1. The difference between two clipped log factors has absolute value at most 2\alpha\delta_{\max}, which gives (12). ◻
The product \alpha\delta_{\max} is the maximum absolute change in log price from the centred state. A comparison of opposite saturation states uses twice that amount. This distinction will determine the uniform fee threshold.
The bound applies at every later trade window because coupling depends on the current signal level. Although reserves may change between windows, the factor does not accumulate earlier signal changes.
Inside |u-u_0|\leq\delta_{\max}-w, the clipper is the identity. The statistical interpretation in Section 3 applies only when the same local signal model remains valid there. In the transition and saturated regions, clipping bounds the price without establishing estimator optimality. Without clipping, e^{\alpha u} has no finite uniform impact bound.
5 Finite Outside Positions
Clipping limits the price a report can induce, but an outside position can still reward a distorted report. The local calculation in Proposition 2.4 applies to small changes near a truthful report. We now allow finite changes and any included payoff with specified size and sensitivity bounds.
A reporting contract and a trading cycle have different economic endpoints. Here the prediction position remains outstanding until the event resolves. Reports leave the distribution of the event outcome fixed. Let b>0 be the logarithmic score scale, in units of numeraire. For belief p\in(0,1), its expected payment, up to a report-independent constant, is \Phi_p(r)=b\{p\log r+(1-p)\log(1-r)\}.
Write U_p(r) for the included portfolio’s expected additional payoff at that belief. This quantity includes every report-dependent benefit charged to the modeled actor. Both terms use the same numeraire, horizon, and risk-neutral objective. Risk neutrality means that the reporter maximizes expected payment in that unit.
Two quantities describe the outside incentive. Its oscillation, \operatorname{osc}(U_p), is the least upper bound on payoff differences between any two reports. An L-Lipschitz payoff satisfies |U_p(r)-U_p(s)|\leq L|r-s|, so L bounds its change per unit change in report. The logarithmic score loss is expressed below through the binary relative entropy D(p\Vert r). It is zero at the truthful report and measures the expected logarithmic penalty for reporting r instead of p.
Theorem 5.1 (Global reporting bounds).
Suppose U_p is continuous and bounded on (0,1). Every maximizer \widehat r of \Phi_p+U_p lies in the interior and satisfies b D(p\Vert\widehat r)\leq U_p(\widehat r)-U_p(p),\qquad D(p\Vert r)=p\log\frac p r+(1-p)\log\frac{1-p}{1-r}. \tag{13} If \operatorname{osc}(U_p)\leq M, then |\widehat r-p|\leq\sqrt{M/(2b)}. If U_p is also L-Lipschitz, then b|\widehat r-p|\leq L\widehat r(1-\widehat r),\qquad |\widehat r-p|\leq\min\left\{1,\sqrt{\frac M{2b}},\frac L{4b}\right\}. \tag{14} Under the Lipschitz budget alone, the first inequality in (14) is sharp for each belief and each L>0.
Proof. Boundedness of U_p and divergence of the logarithmic loss confine a maximizer to a compact interior interval. Continuity gives existence there. Comparison with r=p gives (13). At fixed r, the function p\mapsto D(p\Vert r) has second derivative 1/[p(1-p)]\geq4. Its value and first derivative vanish at p=r. Integration therefore gives D(p\Vert r)\geq2(p-r)^2.
Optimality and the Lipschitz bound imply \Phi_p(\widehat r+h)-\Phi_p(\widehat r)\leq L|h| for both signs of small h. Thus |\Phi_p'(\widehat r)|\leq L. Since \Phi_p'(r)=b(p-r)/[r(1-r)], this proves (14). The affine payoffs U_p(r)=Lr and U_p(r)=-Lr have unique maximizers. Their first-order equations attain the upper and lower boundaries of that inequality. ◻
The oscillation budget bounds total score loss, while the sensitivity budget limits how far the optimal report can move.
For a belief-specific bound, set \ell=L/b>0. Under the Lipschitz budget alone, the exact permitted interval is \frac{1+\ell-\sqrt{(1+\ell)^2-4\ell p}}{2\ell} \leq\widehat r\leq \frac{\ell-1+\sqrt{(1-\ell)^2+4\ell p}}{2\ell}. \tag{15} This follows by solving the two quadratic inequalities in (14). At L=0, the interval consists of p alone.
An \eta-optimal report achieves an expected objective within \eta\geq0 of the maximum. For an \eta-optimal report, the same comparison gives bD(p\Vert r)\leq U_p(r)-U_p(p)+\eta. In particular, |r-p|\leq\sqrt{(M+\eta)/(2b)}. This last statement covers a solver with a certified objective error.
Imposing both budgets gives an exact region of attainable reports. Attainment permits ties because a payoff within the budgets may make several reports equally valuable.
Corollary 5.2 (Exact reporting region for finite incentive budgets).
Fix p\in(0,1) and M,L\geq0. A report r\in(0,1) maximizes the objective for some continuous outside payoff with oscillation at most M and Lipschitz constant at most L exactly when bD(p\Vert r)\leq M,\qquad \frac{b|r-p|}{r(1-r)}\leq L.
Proof. Necessity follows from Theorem 5.1. For r>p, set U(s)=0 for s\leq p, U(s)=bD(p\Vert s) on [p,r], and U(s)=bD(p\Vert r) for s\geq r. The derivative of D(p\Vert s) increases from zero on [p,r] because its second derivative is p/s^2+(1-p)/(1-s)^2>0. Thus the two proposed bounds control this payoff’s oscillation and Lipschitz constant. The objective is constant on [p,r] and smaller elsewhere, so r is a maximizer. For r<p, set U(s)=bD(p\Vert r) below r, U(s)=bD(p\Vert s) on [r,p], and U(s)=0 above p. The same derivative bound applies. At r=p, take U=0. ◻
The contract needs one aggregate outside-payoff bound for the reporter’s included positions. Signed quantities and clipped price factors give a certificate for long and short asset positions across all accounts assigned to the same beneficial owner.
Proposition 5.3 (An aggregate clipped-position certificate).
Consider a fixed finite portfolio with marked payoff U(r)=\sum_j q_jP_{j,0} \exp\{\alpha_j h_j(\mathop{\mathrm{logit}}r-u_{j,0})\}. Here q_j is a signed asset quantity, P_{j,0}>0 is its base price, \alpha_j>0, and h_j is the clipper of Definition 4.1 with cap d_j and width w_j. Let a_j=\alpha_jd_j and let m_j be the smaller of \sigma(u)(1-\sigma(u)) at u=u_{j,0}\pm(d_j+w_j), where \sigma(u)=(1+e^{-u})^{-1}. Then m_j>0, and valid aggregate bounds are M=\sum_j|q_j|P_{j,0}(e^{a_j}-e^{-a_j}),\qquad L=\sum_j\frac{|q_j|P_{j,0}\alpha_je^{a_j}}{m_j}. \tag{16} These bounds hold with positive and negative positions and with g_j below or above one.
Proof. Each factor lies in [e^{-a_j},e^{a_j}], which bounds its oscillation. The derivative vanishes outside the clipper’s active interval. Inside that interval, 0\leq h_j'\leq1 and r(1-r)\geq m_j. Differentiation therefore bounds its absolute derivative by \alpha_je^{a_j}/m_j. Summation and the triangle inequality give (16). ◻
The positive quantity m_j keeps r(1-r) away from zero throughout the factor’s active interval and makes its probability-coordinate sensitivity bound finite.
The contract fixes the included beneficial owner, positions, payoff rules, quantities, and common valuation time before accepting the report. All accounts of that owner consume one aggregate exposure allowance. A position change requires a new bound before a later reporting decision.
The certificate bounds the included payoff. Realizable liquidation proceeds require their own execution model. A mark, an external derivative, and a reversible trading cycle can produce different functions U_p. The derivative bound can be tightened by maximizing the actual aggregate derivative, including genuine offsets, over the report interval.
For example, take one marked position of magnitude at most 100, with base price one. Set u_0=0, d=1, w=1/4, and \alpha=0.01. Then m>0.17, L<5.95, and score scale b=1000 gives probability distortion below 0.00149. The price ratio still ranges from e^{-0.01} to e^{0.01}. These quantities specify a synthetic contract and do not establish a market calibration.
When the complete included payoff is observable and enforceable, the contract can cancel its report-induced change with a separate transfer. The adjustment can pay either party, so both sides must fund it.
Proposition 5.4 (Truthful reporting with an included payoff adjustment).
Fix a baseline report r_0 and a publicly specified included payoff V(r,Y). Suppose the contract also settles the transfer T(r,Y)=V(r_0,Y)-V(r,Y) to the reporter, in the same unit and at the same economic endpoint. Adding T to a strictly proper score and the included payoff preserves truthful reporting for every belief. If |V(r,Y)-V(r_0,Y)|\leq H, reserves of H on each side fund this adjustment.
Proof. The total outcome payment is S(r,Y)+V(r_0,Y). Its second term is independent of the report, so strict properness applies. The transfer magnitude is at most H in either direction. ◻
The contract preserves baseline ownership and requires a fixed observable payoff rule with enforceable transfers from both sides. The global distortion bound applies when the mechanism admits a bounded residual incentive instead. Neither construction identifies undisclosed positions or supplies external enforcement by itself. LMSR depth remains an elicitation parameter for the held-to-resolution contract. Reversing the prediction position instead requires the trading analysis below.
6 The Exact Round Trip
We calculate the cash paid by a trader who changes the forecast between opening and closing an asset position. For the cost-function prediction market used here, restoring its state contributes no cost before fees. This holds even when an intermediate forecast was expensive to obtain.
Let the AMM hold numeraire reserve R_{\!M}>0 and asset reserve R_{\!B}>0. The executable price curve during each trade uses exponent g, the bounded coupling factor already used in the marginal quote. At g=1, it is the constant-product reserve rule. During one leg, fix g>0 and preserve R_{\!M}R_{\!B}^{g}=k. \tag{17} Implicit differentiation gives the marginal asset price in numeraire units: P=-\frac{dR_{\!M}}{dR_{\!B}}=g\frac{R_{\!M}}{R_{\!B}}. \tag{18}
The constant k is fixed during a leg. In this construction, changing g holds the reserves fixed and selects the corresponding new k for the next leg. The funded construction in Section 8 uses a different update rule.
Proposition 6.1 (Finite-sale impact for every positive coupling).
Fix numeraire reserve R>0, asset reserve B>0, coupling exponent g>0, and sale quantity Q\geq0. Put z=Q/B and P_0=gR/B. With the invariant fixed during the sale, gross proceeds and the execution loss measured at the initial marginal mark are \Delta=R\bigl[1-(1+z)^{-g}\bigr],\qquad S=P_0Q-\Delta=R\bigl[gz-1+(1+z)^{-g}\bigr]. For every z\geq0, 0\leq S\leq\frac{g(g+1)}{2}Rz^2. \tag{19} For Q>0, average-price slippage satisfies 0\leq\frac{S}{P_0Q} \leq\min\left\{1,\frac{g+1}{2}z\right\}, and the terminal marginal-price decline is d_g(z)=1-(1+z)^{-g-1}, \qquad 0\leq d_g(z)\leq\min\{1,(g+1)z\}. The statement is a fixed-window execution result; it does not extend the fee, reserve-flow, or multi-window results beyond their separate hypotheses.
Proof. Set H(z)=gz-1+(1+z)^{-g}. Then H(0)=H'(0)=0 and H''(z)=g(g+1)(1+z)^{-g-2}, \qquad 0<H''(z)\leq g(g+1). The integral remainder H(z)=\int_0^z(z-u)H''(u)\,du proves (19). Since \Delta\geq0, one also has S\leq P_0Q, giving the first average-price bound. The derivative d_g'(z)=(g+1)(1+z)^{-g-2} gives the terminal bound. Finally, average slippage divided by P_0 is z^{-1}\int_0^z d_g(u)\,du, which gives the coefficient (g+1)/2 and its sharpness as z\downarrow0. ◻
Example 6.2 (A negative-signal coupling).
For g=1/2, R=100, and z=9/16, the proceeds are 20, the initial marked sale value is P_0Q=225/8, and S=65/8. The bound in (19) is 6075/512, and the terminal marginal price is 64/125 of its initial value. Thus the negative tail of a positive clipped factor has a nonzero, bounded execution response; no g\geq1 assumption is used by this proposition.
Remark 6.3 (Domain boundary for coupling and CCP composition).
The proposition covers the full image g=\exp(\alpha h)\in[e^{-\alpha d},e^{\alpha d}] whenever |h|\leq d and \alpha>0, including 0<g<1. The endpoint g=0 and negative exponents are outside the reserve model: the marginal price is nonpositive or the proceeds rule ceases to be the stated monotone sale curve. Importing this fixed-window bound into a CCP model still requires the CCP’s own assumptions, including positive reserves, fixed exponent during the window, nonnegative holdings and funding-response matrices, and (for the contraction guarantee) \gamma_h<1. No claim here extends an unrelated constant-product identity (which has g=1) or a statistical, legal, provider, or settlement guarantee.
Suppose a trader buys \Delta_B=xR_{\!B} units, where 0<x<1, while the coupling is g_0. The trader then changes the prediction signal so that the coupling is g_1 and sells the same units back. Define \lambda=-\log(1-x)>0. The quantity \lambda measures the proportional reserve movement in logarithmic units. Logarithmic movements add when a trade is split into successive fills at the same coupling. The numeraire paid and received before fees are \begin{align*} N_{\mathrm{in}} &=R_{\!M}\left[(1-x)^{-g_0}-1\right], \tag{20} \\ N_{\mathrm{out}} &=R_{\!M}(1-x)^{-g_0}\left[1-(1-x)^{g_1}\right]. \tag{21} \end{align*}
Proposition 6.4 (Conservation identity).
The fee-free AMM profit of the purchase-first round trip is N_{\mathrm{out}}-N_{\mathrm{in}} =R_{\!M}\left[1-(1-x)^{g_1-g_0}\right]. \tag{22} It is exactly zero when g_1=g_0.
At the same coupling level, the invariant returns the original numeraire reserve when the trader closes the asset position. Price impact alone therefore imposes no cost on this round trip.
6.1 Purchase first
First use segregated fees. The AMM charges f\in[0,1) on each gross leg, so the trader pays (1+f)N_{\mathrm{in}} and receives (1-f)N_{\mathrm{out}}. A separate fee account receives each charge. The fee stays outside the reserves, so the pool prices the closing trade from its gross trading reserves. Write \rho_f:=\frac{1+f}{1-f}. When g_1>g_0, the gross leg ratio is \frac{N_{\mathrm{out}}}{N_{\mathrm{in}}} =\frac{1-e^{-g_1\lambda}}{1-e^{-g_0\lambda}}. \tag{23}
Theorem 6.5 (Exact purchase-first fee floor).
For fixed g_1\geq g_0, every positive purchase-first round trip is unprofitable if and only if \rho_f\geq\frac{g_1}{g_0}. \tag{24} For the clipped factor (10), uniform deterrence between arbitrary clipped states is therefore equivalent to f\geq\tanh(\alpha\delta_{\max}). \tag{25} From the centred state to one saturation tail, the corresponding condition is f\geq\tanh(\alpha\delta_{\max}/2).
Proof. For a>0, the function (1-e^{-a\lambda})/a decreases in a. Hence the ratio in (23) is at most g_1/g_0, with equality in the limit \lambda\downarrow0. This proves (24) as a necessary and sufficient condition for all trade sizes. The clipped factor has g_1/g_0\leq e^{2\alpha\delta_{\max}}. Solving \rho_f\geq e^{2\alpha\delta_{\max}} for f gives (25). A centred one-directional move has ratio at most e^{\alpha\delta_{\max}}. ◻
Any non-recoverable prediction-side fee or exposure adds to the trader’s cost. Equation (25) is the exact AMM-only threshold when that additional cost is zero. No LMSR-depth threshold follows for a reversible prediction-market cycle.
6.2 Sale first
Now suppose the trader first sells yR_{\!B} units, y>0, at g_0, changes the coupling to g_1<g_0, and buys the same units back. Write S_{\mathrm{out}} for cash received on the opening sale and S_{\mathrm{in}} for cash paid on the closing purchase. With \lambda=\log(1+y), the gross leg ratio is \frac{S_{\mathrm{out}}}{S_{\mathrm{in}}} =\frac{e^{g_0\lambda}-1}{e^{g_1\lambda}-1}. \tag{26}
Theorem 6.6 (Exact sale-first cap condition).
If g_0>g_1, no fee f<1 deters every sale-first trade size. Under the cap 0<\lambda\leq\lambda_{\max}, every permitted sale-first round trip is unprofitable if and only if \frac{e^{g_0\lambda_{\max}}-1} {e^{g_1\lambda_{\max}}-1} \leq\rho_f. \tag{27} Uniformly over the clipped range, it is enough and necessary at the extreme states to impose (27) with g_0=e^{\alpha\delta_{\max}} and g_1=e^{-\alpha\delta_{\max}}.
Proof. For g_0>g_1, the ratio in (26) increases with \lambda and diverges as \lambda\to\infty. This rules out a universal f<1. Under a finite cap, the maximum occurs at \lambda_{\max}, which proves (27). The ratio increases with g_0 and decreases with g_1, so the clipped extreme states give the uniform condition. ◻
Uniform sale-first protection with positive trading capacity requires a segregated fee strictly above the limiting threshold. The corollary gives that condition and an explicit positive cap.
Corollary 6.7 (Strict slack and positive trading capacity).
Write a=\alpha\delta_{\max}>0 and H_a(\lambda)=\frac{\exp(e^a\lambda)-1}{\exp(e^{-a}\lambda)-1}. A positive universal sale-first cap under segregated fees exists exactly when f>\tanh a. For such a fee there is one positive root H_a(\lambda_*)=\rho_f, and every 0<\lambda_{\max}\leq\lambda_* is admissible. A conservative explicit choice is \lambda_{\mathrm{safe}} =\frac{\log\rho_f-2a}{2\sinh a}>0. \tag{28} At a=0, a constant coupling admits every round-trip size under either fee convention.
Proof. The continuous extension has H_a(0)=e^{2a}. For \lambda>0, the derivative of \log H_a is \frac{e^a}{1-e^{-e^a\lambda}} -\frac{e^{-a}}{1-e^{-e^{-a}\lambda}}>0, because z/(1-e^{-z\lambda}) increases strictly in z>0. Thus H_a(\lambda)>e^{2a} at every positive size and tends to infinity. This proves the strict-slack and root statements. Writing each exponential difference as an integral gives H_a(\lambda)\leq e^{2a}\exp(2\sinh(a)\lambda). Substitute (28). ◻
The cap applies to the aggregate log-reserve movement covered by the claim. Splitting one same-coupling leg preserves its cumulative displacement and fee. A signal reset or a second account supplies no additional capacity. Different coupling levels between partial fills require the sequential policy below.
For f=0.003 and a=0.0025, the positive root is approximately \lambda_*=0.3764439626. Rational Taylor bounds for each exponential certify a bracket of width 2\cdot10^{-30} containing the root. The explicit cap is smaller and needs no numerical root search.
When a permitted cycle remains profitable, reserve planning needs a bound on the cash it can extract. The forecast range and allowed trade size determine that bound.
Corollary 6.8 (Reserve extraction envelope).
In either profitable direction, a fee-free round trip with log-reserve displacement \lambda and coupling change |g_1-g_0| extracts R_{\!M}\left[1-e^{-|g_1-g_0|\lambda}\right]<R_{\!M}. \tag{29} For the clipped factor and a depth cap \lambda\leq\lambda_{\max}, \text{extraction} \leq R_{\!M}\left[1-e^{-2\sinh(\alpha\delta_{\max})\lambda_{\max}}\right] \leq2\lambda_{\max}\sinh(\alpha\delta_{\max})R_{\!M}. \tag{30}
Proof. Equation (29) is (22) in the profitable direction, written in log-reserve coordinates. Across the clipped range, |g_1-g_0|\leq e^{\alpha\delta_{\max}}-e^{-\alpha\delta_{\max}} =2\sinh(\alpha\delta_{\max}). Apply 1-e^{-z}\leq z. ◻
These formulas end with venue balances after the closing trade. They do not assert legal finality, completed funding, or beneficiary receipt.
7 Fee Routing and Sequential Execution
The preceding cap concerns a complete two-leg trade under segregated fees. A venue also needs conservation across partial fills, signal changes, and repeated orders. Depositing each fee into the pool changes the cash reserve used to price the next fill. We compare that immediate retention with the segregated account above, then examine sequences with more than two trades.
In the execution ledger, M_t and B_t are the cash and asset reserves after step t, and F_t is the separate fee balance. A tilde marks the gross reserves before the current fee is routed.
Definition 7.1 (Gross execution and fee routing).
At step t, let M_t,B_t>0 be the pool reserves and let F_t\geq0 be its fee account. Write d_t=\log(B_{t+1}/B_t) for the gross log-reserve movement. A sale into the pool has d_t>0. A purchase has d_t<0. At a fixed g_t, gross execution gives \widetilde B_{t+1}=B_t e^{d_t},\qquad \widetilde M_{t+1}=M_t e^{-g_td_t},\qquad c_t=f|\widetilde M_{t+1}-M_t|. The trader’s cash change is -(\widetilde M_{t+1}-M_t)-c_t. Its asset change is -(\widetilde B_{t+1}-B_t). Segregated routing sets M_{t+1}=\widetilde M_{t+1} and F_{t+1}=F_t+c_t. Immediate retention deposits the current fee into the pool: M_{t+1}=\widetilde M_{t+1}+c_t and F_{t+1}=F_t. The deposit changes the invariant constant for the next leg. The invariant calculation itself uses the gross reserves.
With immediate retention, the fee increases the cash reserve used by the closing leg. The same threshold can then protect both complete two-leg directions at every size.
Theorem 7.2 (Retained fees deter both complete round-trip directions).
Use immediate retention and 0\leq f<1. Let 0<g_\ell\leq g_h and \lambda>0. A purchase at g_\ell followed by its closing sale at g_h has final reserve ratio K_f(\lambda)= \bigl[(1+f)e^{g_\ell\lambda}-f\bigr] \bigl[f+(1-f)e^{-g_h\lambda}\bigr]. \tag{31} A sale at g_h followed by its closing purchase at g_\ell has the same ratio. The trader’s cash gain in either case is M_0[1-K_f(\lambda)]. Every size is unprofitable exactly when \rho_f\geq g_h/g_\ell. Hence f\geq\tanh a deters both directions between arbitrary clipped states.
Proof. Apply Definition 7.1 to the two legs. The asset reserve returns to its initial amount, while retained fees remain in M. Cash conservation gives the stated trader gain. Both factors in (31) are positive. After dividing its derivative by a positive factor, its sign equals the sign of T(\lambda)=f g_\ell e^{g_h\lambda} +(1-f)(g_\ell-g_h)+\frac{f g_h}{\rho_f}e^{-g_\ell\lambda}. At zero, T(0)=g_\ell-g_h/\rho_f. The elementary exponential inequalities give T(\lambda)-T(0) \geq f g_\ell g_h\lambda(1-1/\rho_f)\geq0. Thus the fee condition gives K_f(\lambda)\geq K_f(0)=1. If the condition fails, K_f'(0)<0, so sufficiently small trades are profitable. Opposite coupling moves reduce the gross gain and satisfy the same bound. ◻
Retention changes the executable curve after every fee deposit, so the segregated-fee sale cap remains a separate theorem. An implementation records its routing choice before quoting either leg. Both mechanisms permit positive orders, and both two-leg statements assume that no other reserve-changing event occurs between the legs.
A trader may close one purchase through many smaller sales. Because each fee deposit changes the next execution curve, the two-leg theorem does not cover this sequence. A stronger threshold protects arbitrary finite sequences by making a reserve quantity nondecreasing.
Theorem 7.3 (Retained-fee protection across arbitrary trade sequences).
Let every trade retain its fee immediately and let g_t\in[g_\ell,g_h]. Assume positive reserves, fixed 0\leq f<1, and no external reserve flows. If f\geq1-g_\ell/g_h, \tag{32} then M_tB_t^{g_\ell} is nondecreasing along every finite trade sequence. In particular, B_T=B_0 implies M_T\geq M_0. For the clipped range, the sufficient fee is f\geq1-e^{-2a}. This condition is also necessary for protection against every finite closed-inventory sequence when sizes are unrestricted.
Proof. For a purchase, d<0 and the retained reserve ratio is (1+f)e^{-gd}-f\geq e^{-gd}. Multiplication by e^{g_\ell d} gives a ratio at least one. For a sale, convexity of the exponential gives f+(1-f)e^{-gd}\geq e^{-(1-f)gd}. Condition (32) gives g_\ell\geq(1-f)g. Thus the same product ratio is at least one. Multiply these inequalities across all trades.
For necessity, buy a log amount L at g_\ell and close it through n equal sales at g_h. The final reserve ratio is \bigl[(1+f)e^{g_\ell L}-f\bigr] \bigl[f+(1-f)e^{-g_hL/n}\bigr]^n. As n tends to infinity this approaches [(1+f)e^{g_\ell L}-f]e^{-(1-f)g_hL}. If (1-f)g_h>g_\ell, this limit tends to zero as L increases. Some finite L and finite n therefore produce a profitable closed sequence. ◻
The stronger arbitrary-sequence fee floor still permits, for fee f>0, the positive signal range 0<a\leq-\log(1-f)/2. It supports repeated trading without a fixed cumulative turnover ceiling. A venue can accommodate larger signal ranges by bounding the total variation of log inventory over a fixed horizon. Total variation counts the absolute size of every movement, including movements that later reverse. It therefore records repeated trading even when the final inventory returns to its starting value. Pending orders must reserve that capacity before execution so that concurrent requests use the same allowance.
Definition 7.4 (Persistent aggregate capacity).
A pool checkpoint fixes a finite horizon, reserve floors, and total variation budget V_{\max}>0. Every admitted command reserves its maximum possible absolute log movement before execution. Let V_t=\sum_{s<t}|d_s| and let P_t be the sum of pending reservations. Admission requires V_t+P_t+|d_{\mathrm{new}}|_{\max}\leq V_{\max}. It also checks the post-trade cash and asset reserve floors. The same pool ledger serializes admission and execution across all accounts. Partial fills consume one command’s reservation cumulatively. A retry retains the same command identity and adds no effect. Cancellation releases only capacity proven unable to execute. Signal changes and account changes preserve V_t and pending reservations.
Theorem 7.5 (Finite-horizon reserve accounting).
Under segregated fees and without external reserve flows, any finite admitted sequence satisfies B_T=B_0\exp\Bigl(\sum_t d_t\Bigr),\qquad M_T=M_0\exp\Bigl(-\sum_tg_td_t\Bigr). \tag{33} For g_t\in[e^{-a},e^a], define the constant-coupling reference M_T^{\mathrm{ref}}=M_0\exp\Bigl(-\cosh(a)\sum_td_t\Bigr). Then e^{-\sinh(a)V_T}\leq M_T/M_T^{\mathrm{ref}} \leq e^{\sinh(a)V_T}. \tag{34} For a closed inventory sequence, B_T=B_0, so M_T\geq M_0e^{-\sinh(a)V_{\max}}. For either fee route, cash and asset changes conserve M_T+F_T+\sum_i C_{i,T},\qquad B_T+\sum_i A_{i,T}, where C_i,A_i are trader balances and external flows are recorded separately.
Proof. Multiply the gross reserve recursions to obtain (33). Since |g_t-\cosh(a)|\leq\sinh(a), |\sum_t(g_t-\cosh(a))d_t|\leq\sinh(a)V_T. Exponentiation gives (34). Each executed transfer has equal and opposite ledger entries. Fee retention transfers existing fees into M and creates no cash. ◻
This bound permits arbitrary order interleaving and signal changes within the stated horizon. The reference is a constant-coupling reserve path, not a forecast of asset value. Unclosed asset inventory retains its market risk. Immediate retention uses its exact fee-deposit recurrence and the same funded reserve floors. A fee reinvestment, deposit, withdrawal, or rebalance has its own signed cash and asset entries. Such an event does not by itself restart the cumulative capacity counter.
Here v denotes a fixed external asset valuation in cash per unit, distinct from the earlier latent log value. The liquidity provider’s marked change is \Delta W_{\mathrm{LP}}=\Delta M+\Delta F+v\Delta B. Trader cash gain and this marked change are distinct measurements for an open inventory position. An empirical solvency assessment also needs the valuation path, external flows, and operational costs.
8 Funding the Control Change
The retained-fee and variation-budget constructions change the signal while holding reserves fixed. We now fund the reserve change that preserves a common state relation across trades and signal updates. Here a control is the pricing factor selected from the prediction signal. Changing the control changes the price available at the same asset inventory.
A potential is a function of the current state whose differences can price inventory and control movements. When charges equal these differences, their sum depends only on the endpoints, and every fully closed sequence has zero total charge. A price that responds to control conflicts with a control charge independent of inventory, as the following proposition shows. Its generic coordinates x and z denote inventory and control. The funded AMM will then use explicit reserve coordinates.
Proposition 8.1 (The one-way potential obstruction).
On an open rectangle of inventory and control states (x,z), let the marginal charges be P(x,z) and S(z). Assume both functions are continuously differentiable. A C^2 function \Psi with \Psi_x=P and \Psi_z=S exists only if P_z=0 throughout the rectangle. For a rectangular path, the total charge is \oint(P\,dx+S\,dz) =\int_{x_0}^{x_1}\{P(x,z_0)-P(x,z_1)\}\,dx, \tag{35} when the first inventory movement occurs at z_0.
Proof. Equality of mixed partial derivatives gives P_z=\Psi_{xz}=\Psi_{zx}=S_x=0. The two integrals of S along the rectangular path cancel. The remaining two integrals give (35). ◻
A rectangular path changes inventory, then control, then reverses both movements. For P(x,z)=z and S(z)=0, the trader’s gain is (z_1-z_0)(x_1-x_0). This is a two-coordinate charging example with reversible transitions. Fees, restricted transitions, and explicit funding add economic state or change the charging rule. Each such addition requires its own accounting. The obstruction alone neither prices an executable AMM order nor evaluates an outside portfolio.
The sponsor funds control changes at fixed inventory so that the pool keeps one reserve relation across trades and control updates. Asset trades exchange cash with traders, while control updates exchange cash with the sponsor. In this construction, B_* is an anchor inventory, K is its cash reserve, and x is the logarithm of inventory relative to that anchor. The band parameter D limits the permitted distance from the anchor.
Definition 8.2 (Funded reserve adjustment).
Fix B_*>0, K>0, 0<g_\ell\leq g_h, and a log-inventory band |x|\leq D, where x=\log(B/B_*). The pool keeps the state relation M=K e^{-gx},\qquad g\in[g_\ell,g_h],\qquad C\geq0. \tag{36} Here C is a separate sponsor cash account in the same numeraire as M. A trade changes B at fixed g and transfers the exact change in M against the trader. A control update g\to g' holds B fixed and transfers \Delta=K(e^{-g'x}-e^{-gx}),\qquad M'=M+\Delta,\qquad C'=C-\Delta. \tag{37} It executes atomically when C'\geq0 and both control values lie in the admitted interval. A positive \Delta spends sponsor cash. A negative \Delta returns cash to that account. Every trade respects the inventory band. The construction has no fee or external reserve flow.
All pending control deposits reserve the same sponsor cash before execution. Concurrent requests share that account. Partial execution consumes its reservation cumulatively, and a retry retains the original identity. This mathematical funding rule leaves actual deposit and withdrawal authority to the account’s governing contract.
Theorem 8.3 (A nonzero signal with a cumulative funded bound).
Under Definition 8.2, each trade follows the invariant MB^g=KB_*^g with marginal price P=gM/B. For any finite sequence of trades and control updates, total pool, sponsor, and trader cash is conserved. Total pool and trader asset quantity is also conserved. If the final (B,g) equals its initial value, aggregate trader cash gain is \Pi=C_0-C_T\leq C_0. \tag{38} If D<1/g_h, the marginal price increases strictly with g at every admitted inventory. At B=B_*, its value is exactly gK/B_*. Throughout the band, K e^{-g_hD}\leq M\leq K e^{g_hD},\qquad \max\{\Delta,0\}\leq M(e^{D|g'-g|}-1). \tag{39}
Proof. At fixed g, differentiating (36) gives dM=-(gM/B)dB. Each trade transfers equal and opposite cash and asset quantities. Each control update transfers equal and opposite cash between M and C. Thus M+C+\sum_i c_i and B+\sum_i a_i remain constant, where c_i,a_i are trader balances. Restoring (B,g) restores M, which gives (38).
For the marginal price, P=\frac{gK}{B_*}e^{-(g+1)x},\qquad \frac{\partial\log P}{\partial g}=\frac1g-x\geq\frac1{g_h}-D>0. The reserve range follows from |gx|\leq g_hD. Finally, \Delta=M(e^{-x(g'-g)}-1) gives the deposit bound. ◻
The complete economic state includes the sponsor balance. A trader can earn a positive amount while restoring (B,g) by consuming part of that balance. Restoring the entire state, including C, gives zero aggregate cash gain. For an open inventory position, cash gain must be combined with an explicit valuation of the remaining assets. The reserve band bounds each state, while the cash admission rule bounds net sponsorship across repeated states. Returned cash can fund later updates, so gross transfers can exceed the initial balance.
Take B_*=K=100, g_\ell=0.8, g_h=1.2, and D=0.2. Starting from B=100 and g=0.8, buy down to B=100e^{-0.1}. An update to g=1.2 deposits 100(e^{0.12}-e^{0.08}), approximately 4.42098. Selling back to B=100 and restoring g=0.8 closes the inventory and control state.
The trader receives exactly that deposit, and the sponsor account pays it once. A sponsor balance of 5 funds this cycle. It cannot fund a second identical cycle without replenishment. Every state in this example lies within the admitted band, including coupling values below one.
The sponsor purchases the defined control response through an explicit account, set of eligible updates, and cumulative budget. The reporter’s proper score can remain independent of that account. Any reporter ownership of the sponsor or trading positions enters the aggregate outside-payoff contract of Section 5. Thus funding a signal does not by itself establish truthful reporting.
8.1 Certificates across execution modes
A finite transition graph can describe the permitted execution modes. The criterion characterizes when differences of a potential, a value assigned to each state, bound every transition weight.
Proposition 8.4 (Complete potential certificate on a finite graph).
Let a finite directed graph carry real edge weights w(u,v). Every directed cycle has nonpositive total weight exactly when some vertex potential \phi satisfies w(u,v)\le\phi(u)-\phi(v) on every edge. When this holds, the least nonnegative such potential is \phi_*(u)=\max_{p\text{ starts at }u}\sum_{e\in p}w(e), where paths may end at any vertex and include the empty path. It suffices to maximize over simple paths with at most |V|-1 edges.
Proof. Summing the potential inequalities around a cycle gives nonpositive total weight. Conversely, remove each repeated-vertex segment from a path. Each removed cycle has nonpositive weight, so removal cannot decrease the path’s weight. The maximum therefore exists among the finitely many simple paths, including the empty path. Prepending an edge u\to v to a maximizing path from v gives \phi_*(u)\ge w(u,v)+\phi_*(v). Any nonnegative feasible potential bounds a path’s weight by its initial value minus its nonnegative terminal value. It consequently dominates every path weight and hence \phi_*. ◻
The edge weight must match the economic quantity being certified. For the retained-fee rule, take a finite graph of inventory and control states with the admitted multiplicative reserve updates. Assign each trade edge the dimensionless logarithmic reserve loss w(u,v)=-\log(M'/M). The reserve ratio depends on the edge’s log-inventory movement, coupling, and fixed fee, independently of the absolute cash scale. Under Theorem 7.3, its reserve inequality gives w(u,v)\le g_\ell\log(B'/B) =\phi(u)-\phi(v),\qquad \phi(u)=-g_\ell\log(B/B_*), where B_*>0 is a fixed reference inventory in the same unit as B.
A control change at fixed reserves has zero edge weight and leaves this potential unchanged. One can add a constant to make the potential nonnegative on the finite graph. Every admitted cycle then has -\log(M_T/M_0)\le0. For an inventory-closing execution without external reserve flows, this precludes positive aggregate trader cash gain.
The weight is logarithmic reserve loss, not cash gain on each individual trade. On the full reserve-state graph, cash gain already has the potential M by conservation. A path restoring inventory while changing cash is not a cycle in that full state graph.
Open Problem 1 (Compatible certificates across execution modes).
Construct an admitted transition graph that includes retained fees, segregated fees, funded controls, and their permitted mode changes. Its state must retain sponsor balances, pending reservations, reserve floors, and all other liabilities affecting future execution. State the edge accounting and the common or compatible potentials that bound every admitted path. The finite graph criterion decides the stated additive certificate problem once that graph and its weights are supplied. It does not supply the economic interface or justify discarding a resource from the state.
9 Information Gain within the Trading Limits
Safety parameters also limit the information that the price can transmit. At f=0.003, the segregated-fee condition gives a<\operatorname{atanh}(0.003) and a full price ratio below (1.003)/(0.997)\approx1.006018. Whether this range is useful depends on the error scale, the trading depth, and the delay. We test whether a correction within this range can use information that the spot observation misses.
In the two-observation model, D now denotes the difference between the prediction and spot observations. It is distinct from the preceding section’s inventory-band parameter. The unrestricted correction z_* is the amount the calibrated estimate would add to the spot observation. The function c reduces that correction to the permitted range while preserving its direction.
Proposition 9.1 (Strict information improvement under bounded correction).
Use the independent Gaussian observations of (4), with positive variances. Write D=X_P-X_A, \kappa=\sigma_A^2/(\sigma_A^2+\sigma_P^2), and z_*=\kappa D. The baseline observation X_A and its clipping centre are committed before the reporting window. Let c(z) have the sign of z, satisfy |c(z)|\leq|z|, and be nonzero with positive probability. Assume |c(z)|\leq a. The bounded log-price estimate \widehat v=X_A+c(z_*) satisfies \mathbb E(\widehat v-v)^2 =\frac{\sigma_A^2\sigma_P^2}{\sigma_A^2+\sigma_P^2} +\mathbb E\bigl(z_*-c(z_*)\bigr)^2 <\sigma_A^2. \tag{40} The unclipped calibrated estimator attains the first term alone. The differentiable clipper of Definition 4.1 supplies such a correction for every a>0.
Proof. Gaussian conditioning gives \varepsilon_A=-\kappa D+\eta, where \eta is independent of D. Its variance is \sigma_A^2\sigma_P^2/(\sigma_A^2+\sigma_P^2). Substitution gives (40). The sign and magnitude conditions imply (z-c(z))^2\leq z^2, strictly wherever c(z)\ne0. Without correction, the same decomposition sums to \sigma_A^2. ◻
The strict inequality gives no minimum gain of practical size. A narrow permitted correction can yield a correspondingly small information improvement.
For an affine prediction observation X_P=b+s u, the committed centre is u_0=(X_A-b)/s when s\ne0. Here b is the observation intercept, distinct from the earlier score scale. Apply the clip to \kappa s(u-u_0). This constructs the full estimator in its central region while bounding the overlay everywhere. The prediction payoff remains the proper score and reads neither the resulting spot price nor the fee account. Estimation error in \kappa, signal dependence, and delay require evaluation under their actual joint law.
For the funded construction, the price at its anchor is the baseline reserve ratio multiplied by the selected control. Choosing K/B_*=e^{X_A} and g=e^{c(z_*)} realizes the bounded log-price estimator just derived. Here c(z_*) is the clipped correction to the baseline log-price observation X_A. Its baseline X_A is fixed before the reporting window. Away from the anchor, the funded price law is the one in Theorem 8.3 and requires its own calibration.
9.1 Held-out synthetic evaluation
A reproducible study uses 4,096 training observations and 8,192 separate evaluation observations for each of twelve signal cases. The training variances determine \widehat\kappa. The cases combine spot noise 0.002 or 0.01, prediction-noise ratios 0.5, 1, or 2, and delay noise 0 or 0.003. All noises are independent Gaussian draws in log-value units. Delay noise enters the prediction error variance.
Each case uses fees 0.001, 0.003, or 0.01, three positive clips below the strict fee limit, and two reserve depths. The 216 configurations reuse evaluation draws for paired comparisons. They compare zero coupling, the bounded correction, and ordinary unclipped calibrated pricing.
Table 1 reports synthetic results for six configurations at fee 0.003, clip a=\operatorname{atanh}(0.003)/2, and zero delay noise. The columns give squared log-error divided by the zero-coupling error. A ratio below one means that the forecast correction improves accuracy relative to the spot observation alone.
| Spot noise | Prediction/spot noise | Bounded | Unclipped |
|---|---|---|---|
| 0.002 | 0.5 | 0.3743 | 0.2029 |
| 0.002 | 1.0 | 0.5646 | 0.4958 |
| 0.002 | 2.0 | 0.8097 | 0.8048 |
| 0.010 | 0.5 | 0.8081 | 0.1999 |
| 0.010 | 1.0 | 0.8543 | 0.5105 |
| 0.010 | 2.0 | 0.9110 | 0.8030 |
The execution study requests one asset unit at random buy or sell sides. Its private value is two percent above or below the common valuation in the requested direction. An order executes only when its fee-inclusive surplus is nonnegative. Reserve depths are 100 or 10,000 asset units. The liquidity provider owns the segregated fee account.
The study records fill rate, trader surplus, fee revenue, and liquidity-provider marked change per requested order. The exact transfer identity makes trader surplus plus provider marked change equal the executed private-value benefit. The full parameter grid accompanies the calculation.
For equal signal-noise standard deviations of 0.01 and depth 100, the same fee and clip give Table 2. Surplus and provider value use the common numeraire per requested one-unit order. Fill rate is the fraction of requested orders that execute. Trader surplus measures the executed private value net of the fee-inclusive price. Provider value includes the fee account and values the remaining asset inventory at the common valuation.
The bounded correction increases the fill rate and provider value in this fixture. Trader surplus per request decreases slightly as quotes become more accurate.
| Pricing rule | Fill rate | Trader surplus | Provider value |
|---|---|---|---|
| Zero coupling | 0.7614 | 0.008441 | 0.006789 |
| Bounded correction | 0.7823 | 0.008208 | 0.007440 |
| Calibrated unclipped | 0.8347 | 0.007656 | 0.009041 |
Moving from these synthetic comparisons to observed-market evaluation requires dated signal samples, out-of-sample outcomes, actual fee routing, and measured execution delay. The unclipped comparator retains its lower model error while allowing a larger signal price range. The bounded construction supplies a positive information effect inside an explicit trading-safety region. Economic deployment depends on the measured utility of that region in the selected market.
10 Boundaries of the Result
Exact statements.
The coupled-path characterization and global reporting bounds are exact under their stated assumptions. The same holds for the clipped price bounds, invariant calculation, purchase-first fee floor, sale-first cap condition, reserve envelope, and retained-fee theorem. The funded control construction and finite-horizon accounting give exact resource bounds under their respective assumptions.
Conditional statements.
The linear estimator requires independent unbiased Gaussian observations and an affine logit-value relation. The binary-payoff map is a fixed-operating-point linearisation. The global reporting bounds assume a held-to-resolution score and the stated aggregate outside-payoff bounds. The local formula gives its first-order description in the unclipped central region.
Usefulness.
Proposition 9.1 gives a strict information improvement under the declared Gaussian signal law. The held-out study measures that construction and its trading outcomes in a synthetic economy. Market claims require observed signal errors, dependence, latency, and trader overlap.
Separate questions.
This paper does not define the underlying claim, decide a dispute, establish a legal settlement rule, move funding, or prove receipt by a beneficiary. It studies price formation and cross-venue incentives within the trade boundary of Assumption 1.1.
Open Problem 2 (Endogenous cross-venue equilibrium).
Characterise equilibrium when spot trading changes prediction beliefs and prediction trading changes spot demand across successive windows. The static path theorem does not determine that feedback process.
Open Problem 3 (Portfolio formation and funded information demand).
Characterise equilibrium when traders choose their included portfolios before reporting and sponsors choose future information budgets. Theorems 5.1 and 8.3 condition on the admitted payoff and funded account. Endogenous participation, undisclosed outside positions, and sequential budget replenishment require a joint economic model.
Open Problem 4 (Joint calibration).
Estimate signal noise, cross-venue dependence, fee response, and executable depth from public market data. Those estimates determine whether the conditional logit representative is useful in a particular market.
References
[1] R. Hanson. Combinatorial information market design. Information Systems Frontiers, 5(1):107–119, 2003.
[2] R. Hanson. Logarithmic market scoring rules for modular combinatorial information aggregation. Journal of Prediction Markets, 1(1):3–15, 2007.
[3] T. Gneiting and A. E. Raftery. Strictly proper scoring rules, prediction, and estimation. Journal of the American Statistical Association, 102(477):359–378, 2007.
[4] A. Othman and T. Sandholm. Decision rules and decision markets. In Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems, pages 625–632, 2010.
[5] Y. Chen and I. A. Kash. Information elicitation for decision making. In Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems, pages 175–182, 2011.
[6] P. Shi, V. Conitzer, and M. Guo. Prediction mechanisms that do not incentivize undesirable actions. In Proceedings of the 5th Workshop on Internet and Network Economics, pages 89–100, 2009.
[7] G. Angeris, H.-T. Kao, R. Chiang, C. Noyes, and T. Chitra. An analysis of Uniswap markets. Cryptoeconomic Systems, 1(1), 2021.
[8] G. Angeris and T. Chitra. Improved price oracles: Constant function market makers. In Proceedings of ACM Advances in Financial Technologies, pages 80–91, 2020.
[9] Committee on Payment and Settlement Systems and Technical Committee of the International Organization of Securities Commissions. Principles for Financial Market Infrastructures. Bank for International Settlements, 2012.
[10] W. Du. Three myths about payment innovation. Panel remarks at the Jackson Hole Economic Policy Symposium, 29 August 2026.
[11] W. Du, C. Huang, and D. Scharfstein. Competing rails for cross-border payments: Banks, fintechs, and stablecoins. Harvard Business School working paper, 15 February 2026.
[12] R. Lorgat. Event-Collect BFT. Companion paper, 2026.
[13] R. Lorgat. Parlay Identification of Ising Couplings in Correlated Binary Event Markets. Companion paper, 2026.
[14] A. H. Jazwinski. Stochastic Processes and Filtering Theory. Academic Press, 1970.
[15] B. D. O. Anderson and J. B. Moore. Optimal Filtering. Prentice-Hall, 1979.