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
Play full episode
Remember Everything You Learn from Podcasts
Save insights instantly, chat with episodes, and build lasting knowledge - all powered by AI.
