A breakable link data structure with independent hashing and independent pointers

By using a breakable key data structure with independent hashes and independent pointers, the shortcomings of traditional hash structures in terms of topology breakability and space utilization are solved. It achieves decoupling of hash verification and topology connection, improves operational efficiency and space utilization, and is suitable for various topology scenarios.

CN122285666APending Publication Date: 2026-06-26付文恺
View PDF 0 Cites 0 Cited by

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
付文恺
Filing Date
2026-04-01
Publication Date
2026-06-26

AI Technical Summary

Technical Problem

Traditional hash structures lack topological key breaking capabilities, have high operational complexity, low space utilization, and cannot flexibly adapt to different topological structure requirements.

Method used

The key-breakable data structure with independent hash and independent pointer is adopted to completely decouple the hash verification function from the topology connection function. Data integrity verification and topology connection are implemented through independent hash field and independent pointer field respectively, supporting key break and reconnection operations with O(1) time complexity.

Benefits of technology

It achieves complete decoupling between hash verification and topology connection, reduces operational complexity, improves space utilization and operational efficiency, and is adaptable to various topology scenarios.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN122285666A_ABST
    Figure CN122285666A_ABST
Patent Text Reader

Abstract

This invention discloses a key-breakable data structure with independent hashes and independent pointers, belonging to the field of data storage and security technology. It aims to solve the technical problems of traditional hash structures, which only have hash calculation and verification functions but lack topological key-break capabilities, and suffer from high modification complexity and low space utilization. This data structure includes a data field, an independent hash field, and an independent pointer field. The independent hash field stores the data verification hash value to achieve data integrity verification; the independent pointer field is used to implement topological connections between data nodes, supporting key-break and reconnection operations; and the data field stores the target data. This invention completely decouples the hash verification function from the topological connection function, retaining the security of hash verification while achieving the flexibility of topological key-break. The complexity of data modification and key-break operations is reduced to O(1). Furthermore, it can flexibly adapt to chain-like (1 independent hash field + 1 independent pointer field) or tree-like (2 independent hash fields + 2 independent pointer fields) structures according to application scenarios, significantly improving space utilization and operational efficiency. This invention can be widely applied to various data storage scenarios such as blockchain and Merkle trees. It has the advantages of extremely simple structure, high security, strong versatility and easy implementation, and has extremely high practical value and promotion prospects.
Need to check novelty before this filing date? Find Prior Art