Directed Acyclic Graph (DAG)

CoinGecko által | Frissítve ekkor: 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.

Ossza meg ezt egy ismerősével!

Kapcsolódó kifejezések

Impermanent Loss
Temporary loss of funds due to volatility leading to divergence in price between token pairs provided by liquidity providers.
Trading Volume
The amount of the cryptocurrency that has been traded in the last 24 hours.
Hey Hey Hey
A term made popular by Carlos Matos who was the spokesperson for the Bitconnect Ponzi. He used it frequently during Bitconnect events to rile up the crowd.
Peer to Peer
A communication protocol that does not require a central hub
Még több tudásra szomjazik?
Vissza a glosszáriumhoz vagy iratkozzon fel hírlevelünkre.
coingecko (thumbnail mini)
CoinGecko iOS-ra
coingecko (thumbnail mini)
CoinGecko Androidra