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 std::path::PathBuf;
 18use std::time::Instant;
 19
 20use folding_schemes::{
 21    commitment::{kzg::KZG, pedersen::Pedersen},
 22    folding::nova::{
 23        decider_eth::{prepare_calldata, Decider as DeciderEth},
 24        Nova, PreprocessorParam,
 25    },
 26    frontend::{circom::CircomFCircuit, FCircuit},
 27    transcript::poseidon::poseidon_canonical_config,
 28    Decider, FoldingScheme,
 29};
 30use solidity_verifiers::{
 31    evm::{compile_solidity, Evm},
 32    utils::get_function_selector_for_nova_cyclefold_verifier,
 33    verifiers::nova_cyclefold::get_decider_template_for_cyclefold_decider,
 34    NovaCycleFoldVerifierKey,
 35};
 36
 37fn main() {
 38    // set the initial state
 39    let z_0 = vec![Fr::from(3_u32)];
 40
 41    // set the external inputs to be used at each step of the IVC, it has length of 10 since this
 42    // is the number of steps that we will do
 43    let external_inputs = vec![
 44        vec![Fr::from(6u32), Fr::from(7u32)],
 45        vec![Fr::from(8u32), Fr::from(9u32)],
 46        vec![Fr::from(10u32), Fr::from(11u32)],
 47        vec![Fr::from(12u32), Fr::from(13u32)],
 48        vec![Fr::from(14u32), Fr::from(15u32)],
 49        vec![Fr::from(6u32), Fr::from(7u32)],
 50        vec![Fr::from(8u32), Fr::from(9u32)],
 51        vec![Fr::from(10u32), Fr::from(11u32)],
 52        vec![Fr::from(12u32), Fr::from(13u32)],
 53        vec![Fr::from(14u32), Fr::from(15u32)],
 54    ];
 55
 56    // initialize the Circom circuit
 57    let r1cs_path = PathBuf::from(
 58        "./folding-schemes/src/frontend/circom/test_folder/with_external_inputs.r1cs",
 59    );
 60    let wasm_path = PathBuf::from(
 61        "./folding-schemes/src/frontend/circom/test_folder/with_external_inputs_js/with_external_inputs.wasm",
 62    );
 63
 64    let f_circuit_params = (r1cs_path, wasm_path, 1, 2);
 65    let f_circuit = CircomFCircuit::<Fr>::new(f_circuit_params).unwrap();
 66
 67    pub type N = Nova<G1, GVar, G2, GVar2, CircomFCircuit<Fr>, KZG<'static, Bn254>, Pedersen<G2>>;
 68    pub type D = DeciderEth<
 69        G1,
 70        GVar,
 71        G2,
 72        GVar2,
 73        CircomFCircuit<Fr>,
 74        KZG<'static, Bn254>,
 75        Pedersen<G2>,
 76        Groth16<Bn254>,
 77        N,
 78    >;
 79
 80    let poseidon_config = poseidon_canonical_config::<Fr>();
 81    let mut rng = rand::rngs::OsRng;
 82
 83    // prepare the Nova prover & verifier params
 84    let nova_preprocess_params = PreprocessorParam::new(poseidon_config, f_circuit.clone());
 85    let nova_params = N::preprocess(&mut rng, &nova_preprocess_params).unwrap();
 86
 87    // initialize the folding scheme engine, in our case we use Nova
 88    let mut nova = N::init(nova_params.clone(), f_circuit.clone(), z_0).unwrap();
 89
 90    // prepare the Decider prover & verifier params
 91    let (decider_pp, decider_vp) = D::preprocess(&mut rng, &nova_params, nova.clone()).unwrap();
 92
 93    // run n steps of the folding iteration
 94    for (i, external_inputs_at_step) in external_inputs.iter().enumerate() {
 95        let start = Instant::now();
 96        nova.prove_step(rng, external_inputs_at_step.clone())
 97            .unwrap();
 98        println!("Nova::prove_step {}: {:?}", i, start.elapsed());
 99    }
100
101    let start = Instant::now();
102    let proof = D::prove(rng, decider_pp, nova.clone()).unwrap();
103    println!("generated Decider proof: {:?}", start.elapsed());
104
105    let verified = D::verify(
106        decider_vp.clone(),
107        nova.i,
108        nova.z_0.clone(),
109        nova.z_i.clone(),
110        &nova.U_i,
111        &nova.u_i,
112        &proof,
113    )
114    .unwrap();
115    assert!(verified);
116    println!("Decider proof verification: {}", verified);
117
118    // Now, let's generate the Solidity code that verifies this Decider final proof
119    let function_selector =
120        get_function_selector_for_nova_cyclefold_verifier(nova.z_0.len() * 2 + 1);
121
122    let calldata: Vec<u8> = prepare_calldata(
123        function_selector,
124        nova.i,
125        nova.z_0,
126        nova.z_i,
127        &nova.U_i,
128        &nova.u_i,
129        proof,
130    )
131    .unwrap();
132
133    // prepare the setup params for the solidity verifier
134    let nova_cyclefold_vk = NovaCycleFoldVerifierKey::from((decider_vp, f_circuit.state_len()));
135
136    // generate the solidity code
137    let decider_solidity_code = get_decider_template_for_cyclefold_decider(nova_cyclefold_vk);
138
139    // verify the proof against the solidity code in the EVM
140    let nova_cyclefold_verifier_bytecode = compile_solidity(&decider_solidity_code, "NovaDecider");
141    let mut evm = Evm::default();
142    let verifier_address = evm.create(nova_cyclefold_verifier_bytecode);
143    let (_, output) = evm.call(verifier_address, calldata.clone());
144    assert_eq!(*output.last().unwrap(), 1);
145
146    // save smart contract and the calldata
147    println!("storing nova-verifier.sol and the calldata into files");
148    use std::fs;
149    fs::write(
150        "./examples/nova-verifier.sol",
151        decider_solidity_code.clone(),
152    )
153    .unwrap();
154    fs::write("./examples/solidity-calldata.calldata", calldata.clone()).unwrap();
155    let s = solidity_verifiers::utils::get_formatted_calldata(calldata.clone());
156    fs::write("./examples/solidity-calldata.inputs", s.join(",\n")).expect("");
157}