barretenberg icon indicating copy to clipboard operation
barretenberg copied to clipboard

Pairing-input aggregation in Honk recursive verifier

Open ledwards2225 opened this issue 1 year ago • 1 comments

The Honk recursive verifier is incomplete in the sense that there is no logic for "accumulating" the set of G1 points that constitute the input to a pairing check, i.e. the output of a previous recursive verification. This logic exists for Plonk so we can take inspiration from what's done there, although as usual I suspect there's room for improvement.

Note: One potential wrinkle just occurring to me now is that with Plonk, the G2 points in the pairing are always the same; with Honk, these points depend on the size of the circuit since the degree check will differ. Hopefully there's a simple way to handle this but it needs some thought.

ledwards2225 avatar Apr 03 '24 16:04 ledwards2225

This is an issue relevant for the RollupIVC milestone as well https://github.com/AztecProtocol/barretenberg/milestone/10 but apparently I cannot add two milestones :-? Another thing that occurred to me is that we (might) need to accumulate the pairings from the merge recursive verifiers as well

maramihali avatar Apr 16 '24 10:04 maramihali

Duplicate of https://github.com/AztecProtocol/barretenberg/issues/1059.

lucasxia01 avatar Sep 23 '24 18:09 lucasxia01