 Hi, my name is Justin and I'll be talking about faster sounder succinct arguments in IOPs, which is a joint work with Ron Rothblum succinct arguments allow a prover to convince the verifier that a computation was performed correctly using a short proof a Major bottleneck in the adoption of succinct arguments, which has been the focus of a large body of work is in reducing the overhead incurred by the prover Here by overhead, I mean the cost of proving correctness divided by the cost of the original computation In this work for a large class of Boolean circuits see we construct succinct arguments for the corresponding circuit satisfiability language, where if We want to achieve soundness error two to the minus lambda, our prover will have overhead that is poly logarithmic in lambda This result relies on the existence of sub-explanatory secure collision-adjusted hash functions that are computable by linear size circuits I won't fully specify the class of Boolean circuits that we can handle, but it includes many natural types of structured circuits including batch computation circuits or iterated hashing circuits we obtain our succinct arguments by Constructing interactive oracle proofs or IOPs for the same class of circuits with analogous efficiency parameters that is to say The overhead of the prover in our IOP is poly logarithmic in the security parameter Prior to our work the best IOPs or arguments for Boolean circuits either had a prover overhead That was poly logarithmic in the circuit size or polynomial in the security parameter If you'd like to hear more about this result, please come to my talk or read our paper Thank you