arnaucube
arnaucube/sonobePublic Self-hosted repository
sonobe/examples/noir_full_flow.rs
examples/noir_full_flow.rsRaw
  1#![allow(non_snake_case)]
  2#![allow(non_camel_case_types)]
  3#![allow(clippy::upper_case_acronyms)]
  4///
  5/// This example performs the full flow:
  6/// - define the circuit to be folded
  7/// - fold the circuit with Nova+CycleFold's IVC
  8/// - generate a DeciderEthCircuit final proof
  9/// - generate the Solidity contract that verifies the proof
 10/// - verify the proof in the EVM
 11///
 12use ark_bn254::{constraints::GVar, Bn254, Fr, G1Projective as G1};
 13
 14use ark_groth16::Groth16;
 15use ark_grumpkin::{constraints::GVar as GVar2, Projective as G2};
 16
 17use folding_schemes::{
 18    commitment::{kzg::KZG, pedersen::Pedersen},
 19    folding::nova::{
 20        decider_eth::{prepare_calldata, Decider as DeciderEth},
 21        Nova, PreprocessorParam,
 22    },
 23    frontend::{
 24        noir::{load_noir_circuit, NoirFCircuit},
 25        FCircuit,
 26    },
 27    transcript::poseidon::poseidon_canonical_config,
 28    Decider, FoldingScheme,
 29};
 30use std::{env, time::Instant};
 31
 32use solidity_verifiers::{
 33    evm::{compile_solidity, Evm},
 34    utils::get_function_selector_for_nova_cyclefold_verifier,
 35    verifiers::nova_cyclefold::get_decider_template_for_cyclefold_decider,
 36    NovaCycleFoldVerifierKey,
 37};
 38
 39fn main() {
 40    // set the initial state
 41    let z_0 = vec![Fr::from(1)];
 42
 43    // initialize the noir fcircuit
 44    let cur_path = env::current_dir().unwrap();
 45
 46    let circuit_path = format!(
 47        "{}/folding-schemes/src/frontend/noir/test_folder/test_mimc/target/test_mimc.json",
 48        cur_path.to_str().unwrap()
 49    );
 50
 51    let circuit = load_noir_circuit(circuit_path);
 52    let f_circuit = NoirFCircuit {
 53        circuit,
 54        state_len: 1,
 55        external_inputs_len: 0,
 56    };
 57
 58    pub type N = Nova<G1, GVar, G2, GVar2, NoirFCircuit<Fr>, KZG<'static, Bn254>, Pedersen<G2>>;
 59    pub type D = DeciderEth<
 60        G1,
 61        GVar,
 62        G2,
 63        GVar2,
 64        NoirFCircuit<Fr>,
 65        KZG<'static, Bn254>,
 66        Pedersen<G2>,
 67        Groth16<Bn254>,
 68        N,
 69    >;
 70
 71    let poseidon_config = poseidon_canonical_config::<Fr>();
 72    let mut rng = rand::rngs::OsRng;
 73
 74    // prepare the Nova prover & verifier params
 75    let nova_preprocess_params = PreprocessorParam::new(poseidon_config, f_circuit.clone());
 76    let nova_params = N::preprocess(&mut rng, &nova_preprocess_params).unwrap();
 77
 78    // initialize the folding scheme engine, in our case we use Nova
 79    let mut nova = N::init(&nova_params, f_circuit.clone(), z_0).unwrap();
 80
 81    // prepare the Decider prover & verifier params
 82    let (decider_pp, decider_vp) =
 83        D::preprocess(&mut rng, nova_params.clone(), nova.clone()).unwrap();
 84
 85    // run n steps of the folding iteration
 86    for i in 0..5 {
 87        let start = Instant::now();
 88        nova.prove_step(rng, vec![], None).unwrap();
 89        println!("Nova::prove_step {}: {:?}", i, start.elapsed());
 90    }
 91    // verify the last IVC proof
 92    let ivc_proof = nova.ivc_proof();
 93    N::verify(
 94        nova_params.1, // Nova's verifier params
 95        ivc_proof,
 96    )
 97    .unwrap();
 98
 99    let start = Instant::now();
100    let proof = D::prove(rng, decider_pp, nova.clone()).unwrap();
101    println!("generated Decider proof: {:?}", start.elapsed());
102
103    let verified = D::verify(
104        decider_vp.clone(),
105        nova.i,
106        nova.z_0.clone(),
107        nova.z_i.clone(),
108        &nova.U_i,
109        &nova.u_i,
110        &proof,
111    )
112    .unwrap();
113    assert!(verified);
114    println!("Decider proof verification: {}", verified);
115
116    // Now, let's generate the Solidity code that verifies this Decider final proof
117    let function_selector =
118        get_function_selector_for_nova_cyclefold_verifier(nova.z_0.len() * 2 + 1);
119
120    let calldata: Vec<u8> = prepare_calldata(
121        function_selector,
122        nova.i,
123        nova.z_0,
124        nova.z_i,
125        &nova.U_i,
126        &nova.u_i,
127        proof,
128    )
129    .unwrap();
130
131    // prepare the setup params for the solidity verifier
132    let nova_cyclefold_vk = NovaCycleFoldVerifierKey::from((decider_vp, f_circuit.state_len()));
133
134    // generate the solidity code
135    let decider_solidity_code = get_decider_template_for_cyclefold_decider(nova_cyclefold_vk);
136
137    // verify the proof against the solidity code in the EVM
138    let nova_cyclefold_verifier_bytecode = compile_solidity(&decider_solidity_code, "NovaDecider");
139    let mut evm = Evm::default();
140    let verifier_address = evm.create(nova_cyclefold_verifier_bytecode);
141    let (_, output) = evm.call(verifier_address, calldata.clone());
142    assert_eq!(*output.last().unwrap(), 1);
143
144    // save smart contract and the calldata
145    println!("storing nova-verifier.sol and the calldata into files");
146    use std::fs;
147    fs::write(
148        "./examples/nova-verifier.sol",
149        decider_solidity_code.clone(),
150    )
151    .unwrap();
152    fs::write("./examples/solidity-calldata.calldata", calldata.clone()).unwrap();
153    let s = solidity_verifiers::utils::get_formatted_calldata(calldata.clone());
154    fs::write("./examples/solidity-calldata.inputs", s.join(",\n")).expect("");
155}