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
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).
(in the DHT) Our DHT allows people to store data (which gets hashed and then stored at the address that is the hash of the data), as well as store metadata about that the data at that hash, such as who has verified it, or what data it links to.
The idea that stored data only increases, never decreases. This means all data points are kept then aggregated (e.g. using a `max` function) rather than updated in place. In distributed systems, it is very hard to synchronize the removal of data, so we keep a record of the existence of the data, and mark it retracted (or expired, or flagged as invalid). A retraction is not a deletion of the original data but an addition of new data that asserts the old data is outdated.
A transaction which involves multiple different agents, and must be countersigned by all parties to each of their source chains before propagation on the shared DHT.