The Price of Cheaper Data: Measuring the Strategic Inefficiencies in the Post-EIP-4844 Ethereum Market

• URL: http://arxiv.org/abs/2411.03892v3
• Date: Fri, 15 Aug 2025 11:08:49 GMT
• Title: The Price of Cheaper Data: Measuring the Strategic Inefficiencies in the Post-EIP-4844 Ethereum Market
• Authors: Yue Huang, Shuzheng Wang, Liang Du, Chuxuan Zeng, Ling Deng, Yuming Huang, Gareth Tyson, Jing Tang,
• Abstract summary: We conduct the first large-scale empirical analysis of the post-EIP-4844 ecosystem, leveraging a dataset of 319.5 million transactions.<n>Our analysis demonstrates clear evidence of a structural shift towards the utilization of cheap blobs over expensive transactions.<n>On the builder side, 29.48% of blocks containing blobs are constructed sub-optimally, earning less revenue than that could be achieved otherwise.
• Score: 18.16835286278147
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: High transaction fees on Ethereum have long hindered its scalability and user adoption. The recent Ethereum EIP-4844 upgrade aims to alleviate the scalability issue by introducing the blob, a new data structure for Layer-2 rollups. Instead of using expensive blockchain storage, blobs provide a cheaper, separate data layer with its own fee market, which drastically lowers data availability costs. This change, while lowering transaction costs, has created a new high-stakes economic game for block builders and rollups. However, the dynamics of this game remain poorly understood. In this paper, we conduct the first large-scale empirical analysis of the post-EIP-4844 ecosystem, leveraging a dataset of 319.5 million transactions, including 1.3 million blob-carrying type-3 transactions. Our analysis demonstrates clear evidence of a structural shift towards the utilization of cheap blobs over expensive transactions for Layer-2 data posting: while average block size grew 2.5 times, the space consumed by expensive transactions in the public mempool shrank from over 150 KB to just 30 KB. Yet, this scalability success masks widespread economic inefficiencies on both sides of the market. On the builder side, 29.48% of blocks containing blobs are constructed sub-optimally, earning less revenue than that could be achieved otherwise. On the rollup side, we identify that flawed submission strategies have led to $186.92$ ETH in direct losses and average inclusion delays of over 19 seconds. Moving beyond characterization, our work offers actionable solutions. For builders, we develop an optimal pricing model derived from a formal first-price auction framework, allowing builders to make provably profitable inclusion decisions. For rollups, we prove that batching multiple blobs into a single transaction is a dominant, utility-maximizing strategy.

Related papers

• M$^2$: Dual-Memory Augmentation for Long-Horizon Web Agents via Trajectory Summarization and Insight Retrieval [64.06936170117943]
  M$2$ is a training-free, memory-augmented framework designed to optimize context efficiency and decision-making.<n>Our approach incorporates a dual-tier memory mechanism that synergizes Dynamic Trajectory Summarization (Internal Memory) to compress verbose interaction history into concise state updates, and Insight Retrieval Augmentation (External Memory) to guide the agent with actionable guidelines retrieved from an offline insight bank.
  arXiv  Detail & Related papers  (2026-02-28T06:59:51Z)
• Advancing Block Diffusion Language Models for Test-Time Scaling [73.54022593833638]
  We propose a unified framework for test-time scaling in BDLMs.<n>We introduce adaptivity in both decoding and block-wise generation.<n>We show that applying BACD and TCCF to TDAR-8B yields significant improvements over strong baselines.
  arXiv  Detail & Related papers  (2026-02-10T09:05:07Z)
• Unaligned Incentives: Pricing Attacks Against Blockchain Rollups [5.416444421133014]
  We identify critical mis-pricings in existing rollup transaction fee mechanisms that allow for two powerful attacks.<n>An adversary can saturate the L2's DA batch capacity with compute-light data-heavy transactions, forcing low-gas batches that enable both L2 DoS attacks, and finality-delay attacks.<n>We propose comprehensive mitigations to prevent these attacks and suggest how some practical uses of multi-dimensional rollupMs can rectify the identified mis-pricing attacks.
  arXiv  Detail & Related papers  (2025-09-21T15:39:08Z)
• Unraveling Ethereum's Mempool: The Impact of Fee Fairness, Transaction Prioritization, and Consensus Efficiency [0.0]
  This research empirically analyzes gas price variations, mempool clearance rates, and block finalization times in a proof-of-stake ecosystem.<n>We observe that high-fee transactions are consistently prioritized, while low-fee transactions face delays or exclusion despite EIP-1559's intended improvements.
  arXiv  Detail & Related papers  (2025-06-09T17:55:25Z)
