Data Availability and Decentralization: New Techniques for zk-Rollups in Layer 2 Blockchain Networks (2403.10828v1)
Abstract: The scalability limitations of public blockchains have hindered their widespread adoption in real-world applications. While the Ethereum community is pushing forward in zk-rollup (zero-knowledge rollup) solutions, such as introducing the blob transaction'' in EIP-4844, Layer 2 networks encounter a data availability problem: storing transactions completely off-chain poses a risk of data loss, particularly when Layer 2 nodes are untrusted. Additionally, building Layer 2 blocks requires significant computational power, compromising the decentralization aspect of Layer 2 networks. This paper introduces new techniques to address the data availability and decentralization challenges in Layer 2 networks. To ensure data availability, we introduce the concept of
proof of download'', which ensures that Layer 2 nodes cannot aggregate transactions without downloading historical data. Additionally, we design a proof of storage'' scheme that punishes nodes who maliciously delete historical data. For decentralization, we introduce a new role separation for Layer 2, allowing nodes with limited hardware to participate. To further avoid collusion among Layer 2 nodes, we design a
proof of luck'' scheme, which also provides robust protection against maximal extractable value (MEV) attacks. Experimental results show our techniques not only ensure data availability but also improve overall network efficiency, which implies the practicality and potential of our techniques for real-world implementation.
- G. Karame, “On the security and scalability of bitcoin’s blockchain,” in Proc. of the ACM Conference on Computer & Communications Security (CCS), 2016, pp. 1861–1862.
- S. Nakamoto, “Bitcoin: A peer-to-peer electronic cash system,” Decentralized Business Review, p. 21260, 2008.
- G. Wood et al., “Ethereum: A secure decentralised generalised transaction ledger,” Ethereum project yellow paper, vol. 151, no. 2014, pp. 1–32, 2014.
- V. Gramoli, L. Bass, A. Fekete, and D. W. Sun, “Rollup: Non-disruptive rolling upgrade with fast consensus-based dynamic reconfigurations,” IEEE Transactions on Parallel and Distributed Systems (TPDS), vol. 27, no. 9, pp. 2711–2724, 2015.
- V. Buterin, “On-chain Scaling to Potentially 500 Tx/sec Through Mass Tx Validation,” https://ethresear.ch/t/on-chain-scaling-to-potentially-500-tx-sec-through-mass-tx-validation/3477, 2018.
- K. Floersch, “Ethereum Smart Contracts in L2: Optimistic Rollup,” https://medium.com/plasma-group/ethereum-smart-contracts-in-l2-optimistic-rollup-2c1cef2ec537, 2019.
- O. Foundation, “Optimism,” https://www.optimism.io/, 2022.
- O. Labs, “Arbitrum One,” https://portal.arbitrum.one/, 2022.
- Polygonscan, “Polygon,” https://polygonscan.com/, 2021.
- M. Labs, “zkSync,” https://zksync.io/, 2021.
- Ethereum.org, “Validium,” https://ethereum.org/en/developers/docs/scaling/validium/, 2021.
- Polynya, “Volitions: Best of all Worlds,” https://polynya.medium.com/volitions-best-of-all-worlds-cfd313aec9a8, 2021.
- L. P. Ltd, “Loopring,” https://loopring.org/\#/, 2021.
- M. Labs, “zkPorter: A Breakthrough in L2 Scaling,” https://blog.matter-labs.io/zkporter-a-breakthrough-in-l2-scaling-ed5e48842fbf, 2021.
- V. Buterin, “Trust Models,” https://vitalik.eth.li/general/2020/08/20/trust.html, 2020.
- G. Ateniese, I. Bonacina, A. Faonio, and N. Galesi, “Proofs of space: When space is of the essence,” in Proc. of the International Conference on Security and Cryptography for Networks (SCN). Springer, 2014, pp. 538–557.
- D. Boneh, J. Drake, B. Fisch, and A. Gabizon, “Efficient polynomial commitment schemes for multiple points and polynomials,” IACR Cryptology ePrint Archive, 2020.
- V. Buterin, “The Dawn of Hybrid Layer 2 Protocols,” https://alidevjimmy.github.io/general/2019/08/28/hybrid\_layer\_2.html, 2019.
- Etherscan, “Ethereum Average Block Size Chart,” https://etherscan.io/chart/blocksize, 2019.
- Filecoin, “Filecoin Proving Subsystem,” https://github.com/filecoin-project/rust-fil-proofs, 2019.
- Ethereum, “What Is Validium,” https://ethereum.org/developers/docs/scaling/validium#what-is-validium, 2019.
- B. Fisch, “Poreps: Proofs of space on useful data,” IACR Cryptology ePrint Archive, 2018.
- S. Dziembowski, S. Faust, V. Kolmogorov, and K. Pietrzak, “Proofs of space,” in Proc. of the Annual International Cryptology Conference (CRYPTO). Springer, 2015, pp. 585–605.
- S. Chu and S. Wang, “The curses of blockchain decentralization,” IACR Cryptology ePrint Archive, 2018.
- G. Ateniese, L. Chen, M. Etemad, and Q. Tang, “Proof of storage-time: Efficiently checking continuous data availability,” IACR Cryptology ePrint Archive, 2020.
- G. Anthoine, J.-G. Dumas, M. de Jonghe, A. Maignan, C. Pernet, M. Hanling, and D. S. Roche, “Dynamic proofs of retrievability with low server storage,” in Proc. of the USENIX Security Symposium (Security), 2021, pp. 537–554.
- L. Zhou, K. Qin, A. Cully, B. Livshits, and A. Gervais, “On the just-in-time discovery of profit-generating transactions in defi protocols,” in Proc. of the IEEE Symposium on Security and Privacy (S&P). IEEE, 2021, pp. 919–936.
- K. Qin, L. Zhou, and A. Gervais, “Quantifying blockchain extractable value: How dark is the forest?” in Proc. of the IEEE Symposium on Security and Privacy (S&P). IEEE, 2022, pp. 198–214.
- E. I. Proposals, “EIP-4844: Shard Blob Transactions,” https://eips.ethereum.org/EIPS/eip-4844, 2022.
- J. Poon and V. Buterin, “Plasma: Scalable Autonomous Smart Contracts,” https://www.plasma.io/plasma-deprecated.pdf, 2022.
- D. Feist, “New Sharding Design with Tight Beacon and Shard Block Integration,” https://notes.ethereum.org/@dankrad/new\_sharding, 2022.
- E. Community, “Danksharding,” https://ethereum.org/en/roadmap/danksharding/#danksharding, 2023.
- A. Kate, G. M. Zaverucha, and I. Goldberg, “Constant-size commitments to polynomials and their applications,” in Proc. of the Annual International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT). Springer, 2010, pp. 177–194.
- J. Zhang, T. Xie, T. Hoang, E. Shi, and Y. Zhang, “Polynomial commitment with a {{\{{One-to-Many}}\}} prover and applications,” in Proc. of the USENIX Security Symposium (Security), 2022, pp. 2965–2982.
- C. Sguanci, R. Spatafora, and A. M. Vergani, “Layer 2 blockchain scaling: A survey,” IACR Cryptology ePrint Archive, 2021.
- B. Chen, B. Bünz, D. Boneh, and Z. Zhang, “Hyperplonk: Plonk with linear-time prover and high-degree custom gates,” in Proc. of the Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT). Springer, 2023, pp. 499–530.
- S. Dziembowski, L. Eckey, and S. Faust, “Fairswap: How to fairly exchange digital goods,” in Proc. of the ACM Conference on Computer & Communications Security (CCS), 2018, pp. 967–984.
- D. Boneh, J. Drake, B. Fisch, and A. Gabizon, “Halo infinite: Proof-carrying data from additive polynomial commitments,” in Proc. of the Annual International Cryptology Conference (CRYPTO), 2021, pp. 649–680.
- A. Gabizon, Z. J. Williamson, and O. Ciobotaru, “Plonk: Permutations over lagrange-bases for oecumenical noninteractive arguments of knowledge,” IACR Cryptology ePrint Archive, 2019.
- Z. Ltd., “ZKFair,” https://docs.zkfair.io/, 2024.
- S. Ltd., “Immutable X,” https://docs.starkware.co/starkex/perpetual/perpetual\_overview.html, 2024.
- dYdX Ltd., “dYdX,” https://dydx.l2beat.com/, 2024.
- B. Ltd., “Base,” https://docs.base.org/, 2024.
- M. Ltd., “Mode,” https://docs.mode.network/introduction/readme, 2024.
- E. Community, “Proposer-builder separation,” https://ethereum.org/en/roadmap/pbs/, 2024.