Title: How does SP1 handle recursive proof composition and are there any performance trade-offs?

[quietBlockchain]

I’ve been exploring the zkVM ecosystem recently and wanted to learn more about how SP1 approaches recursive proof composition.

Does SP1 currently support recursive proofs out of the box, or is that still under development?
And if supported, are there any benchmarks or documentation on the performance trade-offs (e.g., proof size, proving time, verifier cost)?

Understanding how recursion is handled would be helpful in exploring more advanced ZK applications using SP1.
Thanks in advance!