Open JKearnsl opened 5 days ago
Hi JKearnsl,
Thanks for following through on the tutorial and going over the code.
Indeed, most of the complexity is commonly found when translating the R1CS into Quadratic Arithmetic Program (QAP) and then the commitment schemes, which we will do soon. Also, have a look at the updated code I've pushed, where I added Finite Fields and a basic QAP.
Also notice that in the code snippet you've shared, we are validating a hash of two inputs without using a secure hash (e.g. SHA2/3). Is that the "so easy" part you're referring to?
Let's keep in touch!
Best, Luis
https://github.com/luishsr/zk-mini/blob/94107c71d6bd97f87202a33c86e5c1a53029ca64/src/circuit.rs#L108-L128