peaq
Search…
Messages
In another aspect, the communication layers are designed as messages between Nd. That are part of sync unknown data: new P-Blocks, current Rd or for state information as Nd||Rd||DB||peaq status. This part for creating and handling messages is an integral part of Nd functioning. The higher the Node weight is the higher is the chance to get updated earlier.
In classic DAG-like algorithms this part can create huge problems when the amount of nodes increases and reaches exponential complexity
$O(Tx^2)$
only in the part of communication layers. Combined with the complexity described further above, it makes it fully limited in scaling amount of nodes and thereby very difficult if not impossible to run any applications with an increasing usage and increasing amount of transactions on the system.
There are several types of messages with two main classes: The System (ADDBFT) and the Synchronization. The system type has limits which must have the following: Height of previous and proposed P-Block, peaq hash, DB hash. The synchronization is mostly used to get information and/or status from the network. Based on P-Node type and stage in Rd, Nd uses the previously given system key for signing message. For each type of message delay is defined based on message type.