Composable Formal Verification Secures DAG Consensus Protocols Efficiently
A new compositional framework enables proof reuse across diverse DAG protocols, practically halving the effort for provable, architectural security.
Mechanism Design Enforces Truthful Consensus Equilibrium in Proof-of-Stake
A game-theoretic revelation mechanism creates a unique, subgame perfect equilibrium for validating nodes to propose truthful blocks, structurally mitigating dishonest forking risks.
Quantum Work Consensus Secures Blockchain Architecture with Energy Efficiency
Proof of Quantum Work leverages quantum supremacy for a quantum-safe, energy-efficient consensus, fundamentally decoupling security from classical energy expenditure.
Chitin Protocol Secures Proof-of-Stake Liveness against View Interference Attacks
Chitin introduces a novel PoS architecture combining dynamic availability with a finality gadget, securing liveness against view-interference for single-slot confirmation.
Random Asynchronous Model Overcomes Classical BFT Impossibility Results
Removing adversarial message scheduling from the asynchronous model enables probabilistic consensus guarantees previously deemed impossible, fundamentally advancing BFT theory.
Validated Strong Consensus Enables Efficient Asynchronous Leader-Based Blockchain State Replication
A new validated strong BFT model allows asynchronous blockchains to use leader-based coordination, achieving HotStuff-level efficiency and linear view changes.
Encrypted Transactions and Randomized Ordering Mitigate Maximal Extractable Value
New MEV-resistant protocol combines transaction encryption with execution randomization, fundamentally removing validator control over profitable ordering.
Decentralized Key Reveal Protocol Mitigates Front-Running with Minimal Latency
A new architecture for transaction encryption, F3B, uses a decentralized secret-management committee to reveal keys post-finality, eliminating front-running without high latency.
Asynchronous Consensus Achieves Low Latency through Optimistic Responsiveness
A new BFT protocol guarantees safety under full asynchrony while achieving synchronous-like speed during periods of network stability, resolving the latency-robustness trade-off.
