Episode

#128 Untangling: Verifiable Compute w/ Leo Fan

Podcast
Untangling Web3
Published
Apr 22, 2026
Duration seconds
2722
Processing state
not_requested
Canonical source
https://rss.com/podcasts/untanglingweb3/2756650
Audio
https://content.rss.com/episodes/211560/2756650/untanglingweb3/2026_04_22_09_32_36_cf180841-d965-4a49-9853-b5b041702223.mp3
JSON
/v1/public/podcasts/untangling-web3-6400051/episodes/128-untangling-verifiable-compute-w-leo-fan
Markdown
/podcast/untangling-web3-6400051/128-untangling-verifiable-compute-w-leo-fan.md

Actions

  • POST https://stenobird.com/v1/public/podcasts/untangling-web3-6400051/episodes/128-untangling-verifiable-compute-w-leo-fan/transcription-requests
    Idempotently request low-priority transcript generation for this episode.
  • GET https://stenobird.com/podcast/untangling-web3-6400051/128-untangling-verifiable-compute-w-leo-fan.md
    Read the agent-friendly Markdown representation of this episode resource.

Summary

As AI, cloud infrastructure, and blockchain systems scale, one critical issue remains unresolved: trust in compute. Today, most computation—whether powering AI models or executing financial transactions—operates as a black box. In this episode of Untangling Web3, Leo Fan, founder and CEO of Cysic, explores how verifiable compute and zero-knowledge proofs can transform computation into something that is not just fast and scalable, but provably correct. Key highlights: Why Verifiable Compute Matters in an AI-Driven World: Modern compute infrastructure has been optimized for performance and scale, not for verifiability. As computation moved from local machines to centralized cloud providers and data centers, users increasingly lost visibility into how results are produced. This becomes critical with AI systems, where outputs are often trusted without insight into the underlying process. Verifiable compute introduces a new trust model: instead of trusting a provider, users can independently verify that a computation was executed correctly. Zero-Knowledge Proofs as the Foundation of Trustless Compute Zero-knowledge (ZK) proofs enable computation to produce a compact, cryptographic “proof” alongside its output, certifying correctness without requiring re-execution. This transforms compute into something that can be verified quickly—even on low-power devices—while being executed on high-performance infrastructure. In blockchain systems, this replaces the need for every validator to re-run all computations, dramatically improving scalability. In AI, it allows developers to prove that a specific model, input, and workflow were used, even if the underlying system remains partially opaque. From Black Boxes to Verifiable Systems: Verifiable compute bridges AI, blockchain, and dece…