Directed Acyclic Graph (DAG)
By | 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
Pump and Dump Scheme
A market manipulation method to drive up the price of an asset before profiting by driving it back down.
Block Explorer
Application or websites which display information such as status of transactions or data contained in a block of a given public blockchain network.
Composability
Composability refers to the ability to combine different components of a software stack.
Salt (cryptography)
In cryptography, a salt is the additional random input that is added to password or passphrase to make the password hash unique. It prevents from the hashed output password to be cracked so easily by the hacker.
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
