peaq
Search…
Node DBs
In view of the above, a complete DAGchain embodiment can be defined as
DAGchain(Nd,B,W)(B,Tx,SP)DAGchain ≡(Nd,B,W)∪(B,Tx,SP)
.
As explained above, the P-Nodes of embodiments of the invention have multiple DB
kDBk=kNdk∑_kDB_k =∑_kNd_k
, and there may also be additional DBs for system requirements. In general, as soon as a new Node
Ndi+1Nd_{i+1}
is added to the network, a new
DBi+1DB_{i+1}
is also created for this P-Node and synced over the network.
There may be additional DBs that store key-map and object states for faster search and/or response to the client. The records DB is preferably the only one that will have amendable data and as its
H(DBRec)H(DB_{Rec})
was written in P-Block.
Fig. 1 illustrates an exemplary DAG formed by P-Nodes. It shows the synchronization process between the nodes. As can be seen, the nodes in a DAG structure synchronize, since all nodes have the same history. The superscript
q+1q+1
shown in the node
Nd0Nd_0
indicates that a new block
B0q+1B_{0^q+1}
is added to the synchronization process, which then appears in all nodes. This block can be found in the box in the upper right corner of Fig. 1, where the blocks are arranged in a DAG structure and not in chains as usual for a blockchain.
As a result, embodiments of the invention provide a chain of blocks stored in the DB of each node and System DB key-value storages.
Each block is stored in the DB of its node of creation and has a hash of the previous block.
The system DB stores pairs of
H(BLNkm+1)==NdkH(B_{LN_k}^{m+1}) == Nd_k
and this way dramatically decreases verification time (finding ). As illustrated in Fig. 2, when going for the full search history and the verification of the Wallet state from the first object, the DAG speed will make the full history available for the review, similar to e.g. git.
Last modified 2mo ago
Copy link