Blockchain technology has emerged as a revolutionary tool in ensuring data integrity and security in digital transactions. However, the current approaches to data verification in blockchain systems, particularly in Ethereum, face challenges in terms of efficiency and computational overhead. The traditional use of Merkle Trees and cryptographic hash functions, while effective, leads to significant resource consumption, especially for large datasets. This highlights a gap in existing research: the need for more efficient methods of data verification in blockchain networks. Our study addresses this gap by proposing an innovative aggregation scheme for Zero-Knowledge Proofs within the structure of Merkle Trees. We develop a system that significantly reduces the size of the proof and the computational resources needed for its generation and verification. Our approach represents a paradigm shift in blockchain data verification, balancing security with efficiency. We conducted extensive experimental evaluations using real Ethereum block data to validate the effectiveness of our proposed scheme. The results demonstrate a drastic reduction in proof size and computational requirements compared to traditional methods, making the verification process more efficient and economically viable. Our contribution fills a critical research void, offering a scalable and secure solution for blockchain data verification. The implications of our work are far-reaching, enhancing the overall performance and adaptability of blockchain technology in various applications, from financial transactions to supply chain management.

翻译：区块链技术已成为确保数字交易数据完整性与安全性的革命性工具。然而，当前区块链系统（特别是以太坊）中的数据验证方法在效率和计算开销方面面临挑战。传统默克尔树与密码学哈希函数虽有效，但会导致显著资源消耗，尤其对大规模数据集而言。这揭示了现有研究的空白：需要更高效的数据验证方法以应用于区块链网络。本研究通过提出一种基于默克尔树结构的零知识证明聚合方案来填补这一空白。我们开发了一套系统，可显著降低证明体积及其生成与验证所需计算资源。该方案代表了区块链数据验证的范式转变，在安全性与效率之间实现平衡。我们使用真实以太坊区块数据进行了广泛实验评估，以验证所提方案的有效性。结果表明，与传统方法相比，证明体积与计算需求大幅降低，使验证过程更高效且更具经济可行性。本研究填补了关键研究空白，为区块链数据验证提供了可扩展的安全解决方案。相关工作影响深远，将提升区块链技术在金融交易、供应链管理等各类应用中的整体性能与适应性。