Logarithmic Zero-Knowledge Proofs Eliminate Trusted Setup for Private Computation
Bulletproofs introduce non-interactive zero-knowledge proofs with logarithmic size and no trusted setup, fundamentally solving the proof-size bottleneck for on-chain privacy.
Constant-Size Timed Signatures Revolutionize Verifiable Future Transaction Execution
This new VTS primitive achieves constant-size proof overhead using RSA and TVDF, fundamentally unlocking efficient time-locked on-chain applications.
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.
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.
Sequential Proof-of-Work Enables Competitive Decentralized Randomness Beacons
RandChain introduces Sequential Proof-of-Work to mandate non-parallelizable mining, securing public randomness and democratizing validator election.
Folding Schemes Enable Fastest Recursive Zero-Knowledge Arguments
The Nova folding scheme dramatically accelerates verifiable computation by deferring all intermediate proof checks into a single, succinct final argument.
BFT Consensus Enables Practical Decentralized Distributed Key Generation
A new framework operationalizes Distributed Key Generation using BFT consensus as a broadcast channel, enabling trustless threshold cryptography for decentralized systems.
Polynomial Commitments Secure Erasure Codes for Scalable Data Availability Sampling
Cryptographically-secured erasure codes enable light clients to verify data availability by sampling, resolving the scalability bottleneck for modular architectures.
Vector Commitments Enable Constant-Time Data Availability Proofs for Stateless Clients
This new Vector Commitment primitive achieves $O(1)$ data availability proof verification, fundamentally decoupling light client security from network throughput limits.
