Sequential computation is a process where operations are performed one after another in a defined order. In contrast to parallel processing, each step must be completed before the next can begin. This method is fundamental to many algorithms and system designs, including those underpinning smart contract execution.
Context
Discussions regarding sequential computation in blockchain technology often arise in the context of transaction processing and smart contract execution efficiency. Improving sequential processing capabilities without compromising security or decentralization remains a key area of research and development for many networks.
VDFs are sequential cryptographic timekeepers that make randomness manipulation computationally prohibitive, enhancing Proof-of-Stake security and finality.
Cryptanalysis revealed that parallel computation bypasses the sequential time delay in VDFs, challenging the security of verifiable randomness primitives.
This new Cornucopia framework combines Verifiable Delay Functions with accumulators to create a scalable, bias-resistant randomness beacon secure with only one honest participant.
Affine One-Wayness is a new post-quantum cryptographic primitive that enforces provable, clock-independent event ordering, enabling Byzantine-resistant distributed synchronization.
VDFs introduce a cryptographic time-lock that enforces sequential computation, creating a provably fair, unexploitable source of on-chain randomness for secure protocol design.
Cryptographers proved a Verifiable Delay Function's fixed sequential time can be bypassed, challenging its use for secure, fair randomness in Proof-of-Stake.
A novel cryptographic primitive, the Verifiable Delay Function, guarantees a predetermined computation time with rapid, public verification, securing decentralized randomness and fair ordering.
This research significantly reduces the gas cost and proof size for Pietrzak's Verifiable Delay Function on Ethereum, enhancing practical blockchain integration.
This research fundamentally redefines Verifiable Delay Functions, proving their non-existence in the Random Oracle Model, impacting future cryptographic primitive design.
Affine One-Wayness (AOW) is a novel post-quantum cryptographic primitive, securing verifiable temporal ordering in distributed systems without trusted clocks.
We use cookies to personalize content and marketing, and to analyze our traffic. This helps us maintain the quality of our free resources. manage your preferences below.
Detailed Cookie Preferences
This helps support our free resources through personalized marketing efforts and promotions.
Analytics cookies help us understand how visitors interact with our website, improving user experience and website performance.
Personalization cookies enable us to customize the content and features of our site based on your interactions, offering a more tailored experience.
