Permissionless Verifiable Information Dispersal (Data Availability for Bitcoin Rollups)
Ben Fisch, Arthur Lazzaretti, Zeyu Liu, Lei Yang
摘要
Rollups are special applications on distributed state machines (aka blockchains) for which the underlying state machine only logs, but does not execute, transactions. Rollups scale throughput by using auxiliary machines that have higher throughput and lower cost of executing transactions than the underlying blockchain. State updates are periodically posted to the underlying blockchain and either verified directly through succinct cryptographic proofs (zk rollups) or can be challenged for a defined period of time in a verifiable way by third parties (optimistic rollups). However, once computation is reduced, communication quickly becomes the new bottleneck. The critical service that the underlying blockchain provides, in addition to verification, is data availability: that necessary data can always be recovered upon request. However, directly broadcasting data requires communication per participant that is linear in the data size. Verifiable information dispersal (VID) systems achieve sublinear blowup in the Ethereum's security and same participation model, where all nodes have a strong public-key identity. However, it is not known how to do so in the permissionless model (the Bitcoin model), where participants are unauthenticated and participation is dynamic. We construct a VID system that is secure under the same model as Bitcoin, with one minimal additional requirement on the existence of reliable participants. Our system uses a state machine replication (SMR) protocol (e.g., Bitcoin) as a black box, and is therefore backward compatible. We implemented the system on top of Bitcoin core with the Regression Test Network (regtest), and our analysis shows that it can reduce communication costs and latency up to more than and , respectively, for certain parameter choices.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper3
- Bulletproofs: Short Proofs for Confidential Transactions and MoreBenedikt Bünz, Jonathan Bootle, Dan Boneh, Andrew Poelstra 等S&P 2018 · 被引用 1,285 次
- Arbitrum: Scalable, private smart contractsHarry A. Kalodner, Steven Goldfeder, Xiaoqi Chen, S. Matthew Weinberg 等USENIX Security 2018 · 被引用 353 次
- DispersedLedger: High-Throughput Byzantine Consensus on Variable Bandwidth NetworksLei Yang, Seo Jin Park, Mohammad Alizadeh, Sreeram Kannan 等NSDI 2022 · 被引用 120 次
相关 Paper
- VeriZexe: Decentralized Private Computation with Universal SetupAlex Luoyuan Xiong, Binyi Chen, Zhenfei Zhang, Benedikt Bünz 等USENIX Security 2023
- SlimChain: Scaling Blockchain Transactions through Off-Chain Storage and Parallel ProcessingCheng Xu, Ce Zhang, Jianliang Xu, Jian PeiVLDB 2021 · 被引用 135 次
- Robust Distributed Arrays: Provably Secure Networking for Data Availability SamplingDankrad Feist, Gottfried Herold, Mark Simkin, Benedikt WagnerCCS 2026
- OptRand: Optimistically Responsive Reconfigurable Distributed RandomnessAdithya Bhat, Nibesh Shrestha, Aniket Kate, Kartik NayakNDSS 2023
- An Algorithm and Architecture Co-design for Accelerating Smart Contracts in BlockchainRui Pan, Chubo Liu, Guoqing Xiao, Mingxing Duan 等ISCA 2023 · 被引用 3 次
