Going based off of @tight dome 's comment of "The core of the application is based on proofs though :/ It's mostly mathematical operations and assertions on ifs.", I am imagining they are interested in testing at least the unit-level of their math operations and assertions. They mention proofs, but not necessarily recursion.
So I'm just pointing out that you can pull your logic out of the proof and write unit tests for it that don't care about recursion. You can write tests that your math is right and your ifs are right (to the extent that js tests catch issues with circuit ifs) without compiling any proof.
If what they actually want is to test that the public output of some proof is accessible after some number of rounds of proving, that's another story, but that's not the question I interpreted.