浡琀栀猀昀 愀氀氀漀眀攀搀 漀渀氀礀 椀渀 洀愀琀栀 洀漀搀攀䘀䤀䌀匀 愀渀搀慴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
- 370.pdfeprint.iacr.org
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- WHIR: Reed–Solomon Proximity Testing with Super-Fast Verificationeprint.iacr.org
- [2605.01192] Linear-Readout Floors and Threshold Recovery in Computation in Superpositionarxiv.org
- A Gentle Introduction to Yao's Garbled Circuitsweb.mit.edu
- 1043.pdfeprint.iacr.org
- A Time-Space Tradeoff for the Sumcheck Provereprint.iacr.org
- Efficient Detection of Exchangeable Factors in Factor Graphsarxiv.org
- Protogalaxy: Efficient Protostar-style folding of multiple instances[0.72cm]eprint.iacr.org
- Improved decoding algorithms for surface codes under independent bit-flip and phase-flip errorsarxiv.org
- 286.pdfeprint.iacr.org
- 1022.pdfeprint.iacr.org