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
Encryption
In cryptography, encryption is a process of encoding information the original form of information called plaintext via an algorithm called cipher. The encrypted message is now called ciphertext. Only authorized parties can decipher the ciphertext and convert back it to the original plaintext.
Distributed Denial of Service (DDoS) Attack
A common cyber-attack tactic where a perpetrator diverts large amounts of traffic towards a particular network or service in an effort to disrupt normal services.
Cold Wallet
Wallets that are offline and require physical access to certain devices (eg. hardware wallet, paper wallets)
Zero Knowledge Proof
Cryptographic proof for 2 parties to verify a value without revealing what the value is.
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
Ethereum Mainnet
Base Mainnet
BNB Smart Chain
Arbitrum
Avalanche
Fantom
Flare
Gnosis
Linea
Optimism
Polygon
Polygon zkEVM
Scroll
Stellar
Story
Syscoin
Telos
X Layer
Xai
