Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.03922

Priority Gas Auction Cadence and Searcher Competition: Evidence from Flashblocks on Base

Pranay Anchuri·Edward W. Felten·Akaki Mamageishvili
View original source ↗Read source document ↗Export metadata ↓

Abstract

Flashblocks divide a block's priority gas auction into shorter sequential auctions that commit transaction order before the block is complete. We ask how this auction cadence affects bidding and competition among automated arbitrageurs, or searchers. In July 2025 Base replaced a single 2 s auction with ten 200 ms auctions. We use this change to estimate the searcher response from on-chain data alone. On an address-day panel of 3,032 searchers and 8,053 activity-matched controls, a difference-in-differences design estimates a 0.187 gwei fall in the effective priority fee (59% of the searcher pre-period mean). The share of searcher priority-fee value paid in the first tenth of block gas falls from 0.98 to 0.28. This fee compression is the identified effect. The revert-rate response is not (causally) identified and is reported descriptively. At the level of a single opportunity, the winning fee splits into an approximately invariant floor and a competitive premium. The premium scales about linearly with auction duration at high contention and less steeply at low contention. A first-price auction model with uncertain arrival and partial payments by losing searchers accounts for this pattern. We match attempts to the pool they contest. A higher-fee transaction reverts behind a lower-fee winner that landed earlier in 1.9 to 2.7% of contested opportunities by value, an upper bound. Latency therefore decides part of the ordering. A micro-auction model projects diminishing returns from shortening the window below 200 ms, as bids approach a nonzero floor. Rollups such as Arbitrum One now make auction cadence a governance tunable parameter, so these estimates inform how it is set.

Explore related subjects

cs.CEcs.GTq-fin.TR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Pranay Anchuri, Edward W. Felten, Akaki Mamageishvili. 2026-10-02. Priority Gas Auction Cadence and Searcher Competition: Evidence from Flashblocks on Base. https://arxiv.org/abs/2610.03922

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

KEEP EXPLORING

Related papers

arXiv2026

Differentiable Hybrid Modelling for Learning and Optimising Chemical Transport Processes from Experimental Data

Transport models underpin the design and optimisation of chemical processes, yet their constitutive laws are typically hand-picked, their experimental initial conditions are assumed exact, and their computational cost restricts optimisation to a handful of process variables. Here we introduce a differentiable hybrid modelling framework that embeds neural networks within a GPU-accelerated population balance equation solver to discover constitutive laws and assimilate initial conditions directly from experimental crystallisation data. Using thirteen real experiments with multi-dimensional size and shape measurements, we show that treating measured initial conditions as exact yields a physically inconsistent rate law despite improved predictive accuracy, whereas assimilating them recovers a physically consistent, non-linear law and reduces trajectory error sevenfold relative to conventional modelling. End-to-end differentiability further enables gradient-based optimisation of high-dimensional operating profiles, identifying a 300-variable temperature profile that reduces crystal aspect ratio by 25% at constant mass, facilitating superior product attributes. Our framework augments, rather than replaces, mechanistic modelling, offering a general route to learning transport models from data and optimising processes with them.

cs.CE↗
arXiv2026

Inspect Any Crack: An Automated End-to-End Crack Segmentation and Severity Assessment Framework

Image-based crack analysis is essential for automated infrastructure inspection to reduce the cost, subjectivity, and safety risks of manual surveys. Despite advances in visual crack detection, methods that translate predictions into physically meaningful and engineering-interpretable crack condition information remain limited. To bridge this gap, this study proposes Inspect Any Crack (IAC), an innovative end-to-end crack recognition and condition assessment framework that automatically derives physical geometric measurements and continuous severity scores from concrete-crack imagery. At its core, IAC introduces SACv2-Tiny, an efficient crack segmentation model adapted from a vision foundation model. Trained on the challenging OmniCrack30K dataset, SACv2-Tiny achieved a $62.49\%$ F1-score and $45.45\%$ IoU on the test set and a mean zero-shot F1-score of $69.89\%$ across three unseen datasets, demonstrating robust segmentation that enables downstream analysis with limited post-processing. IAC further processes the predicted masks to quantify physical crack width and affected area using ground-sampling-distance calibration. Validation at 41 caliper-referenced locations yielded a mean relative width error of $7.33\%$. Beyond geometric quantification, IAC introduces a novel continuous crack-condition metric, the Crack Severity Index (CSI), bounded on $[0,100]$, which combines maximum crack width and affected-area ratio into a unified, standards-informed severity measure. Through these developments, IAC advances crack inspection beyond pixel-level recognition toward interpretable and automated infrastructure condition assessment.

cs.CE↗
arXiv2026

Adaptive Encoding Strategy for Quantum Annealing in Mixed-Variable Engineering Optimization

Mixed discrete-continuous optimization is central to engineering design, where discrete choices interact with continuous fields. These problems are difficult due to high-dimensional, complex search spaces. To tackle them, Quantum Annealing (QA) is promising, yet its native binary nature supports only discrete variables, making accurate and efficient encodings of continuous quantities a central challenge. Existing approaches either split the coupled problem, mapping discrete decisions to QA while solving continuous fields classically, or use fixed-bit-depth encodings. The former compromises QA's global search advantages; the latter can underrepresent dynamic range or inflate the number of binary variables. We show that simply increasing bit depth can even degrade performance on current QA hardware, underscoring the need for alternative encodings. In response, we introduce an adaptive encoding strategy for continuous variables in QA that enables efficient treatment of coupled mixed-variable problems. We propose an update strategy for the representable ranges of the continuous variables and demonstrate its utility by integrating it into the minimum complementary energy formulation for structural design optimization, which provides a single, coupled constrained problem. We apply a quadratic penalty method where we update the representation of the continuous variables while targeting the full original objective, preserving QA's global search capability. On a published benchmark, the size optimization of a composite rod, our adaptive encoding improves solution quality under a fixed binary variable budget, demonstrating a superior precision-resource trade-off. Since the framework generalizes beyond structural design, it offers practical guidance for encoding continuous variables for QA and indicates that adaptive representations can enhance precision on current hardware.

cs.CE↗