feat: evalMod_heap_{add/remove}Bit proofs#24
Merged
Merged
Conversation
osmanyasar05
changed the title
osmanyasar05
changed the title
evalMod_heap_{add/remove}Bit proofs
osmanyasar05
commented
Jun 26, 2026
Collaborator
Author
|
I addressed Sid's comment that was given on Zulip, hiding the set/setIfInBounds behind a new definition. Simplified the proofs as well. I am now merging this. |
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.
This PR introduces completed proof for the theorems
evalMod_heap_addBit,evalMod_heap_removeBitand introduces a new evaluation function based on Horner's method.