WARP: Linear Accumulation Unlocks Post-Quantum Scalable Verifiable Computation
Introducing WARP, a hash-based accumulation scheme achieving linear prover time and logarithmic verification, radically accelerating recursive proof systems.
Subspace Codes Enable Logarithmic Proof Size Constant Verification Time Commitment
A novel polynomial commitment scheme using subspace codes achieves logarithmic proof size and constant verification, enhancing rollup efficiency.
