Doing mixed matrix commitments (MMCS) with STIR & WHIR
Speeding up fold computation
WHIR: Reed–Solomon Proximity Testing with Super-Fast Verification
zkSNARKs in the ROM with Unconditional UC-Security
STIR: Reed–Solomon Proximity Testing with Fewer Queries
A Time-Space Tradeoff for the Sumcheck Prover
SLAP: Succinct Lattice-Based Polynomial Commitments from Standard Assumptions
Lattice-Based Polynomial Commitments: Towards Asymptotic and Concrete Efficiency