Scalable and Transparent Proofs over All Large Fields, via Elliptic Curves (ECFFT part II)

ePrint Report: Scalable and Transparent Proofs over All Large Fields, via Elliptic Curves (ECFFT part II)

Eli Ben-Sasson, Dan Carmon, Swastik Kopparty, David Levit

Concretely efficient interactive oracle proofs (IOPs) are of interest due to their applications to scaling blockchains, their minimal security assumptions, and their potential future-proof resistance to quantum attacks.


Scalable IOPs, in which prover time scales quasilinearly with the computation size and verifier time scales poly-logarithmically with it, have been known to exist thus far only over …

elliptic eprint report large