Directed Acyclic Graph (DAG)

Di CoinGecko | Aggiornato il 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.

Condividi questo con un amico!

Termini correlati

Cloud Mining
Mining on blockchains through rented processing power rented from companies that host the physical equipment.
Proof-of-Burn (PoB)
A consensus algorthm that assigns block validation queue based on the coins/token burned by the validator.
Futures
An agreement between two counterparties that obligates them to transact in the future based on the contract terms set.
Private Keys
The alphanumeric string which allows transactions from the cryptocurrency address
Vuoi saperne di più?
Torna al glossario o iscriviti alla nostra newsletter.
coingecko (thumbnail mini)
CoinGecko per iOS
coingecko (thumbnail mini)
CoinGecko per Android