Hash Tree Construction for Continuous Action Uniqueness Verification
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In conventional systems, users face challenges in proving their identity as the actor of specific actions, particularly when creating or updating non-fungible tokens (NFTs), as they need to verify their involvement in each action repeatedly.
Innovation Solution
A method and apparatus utilizing a cryptographic hash to prove continuous action uniqueness by setting information about actions to terminal nodes, constructing a Hash tree, and updating it with new actions, ensuring the user's identity is verified through a cryptographic hash value.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional systems require users to prove their identity for each action separately, then identity verification is performed for each action, but the process becomes complex and time-consuming for continuous actions
Solution Approach 1:
The patent segments continuous actions into discrete action units, each represented as a separate terminal node in the Hash tree. Each action unit contains specific information (action type, result, ID, subject, identification) that can be independently verified. This segmentation allows the system to maintain reliable identity verification for each action while organizing them in a structured hierarchy that reduces overall verification complexity.
Solution Approach 2:
The patent performs preliminary hashing of action information to create terminal nodes before constructing the complete Hash tree. The Merkle path (intermediate hash values) is pre-calculated and stored, enabling efficient verification without requiring complete tree reconstruction. This preliminary action reduces the complexity of subsequent verification processes while maintaining reliability.
2Reliability
If users must verify their involvement in each action repeatedly, then identity authenticity is maintained, but time efficiency decreases
Solution Approach 1:
The patent creates a cryptographic copy of the action verification process through the Hash tree structure. Instead of verifying the entire action history repeatedly, the system uses the Merkle root (a compact cryptographic copy) to represent and verify all actions. The Merkle path provides a simplified copy of the verification path from any terminal node to the root, dramatically reducing verification time while maintaining the reliability of actor identity authentication.
Solution Approach 2:
The Merkle path and intermediate hash values are pre-calculated and stored during tree construction. This preliminary computation eliminates the need for time-consuming iterative verification during actual authentication processes. When verifying an action, the system only needs to traverse the pre-computed Merkle path rather than reconstructing the entire verification chain, significantly reducing verification time while preserving authentication reliability.
3Productivity
If a Hash tree structure is constructed to prove action uniqueness, then continuous action verification is improved, but computational complexity increases
Solution Approach 1:
The Hash tree structure segments the verification process into hierarchical levels (terminal nodes, parent nodes, root node). Each level handles a specific portion of the action data, allowing parallel computation and reducing the complexity burden on any single computational element. This segmentation enables efficient verification of multiple actions simultaneously while maintaining manageable computational complexity at each level.
Solution Approach 2:
The patent merges multiple action verifications into a single Hash tree structure. By combining individual action hash values through the tree hierarchy and computing a single Merkle root, the system achieves efficient batch verification. This merging approach improves productivity by allowing verification of multiple actions through one root comparison, while the hierarchical structure keeps computational complexity distributed and manageable.
Data Source
AI summary
Disclosed are a method and apparatus of proving a continuous action uniqueness. The method includes setting information on each of a plurality of actions performed by a user to a plurality of terminal nodes, grouping the plurality of terminal nodes in units of ‘n’ (where, ‘n’ is a natural number of 2 or more) and setting a parent node of the plurality of terminal nodes based on a combination of information corresponding to the grouped nodes, constructing a Hash tree by generating a Hahs tree root based on a combination of information corresponding to the parent node, and constructing a new Hash tree based on information about a new action and information corresponding to the Hash tree root when the new action subsequent to the plurality of actions is performed by the user.