OCE). It is a hybrid algorithm that combines Proof of Stake (
PoS), Verifiable Random Function (
VRF), and the Byzantine Fault Tolerance algorithm (
VRF, while also ensuring that a final consensus is swiftly reached.
stakeset by the node administrator.
VBFTalgorithm configuration parameters.
PoStable is an important
VBFTis run, all the nodes randomly choose the nodes that will participate and carry out a round of consensus process.
VRFfor a round of consensus. The node sets are segregated in two, block verification node set and block confirmation node set, and then the consensus process is carried out based on this selection.
VRF, the proposal node, verification node, and confirmation node sets are different for each round of block consensus. This is very difficult to predict, and that makes this algorithm resistant to malicious attacks.
VRF. A block is proposed by each proposal node.
VRF. Each verification node collects the proposed blocks from the consensus network, carries out verification, and votes for the proposed block with the highest priority.
VRF. These nodes carry out statistical verification for the voting carried out by the verification nodes and confirm the final consensus result.
VRFvalue of each block is determined by the previous consensus blocks. The algorithm actually fetches transaction information from the previous block and calculates the
1024place hash value, and then uses it as the
VRFvalue for the next block.
VBFTalgorithm uses the
VRFvalue from the previous round of consensus as index to determine the nodes from the
PoStable that will participate the next round of consensus. The
PoStable generation takes every node owner's
PoSinformation and the consensus network's governance policy into account. Even though the random
VRFvalues can be considered to be uniformly distributed, the algorithm's random node selection process is still subject to Ontology's consensus network administration policies.
VRFvalue generated by every block is verifiable, provided that a block is not split, all the nodes will be consistent for a block at a certain height.
VRFin the algorithm selects nodes sequentially from the
PoStable. For this reason, each
VRFvalue maintains an alternate proposal node sequence, and this random node sequence is also consistent with the consensus process.
VBFTconsensus algorithm uses the consensus nodes randomly, and this increases the level of difficulty to execute an attack, the risk of a fork still exists when network isolation occurs.
VRFcan determine a node sequence. When
VBFTcarries out fork choice, it assigns the level of priority for each node based on this node sequence. Next, each fork priority is weighted based on the sequence of these assigned priorities, and then each node makes the suitable fork choice based on the weighted fork priority levels.
VRF, we can say that it is very difficult, or even impossible for malicious forks to maintain a high level of priority for themselves, and thus such forks swiftly die out. This is how
VBFTis able to ensure quick conclusion rate in terms of final states.
stakeand explicitly updates the node list of the consensus network.
stakeand it is confirmed that the node performance meets the requirements of the consensus network, it is added to the consensus network when the node list is updated.