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
Moon
"Moon" or "To the moon" is a crypto slang that describes an exclamation when the cryptocurrencies prices are rising and when it hit the peak, the coin is said to be "mooning".
ASIC Resistant
A term used to describe cryptocurrency proof-of-work protocols that are resistant to Application-Specific Integrated Circuit (ASIC), by packing in various parameters that make it difficult for ASICs to have a competitive edge against consumer hardwares.
Dusting Attack
A new form of malicious activity in which hackers and scammers attempt to undermine the privacy of cryptocurrency users by sending little amounts of money to their wallets.
Validator
A block-signing participant of a Proof of Stake blockchain network, whom have significant tokens staked on the network.
Hungry for more knowledge?
Back to Glossary or Subscribe to our newsletter.