Probabilistic Hash Verification in Blockchain Blocks

The patent applies preliminary action by pre-computing and storing cumulative hash values (Merkle roots) in each block that represent the entire history of blocks up to that point. This allows verification to be performed in a single step by comparing the target block's hash against the pre-computed cumulative hash in the verifying block, eliminating the need to sequentially verify each intermediate block while maintaining verification reliability.

The patent extracts the essential verification information (cumulative hash representation of all previous blocks) and stores it directly within each block's data structure. This extracted verification data enables fast one-step verification without requiring access to or processing of the entire block chain history, significantly reducing processing time while ensuring reliability through cryptographic proof.

The patent pre-computes and embeds cumulative Merkle root hashes in each block during the block creation process. This preliminary action shifts the computational burden from verification time to block creation time, allowing subsequent verifications to perform simple hash comparisons rather than expensive sequential hash computations, thereby reducing computational resource consumption while maintaining verification accuracy.

The patent creates a compact cryptographic copy (Merkle root) that represents the entire history of blocks and stores it within each block. This copied representation enables verification nodes to validate block inclusion with minimal computational resources by comparing hashes, rather than requiring full replication and verification of all intermediate blocks, thus reducing energy consumption while preserving verification accuracy.

The patent uses a Bloom filter, which is a space-efficient and computationally inexpensive probabilistic data structure, to store the cumulative hash representation. The Bloom filter provides fast membership testing with acceptable false positive rates, enabling high verification speed. While probabilistic in nature, it can be configured with parameters that make false positives negligible for practical purposes, balancing productivity gains with sufficient verification precision.

The patent adjusts the parameters of the Bloom filter (such as the number of hash functions and filter size) to optimize the balance between verification speed and precision. By tuning these parameters, the system can achieve very high verification speeds while keeping the false positive rate below acceptable thresholds, effectively resolving the contradiction between productivity and measurement precision for practical applications.