fix(verify): prevent compressed proof memory exhaustion - #3153
Open
felix314159 wants to merge 1 commit into
Open
felix314159 wants to merge 1 commit into
felix314159 wants to merge 1 commit into
Conversation
This branch has not been deployed
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Summary
decode compressed proofs directly from
zstd::Decoderinstead of fully inflating them before validation. this pr prevents malformed proof submissions from exhausting verifier memory while preserving strict trailing-byte rejection.i also added a unit test that generates a sub-64 KiB payload representing 512 MiB of decompressed data and confirms decoding stops after the four-byte invalid codec version