Cryptography & Post-Quantum› Zero-Knowledge Proofs›SNARKs: Succinct Arguments, the Arithmetic-Circuit Pipeline, and the Trusted-Setup Question

In this series

Zero-Knowledge Proofs

1Interactive Proofs and Zero-Knowledge, Defined: Completeness, Soundness, and the SimulatorResearch
2From Interactive to Non-Interactive: Fiat-Shamir, Commitments, and the Random-Oracle CaveatResearch
3SNARKs: Succinct Arguments, the Arithmetic-Circuit Pipeline, and the Trusted-Setup QuestionResearch
4STARKs and Transparency: Hash-Based, Post-Quantum-Plausible Proofs Without Trusted SetupResearch
5Proving an ML Inference: zkML, the Committed-Input Guarantee, and the Honest CostResearch

← All research

HostExpert

Murali Chillakuru

Press play to begin the walkthrough.

0:00

7:23

Zero-Knowledge Proofs · 3 / 5

SNARKs: Succinct Arguments, the Arithmetic-Circuit Pipeline, and the Trusted-Setup Question

Back