UNIQUENESS AND AUDITING OF A DATA RESOURCE THROUGH AN IMMUTABLE RECORD OF TRANSACTIONS IN A HASH HISTORY

• US 20160344737A1
• Filed: 08/07/2016
• Published: 11/24/2016
• Est. Priority Date: 06/30/2014
• Status: Active Grant

• Current Assignee: Vescel LLC
• Original Assignee: Cloudmode LLC
• Inventors: Anton, Dhryl, McFall, Michael
• Granted Patent: US 10,356,094 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/2219 Large Object storage; Management thereof
• CPC Class Codes: G06F 16/2255 Hash tables
• CPC Class Codes: G06F 21/6218 to a system of files or objects, e.g. local or distributed file system or database
• CPC Class Codes: G06F 21/6227 where protection concerns the structure of data, e.g. records, types, queries
• CPC Class Codes: G06F 2221/2101 Auditing as a secondary aspect
• CPC Class Codes: G06F 2221/2149 Restricted operating environment
• CPC Class Codes: H04L 2209/30 Compression, e.g. Merkle-Damgard construction
• CPC Class Codes: H04L 63/0807 using tickets, e.g. Kerberos cryptographic mechanisms or cryptographic arrangements for entity authentication using tickets or tokens H04L9/3213
• CPC Class Codes: H04L 63/0815 providing single-sign-on or federations
• CPC Class Codes: H04L 63/0876 based on the identity of the terminal or configuration, e.g. MAC address, hardware or software configuration or device fingerprint
• CPC Class Codes: H04L 63/10 for controlling access to devices or network resources
• CPC Class Codes: H04L 9/0891 Revocation or update of secret information, e.g. encryption key update or rekeying
• CPC Class Codes: H04L 9/3236 using cryptographic hash functions
• CPC Class Codes: H04L 9/50 using hash chains, e.g. blockchains or hash trees

Abstract

Disclosed is a method, a device, and/or a system of uniqueness and auditing of a data resource through an immutable record of transactions in a hash history. In one embodiment, a method includes maintaining uniqueness of a “data organism” that has a hash history, referred to as a hastory, forming a unique identity based on previous transactions in which the data organism participated. The method may be usable to verify an original of the data organism, control copies, transfer ownership and/or audit the datastore. The hastory includes a set of blocks in a sequential chain, each block including a transaction record. A root hash is unique within the datastore for a given data within each block and a given block order of the sequential chain. A transaction record is deposited as a new block in the sequential and the root hash is re-calculated to evolve identity of the data organism.

Claims

1. A method for maintaining uniqueness of a “

data organism”

within a datastore, the method usable to verify an original of the data organism, control copies of the data organism, and transfer an ownership of the data organism and audit the datastore, the method comprising;

receiving a communication from a first data organism addressed to a second data organism, each of the data organisms participants in a present transaction comprising one or more computing processes,

wherein the each of the data organisms comprising;

(i) a unique identifier whereby a particular data organism is uniquely addressable within the datastore, and

(ii) a contained data that the particular data organism contains;

determining that at least one of the first data organism and the second data organism has a controlled identity within the datastore,

wherein the particular data organism having the controlled identity further comprising;

(iii) a hash history, referred to as a hastory, forming a unique identity of an original instance of the particular data organism having the controlled identity based upon a set of previous transactions in which the original instance participated, the hastory comprising a set of blocks in a sequential chain, each block of the set of blocks including a transaction record of the set of previous transactions, and

(iv) a root hash of the hastory, the root hash computed by a hash function and unique within the datastore for a given data within each of the blocks and a given block order of the sequential chain;

executing the one or more computing processes utilizing the contained data of at least one of the first data organism and the second data organism;

determining that the present transaction is complete when the one or more computing processes terminate;

generating a transaction record of the present transaction;

depositing the transaction record of the present transaction as a new block in the sequential chain of blocks of the hastory of at least one of the first data organism and the second data organism having the controlled identity; and

re-calculating the root hash of the hastory with the hash function, the hash function using inputs comprising the new block of the hastory of the particular data organism, to evolve the controlled identity of at least one of the first data organism and the second data organism.

2. The method of claim 1, further comprising:

