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
Composability
Composability refers to the ability to combine different components of a software stack.
Token Generation Event (TGE)
An event in which new tokens (ussually on a smart contract platform) are created and distributed to the public.
Buy the F***in Dip (BTFD)
An encouraging rally by asset/cryptocurrency supporters to buy during a price decline
Proof of Work (PoW)
A consensus algorithm in which a block is validated via mathematical hashing
Hungry for more knowledge?
Back to Glossary or Subscribe to our newsletter.