The Early Days of the Ethereum Blob Fee Market and Lessons Learnt

• URL: http://arxiv.org/abs/2502.12966v1
• Date: Tue, 18 Feb 2025 15:47:49 GMT
• Title: The Early Days of the Ethereum Blob Fee Market and Lessons Learnt
• Authors: Lioba Heimbach, Jason Milionis,
• Abstract summary: EIP-4844 introduced blob transactions designed to meet the data availability needs of layer 2 protocols.<n>This work constitutes the first rigorous and comprehensive empirical analysis of transaction- and mempool-level data since March 13, 2024.
• Score: 4.181969992118843
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Ethereum has adopted a rollup-centric roadmap to scale by making rollups (layer 2 scaling solutions) the primary method for handling transactions. The first significant step towards this goal was EIP-4844, which introduced blob transactions that are 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 the institution of blobs on Ethereum on March 13, 2024. We perform a longitudinal study of the early days of the blob fee market analyzing the landscape and the behaviors of its participants. We identify and measure the inefficiencies arising out of suboptimal block packing, showing that at times it has resulted in up to 70% relative fee loss. We hone in and give further insight into two (congested) peak demand periods for blobs. Finally, we document a market design issue relating to subset bidding due to the inflexibility of the transaction structure on packing data as blobs and suggest possible ways to fix it. The latter market structure issue also applies more generally for any discrete objects included within transactions.

Related papers

• Prior2Former -- Evidential Modeling of Mask Transformers for Assumption-Free Open-World Panoptic Segmentation [74.55677741919035]
  We propose Prior2Former (P2F) as the first approach for segmentation vision transformers rooted in evidential learning. P2F extends the mask vision transformer architecture by incorporating a Beta prior for computing model uncertainty in pixel-wise binary mask assignments. It achieves the highest ranking in the OoDIS anomaly instance benchmark among methods not using OOD data in any way.
  arXiv  Detail & Related papers  (2025-04-07T08:53:14Z)
• FinTSB: A Comprehensive and Practical Benchmark for Financial Time Series Forecasting [58.70072722290475]
  Financial time series (FinTS) record the behavior of human-brain-augmented decision-making. FinTSB is a comprehensive and practical benchmark for financial time series forecasting.
  arXiv  Detail & Related papers  (2025-02-26T05:19:16Z)
• Critical Tokens Matter: Token-Level Contrastive Estimation Enhances LLM's Reasoning Capability [53.51560766150442]
  Critical tokens are elements within reasoning trajectories that significantly influence incorrect outcomes.<n>We present a novel framework for identifying these tokens through rollout sampling.<n>We show that identifying and replacing critical tokens significantly improves model accuracy.
  arXiv  Detail & Related papers  (2024-11-29T18:58:22Z)
• Remeasuring the Arbitrage and Sandwich Attacks of Maximal Extractable Value in Ethereum [7.381773144616746]
  Maximal Extractable Value (MEV) drives the prosperity of the blockchain ecosystem. We propose a profitability identification algorithm to identify MEV activities on our collected largest-ever dataset. We have characterized the overall landscape of the MEV ecosystem, the impact the private transaction architectures bring in, and the adoption of back-running mechanisms.
  arXiv  Detail & Related papers  (2024-05-28T08:17:15Z)
• Facilitating Feature and Topology Lightweighting: An Ethereum Transaction Graph Compression Method for Malicious Account Detection [3.877894934465948]
  Bitcoin has become one of the primary global platforms for cryptocurrency, playing an important role in promoting the diversification of the financial ecosystem. Previous regulatory methods usually detect malicious accounts through feature engineering or large-scale transaction graph mining. We propose an Transaction Graph Compression method named TGC4Eth, which assists malicious detection by lightweighting both features and topology of the transaction graph.
  arXiv  Detail & Related papers  (2024-05-14T02:21:20Z)
• 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)
• A Bargaining-based Approach for Feature Trading in Vertical Federated Learning [54.51890573369637]
  We propose a bargaining-based feature trading approach in Vertical Federated Learning (VFL) to encourage economically efficient transactions. Our model incorporates performance gain-based pricing, taking into account the revenue-based optimization objectives of both parties.
  arXiv  Detail & Related papers  (2024-02-23T10:21:07Z)
• FRAD: Front-Running Attacks Detection on Ethereum using Ternary Classification Model [3.929929061618338]
  Front-running attacks, a unique form of security threat, pose significant challenges to the integrity of blockchain transactions. In these attack scenarios, malicious actors monitor other users' transaction activities, then strategically submit their own transactions with higher fees. We introduce a novel detection method named FRAD (Front-Running Attacks Detection on using Ternary Classification Model) Our experimental validation reveals that the Multilayer Perceptron (MLP) classifier offers the best performance in detecting front-running attacks, achieving an impressive accuracy rate of 84.59% and F1-score of 84.60%.
  arXiv  Detail & Related papers  (2023-11-24T14:42:29Z)
• Horizontal Scaling of Transaction-Creating Machines [0.08192907805418582]
  We propose four different approaches for horizontal scaling of transaction creation in blockchains. Two of the four proposed approaches are feasible to scale transaction creation horizontally.
  arXiv  Detail & Related papers  (2023-05-26T15:49:09Z)
• 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 Survey on Label-efficient Deep Segmentation: Bridging the Gap between Weak Supervision and Dense Prediction [115.9169213834476]
  This paper offers a comprehensive review on label-efficient segmentation methods. We first develop a taxonomy to organize these methods according to the supervision provided by different types of weak labels. Next, we summarize the existing label-efficient segmentation methods from a unified perspective.
  arXiv  Detail & Related papers  (2022-07-04T06:21:01Z)
• A Deep Reinforcement Learning Framework for Continuous Intraday Market Bidding [69.37299910149981]
  A key component for the successful renewable energy sources integration is the usage of energy storage. We propose a novel modelling framework for the strategic participation of energy storage in the European continuous intraday market. An distributed version of the fitted Q algorithm is chosen for solving this problem due to its sample efficiency. Results indicate that the agent converges to a policy that achieves in average higher total revenues than the benchmark strategy.
  arXiv  Detail & Related papers  (2020-04-13T13:50:13Z)

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.