Blockspace Under Pressure: An Analysis of Spam MEV on High-Throughput Blockchains
summary
The gist
On high-throughput, low-fee blockchains, a qualitatively new form of maximal extractable value (MEV) has emerged…
In short
The paper models spam MEV on high-throughput blockchains, where searchers submit speculative transactions whose profitability is resolved at execution time. It develops a framework to predict equilibrium spam volumes based on block capacity, minimum gas prices, and fee mechanisms. Findings show that spam is costly but can plateau under scaling, suggesting mitigation through dynamic resource allocation and priority fee ordering.
Key concepts
- Spam MEV on Page 1
- This refers to a new form of maximal extractable value where searchers submit many speculative transactions whose success depends entirely on execution time within the first block. They probe for opportunities; if found, they execute and capture value immediately, consuming block space even if no trade occurs.
- Block Space Limit (Bmax)
- This is a design lever representing the maximum amount of transaction data or operations allowed in a single block. The model analyzes how increasing or decreasing this limit affects the competition between legitimate users and spam transactions seeking on-chain opportunities.
- Minimum Gas Price (gmin)
- This is the minimum fee required for a transaction to be included in a block. The paper investigates how raising this floor impacts spam behavior, showing that higher prices can reduce spam volume by making it more expensive for spammers to secure early positions.
- Competitive Equilibrium
- This is the state where the profits of all competing entities—users and spammers—are driven to zero. The framework analyzes how different design choices (like Bmax and gmin) determine this stable point, showing how spam volume settles under these conditions.
Terminology used across episodes
This episode discusses
- Blockspace Under Pressure: An Analysis of Spam MEV on High-Throughput Blockchains · Paper Radio
- Auctioning Time to Mitigate Latency Races: Theory and Evidence from Blockchains
- Cross-Rollup MEV: Non-Atomic Arbitrage Across L2 Blockchains
- When Priority Fails: Revert-Based MEV on Fast-Finality Rollups
- Timing Games: Probabilistic backrunning and spam
- Unity is Strength: A Formalization of Cross-Domain Maximal Extractable Value
- Crossing walls and windows: the curious escape of Lyman- alpha photons through ionised channels
- Cross-Chain Arbitrage: The Next Frontier of MEV in Decentralized Finance
- Extracting Godl [sic] from the Salt Mines: Ethereum Miners Extracting Value
- Rolling in the Shadows: Analyzing the Extraction of MEV Across Layer-2 Rollups
- Time to Bribe: Measuring Block Construction Market
- To Wait or To Probe: Arbitrage Competition on High-Throughput Blockchains
- A2MM: Mitigating Frontrunning, Transaction Reordering and Consensus Instability in Decentralized Exchanges
- Quantifying the Value of Revert Protection
The paper
Blockspace Under Pressure: An Analysis of Spam MEV on High-Throughput Blockchains · Read on arXiv
WENHAO WANG, ADITYA SARAF, LIOBA HEIMBACH, KUSHAL BABEL, FAN ZHANG
Yale University · Cornell University
On high-throughput, low-fee blockchains, a qualitatively new form of maximal extractable value (MEV), spam MEV, has emerged: searchers submit large volumes of speculative transactions, whose profitability is resolved only at execution time. On major rollups, it can consume more than half of block gas, even though only a small fraction of probes ultimately results in a trade. Despite growing awareness of this phenomenon, there is no principled framework for understanding how blockchain design parameters shape its prevalence and impact. We develop such a framework, modeling spam transactions competing for on-chain opportunities under a competitive equilibrium that drives their profits to zero, and deriving equilibrium spam volumes as a function of block capacity, minimum gas price, and the transaction fee mechanism. Empirical evidence from Base and Arbitrum is consistent with several predictions of the model: spam grew sharply as block capacity was scaled up and fell when minimum gas prices were introduced. Our analysis yields three main insights. First, spam is always costly: when block capacity is scarce, it displaces users and drives up gas prices; as block capacity grows, it increasingly consumes execution resources, raising network externality, i.e., the cost of provisioning and processing blocks. We show that spam takes an increasing share of each additional unit of block capacity, so capping it before all users are included creates a favorable trade-off: forgoing a small amount of user welfare eliminates disproportionate spam and externality. Second, we extend the analysis to approximate priority fee ordering and show that it can reduce spam by making earlier block positions more expensive, as spammers pay more to reach early block positions. Third, as user demand grows and blockspace is scaled accordingly, spam's share of block capacity plateaus rather than growing indefinitely.
Transcript
Introduction to the show: ident: Computer Science. The day in computer science: software, systems and theory on arXiv.
Tom: I'm Tom.
Jane: And I'm Jane, here with Lu, Meng and our in-house large language model, Lalam.
Tom: We're looking at the paper: "Blockspace Under Pressure".
Jane: Here's the gist of the paper. On high-throughput, low-fee blockchains, a qualitatively new form of maximal extractable value (MEV) has emerged: searchers submit large volumes of speculative transactions whose profitability is resolved only at execution time on Page 1.
Tom: This paper develops a framework to model spam transactions competing for on-chain opportunities under competitive equilibrium and derives equilibrium spam volumes as a function of block capacity, minimum gas price, and the transaction fee mechanism on Page 1.
Jane: The Emergence of Spam MEV A qualitatively different form of MEV has recently emerged on high-throughput blockchains, where searchers submit high volumes of speculative transactions whose profitability is resolved only at execution time, which they refer to as spam MEV on Page 1.
Tom: In spam transactions, both the detection and execution of opportunities reside largely in onchain smart-contract logic, where a transaction probes whether a profitable opportunity exists at the moment of execution and captures it, while when no opportunity is found it may revert or simply consume gas on Page 2.
Title and authors: Tom: So, Jane, this paper, "Blockspace Under Pressure: An Analysis of Spam MEV on High-Throughput Blockchains," it really zeroes in on how searchers submit these huge volumes of speculative transactions that only make money at execution time.
Jane: Right, and the authors are looking at this phenomenon under a competitive equilibrium, trying to figure out exactly what drives the volume of this spam when you look at block capacity and gas prices.
Tom: Exactly, it sets up a model where they analyze how equilibrium spam volumes depend on things like the block space limit Bmax, the minimum gas price gmin, and that transaction fee mechanism on Page five.
Lu: The framework decomposes occupied block space into B equals Qu plus sS, and they determine the clearing price using a demand function D of g equals D0 minus beta g on Page six.
Meng: So, when you look at this model, what's the immediate takeaway for us on the production side? Does this suggest we need to focus more on how those parameters interact?
Jane: Well, one big finding is that spam is always costly because when block capacity is scarce, it actually drives up gas prices on Page one <ref:2604.00234#pg1>.
Tom: That’s interesting because it suggests a direct negative feedback loop between scarcity and spam profitability.
Lu: They also looked at approximating priority fee ordering or PFO, and that actually reduces the spam volume because spammers pay more to get into early block positions on Page seventeen.
Meng: So, if we look at deploying a system, does this mean prioritizing those early slots with higher fees is a viable mitigation strategy?
Jane: It seems so, but there's another point they make about scaling: as user demand grows and block space scales up with it, the share of spam in the total block capacity doesn't just vanish; it plateaus.
Tom: That means we can't just assume that if we give users more space to grow, the spam problem disappears entirely.
Lu: They characterize choosing Bmax given a fixed gas price floor gmin using two different rules on Page eleven which is a concrete design lever for us to consider.
Meng: From my point of view, I'm curious about how this scaling rule plays out when we think about real traffic versus speculative probes that never execute.
Jane: The empirical validation from Base and Arbitrum supports the model, showing that spam grew sharply when block capacity was scaled up but then fell once minimum gas prices were introduced on Page one <ref:2604.00234#pg1,from Base and Arbitrum supports the model>.
Tom: And they showed that spam falls when gas price floors rise, it grows with block capacity, and on Base appears later in the block as predicted by the PFO analysis on Page seventeen.
Lu: The model suggests that even when aggregate opportunity value scales linearly with demand, spam's share of included gas approaches a sizable positive level rather than vanishing as demand grows under both the plateau rule and the refined MMUS rule on Page fifteen.
Meng: That’s a bit concerning if it means we have to constantly fight that persistent level of spam regardless of how much user demand we add.
Jane: The paper suggests that for future work, we should focus on concrete system-level mitigation mechanisms, specifically making spam less attractive to send and failed probes cheaper to process on Page nineteen.
Tom: So the direction is clearly toward incentive-based mechanisms like minimum gas prices and charging for reserved execution gas, or maybe cheap-path filtering when execution isn't the bottleneck on Page nineteen.
Lu: They also mentioned that they should look at making failed probes cheaper to process on Page nineteen which would be a direct response to the cost of consuming gas without a trade.
Meng: If we can get those failed probes cheap, that cuts directly into the resource consumption part of this spam MEV dynamic.
Jane: So, before we wrap up this discussion on "Blockspace Under Pressure: An Analysis of Spam MEV on High-Throughput Blockchains," Tom and I want to summarize what this means for us in practice.
Tom: It means that the prevalence of spam isn't just a theoretical thing; it’s tied to how we set those block space limits and gas price floors, and those settings have tangible effects on user welfare.
Jane: And the main lesson is that simply adding more capacity doesn't automatically solve the spam problem; you need mechanisms to manage that persistent share of block space.
Lu: I think the core idea is moving from just observing it to designing rules for Bmax and gmin based on these equilibrium dynamics.
Meng: From a deployment standpoint, it suggests we need monitoring modules that track those counterfactual gaps between worlds with and without spam to guide our decisions on those parameters.
Tom: Exactly, so we're looking at using the math from this paper to inform how we design the actual system-level mitigation tools.
Jane: We’ll be ready for more papers soon, so stick around for what’s next.
The paper's summary: Tom: So, this paper basically says that on high throughput blockchains, we have this new thing called spam MEV which is all about searchers submitting tons of speculative trades that only get paid when they execute them right then and there on Page one.
Jane: That sounds really intense because it means the profitability isn't known until execution time and it happens mostly within the smart contract logic, not on Page two at least.
Lu: The authors model this under a competitive equilibrium, looking at how the volume of this spam depends on things like block space limit Bmax and minimum gas price gmin.
Meng: So they’re trying to figure out what drives that spam volume when you look at the physical constraints of the blockchain, like how much room there is in a block?
Tom: Yeah, they break down occupied block space into B equals Qu plus sS and use a demand function D of g equals D0 minus beta g on Page six to figure out the clearing price.
Jane: And what's really interesting is their findings regarding those design choices on Page one. They found that spam is always costly because if block capacity is tight, it pushes users out and raises gas prices on Page one.
Lu: Then they looked at approximate priority fee ordering or PFO and showed that this reduces spam because spammers have to pay more to get into early positions on Page seventeen.
Meng: So the idea is that if we use PFO, the cost for a spammer to get an early slot goes up, which should naturally reduce how much spam they submit.
Tom: Right, but then there's this part about scaling user demand and block space. They found that as user demand grows and block space scales up with it, the share of spam in the total block capacity doesn't just disappear; it levels off.
Jane: That’s a big shift because you can’t just assume that more space means less spam if the underlying dynamics are like this.
Lu: They characterize choosing Bmax based on a fixed gas price floor gmin using two different rules on Page eleven which gives us concrete levers for design decisions.
Meng: So they give us specific rules to follow when we decide how much block space to allocate versus how high we set the minimum gas price.
Tom: And empirically, they showed that spam grows when capacity scales up but then falls once you introduce minimum gas prices, and it appears later in the block on Base as predicted by the PFO analysis on Page seventeen.
Jane: So for someone just listening to this, it’s about realizing that scaling things up doesn't automatically solve problems; you need specific mechanisms to manage how much of that extra capacity gets taken over by spam.
Lu: They also look at scaling strategy based on aggregate opportunity value growth and user demand, showing that even with linear aggregate opportunity scaling, spam's share of included gas approaches a positive level rather than vanishing.
Meng: That means we can’t rely on demand alone to clean up the block space; we still have to actively manage it.
Tom: So the paper ends by suggesting future work should focus on concrete system-level mitigation tools, like making spam less attractive and failed probes cheaper to process on Page nineteen.
Jane: That points toward building actual software solutions rather than just theoretical modeling of the equilibrium volumes.
Lu: I think that’s where it gets interesting, moving from the mathematical model to the actual design of these mitigation tools is where we need to go next.
The paper's improvements: Tom: So, this paper isn't just looking at how spam behaves under current conditions; they’re proposing actual ways to fix it, like introducing minimum gas prices and charging for reserved execution gas on Page nineteen.
Jane: That means they aren't just describing the problem; they’re suggesting concrete tools that could actually work in a production system.
Lu: They focus on incentive-based mechanisms like minimum gas prices and also cheap-path mechanisms such as filtering when execution isn't the bottleneck on Page nineteen.
Meng: From an engineer’s point of view, those are practical things—minimum gas prices are something you can set in your protocol code, and filtering is a way to reduce the load before it gets to the execution layer.
Tom: Yeah, minimum gas prices provide that floor for profit when block space is tight, which directly counters the cost advantage spammers have when capacity is scarce.
Jane: And they also discuss cheap-path mechanisms specifically when execution isn't the main bottleneck, which sounds like a way to make failed probes less expensive to process.
Lu: The idea is that by making those failed probes cheaper, you reduce the incentive for searchers to submit high volumes of transactions that don't lead to a trade on Page two.
Tom: So they’re suggesting a two-pronged approach: setting price floors and improving how failed execution attempts are handled at the protocol level.
Jane: It changes things for us by showing that mitigation isn't just about blocking spam; it’s about changing the cost structure so that legitimate users have a better chance of success.
Meng: I need to know how much computational overhead those filtering mechanisms add, because if they slow down the entire block processing, we’ve just traded one kind of problem for another.
Lu: The paper does touch on this, but the focus is on making failed probes cheaper first, which is a targeted optimization rather than a massive system overhaul.
Tom: The authors also explore incentive mechanisms like minimum gas prices and charging for reserved execution gas to directly counteract the cost advantage spammers get from Page one positioning.
Jane: So they are showing how you can use economic incentives to push the equilibrium away from high spam volumes toward a more stable state.
Meng: If we look at monitoring, they suggest a validator revenue and externality monitoring module that tracks counterfactual gaps between worlds with and without spam for different design parameters.
Tom: That’s really useful because it gives you real-time guidance on which combination of block space limit Bmax and gas price floor gmin maximizes user welfare while minimizing that extra execution burden created by spam.
Lu: It moves the conversation from just modeling the equilibrium to actively tuning the system settings based on real-world feedback.
Jane: So, we’re moving toward a system where the design of our block parameters is guided by monitoring these trade-offs between user welfare and that execution burden from spam.
Conclusion: Tom: So, to wrap up this talk on "Blockspace Under Pressure: An Analysis of Spam MEV on High-Throughput Blockchains," we’ve seen how spam volume depends heavily on those design choices like block space limit Bmax and minimum gas price gmin.
Jane: Basically, the paper shows that spam isn't just a random occurrence; it's governed by these specific economic and structural rules within the system.
Lu: The main implication is that we need to look at how we set those parameters because they directly determine if spam gets crushed or grows under increased user demand.
Meng: I still wonder how much compute this kind of modeling requires to run on real traffic instead of just the theoretical equilibrium volumes they calculate.
Lalam: From my perspective, the findings are quite certain; the model strongly suggests that incentive mechanisms like minimum gas prices actually have a measurable effect on reducing spam volume under competitive conditions.
Tom: Yeah, it changes how we think about mitigation; it’s not just about throttling transactions but tuning the economic incentives to make spam unprofitable.
Jane: It shifts the focus toward designing system rules that actively manage the trade-off between maximizing user participation and controlling that persistent share of block space taken by spam.
Lu: The authors flagged that their analysis is based on specific assumptions about demand scaling, which is a limitation you have to keep in mind when applying these results elsewhere.
Meng: So it’s useful for designing the incentive layer, but we still need to test those theoretical rules against actual production traffic at scale.
Tom: Exactly; the next step is taking these equilibrium calculations and turning them into concrete, deployable system-level mitigation strategies that actually run on a live blockchain.
Jane: We’ll be looking at how these economic levers interact with those technical ones in our next discussion, because understanding the mechanics of spam is just the first step toward building a more robust environment.
More episodes
- 2411.16152-Optimizing Winograd Convolution on ARMv8 processors
- 2505.16254-Human-AI Writing as Distributed Cognition: Reassessing Collaborative Writing Theories in the Age of LLMs
- 2506.10913-Choreographic Quick Changes: First-Class Location (Set) Polymorphism
- 2507.14812-A Black-Box Approach for Exogenous Replenishment in Online Resource Allocation
- 2507.15448-Frames over finite fields with respect to the Galois inner product and their connections to self-orthogonal and LCD codes
- 2508.21572-NewsReX: An Open-Source Multi-Framework for Neural News Recommendation
- 2509.17028-Impact of Packetization on Network Calculus Analysis
- 2510.17342-AoA Services in 5G Networks: A Framework for Real-World Implementation and Systematic Testing
- 2511.04088-Efficient and rate-optimal list-decoding in the presence of minimal feedback
- 2511.17264-Notes on Stack Machines and Quantum Stack Machines