Crypto Gloss

DAG

A directed acyclic graph (DAG) is a directed graph with no path that loops back to its starting point. Crypto projects use DAG structures in different ways to organize events or ledger updates; the structure alone does not define how a network reaches consensus, resolves conflicts, or decides when a transfer has enough confirmations.

How a DAG is structured

A DAG contains vertices (also called nodes) and directed edges that show how one item relates to another. “Acyclic” means following those edges cannot bring you back to the same vertex. A DAG can branch and later rejoin, and it may have more than one valid ordering. In a distributed ledger, the protocol supplies additional rules for ordering updates and deciding which conflicting records to accept.

Those extra rules matter. A DAG is a data structure, not a complete blockchain alternative or a consensus algorithm by itself. Some systems attach new events to earlier events; others organize parallel blocks or maintain a separate chain for each account.

How crypto projects use DAGs

  • Hedera Hashgraph: gossip events refer to earlier events through parent hashes. The resulting hashgraph is a DAG, and Hashgraph consensus uses that shared event history for virtual voting and transaction ordering.
  • Kaspa: its proof-of-work design is a blockDAG. GHOSTDAG lets blocks produced in parallel remain in a shared structure and applies protocol rules to order them.
  • IOTA: the current IOTA Mainnet describes a DAG-based ledger architecture and separately identifies its consensus approach. That distinction shows why graph shape does not tell you the full security or governance model.
  • Nano: its block lattice gives each account its own chain of blocks, while Open Representative Voting supplies a separate consensus mechanism. It differs from Hashgraph or a proof-of-work blockDAG.

These examples share a broad graph property, not one universal protocol. Their nodes, edges, transaction rules, consensus assumptions, and confirmation behavior differ.

History

  • June 2016: IOTA launched its first mainnet using the Tangle, an early public distributed ledger built around a DAG structure.
  • 2018: the PHANTOM and GHOSTDAG research line described a way to generalize proof-of-work ordering to a DAG of blocks rather than discard every parallel block.
  • November 2021: Kaspa launched its mainnet as a proof-of-work blockDAG network using GHOSTDAG.

Practical application

When a project says it uses a DAG, look for its specific ledger and consensus documentation. Ask what each vertex represents, what an edge means, how nodes choose an ordering, how double-spends are handled, and what the project means by “confirmed” or “final.” Compare measured throughput and fees only when test conditions and counting methods are stated.

Common Misconceptions

“A DAG automatically makes a cryptocurrency faster or cheaper.”

Not by itself. Parallel structure may let a protocol process or retain concurrent events, but actual throughput, fees, latency, and security depend on consensus rules, network conditions, hardware, and workload.

“DAG-based systems do not use blocks.”

Some do. A blockDAG such as Kaspa’s organizes blocks in a graph; other designs use events, transactions, or account-specific chains.

“A DAG is the consensus mechanism.”

The graph records relationships. A separate protocol determines agreement, conflict handling, ordering, and when a transfer is treated as settled.

Criticisms

  • More complicated ordering: keeping concurrent updates while resolving conflicts can make protocol behavior harder to understand and audit than a simple linear history.
  • Project-specific tradeoffs: a DAG does not remove assumptions about validator or representative influence, network propagation, storage, or attack resistance. Assess each implementation on its own.
  • Performance claims need context: a high block or event rate is not directly comparable to another network’s transaction throughput or finality. Benchmarks must state what is counted and under which conditions.

Social Media Sentiment

A June 9, 2024 r/CryptoCurrency discussion about Kaspa and GHOSTDAG shows both interest and skepticism: the original post showed 20 votes in the retrieved thread, while commenters praised the idea and challenged claims about speed, confirmation, security, and documentation. It is one older, project-focused discussion rather than a representative survey; its performance claims are not current measurements.

Last updated: 2026-10

Related Terms

See Also

Sources

  • Hedera: What Is Gossip About Gossip? — explains how parent hashes create the Hashgraph event DAG and how nodes use the shared event history.
  • Kaspa Wiki — describes GHOSTDAG’s blockDAG and its ordering of blocks created in parallel.
  • IOTA Mainnet — documents IOTA’s current DAG-based ledger architecture and identifies consensus as a separate part of the design.
  • Nano Documentation: The Basics — explains account-specific block chains and Open Representative Voting as distinct ledger and consensus components.
  • IOTA: A New Dawn — records the June 2016 mainnet launch and gives context for the Tangle timeline.
  • Kaspa Lore — dates Kaspa’s mainnet launch to November 2021 and describes its proof-of-work blockDAG design.
  • PHANTOM and GHOSTDAG research paper — presents the research basis for ordering proof-of-work blocks in a DAG structure.