: This reflects the design of Plonk. Perhaps we should author new classes to better reflect the structure of the newer code since there's much more of that code now?
The transcript aggregation protocol in the Goblin proof system can not yet support an empty "previous
transcript" (see issue #723) because the corresponding commitments are zero / the point at infinity. This function mocks the interactions with the op queue of a fictional "first" circuit. This way, when we go to generate a proof over our first "real" circuit, the transcript aggregation protocol can proceed nominally. The mock data is valid in the sense that it can be processed by all stages of Goblin as if it came from a genuine circuit.