Verifiable Databases with Shyam & Emanuele from Provably

Verifiable Databases with Shyam & Emanuele from Provably

From Zero Knowledge by Zero Knowledge Podcast

April 8, 2026 · 56 min

About this episode

The episode explores the concept of verifiable databases with insights from the co-founders of Provably, discussing their innovative approach and implications for data integrity.

In this episode, Anna Rose and Nico Mohnblatt speak with Shyam Duraishwami and Emanuele Ragnoli , co-founders of Provably . They trace the origins of Provably, from early work on data ecosystems and blockchain infrastructure to the launch of their verifiable database approach, exploring how advances in cryptography and database theory enabled this shift. The conversation dives into what a verifiable database actually is and how this contrasts with Merkle-based systems and zkVMs, explaining how Provably’s use of polynomial and vector commitments enables performance that scales with query complexity rather than dataset size, opening the door to large-scale, real-world applications. They close with a discussion on emerging applications from proving insights over private blockchain data to enabling verifiable analytics in Web2 and multi-agent systems—and the broader implications for data integrity in an increasingly data-rich world.   Related Links Tavloid: towards Simple Verifiable Spreadsheets and Databases by Campanelli Linear-map Vector Commitments and their Practical Applications by Campanelli, Nitulescu, Ràfols, Zacharakis and Zapico qedb: Expressive and Modular Verifiable…

People in this episode

Hosts: Anna Rose, Nico Mohnblatt

Guests: Shyam Duraishwami, Emanuele Ragnoli

Topics covered

  • verifiable databases
  • cryptography
  • blockchain infrastructure
  • data integrity
  • analytics
  • data ecosystems

Keywords

  • verifiable databases
  • Provably
  • cryptography
  • data integrity
  • blockchain
  • analytics
  • query complexity

Mentioned in this episode

Organizations: Provably, Midnight Network, Hyperledger Fabric, zkMesh+

Books & works: Tavloid: towards Simple Verifiable Spreadsheets and Databases, Linear-map Vector Commitments and their Practical Applications, qedb: Expressive and Modular Verifiable Databases (without SNARKs)

More episodes of Zero Knowledge

Explore listener stats, chart rankings, contacts and more on the Zero Knowledge podcast page.