Prudent Decoupling Secures Pipelined BFT Consensus against Liveness Attacks
The pBeeGees protocol decouples block commitment from view-consecutive certificates, resolving critical liveness flaws without adding computational overhead.
Brakedown Achieves Post-Quantum Sublinear Polynomial Commitment without Trusted Setup
This new polynomial commitment scheme combines Reed-Solomon codes with Merkle trees, enabling post-quantum security and sublinear proof size.
Practical Asynchronous BFT Achieves Superior Performance through Designated Leader Pipelining
This protocol merges leader-driven efficiency with asynchronous resilience, creating a simple, high-performance BFT mechanism for real-world decentralized systems.
Empirical Analysis Exposes Secret Leader Election Vulnerability to Coordinated Attacks
New simulations reveal current Secret Leader Election protocols fail against coordinated validator group attacks, demanding novel cryptographic resilience.
Mechanism Design Secures Leaderless Blockchain Protocols with Shared Fee Incentives
Proposes FPA-EQ, the first TFM for multi-proposer systems, achieving Strongly BPIC to align block producer incentives and maximize welfare.
MAD-DAG Ledger Function Eliminates MEV-Driven Consensus Instability
A novel DAG-based ledger function discards block content during tie-breaks, fundamentally removing the MEV incentive that destabilizes consensus protocols.
Single Root Identity Unifies Multi-Chain, Post-Quantum Cryptography with Isolation
MSCIKDF introduces a unified key derivation primitive for deterministic, context-isolated, and post-quantum-ready identity across diverse cryptographic domains.
Sublinear Dynamic Vector Commitments Optimize Stateless Blockchain Scaling
New sublinear vector commitments fundamentally resolve the state update bottleneck, enabling efficient, decentralized stateless blockchain validation.
HyperNova: Optimal Recursive Arguments Generalize Zero-Knowledge Constraint Systems
HyperNova introduces an optimal folding scheme for Customizable Constraint Systems, enabling "a la carte" proof costs for scalable, efficient verifiable computation.
