Update README.md

README.md

@@ -1,6 +1,6 @@
 # gnark-plonky2-verifier
 
-This is an in-progress implementation of a [Plonky2](https://github.com/mir-protocol/plonky2) verifier in Gnark. It currently is able to verify some dummy circuits, but not much more as many of the custom gates used in Plonky2 are currently not implemented.
+This is an in-progress implementation of a [Plonky2](https://github.com/mir-protocol/plonky2) verifier in Gnark (supports Groth16 and PLONK). It currently is able to verify some dummy circuits, but not much more as many of the custom gates used in Plonky2 are currently not implemented.
 
 Besides the verifier, there are some Gnark implementation of circuits in this repo that may be useful for other projects:
 
@@ -35,4 +35,4 @@ Verifying proof 2023-03-28 11:19:10.169636 -0700 PDT m=+901.808314709
 bn254 2023-03-28 11:19:10.175992 -0700 PDT m=+901.814670834
 ```
 
-The circuit can be significantly optimized by using more efficient arithmetic for Goldilocks, among other things.
+The circuit can be significantly optimized by using more efficient arithmetic for Goldilocks, among other things.