Eylon Yogev

Alessandro Chiesa and Eylon Yogev discuss constructing cryptographic proofs from ideal hash functions, exploring SNARKs and Alessandro's role in ZK systems. They delve into superposition queries, limitations of the random oracle model, and future standardizations. The podcast highlights the importance of systematizing cryptographic proofs for security and efficiency.