{"title":"Delay Analysis of EIP-4844","authors":"Pourya Soltani, Farid Ashtiani","doi":"arxiv-2409.11043","DOIUrl":null,"url":null,"abstract":"Proto-Danksharding, proposed in Ethereum Improvement Proposal 4844\n(EIP-4844), aims to incrementally improve the scalability of the Ethereum\nblockchain by introducing a new type of transaction known as blob-carrying\ntransactions. These transactions incorporate binary large objects (blobs) of\ndata that are stored off-chain but referenced and verified on-chain to ensure\ndata availability. By decoupling data availability from transaction execution,\nProto-Danksharding alleviates network congestion and reduces gas fees, laying\nthe groundwork for future, more advanced sharding solutions. This letter\nprovides an analytical model to derive the delay for these new transactions. We\nmodel the system as an $\\mathrm{M/D}^B/1$ queue which we then find its steady\nstate distribution through embedding a Markov chain and use of supplementary\nvariable method. We show that transactions with more blobs but less frequent\nimpose higher delays on the system compared to lower blobs but more frequent.","PeriodicalId":501422,"journal":{"name":"arXiv - CS - Distributed, Parallel, and Cluster Computing","volume":"118 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Distributed, Parallel, and Cluster Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.11043","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Proto-Danksharding, proposed in Ethereum Improvement Proposal 4844
(EIP-4844), aims to incrementally improve the scalability of the Ethereum
blockchain by introducing a new type of transaction known as blob-carrying
transactions. These transactions incorporate binary large objects (blobs) of
data that are stored off-chain but referenced and verified on-chain to ensure
data availability. By decoupling data availability from transaction execution,
Proto-Danksharding alleviates network congestion and reduces gas fees, laying
the groundwork for future, more advanced sharding solutions. This letter
provides an analytical model to derive the delay for these new transactions. We
model the system as an $\mathrm{M/D}^B/1$ queue which we then find its steady
state distribution through embedding a Markov chain and use of supplementary
variable method. We show that transactions with more blobs but less frequent
impose higher delays on the system compared to lower blobs but more frequent.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
