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

Hard cap
The maximum amount that an ICO will be raising.
Proof-of-Authority (PoA)
A consensus algorithm that asigns block validation queue based on identity and reputation.
MicroBitcoin (uBTC)
One millionth of a bitcoin or 0.000001 of a bitcoin. Microbitcoin is the abbreviation of uBTC and often misunderstood as the fork of Bitcoin.
Liquid Proof of Stake (LPoS)
A proof of stake consensus mechanism by Tezos that slightly differs from Delegated Proof of Stake.
Hungry for more knowledge?
Back to Glossary or Subscribe to our newsletter.
coingecko (thumbnail mini)
Continue in app
Track prices in real-time
Open App
coingecko (thumbnail mini)
Continue in app
Track prices in real-time
Open App