The Writing is on the Wall: Analyzing the Boom of Inscriptions and its Impact on EVM-compatible Blockchains
- URL: http://arxiv.org/abs/2405.15288v2
- Date: Thu, 17 Oct 2024 09:22:42 GMT
- Title: The Writing is on the Wall: Analyzing the Boom of Inscriptions and its Impact on EVM-compatible Blockchains
- Authors: Johnnatan Messias, Krzysztof Gogol, Maria InĂªs Silva, Benjamin Livshits,
- Abstract summary: We present a data-driven analysis of the transaction surge in late 2023 and early 2024, attributed to inscriptions.
We show that, on certain days, inscriptions accounted nearly 90% on Arbitrum and ZKsync Era.
We also show that ZKsync and Arbitrum saw lower median gas fees during these surges.
- Score: 8.744676168760394
- License:
- Abstract: Although rollups have attracted significant attention, there is limited empirical research on their performance under high load. To address this, we present a data-driven analysis of the transaction surge in late 2023 and early 2024, attributed to inscriptions -- a method for recording data on the blockchain. Initially introduced on Bitcoin, inscriptions enable the representation of NFTs or ERC-20-like tokens without smart contracts, and have since expanded to other blockchains. This paper examines inscription-related transactions on Ethereum and major EVM-compatible rollups, assessing their impact on scalability during transaction surges. Our results show that, on certain days, inscriptions accounted nearly 90% of transactions on Arbitrum and ZKsync Era, while 53% on Ethereum, with 99% of these inscriptions involving meme coin minting. Furthermore, we show that ZKsync and Arbitrum saw lower median gas fees during these surges. ZKsync Era, a ZK-rollup, showed a greater fee reduction than the optimistic rollups studied -- Arbitrum, Base, and Optimism.
Related papers
- Who Wins Ethereum Block Building Auctions and Why? [2.762397703396294]
The MEV-Boost block auction contributes approximately 90% of all blocks.
Between October 2023 and March 2024, only three builders produced 80% of them.
We identify features that play a significant role in builders' ability to win blocks and earn profits.
arXiv Detail & Related papers (2024-07-18T22:49:37Z) - The Latency Price of Threshold Cryptosystem in Blockchains [52.359230560289745]
We study the interplay between threshold cryptography and a class of blockchains that use Byzantine-fault tolerant (BFT) consensus protocols.
Existing approaches for threshold cryptosystems introduce a latency overhead of at least one message delay for running the threshold cryptographic protocol.
We propose a mechanism to eliminate this overhead for blockchain-native threshold cryptosystems with tight thresholds.
arXiv Detail & Related papers (2024-07-16T20:53:04Z) - The Writing is on the Wall: Analyzing the Boom of Inscriptions and its Impact on Rollup Performance and Cost Efficiency [7.394726159860848]
We study the first study during a heightened activity during the late 2023 transaction boom.
We observe that minting inscription-based meme tokens on zkSync Era allows for trading at a fraction of the costs.
Unlike L1 blockchains, ZK rollups may experience lower gas fees with increased transaction volume.
The introduction of blobs - a form of temporary data storage - decreased the gas costs of rollups, but also raised a number of questions about the security of inscription-based tokens.
arXiv Detail & Related papers (2024-04-17T09:08:42Z) - 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) - TxAllo: Dynamic Transaction Allocation in Sharded Blockchain Systems [37.22526235663589]
This paper focuses on the transaction allocation problem to reduce the number of cross-shard transactions.
A deterministic and fast allocation scheme TxAllo is proposed to dynamically infer the allocation of accounts.
For a blockchain with 60 shards, TxAllo reduces the cross-shard transaction ratio from 98% to about 12%.
arXiv Detail & Related papers (2022-12-22T10:22:31Z) - 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) - Token Spammers, Rug Pulls, and SniperBots: An Analysis of the Ecosystem of Tokens in Ethereum and in the Binance Smart Chain (BNB) [50.888293380932616]
We study the ecosystem of the tokens and liquidity pools.
We find that about 60% of tokens are active for less than one day.
We estimate that 1-day rug pulls generated $240 million in profits.
arXiv Detail & Related papers (2022-06-16T14:20:19Z) - Light Clients for Lazy Blockchains [12.330989180881701]
We devise a protocol that enables the creation of efficient light clients for lazy blockchains.
Our construction is based on a bisection game that traverses the Merkle tree containing the ledger of all - valid or invalid - transactions.
arXiv Detail & Related papers (2022-03-30T00:58:40Z) - Blockchains through ontologies: the case study of the Ethereum ERC721
standard in OASIS (Extended Version) [0.0]
This paper reports on how to leverage the emphOntology for Agents, Systems, and Integration of Services as a general means for the semantic representation of smart contracts stored on blockchain as software agents.
Special attention is paid to non-fungible tokens (NFTs), whose management through the ERC721 standard is presented as a case study.
arXiv Detail & Related papers (2021-09-07T06:54:11Z) - Quantum Multi-Solution Bernoulli Search with Applications to Bitcoin's
Post-Quantum Security [67.06003361150228]
A proof of work (PoW) is an important cryptographic construct enabling a party to convince others that they invested some effort in solving a computational task.
In this work, we examine the hardness of finding such chain of PoWs against quantum strategies.
We prove that the chain of PoWs problem reduces to a problem we call multi-solution Bernoulli search, for which we establish its quantum query complexity.
arXiv Detail & Related papers (2020-12-30T18:03:56Z)
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.