# US 2021/0279205 A1 · Log-structured merge-tree with blockchain properties

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

- Number: US 2021/0279205 A1
- Document ID: US20210279205A1
- Status: Published application
- Kind: A1
- Application number: 16/809,697
- Filed: 2020-03-05
- Published: 2021-09-09
- Earliest claimed: 2020-03-05
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Jeronimo Irazabal
- Web page: https://patentgrep.com/patent/US20210279205A1

## CPC

- G06F 16/137: {Hash-based (content-based indexing of textual data G06F16/31)}
- G06F 21/64: Protecting data integrity, e.g. using checksums, certificates or signatures
- G06F 16/152: {using file content signatures, e.g. hash values}
- G06F 16/2246: {Trees, e.g. B+trees}
- G06F 16/9024: {Graphs; Linked lists (G06F16/9027 takes precedence)}
- G06F 21/602: {Providing cryptographic facilities or services}
- G06F 21/6218: {to a system of files or objects, e.g. local or distributed file system or database}
- H04L 9/3239: {involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD}
- H04L 9/50: {using hash chains, e.g. blockchains or hash trees}
- G06F 21/107: {License processing; Key processing}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

An example operation may include one or more of storing data within a temporary memory structure, transferring the stored data from the temporary memory structure into a set of files of a log-structured merge-tree, generating a respective sequence of hashes within each file of the set of files, where the respective sequence of hashes provides proof of a sequential order in which data values are stored within the respective file, and storing the sequences of hashes in storage.

## Claims

### Claim 1

An apparatus comprising:
a storage configured to store data within a temporary memory structure; and
a processor configured to transfer the stored data from the temporary memory structure into a set of files of a log-structured merge-tree, generate a respective sequence of hashes within each file of the set of files, where the respective sequence of hashes provides proof of a sequential order in which data values are stored within the respective file, and store the sequences of hashes in the storage.

### Claim 2 (depends on 1)

The apparatus of claim 1, wherein each respective file from the set of files stores a sequence of key-value pairs and a sequence of hashes generated therefrom.

### Claim 3 (depends on 1)

The apparatus of claim 1, wherein the set of files comprises a first file and a second file received in sequential order, respectively, and the processor is configured to store a hash value generated based on a hash tree of the first file as a previous hash value within the second file to cryptographically link the first and second files.

### Claim 4 (depends on 1)

The apparatus of claim 1, wherein the processor is further configured to merge a first file and a second file to create a merged file, wherein the processor merges a first sequence of hashes of the first file and a second sequence of hashes of the second file.

### Claim 5 (depends on 4)

The apparatus of claim 4, wherein the processor is configured to remove a prior entry of a key value from the first file based on an updated entry of the key value in the second file to create the merged file.

### Claim 6 (depends on 4)

The apparatus of claim 4, wherein the processor is configured to remove a hash value within the first sequence of hashes of the first file and add an intermediate hash value generated from a hash tree of the first sequence of hashes.

### Claim 7 (depends on 4)

The apparatus of claim 4, wherein the processor is configured to remove a hash value within the first sequence of hashes of the first file and add a cryptographic proof generated based on a root hash value from a hash tree of the first sequence of hashes and a previous hash value of the second file.

### Claim 8 (depends on 4)

The apparatus of claim 4, wherein the processor is further configured to receive a data proof request for the merged file, and transmit a hash value based on the first and second sequences of hashes of the first and second files.

### Claim 9

A method comprising:
storing data within a temporary memory structure;
transferring the stored data from the temporary memory structure into a set of files of a log-structured merge-tree;
generating a respective sequence of hashes within each file of the set of files, where the respective sequence of hashes provides proof of a sequential order in which data values are stored within the respective file; and
storing the sequences of hashes in storage.

### Claim 10 (depends on 9)

The method of claim 9, wherein each respective file from the set of files stores a sequence of key-value pairs and a sequence of hashes generated therefrom.

### Claim 11 (depends on 9)

The method of claim 9, wherein the set of files comprises a first file and a second file received in sequential order, respectively, and the method further comprises storing a hash value generated based on a hash tree of the first file as a previous hash value within the second file to cryptographically link the first and second files.

### Claim 12 (depends on 9)

The method of claim 9, wherein the method further comprises merging a first file and a second file to create a merged file, wherein the merging merges a first sequence of hashes of the first file and a second sequence of hashes of the second file.

### Claim 13 (depends on 12)

The method of claim 12, wherein the merging comprises removing a prior entry of a key value from the first file based on an updated entry of the key value in the second file to create the merged file.

### Claim 14 (depends on 12)

The method of claim 12, wherein the merging comprises removing a hash value within the first sequence of hashes of the first file and adding an intermediate hash value generated from a hash tree of the first sequence of hashes.

### Claim 15 (depends on 12)

The method of claim 12, wherein the merging comprises removing a hash value within the first sequence of hashes of the first file and adding a cryptographic proof generated based on a root hash value from a hash tree of the first sequence of hashes and a previous hash value of the second file.

### Claim 16 (depends on 12)

The method of claim 12, further comprising receiving a data proof request for the merged file, and transmitting a hash value based on the first and second sequences of hashes of the first and second files.

### Claim 17

A non-transitory computer readable medium comprising instructions, that when read by a processor, cause the processor to perform a method comprising:
storing data within a temporary memory structure;
transferring the stored data from the temporary memory structure into a set of files of a log-structured merge-tree;
generating a respective sequence of hashes within each file of the set of files, where the respective sequence of hashes provides proof of a sequential order in which data values are stored within the respective file; and
storing the sequences of hashes in storage.

### Claim 18 (depends on 17)

The non-transitory computer readable medium of claim 17, wherein each respective file from the set of files stores a sequence of key-value pairs and a sequence of hashes generated therefrom.

### Claim 19 (depends on 17)

The non-transitory computer readable medium of claim 17, wherein the set of files comprises a first file and a second file received in sequential order, respectively, and the method further comprises storing a hash value generated based on a hash tree of the first file as a previous hash value within the second file to cryptographically link the first and second files.

### Claim 20 (depends on 17)

The non-transitory computer readable medium of claim 17, wherein the method further comprises merging a first file and a second file to create a merged file, wherein the merging merges a first sequence of hashes of the first file and a second sequence of hashes of the second file.
