Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

[WIP] Pollard functionality #25

Draft
wants to merge 18 commits into
base: main
Choose a base branch
from

Conversation

Davidson-Souza
Copy link
Collaborator

@Davidson-Souza Davidson-Souza commented Jan 24, 2023

This [WIP] PR implements the Pollard data structure and associated logic.

TODO list:

  • Implement basic Pollard
  • Implement Modify as in the Go lib
  • Make it pass our tests from Stump modify
  • Implement proving logic
  • Test multiple addition and deletions
  • Implement caching logic (non-full Pollard)
  • Maybe fuzz it to find edge cases and unhandled exceptions
  • Implement undo

While implementing the verify method, the overall way that verify is
handle was changed. Instead of verify being a proof's method, it now is
exposed by every type of accumulator. They all use a common low-level
api from proof, but we need this because every acc handles roots
differently. Moreover, asking for roots and leaves at API level is
verbose and undesirable.
Davidson-Souza added a commit to Davidson-Souza/rustreexo that referenced this pull request Jun 8, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant