Solving cross verification of n-recursed circuits using Domain Separator

[utsavjnn]

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.

[utsavjnn]

@Nashtare would be really helpful if you could take a look.

[Nashtare]

Hey @utsavjnn! Apologies for the delay, I was on vacation. Will take a look shortly!

[Nashtare]

@utsavjnn I've given it a (quick glance) and dropped some comments. Feel free to reply / clarify / ask me anything if something is unclear :)

[utsavjnn]

Thanks alot @Nashtare :)