浡琀栀猀昀 愀氀氀漀眀攀搀 漀渀氀礀 椀渀 洀愀琀栀 洀漀搀攀䘀䤀䌀匀 愀渀搀慴hsf allowed only in math modeFACS: Fast IOPPs and Accumulation via Code-Switching
eprint.iacr.org · 10,159 words · saved by 1 readers
N/A
FICS and FACS: Fast IOPPs and Accumulation via Code-Switching Anubhav Baweja Pratyush Mishra Tushar Mopuri Matan Shtepel abaweja@upenn.edu prat@upenn.edu tmopuri@upenn.edu mshtepel@andrew.cmu.edu UPenn UPenn UPenn CMU May 20, 2026 Abstract Recent work on hash-based succinct arguments has focused on using linear-time encodable…
related reading
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- 370.pdfeprint.iacr.org
- WHIR: Reed–Solomon Proximity Testing with Super-Fast Verificationeprint.iacr.org
- 1022.pdfeprint.iacr.org
- 1043.pdfeprint.iacr.org
- 17 misconceptions about SNARKs - a16z cryptoa16zcrypto.com
- Zero Knowledge Proofs: An illustrated primer – A Few Thoughts on Cryptographic Engineeringblog.cryptographyengineering.com
- Flock: Fast Proving for Batch Boolean Computationseprint.iacr.org
- Zinc+: SNARKs for Polynomial Ringseprint.iacr.org
- P lonK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge[0.72cm]eprint.iacr.org
- Binius: highly efficient proofs over binary fieldsvitalik.eth.limo
- Zero-knowledge proof - Wikipediaen.wikipedia.org