Cairo-VM Proof Generation Memory Limits

STARK Proof Generation Resource Constraints

The Cairo-VM execution model separates the initial trace generation from the subsequent STARK proving phase. While the VM execution phase follows a linear memory model, the proving phase translates these computations into algebraic constraints for cryptographic verification.

Because proof generation is computationally intensive, the memory consumption during this phase may scale non-linearly relative to the number of constraints produced by the execution trace. This creates a potential bottleneck where a program that executes successfully within the VM may still fail during the proving stage due to system resource exhaustion.

What are the documented upper bounds for memory consumption during the proving phase relative to the execution trace length? Is there a mechanism to cap the memory usage of the prover without truncating the trace?