Aug 24, 2022 • 31M

Ok Algebraic Automaton

What exactly counts as a SNARK? Why do some proof systems need structured computation, and what are its limits? Why are boolean circuits so neat? And more!

Open in playerListen on);

Appears in this episode

Musings about cryptography, software, and technology
Episode details

Topics covered in this episode:

If you enjoyed this episode, and want to get notified when the next one arrives, feel free to subscribe:

If you want even more updates, feel free to follow me on Twitter.