Browse the glossary using this index
Special | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | ALL
The hash identifying and allowing access to a holochain network. This is the hash of the holochain's DNA (application code and data schemas) combined with unique identifying information about the group using this DNA.
Flags potentially malicious data and users (which violate validation rules) and provides mechanisms to ensure security and reliability.
The hash of the primary resource the link relationship points from.
A string defining the type of relationship, and how it should be looked up in the future
The hash of the secondary resource the link relationship points to.
A links entry committed to a chain as a list of links. Directed relations convert a sparse hash space/storage into a graph. A link is a directed reference between two hash addresses. There are three parts to each link:
(see source chain)
Mathematical proof to show that any small part of data is part of a much larger set of data and has not been tampered with. The proof does not require access to the entire large data set to work. The proof relies on a data structure called a Merkle Tree. (see Merkle Tree).
A hash tree that allows efficient and secure verification of the contents of large data structures. Something like a blockchain combined with a binary search. e.g. A user of a Merkle tree with a publicly known and trusted root can ask for a Merkle Proof to verify any value in the tree is correct. (see Merkle Proof).