The Small-Field Turn in Succinct Proofs: A Systematization of Finite-Field Choice in Modern SNARKs and STARKs eprint.iacr.org
A field-choice taxonomy for SNARKs/STARKs, explaining why Plonky2/3, Stwo, and Binius ditched the usual big primes.
trending4
01 02 Undetectable counterfeiting is the bug Zcash is trying to prove impossible, by formally verifying Ironwood's shielded pool.03 fv: permutation & lookup argument soundness + permutation construction (towards #14) by daira · Pull Request #21 · zcash/ironwood github.comLean PR proving Halo2 permutation/lookup soundness and union-find permutation construction, because papers enjoy grand products.04 A recursive shard proof can pass SP1’s verifier while the native one rejects it; NVD says 6.0.0–6.0.2 were affected.