The process for approving and appending new blocks to an existing blockchain is established by a consensus-building algorithm such as PoW, PoS, PoC, or PoA and executed through nodes that calculate the hash value based on established conditions.

In contrast, the new consensus-building algorithm known as PoR establishes which nodes will approve transactions in advance, and the sequence of approval of these node groups awaiting approval is decided in order of priority. Since each node approves transactions in this sequence, this completely eliminates the need to calculate hash values and removes the restriction of time needed to randomly choose, which has greatly improved processing speed.

The order of priority that determines the sequence of these approval nodes is calculated using the following factors.

-Node age

-Number of successful transaction approvals

Both of the above factors can be calculated by referring to past blockchain data. In this way, it is possible for any node to maintain impartiality regarding sequence because information is mutually distributed.

However, it is not hard to imagine that a major improvement in approval speed is a trade-off with security, and this is in fact true.

For example, the permutation of approval nodes can result in the approval nodes being specified, allowing malicious approvals. Furthermore, the elimination of nonces eliminates complicated operations, which allows transactions to be generated conveniently and manipulated more easily.