About: Hash calendar

An Entity of Type: building, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

A hash calendar is a data structure that is used to measure the passage of time by adding hash values to an append-only database with one hash value per elapsed second. It can be thought of special kind of Merkle or hash tree, with the property that at any given moment, the tree contains a leaf node for each second since 1970‑01‑01 00:00:00 UTC.

Property	Value
dbo:abstract	A hash calendar is a data structure that is used to measure the passage of time by adding hash values to an append-only database with one hash value per elapsed second. It can be thought of special kind of Merkle or hash tree, with the property that at any given moment, the tree contains a leaf node for each second since 1970‑01‑01 00:00:00 UTC. The leaves are numbered left to right starting from zero and new leaves are always added to the right. By periodically publishing the root of the hash-tree is it possible to use a hash calendar as the basis of a hash-linking based digital timestamping scheme. (en)
dbo:thumbnail	wiki-commons:Special:FilePath/A_hash_tree_with_8_le...alendar_after_7_seconds.jpg?width=300
dbo:wikiPageExternalLink	https://web.archive.org/web/20061206235144/http:/www.rsasecurity.com/rsalabs/node.asp%3Fid=2003 https://web.archive.org/web/20110625054822/http:/csrc.nist.gov/groups/ST/toolkit/secure_hashing.html
dbo:wikiPageID	38063451 (xsd:integer)
dbo:wikiPageLength	5141 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID	1106165622 (xsd:integer)
dbo:wikiPageWikiLink	dbr:Merkle_tree dbr:Byzantine_generals dbr:Cryptographic_hash_function dbr:Cryptographic_hash_functions dbr:Provably_secure_cryptographic_hash_function dbr:Hash_list dbr:Ahto_Buldas dbc:Hashing dbr:Hash_chain dbr:Hash_table dbc:Error_detection_and_correction dbc:Trees_(data_structures) dbc:Cryptographic_hash_functions dbr:RSA_Security dbr:Linked_Timestamping dbr:File:A_hash_tree_with_8_leaf_nodes_and_a_hash_calendar_after_7_seconds.jpg dbr:File:Compact_hash_calendar_with_11_10_=_1011_2_leaves.jpg dbr:File:Hash_calendar_after_31_seconds.jpg dbr:File:Sparse_hash_calendar_with_11_10_=_1011_2_leaves.jpg
dbp:wikiPageUsesTemplate	dbt:CS-Trees dbt:US_patent dbt:Cryptography_navbox
dcterms:subject	dbc:Hashing dbc:Error_detection_and_correction dbc:Trees_(data_structures) dbc:Cryptographic_hash_functions
gold:hypernym	dbr:Structure
rdf:type	yago:WikicatCryptographicHashFunctions yago:Abstraction100002137 yago:Function113783816 yago:MathematicalRelation113783581 yago:Relation100031921 dbo:Building
rdfs:comment	A hash calendar is a data structure that is used to measure the passage of time by adding hash values to an append-only database with one hash value per elapsed second. It can be thought of special kind of Merkle or hash tree, with the property that at any given moment, the tree contains a leaf node for each second since 1970‑01‑01 00:00:00 UTC. (en)
rdfs:label	Hash calendar (en)
owl:sameAs	freebase:Hash calendar yago-res:Hash calendar wikidata:Hash calendar dbpedia-sr:Hash calendar https://global.dbpedia.org/id/4kVge
prov:wasDerivedFrom	wikipedia-en:Hash_calendar?oldid=1106165622&ns=0
foaf:depiction	wiki-commons:Special:FilePath/1011_2_leaves.jpg wiki-commons:Special:FilePath/A_hash_tree_with_8_le...d_a_hash_calendar_after_7_seconds.jpg wiki-commons:Special:FilePath/Hash_calendar_after_31_seconds.jpg
foaf:isPrimaryTopicOf	wikipedia-en:Hash_calendar
is foaf:primaryTopic of	wikipedia-en:Hash_calendar