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.

Share this with a friend!

Related Terms

Block Reward
One of the mechanisms built into a blockchain to incentivize validators
Satoshi
A unit measure for the smallest divisible unit of a bitcoin. 1 bitcoin is equal to 100 Million Satoshi.
Difficulty
A relative measure on how difficult it is to correctly guess a new block
Golden Cross
It is a bullish signal in technical candlestick pattern by comparing two lines of short-term moving average and long-term average. It is a golden cross when the short term moving average broke its long-term moving average.
Hungry for more knowledge?
Back to Glossary or Subscribe to our newsletter.
coingecko (thumbnail mini)
CoinGecko for iOS
coingecko (thumbnail mini)
CoinGecko for Android