lookup_example.rs

#![allow(unused_imports)]
#![allow(dead_code)]

use std::fs;

use anyhow::Result;
use plonky2::field::types::Field;
use plonky2::iop::witness::{PartialWitness, WitnessWrite};
use plonky2::plonk::circuit_builder::CircuitBuilder;
use plonky2::plonk::circuit_data::{CircuitConfig,CircuitData};
use plonky2::plonk::config::{GenericConfig, PoseidonGoldilocksConfig};
use plonky2::plonk::prover::ProverOptions;
use plonky2::plonk::verifier::{VerifierOptions, HashStatisticsPrintLevel};

//use plonky2::gadgets::lookup;

use env_logger;

pub const N_PRIMES:   usize = 512;
pub const TABLE_SIZE: usize = 512;   // 19*26;

// table of the first 512 prime numbers
pub const PRIMES_TABLE: [u16; N_PRIMES]  = [
    2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 
    67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 
    139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 
    223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 
    293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 
    383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 
    463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 
    569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 
    647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 
    743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 
    839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 
    941, 947, 953, 967, 971, 977, 983, 991, 997, 1009, 1013, 1019, 1021, 
    1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069, 1087, 1091, 1093, 
    1097, 1103, 1109, 1117, 1123, 1129, 1151, 1153, 1163, 1171, 1181, 
    1187, 1193, 1201, 1213, 1217, 1223, 1229, 1231, 1237, 1249, 1259, 
    1277, 1279, 1283, 1289, 1291, 1297, 1301, 1303, 1307, 1319, 1321, 
    1327, 1361, 1367, 1373, 1381, 1399, 1409, 1423, 1427, 1429, 1433, 
    1439, 1447, 1451, 1453, 1459, 1471, 1481, 1483, 1487, 1489, 1493, 
    1499, 1511, 1523, 1531, 1543, 1549, 1553, 1559, 1567, 1571, 1579, 
    1583, 1597, 1601, 1607, 1609, 1613, 1619, 1621, 1627, 1637, 1657, 
    1663, 1667, 1669, 1693, 1697, 1699, 1709, 1721, 1723, 1733, 1741, 
    1747, 1753, 1759, 1777, 1783, 1787, 1789, 1801, 1811, 1823, 1831, 
    1847, 1861, 1867, 1871, 1873, 1877, 1879, 1889, 1901, 1907, 1913, 
    1931, 1933, 1949, 1951, 1973, 1979, 1987, 1993, 1997, 1999, 2003, 
    2011, 2017, 2027, 2029, 2039, 2053, 2063, 2069, 2081, 2083, 2087, 
    2089, 2099, 2111, 2113, 2129, 2131, 2137, 2141, 2143, 2153, 2161, 
    2179, 2203, 2207, 2213, 2221, 2237, 2239, 2243, 2251, 2267, 2269, 
    2273, 2281, 2287, 2293, 2297, 2309, 2311, 2333, 2339, 2341, 2347, 
    2351, 2357, 2371, 2377, 2381, 2383, 2389, 2393, 2399, 2411, 2417, 
    2423, 2437, 2441, 2447, 2459, 2467, 2473, 2477, 2503, 2521, 2531, 
    2539, 2543, 2549, 2551, 2557, 2579, 2591, 2593, 2609, 2617, 2621, 
    2633, 2647, 2657, 2659, 2663, 2671, 2677, 2683, 2687, 2689, 2693, 
    2699, 2707, 2711, 2713, 2719, 2729, 2731, 2741, 2749, 2753, 2767, 
    2777, 2789, 2791, 2797, 2801, 2803, 2819, 2833, 2837, 2843, 2851, 
    2857, 2861, 2879, 2887, 2897, 2903, 2909, 2917, 2927, 2939, 2953, 
    2957, 2963, 2969, 2971, 2999, 3001, 3011, 3019, 3023, 3037, 3041, 
    3049, 3061, 3067, 3079, 3083, 3089, 3109, 3119, 3121, 3137, 3163, 
    3167, 3169, 3181, 3187, 3191, 3203, 3209, 3217, 3221, 3229, 3251, 
    3253, 3257, 3259, 3271, 3299, 3301, 3307, 3313, 3319, 3323, 3329, 
    3331, 3343, 3347, 3359, 3361, 3371, 3373, 3389, 3391, 3407, 3413, 
    3433, 3449, 3457, 3461, 3463, 3467, 3469, 3491, 3499, 3511, 3517, 
    3527, 3529, 3533, 3539, 3541, 3547, 3557, 3559, 3571, 3581, 3583, 
    3593, 3607, 3613, 3617, 3623, 3631, 3637, 3643, 3659, 3671 
    ];

