Systems and methods for retrieving data from a chain data structure

Patent metadata

Field	Value
Publication number	US-2024405999-A1
Application number	US-202418797946-A
Country	US
Kind code	A1
Filing date	Aug 8, 2024
Priority date	Oct 27, 2021
Publication date	Dec 5, 2024
Grant date	—

Abstract

A secure chain data structure is stored by grouping source data into blocks of data, calculating a hash value of an immediate prior block for each block of said blocks of data and a hash value of a non-immediate prior block for at least some blocks of said blocks of data, associating the hash value or values of each block with each block of said blocks of data, and storing said blocks of data and their associated hash values to form a secure chain data structure. Trust can be provided to blocks in the secure chain data structure by later blocks containing valid hash values of prior blocks including valid ones of the hash values of non-immediate prior blocks.

First claim

What is claimed is:

1 . A method of storing data with a secure chain data structure, the method comprising:
grouping a set of source data into a payload portion of a current block to be stored in the secure chain data structure; obtaining a first hash value of a first preceding block stored in an immediately prior position to the current block in the secure chain data structure; obtaining a second hash value of a second preceding block stored in a non-immediately prior position to the current block in the secure chain data structure; associating the first hash value and the second hash value with the payload portion within the current block; calculating a hash value for the current block; and storing the current block and the hash value for the current block in the secure chain data structure; wherein, following loss or corruption of the first preceding block, at least a portion of the secure chain data structure subsequent to the current block is validatable using the second preceding block in the secure chain data structure and the second hash value present in the current block.

2 . The method of claim 1 , wherein said calculating a hash value comprises calculating a collision-resistant cryptographic hash value.

3 . The method of claim 1 , wherein said second preceding block has a distance from the current block by a number of at least two.

4 . The method of claim 3 , wherein said number is a prime number.

5 . The method of claim 3 , wherein said number is variable.

6 . The method of claim 1 , wherein said storing of the current block and the hash value for the current block in the secure chain data structure comprises storing said current block with its respective said hash value.

7 . The method of claim 6 , wherein said storing said current block and the hash value for the current block in the secure chain data structure comprises storing a pointer to said first preceding block stored in an immediately prior position to the current block in the secure chain data structure.

8 . The method of claim 6 , wherein said storing said current block and the hash value for the current block in the secure chain data structure comprises storing a pointer to said first preceding block stored in an non-immediately prior position to the current block in the secure chain data structure.

9 . The method of claim 1 , wherein said hash value is used as a logical filename in a data storage medium.

10 . The method of claim 1 , further comprising building an index of said blocks of data.

11 . The method of claim 10 , further comprising adding to said index information concerning one or more of:
a sequence of said blocks of data in a direction from earlier to later blocks; identifying when a block is missing; identifying when a block's data fails to be validated by its corresponding hash value; error correction data; instructions for skipping over a missing or corrupted one or ones of said blocks of data.

12 . A system for storing data with a secure chain data structure, the system comprising:
a processing device; and a non-transitory computer-readable medium storing instructions executable by the processing device for causing the system to perform:
grouping a set of source data into a payload portion of a current block to be stored in the secure chain data structure;
obtaining a first hash value of a first preceding block stored in an immediately prior position to the current block in the secure chain data structure;
obtaining a second hash value of a second preceding block stored in a non-immediately prior position to the current block in the secure chain data structure;
associating the first hash value and the second hash value with the payload portion within the current block;
calculating a hash value for the current block; and
storing the current block and the hash value for the current block in the secure chain data structure;
wherein, following loss or corruption of the first preceding block, at least a portion of the secure chain data structure subsequent to the current block is validatable using the second preceding block in the secure chain data structure and the second hash value present in the current block.

13 . The system of claim 12 , wherein said calculating a hash value comprises calculating a collision-resistant cryptographic hash value.

14 . The system of claim 12 , wherein said second preceding block has a distance from the current block by a number of at least two.

15 . The system of claim 14 , wherein said number is a prime number.

16 . The system of claim 14 , wherein said number is variable.

17 . The system of claim 12 , wherein said storing of the current block and the hash value for the current block in the secure chain data structure comprises storing said current block with its respective said hash value.

18 . The system of claim 17 , wherein said storing said current block and the hash value for the current block in the secure chain data structure comprises storing a pointer to said first preceding block stored in an immediately prior position to the current block in the secure chain data structure.

19 . The system of claim 17 , wherein said storing said current block and the hash value for the current block in the secure chain data structure comprises storing a pointer to said first preceding block stored in an non-immediately prior position to the current block in the secure chain data structure.

20 . The system of claim 12 , wherein said hash value is used as a logical filename in a data storage medium.

21 . The system of claim 12 , further comprising building an index of said blocks of data.

22 . The system of claim 21 , further comprising adding to said index information concerning one or more of:
a sequence of said blocks of data in a direction from earlier to later blocks; identifying when a block is missing; identifying when a block's data fails to be validated by its corresponding hash value; error correction data; instructions for skipping over a missing or corrupted one or ones of said blocks of data.

23 . A non-transitory computer-readable storage medium having computer-executable instructions stored thereon that, when executed, cause at least one computer processor to perform the method of claim 1 .

Assignees

• Genetec Inc

Inventors

• Racz Pierre
• Labrecque Vincent
• Lennartz Antoine
• Beaulieu Vincent

Classifications

• H04L9/50

  using hash chains, e.g. blockchains or hash trees · CPC title

• G06F16/2255

  Hash tables · CPC title

• H04L9/3236

  using cryptographic hash functions · CPC title

• H04L9/3239 Primary

  involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD · CPC title