Folding Schemes Enable Constant-Time Recursive Zero-Knowledge Proofs
Introducing the folding scheme primitive, Nova bypasses complex SNARK recursion, achieving the fastest prover time and a constant-sized verifier circuit for scalable verifiable computation.
Cryptographic Zk-Agreements Establish Private Deterministic Trust on Blockchains
The zk-agreements protocol uses Zero-Knowledge Proofs and MPC to finally secure confidential legal contracts on public ledgers, unlocking enterprise adoption.
Rigorous Proof of Stake Security via Process Algebra
Formal modeling of probabilistic consensus using process calculus and noninterference verification provides mathematically provable security bounds against sophisticated attacks.
Random Asynchronous Model Overcomes Byzantine Consensus Impossibility Bounds
By replacing adversarial message scheduling with a random model, this research overcomes classic asynchronous consensus impossibility bounds, enabling higher resilience protocols.
Composable Density-Based Rule Secures Proof-of-Stake Chain Selection
A novel composable density-based chain selection rule formalizes Proof-of-Stake security, creating a robust foundation for sidechain architectures.
Verkle Trees Enable Stateless Ethereum Clients via Compact Polynomial Commitments
Verkle Trees replace Merkle proofs with polynomial commitments, reducing state witness size by 30x, unlocking truly scalable and decentralized stateless clients.
Formal Specification Refinement Enables Safe, Verifiable Smart Contract Evolution
New refinement framework shifts to a "specification is law" paradigm, enabling safe, formally verified contract upgrades while preserving essential properties.
Cornucopia: Insertion-Secure Accumulators Forge Scalable Distributed Randomness
Cornucopia introduces insertion-secure accumulators to efficiently aggregate contributions for VDF-based randomness, securing the foundation of decentralized systems.
Simplified Verifiable Secret Sharing Achieves Optimal Fault Tolerance and Efficiency
New VSS protocols fundamentally simplify the cryptographic primitive, enabling optimally fault-tolerant, publicly verifiable distributed systems with 90% less bandwidth.
