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
Masternodes
Computers that are responsible for processing blockchain transactions and receive a reward when a block is mined.
Burned Tokens
Tokens which have been sent to addresses whose private key are not known, effectively becoming unusable.
Hard Fork
It is a permanent divergence of a blockchain into two blockhains. The original blockchain does not recognize the new version.
Hey Hey Hey
A term made popular by Carlos Matos who was the spokesperson for the Bitconnect Ponzi. He used it frequently during Bitconnect events to rile up the crowd.
Hungry for more knowledge?
Back to Glossary or Subscribe to our newsletter.
