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
Validator
A block-signing participant of a Proof of Stake blockchain network, whom have significant tokens staked on the network.
gm Good Morning
gm is the short form writing for good morning. Used extensively within the crypto community where individuals greet each other casually. On the other hand, good night (gn) is used when people sign off for the day.
Side Chain
A separate blockchain ledger that runs parallel with the primary blockchain.
Securities and Exchange Commission (SEC)
U.S. Securities and Exchange Commission, an independant agency of the US Federal government which oversees federal securities laws, proposing securities rules, and regulating the securities industry.
Hungry for more knowledge?
Back to Glossary or Subscribe to our newsletter.