Mira: Efficient Folding for Pairing-based Arguments
Succinct non-interactive arguments of knowledge (SNARKs) are powerful cryptographic primitives that enable a prover to convince a verifier of the validity of a claim with a short proof. These primitives enable verifiable computation, where a client can outsource a difficult task to an untrusted cloud provider and then check via a proof that the task was performed correctly. While theoretical SNARK constructions have been known since the 90s, there have been numerous efforts over the past decades to minimize the prover complexity and proof size for real-world applications....