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
Venture Capital
capital (funds) that is invested in a company that needs a substantial pool of funds to initiate.
cc0 NFT
A cc0 NFT is a piece of digital content where the IP rights have been relinquished.
Ring Signature
A type of digital signature performed in a group where it becomes impossible to determine which member's key in the group were used for the digital signature.
Ponzi Scheme
A Ponzi scheme is also referred to as pyramid scheme, and typically takes the form of an investment scheme which pays existing investors with funds collected from new investors.
Hungry for more knowledge?
Back to Glossary or Subscribe to our newsletter.