PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
March 1, 2026Scientia Sinica Informationis0 citationsOpen Access

Efficient trusted data traceability method based on segmented merkle mountain range

XZXuewang ZhangJZJunjie ZhangJLJinchao Lin

Key Points

  • The study aims to enhance data traceability methods in blockchain by addressing concurrency and validation efficiency issues.
  • Proposed a dual-layer index structure using local balanced subtrees and global Merkle mountain range.
  • Utilized InterPlanetary File System (IPFS) to store raw traceability data.
  • Segmented data construction based on threshold values for optimized insertion and verification.
  • Demonstrated significantly improved batch insertion efficiency over traditional Merkle mountain range.
  • Showed reduced integrity verification delays with concentrated data distribution.
  • Exhibited higher traceability efficiency in large-scale data scenarios.

Abstract

可信数据溯源是可信数据空间可信管控的关键环节。针对区块链溯源场景中数据的高并发写入与验证效率瓶颈,提出一种基于分层Merkle山脉的高效可信数据溯源方法。该方法利用星际文件系统(InterPlanetaryFileSystem,IPFS)存储原始溯源数据,并在Merkle树与Merkle山脉的基础上设计“局部平衡子树十全局Merkle山脉”的双层索引结构,将溯源数据按阈值分段构建,优化数据插入及完整性证明验证效率。实验测试了不同数据规模和分段阈值下各个阶段的时间开销。理论分析及实验结果表明,所提方法的数据批量插入效率对比传统Merkle山脉具有显著提升,数据批量完整性验证延迟随着数据分布的集中也相比传统Merkle山脉表现出更大优势,在大规模数据场景下具有更高的溯源效率。

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Zhang et al. (2026) studied this question.

synapsesocial.com/papers/69a3d79dec16d51705d2dde2https://doi.org/10.1360/ssi-2025-0411
Ask AI
Helpful
Bookmark
Share
View Full Paper