feat: add short-hash wrappers for recursion#884
Merged
Conversation
72d5d8e to
c99c6f5
Compare
ThomasPiellard
approved these changes
Oct 25, 2023
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
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.
Description
This PR adds hash function wrappers which allow to hash elements in the current field and return an output in the target field. If necessary, we cut the excess bits. We add both native and in-circuit implementation so that we can compute recursive proofs and verify in-circuit.
Related #848. I think this PR is sufficient for recursion purporses.
Subtask of #847 and related to PR #880 (cherry picked from).
Type of change
How has this been tested?
How has this been benchmarked?
Not benchmarked.
Checklist:
golangci-lintdoes not output errors locally