Decentralized Prover Selection Secures Zero-Knowledge Rollup Censorship Resistance
A commitment auction paired with a VDF lottery decentralizes proof generation, ensuring economic efficiency and censorship resistance for Layer 2 systems.
Linear Prover Time Unlocks Optimal Verifiable Computation Scaling
Introducing FoldCommit, a new polynomial commitment scheme that achieves optimal linear-time prover complexity, fundamentally lowering the cost of generating large-scale zero-knowledge proofs.
