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.

Sign up for GitHub

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

Jump to bottom

More efficient tree building by avoiding full Pedersen hash recalculation #69

Open
kayabaNerve opened this issue Sep 18, 2023 · 0 comments
Open

More efficient tree building by avoiding full Pedersen hash recalculation #69

kayabaNerve opened this issue Sep 18, 2023 · 0 comments
Labels
curve-trees Curve trees library/circuit improvement This could be better

Comments

@kayabaNerve
Copy link
Owner

If we have a branch with children A, B, the Pedersen hash is [A, B] * G. When we add C, we currently calculate [A, B, C] * G. We only have to calculate C * G which can be added to the existing hash.
@kayabaNerve kayabaNerve added improvement This could be better curve-trees Curve trees library/circuit labels Sep 18, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
curve-trees Curve trees library/circuit improvement This could be better
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@kayabaNerve