Blockchain File Verification Using Hash Tree Root Storage

Solution Overview

Problem

The existing methods for file verification using blockchain are inefficient due to limited block storage space, leading to wastage of resources when handling large files, resulting in high costs and impracticality.

Innovation Solution

A file verification method that utilizes a tree data structure based on hash values of electronic files, where the root hash value is stored on the blockchain, allowing for efficient verification of file integrity by generating verification data from the tree structure, reducing storage and computational costs.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Quantity of substance

If huge file data is split and written into multiple blocks on the blockchain, then data storage is achieved, but storage resources and computing resources are wasted leading to high cost

Engineering Contradiction:

Improvedata storage capacityVSAvoidstorage resource waste

Core Design Contradiction:

Quantity of substanceVSLoss of energy

Solution Approach 1:

The patent extracts only the essential hash value of the file from the large file data and stores it on the blockchain, rather than storing the entire file. This extraction approach maintains data integrity verification capability while dramatically reducing storage requirements on the blockchain.

Inventive Principle:

Principle #2Taking out (Extraction)

Solution Approach 2:

The patent creates a copy of the file hash value and stores it on the blockchain instead of storing the original large file. This copying approach allows for efficient verification of file integrity without the need to store the actual file data on the blockchain.

Inventive Principle:

Principle #26Copying

2Quantity of substance

If huge file data is split and written into multiple blocks on the blockchain, then data storage is achieved, but computing resources are wasted leading to high cost

Engineering Contradiction:

Improvedata storage capacityVSAvoidcomputing resource efficiency

Core Design Contradiction:

Quantity of substanceVSProductivity

Solution Approach 1:

The patent extracts only the essential hash value of the file from the large file data and stores it on the blockchain, rather than storing the entire file. This extraction approach maintains data integrity verification capability while dramatically reducing storage requirements on the blockchain.

Inventive Principle:

Principle #2Taking out (Extraction)

Solution Approach 2:

The patent creates a copy of the file hash value and stores it on the blockchain instead of storing the original large file. This copying approach allows for efficient verification of file integrity without the need to store the actual file data on the blockchain.

Inventive Principle:

Principle #26Copying

3Loss of energy

If the blockchain stores only hash values of files, then storage costs are reduced, but verification complexity increases

Engineering Contradiction:

Improvestorage cost reductionVSAvoidverification complexity

Core Design Contradiction:

Loss of energyVSDevice complexity

Solution Approach 1:

The patent performs preliminary computation by pre-calculating and storing the hash value of the file on the blockchain before any verification is needed. This preliminary action simplifies the verification process later, as users only need to compare the stored hash with the current file hash rather than performing complex verification procedures.

Inventive Principle:

Principle #10Preliminary action

Data Source

PatentEP3739493B1File verification method, file verification system and file verification server

Publication Date: 2023.01.25 ACER INC

Figure 1
Figure 2
Figure 3

AI summary

A file verification method, a file verification system and a file verification server are provided. The file verification method includes the following steps. A tree data structure is established according to a plurality of first hash values of a plurality of first electronic files. A first root hash value of the tree data structure is stored into a block of a blockchain. A verification data including block information of the block, one of the first hash values and at least one non-terminal hash value of the tree data structure is generated for one of the first electronic files. A second electronic file is verified according to the verification data.