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
zkML (Zero-Knowledge Machine Learning)
Zero-Knowledge Machine Learning (zkML) integrates the principles of zero-knowledge proofs with ML.
Bounty
Public tasks available for anyone for a reward
Seed
A value used to initiate generation of pseudorandom number, ususally a string of 12 commen English words.
Hot Wallet
It is a tool that store your cryptocurrencies and always connected to internet
Interested to stay up-to-date with cryptocurrencies?
Get the latest crypto news, updates, and reports by subscribing to our free newsletter.
Or check it out in the app stores
Arbitrum
Avalanche
Fantom
Flare
Gnosis
Linea
Optimism
Polygon
Polygon zkEVM
Scroll
Stellar
Story
Syscoin
Telos
X Layer
Xai
