Quantum Sampling Creates Energy-Efficient, Quantum-Secure Proof-of-Work Consensus
Coarse-Grained Boson Sampling introduces a quantum-native PoW, solving classical PoW's energy crisis with a classically verifiable, quantum-hard problem.
Cryptographic Second Price Auctions Secure Transaction Ordering and Mitigate Adversarial MEV
Encrypting transaction bids via a Cryptographic Second Price Auction formally decouples miner revenue from user incentives, ensuring provably fair block construction.
Reusable Compositional Framework Formally Verifies DAG Consensus Protocols
A compositional TLA+ framework decouples DAG consensus into verified construction and ordering modules, accelerating robust protocol security.
WARP Accumulation Scheme Achieves Optimal Verifiable Computation Efficiency
The WARP accumulation primitive achieves linear proving and logarithmic verification time, fundamentally enabling truly scalable recursive zero-knowledge systems.
Asynchronous Accountability Primitive Secures BFT Liveness and Cryptoeconomic Finality
This research introduces the Asynchronous Accountability Primitive, merging VDFs and state commitments to enable cryptoeconomic slashing for BFT liveness failures.
PVSS-BFT Protocol Secures Dynamic Consensus and Reduces Communication Latency
Integrating Publicly Verifiable Secret Sharing into BFT consensus achieves $4Delta$ latency and 50% fault tolerance in dynamic networks, solving the sleepy model's efficiency challenge.
Block Synchronizer Abstraction Secures BFT Consensus against Network Attacks
The block synchronizer, Beluga, solves BFT performance collapse under attack by coordinating resource-aware, incremental block retrieval.
Cost-Effective Verifiable Delay Functions Unlock Secure EVM Randomness
Optimizing Pietrzak's VDF verification from 4M to 2M gas makes unbiasable on-chain randomness feasible, securing leader election and decentralized applications.
Formal Verification Quantifies Algorand Consensus Robustness and Adversarial Limitations
Researchers used a process algebraic model and noninterference framework to formally verify Algorand's consensus security, revealing precise adversarial limits.
