Data Verification Methods And Systems Using A Hash Tree, Such As A Time-Centric Merkle Hash Tree

摘要

Systems and methods described herein generally relate to storing and verifying data. In some embodiments, reference levels are generated according to time intervals, where the first reference level comprises a predetermined number of the time intervals, and where each of the time intervals of the remaining reference levels is comprised of a predetermined number of the time intervals of a previous reference level. Hashes of data can be created at the first reference level by performing a hashing function on the data in a time-sequenced manner. First reference level time interval hashes may be generated by performing the hashing function on the hashes of the data at each of the time intervals of the first reference level. Hashes for remaining reference level time intervals can be generated by performing the hashing function on the hashes of each of the time intervals of the previous reference level.

主权项

1. A computerized method comprising:
receiving data items during first reference level segments of a first reference level; performing a hashing function on each of the data items with a corresponding timestamp; generating a first reference level segment hash for each of the first reference level segments by performing a second hashing function on the hashes of the data items in each of the first reference level segments according to their respective timestamps; and generating a second reference level segment hash for each of multiple second reference level segments, wherein the each of the multiple second reference level segments is comprised of a predetermined number of the first reference level segments, wherein the each of the multiple second reference level segment hashes are generated by performing a third hashing function on the predetermined number of the first reference level segment hashes.