Experiment with coprocessors with recursive zk light client proofs

[austinabell]

Goal for this is to build a minimal example of an application that uses Celestia for DA, and submits a zk state transition proof of the light client proof recursed with the application logic, committing to a new state root.

First step is just to switch the batch proofs to allow recursively verifying itself and committing the program ID, and then building an application that utilizes it.