extracting the one or more computing processes of the present transaction from at least one of the contained data of the first data organism and the contained data of the second data organism,

wherein the one or more computing processes are defined in a Turing-complete language.

3. The method of claim 1, further comprising:

resolving an identity claim of the first data organism and the second data organism as one of the one or more computing processes by determining that the first data organism and the second data organism both include an instance of the transaction record that is identical within the set of blocks of each of the first data organism and the set of blocks of the second data organism.

4. The method of claim 1, wherein the first data organism is at least one of a user profile, a device profile and an application profile.

5. The method of claim 1,

wherein the first data organism comprising the one or more computing processes to control utilization of a protected resource of a data node referenced by the first data organism, and

wherein the second data organism is at least one of a user profile requesting authorization to utilize the protected resource of the data node and a device profile requesting authorization to utilize the protected resource of the data node.

6. The method of claim 1,

wherein the first data organism is a first node comprising a Turing-complete language specifying at least one of the one or more computing processes, and

wherein the second data organism is a second node that includes data updated as a result of the transaction between the first node and the second node.

7. The method of claim 1, wherein the hastory of the original instance of the particular data organism is stored as any one of a Merkle tree, a hash chain, and a hash list.

8. The method of claim 1, wherein the one or more computing processes that utilize as a subject matter of the present transaction the contained data of at least one of the first data organism and the second data organism

9. A method for maintaining uniqueness of a “

data organism”

within a datastore during a transaction that is a controlled copying of the data organism, the method comprising;

specifying an original data organism to be a subject matter of the controlled copying, the original data organism comprising;

(i) a unique identifier whereby the original data organism is uniquely addressable within the datastore,

(ii) a contained data that the original data organism contains,

(iii) a hash history, referred to as a hastory, forming an identity of the original data organism based upon a set of previous transactions in which the original data organism participated, the hastory comprising a set of blocks in a sequential chain, each block of the set of blocks including a transaction record of each of the set of previous transactions, and

(iv) a root hash of the hastory, the root hash computed by a hash function and unique within the datastore for a given data within each of the blocks and a given block order of the sequential chain;

determining that the original data organism is a controlled identity within the datastore;

generating a transaction record of the transaction of the controlled copying of the original data organism;

copying the contained data of the original data organism into a copied data organism; and

depositing the transaction record in the hastory of the original data organism as a new block in the sequential chain of the hastory of the original data organism.

10. The method of claim 9, further comprising:

re-calculating the hash value of the hastory of the original data organism based upon the new block, to evolve the identity of the original data organism;

11. The method of claim 10, further comprising:

depositing the transaction record of the controlled copying as a genesis block of a hastory of the copied data organism, the genesis block added as a first block of the sequential chain of the hastory of the copied data organism; and

calculating the hash value of the hastory of the copied data organism based upon the genesis block, to initiate an identity of the copied data organism and distinguish the original data organism from the copied data organism.

12. The method of claim 9, further comprising:

assigning a new unique identifier to the copied data organism.

13. The method of claim 12, wherein the original data organism comprising within the contained data of the original data organism is a primitive data that is at least one of a document, a file, a media, and a cryptographic currency.

14. The method of claim 13, wherein the hastory of the original data organism is stored as any one of a Merkle tree, a hash chain, and a hash list.

15. The method of claim 14, further comprising:

resolving an identity claim of the original data organism and the copied data organism by determining that the original data organism and the copied data organism both include an instance of the transaction record that is identical within the set of blocks of each of the original data organism and the set of blocks of the copied data organism.

16. A method for maintaining uniqueness of a “

data organism”

during a transaction that is an ownership transfer of the data organism, the method comprising;

specifying an original data organism to be a subject matter of an ownership transfer, the original data organism comprising;

(i) a unique identifier whereby the original data organism is uniquely addressable within the datastore,

(ii) an ownership designation;

(iii) a contained data that the original data organism contains,

(iv) a hash history, referred to as a hastory, forming an identity of the original data organism based upon a set of previous transactions in which the original data organism participated, the hastory comprising a set of blocks in a sequential chain, each block of the set of blocks including a transaction record of the set of previous transactions, and