• First-Spammed, First-Served: MEV Extraction on Fast-Finality Blockchains [0.0]
  This research analyzes the economics of spam-based arbitrage strategies on fast-finality blockchains.<n>We show that splitting a profitable MEV opportunity into multiple small transactions is the optimal strategy for CEX-DEX arbitrageurs.<n>We find that reverted transactions cluster at the very top of blocks on fast rollups like Arbitrum and ZKsync, indicating an intense latency race and revealing the fragility of fee-based ordering.
  arXiv  Detail & Related papers  (2025-06-02T09:18:53Z)
• On the Scaling of Robustness and Effectiveness in Dense Retrieval [111.58315434849047]
  Robustness and effectiveness are critical aspects of developing dense retrieval models for real-world applications.<n>Recent work has addressed scaling laws of effectiveness in dense retrieval, revealing a power-law relationship between effectiveness and the size of models and data.<n>We find that robustness and effectiveness exhibit different scaling patterns, leading to significant resource costs when jointly improving both.
  arXiv  Detail & Related papers  (2025-05-30T06:57:27Z)
• Demystifying Private Transactions and Their Impact in PoW and PoS Ethereum [43.548299433042835]
  Private transactions, a specialized transaction type employed to evade public Peer-to-Peer (P2P) network broadcasting, remain largely unexplored.<n>We analyze large-scale datasets comprising 14,810,392 private transactions within a 15.5-month Proof-of-Work (PoW) dataset and 30,062,232 private transactions within a 15.5-month Proof-of-Stake (PoS) dataset.
  arXiv  Detail & Related papers  (2025-03-30T16:45:18Z)
• The Early Days of the Ethereum Blob Fee Market and Lessons Learnt [4.181969992118843]
  EIP-4844 introduced blob transactions designed to meet the data availability needs of layer 2 protocols. This work constitutes the first rigorous and comprehensive empirical analysis of transaction- and mempool-level data since March 13, 2024.
  arXiv  Detail & Related papers  (2025-02-18T15:47:49Z)
• TLOB: A Novel Transformer Model with Dual Attention for Price Trend Prediction with Limit Order Book Data [10.684577067675585]
  Price Trend Prediction (PTP) based on Limit Order Book (LOB) data is a fundamental challenge in financial markets.<n>We propose TLOB, a transformer-based model that uses a dual attention mechanism to capture spatial and temporal dependencies in LOB data.<n>We empirically show how stock price predictability has declined over time, -6.68 in F1-score, highlighting the growing market efficiency.
  arXiv  Detail & Related papers  (2025-02-12T12:41:10Z)
• Self-Refinement Strategies for LLM-based Product Attribute Value Extraction [51.45146101802871]
  This paper investigates applying two self-refinement techniques to the product attribute value extraction task. The experiments show that both self-refinement techniques fail to significantly improve the extraction performance while substantially increasing processing costs. For scenarios with development data, fine-tuning yields the highest performance, while the ramp-up costs of fine-tuning are balanced out as the amount of product descriptions increases.
  arXiv  Detail & Related papers  (2025-01-02T12:55:27Z)
• 180 Days After EIP-4844: Will Blob Sharing Solve Dilemma for Small Rollups? [2.88268082568407]
  This paper examines the effectiveness of blob sharing based on real-world data collected six months after the implementation of EIP-4844. By simulating cost changes using a simple blob sharing format, we demonstrate that blob sharing can substantially improve the costs and DA service quality for small rollups.
  arXiv  Detail & Related papers  (2024-10-05T10:24:52Z)
• Cost-Effective Big Data Orchestration Using Dagster: A Multi-Platform Approach [0.10241134756773229]
  This paper introduces a cost-effective and flexible orchestration framework using Dagster. We demonstrate how Dagster's orchestration capabilities can enhance data processing efficiency, enforce best coding practices, and significantly reduce operational costs.
  arXiv  Detail & Related papers  (2024-08-21T14:05:35Z)
• Impact of EIP-4844 on Ethereum: Consensus Security, Ethereum Usage, Rollup Transaction Dynamics, and Blob Gas Fee Markets [2.9630910534509933]
  EIP-4844 was implemented on March 13, 2024, designed to enhance its role as a data availability layer. We conduct an empirical analysis of the impact of EIP-4844 on consensus security, usage, rollup transaction dynamics, and the blob gas fee mechanism.
  arXiv  Detail & Related papers  (2024-05-06T06:18:53Z)