fn find_prime(what0 : usize) -> Result<usize,()> {
  let what: u16 = what0 as u16;
  let mut res = Err(());
  for i in 0..N_PRIMES {
    if PRIMES_TABLE[i] == what {
      res = Ok(i);
      break;
    }
  }
  res
}

//
// 210*n + 199 is prime for 0 <= n <= 9
// the first 512 primes contain all this
// let's try and prove this with a lookup
//
// q[i] = a*i + b
//
// The public inputs are `a = 210` and `b = 199`
//

fn main() -> Result<()> {
    const D: usize = 2;
    type C = PoseidonGoldilocksConfig;
    type F = <C as GenericConfig<D>>::F;

    let nn = 10;
    let aa = 210;
    let bb = 199;

    env_logger::init();

    let config = CircuitConfig::standard_recursion_config();
    let mut builder = CircuitBuilder::<F, D>::new(config);

    let indices: [u16; TABLE_SIZE] = core::array::from_fn( |i| i as u16 );
    let my_lut_index = builder.add_lookup_table_from_table( &PRIMES_TABLE[..TABLE_SIZE] , &indices );

    // The arithmetic circuit.
    let the_a    = builder.add_virtual_target();
    let the_b    = builder.add_virtual_target();
    let mut sum_idx = builder.constant(F::ZERO);
    let mut sum_seq = builder.constant(F::ZERO);
    for i in 0..nn {

        let mult = builder.constant(F::from_canonical_usize(i));
        let this = builder.mul_add(mult, the_a, the_b);           // x*y + z

        sum_seq = builder.add(sum_seq, this);

/*
        // debugging only
        let candidate: usize = aa*i + bb;
        let res_idx = find_prime(candidate);
        println!("index of {} is {:?}",candidate,res_idx);
*/

        let out = builder.add_lookup_from_index( this, my_lut_index );
        sum_idx = builder.add(sum_idx, out);

    }

    // Public inputs are the two initial values (provided below) and the result (which is generated).
    builder.register_public_input(the_a);
    builder.register_public_input(the_b);
    builder.register_public_input(sum_idx);
    builder.register_public_input(sum_seq);

    // Provide initial values.
    let mut pw = PartialWitness::new();
    pw.set_target(the_a, F::from_canonical_usize(aa))?;
    pw.set_target(the_b, F::from_canonical_usize(bb))?;

    let data: CircuitData<F,C,D> = builder.build::<C>();

    let prover_opts = ProverOptions {
        export_witness: Some(String::from("lookup_witness.json")),
        print_hash_statistics: HashStatisticsPrintLevel::None,
    };
    let proof = data.prove_with_options(pw, &prover_opts)?;

    // serialize circuit into JSON
    let common_circuit_data_serialized        = serde_json::to_string(&data.common       ).unwrap();
    let verifier_only_circuit_data_serialized = serde_json::to_string(&data.verifier_only).unwrap();
    let proof_serialized                      = serde_json::to_string(&proof             ).unwrap();
    fs::write("lookup_common.json"  , common_circuit_data_serialized)       .expect("Unable to write file");
    fs::write("lookup_vkey.json"    , verifier_only_circuit_data_serialized).expect("Unable to write file");
    fs::write("lookup_proof.json"   , proof_serialized)                     .expect("Unable to write file");

    println!("the arithmetic progression `q[i] := {}*i + {}` for 0<=i<{} are all primes!",proof.public_inputs[0],proof.public_inputs[1],nn);
    println!("sum of the indices of these primes = {}",proof.public_inputs[2]);
    println!("and the sum of the actual primes   = {}",proof.public_inputs[3]);
    
    let res = data.verify(proof);

    res
}