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
Proof of Stake (PoS)
A consensus algorthm that assigns block validation queue based on the coins/token locked in by the validator.
Altcoin
Coins althernative to Bitcoin
KYC (Know Your Customer)
KYC stands for "Know Your Customer", a process for business entities are required to verify its clients and assessing them.
Oracles
In the context of crypto, oracles refers to services which verify real-world and provide data to blockchains/smart contracts.
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
