Approximate Hash Verification for Blockchain Nodes

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Blockchain systems face high computational resource consumption due to the need for full-step hash verification, which can lead to inefficiencies and potential errors, especially in decentralized networks where fault tolerance is crucial.

Innovation Solution

Implementing approximate hash verification by generating a reduced-step hash and using it for verification, allowing nodes to choose between full-step and approximate verification, thereby reducing computational load while maintaining security through fault-tolerant mechanisms.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If full-step hash verification is used in blockchain systems, then security and data integrity are improved, but computational resource consumption increases significantly

Engineering Contradiction:

ImprovesecurityVSAvoidcomputational resource consumption

Core Design Contradiction:

ReliabilityVSUse of energy by moving object

Solution Approach 1:

The hash verification process is segmented into two types: full-step hash verification for critical security operations and approximate (reduced-step) hash verification for less critical operations. This segmentation allows the system to allocate computational resources efficiently by applying the more resource-intensive full verification only where necessary, while using the lighter approximate verification for routine operations, thereby resolving the contradiction between security and computational consumption.

Inventive Principle:

Principle #1Segmentation

Solution Approach 2:

Different verification methods are applied locally to different operations within the blockchain system. Full-step hash verification is applied locally to operations requiring maximum security assurance, while approximate hash verification is applied locally to operations where speed is more important than absolute security. This local differentiation optimizes the balance between security and computational resource usage across the entire system.

Inventive Principle:

Principle #3Local quality

2Measurement precision

If full-step hash verification is performed by all nodes, then verification accuracy is improved, but processing speed decreases

Engineering Contradiction:

Improveverification accuracyVSAvoidprocessing speed

Core Design Contradiction:

Measurement precisionVSSpeed

Solution Approach 1:

The verification process becomes dynamic rather than static. Nodes can dynamically choose between full-step and approximate hash verification based on the specific operation requirements, network conditions, and resource availability. This dynamic adaptability allows the system to optimize processing speed when appropriate while maintaining verification accuracy when needed, resolving the contradiction between precision and speed.

Inventive Principle:

Principle #15Dynamics

Solution Approach 2:

Instead of requiring all nodes to perform the complete full-step hash verification, the system allows partial verification through reduced-step hashing for certain operations. This partial action approach maintains sufficient verification accuracy for most operations while significantly improving processing speed, with the option to perform full verification only when absolutely necessary.

Inventive Principle:

Principle #16Partial or excessive action

3Productivity

If approximate hash verification is used, then computational effort and processing time are reduced, but verification reliability may be compromised

Engineering Contradiction:

Improveprocessing speedVSAvoidverification reliability

Core Design Contradiction:

ProductivityVSReliability

Solution Approach 1:

The system incorporates feedback mechanisms where nodes can detect and report verification failures or suspicious results from approximate hash verification. When such feedback is received, the system can trigger full-step hash verification as a follow-up to confirm the result. This feedback loop maintains high verification reliability while allowing approximate verification to be used for routine operations, thus preserving productivity benefits.

Inventive Principle:

Principle #23Feedback

Solution Approach 2:

The system prepares for potential verification failures by maintaining a hybrid verification architecture where full-step hash verification is available as a backup mechanism. This beforehand cushioning ensures that if approximate verification encounters issues, the system has pre-positioned full verification capability to step in and maintain reliability, allowing the system to safely use approximate verification for improved productivity.

Inventive Principle:

Principle #11Beforehand cushioning (Prior cushioning)

Data Source

PatentUS20200382309A1Approximate hash verification for blockchain

Publication Date: 2020.12.03 INTERNATIONAL BUSINESS MACHINE CORPORATION

AI summary

An example operation may include one or more of transmitting, from a client application, a message to one or more blockchain nodes to store a storage request on a blockchain, the message comprising a full-step hash of the storage request and a reduced-step hash of the storage request, receiving, from a blockchain node, a recordation confirmation indicating the reduced-step hash of the storage request is stored on the blockchain, and verifying, by the client application, whether the recordation of the storage request is correct based on an approximate hash verification of the reduced-step hash of the storage request.