The compliance constraint is a fixed circuit used to verify resource consumption and creation, along with other common logic.
We can use accumulation to aggregate circuits with the same structure (e.g., compliance circuits in Taiga), which is already supported in Halo2. This would amortize the O(n) computation cost in verification, making it an achievable improvement in Taiga right now.
Additionally, if we consider using folding schemes as potential backends, we may greatly benefit from folding compliance instances into one final proof, resulting in improvements for both the prover and verifier and reducing the size of the proof.
The compliance constraint is a fixed circuit used to verify resource consumption and creation, along with other common logic.
We can use accumulation to aggregate circuits with the same structure (e.g., compliance circuits in Taiga), which is already supported in Halo2. This would amortize the O(n) computation cost in verification, making it an achievable improvement in Taiga right now.
Additionally, if we consider using folding schemes as potential backends, we may greatly benefit from folding compliance instances into one final proof, resulting in improvements for both the prover and verifier and reducing the size of the proof.