Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2411.03892

A First Look at Ethereum Blob Revolution: Market, Strategies, and Optimality

Yue Huang·Shuzheng Wang·Yuming Huang·Gareth Tyson·Huayi Duan·Jing Tang
View original source ↗Read source document ↗Export metadata ↓

Abstract

As a key enabler of Web3, Ethereum has long faced scalability challenges. The recent EIP-4844 upgrade aims to alleviate the scalability issue by introducing the ''blob'', a new data structure for Layer-2 rollups that enables off-chain storage with much reduced costs. Yet, this new mechanism's impact on Ethereum, and the wider Web3 ecosystem, remains largely underexplored. 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, out of which 1.3 million are blob-carrying. Our analysis reveals two major trends: (1) average block size has increased 2.5 times, from 150 KB to 400 KB, while the share of conventional transactions has shrunk from over $150$ KB to around 80 KB; (2) rollups are rapidly migrating from expensive calldata, falling from approximately 7,500 to nearly zero, toward cheap blobs, rising from zero to about 10,000. These shifts introduce a new economic game between block builders and rollups. Thus, we develop a game-theoretic model to characterize their equilibrium strategies: a profit-maximizing inclusion rule for builders, and a cost-minimizing blob batching strategy for rollups. Empirically, however, we find notable economic inefficiencies: for example, 29.48% of blob-containing blocks are built sub-optimally, yielding less revenue than available alternatives. These findings highlight the intricacies of the blob marketplace, and our work has established both methodological and empirical foundations to understand the evolving post-EIP4844 Ethereum ecosystem.

Explore related subjects

cs.DCcs.CRcs.ET

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yue Huang, Shuzheng Wang, Yuming Huang, Gareth Tyson, Huayi Duan, Jing Tang. 2025-11-15. A First Look at Ethereum Blob Revolution: Market, Strategies, and Optimality. https://arxiv.org/abs/2411.03892

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

KEEP EXPLORING

Related papers

arXiv2026

Reforge: Low-Latency Distributed GNN Serving with Selective Embedding Recomputation

Graph Neural Networks (GNNs) have been widely adopted for their ability to compute expressive node representations in graph datasets. However, serving GNNs on large graphs is challenging due to the high communication, computation, and memory overheads of constructing and executing computation graphs, which represent information flow across large neighborhoods. Existing approximation techniques in training can mitigate the overheads but, in serving, still lead to high latency and/or accuracy loss. To this end, we propose Reforge, a system that enables low-latency GNN serving for large graphs with minimal accuracy loss through two key ideas. First, Reforge employs selective recomputation of precomputed embeddings, which allows for reusing precomputed computation subgraphs while selectively recomputing a small fraction to minimize accuracy loss. Second, we develop computation graph parallelism, which reduces communication overhead by parallelizing the creation and execution of computation graphs across machines. Our evaluation with large graph datasets and GNN models shows that Reforge significantly outperforms state-of-the-art techniques.

cs.DC↗
arXiv2026

Agentic AI Workload Characteristics

Agentic AI shifts LLM serving from isolated prompt-generation requests to stateful, multi-turn executions that repeatedly invoke the model, call tools, and grow context over time. This paper characterizes ReAct-style agents from both the LLM-serving and tool-execution perspectives using an end-to-end tracing infrastructure across reasoning and non-reasoning Gemma and Qwen configurations on five agentic benchmarks. Our study shows that agentic workloads are not simply long-prompt workloads: with effective context caching, most input tokens are reused across turns, making execution decode-dominated while increasing dependence on long-lived KV-cache state. We also find that tool use has a clear temporal structure, with agents shifting from read/explore behavior early in execution to execute/write behavior later. These results show that efficient agentic serving must jointly manage repeated model re-entry, persistent context state, and workload-dependent tool behavior.

cs.DC↗
arXiv2026

Byzantine Causal Reliable Broadcast (BCRB) with Constant-Size Message Metadata

Asynchronous Byzantine Reliable Broadcast (BRB) is a fundamental primitive that guarantees agreement and validity in distributed systems subject to Byzantine faults, but it lacks ordering guarantees. In this paper, we address Byzantine Causal Reliable Broadcast (BCRB), which builds on BRB to enforce causal message ordering. We present a novel BCRB protocol that decouples causal ordering from the BRB layer, achieving constant-size $\mathcal{O}(1)$ message metadata overhead and $\mathcal{O}(n^2)$ communication word complexity as against $\mathcal{O}(n^3)$ communication word complexity of existing protocols; here $n$ is the number of processes. We present two variants of our protocol: a cryptographic version using a threshold encryption scheme and sequence gating, and its non-cryptographic version. In the cryptographic version, senders broadcast ciphertexts immediately, and decryption shares are piggybacked on out-of-band ACKs, preventing early decryption and front-running. In both versions, causal safety is achieved probabilistically. We evaluate the probability of causal safety violations using a random variable path analysis under independent exponential link delay distributions. We show that both variants satisfy liveness and the probability of weak safety violation is bounded by $\mathcal{O}(f^{-3}\cdot\ln^3 f)$, where $f$ is the upper bound on the number of Byzantine processes, and $f < n/3$ and $f=\mathcal{O}(n)$. Further, for the crypto version, we show that the probability of strong safety violation is bounded by $\mathcal{O}(f^{-1} \cdot \ln^2 f)$. We also show how to modify our two protocols to guarantee 100\% weak safety keeping $\mathcal{O}(1)$ message space overhead but with $\mathcal{O}(n^3)$ messages and $\mathcal{O}(n^3)$ communication word complexity.

cs.DC↗