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