SnarkMux: Streaming SNARK Aggregation with Constant Online Verification

본문 미리보기

SNARKs let a verifier check an expensive computation via a succinct proof, without re-executing the computation. However, many applications still verify proofs individually, creating verifier load and high fees in replicated or constrained-verifier settings. Existing proof aggregation schemes largely follow the generalized inner product argument (GIPA) line, achieving $O(\log n)$ proof size and verifier work for aggregating $n$ proofs, but remaining costly in practice and operating in batch mode