Is it possible to compute signature verification outside gnark, store intermediate values and reuse them when generating zk proofs?

[praveensankar]

I have a circuit that performs signature verification and hash verification:

Verify(PK, msg) == sig
H(date) == Hash1

A user generates a new ZK proof for each new date. However, the signature verification part does not use any dynamic data.
Is it possible to compute signature verification outside of gnark to optimize proof generation times, since multiple proofs for the same user use the same signature?

[ivokub]

If I understand correctly, then you want to prove part of the circuit once and then only prove the rest of the circuit for every unique input? In that case it is not possible as proof computation includes both circuit solving (computing all intermediate values) and proving itself. First, the circuit solving is a stateful operation (with internal caches etc) and we don't have a serialization of these working objects. Secondly, proving requires converting between different bases which requires access to the full witness (FFT), so we cannot do it partially.

[praveensankar]

Thank you for the information.