The chapter delves into Rekkel trees, which store recursive proofs for specific subsets of Merkle trees and enable computations on historic data. It explains the efficiency of computing proofs in a massively parallelizable manner in a blockchain setting. The discussion also covers the development of a Verifiable Database System called Supercells based on Rekkel trees, mapping SQL operators to the MapReduce framework for verifiability and exploring challenges in query decomposition.

Get the Snipd
podcast app

Unlock the knowledge in podcasts with the podcast player of the future.
App store bannerPlay store banner

AI-powered
podcast player

Listen to all your favourite podcasts with AI-powered features

Discover
highlights

Listen to the best highlights from the podcasts you love and dive into the full episode

Save any
moment

Hear something you like? Tap your headphones to save it with AI-generated key takeaways

Share
& Export

Send highlights to Twitter, WhatsApp or export them to Notion, Readwise & more

AI-powered
podcast player

Listen to all your favourite podcasts with AI-powered features

Discover
highlights

Listen to the best highlights from the podcasts you love and dive into the full episode