feat: mixed tree level proofs #230
Merged
Conversation
This file contains 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
QuantumExplorer
approved these changes
Jan 16, 2023
QuantumExplorer
approved these changes
Jan 16, 2023
QuantumExplorer
approved these changes
Jan 16, 2023
QuantumExplorer
approved these changes
Jan 16, 2023
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.
Issue being fixed or feature implemented
Allow proofs to add elements from different tree levels to the result set.
What was done?
If an element encountered through a query, has no subquery value (default or conditional) and no subquery path (translation), it gets added to the result set.
We achieve this by reducing the limit offset values deterministically, across both proof generation and verification.
How Has This Been Tested?
Added unit tests.
Breaking Changes
Checklist:
For repository code-owners and collaborators only