Component Grouping Hash Tree for Blockchain Data Verification

Solution Overview

Problem

Current blockchain systems face inefficiencies in resource usage and security when maintaining redundant replicas of transaction data, particularly when dealing with large or sensitive transaction components, as they require extensive computational resources and may compromise privacy due to the need to share all components with notaries or oracles.

Innovation Solution

The Component Grouping Hash Tree (CGHT) system groups transaction components by type within a Merkle tree, allowing only necessary components and their hashes to be shared, using a root hash as a transaction identifier, and optionally increasing entropy with nonces, to reduce computational load and enhance security.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If all transaction components are shared with notaries for verification, then transaction integrity is verified, but computational resources and storage requirements increase significantly

Engineering Contradiction:

Improvetransaction integrity verificationVSAvoiddata shared with notaries

Core Design Contradiction:

ReliabilityVSQuantity of substance

Solution Approach 1:

The patent extracts only the essential verification elements (hashes of transaction components) from the complete transaction data and shares only these extracted elements with notaries. This allows verification of transaction integrity without requiring notaries to handle or store the entire transaction dataset, thereby reducing computational and storage requirements while maintaining verification reliability.

Inventive Principle:

Principle #2Taking out (Extraction)

Solution Approach 2:

The patent uses cryptographic hashing to create compact digital representations (copies) of transaction components. These hash copies serve as verification tokens that notaries can process efficiently without needing the original large transaction data, thus enabling integrity verification with minimal data exchange and storage.

Inventive Principle:

Principle #26Copying

2Reliability

If redundant replicas of transaction data are maintained across multiple nodes, then system reliability and decentralization are improved, but storage requirements and network bandwidth increase

Engineering Contradiction:

Improvesystem reliabilityVSAvoidstorage requirements

Core Design Contradiction:

ReliabilityVSQuantity of substance

Solution Approach 1:

The patent extracts only the essential verification elements (hashes of transaction components) from the complete transaction data and shares only these extracted elements with notaries. This allows verification of transaction integrity without requiring notaries to handle or store the entire transaction dataset, thereby reducing computational and storage requirements while maintaining verification reliability.

Inventive Principle:

Principle #2Taking out (Extraction)

Solution Approach 2:

The patent uses cryptographic hashing to create compact digital representations (copies) of transaction components. These hash copies serve as verification tokens that notaries can process efficiently without needing the original large transaction data, thus enabling integrity verification with minimal data exchange and storage.

Inventive Principle:

Principle #26Copying

3Reliability

If sensitive transaction components are shared for verification, then transaction integrity is ensured, but privacy and security are compromised

Engineering Contradiction:

Improvetransaction integrityVSAvoidprivacy exposure

Core Design Contradiction:

ReliabilityVSObject-affected harmful factors

Solution Approach 1:

The patent extracts only the essential verification elements (hashes of transaction components) from the complete transaction data and shares only these extracted elements with notaries. This allows verification of transaction integrity without requiring notaries to handle or store the entire transaction dataset, thereby reducing computational and storage requirements while maintaining verification reliability.

Inventive Principle:

Principle #2Taking out (Extraction)

Solution Approach 2:

The patent uses cryptographic hashing to create compact digital representations (copies) of transaction components. These hash copies serve as verification tokens that notaries can process efficiently without needing the original large transaction data, thus enabling integrity verification with minimal data exchange and storage.

Inventive Principle:

Principle #26Copying

Data Source

PatentUS12120242B2Hash subtrees for grouping components by component type

Publication Date: 2024.10.15 R3 LTD

AI summary

A system for generating a hash tree with components grouped by component type is provided. Each non-leaf node of the hash tree has a hash of the hashes of its child nodes, and a leaf node has a hash of a component of the hash tree. The system generates, for each component type, a component subtree for that component type based on the leaf nodes that have hashes of the components of that component type. The system then generates a root subtree of the hash tree based on leaf nodes that are the root nodes of the component subtrees. The combination of the root subtree and the component subtrees form the hash tree.