-
Notifications
You must be signed in to change notification settings - Fork 286
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
Solving cross verification of n-recursed circuits using Domain Separator #1561
Milestone
Comments
@Nashtare would be really helpful if you could take a look. |
Hey @utsavjnn! Apologies for the delay, I was on vacation. Will take a look shortly! |
@utsavjnn I've given it a (quick glance) and dropped some comments. Feel free to reply / clarify / ask me anything if something is unclear :) |
Thanks alot @Nashtare :) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Hey Team,
We have been trying to figure out a Universal Proof Aggregator for Plonky2 circuits. Ideally we want the aggregator circuit to have a constant verification key irrespective of the circuits being aggregated. We have been using multiple recursion levels on individual circuits to reach threshold circuit with constant common data. While this approach solves the issue of rebuilding the aggregator circuit, this introduces a problem of cross verification. We think using a secret domain separator for circuits by the user solves the issue.
Heres the detailed description
https://docs.google.com/document/d/1_Bi7VwTTYxmebJrah74Gr20hvTa3Hy90dWiOlgMZsgU/edit?usp=sharing
Looking forward to hear your thoughts on this.
The text was updated successfully, but these errors were encountered: