AI-powered
podcast player
Listen to all your favourite podcasts with AI-powered features
Episode 333: Verifiable SQL, Reckle Trees and ZK Coprocessing with Lagrange Labs
Zero Knowledge
Understanding the Power of Recceletrees
1min Snip
00:00
Summary
Transcript
Episode notes
Not all snarks rely on Merkle trees; some, like Brough 16, utilize alternatives such as FRI for snarking while employing Merkle trees for proving and verification processes. The integration of recursion through recceletrees offers significant benefits over traditional Merkle trees, as it enables proof of arbitrary computations rather than merely the inclusion of a leaf. This distinction emphasizes the computational capability of recceletrees, allowing for a broader range of verifiable actions, which could lead to advancements in cryptographic proofs.
Get the Snipd
podcast app
Unlock the knowledge in podcasts with the podcast player of the future.
AI-powered
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