Haseeb-Qureshi

Transparent Succinct Arguments

Alessandro Chiesa (UC Berkeley, Starkware, Zcash)

What are succinct arguments?

• Proofs of computational integrity
• Game between prover and verifier
• Prover knows an input to a F(x) that would make it return y
• Prover could trivially prove this by providing x
  • This convinces the verifier for sure!
• Being able to convince the verifier of a true claim is the property of completeness