零点课堂 | What Is a Directed Acyclic Graph (DAG) in Cryptocurrency?（2）

taotao 深度 2021年3月29日
5.53K 0

Conceptually, DAGs look something like the above. They're made up of vertices (the spheres) and the edges (the lines connecting them). They're directed because they head in one direction (you can see this illustrated with the arrows). They're acyclic (i.e., not cyclic) because the vertices don't loop back on themselves – if you start at one point and follow the graph, you can't return to that same point. This will become clearer shortly.

Such data structures are generally used to model data. You might rely on a DAG in scientific or medical fields to observe the relationship between variables and to determine how they impact each other. For instance, you could take things like nutrition, sleep cycles, and physical symptoms, so that you can draw links between them to establish how they affect a patient.

How does a DAG work?

In a DAG-based cryptocurrency, each vertex in the structure represents a transaction. There's no notion of blocks here, nor is mining required to extend the database. So instead of gathering transactions into blocks, each transaction is built on top of another. Still, there's a small Proof-of-Work operation that's done when a node submits a transaction. This ensures that the network isn't being spammed and also validates previous transactions.

For a new transaction to be added, it must build on top of older ones. Suppose that Alice creates a new transaction. For it to be acknowledged, this transaction must reference previous ones. A bit like how a block in Bitcoin references the one that came before it, but there are multiple transactions referenced.

In some systems, an algorithm will select which transactions (or "tips") a new transaction must build on. Tips more likely to be selected are those that have more accumulated weight – a measure of how many confirmations the path to the tip has.

The transactions that Alice will build on top of are unconfirmed. But once Alice references them, they become confirmed. Alice's transaction is now unconfirmed, so someone else must build on top of it before it's accepted.

声明：本文由 Binance撰写，零点财经收录，观点仅代表作者本人，绝不代表零点财经赞同其观点或证实其描述。

本文由 零点财经 作者：tao 发表，其版权均为 零点财经 所有，文章内容系作者个人观点，不代表 零点财经 对观点赞同或支持。如需转载，请注明文章来源。
分享生成图片
♥赞58

相关文章

发表回复

零点课堂 | What Is a Directed Acyclic Graph (DAG) in Cryptocurrency?（2）

2021-03-29 15:20:05

Conceptually, DAGs look something like the above. They're made up of vertices (the spheres) and the edges (the lines connecting them). They're directed because they head in one direction (you can see this illustrated with the arrows). They're acyclic (i.e., not cyclic) because the vertices don't loop back on themselves – if you start at one point and follow the graph, you can't return to that same point. This will become clearer shortly.

Such data structures are generally used to model data. You might rely on a DAG in scientific or medical fields to observe the relationship between variables and to determine how they impact each other. For instance, you could take things like nutrition, sleep cycles, and physical symptoms, so that you can draw links between them to establish how they affect a patient.

How does a DAG work?

In a DAG-based cryptocurrency, each vertex in the structure represents a transaction. There's no notion of blocks here, nor is mining required to extend the database. So instead of gathering transactions into blocks, each transaction is built on top of another. Still, there's a small Proof-of-Work operation that's done when a node submits a transaction. This ensures that the network isn't being spammed and also validates previous transactions.

For a new transaction to be added, it must build on top of older ones. Suppose that Alice creates a new transaction. For it to be acknowledged, this transaction must reference previous ones. A bit like how a block in Bitcoin references the one that came before it, but there are multiple transactions referenced.

In some systems, an algorithm will select which transactions (or "tips") a new transaction must build on. Tips more likely to be selected are those that have more accumulated weight – a measure of how many confirmations the path to the tip has.

The transactions that Alice will build on top of are unconfirmed. But once Alice references them, they become confirmed. Alice's transaction is now unconfirmed, so someone else must build on top of it before it's accepted.

声明：本文由 Binance撰写，零点财经收录，观点仅代表作者本人，绝不代表零点财经赞同其观点或证实其描述。