ZPK
Join the Auction

Consensus Model

The hybrid consensus model integrates PoI and PoSp with traditional staking through custom pallets, where validator weight is calculated as:
W_i = α × PoI_Score_i + β × PoSp_Score_i + γ × Stake_i
Consensus Model

The parameters α=0.3, β=0.3, and γ=0.4 establish a balance between computational contribution, storage provision, and economic stake.

These initial parameters were derived from game-theoretic modeling using the following attack scenarios:

Computational centralization attack

Computational centralization attack

Diminishing returns model based on simulation of 100 nodes with Gini coefficient calculations

Storage hoarding attack

Storage hoarding attack

Cost-benefit analysis based on current storage costs with probabilistic verification

Financial attacks

Financial attacks

Economic threshold analysis showing a minimum 67% stake attack would require at least 40% computational resources

Computational centralization attack

Computational centralization attack

Diminishing returns model based on simulation of 100 nodes with Gini coefficient calculations

Storage hoarding attack

Storage hoarding attack

Cost-benefit analysis based on current storage costs with probabilistic verification

Financial attacks

Financial attacks

Economic threshold analysis showing a minimum 67% stake attack would require at least 40% computational resources

Simulation Findings

Key findings from these simulations show that:

Check

1) When α > 0.25, computational centralization is disincentivized due to diminishing returns.

Check

2) When β > 0.25, storage hoarding becomes economically irrational.

Check

3) When γ < 0.5, pure financial attacks become prohibitively expensive.

Simulation Findings

Check

These parameters are adjustable through Substrate's governance mechanisms requiring a two-thirds majority vote and a minimum one-week voting period, with changes limited to ±0.05 per adjustment to prevent abrupt security model shifts. Runtime upgrades enable seamless parameter updates without hard forks. State is maintained in Patricia Tries, with root hashes enabling O(log n) Merkle proofs for efficient state verification.

Check

Note: The weightings α=0.3, β=0.3, and γ=0.4 are derived from preliminary game-theoretic simulations designed to balance computational, storage, and economic contributions while deterring centralization and Sybil attacks. These weightings will be adjusted based on testnet data and advanced economic modeling to ensure long-term network security and decentralization.

The Proof Behind Champions

Those who compete at the edge of human precision now back the technology that defines digital truth.