Uniform polynomial-time modular Frobenius #

Registered multiplication and remainder certificates implement one guarded squaring step. A fold runs that step once per runtime count bit. The modulus is a runtime workspace, and every fold state is bounded by its input length, including when it represents zero. Thus the proof uses one uniform program and never expands an unreduced exponentially large power.