• ↑↓ pour naviguer
  • ↵ pour ouvrir
  • ⟶ pour sélectionner
  • ⌘ ⌥ ↵ pour ouvrir dans un panneau
  • esc pour rejeter
⌘ '
raccourcis clavier
Search

Merkle DAG

It is a directed acyclic graph where each node is a version of the content and edges represents the change (diffs) Each node has an identifier which is the results of hashing the content ...

  • Étiquette

    • publié à

    • modifié à

    • durée

      1 min de lecture (68 words)

    • source

      llms.txt

    It is a directed acyclic graph where each node is a version of the content and edges represents the change (diffs)

    Each node has an identifier which is the results of hashing the content.

    Merkle DAG nodes are immutable and content-addressable. Any changes in the node would alter its identifier thus affect all ascendants, which create a different DAG.

    Examples of the DAG in action:

    Vous pourriez aimer ce qui suit

  • aesthetic value
  • Chaos is intuitive yet disheveled.
  • bags
  • sparse autoencoder
  • Orwellian
  • PJRT
  • displacement
    • Content-addressable storage
    Content-addressed storage is a mechanism to store information such that it can be retrieved based on its content, not name or location. If you have a book, say “Control Systems Engineer by N.S.Nise, with ISBN: 978-1-119-47422-7”, you can find the book anywhere, including its information and content.
    cryptography
    functions. See also Merkle DAG.
    Graphs
    See also slides Node as information and edges as relationship between data Directed acyclic graph (DAG) Application: Merkle DAG undirected. (\mathcal{N}, \mathcal{E}) \mathcal{N}: set of vertices \mathcal{E}: set of undirected edges: \mathcal{E} \subseteq \mathcal{N} \times \mathcal{N} path is a sequence of nodes and edges connect two nodes.