VERIFIABLE OBJECT STATE DATA TRACKING

1 . A method for auditably tracking data objects, comprising:

in a first data structure ( 1000 ), aggregating inputs by rounds (Round1, Round9, Round15, Z) and, at the end of each corresponding round, computing a highest level value (root1, root9, root15) of the first data structure;

at a position within the first data structure ( 1000 ) corresponding to a respective unique key (Ki) computed for each respective data object, setting as a respective input value an indication of which round during which a state value representing the respective data object was most recently changed;

for each input of the first data structure that is changed during each round, storing in a second data structure ( 1100 ) an indication of during which previous round each respective changed input was most recently changed; and

for each round, computing a representative value of the second data structure and storing the representative value as an input ( 1010 ) in the first data structure;

whereby a change history of each data object may be determined by iteratively examining a state of the first data structure ( 1000 ) backwards in time according to the according to the indications in the second data structure ( 1100 ) corresponding to the respective data object.

2 . The method of claim 1 , further comprising:

determining a respective state value corresponding to at least one tracked characteristic of each data object; and

upon each change of the at least one tracked characteristic and corresponding updated state value for any one of the data objects, storing a representation of the respective state value in the first data structure ( 1000 ) at the position corresponding to the respective key of the data object.

3 . The method of claim 2 , in which the first data structure ( 1000 ) is a first sparse Merkle tree (SMT), said highest level value being a root of the first SMT.

4 . The method of claim 3 , further comprising, for each round, computing and associating with each input that has changed a proof comprising a set of sibling values enabling recomputation through the first SMT from the input to the root.

5 . The method of claim 4 , further comprising inputting the root of the first SMT as an input to a timestamping signature infrastructure.

6 . The method of claim 1 , in which the second data structure ( 1100 ) is a second sparse Merkle tree (SMT) and computing the representative value as a root of the second SMT.

7 . The method of claim 1 , in which the first data structure ( 1000 ) is a skip list.