Consensus Algorithm

Proof-of-Celerity (PoC)

Proof-of-Celerity (PoC) is a consensus algorithm that is designed to reduce the computational and energy requirements of traditional proof-of-work (PoW) and proof-of-stake (PoS), while still maintaining high levels of security and decentralization.

The PoC consensus algorithm operates by supporting multiple sequencers to produce batches on Layer L2 in a permissionless manner. Thus, network nodes are incentivized to perform the computational tasks efficiently that are accessible to low-power devices. Nodes that complete these tasks efficiently are rewarded with tokens, while nodes that fail to meet efficiency standards are penalized.

The comprehensive implementation of PoC brings several unique advantages to Hyper Chain network, which coincide with the protocol's design philosophy;

• Efficient: PoC is a competitive mechanism designed to be highly efficient in terms of computing power. That is, the higher the CPU memory configuration of the machine, the faster the proof being generated, and the easier it is for participants to get rewards. This results in a more sustainable and streamlined network.

• Secure: PoC is secure and resistant to attacks and manipulation. Nodes are performing their duties in a secure and reliable manner under PoC, reducing the risk of security breaches or network failures.

• Decentralized: PoC ensures that the network remains decentralized, meaning that no single entity has control over the network, ensuring greater security, privacy, and transparency for network participants.

• Permissionless: Users can interact with the network and use its services without any barriers to entry, resulting in a more open, accessible, and decentralized network.