C-NORM Metric Formalizes Proof-of-Stake Bootstrapping Decentralization
Game theory defines ideal PoS bootstrapping with C-NORM, proving existing airdrop methods centralize and validating PoW-based stake distribution.
Deterministic Bounds Strengthen Probabilistic Committee Selection for PoS Security
This research introduces deterministic bounds to cryptographic sortition, replacing probabilistic security with provable committee representation to enhance PoS robustness.
Dynamic Slashing Secures Proof-of-Stake against Stake Centralization
A new mechanism dynamically scales slashing penalties by stake concentration, creating a self-regulating security equilibrium that disincentivizes validator centralization.
Non-Linear Stake Weighting Enhances Proof-of-Stake Decentralization and Security
New non-linear stake weighting models diminish the marginal utility of large pools, structurally incentivizing stake distribution for robust decentralization.
Adaptive Delegation Weighting Mitigates Proof-of-Stake Centralization Risk
Adaptive Delegation Weighting employs a non-linear reward function to economically disincentivize stake concentration, fundamentally securing DPoS decentralization.
Logarithmic Stake Weighting Advances Proof-of-Stake Decentralization Quantification and Resilience
Current Proof-of-Stake designs concentrate power; novel non-linear stake weighting models redistribute influence, enhancing decentralization and security.
