AI summary · arXiv: 2611.13616v1 · q-fin.TR
Optimal Trading Speed on Blockchain
The essentials
The paper shows that faster blockchain execution shifts arbitrage rents toward arbitrageurs and can let active liquidity providers avoid toxic trades, while reducing pool depth beyond an intermediate speed.
Question
How does block speed affect competition for transaction priority, liquidity provision, and the depth and quality of blockchain-based markets? The paper asks whether faster execution improves liquidity or instead redistributes rents and weakens passive liquidity supply.
Method
The authors develop an equilibrium model with two arbitrageurs, passive liquidity providers, one active provider, liquidity traders, and a sequencer; block arrivals follow a Poisson process with rate B, and transaction latency has rate λ. They test its predictions using a difference-in-differences design around Base’s July 2025 Flashblocks upgrade, which shortened the effective interval from two seconds to 200 milliseconds, comparing the Uniswap v3 WETH–USDC 5 bp pool on Base with Arbitrum using on-chain data and Binance order-book snapshots from May to September 2025.
Findings
-
Result
In the model, faster blocks reduce the sequencer’s share of arbitrage rents and increase the share retained by arbitrageurs.
See the passage in the paper
The sequencer’s share of the arbitrage prize and the arbitrageurs’ combined share are $$s(B)=\frac{\lambda}{B+\lambda},\qquad 1-s(B)=\frac{B}{B+\lambda}.$$
-
Result
After Flashblocks, the difference-in-differences estimate shows a 3.26-basis-point fall in blockchain fees and a 2.73-basis-point rise in net arbitrage markout.
See the passage in the paper
The raw markout falls by $0.53$ bps but is not statistically significant; the blockchain fee falls by far more, $3.26$ bps; and the net markout therefore rises by $2.73$ bps.
-
Result
The active Base liquidity provider rebalanced faster, reduced exposure to toxic flow relative to the pool, and improved her per-dollar net payoff.
See the passage in the paper
Her per-dollar net payoff rises by $0.73$ bps on Base relative to Arbitrum, shifting from approximately break-even ($0.26$ bps) to clearly positive ($1.28$ bps).
-
Result
The model predicts that pool depth peaks at a unique intermediate block rate and declines at sufficiently high speeds.
See the passage in the paper
Depth has a unique global maximum at an intermediate block rate $B_{d}<B_{2}$.
-
Result
In the Base comparison, faster blocks coincided with closer price tracking but lower depth, wider effective spreads, and lower volume.
See the passage in the paper
The time-weighted average deviation falls by $0.11$ bps on Base relative to Arbitrum.
Limitations
- The empirical design studies one pool and one upgrade, and the authors do not establish the liquidity-maximizing block rate or a welfare effect.
See the passage in the paper
The evidence does not locate the liquidity-maximizing block rate, and we draw no welfare conclusion.
- The difference-in-differences interpretation depends on a counterfactual parallel-trends assumption that the diagnostic plots cannot establish.
See the passage in the paper
These plots describe the observed time patterns; they do not establish the counterfactual parallel-trends assumption.
- The active-provider evidence is based on a small cohort: one Base address and four Arbitrum addresses.
See the passage in the paper
These filters leave one Base address and four Arbitrum addresses.
Why it matters
The authors argue that blockchain execution speed is not neutral: it affects both the allocation of ordering rents and the incentives of active and passive liquidity providers. For market design, faster blocks can improve price discovery while leaving a thinner pool, a trade-off they say matters for AMM markets, including tokenized securities.
Written by AI from the paper. Passages are checked word for word against the text we analysed; the rest may contain errors.
Ask questions about this paper to our AI assistant
How to chat with this paper? Illustrated guide
You can also chat with multiple papers at once here.
Keep this conversation — a free account saves your questions and answers, your collections of papers and your alerts.
Continue with Google Create a free accountTools for this paper
Advanced tools Premium
For researchers who follow a field closely: citation alerts, journal-club slides, version comparison and Zotero export. Discover Premium
Papers around this one
See them on a mapRanked by how close their title and abstract are to this paper’s. Select some to read them together.
Closest papers
-
The Importance of Low Latency to Order Book Imbalance Trading StrategiesDavid Byrd, Sruthi Palaparthi, Maria Hybinette et al. · 2020 · Trading and Market Microstructure · preprint, not peer reviewed · cited 4 times · AI summary available
The study measures how access latency affects order-book imbalance strategy profits in a continuous double auction, rather than blockchain priority competition and liquidity.
Abstract
There is a pervasive assumption that low latency access to an exchange is a key factor in the profitability of many high-frequency trading strategies. This belief is evidenced by the "arms race" undertaken by certain financial firms to co-locate with exchange servers. To the best of our knowledge, our study is the first to validate and quantify this assumption in a continuous double auction market with a single exchange similar to the New York Stock Exchange. It is not feasible to conduct this exploration with historical data in which trader identity and location are not reported. Accordingly, we investigate the relationship between latency of access to order book information and profitabili…
-
Buying Time: Latency Racing vs. Bidding in Fair Transaction OrderingAkaki Mamageishvili, Mahimna Kelkar, Jan Christoph Schlegel et al. · 2023 · Computer Science and Game Theory · cited 23 times · AI summary available
Buying Time proposes timestamp-and-bid transaction ordering to limit latency racing, while this paper models how block speed changes priority competition and liquidity.
Abstract
We design a practical algorithm for transaction ordering that takes into account both transaction timestamps and bids. The algorithm guarantees that users get their transactions published with bounded delay against a bid, while it extracts a fair value from sophisticated users that have an edge in latency, by moving expenditure from investment in latency improvement technology to bidding. The algorithm creates a score from timestamps and bids, and orders transactions based on the score. We first show that a scoring rule is the only type of rule that satisfies the independence of latency races. We provide an economic analysis of the protocol in an environment of private information, where inv…
-
Temporal Liquidity Crossing for Blockchains: An EIP-1559 Extension for Admission Below the Base FeeDuan-Yang-Dan Guo · 2026 · Not summarized yet
Temporal liquidity markets allocate early execution to transactions that fund later execution, addressing transaction timing and ordering rather than block-speed effects on market liquidity.
Abstract
Transactions differ in how their value changes with execution time and relative position. Ethereum's EIP-1559 lets them compete through fee fields, but a fee bid gives no enforceable claim to an earlier position in the block, and no way to express willingness to accept a later one. Its base fee is a hard admission floor. We introduce temporal liquidity markets (TLM), a framework for crossing complementary temporal requirements: transactions seeking early-region execution (consumers) can fund transactions that opt into exclusion from that region (providers). Selected consumers complete within the early region and are ordered among themselves by authorization density, both validator-checked. I…
-
Capital Costs Protect the Network: Mining Gap Dynamics in Proof-of-Work Blockchains Under a Stochastic MempoolHasan Selçuk Kılıç, Nail Akar · 2026 · Not summarized yet
The paper models fee-driven miner idle periods under stochastic transaction arrivals, whereas this paper studies block speed, arbitrage competition, and liquidity provision.
Abstract
Proof-of-Work blockchains increasingly rely on transaction fees to keep miners engaged as block subsidies decline. An immediate outcome of this is that miners may sit idle at the start of a round until enough high-fee transactions accumulate in order to make mining worthwhile. This idle period is known as the mining gap. We model the high-fee transaction backlog as a Lindley-type recursion under a two-tier fee market and use its stationary distribution to characterize the mining gap. Under Bitcoin's difficulty-adjustment mechanism, the expected gap grows strictly with the hashpower active on the network and consumes the entire round as that hashpower grows without bound. A free-entry conditi…
-
Global decentralized stock exchange: an innovative permissioned-blockchain framework for integrated capital marketsAbdullah M. Al-Awadhi, Humoud Alsabah, Saad Alnahedh et al. · 2026 · Journal of Financial Regulation and Compliance · Not summarized yet
The framework examines liquidity and market design for a permissioned blockchain stock exchange, rather than how block speed affects liquidity in a decentralized exchange.
Abstract
This paper aims to propose a regulatory-aware conceptual and theoretical framework for a global decentralized stock exchange built on a permissioned blockchain infrastructure. It examines how integrating trading, clearing, custody and supervisory functions within a unified distributed ledger can enhance efficiency, liquidity and compliance across jurisdictions. The study develops a dual technical–regulatory framework supported by a reduced-form theoretical model grounded in market microstructure and governance theory. It evaluates consensus mechanisms, interoperability, privacy and scalability alongside consortium governance, cross-border oversight, legal recognition of tokenized securities …
-
On the (In)stability of Adaptive Fee Mechanisms in Multi-Chain SystemsYi-Fan Zhou, Jiang Xiao, Xue-Chao Wang et al. · 2026 · Not summarized yet
The study analyzes stability of adaptive fees across interconnected chains, while this paper examines how block speed changes priority fees and market liquidity.
Abstract
EIP-1559 has become the dominant transaction fee mechanism in permissionless blockchains, regulating scarce block space through an adaptive base fee. The design balances a trade-off between responsiveness to demand fluctuations and stability of long-term resource usage. On a single chain, this trade-off is well understood and empirically stable. In multi-chain systems, however, cross-chain flows introduce delayed economic interactions across otherwise independent fee markets. These interactions alter the control dynamics and create stability risks that existing models do not capture. Deployed systems have already polarized. Polkadot enforces conservative update rates, effectively disabling f…
-
PROF: Protected Order Flow in a Profit-Seeking WorldKushal Babel, Nerla Jean-Louis, Yan Ji et al. · 2024 · Cryptography and Security · cited 15 times · AI summary available
PROF designs protected transaction ordering to limit harmful MEV in proposer-builder separation, while this paper studies how faster blocks redistribute arbitrage rents and affect liquidity.
Abstract
Users of decentralized finance (DeFi) applications face significant risks from adversarial actions that manipulate the order of transactions to extract value from users. Such actions -- an adversarial form of what is called maximal-extractable value (MEV) -- impact both individual outcomes and the stability of the DeFi ecosystem. MEV exploitation, moreover, is being institutionalized through an architectural paradigm known Proposer-Builder Separation (PBS). This work introduces a system called PROF (PRotected Order Flow) that is designed to limit harmful forms of MEV in existing PBS systems. PROF aims at this goal using two ideas. First, PROF imposes an ordering on a set ("bundle") of privat…
-
Tracking High-Frequency Trading Activity in China and Its Effects on Market QualityLi Guo, Frank Weikai Li, Ding Qi et al. · 2026 · Trading and Market Microstructure · AI summary available
The study uses order-level data to link high-frequency trading activity with market quality, whereas this paper tests how faster blockchain execution changes pool depth and spreads.
In short
Exact-match limit orders identify latency-sensitive trading in Shenzhen; faster information delivery increases their prevalence, short-run price variation and adverse selection, while modestly reducing pricing error.
Go further
How are these papers found?
We compare the title and abstract of this paper with those of every paper summarized on this site, and with the papers Semantic Scholar recommends, those it cites and those citing it (for a much-cited paper, its most recent citations and, from OpenAlex, the most cited ones). Among the prior work and the follow-ups, the papers that use each other in depth, a method it uses and the much-cited follow-ups come a little higher. The levels (very close, close, related) come from the similarity of the texts, not from a judgment of quality; * marks a paper without an abstract, compared by its title. The sentence under a paper is written by an AI from the two abstracts: check it in the papers. A paper marked not relevant by three readers leaves the list.
Updated on 16 November 2026.
Disclaimer: The AI-based summarization tool and virtual assistant provided on this website may not always provide accurate and complete summaries or responses. We encourage you to carefully review and evaluate the generated content to ensure its quality and relevance to your needs.