Sign up to save your podcasts
Or
Share Episode 59 - Directed Acyclic Graph (DAG)
Share to email
Share to Facebook
Share to X
Share to email
Share to Facebook
Share to X
Or
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.
Music: https://www.purple-planet.com
This is a public episode. If you would like to discuss this with other subscribers or get access to bonus episodes, visit podcast.blockshots.net
View all episodes
By Gautam Dhameja (web3gautam)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.
Music: https://www.purple-planet.com
This is a public episode. If you would like to discuss this with other subscribers or get access to bonus episodes, visit podcast.blockshots.net