[tlaplus] Optimizing proof check time

[Andrew Helwer <andrew.helwer@xxxxxxxxx>]

I've written some arithmetic proofs where the prover does eventually validate the proof, albeit after a fairly long wait time. In general, can one reduce proof check time by breaking down a long-running proof into smaller substeps? Is there a way to check which steps are taking a long time so you know where to focus efforts?

Thanks!

Andrew

-- 
You received this message because you are subscribed to the Google Groups "tlaplus" group.
To unsubscribe from this group and stop receiving emails from it, send an email to tlaplus+unsubscribe@xxxxxxxxxxxxxxxx.
To view this discussion on the web visit https://groups.google.com/d/msgid/tlaplus/CABj%3DxUXEh034sKeX4Tdm21UWZ069Q89hAC9Fb2L9cMFf9oSOjw%40mail.gmail.com.