peaq

Search…

Nodes

Each node (P-Node) is assigned a weight

$\overline{W_i}$

calculated by the number of times it participated as VN and/or LN $W_{VN||LN}$

and GN by amount of $Tx$

transactions added to P-Blocks $W_{Tx}$

: $(∀ i,j,m∈N,∃!W_i(Nd_j (T_m ))=
{W_{VN||LN} \choose W_{Tx}}$

As soon as the counter

$W_{VN||LN}$

reaches a maximum value, it is divided by 2 for all Nodes Weight $W_{VN||LN}/2$

. As soon as the nodes transactions counter $W_{Tx}$

reaches a maximum value, the nodes weight $W_{VN||LN}+1$

is incremented. This calculated

$\overline{W_i}$

is irreducible and aperiodic with the combination of computing power value$Cp_i$

of P-Nodes. These parameters in one embodiment the input for a consensus algorithm (e.g. ADDBFT) of the P-Nodes participating in the round.The LN verifies the transaction and adds it to the P-Block. The successfully verified

$Tx_{k+1}^i$

is added (executed) to the $B_{LN_k}^{m+1}$

to $DB_k$

in the LN.

Last modified 2mo ago

Copy link