feat: Noir recursive proof support

[gkgoat1]

https://noir-lang.org/docs/libraries/standard_library/recursion

I want to verify an IVC proof within another IVC proof, and Noir has support for that in the language. Supporting this would be the easiest way to go about that, but we can also just have a Noir verifier library if needed

[winderica]

The problem with Noir's verify_proof_with_type is that it's only for recursive verification of Barretenberg's proofs, but in folding-based IVC we instead need to perform folding verification in-circuit. These two operations are different in terms of both the interface and the internal logic.

The idea of having a Noir verifier library for folding is interesting though. However, I am not sure whether we have the capacity to implement this, since I can only contribute to the Sonobe project in my spare time, after PSE / the EF decides not to prioritize on it.

Btw there might be some workarounds if you could clarify what "verify an IVC proof within another IVC proof" means. Does it actually refer to PCD, i.e., aggregating proofs in a tree or graph based manner?