Layout-independent cryptographic stamp of a distributed dataset

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, wherein a plurality of threads is created to process each slice; 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.

2. 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.

3. The method of claim 1 wherein creating the hash of each slice of the distributed data set comprises:

creating assigning a thread from the plurality of threads to process each a slice.

4. The method of claim 1 further comprising:

creating in parallel, by the plurality of threads, hashes for a plurality of sub-volumes of each slice.

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

6. 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.

7. 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.

8. 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.

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, wherein a plurality of threads is created to process each slice; 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.

10. 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.

11. 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 assigning a thread from the plurality of threads to process each a slice.

12. The system of claim 9 further configured for:

creating in parallel, by the plurality of threads, hashes for a plurality of sub-volumes of each slice.

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

14. 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.

15. 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.

16. 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.

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, wherein a plurality of threads is created to process each slice; 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.

18. 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.

19. 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.

20. 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.