I have this line:
Provable.if(Bool,A,B)
Suppose A is very easy to compute and B is very complex , does the proof generation time , or space matter with this.
Sometimes the proof generation takes a lot of memory.
When and How to optimise my contract.
Like, for example
I believe that using field.lessthan takes more constraints than field.add, and hence more computation.
What would be a good place to know about these things?