计算机科学
块链
散列函数
瓶颈
吞吐量
梅克尔树
协议(科学)
并行计算
计算机网络
操作系统
嵌入式系统
计算机安全
哈希链
替代医学
病理
无线
医学
作者
C. Li,Sidi Mohamed Beillahi,Guang Yang,Ming Wu,Wei Xu,Fan Long
摘要
Authenticated storage access is the performance bottleneck of a blockchain, because each access can be amplified to potentially O (log n ) disk I/O operations in the standard Merkle Patricia Trie (MPT) storage structure. In this article, we propose a multi-Layer Versioned Multipoint Trie (LVMT), a novel high-performance blockchain storage with significantly reduced I/O amplifications. LVMT uses the authenticated multipoint evaluation tree vector commitment protocol to update commitment proofs in constant time. LVMT adopts a multi-layer design to support unlimited key–value pairs and stores version numbers instead of value hashes to avoid costly elliptic curve multiplication operations. In our experiment, LVMT outperforms the MPT in real Ethereum traces, delivering read and write operations 6× faster. It also boosts blockchain system execution throughput by up to 2.7×.
科研通智能强力驱动
Strongly Powered by AbleSci AI