powered by Coinlib

Friday, July 6, 2018

UNIDAG - Continuous Blocks of Data Blocks With Data Built In Conformity With The Directed Graphics Code



Hello everyone, If you are interested in joining Unidag project, it is a good idea to read reviews that can help you get information that might help you in viewing their mission vision:

DAGchain is a continuous series of data blocks with data, built in accordance with the rules of directed acyclic graphics. The main function of DAGchain is the preservation and protection of unchanged data.

General circuit diagram
When building a dagchin block chain, a directed acyclic graph is used which the node is a block with the data. Just like in a block space, blocks consist of headers and data.


A - Block header.
B - Data.

The ends of the graph are interrelations between blocks. Every block in UniDAG dagchine is ending point only for 2 sides.


Each block is sequentially numbered integer numbers with 1 increment from the beginning of the chain and adds this number to the block header.


1, 2, 3, N, (N + 1), (N + 2) is the sequence number of the block

To ensure the invariability of dagchin data at the edges of the graph (linkage between blocks), the irreversible cryptographic method of hashing is used. When the block is generated, the data is hashed. Then the hash of the previous two blocks is taken with the hash of the received data, and they are hash together to get the hash of its own block. Exception: the first two "genesis" blocks. All hash numbers are written to block headers.


The basic rules in dagchin development are the preservation of block sequences, the use of the same number of sides (links), and the use of cryptostable algorithms for hashing.

DAGchain vs Blockchain
Both the daggies and the UniDAG blocker are special examples of regular unidirectional linear linked lists. The classic blockade can be represented as dagchin.


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

k = 1 is an example of a classical block with 1 side, ie. Hash from the previous block participates in hashing of the next chain block.
k = 2 - dagchain UniDAG, where hashes of the previous 2 blocks are used in a hash block.
k = 3 - hash of the block using 3 hashes of the previous block, respectively.

k = (N + 1) - hash of blocks using hashes of all previous blocks.
With this approach, the possibility of practical application of dagchin increased significantly. However, it became clear that the more links we use, the more it is necessary to write hashes from the previous block data in the header and use more of the computing resources.

In practice, in most cases, it is not necessary to use the maximum number of hashes possible. Another significant difference is the ability to create dagchins from open / closed blocks. The core of this process is that in the block header, "place" is reserved for recording the next block hash. The number of "places" is directly dependent on the number of sides (interconnection). The open block is a block with the possibility of additional entries to the header, closed - without this possibility.


k is the number of sides (relationship)
Let us consider the example with the number of sides k = 2, used in UniDAG dagchine.


The current block is closed by a hash of the following two
Thus, in order to convert the N-th data blocks in dagcheyne with 2 fins it is necessary to change the data, respectively, and their hashes, (N-2) th and (N-1) th blocks, which increases the security and the dagchin not changed overall.

For more information on the current Unidag project, please visit some of the important Links below for the following References:

Website :https://unidag.com/
Whitepaper :https://unidag.com/docs/en/WhitePaper-en.pdf
Facebook :https://www.facebook.com/unidagworld/
Twitter :https://twitter.com/WorldUniDAG
Telegram :https://t.me/World_UniDAG
Medium :https://medium.com/unidag
Discord :https://discord.gg/cF57EnM
Github :https://github.com/UniDAG
Vk.com :https://vk.com/unidag

The bitcointalk name :Icaica22
Profile Link :https://bitcointalk.org/index.php?action=profile;u=1546717

No comments:

Post a Comment

Popular Posts