The Delphi Podcast cover image

Ethereum & Celestia: Designing Modular Stacks

The Delphi Podcast

00:00

Is There a Constraint in the Frod Proof?

If you vote every six minutes, say, for example, which would already be very slow to block time, you would have to be sure that the frod proof will be constructed in six minutes. Whereas here, there's no such there's nosuch constraint riht. After you vote, it's ok if it, say, took one hour to reconstruct, which is very unreasonable, i think, to think that we'll take that lock. For fortin, perhaps that's the case, but i would definitely like a kind of more conclusive analysis on this particular case. I could agu that that cannot happen. But if, for instance, there was too high a the latency

Play episode from 40:54
Transcript

The AI-powered Podcast Player

Save insights by tapping your headphones, chat with episodes, discover the best highlights - and more!
App store bannerPlay store banner
Get the app