Episode 59 - Directed Acyclic Graph (DAG)
In this episode, we cover Directed Acyclic Graph or DAG.
In blockchain, we have blocks as collection of transactions and the current block references the previous one, and a chain is formed.
In DAG, we don’t have any blocks. Transactions directly reference previous transactions. The nodes verify the previous transactions by referencing them in new transactions.
When a new transaction is submitted to a DAG, some previous transactions are referenced in it.