This chapter explores the inefficiency of traditional proofs and the computational intensity of verifying computations in the Aztec system. It also discusses the size of range proofs and the compression of elliptic curve points in Aztec.
In this week’s episode, we sit down with Zac Williamson of the Aztec Protocol to discuss zero knowledge tools, range proofs, the Aztec Protocol, the different approaches to bringing privacy to ethereum, and how standards in the space are emerging.
Thanks again to this week's sponsor Neufund. If you’re interested in how Neufund's open-source technical environment is enabling tokenization of real-world assets or the QA position, check their GitHub profile at github.com/neufund or the Neufund job offers at neufund.org/careers