You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
This repository has been archived by the owner on Dec 3, 2018. It is now read-only.
An incomplete proof is any time that the index is greater than the numLeaves. Not testing this case resulted in a bug, caught by fuzzing. The bug has now been fixed but there's not an explicit test exploring incomplete proofs.
The text was updated successfully, but these errors were encountered:
I think there were some edge cases around the zero values. I forget exactly what I had in mind when I made this issue and why it wasn't simple enough to code up in just a few minutes. Maybe it was, and I was just away from a coding machine?
Sign up for freeto subscribe to this conversation on GitHub.
Already have an account?
Sign in.
An incomplete proof is any time that the index is greater than the numLeaves. Not testing this case resulted in a bug, caught by fuzzing. The bug has now been fixed but there's not an explicit test exploring incomplete proofs.
The text was updated successfully, but these errors were encountered: