-
Notifications
You must be signed in to change notification settings - Fork 302
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
refactor: bundled-proving-keys #3337
Conversation
Nice!!!! |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
thanks for picking this up!
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
great!
This ensures that proving keys are always checked against hardcoded hashes, regardless of source.
@TalDerei This looks great! I added another commit that merges the check-ID behavior from the existing |
References #2712. A new
LazyProvingKey
type is introduced to represent the proving keys. The limitation with the formerLazy
type was thatLazy::new()
expects a closure. This ultimately creates a tight coupling with the declaration of a static lazy variable and its initialization. TheLazyProvingKey
enables this separation based on the conditionalbundled-proving-keys
feature.This will further reduce the wasm binary size to only include the verification keys, originally from ~90MB to a few MB.