zkDaily - 2026-05-08

零知识证明 zkDaily

ZKP Frontier Tracker 🎯

Fri

05.08

2026

Field-Agnostic SNARKs with Small Proofs via Encode-Repeat-Accumulate (ERA) Codes

Paper

https://eprint.iacr.org/2026/864

Anubhav Baweja field-agnostic IOPP

Baweja et al. proposed a new family of linear-time encodable field-agnostic codes, ERA, and an efficient IOPP for them, achieving small proof sizes in hash-based SNARKs.

Notes

ERA codes achieve a strong trade-off between encoding time and relative distance.
ERA codes are efficiently codeswitchable, reducing proximity checking to another code.
The IOPP for ERA codes yields concretely small query complexity.
Hash-based SNARKs are transparent and post-quantum secure.
Field-agnosticism enables proofs over arbitrary fields.

Collected by @icerdesign

零知识证明 zkDaily

Q&A Deep Dive 💬

Fri

05.08

2026

What are ERA codes?

ERA (Encode-Repeat-Accumulate) codes are a new family of error-correcting codes designed for fast encoding and strong error-correction properties in hash-based SNARKs.

Why are error-correcting codes important for SNARKs?

Many transparent SNARKs use error-correcting codes and IOPPs for low-degree testing and consistency checks, so code quality directly affects proof size and proving speed.

What advantages do ERA codes provide over prior approaches?

ERA codes combine linear-time encoding with strong distance properties, reducing proof size while maintaining efficient proving.

Prompted by @icerdesign