Documentation
¶
Overview ¶
package examples contains examples of circuits and proof verifications that run on the AVM.
Run the examples with `go run main.go` in the package subdirectories. A local network with default configuration is expected to be running. You can use algokit to start one with `algokit localnet start`
Source Files
Directories
¶
| Path | Synopsis |
|---|---|
|
basic
|
|
|
logicsigVerifier
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
|
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 |
|
smartContractVerifier
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
|
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 |
|
merkle
|
|
|
logicsigVerifier
This example defines a circuit that given a public root for a Merkle tree lets the Prover prove the presence in the tree of an element, wihtout revealing it.
|
This example defines a circuit that given a public root for a Merkle tree lets the Prover prove the presence in the tree of an element, wihtout revealing it. |
|
smartContractVerifier
This example defines a circuit that given a public root for a Merkle tree lets the Prover prove the presence in the tree of an element, wihtout revealing it.
|
This example defines a circuit that given a public root for a Merkle tree lets the Prover prove the presence in the tree of an element, wihtout revealing it. |
Click to show internal directories.
Click to hide internal directories.