What a DAG?
Directed Acyclic Graph (DAG) uses topological ordering for a directed graphical structure. The sequence can move from earlier to later. DAG can be applied to issues related to data processing, scheduling of projects, Shortest path problems, and data compression. The sequence is maintained by the involvement of transactions, thus skipping the process of mining. DAG’s blockless design consists of only transactions, eliminating the need for miners to create new blocks.
In addition, DAG allows users to secure data by referencing data units from previous transactions, thereby increasing the scalability of transactions. The consensus algorithm establishes total order in the DAG by selecting the ‘main chain’ that gravitates towards reputable users, aka witnesses.