neo-go/examples/zkp/cubic_circuit
Anna Shaleva b285cf8c6e zkp: bump golang.org/x/crypto from 0.26.0 to 0.31.0
Signed-off-by: Anna Shaleva <shaleva.ann@nspcc.ru>
2024-12-13 19:38:07 +03:00
..
go.mod zkp: bump golang.org/x/crypto from 0.26.0 to 0.31.0 2024-12-13 19:38:07 +03:00
go.sum zkp: bump golang.org/x/crypto from 0.26.0 to 0.31.0 2024-12-13 19:38:07 +03:00
main.go examples: fix linter issues 2024-10-11 12:24:02 +03:00
main_test.go examples: fix linter issues 2024-10-11 12:24:02 +03:00
README.md examples: add one more source of suitable response* files for Groth16 2023-11-28 17:00:33 +03:00
response8 examples: add production CRS generation instructions for ZKP examples 2023-10-05 13:45:58 +03:00

Example description

This example demonstrates how to create your own circuit and generate Groth-16 proof based on BLS12-381 elliptic curve points with the help of consensys/gnark. It also shows how to generate, deploy and invoke Verifier smart contract to verify proofs for the given circuit on the Neo chain with the help of zkpbindings NeoGo package. The package also contains circuit tests implemented with gnark/test to check the circuit validity and end-to-end proof generation/verification test implemented with neotest to demonstrate how to build, deploy and verify proofs via Verifier smart contract for the given circuit.

Groth-16 setup notes

Common reference string (CRS) is needed to generate proving and verifying keys for the given constrained system. In production environment, CRS generation can be performed via Multi-Party Computation (MPC) ceremony that includes two phases: Phase 1 (a.k.a. Powers of Tau) that is curve-specific and those results may be used by all circuits; and Phase 2 that is circuit-specific and uses the result of Phase 1 as an input.

For testing setups, check out the TestCubicCircuit_EndToEnd keys generation stage. For production usage, read the information below.

Both phases for BLS12-381 curve can be implemented in the Go programming language using the corresponding consensys/gnark API (see the test example) and the example of a CLI tool that uses the API with BN254 elliptic curve to organize the ceremony and generate proving and verifying keys for a circuit. However, both phases take a significant amount of time and computations to be performed. Luckily for the developers, it is possible to omit a curve-specific part of the MPC and reuse the existing results of Phase 1 got from a trusted source, e.g. from Zcash PowersOfTau held by the Zcash Foundation. TestCubicCircuit_EndToEnd_Prod test of the current circuit example demonstrates how to use the response output file from the Phase 1 of the Filecoin's Powers of Tau ceremony for BLS12-381 curve:

  • response8 file is the response output from the ceremony that was run locally based on the Filecoin Powers of Tau with the REQUIRED_POWER set to 8 (to reduce computations and response file size). The ceremony itself was run with the help of testing script. To get the response file for a production environment, the user has two options:
    1. Organize his own ceremony with required number of powers following the guide from the ceremony source repo.
    2. Download the existing suitable response file from the trusted existing ceremony. Please, be careful while choosing response file and ensure that it has enough powers computed (at least as much as the number of the circuit's constraints requires). Example of suitable ceremonies:
  • main_test contains the TestCubicCircuit_EndToEnd_Prod test itself and demonstrates how to properly initialize Phase 2 based on the given response file and make some dummy contributions into it.

Take the TestCubicCircuit_EndToEnd_Prod test logic as a basis while generating the circuit-specific proving and verifying keys for the production usage. Currently, we don't have a BLS12-381 specific Groth-16 setup CLI utility like for BN254 curve, but eventually it will be included into the NeoGo toolkit to make the development process easier. Don't hesitate to contact us if you're looking for a similar CLI utility for BLS12-381 curve.