Holochain Glossary


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

Page: (Previous)   1  2  3  4  5  6  7  8  (Next)
  ALL

H

Holochain ID

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.

Holochain network

A holochain network is a validating distributed hash table (DHT). Every node enforces validation rules on DHT data against the signed chains where the data originated. A holochain network collectively achieves similar security and data distribution to a blockchain system. Holochain networks are designed very differently to blockchains and are more scalable, using cheaper commodity devices to participate in.

I

Immune System

Flags potentially malicious data and users (which violate validation rules) and provides mechanisms to ensure security and reliability.

L

Link Base

The hash of the primary resource the link relationship points from.

Link Tag

A string defining the type of relationship, and how it should be looked up in the future

Link Target

The hash of the secondary resource the link relationship points to.

Links

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:
  • Base: Provide a hash for the primary resource that you want to define a relation to
  • Tag: Provide a string that defines the relationship, and which defines how it should be looked up in the future
  • Link: Provide a hash for the secondary resource that you want to associate with the Base


Local Store

(see source chain)

M

Merkle Proof

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).

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).


Page: (Previous)   1  2  3  4  5  6  7  8  (Next)
  ALL