basic

Documentation

Overview

This example defines a basic circuit that given public variables 'a' and 'b', verifies that the Prover knows a secret 'c' that satisfies the Pythagorean equation: a*a + b*b == c*c

We compile the circuit with gnark, build and test a proof, generate an AVM verifier and compile it with puyapy, deploy it to the local network, and simulate on the AVM a proof verification of the generated proof