Paper on single-prover AI-safety verification with doubly efficient interactive proofs and arguments, because debate was apparently too s...
trending6
01 02 The Small-Field Turn in Succinct Proofs: A Systematization of Finite-Field Choice in Modern SNARKs and STARKs eprint.iacr.orgA field-choice taxonomy for SNARKs/STARKs, explaining why Plonky2/3, Stwo, and Binius ditched the usual big primes.03 SoK: Hash-Based Polynomial Commitments and Low-Degree Tests: From FRI to Basefold, STIR, and WHIR eprint.iacr.orgSoK on FRI lineage, from proximity gaps to Johnson bounds, with the usual transparent SNARK security footnotes.04 Can IOPs over groups give polynomial commitments? Titan says yes, with O(n) commit and O(n^1/4) proofs.05 Post-quantum polynomial commitments over lattices, but can vSIS and JL projections really make multilinear proofs succinct?06 Pushing the boundaries of group-based aggregation with zero-evading generators of low additive complexity eprint.iacr.orgePrint paper on zero-evading generators for group aggregation, with O(n^2+lambda) sampling and the O(n+lambda) open problem, of course.