Decoupled Quorums Accelerate BFT Consensus and Transaction Finality
Minimmit, a new BFT protocol, separates the small quorum for view progression from the finality quorum, accelerating distributed systems.
Randomness, Efficiency, and Adaptive Security Form a Consensus Trilemma
New research formalizes a consensus trilemma, proving no protocol can be simultaneously efficient, adaptively secure, and minimize public randomness.
Accountable Byzantine Consensus Achieves Optimal Communication and Accountability Complexity
New Accountable Byzantine Consensus protocol, `abcopt`, delivers optimal communication complexity while guaranteeing provable validator accountability.
Threshold Cryptography Secures Decentralized Location Privacy
A dual-protection framework combines Shamir's secret sharing with a priority-response consensus to achieve provably secure location and query privacy.
Cryptographic Leader Election Achieves Constant-Time, Fork-Free Block Production
Sassafras employs Ring-VRF and zk-SNARKs for semi-anonymous leader election, ensuring near-fork-free block production with $O(1)$ overhead.
Sub-Second Finality via Off-Chain Aggregated Byzantine Fault Tolerance
Alpenglow's Votor/Rotor architecture decouples finality from on-chain voting overhead, achieving sub-second latency with formal Byzantine resilience.
Batch Mechanism Design Achieves Provable MEV Resilience for Automated Market Makers
This novel batch-clearing AMM mechanism provides provable arbitrage resilience, shifting MEV mitigation from consensus to the application layer.
Application Layer Mechanism Design Eliminates AMM Maximal Extractable Value
This mechanism design breakthrough achieves strategy proofness for AMMs by batch-processing transactions to maintain a constant potential function, mitigating MEV.
Lightweight Leaderless SMR Protocol Fortifies Decentralized Liveness and Safety
This new leaderless State Machine Replication protocol uses a median rule and commitment certificates to ensure liveness against targeted adaptive DoS attacks.
