Fold two incoming instances at once so one can fold instances in a binary tree fashion

[srinathsetty]

No description provided.

[ameya-deshmukh]

@srinathsetty is this something you're still keen on adding?

[srinathsetty]

@ameya-deshmukh Yes, certainly!

[pgrinaway]

How complex is this addition? I am curious for two reasons:

• The "tree like" proof carrying data can be nicely parallelized.
• Alternatively, using "straight line" IVC, I would like to make a ZK virtual machine where I can call, from bytecode inside the VM, a recursive verifier. It seems like I can do this if I add constraints for recursive Nova verification to my ZKVM constraints, which seems (please correct me if I'm wrong) like a similar requirement for folding in a binary-tree like fashion.

Thanks for any help & the cool library!