Collaborative Mining Secures PoS/BFT against Long-Range Attacks
A novel collaborative mining protocol fundamentally redefines long-range attack security for PoS/BFT systems, enabling robust, energy-efficient decentralized applications.
Cryptanalysis Exposes Verifiable Delay Function Flaws Threatening Consensus Security
Cryptographers proved a Verifiable Delay Function's fixed sequential time can be bypassed, challenging its use for secure, fair randomness in Proof-of-Stake.
Wakeness Vectors Secure Proof-of-Stake against Fully-Fluctuating Node Participation
Wakeness vectors enable Proof-of-Stake protocols to securely handle arbitrary node participation fluctuations, rivaling Proof-of-Work robustness.
Bitcoin Checkpointing Resolves Proof-of-Stake Long-Range Attack Impossibility
A new protocol secures Proof-of-Stake history by anchoring succinct commitments to Bitcoin's Proof-of-Work, providing non-slashable long-range attack safety.
Mechanism Design Enforces Truthful Consensus, Mitigating Disputes in Proof-of-Stake
Applying economic revelation mechanisms to PoS protocols ensures truthful block proposal as the unique equilibrium, fundamentally enhancing network robustness.
PoS Security via PoW Checkpointing Protocol Achieves Historical Finality
A novel checkpointing protocol embeds Proof-of-Stake finality into Proof-of-Work, providing provable, non-slashable security against long-range attacks.
Bitcoin Checkpointing Secures Proof-of-Stake against Long-Range Attacks
A new protocol anchors Proof-of-Stake history to Bitcoin's Proof-of-Work, providing an external trust source to cryptoeconomically secure PoS against long-range attacks.
Mechanism Design Enforces Truthful Consensus Using Staked Collateral
A novel revelation mechanism leverages staked assets to ensure validators' truthfulness, resolving consensus disputes by making block proposal honesty the unique subgame perfect equilibrium.
Formalizing Proof-of-Stake Security Limits under Dynamic Availability and Reconfiguration
This research formalizes the Dynamic Availability and Reconfiguration (DAR) model, proving the minimum security assumptions required for scalable, decentralized Proof-of-Stake consensus.