• Rolling in the Shadows: Analyzing the Extraction of MEV Across Layer-2 Rollups [13.27494645366702]
  Decentralized finance embraces a series of exploitative economic practices known as Maximal Extractable Value (MEV) In this paper, we investigate the prevalence and impact of MEV on prominent rollups such as Arbitrum, and zkSync over a nearly three-year period. While our findings did not detect any sandwiching activity on popular rollups, we did identify the potential for cross-layer sandwich attacks.
  arXiv  Detail & Related papers  (2024-04-30T18:34:32Z)
• Efficient Modulation for Vision Networks [122.1051910402034]
  We propose efficient modulation, a novel design for efficient vision networks. We demonstrate that the modulation mechanism is particularly well suited for efficient networks. Our network can accomplish better trade-offs between accuracy and efficiency.
  arXiv  Detail & Related papers  (2024-03-29T03:48:35Z)
• Graph Attention Network-based Block Propagation with Optimal AoI and Reputation in Web 3.0 [59.94605620983965]
  We design a Graph Attention Network (GAT)-based reliable block propagation optimization framework for blockchain-enabled Web 3.0. To achieve the reliability of block propagation, we introduce a reputation mechanism based on the subjective logic model. Considering that the GAT possesses the excellent ability to process graph-structured data, we utilize the GAT with reinforcement learning to obtain the optimal block propagation trajectory.
  arXiv  Detail & Related papers  (2024-03-20T01:58:38Z)
• Exploiting Activation Sparsity with Dense to Dynamic-k Mixture-of-Experts Conversion [4.716845031095804]
  Transformer models can face practical limitations due to their high computational requirements. Such models exhibit significant activation sparsity, which can be leveraged to reduce the inference cost by converting parts of the network into equivalent Mixture-of-Experts (MoE) layers. We demonstrate that the efficiency of the conversion can be significantly enhanced by a proper regularization of the activation sparsity of the base model.
  arXiv  Detail & Related papers  (2023-10-06T16:34:51Z)
• Towards General and Efficient Online Tuning for Spark [55.30868031221838]
  We present a general and efficient Spark tuning framework that can deal with the three issues simultaneously. We have implemented this framework as an independent cloud service, and applied it to the data platform in Tencent.
  arXiv  Detail & Related papers  (2023-09-05T02:16:45Z)
• E2EAI: End-to-End Deep Learning Framework for Active Investing [123.52358449455231]
  We propose an E2E that covers almost the entire process of factor investing through factor selection, factor combination, stock selection, and portfolio construction. Experiments on real stock market data demonstrate the effectiveness of our end-to-end deep leaning framework in active investing.
  arXiv  Detail & Related papers  (2023-05-25T10:27:07Z)
• Blockchain Large Language Models [65.7726590159576]
  This paper presents a dynamic, real-time approach to detecting anomalous blockchain transactions. The proposed tool, BlockGPT, generates tracing representations of blockchain activity and trains from scratch a large language model to act as a real-time Intrusion Detection System.
  arXiv  Detail & Related papers  (2023-04-25T11:56:18Z)
• A Game of NFTs: Characterizing NFT Wash Trading in the Ethereum Blockchain [53.8917088220974]
  The Non-Fungible Token (NFT) market experienced explosive growth in 2021, with a monthly trade volume reaching $6 billion in January 2022. Concerns have emerged about possible wash trading, a form of market manipulation in which one party repeatedly trades an NFT to inflate its volume artificially. We find that wash trading affects 5.66% of all NFT collections, with a total artificial volume of $3,406,110,774.
  arXiv  Detail & Related papers  (2022-12-02T15:03:35Z)
• Advancing Model Pruning via Bi-level Optimization [89.88761425199598]
  iterative magnitude pruning (IMP) is the predominant pruning method to successfully find 'winning tickets' One-shot pruning methods have been developed, but these schemes are usually unable to find winning tickets as good as IMP. We show that the proposed bi-level optimization-oriented pruning method (termed BiP) is a special class of BLO problems with a bi-linear problem structure.
  arXiv  Detail & Related papers  (2022-10-08T19:19:29Z)
• Building an Efficiency Pipeline: Commutativity and Cumulativeness of Efficiency Operators for Transformers [68.55472265775514]
  We consider an efficiency method as an operator applied on a model. In this paper, we study the plausibility of this idea, and the commutativity and cumulativeness of efficiency operators.
  arXiv  Detail & Related papers  (2022-07-31T18:01:06Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.