Implement SAP system for DV-Pari #3
Description
Describe the feature
It is possible to convert our existing R1CS constraints into a translation over Squared Arithmetic Program. This means smaller proof. However, it also increases proving time and requires larger data structure as the total number of constraints doubles.
While the steps necessary for the conversion is known, the effect of twice the existing number of constraints on memory needs bit more attention.
This issue requests including SAP system for lower proof size while considering new memory and cpu requirements.
Additional context
No response