Lightweight Asynchronous Secret Sharing Achieves Optimal Resilience and Efficiency
New protocols for Asynchronous Verifiable Secret Sharing (AVSS) leverage lightweight primitives to achieve optimal resilience and amortized linear communication, fundamentally accelerating BFT consensus.
JUMBO Consensus Achieves Quadratic Asynchronous BFT Scalability through Certificate Aggregation
JUMBO protocol resolves the $mathcal{O}(n^3)$ aBFT complexity bottleneck by aggregating quorum certificates, unlocking truly scalable asynchronous decentralized systems.
Prioritized Committee Mechanism Achieves Optimal Asynchronous Byzantine Agreement Complexity
A new committee-based protocol achieves simultaneous optimal time, message, and communication complexity for foundational asynchronous consensus.
Verifiable Delay Functions Establish Unpredictable Decentralized Randomness for Consensus
VDFs introduce a cryptographic time-lock that enforces sequential computation, creating a provably fair, unexploitable source of on-chain randomness for secure protocol design.
Formalizing MEV with Adversarial Knowledge Enables Provable Security
This abstract model defines Maximal Extractable Value via adversarial knowledge, providing the foundational theory for provable security against economic attacks.
Proof-of-Data Hybrid Consensus Secures Scalable Deterministic Finality
The Proof-of-Data protocol decouples asynchronous execution from BFT-based finality, delivering a hybrid model for scalable, deterministic consensus.
zkEVM Constraint Engineering Resolves Fundamental Conflict between EVM and ZK Proofs
zkEVM architectures systematically translate sequential EVM execution into efficient algebraic circuits, fundamentally resolving the core scalability bottleneck.
Cryptographic Primitives Secure Decentralization and Data Availability for Rollups
New cryptographic primitives like Proof of Luck and Proof of Download secure Layer 2 decentralization and data integrity, fundamentally mitigating MEV and data withholding.
ZK-Rollup Fee Mechanisms Must Price Proving Costs to Prevent Attacks
Unaligned fee mechanisms create prover-killer attacks, fundamentally challenging ZK-Rollup liveness and demanding a cost-aware mechanism design.
