Directed Acyclic Graph (DAG)

بواسطة CoinGecko | تم التحديث في 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.

شارك هذا مع صديق!

الشروط ذات الصلة

Algorithmic Stablecoin
Algorithmic stablecoins are tokens pegged to a fiat currency which is usually the US dollar, purely through software and specific conditions.
Validator
A block-signing participant of a Proof of Stake blockchain network, whom have significant tokens staked on the network.
Proof of Work (PoW)
A consensus algorithm in which a block is validated via mathematical hashing
Ticker
A ticker is a stock or asset symbol that abbreviates the asset name and it can be used as an identifier of the asset.
هل أنت متشوّق لمزيد من المعرفة؟
الرجوع إلى المصطلحات أو الاشتراك في نشرتنا الإخبارية.
coingecko (thumbnail mini)
CoinGecko لنظام التشغيل iOS
coingecko (thumbnail mini)
CoinGecko للأجهزة التي تعمل بنظام Android