Search arXiv⌕ Search

arXiv · 2610.16588

Demand Under a Mechanical Price: Elasticity and Welfare in Ethereum's Data-Availability Market

Abstract

Ethereum sells data-availability capacity to rollups through "blobs" priced by a controller: the blob fee rises and falls exponentially with cumulative usage above or below a target, and no auction sets it. We measure what this mechanical price costs. The Pectra upgrade of 7 May 2025 doubled blob capacity on a date fixed weeks in advance, while the market was congested, and the blob fee fell from 0.82 mETH per blob (about USD 1.40) to its 1-wei floor. Rollups' blob purchases rose 24%. The 95% interval, built from the same estimator at 516 placebo dates, runs from 8% to 40%, so removing the entire price raised purchases by at most 40%. The implied elasticity at the pre-shock price is -0.19, and no value below -0.31 is consistent with the interval. The estimate includes any rise in L2 activity that coincided with the fork, so it bounds the price response from above. With demand this inelastic, the controller works mainly as a transfer. Rollups paid USD 14.8 million in blob fees under the first blob regime, 67% of it in two quarters when capacity was full and any market-clearing mechanism would have collected comparable scarcity rents. Where capacity was slack, the reserve price introduced in December 2025 cost at most 2.6 ETH (USD 8,039) in deadweight loss under the most elastic demand the data allow. Mempool records for 5.4 million blob transactions show that when the fee sits at its floor, capacity is slack: transactions miss about one block and are almost never priced out.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Farbod Ghasemlu. 2026-10-12. Demand Under a Mechanical Price: Elasticity and Welfare in Ethereum's Data-Availability Market. https://arxiv.org/abs/2610.16588

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

A Finite Bid--Ask Spread from Replenishment Displaced from the Quote

We give a unified analytic account of a finite bid--ask spread in a two-field reaction--diffusion order book. The model retains separate bid and ask densities in operational time, with diffusion, cancellation, reaction and external order creation. On the symmetric equal-coefficient branch, the imbalance field determines the reaction price, while the total standing density carries the spread geometry. A market-making source is introduced by withholding order placement over a finite interval around the reaction boundary, representing round-trip replenishment displaced from the quote. Under a separated, quasistationary and weak-overlap approximation, transport penetrates inward from the placement edges over the cancellation length, giving the quoted spread as the sub-threshold core of the placement-source-free interval. Market orders remove standing density at the observed quote, whereas replenishment is delivered outside it and must diffuse back across the penetration depth. We derive the resulting delayed and attenuated quote-level response in operational time. On that branch, finite spread and price impact arise from distinct response sectors, while their calendar-time appearance requires a separate observation clock.

q-fin.TR↗

Volatility in Prediction Markets: A Structural Approach

Forward-looking volatility forecasts are central inputs to derivatives pricing, market making, risk management, and volatility-linked trading strategies, with ARCH and GARCH models serving as the canonical workhorses. Such models are natural in standard asset markets, where prices are positive-valued stochastic processes and volatility is typically inferred from return dynamics. Prediction markets have a different structure: prices are bounded probabilities, payoffs are binary, and contracts resolve at known deadlines. We develop and estimate a volatility model tailored to binary prediction markets. The model combines two economic mechanisms: a Wright-Fisher deadline-resolution component, capturing how remaining binary uncertainty is forced to resolve over time, and a Glosten-Milgrom order-flow component, capturing volatility from informed trading as reflected in spreads and volume. Using a large panel of Kalshi contracts, we show that these structural variables carry substantial forecasting power. Plain ARCH/GARCH benchmarks are dominated by structural specifications; scaling the structural variance by a GARCH multiplier gives the best overall forecasts.The two layers play distinct roles: the structural term sets the level of conditional variance, while the GARCH recursion corrects the timing of interval violations.The model also provides an interpretable measurement framework: volatility is highest near fifty-fifty prices, rises near resolution, and varies across categories with the timing and discreteness of information arrival. Economics contracts are closer to smooth deadline-resolution dynamics, while sports contracts exhibit more event-concentrated, jump-like behavior. Across major categories, re-estimating the model within each category does not improve out-of-sample performance, suggesting that the pooled structural specification transfers beyond the headline result.

q-fin.TR↗

Mixture-of-Experts for Cryptocurrency Order Execution: Training Stability, Tail Risk, and Failure Modes

Deep reinforcement-learning policies for order execution can vary substantially across training seeds, so apparent architectural gains may reflect favourable training realisations rather than reproducible properties of the architecture. We evaluate vanilla Double Deep Q-Learning (DDQL), K-means-partitioned mixtures of DDQL experts at $K \in \{2, 4, 8\}$, and dense networks parameter-matched to the $K{=}4$ and $K{=}8$ expert budgets on 5-minute mean-aggregated BTC/USDT limit order book data from Binance. No learned configuration significantly improves mean implementation shortfall over DDQL. Under the reported specification, all have higher mean shortfall than TWAP (0.39 bps) and immediate liquidation (0.21 bps) in an environment whose frictionless replay and terminal-urgency penalty make early liquidation nearly costless; 11/100 vanilla-DDQL runs, versus none in either MoE $K{\geq}4$ arm, converge to a policy that waits until forced liquidation. We then decompose this specification on a device-matched baseline. Annealed exploration alone eliminates observed collapses (12/100 to 0/100; exact McNemar $p{=}4.9{\times}10^{-4}$), matching the elimination under expert partitioning. Combining annealed exploration with the aligned reward restores collapse in 19/30 runs; with all three specification changes, it rises to 48/100. In this environment, expert partitioning is unnecessary to suppress collapse and appears to mask a training-specification failure rather than confer an intrinsic performance benefit. No MoE $K{=}8$ run collapses under any of the six specifications tested. Across-seed dispersion is lowest at $K{=}8$ but non-monotone and not robust to family-wise adjustment, while within-policy tail risk worsens monotonically with $K$. The apparent attribution of the failure mode reverses between 30 and 100 seeds, illustrating the importance of repeated-seed evaluation.

q-fin.TR↗