Blockchain Verification via Hash Segment Sampling
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional blockchain verification techniques require comparing entire hash values of each block, leading to increased computational resources and longer verification times as the blockchain grows, which can overshadow the security benefits, especially in transactions like cryptocurrency.
Innovation Solution
A computing system accesses multiple instances of a blockchain from distributed peers, parsing sample segments of hash values to compare between instances without comparing entire blockchains, using statistical sampling techniques and cryptographic hash functions like SHA-1, SHA-2, or SHA-3 to determine validity and reduce computational burdens.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If conventional techniques compare entire hash values of each block for verification, then verification accuracy is improved, but computational resources and verification time increase significantly
Solution Approach 1:
The patent divides the blockchain verification process into segments by comparing only specific portions of hash values rather than entire hash values. The system identifies and compares critical segments of hash values that are sufficient to detect tampering, thereby reducing the computational burden while maintaining verification effectiveness.
Solution Approach 2:
The patent extracts and compares only the necessary portions of hash values rather than processing complete hash values. By taking out and focusing on the critical segments that contain verification information, the system achieves faster verification without sacrificing accuracy.
2Reliability
If the blockchain continuously grows with new blocks, then security and record completeness are improved, but computational resources required for verification increase
Solution Approach 1:
The patent applies segmentation by dividing the verification task into smaller units, comparing only specific hash value segments rather than processing the entire blockchain. This allows the system to handle growing blockchains efficiently without linearly increasing computational resource requirements.
Solution Approach 2:
The patent uses partial action by performing verification on selected portions of hash values rather than complete verification of all blocks. This partial verification approach is sufficient to detect tampering while consuming fewer computational resources, enabling the system to scale with growing blockchains.
3Productivity
If sample segments of hash values are compared instead of entire hash values, then verification speed is improved, but verification certainty may be reduced
Solution Approach 1:
The patent applies local quality by identifying and comparing specific high-value segments of hash values that contain the most critical verification information. Rather than uniformly processing all hash value portions, the system focuses on locally significant segments that provide the highest verification certainty per unit of computational effort.
Solution Approach 2:
The patent changes the parameter of verification by transitioning from comparing complete hash values to comparing selected segments with specific characteristics. By modifying the verification parameter from full-hash comparison to segmented comparison based on informational density, the system achieves faster verification while maintaining adequate certainty.
Data Source
AI summary
Novel tools and techniques are provided for implementing scaling and distribution of blockchains without ledger limitations. In various embodiments, a computing system might access many instances of a blockchain from many distributed peers. The computing system might parse a first instance of the blockchain accessible from a first distributed peer, to produce a first sample segment of a hash value of one of many blocks of the blockchain. The computing system might compare the first sample segment with a corresponding hash value portion of a second instance of the blockchain accessible from a second distributed peer, without comparing hash values of the entire first instance with those of the entire second instance. Based on a determination that the first sample segment and the corresponding hash value portion do not match, the computing system might send a notification to a user indicating that the first instance and/or second instance is invalid.