About: Hash calendar

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Hash calendar Goto Sponge NotDistinct Permalink

An Entity of Type : dbo:Building, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FHash_calendar&invfp=IFP_OFF&sas=SAME_AS_OFF

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.

Attributes	Values
rdf:type	yago:WikicatCryptographicHashFunctions yago:Abstraction100002137 yago:Function113783816 yago:MathematicalRelation113783581 yago:Relation100031921 building
rdfs:label	Hash calendar (en)
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)
foaf:depiction
dcterms:subject	Hashing Error detection and correction Trees (data structures) Cryptographic hash functions
Wikipage page ID	38063451 (xsd:integer)
Wikipage revision ID	1106165622 (xsd:integer)
Link from a Wikipage to another Wikipage	Merkle tree Byzantine generals Cryptographic hash function Cryptographic hash functions Provably secure cryptographic hash function Hash list Ahto Buldas Hashing Hash chain Hash table Error detection and correction Trees (data structures) Cryptographic hash functions RSA Security Linked Timestamping
Link from a Wikipage to an external page	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
sameAs	Hash calendar Hash calendar Hash calendar Hash calendar Hash calendar
dbp:wikiPageUsesTemplate	dbt:CS-Trees dbt:US_patent dbt:Cryptography_navbox
thumbnail	wiki-commons:Special:FilePath/A_hash_tree_with_8_leaf_nodes_and_a_hash_calendar_after_7_seconds.jpg?width=300
has 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)
gold:hypernym	Structure
prov:wasDerivedFrom	wikipedia-en:Hash_calendar?oldid=1106165622&ns=0
page length (characters) of wiki page	5141 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Hash_calendar
is foaf:primaryTopic of	wikipedia-en:Hash_calendar

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 56 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software