-
Notifications
You must be signed in to change notification settings - Fork 112
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
Arrabbiata: define Challenges structure #3022
base: dw/add-accumulated-challenges
Are you sure you want to change the base?
Arrabbiata: define Challenges structure #3022
Conversation
83db6e4
to
d29b294
Compare
Codecov ReportAttention: Patch coverage is
Additional details and impacted files@@ Coverage Diff @@
## dw/add-accumulated-challenges #3022 +/- ##
================================================================
Coverage ? 76.87%
================================================================
Files ? 262
Lines ? 62165
Branches ? 0
================================================================
Hits ? 47787
Misses ? 14378
Partials ? 0 ☔ View full report in Codecov by Sentry. |
/// Used by the accumulation protocol (folding) to perform a random linear | ||
/// transformation of the witnesses and the public values. | ||
/// Often noted `r` in the paper mentioning "folding protocols". | ||
pub relation_randomiser: F, |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Note that even though it is a challenge, it must be not accumulated by the accumulation scheme.
The goal is to be more explicit on the challenges the protocol defines. It will be easier in the code to refer to a particular name instead of an index. Also, we fix the number of challenges, hoping the structure will be linear in memory and we can enjoy the optimsiation of the CPU cache.