FLIP-and-Prove R1CSDecember 2025 — Anca Nitulescu, Nikitas Paslis, Carla RàfolsIACR Communications in Cryptology#folding#snarks
Approximate Lower Bound ArgumentsMay 2024 — Pyrros Chaidos, Prof Aggelos Kiayias, Leonid Reyzin, Anatoliy ZinovyevEurocrypt '24#snarks
How to Compile Polynomial IOP into Simulation-Extractable SNARKs: A Modular ApproachNovember 2023 — Markulf Kohlweiss, Mahak Pancholi, Akira TakahashiTCC '23#snarks