Definition ∞ A sequential computation proof demonstrates that a computation was performed over a specified, un-parallelizable duration, verifiable by others. This cryptographic construct ensures that a certain amount of real-world time elapsed for a computation to complete, even if the verifier can check the result quickly. It prevents adversaries from rushing computations or front-running outcomes. Such proofs are vital for time-sensitive decentralized protocols.
Context ∞ Sequential computation proofs are an advanced topic in cryptographic research with significant implications for fair transaction ordering and randomness generation in blockchain. News reports on Verifiable Delay Functions often relate to this concept, highlighting their potential to mitigate issues like Maximal Extractable Value. Their development aims to enhance the integrity and predictability of decentralized systems.
Blockchain Knowledge
Cryptocurrency Foundation
Cryptospace Newsfeed
