Implement code to run the actual aggregation for all circuits

[cedoor]

The sequential aggregation of circuits, as outlined in PR #1365, needs to be divided into two distinct phases:

Phase 1 – Initial Proof Aggregation

1. All nodes generate and aggregate proofs for circuits C0 through C4.
2. These aggregated proofs are sent to the designated aggregator.
3. The aggregator combines the aggregated H‑proof with circuit C5, then publishes the resulting proof on‑chain.

The final proof will publish the commitment of the FHE public key (used for the encrypted computation) + the final commitment of the aggregated proof + honest party ids.

Phase 2 – Wrapper Proof Generation and Final Aggregation

1. The H nodes produce proofs for circuit C6.
2. Each proof is wrapped, and the resulting wrapper proofs are transmitted to the aggregator.
3. The aggregator aggregates these wrapper proofs together with circuit C7 and publishes the final proof on‑chain.

The final proof will publish the plaintext output (the decrypted result) + the final commitment of the aggregated proof.

Goal: Implement the two‑step workflow so that proof generation, aggregation, and on‑chain publication occur in the order described above, ensuring correctness and efficiency throughout both phases.

Additional Requirement

We need to store this vk‑hash on‑chain as a reference for each verification.