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
Degen
Cryptotrading without Due Diligence and research - basically gambling
UTC Time
"Universal Time Coordinated", can be used interchangably with Greenwich Mean Time (GMT).
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.
Central Ledger
Central data repository of a company or bank
Hungry for more knowledge?
Back to Glossary or Subscribe to our newsletter.