以太坊2.0的状态容量问题的分析
Analysis of the State Capacity Problem of Ethereum 2.0
摘要:
作为最知名的公有链项目之一,以太坊拥有全球最大的区块链开源社区,也是全球最活跃的公有链。但同时,性能也是极大的瓶颈问题。因此,提高交易吞吐量(Transactions Per Second,TPS)是以太坊下一步能够生存和发展的重要目标,但与此同时,容量问题将会暴露出来。按照以太坊2.0的改进方案,分析可能存在的状态容量需求和隐患问题。主要包括:相关的计算与评估;达到预期TPS时的节点同步情况、容量需求以及可能的隐患问题。最后进行总结并展望了未来的重点研究方向。
Abstract:
As one of the most well-known public chain projects, Ethereum has the world’s largest blockchain open source community and the most active public chain in the world. But at the same time, performance is also a huge bottleneck. Therefore, Improving Transaction Per Second (TPS) is an important goal for Ethereum to survive and develop in the next step, but at the same time, capacity issues will be exposed. According to the improvement plan of Ethereum 2.0, the paper analyzes the possible state requirements and hidden dangers. Highlights include: related calculations and assessments; node synchronization, expected capacity requirements, and potential hazards when TPS is expected. Finally, it summarizes and looks forward to the key research directions in the future.
参考文献
|
[1]
|
Nakamoto, S. (2008) Bitcoin: A Peer-to-Peer Electronic Cash System. https://bitcoin.org/bitcoin.pdf
|
|
[2]
|
Swan, M. (2015) Blockchain: Blueprint for a New Economy. O’Reilly Media, Sebastopol, CA.
|
|
[3]
|
Ethereum White Paper. A Next-Generation Smart Contract and Decentralized Application Platform.
https://github.com/ethereum/wiki/wiki/White-Paper
|
|
[4]
|
袁勇, 王飞跃. 区块链技术发展现状与展望[J]. 自动化学报, 2016, 42(4): 481-494.
|
|
[5]
|
Szabo, N. (1997) Formalizing and Securing Relationships on Public Networks. First Monday, 2.
https://www.firstmonday.org/ojs/index.php/fm/article/view/548/469
|
|
[6]
|
State of the DApps. https://stateofthedapps.com/zh/stats/platform/ethereum#new
|
|
[7]
|
Vitalik, B. (2018) ETH 2.0: The Road to Scaling Ethereum. Devcon4.
|
|
[8]
|
Parameswaran, M., Susarla, A. and Andrew, B. (2001) P2P Networking: An Infor-mation-Sharing Alternative. Computer, 34, 31-38. [Google Scholar] [CrossRef]
|
|
[9]
|
闫莺, 郑凯, 郭众鑫. 以太坊技术详解与实战[M]. 北京: 机械工业出版社, 2018: 15-29.
|
|
[10]
|
Berman, P., Karpinski, M. and Nekrich, Y. (2011) Optimal Trade-Off for Merkle Tree Traversal. Theoretical Computer Science, 372, 26-36. [Google Scholar] [CrossRef]
|
|
[11]
|
Peter, R. (2015) Block Size Limit Debate Working Paper: A Trans-action Fee Market Exists without a Block Size Limit.
https://www.bitcoinunlimited.info/resources/feemarket.pdf
|
|
[12]
|
王嘉平. 区块链公链如何才能快起来(上)[EB/OL]. https://www.8btc.com/article/291181
|
|
[13]
|
Akhunov, A. (2018) Recent Data on Turbo Geth Perfor-mance.
https://medium.com/@akhounvo/recent-data-on-turbo-geth-performance-f7fb28b06a65
|
|
[14]
|
Luu, L., Narayanan, V., Zheng, C., et al. (2016) A Secure Sharding Protocol for Open Blockchain. In: CCS’16, ACM, New York, 17-30. [Google Scholar] [CrossRef]
|
|
[15]
|
Wang, J. and Wang, H. (2019) Monoxide: Scale out Blockchain with Asynchronous Consensus Zones. In: NSDI, USENIX Association, Boston, 95-112.
|