Blockchain Data Structure-Based Verification Method for Relay Protection Setting File

Frequent and large-scale adjustments to protection settings pose new demands for rapid and accurate verification of operational settings. This paper proposes a blockchain data structure-based rapid verification method to achieve precise and swift comparison between benchmark settings on the blockchain and operational settings. First, rapid consistency verification is performed by computing and comparing hash values of operational setting files and on-chain setting files. When inconsistencies occur, the setting file content undergoes structural mapping and vector encoding to generate a Hash Table; a global Merkle tree is constructed via recursive merging algorithms, comparing locally computed tree roots with blockchain-stored roots. Employing a layered hash comparison strategy integrated with XML(eXtensible Markup Language) node topology, the method hierarchically traces discrepancy sources to precisely locate specific setting items and their paths. Tests confirm an average verification time of 42.67 ms per setting file, significantly enhancing the efficiency of protection setting verification and management.

Authors

Institutions

Publication Details

Published
2025-06-20
DOI
https://doi.org/10.1109/icesep66633.2025.11155722
Primary Topic
Digital Rights Management and Security
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Blockchain Data Structure-Based Verification Method for Relay Protection Setting File

Yudun Li, Congcong Li, Yongjie Zhang, Yi Tang et al.
Digital Rights Management and Security
article

Blockchain Data Structure-Based Verification Method for Relay Protection Setting File

Yudun Li, Congcong Li, Yongjie Zhang, Yi Tang, Tianshu Li, Zongwen Shuai
article en

Abstract

Frequent and large-scale adjustments to protection settings pose new demands for rapid and accurate verification of operational settings. This paper proposes a blockchain data structure-based rapid verification method to achieve precise and swift comparison between benchmark settings on the blockchain and operational settings. First, rapid consistency verification is performed by computing and comparing hash values of operational setting files and on-chain setting files. When inconsistencies occur, the setting file content undergoes structural mapping and vector encoding to generate a Hash Table; a global Merkle tree is constructed via recursive merging algorithms, comparing locally computed tree roots with blockchain-stored roots. Employing a layered hash comparison strategy integrated with XML(eXtensible Markup Language) node topology, the method hierarchically traces discrepancy sources to precisely locate specific setting items and their paths. Tests confirm an average verification time of 42.67 ms per setting file, significantly enhancing the efficiency of protection setting verification and management.

University of Jinan (CN), Luye Pharma (China) (CN)
Openalex Percentile: Top 64%
Digital Rights Management and Security
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.