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
All-Time-Low (ATL)
The lowest point (in price, in market capitalization) that a cryptocurrency has been in history.
Distributed Denial of Service (DDoS) Attack
A common cyber-attack tactic where a perpetrator diverts large amounts of traffic towards a particular network or service in an effort to disrupt normal services.
Whitepaper
An introductory paper to consicely explain an issue and a possible solution on the issue.
Pump and Dump Scheme
A market manipulation method to drive up the price of an asset before profiting by driving it back down.
Hungry for more knowledge?
Back to Glossary or Subscribe to our newsletter.