# US 12,003,647 B2 · Reduced-step blockchain verification of media file

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 12,003,647 B2
- Document ID: US12003647B2
- Status: Granted
- Kind: B2
- Application number: 17/976,834
- Filed: 2022-10-30
- Published: 2023-02-16
- Granted: 2024-06-04
- Earliest claimed: 2019-05-29
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Praveen Jayachandran
- Web page: https://patentgrep.com/patent/US12003647B2

## CPC

- H04L 9/3239: {involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD}
- G06N 20/00: Machine learning
- H04L 9/3247: {involving digital signatures}
- H04L 9/50: {using hash chains, e.g. blockchains or hash trees}
- H04L 2209/56: Financial cryptography, e.g. electronic payment or e-cash
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

An example operation may include one or more of storing a full-step hash of a data file and a reduced-step hash of the data file within a data block of a hash-linked chain of blocks of a blockchain, receiving a request from a client application to verify the data file, determining whether to provide the full-step hash of the data file or the reduced-step hash of the data file based on the request, and in response to determining to provide the reduced-hash, transmitting the reduced-step hash of the data file to the client application.

## Claims

### Claim 1

A computing system comprising:
a network interface configured to receive a hashed data file from a node, where data of the hashed data file is previously stored within a hash-linked chain of blocks on a blockchain ledger; and
a hardware processor configured to
detect whether the hashed data file has been hashed via a full-step hash or a reduced-step hash,
in response to a detection that the hashed data file is hashed via the reduced-step hash, determine whether the hashed data file has been tampered with through an approximate hash verification of the hashed data file, and
execute a blockchain consensus process with a blockchain peer node to verify the determination, wherein the blockchain consensus is executed based on the approximate hash verification of the hashed data file and a full hash verification of the hashed data file generated by the blockchain peer node.

### Claim 2 (depends on 1)

The computing system of claim 1, wherein the hashed data file comprises a hash of one or more of an audio file, a video file, a document, an image, and a multi-media file.

### Claim 3 (depends on 1)

The computing system of claim 1, wherein the full-step hash comprises repeated performance of a function on the data file a first predetermined number of times.

### Claim 4 (depends on 3)

The computing system of claim 3, wherein the reduced-step hash comprises repeated performance of the function on the data file a second predetermined number of times that is less than the first predetermined number of times.

### Claim 5 (depends on 1)

The computing system of claim 1, wherein a length of a data value created by the reduced-step hash applied to the data file is equal to a length of a data value created by the full-step hash applied to the data file.

### Claim 6 (depends on 1)

The computing system of claim 1, wherein the hardware processor is configured to generate a reduced-step hash of a local copy of the data file.

### Claim 7 (depends on 6)

The computing system of claim 6, wherein the hardware processor is configured to verify the retrieved hashed data file based on the reduced-step hash of the local copy of the data file.

### Claim 8 (depends on 1)

The computing system of claim 1, wherein the data file comprises a media file that is stored off-chain while a hash result of the hashed data file is stored within a data block among the hash-linked chain of blocks.

### Claim 9

A method comprising:
receiving a hashed data file from a node, where data of the hashed data file is previously stored within a hash-linked chain of blocks on a blockchain ledger;
detecting whether the hashed data file has been hashed using a full-step hash or a reduced-step hash;
in response to a detecting that the hashed data file is hashed using the reduced-step hash, determining whether the hashed data file has been tampered with through an approximate hash verification of the hashed data file; and
executing a blockchain consensus process with a blockchain peer node to verify the determination, wherein the blockchain consensus is executed based on the approximate hash verification of the hashed data file and a full hash verification of the hashed data file generated by the blockchain peer node.

### Claim 10 (depends on 9)

The method of claim 9, wherein the hashed data file comprises a hash of one or more of an audio file, a video file, a document, an image, and a multi-media file.

### Claim 11 (depends on 9)

The method of claim 9, wherein the full-step hash comprises repeated performance of a function on the data file a first predetermined number of times.

### Claim 12 (depends on 11)

The method of claim 11, wherein the reduced-step hash comprises repeated performance of the function on the data file a second predetermined number of times.

### Claim 13 (depends on 12)

The method of claim 12, wherein the second predetermined number of times is less than the first predetermined number of times.

### Claim 14 (depends on 9)

The method of claim 9, wherein a length of a data value created by the reduced-step hash applied to the data file is equal to a length of a data value created by the full-step hash applied to the data file.

### Claim 15 (depends on 9)

The method of claim 9, wherein the determining comprises generating a reduced-step hash of a local copy of the data file.

### Claim 16 (depends on 15)

The method of claim 15, comprising verifying the retrieved hashed data file based on the reduced-step hash of the local copy of the data file.

### Claim 17 (depends on 9)

The method of claim 9, wherein the data file comprises a media file that is stored off-chain while a hash result of the hashed data file is stored within a data block among the hash-linked chain of blocks.

### Claim 18

A computer readable medium comprising instructions, that when read by a processing device, cause the processing device to perform:
receiving a hashed data file from a node, where data of the hashed data file is previously stored within a hash-linked chain of blocks on a blockchain ledger;
detecting whether the hashed data file has been hashed using a full-step hash or a reduced-step hash; and
in response to a detecting that the hashed data file is hashed using the reduced-step hash, determining whether the hashed data file has been tampered with through an approximate hash verification of the hashed data file; and
executing a blockchain consensus process with a blockchain peer node to verify the determination, wherein the blockchain consensus is executed based on the approximate hash verification of the hashed data file and a full hash verification of the hashed data file generated by the blockchain peer node.

### Claim 19 (depends on 18)

The computer readable medium of claim 18, wherein the hashed data file comprises a hash of one or more of an audio file, a video file, a document, an image, and a multi-media file.

### Claim 20 (depends on 18)

The computer readable medium of claim 18, wherein the full-step hash comprises repeated performance of a function on the data file a first predetermined number of times.

### Claim 21 (depends on 20)

The computer readable medium of claim 20, wherein the reduced-step hash comprises repeated performance of the function on the data file a second predetermined number of times.

### Claim 22 (depends on 21)

The computer readable medium of claim 21, wherein the second predetermined number of times is less than the first predetermined number of times.

### Claim 23 (depends on 18)

The computer readable medium of claim 18, wherein a length of a data value created by the reduced-step hash applied to the data file is equal to a length of a data value created by the full-step hash applied to the data file.

### Claim 24 (depends on 18)

The computer readable medium of claim 18, wherein the determining comprises generating a reduced-step hash of a local copy of the data file.

### Claim 25 (depends on 24)

The computer readable medium of claim 24, wherein the processing device is further configured to perform verifying the retrieved hashed data file based on the reduced-step hash of the local copy of the data file.
