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.
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.
A new cryptographic primitive, Affine One-Wayness, enables transparent, post-quantum 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.
