Dagchain vs Blockchain

To know more about UniDAG dagchain, please, read this publication or visit unidag.com .

As well as blockchain, dagchain is a particular example of an ordered linear unidirectional linked list. Classic blockchain can be represented as a dagchain.

The fundamental difference between them is the number of connections between nodes (blocks).

One relationship is an example of a classic blockchain with 1 edge, that is, the hash of the previous block participates in hashing of the next block of the chain.

Two relationships are the DAGchain UniDAG, where the hash of the previous two blocks is used in the hash of the block.

Three relationships — in the hash of the block, 3 hashes of the previous blocks are used, respectively.

The number of relationships is equal to the number of blocks — in the hash of the block the hashes of all previous blocks are used.

With this approach, the possibilities of practical application of the dagchain significantly increase. However, it becomes clear that the more links we use, the more it is necessary to write the hashes of the data of the previous blocks in the header and the more use of the computing resources. In practice, in most cases, simply there is no need to use the maximum possible number of connections (hashes).