# US 2019/0356474 A1 · Layout-independent cryptographic stamp of a distributed dataset

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

- Number: US 2019/0356474 A1
- Document ID: US20190356474A1
- Status: Published application
- Kind: A1
- Application number: 16/507,395
- Filed: 2019-07-10
- Published: 2019-11-21
- Earliest claimed: 2016-09-29
- Assignees: EMC IP Holding Company LLC
- Applicants: EMC IP Holding Company LLC
- Inventors: David Meiri; Xiangping Chen; William R. Stronge; Felix Shvaiger
- Web page: https://patentgrep.com/patent/US20190356474A1

## CPC

- H04L 9/0643: {Hash functions, e.g. MD5, SHA, HMAC or f9 MAC}
- G06F 12/12: Replacement control
- G06F 12/121: using replacement algorithms
- H04L 9/0894: {Escrow, recovery or storing of secret information, e.g. secret key escrow or cryptographic key storage}
- H04L 9/3297: {involving time stamps, e.g. generation of time stamps}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A system, computer program product, and computer-executable method of providing a layout-independent cryptographic stamp of a distributed data set from a data storage system, the system, computer program product, and computer-executable method comprising receiving a request for a cryptographic stamp of the distributed data set, creating a hash of each slice of the distributed data set, and using each hash from each slice of the distribute data set to create the cryptographic stamp of the distributed data set.

## Claims

### Claim 1

A computer-executable method of providing a layout-independent cryptographic stamp of a distributed data set from a data storage system, the computer-executable method comprising:
receiving a request for a cryptographic stamp of the distributed data set;
creating a hash of each slice of the distributed data set; and
using each hash from each slice of the distribute data set to create the cryptographic stamp of the distributed data set, wherein the cryptographic stamp of the distributed data set is layout-independent of the data storage system.

### Claim 2 (depends on 1)

The method of claim 1 wherein creating the hash of each slice of the distributed data set comprises:
dividing the slice into sub slices;
creating sub slice hashes for each of the sub slices; and
creating the hash for the slice using the sub slice hashes.

### Claim 3 (depends on 1)

The method of claim 1 wherein creating the hash of each slice of the distributed data set comprises:
creating a plurality of threads to process each slice.

### Claim 4 (depends on 3)

The method of claim 3 further comprising:
creating in parallel, by the plurality of threads, hashes for a plurality of sub-volumes of each slice.

### Claim 5 (depends on 1)

The method of claim 1 wherein each slice of the distributed data set is managed by a single processor.

### Claim 6 (depends on 1)

The method of claim 1 wherein creating the hash of each slice of the distributed data set comprises:
creating a hash of a difference between at least two point in time snapshots.

### Claim 7 (depends on 6)

The method of claim 6 wherein creating the hash of the difference comprises:
creating hashes of each of the at least two point in time snapshots; and
comparing the hashes of each of the at least two point in time snapshots.

### Claim 8 (depends on 7)

The method of claim 7 further comprising:
storing a hash of one of the at least two point in time snapshots when a hash of a first snapshot at an address does not equal a hash of a second snapshot at the address.

### Claim 9

A system, comprising:
a data storage system enabled to store a distributed data set; and
computer-executable program logic encoded in memory of one or more computers enabled to provide a layout-independent cryptographic stamp of a distributed data set, wherein the computer-executable program logic is configured for:
receiving a request for a cryptographic stamp of the distributed data set;
creating a hash of each slice of the distributed data set; and
using each hash from each slice of the distribute data set to create the cryptographic stamp of the distributed data set, wherein the cryptographic stamp of the distributed data set is layout-independent of the data storage system.

### Claim 10 (depends on 9)

The system of claim 9 wherein the computer-executable program logic configured for creating the hash of each slice of the distributed data set is further configured for:
dividing the slice into sub slices;
creating sub slice hashes for each of the sub slices; and
creating the hash for the slice using the sub slice hashes.

### Claim 11 (depends on 9)

The system of claim 9 wherein the computer-executable program logic configured for creating the hash of each slice of the distributed data set is further configured for:
creating a plurality of threads to process each slice.

### Claim 12 (depends on 11)

The system of claim 11 further configured for:
creating in parallel, by the plurality of threads, hashes for a plurality of sub-volumes of each slice.

### Claim 13 (depends on 9)

The system of claim 9 wherein each slice of the distributed data set is managed by a single processor.

### Claim 14 (depends on 9)

The system of claim 9 wherein the computer-executable program logic configured for creating the hash of each slice of the distributed data set is further configured for:
creating a hash of a difference between at least two point in time snapshots.

### Claim 15 (depends on 14)

The system of claim 14 wherein the computer-executable program logic configured for creating the hash of the difference is further configured for:
creating hashes of each of the at least two point in time snapshots; and
comparing the hashes of each of the at least two point in time snapshots.

### Claim 16 (depends on 15)

The system of claim 15 further configured for:
storing a hash of one of the at least two point in time snapshots when a hash of a first snapshot at an address does not equal a hash of a second snapshot at the address.

### Claim 17

A computer program product for providing a layout-independent cryptographic stamp of a distributed data set from a data storage system, the computer program product comprising: a non-transitory computer readable medium encoded with computer-executable code, the code configured for the execution of:
receiving a request for a cryptographic stamp of the distributed data set;
creating a hash of each slice of the distributed data set; and
using each hash from each slice of the distribute data set to create the cryptographic stamp of the distributed data set, wherein the cryptographic stamp of the distributed data set is layout-independent of the data storage system.

### Claim 18 (depends on 17)

The computer program product of claim 17, wherein creating the hash of each slice of the distributed data set comprises:
creating a hash of a difference between at least two point in time snapshots.

### Claim 19 (depends on 18)

The computer program product of claim 18 wherein creating the hash of the difference comprises:
creating hashes of each of the at least two point in time snapshots; and
comparing the hashes of each of the at least two point in time snapshots.

### Claim 20 (depends on 19)

The computer program product of claim 19 further comprising:
storing a hash of one of the at least two point in time snapshots when a hash of a first snapshot at an address does not equal a hash of a second snapshot at the address.
