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
EIP (Ethereum Improvement Proposal)
Refers to improvement proposals for Ethereum, used to introduce features or any updates on the Ethereum network.
Super Staker
A Qtum Core wallet (full node) providing Proof of Stake for delegated addresses, and keeping a small part of each block reward as their fee for providing the staking services.
Wash Trade
Meaningless back and forth trading between a single party with the aim of inflating trade volume.
Market capitalization (market cap)
In Crypto, market cap is measured by multiplication of the circulating supply of tokens or currency and its current price
Hungry for more knowledge?
Back to Glossary or Subscribe to our newsletter.