(v) a root hash of the hastory, the root hash computed by a hash function and unique within the datastore for a given data within each of the blocks and a given block order of the sequential chain;

determining that the original data organism is a controlled identity within the datastore;

generating a transaction record of the transaction that is the ownership transfer of the original data organism;

at least one of copying the contained data of the data organism into a copied data organism and changing the ownership designation of the original data organism to a new ownership designation;

depositing the transaction record of the ownership transfer as a new block in the sequential chain of the hastory of the original data organism; and

re-calculating the hash value of the hastory of the original data organism based upon the new block, to evolve the identity of the original data organism.

17. The method of claim 16, further comprising:

where the contained data of the original data organism is copied into the copied data organism, at least one of flagging the original data organism as extinct, depositing the transaction record of the ownership transfer as a termination block of the hastory of the original data organism, and erasing the original data organism from the datastore.

18. The method of claim 17, further comprising:

where the contained data of the original data organism is copied into the copied data organism, depositing the transaction record of the ownership transfer as a genesis block of a hastory of the copied data organism, the genesis block added as a first block in the sequential chain of the hastory of the copied data organism.

19. The method of claim 18, further comprising:

where the contained data of the original data organism is copied into the copied data organism, calculating the hash value of the hastory of the copied data organism based upon the genesis block, to initiate an identity of the copied data organism and distinguish the original data organism from the copied data organism.

20. The method of claim 19, further comprising:

assigning a new unique identifier to the copied data organism,

wherein the original data organism comprising within the contained data of the original data organism a primitive data that is at least one of a document, a file, a media, and a cryptographic currency, and

wherein the hastory of the original data organism is stored as any one of a Merkle tree, a hash chain, and a hash list.

21. A system comprising:

a first server to;

store one or more data organisms, wherein each of the data organisms comprising;

(i) a unique identifier whereby a particular data organism of the one or more data organisms is uniquely addressable within the datastore,

(ii) a contained data that the particular data organism contains,

(iii) a hash history, referred to as a hastory, forming a unique identity of the particular data organism having a controlled identity based upon a set of previous transactions in which the particular data organism participated, the hastory comprising a set of blocks in a sequential chain, each block of the set of blocks including a transaction record of each of the set of previous transactions, and

(iv) a root hash of the hastory, the root hash computed by a hash function and unique within the datastore for a given data within each of the blocks and a given block order of the sequential chain,

wherein the hastory of the particular data organism is stored as any one of a Merkle tree, a hash chain, and a hash list,

a second server to;

receive a communication addressed to a first data organism of the one or more data organisms, the communication initiating a present transaction comprising one or more computing processes acting on the data of the first data organism, and

determine that the first data organism has the controlled identity within the datastore.

22. The system of claim 21, further comprising:

the second server to;

generate a transaction record of the present transaction, and

a record runtime environment, to;

deposit the transaction record of the present transaction as a new block in the sequential chain of the hastory of the first data organism having the controlled identity, and

re-calculate the root hash of the hash function based upon the new block of the hastory to evolve the controlled identity of the first data organism having the controlled identity.

23. The system of claim 22, wherein the communication addressed to the first data organism is addressed from a second data organism and the present transaction is a use interaction in which the second data organism utilizes the contained data of the first data organism.

24. The system of claim 22, wherein the present transaction is a controlled copying of the first data organism, and the system further comprising:

the first server, to;

deposit the transaction record of the controlled copying as a genesis block of a hastory of the copied data organism, the genesis block added as a first block of the sequential chain of the hastory of the copied data organism, and

calculate the root hash of the hastory of the copied data organism based upon the genesis block, to initiate an identity of the copied data organism and distinguish the original data organism from the copied data organism.

25. The system of claim 22, wherein the present transaction is an ownership transfer of the first data organism, the system and further comprising:

the second server, to;

generate a transaction record of the transaction that is the ownership transfer of the first data organism;

at least one of copy the contained data of the first data organism into a copied data organism and change the ownership designation of the first data organism to a new ownership designation;

deposit the transaction record of the ownership transfer as a new block in the sequential chain of the hastory of the first data organism; and

re-calculate the root hash of the hastory of the first data organism based upon the new block, to evolve the identity of the first data organism.