Non-Parallelizable Delay refers to a computational process that inherently resists being sped up by distributing its work across multiple processors or machines. Such a delay is sequential, meaning each step depends on the completion of the previous one, making parallelization ineffective. This property is intentionally incorporated into certain cryptographic designs to impose a minimum real-world time cost for an attacker. It acts as a security mechanism.
Context
Non-parallelizable delays are a key element in some proof-of-work variations and verifiable delay functions, designed to make certain attacks economically prohibitive. News reports discussing the security models of specific blockchains or the fairness of random number generation might mention this concept. Its application aims to ensure that even with vast computational resources, an attacker cannot significantly reduce the time required to perform a malicious action.
VDFs are sequential cryptographic timekeepers that make randomness manipulation computationally prohibitive, enhancing Proof-of-Stake security and finality.
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.
