You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: docs/zkEVM/architecture/zkprover/stark-recursion/index.md
+1-1Lines changed: 1 addition & 1 deletion
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -27,7 +27,7 @@ In the non-recursive case, a PIL specification is transformed into a verifiable
27
27
28
28
Subsequently, CIRCOM takes the above _STARK_ proof as an input and generates an _Arithmetic circuit_ and its corresponding _witness_.
29
29
30
-
The Arithmetic circuit is expressed in terms of its equivalent _Rank-1 Constraint System (R1CS)_, while the _witness_ is actuallly a set of input, intermediate and output values of the circuit wires, satisfying the R1CS.
30
+
The Arithmetic circuit is expressed in terms of its equivalent _Rank-1 Constraint System (R1CS)_, while the _witness_ is actually a set of input, intermediate and output values of the circuit wires, satisfying the R1CS.
31
31
32
32
Finally, _Rapid SNARK_ takes the above Witness together with the _STARK Verifier data_ and generates a _SNARK_ proof corresponding to the previous _STARK_ proof.
0 commit comments