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
opML (Optimistic Machine Learning)
opML (Optimistic Machine Learning) employs an optimistic verification mechanism and is able to handle large-scale machine learning models with billions of parameters efficiently, using fraud proofs that verify the ML computation.
Segregated Witness (SegWit)
A soft fork implementation to change the Bitcoin Protocol's transaction format to address Bitcoin's scalability issues whilst introducing new features.
Ethereum Virtual Machine (EVM)
Ethereum Virtual Machine (EVM) is the environment in which all smart contracts are executed.
Zero Confirmation Transaction
Another name for "unconfirmed transaction"
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
