There's a direct tension between verification costs and security level. The bigger the proof, the more computational effort should be required to produce a convincing proof of a false statement. There are ways to kind of push verifier costs under the prover through recursion or something called the fried blow up factor is another way you could do it.
This week, Anna chats with Justin Thaler, Associate Professor at Georgetown. They cover Justin’s academic history and discuss what led him to working on interactive proofs and SNARKs. They also take a look at several other topics such as the Thaler Book Study Group, his earlier work Spartan, comparing the security of different rollups built with SNARKs and STARKs and more.
Here are some additional links for this episode:
Apply for zkSummit9 here: zkSummit9 Ticket Application.
Check out ingonyama.com to learn more about Zero Knowledge Hardware acceleration.
Aleo is a new Layer-1 blockchain that achieves the programmability of Ethereum, the privacy of Zcash, and the scalability of a rollup.
Interested in building private applications? Check out Aleo’s programming language called Leo by visiting http://developer.aleo.org.
You can also participate in Aleo’s incentivized testnet3 by downloading and running a snarkOS node. No sign-up is necessary to participate.
For questions, join their Discord at aleo.org/discord.
If you like what we do: