AI-powered
podcast player
Listen to all your favourite podcasts with AI-powered features
3min chapter
Episode 255: Verifying Consensus On-Chain with Succinct
Zero Knowledge
Getting a Proving Time That's Realistic
I think there was a couple of things. As part of proving this like these BLS signatures, you need to do non-native field arithmetic. And I think a lot of people were just averse to doing something like that. But it turns out when you actually do it and you implement a bunch of optimizations, it actually does become like pretty possible to get a proving time that is realistic. Like it's not going to be a provingtime that's one second, but it actually is still quite feasible. We actually have like an end to end working demo of a bridge today from Ethereum and we're using a test net. It's also really not to run or in other situations,
00:00
Transcript
Episode notes
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