Directed Acyclic Graph (DAG)

By CoinGecko | Updated on Mar 03, 2020

Directed acyclic graphs refers to a data structure that is built in one single direction, yet branches out and never repeats. Directed = Connections between two points (nodes) have directions such that A -> B is not the same as B -> A. Acyclic = Opposite of cyclic where you’ll end up where you started from after some time. In an acyclic system, you’ll never encounter the same point (node) twice. Graphs = A structure consisting of points (nodes) that are connected. Compared to a regular blockchain data structure which operates in one straight chain, DAG based systems have more breadth as the network is similar to a expanding tree rather than a straight chain.

Related Terms

Proof of Work (PoW)

A consensus algorithm in which a block is validated via mathematical hashing

Market Taker

Participant of the market who buys and sells from currently existing orders

Full Node

Full Nodes are computers that verify the set of rules that are built into the protocols of a given cryptocurrency.

Hash

A hash function is an output code (unique and alphanumeric) that we obtain from an input string,

Interested to stay up-to-date with cryptocurrencies?

Get the latest crypto news, updates, and reports by subscribing to our free newsletter.