Modularity Unlocks Random Variable Commitments for Certified Differential Privacy
New modularity lemmata for Random Variable Commitment Schemes enable provably general certified differential privacy protocols, securing decentralized data analysis.
Equifficient Polynomial Commitments Achieve Smallest SNARK Proof Size
Introducing Equifficient Polynomial Commitments, this work minimizes proof size to 160 bytes and enables free linear gates, dramatically lowering on-chain costs.
Decentralized Rollup Sequencers Achieve Liveness and Censorship Resistance via Set Consensus
The Arranger primitive, built on Set Byzantine Consensus, eliminates the L2 centralization bottleneck, securing transaction ordering and liveness.
Single Root Identity Secures Multi-Curve, Post-Quantum, Context-Isolated Systems
MSCIKDF, a new key derivation primitive, unifies cryptographic identity across multi-chain and PQC environments while guaranteeing strict context isolation.
Brakedown Achieves Post-Quantum Sublinear Polynomial Commitment without Trusted Setup
This new polynomial commitment scheme combines Reed-Solomon codes with Merkle trees, enabling post-quantum security and sublinear proof size.
Sublinear Dynamic Vector Commitments Optimize Stateless Blockchain Scaling
New sublinear vector commitments fundamentally resolve the state update bottleneck, enabling efficient, decentralized stateless blockchain validation.
HyperNova: Optimal Recursive Arguments Generalize Zero-Knowledge Constraint Systems
HyperNova introduces an optimal folding scheme for Customizable Constraint Systems, enabling "a la carte" proof costs for scalable, efficient verifiable computation.
Decoupled Time-Lock Commitments Enforce Fair Transaction Ordering
Introducing Decoupled Time-Lock Commitments, a new primitive that uses VDFs to cryptographically enforce a future transaction reveal, fundamentally eliminating proposer-side MEV.
Folding Schemes Enable Linear-Time Recursive Zero-Knowledge Computation
Nova's folding scheme fundamentally solves recursive proof composition by accumulating instances instead of verifying SNARKs, unlocking infinite verifiable computation.
