diff --git a/coverage-badge.svg b/coverage-badge.svg
index 27a0a10..06c4532 100644
--- a/coverage-badge.svg
+++ b/coverage-badge.svg
@@ -2,5 +2,5 @@
 <svg xmlns="http://www.w3.org/2000/svg" width="100" height="20">
   <rect width="100" height="20" rx="3" fill="#555"/>
   <rect x="40" width="60" height="20" rx="3" fill="yellow"/>
-  <text x="50%" y="50%" alignment-baseline="middle" text-anchor="middle" fill="#000" font-size="11" font-family="Verdana">Coverage 43.10%</text>
+  <text x="50%" y="50%" alignment-baseline="middle" text-anchor="middle" fill="#000" font-size="11" font-family="Verdana">Coverage 43.23%</text>
 </svg>
diff --git a/tarpaulin-report.html b/tarpaulin-report.html
index 9c7f765..e486dd7 100644
--- a/tarpaulin-report.html
+++ b/tarpaulin-report.html
@@ -118,7 +118,7 @@
 <body>
     <div id="root"></div>
     <script>
-        var data = {"files":[{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-cli","src","constant.rs"],"content":"pub const RECURSION_BRANCHOUT_NUM: usize = 64;\npub const DEFAULT_BATCH_SIZE: usize = 1024;\npub const GLOBAL_PROOF_FILENAME: \u0026str = \"global_proof.json\";\npub const GLOBAL_INFO_FILENAME: \u0026str = \"global_info.json\";\npub const USER_PROOF_DIRNAME: \u0026str = \"user_proofs\";\npub const DEFAULT_USER_PROOF_FILE_PATTERN: \u0026str = \"*_inclusion_proof.json\";\n","traces":[],"covered":0,"coverable":0},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-cli","src","lib.rs"],"content":"pub mod constant;\npub mod prover;\npub mod verifier;\n","traces":[],"covered":0,"coverable":0},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-cli","src","main.rs"],"content":"use std::{path::PathBuf, str::FromStr};\n\nuse clap::{Parser, Subcommand};\nuse zk_por_cli::{\n    constant::{DEFAULT_USER_PROOF_FILE_PATTERN, GLOBAL_PROOF_FILENAME},\n    prover::prove,\n    verifier::{verify_global, verify_user},\n};\nuse zk_por_core::error::PoRError;\n\n#[derive(Parser)]\n#[command(version, about, long_about = None)]\nstruct Cli {\n    #[command(subcommand)]\n    command: Option\u003cZkPorCommitCommands\u003e,\n}\n\npub trait Execute {\n    fn execute(\u0026self) -\u003e std::result::Result\u003c(), PoRError\u003e;\n}\n\n#[derive(Subcommand)]\npub enum ZkPorCommitCommands {\n    Prove {\n        #[arg(short, long)]\n        cfg_path: String, // path to config file\n        #[arg(short, long)]\n        output_path: String, // path to output file\n    },\n    VerifyGlobal {\n        #[arg(short, long)]\n        proof_path: String,\n    },\n\n    VerifyUser {\n        #[arg(short, long)]\n        global_proof_path: String,\n        #[arg(short, long)]\n        user_proof_path_pattern: String,\n    },\n}\n\nimpl Execute for Option\u003cZkPorCommitCommands\u003e {\n    fn execute(\u0026self) -\u003e std::result::Result\u003c(), PoRError\u003e {\n        match self {\n            Some(ZkPorCommitCommands::Prove { cfg_path, output_path }) =\u003e {\n                let cfg = zk_por_core::config::ProverConfig::load(\u0026cfg_path)\n                    .map_err(|e| PoRError::ConfigError(e))?;\n                let prover_cfg = cfg.try_deserialize().unwrap();\n                let output_path = PathBuf::from_str(\u0026output_path).unwrap();\n                prove(prover_cfg, output_path)\n            }\n\n            Some(ZkPorCommitCommands::VerifyGlobal { proof_path: global_proof_path }) =\u003e {\n                let global_proof_path = PathBuf::from_str(\u0026global_proof_path).unwrap();\n                verify_global(global_proof_path, true)\n            }\n\n            Some(ZkPorCommitCommands::VerifyUser {\n                global_proof_path,\n                user_proof_path_pattern,\n            }) =\u003e {\n                let global_proof_path = PathBuf::from_str(\u0026global_proof_path).unwrap();\n                verify_user(global_proof_path, user_proof_path_pattern, true)\n            }\n\n            None =\u003e {\n                println!(\"============Validation started============\");\n                let global_proof_path = PathBuf::from_str(GLOBAL_PROOF_FILENAME).unwrap();\n                let user_proof_path_pattern = DEFAULT_USER_PROOF_FILE_PATTERN.to_owned();\n                if verify_global(global_proof_path.clone(), false).is_ok() {\n                    println!(\"Total sum and non-negative constraint validation passed\")\n                } else {\n                    println!(\"Total sum and non-negative constraint validation failed\")\n                }\n\n                if verify_user(global_proof_path, \u0026user_proof_path_pattern, false).is_ok() {\n                    println!(\"Inclusion constraint validation passed\")\n                } else {\n                    println!(\"Inclusion constraint validation failed\")\n                }\n                println!(\"============Validation finished============\");\n                Ok(())\n            }\n        }\n    }\n}\n\nfn main() -\u003e std::result::Result\u003c(), PoRError\u003e {\n    let cli = Cli::parse();\n    let r = cli.command.execute();\n    println!(\"Execution result: {:?}\", r);\n    Ok(())\n}\n","traces":[],"covered":0,"coverable":0},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-cli","src","prover.rs"],"content":"use super::constant::{\n    DEFAULT_BATCH_SIZE, GLOBAL_INFO_FILENAME, GLOBAL_PROOF_FILENAME, RECURSION_BRANCHOUT_NUM,\n    USER_PROOF_DIRNAME,\n};\nuse indicatif::ProgressBar;\nuse plonky2::hash::hash_types::HashOut;\nuse plonky2_field::types::PrimeField64;\nuse rayon::{iter::ParallelIterator, prelude::*};\nuse serde_json::json;\nuse std::{\n    fs,\n    fs::File,\n    io::Write,\n    path::PathBuf,\n    str::FromStr,\n    sync::{Arc, RwLock},\n};\nuse zk_por_core::{\n    account::{persist_account_id_to_gmst_pos, Account},\n    circuit_config::{get_recursive_circuit_configs, STANDARD_CONFIG},\n    circuit_registry::registry::CircuitRegistry,\n    config::{ConfigProver, ProverConfig},\n    database::{PoRDB, PoRGMSTMemoryDB, PoRLevelDB, PoRLevelDBOption},\n    e2e::{batch_prove_accounts, prove_subproofs},\n    error::PoRError,\n    global::{GlobalConfig, GlobalMst, GLOBAL_MST},\n    merkle_proof::MerkleProof,\n    merkle_sum_prover::circuits::merkle_sum_circuit::MerkleSumNodeTarget,\n    merkle_sum_tree::MerkleSumTree,\n    parser::{AccountParser, FileAccountReader, FileManager, FilesCfg},\n    recursive_prover::recursive_circuit::RecursiveTargets,\n    types::F,\n    General, Info, Proof,\n};\nuse zk_por_tracing::{init_tracing, TraceConfig};\n\n// as we use one thread to prove each batch, we load num_cpus batches to increase the parallelism.\nfn calculate_per_parse_account_num(batch_size: usize, threads_num: usize) -\u003e usize {\n    let num_cpus = num_cpus::get();\n    let num_cpus = if threads_num \u003c num_cpus { threads_num } else { num_cpus };\n    num_cpus * batch_size\n}\n\nfn ensure_output_dir_empty(user_proof_dir: PathBuf) -\u003e Result\u003c(), PoRError\u003e {\n    fs::create_dir_all(\u0026user_proof_dir).map_err(|e| return PoRError::Io(e))?;\n    let is_empty =\n        fs::read_dir(user_proof_dir.clone()).map_err(|e| return PoRError::Io(e))?.count() == 0;\n    if !is_empty {\n        return Err(PoRError::Io(std::io::Error::new(\n            std::io::ErrorKind::AlreadyExists,\n            format!(\n                \"user proof output directory {} is not empty\",\n                user_proof_dir.to_str().unwrap(),\n            ),\n        )));\n    }\n    return Ok(());\n}\n\npub fn prove(cfg: ProverConfig, proof_output_path: PathBuf) -\u003e Result\u003c(), PoRError\u003e {\n    let trace_cfg: TraceConfig = cfg.log.into();\n\n    let _g = init_tracing(trace_cfg);\n    let user_proof_output_path = proof_output_path.join(USER_PROOF_DIRNAME);\n    ensure_output_dir_empty(user_proof_output_path)?;\n\n    let mut database: Box\u003cdyn PoRDB\u003e;\n    if let Some(level_db_config) = cfg.db {\n        database = Box::new(PoRLevelDB::new(PoRLevelDBOption {\n            user_map_dir: level_db_config.level_db_user_path.to_string(),\n            gmst_dir: level_db_config.level_db_gmst_path.to_string(),\n        }));\n    } else {\n        database = Box::new(PoRGMSTMemoryDB::new());\n    }\n\n    let batch_size = cfg.prover.batch_size.unwrap_or(DEFAULT_BATCH_SIZE);\n    let token_num = cfg.prover.tokens.len();\n    let batch_prove_threads_num = cfg.prover.batch_prove_threads_num;\n    let recursive_prove_threads_num = cfg.prover.recursive_prove_threads_num;\n\n    // the path to dump the final generated proof\n    let file_manager = FileManager {};\n    let mut account_parser = FileAccountReader::new(\n        FilesCfg {\n            dir: std::path::PathBuf::from_str(\u0026cfg.prover.user_data_path).unwrap(),\n            batch_size: batch_size,\n            tokens: cfg.prover.tokens.clone(),\n        },\n        \u0026file_manager,\n    );\n    account_parser.log_state();\n\n    let batch_num = account_parser.total_num_of_users().div_ceil(batch_size);\n\n    match GLOBAL_MST.set(RwLock::new(GlobalMst::new(GlobalConfig {\n        num_of_tokens: token_num,\n        num_of_batches: batch_num,\n        batch_size: batch_size,\n        recursion_branchout_num: RECURSION_BRANCHOUT_NUM,\n    }))) {\n        Ok(_) =\u003e (),\n        Err(_) =\u003e {\n            panic!(\"set global mst error\");\n        }\n    }\n\n    let recursive_circuit_configs =\n        get_recursive_circuit_configs::\u003cRECURSION_BRANCHOUT_NUM\u003e(batch_num);\n    let recursive_level = recursive_circuit_configs.len();\n\n    tracing::info!(\n        \"start to precompute circuits and empty proofs for {} recursive levels\",\n        recursive_level\n    );\n    let circuit_registry = CircuitRegistry::\u003cRECURSION_BRANCHOUT_NUM\u003e::init(\n        batch_size,\n        token_num,\n        STANDARD_CONFIG,\n        recursive_circuit_configs,\n    );\n\n    tracing::info!(\n        \"start to prove {} accounts with {} tokens, {} batch size, {} recursive level\",\n        account_parser.total_num_of_users(),\n        token_num,\n        batch_size,\n        recursive_level,\n    );\n\n    let start = std::time::Instant::now();\n    let mut offset = 0;\n    let per_parse_account_num =\n        calculate_per_parse_account_num(batch_size, batch_prove_threads_num);\n\n    let mut parse_num = 0;\n    let mut batch_proofs = vec![];\n    let bar = ProgressBar::new(account_parser.total_num_of_users() as u64);\n    while offset \u003c account_parser.total_num_of_users() {\n        parse_num += 1;\n        let mut accounts =\n            account_parser.read_n_accounts(offset, per_parse_account_num, \u0026file_manager);\n\n        persist_account_id_to_gmst_pos(\u0026mut database, \u0026accounts, offset);\n\n        let account_num = accounts.len();\n        if account_num % batch_size != 0 {\n            let pad_num = batch_size - account_num % batch_size;\n            tracing::info!(\"in {} parse, account number {} is not a multiple of batch size {}, hence padding {} empty accounts\", parse_num, account_num, batch_size,pad_num);\n            accounts.resize(account_num + pad_num, Account::get_empty_account(token_num));\n        }\n\n        assert_eq!(accounts.len() % batch_size, 0);\n\n        tracing::debug!(\n            \"parse {} times, with number of accounts {}, number of batches {}\",\n            parse_num,\n            account_num,\n            batch_num,\n        );\n\n        let msts: Vec\u003cMerkleSumTree\u003e = accounts\n            .par_chunks(batch_size)\n            .map(|account_batch| MerkleSumTree::new_tree_from_accounts(\u0026account_batch.to_vec()))\n            .collect();\n\n        let global_mst = GLOBAL_MST.get().unwrap();\n        let mut _g: std::sync::RwLockWriteGuard\u003cGlobalMst\u003e =\n            global_mst.write().expect(\"unable to get a lock\");\n        let batch_idx_base = batch_proofs.len();\n\n        let root_hashes: Vec\u003cHashOut\u003cF\u003e\u003e = msts\n            .into_iter()\n            .enumerate()\n            .map(|(i, mst)| {\n                let batch_idx = batch_idx_base + i;\n                mst.merkle_sum_tree.iter().enumerate().for_each(|(j, node)| {\n                    _g.set_batch_hash(batch_idx, j, node.hash);\n                });\n                mst.get_root().hash\n            })\n            .collect();\n        drop(_g);\n\n        let proofs =\n            batch_prove_accounts(\u0026circuit_registry, accounts, batch_prove_threads_num, batch_size);\n\n        assert_eq!(proofs.len(), root_hashes.len());\n\n        proofs.iter().zip(root_hashes.iter()).enumerate().for_each(|(i, (proof, root_hash))|{\n            let batch_idx = batch_idx_base + i;\n            // exclude the first two pub inputs for equity and debt\n            let hash_offset = MerkleSumNodeTarget::pub_input_root_hash_offset();\n            let proof_root_hash = HashOut::\u003cF\u003e::from_partial(\u0026proof.public_inputs[hash_offset]);\n            if proof_root_hash != *root_hash {\n                panic!(\"The root hash in proof is not equal to the one generated by merkle sum tree for batch {}\", batch_idx);\n            }\n        });\n\n        batch_proofs.extend(proofs.into_iter());\n\n        tracing::debug!(\n            \"finish {}/{} batches of accounts in {} parse, since start {:?}\",\n            batch_proofs.len(),\n            batch_num,\n            parse_num,\n            start.elapsed()\n        );\n        bar.inc(account_num as u64);\n        offset += per_parse_account_num;\n    }\n    bar.finish();\n\n    tracing::info!(\n        \"finish batch proving {} accounts, generating {} proofs in {:?}\",\n        account_parser.total_num_of_users(),\n        batch_proofs.len(),\n        start.elapsed()\n    );\n\n    let batch_proof_num = batch_proofs.len();\n\n    let (batch_circuit, _) = circuit_registry.get_batch_circuit();\n    let mut last_level_circuit_vd = batch_circuit.verifier_only.clone();\n    let mut last_level_proofs = batch_proofs;\n    let recursive_levels = circuit_registry.get_recursive_levels();\n\n    // level 0 for mst root hash\n    for level in 1..=recursive_levels {\n        let start = std::time::Instant::now();\n        let last_level_vd_digest = last_level_circuit_vd.circuit_digest;\n        let last_level_empty_proof = circuit_registry\n            .get_empty_proof(\u0026last_level_vd_digest)\n            .expect(\n                format!(\"fail to find empty proof for circuit vd {:?}\", last_level_vd_digest)\n                    .as_str(),\n            )\n            .clone();\n\n        let subproof_len = last_level_proofs.len();\n\n        tracing::info!(\n            \"start to recursively prove {} subproofs at level {}/{}\",\n            subproof_len,\n            level,\n            recursive_levels,\n        );\n\n        if subproof_len % RECURSION_BRANCHOUT_NUM != 0 {\n            let pad_num = RECURSION_BRANCHOUT_NUM - subproof_len % RECURSION_BRANCHOUT_NUM;\n            tracing::info!(\"At level {}, {} subproofs are not a multiple of RECURSION_BRANCHOUT_NUM {}, hence padding {} empty proofs. \", level, subproof_len, RECURSION_BRANCHOUT_NUM, pad_num);\n\n            last_level_proofs.resize(subproof_len + pad_num, last_level_empty_proof);\n        }\n\n        let global_mst = GLOBAL_MST.get().unwrap();\n        let mut _g = global_mst.write().expect(\"unable to get a lock\");\n        last_level_proofs.iter().enumerate().for_each(|(i, proof)| {\n            let hash_offset = RecursiveTargets::\u003cRECURSION_BRANCHOUT_NUM\u003e::pub_input_hash_offset();\n            let proof_root_hash = HashOut::\u003cF\u003e::from_partial(\u0026proof.public_inputs[hash_offset]);\n\n            _g.set_recursive_hash(level - 1, i, proof_root_hash);\n        });\n        drop(_g);\n\n        let this_level_proofs = prove_subproofs(\n            last_level_proofs,\n            last_level_circuit_vd.clone(),\n            \u0026circuit_registry,\n            recursive_prove_threads_num,\n            level,\n        );\n\n        let recursive_circuit = circuit_registry\n            .get_recursive_circuit(\u0026last_level_circuit_vd.circuit_digest)\n            .expect(\n                format!(\n                    \"No recursive circuit found for inner circuit with vd {:?}\",\n                    last_level_circuit_vd.circuit_digest\n                )\n                .as_str(),\n            )\n            .0;\n\n        last_level_circuit_vd = recursive_circuit.verifier_only.clone();\n        last_level_proofs = this_level_proofs;\n\n        tracing::debug!(\n            \"finish recursive level {} with {} proofs in : {:?}\",\n            level,\n            last_level_proofs.len(),\n            start.elapsed()\n        );\n    }\n\n    if last_level_proofs.len() != 1 {\n        panic!(\"The last level proofs should be of length 1, but got {}\", last_level_proofs.len());\n    }\n    let root_proof = last_level_proofs.pop().unwrap();\n\n    // Set the root hash of the recursive circuit to the global mst\n    let hash_offset = RecursiveTargets::\u003cRECURSION_BRANCHOUT_NUM\u003e::pub_input_hash_offset();\n    let proof_root_hash = HashOut::\u003cF\u003e::from_partial(\u0026root_proof.public_inputs[hash_offset]);\n\n    let global_mst = GLOBAL_MST.get().unwrap();\n    let mut _g = global_mst.write().expect(\"unable to get a lock\");\n    _g.set_recursive_hash(recursive_levels, 0, proof_root_hash);\n    drop(_g);\n\n    let start = std::time::Instant::now();\n    assert!(GLOBAL_MST.get().unwrap().read().unwrap().is_integral());\n    tracing::info!(\"verify global mst in {:?}\", start.elapsed());\n\n    circuit_registry\n        .get_root_circuit()\n        .verify(root_proof.clone())\n        .expect(\"fail to verify root proof\");\n\n    tracing::info!(\n        \"finish recursive proving {} subproofs in {:?}\",\n        batch_proof_num,\n        start.elapsed()\n    );\n\n    let root_circuit_digest = circuit_registry.get_root_circuit().verifier_only.circuit_digest;\n\n    let proof = Proof {\n        general: General {\n            round_num: cfg.prover.round_no,\n            batch_num: batch_num,\n            recursion_branchout_num: RECURSION_BRANCHOUT_NUM,\n            batch_size: batch_size,\n            token_num: token_num,\n        },\n        root_vd_digest: root_circuit_digest,\n        proof: root_proof,\n    };\n\n    // persist gmst to database\n\n    let global_mst = GLOBAL_MST.get().unwrap();\n\n    let _g = global_mst.read().expect(\"unable to get a lock\");\n    let root_hash = _g.get_root().expect(\"no root\");\n    tracing::info!(\"root hash is {:?}\", root_hash);\n    let start = std::time::Instant::now();\n    _g.persist(\u0026mut database);\n    tracing::info!(\"persist gmst to db in {:?}\", start.elapsed());\n\n    dump_proofs(\u0026cfg.prover, proof_output_path, database, \u0026proof)?;\n    tracing::info!(\"finish dumping global proof and user proofs in {:?}\", start.elapsed());\n\n    return Ok(());\n}\n\nfn dump_proofs(\n    cfg: \u0026ConfigProver,\n    proof_output_dir_path: PathBuf,\n    db: Box\u003cdyn PoRDB\u003e,\n    root_proof: \u0026Proof,\n) -\u003e Result\u003c(), PoRError\u003e {\n    let user_proof_output_dir_path = proof_output_dir_path.join(USER_PROOF_DIRNAME); // directory has been checked empty before.\n\n    let global_proof_output_path = proof_output_dir_path.join(GLOBAL_PROOF_FILENAME);\n    let mut global_proof_file =\n        File::create(global_proof_output_path.clone()).map_err(|e| PoRError::Io(e))?;\n\n    global_proof_file\n        .write_all(json!(root_proof).to_string().as_bytes())\n        .map_err(|e| return PoRError::Io(e))?;\n\n    ///////////////////////////////////////////////\n    let hash_offset = RecursiveTargets::\u003cRECURSION_BRANCHOUT_NUM\u003e::pub_input_hash_offset();\n    let root_hash = HashOut::\u003cF\u003e::from_partial(\u0026root_proof.proof.public_inputs[hash_offset]);\n    let root_hash_bytes = root_hash\n        .elements\n        .iter()\n        .map(|x| x.to_canonical_u64().to_le_bytes())\n        .flatten()\n        .collect::\u003cVec\u003cu8\u003e\u003e();\n    let root_hash = hex::encode(root_hash_bytes);\n\n    let equity_offset = RecursiveTargets::\u003cRECURSION_BRANCHOUT_NUM\u003e::pub_input_equity_offset();\n    let equity_sum = root_proof.proof.public_inputs[equity_offset].to_canonical_u64();\n\n    let debt_offset = RecursiveTargets::\u003cRECURSION_BRANCHOUT_NUM\u003e::pub_input_debt_offset();\n    let debt_sum = root_proof.proof.public_inputs[debt_offset].to_canonical_u64();\n    assert!(equity_sum \u003e= debt_sum);\n    let balance_sum = equity_sum - debt_sum;\n    let info = Info {\n        root_hash: root_hash,\n        equity_sum: equity_sum,\n        debt_sum: debt_sum,\n        balance_sum: balance_sum,\n    };\n\n    let global_info_output_path = proof_output_dir_path.join(GLOBAL_INFO_FILENAME);\n    let mut global_info_file =\n        File::create(global_info_output_path.clone()).map_err(|e| PoRError::Io(e))?;\n\n    global_info_file\n        .write_all(json!(info).to_string().as_bytes())\n        .map_err(|e| return PoRError::Io(e))?;\n\n    ///////////////////////////////////////////////\n    // generate and dump proof for each user\n    // create a new account reader to avoid buffering previously loaded accounts in memory\n    let file_manager = FileManager {};\n    let batch_size = cfg.batch_size.unwrap_or(DEFAULT_BATCH_SIZE);\n    let mut account_reader = FileAccountReader::new(\n        FilesCfg {\n            dir: std::path::PathBuf::from_str(\u0026cfg.user_data_path).unwrap(),\n            batch_size: batch_size,\n            tokens: cfg.tokens.clone(),\n        },\n        \u0026file_manager,\n    );\n\n    let global_cfg = GlobalConfig {\n        num_of_tokens: cfg.tokens.len(),\n        num_of_batches: account_reader.total_num_of_batches,\n        batch_size: batch_size,\n        recursion_branchout_num: RECURSION_BRANCHOUT_NUM,\n    };\n    let user_num = account_reader.total_num_of_users();\n\n    tracing::info!(\"start to generate and dump merkle proof for each of {} accounts\", user_num);\n\n    let bar = ProgressBar::new(user_num as u64);\n    let per_parse_account_num =\n        calculate_per_parse_account_num(batch_size, cfg.batch_prove_threads_num);\n\n    let cdb: Arc\u003cdyn PoRDB\u003e = Arc::from(db);\n    let mut offset = 0;\n    let chunk_size: usize = num_cpus::get();\n    while offset \u003c account_reader.total_num_of_users() {\n        let accounts: Vec\u003cAccount\u003e =\n            account_reader.read_n_accounts(offset, per_parse_account_num, \u0026file_manager);\n        accounts.chunks(chunk_size).for_each(|chunk| {\n            chunk.par_iter().for_each(|account| {\n                let user_proof = MerkleProof::new_from_account(account, cdb.clone(), \u0026global_cfg)\n                    .expect(\n                        format!(\"fail to generate merkle proof for account {}\", account.id)\n                            .as_str(),\n                    );\n\n                let user_proof_output_path =\n                    user_proof_output_dir_path.join(format!(\"{}.json\", account.id));\n\n                let mut user_proof_file = File::create(user_proof_output_path).expect(\n                    format!(\"fail to create user proof file for account {}\", user_proof.account.id)\n                        .as_str(),\n                );\n\n                user_proof_file.write_all(json!(user_proof).to_string().as_bytes()).expect(\n                    format!(\"fail to write user proof file for account {}\", user_proof.account.id)\n                        .as_str(),\n                );\n            });\n\n            bar.inc(chunk.len() as u64);\n        });\n        offset += per_parse_account_num;\n    }\n    bar.finish();\n\n    return Ok(());\n}\n","traces":[{"line":38,"address":[9331120],"length":1,"stats":{"Line":0}},{"line":39,"address":[9331144],"length":1,"stats":{"Line":0}},{"line":40,"address":[9331164],"length":1,"stats":{"Line":0}},{"line":41,"address":[9331196,9331224],"length":1,"stats":{"Line":0}},{"line":44,"address":[9332419,9331248],"length":1,"stats":{"Line":0}},{"line":45,"address":[9332417,9332448,9331344,9331431,9331278,9332456],"length":1,"stats":{"Line":0}},{"line":46,"address":[9332480,9332488,9331419,9331565,9332415],"length":1,"stats":{"Line":0}},{"line":48,"address":[9331854],"length":1,"stats":{"Line":0}},{"line":49,"address":[9332305],"length":1,"stats":{"Line":0}},{"line":50,"address":[9331863],"length":1,"stats":{"Line":0}},{"line":51,"address":[9332184],"length":1,"stats":{"Line":0}},{"line":53,"address":[9331922,9332058,9331871],"length":1,"stats":{"Line":0}},{"line":57,"address":[9331893],"length":1,"stats":{"Line":0}},{"line":60,"address":[9368881,9332512,9333959],"length":1,"stats":{"Line":0}},{"line":61,"address":[9332626],"length":1,"stats":{"Line":0}},{"line":63,"address":[9332907],"length":1,"stats":{"Line":0}},{"line":64,"address":[9332942,9333022],"length":1,"stats":{"Line":0}},{"line":65,"address":[9333070,9368614,9333194],"length":1,"stats":{"Line":0}},{"line":68,"address":[9333143,9333323,9334141],"length":1,"stats":{"Line":0}},{"line":69,"address":[9333794,9333561],"length":1,"stats":{"Line":0}},{"line":70,"address":[9333392],"length":1,"stats":{"Line":0}},{"line":71,"address":[9333497],"length":1,"stats":{"Line":0}},{"line":74,"address":[9333399,9334110],"length":1,"stats":{"Line":0}},{"line":77,"address":[9334162,9333925],"length":1,"stats":{"Line":0}},{"line":78,"address":[9334170],"length":1,"stats":{"Line":0}},{"line":79,"address":[9334217],"length":1,"stats":{"Line":0}},{"line":80,"address":[9334237],"length":1,"stats":{"Line":0}},{"line":85,"address":[9334438],"length":1,"stats":{"Line":0}},{"line":86,"address":[9334257],"length":1,"stats":{"Line":0}},{"line":88,"address":[9334371],"length":1,"stats":{"Line":0}},{"line":92,"address":[9334549],"length":1,"stats":{"Line":0}},{"line":94,"address":[9334612],"length":1,"stats":{"Line":0}},{"line":96,"address":[9334693],"length":1,"stats":{"Line":0}},{"line":104,"address":[9334859,9368567],"length":1,"stats":{"Line":0}},{"line":108,"address":[9334888],"length":1,"stats":{"Line":0}},{"line":110,"address":[9334991,9334927],"length":1,"stats":{"Line":0}},{"line":112,"address":[9336270,9336194,9335151,9336464,9335567,9335766,9335896],"length":1,"stats":{"Line":0}},{"line":120,"address":[9335961],"length":1,"stats":{"Line":0}},{"line":123,"address":[9337788,9338431,9337864,9336911,9337327,9337526,9337656],"length":1,"stats":{"Line":0}},{"line":131,"address":[9338755,9337721],"length":1,"stats":{"Line":0}},{"line":132,"address":[9338770],"length":1,"stats":{"Line":0}},{"line":133,"address":[9338782],"length":1,"stats":{"Line":0}},{"line":136,"address":[9338821],"length":1,"stats":{"Line":0}},{"line":137,"address":[9338840],"length":1,"stats":{"Line":0}},{"line":138,"address":[9338847,9338931],"length":1,"stats":{"Line":0}},{"line":139,"address":[9338952,9339055,9368410],"length":1,"stats":{"Line":0}},{"line":140,"address":[9360613,9339079,9360567],"length":1,"stats":{"Line":0}},{"line":141,"address":[9360574,9360634],"length":1,"stats":{"Line":0}},{"line":144,"address":[9360642],"length":1,"stats":{"Line":0}},{"line":146,"address":[9360718],"length":1,"stats":{"Line":0}},{"line":147,"address":[9360761],"length":1,"stats":{"Line":0}},{"line":148,"address":[9361099,9360851],"length":1,"stats":{"Line":0}},{"line":149,"address":[9361127,9362013,9362089,9361872,9362613,9361742,9361543],"length":1,"stats":{"Line":0}},{"line":150,"address":[9362914,9361937],"length":1,"stats":{"Line":0}},{"line":153,"address":[9360821,9362998],"length":1,"stats":{"Line":0}},{"line":155,"address":[9363332,9364218,9364294,9364708,9364077,9363947,9363748],"length":1,"stats":{"Line":0}},{"line":162,"address":[9364142,9365009],"length":1,"stats":{"Line":0}},{"line":164,"address":[9369024,9369087],"length":1,"stats":{"Line":0}},{"line":167,"address":[9365249,9365093],"length":1,"stats":{"Line":0}},{"line":168,"address":[9365265],"length":1,"stats":{"Line":0}},{"line":170,"address":[9365369,9365433],"length":1,"stats":{"Line":0}},{"line":172,"address":[9365441],"length":1,"stats":{"Line":0}},{"line":175,"address":[9369581,9369216,9369246],"length":1,"stats":{"Line":0}},{"line":176,"address":[9369345,9369293],"length":1,"stats":{"Line":0}},{"line":177,"address":[9369616,9369650,9369319,9369416],"length":1,"stats":{"Line":0}},{"line":178,"address":[9369660],"length":1,"stats":{"Line":0}},{"line":180,"address":[9369481],"length":1,"stats":{"Line":0}},{"line":183,"address":[9365589],"length":1,"stats":{"Line":0}},{"line":185,"address":[9365675],"length":1,"stats":{"Line":0}},{"line":188,"address":[9365770,9365834],"length":1,"stats":{"Line":0}},{"line":190,"address":[9369759,9366016,9369744],"length":1,"stats":{"Line":0}},{"line":191,"address":[9369914,9369804],"length":1,"stats":{"Line":0}},{"line":193,"address":[9369830],"length":1,"stats":{"Line":0}},{"line":194,"address":[9369860],"length":1,"stats":{"Line":0}},{"line":195,"address":[9369897],"length":1,"stats":{"Line":0}},{"line":196,"address":[9370006],"length":1,"stats":{"Line":0}},{"line":200,"address":[9366281],"length":1,"stats":{"Line":0}},{"line":202,"address":[9366519,9367213,9367395,9368001,9366914,9367101,9367331],"length":1,"stats":{"Line":0}},{"line":209,"address":[9367269],"length":1,"stats":{"Line":0}},{"line":210,"address":[9368365,9368307],"length":1,"stats":{"Line":0}},{"line":212,"address":[9339060],"length":1,"stats":{"Line":0}},{"line":214,"address":[9340597],"length":1,"stats":{"Line":0}},{"line":221,"address":[9340079,9341064],"length":1,"stats":{"Line":0}},{"line":223,"address":[9341088],"length":1,"stats":{"Line":0}},{"line":224,"address":[9341111],"length":1,"stats":{"Line":0}},{"line":225,"address":[9341133],"length":1,"stats":{"Line":0}},{"line":226,"address":[9341189,9341253],"length":1,"stats":{"Line":0}},{"line":229,"address":[9341261,9341469,9360434],"length":1,"stats":{"Line":0}},{"line":230,"address":[9352687,9341485],"length":1,"stats":{"Line":0}},{"line":231,"address":[9352702],"length":1,"stats":{"Line":0}},{"line":232,"address":[9353095,9352750],"length":1,"stats":{"Line":0}},{"line":235,"address":[9352875,9353004],"length":1,"stats":{"Line":0}},{"line":240,"address":[9353220],"length":1,"stats":{"Line":0}},{"line":242,"address":[9353819,9353403,9354148,9354256,9354332,9354746,9354018],"length":1,"stats":{"Line":0}},{"line":249,"address":[9355031,9354213],"length":1,"stats":{"Line":0}},{"line":250,"address":[9355078,9355285],"length":1,"stats":{"Line":0}},{"line":251,"address":[9355729,9356058,9355313,9356275,9356199,9355928,9356796],"length":1,"stats":{"Line":0}},{"line":253,"address":[9356123,9357097],"length":1,"stats":{"Line":0}},{"line":256,"address":[9355049,9357289],"length":1,"stats":{"Line":0}},{"line":257,"address":[9357305],"length":1,"stats":{"Line":0}},{"line":258,"address":[9370080,9357409,9357489,9370117],"length":1,"stats":{"Line":0}},{"line":259,"address":[9370127],"length":1,"stats":{"Line":0}},{"line":260,"address":[9370153],"length":1,"stats":{"Line":0}},{"line":262,"address":[9370190,9370322],"length":1,"stats":{"Line":0}},{"line":264,"address":[9357574],"length":1,"stats":{"Line":0}},{"line":267,"address":[9357608],"length":1,"stats":{"Line":0}},{"line":268,"address":[9357672],"length":1,"stats":{"Line":0}},{"line":274,"address":[9358205,9357815],"length":1,"stats":{"Line":0}},{"line":275,"address":[9357799],"length":1,"stats":{"Line":0}},{"line":277,"address":[9357879,9357977,9358106],"length":1,"stats":{"Line":0}},{"line":283,"address":[9358129,9358254],"length":1,"stats":{"Line":0}},{"line":285,"address":[9358281],"length":1,"stats":{"Line":0}},{"line":286,"address":[9358401],"length":1,"stats":{"Line":0}},{"line":288,"address":[9359967],"length":1,"stats":{"Line":0}},{"line":296,"address":[9341522,9341454],"length":1,"stats":{"Line":0}},{"line":297,"address":[9352475,9352593,9341559],"length":1,"stats":{"Line":0}},{"line":299,"address":[9341650,9341544],"length":1,"stats":{"Line":0}},{"line":302,"address":[9341738,9341658],"length":1,"stats":{"Line":0}},{"line":303,"address":[9341754],"length":1,"stats":{"Line":0}},{"line":305,"address":[9341823,9341938],"length":1,"stats":{"Line":0}},{"line":306,"address":[9341954],"length":1,"stats":{"Line":0}},{"line":307,"address":[9342058,9342154],"length":1,"stats":{"Line":0}},{"line":308,"address":[9342217],"length":1,"stats":{"Line":0}},{"line":310,"address":[9342251],"length":1,"stats":{"Line":0}},{"line":311,"address":[9342682,9342307,9342422],"length":1,"stats":{"Line":0}},{"line":312,"address":[9343030,9343980,9344238,9343446,9343645,9343775,9343904],"length":1,"stats":{"Line":0}},{"line":314,"address":[9344526,9343848],"length":1,"stats":{"Line":0}},{"line":316,"address":[9344491],"length":1,"stats":{"Line":0}},{"line":319,"address":[9345693,9346061,9344743,9345488,9345617,9345358,9345159],"length":1,"stats":{"Line":0}},{"line":325,"address":[9346346,9345561],"length":1,"stats":{"Line":0}},{"line":328,"address":[9346380],"length":1,"stats":{"Line":0}},{"line":341,"address":[9346783,9346624],"length":1,"stats":{"Line":0}},{"line":343,"address":[9346791],"length":1,"stats":{"Line":0}},{"line":344,"address":[9346971,9346892],"length":1,"stats":{"Line":0}},{"line":345,"address":[9348347,9347616,9347815,9348153,9348077,9347200,9347945],"length":1,"stats":{"Line":0}},{"line":346,"address":[9348010,9348615],"length":1,"stats":{"Line":0}},{"line":347,"address":[9348630],"length":1,"stats":{"Line":0}},{"line":348,"address":[9349865,9349451,9350123,9349581,9349252,9349789,9348836],"length":1,"stats":{"Line":0}},{"line":350,"address":[9352205,9349662,9350596,9350392],"length":1,"stats":{"Line":0}},{"line":351,"address":[9351140,9351599,9350724,9351469,9351339,9351933,9351675],"length":1,"stats":{"Line":0}},{"line":353,"address":[9351542],"length":1,"stats":{"Line":0}},{"line":356,"address":[9376570,9376898,9370352],"length":1,"stats":{"Line":0}},{"line":362,"address":[9370538,9370434],"length":1,"stats":{"Line":0}},{"line":364,"address":[9370661,9370578],"length":1,"stats":{"Line":0}},{"line":365,"address":[9370919,9376920,9370709,9376766,9376912,9370776],"length":1,"stats":{"Line":0}},{"line":368,"address":[9371740,9371518],"length":1,"stats":{"Line":0}},{"line":369,"address":[9371371,9370901,9371430],"length":1,"stats":{"Line":0}},{"line":370,"address":[9376709,9371614,9371765,9371378,9376944,9376952,9371453],"length":1,"stats":{"Line":0}},{"line":373,"address":[9371784],"length":1,"stats":{"Line":0}},{"line":374,"address":[9371839],"length":1,"stats":{"Line":0}},{"line":375,"address":[9371915],"length":1,"stats":{"Line":0}},{"line":378,"address":[9377001,9376976],"length":1,"stats":{"Line":0}},{"line":381,"address":[9372064],"length":1,"stats":{"Line":0}},{"line":383,"address":[9372079,9372143],"length":1,"stats":{"Line":0}},{"line":384,"address":[9372151],"length":1,"stats":{"Line":0}},{"line":386,"address":[9372231],"length":1,"stats":{"Line":0}},{"line":387,"address":[9372262],"length":1,"stats":{"Line":0}},{"line":388,"address":[9372350],"length":1,"stats":{"Line":0}},{"line":389,"address":[9372401,9372587],"length":1,"stats":{"Line":0}},{"line":397,"address":[9372668,9372564],"length":1,"stats":{"Line":0}},{"line":398,"address":[9372783,9377048,9376639,9372716,9372926,9377040],"length":1,"stats":{"Line":0}},{"line":401,"address":[9373525,9373747],"length":1,"stats":{"Line":0}},{"line":402,"address":[9373378,9372908,9373437],"length":1,"stats":{"Line":0}},{"line":403,"address":[9373460,9373621,9373772,9377072,9373385,9377080,9376579],"length":1,"stats":{"Line":0}},{"line":408,"address":[9370402],"length":1,"stats":{"Line":0}},{"line":409,"address":[9373799],"length":1,"stats":{"Line":0}},{"line":411,"address":[9374043],"length":1,"stats":{"Line":0}},{"line":412,"address":[9373854],"length":1,"stats":{"Line":0}},{"line":414,"address":[9373968],"length":1,"stats":{"Line":0}},{"line":420,"address":[9374154],"length":1,"stats":{"Line":0}},{"line":421,"address":[9374237],"length":1,"stats":{"Line":0}},{"line":425,"address":[9374281],"length":1,"stats":{"Line":0}},{"line":427,"address":[9375218,9375336,9375591,9374892,9375091,9374476,9375400],"length":1,"stats":{"Line":0}},{"line":429,"address":[9375274],"length":1,"stats":{"Line":0}},{"line":430,"address":[9375922,9375857],"length":1,"stats":{"Line":0}},{"line":433,"address":[9375930],"length":1,"stats":{"Line":0}},{"line":434,"address":[9375997],"length":1,"stats":{"Line":0}},{"line":435,"address":[9376009,9376070],"length":1,"stats":{"Line":0}},{"line":436,"address":[9376078],"length":1,"stats":{"Line":0}},{"line":437,"address":[9376154],"length":1,"stats":{"Line":0}},{"line":439,"address":[9376294,9377104,9376382],"length":1,"stats":{"Line":0}},{"line":440,"address":[9377248,9379561,9377159,9379611],"length":1,"stats":{"Line":0}},{"line":441,"address":[9377693,9377281],"length":1,"stats":{"Line":0}},{"line":443,"address":[9377625,9377496],"length":1,"stats":{"Line":0}},{"line":448,"address":[9377807,9378066,9377919],"length":1,"stats":{"Line":0}},{"line":450,"address":[9378089,9378457],"length":1,"stats":{"Line":0}},{"line":451,"address":[9378260,9378389],"length":1,"stats":{"Line":0}},{"line":455,"address":[9378865,9379000,9378609,9378924,9379384],"length":1,"stats":{"Line":0}},{"line":456,"address":[9379318,9379189],"length":1,"stats":{"Line":0}},{"line":461,"address":[9377221],"length":1,"stats":{"Line":0}},{"line":463,"address":[9376496,9376549],"length":1,"stats":{"Line":0}},{"line":465,"address":[9376130],"length":1,"stats":{"Line":0}},{"line":467,"address":[9376211],"length":1,"stats":{"Line":0}}],"covered":0,"coverable":193},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-cli","src","verifier.rs"],"content":"use indicatif::ProgressBar;\nuse plonky2_field::types::PrimeField64;\nuse rayon::iter::IntoParallelRefIterator;\nuse serde_json::from_reader;\nuse std::{fs::File, path::PathBuf};\n\n// Assuming Proof is defined in lib.rs and lib.rs is in the same crate\nuse super::constant::RECURSION_BRANCHOUT_NUM;\nuse zk_por_core::{\n    circuit_config::{get_recursive_circuit_configs, STANDARD_CONFIG},\n    circuit_registry::registry::CircuitRegistry,\n    error::PoRError,\n    merkle_proof::MerkleProof,\n    recursive_prover::recursive_circuit::RecursiveTargets,\n    types::F,\n    Proof,\n};\n\nuse plonky2::hash::hash_types::HashOut;\nuse rayon::iter::ParallelIterator;\n\nuse glob::glob;\nuse std::io;\n\nfn find_matching_files(pattern: \u0026str) -\u003e Result\u003cVec\u003cPathBuf\u003e, io::Error\u003e {\n    let mut matching_files = Vec::new();\n\n    // Use the glob function to get an iterator of matching paths\n    for entry in glob(pattern).expect(\"Failed to read glob pattern\") {\n        match entry {\n            Ok(path) =\u003e matching_files.push(path),\n            Err(e) =\u003e return Err(io::Error::new(io::ErrorKind::Other, e.to_string())),\n        }\n    }\n\n    Ok(matching_files)\n}\n\npub fn verify_user(\n    global_proof_path: PathBuf,\n    user_proof_path_pattern: \u0026String,\n    verbose: bool,\n) -\u003e Result\u003c(), PoRError\u003e {\n    let proof_file = File::open(\u0026global_proof_path).unwrap();\n    let reader = std::io::BufReader::new(proof_file);\n\n    // Parse the JSON as Proof\n    let proof: Proof = from_reader(reader)\n        .expect(format!(\"fail to parse global proof from path {:?}\", global_proof_path).as_str());\n\n    let hash_offset = RecursiveTargets::\u003cRECURSION_BRANCHOUT_NUM\u003e::pub_input_hash_offset();\n    let root_hash = HashOut::\u003cF\u003e::from_partial(\u0026proof.proof.public_inputs[hash_offset]);\n    let user_proof_paths =\n        find_matching_files(user_proof_path_pattern).map_err(|e| PoRError::Io(e))?;\n    let proof_file_num = user_proof_paths.len();\n    if proof_file_num == 0 {\n        return Err(PoRError::InvalidParameter(format!(\n            \"fail to find any user proof files with pattern {}\",\n            user_proof_path_pattern\n        )));\n    }\n\n    if verbose {\n        println!(\"successfully identify {} user proof files\", proof_file_num);\n    }\n\n    let bar = ProgressBar::new(proof_file_num as u64);\n    let chunk_size: usize = num_cpus::get();\n    let invalid_proof_paths = user_proof_paths\n        .chunks(chunk_size)\n        .map(|chunks| {\n            let invalid_proof_paths = chunks\n                .par_iter()\n                .map(|user_proof_path| {\n                    let merkle_path = File::open(\u0026user_proof_path).unwrap();\n                    let reader = std::io::BufReader::new(merkle_path);\n                    let proof: MerkleProof = from_reader(reader).unwrap();\n                    let result = proof.verify_merkle_proof(root_hash);\n                    (result, user_proof_path)\n                })\n                .filter(|(result, _)| result.is_err())\n                .map(|(_, invalid_proof_path)| invalid_proof_path.to_str().unwrap().to_owned())\n                .collect::\u003cVec\u003cString\u003e\u003e();\n            if verbose {\n                bar.inc(chunks.len() as u64);\n            }\n            invalid_proof_paths\n        })\n        .flatten()\n        .collect::\u003cVec\u003cString\u003e\u003e();\n    if verbose {\n        bar.finish();\n    }\n\n    let invalid_proof_num = invalid_proof_paths.len();\n    let valid_proof_num = proof_file_num - invalid_proof_num;\n    if verbose {\n        let max_to_display_valid_proof_num = 10;\n\n        println!(\n            \"{}/{} user proofs pass the verification. {} fail, the first {} failed proof files: {:?}\",\n            valid_proof_num, proof_file_num, invalid_proof_num, std::cmp::min(invalid_proof_num, invalid_proof_num), invalid_proof_paths.iter().take(max_to_display_valid_proof_num).collect::\u003cVec\u003c\u0026String\u003e\u003e(),\n        );\n    }\n\n    if invalid_proof_num \u003e 0 {\n        return Err(PoRError::InvalidProof);\n    }\n    Ok(())\n}\n\npub fn verify_global(global_proof_path: PathBuf, verbose: bool) -\u003e Result\u003c(), PoRError\u003e {\n    let proof_file = File::open(\u0026global_proof_path).unwrap();\n    let reader = std::io::BufReader::new(proof_file);\n\n    // Parse the JSON as Proof\n    let proof: Proof = from_reader(reader).unwrap();\n\n    if proof.general.recursion_branchout_num != RECURSION_BRANCHOUT_NUM {\n        panic!(\"The recursion_branchout_num is not configured to be equal to 64\");\n    }\n\n    let token_num = proof.general.token_num;\n    let batch_num = proof.general.batch_num;\n    let round_num = proof.general.round_num;\n    let batch_size = proof.general.batch_size;\n    let recursive_circuit_configs =\n        get_recursive_circuit_configs::\u003cRECURSION_BRANCHOUT_NUM\u003e(batch_num);\n\n    // not to use trace::log to avoid the dependency on the trace config.\n    if verbose {\n        println!(\n            \"start to reconstruct the circuit with {} recursive levels for round {}\",\n            recursive_circuit_configs.len(),\n            round_num\n        );\n    }\n    let start = std::time::Instant::now();\n    let circuit_registry = CircuitRegistry::\u003cRECURSION_BRANCHOUT_NUM\u003e::init(\n        batch_size,\n        token_num,\n        STANDARD_CONFIG,\n        recursive_circuit_configs,\n    );\n\n    let root_circuit = circuit_registry.get_root_circuit();\n\n    let circuit_vd = root_circuit.verifier_only.circuit_digest;\n    if circuit_vd != proof.root_vd_digest {\n        return Err(PoRError::CircuitDigestMismatch);\n    }\n\n    if verbose {\n        println!(\n            \"successfully reconstruct the circuit for round {} in {:?}\",\n            round_num,\n            start.elapsed()\n        );\n\n        let equity = proof.proof.public_inputs\n            [RecursiveTargets::\u003cRECURSION_BRANCHOUT_NUM\u003e::pub_input_equity_offset()];\n        let debt = proof.proof.public_inputs\n            [RecursiveTargets::\u003cRECURSION_BRANCHOUT_NUM\u003e::pub_input_debt_offset()];\n        if !root_circuit.verify(proof.proof).is_ok() {\n            return Err(PoRError::InvalidProof);\n        }\n\n        println!(\"successfully verify the global proof for round {}, total exchange users' equity is {}, debt is {}, exchange liability is {}\",\n        round_num, equity.to_canonical_u64(), debt.to_canonical_u64(), (equity- debt).to_canonical_u64());\n    }\n\n    Ok(())\n}\n","traces":[{"line":25,"address":[9379664,9380476],"length":1,"stats":{"Line":0}},{"line":26,"address":[9379707],"length":1,"stats":{"Line":0}},{"line":29,"address":[9379791,9380001,9379731,9379947],"length":1,"stats":{"Line":0}},{"line":30,"address":[9380065],"length":1,"stats":{"Line":0}},{"line":31,"address":[9380197,9380316],"length":1,"stats":{"Line":0}},{"line":32,"address":[9380321,9380253],"length":1,"stats":{"Line":0}},{"line":36,"address":[9380110],"length":1,"stats":{"Line":0}},{"line":39,"address":[9384116,9380512,9384180],"length":1,"stats":{"Line":0}},{"line":44,"address":[9380864,9380574],"length":1,"stats":{"Line":0}},{"line":45,"address":[9380871],"length":1,"stats":{"Line":0}},{"line":48,"address":[9381266,9380906],"length":1,"stats":{"Line":0}},{"line":49,"address":[9381304,9384143,9381025,9381186],"length":1,"stats":{"Line":0}},{"line":51,"address":[9381375],"length":1,"stats":{"Line":0}},{"line":52,"address":[9381424],"length":1,"stats":{"Line":0}},{"line":53,"address":[9381707,9384208,9384216,9384125,9381481],"length":1,"stats":{"Line":0}},{"line":55,"address":[9381684,9381877],"length":1,"stats":{"Line":0}},{"line":56,"address":[9381885],"length":1,"stats":{"Line":0}},{"line":57,"address":[9382156,9382027],"length":1,"stats":{"Line":0}},{"line":63,"address":[9382008],"length":1,"stats":{"Line":0}},{"line":64,"address":[9382402],"length":1,"stats":{"Line":0}},{"line":67,"address":[9382262],"length":1,"stats":{"Line":0}},{"line":68,"address":[9382476,9382537],"length":1,"stats":{"Line":0}},{"line":69,"address":[9382679,9382553],"length":1,"stats":{"Line":0}},{"line":71,"address":[9384240,9384506,9382615],"length":1,"stats":{"Line":0}},{"line":72,"address":[9384328,9384312],"length":1,"stats":{"Line":0}},{"line":74,"address":[9384325,9384528,9385216],"length":1,"stats":{"Line":0}},{"line":75,"address":[9384563,9384725],"length":1,"stats":{"Line":0}},{"line":76,"address":[9384732],"length":1,"stats":{"Line":0}},{"line":77,"address":[9384743],"length":1,"stats":{"Line":0}},{"line":78,"address":[9385059],"length":1,"stats":{"Line":0}},{"line":79,"address":[9385160],"length":1,"stats":{"Line":0}},{"line":81,"address":[9385248,9385275],"length":1,"stats":{"Line":0}},{"line":82,"address":[9385296,9385323,9385511],"length":1,"stats":{"Line":0}},{"line":84,"address":[9384388],"length":1,"stats":{"Line":0}},{"line":85,"address":[9384504,9384451],"length":1,"stats":{"Line":0}},{"line":87,"address":[9384407],"length":1,"stats":{"Line":0}},{"line":91,"address":[9382732],"length":1,"stats":{"Line":0}},{"line":92,"address":[9382829,9382766],"length":1,"stats":{"Line":0}},{"line":95,"address":[9382836,9382742],"length":1,"stats":{"Line":0}},{"line":96,"address":[9382844,9382901],"length":1,"stats":{"Line":0}},{"line":97,"address":[9382889],"length":1,"stats":{"Line":0}},{"line":98,"address":[9380545],"length":1,"stats":{"Line":0}},{"line":100,"address":[9383271,9383421],"length":1,"stats":{"Line":0}},{"line":106,"address":[9382921],"length":1,"stats":{"Line":0}},{"line":107,"address":[9383890],"length":1,"stats":{"Line":0}},{"line":109,"address":[9383849],"length":1,"stats":{"Line":0}},{"line":112,"address":[9388836,9385568,9388974],"length":1,"stats":{"Line":0}},{"line":113,"address":[9385617,9385947],"length":1,"stats":{"Line":0}},{"line":114,"address":[9385954],"length":1,"stats":{"Line":0}},{"line":117,"address":[9386207,9385989],"length":1,"stats":{"Line":0}},{"line":119,"address":[9386215],"length":1,"stats":{"Line":0}},{"line":120,"address":[9388924,9386321],"length":1,"stats":{"Line":0}},{"line":123,"address":[9386226],"length":1,"stats":{"Line":0}},{"line":124,"address":[9386250],"length":1,"stats":{"Line":0}},{"line":125,"address":[9386266],"length":1,"stats":{"Line":0}},{"line":126,"address":[9386282],"length":1,"stats":{"Line":0}},{"line":127,"address":[9386314,9386398],"length":1,"stats":{"Line":0}},{"line":131,"address":[9386406],"length":1,"stats":{"Line":0}},{"line":132,"address":[9386447,9386508],"length":1,"stats":{"Line":0}},{"line":138,"address":[9386857,9386410],"length":1,"stats":{"Line":0}},{"line":143,"address":[9386872],"length":1,"stats":{"Line":0}},{"line":146,"address":[9387056,9387119],"length":1,"stats":{"Line":0}},{"line":148,"address":[9387127],"length":1,"stats":{"Line":0}},{"line":149,"address":[9387157],"length":1,"stats":{"Line":0}},{"line":150,"address":[9387225],"length":1,"stats":{"Line":0}},{"line":153,"address":[9387211],"length":1,"stats":{"Line":0}},{"line":154,"address":[9387578],"length":1,"stats":{"Line":0}},{"line":160,"address":[9387726,9387663],"length":1,"stats":{"Line":0}},{"line":161,"address":[9387676],"length":1,"stats":{"Line":0}},{"line":162,"address":[9387737,9387800],"length":1,"stats":{"Line":0}},{"line":163,"address":[9387750],"length":1,"stats":{"Line":0}},{"line":164,"address":[9387811],"length":1,"stats":{"Line":0}},{"line":165,"address":[9388003],"length":1,"stats":{"Line":0}},{"line":168,"address":[9388637],"length":1,"stats":{"Line":0}},{"line":172,"address":[9387284],"length":1,"stats":{"Line":0}}],"covered":0,"coverable":75},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","benches","batch_circuit.rs"],"content":"#![feature(test)]\nuse plonky2::plonk::circuit_builder::CircuitBuilder;\nuse zk_por_core::{\n    account::gen_accounts_with_random_data,\n    circuit_config::STANDARD_CONFIG,\n    merkle_sum_prover::{circuits::account_circuit::AccountTargets, prover::MerkleSumTreeProver},\n    types::{C, D, F},\n};\n\nextern crate test;\nuse test::Bencher;\n\nfn bench(b: \u0026mut Bencher, batch_size: usize) {\n    let mut builder = CircuitBuilder::\u003cF, D\u003e::new(STANDARD_CONFIG);\n    let num_assets = 50;\n    let accounts = gen_accounts_with_random_data(batch_size, num_assets);\n    let prover = MerkleSumTreeProver { accounts };\n    let account_targets: Vec\u003cAccountTargets\u003e = prover.build_merkle_tree_targets(\u0026mut builder);\n    let data = \u0026builder.build::\u003cC\u003e();\n\n    b.iter(|| _ = prover.get_proof_with_circuit_data(account_targets.as_slice(), data));\n}\n\n#[bench]\npub fn bench_batch_size_equal_2(b: \u0026mut Bencher) {\n    bench(b, 2);\n}\n\n#[bench]\npub fn bench_batch_size_equal_16(b: \u0026mut Bencher) {\n    bench(b, 16);\n}\n\n#[bench]\npub fn bench_batch_size_equal_256(b: \u0026mut Bencher) {\n    bench(b, 256);\n}\n\n#[bench]\npub fn bench_batch_size_equal_1024(b: \u0026mut Bencher) {\n    bench(b, 1024);\n}\n\n#[bench]\npub fn bench_batch_size_equal_2048(b: \u0026mut Bencher) {\n    bench(b, 2048);\n}\n\n#[bench]\npub fn bench_batch_size_equal_4096(b: \u0026mut Bencher) {\n    bench(b, 4096);\n}\n","traces":[],"covered":0,"coverable":0},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","benches","benchmark.rs"],"content":"use criterion::{\n    criterion_group, criterion_main, measurement::WallTime, BenchmarkGroup, Criterion, SamplingMode,\n};\nuse zk_por_core::{\n    account::gen_accounts_with_random_data,\n    circuit_config::STANDARD_CONFIG,\n    merkle_sum_prover::{\n        circuits::merkle_sum_circuit::build_merkle_sum_tree_circuit, prover::MerkleSumTreeProver,\n    },\n    recursive_prover::{prover::RecursiveProver, recursive_circuit::build_recursive_n_circuit},\n    types::{C, D, F},\n};\n\nuse plonky2::plonk::proof::ProofWithPublicInputs;\nuse rayon::iter::{IntoParallelIterator, ParallelIterator};\n\n/// Benchmark the batch proving of the accounts. There are {parallism} threads, each thread proving the batch_size accounts.\npub fn bench_batch_circuit(\n    c: \u0026mut BenchmarkGroup\u003cWallTime\u003e,\n    batch_size: usize,\n    num_assets: usize,\n    parallism: usize,\n) {\n    let accounts = gen_accounts_with_random_data(batch_size, num_assets);\n    let bench_id =\n        format!(\"batch_circuit_{}_token_num_{}_parallism_{}\", batch_size, num_assets, parallism);\n    let (circuit_data, account_targets) =\n        build_merkle_sum_tree_circuit(batch_size, num_assets, STANDARD_CONFIG);\n    c.bench_function(bench_id.as_str(), |b| {\n        b.iter(|| {\n            (0..parallism).into_par_iter().for_each(|_| {\n                let prover = MerkleSumTreeProver { accounts: accounts.clone() };\n                let _ = prover.get_proof_with_circuit_data(\u0026account_targets, \u0026circuit_data);\n            });\n        })\n    });\n}\n\npub fn batch_circuit_for_batch_size(c: \u0026mut Criterion) {\n    let mut group = c.benchmark_group(\"batch_circuit_for_batch_size\");\n    group.sample_size(10);\n    let num_assets = 200;\n    let parallism = 1;\n    for \u0026batch_size in [16, 64, 256, 512, 1024].iter() {\n        bench_batch_circuit(\u0026mut group, batch_size, num_assets, parallism);\n    }\n    group.finish();\n}\n\npub fn batch_circuit_for_token_num(c: \u0026mut Criterion) {\n    let mut group = c.benchmark_group(\"batch_circuit_for_token_num\");\n    group.sample_size(10);\n    let batch_size = 1024;\n    let parallism = 1;\n    for \u0026num_assets in [4, 20, 50, 100, 200].iter() {\n        bench_batch_circuit(\u0026mut group, batch_size, num_assets, parallism);\n    }\n    group.finish();\n}\n\npub fn batch_circuit_for_parallism(c: \u0026mut Criterion) {\n    let mut group = c.benchmark_group(\"batch_circuit_for_parallism\");\n    group.sample_size(10);\n    let token_num = 200;\n    for \u0026batch_size in [16, 1024].iter() {\n        for \u0026parallism in [1, 2, 4, 8, 16, 32].iter() {\n            bench_batch_circuit(\u0026mut group, batch_size, token_num, parallism);\n        }\n    }\n    group.finish();\n}\n\npub fn bench_recursive_circuit\u003cconst SUBPROOF_NUM: usize\u003e(\n    g: \u0026mut BenchmarkGroup\u003cWallTime\u003e,\n    parallism: usize,\n) {\n    let batch_size = 1024;\n    let token_num = 4;\n    let (merkle_sum_circuit, account_targets) =\n        build_merkle_sum_tree_circuit(batch_size, token_num, STANDARD_CONFIG);\n\n    let accounts = gen_accounts_with_random_data(batch_size, token_num);\n    let prover = MerkleSumTreeProver { accounts };\n\n    let merkle_sum_proof =\n        prover.get_proof_with_circuit_data(\u0026account_targets, \u0026merkle_sum_circuit);\n\n    let (recursive_circuit, recursive_targets) = build_recursive_n_circuit::\u003cC, SUBPROOF_NUM\u003e(\n        \u0026merkle_sum_circuit.common,\n        \u0026merkle_sum_circuit.verifier_only,\n        STANDARD_CONFIG,\n    );\n\n    let subproofs: [ProofWithPublicInputs\u003cF, C, D\u003e; SUBPROOF_NUM] =\n        std::array::from_fn(|_| merkle_sum_proof.clone());\n    let bench_id = format!(\"recursive_circuit_{}_parallism_{}\", SUBPROOF_NUM, parallism);\n    g.bench_function(bench_id.as_str(), |b| {\n        b.iter(|| {\n            (0..parallism).into_par_iter().for_each(|_| {\n                let recursive_prover = RecursiveProver {\n                    sub_proofs: subproofs.clone(),\n                    sub_circuit_vd: merkle_sum_circuit.verifier_only.clone(),\n                };\n                recursive_prover\n                    .get_proof_with_circuit_data(recursive_targets.clone(), \u0026recursive_circuit);\n            });\n        })\n    });\n}\n\npub fn recursive_circuit_for_branchout(c: \u0026mut Criterion) {\n    let mut group = c.benchmark_group(\"recursive_circuit_for_branchout\");\n    group.sample_size(10);\n    group.sampling_mode(SamplingMode::Flat); // for long running benchmarks\n    let parallism = 1;\n    bench_recursive_circuit::\u003c4\u003e(\u0026mut group, parallism);\n    bench_recursive_circuit::\u003c8\u003e(\u0026mut group, parallism);\n    bench_recursive_circuit::\u003c16\u003e(\u0026mut group, parallism);\n    bench_recursive_circuit::\u003c32\u003e(\u0026mut group, parallism);\n    bench_recursive_circuit::\u003c64\u003e(\u0026mut group, parallism);\n    group.finish();\n}\n\npub fn recursive_circuit_for_parallism(c: \u0026mut Criterion) {\n    let mut group = c.benchmark_group(\"recursive_circuit_for_parallism\");\n    group.sample_size(10);\n    group.sampling_mode(SamplingMode::Flat); // for long running benchmarks\n    const SUBPROOF_NUM: usize = 64;\n    for \u0026parallism in [1, 2, 4].iter() {\n        bench_recursive_circuit::\u003cSUBPROOF_NUM\u003e(\u0026mut group, parallism);\n    }\n}\n\ncriterion_group!(\n    benches,\n    batch_circuit_for_token_num,\n    batch_circuit_for_batch_size,\n    batch_circuit_for_parallism,\n    recursive_circuit_for_branchout,\n    recursive_circuit_for_parallism\n);\ncriterion_main!(benches);\n","traces":[{"line":77,"address":[],"length":0,"stats":{"Line":0}},{"line":78,"address":[],"length":0,"stats":{"Line":0}},{"line":79,"address":[],"length":0,"stats":{"Line":0}},{"line":80,"address":[],"length":0,"stats":{"Line":0}},{"line":82,"address":[],"length":0,"stats":{"Line":0}},{"line":83,"address":[],"length":0,"stats":{"Line":0}},{"line":85,"address":[],"length":0,"stats":{"Line":0}},{"line":86,"address":[],"length":0,"stats":{"Line":0}},{"line":89,"address":[],"length":0,"stats":{"Line":0}},{"line":90,"address":[],"length":0,"stats":{"Line":0}},{"line":91,"address":[],"length":0,"stats":{"Line":0}},{"line":94,"address":[],"length":0,"stats":{"Line":0}},{"line":95,"address":[],"length":0,"stats":{"Line":0}},{"line":96,"address":[],"length":0,"stats":{"Line":0}},{"line":97,"address":[],"length":0,"stats":{"Line":0}},{"line":98,"address":[],"length":0,"stats":{"Line":0}},{"line":99,"address":[],"length":0,"stats":{"Line":0}},{"line":100,"address":[],"length":0,"stats":{"Line":0}},{"line":101,"address":[],"length":0,"stats":{"Line":0}},{"line":102,"address":[],"length":0,"stats":{"Line":0}},{"line":104,"address":[],"length":0,"stats":{"Line":0}},{"line":105,"address":[],"length":0,"stats":{"Line":0}}],"covered":0,"coverable":22},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","benches","merkle_sum_tree.rs"],"content":"#![feature(test)]\nuse zk_por_core::{account::gen_accounts_with_random_data, merkle_sum_tree::MerkleSumTree};\n\nextern crate test;\nuse test::Bencher;\n\nfn bench(b: \u0026mut Bencher, batch_size: usize) {\n    let num_assets = 200;\n    let accounts = gen_accounts_with_random_data(batch_size, num_assets);\n\n    b.iter(|| _ = MerkleSumTree::new_tree_from_accounts(\u0026accounts));\n}\n\n#[bench]\npub fn bench_batch_size_equal_1024(b: \u0026mut Bencher) {\n    bench(b, 1 \u003c\u003c 10);\n}\n\n#[bench]\npub fn bench_batch_size_equal_2048(b: \u0026mut Bencher) {\n    bench(b, 1 \u003c\u003c 11);\n}\n\n#[bench]\npub fn bench_batch_size_equal_4096(b: \u0026mut Bencher) {\n    bench(b, 1 \u003c\u003c 12);\n}\n\n#[bench]\npub fn bench_batch_size_equal_8192(b: \u0026mut Bencher) {\n    bench(b, 1 \u003c\u003c 13);\n}\n\n#[bench]\npub fn bench_batch_size_equal_16384(b: \u0026mut Bencher) {\n    bench(b, 1 \u003c\u003c 14);\n}\n\n#[bench]\npub fn bench_batch_size_equal_32768(b: \u0026mut Bencher) {\n    bench(b, 1 \u003c\u003c 15);\n}\n","traces":[],"covered":0,"coverable":0},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","account.rs"],"content":"use crate::{\n    database::{PoRDB, UserId},\n    types::F,\n};\nuse plonky2::{\n    hash::{hash_types::HashOut, poseidon::PoseidonHash},\n    plonk::config::Hasher,\n};\nuse plonky2_field::types::Field;\nuse rand::Rng;\nuse serde::{Deserialize, Serialize};\n\n/// A struct representing a users account. It represents their equity and debt as a Vector of goldilocks field elements.\n#[derive(Debug, Clone, Serialize, Deserialize)]\npub struct Account {\n    pub id: String, // 256 bit hex string\n    pub equity: Vec\u003cF\u003e,\n    pub debt: Vec\u003cF\u003e,\n}\n\nimpl Account {\n    /// Gets the account hash for a given account.\n    pub fn get_hash(\u0026self) -\u003e HashOut\u003cF\u003e {\n        let sum_equity = self.equity.iter().fold(F::ZERO, |acc, x| acc + *x);\n\n        let sum_debt = self.debt.iter().fold(F::ZERO, |acc, x| acc + *x);\n\n        let id = self.get_user_id_in_field();\n\n        #[allow(clippy::useless_vec)]\n        let hash =\n            PoseidonHash::hash_no_pad(vec![id, vec![sum_equity, sum_debt]].concat().as_slice());\n\n        hash\n    }\n\n    pub fn get_empty_account_with_user_id(user_id: String, num_of_tokens: usize) -\u003e Account {\n        Self {\n            id: user_id,\n            equity: vec![F::default(); num_of_tokens],\n            debt: vec![F::default(); num_of_tokens],\n        }\n    }\n\n    pub fn get_empty_account(num_of_tokens: usize) -\u003e Account {\n        Self {\n            id: \"0\".repeat(64),\n            equity: vec![F::default(); num_of_tokens],\n            debt: vec![F::default(); num_of_tokens],\n        }\n    }\n\n    /// Gets a user id as a vec of 5 GF elements.\n    pub fn get_user_id_in_field(\u0026self) -\u003e Vec\u003cF\u003e {\n        assert!(self.id.len() == 64);\n        #[allow(clippy::useless_vec)]\n        let segments = vec![\n            self.id[0..14].to_string(),  // First 56 bits (14 hex chars)\n            self.id[14..28].to_string(), // Second 56 bits\n            self.id[28..42].to_string(), // Third 56 bits\n            self.id[42..56].to_string(), // Fourth 56 bits\n            self.id[56..64].to_string(), // Remaining 32 bits (8 hex chars, fits in 56 bits)\n        ];\n\n        segments\n            .iter()\n            .map(|seg| F::from_canonical_u64(u64::from_str_radix(seg, 16).unwrap()))\n            .collect::\u003cVec\u003cF\u003e\u003e()\n    }\n}\n\npub fn persist_account_id_to_gmst_pos(\n    db: \u0026mut Box\u003cdyn PoRDB\u003e,\n    accounts: \u0026Vec\u003cAccount\u003e,\n    start_idx: usize,\n) {\n    let user_batch = accounts\n        .iter()\n        .enumerate()\n        .map(|(i, acct)| {\n            let user_id = UserId::from_hex_string(acct.id.to_string()).unwrap();\n            // tracing::debug!(\"persist account {:?} with index: {:?}\", acct.id, i + start_idx);\n            (user_id, (i + start_idx) as u32)\n        })\n        .collect::\u003cVec\u003c(UserId, u32)\u003e\u003e();\n    db.add_batch_users(user_batch);\n}\n\n/// Generates num_accounts number of accounts with num_assets of assets (with equity and debt being seperate vecs)\npub fn gen_accounts_with_random_data(num_accounts: usize, num_assets: usize) -\u003e Vec\u003cAccount\u003e {\n    let mut accounts: Vec\u003cAccount\u003e = Vec::new();\n    let mut rng = rand::thread_rng(); // Create a random number generator\n    for _ in 0..num_accounts {\n        let mut equities = Vec::new();\n        let mut debts = Vec::new();\n        for _ in 0..num_assets {\n            let equity = rng.gen_range(1..1000);\n            let debt = equity - 1; // such that debt is always less than equity\n            equities.push(F::from_canonical_u32(equity));\n            debts.push(F::from_canonical_u32(debt));\n        }\n\n        let mut bytes = [0u8; 32]; // 32 bytes * 2 hex chars per byte = 64 hex chars\n        rng.fill(\u0026mut bytes);\n        #[allow(clippy::format_collect)]\n        let account_id = bytes.iter().map(|byte| format!(\"{:02x}\", byte)).collect::\u003cString\u003e();\n        accounts.push(Account { id: account_id, equity: equities, debt: debts });\n    }\n    accounts\n}\n\npub fn gen_empty_accounts(batch_size: usize, num_assets: usize) -\u003e Vec\u003cAccount\u003e {\n    let accounts =\n        vec![\n            Account::get_empty_account_with_user_id(UserId::rand().to_string(), num_assets);\n            batch_size\n        ];\n    accounts\n}\n","traces":[{"line":23,"address":[9666969,9666128,9666998],"length":1,"stats":{"Line":1}},{"line":24,"address":[11354096,11354064,11353142],"length":1,"stats":{"Line":3}},{"line":26,"address":[11354144,11353241,11354112],"length":1,"stats":{"Line":3}},{"line":28,"address":[11353301],"length":1,"stats":{"Line":1}},{"line":31,"address":[11353336,11353394,11353994],"length":1,"stats":{"Line":2}},{"line":37,"address":[11354160,11354468],"length":1,"stats":{"Line":0}},{"line":40,"address":[9667255,9667183],"length":1,"stats":{"Line":0}},{"line":41,"address":[11354354,11354290],"length":1,"stats":{"Line":0}},{"line":45,"address":[11354496,11354807],"length":1,"stats":{"Line":1}},{"line":47,"address":[11354523],"length":1,"stats":{"Line":1}},{"line":48,"address":[11354618,11354554],"length":1,"stats":{"Line":2}},{"line":49,"address":[11354693,11354634],"length":1,"stats":{"Line":2}},{"line":54,"address":[11354832,11355931],"length":1,"stats":{"Line":1}},{"line":55,"address":[11354967,11354882],"length":1,"stats":{"Line":1}},{"line":57,"address":[11355116,11354903,11354995,11355231,11355747,11355461,11355530,11355346,11355953],"length":1,"stats":{"Line":2}},{"line":58,"address":[11354924,11355063],"length":1,"stats":{"Line":2}},{"line":59,"address":[11355078,11355178],"length":1,"stats":{"Line":2}},{"line":60,"address":[11355293,11355193],"length":1,"stats":{"Line":2}},{"line":61,"address":[11355308,11355408],"length":1,"stats":{"Line":2}},{"line":62,"address":[9668395,9668495],"length":1,"stats":{"Line":2}},{"line":65,"address":[11355721,11355822],"length":1,"stats":{"Line":2}},{"line":67,"address":[11355968,11355995,11356176],"length":1,"stats":{"Line":3}},{"line":72,"address":[11356192],"length":1,"stats":{"Line":0}},{"line":77,"address":[9669187],"length":1,"stats":{"Line":0}},{"line":80,"address":[11356400,11356336],"length":1,"stats":{"Line":0}},{"line":81,"address":[9669360],"length":1,"stats":{"Line":0}},{"line":83,"address":[11356722,11356797],"length":1,"stats":{"Line":0}},{"line":86,"address":[11356301],"length":1,"stats":{"Line":0}},{"line":90,"address":[9671030,9669760,9670999],"length":1,"stats":{"Line":1}},{"line":91,"address":[11356871],"length":1,"stats":{"Line":1}},{"line":92,"address":[9669860,9669936],"length":1,"stats":{"Line":2}},{"line":93,"address":[11357903,11357086,11357004],"length":1,"stats":{"Line":3}},{"line":94,"address":[11357226],"length":1,"stats":{"Line":1}},{"line":95,"address":[11357269],"length":1,"stats":{"Line":1}},{"line":96,"address":[9670285,9670366],"length":1,"stats":{"Line":2}},{"line":97,"address":[11357554,11357912],"length":1,"stats":{"Line":2}},{"line":98,"address":[11357964,11357919],"length":1,"stats":{"Line":1}},{"line":99,"address":[11357989,11357948],"length":1,"stats":{"Line":2}},{"line":100,"address":[11358012],"length":1,"stats":{"Line":1}},{"line":103,"address":[11357508],"length":1,"stats":{"Line":1}},{"line":104,"address":[9670483],"length":1,"stats":{"Line":1}},{"line":106,"address":[11358527,11357590,11358144,11358651,11358272],"length":1,"stats":{"Line":5}},{"line":107,"address":[11357684],"length":1,"stats":{"Line":1}},{"line":109,"address":[11357176],"length":1,"stats":{"Line":1}},{"line":112,"address":[11358672],"length":1,"stats":{"Line":0}},{"line":113,"address":[11358779],"length":1,"stats":{"Line":0}},{"line":115,"address":[11358715],"length":1,"stats":{"Line":0}}],"covered":35,"coverable":47},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","circuit_config.rs"],"content":"use plonky2::{\n    fri::{reduction_strategies::FriReductionStrategy, FriConfig},\n    plonk::circuit_data::CircuitConfig,\n};\n\nuse super::circuit_utils::recursive_levels;\n\npub const STANDARD_CONFIG: CircuitConfig = CircuitConfig {\n    num_wires: 135,\n    num_routed_wires: 80,\n    num_constants: 2,\n    use_base_arithmetic_gate: true,\n    security_bits: 100,\n    num_challenges: 2,\n    zero_knowledge: false,\n    max_quotient_degree_factor: 8,\n    fri_config: FriConfig {\n        rate_bits: 3,\n        cap_height: 1,\n        proof_of_work_bits: 16,\n        reduction_strategy: FriReductionStrategy::ConstantArityBits(4, 5),\n        num_query_rounds: 28,\n    },\n};\n\n// A high-rate recursive proof, designed to be verifiable with fewer routed wires.\npub const HIGH_RATE_CONFIG: CircuitConfig = CircuitConfig {\n    num_wires: 135,\n    num_routed_wires: 80,\n    num_constants: 2,\n    use_base_arithmetic_gate: true,\n    security_bits: 100,\n    num_challenges: 2,\n    zero_knowledge: false,\n    max_quotient_degree_factor: 8,\n    fri_config: FriConfig {\n        rate_bits: 7,\n        cap_height: 1,\n        proof_of_work_bits: 16,\n        reduction_strategy: FriReductionStrategy::ConstantArityBits(4, 5),\n        num_query_rounds: 12,\n    },\n};\n\npub const STANDARD_ZK_CONFIG: CircuitConfig = CircuitConfig {\n    num_wires: 135,\n    num_routed_wires: 80,\n    num_constants: 2,\n    use_base_arithmetic_gate: true,\n    security_bits: 100,\n    num_challenges: 2,\n    zero_knowledge: true,\n    max_quotient_degree_factor: 8,\n    fri_config: FriConfig {\n        rate_bits: 3,\n        cap_height: 1,\n        proof_of_work_bits: 16,\n        reduction_strategy: FriReductionStrategy::ConstantArityBits(4, 5),\n        num_query_rounds: 28,\n    },\n};\n\npub fn get_recursive_circuit_configs\u003cconst RECURSION_BRANCHOUT_NUM: usize\u003e(\n    batch_num: usize,\n) -\u003e Vec\u003cCircuitConfig\u003e {\n    let level = recursive_levels(batch_num, RECURSION_BRANCHOUT_NUM);\n\n    let mut configs = vec![STANDARD_CONFIG; level];\n\n    // The last circuit is a zk circuit, and the rest are standard circuits.\n    // there is at least one recursive circuit.\n    *configs.last_mut().unwrap() = STANDARD_ZK_CONFIG;\n    configs\n}\n\n#[cfg(test)]\npub mod test {\n    use crate::circuit_config::{STANDARD_CONFIG, STANDARD_ZK_CONFIG};\n\n    use super::get_recursive_circuit_configs;\n\n    #[test]\n    pub fn test_get_recursive_circuit_config() {\n        let batch_num = 1;\n        let cfgs = get_recursive_circuit_configs::\u003c64\u003e(batch_num);\n        assert_eq!(vec![STANDARD_ZK_CONFIG], cfgs);\n\n        let batch_num = 66;\n        let cfgs = get_recursive_circuit_configs::\u003c64\u003e(batch_num);\n        assert_eq!(vec![STANDARD_CONFIG, STANDARD_ZK_CONFIG], cfgs);\n    }\n}\n","traces":[{"line":63,"address":[9008002,9007536],"length":1,"stats":{"Line":1}},{"line":66,"address":[],"length":0,"stats":{"Line":1}},{"line":68,"address":[],"length":0,"stats":{"Line":1}},{"line":72,"address":[],"length":0,"stats":{"Line":3}},{"line":73,"address":[],"length":0,"stats":{"Line":1}}],"covered":5,"coverable":5},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","circuit_registry","mod.rs"],"content":"pub mod registry;\n","traces":[],"covered":0,"coverable":0},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","circuit_registry","registry.rs"],"content":"use plonky2::{\n    hash::hash_types::HashOut,\n    plonk::{\n        circuit_data::{CircuitConfig, CircuitData},\n        proof::ProofWithPublicInputs,\n    },\n};\n\nuse crate::{\n    merkle_sum_prover::circuits::{\n        account_circuit::AccountTargets, merkle_sum_circuit::build_merkle_sum_tree_circuit,\n    },\n    recursive_prover::recursive_circuit::{build_recursive_n_circuit, RecursiveTargets},\n    types::{C, D, F},\n};\n\n#[cfg(not(feature = \"verifier\"))]\nuse crate::{\n    account::gen_empty_accounts, merkle_sum_prover::prover::MerkleSumTreeProver,\n    recursive_prover::prover::RecursiveProver,\n};\n\nuse std::collections::HashMap;\n\n#[allow(clippy::type_complexity)]\npub struct CircuitRegistry\u003cconst RECURSION_BRANCHOUT_NUM: usize\u003e {\n    batch_circuit: (CircuitData\u003cF, C, D\u003e, Vec\u003cAccountTargets\u003e),\n    // inner_vd =\u003e the verification circuit that verify the inner circuit\n    recursive_circuits:\n        HashMap\u003cHashOut\u003cF\u003e, (CircuitData\u003cF, C, D\u003e, RecursiveTargets\u003cRECURSION_BRANCHOUT_NUM\u003e)\u003e,\n    // circuit_vd -\u003e empty proof\n    #[cfg(not(feature = \"verifier\"))]\n    empty_proofs: HashMap\u003cHashOut\u003cF\u003e, ProofWithPublicInputs\u003cF, C, D\u003e\u003e,\n\n    last_inner_circuit_vd: HashOut\u003cF\u003e,\n}\n\nimpl\u003cconst RECURSION_BRANCHOUT_NUM: usize\u003e CircuitRegistry\u003cRECURSION_BRANCHOUT_NUM\u003e {\n    pub fn init(\n        batch_size: usize,\n        token_num: usize,\n        batch_circuit_config: CircuitConfig,\n        recursive_level_configs: Vec\u003cCircuitConfig\u003e,\n    ) -\u003e Self {\n        let init_start = std::time::Instant::now();\n\n        let start = std::time::Instant::now();\n        let (batch_circuit_data, account_targets) =\n            build_merkle_sum_tree_circuit(batch_size, token_num, batch_circuit_config);\n        tracing::info!(\n            \"build merkle sum tree circuit with batch size {} in : {:?}\",\n            batch_size,\n            start.elapsed()\n        );\n\n        let mut recursive_circuits = HashMap::new();\n        let mut last_circuit_data = \u0026batch_circuit_data;\n        let mut last_circuit_vd = last_circuit_data.verifier_only.circuit_digest;\n        let mut _empty_proofs: HashMap\u003cHashOut\u003cF\u003e, ProofWithPublicInputs\u003cF, C, D\u003e\u003e = HashMap::new();\n        let mut _last_empty_proof: ProofWithPublicInputs\u003cF, C, D\u003e;\n\n        #[cfg(not(feature = \"verifier\"))]\n        {\n            let accounts = gen_empty_accounts(batch_size, token_num);\n            let start = std::time::Instant::now();\n            let prover = MerkleSumTreeProver { accounts };\n            let empty_batch_proof =\n                prover.get_proof_with_circuit_data(\u0026account_targets, \u0026batch_circuit_data);\n            tracing::info!(\n                \"prove merkle sum tree with batch size {} in : {:?}\",\n                batch_size,\n                start.elapsed()\n            );\n            _last_empty_proof = empty_batch_proof.clone();\n            _empty_proofs\n                .insert(last_circuit_data.verifier_only.circuit_digest, _last_empty_proof.clone());\n        }\n\n        for (level, circuit_config) in recursive_level_configs.into_iter().enumerate() {\n            let start = std::time::Instant::now();\n            let (recursive_circuit, recursive_targets) =\n                build_recursive_n_circuit::\u003cC, RECURSION_BRANCHOUT_NUM\u003e(\n                    \u0026last_circuit_data.common,\n                    \u0026last_circuit_data.verifier_only,\n                    circuit_config,\n                );\n            tracing::info!(\n                \"build recursive circuit at level {} in : {:?}, with vd {:?}\",\n                level,\n                start.elapsed(),\n                recursive_circuit.verifier_only.circuit_digest\n            );\n\n            #[cfg(not(feature = \"verifier\"))]\n            {\n                let sub_proofs: [ProofWithPublicInputs\u003cF, C, D\u003e; RECURSION_BRANCHOUT_NUM] =\n                    std::array::from_fn(|_| _last_empty_proof.clone());\n                let start = std::time::Instant::now();\n                let recursive_prover = RecursiveProver {\n                    sub_proofs,\n                    sub_circuit_vd: last_circuit_data.verifier_only.clone(),\n                };\n                let recursive_proof = recursive_prover\n                    .get_proof_with_circuit_data(recursive_targets.clone(), \u0026recursive_circuit);\n\n                tracing::info!(\n                    \"prove empty recursive subproofs at level {} in : {:?}\",\n                    level,\n                    start.elapsed()\n                );\n\n                _empty_proofs.insert(\n                    recursive_circuit.verifier_only.circuit_digest,\n                    recursive_proof.clone(),\n                );\n\n                _last_empty_proof = recursive_proof;\n            }\n\n            last_circuit_vd = last_circuit_data.verifier_only.circuit_digest;\n            recursive_circuits.insert(last_circuit_vd, (recursive_circuit, recursive_targets));\n            last_circuit_data = \u0026recursive_circuits[\u0026last_circuit_vd].0;\n        }\n\n        tracing::info!(\n            \"finish init circuit registry with {} recursive levels in {:?}\",\n            recursive_circuits.len(),\n            init_start.elapsed()\n        );\n\n        #[cfg(feature = \"verifier\")]\n        {\n            Self {\n                batch_circuit: (batch_circuit_data, account_targets),\n                recursive_circuits: recursive_circuits,\n                last_inner_circuit_vd: last_circuit_vd,\n            }\n        }\n        #[cfg(not(feature = \"verifier\"))]\n        {\n            Self {\n                batch_circuit: (batch_circuit_data, account_targets),\n                empty_proofs: _empty_proofs,\n                recursive_circuits: recursive_circuits,\n                last_inner_circuit_vd: last_circuit_vd,\n            }\n        }\n    }\n\n    pub fn get_batch_circuit(\u0026self) -\u003e (\u0026CircuitData\u003cF, C, D\u003e, \u0026[AccountTargets]) {\n        (\u0026self.batch_circuit.0, \u0026self.batch_circuit.1)\n    }\n\n    pub fn get_empty_proof(\n        \u0026self,\n        _circuit_vd: \u0026HashOut\u003cF\u003e,\n    ) -\u003e Option\u003c\u0026ProofWithPublicInputs\u003cF, C, D\u003e\u003e {\n        #[cfg(feature = \"verifier\")]\n        {\n            tracing::error!(\"empty proof is not available in verifier mode\");\n            None\n        }\n\n        #[cfg(not(feature = \"verifier\"))]\n        {\n            self.empty_proofs.get(_circuit_vd)\n        }\n    }\n\n    /// leaf node at level 0\n    pub fn get_recursive_circuit(\n        \u0026self,\n        inner_circuit_vd: \u0026HashOut\u003cF\u003e,\n    ) -\u003e Option\u003c(\u0026CircuitData\u003cF, C, D\u003e, \u0026RecursiveTargets\u003cRECURSION_BRANCHOUT_NUM\u003e)\u003e {\n        let circuit_and_targets = self.recursive_circuits.get(inner_circuit_vd)?;\n        Some((\u0026circuit_and_targets.0, \u0026circuit_and_targets.1))\n    }\n\n    pub fn get_recursive_levels(\u0026self) -\u003e usize {\n        self.recursive_circuits.len()\n    }\n\n    pub fn get_root_circuit(\u0026self) -\u003e \u0026CircuitData\u003cF, C, D\u003e {\n        \u0026self.recursive_circuits[\u0026self.last_inner_circuit_vd].0\n    }\n}\n","traces":[{"line":39,"address":[9284478,9284742,9271760],"length":1,"stats":{"Line":0}},{"line":45,"address":[],"length":0,"stats":{"Line":0}},{"line":47,"address":[],"length":0,"stats":{"Line":0}},{"line":48,"address":[],"length":0,"stats":{"Line":0}},{"line":49,"address":[],"length":0,"stats":{"Line":0}},{"line":50,"address":[],"length":0,"stats":{"Line":0}},{"line":51,"address":[],"length":0,"stats":{"Line":0}},{"line":52,"address":[],"length":0,"stats":{"Line":0}},{"line":53,"address":[],"length":0,"stats":{"Line":0}},{"line":56,"address":[],"length":0,"stats":{"Line":0}},{"line":57,"address":[],"length":0,"stats":{"Line":0}},{"line":58,"address":[9274165],"length":1,"stats":{"Line":0}},{"line":59,"address":[9274211],"length":1,"stats":{"Line":0}},{"line":60,"address":[],"length":0,"stats":{"Line":0}},{"line":64,"address":[],"length":0,"stats":{"Line":0}},{"line":65,"address":[],"length":0,"stats":{"Line":0}},{"line":66,"address":[9274445],"length":1,"stats":{"Line":0}},{"line":67,"address":[9274517,9274612],"length":1,"stats":{"Line":0}},{"line":68,"address":[],"length":0,"stats":{"Line":0}},{"line":69,"address":[],"length":0,"stats":{"Line":0}},{"line":70,"address":[],"length":0,"stats":{"Line":0}},{"line":71,"address":[],"length":0,"stats":{"Line":0}},{"line":72,"address":[],"length":0,"stats":{"Line":0}},{"line":74,"address":[],"length":0,"stats":{"Line":0}},{"line":75,"address":[9276588],"length":1,"stats":{"Line":0}},{"line":76,"address":[],"length":0,"stats":{"Line":0}},{"line":79,"address":[],"length":0,"stats":{"Line":0}},{"line":80,"address":[],"length":0,"stats":{"Line":0}},{"line":81,"address":[],"length":0,"stats":{"Line":0}},{"line":83,"address":[9279501],"length":1,"stats":{"Line":0}},{"line":84,"address":[],"length":0,"stats":{"Line":0}},{"line":85,"address":[],"length":0,"stats":{"Line":0}},{"line":87,"address":[],"length":0,"stats":{"Line":0}},{"line":88,"address":[],"length":0,"stats":{"Line":0}},{"line":89,"address":[],"length":0,"stats":{"Line":0}},{"line":90,"address":[],"length":0,"stats":{"Line":0}},{"line":91,"address":[],"length":0,"stats":{"Line":0}},{"line":96,"address":[],"length":0,"stats":{"Line":0}},{"line":97,"address":[],"length":0,"stats":{"Line":0}},{"line":98,"address":[],"length":0,"stats":{"Line":0}},{"line":101,"address":[9281798],"length":1,"stats":{"Line":0}},{"line":103,"address":[],"length":0,"stats":{"Line":0}},{"line":104,"address":[],"length":0,"stats":{"Line":0}},{"line":106,"address":[],"length":0,"stats":{"Line":0}},{"line":107,"address":[],"length":0,"stats":{"Line":0}},{"line":108,"address":[],"length":0,"stats":{"Line":0}},{"line":109,"address":[],"length":0,"stats":{"Line":0}},{"line":112,"address":[],"length":0,"stats":{"Line":0}},{"line":113,"address":[],"length":0,"stats":{"Line":0}},{"line":114,"address":[],"length":0,"stats":{"Line":0}},{"line":117,"address":[],"length":0,"stats":{"Line":0}},{"line":120,"address":[],"length":0,"stats":{"Line":0}},{"line":121,"address":[],"length":0,"stats":{"Line":0}},{"line":122,"address":[],"length":0,"stats":{"Line":0}},{"line":125,"address":[],"length":0,"stats":{"Line":0}},{"line":126,"address":[],"length":0,"stats":{"Line":0}},{"line":127,"address":[],"length":0,"stats":{"Line":0}},{"line":128,"address":[],"length":0,"stats":{"Line":0}},{"line":134,"address":[],"length":0,"stats":{"Line":0}},{"line":142,"address":[9278036],"length":1,"stats":{"Line":0}},{"line":150,"address":[],"length":0,"stats":{"Line":0}},{"line":151,"address":[],"length":0,"stats":{"Line":0}},{"line":154,"address":[9271440],"length":1,"stats":{"Line":0}},{"line":160,"address":[],"length":0,"stats":{"Line":0}},{"line":161,"address":[],"length":0,"stats":{"Line":0}},{"line":166,"address":[],"length":0,"stats":{"Line":0}},{"line":171,"address":[9271632],"length":1,"stats":{"Line":0}},{"line":175,"address":[],"length":0,"stats":{"Line":0}},{"line":176,"address":[],"length":0,"stats":{"Line":0}},{"line":179,"address":[],"length":0,"stats":{"Line":0}},{"line":180,"address":[],"length":0,"stats":{"Line":0}},{"line":183,"address":[],"length":0,"stats":{"Line":0}},{"line":184,"address":[],"length":0,"stats":{"Line":0}}],"covered":0,"coverable":73},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","circuit_utils.rs"],"content":"use log::Level;\nuse plonky2::{\n    hash::hash_types::RichField,\n    iop::{target::Target, witness::PartialWitness},\n    plonk::{\n        circuit_builder::CircuitBuilder, circuit_data::CircuitData, config::GenericConfig,\n        prover::prove,\n    },\n    util::timing::TimingTree,\n};\nuse plonky2_field::extension::Extendable;\nuse std::panic;\n\nuse crate::{\n    circuit_config::STANDARD_CONFIG,\n    types::{C, D, F, MAX_POSITIVE_AMOUNT_LOG},\n};\n\npub fn prove_timing() -\u003e TimingTree {\n    let mut level = Level::Info;\n    if cfg!(debug_assertions) {\n        level = Level::Debug;\n    }\n\n    TimingTree::new(\"prove\", level)\n}\n\npub fn recursive_levels(batch_num: usize, recursion_branchout_num: usize) -\u003e usize {\n    let level = (batch_num as f64).log(recursion_branchout_num as f64).ceil() as usize;\n    std::cmp::max(1, level)\n}\n\n/// Test runner for ease of testing\n#[allow(clippy::unused_unit)]\npub fn run_circuit_test\u003cT, F, const D: usize\u003e(test: T)\nwhere\n    T: FnOnce(\u0026mut CircuitBuilder\u003cF, D\u003e, \u0026mut PartialWitness\u003cF\u003e) -\u003e () + panic::UnwindSafe,\n    F: RichField + Extendable\u003cD\u003e,\n    C: GenericConfig\u003cD, F = F\u003e,\n{\n    let mut builder = CircuitBuilder::\u003cF, D\u003e::new(STANDARD_CONFIG);\n    let mut pw: PartialWitness\u003cF\u003e = PartialWitness::\u003cF\u003e::new();\n    test(\u0026mut builder, \u0026mut pw);\n    builder.print_gate_counts(0);\n    let mut timing = TimingTree::new(\"prove\", Level::Debug);\n    let data = builder.build::\u003cC\u003e();\n    let CircuitData { prover_only, common, verifier_only: _ } = \u0026data;\n    let proof = prove(prover_only, common, pw, \u0026mut timing).expect(\"Prove fail\");\n    timing.print();\n    data.verify(proof).expect(\"Verify fail\")\n}\n\n/// Assert 0 \u003c= x \u003c= MAX_POSITIVE_AMOUNT\n/// MAX_POSITIVE_AMOUNT =  (1 \u003c\u003c MAX_POSITIVE_AMOUNT_LOG) - 1\npub fn assert_non_negative_unsigned(builder: \u0026mut CircuitBuilder\u003cF, D\u003e, x: Target) {\n    builder.range_check(x, MAX_POSITIVE_AMOUNT_LOG);\n}\n\n#[cfg(test)]\npub mod test {\n    use crate::types::F;\n\n    use plonky2_field::types::{Field, Field64};\n\n    use super::{assert_non_negative_unsigned, run_circuit_test};\n\n    #[test]\n    fn test_assert_non_negative_unsigned() {\n        run_circuit_test(|builder, _pw| {\n            let x = builder.constant(F::from_canonical_u16(0));\n            assert_non_negative_unsigned(builder, x);\n        });\n    }\n\n    #[test]\n    #[should_panic]\n    fn test_assert_non_negative_unsigned_panic() {\n        run_circuit_test(|builder, _pw| {\n            let x = builder.constant(F::from_canonical_u64(F::ORDER - 1));\n            assert_non_negative_unsigned(builder, x);\n        });\n    }\n}\n","traces":[{"line":19,"address":[11666576],"length":1,"stats":{"Line":1}},{"line":20,"address":[11666580],"length":1,"stats":{"Line":1}},{"line":22,"address":[11666589],"length":1,"stats":{"Line":1}},{"line":25,"address":[11666608],"length":1,"stats":{"Line":1}},{"line":28,"address":[11666640],"length":1,"stats":{"Line":1}},{"line":29,"address":[11666653],"length":1,"stats":{"Line":1}},{"line":30,"address":[11666808],"length":1,"stats":{"Line":1}},{"line":35,"address":[9804400,9801472,9803401,9805353,9802448,9803424,9802383,9802425,9804335,9803359,9801449,9805311,9806329,9804377,9806287,9801407,9805376,9800496],"length":1,"stats":{"Line":7}},{"line":41,"address":[9800515,9802467,9801697,9800721,9801491,9803443,9803649,9804419,9804625,9805395,9802673,9805601],"length":1,"stats":{"Line":12}},{"line":42,"address":[],"length":0,"stats":{"Line":6}},{"line":43,"address":[],"length":0,"stats":{"Line":6}},{"line":44,"address":[],"length":0,"stats":{"Line":6}},{"line":45,"address":[],"length":0,"stats":{"Line":6}},{"line":46,"address":[],"length":0,"stats":{"Line":6}},{"line":47,"address":[],"length":0,"stats":{"Line":6}},{"line":48,"address":[],"length":0,"stats":{"Line":11}},{"line":49,"address":[],"length":0,"stats":{"Line":5}},{"line":50,"address":[],"length":0,"stats":{"Line":5}},{"line":55,"address":[11666832],"length":1,"stats":{"Line":1}},{"line":56,"address":[11666841],"length":1,"stats":{"Line":1}}],"covered":20,"coverable":20},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","config.rs"],"content":"use std::str::FromStr;\n\nuse config::{Config, ConfigError, File};\nuse serde::Deserialize;\nuse tracing::Level;\nuse zk_por_tracing::TraceConfig;\n\n#[derive(Debug, Clone, Deserialize)]\npub struct ConfigLog {\n    pub file_name_prefix: String,\n    pub dir: String,\n    pub level: String,\n    pub flame: bool,\n    pub console: bool,\n}\n\nimpl From\u003cConfigLog\u003e for TraceConfig {\n    fn from(log_cfg: ConfigLog) -\u003e Self {\n        TraceConfig {\n            prefix: log_cfg.file_name_prefix,\n            dir: log_cfg.dir,\n            level: Level::from_str(\u0026log_cfg.level).unwrap(),\n            console: log_cfg.console,\n            flame: log_cfg.flame,\n        }\n    }\n}\n\n#[derive(Debug, Clone, Deserialize)]\npub struct ConfigProver {\n    pub round_no: usize,\n    pub batch_size: Option\u003cusize\u003e,\n    pub tokens: Vec\u003cString\u003e,\n    pub user_data_path: String,\n    pub batch_prove_threads_num: usize,\n    pub recursive_prove_threads_num: usize,\n}\n\n#[derive(Debug, Clone, Deserialize)]\npub struct ConfigDb {\n    pub level_db_user_path: String,\n    pub level_db_gmst_path: String,\n}\n\nimpl ConfigDb {\n    pub fn load(dir: \u0026str) -\u003e Result\u003cConfig, ConfigError\u003e {\n        let env = std::env::var(\"ENV\").unwrap_or(\"default\".into());\n        Config::builder()\n            .add_source(File::with_name(\u0026format!(\"{}/default\", dir)))\n            .add_source(File::with_name(\u0026format!(\"{}/{}\", dir, env)).required(false))\n            .add_source(File::with_name(\u0026format!(\"{}/local\", dir)).required(false))\n            .add_source(config::Environment::with_prefix(\"ZKPOR\"))\n            .build()\n    }\n    pub fn try_new() -\u003e Result\u003cSelf, ConfigError\u003e {\n        let config = Self::load(\"config\")?;\n        config.try_deserialize()\n    }\n}\n\n#[derive(Debug, Clone, Deserialize)]\npub struct ProverConfig {\n    pub log: ConfigLog,\n    pub prover: ConfigProver,\n    pub db: Option\u003cConfigDb\u003e,\n}\n\nimpl ProverConfig {\n    pub fn load(dir: \u0026str) -\u003e Result\u003cConfig, ConfigError\u003e {\n        let env = std::env::var(\"ENV\").unwrap_or(\"default\".into());\n        Config::builder()\n            // .add_source(File::with_name(\u0026format!(\"{}/default\", dir)))\n            .add_source(File::with_name(\u0026format!(\"{}/{}\", dir, env)).required(false))\n            .add_source(File::with_name(\u0026format!(\"{}/local\", dir)).required(false))\n            .add_source(config::Environment::with_prefix(\"ZKPOR\"))\n            .build()\n    }\n    pub fn try_new() -\u003e Result\u003cSelf, ConfigError\u003e {\n        let config = Self::load(\"config\")?;\n        config.try_deserialize()\n    }\n}\n","traces":[{"line":18,"address":[9672221,9671728,9672176],"length":1,"stats":{"Line":0}},{"line":20,"address":[11358846],"length":1,"stats":{"Line":0}},{"line":21,"address":[11358863],"length":1,"stats":{"Line":0}},{"line":22,"address":[11358884,11358976],"length":1,"stats":{"Line":0}},{"line":23,"address":[11359163],"length":1,"stats":{"Line":0}},{"line":24,"address":[11359166],"length":1,"stats":{"Line":0}},{"line":46,"address":[12796593,12796700,12794448],"length":1,"stats":{"Line":0}},{"line":47,"address":[12796713,12794475],"length":1,"stats":{"Line":0}},{"line":48,"address":[12796123,12795672,12794673,12796251,12795104,12796307],"length":1,"stats":{"Line":0}},{"line":49,"address":[12795147,12794844,12795017,12794733,12796681],"length":1,"stats":{"Line":0}},{"line":50,"address":[12795556,12795266,12796643,12795411,12795715],"length":1,"stats":{"Line":0}},{"line":51,"address":[12795834,12796007,12796166,12796602],"length":1,"stats":{"Line":0}},{"line":52,"address":[10581859,10582139,10581746],"length":1,"stats":{"Line":0}},{"line":55,"address":[12797133,12796736,12797104],"length":1,"stats":{"Line":0}},{"line":56,"address":[12796753,12796987],"length":1,"stats":{"Line":0}},{"line":57,"address":[12796943],"length":1,"stats":{"Line":0}},{"line":69,"address":[12797152,12798799,12798868],"length":1,"stats":{"Line":0}},{"line":70,"address":[12798881,12797179],"length":1,"stats":{"Line":0}},{"line":71,"address":[10584077,10583901,10583464,10584025,10582895],"length":1,"stats":{"Line":0}},{"line":73,"address":[12797983,12798849,12797679,12797534,12797423,12797824],"length":1,"stats":{"Line":0}},{"line":74,"address":[12798432,12798102,12798275,12798808],"length":1,"stats":{"Line":0}},{"line":75,"address":[12798565,12798777,12798448],"length":1,"stats":{"Line":0}},{"line":78,"address":[12799309,12798912,12799280],"length":1,"stats":{"Line":0}},{"line":79,"address":[12799163,12798929],"length":1,"stats":{"Line":0}},{"line":80,"address":[12799119],"length":1,"stats":{"Line":0}}],"covered":0,"coverable":25},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","database.rs"],"content":"use std::str::FromStr;\n\nuse hex::ToHex;\nuse plonky2::{hash::hash_types::HashOut, plonk::config::GenericHashOut};\nuse rand::Rng;\nuse zk_por_db::LevelDb;\n\nuse crate::{error::PoRError, global::GLOBAL_MST, types::F};\nuse std::{collections::HashMap, sync::RwLock};\n#[derive(Debug, Clone, Copy, Eq, Hash, PartialEq)]\npub struct UserId(pub [u8; 32]);\n\nimpl UserId {\n    pub fn rand() -\u003e Self {\n        let mut bytes: [u8; 32] = [0; 32];\n        let mut rng = rand::thread_rng();\n        rng.fill(\u0026mut bytes);\n        Self(bytes)\n    }\n\n    pub fn to_string(\u0026self) -\u003e String {\n        self.0.encode_hex()\n    }\n\n    pub fn from_hex_string(hex_str: String) -\u003e Result\u003cSelf, PoRError\u003e {\n        if hex_str.len() != 64 {\n            tracing::error!(\"User Id: {:?} is not a valid id, length is not 256 bits\", hex_str);\n            return Err(PoRError::InvalidParameter(hex_str));\n        }\n\n        let decode_res = hex::decode(hex_str.clone());\n\n        if decode_res.is_err() {\n            tracing::error!(\"User Id: {:?} is not a valid id\", hex_str);\n            return Err(PoRError::InvalidParameter(hex_str));\n        }\n\n        let mut arr = [0u8; 32];\n        arr.copy_from_slice(\u0026decode_res.unwrap());\n\n        Ok(UserId { 0: arr })\n    }\n}\n\nimpl db_key::Key for UserId {\n    fn from_u8(key: \u0026[u8]) -\u003e UserId {\n        assert!(key.len() == 32);\n        let mut output: [u8; 32] = [0; 32];\n        unsafe {\n            std::ptr::copy_nonoverlapping(key.as_ptr(), output.as_mut_ptr(), 32);\n        }\n        UserId(output)\n    }\n\n    fn as_slice\u003cT, F: Fn(\u0026[u8]) -\u003e T\u003e(\u0026self, f: F) -\u003e T {\n        let dst = self.0.as_slice();\n        f(\u0026dst)\n    }\n}\n\npub trait PoRDB: Sync + Send {\n    fn add_batch_users(\u0026mut self, batches: Vec\u003c(UserId, u32)\u003e);\n    fn get_user_index(\u0026self, user_id: UserId) -\u003e Option\u003cu32\u003e;\n    fn add_batch_gmst_nodes(\u0026mut self, batches: Vec\u003c(i32, HashOut\u003cF\u003e)\u003e);\n    fn get_gmst_node_hash(\u0026self, node_idx: i32) -\u003e Option\u003cHashOut\u003cF\u003e\u003e;\n}\n\npub struct PoRLevelDBOption {\n    pub user_map_dir: String,\n    pub gmst_dir: String,\n}\n\npub struct PoRLevelDB {\n    user_db: LevelDb\u003cUserId\u003e,\n    gmst_db: LevelDb\u003ci32\u003e, // we use i32 as a key of type u32 is not provided by default in leveldb\n}\n\nimpl PoRLevelDB {\n    pub fn new(opt: PoRLevelDBOption) -\u003e Self {\n        Self {\n            user_db: LevelDb::new(\u0026std::path::PathBuf::from_str(\u0026opt.user_map_dir).unwrap()),\n            gmst_db: LevelDb::new(\u0026std::path::PathBuf::from_str(\u0026opt.gmst_dir).unwrap()),\n        }\n    }\n}\n\nimpl PoRDB for PoRLevelDB {\n    fn add_batch_users(\u0026mut self, batches: Vec\u003c(UserId, u32)\u003e) {\n        let batches = batches\n            .into_iter()\n            .map(|(id, idx)| (id, idx.to_be_bytes().to_vec()))\n            .collect::\u003cVec\u003c(UserId, Vec\u003cu8\u003e)\u003e\u003e();\n        self.user_db.batch_put(batches)\n    }\n\n    fn get_user_index(\u0026self, user_id: UserId) -\u003e Option\u003cu32\u003e {\n        let ret = self.user_db.get(user_id).map(|x| {\n            let mut buf = [0; 4];\n            buf.as_mut_slice().copy_from_slice(\u0026x[0..4]);\n            u32::from_be_bytes(buf)\n        });\n        ret\n    }\n\n    /// 0: the index of the gmst\n    /// 1: the hash value at that index\n    fn add_batch_gmst_nodes(\u0026mut self, batches: Vec\u003c(i32, HashOut\u003cF\u003e)\u003e) {\n        let batches = batches\n            .into_iter()\n            .map(|(id, hash)| {\n                let ret = (id, hash.to_bytes());\n                ret\n            })\n            .collect::\u003cVec\u003c(i32, Vec\u003cu8\u003e)\u003e\u003e();\n        self.gmst_db.batch_put(batches);\n    }\n\n    fn get_gmst_node_hash(\u0026self, node_idx: i32) -\u003e Option\u003cHashOut\u003cF\u003e\u003e {\n        let ret = self.gmst_db.get(node_idx).map(|x| {\n            let ret = HashOut::\u003cF\u003e::from_bytes(\u0026x);\n            ret\n        });\n        ret\n    }\n}\n\npub struct PoRMemoryDB {\n    user_map: HashMap\u003cUserId, u32\u003e,\n    gmst_map: HashMap\u003ci32, HashOut\u003cF\u003e\u003e,\n}\n\nimpl PoRMemoryDB {\n    pub fn new() -\u003e Self {\n        Self { user_map: HashMap::new(), gmst_map: HashMap::new() }\n    }\n}\n\nimpl PoRDB for RwLock\u003cPoRMemoryDB\u003e {\n    fn add_batch_users(\u0026mut self, batches: Vec\u003c(UserId, u32)\u003e) {\n        for (id, idx) in batches {\n            self.write().unwrap().user_map.insert(id, idx);\n        }\n    }\n\n    fn get_user_index(\u0026self, user_id: UserId) -\u003e Option\u003cu32\u003e {\n        self.read().unwrap().user_map.get(\u0026user_id).map(|x| *x)\n    }\n\n    fn add_batch_gmst_nodes(\u0026mut self, batches: Vec\u003c(i32, HashOut\u003cF\u003e)\u003e) {\n        for (id, hash) in batches {\n            self.write().unwrap().gmst_map.insert(id, hash);\n        }\n    }\n\n    fn get_gmst_node_hash(\u0026self, node_idx: i32) -\u003e Option\u003cHashOut\u003cF\u003e\u003e {\n        self.read().unwrap().gmst_map.get(\u0026node_idx).map(|x| *x)\n    }\n}\n\n/// PoRGMSTMemoryDB delegates the query on gmst node to the direct access of global GMST. For user_db, the query is delegated to PoRMemoryDB.\n/// This is to save memory fingerprint.\npub struct PoRGMSTMemoryDB {\n    user_db: RwLock\u003cPoRMemoryDB\u003e,\n}\n///\nimpl PoRGMSTMemoryDB {\n    pub fn new() -\u003e Self {\n        Self { user_db: RwLock::new(PoRMemoryDB::new()) }\n    }\n}\n\nimpl PoRDB for PoRGMSTMemoryDB {\n    fn add_batch_users(\u0026mut self, batches: Vec\u003c(UserId, u32)\u003e) {\n        self.user_db.add_batch_users(batches);\n    }\n\n    fn get_user_index(\u0026self, user_id: UserId) -\u003e Option\u003cu32\u003e {\n        self.user_db.get_user_index(user_id)\n    }\n\n    #[inline(always)]\n    fn add_batch_gmst_nodes(\u0026mut self, _batches: Vec\u003c(i32, HashOut\u003cF\u003e)\u003e) {\n        // do nothing as we assume GMST is already built.\n        return;\n    }\n\n    fn get_gmst_node_hash(\u0026self, node_idx: i32) -\u003e Option\u003cHashOut\u003cF\u003e\u003e {\n        GLOBAL_MST.get().unwrap().read().unwrap().inner.get(node_idx as usize).map(|x| *x)\n    }\n}\n\n#[cfg(test)]\nmod test {\n    use plonky2::{field::types::Sample, hash::hash_types::HashOut};\n    use tempdir::TempDir;\n\n    use crate::{\n        database::{PoRDB, PoRLevelDB, PoRLevelDBOption, PoRMemoryDB, UserId},\n        types::F,\n    };\n    use std::sync::RwLock;\n\n    fn test_database(mut db: Box\u003cdyn PoRDB\u003e) {\n        let batches_user = (0..4)\n            .into_iter()\n            .map(|i| {\n                let id = UserId::rand();\n                let idx = i;\n                (id, idx)\n            })\n            .collect::\u003cVec\u003c(UserId, u32)\u003e\u003e();\n        db.add_batch_users(batches_user.clone());\n        assert_eq!(db.get_user_index(batches_user[0].0), Some(0));\n        assert_eq!(db.get_user_index(batches_user[3].0), Some(3));\n\n        let batches_hash = (0..4)\n            .into_iter()\n            .map(|i| (i, HashOut::\u003cF\u003e::from_vec(vec![F::rand(), F::rand(), F::rand(), F::rand()])))\n            .collect::\u003cVec\u003c(i32, HashOut\u003cF\u003e)\u003e\u003e();\n        db.add_batch_gmst_nodes(batches_hash.clone());\n\n        assert_eq!(db.get_gmst_node_hash(0), Some(batches_hash[0].1));\n        assert_eq!(db.get_gmst_node_hash(1), Some(batches_hash[1].1));\n        assert_eq!(db.get_gmst_node_hash(2), Some(batches_hash[2].1));\n        assert_eq!(db.get_gmst_node_hash(3), Some(batches_hash[3].1));\n    }\n\n    #[test]\n    fn test_leveldb() {\n        let tempdir_user = TempDir::new(\"example_user\").unwrap();\n        let tempdir_gmst = TempDir::new(\"example_gmst\").unwrap();\n        let db = PoRLevelDB::new(PoRLevelDBOption {\n            user_map_dir: tempdir_user.path().to_string_lossy().into_owned(),\n            gmst_dir: tempdir_gmst.path().to_string_lossy().into_owned(),\n        });\n        test_database(Box::new(db));\n    }\n\n    #[test]\n    fn test_memorydb() {\n        let db = PoRMemoryDB::new();\n        test_database(Box::new(RwLock::new(db)));\n    }\n}\n","traces":[{"line":14,"address":[8791968,8792157],"length":1,"stats":{"Line":1}},{"line":15,"address":[11359341],"length":1,"stats":{"Line":1}},{"line":16,"address":[11359354],"length":1,"stats":{"Line":1}},{"line":17,"address":[11359368],"length":1,"stats":{"Line":1}},{"line":18,"address":[11359425],"length":1,"stats":{"Line":1}},{"line":21,"address":[11359552],"length":1,"stats":{"Line":0}},{"line":22,"address":[11359569],"length":1,"stats":{"Line":0}},{"line":25,"address":[11360879,11363869,11359600],"length":1,"stats":{"Line":0}},{"line":26,"address":[8792250,8792338],"length":1,"stats":{"Line":0}},{"line":27,"address":[11363620,11363446,11363034,11362452,11362847,11363146,11363382],"length":1,"stats":{"Line":0}},{"line":28,"address":[11363218],"length":1,"stats":{"Line":0}},{"line":31,"address":[8792540,8792352],"length":1,"stats":{"Line":0}},{"line":33,"address":[8792657,8792563],"length":1,"stats":{"Line":0}},{"line":34,"address":[8793495,8794240,8794517,8794752,8793911,8794110,8794581],"length":1,"stats":{"Line":0}},{"line":35,"address":[11361715],"length":1,"stats":{"Line":0}},{"line":38,"address":[11360067],"length":1,"stats":{"Line":0}},{"line":39,"address":[11360087,11360499],"length":1,"stats":{"Line":0}},{"line":41,"address":[11360660],"length":1,"stats":{"Line":0}},{"line":46,"address":[11363904],"length":1,"stats":{"Line":0}},{"line":47,"address":[11364201,11363940],"length":1,"stats":{"Line":0}},{"line":48,"address":[11363950],"length":1,"stats":{"Line":0}},{"line":52,"address":[11364118],"length":1,"stats":{"Line":0}},{"line":55,"address":[11364439,11364240,11364303,11364400],"length":1,"stats":{"Line":2}},{"line":56,"address":[],"length":0,"stats":{"Line":4}},{"line":57,"address":[8796942,8797056],"length":1,"stats":{"Line":2}},{"line":79,"address":[11364528,11365167,11365198],"length":1,"stats":{"Line":1}},{"line":81,"address":[11364558,11364634,11364689],"length":1,"stats":{"Line":3}},{"line":82,"address":[11364892,11364762,11364837],"length":1,"stats":{"Line":3}},{"line":88,"address":[11365216],"length":1,"stats":{"Line":1}},{"line":89,"address":[11365229],"length":1,"stats":{"Line":1}},{"line":91,"address":[8797840,8797859],"length":1,"stats":{"Line":2}},{"line":93,"address":[11365276],"length":1,"stats":{"Line":1}},{"line":96,"address":[11365472],"length":1,"stats":{"Line":1}},{"line":97,"address":[11365487,11365568,11365797],"length":1,"stats":{"Line":2}},{"line":98,"address":[11365577],"length":1,"stats":{"Line":1}},{"line":99,"address":[11365585,11365671],"length":1,"stats":{"Line":2}},{"line":100,"address":[11365746],"length":1,"stats":{"Line":1}},{"line":107,"address":[11365824],"length":1,"stats":{"Line":1}},{"line":108,"address":[8798349],"length":1,"stats":{"Line":1}},{"line":110,"address":[11365904,11365923],"length":1,"stats":{"Line":2}},{"line":111,"address":[8798481],"length":1,"stats":{"Line":1}},{"line":115,"address":[11365884],"length":1,"stats":{"Line":1}},{"line":118,"address":[11366048],"length":1,"stats":{"Line":1}},{"line":119,"address":[11366112,11366239,11366070],"length":1,"stats":{"Line":2}},{"line":120,"address":[11366207,11366139],"length":1,"stats":{"Line":2}},{"line":133,"address":[8798752,8798879],"length":1,"stats":{"Line":1}},{"line":134,"address":[11366289],"length":1,"stats":{"Line":1}},{"line":139,"address":[11366432,11367073],"length":1,"stats":{"Line":1}},{"line":140,"address":[11366585,11366619,11366452],"length":1,"stats":{"Line":3}},{"line":141,"address":[11366666,11366906],"length":1,"stats":{"Line":2}},{"line":145,"address":[10945472,10945780],"length":1,"stats":{"Line":1}},{"line":146,"address":[11367369,11367127,11367472,11367296,11367477],"length":1,"stats":{"Line":5}},{"line":149,"address":[11367488,11368137],"length":1,"stats":{"Line":1}},{"line":150,"address":[11367508,11367673,11367641],"length":1,"stats":{"Line":3}},{"line":151,"address":[11367720,11367960],"length":1,"stats":{"Line":2}},{"line":155,"address":[11368160,11368503],"length":1,"stats":{"Line":1}},{"line":156,"address":[11368433,11368552,11368544,11368186,11368365],"length":1,"stats":{"Line":5}},{"line":167,"address":[11368592],"length":1,"stats":{"Line":0}},{"line":168,"address":[11368609],"length":1,"stats":{"Line":0}},{"line":173,"address":[11368688],"length":1,"stats":{"Line":0}},{"line":174,"address":[11368693],"length":1,"stats":{"Line":0}},{"line":177,"address":[8799088],"length":1,"stats":{"Line":0}},{"line":178,"address":[11368713],"length":1,"stats":{"Line":0}},{"line":182,"address":[],"length":0,"stats":{"Line":0}},{"line":184,"address":[],"length":0,"stats":{"Line":0}},{"line":187,"address":[11369215,11368752],"length":1,"stats":{"Line":0}},{"line":188,"address":[11368856,11369118,11369248,11369256,11368782,11369044],"length":1,"stats":{"Line":0}}],"covered":40,"coverable":67},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","e2e.rs"],"content":"use plonky2::plonk::{circuit_data::VerifierOnlyCircuitData, proof::ProofWithPublicInputs};\n\nuse indicatif::ProgressBar;\nuse rayon::prelude::*;\n\nuse crate::{\n    account::Account,\n    circuit_registry::registry::CircuitRegistry,\n    merkle_sum_prover::prover::MerkleSumTreeProver,\n    recursive_prover::prover::RecursiveProver,\n    types::{C, D, F},\n};\n\npub fn batch_prove_accounts\u003cconst RECURSION_BRANCHOUT_NUM: usize\u003e(\n    circuit_registry: \u0026CircuitRegistry\u003cRECURSION_BRANCHOUT_NUM\u003e,\n    account_batches: Vec\u003cAccount\u003e,\n    parallism: usize,\n    batch_size: usize,\n) -\u003e Vec\u003cProofWithPublicInputs\u003cF, C, D\u003e\u003e {\n    let mut batch_proofs: Vec\u003cProofWithPublicInputs\u003cF, C, D\u003e\u003e = Vec::new();\n    let (batch_circuit, account_targets) = circuit_registry.get_batch_circuit();\n\n    let _ = account_batches\n        .chunks(parallism * batch_size)\n        .map(|chunk| {\n            let proofs: Vec\u003cProofWithPublicInputs\u003cF, C, D\u003e\u003e = chunk\n                .par_chunks(batch_size)\n                .map(|accounts| {\n                    let prover = MerkleSumTreeProver { accounts: accounts.to_owned() };\n                    let proof = prover.get_proof_with_circuit_data(account_targets, batch_circuit);\n                    proof\n                })\n                .collect();\n            batch_proofs.extend(proofs.into_iter());\n        })\n        .collect::\u003cVec\u003c_\u003e\u003e();\n\n    batch_proofs\n}\n\npub fn prove_subproofs\u003cconst RECURSION_BRANCHOUT_NUM: usize\u003e(\n    subproofs: Vec\u003cProofWithPublicInputs\u003cF, C, D\u003e\u003e,\n    last_level_circuit_vd: VerifierOnlyCircuitData\u003cC, D\u003e,\n    circuit_registry: \u0026CircuitRegistry\u003cRECURSION_BRANCHOUT_NUM\u003e,\n    parallism: usize,\n    level: usize,\n) -\u003e Vec\u003cProofWithPublicInputs\u003cF, C, D\u003e\u003e {\n    let bar = ProgressBar::new(subproofs.len() as u64);\n    assert_eq!(subproofs.len() % RECURSION_BRANCHOUT_NUM, 0);\n    let last_level_vd_digest = last_level_circuit_vd.circuit_digest;\n\n    let (recursive_circuit, recursive_targets) =\n        circuit_registry.get_recursive_circuit(\u0026last_level_vd_digest).expect(\n            format!(\n                \"No recursive circuit found for inner circuit with vd {:?}\",\n                last_level_vd_digest\n            )\n            .as_str(),\n        );\n\n    let expected_this_level_proof_num = subproofs.len() / RECURSION_BRANCHOUT_NUM;\n    let mut this_level_proofs = vec![];\n\n    let _ = subproofs\n        .chunks(parallism * RECURSION_BRANCHOUT_NUM)\n        .map(|chunk| {\n            let proofs: Vec\u003cProofWithPublicInputs\u003cF, C, D\u003e\u003e = chunk\n                .par_chunks(RECURSION_BRANCHOUT_NUM)\n                .map(|subproofs| {\n                    let recursive_prover = RecursiveProver {\n                        sub_proofs: subproofs\n                            .to_owned()\n                            .try_into()\n                            .expect(\"subproofs length not equal to RECURSION_BRANCHOUT_NUM\"),\n                        sub_circuit_vd: last_level_circuit_vd.clone(),\n                    };\n                    let proof = recursive_prover\n                        .get_proof_with_circuit_data(recursive_targets.clone(), \u0026recursive_circuit);\n                    proof\n                })\n                .collect();\n            this_level_proofs.extend(proofs.into_iter());\n            bar.inc((this_level_proofs.len() * RECURSION_BRANCHOUT_NUM) as u64);\n            tracing::debug!(\n                \"finish {}/{} proofs in level {}/{}\",\n                this_level_proofs.len(),\n                expected_this_level_proof_num,\n                level,\n                circuit_registry.get_recursive_levels()\n            );\n        })\n        .collect::\u003cVec\u003c_\u003e\u003e();\n    bar.finish();\n\n    this_level_proofs\n}\n\npub fn recursive_prove_subproofs\u003cconst RECURSION_BRANCHOUT_NUM: usize\u003e(\n    subproofs: Vec\u003cProofWithPublicInputs\u003cF, C, D\u003e\u003e,\n    circuit_registry: \u0026CircuitRegistry\u003cRECURSION_BRANCHOUT_NUM\u003e,\n    parallism: usize,\n) -\u003e ProofWithPublicInputs\u003cF, C, D\u003e {\n    let (batch_circuit, _) = circuit_registry.get_batch_circuit();\n    let mut last_level_circuit_vd = batch_circuit.verifier_only.clone();\n    let mut last_level_proofs = subproofs;\n    let recursive_levels = circuit_registry.get_recursive_levels();\n    tracing::info!(\"total recursive levels: {:?}\", recursive_levels);\n\n    for level in 1..=recursive_levels {\n        let start = std::time::Instant::now();\n\n        let last_level_vd_digest = last_level_circuit_vd.circuit_digest;\n        let last_level_empty_proof = circuit_registry\n            .get_empty_proof(\u0026last_level_vd_digest)\n            .expect(\n                format!(\"fail to find empty proof for circuit vd {:?}\", last_level_vd_digest)\n                    .as_str(),\n            )\n            .clone();\n\n        let subproof_len = last_level_proofs.len();\n\n        if subproof_len % RECURSION_BRANCHOUT_NUM != 0 {\n            let pad_num = RECURSION_BRANCHOUT_NUM - subproof_len % RECURSION_BRANCHOUT_NUM;\n            tracing::info!(\"At level {}, {} subproofs are not a multiple of RECURSION_BRANCHOUT_NUM {}, hence padding {} empty proofs. \", level, subproof_len, RECURSION_BRANCHOUT_NUM, pad_num);\n\n            last_level_proofs.resize(subproof_len + pad_num, last_level_empty_proof);\n        }\n\n        last_level_proofs = prove_subproofs(\n            last_level_proofs,\n            last_level_circuit_vd.clone(),\n            circuit_registry,\n            parallism,\n            level,\n        );\n\n        let recursive_circuit = circuit_registry\n            .get_recursive_circuit(\u0026last_level_circuit_vd.circuit_digest)\n            .expect(\n                format!(\n                    \"No recursive circuit found for inner circuit with vd {:?}\",\n                    last_level_circuit_vd.circuit_digest\n                )\n                .as_str(),\n            )\n            .0;\n\n        last_level_circuit_vd = recursive_circuit.verifier_only.clone();\n\n        tracing::info!(\n            \"finish recursive level {} with {} proofs in : {:?}\",\n            level,\n            last_level_proofs.len(),\n            start.elapsed()\n        );\n    }\n\n    if last_level_proofs.len() != 1 {\n        panic!(\"The last level proofs should be of length 1, but got {}\", last_level_proofs.len());\n    }\n    let root_proof = last_level_proofs.pop().unwrap();\n    circuit_registry\n        .get_root_circuit()\n        .verify(root_proof.clone())\n        .expect(\"fail to verify root proof\");\n    root_proof\n}\n","traces":[{"line":14,"address":[9294736,9295251],"length":1,"stats":{"Line":0}},{"line":20,"address":[],"length":0,"stats":{"Line":0}},{"line":21,"address":[9294855,9294901],"length":1,"stats":{"Line":0}},{"line":23,"address":[],"length":0,"stats":{"Line":0}},{"line":24,"address":[],"length":0,"stats":{"Line":0}},{"line":25,"address":[],"length":0,"stats":{"Line":0}},{"line":26,"address":[],"length":0,"stats":{"Line":0}},{"line":27,"address":[9295316],"length":1,"stats":{"Line":0}},{"line":28,"address":[],"length":0,"stats":{"Line":0}},{"line":29,"address":[],"length":0,"stats":{"Line":0}},{"line":30,"address":[],"length":0,"stats":{"Line":0}},{"line":31,"address":[],"length":0,"stats":{"Line":0}},{"line":33,"address":[],"length":0,"stats":{"Line":0}},{"line":34,"address":[],"length":0,"stats":{"Line":0}},{"line":38,"address":[9295206],"length":1,"stats":{"Line":0}},{"line":41,"address":[9290832,9292190],"length":1,"stats":{"Line":0}},{"line":48,"address":[],"length":0,"stats":{"Line":0}},{"line":49,"address":[9291057,9291004],"length":1,"stats":{"Line":0}},{"line":50,"address":[9291203],"length":1,"stats":{"Line":0}},{"line":52,"address":[9291235,9291574],"length":1,"stats":{"Line":0}},{"line":53,"address":[],"length":0,"stats":{"Line":0}},{"line":54,"address":[],"length":0,"stats":{"Line":0}},{"line":55,"address":[],"length":0,"stats":{"Line":0}},{"line":56,"address":[],"length":0,"stats":{"Line":0}},{"line":58,"address":[],"length":0,"stats":{"Line":0}},{"line":61,"address":[9291659],"length":1,"stats":{"Line":0}},{"line":62,"address":[],"length":0,"stats":{"Line":0}},{"line":64,"address":[],"length":0,"stats":{"Line":0}},{"line":65,"address":[],"length":0,"stats":{"Line":0}},{"line":66,"address":[],"length":0,"stats":{"Line":0}},{"line":67,"address":[],"length":0,"stats":{"Line":0}},{"line":68,"address":[],"length":0,"stats":{"Line":0}},{"line":69,"address":[],"length":0,"stats":{"Line":0}},{"line":70,"address":[],"length":0,"stats":{"Line":0}},{"line":71,"address":[],"length":0,"stats":{"Line":0}},{"line":72,"address":[],"length":0,"stats":{"Line":0}},{"line":73,"address":[],"length":0,"stats":{"Line":0}},{"line":74,"address":[],"length":0,"stats":{"Line":0}},{"line":75,"address":[],"length":0,"stats":{"Line":0}},{"line":77,"address":[9294628],"length":1,"stats":{"Line":0}},{"line":78,"address":[],"length":0,"stats":{"Line":0}},{"line":79,"address":[],"length":0,"stats":{"Line":0}},{"line":81,"address":[],"length":0,"stats":{"Line":0}},{"line":82,"address":[],"length":0,"stats":{"Line":0}},{"line":83,"address":[9292421,9292600],"length":1,"stats":{"Line":0}},{"line":84,"address":[],"length":0,"stats":{"Line":0}},{"line":85,"address":[],"length":0,"stats":{"Line":0}},{"line":86,"address":[],"length":0,"stats":{"Line":0}},{"line":87,"address":[],"length":0,"stats":{"Line":0}},{"line":88,"address":[],"length":0,"stats":{"Line":0}},{"line":89,"address":[],"length":0,"stats":{"Line":0}},{"line":93,"address":[9292039],"length":1,"stats":{"Line":0}},{"line":95,"address":[],"length":0,"stats":{"Line":0}},{"line":103,"address":[],"length":0,"stats":{"Line":0}},{"line":104,"address":[],"length":0,"stats":{"Line":0}},{"line":105,"address":[],"length":0,"stats":{"Line":0}},{"line":106,"address":[],"length":0,"stats":{"Line":0}},{"line":107,"address":[],"length":0,"stats":{"Line":0}},{"line":109,"address":[],"length":0,"stats":{"Line":0}},{"line":110,"address":[],"length":0,"stats":{"Line":0}},{"line":112,"address":[],"length":0,"stats":{"Line":0}},{"line":113,"address":[],"length":0,"stats":{"Line":0}},{"line":114,"address":[],"length":0,"stats":{"Line":0}},{"line":116,"address":[],"length":0,"stats":{"Line":0}},{"line":117,"address":[],"length":0,"stats":{"Line":0}},{"line":121,"address":[],"length":0,"stats":{"Line":0}},{"line":123,"address":[],"length":0,"stats":{"Line":0}},{"line":124,"address":[],"length":0,"stats":{"Line":0}},{"line":125,"address":[],"length":0,"stats":{"Line":0}},{"line":127,"address":[],"length":0,"stats":{"Line":0}},{"line":130,"address":[],"length":0,"stats":{"Line":0}},{"line":131,"address":[],"length":0,"stats":{"Line":0}},{"line":132,"address":[],"length":0,"stats":{"Line":0}},{"line":133,"address":[],"length":0,"stats":{"Line":0}},{"line":134,"address":[],"length":0,"stats":{"Line":0}},{"line":135,"address":[],"length":0,"stats":{"Line":0}},{"line":138,"address":[],"length":0,"stats":{"Line":0}},{"line":139,"address":[],"length":0,"stats":{"Line":0}},{"line":140,"address":[],"length":0,"stats":{"Line":0}},{"line":141,"address":[],"length":0,"stats":{"Line":0}},{"line":142,"address":[],"length":0,"stats":{"Line":0}},{"line":143,"address":[],"length":0,"stats":{"Line":0}},{"line":145,"address":[],"length":0,"stats":{"Line":0}},{"line":147,"address":[],"length":0,"stats":{"Line":0}},{"line":149,"address":[],"length":0,"stats":{"Line":0}},{"line":151,"address":[],"length":0,"stats":{"Line":0}},{"line":152,"address":[],"length":0,"stats":{"Line":0}},{"line":153,"address":[],"length":0,"stats":{"Line":0}},{"line":154,"address":[],"length":0,"stats":{"Line":0}},{"line":155,"address":[],"length":0,"stats":{"Line":0}},{"line":159,"address":[],"length":0,"stats":{"Line":0}},{"line":160,"address":[],"length":0,"stats":{"Line":0}},{"line":162,"address":[],"length":0,"stats":{"Line":0}},{"line":163,"address":[],"length":0,"stats":{"Line":0}},{"line":165,"address":[],"length":0,"stats":{"Line":0}},{"line":167,"address":[],"length":0,"stats":{"Line":0}}],"covered":0,"coverable":96},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","error.rs"],"content":"use config::ConfigError;\nuse thiserror::Error;\n\n#[derive(Debug, Error)]\npub enum PoRError {\n    #[error(\"Proof is not valid\")]\n    InvalidProof,\n\n    #[error(\"Merkle proof is not valid for accountID {0}\")]\n    InvalidMerkleProof(String),\n\n    #[error(\"config error: {0}\")]\n    ConfigError(#[from] ConfigError),\n\n    #[error(\"IO error occurred: {0}\")]\n    Io(#[from] std::io::Error),\n\n    #[error(\"Unknown error\")]\n    Unknown,\n\n    #[error(\"Invalid parameter: {0}\")]\n    InvalidParameter(String),\n\n    #[error(\"The verification circuit digest does not match the prover. \")]\n    CircuitDigestMismatch,\n\n    #[error(\"User is not valid\")]\n    InvalidUser,\n}\n","traces":[],"covered":0,"coverable":0},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","global.rs"],"content":"use crate::{\n    circuit_utils::recursive_levels,\n    database::PoRDB,\n    merkle_sum_prover::utils::hash_2_subhashes,\n    recursive_prover::prover::hash_n_subhashes,\n    types::{D, F},\n    util::{get_node_level, pad_to_multiple_of},\n};\nuse once_cell::sync::OnceCell;\nuse plonky2::{hash::hash_types::HashOut, util::log2_strict};\nuse std::{ops::Div, sync::RwLock};\nuse tracing::debug;\n\n#[derive(Debug, Clone, Copy)]\npub struct GlobalConfig {\n    pub num_of_tokens: usize,\n    pub num_of_batches: usize,\n    pub batch_size: usize, // num of accounts witin one batch\n    pub recursion_branchout_num: usize,\n}\n\npub static GLOBAL_MST: OnceCell\u003cRwLock\u003cGlobalMst\u003e\u003e = OnceCell::new();\n\npub struct GlobalMst {\n    pub inner: Vec\u003cHashOut\u003cF\u003e\u003e,\n    top_recursion_level: usize,\n    pub cfg: GlobalConfig,\n}\n\nimpl GlobalMst {\n    pub fn new(cfg: GlobalConfig) -\u003e Self {\n        let top_level = recursive_levels(cfg.num_of_batches, cfg.recursion_branchout_num);\n\n        let mst_vec = vec![HashOut::default(); 0]; // will resize later\n        let mut mst = Self { inner: mst_vec, top_recursion_level: top_level, cfg: cfg };\n        // the number of hash is one smaller to the index of the root node of the last recursion level.\n        let root_node_idx = GlobalMst::get_recursive_global_index(\u0026cfg, top_level, 0);\n        let tree_size = root_node_idx + 1;\n        mst.inner.resize(tree_size, HashOut::default());\n        mst\n    }\n\n    pub fn get_tree_length(\u0026self) -\u003e usize {\n        self.inner.len()\n    }\n\n    pub fn get_num_of_leaves(cfg: \u0026GlobalConfig) -\u003e usize {\n        cfg.batch_size * cfg.num_of_batches\n    }\n\n    pub fn get_nodes(\u0026self, range: std::ops::Range\u003cusize\u003e) -\u003e \u0026[HashOut\u003cF\u003e] {\n        \u0026self.inner[range]\n    }\n\n    pub fn get_root(\u0026self) -\u003e Option\u003c\u0026HashOut\u003cF\u003e\u003e {\n        self.inner.last()\n    }\n\n    /// convert a mst node inner index to global index in gmst.\n    /// For a mst, the inner index is level-by-level, e.g.,\n    ///       14\n    ///   12      13\n    ///  8-9,   10-11\n    /// 0 - 3,  4 - 7\n    pub fn get_batch_tree_global_index(\n        cfg: \u0026GlobalConfig,\n        batch_idx: usize,\n        inner_tree_idx: usize,\n    ) -\u003e usize {\n        let batch_size = cfg.batch_size;\n        let tree_depth = log2_strict(batch_size);\n        let batch_tree_level = get_node_level(batch_size, inner_tree_idx);\n\n        let level_from_bottom = tree_depth - batch_tree_level;\n\n        let numeritor = 2 * batch_size * cfg.num_of_batches;\n        let global_tree_vertical_offset = numeritor - numeritor.div(1 \u003c\u003c level_from_bottom); // the gmst idx of the first node at {level_from_bottom} level\n\n        let level_node_counts = batch_size.div(1 \u003c\u003c level_from_bottom);\n        let global_inter_tree_horizontal_offset = level_node_counts * (batch_idx); // the number of preceding nodes at {level_from_bottom} level in the preceding mst.\n\n        let intra_tree_horizontal_offset =\n            inner_tree_idx - (2 * batch_size - 2 * batch_size.div(1 \u003c\u003c level_from_bottom));\n        // the number of preceding nodes at {level_from_bottom} level in the current mst.\n\n        let index = global_tree_vertical_offset\n            + global_inter_tree_horizontal_offset\n            + intra_tree_horizontal_offset;\n        index\n    }\n\n    // mst root node at level 0,\n    pub fn get_recursive_global_index(\n        cfg: \u0026GlobalConfig,\n        recursive_level: usize,\n        inner_level_idx: usize,\n    ) -\u003e usize {\n        let mst_node_num = 2 * cfg.batch_size - 1;\n        let batch_num = cfg.num_of_batches;\n        let branchout_num = cfg.recursion_branchout_num;\n        if recursive_level == 0 {\n            // level of merkle sum tree root\n            if inner_level_idx \u003c cfg.num_of_batches {\n                // the global index of the root of the batch tree\n                let mst_root_idx = mst_node_num - 1;\n                return GlobalMst::get_batch_tree_global_index(cfg, inner_level_idx, mst_root_idx);\n            } else {\n                return batch_num * mst_node_num + (inner_level_idx - cfg.num_of_batches);\n            }\n        }\n\n        // pad num_of_batches to be multiple of recursion_branchout_num.\n        let pad_num = if batch_num % branchout_num == 0 {\n            0\n        } else {\n            branchout_num - batch_num % branchout_num\n        };\n\n        let mut last_level_node_num = batch_num + pad_num;\n        assert_eq!(0, last_level_node_num % branchout_num);\n\n        let mut recursive_offset = batch_num * mst_node_num + pad_num;\n\n        let mut level = recursive_level;\n        while level \u003e 1 {\n            let mut this_level_node_num = last_level_node_num / cfg.recursion_branchout_num;\n            this_level_node_num =\n                pad_to_multiple_of(this_level_node_num, cfg.recursion_branchout_num);\n\n            recursive_offset += this_level_node_num;\n\n            last_level_node_num = this_level_node_num;\n            level -= 1;\n        }\n\n        let global_recursive_index = recursive_offset + inner_level_idx;\n        global_recursive_index\n    }\n\n    /// `batch_idx`: index indicating the batch index\n    /// `i`: the sub batch tree index; e.g the batch tree is of size 1\u003c\u003c10; i \\in [0, 2*batch_size)\n    pub fn set_batch_hash(\u0026mut self, batch_idx: usize, i: usize, hash: HashOut\u003cF\u003e) {\n        let global_mst_idx = GlobalMst::get_batch_tree_global_index(\u0026self.cfg, batch_idx, i);\n        self.inner[global_mst_idx] = hash;\n    }\n\n    pub fn get_batch_root_hash(\u0026self, batch_idx: usize) -\u003e HashOut\u003cF\u003e {\n        debug!(\"get batch root hash, batch_idx: {:?}\", batch_idx);\n        assert!(batch_idx \u003c self.cfg.num_of_batches);\n        let root_idx = GlobalMst::get_batch_tree_global_index(\n            \u0026self.cfg,\n            batch_idx,\n            2 * self.cfg.batch_size - 2,\n        );\n        self.inner[root_idx]\n    }\n\n    /// `recursive_level` count from bottom to top; recursive_level = 1 means the bottom layer; increase whilve moving to the top.\n    pub fn set_recursive_hash(\u0026mut self, recursive_level: usize, index: usize, hash: HashOut\u003cF\u003e) {\n        let idx = GlobalMst::get_recursive_global_index(\u0026self.cfg, recursive_level, index);\n        tracing::debug!(\n            \"set_recursive_hash, recursive_level: {:?}, index: {:?}, hash: {:?}, idx: {:?}\",\n            recursive_level,\n            index,\n            hash,\n            idx,\n        );\n        self.inner[idx] = hash;\n    }\n\n    pub fn is_integral(\u0026self) -\u003e bool {\n        // we check all nodes are examined to ensure global_index-related functions are correct.\n        let mut visited_global_idx = vec![false; self.inner.len()];\n        let batch_num = self.cfg.num_of_batches;\n        for tree_idx in 0..self.cfg.num_of_batches {\n            let leaf_size = self.cfg.batch_size;\n            let mst_size = 2 * leaf_size - 1;\n            for inner_tree_idx in leaf_size..mst_size {\n                let inner_left_child_idx = 2 * (inner_tree_idx - leaf_size);\n                let inner_right_child_idx = 2 * (inner_tree_idx - leaf_size) + 1;\n\n                let global_parent_idx =\n                    GlobalMst::get_batch_tree_global_index(\u0026self.cfg, tree_idx, inner_tree_idx);\n                let global_left_child_idx = GlobalMst::get_batch_tree_global_index(\n                    \u0026self.cfg,\n                    tree_idx,\n                    inner_left_child_idx,\n                );\n                let global_right_child_idx = GlobalMst::get_batch_tree_global_index(\n                    \u0026self.cfg,\n                    tree_idx,\n                    inner_right_child_idx,\n                );\n\n                visited_global_idx[global_left_child_idx] = true;\n                visited_global_idx[global_right_child_idx] = true;\n\n                let expected_parent_hash = hash_2_subhashes::\u003cF, D\u003e(\n                    \u0026self.inner[global_left_child_idx],\n                    \u0026self.inner[global_right_child_idx],\n                );\n                if expected_parent_hash != self.inner[global_parent_idx] {\n                    tracing::error!(\"Inconsistent hash at mst tree {}, global index (parent: {:?}, left child: {:?}, right child: {:?}), inner index (parent: {:?}, left child: {:?}, right child: {:?}), expected parent hash: {:?}, actual parent hash: {:?}\", tree_idx, global_parent_idx, global_left_child_idx, global_right_child_idx,  inner_tree_idx, inner_left_child_idx, inner_right_child_idx, expected_parent_hash, self.inner[global_parent_idx]);\n                    return false;\n                }\n            }\n        }\n        let branchout_num = self.cfg.recursion_branchout_num;\n        let mut last_level_node_count = pad_to_multiple_of(batch_num, branchout_num);\n        for level in 1..=self.top_recursion_level {\n            let this_level_node_count = last_level_node_count / branchout_num;\n            for inner_idx in 0..this_level_node_count {\n                let inner_child_indexes = (0..branchout_num)\n                    .map(|i| inner_idx * branchout_num + i)\n                    .collect::\u003cVec\u003cusize\u003e\u003e();\n                let global_idx = GlobalMst::get_recursive_global_index(\u0026self.cfg, level, inner_idx);\n                let global_child_indexes = inner_child_indexes\n                    .iter()\n                    .map(|\u0026i| {\n                        let child_global_idx =\n                            GlobalMst::get_recursive_global_index(\u0026self.cfg, level - 1, i);\n                        visited_global_idx[child_global_idx] = true;\n                        child_global_idx\n                    })\n                    .collect::\u003cVec\u003cusize\u003e\u003e();\n\n                let children_hashes = global_child_indexes\n                    .iter()\n                    .map(|\u0026i| self.inner[i])\n                    .collect::\u003cVec\u003cHashOut\u003cF\u003e\u003e\u003e();\n\n                let expected_parent_hash = hash_n_subhashes::\u003cF, D\u003e(\u0026children_hashes);\n\n                if expected_parent_hash != self.inner[global_idx] {\n                    tracing::error!(\"Inconsistent hash at recursive level {}, Global index: {:?}, global child indexes: {:?}, inner index: {:?}, child indexes {:?}, expected parent hash: {:?}, actual parent hash: {:?}. \", level, global_idx, global_child_indexes, inner_idx, inner_child_indexes, expected_parent_hash, self.inner[global_idx]);\n                    return false;\n                }\n                last_level_node_count = pad_to_multiple_of(this_level_node_count, branchout_num);\n            }\n        }\n        let global_root_idx =\n            GlobalMst::get_recursive_global_index(\u0026self.cfg, self.top_recursion_level, 0);\n        visited_global_idx[global_root_idx] = true;\n\n        visited_global_idx.iter().all(|\u0026v| v)\n    }\n\n    pub fn persist(\u0026self, db: \u0026mut Box\u003cdyn PoRDB\u003e) {\n        let length = self.get_tree_length();\n        tracing::info!(\"start to persist gmst into db of size: {:?}\", length);\n        let chunk_size = 1 \u003c\u003c 12;\n        let mut i = 0;\n        while i \u003c length {\n            let end = if i + chunk_size \u003c= length { i + chunk_size } else { length };\n            let nodes = self.get_nodes(i..end);\n            let batches = (i..end)\n                .into_iter()\n                .enumerate()\n                .map(|(chunk_idx, j)| ((j).try_into().unwrap(), nodes[chunk_idx]))\n                .collect::\u003cVec\u003c(i32, HashOut\u003cF\u003e)\u003e\u003e();\n            db.add_batch_gmst_nodes(batches);\n            i += chunk_size;\n        }\n    }\n}\n\n#[cfg(test)]\nmod test {\n    use super::GlobalMst;\n    use crate::{\n        account::gen_accounts_with_random_data,\n        merkle_sum_tree::MerkleSumTree,\n        recursive_prover::prover::hash_n_subhashes,\n        types::{D, F},\n        util::pad_to_multiple_of,\n    };\n    use plonky2::hash::hash_types::HashOut;\n    use zk_por_tracing::{init_tracing, TraceConfig};\n\n    #[test]\n    fn test_index() {\n        let gmst = GlobalMst::new(super::GlobalConfig {\n            num_of_tokens: 22,\n            num_of_batches: 6,\n            batch_size: 8,\n            recursion_branchout_num: 4,\n        });\n        let total_len = gmst.get_tree_length();\n\n        /*\n        L2:                                 96\n        L1:         92            93                 94                95\n        L0:     84,    85,    86,     87,        88,      89,       90e,  91e\n                72-73, 74-75,  76-77,  78-79,    80-81,   82-83,\n                48-51, 52-55,  56-59,   60-63,   64-67,   68-71\n                0 - 7, 8 - 15, 16 - 23, 24 - 31, 32 - 39, 40 - 47\n        */\n        assert_eq!(total_len, 97);\n        assert_eq!(gmst.top_recursion_level, 2);\n\n        assert_eq!(GlobalMst::get_batch_tree_global_index(\u0026gmst.cfg, 0, 1), 1);\n        assert_eq!(GlobalMst::get_batch_tree_global_index(\u0026gmst.cfg, 0, 14), 84);\n        assert_eq!(GlobalMst::get_batch_tree_global_index(\u0026gmst.cfg, 1, 1), 9);\n        assert_eq!(GlobalMst::get_batch_tree_global_index(\u0026gmst.cfg, 1, 14), 85);\n        assert_eq!(GlobalMst::get_batch_tree_global_index(\u0026gmst.cfg, 5, 7), 47);\n        assert_eq!(GlobalMst::get_batch_tree_global_index(\u0026gmst.cfg, 5, 14), 89);\n\n        assert_eq!(GlobalMst::get_recursive_global_index(\u0026gmst.cfg, 0, 7), 91);\n        assert_eq!(GlobalMst::get_recursive_global_index(\u0026gmst.cfg, 0, 1), 85);\n        assert_eq!(GlobalMst::get_recursive_global_index(\u0026gmst.cfg, 1, 0), 92);\n        assert_eq!(GlobalMst::get_recursive_global_index(\u0026gmst.cfg, 1, 1), 93);\n        assert_eq!(GlobalMst::get_recursive_global_index(\u0026gmst.cfg, 1, 2), 94);\n        assert_eq!(GlobalMst::get_recursive_global_index(\u0026gmst.cfg, 1, 3), 95);\n        assert_eq!(GlobalMst::get_recursive_global_index(\u0026gmst.cfg, 2, 0), 96);\n    }\n\n    #[test]\n    fn test_integrity() {\n        let cfg = TraceConfig {\n            prefix: \"zkpor\".to_string(),\n            dir: \"logs\".to_string(),\n            level: tracing::Level::DEBUG,\n            console: true,\n            flame: false,\n        };\n\n        {\n            init_tracing(cfg)\n        };\n\n        let mut gmst = GlobalMst::new(super::GlobalConfig {\n            num_of_tokens: 22,\n            num_of_batches: 6,\n            batch_size: 8,\n            recursion_branchout_num: 4,\n        });\n\n        assert!(!gmst.is_integral());\n        let batch_num = gmst.cfg.num_of_batches;\n        let batch_size = gmst.cfg.batch_size;\n        let branchout_num = gmst.cfg.recursion_branchout_num;\n\n        for batch_idx in 0..batch_num {\n            let accounts = gen_accounts_with_random_data(batch_size, 1);\n            let mst = MerkleSumTree::new_tree_from_accounts(\u0026accounts);\n\n            for i in 0..batch_size * 2 - 1 {\n                gmst.set_batch_hash(batch_idx, i, mst.merkle_sum_tree[i].hash);\n            }\n        }\n\n        let mut last_level_node_num = pad_to_multiple_of(batch_num, branchout_num);\n        for level in 1..=gmst.top_recursion_level {\n            let this_level_node_count = last_level_node_num / branchout_num;\n            for inner_idx in 0..this_level_node_count {\n                let children_hashes = (0..branchout_num)\n                    .map(|i| {\n                        let child_global_idx = GlobalMst::get_recursive_global_index(\n                            \u0026gmst.cfg,\n                            level - 1,\n                            inner_idx * branchout_num + i,\n                        );\n                        gmst.inner[child_global_idx]\n                    })\n                    .collect::\u003cVec\u003cHashOut\u003cF\u003e\u003e\u003e();\n\n                let expected_parent_hash = hash_n_subhashes::\u003cF, D\u003e(\u0026children_hashes);\n                gmst.set_recursive_hash(level, inner_idx, expected_parent_hash);\n            }\n\n            last_level_node_num = pad_to_multiple_of(this_level_node_count, branchout_num);\n        }\n        assert!(gmst.is_integral());\n    }\n}\n","traces":[{"line":31,"address":[11369296,11369674],"length":1,"stats":{"Line":1}},{"line":32,"address":[8799670],"length":1,"stats":{"Line":1}},{"line":34,"address":[11369348],"length":1,"stats":{"Line":1}},{"line":35,"address":[11369410],"length":1,"stats":{"Line":1}},{"line":37,"address":[11369532,11369467],"length":1,"stats":{"Line":2}},{"line":38,"address":[8799914,8799872],"length":1,"stats":{"Line":1}},{"line":39,"address":[11369567,11369611],"length":1,"stats":{"Line":2}},{"line":40,"address":[11369643],"length":1,"stats":{"Line":1}},{"line":43,"address":[11369696],"length":1,"stats":{"Line":1}},{"line":44,"address":[11369701],"length":1,"stats":{"Line":1}},{"line":47,"address":[11369712],"length":1,"stats":{"Line":1}},{"line":48,"address":[11369721,11369749],"length":1,"stats":{"Line":1}},{"line":51,"address":[11369776],"length":1,"stats":{"Line":0}},{"line":52,"address":[11369794],"length":1,"stats":{"Line":0}},{"line":55,"address":[11369824],"length":1,"stats":{"Line":0}},{"line":56,"address":[11369829],"length":1,"stats":{"Line":0}},{"line":65,"address":[11369856],"length":1,"stats":{"Line":1}},{"line":70,"address":[8800238],"length":1,"stats":{"Line":1}},{"line":71,"address":[11369919],"length":1,"stats":{"Line":1}},{"line":72,"address":[11369948],"length":1,"stats":{"Line":1}},{"line":74,"address":[11369970,11370024],"length":1,"stats":{"Line":1}},{"line":76,"address":[8800385,8800443,8800339],"length":1,"stats":{"Line":2}},{"line":77,"address":[11370100,11370134,11370226],"length":1,"stats":{"Line":2}},{"line":79,"address":[11370304,11370252,11370218],"length":1,"stats":{"Line":2}},{"line":80,"address":[11370289,11370330,11370358],"length":1,"stats":{"Line":2}},{"line":82,"address":[11370379,11370599,11370338],"length":1,"stats":{"Line":2}},{"line":86,"address":[11370584,11370625,11370675],"length":1,"stats":{"Line":2}},{"line":93,"address":[8801040],"length":1,"stats":{"Line":1}},{"line":98,"address":[11370759,11370905],"length":1,"stats":{"Line":1}},{"line":99,"address":[11370863],"length":1,"stats":{"Line":1}},{"line":100,"address":[11370880],"length":1,"stats":{"Line":1}},{"line":101,"address":[11370897],"length":1,"stats":{"Line":1}},{"line":103,"address":[11370937],"length":1,"stats":{"Line":1}},{"line":105,"address":[11371191,11371215,11371001],"length":1,"stats":{"Line":2}},{"line":106,"address":[8801535],"length":1,"stats":{"Line":1}},{"line":108,"address":[11371044,11370978],"length":1,"stats":{"Line":2}},{"line":113,"address":[8801617,8801286,8801576,8801724],"length":1,"stats":{"Line":4}},{"line":114,"address":[11371270],"length":1,"stats":{"Line":1}},{"line":116,"address":[11371289,11371391,11371332],"length":1,"stats":{"Line":2}},{"line":119,"address":[11371302,11371417,11371446],"length":1,"stats":{"Line":2}},{"line":120,"address":[11371425,11371472],"length":1,"stats":{"Line":2}},{"line":122,"address":[11371631,11371716],"length":1,"stats":{"Line":1}},{"line":124,"address":[11371706],"length":1,"stats":{"Line":1}},{"line":125,"address":[11371732,11371714,11372043],"length":1,"stats":{"Line":3}},{"line":126,"address":[11371865,11371779,11371943],"length":1,"stats":{"Line":2}},{"line":127,"address":[8802241],"length":1,"stats":{"Line":1}},{"line":128,"address":[11371889],"length":1,"stats":{"Line":1}},{"line":130,"address":[11371964,11371915,11372015],"length":1,"stats":{"Line":2}},{"line":132,"address":[11371972],"length":1,"stats":{"Line":1}},{"line":133,"address":[11372048,11371988,11372035],"length":1,"stats":{"Line":2}},{"line":136,"address":[11371839,11371751,11371818],"length":1,"stats":{"Line":2}},{"line":137,"address":[8802161],"length":1,"stats":{"Line":1}},{"line":142,"address":[11372064],"length":1,"stats":{"Line":1}},{"line":143,"address":[11372093],"length":1,"stats":{"Line":1}},{"line":144,"address":[11372116],"length":1,"stats":{"Line":1}},{"line":147,"address":[8802512],"length":1,"stats":{"Line":0}},{"line":148,"address":[8803145,8803214,8803502,8802997,8803287,8803330,8802666],"length":1,"stats":{"Line":0}},{"line":149,"address":[8803782,8803245],"length":1,"stats":{"Line":0}},{"line":151,"address":[8803815],"length":1,"stats":{"Line":0}},{"line":153,"address":[8803827,8803989],"length":1,"stats":{"Line":0}},{"line":155,"address":[8803926],"length":1,"stats":{"Line":0}},{"line":159,"address":[8804016],"length":1,"stats":{"Line":1}},{"line":160,"address":[11373715],"length":1,"stats":{"Line":1}},{"line":161,"address":[8805362,8804194,8804855,8804898,8804742,8804525,8804673],"length":1,"stats":{"Line":7}},{"line":168,"address":[11374438],"length":1,"stats":{"Line":1}},{"line":171,"address":[11383333,11375392,11379812],"length":1,"stats":{"Line":1}},{"line":173,"address":[8805751],"length":1,"stats":{"Line":1}},{"line":174,"address":[8805800],"length":1,"stats":{"Line":1}},{"line":175,"address":[11375488,11375581,11375738],"length":1,"stats":{"Line":3}},{"line":176,"address":[11375754],"length":1,"stats":{"Line":1}},{"line":177,"address":[8806102,8810176,8810081],"length":1,"stats":{"Line":2}},{"line":178,"address":[11379961,11379897],"length":1,"stats":{"Line":2}},{"line":179,"address":[11380215,11380083],"length":1,"stats":{"Line":1}},{"line":180,"address":[11380186,11380244,11380399],"length":1,"stats":{"Line":2}},{"line":182,"address":[8810684,8810612],"length":1,"stats":{"Line":2}},{"line":185,"address":[11380444],"length":1,"stats":{"Line":1}},{"line":190,"address":[8810751],"length":1,"stats":{"Line":1}},{"line":195,"address":[11380562],"length":1,"stats":{"Line":1}},{"line":196,"address":[8810855],"length":1,"stats":{"Line":1}},{"line":199,"address":[11380676],"length":1,"stats":{"Line":1}},{"line":200,"address":[8810954],"length":1,"stats":{"Line":1}},{"line":202,"address":[8811023],"length":1,"stats":{"Line":1}},{"line":203,"address":[8811622,8811227,8811921,8812086,8813051,8813167,8812022,8811809],"length":1,"stats":{"Line":7}},{"line":204,"address":[8811977],"length":1,"stats":{"Line":1}},{"line":208,"address":[11375691],"length":1,"stats":{"Line":1}},{"line":209,"address":[11375703,11375820],"length":1,"stats":{"Line":2}},{"line":210,"address":[8806156,8806375],"length":1,"stats":{"Line":2}},{"line":211,"address":[8806745,8806678,8806391],"length":1,"stats":{"Line":2}},{"line":212,"address":[8806718,8806781],"length":1,"stats":{"Line":2}},{"line":213,"address":[8806895],"length":1,"stats":{"Line":1}},{"line":214,"address":[11383360,11383379],"length":1,"stats":{"Line":2}},{"line":216,"address":[11376748,11376657],"length":1,"stats":{"Line":2}},{"line":217,"address":[11376898,11376756],"length":1,"stats":{"Line":2}},{"line":219,"address":[8807166,8813699,8813680],"length":1,"stats":{"Line":3}},{"line":221,"address":[8813712,8813818],"length":1,"stats":{"Line":1}},{"line":222,"address":[11383579],"length":1,"stats":{"Line":1}},{"line":227,"address":[11376952,11377047],"length":1,"stats":{"Line":2}},{"line":229,"address":[11383632,11383658],"length":1,"stats":{"Line":2}},{"line":232,"address":[11377144],"length":1,"stats":{"Line":1}},{"line":234,"address":[11377223],"length":1,"stats":{"Line":1}},{"line":235,"address":[11379278,11378450,11378317,11378526,11378187,11377572,11377988,11379406],"length":1,"stats":{"Line":0}},{"line":236,"address":[11378382],"length":1,"stats":{"Line":0}},{"line":238,"address":[11377312,11377497],"length":1,"stats":{"Line":2}},{"line":241,"address":[11376017,11376111],"length":1,"stats":{"Line":2}},{"line":243,"address":[11376119],"length":1,"stats":{"Line":1}},{"line":245,"address":[11383744,11383754,11376164],"length":1,"stats":{"Line":3}},{"line":248,"address":[8813968],"length":1,"stats":{"Line":0}},{"line":249,"address":[11383809],"length":1,"stats":{"Line":0}},{"line":250,"address":[11384418,11384487,11383939,11384780,11384607,11384564,11384270],"length":1,"stats":{"Line":0}},{"line":251,"address":[11384513],"length":1,"stats":{"Line":0}},{"line":252,"address":[8814716],"length":1,"stats":{"Line":0}},{"line":253,"address":[11384537,11385425,11385060],"length":1,"stats":{"Line":0}},{"line":254,"address":[11385383,11385083],"length":1,"stats":{"Line":0}},{"line":255,"address":[11385190],"length":1,"stats":{"Line":0}},{"line":256,"address":[11385237],"length":1,"stats":{"Line":0}},{"line":259,"address":[11385511,11385456,11385665],"length":1,"stats":{"Line":0}},{"line":261,"address":[11385334],"length":1,"stats":{"Line":0}},{"line":262,"address":[11385352,11385417,11385430],"length":1,"stats":{"Line":0}}],"covered":94,"coverable":118},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","lib.rs"],"content":"use plonky2::{hash::hash_types::HashOut, plonk::proof::ProofWithPublicInputs};\nuse serde::*;\nuse types::{C, D, F};\n\npub mod account;\npub mod circuit_config;\npub mod circuit_registry;\npub mod circuit_utils;\npub mod config;\npub mod database;\npub mod e2e;\npub mod error;\npub mod global;\npub mod merkle_proof;\npub mod merkle_sum_prover;\npub mod merkle_sum_tree;\npub mod parser;\npub mod recursive_prover;\npub mod types;\npub mod util;\n\n#[derive(Serialize, Deserialize)]\npub struct General {\n    pub round_num: usize,\n    pub batch_num: usize,\n    pub recursion_branchout_num: usize,\n    pub batch_size: usize,\n    pub token_num: usize,\n}\n\n#[derive(Serialize, Deserialize)]\npub struct Proof {\n    pub general: General,\n    pub root_vd_digest: HashOut\u003cF\u003e,\n    pub proof: ProofWithPublicInputs\u003cF, C, D\u003e,\n}\n\n#[derive(Serialize, Deserialize)]\npub struct Info {\n    pub root_hash: String,\n    pub equity_sum: u64,\n    pub debt_sum: u64,\n    pub balance_sum: u64,\n}\n","traces":[],"covered":0,"coverable":0},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","main.rs"],"content":"use tracing::{debug, Level};\nuse zk_por_tracing::{init_tracing, TraceConfig};\n\npub fn main() {\n    let cfg = TraceConfig {\n        prefix: \"zkpor\".to_string(),\n        dir: \"logs\".to_string(),\n        level: Level::DEBUG,\n        console: true,\n        flame: false,\n    };\n    let guard = init_tracing(cfg);\n    debug!(\"tracing works\");\n    drop(guard)\n}\n","traces":[],"covered":0,"coverable":0},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","merkle_proof.rs"],"content":"use itertools::Itertools;\nuse plonky2::{\n    hash::{hash_types::HashOut, poseidon::PoseidonHash},\n    plonk::config::Hasher,\n};\nuse rayon::iter::{IntoParallelRefIterator, ParallelIterator};\nuse serde::{Deserialize, Serialize};\n\nuse crate::{\n    account::Account,\n    circuit_utils::recursive_levels,\n    database::{PoRDB, UserId},\n    error::PoRError,\n    global::{GlobalConfig, GlobalMst},\n    merkle_sum_prover::utils::hash_2_subhashes,\n    types::{D, F},\n};\n\nuse std::sync::Arc;\n\n/// We use this wrapper struct for the left and right indexes of our recursive siblings. This is needed so a user knows the position of\n/// their own hash when hashing.\n#[derive(Debug, Clone, PartialEq)]\npub struct RecursiveIndex {\n    left_indexes: Vec\u003cusize\u003e,\n    right_indexes: Vec\u003cusize\u003e,\n}\n\n/// Indexes for a given users merkle proof of inclusion siblings in the Global Merkle Sum Tree\n#[derive(Debug, Clone, PartialEq)]\npub struct MerkleProofIndex {\n    pub sum_tree_siblings: Vec\u003cusize\u003e,\n    pub recursive_tree_siblings: Vec\u003cRecursiveIndex\u003e,\n}\n\nimpl MerkleProofIndex {\n    pub fn new_from_user_index(user_index: usize, global_mst: \u0026GlobalConfig) -\u003e MerkleProofIndex {\n        let sum_tree_siblings = get_mst_siblings_index(user_index, global_mst);\n        let recursive_tree_siblings = get_recursive_siblings_index(user_index, global_mst);\n\n        MerkleProofIndex { sum_tree_siblings, recursive_tree_siblings }\n    }\n}\n\n/// Get the siblings index for the merkle proof of inclusion given a leaf index of a binary merkle sum tree.\n/// We get the parent index of a leaf using the formula: parent = index / 2 + num_leaves\npub fn get_mst_siblings_index(global_leaf_index: usize, cfg: \u0026GlobalConfig) -\u003e Vec\u003cusize\u003e {\n    // Make sure our global index is within the number of leaves\n    assert!(global_leaf_index \u003c GlobalMst::get_num_of_leaves(cfg));\n\n    let batch_id = global_leaf_index / cfg.batch_size;\n    let mut siblings = Vec::new();\n\n    // This is the index in the local mst tree\n    let mut local_index = global_leaf_index % cfg.batch_size;\n\n    while local_index \u003c (cfg.batch_size * 2 - 2) {\n        if local_index % 2 == 1 {\n            let sibling_index = local_index - 1;\n            siblings.push(sibling_index);\n        } else {\n            let sibling_index = local_index + 1;\n            siblings.push(sibling_index);\n        }\n\n        let local_parent_index = local_index / 2 + cfg.batch_size;\n        local_index = local_parent_index;\n    }\n\n    siblings.par_iter().map(|x| GlobalMst::get_batch_tree_global_index(cfg, batch_id, *x)).collect()\n}\n\n/// Gets the recursive siblings indexes (recursive tree is n-ary tree) as a Vec of vecs, each inner vec is one layer of siblings.\npub fn get_recursive_siblings_index(\n    global_index: usize,\n    cfg: \u0026GlobalConfig,\n) -\u003e Vec\u003cRecursiveIndex\u003e {\n    // Make sure our global index is within the number of leaves\n    assert!(global_index \u003c GlobalMst::get_num_of_leaves(cfg));\n\n    let mut siblings = Vec::new();\n    let mst_batch_idx = global_index / cfg.batch_size;\n    let mut recursive_idx = mst_batch_idx / cfg.recursion_branchout_num;\n    let mut recursive_offset = mst_batch_idx % cfg.recursion_branchout_num;\n\n    let recursive_level_num = recursive_levels(cfg.num_of_batches, cfg.recursion_branchout_num);\n\n    for i in 0..recursive_level_num {\n        let mut left_layer = Vec::new();\n        let mut right_layer = Vec::new();\n        for j in 0..cfg.recursion_branchout_num {\n            let inner_level_idx = recursive_idx * cfg.recursion_branchout_num + j;\n            let index = GlobalMst::get_recursive_global_index(cfg, i, inner_level_idx);\n            if j \u003c recursive_offset {\n                left_layer.push(index);\n            }\n\n            if j \u003e recursive_offset {\n                right_layer.push(index);\n            }\n        }\n\n        siblings.push(RecursiveIndex { left_indexes: left_layer, right_indexes: right_layer });\n\n        recursive_offset = recursive_idx % cfg.recursion_branchout_num;\n        recursive_idx = recursive_idx / cfg.recursion_branchout_num;\n    }\n\n    siblings\n}\n\n/// We use this wrapper struct for the left and right hashes of our recursive siblings. This is needed so a user knows the position of\n/// their own hash when hashing.\n#[derive(Debug, Clone, PartialEq, Serialize, Deserialize)]\npub struct RecursiveHashes {\n    left_hashes: Vec\u003cHashOut\u003cF\u003e\u003e,\n    right_hashes: Vec\u003cHashOut\u003cF\u003e\u003e,\n}\n\nimpl RecursiveHashes {\n    pub fn new_from_index(indexes: \u0026RecursiveIndex, db: Arc\u003cdyn PoRDB\u003e) -\u003e Self {\n        let left_hashes = indexes\n            .left_indexes\n            .iter()\n            .map(|y| db.get_gmst_node_hash(*y as i32).unwrap())\n            .collect_vec();\n        let right_hashes = indexes\n            .right_indexes\n            .iter()\n            .map(|y| db.get_gmst_node_hash(*y as i32).unwrap())\n            .collect_vec();\n        RecursiveHashes { left_hashes, right_hashes }\n    }\n\n    /// Calculated Hash = Left hashes || own hash || Right hashes\n    pub fn get_calculated_hash(self, own_hash: HashOut\u003cF\u003e) -\u003e HashOut\u003cF\u003e {\n        let mut hash_inputs = self.left_hashes;\n        hash_inputs.push(own_hash);\n        hash_inputs.extend(self.right_hashes);\n\n        let inputs: Vec\u003cF\u003e = hash_inputs.iter().map(|x| x.elements).flatten().collect();\n\n        PoseidonHash::hash_no_pad(inputs.as_slice())\n    }\n}\n\n/// Hashes for a given users merkle proof of inclusion siblings in the Global Merkle Sum Tree, also includes account data as it is needed for the verification\n/// of the merkle proof (needed to calculate own hash)\n#[derive(Debug, Clone, Serialize, Deserialize)]\npub struct MerkleProof {\n    pub account: Account,\n    pub index: usize,\n    pub sum_tree_siblings: Vec\u003cHashOut\u003cF\u003e\u003e,\n    pub recursive_tree_siblings: Vec\u003cRecursiveHashes\u003e,\n}\n\nimpl MerkleProof {\n    pub fn new_from_account(\n        account: \u0026Account,\n        db: Arc\u003cdyn PoRDB\u003e,\n        cfg: \u0026GlobalConfig,\n    ) -\u003e Result\u003cMerkleProof, PoRError\u003e {\n        let user_id_res = UserId::from_hex_string(account.id.clone());\n        if user_id_res.is_err() {\n            return Err(user_id_res.unwrap_err());\n        }\n\n        let user_id = user_id_res.unwrap();\n\n        let user_index = db.get_user_index(user_id.clone());\n        if user_index.is_none() {\n            tracing::error!(\"User with id: {:?} does not exist\", user_id.to_string());\n            return Err(PoRError::InvalidParameter(user_id.to_string()));\n        }\n\n        let merkle_proof_indexes =\n            MerkleProofIndex::new_from_user_index(user_index.unwrap() as usize, cfg);\n        let merkle_proof = get_merkle_proof_hashes_from_indexes(\n            account,\n            \u0026merkle_proof_indexes,\n            user_index.unwrap() as usize,\n            db,\n        );\n        Ok(merkle_proof)\n    }\n\n    pub fn verify_merkle_proof(\u0026self, gmst_root: HashOut\u003cF\u003e) -\u003e Result\u003c(), PoRError\u003e {\n        let account_hash = self.account.get_hash();\n\n        let mut index = self.index;\n\n        let calculated_mst_hash = self.sum_tree_siblings.iter().fold(account_hash, |acc, x| {\n            if index % 2 == 0 {\n                index /= 2;\n                hash_2_subhashes::\u003cF, D\u003e(\u0026acc, x)\n            } else {\n                index /= 2;\n                hash_2_subhashes::\u003cF, D\u003e(x, \u0026acc)\n            }\n        });\n\n        let calculated_hash = self\n            .recursive_tree_siblings\n            .iter()\n            .fold(calculated_mst_hash, |acc, x| x.clone().get_calculated_hash(acc));\n\n        if calculated_hash == gmst_root {\n            Ok(())\n        } else {\n            Err(PoRError::InvalidMerkleProof(self.account.id.clone()))\n        }\n    }\n}\n\n/// Given the indexes for the MST siblings, get the hashes from the database for the merkle proof of inclusion.\npub fn get_merkle_proof_hashes_from_indexes(\n    account: \u0026Account,\n    indexes: \u0026MerkleProofIndex,\n    user_index: usize,\n    db: Arc\u003cdyn PoRDB\u003e,\n) -\u003e MerkleProof {\n    let mst_hashes: Vec\u003cHashOut\u003cF\u003e\u003e = indexes\n        .sum_tree_siblings\n        .iter()\n        .map(|x| db.get_gmst_node_hash(*x as i32).unwrap())\n        .collect();\n\n    let recursive_hashes: Vec\u003cRecursiveHashes\u003e = indexes\n        .recursive_tree_siblings\n        .iter()\n        .map(|x| RecursiveHashes::new_from_index(x, db.clone()))\n        .collect();\n\n    MerkleProof {\n        account: account.clone(),\n        sum_tree_siblings: mst_hashes,\n        recursive_tree_siblings: recursive_hashes,\n        index: user_index,\n    }\n}\n\n#[cfg(test)]\npub mod test {\n    use itertools::Itertools;\n    use plonky2::hash::hash_types::HashOut;\n\n    use crate::{\n        account::Account,\n        global::{GlobalConfig, GlobalMst},\n        merkle_proof::{get_recursive_siblings_index, MerkleProofIndex, RecursiveIndex},\n        types::F,\n    };\n    use plonky2_field::types::Field;\n\n    use super::{get_mst_siblings_index, MerkleProof, RecursiveHashes};\n\n    #[test]\n    pub fn test_get_siblings_index() {\n        let gmst = GlobalMst::new(GlobalConfig {\n            num_of_tokens: 100,\n            num_of_batches: 4,\n            batch_size: 8,\n            recursion_branchout_num: 4,\n        });\n\n        let global_index = 0;\n\n        let siblings = get_mst_siblings_index(global_index, \u0026gmst.cfg);\n        assert_eq!(siblings, vec![1, 33, 49]);\n\n        let gmst = GlobalMst::new(GlobalConfig {\n            num_of_tokens: 100,\n            num_of_batches: 8,\n            batch_size: 8,\n            recursion_branchout_num: 4,\n        });\n\n        let global_index = 0;\n\n        let siblings = get_mst_siblings_index(global_index, \u0026gmst.cfg);\n        assert_eq!(siblings, vec![1, 65, 97]);\n\n        let gmst = GlobalMst::new(GlobalConfig {\n            num_of_tokens: 100,\n            num_of_batches: 6,\n            batch_size: 8,\n            recursion_branchout_num: 4,\n        });\n\n        let global_index = 0;\n\n        let siblings = get_mst_siblings_index(global_index, \u0026gmst.cfg);\n        assert_eq!(siblings, vec![1, 49, 73]);\n    }\n\n    #[test]\n    pub fn test_get_recursive_siblings_index() {\n        let gmst = GlobalMst::new(GlobalConfig {\n            num_of_tokens: 100,\n            num_of_batches: 15,\n            batch_size: 4,\n            recursion_branchout_num: 4,\n        });\n\n        let global_index = 0;\n\n        let siblings = get_recursive_siblings_index(global_index, \u0026gmst.cfg);\n\n        assert_eq!(\n            siblings,\n            vec![\n                RecursiveIndex { left_indexes: vec![], right_indexes: vec![91, 92, 93] },\n                RecursiveIndex { left_indexes: vec![], right_indexes: vec![107, 108, 109] }\n            ]\n        );\n\n        let gmst = GlobalMst::new(GlobalConfig {\n            num_of_tokens: 100,\n            num_of_batches: 30,\n            batch_size: 8,\n            recursion_branchout_num: 4,\n        });\n\n        let global_index = 163;\n\n        let siblings = get_recursive_siblings_index(global_index, \u0026gmst.cfg);\n        assert_eq!(\n            siblings,\n            vec![\n                RecursiveIndex { left_indexes: vec![], right_indexes: vec![441, 442, 443] },\n                RecursiveIndex { left_indexes: vec![456], right_indexes: vec![458, 459] },\n                RecursiveIndex { left_indexes: vec![460], right_indexes: vec![462, 463] }\n            ]\n        );\n\n        let gmst = GlobalMst::new(GlobalConfig {\n            num_of_tokens: 10,\n            num_of_batches: 6,\n            batch_size: 4,\n            recursion_branchout_num: 4,\n        });\n\n        let global_index = 20;\n\n        let siblings = get_recursive_siblings_index(global_index, \u0026gmst.cfg);\n        assert_eq!(\n            siblings,\n            vec![\n                RecursiveIndex { left_indexes: vec![40], right_indexes: vec![42, 43] },\n                RecursiveIndex { left_indexes: vec![44], right_indexes: vec![46, 47] },\n            ]\n        );\n    }\n\n    #[test]\n    pub fn test_get_new_merkle_index_from_user_index() {\n        let gmst = GlobalMst::new(GlobalConfig {\n            num_of_tokens: 100,\n            num_of_batches: 15,\n            batch_size: 4,\n            recursion_branchout_num: 4,\n        });\n\n        let global_index = 0;\n\n        let merkle_proof_indexes = MerkleProofIndex::new_from_user_index(global_index, \u0026gmst.cfg);\n\n        assert_eq!(\n            merkle_proof_indexes,\n            MerkleProofIndex {\n                sum_tree_siblings: vec![1, 61],\n                recursive_tree_siblings: vec![\n                    RecursiveIndex { left_indexes: vec![], right_indexes: vec![91, 92, 93] },\n                    RecursiveIndex { left_indexes: vec![], right_indexes: vec![107, 108, 109] }\n                ],\n            }\n        );\n    }\n\n    #[test]\n    pub fn test_verify_merkle_proof() {\n        let _gmst = GlobalMst::new(GlobalConfig {\n            num_of_tokens: 3,\n            num_of_batches: 4,\n            batch_size: 2,\n            recursion_branchout_num: 4,\n        });\n\n        let equity = vec![3, 3, 3].iter().map(|x| F::from_canonical_u32(*x)).collect_vec();\n        let debt = vec![1, 1, 1].iter().map(|x| F::from_canonical_u32(*x)).collect_vec();\n\n        let sum_tree_siblings = vec![HashOut::from_vec(\n            vec![\n                7609058119952049295,\n                8895839458156070742,\n                1052773619972611009,\n                6038312163525827182,\n            ]\n            .iter()\n            .map(|x| F::from_canonical_u64(*x))\n            .collect::\u003cVec\u003cF\u003e\u003e(),\n        )];\n\n        let recursive_tree_siblings = vec![RecursiveHashes {\n            left_hashes: vec![],\n            right_hashes: vec![\n                HashOut::from_vec(\n                    vec![\n                        15026394135096265436,\n                        13313300609834454638,\n                        10151802728958521275,\n                        6200471959130767555,\n                    ]\n                    .iter()\n                    .map(|x| F::from_canonical_u64(*x))\n                    .collect::\u003cVec\u003cF\u003e\u003e(),\n                ),\n                HashOut::from_vec(\n                    vec![\n                        2010803994799996791,\n                        568450490466247075,\n                        18209684900543488748,\n                        7678193912819861368,\n                    ]\n                    .iter()\n                    .map(|x| F::from_canonical_u64(*x))\n                    .collect::\u003cVec\u003cF\u003e\u003e(),\n                ),\n                HashOut::from_vec(\n                    vec![\n                        13089029781628355232,\n                        10704046654659337561,\n                        15794212269117984095,\n                        15948192230150472783,\n                    ]\n                    .iter()\n                    .map(|x| F::from_canonical_u64(*x))\n                    .collect::\u003cVec\u003cF\u003e\u003e(),\n                ),\n            ],\n        }];\n\n        let account = Account {\n            id: \"320b5ea99e653bc2b593db4130d10a4efd3a0b4cc2e1a6672b678d71dfbd33ad\".to_string(),\n            equity: equity.clone(),\n            debt: debt.clone(),\n        };\n\n        let merkle_proof =\n            MerkleProof { account, sum_tree_siblings, recursive_tree_siblings, index: 0 };\n\n        let root = HashOut::from_vec(\n            vec![\n                10628303359772907103,\n                7478459528589413745,\n                12007196562137971174,\n                2652030368197917032,\n            ]\n            .iter()\n            .map(|x| F::from_canonical_u64(*x))\n            .collect::\u003cVec\u003cF\u003e\u003e(),\n        );\n\n        let res = merkle_proof.verify_merkle_proof(root);\n\n        res.unwrap();\n    }\n\n    // THIS IS THE TEST DATA FOR VERIFY\n    // #[test]\n    // pub fn poseidon_hash() {\n    //     let equity = vec![3,3,3,].iter().map(|x| F::from_canonical_u32(*x)).collect_vec();\n    //     let debt = vec![1,1,1,].iter().map(|x| F::from_canonical_u32(*x)).collect_vec();\n\n    //     let accounts = vec![\n    //         Account{\n    //             id: \"320b5ea99e653bc2b593db4130d10a4efd3a0b4cc2e1a6672b678d71dfbd33ad\".to_string(),\n    //             equity: equity.clone(),\n    //             debt: debt.clone(),\n    //         },\n    //         Account{\n    //             id: \"320b5ea99e653bc2b593db4130d10a4efd3a0b4cc2e1a6672b678d71dfbd33ac\".to_string(),\n    //             equity: equity.clone(),\n    //             debt: debt.clone(),\n    //         },\n    //         Account{\n    //             id: \"320b5ea99e653bc2b593db4130d10a4efd3a0b4cc2e1a6672b678d71dfbd33ab\".to_string(),\n    //             equity: equity.clone(),\n    //             debt: debt.clone(),\n    //         },\n    //         Account{\n    //             id: \"320b5ea99e653bc2b593db4130d10a4efd3a0b4cc2e1a6672b678d71dfbd33aa\".to_string(),\n    //             equity: equity.clone(),\n    //             debt: debt.clone(),\n    //         },\n    //         Account{\n    //             id: \"320b5ea99e653bc2b593db4130d10a4efd3a0b4cc2e1a6672b678d71dfbd33a1\".to_string(),\n    //             equity: equity.clone(),\n    //             debt: debt.clone(),\n    //         },\n    //         Account{\n    //             id: \"320b5ea99e653bc2b593db4130d10a4efd3a0b4cc2e1a6672b678d71dfbd33a2\".to_string(),\n    //             equity: equity.clone(),\n    //             debt: debt.clone(),\n    //         },\n    //         Account{\n    //             id: \"320b5ea99e653bc2b593db4130d10a4efd3a0b4cc2e1a6672b678d71dfbd33a3\".to_string(),\n    //             equity: equity.clone(),\n    //             debt: debt.clone(),\n    //         },\n    //         Account{\n    //             id: \"320b5ea99e653bc2b593db4130d10a4efd3a0b4cc2e1a6672b678d71dfbd33a4\".to_string(),\n    //             equity: equity.clone(),\n    //             debt: debt.clone(),\n    //         }\n    //     ];\n\n    //     let msts: Vec\u003cMerkleSumTree\u003e = accounts\n    //         .chunks(2)\n    //         .map(|account_batch| MerkleSumTree::new_tree_from_accounts(\u0026account_batch.to_vec()))\n    //         .collect();\n\n    //     let mst_hashes = msts.iter().map(|x| x.merkle_sum_tree.iter().map(|y| y.hash).collect_vec()).collect_vec();\n    //     println!(\"msts:{:?}\", mst_hashes);\n    //     let inputs = vec![\n    //         HashOut::from_vec(\n    //             vec![\n    //                 8699257539652901730,\n    //                 12847577670763395377,\n    //                 14540605839220144846,\n    //                 1921995570040415498,\n    //             ]\n    //             .iter()\n    //             .map(|x| F::from_canonical_u64(*x))\n    //             .collect::\u003cVec\u003cF\u003e\u003e(),\n    //         ),\n    //         HashOut::from_vec(\n    //             vec![\n    //                 15026394135096265436,\n    //                 13313300609834454638,\n    //                 10151802728958521275,\n    //                 6200471959130767555,\n    //             ]\n    //             .iter()\n    //             .map(|x| F::from_canonical_u64(*x))\n    //             .collect::\u003cVec\u003cF\u003e\u003e(),\n    //         ),\n    //         HashOut::from_vec(\n    //             vec![\n    //                 2010803994799996791,\n    //                 568450490466247075,\n    //                 18209684900543488748,\n    //                 7678193912819861368,\n    //             ]\n    //             .iter()\n    //             .map(|x| F::from_canonical_u64(*x))\n    //             .collect::\u003cVec\u003cF\u003e\u003e(),\n    //         ),\n    //         HashOut::from_vec(\n    //             vec![\n    //                 13089029781628355232,\n    //                 10704046654659337561,\n    //                 15794212269117984095,\n    //                 15948192230150472783,\n    //             ]\n    //             .iter()\n    //             .map(|x| F::from_canonical_u64(*x))\n    //             .collect::\u003cVec\u003cF\u003e\u003e(),\n    //         ),\n    //     ];\n\n    //     let hash = PoseidonHash::hash_no_pad(\n    //         inputs.iter().map(|x| x.elements).flatten().collect_vec().as_slice(),\n    //     );\n    //     println!(\"Hash: {:?}\", hash);\n    // }\n}\n","traces":[{"line":37,"address":[11386038,11385824],"length":1,"stats":{"Line":1}},{"line":38,"address":[8816041],"length":1,"stats":{"Line":1}},{"line":39,"address":[11385884],"length":1,"stats":{"Line":1}},{"line":47,"address":[11386876,11386064],"length":1,"stats":{"Line":1}},{"line":49,"address":[11386118],"length":1,"stats":{"Line":1}},{"line":51,"address":[11386170,11386247],"length":1,"stats":{"Line":1}},{"line":52,"address":[11386211],"length":1,"stats":{"Line":1}},{"line":55,"address":[11386276,11386230,11386291],"length":1,"stats":{"Line":2}},{"line":57,"address":[11386850,11386360,11386289],"length":1,"stats":{"Line":3}},{"line":58,"address":[11386615,11386502],"length":1,"stats":{"Line":2}},{"line":59,"address":[11386625,11386682,11386709],"length":1,"stats":{"Line":0}},{"line":60,"address":[11386690,11386730],"length":1,"stats":{"Line":0}},{"line":62,"address":[11386653,11386752,11386779],"length":1,"stats":{"Line":2}},{"line":63,"address":[8816923,8816963],"length":1,"stats":{"Line":2}},{"line":66,"address":[11386732,11386855,11386812],"length":1,"stats":{"Line":2}},{"line":67,"address":[11386842],"length":1,"stats":{"Line":1}},{"line":70,"address":[11386473,11386532,11386932,11386912],"length":1,"stats":{"Line":4}},{"line":74,"address":[11388563,11386960,11388594],"length":1,"stats":{"Line":1}},{"line":79,"address":[11387026],"length":1,"stats":{"Line":1}},{"line":81,"address":[8817248],"length":1,"stats":{"Line":1}},{"line":82,"address":[8817269,8817355],"length":1,"stats":{"Line":1}},{"line":83,"address":[11387321,11387177,11387277],"length":1,"stats":{"Line":2}},{"line":84,"address":[8817455,8817553,8817509],"length":1,"stats":{"Line":2}},{"line":86,"address":[11387432,11387376],"length":1,"stats":{"Line":2}},{"line":88,"address":[11387628,11388303,11387440],"length":1,"stats":{"Line":3}},{"line":89,"address":[11387649],"length":1,"stats":{"Line":1}},{"line":90,"address":[11387668],"length":1,"stats":{"Line":1}},{"line":91,"address":[11388094,11387829,11387744],"length":1,"stats":{"Line":3}},{"line":92,"address":[11388115,11388339,11388417],"length":1,"stats":{"Line":2}},{"line":93,"address":[11388401,11388448],"length":1,"stats":{"Line":2}},{"line":94,"address":[11388456],"length":1,"stats":{"Line":1}},{"line":95,"address":[8818633],"length":1,"stats":{"Line":1}},{"line":98,"address":[11388471],"length":1,"stats":{"Line":1}},{"line":99,"address":[11388517],"length":1,"stats":{"Line":1}},{"line":103,"address":[11387915],"length":1,"stats":{"Line":1}},{"line":105,"address":[11388154,11388243],"length":1,"stats":{"Line":1}},{"line":106,"address":[11388274,11388308,11388213],"length":1,"stats":{"Line":2}},{"line":109,"address":[11387585],"length":1,"stats":{"Line":1}},{"line":121,"address":[11388608,11389107],"length":1,"stats":{"Line":0}},{"line":122,"address":[11388728,11388656],"length":1,"stats":{"Line":0}},{"line":125,"address":[11389165,11389267,11389136],"length":1,"stats":{"Line":0}},{"line":127,"address":[11388888,11388812],"length":1,"stats":{"Line":0}},{"line":130,"address":[11389309,11389280,11389411],"length":1,"stats":{"Line":0}},{"line":136,"address":[8820021,8819536],"length":1,"stats":{"Line":1}},{"line":137,"address":[8819558],"length":1,"stats":{"Line":1}},{"line":138,"address":[8819591],"length":1,"stats":{"Line":1}},{"line":139,"address":[8819676],"length":1,"stats":{"Line":1}},{"line":141,"address":[11390013,11390000,11389628],"length":1,"stats":{"Line":3}},{"line":143,"address":[8819860,8819936],"length":1,"stats":{"Line":2}},{"line":158,"address":[11393272,11390048,11391633],"length":1,"stats":{"Line":0}},{"line":163,"address":[8820283,8820183],"length":1,"stats":{"Line":0}},{"line":164,"address":[8820397,8820306],"length":1,"stats":{"Line":0}},{"line":165,"address":[8823220,8820761],"length":1,"stats":{"Line":0}},{"line":168,"address":[11390351],"length":1,"stats":{"Line":0}},{"line":170,"address":[8820906],"length":1,"stats":{"Line":0}},{"line":171,"address":[8821046],"length":1,"stats":{"Line":0}},{"line":172,"address":[8821674,8822069,8822482,8822368,8822546,8822256,8822758],"length":1,"stats":{"Line":0}},{"line":173,"address":[11393061,11392396],"length":1,"stats":{"Line":0}},{"line":176,"address":[8821079,8821316],"length":1,"stats":{"Line":0}},{"line":181,"address":[8821468,8821335],"length":1,"stats":{"Line":0}},{"line":182,"address":[8821472],"length":1,"stats":{"Line":0}},{"line":184,"address":[11391495],"length":1,"stats":{"Line":0}},{"line":187,"address":[11393312],"length":1,"stats":{"Line":1}},{"line":188,"address":[11393347],"length":1,"stats":{"Line":1}},{"line":190,"address":[11393363],"length":1,"stats":{"Line":1}},{"line":192,"address":[11393372,11393744],"length":1,"stats":{"Line":2}},{"line":193,"address":[8823766],"length":1,"stats":{"Line":1}},{"line":194,"address":[11393817],"length":1,"stats":{"Line":1}},{"line":195,"address":[11393832],"length":1,"stats":{"Line":1}},{"line":197,"address":[11393859],"length":1,"stats":{"Line":0}},{"line":198,"address":[11393874],"length":1,"stats":{"Line":0}},{"line":202,"address":[11393478],"length":1,"stats":{"Line":1}},{"line":205,"address":[11393904,11393949],"length":1,"stats":{"Line":2}},{"line":207,"address":[11393579,11393702],"length":1,"stats":{"Line":1}},{"line":208,"address":[8823701],"length":1,"stats":{"Line":1}},{"line":210,"address":[11393599],"length":1,"stats":{"Line":0}},{"line":216,"address":[11394724,11394048],"length":1,"stats":{"Line":0}},{"line":222,"address":[11394194,11394122],"length":1,"stats":{"Line":0}},{"line":225,"address":[11394752,11394781,11394883],"length":1,"stats":{"Line":0}},{"line":228,"address":[11394278,11394354],"length":1,"stats":{"Line":0}},{"line":231,"address":[11394925,11394896],"length":1,"stats":{"Line":0}},{"line":235,"address":[11394447],"length":1,"stats":{"Line":0}}],"covered":53,"coverable":82},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","merkle_sum_prover","circuits","account_circuit.rs"],"content":"use plonky2::{\n    hash::{hash_types::HashOutTarget, poseidon::PoseidonHash},\n    iop::{\n        target::Target,\n        witness::{PartialWitness, WitnessWrite},\n    },\n    plonk::circuit_builder::CircuitBuilder,\n};\n\nuse crate::{\n    account::Account,\n    circuit_utils::assert_non_negative_unsigned,\n    types::{D, F},\n};\n\n#[derive(Debug, Clone)]\n/// Targets representing a users account, where their equity and debt are split into individual tokens.\npub struct AccountTargets {\n    pub id: [Target; 5],\n    pub equity: Vec\u003cTarget\u003e,\n    pub debt: Vec\u003cTarget\u003e,\n}\n\nimpl AccountTargets {\n    pub fn new_from_account(\n        account: \u0026Account,\n        builder: \u0026mut CircuitBuilder\u003cF, D\u003e,\n    ) -\u003e AccountTargets {\n        let id: [Target; 5] = std::array::from_fn(|_| builder.add_virtual_target());\n        let equity = builder.add_virtual_targets(account.equity.len());\n        let debt = builder.add_virtual_targets(account.debt.len());\n\n        AccountTargets { id, equity, debt }\n    }\n\n    pub fn set_account_targets(\u0026self, account_info: \u0026Account, pw: \u0026mut PartialWitness\u003cF\u003e) {\n        assert_eq!(self.equity.len(), account_info.equity.len());\n        assert_eq!(self.debt.len(), account_info.debt.len());\n\n        pw.set_target_arr(self.equity.as_slice(), account_info.equity.as_slice());\n        pw.set_target_arr(self.debt.as_slice(), account_info.debt.as_slice());\n        pw.set_target_arr(self.id.as_slice(), account_info.get_user_id_in_field().as_slice());\n    }\n}\n\n#[derive(Debug, Clone)]\n/// Targets representing a users account, where their equity and liabilities are summed into 2 summed values.\npub struct AccountSumTargets {\n    pub id: [Target; 5],\n    pub sum_equity: Target,\n    pub sum_debt: Target,\n}\n\nimpl AccountSumTargets {\n    /// Given Account Targets, sum the account equity and liabilities and return a AccountSumTargets.\n    pub fn from_account_target(\n        account: \u0026AccountTargets,\n        builder: \u0026mut CircuitBuilder\u003cF, D\u003e,\n    ) -\u003e AccountSumTargets {\n        let sum_equity = account.equity.iter().fold(builder.zero(), |x, y| builder.add(x, *y));\n\n        let sum_debt = account.debt.iter().fold(builder.zero(), |x, y| builder.add(x, *y));\n\n        let diff_between_equity_debt = builder.sub(sum_equity, sum_debt);\n\n        // Ensure the equity is greater than the debt. This works as long as we constrict our equity to 62 bits.\n        assert_non_negative_unsigned(builder, diff_between_equity_debt);\n\n        AccountSumTargets { id: account.id, sum_equity, sum_debt }\n    }\n\n    /// Get account hash targets\n    pub fn get_account_hash_targets(\u0026self, builder: \u0026mut CircuitBuilder\u003cF, D\u003e) -\u003e HashOutTarget {\n        #[allow(clippy::useless_vec)]\n        let hash_inputs = vec![self.id.to_vec(), vec![self.sum_equity, self.sum_debt]].concat();\n        builder.hash_n_to_hash_no_pad::\u003cPoseidonHash\u003e(hash_inputs)\n    }\n}\n\n#[cfg(test)]\npub mod test {\n    use crate::{\n        circuit_utils::run_circuit_test,\n        parser::{FileManager, JsonFileManager},\n    };\n\n    use super::{AccountSumTargets, AccountTargets};\n\n    #[test]\n    fn test_account_target() {\n        run_circuit_test(|builder, pw| {\n            let fm = FileManager {};\n            let path = \"../../test-data/batch0.json\";\n            let tokens = vec![\"BTC\".to_owned(), \"ETH\".to_owned()];\n            let accounts = fm.read_json_into_accounts_vec(path, \u0026tokens);\n\n            let account_target =\n                AccountTargets::new_from_account(accounts.get(0).unwrap(), builder);\n            account_target.set_account_targets(accounts.get(0).unwrap(), pw);\n        });\n    }\n\n    #[test]\n    fn test_account_sum_target() {\n        run_circuit_test(|builder, pw| {\n            let path = \"../../test-data/batch0.json\";\n            let fm = FileManager {};\n            let tokens = vec![\"BTC\".to_owned(), \"ETH\".to_owned()];\n            let accounts = fm.read_json_into_accounts_vec(path, \u0026tokens);\n\n            let account_target =\n                AccountTargets::new_from_account(accounts.get(0).unwrap(), builder);\n\n            let account_sum_target =\n                AccountSumTargets::from_account_target(\u0026account_target, builder);\n\n            let total_equity =\n                account_target.equity.iter().fold(builder.zero(), |x, y| builder.add(x, *y));\n            let total_debt =\n                account_target.debt.iter().fold(builder.zero(), |x, y| builder.add(x, *y));\n\n            builder.connect(account_sum_target.sum_equity, total_equity);\n            builder.connect(account_sum_target.sum_debt, total_debt);\n\n            account_target.set_account_targets(accounts.get(0).unwrap(), pw);\n        });\n    }\n\n    #[test]\n    fn test_theory() {}\n}\n","traces":[{"line":25,"address":[8485584,8485954],"length":1,"stats":{"Line":1}},{"line":29,"address":[11880688,11880323,11880709],"length":1,"stats":{"Line":3}},{"line":30,"address":[11880342],"length":1,"stats":{"Line":1}},{"line":31,"address":[11880395,11880462],"length":1,"stats":{"Line":2}},{"line":36,"address":[11880736,11881435],"length":1,"stats":{"Line":1}},{"line":37,"address":[11880782],"length":1,"stats":{"Line":1}},{"line":38,"address":[11880934],"length":1,"stats":{"Line":1}},{"line":40,"address":[11881101],"length":1,"stats":{"Line":1}},{"line":41,"address":[11881195],"length":1,"stats":{"Line":1}},{"line":42,"address":[11881266],"length":1,"stats":{"Line":1}},{"line":56,"address":[8486688],"length":1,"stats":{"Line":1}},{"line":60,"address":[11882037,11882016,11881523],"length":1,"stats":{"Line":3}},{"line":62,"address":[11882128,11881605,11882149],"length":1,"stats":{"Line":3}},{"line":64,"address":[11881698],"length":1,"stats":{"Line":1}},{"line":67,"address":[11881814],"length":1,"stats":{"Line":1}},{"line":69,"address":[11881881],"length":1,"stats":{"Line":1}},{"line":73,"address":[11883013,11883042,11882240],"length":1,"stats":{"Line":1}},{"line":75,"address":[11883051,11882283],"length":1,"stats":{"Line":1}},{"line":76,"address":[11882939],"length":1,"stats":{"Line":1}}],"covered":19,"coverable":19},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","merkle_sum_prover","circuits","merkle_sum_circuit.rs"],"content":"use plonky2::{\n    hash::{\n        hash_types::{HashOutTarget, NUM_HASH_OUT_ELTS},\n        poseidon::PoseidonHash,\n    },\n    iop::target::Target,\n    plonk::{\n        circuit_builder::CircuitBuilder,\n        circuit_data::{CircuitConfig, CircuitData},\n    },\n};\n\nuse plonky2_field::types::Field;\n\nuse crate::{\n    circuit_utils::assert_non_negative_unsigned,\n    types::{C, D, F},\n};\n\nuse super::account_circuit::{AccountSumTargets, AccountTargets};\n\n/// A node in the merkle sum tree, contains the total amount of equity (in usd) and the total amount of debt (in usd) and the hash.\n///\n/// The hash is Hash(hash_left, hash_right).\n///\n/// The amount of equity and amount of debt is the sum of the equity and debt of the children.\n#[derive(Debug, Copy, Clone)]\npub struct MerkleSumNodeTarget {\n    pub sum_equity: Target,\n    pub sum_debt: Target,\n    pub hash: HashOutTarget,\n}\n\nimpl MerkleSumNodeTarget {\n    /// Given children nodes, generate the MerkleSumNodeTarget\n    pub fn get_parent_from_children\u003cconst N: usize\u003e(\n        builder: \u0026mut CircuitBuilder\u003cF, D\u003e,\n        children: \u0026[MerkleSumNodeTarget],\n    ) -\u003e MerkleSumNodeTarget {\n        assert_eq!(N, children.len());\n        let mut sum_equity = builder.constant(F::ZERO);\n        let mut sum_debt = builder.constant(F::ZERO);\n        let mut hash_inputs = Vec::new();\n        children.iter().for_each(|child| {\n            sum_equity = builder.add(sum_equity, child.sum_equity);\n            sum_debt = builder.add(sum_debt, child.sum_debt);\n\n            // Ensure the amount of equity at this node is greater than the total amount of debt\n            let diff_between_equity_debt = builder.sub(sum_equity, sum_debt);\n            assert_non_negative_unsigned(builder, diff_between_equity_debt);\n\n            // Ensure no overflow. We only need to check one child since in any overflow, the new value will be less than both the left and\n            // right children.\n            let diff_between_equity_child_and_sum = builder.sub(sum_equity, child.sum_equity);\n            assert_non_negative_unsigned(builder, diff_between_equity_child_and_sum);\n            let diff_between_debt_child_and_sum = builder.sub(sum_debt, child.sum_debt);\n            assert_non_negative_unsigned(builder, diff_between_debt_child_and_sum);\n\n            hash_inputs.extend(child.hash.elements.iter());\n        });\n        let hash = builder.hash_n_to_hash_no_pad::\u003cPoseidonHash\u003e(hash_inputs);\n        MerkleSumNodeTarget { sum_equity, sum_debt, hash }\n    }\n\n    /// Get a merkle sum node target from account sum targets.\n    pub fn get_node_from_account_targets(\n        builder: \u0026mut CircuitBuilder\u003cF, D\u003e,\n        account_targets: \u0026AccountSumTargets,\n    ) -\u003e MerkleSumNodeTarget {\n        let hash = account_targets.get_account_hash_targets(builder);\n        MerkleSumNodeTarget {\n            sum_equity: account_targets.sum_equity,\n            sum_debt: account_targets.sum_debt,\n            hash,\n        }\n    }\n\n    #[inline(always)]\n    pub fn pub_input_equity_offset() -\u003e usize {\n        0\n    }\n\n    #[inline(always)]\n    pub fn pub_input_debt_offset() -\u003e usize {\n        1\n    }\n\n    pub fn pub_input_root_hash_offset() -\u003e std::ops::Range\u003cusize\u003e {\n        // the first two targets are sum_equity and sum_debt.\n        2..6\n    }\n\n    /// Register this node targets as a public input\n    pub fn register_as_public_input(\u0026self, builder: \u0026mut CircuitBuilder\u003cF, D\u003e) {\n        builder.register_public_input(self.sum_equity);\n        builder.register_public_input(self.sum_debt);\n        builder.register_public_inputs(\u0026self.hash.elements);\n    }\n}\n\nimpl From\u003cMerkleSumNodeTarget\u003e for Vec\u003cTarget\u003e {\n    fn from(node: MerkleSumNodeTarget) -\u003e Vec\u003cTarget\u003e {\n        #[allow(clippy::useless_vec)]\n        vec![vec![node.sum_equity, node.sum_debt], node.hash.elements.to_vec()].concat()\n    }\n}\n\nimpl From\u003cVec\u003cTarget\u003e\u003e for MerkleSumNodeTarget {\n    /// the parsing order must be consistent with the order of public input registration in `registered_as_public_inputs`\n    fn from(inputs: Vec\u003cTarget\u003e) -\u003e MerkleSumNodeTarget {\n        let mut iter = inputs.into_iter();\n        let sum_equity_target = iter.next().unwrap();\n        let sum_debt_target = iter.next().unwrap();\n        let hash_target = HashOutTarget::from_vec(iter.by_ref().take(NUM_HASH_OUT_ELTS).collect());\n\n        MerkleSumNodeTarget {\n            sum_equity: sum_equity_target,\n            sum_debt: sum_debt_target,\n            hash: hash_target,\n        }\n    }\n}\n/// We can represent the Merkle Sum Tree as a vector of merkle sum nodes, with the root being the last node in the vector.\npub struct MerkleSumTreeTarget {\n    pub sum_tree: Vec\u003cMerkleSumNodeTarget\u003e,\n}\n\nimpl MerkleSumTreeTarget {\n    pub fn get_root(\u0026self) -\u003e \u0026MerkleSumNodeTarget {\n        self.sum_tree.last().unwrap()\n    }\n\n    /// Register the root hash, sum_equity and sum_debt as public inputs to be used in recursive proving.\n    pub fn register_public_inputs(\u0026self, builder: \u0026mut CircuitBuilder\u003cF, D\u003e) {\n        let root = self.get_root();\n        root.register_as_public_input(builder);\n    }\n\n    /// Builds a merkle sum tree of a given size (based on the number of leaves). It will build the merkle sum tree on top of the leaves vector\n    /// in order to do the task in place. There is no return value as the input leaves vector is mutated.\n    pub fn build_merkle_sum_tree(\n        builder: \u0026mut CircuitBuilder\u003cF, D\u003e,\n        leaves: \u0026mut Vec\u003cMerkleSumNodeTarget\u003e,\n    ) {\n        let num_leaves = leaves.len();\n\n        for i in num_leaves..(num_leaves * 2 - 1) {\n            let left_child_index = 2 * (i - num_leaves);\n            let right_child_index = 2 * (i - num_leaves) + 1;\n            let left_child = leaves.get(left_child_index).unwrap();\n            let right_child = leaves.get(right_child_index).unwrap();\n            leaves.push(MerkleSumNodeTarget::get_parent_from_children::\u003c2\u003e(\n                builder,\n                \u0026vec![*left_child, *right_child],\n            ));\n        }\n    }\n\n    /// Given a list of account targets, build the corresponding merkle sum tree.\n    pub fn build_new_from_account_targets(\n        builder: \u0026mut CircuitBuilder\u003cF, D\u003e,\n        accounts: \u0026mut [AccountSumTargets],\n    ) -\u003e MerkleSumTreeTarget {\n        let mut leaves: Vec\u003cMerkleSumNodeTarget\u003e = accounts\n            .iter()\n            .map(|x| MerkleSumNodeTarget::get_node_from_account_targets(builder, x))\n            .collect();\n\n        MerkleSumTreeTarget::build_merkle_sum_tree(builder, \u0026mut leaves);\n\n        let tree = MerkleSumTreeTarget { sum_tree: leaves };\n\n        tree.register_public_inputs(builder);\n\n        tree\n    }\n}\n\npub fn build_merkle_sum_tree_circuit(\n    num_of_leaves: usize,\n    token_num: usize,\n    config: CircuitConfig,\n) -\u003e (CircuitData\u003cF, C, D\u003e, Vec\u003cAccountTargets\u003e) {\n    // assert num_of_leaves is a power of 2\n    assert!(num_of_leaves.is_power_of_two(), \"num_of_leaves must be a power of 2.\");\n\n    let mut builder = CircuitBuilder::\u003cF, D\u003e::new(config);\n    let mut account_targets: Vec\u003cAccountTargets\u003e = Vec::new();\n    (0..num_of_leaves).for_each(|_| {\n        let id: [Target; 5] = std::array::from_fn(|_| builder.add_virtual_target());\n        let equity_targets = builder.add_virtual_targets(token_num);\n        let debt_targets = builder.add_virtual_targets(token_num);\n        let account_target = AccountTargets { id, equity: equity_targets, debt: debt_targets };\n        account_targets.push(account_target);\n    });\n    let mut account_sum_targets: Vec\u003cAccountSumTargets\u003e = account_targets\n        .iter()\n        .map(|x| AccountSumTargets::from_account_target(x, \u0026mut builder))\n        .collect();\n\n    _ = MerkleSumTreeTarget::build_new_from_account_targets(\u0026mut builder, \u0026mut account_sum_targets);\n    let circuit_data = builder.build::\u003cC\u003e();\n    (circuit_data, account_targets)\n}\n\n#[cfg(test)]\npub mod test {\n    use crate::{\n        circuit_utils::run_circuit_test,\n        merkle_sum_prover::circuits::account_circuit::{AccountSumTargets, AccountTargets},\n        parser::{FileManager, JsonFileManager},\n    };\n\n    use super::MerkleSumNodeTarget;\n\n    #[test]\n    pub fn test_merkle_sum_node() {\n        run_circuit_test(|builder, pw| {\n            let path = \"../../test-data/batch0.json\";\n            let fm = FileManager {};\n            let tokens = vec![\"BTC\".to_owned(), \"ETH\".to_owned()];\n            let accounts = fm.read_json_into_accounts_vec(path, \u0026tokens);\n\n            let account_target_1 =\n                AccountTargets::new_from_account(accounts.get(0).unwrap(), builder);\n            let account_target_2 =\n                AccountTargets::new_from_account(accounts.get(1).unwrap(), builder);\n\n            let account_sum_target_1 =\n                AccountSumTargets::from_account_target(\u0026account_target_1, builder);\n            let account_sum_target_2 =\n                AccountSumTargets::from_account_target(\u0026account_target_2, builder);\n\n            let merkle_sum_node_target_1 =\n                MerkleSumNodeTarget::get_node_from_account_targets(builder, \u0026account_sum_target_1);\n            let merkle_sum_node_target_2 =\n                MerkleSumNodeTarget::get_node_from_account_targets(builder, \u0026account_sum_target_2);\n\n            let merkle_sum_node_target_3 = MerkleSumNodeTarget::get_parent_from_children::\u003c2\u003e(\n                builder,\n                \u0026vec![merkle_sum_node_target_1, merkle_sum_node_target_2],\n            );\n\n            let sum_equity =\n                builder.add(account_sum_target_1.sum_equity, account_sum_target_2.sum_equity);\n            let sum_debt =\n                builder.add(account_sum_target_1.sum_debt, account_sum_target_2.sum_debt);\n\n            builder.connect(merkle_sum_node_target_3.sum_equity, sum_equity);\n            builder.connect(merkle_sum_node_target_3.sum_debt, sum_debt);\n\n            account_target_1.set_account_targets(accounts.get(0).unwrap(), pw);\n            account_target_2.set_account_targets(accounts.get(1).unwrap(), pw);\n        });\n    }\n}\n","traces":[{"line":36,"address":[9289876,9289184,9289908],"length":1,"stats":{"Line":1}},{"line":40,"address":[8824968],"length":1,"stats":{"Line":1}},{"line":41,"address":[],"length":0,"stats":{"Line":1}},{"line":42,"address":[8825120],"length":1,"stats":{"Line":1}},{"line":43,"address":[11204414],"length":1,"stats":{"Line":1}},{"line":44,"address":[9289920,9289441,9289526],"length":1,"stats":{"Line":3}},{"line":45,"address":[8825667],"length":1,"stats":{"Line":1}},{"line":46,"address":[9290073],"length":1,"stats":{"Line":1}},{"line":49,"address":[8825917],"length":1,"stats":{"Line":1}},{"line":50,"address":[11205346],"length":1,"stats":{"Line":1}},{"line":54,"address":[],"length":0,"stats":{"Line":1}},{"line":55,"address":[9290508],"length":1,"stats":{"Line":1}},{"line":56,"address":[8826289],"length":1,"stats":{"Line":1}},{"line":57,"address":[],"length":0,"stats":{"Line":1}},{"line":59,"address":[9290771],"length":1,"stats":{"Line":1}},{"line":61,"address":[],"length":0,"stats":{"Line":1}},{"line":66,"address":[8826528],"length":1,"stats":{"Line":1}},{"line":70,"address":[11205900],"length":1,"stats":{"Line":1}},{"line":72,"address":[11205920],"length":1,"stats":{"Line":1}},{"line":73,"address":[11205959],"length":1,"stats":{"Line":1}},{"line":79,"address":[],"length":0,"stats":{"Line":0}},{"line":80,"address":[],"length":0,"stats":{"Line":0}},{"line":84,"address":[],"length":0,"stats":{"Line":0}},{"line":85,"address":[],"length":0,"stats":{"Line":0}},{"line":88,"address":[11206112],"length":1,"stats":{"Line":1}},{"line":94,"address":[11206128],"length":1,"stats":{"Line":1}},{"line":95,"address":[11206163],"length":1,"stats":{"Line":1}},{"line":96,"address":[11206210],"length":1,"stats":{"Line":1}},{"line":97,"address":[11206258],"length":1,"stats":{"Line":1}},{"line":102,"address":[10452736,10453353],"length":1,"stats":{"Line":0}},{"line":104,"address":[10453375,10452778,10453318],"length":1,"stats":{"Line":0}},{"line":110,"address":[11206288,11206780],"length":1,"stats":{"Line":0}},{"line":111,"address":[8826987],"length":1,"stats":{"Line":0}},{"line":112,"address":[8827002],"length":1,"stats":{"Line":0}},{"line":113,"address":[11206451],"length":1,"stats":{"Line":0}},{"line":114,"address":[11206561],"length":1,"stats":{"Line":0}},{"line":129,"address":[11206816],"length":1,"stats":{"Line":1}},{"line":130,"address":[8827464],"length":1,"stats":{"Line":1}},{"line":134,"address":[11206896],"length":1,"stats":{"Line":1}},{"line":135,"address":[11206915],"length":1,"stats":{"Line":1}},{"line":136,"address":[11206934],"length":1,"stats":{"Line":1}},{"line":141,"address":[11206960,11208029],"length":1,"stats":{"Line":1}},{"line":145,"address":[11207012],"length":1,"stats":{"Line":1}},{"line":147,"address":[11207209,11207034],"length":1,"stats":{"Line":2}},{"line":148,"address":[8827853,8827954],"length":1,"stats":{"Line":1}},{"line":149,"address":[11207352,11207313,11207738],"length":1,"stats":{"Line":2}},{"line":150,"address":[11207547,11207450],"length":1,"stats":{"Line":2}},{"line":151,"address":[8828176,8828263],"length":1,"stats":{"Line":2}},{"line":152,"address":[11207964],"length":1,"stats":{"Line":1}},{"line":154,"address":[8828407,8828271],"length":1,"stats":{"Line":2}},{"line":160,"address":[11208064,11208454],"length":1,"stats":{"Line":1}},{"line":164,"address":[11208136],"length":1,"stats":{"Line":1}},{"line":166,"address":[8829077,8829056],"length":1,"stats":{"Line":2}},{"line":169,"address":[11208222],"length":1,"stats":{"Line":1}},{"line":171,"address":[8828855],"length":1,"stats":{"Line":1}},{"line":173,"address":[11208342],"length":1,"stats":{"Line":1}},{"line":175,"address":[8828977],"length":1,"stats":{"Line":1}},{"line":179,"address":[11208544,11209622,11209675],"length":1,"stats":{"Line":1}},{"line":185,"address":[11208937,11208785,11208587],"length":1,"stats":{"Line":2}},{"line":187,"address":[11208819,11208962],"length":1,"stats":{"Line":2}},{"line":188,"address":[8829534],"length":1,"stats":{"Line":1}},{"line":189,"address":[11209035,11209712,11210170,11210138],"length":1,"stats":{"Line":2}},{"line":190,"address":[8830235,8830656,8830677],"length":1,"stats":{"Line":3}},{"line":191,"address":[11209770],"length":1,"stats":{"Line":1}},{"line":192,"address":[8830295],"length":1,"stats":{"Line":1}},{"line":193,"address":[11209888],"length":1,"stats":{"Line":1}},{"line":194,"address":[11210099],"length":1,"stats":{"Line":1}},{"line":196,"address":[11209152],"length":1,"stats":{"Line":1}},{"line":198,"address":[11210240,11210275],"length":1,"stats":{"Line":2}},{"line":201,"address":[11209276,11209359],"length":1,"stats":{"Line":2}},{"line":202,"address":[11209405],"length":1,"stats":{"Line":1}},{"line":203,"address":[11209477],"length":1,"stats":{"Line":1}}],"covered":61,"coverable":72},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","merkle_sum_prover","circuits","mod.rs"],"content":"pub mod account_circuit;\npub mod merkle_sum_circuit;\n","traces":[],"covered":0,"coverable":0},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","merkle_sum_prover","mod.rs"],"content":"pub mod circuits;\npub mod prover;\npub mod utils;\n","traces":[],"covered":0,"coverable":0},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","merkle_sum_prover","prover.rs"],"content":"use crate::{\n    account::Account,\n    circuit_config::STANDARD_CONFIG,\n    circuit_utils::prove_timing,\n    merkle_sum_prover::circuits::account_circuit::{AccountSumTargets, AccountTargets},\n    types::{C, D, F},\n};\nuse plonky2::{\n    iop::witness::PartialWitness,\n    plonk::{\n        circuit_builder::CircuitBuilder, circuit_data::CircuitData, proof::ProofWithPublicInputs,\n        prover::prove,\n    },\n};\n\nuse tracing::{error, info};\n\nuse super::circuits::merkle_sum_circuit::MerkleSumTreeTarget;\n\n/// A merkle sum tree prover with a batch id representing its index in the recursive proof tree and a Vec of accounts representing accounts in this batch.\n#[derive(Debug)]\npub struct MerkleSumTreeProver {\n    // batch_id: usize,\n    pub accounts: Vec\u003cAccount\u003e,\n}\n\nimpl MerkleSumTreeProver {\n    /// Sets provided account targets with values from accounts in the prover batch.\n    pub fn set_merkle_tree_targets(\n        \u0026self,\n        pw: \u0026mut PartialWitness\u003cF\u003e,\n        account_targets: \u0026[AccountTargets],\n    ) {\n        for i in 0..self.accounts.len() {\n            // Set account targets\n            account_targets.get(i).unwrap().set_account_targets(self.accounts.get(i).unwrap(), pw);\n        }\n    }\n\n    /// Builds a merkle sum tree targets and returns the account targets to be set with input values.\n    pub fn build_merkle_tree_targets(\n        \u0026self,\n        builder: \u0026mut CircuitBuilder\u003cF, D\u003e,\n    ) -\u003e Vec\u003cAccountTargets\u003e {\n        let mut account_targets: Vec\u003cAccountTargets\u003e = Vec::new();\n\n        for i in 0..self.accounts.len() {\n            // Build account targets\n            let account_target =\n                AccountTargets::new_from_account(self.accounts.get(i).unwrap(), builder);\n            // Set account targets\n            account_targets.push(account_target);\n        }\n\n        let mut account_sum_targets: Vec\u003cAccountSumTargets\u003e = account_targets\n            .iter()\n            .map(|x| AccountSumTargets::from_account_target(x, builder))\n            .collect();\n\n        // build merkle sum tree\n        let _merkle_tree_targets =\n            MerkleSumTreeTarget::build_new_from_account_targets(builder, \u0026mut account_sum_targets);\n\n        account_targets\n    }\n\n    /// Get the merkle sum tree proof of this batch of accounts.\n    pub fn get_proof(\u0026self) -\u003e ProofWithPublicInputs\u003cF, C, D\u003e {\n        let mut builder = CircuitBuilder::\u003cF, D\u003e::new(STANDARD_CONFIG);\n        let mut pw = PartialWitness::\u003cF\u003e::new();\n\n        // Build and set merkle tree targets\n        let account_targets = self.build_merkle_tree_targets(\u0026mut builder);\n        self.set_merkle_tree_targets(\u0026mut pw, \u0026account_targets);\n\n        builder.print_gate_counts(0);\n\n        let mut t = prove_timing();\n        let data = builder.build::\u003cC\u003e();\n\n        let CircuitData { prover_only, common, verifier_only: _ } = \u0026data;\n\n        info!(\"Started Proving\");\n\n        let proof_res = prove(prover_only, common, pw, \u0026mut t);\n\n        match proof_res {\n            Ok(proof) =\u003e {\n                let proof_verification_res = data.verify(proof.clone());\n                match proof_verification_res {\n                    Ok(_) =\u003e proof,\n                    Err(e) =\u003e {\n                        error!(\"Proof verification failed: {:?}\", e);\n                        panic!(\"Proof verification failed!\");\n                    }\n                }\n            }\n            Err(e) =\u003e {\n                error!(\"Proof generation failed: {:?}\", e);\n                panic!(\"Proof generation failed!\");\n            }\n        }\n    }\n\n    /// Get proof with a pre-compiled merkle sum circuit and account targets. In this method we do not need to build the circuit as we use a pre-built circuit.\n    pub fn get_proof_with_circuit_data(\n        \u0026self,\n        account_targets: \u0026[AccountTargets],\n        circuit_data: \u0026CircuitData\u003cF, C, D\u003e,\n    ) -\u003e ProofWithPublicInputs\u003cF, C, D\u003e {\n        let mut pw = PartialWitness::\u003cF\u003e::new();\n        for i in 0..self.accounts.len() {\n            // Build account targets\n            let account_target = account_targets.get(i).unwrap();\n            // Set account targets\n            account_target.set_account_targets(self.accounts.get(i).unwrap(), \u0026mut pw);\n        }\n\n        let CircuitData { prover_only, common, verifier_only: _ } = \u0026circuit_data;\n\n        let mut t = prove_timing();\n        let proof_res = prove(prover_only, common, pw, \u0026mut t);\n\n        match proof_res {\n            Ok(proof) =\u003e {\n                let proof_verification_res = circuit_data.verify(proof.clone());\n                match proof_verification_res {\n                    Ok(_) =\u003e proof,\n                    Err(e) =\u003e {\n                        error!(\"Proof verification failed: {:?}\", e);\n                        panic!(\"Proof verification failed!\");\n                    }\n                }\n            }\n            Err(e) =\u003e {\n                error!(\"Proof generation failed: {:?}\", e);\n                panic!(\"Proof generation failed!\");\n            }\n        }\n    }\n\n    /// Get the merkle sum tree proof of this batch of accounts and the circuit data of the corresponding proof.\n    pub fn get_proof_and_circuit_data(\n        \u0026self,\n    ) -\u003e (ProofWithPublicInputs\u003cF, C, D\u003e, CircuitData\u003cF, C, D\u003e) {\n        let mut builder = CircuitBuilder::\u003cF, D\u003e::new(STANDARD_CONFIG);\n        let mut pw = PartialWitness::\u003cF\u003e::new();\n\n        // Build and set merkle tree targets\n        let account_targets = self.build_merkle_tree_targets(\u0026mut builder);\n        self.set_merkle_tree_targets(\u0026mut pw, \u0026account_targets);\n\n        builder.print_gate_counts(0);\n\n        let data = builder.build::\u003cC\u003e();\n\n        let CircuitData { prover_only, common, verifier_only: _ } = \u0026data;\n\n        tracing::debug!(\"Starting proving!\");\n\n        let mut t = prove_timing();\n        let proof_res = prove(prover_only, common, pw, \u0026mut t);\n\n        match proof_res {\n            Ok(proof) =\u003e {\n                let proof_verification_res = data.verify(proof.clone());\n                match proof_verification_res {\n                    Ok(_) =\u003e (proof, data),\n                    Err(e) =\u003e {\n                        error!(\"Proof verification failed: {:?}\", e);\n                        panic!(\"Proof verification failed!\");\n                    }\n                }\n            }\n            Err(e) =\u003e {\n                error!(\"Proof generation failed: {:?}\", e);\n                panic!(\"Proof generation failed!\");\n            }\n        }\n    }\n}\n\n#[cfg(test)]\npub mod test {\n    use crate::{\n        circuit_utils::run_circuit_test,\n        parser::{FileManager, JsonFileManager},\n    };\n\n    use super::MerkleSumTreeProver;\n\n    #[test]\n    pub fn test_build_and_set_merkle_targets() {\n        run_circuit_test(|builder, pw| {\n            let path = \"../../test-data/batch0.json\";\n            let fm = FileManager {};\n            let tokens = vec![\"BTC\".to_owned(), \"ETH\".to_owned()];\n            let accounts = fm.read_json_into_accounts_vec(path, \u0026tokens);\n\n            let prover = MerkleSumTreeProver {\n                // batch_id: 0,\n                accounts,\n            };\n\n            // Build and set merkle tree targets\n            let account_targets = prover.build_merkle_tree_targets(builder);\n            prover.set_merkle_tree_targets(pw, \u0026account_targets);\n        });\n    }\n\n    #[test]\n    pub fn test_get_proof() {\n        let path = \"../../test-data/batch0.json\";\n        let fm = FileManager {};\n        let tokens = vec![\"BTC\".to_owned(), \"ETH\".to_owned()];\n        let accounts = fm.read_json_into_accounts_vec(path, \u0026tokens);\n        let prover = MerkleSumTreeProver {\n            // batch_id: 0,\n            accounts,\n        };\n\n        let _proof = prover.get_proof();\n    }\n}\n","traces":[{"line":29,"address":[8830768],"length":1,"stats":{"Line":1}},{"line":34,"address":[11395023,11395099],"length":1,"stats":{"Line":2}},{"line":36,"address":[11395114,11395274,11395190],"length":1,"stats":{"Line":3}},{"line":41,"address":[11395296,11395956,11396130],"length":1,"stats":{"Line":1}},{"line":45,"address":[11395348],"length":1,"stats":{"Line":1}},{"line":47,"address":[11395389,11395457,11395611],"length":1,"stats":{"Line":3}},{"line":49,"address":[8831396,8831708,8831811],"length":1,"stats":{"Line":3}},{"line":52,"address":[11396098],"length":1,"stats":{"Line":1}},{"line":55,"address":[11395574,11395666],"length":1,"stats":{"Line":2}},{"line":57,"address":[11396211,11396176],"length":1,"stats":{"Line":2}},{"line":61,"address":[8831504,8831584],"length":1,"stats":{"Line":2}},{"line":64,"address":[11395863],"length":1,"stats":{"Line":1}},{"line":68,"address":[8831952,8837638,8836201],"length":1,"stats":{"Line":1}},{"line":69,"address":[11396294],"length":1,"stats":{"Line":1}},{"line":70,"address":[11396456],"length":1,"stats":{"Line":1}},{"line":73,"address":[11396524],"length":1,"stats":{"Line":1}},{"line":74,"address":[11396697,11396597],"length":1,"stats":{"Line":2}},{"line":76,"address":[11396716],"length":1,"stats":{"Line":1}},{"line":78,"address":[11396739],"length":1,"stats":{"Line":1}},{"line":79,"address":[11396774],"length":1,"stats":{"Line":1}},{"line":81,"address":[11396847],"length":1,"stats":{"Line":1}},{"line":83,"address":[11397091,11397836,11398109,11397507,11398033,11397706],"length":1,"stats":{"Line":5}},{"line":85,"address":[11397909],"length":1,"stats":{"Line":1}},{"line":87,"address":[11398422],"length":1,"stats":{"Line":1}},{"line":88,"address":[11398457],"length":1,"stats":{"Line":1}},{"line":89,"address":[11398740,11398511],"length":1,"stats":{"Line":2}},{"line":90,"address":[11398791],"length":1,"stats":{"Line":1}},{"line":91,"address":[11398828],"length":1,"stats":{"Line":1}},{"line":92,"address":[11398888],"length":1,"stats":{"Line":0}},{"line":93,"address":[11399153,11400088,11400279,11400024,11399768,11399898,11399569],"length":1,"stats":{"Line":0}},{"line":94,"address":[11399963,11400529],"length":1,"stats":{"Line":0}},{"line":98,"address":[11398533],"length":1,"stats":{"Line":0}},{"line":99,"address":[11401333,11401705,11401034,11400639,11401450,11401514,11401221],"length":1,"stats":{"Line":0}},{"line":100,"address":[11401955,11401389],"length":1,"stats":{"Line":0}},{"line":106,"address":[11402048,11404733,11406432],"length":1,"stats":{"Line":1}},{"line":111,"address":[11402127],"length":1,"stats":{"Line":1}},{"line":112,"address":[11402244,11402474,11402176],"length":1,"stats":{"Line":3}},{"line":114,"address":[11402498,11406260],"length":1,"stats":{"Line":2}},{"line":116,"address":[11406268,11406408],"length":1,"stats":{"Line":2}},{"line":119,"address":[11402385],"length":1,"stats":{"Line":1}},{"line":121,"address":[11402439,11402544],"length":1,"stats":{"Line":2}},{"line":122,"address":[11402552],"length":1,"stats":{"Line":1}},{"line":124,"address":[11402627],"length":1,"stats":{"Line":1}},{"line":125,"address":[8838274],"length":1,"stats":{"Line":1}},{"line":126,"address":[8838553,8838336],"length":1,"stats":{"Line":2}},{"line":127,"address":[8838600],"length":1,"stats":{"Line":1}},{"line":128,"address":[11403033],"length":1,"stats":{"Line":1}},{"line":129,"address":[8838695],"length":1,"stats":{"Line":0}},{"line":130,"address":[11404050,11404452,11404258,11403920,11403721,11404182,11403305],"length":1,"stats":{"Line":0}},{"line":131,"address":[11404115,11404705],"length":1,"stats":{"Line":0}},{"line":135,"address":[11402738],"length":1,"stats":{"Line":0}},{"line":136,"address":[11405219,11404815,11405890,11405406,11405518,11405699,11405635],"length":1,"stats":{"Line":0}},{"line":137,"address":[8841732,8841170],"length":1,"stats":{"Line":0}},{"line":143,"address":[11406464,11410941,11412412],"length":1,"stats":{"Line":0}},{"line":146,"address":[8842102],"length":1,"stats":{"Line":0}},{"line":147,"address":[11406688],"length":1,"stats":{"Line":0}},{"line":150,"address":[8842332],"length":1,"stats":{"Line":0}},{"line":151,"address":[11406829,11406929],"length":1,"stats":{"Line":0}},{"line":153,"address":[8842520],"length":1,"stats":{"Line":0}},{"line":155,"address":[11406971],"length":1,"stats":{"Line":0}},{"line":157,"address":[11407052],"length":1,"stats":{"Line":0}},{"line":159,"address":[11407709,11407908,11407293,11408038,11408239,11408163],"length":1,"stats":{"Line":0}},{"line":161,"address":[11408103,11408568],"length":1,"stats":{"Line":0}},{"line":162,"address":[11408576],"length":1,"stats":{"Line":0}},{"line":164,"address":[11408659],"length":1,"stats":{"Line":0}},{"line":165,"address":[11408694],"length":1,"stats":{"Line":0}},{"line":166,"address":[8844296,8844529],"length":1,"stats":{"Line":0}},{"line":167,"address":[11409028],"length":1,"stats":{"Line":0}},{"line":168,"address":[8844593],"length":1,"stats":{"Line":0}},{"line":169,"address":[11409291],"length":1,"stats":{"Line":0}},{"line":170,"address":[11410408,11410282,11410152,11410663,11409537,11409953,11410472],"length":1,"stats":{"Line":0}},{"line":171,"address":[11410347,11410913],"length":1,"stats":{"Line":0}},{"line":175,"address":[11408770],"length":1,"stats":{"Line":0}},{"line":176,"address":[11411898,11411834,11412089,11411418,11411717,11411605,11411023],"length":1,"stats":{"Line":0}},{"line":177,"address":[11412339,11411773],"length":1,"stats":{"Line":0}}],"covered":41,"coverable":75},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","merkle_sum_prover","utils.rs"],"content":"use plonky2::{\n    hash::{\n        hash_types::{HashOut, RichField},\n        poseidon::PoseidonHash,\n    },\n    plonk::config::Hasher,\n};\nuse plonky2_field::extension::Extendable;\n\npub fn hash_2_subhashes\u003cF: RichField + Extendable\u003cD\u003e, const D: usize\u003e(\n    hash_1: \u0026HashOut\u003cF\u003e,\n    hash_2: \u0026HashOut\u003cF\u003e,\n) -\u003e HashOut\u003cF\u003e {\n    #[allow(clippy::useless_vec)]\n    let inputs = vec![hash_1.elements.to_vec(), hash_2.elements.to_vec()].concat();\n    hash_inputs(inputs)\n}\n\npub fn hash_inputs\u003cF: RichField\u003e(inputs: Vec\u003cF\u003e) -\u003e HashOut\u003cF\u003e {\n    let hash = PoseidonHash::hash_no_pad(inputs.as_slice());\n    hash\n}\n","traces":[{"line":10,"address":[11883624,11883653,11883056],"length":1,"stats":{"Line":1}},{"line":15,"address":[],"length":0,"stats":{"Line":1}},{"line":16,"address":[],"length":0,"stats":{"Line":1}},{"line":19,"address":[],"length":0,"stats":{"Line":1}},{"line":20,"address":[],"length":0,"stats":{"Line":2}},{"line":21,"address":[],"length":0,"stats":{"Line":0}}],"covered":5,"coverable":6},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","merkle_sum_tree.rs"],"content":"use plonky2::{hash::hash_types::HashOut, util::log2_strict};\n\nuse crate::{\n    account::Account,\n    merkle_sum_prover::utils::hash_2_subhashes,\n    types::{D, F},\n};\n\nuse plonky2_field::types::Field;\n\n#[derive(Debug, Clone, Copy, PartialEq)]\npub struct MerkleSumNode {\n    pub sum_equity: F,\n    pub sum_debt: F,\n    pub hash: HashOut\u003cF\u003e,\n}\n\nimpl MerkleSumNode {\n    /// Get a new merkle sum node given a account.\n    pub fn new_from_account(account: \u0026Account) -\u003e MerkleSumNode {\n        let sum_equity = account.equity.iter().fold(F::ZERO, |acc, x| acc + *x);\n\n        let sum_debt = account.debt.iter().fold(F::ZERO, |acc, x| acc + *x);\n\n        let hash = account.get_hash();\n        MerkleSumNode { hash, sum_equity, sum_debt }\n    }\n\n    /// Get a new MerkleSumNode given its 2 child nodes.\n    pub fn new_from_children_nodes(node1: \u0026MerkleSumNode, node2: \u0026MerkleSumNode) -\u003e MerkleSumNode {\n        let hash = hash_2_subhashes::\u003cF, D\u003e(\u0026node1.hash, \u0026node2.hash);\n        let sum_equity = node1.sum_equity + node2.sum_equity;\n        let sum_debt = node1.sum_debt + node2.sum_debt;\n        MerkleSumNode { hash, sum_equity, sum_debt }\n    }\n}\n\n/// Struct representing a merkle sum tree, it is represented as a vector of Merkle Sum Nodes.\n#[derive(Debug, Clone)]\npub struct MerkleSumTree {\n    pub merkle_sum_tree: Vec\u003cMerkleSumNode\u003e,\n    pub tree_depth: usize,\n}\n\nimpl MerkleSumTree {\n    pub fn new_tree_from_accounts(accounts: \u0026[Account]) -\u003e MerkleSumTree {\n        let num_leaves = accounts.len();\n        let tree_depth = log2_strict(num_leaves);\n        let mut merkle_sum_tree: Vec\u003cMerkleSumNode\u003e = Vec::new();\n\n        for i in 0..num_leaves * 2 - 1 {\n            if i \u003c num_leaves {\n                let acct = accounts.get(i).unwrap();\n                merkle_sum_tree.push(MerkleSumNode::new_from_account(acct));\n            } else {\n                let left_child_index = 2 * (i - num_leaves);\n                let right_child_index = 2 * (i - num_leaves) + 1;\n                let left_child = merkle_sum_tree.get(left_child_index).unwrap();\n                let right_child = merkle_sum_tree.get(right_child_index).unwrap();\n                let node = MerkleSumNode::new_from_children_nodes(left_child, right_child);\n                merkle_sum_tree.push(node);\n            }\n        }\n\n        MerkleSumTree { merkle_sum_tree, tree_depth }\n    }\n\n    pub fn get_root(\u0026self) -\u003e MerkleSumNode {\n        *self.merkle_sum_tree.last().unwrap()\n    }\n\n    pub fn get_from_index(\u0026self, index: usize) -\u003e Option\u003c\u0026MerkleSumNode\u003e {\n        return self.merkle_sum_tree.get(index);\n    }\n}\n\n#[cfg(test)]\npub mod test {\n    use crate::{\n        account::gen_accounts_with_random_data,\n        circuit_config::STANDARD_CONFIG,\n        merkle_sum_prover::{\n            circuits::merkle_sum_circuit::{build_merkle_sum_tree_circuit, MerkleSumNodeTarget},\n            prover::MerkleSumTreeProver,\n        },\n        parser::{FileManager, JsonFileManager},\n        types::F,\n    };\n    use plonky2::hash::hash_types::HashOut;\n    use plonky2_field::types::Field;\n\n    use super::{MerkleSumNode, MerkleSumTree};\n\n    #[test]\n    pub fn test_new_from_account() {\n        let path = \"../../test-data/batch0.json\";\n        let fm = FileManager {};\n        let tokens = vec![\"BTC\".to_owned(), \"ETH\".to_owned()];\n        let accounts = fm.read_json_into_accounts_vec(path, \u0026tokens);\n\n        let account = accounts.get(0).unwrap();\n        let node = MerkleSumNode::new_from_account(account);\n        let btc_amount = 9195990;\n        let eth_amount = 0;\n        assert_eq!(node.sum_equity, F::from_canonical_u64(btc_amount + eth_amount));\n        assert_eq!(node.sum_debt, F::from_canonical_u64(1));\n    }\n\n    #[test]\n    pub fn test_new_from_children_nodes() {\n        let fm = FileManager {};\n        let path = \"../../test-data/batch0.json\";\n        let tokens = vec![\"BTC\".to_owned(), \"ETH\".to_owned()];\n        let accounts = fm.read_json_into_accounts_vec(path, \u0026tokens);\n\n        let account1 = accounts.get(0).unwrap();\n        let node1 = MerkleSumNode::new_from_account(account1);\n        let acc1_btc_amount = 9195990;\n        let acc1_eth_amount = 0;\n        let acc2_btc_amount = 1729750;\n        let acc2_eth_amount = 0;\n\n        let account2 = accounts.get(1).unwrap();\n        let node2 = MerkleSumNode::new_from_account(account2);\n        let node3 = MerkleSumNode::new_from_children_nodes(\u0026node1, \u0026node2);\n        assert_eq!(\n            node3.sum_equity,\n            F::from_canonical_u64(\n                acc1_btc_amount + acc1_eth_amount + acc2_btc_amount + acc2_eth_amount\n            ),\n        );\n        assert_eq!(node3.sum_debt, F::from_canonical_u64(2));\n    }\n\n    #[test]\n    pub fn test_new_tree_from_accounts() {\n        let fm = FileManager {};\n        let path = \"../../test-data/batch0.json\";\n        let tokens = vec![\"BTC\".to_owned(), \"ETH\".to_owned()];\n        let accounts = fm.read_json_into_accounts_vec(path, \u0026tokens);\n        let mut sum_equity = F::ZERO;\n        let mut sum_debt = F::ZERO;\n\n        for i in 0..accounts.len() {\n            let account = accounts.get(i).unwrap();\n            account.equity.iter().for_each(|x| {\n                sum_equity = sum_equity + *x;\n            });\n\n            account.debt.iter().for_each(|x| {\n                sum_debt = sum_debt + *x;\n            });\n        }\n\n        let tree = MerkleSumTree::new_tree_from_accounts(\u0026accounts);\n\n        let root = tree.get_root();\n        assert_eq!(root.sum_equity, sum_equity);\n        assert_eq!(root.sum_debt, sum_debt);\n    }\n\n    #[test]\n    fn test_identical_root_hash_with_proving() {\n        let batch_num = 4;\n        let num_assets = 4;\n        let accounts = gen_accounts_with_random_data(4, num_assets);\n\n        let merkle_sum_tree = MerkleSumTree::new_tree_from_accounts(\u0026accounts);\n\n        let (batch_circuit, account_targets) =\n            build_merkle_sum_tree_circuit(batch_num, num_assets, STANDARD_CONFIG);\n\n        let prover = MerkleSumTreeProver { accounts };\n        let proof = prover.get_proof_with_circuit_data(\u0026account_targets, \u0026batch_circuit);\n\n        let hash_offset = MerkleSumNodeTarget::pub_input_root_hash_offset();\n        let proof_root_hash = HashOut::\u003cF\u003e::from_partial(\u0026proof.public_inputs[hash_offset]);\n        assert_eq!(proof_root_hash, merkle_sum_tree.get_root().hash);\n    }\n}\n","traces":[{"line":20,"address":[11412448],"length":1,"stats":{"Line":1}},{"line":21,"address":[11412480,11412704,11412672],"length":1,"stats":{"Line":3}},{"line":23,"address":[11412533,11412720,11412752],"length":1,"stats":{"Line":3}},{"line":25,"address":[11412586],"length":1,"stats":{"Line":1}},{"line":30,"address":[10079024],"length":1,"stats":{"Line":1}},{"line":31,"address":[11412801],"length":1,"stats":{"Line":1}},{"line":32,"address":[11412821],"length":1,"stats":{"Line":1}},{"line":33,"address":[11412853],"length":1,"stats":{"Line":1}},{"line":46,"address":[11412944,11414339],"length":1,"stats":{"Line":1}},{"line":47,"address":[11413010],"length":1,"stats":{"Line":1}},{"line":48,"address":[11413018],"length":1,"stats":{"Line":1}},{"line":49,"address":[11413040],"length":1,"stats":{"Line":1}},{"line":51,"address":[11413186,11413472,11413062],"length":1,"stats":{"Line":3}},{"line":52,"address":[11413493],"length":1,"stats":{"Line":1}},{"line":53,"address":[10079801,10080503],"length":1,"stats":{"Line":2}},{"line":54,"address":[11414288],"length":1,"stats":{"Line":1}},{"line":56,"address":[11413511,11413659,11413574],"length":1,"stats":{"Line":2}},{"line":57,"address":[11413810,11413685,11413641],"length":1,"stats":{"Line":2}},{"line":58,"address":[10080036,10080181,10080089],"length":1,"stats":{"Line":3}},{"line":59,"address":[11413950,11414095],"length":1,"stats":{"Line":2}},{"line":60,"address":[11414103],"length":1,"stats":{"Line":1}},{"line":61,"address":[11414122],"length":1,"stats":{"Line":1}},{"line":68,"address":[11414368],"length":1,"stats":{"Line":1}},{"line":69,"address":[11414472,11414400],"length":1,"stats":{"Line":2}},{"line":72,"address":[11414496],"length":1,"stats":{"Line":0}},{"line":73,"address":[11414514],"length":1,"stats":{"Line":0}}],"covered":24,"coverable":26},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","parser.rs"],"content":"use super::account::{gen_accounts_with_random_data, Account};\nuse crate::types::{ASSETS_KEY, F};\nuse plonky2_field::types::Field;\nuse serde_json::{Map, Value};\nuse std::{\n    fs,\n    fs::File,\n    io::BufReader,\n    ops::Div,\n    path::{Path, PathBuf},\n};\nuse tracing::{debug, error, info};\n\n#[derive(Debug, Clone)]\npub struct FilesCfg {\n    pub dir: PathBuf,\n    pub batch_size: usize,\n    pub tokens: Vec\u003cString\u003e,\n}\n\npub trait AccountParser {\n    fn read_n_accounts(\n        \u0026mut self,\n        offset: usize,\n        n: usize,\n        fm: \u0026impl JsonFileManager,\n    ) -\u003e Vec\u003cAccount\u003e;\n    fn total_num_of_users(\u0026self) -\u003e usize;\n}\n\n#[derive(Debug)]\npub struct FileManager {}\n\npub trait JsonFileManager {\n    fn list_json_files(\u0026self, dir: \u0026Path) -\u003e std::io::Result\u003cVec\u003cPathBuf\u003e\u003e;\n    fn read_json_into_accounts_vec(\u0026self, path: \u0026str, tokens: \u0026Vec\u003cString\u003e) -\u003e Vec\u003cAccount\u003e;\n    fn read_json_file_into_map(\u0026self, path: \u0026str) -\u003e Vec\u003cMap\u003cString, Value\u003e\u003e;\n}\n\nimpl JsonFileManager for FileManager {\n    fn list_json_files(\u0026self, dir: \u0026Path) -\u003e std::io::Result\u003cVec\u003cPathBuf\u003e\u003e {\n        let mut json_files = Vec::new();\n        if dir.is_dir() {\n            for entry in fs::read_dir(dir)? {\n                let entry = entry?;\n                let path = entry.path();\n                if path.is_file() {\n                    if let Some(extension) = path.extension() {\n                        if extension == \"json\" {\n                            json_files.push(path);\n                        }\n                    }\n                } else if path.is_dir() {\n                    json_files.extend(self.list_json_files(\u0026path)?);\n                }\n            }\n        }\n        json_files.sort();\n        Ok(json_files)\n    }\n\n    /// Read a json file and return the vec of associated accounts.\n    /// tokens is a list of all possible token names. It is used to fill the account with zero for missing tokens.\n    fn read_json_into_accounts_vec(\u0026self, path: \u0026str, tokens: \u0026Vec\u003cString\u003e) -\u003e Vec\u003cAccount\u003e {\n        let parsed_data = self.read_json_file_into_map(path);\n        parse_exchange_state(\u0026parsed_data, tokens)\n    }\n\n    /// Reads a json file into a json string.\n    fn read_json_file_into_map(\u0026self, path: \u0026str) -\u003e Vec\u003cMap\u003cString, Value\u003e\u003e {\n        let file = File::open(path);\n        match file {\n            Ok(f) =\u003e {\n                let reader = BufReader::new(f);\n                // Deserialize the binary data to a struct\n                serde_json::from_reader(reader).expect(\"Unable to parse Json Data\")\n            }\n            Err(e) =\u003e {\n                error!(\"file open error, {:?}\", e);\n                panic!(\"File not found at specified path\");\n            }\n        }\n    }\n}\n\n#[derive(Debug)]\npub struct FileAccountReader {\n    pub cfg: FilesCfg,\n    pub total_num_of_batches: usize,\n    pub total_num_of_users: usize,\n    num_of_docs: usize,\n    num_of_batches_per_doc: usize,\n    file_idx: usize,\n    offset: usize, // an offset to the buffered_accounts\n    buffered_accounts: Vec\u003cAccount\u003e,\n    last_doc_accounts: Vec\u003cAccount\u003e, // we keep this avoiding double loading of last doc\n    docs: Vec\u003cPathBuf\u003e,\n}\n\nimpl FileAccountReader {\n    pub fn new(cfg: FilesCfg, fm: \u0026impl JsonFileManager) -\u003e Self {\n        let user_data_path = std::path::Path::new(\u0026(cfg.dir));\n        if !user_data_path.exists() {\n            panic!(\"dir: {:?} does not exist\", user_data_path);\n        }\n        let json_files = fm.list_json_files(user_data_path);\n        let mut parser = Self {\n            buffered_accounts: vec![],\n            last_doc_accounts: vec![],\n            file_idx: 0,\n            offset: 0,\n            num_of_docs: 0,\n            cfg: cfg.clone(),\n            num_of_batches_per_doc: 0,\n            total_num_of_users: 0,\n            total_num_of_batches: 0,\n            docs: vec![],\n        };\n\n        match json_files {\n            Ok(docs) =\u003e {\n                info!(\"files: {:?}\", docs);\n                let doc_len = docs.len();\n                parser.docs = docs;\n                parser.num_of_docs = doc_len;\n                if doc_len \u003c 1 {\n                    panic!(\"no json files under the folder: {:?}\", user_data_path);\n                }\n                let first_doc_accounts =\n                    fm.read_json_into_accounts_vec(parser.docs[0].to_str().unwrap(), \u0026cfg.tokens);\n                let first_doc_accounts_len = first_doc_accounts.len();\n\n                if doc_len \u003e 1 {\n                    assert_eq!(first_doc_accounts_len % parser.cfg.batch_size, 0);\n                }\n                parser.num_of_batches_per_doc = first_doc_accounts_len.div(parser.cfg.batch_size);\n                parser.buffered_accounts = first_doc_accounts;\n                parser.file_idx = 0;\n\n                if doc_len \u003e 1 {\n                    let last_doc_accounts = fm.read_json_into_accounts_vec(\n                        parser.docs[doc_len - 1].to_str().unwrap(),\n                        \u0026cfg.tokens,\n                    );\n                    assert!(last_doc_accounts.len() \u003c= first_doc_accounts_len);\n                    parser.last_doc_accounts = last_doc_accounts;\n                }\n\n                let total_num_of_users = if doc_len == 1 {\n                    first_doc_accounts_len\n                } else {\n                    (doc_len - 1) * first_doc_accounts_len + parser.last_doc_accounts.len()\n                };\n\n                let num_of_batches = total_num_of_users.div_ceil(parser.cfg.batch_size);\n                parser.total_num_of_users = total_num_of_users;\n                parser.total_num_of_batches = num_of_batches;\n            }\n            Err(e) =\u003e panic!(\"list json files err: {:?}\", e),\n        }\n\n        parser\n    }\n\n    pub fn log_state(\u0026self) {\n        debug!(\"cfg: {:?},\\n num_of_files: {:?},\\n num_of_batches_per_doc: {:?},\\n file_idx: {:?},\\n offset: {:?},\\n total_num_of_users: {:?},\\n total_num_of_batches: {:?}\",\n        self.cfg, self.num_of_docs, self.num_of_batches_per_doc, self.file_idx, self.offset, self.total_num_of_users, self.total_num_of_batches);\n    }\n}\n\nimpl AccountParser for FileAccountReader {\n    fn total_num_of_users(\u0026self) -\u003e usize {\n        self.total_num_of_users\n    }\n\n    /// `offset` is to the global user vectors;\n    fn read_n_accounts(\n        \u0026mut self,\n        offset: usize,\n        n: usize,\n        fm: \u0026impl JsonFileManager,\n    ) -\u003e Vec\u003cAccount\u003e {\n        debug!(\"read with offset: {:?}, account_num: {:?}\", offset, n);\n        self.log_state();\n        // to make it simpler, we assume only read by a multiple of batch size;\n        // if try to read cross multiple docs; simply can run this function multiple times;\n        assert!(n % self.cfg.batch_size == 0);\n        let min_offset: usize = self.file_idx * self.cfg.batch_size * self.num_of_batches_per_doc;\n        assert!(offset \u003e= min_offset);\n\n        let acct_len =\n            if offset + n \u003e self.total_num_of_users { self.total_num_of_users - offset } else { n };\n        let num_of_tokens = self.cfg.tokens.len();\n        let mut result = vec![Account::get_empty_account(num_of_tokens); acct_len];\n        if (n + offset - min_offset) \u003c= (self.buffered_accounts.len()) {\n            // we have enough account in the buffer\n            result.clone_from_slice(\u0026self.buffered_accounts[self.offset..(self.offset + n)]);\n            self.offset += n;\n        } else {\n            let mut filled_len = 0;\n\n            if self.offset \u003c self.buffered_accounts.len() {\n                let filled_len = self.buffered_accounts.len() - self.offset;\n                result[0..filled_len].clone_from_slice(\u0026self.buffered_accounts[(self.offset)..]);\n            }\n            let mut missing_len = result.len() - (self.buffered_accounts.len() - self.offset);\n            debug!(\n                \"result len: {:?}, self.offset: {:?}, missing_len: {:?}\",\n                result.len(),\n                self.offset,\n                missing_len\n            );\n\n            while missing_len \u003e 0 {\n                let to_read =\n                    std::cmp::min(self.num_of_batches_per_doc * self.cfg.batch_size, missing_len);\n                if self.file_idx \u003c (self.num_of_docs - 1) {\n                    // load the next file; TODO: assert_eq!(accounts_len, last_doc_account_num);\n                    self.file_idx += 1;\n                    self.buffered_accounts = fm.read_json_into_accounts_vec(\n                        self.docs[self.file_idx].to_str().unwrap(),\n                        \u0026self.cfg.tokens,\n                    );\n                    result[filled_len..(filled_len + to_read)]\n                        .clone_from_slice(\u0026self.buffered_accounts[0..to_read]);\n                    filled_len += to_read;\n                    self.offset = to_read;\n                } else {\n                    self.offset += result.len();\n                    break;\n                }\n                missing_len -= to_read;\n            }\n        }\n        result\n    }\n}\n\n/// Parses the exchanges state at some snapshot and returns.\nfn parse_exchange_state(\n    parsed_data: \u0026Vec\u003cMap\u003cString, Value\u003e\u003e,\n    tokens: \u0026Vec\u003cString\u003e,\n) -\u003e Vec\u003cAccount\u003e {\n    let mut accounts_data: Vec\u003cAccount\u003e = Vec::new();\n    for obj in parsed_data {\n        accounts_data.push(parse_account_state(obj, tokens));\n    }\n    accounts_data\n}\n\n/// Parses the exchanges state at some snapshot and returns.\npub fn parse_account_state(parsed_data: \u0026Map\u003cString, Value\u003e, tokens: \u0026Vec\u003cString\u003e) -\u003e Account {\n    let account_id = parsed_data\n        .get(\"id\")\n        .expect(format!(\"Account {:?} dont have key `id`\", parsed_data).as_str())\n        .as_str()\n        .unwrap();\n\n    let token_map = parsed_data\n        .get(ASSETS_KEY)\n        .expect(format!(\"Account {:?} dont have key `tokens`\", parsed_data).as_str())\n        .as_object()\n        .unwrap();\n    let mut parsed_equities = Vec::new();\n    let mut parsed_debts = Vec::new();\n\n    for token in tokens.iter() {\n        let parsed_token = token_map.get(token);\n        if parsed_token.is_none() {\n            continue;\n        }\n\n        let parsed_val = parsed_token.unwrap().as_str().unwrap().parse::\u003ci64\u003e().unwrap();\n        let abs_val = parsed_val.abs() as u64;\n\n        if parsed_val \u003c 0 {\n            parsed_debts.push(F::from_canonical_u64(abs_val));\n            parsed_equities.push(F::ZERO);\n        } else {\n            parsed_equities.push(F::from_canonical_u64(abs_val));\n            parsed_debts.push(F::ZERO);\n        }\n    }\n\n    Account { id: account_id.into(), equity: parsed_equities, debt: parsed_debts }\n}\n\npub struct RandomAccountParser {\n    pub total_num_of_users: usize,\n    pub num_of_tokens: usize,\n}\nimpl RandomAccountParser {\n    pub fn new(total_num_of_users: usize, num_of_tokens: usize) -\u003e Self {\n        RandomAccountParser { total_num_of_users: total_num_of_users, num_of_tokens: num_of_tokens }\n    }\n}\n\nimpl AccountParser for RandomAccountParser {\n    fn total_num_of_users(\u0026self) -\u003e usize {\n        self.total_num_of_users\n    }\n    /// `offset` is to the global user vectors;\n    fn read_n_accounts(\n        \u0026mut self,\n        offset: usize,\n        n: usize,\n        _: \u0026impl JsonFileManager,\n    ) -\u003e Vec\u003cAccount\u003e {\n        let n = std::cmp::min(n, self.total_num_of_users - offset);\n        gen_accounts_with_random_data(n, self.num_of_tokens)\n    }\n}\n\n#[cfg(test)]\nmod test {\n\n    use crate::{\n        account::Account,\n        parser::{parse_exchange_state, FileManager, FilesCfg},\n    };\n    use mockall::*;\n    use serde_json::{Map, Value};\n    use std::{\n        path::{Path, PathBuf},\n        str::FromStr,\n    };\n\n    use super::{AccountParser, FileAccountReader, JsonFileManager};\n\n    #[test]\n    pub fn test_read_json_file_into_map() {\n        let fm = FileManager {};\n        let path = \"../../test-data/batch0.json\";\n        let maps = fm.read_json_file_into_map(path);\n\n        let id_0 = \"0ca5a8a06ad2f88d6b95d219d1018ccc7c1777c557b1a2a72db413eef6264bb0\";\n        let parsed_id_0 = maps.get(0).unwrap().get(\"id\").unwrap();\n        assert_eq!(id_0, parsed_id_0);\n\n        let id_1 = \"1152272906d212dad6419261700a794687b371e8f9b8ec0ecb0f6023a9b3332b\";\n        let parsed_id_1 = maps.get(1).unwrap().get(\"id\").unwrap();\n        assert_eq!(id_1, parsed_id_1);\n    }\n\n    #[test]\n    pub fn test_parse_exchange_state() {\n        let fm = FileManager {};\n        let path = \"../../test-data/batch0.json\";\n        let maps = fm.read_json_file_into_map(path);\n        let tokens = vec![\"BTC\".to_string(), \"ETH\".to_string()];\n        let accounts = parse_exchange_state(\u0026maps, \u0026tokens);\n\n        let id_0 = \"0ca5a8a06ad2f88d6b95d219d1018ccc7c1777c557b1a2a72db413eef6264bb0\";\n        let account_0 = accounts.get(0).unwrap();\n        assert_eq!(id_0, account_0.id);\n\n        let id_1 = \"1152272906d212dad6419261700a794687b371e8f9b8ec0ecb0f6023a9b3332b\";\n        let account_1 = accounts.get(1).unwrap();\n        assert_eq!(id_1, account_1.id);\n    }\n\n    #[test]\n    pub fn test_read_json_into_accounts_vec() {\n        let fm = FileManager {};\n        let path = \"../../test-data/batch0.json\";\n        let tokens = vec![\"BTC\".to_string(), \"ETH\".to_string()];\n        let accounts = fm.read_json_into_accounts_vec(\u0026path, \u0026tokens);\n\n        let id_0 = \"0ca5a8a06ad2f88d6b95d219d1018ccc7c1777c557b1a2a72db413eef6264bb0\";\n        let account_0 = accounts.get(0).unwrap();\n        assert_eq!(id_0, account_0.id);\n\n        let id_1 = \"1152272906d212dad6419261700a794687b371e8f9b8ec0ecb0f6023a9b3332b\";\n        let account_1 = accounts.get(1).unwrap();\n        assert_eq!(id_1, account_1.id);\n    }\n\n    mock! {\n      pub FileManager {}\n\n      impl JsonFileManager for FileManager {\n          fn list_json_files(\u0026self, dir: \u0026Path) -\u003e std::io::Result\u003cVec\u003cPathBuf\u003e\u003e;\n          fn read_json_into_accounts_vec(\u0026self, path: \u0026str, tokens : \u0026Vec\u003cString\u003e) -\u003e Vec\u003cAccount\u003e;\n          fn read_json_file_into_map(\u0026self, path: \u0026str) -\u003e Vec\u003cMap\u003cString, Value\u003e\u003e;\n      }\n    }\n\n    #[test]\n    fn test_file_account_reader() {\n        let mut mock_file_manager = MockFileManager::new();\n        mock_file_manager.expect_list_json_files().returning(|_| {\n            let paths = vec![\n                std::path::PathBuf::from_str(\"file0\").unwrap(),\n                std::path::PathBuf::from_str(\"file1\").unwrap(),\n                std::path::PathBuf::from_str(\"file2\").unwrap(),\n                std::path::PathBuf::from_str(\"file3\").unwrap(),\n                std::path::PathBuf::from_str(\"file4\").unwrap(),\n                std::path::PathBuf::from_str(\"file5\").unwrap(),\n            ];\n            Ok(paths)\n        });\n\n        mock_file_manager.expect_read_json_into_accounts_vec().times(1).returning(|_, _| {\n            let accounts = vec![Account::get_empty_account(20); 4];\n            accounts\n        });\n        mock_file_manager.expect_read_json_into_accounts_vec().times(1).returning(|_, _| {\n            let accounts = vec![Account::get_empty_account(20); 3];\n            accounts\n        });\n\n        let dir = tempdir::TempDir::new(\"user_input_test\").unwrap().into_path();\n\n        let mut file_acct_reader = FileAccountReader::new(\n            FilesCfg { dir, batch_size: 4, tokens: vec![\"BTC\".to_owned(), \"ETH\".to_owned()] },\n            \u0026mock_file_manager,\n        );\n        assert_eq!(file_acct_reader.total_num_of_users(), 23);\n\n        mock_file_manager.expect_read_json_into_accounts_vec().times(1).returning(|_, _| {\n            let accounts = vec![Account::get_empty_account(20); 4];\n            accounts\n        });\n        let users = file_acct_reader.read_n_accounts(0, 8, \u0026mock_file_manager);\n        assert_eq!(users.len(), 8);\n\n        mock_file_manager.expect_read_json_into_accounts_vec().times(1).returning(|_, _| {\n            let accounts = vec![Account::get_empty_account(20); 4];\n            accounts\n        });\n        let users = file_acct_reader.read_n_accounts(8, 4, \u0026mock_file_manager);\n        assert_eq!(users.len(), 4);\n\n        mock_file_manager.expect_read_json_into_accounts_vec().times(3).returning(|_, _| {\n            let accounts = vec![Account::get_empty_account(20); 4];\n            accounts\n        });\n        let users = file_acct_reader.read_n_accounts(12, 12, \u0026mock_file_manager);\n        assert_eq!(users.len(), 11);\n    }\n}\n","traces":[{"line":41,"address":[11414544,11416356,11416391],"length":1,"stats":{"Line":0}},{"line":42,"address":[8848023],"length":1,"stats":{"Line":0}},{"line":43,"address":[11414656,11414725],"length":1,"stats":{"Line":0}},{"line":44,"address":[11415054,11414782,11416389,11415087],"length":1,"stats":{"Line":0}},{"line":45,"address":[11415296,11415135,11415456,11416365],"length":1,"stats":{"Line":0}},{"line":46,"address":[8848902,8848790],"length":1,"stats":{"Line":0}},{"line":47,"address":[11415553,11415618],"length":1,"stats":{"Line":0}},{"line":48,"address":[11415676,11416058],"length":1,"stats":{"Line":0}},{"line":49,"address":[11416170],"length":1,"stats":{"Line":0}},{"line":50,"address":[11416213],"length":1,"stats":{"Line":0}},{"line":53,"address":[11415706,11415651],"length":1,"stats":{"Line":0}},{"line":54,"address":[11415758],"length":1,"stats":{"Line":0}},{"line":58,"address":[11415178,11414731],"length":1,"stats":{"Line":0}},{"line":59,"address":[11415197],"length":1,"stats":{"Line":0}},{"line":64,"address":[11416416,11416547],"length":1,"stats":{"Line":1}},{"line":65,"address":[11416454],"length":1,"stats":{"Line":1}},{"line":66,"address":[11416488],"length":1,"stats":{"Line":1}},{"line":70,"address":[8851627,8849888],"length":1,"stats":{"Line":1}},{"line":71,"address":[11416646],"length":1,"stats":{"Line":1}},{"line":72,"address":[11416660],"length":1,"stats":{"Line":1}},{"line":73,"address":[11416673],"length":1,"stats":{"Line":1}},{"line":74,"address":[11416687],"length":1,"stats":{"Line":1}},{"line":76,"address":[11416701],"length":1,"stats":{"Line":1}},{"line":78,"address":[8850087],"length":1,"stats":{"Line":0}},{"line":79,"address":[11417673,11416979,11417790,11417854,11417561,11417374,11418044],"length":1,"stats":{"Line":0}},{"line":80,"address":[11418293,11417729],"length":1,"stats":{"Line":0}},{"line":101,"address":[9295680,9300731,9301076],"length":1,"stats":{"Line":1}},{"line":102,"address":[8851841,8851722],"length":1,"stats":{"Line":2}},{"line":103,"address":[9295877],"length":1,"stats":{"Line":1}},{"line":104,"address":[9296075],"length":1,"stats":{"Line":0}},{"line":106,"address":[9296153,9296040],"length":1,"stats":{"Line":2}},{"line":108,"address":[9296169],"length":1,"stats":{"Line":1}},{"line":109,"address":[9296254],"length":1,"stats":{"Line":1}},{"line":113,"address":[9296330],"length":1,"stats":{"Line":1}},{"line":117,"address":[9296378],"length":1,"stats":{"Line":1}},{"line":120,"address":[9296680],"length":1,"stats":{"Line":1}},{"line":121,"address":[9296719],"length":1,"stats":{"Line":1}},{"line":122,"address":[9298000,9297536,9297735,9298079,9298273,9297120,9297868],"length":1,"stats":{"Line":6}},{"line":123,"address":[9297941,9298534],"length":1,"stats":{"Line":2}},{"line":124,"address":[9298542],"length":1,"stats":{"Line":1}},{"line":125,"address":[9298732],"length":1,"stats":{"Line":1}},{"line":126,"address":[9298740],"length":1,"stats":{"Line":1}},{"line":127,"address":[9300762],"length":1,"stats":{"Line":0}},{"line":129,"address":[9298746,9299118,9298903],"length":1,"stats":{"Line":3}},{"line":131,"address":[9299149,9299233],"length":1,"stats":{"Line":2}},{"line":133,"address":[9299241],"length":1,"stats":{"Line":1}},{"line":134,"address":[9299288],"length":1,"stats":{"Line":1}},{"line":136,"address":[8855182,8855415],"length":1,"stats":{"Line":2}},{"line":137,"address":[9299496],"length":1,"stats":{"Line":1}},{"line":138,"address":[8855609],"length":1,"stats":{"Line":1}},{"line":140,"address":[9299698,9300341],"length":1,"stats":{"Line":2}},{"line":141,"address":[9300008],"length":1,"stats":{"Line":1}},{"line":142,"address":[9299735],"length":1,"stats":{"Line":1}},{"line":143,"address":[8855927],"length":1,"stats":{"Line":1}},{"line":145,"address":[9300035,9300113],"length":1,"stats":{"Line":2}},{"line":146,"address":[8856066],"length":1,"stats":{"Line":1}},{"line":149,"address":[8856465,8855635,8856273],"length":1,"stats":{"Line":2}},{"line":150,"address":[8856265],"length":1,"stats":{"Line":0}},{"line":152,"address":[8856470,8856283,8856354],"length":1,"stats":{"Line":2}},{"line":155,"address":[8856303,8856504],"length":1,"stats":{"Line":2}},{"line":156,"address":[8856512],"length":1,"stats":{"Line":1}},{"line":157,"address":[9300621],"length":1,"stats":{"Line":1}},{"line":159,"address":[9300882,9296933],"length":1,"stats":{"Line":0}},{"line":162,"address":[9300645],"length":1,"stats":{"Line":1}},{"line":165,"address":[11418352],"length":1,"stats":{"Line":1}},{"line":166,"address":[11419582,11419678,11419774,11419866,11419390,11419095,11418822,11419486,11418491,11419294,11418970,11419135,11419039],"length":1,"stats":{"Line":13}},{"line":172,"address":[8858944],"length":1,"stats":{"Line":1}},{"line":173,"address":[8858949],"length":1,"stats":{"Line":1}},{"line":177,"address":[8858960,8865037],"length":1,"stats":{"Line":1}},{"line":183,"address":[9325746,9325038,9325556,9325637,9325390,9326087,9325792],"length":1,"stats":{"Line":7}},{"line":184,"address":[9325680],"length":1,"stats":{"Line":1}},{"line":187,"address":[9326487,9326416,9325694],"length":1,"stats":{"Line":2}},{"line":188,"address":[9326461,9326597,9326531],"length":1,"stats":{"Line":2}},{"line":189,"address":[9326613,9326585],"length":1,"stats":{"Line":1}},{"line":191,"address":[8860986,8860742],"length":1,"stats":{"Line":2}},{"line":193,"address":[9326783],"length":1,"stats":{"Line":1}},{"line":194,"address":[9326804],"length":1,"stats":{"Line":1}},{"line":195,"address":[9327022,9330965,9326929,9326848],"length":1,"stats":{"Line":3}},{"line":197,"address":[9327150,9330763],"length":1,"stats":{"Line":0}},{"line":198,"address":[9330920,9330970],"length":1,"stats":{"Line":0}},{"line":200,"address":[8861183],"length":1,"stats":{"Line":1}},{"line":202,"address":[9327104,9327192],"length":1,"stats":{"Line":2}},{"line":203,"address":[8861318,8861437],"length":1,"stats":{"Line":1}},{"line":204,"address":[9327316,9327419],"length":1,"stats":{"Line":2}},{"line":206,"address":[8861292,8861887,8861601],"length":1,"stats":{"Line":2}},{"line":207,"address":[9328588,9328793,9329240,9328714,9329038,9328256,9327840,9328455],"length":1,"stats":{"Line":1}},{"line":214,"address":[8864775,8862725],"length":1,"stats":{"Line":2}},{"line":215,"address":[8863650],"length":1,"stats":{"Line":1}},{"line":217,"address":[8863754],"length":1,"stats":{"Line":1}},{"line":219,"address":[8864046,8864003,8863872],"length":1,"stats":{"Line":2}},{"line":220,"address":[9330240,9330369],"length":1,"stats":{"Line":2}},{"line":221,"address":[9330021,9329956],"length":1,"stats":{"Line":2}},{"line":222,"address":[8864290],"length":1,"stats":{"Line":1}},{"line":224,"address":[8864639,8864451],"length":1,"stats":{"Line":2}},{"line":225,"address":[8864587],"length":1,"stats":{"Line":1}},{"line":226,"address":[8864661,8864741],"length":1,"stats":{"Line":1}},{"line":227,"address":[9330662],"length":1,"stats":{"Line":1}},{"line":229,"address":[9329912,9329783,9329864],"length":1,"stats":{"Line":0}},{"line":232,"address":[8864715,8864780,8864767],"length":1,"stats":{"Line":2}},{"line":235,"address":[8863599],"length":1,"stats":{"Line":1}},{"line":240,"address":[8865072,8865351],"length":1,"stats":{"Line":1}},{"line":244,"address":[11420379],"length":1,"stats":{"Line":1}},{"line":245,"address":[8865194,8865304,8865130],"length":1,"stats":{"Line":3}},{"line":246,"address":[11420597],"length":1,"stats":{"Line":1}},{"line":248,"address":[8865265],"length":1,"stats":{"Line":1}},{"line":252,"address":[11420672,11423155],"length":1,"stats":{"Line":1}},{"line":253,"address":[8865739,8865423,8865933],"length":1,"stats":{"Line":3}},{"line":255,"address":[11420944,11420827],"length":1,"stats":{"Line":2}},{"line":259,"address":[11421746,11421604,11421288],"length":1,"stats":{"Line":3}},{"line":261,"address":[11421396,11421513],"length":1,"stats":{"Line":2}},{"line":264,"address":[8866467],"length":1,"stats":{"Line":1}},{"line":265,"address":[11421812],"length":1,"stats":{"Line":1}},{"line":267,"address":[8866674,8866564,8866868],"length":1,"stats":{"Line":3}},{"line":268,"address":[11422439,11422188],"length":1,"stats":{"Line":2}},{"line":269,"address":[11422447],"length":1,"stats":{"Line":1}},{"line":273,"address":[11422567,11422484,11422707,11422883],"length":1,"stats":{"Line":4}},{"line":274,"address":[11422891],"length":1,"stats":{"Line":1}},{"line":276,"address":[11422921],"length":1,"stats":{"Line":1}},{"line":277,"address":[8867800],"length":1,"stats":{"Line":1}},{"line":278,"address":[11423127],"length":1,"stats":{"Line":1}},{"line":280,"address":[11423056],"length":1,"stats":{"Line":1}},{"line":281,"address":[11423075],"length":1,"stats":{"Line":1}},{"line":285,"address":[11422223,11422138],"length":1,"stats":{"Line":2}},{"line":293,"address":[11423184],"length":1,"stats":{"Line":0}},{"line":299,"address":[11423216],"length":1,"stats":{"Line":0}},{"line":300,"address":[11423221],"length":1,"stats":{"Line":0}}],"covered":99,"coverable":126},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","recursive_prover","mod.rs"],"content":"pub mod prover;\npub mod recursive_circuit;\n","traces":[],"covered":0,"coverable":0},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","recursive_prover","prover.rs"],"content":"use plonky2::{\n    hash::{\n        hash_types::{HashOut, RichField},\n        poseidon::PoseidonHash,\n    },\n    iop::witness::PartialWitness,\n    plonk::{\n        circuit_data::{CircuitData, VerifierOnlyCircuitData},\n        config::{AlgebraicHasher, GenericConfig, Hasher},\n        proof::ProofWithPublicInputs,\n        prover::prove,\n    },\n};\nuse plonky2_field::extension::Extendable;\n\nuse tracing::error;\n\nuse crate::{\n    circuit_utils::prove_timing,\n    types::{D, F},\n};\n\nuse super::recursive_circuit::RecursiveTargets;\n\npub struct RecursiveProver\u003cC: GenericConfig\u003cD, F = F\u003e, const N: usize\u003e {\n    // pub batch_id: usize,\n    pub sub_proofs: [ProofWithPublicInputs\u003cF, C, D\u003e; N],\n    pub sub_circuit_vd: VerifierOnlyCircuitData\u003cC, D\u003e,\n}\n\nimpl\u003cC: GenericConfig\u003cD, F = F\u003e, const N: usize\u003e RecursiveProver\u003cC, N\u003e {\n    /// Get proof with a pre-compiled merkle sum circuit and recursive targets. In this method we do not need to build the circuit as we use a pre-built circuit.\n    pub fn get_proof_with_circuit_data(\n        \u0026self,\n        recursive_targets: RecursiveTargets\u003cN\u003e,\n        cd: \u0026CircuitData\u003cF, C, D\u003e,\n    ) -\u003e ProofWithPublicInputs\u003cF, C, D\u003e\n    where\n        \u003cC as GenericConfig\u003c2\u003e\u003e::Hasher: AlgebraicHasher\u003cF\u003e,\n    {\n        let mut pw = PartialWitness::\u003cF\u003e::new();\n        let CircuitData { prover_only, common, .. } = \u0026cd;\n\n        recursive_targets.set_targets(\u0026mut pw, self.sub_proofs.to_vec(), \u0026self.sub_circuit_vd);\n\n        let mut t = prove_timing();\n        let proof_res = prove(prover_only, common, pw, \u0026mut t);\n\n        match proof_res {\n            Ok(proof) =\u003e {\n                let proof_verification_res = cd.verify(proof.clone());\n                match proof_verification_res {\n                    Ok(_) =\u003e proof,\n                    Err(e) =\u003e {\n                        error!(\"Proof verification failed: {:?}\", e);\n                        panic!(\"Proof verification failed!\");\n                    }\n                }\n            }\n            Err(e) =\u003e {\n                error!(\"Proof generation failed: {:?}\", e);\n                panic!(\"Proof generation failed!\");\n            }\n        }\n    }\n}\n\npub fn hash_n_subhashes\u003cF: RichField + Extendable\u003cD\u003e, const D: usize\u003e(\n    hashes: \u0026Vec\u003cHashOut\u003cF\u003e\u003e,\n) -\u003e HashOut\u003cF\u003e {\n    let inputs: Vec\u003cF\u003e = hashes.iter().map(|h| h.elements.to_vec()).flatten().collect();\n    let hash = PoseidonHash::hash_no_pad(inputs.as_slice());\n    hash\n}\n","traces":[{"line":33,"address":[9287609,9285072,9289070],"length":1,"stats":{"Line":0}},{"line":41,"address":[9285127],"length":1,"stats":{"Line":0}},{"line":42,"address":[],"length":0,"stats":{"Line":0}},{"line":44,"address":[],"length":0,"stats":{"Line":0}},{"line":46,"address":[],"length":0,"stats":{"Line":0}},{"line":47,"address":[],"length":0,"stats":{"Line":0}},{"line":49,"address":[9285505],"length":1,"stats":{"Line":0}},{"line":50,"address":[],"length":0,"stats":{"Line":0}},{"line":51,"address":[],"length":0,"stats":{"Line":0}},{"line":52,"address":[],"length":0,"stats":{"Line":0}},{"line":53,"address":[],"length":0,"stats":{"Line":0}},{"line":54,"address":[],"length":0,"stats":{"Line":0}},{"line":55,"address":[9287073,9287140,9287331,9286944,9286196,9286612,9286811],"length":1,"stats":{"Line":0}},{"line":56,"address":[],"length":0,"stats":{"Line":0}},{"line":60,"address":[9285616],"length":1,"stats":{"Line":0}},{"line":61,"address":[],"length":0,"stats":{"Line":0}},{"line":62,"address":[],"length":0,"stats":{"Line":0}},{"line":68,"address":[11423467,11423232],"length":1,"stats":{"Line":1}},{"line":71,"address":[],"length":0,"stats":{"Line":3}},{"line":72,"address":[],"length":0,"stats":{"Line":2}},{"line":73,"address":[],"length":0,"stats":{"Line":0}}],"covered":3,"coverable":21},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","recursive_prover","recursive_circuit.rs"],"content":"use plonky2::{\n    iop::{\n        target::Target,\n        witness::{PartialWitness, WitnessWrite},\n    },\n    plonk::{\n        circuit_builder::CircuitBuilder,\n        circuit_data::{\n            CircuitConfig, CircuitData, CommonCircuitData, VerifierCircuitTarget,\n            VerifierOnlyCircuitData,\n        },\n        config::{AlgebraicHasher, GenericConfig},\n        proof::{ProofWithPublicInputs, ProofWithPublicInputsTarget},\n    },\n};\n\nuse crate::merkle_sum_prover::circuits::merkle_sum_circuit::MerkleSumNodeTarget;\n\nuse crate::types::{C, D, F};\n\n/// Struct representing the targets of a recusive circuit. Since we have the same type of subproofs, we only need one type of verifier circuit as\n/// we can verify all the targets using the same circuit.\n#[derive(Clone)]\npub struct RecursiveTargets\u003cconst N: usize\u003e {\n    pub proof_with_pub_input_targets: Vec\u003cProofWithPublicInputsTarget\u003cD\u003e\u003e,\n    pub verifier_circuit_target: VerifierCircuitTarget, // Only one needed instead of N\n}\n\nimpl\u003cconst N: usize\u003e RecursiveTargets\u003cN\u003e {\n    pub fn pub_input_hash_offset() -\u003e std::ops::Range\u003cusize\u003e {\n        // the hash offset of recursive pub input is the same as the merkle sum tree node target\n        MerkleSumNodeTarget::pub_input_root_hash_offset()\n    }\n\n    #[inline]\n    pub fn pub_input_equity_offset() -\u003e usize {\n        MerkleSumNodeTarget::pub_input_equity_offset()\n    }\n\n    #[inline]\n    pub fn pub_input_debt_offset() -\u003e usize {\n        MerkleSumNodeTarget::pub_input_debt_offset()\n    }\n\n    /// Builds a N-ary merkle sum tree and sets its root as a public input. We use a N-ary merkle sum tree instead of the binary one since it requires less hash gates.\n    pub fn build_recursive_merkle_sum_tree_circuit(\u0026mut self, builder: \u0026mut CircuitBuilder\u003cF, D\u003e) {\n        let mut merkle_sum_tree_node_targets: Vec\u003cMerkleSumNodeTarget\u003e = Vec::new();\n\n        (0..N).for_each(|i| {\n            let targets = std::mem::take(\u0026mut self.proof_with_pub_input_targets[i].public_inputs);\n            merkle_sum_tree_node_targets.push(MerkleSumNodeTarget::from(targets));\n        });\n\n        let parent_merkle_sum_node_target = MerkleSumNodeTarget::get_parent_from_children::\u003cN\u003e(\n            builder,\n            \u0026merkle_sum_tree_node_targets,\n        );\n\n        (0..N).for_each(|i| {\n            let public_input_target = Vec::\u003cTarget\u003e::from(merkle_sum_tree_node_targets[i]);\n            self.proof_with_pub_input_targets[i].public_inputs = public_input_target;\n        });\n\n        parent_merkle_sum_node_target.register_as_public_input(builder);\n    }\n\n    /// Sets recursive targets with values from subproof PIs and the verifier cd.\n    pub fn set_targets\u003cC: GenericConfig\u003cD, F = F\u003e\u003e(\n        \u0026self,\n        pw: \u0026mut PartialWitness\u003cF\u003e,\n        sub_proofs: Vec\u003cProofWithPublicInputs\u003cF, C, D\u003e\u003e,\n        inner_circuit_vd: \u0026VerifierOnlyCircuitData\u003cC, D\u003e,\n    ) where\n        C::Hasher: AlgebraicHasher\u003cF\u003e,\n    {\n        pw.set_verifier_data_target(\u0026self.verifier_circuit_target, inner_circuit_vd);\n\n        (0..N).for_each(|i| {\n            pw.set_proof_with_pis_target(\u0026self.proof_with_pub_input_targets[i], \u0026sub_proofs[i]);\n        });\n    }\n}\n\n/// We verify N subproofs in the circuit using the verifier CD. We also ensure the verifier data = constant vd_digest in the circuit to ensure the\n/// vd is embedded in circuit.\npub fn verify_n_subproof_circuit\u003c\n    // C: GenericConfig\u003cD, F = F\u003e,\n    InnerC: GenericConfig\u003cD, F = F\u003e,\n    const N: usize,\n\u003e(\n    builder: \u0026mut CircuitBuilder\u003cF, D\u003e,\n    subproof_common_cd: \u0026CommonCircuitData\u003cF, D\u003e,\n    subproof_verifier_cd: \u0026VerifierOnlyCircuitData\u003cInnerC, D\u003e,\n) -\u003e RecursiveTargets\u003cN\u003e\nwhere\n    InnerC::Hasher: AlgebraicHasher\u003cF\u003e,\n{\n    let verifier_circuit_targets = VerifierCircuitTarget {\n        constants_sigmas_cap: builder\n            .add_virtual_cap(subproof_common_cd.config.fri_config.cap_height),\n        circuit_digest: builder.add_virtual_hash(),\n    };\n\n    let vd_digest = subproof_verifier_cd.circuit_digest;\n    let vd_digest_target = builder.constant_hash(vd_digest);\n    builder.connect_hashes(verifier_circuit_targets.circuit_digest, vd_digest_target);\n\n    // _inner_verifier_circuit_data.circuit_digest;\n    let mut proof_with_pis_targets: Vec\u003cProofWithPublicInputsTarget\u003cD\u003e\u003e = vec![];\n    (0..N).for_each(|_| {\n        let proof_with_pub_input_target =\n            builder.add_virtual_proof_with_pis::\u003cInnerC\u003e(subproof_common_cd);\n        builder.verify_proof::\u003cInnerC\u003e(\n            \u0026proof_with_pub_input_target,\n            \u0026verifier_circuit_targets,\n            subproof_common_cd,\n        );\n        proof_with_pis_targets.push(proof_with_pub_input_target);\n    });\n\n    RecursiveTargets {\n        verifier_circuit_target: verifier_circuit_targets,\n        proof_with_pub_input_targets: proof_with_pis_targets,\n    }\n}\n\n/// build recursive circuit that proves N subproofs and geneate parent merkle sum node targets\n// This circuit hardcode the constraint that the verifier_circuit_target.circuit_digest must be equal to that inner_verifier_circuit_data.circuit_digest;\npub fn build_recursive_n_circuit\u003c\n    // C: GenericConfig\u003cD, F = F\u003e,\n    InnerC: GenericConfig\u003cD, F = F\u003e,\n    const N: usize,\n\u003e(\n    inner_common_circuit_data: \u0026CommonCircuitData\u003cF, D\u003e,\n    inner_verifier_circuit_data: \u0026VerifierOnlyCircuitData\u003cInnerC, D\u003e,\n    circuit_config: CircuitConfig,\n) -\u003e (CircuitData\u003cF, C, D\u003e, RecursiveTargets\u003cN\u003e)\nwhere\n    InnerC::Hasher: AlgebraicHasher\u003cF\u003e,\n{\n    let mut builder = CircuitBuilder::\u003cF, D\u003e::new(circuit_config);\n    let mut recursive_targets = verify_n_subproof_circuit(\n        \u0026mut builder,\n        inner_common_circuit_data,\n        inner_verifier_circuit_data,\n    );\n    recursive_targets.build_recursive_merkle_sum_tree_circuit(\u0026mut builder);\n    let circuit_data = builder.build::\u003cC\u003e();\n    (circuit_data, recursive_targets)\n}\n","traces":[{"line":30,"address":[9137296],"length":1,"stats":{"Line":0}},{"line":32,"address":[],"length":0,"stats":{"Line":0}},{"line":36,"address":[],"length":0,"stats":{"Line":0}},{"line":37,"address":[],"length":0,"stats":{"Line":0}},{"line":41,"address":[],"length":0,"stats":{"Line":0}},{"line":42,"address":[],"length":0,"stats":{"Line":0}},{"line":46,"address":[9137570,9137328],"length":1,"stats":{"Line":0}},{"line":47,"address":[],"length":0,"stats":{"Line":0}},{"line":49,"address":[],"length":0,"stats":{"Line":0}},{"line":50,"address":[],"length":0,"stats":{"Line":0}},{"line":51,"address":[],"length":0,"stats":{"Line":0}},{"line":55,"address":[],"length":0,"stats":{"Line":0}},{"line":56,"address":[],"length":0,"stats":{"Line":0}},{"line":59,"address":[],"length":0,"stats":{"Line":0}},{"line":60,"address":[],"length":0,"stats":{"Line":0}},{"line":61,"address":[],"length":0,"stats":{"Line":0}},{"line":64,"address":[],"length":0,"stats":{"Line":0}},{"line":68,"address":[9136976,9137135],"length":1,"stats":{"Line":0}},{"line":76,"address":[],"length":0,"stats":{"Line":0}},{"line":78,"address":[],"length":0,"stats":{"Line":0}},{"line":79,"address":[],"length":0,"stats":{"Line":0}},{"line":86,"address":[9139463,9138592],"length":1,"stats":{"Line":0}},{"line":99,"address":[],"length":0,"stats":{"Line":0}},{"line":101,"address":[],"length":0,"stats":{"Line":0}},{"line":104,"address":[],"length":0,"stats":{"Line":0}},{"line":105,"address":[9138879],"length":1,"stats":{"Line":0}},{"line":106,"address":[],"length":0,"stats":{"Line":0}},{"line":109,"address":[],"length":0,"stats":{"Line":0}},{"line":110,"address":[],"length":0,"stats":{"Line":0}},{"line":111,"address":[],"length":0,"stats":{"Line":0}},{"line":112,"address":[],"length":0,"stats":{"Line":0}},{"line":113,"address":[],"length":0,"stats":{"Line":0}},{"line":114,"address":[],"length":0,"stats":{"Line":0}},{"line":115,"address":[],"length":0,"stats":{"Line":0}},{"line":116,"address":[],"length":0,"stats":{"Line":0}},{"line":118,"address":[],"length":0,"stats":{"Line":0}},{"line":129,"address":[9138160,9138541],"length":1,"stats":{"Line":0}},{"line":141,"address":[],"length":0,"stats":{"Line":0}},{"line":143,"address":[],"length":0,"stats":{"Line":0}},{"line":144,"address":[],"length":0,"stats":{"Line":0}},{"line":145,"address":[],"length":0,"stats":{"Line":0}},{"line":147,"address":[],"length":0,"stats":{"Line":0}},{"line":148,"address":[],"length":0,"stats":{"Line":0}},{"line":149,"address":[],"length":0,"stats":{"Line":0}}],"covered":0,"coverable":44},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","types.rs"],"content":"use plonky2::plonk::{\n    circuit_data::{CommonCircuitData, VerifierOnlyCircuitData},\n    config::{GenericConfig, PoseidonGoldilocksConfig},\n    proof::ProofWithPublicInputs,\n};\n\n// Extension of size 2\npub const D: usize = 2;\n\n// Constrict our values to 62 bits.\npub const MAX_POSITIVE_AMOUNT_LOG: usize = 62;\n\n// Number of accounts in one merkle sum tree batch.\npub const MERKLE_SUM_TREE_BATCH_SIZE: usize = 1;\n\npub const ASSETS_KEY: \u0026str = \"assets\";\n\npub type C = PoseidonGoldilocksConfig;\npub type F = \u003cC as GenericConfig\u003cD\u003e\u003e::F;\n\npub type ProofTuple\u003cF, C, const D: usize\u003e =\n    (ProofWithPublicInputs\u003cF, C, D\u003e, VerifierOnlyCircuitData\u003cC, D\u003e, CommonCircuitData\u003cF, D\u003e);\n","traces":[],"covered":0,"coverable":0},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","util.rs"],"content":"use crate::types::F;\nuse plonky2::hash::hash_types::HashOut;\nuse plonky2_field::types::Field;\n\npub fn pad_to_multiple_of(n: usize, multiple: usize) -\u003e usize {\n    if multiple == 0 {\n        return n; // Avoid division by zero\n    }\n    let remainder = n % multiple;\n    if remainder == 0 {\n        n\n    } else {\n        n + multiple - remainder\n    }\n}\n\n/// node level is the level from tree root; the root node has level of 0;\n/// `node_idx` is the index of the nodes in a vector; the root node has the largest ndoe_idx\npub fn get_node_level(batch_size: usize, node_idx: usize) -\u003e usize {\n    let total_nums = 2 * batch_size - 1;\n    ((total_nums - node_idx) as f64).log(2.0).floor() as usize\n}\n\n/// Given a hash string, get a hashout\npub fn get_hash_from_hash_string(hash_string: String) -\u003e HashOut\u003cF\u003e {\n    let without_brackets = hash_string.trim_matches(|c| c == '[' || c == ']').to_string(); // Remove brackets\n\n    let hash_as_vec_f: Vec\u003cF\u003e = without_brackets\n        .split(',')\n        .map(|s| F::from_canonical_u64(s.parse::\u003cu64\u003e().unwrap()))\n        .collect();\n\n    if hash_as_vec_f.len() != 4 {\n        panic!(\"Incorrect format of hash\");\n    }\n\n    HashOut::from_vec(hash_as_vec_f)\n}\n\n#[cfg(test)]\npub mod test_util {\n    use plonky2::hash::hash_types::HashOut;\n\n    use crate::util::get_node_level;\n\n    use super::{get_hash_from_hash_string, pad_to_multiple_of};\n\n    #[test]\n    fn test_get_node_level() {\n        assert_eq!(get_node_level(8, 14), 0);\n        assert_eq!(get_node_level(8, 13), 1);\n        assert_eq!(get_node_level(8, 9), 2);\n        assert_eq!(get_node_level(8, 11), 2);\n        assert_eq!(get_node_level(8, 0), 3);\n        assert_eq!(get_node_level(8, 4), 3);\n        assert_eq!(get_node_level(8, 7), 3);\n    }\n\n    #[test]\n    fn test_pad_to_multiple_of() {\n        assert_eq!(pad_to_multiple_of(23, 4), 24);\n        assert_eq!(pad_to_multiple_of(24, 4), 24);\n        assert_eq!(pad_to_multiple_of(27, 4), 28);\n    }\n\n    #[test]\n    fn test_get_hash_from_hash_string() {\n        let hash = get_hash_from_hash_string(\"[0000,0000,0000,0000]\".to_string());\n        assert_eq!(hash, HashOut::ZERO);\n    }\n}\n","traces":[{"line":5,"address":[9672960],"length":1,"stats":{"Line":1}},{"line":6,"address":[11666920],"length":1,"stats":{"Line":1}},{"line":7,"address":[11666931],"length":1,"stats":{"Line":0}},{"line":9,"address":[11666994,11666943,11666971],"length":1,"stats":{"Line":2}},{"line":10,"address":[11667097,11667020,11666986],"length":1,"stats":{"Line":3}},{"line":11,"address":[11667015],"length":1,"stats":{"Line":1}},{"line":13,"address":[11667102,11667032],"length":1,"stats":{"Line":1}},{"line":19,"address":[11667120],"length":1,"stats":{"Line":1}},{"line":20,"address":[11667142,11667237],"length":1,"stats":{"Line":1}},{"line":21,"address":[11667257,11667216,11667396],"length":1,"stats":{"Line":2}},{"line":25,"address":[11667979,11667424],"length":1,"stats":{"Line":1}},{"line":26,"address":[11667454,11667530,11668016,11668029],"length":1,"stats":{"Line":4}},{"line":28,"address":[11667578,11667646],"length":1,"stats":{"Line":2}},{"line":30,"address":[11668267,11668080,11668099],"length":1,"stats":{"Line":3}},{"line":33,"address":[11667729,11667794],"length":1,"stats":{"Line":2}},{"line":34,"address":[11667932,11667858],"length":1,"stats":{"Line":0}},{"line":37,"address":[11667805],"length":1,"stats":{"Line":1}}],"covered":15,"coverable":17},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","tests","e2e.rs"],"content":"use plonky2_field::types::Field;\nuse zk_por_core::{\n    account::gen_accounts_with_random_data,\n    circuit_config::STANDARD_CONFIG,\n    circuit_registry::registry::CircuitRegistry,\n    e2e::{batch_prove_accounts, recursive_prove_subproofs},\n    types::F,\n};\n\nuse zk_por_tracing::{init_tracing, TraceConfig};\n\n#[test]\nfn test_prove() {\n    let cfg = TraceConfig {\n        prefix: \"zkpor\".to_string(),\n        dir: \"logs\".to_string(),\n        level: tracing::Level::DEBUG,\n        console: true,\n        flame: false,\n    };\n\n    {\n        init_tracing(cfg)\n    };\n\n    const RECURSION_BRANCHOUT_NUM: usize = 4;\n    let batch_size = 8;\n    let token_num = 4;\n\n    let circuit_registry = CircuitRegistry::\u003cRECURSION_BRANCHOUT_NUM\u003e::init(\n        batch_size,\n        token_num,\n        STANDARD_CONFIG,\n        vec![STANDARD_CONFIG; 2],\n    );\n\n    let proving_thread_num = 2;\n\n    // a total of 9 batches (3x3) to test for padding in each level.\n    let mut equity_sum = 0;\n    let mut debt_sum = 0;\n    let mut batch_proofs = vec![];\n    for _ in 0..3 {\n        let accounts = gen_accounts_with_random_data(batch_size * 3, 4);\n\n        equity_sum += accounts\n            .iter()\n            .map(|account| account.equity.iter().map(|e| e.0).sum::\u003cu64\u003e())\n            .sum::\u003cu64\u003e();\n        debt_sum += accounts\n            .iter()\n            .map(|account| account.debt.iter().map(|e| e.0).sum::\u003cu64\u003e())\n            .sum::\u003cu64\u003e();\n\n        let proofs =\n            batch_prove_accounts(\u0026circuit_registry, accounts, proving_thread_num, batch_size);\n        batch_proofs.extend(proofs.into_iter());\n    }\n\n    let root_proof = recursive_prove_subproofs(batch_proofs, \u0026circuit_registry, proving_thread_num);\n\n    tracing::debug!(\"equity_sum: {}, debt_sum: {}\", equity_sum, debt_sum);\n    assert_eq!(F::from_canonical_u64(equity_sum), root_proof.public_inputs[0],);\n    assert_eq!(F::from_canonical_u64(debt_sum), root_proof.public_inputs[1],);\n}\n","traces":[],"covered":0,"coverable":0},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","tests","recursive_circuit.rs"],"content":"use plonky2::{hash::hash_types::HashOut, plonk::proof::ProofWithPublicInputs};\nuse zk_por_core::{\n    account::gen_accounts_with_random_data,\n    circuit_config::STANDARD_CONFIG,\n    merkle_sum_prover::circuits::merkle_sum_circuit::build_merkle_sum_tree_circuit,\n    recursive_prover::{prover::RecursiveProver, recursive_circuit::RecursiveTargets},\n    types::{C, D, F},\n};\n\nuse zk_por_core::{\n    merkle_sum_prover::prover::MerkleSumTreeProver,\n    recursive_prover::{prover::hash_n_subhashes, recursive_circuit::build_recursive_n_circuit},\n};\n\nuse plonky2_field::types::Field;\n\n#[test]\nfn test() {\n    let batch_size = 4;\n    let token_num = 2;\n    const RECURSION_BRANCHOUT_NUM: usize = 8;\n\n    let accounts = gen_accounts_with_random_data(batch_size, token_num);\n\n    let equity_sum = accounts\n        .iter()\n        .fold(F::ZERO, |acc, x| acc + x.equity.iter().fold(F::ZERO, |acc_2, y| acc_2 + *y));\n\n    let debt_sum = accounts\n        .iter()\n        .fold(F::ZERO, |acc, x| acc + x.debt.iter().fold(F::ZERO, |acc_2, y| acc_2 + *y));\n\n    let start = std::time::Instant::now();\n    let (merkle_sum_circuit, account_targets) =\n        build_merkle_sum_tree_circuit(batch_size, token_num, STANDARD_CONFIG);\n    println!(\"build merkle sum tree circuit in : {:?}\", start.elapsed());\n\n    let prover = MerkleSumTreeProver { accounts };\n\n    let start = std::time::Instant::now();\n    let merkle_sum_proof =\n        prover.get_proof_with_circuit_data(account_targets.as_slice(), \u0026merkle_sum_circuit);\n    println!(\"prove merkle sum tree in : {:?}\", start.elapsed());\n\n    let sub_proofs: [ProofWithPublicInputs\u003cF, C, D\u003e; RECURSION_BRANCHOUT_NUM] =\n        std::array::from_fn(|_| merkle_sum_proof.clone());\n\n    let start = std::time::Instant::now();\n    let (recursive_circuit, recursive_targets) =\n        build_recursive_n_circuit::\u003cC, RECURSION_BRANCHOUT_NUM\u003e(\n            \u0026merkle_sum_circuit.common,\n            \u0026merkle_sum_circuit.verifier_only,\n            STANDARD_CONFIG,\n        );\n    println!(\"build recursive N circuit in : {:?}\", start.elapsed());\n\n    let start = std::time::Instant::now();\n    let hash_offset = RecursiveTargets::\u003cRECURSION_BRANCHOUT_NUM\u003e::pub_input_hash_offset();\n    let subhashes = sub_proofs\n        .clone()\n        .map(|proof| HashOut::\u003cF\u003e::from_partial(\u0026proof.public_inputs[hash_offset.clone()]));\n    let recursive_prover = RecursiveProver {\n        sub_proofs: sub_proofs,\n        sub_circuit_vd: merkle_sum_circuit.verifier_only.clone(),\n    };\n    let recursive_proof_result =\n        recursive_prover.get_proof_with_circuit_data(recursive_targets, \u0026recursive_circuit);\n    println!(\"prove recursive subproofs in : {:?}\", start.elapsed());\n\n    let expected_hash = hash_n_subhashes::\u003cF, D\u003e(\u0026subhashes.to_vec());\n    let actual_hash =\n        HashOut::\u003cF\u003e::from_partial(\u0026recursive_proof_result.public_inputs[hash_offset]);\n\n    assert_eq!(expected_hash, actual_hash);\n\n    // print public inputs in recursive proof\n    assert_eq!(\n        equity_sum * F::from_canonical_u32(RECURSION_BRANCHOUT_NUM as u32),\n        recursive_proof_result.public_inputs[0]\n    );\n    assert_eq!(\n        debt_sum * F::from_canonical_u32(RECURSION_BRANCHOUT_NUM as u32),\n        recursive_proof_result.public_inputs[1]\n    );\n}\n","traces":[],"covered":0,"coverable":0},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","tests","registry.rs"],"content":"use plonky2_field::types::Field;\nuse zk_por_core::{circuit_registry::registry::CircuitRegistry, types::F};\n\n#[test]\nfn test() {\n    let batch_circuit_config = zk_por_core::circuit_config::STANDARD_CONFIG;\n    let recursive_levels = 2;\n    let recursive_level_configs = vec![zk_por_core::circuit_config::STANDARD_CONFIG; 2];\n\n    let registry =\n        CircuitRegistry::\u003c2\u003e::init(1024, 2, batch_circuit_config, recursive_level_configs);\n\n    let batch_circuit = registry.get_batch_circuit().0;\n    let batch_proof =\n        registry.get_empty_proof(\u0026batch_circuit.verifier_only.circuit_digest).unwrap().clone();\n\n    assert_eq!(recursive_levels, registry.get_recursive_levels());\n    assert_eq!(F::ZERO, batch_proof.public_inputs[0]);\n    assert_eq!(F::ZERO, batch_proof.public_inputs[1]);\n    assert!(batch_circuit.verify(batch_proof).is_ok());\n    let mut inner_vd_digest = batch_circuit.verifier_only.circuit_digest;\n\n    for _ in 0..recursive_levels {\n        let recursive_circuit = registry.get_recursive_circuit(\u0026inner_vd_digest).unwrap().0;\n        let recursive_empty_proof =\n            registry.get_empty_proof(\u0026recursive_circuit.verifier_only.circuit_digest).unwrap();\n\n        assert_eq!(F::ZERO, recursive_empty_proof.public_inputs[0]);\n        assert_eq!(F::ZERO, recursive_empty_proof.public_inputs[1]);\n        assert!(recursive_circuit.verify(recursive_empty_proof.clone()).is_ok());\n\n        inner_vd_digest = recursive_circuit.verifier_only.circuit_digest;\n    }\n    let root_circuit = registry.get_root_circuit();\n    assert_eq!(inner_vd_digest, root_circuit.verifier_only.circuit_digest);\n}\n","traces":[],"covered":0,"coverable":0},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-db","src","lib.rs"],"content":"extern crate leveldb;\nextern crate tempdir;\n\nuse leveldb::{\n    database::{\n        batch::{Batch, Writebatch},\n        Database,\n    },\n    kv::KV,\n    options::{Options, ReadOptions, WriteOptions},\n};\nuse tracing::warn;\n\npub struct LevelDb\u003cK: db_key::Key\u003e {\n    db: Database\u003cK\u003e,\n}\n\nimpl\u003cK: db_key::Key\u003e LevelDb\u003cK\u003e {\n    pub fn new(db_path: \u0026std::path::PathBuf) -\u003e Self {\n        let mut options = Options::new();\n        options.create_if_missing = true;\n\n        let database = match Database::\u003cK\u003e::open(db_path, options) {\n            Ok(db) =\u003e db,\n            Err(e) =\u003e {\n                panic!(\"Failed to open database: {:?}\", e);\n            }\n        };\n        Self { db: database }\n    }\n\n    pub fn put(\u0026self, key: K, val: \u0026[u8]) {\n        let write_opts = WriteOptions::new();\n\n        match self.db.put(write_opts, key, val) {\n            Ok(_) =\u003e (),\n            Err(e) =\u003e panic!(\"Failed to write key-value pair: {:?}\", e),\n        }\n    }\n\n    /// input is a vector of (k,v) tuple\n    pub fn batch_put(\u0026self, batches: Vec\u003c(K, Vec\u003cu8\u003e)\u003e) {\n        let mut batch = Writebatch::\u003cK\u003e::new();\n        batches.into_iter().for_each(|(k, v)| {\n            batch.put(k, v.as_ref());\n        });\n\n        match self.db.write(WriteOptions::new(), \u0026batch) {\n            Ok(_) =\u003e (),\n            Err(e) =\u003e panic!(\"Batch write failed: {}\", e),\n        }\n    }\n\n    pub fn get(\u0026self, key: K) -\u003e Option\u003cVec\u003cu8\u003e\u003e {\n        let read_opts = ReadOptions::new();\n        match self.db.get(read_opts, key) {\n            Ok(val) =\u003e val,\n            Err(e) =\u003e {\n                warn!(\"Failed to read value: {:?}\", e);\n                None\n            }\n        }\n    }\n\n    pub fn delete(\u0026self, key: K) {\n        let write_opts = WriteOptions::new();\n        match self.db.delete(write_opts, key) {\n            Ok(_) =\u003e (),\n            Err(e) =\u003e warn!(\"Failed to delete key: {:?}\", e),\n        }\n    }\n}\n\n#[cfg(test)]\nmod test {\n\n    use tempdir::TempDir;\n\n    use crate::LevelDb;\n\n    #[test]\n    fn test_db_i32() {\n        let tempdir = TempDir::new(\"example\").unwrap();\n        let db = LevelDb::\u003ci32\u003e::new(\u0026tempdir.path().to_path_buf());\n        db.put(1, b\"hello\");\n        db.put(2, b\"world\");\n        let ret = db.get(1).unwrap();\n\n        assert_eq!(ret, b\"hello\");\n        db.delete(1);\n        let ret = db.get(1);\n        assert_eq!(ret, None);\n        db.delete(2);\n    }\n}\n","traces":[{"line":19,"address":[8790182,8789584,8789542,8788944],"length":1,"stats":{"Line":3}},{"line":20,"address":[785869],"length":1,"stats":{"Line":3}},{"line":21,"address":[785904],"length":1,"stats":{"Line":3}},{"line":23,"address":[],"length":0,"stats":{"Line":6}},{"line":24,"address":[],"length":0,"stats":{"Line":3}},{"line":25,"address":[8789263,8789903],"length":1,"stats":{"Line":0}},{"line":26,"address":[11351164,11350524],"length":1,"stats":{"Line":0}},{"line":32,"address":[],"length":0,"stats":{"Line":1}},{"line":33,"address":[],"length":0,"stats":{"Line":2}},{"line":35,"address":[],"length":0,"stats":{"Line":1}},{"line":36,"address":[],"length":0,"stats":{"Line":0}},{"line":37,"address":[786843,786710],"length":1,"stats":{"Line":0}},{"line":42,"address":[11351280,11352553,11351952,11351909,11351881,11352581],"length":1,"stats":{"Line":2}},{"line":43,"address":[],"length":0,"stats":{"Line":4}},{"line":44,"address":[],"length":0,"stats":{"Line":8}},{"line":45,"address":[11352666,11352890,11352802,11353068],"length":1,"stats":{"Line":2}},{"line":48,"address":[],"length":0,"stats":{"Line":2}},{"line":49,"address":[],"length":0,"stats":{"Line":0}},{"line":50,"address":[],"length":0,"stats":{"Line":0}},{"line":54,"address":[11348016,11346096,11349875,11347992],"length":1,"stats":{"Line":3}},{"line":55,"address":[],"length":0,"stats":{"Line":3}},{"line":56,"address":[],"length":0,"stats":{"Line":3}},{"line":57,"address":[],"length":0,"stats":{"Line":3}},{"line":58,"address":[11346396,11348284],"length":1,"stats":{"Line":0}},{"line":59,"address":[11347041,11347480,11348534,11346646,11348929,11349234,11347346,11347547,11347738,11349432,11349116,11349622,11347228,11349365],"length":1,"stats":{"Line":0}},{"line":60,"address":[788267],"length":1,"stats":{"Line":0}},{"line":65,"address":[],"length":0,"stats":{"Line":1}},{"line":66,"address":[788879,788964],"length":1,"stats":{"Line":2}},{"line":67,"address":[788976],"length":1,"stats":{"Line":1}},{"line":68,"address":[],"length":0,"stats":{"Line":0}},{"line":69,"address":[789668,789042,789225,790141,790327,790077,789855,789967],"length":1,"stats":{"Line":0}}],"covered":20,"coverable":31},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-tracing","src","lib.rs"],"content":"pub mod opentelemetry;\n\nuse crate::opentelemetry::exporter::stdout;\nuse tracing::Level;\npub use tracing_appender::non_blocking::WorkerGuard;\nuse tracing_appender::rolling;\nuse tracing_flame::FlameLayer;\nuse tracing_opentelemetry::OpenTelemetryLayer;\nuse tracing_subscriber::{fmt, prelude::*};\n\n#[derive(Debug)]\npub struct TraceConfig {\n    pub prefix: String,\n    pub dir: String,\n    pub level: Level,\n    pub console: bool,\n    pub flame: bool,\n}\n\npub fn init_tracing(config: TraceConfig) -\u003e Vec\u003cWorkerGuard\u003e {\n    let prefix = config.prefix;\n    let dir = config.dir;\n    let level = config.level;\n    let console = config.console;\n    let flame = config.flame;\n\n    let mut guards = vec![];\n    let (fmt_writer, fmt_guard) = tracing_appender::non_blocking(rolling::daily(\u0026dir, \u0026prefix));\n    guards.push(fmt_guard);\n    let (telemetry_writer, telemetry_guard) =\n        tracing_appender::non_blocking(rolling::daily(\u0026dir, prefix.clone() + \".telemetry\"));\n    guards.push(telemetry_guard);\n    let tracer = stdout::new_pipeline().with_writer(telemetry_writer).install_simple();\n    let layered = tracing_subscriber::fmt()\n        .with_max_level(level)\n        .with_writer(fmt_writer)\n        .with_ansi(false)\n        .finish()\n        .with(OpenTelemetryLayer::new(tracer));\n    if flame {\n        let (folded_writer, folded_guard) =\n            tracing_appender::non_blocking(rolling::daily(\u0026dir, prefix.clone() + \".folded\"));\n        guards.push(folded_guard);\n        if console {\n            layered.with(fmt::Layer::default()).with(FlameLayer::new(folded_writer)).init();\n        } else {\n            layered.with(FlameLayer::new(folded_writer)).init()\n        }\n    } else if console {\n        layered.with(fmt::Layer::default()).init();\n    } else {\n        layered.init()\n    }\n\n    guards\n}\n","traces":[{"line":20,"address":[12670872,12667552,12669551],"length":1,"stats":{"Line":1}},{"line":21,"address":[4460431],"length":1,"stats":{"Line":1}},{"line":22,"address":[4460553],"length":1,"stats":{"Line":1}},{"line":23,"address":[4460571],"length":1,"stats":{"Line":1}},{"line":24,"address":[12667755],"length":1,"stats":{"Line":1}},{"line":25,"address":[4460603],"length":1,"stats":{"Line":1}},{"line":27,"address":[13641803],"length":1,"stats":{"Line":1}},{"line":28,"address":[4460747,4460690],"length":1,"stats":{"Line":2}},{"line":29,"address":[12668050],"length":1,"stats":{"Line":1}},{"line":30,"address":[13642321],"length":1,"stats":{"Line":1}},{"line":32,"address":[4461221],"length":1,"stats":{"Line":1}},{"line":33,"address":[4461362],"length":1,"stats":{"Line":1}},{"line":34,"address":[4461623,4461552,4461822,4461471],"length":1,"stats":{"Line":4}},{"line":36,"address":[4461559],"length":1,"stats":{"Line":1}},{"line":39,"address":[13644732,13642930,13643117],"length":1,"stats":{"Line":2}},{"line":40,"address":[4462935,4461881],"length":1,"stats":{"Line":1}},{"line":41,"address":[13643670],"length":1,"stats":{"Line":0}},{"line":43,"address":[4462502],"length":1,"stats":{"Line":0}},{"line":44,"address":[13643923],"length":1,"stats":{"Line":0}},{"line":45,"address":[4462958,4462754,4463298],"length":1,"stats":{"Line":0}},{"line":47,"address":[4462818,4462948,4462645],"length":1,"stats":{"Line":0}},{"line":49,"address":[4462594,4461889,4462919,4463326],"length":1,"stats":{"Line":1}},{"line":50,"address":[4461977,4462173],"length":1,"stats":{"Line":1}},{"line":52,"address":[4461922,4462082],"length":1,"stats":{"Line":0}},{"line":55,"address":[4462089],"length":1,"stats":{"Line":1}}],"covered":19,"coverable":25},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-tracing","src","opentelemetry","exporter","stdout.rs"],"content":"//! # Stdout Span Exporter\n//!\n//! The stdout [`SpanExporter`] writes debug printed [`Span`]s to its configured\n//! [`Write`] instance. By default it will write to [`Stdout`].\n//!\n//! [`SpanExporter`]: super::SpanExporter\n//! [`Span`]: crate::trace::Span\n//! [`Write`]: Write\n//! [`Stdout`]: Stdout\n//!\n//! # Examples\n//!\n//! ```no_run\n//! use opentelemetry::trace::Tracer;\n//! use opentelemetry::sdk::export::trace::stdout;\n//! use opentelemetry::global::shutdown_tracer_provider;\n//!\n//! fn main() {\n//!     let tracer = stdout::new_pipeline()\n//!         .with_pretty_print(true)\n//!         .install_simple();\n//!\n//!     tracer.in_span(\"doing_work\", |cx| {\n//!         // Traced app logic here...\n//!     });\n//!\n//!     shutdown_tracer_provider(); // sending remaining spans\n//! }\n//! ```\n#![allow(clippy::needless_doctest_main)]\nuse async_trait::async_trait;\nuse opentelemetry::{\n    global, sdk,\n    sdk::export::{\n        trace::{ExportResult, SpanData, SpanExporter},\n        ExportError,\n    },\n    trace::TracerProvider,\n};\nuse std::{\n    fmt::Debug,\n    io::{stdout, Stdout, Write},\n};\n\n/// Pipeline builder\n#[derive(Debug)]\npub struct PipelineBuilder\u003cW: Write\u003e {\n    pretty_print: bool,\n    trace_config: Option\u003csdk::trace::Config\u003e,\n    writer: W,\n}\n\n/// Create a new stdout exporter pipeline builder.\npub fn new_pipeline() -\u003e PipelineBuilder\u003cStdout\u003e {\n    PipelineBuilder::default()\n}\n\nimpl Default for PipelineBuilder\u003cStdout\u003e {\n    /// Return the default pipeline builder.\n    fn default() -\u003e Self {\n        Self { pretty_print: false, trace_config: None, writer: stdout() }\n    }\n}\n\nimpl\u003cW: Write\u003e PipelineBuilder\u003cW\u003e {\n    /// Specify the pretty print setting.\n    pub fn with_pretty_print(mut self, pretty_print: bool) -\u003e Self {\n        self.pretty_print = pretty_print;\n        self\n    }\n\n    /// Assign the SDK trace configuration.\n    pub fn with_trace_config(mut self, config: sdk::trace::Config) -\u003e Self {\n        self.trace_config = Some(config);\n        self\n    }\n\n    /// Specify the writer to use.\n    pub fn with_writer\u003cT: Write\u003e(self, writer: T) -\u003e PipelineBuilder\u003cT\u003e {\n        PipelineBuilder { pretty_print: self.pretty_print, trace_config: self.trace_config, writer }\n    }\n}\n\nimpl\u003cW\u003e PipelineBuilder\u003cW\u003e\nwhere\n    W: Write + Debug + Send + 'static,\n{\n    /// Install the stdout exporter pipeline with the recommended defaults.\n    pub fn install_simple(mut self) -\u003e sdk::trace::Tracer {\n        let exporter = Exporter::new(self.writer, self.pretty_print);\n\n        let mut provider_builder =\n            sdk::trace::TracerProvider::builder().with_simple_exporter(exporter);\n        if let Some(config) = self.trace_config.take() {\n            provider_builder = provider_builder.with_config(config);\n        }\n        let provider = provider_builder.build();\n\n        let tracer =\n            provider.versioned_tracer(\"opentelemetry\", Some(env!(\"CARGO_PKG_VERSION\")), None);\n        let _ = global::set_tracer_provider(provider);\n\n        tracer\n    }\n}\n\n/// A [`SpanExporter`] that writes to [`Stdout`] or other configured [`Write`].\n///\n/// [`SpanExporter`]: super::SpanExporter\n/// [`Write`]: Write\n/// [`Stdout`]: Stdout\n#[derive(Debug)]\npub struct Exporter\u003cW: Write\u003e {\n    writer: W,\n    pretty_print: bool,\n}\n\nimpl\u003cW: Write\u003e Exporter\u003cW\u003e {\n    /// Create a new stdout `Exporter`.\n    pub fn new(writer: W, pretty_print: bool) -\u003e Self {\n        Self { writer, pretty_print }\n    }\n}\n\n#[async_trait]\nimpl\u003cW\u003e SpanExporter for Exporter\u003cW\u003e\nwhere\n    W: Write + Debug + Send + 'static,\n{\n    /// Export spans to stdout\n    async fn export(\u0026mut self, batch: Vec\u003cSpanData\u003e) -\u003e ExportResult {\n        for span in batch {\n            let json = if self.pretty_print {\n                serde_json::to_string_pretty(\u0026span).map_err::\u003cError, _\u003e(Into::into)?\n            } else {\n                serde_json::to_string(\u0026span).map_err::\u003cError, _\u003e(Into::into)?\n            };\n            self.writer.write_all(json.as_bytes()).map_err::\u003cError, _\u003e(Into::into)?;\n            self.writer.write_all(\"\\n\".as_bytes()).map_err::\u003cError, _\u003e(Into::into)?;\n        }\n\n        Ok(())\n    }\n}\n\n/// Stdout exporter's error\n#[derive(thiserror::Error, Debug)]\n#[error(transparent)]\nenum Error {\n    Json(#[from] serde_json::Error),\n    Io(#[from] std::io::Error),\n}\n\nimpl ExportError for Error {\n    fn exporter_name(\u0026self) -\u003e \u0026'static str {\n        \"stdout\"\n    }\n}\n","traces":[{"line":54,"address":[12864752],"length":1,"stats":{"Line":1}},{"line":55,"address":[13838776],"length":1,"stats":{"Line":1}},{"line":60,"address":[4298160,4298279],"length":1,"stats":{"Line":1}},{"line":61,"address":[13838813],"length":1,"stats":{"Line":1}},{"line":67,"address":[],"length":0,"stats":{"Line":0}},{"line":68,"address":[],"length":0,"stats":{"Line":0}},{"line":69,"address":[],"length":0,"stats":{"Line":0}},{"line":73,"address":[],"length":0,"stats":{"Line":0}},{"line":74,"address":[],"length":0,"stats":{"Line":0}},{"line":75,"address":[],"length":0,"stats":{"Line":0}},{"line":79,"address":[],"length":0,"stats":{"Line":1}},{"line":80,"address":[13838963],"length":1,"stats":{"Line":1}},{"line":89,"address":[4299686,4298432,4299754],"length":1,"stats":{"Line":1}},{"line":90,"address":[4298454,4298575],"length":1,"stats":{"Line":2}},{"line":92,"address":[13839227,13839284],"length":1,"stats":{"Line":2}},{"line":93,"address":[],"length":0,"stats":{"Line":0}},{"line":94,"address":[13839379,13839776,13839443],"length":1,"stats":{"Line":2}},{"line":95,"address":[4299090,4298904],"length":1,"stats":{"Line":0}},{"line":97,"address":[12865784,12865955],"length":1,"stats":{"Line":2}},{"line":99,"address":[4299335],"length":1,"stats":{"Line":1}},{"line":100,"address":[],"length":0,"stats":{"Line":0}},{"line":101,"address":[12866220,12866132],"length":1,"stats":{"Line":2}},{"line":103,"address":[13840276],"length":1,"stats":{"Line":1}},{"line":120,"address":[12866416],"length":1,"stats":{"Line":1}},{"line":131,"address":[],"length":0,"stats":{"Line":0}},{"line":132,"address":[],"length":0,"stats":{"Line":0}},{"line":133,"address":[13842194,13841897,13841474],"length":1,"stats":{"Line":0}},{"line":134,"address":[],"length":0,"stats":{"Line":0}},{"line":136,"address":[13841611,13841712,13841985,13841899],"length":1,"stats":{"Line":0}},{"line":138,"address":[13842469,13842791,13841965,13842319],"length":1,"stats":{"Line":0}},{"line":139,"address":[],"length":0,"stats":{"Line":0}},{"line":142,"address":[],"length":0,"stats":{"Line":0}},{"line":155,"address":[4299840],"length":1,"stats":{"Line":0}}],"covered":15,"coverable":33},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-tracing","src","opentelemetry","exporter.rs"],"content":"pub mod stdout;\n","traces":[],"covered":0,"coverable":0},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-tracing","src","opentelemetry.rs"],"content":"pub mod exporter;\n","traces":[],"covered":0,"coverable":0}]};
+        var data = {"files":[{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-cli","src","constant.rs"],"content":"pub const RECURSION_BRANCHOUT_NUM: usize = 64;\npub const DEFAULT_BATCH_SIZE: usize = 1024;\npub const GLOBAL_PROOF_FILENAME: \u0026str = \"global_proof.json\";\npub const GLOBAL_INFO_FILENAME: \u0026str = \"global_info.json\";\npub const USER_PROOF_DIRNAME: \u0026str = \"user_proofs\";\npub const DEFAULT_USER_PROOF_FILE_PATTERN: \u0026str = \"*_inclusion_proof.json\";\n","traces":[],"covered":0,"coverable":0},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-cli","src","lib.rs"],"content":"pub mod constant;\npub mod prover;\npub mod verifier;\n","traces":[],"covered":0,"coverable":0},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-cli","src","main.rs"],"content":"use std::{path::PathBuf, str::FromStr};\n\nuse clap::{Parser, Subcommand};\nuse zk_por_cli::{\n    constant::{DEFAULT_USER_PROOF_FILE_PATTERN, GLOBAL_PROOF_FILENAME},\n    prover::prove,\n    verifier::{verify_global, verify_user},\n};\nuse zk_por_core::error::PoRError;\n\n#[derive(Parser)]\n#[command(version, about, long_about = None)]\nstruct Cli {\n    #[command(subcommand)]\n    command: Option\u003cZkPorCommitCommands\u003e,\n}\n\npub trait Execute {\n    fn execute(\u0026self) -\u003e std::result::Result\u003c(), PoRError\u003e;\n}\n\n#[derive(Subcommand)]\npub enum ZkPorCommitCommands {\n    Prove {\n        #[arg(short, long)]\n        cfg_path: String, // path to config file\n        #[arg(short, long)]\n        output_path: String, // path to output file\n    },\n    VerifyGlobal {\n        #[arg(short, long)]\n        proof_path: String,\n    },\n\n    VerifyUser {\n        #[arg(short, long)]\n        global_proof_path: String,\n        #[arg(short, long)]\n        user_proof_path_pattern: String,\n    },\n}\n\nimpl Execute for Option\u003cZkPorCommitCommands\u003e {\n    fn execute(\u0026self) -\u003e std::result::Result\u003c(), PoRError\u003e {\n        match self {\n            Some(ZkPorCommitCommands::Prove { cfg_path, output_path }) =\u003e {\n                let cfg = zk_por_core::config::ProverConfig::load(\u0026cfg_path)\n                    .map_err(|e| PoRError::ConfigError(e))?;\n                let prover_cfg = cfg.try_deserialize().unwrap();\n                let output_path = PathBuf::from_str(\u0026output_path).unwrap();\n                prove(prover_cfg, output_path)\n            }\n\n            Some(ZkPorCommitCommands::VerifyGlobal { proof_path: global_proof_path }) =\u003e {\n                let global_proof_path = PathBuf::from_str(\u0026global_proof_path).unwrap();\n                verify_global(global_proof_path, true)\n            }\n\n            Some(ZkPorCommitCommands::VerifyUser {\n                global_proof_path,\n                user_proof_path_pattern,\n            }) =\u003e {\n                let global_proof_path = PathBuf::from_str(\u0026global_proof_path).unwrap();\n                verify_user(global_proof_path, user_proof_path_pattern, true)\n            }\n\n            None =\u003e {\n                println!(\"============Validation started============\");\n                let global_proof_path = PathBuf::from_str(GLOBAL_PROOF_FILENAME).unwrap();\n                let user_proof_path_pattern = DEFAULT_USER_PROOF_FILE_PATTERN.to_owned();\n                if verify_global(global_proof_path.clone(), false).is_ok() {\n                    println!(\"Total sum and non-negative constraint validation passed\")\n                } else {\n                    println!(\"Total sum and non-negative constraint validation failed\")\n                }\n\n                if verify_user(global_proof_path, \u0026user_proof_path_pattern, false).is_ok() {\n                    println!(\"Inclusion constraint validation passed\")\n                } else {\n                    println!(\"Inclusion constraint validation failed\")\n                }\n                println!(\"============Validation finished============\");\n                Ok(())\n            }\n        }\n    }\n}\n\nfn main() -\u003e std::result::Result\u003c(), PoRError\u003e {\n    let cli = Cli::parse();\n    let r = cli.command.execute();\n    println!(\"Execution result: {:?}\", r);\n    Ok(())\n}\n","traces":[],"covered":0,"coverable":0},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-cli","src","prover.rs"],"content":"use super::constant::{\n    DEFAULT_BATCH_SIZE, GLOBAL_INFO_FILENAME, GLOBAL_PROOF_FILENAME, RECURSION_BRANCHOUT_NUM,\n    USER_PROOF_DIRNAME,\n};\nuse indicatif::ProgressBar;\nuse plonky2::hash::hash_types::HashOut;\nuse plonky2_field::types::PrimeField64;\nuse rayon::{iter::ParallelIterator, prelude::*};\nuse serde_json::json;\nuse std::{\n    fs,\n    fs::File,\n    io::Write,\n    path::PathBuf,\n    str::FromStr,\n    sync::{Arc, RwLock},\n};\nuse zk_por_core::{\n    account::{persist_account_id_to_gmst_pos, Account},\n    circuit_config::{get_recursive_circuit_configs, STANDARD_CONFIG},\n    circuit_registry::registry::CircuitRegistry,\n    config::{ConfigProver, ProverConfig},\n    database::{PoRDB, PoRGMSTMemoryDB, PoRLevelDB, PoRLevelDBOption},\n    e2e::{batch_prove_accounts, prove_subproofs},\n    error::PoRError,\n    global::{GlobalConfig, GlobalMst, GLOBAL_MST},\n    merkle_proof::MerkleProof,\n    merkle_sum_prover::circuits::merkle_sum_circuit::MerkleSumNodeTarget,\n    merkle_sum_tree::MerkleSumTree,\n    parser::{AccountParser, FileAccountReader, FileManager, FilesCfg},\n    recursive_prover::recursive_circuit::RecursiveTargets,\n    types::F,\n    General, Info, Proof,\n};\nuse zk_por_tracing::{init_tracing, TraceConfig};\n\n// as we use one thread to prove each batch, we load num_cpus batches to increase the parallelism.\nfn calculate_per_parse_account_num(batch_size: usize, threads_num: usize) -\u003e usize {\n    let num_cpus = num_cpus::get();\n    let num_cpus = if threads_num \u003c num_cpus { threads_num } else { num_cpus };\n    num_cpus * batch_size\n}\n\nfn ensure_output_dir_empty(user_proof_dir: PathBuf) -\u003e Result\u003c(), PoRError\u003e {\n    fs::create_dir_all(\u0026user_proof_dir).map_err(|e| return PoRError::Io(e))?;\n    let is_empty =\n        fs::read_dir(user_proof_dir.clone()).map_err(|e| return PoRError::Io(e))?.count() == 0;\n    if !is_empty {\n        return Err(PoRError::Io(std::io::Error::new(\n            std::io::ErrorKind::AlreadyExists,\n            format!(\n                \"user proof output directory {} is not empty\",\n                user_proof_dir.to_str().unwrap(),\n            ),\n        )));\n    }\n    return Ok(());\n}\n\npub fn prove(cfg: ProverConfig, proof_output_path: PathBuf) -\u003e Result\u003c(), PoRError\u003e {\n    let trace_cfg: TraceConfig = cfg.log.into();\n\n    let _g = init_tracing(trace_cfg);\n    let user_proof_output_path = proof_output_path.join(USER_PROOF_DIRNAME);\n    ensure_output_dir_empty(user_proof_output_path)?;\n\n    let mut database: Box\u003cdyn PoRDB\u003e;\n    if let Some(level_db_config) = cfg.db {\n        database = Box::new(PoRLevelDB::new(PoRLevelDBOption {\n            user_map_dir: level_db_config.level_db_user_path.to_string(),\n            gmst_dir: level_db_config.level_db_gmst_path.to_string(),\n        }));\n    } else {\n        database = Box::new(PoRGMSTMemoryDB::new());\n    }\n\n    let batch_size = cfg.prover.batch_size.unwrap_or(DEFAULT_BATCH_SIZE);\n    let token_num = cfg.prover.tokens.len();\n    let batch_prove_threads_num = cfg.prover.batch_prove_threads_num;\n    let recursive_prove_threads_num = cfg.prover.recursive_prove_threads_num;\n\n    // the path to dump the final generated proof\n    let file_manager = FileManager {};\n    let mut account_parser = FileAccountReader::new(\n        FilesCfg {\n            dir: std::path::PathBuf::from_str(\u0026cfg.prover.user_data_path).unwrap(),\n            batch_size: batch_size,\n            tokens: cfg.prover.tokens.clone(),\n        },\n        \u0026file_manager,\n    );\n    account_parser.log_state();\n\n    let batch_num = account_parser.total_num_of_users().div_ceil(batch_size);\n\n    match GLOBAL_MST.set(RwLock::new(GlobalMst::new(GlobalConfig {\n        num_of_tokens: token_num,\n        num_of_batches: batch_num,\n        batch_size: batch_size,\n        recursion_branchout_num: RECURSION_BRANCHOUT_NUM,\n    }))) {\n        Ok(_) =\u003e (),\n        Err(_) =\u003e {\n            panic!(\"set global mst error\");\n        }\n    }\n\n    let recursive_circuit_configs =\n        get_recursive_circuit_configs::\u003cRECURSION_BRANCHOUT_NUM\u003e(batch_num);\n    let recursive_level = recursive_circuit_configs.len();\n\n    tracing::info!(\n        \"start to precompute circuits and empty proofs for {} recursive levels\",\n        recursive_level\n    );\n    let circuit_registry = CircuitRegistry::\u003cRECURSION_BRANCHOUT_NUM\u003e::init(\n        batch_size,\n        token_num,\n        STANDARD_CONFIG,\n        recursive_circuit_configs,\n    );\n\n    tracing::info!(\n        \"start to prove {} accounts with {} tokens, {} batch size, {} recursive level\",\n        account_parser.total_num_of_users(),\n        token_num,\n        batch_size,\n        recursive_level,\n    );\n\n    let start = std::time::Instant::now();\n    let mut offset = 0;\n    let per_parse_account_num =\n        calculate_per_parse_account_num(batch_size, batch_prove_threads_num);\n\n    let mut parse_num = 0;\n    let mut batch_proofs = vec![];\n    let bar = ProgressBar::new(account_parser.total_num_of_users() as u64);\n    while offset \u003c account_parser.total_num_of_users() {\n        parse_num += 1;\n        let mut accounts =\n            account_parser.read_n_accounts(offset, per_parse_account_num, \u0026file_manager);\n\n        persist_account_id_to_gmst_pos(\u0026mut database, \u0026accounts, offset);\n\n        let account_num = accounts.len();\n        if account_num % batch_size != 0 {\n            let pad_num = batch_size - account_num % batch_size;\n            tracing::info!(\"in {} parse, account number {} is not a multiple of batch size {}, hence padding {} empty accounts\", parse_num, account_num, batch_size,pad_num);\n            accounts.resize(account_num + pad_num, Account::get_empty_account(token_num));\n        }\n\n        assert_eq!(accounts.len() % batch_size, 0);\n\n        tracing::debug!(\n            \"parse {} times, with number of accounts {}, number of batches {}\",\n            parse_num,\n            account_num,\n            batch_num,\n        );\n\n        let msts: Vec\u003cMerkleSumTree\u003e = accounts\n            .par_chunks(batch_size)\n            .map(|account_batch| MerkleSumTree::new_tree_from_accounts(\u0026account_batch.to_vec()))\n            .collect();\n\n        let global_mst = GLOBAL_MST.get().unwrap();\n        let mut _g: std::sync::RwLockWriteGuard\u003cGlobalMst\u003e =\n            global_mst.write().expect(\"unable to get a lock\");\n        let batch_idx_base = batch_proofs.len();\n\n        let root_hashes: Vec\u003cHashOut\u003cF\u003e\u003e = msts\n            .into_iter()\n            .enumerate()\n            .map(|(i, mst)| {\n                let batch_idx = batch_idx_base + i;\n                mst.merkle_sum_tree.iter().enumerate().for_each(|(j, node)| {\n                    _g.set_batch_hash(batch_idx, j, node.hash);\n                });\n                mst.get_root().hash\n            })\n            .collect();\n        drop(_g);\n\n        let proofs =\n            batch_prove_accounts(\u0026circuit_registry, accounts, batch_prove_threads_num, batch_size);\n\n        assert_eq!(proofs.len(), root_hashes.len());\n\n        proofs.iter().zip(root_hashes.iter()).enumerate().for_each(|(i, (proof, root_hash))|{\n            let batch_idx = batch_idx_base + i;\n            // exclude the first two pub inputs for equity and debt\n            let hash_offset = MerkleSumNodeTarget::pub_input_root_hash_offset();\n            let proof_root_hash = HashOut::\u003cF\u003e::from_partial(\u0026proof.public_inputs[hash_offset]);\n            if proof_root_hash != *root_hash {\n                panic!(\"The root hash in proof is not equal to the one generated by merkle sum tree for batch {}\", batch_idx);\n            }\n        });\n\n        batch_proofs.extend(proofs.into_iter());\n\n        tracing::debug!(\n            \"finish {}/{} batches of accounts in {} parse, since start {:?}\",\n            batch_proofs.len(),\n            batch_num,\n            parse_num,\n            start.elapsed()\n        );\n        bar.inc(account_num as u64);\n        offset += per_parse_account_num;\n    }\n    bar.finish();\n\n    tracing::info!(\n        \"finish batch proving {} accounts, generating {} proofs in {:?}\",\n        account_parser.total_num_of_users(),\n        batch_proofs.len(),\n        start.elapsed()\n    );\n\n    let batch_proof_num = batch_proofs.len();\n\n    let (batch_circuit, _) = circuit_registry.get_batch_circuit();\n    let mut last_level_circuit_vd = batch_circuit.verifier_only.clone();\n    let mut last_level_proofs = batch_proofs;\n    let recursive_levels = circuit_registry.get_recursive_levels();\n\n    // level 0 for mst root hash\n    for level in 1..=recursive_levels {\n        let start = std::time::Instant::now();\n        let last_level_vd_digest = last_level_circuit_vd.circuit_digest;\n        let last_level_empty_proof = circuit_registry\n            .get_empty_proof(\u0026last_level_vd_digest)\n            .expect(\n                format!(\"fail to find empty proof for circuit vd {:?}\", last_level_vd_digest)\n                    .as_str(),\n            )\n            .clone();\n\n        let subproof_len = last_level_proofs.len();\n\n        tracing::info!(\n            \"start to recursively prove {} subproofs at level {}/{}\",\n            subproof_len,\n            level,\n            recursive_levels,\n        );\n\n        if subproof_len % RECURSION_BRANCHOUT_NUM != 0 {\n            let pad_num = RECURSION_BRANCHOUT_NUM - subproof_len % RECURSION_BRANCHOUT_NUM;\n            tracing::info!(\"At level {}, {} subproofs are not a multiple of RECURSION_BRANCHOUT_NUM {}, hence padding {} empty proofs. \", level, subproof_len, RECURSION_BRANCHOUT_NUM, pad_num);\n\n            last_level_proofs.resize(subproof_len + pad_num, last_level_empty_proof);\n        }\n\n        let global_mst = GLOBAL_MST.get().unwrap();\n        let mut _g = global_mst.write().expect(\"unable to get a lock\");\n        last_level_proofs.iter().enumerate().for_each(|(i, proof)| {\n            let hash_offset = RecursiveTargets::\u003cRECURSION_BRANCHOUT_NUM\u003e::pub_input_hash_offset();\n            let proof_root_hash = HashOut::\u003cF\u003e::from_partial(\u0026proof.public_inputs[hash_offset]);\n\n            _g.set_recursive_hash(level - 1, i, proof_root_hash);\n        });\n        drop(_g);\n\n        let this_level_proofs = prove_subproofs(\n            last_level_proofs,\n            last_level_circuit_vd.clone(),\n            \u0026circuit_registry,\n            recursive_prove_threads_num,\n            level,\n        );\n\n        let recursive_circuit = circuit_registry\n            .get_recursive_circuit(\u0026last_level_circuit_vd.circuit_digest)\n            .expect(\n                format!(\n                    \"No recursive circuit found for inner circuit with vd {:?}\",\n                    last_level_circuit_vd.circuit_digest\n                )\n                .as_str(),\n            )\n            .0;\n\n        last_level_circuit_vd = recursive_circuit.verifier_only.clone();\n        last_level_proofs = this_level_proofs;\n\n        tracing::debug!(\n            \"finish recursive level {} with {} proofs in : {:?}\",\n            level,\n            last_level_proofs.len(),\n            start.elapsed()\n        );\n    }\n\n    if last_level_proofs.len() != 1 {\n        panic!(\"The last level proofs should be of length 1, but got {}\", last_level_proofs.len());\n    }\n    let root_proof = last_level_proofs.pop().unwrap();\n\n    // Set the root hash of the recursive circuit to the global mst\n    let hash_offset = RecursiveTargets::\u003cRECURSION_BRANCHOUT_NUM\u003e::pub_input_hash_offset();\n    let proof_root_hash = HashOut::\u003cF\u003e::from_partial(\u0026root_proof.public_inputs[hash_offset]);\n\n    let global_mst = GLOBAL_MST.get().unwrap();\n    let mut _g = global_mst.write().expect(\"unable to get a lock\");\n    _g.set_recursive_hash(recursive_levels, 0, proof_root_hash);\n    drop(_g);\n\n    let start = std::time::Instant::now();\n    assert!(GLOBAL_MST.get().unwrap().read().unwrap().is_integral());\n    tracing::info!(\"verify global mst in {:?}\", start.elapsed());\n\n    circuit_registry\n        .get_root_circuit()\n        .verify(root_proof.clone())\n        .expect(\"fail to verify root proof\");\n\n    tracing::info!(\n        \"finish recursive proving {} subproofs in {:?}\",\n        batch_proof_num,\n        start.elapsed()\n    );\n\n    let root_circuit_digest = circuit_registry.get_root_circuit().verifier_only.circuit_digest;\n\n    let proof = Proof {\n        general: General {\n            round_num: cfg.prover.round_no,\n            batch_num: batch_num,\n            recursion_branchout_num: RECURSION_BRANCHOUT_NUM,\n            batch_size: batch_size,\n            token_num: token_num,\n        },\n        root_vd_digest: root_circuit_digest,\n        proof: root_proof,\n    };\n\n    // persist gmst to database\n\n    let global_mst = GLOBAL_MST.get().unwrap();\n\n    let _g = global_mst.read().expect(\"unable to get a lock\");\n    let root_hash = _g.get_root().expect(\"no root\");\n    tracing::info!(\"root hash is {:?}\", root_hash);\n    let start = std::time::Instant::now();\n    _g.persist(\u0026mut database);\n    tracing::info!(\"persist gmst to db in {:?}\", start.elapsed());\n\n    dump_proofs(\u0026cfg.prover, proof_output_path, database, \u0026proof)?;\n    tracing::info!(\"finish dumping global proof and user proofs in {:?}\", start.elapsed());\n\n    return Ok(());\n}\n\nfn dump_proofs(\n    cfg: \u0026ConfigProver,\n    proof_output_dir_path: PathBuf,\n    db: Box\u003cdyn PoRDB\u003e,\n    root_proof: \u0026Proof,\n) -\u003e Result\u003c(), PoRError\u003e {\n    let user_proof_output_dir_path = proof_output_dir_path.join(USER_PROOF_DIRNAME); // directory has been checked empty before.\n\n    let global_proof_output_path = proof_output_dir_path.join(GLOBAL_PROOF_FILENAME);\n    let mut global_proof_file =\n        File::create(global_proof_output_path.clone()).map_err(|e| PoRError::Io(e))?;\n\n    global_proof_file\n        .write_all(json!(root_proof).to_string().as_bytes())\n        .map_err(|e| return PoRError::Io(e))?;\n\n    ///////////////////////////////////////////////\n    let hash_offset = RecursiveTargets::\u003cRECURSION_BRANCHOUT_NUM\u003e::pub_input_hash_offset();\n    let root_hash = HashOut::\u003cF\u003e::from_partial(\u0026root_proof.proof.public_inputs[hash_offset]);\n    let root_hash_bytes = root_hash\n        .elements\n        .iter()\n        .map(|x| x.to_canonical_u64().to_le_bytes())\n        .flatten()\n        .collect::\u003cVec\u003cu8\u003e\u003e();\n    let root_hash = hex::encode(root_hash_bytes);\n\n    let equity_offset = RecursiveTargets::\u003cRECURSION_BRANCHOUT_NUM\u003e::pub_input_equity_offset();\n    let equity_sum = root_proof.proof.public_inputs[equity_offset].to_canonical_u64();\n\n    let debt_offset = RecursiveTargets::\u003cRECURSION_BRANCHOUT_NUM\u003e::pub_input_debt_offset();\n    let debt_sum = root_proof.proof.public_inputs[debt_offset].to_canonical_u64();\n    assert!(equity_sum \u003e= debt_sum);\n    let balance_sum = equity_sum - debt_sum;\n    let info = Info {\n        root_hash: root_hash,\n        equity_sum: equity_sum,\n        debt_sum: debt_sum,\n        balance_sum: balance_sum,\n    };\n\n    let global_info_output_path = proof_output_dir_path.join(GLOBAL_INFO_FILENAME);\n    let mut global_info_file =\n        File::create(global_info_output_path.clone()).map_err(|e| PoRError::Io(e))?;\n\n    global_info_file\n        .write_all(json!(info).to_string().as_bytes())\n        .map_err(|e| return PoRError::Io(e))?;\n\n    ///////////////////////////////////////////////\n    // generate and dump proof for each user\n    // create a new account reader to avoid buffering previously loaded accounts in memory\n    let file_manager = FileManager {};\n    let batch_size = cfg.batch_size.unwrap_or(DEFAULT_BATCH_SIZE);\n    let mut account_reader = FileAccountReader::new(\n        FilesCfg {\n            dir: std::path::PathBuf::from_str(\u0026cfg.user_data_path).unwrap(),\n            batch_size: batch_size,\n            tokens: cfg.tokens.clone(),\n        },\n        \u0026file_manager,\n    );\n\n    let global_cfg = GlobalConfig {\n        num_of_tokens: cfg.tokens.len(),\n        num_of_batches: account_reader.total_num_of_batches,\n        batch_size: batch_size,\n        recursion_branchout_num: RECURSION_BRANCHOUT_NUM,\n    };\n    let user_num = account_reader.total_num_of_users();\n\n    tracing::info!(\"start to generate and dump merkle proof for each of {} accounts\", user_num);\n\n    let bar = ProgressBar::new(user_num as u64);\n    let per_parse_account_num =\n        calculate_per_parse_account_num(batch_size, cfg.batch_prove_threads_num);\n\n    let cdb: Arc\u003cdyn PoRDB\u003e = Arc::from(db);\n    let mut offset = 0;\n    let chunk_size: usize = num_cpus::get();\n    while offset \u003c account_reader.total_num_of_users() {\n        let accounts: Vec\u003cAccount\u003e =\n            account_reader.read_n_accounts(offset, per_parse_account_num, \u0026file_manager);\n        accounts.chunks(chunk_size).for_each(|chunk| {\n            chunk.par_iter().for_each(|account| {\n                let user_proof = MerkleProof::new_from_account(account, cdb.clone(), \u0026global_cfg)\n                    .expect(\n                        format!(\"fail to generate merkle proof for account {}\", account.id)\n                            .as_str(),\n                    );\n\n                let user_proof_output_path =\n                    user_proof_output_dir_path.join(format!(\"{}.json\", account.id));\n\n                let mut user_proof_file = File::create(user_proof_output_path).expect(\n                    format!(\"fail to create user proof file for account {}\", user_proof.account.id)\n                        .as_str(),\n                );\n\n                user_proof_file.write_all(json!(user_proof).to_string().as_bytes()).expect(\n                    format!(\"fail to write user proof file for account {}\", user_proof.account.id)\n                        .as_str(),\n                );\n            });\n\n            bar.inc(chunk.len() as u64);\n        });\n        offset += per_parse_account_num;\n    }\n    bar.finish();\n\n    return Ok(());\n}\n","traces":[{"line":38,"address":[9388864],"length":1,"stats":{"Line":0}},{"line":39,"address":[9388888],"length":1,"stats":{"Line":0}},{"line":40,"address":[9388908],"length":1,"stats":{"Line":0}},{"line":41,"address":[9388968,9388940],"length":1,"stats":{"Line":0}},{"line":44,"address":[9388992,9390163],"length":1,"stats":{"Line":0}},{"line":45,"address":[9390161,9390192,9390200,9389022,9389088,9389175],"length":1,"stats":{"Line":0}},{"line":46,"address":[9390232,9389163,9389309,9390159,9390224],"length":1,"stats":{"Line":0}},{"line":48,"address":[9389598],"length":1,"stats":{"Line":0}},{"line":49,"address":[9390049],"length":1,"stats":{"Line":0}},{"line":50,"address":[9389607],"length":1,"stats":{"Line":0}},{"line":51,"address":[9389928],"length":1,"stats":{"Line":0}},{"line":53,"address":[9389615,9389802,9389666],"length":1,"stats":{"Line":0}},{"line":57,"address":[9389637],"length":1,"stats":{"Line":0}},{"line":60,"address":[9390256,9426625,9391703],"length":1,"stats":{"Line":0}},{"line":61,"address":[9390370],"length":1,"stats":{"Line":0}},{"line":63,"address":[9390651],"length":1,"stats":{"Line":0}},{"line":64,"address":[9390686,9390766],"length":1,"stats":{"Line":0}},{"line":65,"address":[9390814,9390938,9426358],"length":1,"stats":{"Line":0}},{"line":68,"address":[9390887,9391885,9391067],"length":1,"stats":{"Line":0}},{"line":69,"address":[9391305,9391538],"length":1,"stats":{"Line":0}},{"line":70,"address":[9391136],"length":1,"stats":{"Line":0}},{"line":71,"address":[9391241],"length":1,"stats":{"Line":0}},{"line":74,"address":[9391143,9391854],"length":1,"stats":{"Line":0}},{"line":77,"address":[9391669,9391906],"length":1,"stats":{"Line":0}},{"line":78,"address":[9391914],"length":1,"stats":{"Line":0}},{"line":79,"address":[9391961],"length":1,"stats":{"Line":0}},{"line":80,"address":[9391981],"length":1,"stats":{"Line":0}},{"line":85,"address":[9392182],"length":1,"stats":{"Line":0}},{"line":86,"address":[9392001],"length":1,"stats":{"Line":0}},{"line":88,"address":[9392115],"length":1,"stats":{"Line":0}},{"line":92,"address":[9392293],"length":1,"stats":{"Line":0}},{"line":94,"address":[9392356],"length":1,"stats":{"Line":0}},{"line":96,"address":[9392437],"length":1,"stats":{"Line":0}},{"line":104,"address":[9426311,9392603],"length":1,"stats":{"Line":0}},{"line":108,"address":[9392632],"length":1,"stats":{"Line":0}},{"line":110,"address":[9392735,9392671],"length":1,"stats":{"Line":0}},{"line":112,"address":[9392895,9393311,9393938,9393640,9393510,9394208,9394014],"length":1,"stats":{"Line":0}},{"line":120,"address":[9393705],"length":1,"stats":{"Line":0}},{"line":123,"address":[9395608,9395532,9395071,9395270,9396175,9395400,9394655],"length":1,"stats":{"Line":0}},{"line":131,"address":[9396499,9395465],"length":1,"stats":{"Line":0}},{"line":132,"address":[9396514],"length":1,"stats":{"Line":0}},{"line":133,"address":[9396526],"length":1,"stats":{"Line":0}},{"line":136,"address":[9396565],"length":1,"stats":{"Line":0}},{"line":137,"address":[9396584],"length":1,"stats":{"Line":0}},{"line":138,"address":[9396591,9396675],"length":1,"stats":{"Line":0}},{"line":139,"address":[9426154,9396696,9396799],"length":1,"stats":{"Line":0}},{"line":140,"address":[9396823,9418357,9418311],"length":1,"stats":{"Line":0}},{"line":141,"address":[9418318,9418378],"length":1,"stats":{"Line":0}},{"line":144,"address":[9418386],"length":1,"stats":{"Line":0}},{"line":146,"address":[9418462],"length":1,"stats":{"Line":0}},{"line":147,"address":[9418505],"length":1,"stats":{"Line":0}},{"line":148,"address":[9418843,9418595],"length":1,"stats":{"Line":0}},{"line":149,"address":[9419287,9418871,9419486,9419833,9420357,9419757,9419616],"length":1,"stats":{"Line":0}},{"line":150,"address":[9419681,9420658],"length":1,"stats":{"Line":0}},{"line":153,"address":[9418565,9420742],"length":1,"stats":{"Line":0}},{"line":155,"address":[9422038,9421962,9421076,9422452,9421492,9421821,9421691],"length":1,"stats":{"Line":0}},{"line":162,"address":[9421886,9422753],"length":1,"stats":{"Line":0}},{"line":164,"address":[9426831,9426768],"length":1,"stats":{"Line":0}},{"line":167,"address":[9422993,9422837],"length":1,"stats":{"Line":0}},{"line":168,"address":[9423009],"length":1,"stats":{"Line":0}},{"line":170,"address":[9423177,9423113],"length":1,"stats":{"Line":0}},{"line":172,"address":[9423185],"length":1,"stats":{"Line":0}},{"line":175,"address":[9426960,9427325,9426990],"length":1,"stats":{"Line":0}},{"line":176,"address":[9427089,9427037],"length":1,"stats":{"Line":0}},{"line":177,"address":[9427160,9427394,9427360,9427063],"length":1,"stats":{"Line":0}},{"line":178,"address":[9427404],"length":1,"stats":{"Line":0}},{"line":180,"address":[9427225],"length":1,"stats":{"Line":0}},{"line":183,"address":[9423333],"length":1,"stats":{"Line":0}},{"line":185,"address":[9423419],"length":1,"stats":{"Line":0}},{"line":188,"address":[9423578,9423514],"length":1,"stats":{"Line":0}},{"line":190,"address":[9423760,9427488,9427503],"length":1,"stats":{"Line":0}},{"line":191,"address":[9427658,9427548],"length":1,"stats":{"Line":0}},{"line":193,"address":[9427574],"length":1,"stats":{"Line":0}},{"line":194,"address":[9427604],"length":1,"stats":{"Line":0}},{"line":195,"address":[9427641],"length":1,"stats":{"Line":0}},{"line":196,"address":[9427750],"length":1,"stats":{"Line":0}},{"line":200,"address":[9424025],"length":1,"stats":{"Line":0}},{"line":202,"address":[9425745,9424957,9425075,9425139,9424263,9424658,9424845],"length":1,"stats":{"Line":0}},{"line":209,"address":[9425013],"length":1,"stats":{"Line":0}},{"line":210,"address":[9426051,9426109],"length":1,"stats":{"Line":0}},{"line":212,"address":[9396804],"length":1,"stats":{"Line":0}},{"line":214,"address":[9398200],"length":1,"stats":{"Line":0}},{"line":221,"address":[9397823,9398808],"length":1,"stats":{"Line":0}},{"line":223,"address":[9398832],"length":1,"stats":{"Line":0}},{"line":224,"address":[9398855],"length":1,"stats":{"Line":0}},{"line":225,"address":[9398877],"length":1,"stats":{"Line":0}},{"line":226,"address":[9398933,9398997],"length":1,"stats":{"Line":0}},{"line":229,"address":[9399213,9399005,9418178],"length":1,"stats":{"Line":0}},{"line":230,"address":[9399229,9410431],"length":1,"stats":{"Line":0}},{"line":231,"address":[9410446],"length":1,"stats":{"Line":0}},{"line":232,"address":[9410494,9410839],"length":1,"stats":{"Line":0}},{"line":235,"address":[9410619,9410748],"length":1,"stats":{"Line":0}},{"line":240,"address":[9410964],"length":1,"stats":{"Line":0}},{"line":242,"address":[9412000,9412490,9411563,9411147,9411762,9411892,9412076],"length":1,"stats":{"Line":0}},{"line":249,"address":[9411957,9412775],"length":1,"stats":{"Line":0}},{"line":250,"address":[9412822,9413029],"length":1,"stats":{"Line":0}},{"line":251,"address":[9413057,9413943,9414019,9413672,9414540,9413802,9413473],"length":1,"stats":{"Line":0}},{"line":253,"address":[9413867,9414841],"length":1,"stats":{"Line":0}},{"line":256,"address":[9412793,9415033],"length":1,"stats":{"Line":0}},{"line":257,"address":[9415049],"length":1,"stats":{"Line":0}},{"line":258,"address":[9415153,9427824,9427861,9415233],"length":1,"stats":{"Line":0}},{"line":259,"address":[9427871],"length":1,"stats":{"Line":0}},{"line":260,"address":[9427897],"length":1,"stats":{"Line":0}},{"line":262,"address":[9427934,9428066],"length":1,"stats":{"Line":0}},{"line":264,"address":[9415318],"length":1,"stats":{"Line":0}},{"line":267,"address":[9415352],"length":1,"stats":{"Line":0}},{"line":268,"address":[9415416],"length":1,"stats":{"Line":0}},{"line":274,"address":[9415949,9415559],"length":1,"stats":{"Line":0}},{"line":275,"address":[9415543],"length":1,"stats":{"Line":0}},{"line":277,"address":[9415850,9415623,9415721],"length":1,"stats":{"Line":0}},{"line":283,"address":[9415873,9415998],"length":1,"stats":{"Line":0}},{"line":285,"address":[9416025],"length":1,"stats":{"Line":0}},{"line":286,"address":[9416145],"length":1,"stats":{"Line":0}},{"line":288,"address":[9417570],"length":1,"stats":{"Line":0}},{"line":296,"address":[9399266,9399198],"length":1,"stats":{"Line":0}},{"line":297,"address":[9410219,9410337,9399303],"length":1,"stats":{"Line":0}},{"line":299,"address":[9399394,9399288],"length":1,"stats":{"Line":0}},{"line":302,"address":[9399402,9399482],"length":1,"stats":{"Line":0}},{"line":303,"address":[9399498],"length":1,"stats":{"Line":0}},{"line":305,"address":[9399567,9399682],"length":1,"stats":{"Line":0}},{"line":306,"address":[9399698],"length":1,"stats":{"Line":0}},{"line":307,"address":[9399802,9399898],"length":1,"stats":{"Line":0}},{"line":308,"address":[9399961],"length":1,"stats":{"Line":0}},{"line":310,"address":[9399995],"length":1,"stats":{"Line":0}},{"line":311,"address":[9400166,9400051,9400426],"length":1,"stats":{"Line":0}},{"line":312,"address":[9401724,9401648,9400774,9401519,9401982,9401389,9401190],"length":1,"stats":{"Line":0}},{"line":314,"address":[9401592,9402270],"length":1,"stats":{"Line":0}},{"line":316,"address":[9402235],"length":1,"stats":{"Line":0}},{"line":319,"address":[9403631],"length":1,"stats":{"Line":0}},{"line":325,"address":[9404090,9403305],"length":1,"stats":{"Line":0}},{"line":328,"address":[9404124],"length":1,"stats":{"Line":0}},{"line":341,"address":[9404527,9404368],"length":1,"stats":{"Line":0}},{"line":343,"address":[9404535],"length":1,"stats":{"Line":0}},{"line":344,"address":[9404715,9404636],"length":1,"stats":{"Line":0}},{"line":345,"address":[9405897,9405559,9404944,9405360,9405689,9405821,9406091],"length":1,"stats":{"Line":0}},{"line":346,"address":[9405754,9406359],"length":1,"stats":{"Line":0}},{"line":347,"address":[9406374],"length":1,"stats":{"Line":0}},{"line":348,"address":[9406580,9407609,9407867,9407325,9407533,9406996,9407195],"length":1,"stats":{"Line":0}},{"line":350,"address":[9408136,9407406,9409949,9408340],"length":1,"stats":{"Line":0}},{"line":351,"address":[9409343,9409419,9409677,9408468,9408884,9409213,9409083],"length":1,"stats":{"Line":0}},{"line":353,"address":[9409286],"length":1,"stats":{"Line":0}},{"line":356,"address":[9434314,9434642,9428096],"length":1,"stats":{"Line":0}},{"line":362,"address":[9428282,9428178],"length":1,"stats":{"Line":0}},{"line":364,"address":[9428322,9428405],"length":1,"stats":{"Line":0}},{"line":365,"address":[9434656,9434664,9434510,9428453,9428520,9428663],"length":1,"stats":{"Line":0}},{"line":368,"address":[9429484,9429262],"length":1,"stats":{"Line":0}},{"line":369,"address":[9429115,9428645,9429174],"length":1,"stats":{"Line":0}},{"line":370,"address":[9429197,9429358,9434696,9429122,9429509,9434453,9434688],"length":1,"stats":{"Line":0}},{"line":373,"address":[9429528],"length":1,"stats":{"Line":0}},{"line":374,"address":[9429583],"length":1,"stats":{"Line":0}},{"line":375,"address":[9429659],"length":1,"stats":{"Line":0}},{"line":378,"address":[9434745,9434720],"length":1,"stats":{"Line":0}},{"line":381,"address":[9429808],"length":1,"stats":{"Line":0}},{"line":383,"address":[9429823,9429887],"length":1,"stats":{"Line":0}},{"line":384,"address":[9429895],"length":1,"stats":{"Line":0}},{"line":386,"address":[9429975],"length":1,"stats":{"Line":0}},{"line":387,"address":[9430006],"length":1,"stats":{"Line":0}},{"line":388,"address":[9430094],"length":1,"stats":{"Line":0}},{"line":389,"address":[9430145,9430331],"length":1,"stats":{"Line":0}},{"line":397,"address":[9430308,9430412],"length":1,"stats":{"Line":0}},{"line":398,"address":[9430527,9434383,9434784,9430670,9434792,9430460],"length":1,"stats":{"Line":0}},{"line":401,"address":[9431491,9431269],"length":1,"stats":{"Line":0}},{"line":402,"address":[9430652,9431122,9431181],"length":1,"stats":{"Line":0}},{"line":403,"address":[9431129,9431516,9434816,9431365,9434323,9434824,9431204],"length":1,"stats":{"Line":0}},{"line":408,"address":[9428146],"length":1,"stats":{"Line":0}},{"line":409,"address":[9431543],"length":1,"stats":{"Line":0}},{"line":411,"address":[9431787],"length":1,"stats":{"Line":0}},{"line":412,"address":[9431598],"length":1,"stats":{"Line":0}},{"line":414,"address":[9431712],"length":1,"stats":{"Line":0}},{"line":420,"address":[9431898],"length":1,"stats":{"Line":0}},{"line":421,"address":[9431981],"length":1,"stats":{"Line":0}},{"line":425,"address":[9432025],"length":1,"stats":{"Line":0}},{"line":427,"address":[9432962,9432220,9433080,9433335,9433144,9432636,9432835],"length":1,"stats":{"Line":0}},{"line":429,"address":[9433018],"length":1,"stats":{"Line":0}},{"line":430,"address":[9433666,9433601],"length":1,"stats":{"Line":0}},{"line":433,"address":[9433674],"length":1,"stats":{"Line":0}},{"line":434,"address":[9433741],"length":1,"stats":{"Line":0}},{"line":435,"address":[9433814,9433753],"length":1,"stats":{"Line":0}},{"line":436,"address":[9433822],"length":1,"stats":{"Line":0}},{"line":437,"address":[9433898],"length":1,"stats":{"Line":0}},{"line":439,"address":[9434126,9434038,9434848],"length":1,"stats":{"Line":0}},{"line":440,"address":[9434903,9434992,9437305,9437355],"length":1,"stats":{"Line":0}},{"line":441,"address":[9435437,9435025],"length":1,"stats":{"Line":0}},{"line":443,"address":[9435240,9435369],"length":1,"stats":{"Line":0}},{"line":448,"address":[9435810,9435663,9435551],"length":1,"stats":{"Line":0}},{"line":450,"address":[9436201,9435833],"length":1,"stats":{"Line":0}},{"line":451,"address":[9436133,9436004],"length":1,"stats":{"Line":0}},{"line":455,"address":[9436668,9436744,9437128,9436353,9436609],"length":1,"stats":{"Line":0}},{"line":456,"address":[9436933,9437062],"length":1,"stats":{"Line":0}},{"line":461,"address":[9434965],"length":1,"stats":{"Line":0}},{"line":463,"address":[9434240,9434293],"length":1,"stats":{"Line":0}},{"line":465,"address":[9433874],"length":1,"stats":{"Line":0}},{"line":467,"address":[9433955],"length":1,"stats":{"Line":0}}],"covered":0,"coverable":193},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-cli","src","verifier.rs"],"content":"use indicatif::ProgressBar;\nuse plonky2_field::types::PrimeField64;\nuse rayon::iter::IntoParallelRefIterator;\nuse serde_json::from_reader;\nuse std::{fs::File, path::PathBuf};\n\n// Assuming Proof is defined in lib.rs and lib.rs is in the same crate\nuse super::constant::RECURSION_BRANCHOUT_NUM;\nuse zk_por_core::{\n    circuit_config::{get_recursive_circuit_configs, STANDARD_CONFIG},\n    circuit_registry::registry::CircuitRegistry,\n    error::PoRError,\n    merkle_proof::MerkleProof,\n    recursive_prover::recursive_circuit::RecursiveTargets,\n    types::F,\n    Proof,\n};\n\nuse plonky2::hash::hash_types::HashOut;\nuse rayon::iter::ParallelIterator;\n\nuse glob::glob;\nuse std::io;\n\nfn find_matching_files(pattern: \u0026str) -\u003e Result\u003cVec\u003cPathBuf\u003e, io::Error\u003e {\n    let mut matching_files = Vec::new();\n\n    // Use the glob function to get an iterator of matching paths\n    for entry in glob(pattern).expect(\"Failed to read glob pattern\") {\n        match entry {\n            Ok(path) =\u003e matching_files.push(path),\n            Err(e) =\u003e return Err(io::Error::new(io::ErrorKind::Other, e.to_string())),\n        }\n    }\n\n    Ok(matching_files)\n}\n\npub fn verify_user(\n    global_proof_path: PathBuf,\n    user_proof_path_pattern: \u0026String,\n    verbose: bool,\n) -\u003e Result\u003c(), PoRError\u003e {\n    let proof_file = File::open(\u0026global_proof_path).unwrap();\n    let reader = std::io::BufReader::new(proof_file);\n\n    // Parse the JSON as Proof\n    let proof: Proof = from_reader(reader)\n        .expect(format!(\"fail to parse global proof from path {:?}\", global_proof_path).as_str());\n\n    let hash_offset = RecursiveTargets::\u003cRECURSION_BRANCHOUT_NUM\u003e::pub_input_hash_offset();\n    let root_hash = HashOut::\u003cF\u003e::from_partial(\u0026proof.proof.public_inputs[hash_offset]);\n    let user_proof_paths =\n        find_matching_files(user_proof_path_pattern).map_err(|e| PoRError::Io(e))?;\n    let proof_file_num = user_proof_paths.len();\n    if proof_file_num == 0 {\n        return Err(PoRError::InvalidParameter(format!(\n            \"fail to find any user proof files with pattern {}\",\n            user_proof_path_pattern\n        )));\n    }\n\n    if verbose {\n        println!(\"successfully identify {} user proof files\", proof_file_num);\n    }\n\n    let bar = ProgressBar::new(proof_file_num as u64);\n    let invalid_proof_paths = user_proof_paths\n        .par_iter()\n        .map(|user_proof_path| {\n            let merkle_path = File::open(\u0026user_proof_path).unwrap();\n            let reader = std::io::BufReader::new(merkle_path);\n            let proof: MerkleProof = from_reader(reader).unwrap();\n            let result = proof.verify_merkle_proof(root_hash);\n            if verbose {\n                bar.inc(1);\n            }\n            (result, user_proof_path)\n        })\n        .filter(|(result, _)| result.is_err())\n        .map(|(_, invalid_proof_path)| invalid_proof_path.to_str().unwrap().to_owned())\n        .collect::\u003cVec\u003cString\u003e\u003e();\n    if verbose {\n        bar.finish();\n    }\n\n    let invalid_proof_num = invalid_proof_paths.len();\n    let valid_proof_num = proof_file_num - invalid_proof_num;\n    if verbose {\n        let max_to_display_valid_proof_num = 10;\n\n        println!(\n            \"{}/{} user proofs pass the verification. {} fail, the first {} failed proof files: {:?}\",\n            valid_proof_num, proof_file_num, invalid_proof_num, std::cmp::min(invalid_proof_num, invalid_proof_num), invalid_proof_paths.iter().take(max_to_display_valid_proof_num).collect::\u003cVec\u003c\u0026String\u003e\u003e(),\n        );\n    }\n\n    if invalid_proof_num \u003e 0 {\n        return Err(PoRError::InvalidProof);\n    }\n    Ok(())\n}\n\npub fn verify_global(global_proof_path: PathBuf, verbose: bool) -\u003e Result\u003c(), PoRError\u003e {\n    let proof_file = File::open(\u0026global_proof_path).unwrap();\n    let reader = std::io::BufReader::new(proof_file);\n\n    // Parse the JSON as Proof\n    let proof: Proof = from_reader(reader).unwrap();\n\n    if proof.general.recursion_branchout_num != RECURSION_BRANCHOUT_NUM {\n        panic!(\"The recursion_branchout_num is not configured to be equal to 64\");\n    }\n\n    let token_num = proof.general.token_num;\n    let batch_num = proof.general.batch_num;\n    let round_num = proof.general.round_num;\n    let batch_size = proof.general.batch_size;\n    let recursive_circuit_configs =\n        get_recursive_circuit_configs::\u003cRECURSION_BRANCHOUT_NUM\u003e(batch_num);\n\n    // not to use trace::log to avoid the dependency on the trace config.\n    if verbose {\n        println!(\n            \"start to reconstruct the circuit with {} recursive levels for round {}\",\n            recursive_circuit_configs.len(),\n            round_num\n        );\n    }\n    let start = std::time::Instant::now();\n    let circuit_registry = CircuitRegistry::\u003cRECURSION_BRANCHOUT_NUM\u003e::init(\n        batch_size,\n        token_num,\n        STANDARD_CONFIG,\n        recursive_circuit_configs,\n    );\n\n    let root_circuit = circuit_registry.get_root_circuit();\n\n    let circuit_vd = root_circuit.verifier_only.circuit_digest;\n    if circuit_vd != proof.root_vd_digest {\n        return Err(PoRError::CircuitDigestMismatch);\n    }\n\n    if verbose {\n        println!(\n            \"successfully reconstruct the circuit for round {} in {:?}\",\n            round_num,\n            start.elapsed()\n        );\n\n        let equity = proof.proof.public_inputs\n            [RecursiveTargets::\u003cRECURSION_BRANCHOUT_NUM\u003e::pub_input_equity_offset()];\n        let debt = proof.proof.public_inputs\n            [RecursiveTargets::\u003cRECURSION_BRANCHOUT_NUM\u003e::pub_input_debt_offset()];\n        if !root_circuit.verify(proof.proof).is_ok() {\n            return Err(PoRError::InvalidProof);\n        }\n\n        println!(\"successfully verify the global proof for round {}, total exchange users' equity is {}, debt is {}, exchange liability is {}\",\n        round_num, equity.to_canonical_u64(), debt.to_canonical_u64(), (equity- debt).to_canonical_u64());\n    }\n\n    Ok(())\n}\n","traces":[{"line":25,"address":[9437408,9438220],"length":1,"stats":{"Line":0}},{"line":26,"address":[9437451],"length":1,"stats":{"Line":0}},{"line":29,"address":[9437691,9437535,9437745,9437475],"length":1,"stats":{"Line":0}},{"line":30,"address":[9437809],"length":1,"stats":{"Line":0}},{"line":31,"address":[9438060,9437941],"length":1,"stats":{"Line":0}},{"line":32,"address":[9438065,9437997],"length":1,"stats":{"Line":0}},{"line":36,"address":[9437854],"length":1,"stats":{"Line":0}},{"line":39,"address":[9441889,9441825,9438256],"length":1,"stats":{"Line":0}},{"line":44,"address":[9438318,9438608],"length":1,"stats":{"Line":0}},{"line":45,"address":[9438615],"length":1,"stats":{"Line":0}},{"line":48,"address":[9439010,9438650],"length":1,"stats":{"Line":0}},{"line":49,"address":[9441852,9438930,9438769,9439048],"length":1,"stats":{"Line":0}},{"line":51,"address":[9439119],"length":1,"stats":{"Line":0}},{"line":52,"address":[9439168],"length":1,"stats":{"Line":0}},{"line":53,"address":[9441834,9441904,9441912,9439451,9439225],"length":1,"stats":{"Line":0}},{"line":55,"address":[9439428,9439621],"length":1,"stats":{"Line":0}},{"line":56,"address":[9439629],"length":1,"stats":{"Line":0}},{"line":57,"address":[9439771,9439900],"length":1,"stats":{"Line":0}},{"line":63,"address":[9439752],"length":1,"stats":{"Line":0}},{"line":64,"address":[9440146],"length":1,"stats":{"Line":0}},{"line":67,"address":[9440006],"length":1,"stats":{"Line":0}},{"line":68,"address":[9440228,9440363],"length":1,"stats":{"Line":0}},{"line":70,"address":[9440307,9441936,9442737],"length":1,"stats":{"Line":0}},{"line":71,"address":[9442133,9441971],"length":1,"stats":{"Line":0}},{"line":72,"address":[9442140],"length":1,"stats":{"Line":0}},{"line":73,"address":[9442151],"length":1,"stats":{"Line":0}},{"line":74,"address":[9442467],"length":1,"stats":{"Line":0}},{"line":75,"address":[9442571],"length":1,"stats":{"Line":0}},{"line":76,"address":[9442732,9442672],"length":1,"stats":{"Line":0}},{"line":78,"address":[9442580],"length":1,"stats":{"Line":0}},{"line":80,"address":[9442811,9442784],"length":1,"stats":{"Line":0}},{"line":81,"address":[9442832,9443047,9442859],"length":1,"stats":{"Line":0}},{"line":83,"address":[9440439],"length":1,"stats":{"Line":0}},{"line":84,"address":[9440473,9440536],"length":1,"stats":{"Line":0}},{"line":87,"address":[9440449,9440543],"length":1,"stats":{"Line":0}},{"line":88,"address":[9440551,9440608],"length":1,"stats":{"Line":0}},{"line":89,"address":[9440596],"length":1,"stats":{"Line":0}},{"line":90,"address":[9438289],"length":1,"stats":{"Line":0}},{"line":92,"address":[9441361],"length":1,"stats":{"Line":0}},{"line":98,"address":[9440628],"length":1,"stats":{"Line":0}},{"line":99,"address":[9441599],"length":1,"stats":{"Line":0}},{"line":101,"address":[9441558],"length":1,"stats":{"Line":0}},{"line":104,"address":[9443104,9446372,9446510],"length":1,"stats":{"Line":0}},{"line":105,"address":[9443153,9443483],"length":1,"stats":{"Line":0}},{"line":106,"address":[9443490],"length":1,"stats":{"Line":0}},{"line":109,"address":[9443525,9443743],"length":1,"stats":{"Line":0}},{"line":111,"address":[9443751],"length":1,"stats":{"Line":0}},{"line":112,"address":[9443857,9446460],"length":1,"stats":{"Line":0}},{"line":115,"address":[9443762],"length":1,"stats":{"Line":0}},{"line":116,"address":[9443786],"length":1,"stats":{"Line":0}},{"line":117,"address":[9443802],"length":1,"stats":{"Line":0}},{"line":118,"address":[9443818],"length":1,"stats":{"Line":0}},{"line":119,"address":[9443934,9443850],"length":1,"stats":{"Line":0}},{"line":123,"address":[9443942],"length":1,"stats":{"Line":0}},{"line":124,"address":[9444044,9443983],"length":1,"stats":{"Line":0}},{"line":130,"address":[9443946,9444393],"length":1,"stats":{"Line":0}},{"line":135,"address":[9444408],"length":1,"stats":{"Line":0}},{"line":138,"address":[9444655,9444592],"length":1,"stats":{"Line":0}},{"line":140,"address":[9444663],"length":1,"stats":{"Line":0}},{"line":141,"address":[9444693],"length":1,"stats":{"Line":0}},{"line":142,"address":[9444761],"length":1,"stats":{"Line":0}},{"line":145,"address":[9444747],"length":1,"stats":{"Line":0}},{"line":146,"address":[9444952],"length":1,"stats":{"Line":0}},{"line":152,"address":[9445262,9445199],"length":1,"stats":{"Line":0}},{"line":153,"address":[9445212],"length":1,"stats":{"Line":0}},{"line":154,"address":[9445336,9445273],"length":1,"stats":{"Line":0}},{"line":155,"address":[9445286],"length":1,"stats":{"Line":0}},{"line":156,"address":[9445347],"length":1,"stats":{"Line":0}},{"line":157,"address":[9445539],"length":1,"stats":{"Line":0}},{"line":160,"address":[9445854,9445989,9445711],"length":1,"stats":{"Line":0}},{"line":164,"address":[9444820],"length":1,"stats":{"Line":0}}],"covered":0,"coverable":71},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","benches","batch_circuit.rs"],"content":"#![feature(test)]\nuse plonky2::plonk::circuit_builder::CircuitBuilder;\nuse zk_por_core::{\n    account::gen_accounts_with_random_data,\n    circuit_config::STANDARD_CONFIG,\n    merkle_sum_prover::{circuits::account_circuit::AccountTargets, prover::MerkleSumTreeProver},\n    types::{C, D, F},\n};\n\nextern crate test;\nuse test::Bencher;\n\nfn bench(b: \u0026mut Bencher, batch_size: usize) {\n    let mut builder = CircuitBuilder::\u003cF, D\u003e::new(STANDARD_CONFIG);\n    let num_assets = 50;\n    let accounts = gen_accounts_with_random_data(batch_size, num_assets);\n    let prover = MerkleSumTreeProver { accounts };\n    let account_targets: Vec\u003cAccountTargets\u003e = prover.build_merkle_tree_targets(\u0026mut builder);\n    let data = \u0026builder.build::\u003cC\u003e();\n\n    b.iter(|| _ = prover.get_proof_with_circuit_data(account_targets.as_slice(), data));\n}\n\n#[bench]\npub fn bench_batch_size_equal_2(b: \u0026mut Bencher) {\n    bench(b, 2);\n}\n\n#[bench]\npub fn bench_batch_size_equal_16(b: \u0026mut Bencher) {\n    bench(b, 16);\n}\n\n#[bench]\npub fn bench_batch_size_equal_256(b: \u0026mut Bencher) {\n    bench(b, 256);\n}\n\n#[bench]\npub fn bench_batch_size_equal_1024(b: \u0026mut Bencher) {\n    bench(b, 1024);\n}\n\n#[bench]\npub fn bench_batch_size_equal_2048(b: \u0026mut Bencher) {\n    bench(b, 2048);\n}\n\n#[bench]\npub fn bench_batch_size_equal_4096(b: \u0026mut Bencher) {\n    bench(b, 4096);\n}\n","traces":[],"covered":0,"coverable":0},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","benches","benchmark.rs"],"content":"use criterion::{\n    criterion_group, criterion_main, measurement::WallTime, BenchmarkGroup, Criterion, SamplingMode,\n};\nuse zk_por_core::{\n    account::gen_accounts_with_random_data,\n    circuit_config::STANDARD_CONFIG,\n    merkle_sum_prover::{\n        circuits::merkle_sum_circuit::build_merkle_sum_tree_circuit, prover::MerkleSumTreeProver,\n    },\n    recursive_prover::{prover::RecursiveProver, recursive_circuit::build_recursive_n_circuit},\n    types::{C, D, F},\n};\n\nuse plonky2::plonk::proof::ProofWithPublicInputs;\nuse rayon::iter::{IntoParallelIterator, ParallelIterator};\n\n/// Benchmark the batch proving of the accounts. There are {parallism} threads, each thread proving the batch_size accounts.\npub fn bench_batch_circuit(\n    c: \u0026mut BenchmarkGroup\u003cWallTime\u003e,\n    batch_size: usize,\n    num_assets: usize,\n    parallism: usize,\n) {\n    let accounts = gen_accounts_with_random_data(batch_size, num_assets);\n    let bench_id =\n        format!(\"batch_circuit_{}_token_num_{}_parallism_{}\", batch_size, num_assets, parallism);\n    let (circuit_data, account_targets) =\n        build_merkle_sum_tree_circuit(batch_size, num_assets, STANDARD_CONFIG);\n    c.bench_function(bench_id.as_str(), |b| {\n        b.iter(|| {\n            (0..parallism).into_par_iter().for_each(|_| {\n                let prover = MerkleSumTreeProver { accounts: accounts.clone() };\n                let _ = prover.get_proof_with_circuit_data(\u0026account_targets, \u0026circuit_data);\n            });\n        })\n    });\n}\n\npub fn batch_circuit_for_batch_size(c: \u0026mut Criterion) {\n    let mut group = c.benchmark_group(\"batch_circuit_for_batch_size\");\n    group.sample_size(10);\n    let num_assets = 200;\n    let parallism = 1;\n    for \u0026batch_size in [16, 64, 256, 512, 1024].iter() {\n        bench_batch_circuit(\u0026mut group, batch_size, num_assets, parallism);\n    }\n    group.finish();\n}\n\npub fn batch_circuit_for_token_num(c: \u0026mut Criterion) {\n    let mut group = c.benchmark_group(\"batch_circuit_for_token_num\");\n    group.sample_size(10);\n    let batch_size = 1024;\n    let parallism = 1;\n    for \u0026num_assets in [4, 20, 50, 100, 200].iter() {\n        bench_batch_circuit(\u0026mut group, batch_size, num_assets, parallism);\n    }\n    group.finish();\n}\n\npub fn batch_circuit_for_parallism(c: \u0026mut Criterion) {\n    let mut group = c.benchmark_group(\"batch_circuit_for_parallism\");\n    group.sample_size(10);\n    let token_num = 200;\n    for \u0026batch_size in [16, 1024].iter() {\n        for \u0026parallism in [1, 2, 4, 8, 16, 32].iter() {\n            bench_batch_circuit(\u0026mut group, batch_size, token_num, parallism);\n        }\n    }\n    group.finish();\n}\n\npub fn bench_recursive_circuit\u003cconst SUBPROOF_NUM: usize\u003e(\n    g: \u0026mut BenchmarkGroup\u003cWallTime\u003e,\n    parallism: usize,\n) {\n    let batch_size = 1024;\n    let token_num = 4;\n    let (merkle_sum_circuit, account_targets) =\n        build_merkle_sum_tree_circuit(batch_size, token_num, STANDARD_CONFIG);\n\n    let accounts = gen_accounts_with_random_data(batch_size, token_num);\n    let prover = MerkleSumTreeProver { accounts };\n\n    let merkle_sum_proof =\n        prover.get_proof_with_circuit_data(\u0026account_targets, \u0026merkle_sum_circuit);\n\n    let (recursive_circuit, recursive_targets) = build_recursive_n_circuit::\u003cC, SUBPROOF_NUM\u003e(\n        \u0026merkle_sum_circuit.common,\n        \u0026merkle_sum_circuit.verifier_only,\n        STANDARD_CONFIG,\n    );\n\n    let subproofs: [ProofWithPublicInputs\u003cF, C, D\u003e; SUBPROOF_NUM] =\n        std::array::from_fn(|_| merkle_sum_proof.clone());\n    let bench_id = format!(\"recursive_circuit_{}_parallism_{}\", SUBPROOF_NUM, parallism);\n    g.bench_function(bench_id.as_str(), |b| {\n        b.iter(|| {\n            (0..parallism).into_par_iter().for_each(|_| {\n                let recursive_prover = RecursiveProver {\n                    sub_proofs: subproofs.clone(),\n                    sub_circuit_vd: merkle_sum_circuit.verifier_only.clone(),\n                };\n                recursive_prover\n                    .get_proof_with_circuit_data(recursive_targets.clone(), \u0026recursive_circuit);\n            });\n        })\n    });\n}\n\npub fn recursive_circuit_for_branchout(c: \u0026mut Criterion) {\n    let mut group = c.benchmark_group(\"recursive_circuit_for_branchout\");\n    group.sample_size(10);\n    group.sampling_mode(SamplingMode::Flat); // for long running benchmarks\n    let parallism = 1;\n    bench_recursive_circuit::\u003c4\u003e(\u0026mut group, parallism);\n    bench_recursive_circuit::\u003c8\u003e(\u0026mut group, parallism);\n    bench_recursive_circuit::\u003c16\u003e(\u0026mut group, parallism);\n    bench_recursive_circuit::\u003c32\u003e(\u0026mut group, parallism);\n    bench_recursive_circuit::\u003c64\u003e(\u0026mut group, parallism);\n    group.finish();\n}\n\npub fn recursive_circuit_for_parallism(c: \u0026mut Criterion) {\n    let mut group = c.benchmark_group(\"recursive_circuit_for_parallism\");\n    group.sample_size(10);\n    group.sampling_mode(SamplingMode::Flat); // for long running benchmarks\n    const SUBPROOF_NUM: usize = 64;\n    for \u0026parallism in [1, 2, 4].iter() {\n        bench_recursive_circuit::\u003cSUBPROOF_NUM\u003e(\u0026mut group, parallism);\n    }\n}\n\ncriterion_group!(\n    benches,\n    batch_circuit_for_token_num,\n    batch_circuit_for_batch_size,\n    batch_circuit_for_parallism,\n    recursive_circuit_for_branchout,\n    recursive_circuit_for_parallism\n);\ncriterion_main!(benches);\n","traces":[{"line":77,"address":[],"length":0,"stats":{"Line":0}},{"line":78,"address":[],"length":0,"stats":{"Line":0}},{"line":79,"address":[],"length":0,"stats":{"Line":0}},{"line":80,"address":[],"length":0,"stats":{"Line":0}},{"line":82,"address":[],"length":0,"stats":{"Line":0}},{"line":83,"address":[],"length":0,"stats":{"Line":0}},{"line":85,"address":[],"length":0,"stats":{"Line":0}},{"line":86,"address":[],"length":0,"stats":{"Line":0}},{"line":89,"address":[],"length":0,"stats":{"Line":0}},{"line":90,"address":[],"length":0,"stats":{"Line":0}},{"line":91,"address":[],"length":0,"stats":{"Line":0}},{"line":94,"address":[],"length":0,"stats":{"Line":0}},{"line":95,"address":[],"length":0,"stats":{"Line":0}},{"line":96,"address":[],"length":0,"stats":{"Line":0}},{"line":97,"address":[],"length":0,"stats":{"Line":0}},{"line":98,"address":[],"length":0,"stats":{"Line":0}},{"line":99,"address":[],"length":0,"stats":{"Line":0}},{"line":100,"address":[],"length":0,"stats":{"Line":0}},{"line":101,"address":[],"length":0,"stats":{"Line":0}},{"line":102,"address":[],"length":0,"stats":{"Line":0}},{"line":104,"address":[],"length":0,"stats":{"Line":0}},{"line":105,"address":[],"length":0,"stats":{"Line":0}}],"covered":0,"coverable":22},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","benches","merkle_sum_tree.rs"],"content":"#![feature(test)]\nuse zk_por_core::{account::gen_accounts_with_random_data, merkle_sum_tree::MerkleSumTree};\n\nextern crate test;\nuse test::Bencher;\n\nfn bench(b: \u0026mut Bencher, batch_size: usize) {\n    let num_assets = 200;\n    let accounts = gen_accounts_with_random_data(batch_size, num_assets);\n\n    b.iter(|| _ = MerkleSumTree::new_tree_from_accounts(\u0026accounts));\n}\n\n#[bench]\npub fn bench_batch_size_equal_1024(b: \u0026mut Bencher) {\n    bench(b, 1 \u003c\u003c 10);\n}\n\n#[bench]\npub fn bench_batch_size_equal_2048(b: \u0026mut Bencher) {\n    bench(b, 1 \u003c\u003c 11);\n}\n\n#[bench]\npub fn bench_batch_size_equal_4096(b: \u0026mut Bencher) {\n    bench(b, 1 \u003c\u003c 12);\n}\n\n#[bench]\npub fn bench_batch_size_equal_8192(b: \u0026mut Bencher) {\n    bench(b, 1 \u003c\u003c 13);\n}\n\n#[bench]\npub fn bench_batch_size_equal_16384(b: \u0026mut Bencher) {\n    bench(b, 1 \u003c\u003c 14);\n}\n\n#[bench]\npub fn bench_batch_size_equal_32768(b: \u0026mut Bencher) {\n    bench(b, 1 \u003c\u003c 15);\n}\n","traces":[],"covered":0,"coverable":0},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","account.rs"],"content":"use crate::{\n    database::{PoRDB, UserId},\n    types::F,\n};\nuse plonky2::{\n    hash::{hash_types::HashOut, poseidon::PoseidonHash},\n    plonk::config::Hasher,\n};\nuse plonky2_field::types::Field;\nuse rand::Rng;\nuse serde::{Deserialize, Serialize};\n\n/// A struct representing a users account. It represents their equity and debt as a Vector of goldilocks field elements.\n#[derive(Debug, Clone, Serialize, Deserialize)]\npub struct Account {\n    pub id: String, // 256 bit hex string\n    pub equity: Vec\u003cF\u003e,\n    pub debt: Vec\u003cF\u003e,\n}\n\nimpl Account {\n    /// Gets the account hash for a given account.\n    pub fn get_hash(\u0026self) -\u003e HashOut\u003cF\u003e {\n        let sum_equity = self.equity.iter().fold(F::ZERO, |acc, x| acc + *x);\n\n        let sum_debt = self.debt.iter().fold(F::ZERO, |acc, x| acc + *x);\n\n        let id = self.get_user_id_in_field();\n\n        #[allow(clippy::useless_vec)]\n        let hash =\n            PoseidonHash::hash_no_pad(vec![id, vec![sum_equity, sum_debt]].concat().as_slice());\n\n        hash\n    }\n\n    pub fn get_empty_account_with_user_id(user_id: String, num_of_tokens: usize) -\u003e Account {\n        Self {\n            id: user_id,\n            equity: vec![F::default(); num_of_tokens],\n            debt: vec![F::default(); num_of_tokens],\n        }\n    }\n\n    pub fn get_empty_account(num_of_tokens: usize) -\u003e Account {\n        Self {\n            id: \"0\".repeat(64),\n            equity: vec![F::default(); num_of_tokens],\n            debt: vec![F::default(); num_of_tokens],\n        }\n    }\n\n    /// Gets a user id as a vec of 5 GF elements.\n    pub fn get_user_id_in_field(\u0026self) -\u003e Vec\u003cF\u003e {\n        assert!(self.id.len() == 64);\n        #[allow(clippy::useless_vec)]\n        let segments = vec![\n            self.id[0..14].to_string(),  // First 56 bits (14 hex chars)\n            self.id[14..28].to_string(), // Second 56 bits\n            self.id[28..42].to_string(), // Third 56 bits\n            self.id[42..56].to_string(), // Fourth 56 bits\n            self.id[56..64].to_string(), // Remaining 32 bits (8 hex chars, fits in 56 bits)\n        ];\n\n        segments\n            .iter()\n            .map(|seg| F::from_canonical_u64(u64::from_str_radix(seg, 16).unwrap()))\n            .collect::\u003cVec\u003cF\u003e\u003e()\n    }\n}\n\npub fn persist_account_id_to_gmst_pos(\n    db: \u0026mut Box\u003cdyn PoRDB\u003e,\n    accounts: \u0026Vec\u003cAccount\u003e,\n    start_idx: usize,\n) {\n    let user_batch = accounts\n        .iter()\n        .enumerate()\n        .map(|(i, acct)| {\n            let user_id = UserId::from_hex_string(acct.id.to_string()).unwrap();\n            // tracing::debug!(\"persist account {:?} with index: {:?}\", acct.id, i + start_idx);\n            (user_id, (i + start_idx) as u32)\n        })\n        .collect::\u003cVec\u003c(UserId, u32)\u003e\u003e();\n    db.add_batch_users(user_batch);\n}\n\n/// Generates num_accounts number of accounts with num_assets of assets (with equity and debt being seperate vecs)\npub fn gen_accounts_with_random_data(num_accounts: usize, num_assets: usize) -\u003e Vec\u003cAccount\u003e {\n    let mut accounts: Vec\u003cAccount\u003e = Vec::new();\n    let mut rng = rand::thread_rng(); // Create a random number generator\n    for _ in 0..num_accounts {\n        let mut equities = Vec::new();\n        let mut debts = Vec::new();\n        for _ in 0..num_assets {\n            let equity = rng.gen_range(1..1000);\n            let debt = equity - 1; // such that debt is always less than equity\n            equities.push(F::from_canonical_u32(equity));\n            debts.push(F::from_canonical_u32(debt));\n        }\n\n        let mut bytes = [0u8; 32]; // 32 bytes * 2 hex chars per byte = 64 hex chars\n        rng.fill(\u0026mut bytes);\n        #[allow(clippy::format_collect)]\n        let account_id = bytes.iter().map(|byte| format!(\"{:02x}\", byte)).collect::\u003cString\u003e();\n        accounts.push(Account { id: account_id, equity: equities, debt: debts });\n    }\n    accounts\n}\n\npub fn gen_empty_accounts(batch_size: usize, num_assets: usize) -\u003e Vec\u003cAccount\u003e {\n    let accounts =\n        vec![\n            Account::get_empty_account_with_user_id(UserId::rand().to_string(), num_assets);\n            batch_size\n        ];\n    accounts\n}\n","traces":[{"line":23,"address":[9666969,9666128,9666998],"length":1,"stats":{"Line":1}},{"line":24,"address":[11345152,11344198,11345120],"length":1,"stats":{"Line":3}},{"line":26,"address":[11344297,11345168,11345200],"length":1,"stats":{"Line":3}},{"line":28,"address":[11344357],"length":1,"stats":{"Line":1}},{"line":31,"address":[11344392,11344450,11345050],"length":1,"stats":{"Line":2}},{"line":37,"address":[11345524,11345216],"length":1,"stats":{"Line":0}},{"line":40,"address":[9667183,9667255],"length":1,"stats":{"Line":0}},{"line":41,"address":[11345410,11345346],"length":1,"stats":{"Line":0}},{"line":45,"address":[11345863,11345552],"length":1,"stats":{"Line":1}},{"line":47,"address":[11345579],"length":1,"stats":{"Line":1}},{"line":48,"address":[11345674,11345610],"length":1,"stats":{"Line":2}},{"line":49,"address":[11345690,11345749],"length":1,"stats":{"Line":2}},{"line":54,"address":[11346987,11345888],"length":1,"stats":{"Line":1}},{"line":55,"address":[11345938,11346023],"length":1,"stats":{"Line":1}},{"line":57,"address":[11347009,11345959,11346051,11346586,11346287,11346172,11346803,11346517,11346402],"length":1,"stats":{"Line":2}},{"line":58,"address":[11346119,11345980],"length":1,"stats":{"Line":2}},{"line":59,"address":[11346134,11346234],"length":1,"stats":{"Line":2}},{"line":60,"address":[11346249,11346349],"length":1,"stats":{"Line":2}},{"line":61,"address":[11346364,11346464],"length":1,"stats":{"Line":2}},{"line":62,"address":[9668395,9668495],"length":1,"stats":{"Line":2}},{"line":65,"address":[11346878,11346777],"length":1,"stats":{"Line":2}},{"line":67,"address":[11347232,11347051,11347024],"length":1,"stats":{"Line":3}},{"line":72,"address":[11347248],"length":1,"stats":{"Line":0}},{"line":77,"address":[9669187],"length":1,"stats":{"Line":0}},{"line":80,"address":[11347392,11347456],"length":1,"stats":{"Line":0}},{"line":81,"address":[9669360],"length":1,"stats":{"Line":0}},{"line":83,"address":[11347853,11347778],"length":1,"stats":{"Line":0}},{"line":86,"address":[11347357],"length":1,"stats":{"Line":0}},{"line":90,"address":[9669760,9670999,9671030],"length":1,"stats":{"Line":1}},{"line":91,"address":[11347927],"length":1,"stats":{"Line":1}},{"line":92,"address":[9669860,9669936],"length":1,"stats":{"Line":2}},{"line":93,"address":[11348959,11348142,11348060],"length":1,"stats":{"Line":3}},{"line":94,"address":[11348282],"length":1,"stats":{"Line":1}},{"line":95,"address":[11348325],"length":1,"stats":{"Line":1}},{"line":96,"address":[9670285,9670366],"length":1,"stats":{"Line":2}},{"line":97,"address":[11348610,11348968],"length":1,"stats":{"Line":2}},{"line":98,"address":[11349020,11348975],"length":1,"stats":{"Line":1}},{"line":99,"address":[11349045,11349004],"length":1,"stats":{"Line":2}},{"line":100,"address":[11349068],"length":1,"stats":{"Line":1}},{"line":103,"address":[11348564],"length":1,"stats":{"Line":1}},{"line":104,"address":[9670483],"length":1,"stats":{"Line":1}},{"line":106,"address":[11349583,11349707,11349200,11349328,11348646],"length":1,"stats":{"Line":5}},{"line":107,"address":[11348740],"length":1,"stats":{"Line":1}},{"line":109,"address":[11348232],"length":1,"stats":{"Line":1}},{"line":112,"address":[11349728],"length":1,"stats":{"Line":0}},{"line":113,"address":[11349835],"length":1,"stats":{"Line":0}},{"line":115,"address":[11349771],"length":1,"stats":{"Line":0}}],"covered":35,"coverable":47},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","circuit_config.rs"],"content":"use plonky2::{\n    fri::{reduction_strategies::FriReductionStrategy, FriConfig},\n    plonk::circuit_data::CircuitConfig,\n};\n\nuse super::circuit_utils::recursive_levels;\n\npub const STANDARD_CONFIG: CircuitConfig = CircuitConfig {\n    num_wires: 135,\n    num_routed_wires: 80,\n    num_constants: 2,\n    use_base_arithmetic_gate: true,\n    security_bits: 100,\n    num_challenges: 2,\n    zero_knowledge: false,\n    max_quotient_degree_factor: 8,\n    fri_config: FriConfig {\n        rate_bits: 3,\n        cap_height: 1,\n        proof_of_work_bits: 16,\n        reduction_strategy: FriReductionStrategy::ConstantArityBits(4, 5),\n        num_query_rounds: 28,\n    },\n};\n\n// A high-rate recursive proof, designed to be verifiable with fewer routed wires.\npub const HIGH_RATE_CONFIG: CircuitConfig = CircuitConfig {\n    num_wires: 135,\n    num_routed_wires: 80,\n    num_constants: 2,\n    use_base_arithmetic_gate: true,\n    security_bits: 100,\n    num_challenges: 2,\n    zero_knowledge: false,\n    max_quotient_degree_factor: 8,\n    fri_config: FriConfig {\n        rate_bits: 7,\n        cap_height: 1,\n        proof_of_work_bits: 16,\n        reduction_strategy: FriReductionStrategy::ConstantArityBits(4, 5),\n        num_query_rounds: 12,\n    },\n};\n\npub const STANDARD_ZK_CONFIG: CircuitConfig = CircuitConfig {\n    num_wires: 135,\n    num_routed_wires: 80,\n    num_constants: 2,\n    use_base_arithmetic_gate: true,\n    security_bits: 100,\n    num_challenges: 2,\n    zero_knowledge: true,\n    max_quotient_degree_factor: 8,\n    fri_config: FriConfig {\n        rate_bits: 3,\n        cap_height: 1,\n        proof_of_work_bits: 16,\n        reduction_strategy: FriReductionStrategy::ConstantArityBits(4, 5),\n        num_query_rounds: 28,\n    },\n};\n\npub fn get_recursive_circuit_configs\u003cconst RECURSION_BRANCHOUT_NUM: usize\u003e(\n    batch_num: usize,\n) -\u003e Vec\u003cCircuitConfig\u003e {\n    let level = recursive_levels(batch_num, RECURSION_BRANCHOUT_NUM);\n\n    let mut configs = vec![STANDARD_CONFIG; level];\n\n    // The last circuit is a zk circuit, and the rest are standard circuits.\n    // there is at least one recursive circuit.\n    *configs.last_mut().unwrap() = STANDARD_ZK_CONFIG;\n    configs\n}\n\n#[cfg(test)]\npub mod test {\n    use crate::circuit_config::{STANDARD_CONFIG, STANDARD_ZK_CONFIG};\n\n    use super::get_recursive_circuit_configs;\n\n    #[test]\n    pub fn test_get_recursive_circuit_config() {\n        let batch_num = 1;\n        let cfgs = get_recursive_circuit_configs::\u003c64\u003e(batch_num);\n        assert_eq!(vec![STANDARD_ZK_CONFIG], cfgs);\n\n        let batch_num = 66;\n        let cfgs = get_recursive_circuit_configs::\u003c64\u003e(batch_num);\n        assert_eq!(vec![STANDARD_CONFIG, STANDARD_ZK_CONFIG], cfgs);\n    }\n}\n","traces":[{"line":63,"address":[8988562,8988096],"length":1,"stats":{"Line":1}},{"line":66,"address":[],"length":0,"stats":{"Line":1}},{"line":68,"address":[],"length":0,"stats":{"Line":1}},{"line":72,"address":[],"length":0,"stats":{"Line":3}},{"line":73,"address":[],"length":0,"stats":{"Line":1}}],"covered":5,"coverable":5},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","circuit_registry","mod.rs"],"content":"pub mod registry;\n","traces":[],"covered":0,"coverable":0},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","circuit_registry","registry.rs"],"content":"use plonky2::{\n    hash::hash_types::HashOut,\n    plonk::{\n        circuit_data::{CircuitConfig, CircuitData},\n        proof::ProofWithPublicInputs,\n    },\n};\n\nuse crate::{\n    merkle_sum_prover::circuits::{\n        account_circuit::AccountTargets, merkle_sum_circuit::build_merkle_sum_tree_circuit,\n    },\n    recursive_prover::recursive_circuit::{build_recursive_n_circuit, RecursiveTargets},\n    types::{C, D, F},\n};\n\n#[cfg(not(feature = \"verifier\"))]\nuse crate::{\n    account::gen_empty_accounts, merkle_sum_prover::prover::MerkleSumTreeProver,\n    recursive_prover::prover::RecursiveProver,\n};\n\nuse std::collections::HashMap;\n\n#[allow(clippy::type_complexity)]\npub struct CircuitRegistry\u003cconst RECURSION_BRANCHOUT_NUM: usize\u003e {\n    batch_circuit: (CircuitData\u003cF, C, D\u003e, Vec\u003cAccountTargets\u003e),\n    // inner_vd =\u003e the verification circuit that verify the inner circuit\n    recursive_circuits:\n        HashMap\u003cHashOut\u003cF\u003e, (CircuitData\u003cF, C, D\u003e, RecursiveTargets\u003cRECURSION_BRANCHOUT_NUM\u003e)\u003e,\n    // circuit_vd -\u003e empty proof\n    #[cfg(not(feature = \"verifier\"))]\n    empty_proofs: HashMap\u003cHashOut\u003cF\u003e, ProofWithPublicInputs\u003cF, C, D\u003e\u003e,\n\n    last_inner_circuit_vd: HashOut\u003cF\u003e,\n}\n\nimpl\u003cconst RECURSION_BRANCHOUT_NUM: usize\u003e CircuitRegistry\u003cRECURSION_BRANCHOUT_NUM\u003e {\n    pub fn init(\n        batch_size: usize,\n        token_num: usize,\n        batch_circuit_config: CircuitConfig,\n        recursive_level_configs: Vec\u003cCircuitConfig\u003e,\n    ) -\u003e Self {\n        let init_start = std::time::Instant::now();\n\n        let start = std::time::Instant::now();\n        let (batch_circuit_data, account_targets) =\n            build_merkle_sum_tree_circuit(batch_size, token_num, batch_circuit_config);\n        tracing::info!(\n            \"build merkle sum tree circuit with batch size {} in : {:?}\",\n            batch_size,\n            start.elapsed()\n        );\n\n        let mut recursive_circuits = HashMap::new();\n        let mut last_circuit_data = \u0026batch_circuit_data;\n        let mut last_circuit_vd = last_circuit_data.verifier_only.circuit_digest;\n        let mut _empty_proofs: HashMap\u003cHashOut\u003cF\u003e, ProofWithPublicInputs\u003cF, C, D\u003e\u003e = HashMap::new();\n        let mut _last_empty_proof: ProofWithPublicInputs\u003cF, C, D\u003e;\n\n        #[cfg(not(feature = \"verifier\"))]\n        {\n            let accounts = gen_empty_accounts(batch_size, token_num);\n            let start = std::time::Instant::now();\n            let prover = MerkleSumTreeProver { accounts };\n            let empty_batch_proof =\n                prover.get_proof_with_circuit_data(\u0026account_targets, \u0026batch_circuit_data);\n            tracing::info!(\n                \"prove merkle sum tree with batch size {} in : {:?}\",\n                batch_size,\n                start.elapsed()\n            );\n            _last_empty_proof = empty_batch_proof.clone();\n            _empty_proofs\n                .insert(last_circuit_data.verifier_only.circuit_digest, _last_empty_proof.clone());\n        }\n\n        for (level, circuit_config) in recursive_level_configs.into_iter().enumerate() {\n            let start = std::time::Instant::now();\n            let (recursive_circuit, recursive_targets) =\n                build_recursive_n_circuit::\u003cC, RECURSION_BRANCHOUT_NUM\u003e(\n                    \u0026last_circuit_data.common,\n                    \u0026last_circuit_data.verifier_only,\n                    circuit_config,\n                );\n            tracing::info!(\n                \"build recursive circuit at level {} in : {:?}, with vd {:?}\",\n                level,\n                start.elapsed(),\n                recursive_circuit.verifier_only.circuit_digest\n            );\n\n            #[cfg(not(feature = \"verifier\"))]\n            {\n                let sub_proofs: [ProofWithPublicInputs\u003cF, C, D\u003e; RECURSION_BRANCHOUT_NUM] =\n                    std::array::from_fn(|_| _last_empty_proof.clone());\n                let start = std::time::Instant::now();\n                let recursive_prover = RecursiveProver {\n                    sub_proofs,\n                    sub_circuit_vd: last_circuit_data.verifier_only.clone(),\n                };\n                let recursive_proof = recursive_prover\n                    .get_proof_with_circuit_data(recursive_targets.clone(), \u0026recursive_circuit);\n\n                tracing::info!(\n                    \"prove empty recursive subproofs at level {} in : {:?}\",\n                    level,\n                    start.elapsed()\n                );\n\n                _empty_proofs.insert(\n                    recursive_circuit.verifier_only.circuit_digest,\n                    recursive_proof.clone(),\n                );\n\n                _last_empty_proof = recursive_proof;\n            }\n\n            last_circuit_vd = last_circuit_data.verifier_only.circuit_digest;\n            recursive_circuits.insert(last_circuit_vd, (recursive_circuit, recursive_targets));\n            last_circuit_data = \u0026recursive_circuits[\u0026last_circuit_vd].0;\n        }\n\n        tracing::info!(\n            \"finish init circuit registry with {} recursive levels in {:?}\",\n            recursive_circuits.len(),\n            init_start.elapsed()\n        );\n\n        #[cfg(feature = \"verifier\")]\n        {\n            Self {\n                batch_circuit: (batch_circuit_data, account_targets),\n                recursive_circuits: recursive_circuits,\n                last_inner_circuit_vd: last_circuit_vd,\n            }\n        }\n        #[cfg(not(feature = \"verifier\"))]\n        {\n            Self {\n                batch_circuit: (batch_circuit_data, account_targets),\n                empty_proofs: _empty_proofs,\n                recursive_circuits: recursive_circuits,\n                last_inner_circuit_vd: last_circuit_vd,\n            }\n        }\n    }\n\n    pub fn get_batch_circuit(\u0026self) -\u003e (\u0026CircuitData\u003cF, C, D\u003e, \u0026[AccountTargets]) {\n        (\u0026self.batch_circuit.0, \u0026self.batch_circuit.1)\n    }\n\n    pub fn get_empty_proof(\n        \u0026self,\n        _circuit_vd: \u0026HashOut\u003cF\u003e,\n    ) -\u003e Option\u003c\u0026ProofWithPublicInputs\u003cF, C, D\u003e\u003e {\n        #[cfg(feature = \"verifier\")]\n        {\n            tracing::error!(\"empty proof is not available in verifier mode\");\n            None\n        }\n\n        #[cfg(not(feature = \"verifier\"))]\n        {\n            self.empty_proofs.get(_circuit_vd)\n        }\n    }\n\n    /// leaf node at level 0\n    pub fn get_recursive_circuit(\n        \u0026self,\n        inner_circuit_vd: \u0026HashOut\u003cF\u003e,\n    ) -\u003e Option\u003c(\u0026CircuitData\u003cF, C, D\u003e, \u0026RecursiveTargets\u003cRECURSION_BRANCHOUT_NUM\u003e)\u003e {\n        let circuit_and_targets = self.recursive_circuits.get(inner_circuit_vd)?;\n        Some((\u0026circuit_and_targets.0, \u0026circuit_and_targets.1))\n    }\n\n    pub fn get_recursive_levels(\u0026self) -\u003e usize {\n        self.recursive_circuits.len()\n    }\n\n    pub fn get_root_circuit(\u0026self) -\u003e \u0026CircuitData\u003cF, C, D\u003e {\n        \u0026self.recursive_circuits[\u0026self.last_inner_circuit_vd].0\n    }\n}\n","traces":[{"line":39,"address":[9338878,9326160,9339142],"length":1,"stats":{"Line":0}},{"line":45,"address":[],"length":0,"stats":{"Line":0}},{"line":47,"address":[],"length":0,"stats":{"Line":0}},{"line":48,"address":[],"length":0,"stats":{"Line":0}},{"line":49,"address":[],"length":0,"stats":{"Line":0}},{"line":50,"address":[],"length":0,"stats":{"Line":0}},{"line":51,"address":[],"length":0,"stats":{"Line":0}},{"line":52,"address":[],"length":0,"stats":{"Line":0}},{"line":53,"address":[],"length":0,"stats":{"Line":0}},{"line":56,"address":[],"length":0,"stats":{"Line":0}},{"line":57,"address":[],"length":0,"stats":{"Line":0}},{"line":58,"address":[9328565],"length":1,"stats":{"Line":0}},{"line":59,"address":[9328611],"length":1,"stats":{"Line":0}},{"line":60,"address":[],"length":0,"stats":{"Line":0}},{"line":64,"address":[],"length":0,"stats":{"Line":0}},{"line":65,"address":[],"length":0,"stats":{"Line":0}},{"line":66,"address":[9328845],"length":1,"stats":{"Line":0}},{"line":67,"address":[9328917,9329012],"length":1,"stats":{"Line":0}},{"line":68,"address":[],"length":0,"stats":{"Line":0}},{"line":69,"address":[],"length":0,"stats":{"Line":0}},{"line":70,"address":[],"length":0,"stats":{"Line":0}},{"line":71,"address":[],"length":0,"stats":{"Line":0}},{"line":72,"address":[],"length":0,"stats":{"Line":0}},{"line":74,"address":[],"length":0,"stats":{"Line":0}},{"line":75,"address":[9330988],"length":1,"stats":{"Line":0}},{"line":76,"address":[],"length":0,"stats":{"Line":0}},{"line":79,"address":[],"length":0,"stats":{"Line":0}},{"line":80,"address":[],"length":0,"stats":{"Line":0}},{"line":81,"address":[],"length":0,"stats":{"Line":0}},{"line":83,"address":[9333901],"length":1,"stats":{"Line":0}},{"line":84,"address":[],"length":0,"stats":{"Line":0}},{"line":85,"address":[],"length":0,"stats":{"Line":0}},{"line":87,"address":[],"length":0,"stats":{"Line":0}},{"line":88,"address":[],"length":0,"stats":{"Line":0}},{"line":89,"address":[],"length":0,"stats":{"Line":0}},{"line":90,"address":[],"length":0,"stats":{"Line":0}},{"line":91,"address":[],"length":0,"stats":{"Line":0}},{"line":96,"address":[],"length":0,"stats":{"Line":0}},{"line":97,"address":[],"length":0,"stats":{"Line":0}},{"line":98,"address":[],"length":0,"stats":{"Line":0}},{"line":101,"address":[9336198],"length":1,"stats":{"Line":0}},{"line":103,"address":[],"length":0,"stats":{"Line":0}},{"line":104,"address":[],"length":0,"stats":{"Line":0}},{"line":106,"address":[],"length":0,"stats":{"Line":0}},{"line":107,"address":[],"length":0,"stats":{"Line":0}},{"line":108,"address":[],"length":0,"stats":{"Line":0}},{"line":109,"address":[],"length":0,"stats":{"Line":0}},{"line":112,"address":[],"length":0,"stats":{"Line":0}},{"line":113,"address":[],"length":0,"stats":{"Line":0}},{"line":114,"address":[],"length":0,"stats":{"Line":0}},{"line":117,"address":[],"length":0,"stats":{"Line":0}},{"line":120,"address":[],"length":0,"stats":{"Line":0}},{"line":121,"address":[],"length":0,"stats":{"Line":0}},{"line":122,"address":[],"length":0,"stats":{"Line":0}},{"line":125,"address":[],"length":0,"stats":{"Line":0}},{"line":126,"address":[],"length":0,"stats":{"Line":0}},{"line":127,"address":[],"length":0,"stats":{"Line":0}},{"line":128,"address":[],"length":0,"stats":{"Line":0}},{"line":134,"address":[],"length":0,"stats":{"Line":0}},{"line":142,"address":[9332436],"length":1,"stats":{"Line":0}},{"line":150,"address":[],"length":0,"stats":{"Line":0}},{"line":151,"address":[],"length":0,"stats":{"Line":0}},{"line":154,"address":[9325840],"length":1,"stats":{"Line":0}},{"line":160,"address":[],"length":0,"stats":{"Line":0}},{"line":161,"address":[],"length":0,"stats":{"Line":0}},{"line":166,"address":[],"length":0,"stats":{"Line":0}},{"line":171,"address":[9326032],"length":1,"stats":{"Line":0}},{"line":175,"address":[],"length":0,"stats":{"Line":0}},{"line":176,"address":[],"length":0,"stats":{"Line":0}},{"line":179,"address":[],"length":0,"stats":{"Line":0}},{"line":180,"address":[],"length":0,"stats":{"Line":0}},{"line":183,"address":[],"length":0,"stats":{"Line":0}},{"line":184,"address":[],"length":0,"stats":{"Line":0}}],"covered":0,"coverable":73},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","circuit_utils.rs"],"content":"use log::Level;\nuse plonky2::{\n    hash::hash_types::RichField,\n    iop::{target::Target, witness::PartialWitness},\n    plonk::{\n        circuit_builder::CircuitBuilder, circuit_data::CircuitData, config::GenericConfig,\n        prover::prove,\n    },\n    util::timing::TimingTree,\n};\nuse plonky2_field::extension::Extendable;\nuse std::panic;\n\nuse crate::{\n    circuit_config::STANDARD_CONFIG,\n    types::{C, D, F, MAX_POSITIVE_AMOUNT_LOG},\n};\n\npub fn prove_timing() -\u003e TimingTree {\n    let mut level = Level::Info;\n    if cfg!(debug_assertions) {\n        level = Level::Debug;\n    }\n\n    TimingTree::new(\"prove\", level)\n}\n\npub fn recursive_levels(batch_num: usize, recursion_branchout_num: usize) -\u003e usize {\n    let level = (batch_num as f64).log(recursion_branchout_num as f64).ceil() as usize;\n    std::cmp::max(1, level)\n}\n\n/// Test runner for ease of testing\n#[allow(clippy::unused_unit)]\npub fn run_circuit_test\u003cT, F, const D: usize\u003e(test: T)\nwhere\n    T: FnOnce(\u0026mut CircuitBuilder\u003cF, D\u003e, \u0026mut PartialWitness\u003cF\u003e) -\u003e () + panic::UnwindSafe,\n    F: RichField + Extendable\u003cD\u003e,\n    C: GenericConfig\u003cD, F = F\u003e,\n{\n    let mut builder = CircuitBuilder::\u003cF, D\u003e::new(STANDARD_CONFIG);\n    let mut pw: PartialWitness\u003cF\u003e = PartialWitness::\u003cF\u003e::new();\n    test(\u0026mut builder, \u0026mut pw);\n    builder.print_gate_counts(0);\n    let mut timing = TimingTree::new(\"prove\", Level::Debug);\n    let data = builder.build::\u003cC\u003e();\n    let CircuitData { prover_only, common, verifier_only: _ } = \u0026data;\n    let proof = prove(prover_only, common, pw, \u0026mut timing).expect(\"Prove fail\");\n    timing.print();\n    data.verify(proof).expect(\"Verify fail\")\n}\n\n/// Assert 0 \u003c= x \u003c= MAX_POSITIVE_AMOUNT\n/// MAX_POSITIVE_AMOUNT =  (1 \u003c\u003c MAX_POSITIVE_AMOUNT_LOG) - 1\npub fn assert_non_negative_unsigned(builder: \u0026mut CircuitBuilder\u003cF, D\u003e, x: Target) {\n    builder.range_check(x, MAX_POSITIVE_AMOUNT_LOG);\n}\n\n#[cfg(test)]\npub mod test {\n    use crate::types::F;\n\n    use plonky2_field::types::{Field, Field64};\n\n    use super::{assert_non_negative_unsigned, run_circuit_test};\n\n    #[test]\n    fn test_assert_non_negative_unsigned() {\n        run_circuit_test(|builder, _pw| {\n            let x = builder.constant(F::from_canonical_u16(0));\n            assert_non_negative_unsigned(builder, x);\n        });\n    }\n\n    #[test]\n    #[should_panic]\n    fn test_assert_non_negative_unsigned_panic() {\n        run_circuit_test(|builder, _pw| {\n            let x = builder.constant(F::from_canonical_u64(F::ORDER - 1));\n            assert_non_negative_unsigned(builder, x);\n        });\n    }\n}\n","traces":[{"line":19,"address":[11657632],"length":1,"stats":{"Line":1}},{"line":20,"address":[11657636],"length":1,"stats":{"Line":1}},{"line":22,"address":[11657645],"length":1,"stats":{"Line":1}},{"line":25,"address":[11657664],"length":1,"stats":{"Line":1}},{"line":28,"address":[11657696],"length":1,"stats":{"Line":1}},{"line":29,"address":[11657709],"length":1,"stats":{"Line":1}},{"line":30,"address":[11657864],"length":1,"stats":{"Line":1}},{"line":35,"address":[9801407,9805353,9802383,9802448,9805376,9804335,9801472,9801449,9804377,9805311,9803424,9806287,9803359,9803401,9806329,9804400,9800496,9802425],"length":1,"stats":{"Line":7}},{"line":41,"address":[9801697,9805601,9803443,9800515,9803649,9800721,9801491,9802467,9804419,9804625,9802673,9805395],"length":1,"stats":{"Line":12}},{"line":42,"address":[],"length":0,"stats":{"Line":6}},{"line":43,"address":[],"length":0,"stats":{"Line":6}},{"line":44,"address":[],"length":0,"stats":{"Line":6}},{"line":45,"address":[],"length":0,"stats":{"Line":6}},{"line":46,"address":[],"length":0,"stats":{"Line":6}},{"line":47,"address":[],"length":0,"stats":{"Line":6}},{"line":48,"address":[],"length":0,"stats":{"Line":11}},{"line":49,"address":[],"length":0,"stats":{"Line":5}},{"line":50,"address":[],"length":0,"stats":{"Line":5}},{"line":55,"address":[11657888],"length":1,"stats":{"Line":1}},{"line":56,"address":[11657897],"length":1,"stats":{"Line":1}}],"covered":20,"coverable":20},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","config.rs"],"content":"use std::str::FromStr;\n\nuse config::{Config, ConfigError, File};\nuse serde::Deserialize;\nuse tracing::Level;\nuse zk_por_tracing::TraceConfig;\n\n#[derive(Debug, Clone, Deserialize)]\npub struct ConfigLog {\n    pub file_name_prefix: String,\n    pub dir: String,\n    pub level: String,\n    pub flame: bool,\n    pub console: bool,\n}\n\nimpl From\u003cConfigLog\u003e for TraceConfig {\n    fn from(log_cfg: ConfigLog) -\u003e Self {\n        TraceConfig {\n            prefix: log_cfg.file_name_prefix,\n            dir: log_cfg.dir,\n            level: Level::from_str(\u0026log_cfg.level).unwrap(),\n            console: log_cfg.console,\n            flame: log_cfg.flame,\n        }\n    }\n}\n\n#[derive(Debug, Clone, Deserialize)]\npub struct ConfigProver {\n    pub round_no: usize,\n    pub batch_size: Option\u003cusize\u003e,\n    pub tokens: Vec\u003cString\u003e,\n    pub user_data_path: String,\n    pub batch_prove_threads_num: usize,\n    pub recursive_prove_threads_num: usize,\n}\n\n#[derive(Debug, Clone, Deserialize)]\npub struct ConfigDb {\n    pub level_db_user_path: String,\n    pub level_db_gmst_path: String,\n}\n\nimpl ConfigDb {\n    pub fn load(dir: \u0026str) -\u003e Result\u003cConfig, ConfigError\u003e {\n        let env = std::env::var(\"ENV\").unwrap_or(\"default\".into());\n        Config::builder()\n            .add_source(File::with_name(\u0026format!(\"{}/default\", dir)))\n            .add_source(File::with_name(\u0026format!(\"{}/{}\", dir, env)).required(false))\n            .add_source(File::with_name(\u0026format!(\"{}/local\", dir)).required(false))\n            .add_source(config::Environment::with_prefix(\"ZKPOR\"))\n            .build()\n    }\n    pub fn try_new() -\u003e Result\u003cSelf, ConfigError\u003e {\n        let config = Self::load(\"config\")?;\n        config.try_deserialize()\n    }\n}\n\n#[derive(Debug, Clone, Deserialize)]\npub struct ProverConfig {\n    pub log: ConfigLog,\n    pub prover: ConfigProver,\n    pub db: Option\u003cConfigDb\u003e,\n}\n\nimpl ProverConfig {\n    pub fn load(dir: \u0026str) -\u003e Result\u003cConfig, ConfigError\u003e {\n        let env = std::env::var(\"ENV\").unwrap_or(\"default\".into());\n        Config::builder()\n            // .add_source(File::with_name(\u0026format!(\"{}/default\", dir)))\n            .add_source(File::with_name(\u0026format!(\"{}/{}\", dir, env)).required(false))\n            .add_source(File::with_name(\u0026format!(\"{}/local\", dir)).required(false))\n            .add_source(config::Environment::with_prefix(\"ZKPOR\"))\n            .build()\n    }\n    pub fn try_new() -\u003e Result\u003cSelf, ConfigError\u003e {\n        let config = Self::load(\"config\")?;\n        config.try_deserialize()\n    }\n}\n","traces":[{"line":18,"address":[9672221,9672176,9671728],"length":1,"stats":{"Line":0}},{"line":20,"address":[11349902],"length":1,"stats":{"Line":0}},{"line":21,"address":[11349919],"length":1,"stats":{"Line":0}},{"line":22,"address":[11350032,11349940],"length":1,"stats":{"Line":0}},{"line":23,"address":[11350219],"length":1,"stats":{"Line":0}},{"line":24,"address":[11350222],"length":1,"stats":{"Line":0}},{"line":46,"address":[12785504,12787649,12787756],"length":1,"stats":{"Line":0}},{"line":47,"address":[12787769,12785531],"length":1,"stats":{"Line":0}},{"line":48,"address":[12785729,12786160,12787179,12787307,12787363,12786728],"length":1,"stats":{"Line":0}},{"line":49,"address":[12785900,12785789,12787737,12786073,12786203],"length":1,"stats":{"Line":0}},{"line":50,"address":[12786322,12787699,12786771,12786612,12786467],"length":1,"stats":{"Line":0}},{"line":51,"address":[12787658,12786890,12787222,12787063],"length":1,"stats":{"Line":0}},{"line":52,"address":[10581859,10582139,10581746],"length":1,"stats":{"Line":0}},{"line":55,"address":[12788189,12788160,12787792],"length":1,"stats":{"Line":0}},{"line":56,"address":[12787809,12788043],"length":1,"stats":{"Line":0}},{"line":57,"address":[12787999],"length":1,"stats":{"Line":0}},{"line":69,"address":[12789924,12789855,12788208],"length":1,"stats":{"Line":0}},{"line":70,"address":[12788235,12789937],"length":1,"stats":{"Line":0}},{"line":71,"address":[10583901,10583464,10582895,10584025,10584077],"length":1,"stats":{"Line":0}},{"line":73,"address":[12788479,12788590,12789905,12789039,12788880,12788735],"length":1,"stats":{"Line":0}},{"line":74,"address":[12789864,12789488,12789158,12789331],"length":1,"stats":{"Line":0}},{"line":75,"address":[12789833,12789504,12789621],"length":1,"stats":{"Line":0}},{"line":78,"address":[12790365,12790336,12789968],"length":1,"stats":{"Line":0}},{"line":79,"address":[12789985,12790219],"length":1,"stats":{"Line":0}},{"line":80,"address":[12790175],"length":1,"stats":{"Line":0}}],"covered":0,"coverable":25},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","database.rs"],"content":"use std::str::FromStr;\n\nuse hex::ToHex;\nuse plonky2::{hash::hash_types::HashOut, plonk::config::GenericHashOut};\nuse rand::Rng;\nuse zk_por_db::LevelDb;\n\nuse crate::{error::PoRError, global::GLOBAL_MST, types::F};\nuse std::{collections::HashMap, sync::RwLock};\n#[derive(Debug, Clone, Copy, Eq, Hash, PartialEq)]\npub struct UserId(pub [u8; 32]);\n\nimpl UserId {\n    pub fn rand() -\u003e Self {\n        let mut bytes: [u8; 32] = [0; 32];\n        let mut rng = rand::thread_rng();\n        rng.fill(\u0026mut bytes);\n        Self(bytes)\n    }\n\n    pub fn to_string(\u0026self) -\u003e String {\n        self.0.encode_hex()\n    }\n\n    pub fn from_hex_string(hex_str: String) -\u003e Result\u003cSelf, PoRError\u003e {\n        if hex_str.len() != 64 {\n            tracing::error!(\"User Id: {:?} is not a valid id, length is not 256 bits\", hex_str);\n            return Err(PoRError::InvalidParameter(hex_str));\n        }\n\n        let decode_res = hex::decode(hex_str.clone());\n\n        if decode_res.is_err() {\n            tracing::error!(\"User Id: {:?} is not a valid id\", hex_str);\n            return Err(PoRError::InvalidParameter(hex_str));\n        }\n\n        let mut arr = [0u8; 32];\n        arr.copy_from_slice(\u0026decode_res.unwrap());\n\n        Ok(UserId { 0: arr })\n    }\n}\n\nimpl db_key::Key for UserId {\n    fn from_u8(key: \u0026[u8]) -\u003e UserId {\n        assert!(key.len() == 32);\n        let mut output: [u8; 32] = [0; 32];\n        unsafe {\n            std::ptr::copy_nonoverlapping(key.as_ptr(), output.as_mut_ptr(), 32);\n        }\n        UserId(output)\n    }\n\n    fn as_slice\u003cT, F: Fn(\u0026[u8]) -\u003e T\u003e(\u0026self, f: F) -\u003e T {\n        let dst = self.0.as_slice();\n        f(\u0026dst)\n    }\n}\n\npub trait PoRDB: Sync + Send {\n    fn add_batch_users(\u0026mut self, batches: Vec\u003c(UserId, u32)\u003e);\n    fn get_user_index(\u0026self, user_id: UserId) -\u003e Option\u003cu32\u003e;\n    fn add_batch_gmst_nodes(\u0026mut self, batches: Vec\u003c(i32, HashOut\u003cF\u003e)\u003e);\n    fn get_gmst_node_hash(\u0026self, node_idx: i32) -\u003e Option\u003cHashOut\u003cF\u003e\u003e;\n}\n\npub struct PoRLevelDBOption {\n    pub user_map_dir: String,\n    pub gmst_dir: String,\n}\n\npub struct PoRLevelDB {\n    user_db: LevelDb\u003cUserId\u003e,\n    gmst_db: LevelDb\u003ci32\u003e, // we use i32 as a key of type u32 is not provided by default in leveldb\n}\n\nimpl PoRLevelDB {\n    pub fn new(opt: PoRLevelDBOption) -\u003e Self {\n        Self {\n            user_db: LevelDb::new(\u0026std::path::PathBuf::from_str(\u0026opt.user_map_dir).unwrap()),\n            gmst_db: LevelDb::new(\u0026std::path::PathBuf::from_str(\u0026opt.gmst_dir).unwrap()),\n        }\n    }\n}\n\nimpl PoRDB for PoRLevelDB {\n    fn add_batch_users(\u0026mut self, batches: Vec\u003c(UserId, u32)\u003e) {\n        let batches = batches\n            .into_iter()\n            .map(|(id, idx)| (id, idx.to_be_bytes().to_vec()))\n            .collect::\u003cVec\u003c(UserId, Vec\u003cu8\u003e)\u003e\u003e();\n        self.user_db.batch_put(batches)\n    }\n\n    fn get_user_index(\u0026self, user_id: UserId) -\u003e Option\u003cu32\u003e {\n        let ret = self.user_db.get(user_id).map(|x| {\n            let mut buf = [0; 4];\n            buf.as_mut_slice().copy_from_slice(\u0026x[0..4]);\n            u32::from_be_bytes(buf)\n        });\n        ret\n    }\n\n    /// 0: the index of the gmst\n    /// 1: the hash value at that index\n    fn add_batch_gmst_nodes(\u0026mut self, batches: Vec\u003c(i32, HashOut\u003cF\u003e)\u003e) {\n        let batches = batches\n            .into_iter()\n            .map(|(id, hash)| {\n                let ret = (id, hash.to_bytes());\n                ret\n            })\n            .collect::\u003cVec\u003c(i32, Vec\u003cu8\u003e)\u003e\u003e();\n        self.gmst_db.batch_put(batches);\n    }\n\n    fn get_gmst_node_hash(\u0026self, node_idx: i32) -\u003e Option\u003cHashOut\u003cF\u003e\u003e {\n        let ret = self.gmst_db.get(node_idx).map(|x| {\n            let ret = HashOut::\u003cF\u003e::from_bytes(\u0026x);\n            ret\n        });\n        ret\n    }\n}\n\npub struct PoRMemoryDB {\n    user_map: HashMap\u003cUserId, u32\u003e,\n    gmst_map: HashMap\u003ci32, HashOut\u003cF\u003e\u003e,\n}\n\nimpl PoRMemoryDB {\n    pub fn new() -\u003e Self {\n        Self { user_map: HashMap::new(), gmst_map: HashMap::new() }\n    }\n}\n\nimpl PoRDB for RwLock\u003cPoRMemoryDB\u003e {\n    fn add_batch_users(\u0026mut self, batches: Vec\u003c(UserId, u32)\u003e) {\n        for (id, idx) in batches {\n            self.write().unwrap().user_map.insert(id, idx);\n        }\n    }\n\n    fn get_user_index(\u0026self, user_id: UserId) -\u003e Option\u003cu32\u003e {\n        self.read().unwrap().user_map.get(\u0026user_id).map(|x| *x)\n    }\n\n    fn add_batch_gmst_nodes(\u0026mut self, batches: Vec\u003c(i32, HashOut\u003cF\u003e)\u003e) {\n        for (id, hash) in batches {\n            self.write().unwrap().gmst_map.insert(id, hash);\n        }\n    }\n\n    fn get_gmst_node_hash(\u0026self, node_idx: i32) -\u003e Option\u003cHashOut\u003cF\u003e\u003e {\n        self.read().unwrap().gmst_map.get(\u0026node_idx).map(|x| *x)\n    }\n}\n\n/// PoRGMSTMemoryDB delegates the query on gmst node to the direct access of global GMST. For user_db, the query is delegated to PoRMemoryDB.\n/// This is to save memory fingerprint.\npub struct PoRGMSTMemoryDB {\n    user_db: RwLock\u003cPoRMemoryDB\u003e,\n}\n///\nimpl PoRGMSTMemoryDB {\n    pub fn new() -\u003e Self {\n        Self { user_db: RwLock::new(PoRMemoryDB::new()) }\n    }\n}\n\nimpl PoRDB for PoRGMSTMemoryDB {\n    fn add_batch_users(\u0026mut self, batches: Vec\u003c(UserId, u32)\u003e) {\n        self.user_db.add_batch_users(batches);\n    }\n\n    fn get_user_index(\u0026self, user_id: UserId) -\u003e Option\u003cu32\u003e {\n        self.user_db.get_user_index(user_id)\n    }\n\n    #[inline(always)]\n    fn add_batch_gmst_nodes(\u0026mut self, _batches: Vec\u003c(i32, HashOut\u003cF\u003e)\u003e) {\n        // do nothing as we assume GMST is already built.\n        return;\n    }\n\n    fn get_gmst_node_hash(\u0026self, node_idx: i32) -\u003e Option\u003cHashOut\u003cF\u003e\u003e {\n        GLOBAL_MST.get().unwrap().read().unwrap().inner.get(node_idx as usize).map(|x| *x)\n    }\n}\n\n#[cfg(test)]\nmod test {\n    use plonky2::{field::types::Sample, hash::hash_types::HashOut};\n    use tempdir::TempDir;\n\n    use crate::{\n        database::{PoRDB, PoRLevelDB, PoRLevelDBOption, PoRMemoryDB, UserId},\n        types::F,\n    };\n    use std::sync::RwLock;\n\n    fn test_database(mut db: Box\u003cdyn PoRDB\u003e) {\n        let batches_user = (0..4)\n            .into_iter()\n            .map(|i| {\n                let id = UserId::rand();\n                let idx = i;\n                (id, idx)\n            })\n            .collect::\u003cVec\u003c(UserId, u32)\u003e\u003e();\n        db.add_batch_users(batches_user.clone());\n        assert_eq!(db.get_user_index(batches_user[0].0), Some(0));\n        assert_eq!(db.get_user_index(batches_user[3].0), Some(3));\n\n        let batches_hash = (0..4)\n            .into_iter()\n            .map(|i| (i, HashOut::\u003cF\u003e::from_vec(vec![F::rand(), F::rand(), F::rand(), F::rand()])))\n            .collect::\u003cVec\u003c(i32, HashOut\u003cF\u003e)\u003e\u003e();\n        db.add_batch_gmst_nodes(batches_hash.clone());\n\n        assert_eq!(db.get_gmst_node_hash(0), Some(batches_hash[0].1));\n        assert_eq!(db.get_gmst_node_hash(1), Some(batches_hash[1].1));\n        assert_eq!(db.get_gmst_node_hash(2), Some(batches_hash[2].1));\n        assert_eq!(db.get_gmst_node_hash(3), Some(batches_hash[3].1));\n    }\n\n    #[test]\n    fn test_leveldb() {\n        let tempdir_user = TempDir::new(\"example_user\").unwrap();\n        let tempdir_gmst = TempDir::new(\"example_gmst\").unwrap();\n        let db = PoRLevelDB::new(PoRLevelDBOption {\n            user_map_dir: tempdir_user.path().to_string_lossy().into_owned(),\n            gmst_dir: tempdir_gmst.path().to_string_lossy().into_owned(),\n        });\n        test_database(Box::new(db));\n    }\n\n    #[test]\n    fn test_memorydb() {\n        let db = PoRMemoryDB::new();\n        test_database(Box::new(RwLock::new(db)));\n    }\n}\n","traces":[{"line":14,"address":[8791968,8792157],"length":1,"stats":{"Line":1}},{"line":15,"address":[11350397],"length":1,"stats":{"Line":1}},{"line":16,"address":[11350410],"length":1,"stats":{"Line":1}},{"line":17,"address":[11350424],"length":1,"stats":{"Line":1}},{"line":18,"address":[11350481],"length":1,"stats":{"Line":1}},{"line":21,"address":[11350608],"length":1,"stats":{"Line":0}},{"line":22,"address":[11350625],"length":1,"stats":{"Line":0}},{"line":25,"address":[11350656,11351935,11354925],"length":1,"stats":{"Line":0}},{"line":26,"address":[8792250,8792338],"length":1,"stats":{"Line":0}},{"line":27,"address":[11354676,11353508,11354438,11354502,11354202,11353903,11354090],"length":1,"stats":{"Line":0}},{"line":28,"address":[11354274],"length":1,"stats":{"Line":0}},{"line":31,"address":[8792540,8792352],"length":1,"stats":{"Line":0}},{"line":33,"address":[8792563,8792657],"length":1,"stats":{"Line":0}},{"line":34,"address":[8794752,8793495,8794240,8794517,8793911,8794110,8794581],"length":1,"stats":{"Line":0}},{"line":35,"address":[11352771],"length":1,"stats":{"Line":0}},{"line":38,"address":[11351123],"length":1,"stats":{"Line":0}},{"line":39,"address":[11351143,11351555],"length":1,"stats":{"Line":0}},{"line":41,"address":[11351716],"length":1,"stats":{"Line":0}},{"line":46,"address":[11354960],"length":1,"stats":{"Line":0}},{"line":47,"address":[11354996,11355257],"length":1,"stats":{"Line":0}},{"line":48,"address":[11355006],"length":1,"stats":{"Line":0}},{"line":52,"address":[11355174],"length":1,"stats":{"Line":0}},{"line":55,"address":[11355296,11355495,11355456,11355359],"length":1,"stats":{"Line":2}},{"line":56,"address":[],"length":0,"stats":{"Line":4}},{"line":57,"address":[8796942,8797056],"length":1,"stats":{"Line":2}},{"line":79,"address":[11355584,11356254,11356223],"length":1,"stats":{"Line":1}},{"line":81,"address":[11355745,11355690,11355614],"length":1,"stats":{"Line":3}},{"line":82,"address":[11355948,11355818,11355893],"length":1,"stats":{"Line":3}},{"line":88,"address":[11356272],"length":1,"stats":{"Line":1}},{"line":89,"address":[11356285],"length":1,"stats":{"Line":1}},{"line":91,"address":[8797859,8797840],"length":1,"stats":{"Line":2}},{"line":93,"address":[11356332],"length":1,"stats":{"Line":1}},{"line":96,"address":[11356528],"length":1,"stats":{"Line":1}},{"line":97,"address":[11356624,11356543,11356853],"length":1,"stats":{"Line":2}},{"line":98,"address":[11356633],"length":1,"stats":{"Line":1}},{"line":99,"address":[11356727,11356641],"length":1,"stats":{"Line":2}},{"line":100,"address":[11356802],"length":1,"stats":{"Line":1}},{"line":107,"address":[11356880],"length":1,"stats":{"Line":1}},{"line":108,"address":[8798349],"length":1,"stats":{"Line":1}},{"line":110,"address":[11356979,11356960],"length":1,"stats":{"Line":2}},{"line":111,"address":[8798481],"length":1,"stats":{"Line":1}},{"line":115,"address":[11356940],"length":1,"stats":{"Line":1}},{"line":118,"address":[11357104],"length":1,"stats":{"Line":1}},{"line":119,"address":[11357168,11357295,11357126],"length":1,"stats":{"Line":2}},{"line":120,"address":[11357195,11357263],"length":1,"stats":{"Line":2}},{"line":133,"address":[8798752,8798879],"length":1,"stats":{"Line":1}},{"line":134,"address":[11357345],"length":1,"stats":{"Line":1}},{"line":139,"address":[11358129,11357488],"length":1,"stats":{"Line":1}},{"line":140,"address":[11357508,11357641,11357675],"length":1,"stats":{"Line":3}},{"line":141,"address":[11357722,11357962],"length":1,"stats":{"Line":2}},{"line":145,"address":[10945780,10945472],"length":1,"stats":{"Line":1}},{"line":146,"address":[11358352,11358533,11358425,11358183,11358528],"length":1,"stats":{"Line":5}},{"line":149,"address":[11359193,11358544],"length":1,"stats":{"Line":1}},{"line":150,"address":[11358564,11358697,11358729],"length":1,"stats":{"Line":3}},{"line":151,"address":[11358776,11359016],"length":1,"stats":{"Line":2}},{"line":155,"address":[11359216,11359559],"length":1,"stats":{"Line":1}},{"line":156,"address":[11359600,11359608,11359242,11359421,11359489],"length":1,"stats":{"Line":5}},{"line":167,"address":[11359648],"length":1,"stats":{"Line":0}},{"line":168,"address":[11359665],"length":1,"stats":{"Line":0}},{"line":173,"address":[11359744],"length":1,"stats":{"Line":0}},{"line":174,"address":[11359749],"length":1,"stats":{"Line":0}},{"line":177,"address":[8799088],"length":1,"stats":{"Line":0}},{"line":178,"address":[11359769],"length":1,"stats":{"Line":0}},{"line":182,"address":[],"length":0,"stats":{"Line":0}},{"line":184,"address":[],"length":0,"stats":{"Line":0}},{"line":187,"address":[11360271,11359808],"length":1,"stats":{"Line":0}},{"line":188,"address":[11360100,11360174,11360304,11359912,11359838,11360312],"length":1,"stats":{"Line":0}}],"covered":40,"coverable":67},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","e2e.rs"],"content":"use plonky2::plonk::{circuit_data::VerifierOnlyCircuitData, proof::ProofWithPublicInputs};\n\nuse indicatif::ProgressBar;\nuse rayon::prelude::*;\n\nuse crate::{\n    account::Account,\n    circuit_registry::registry::CircuitRegistry,\n    merkle_sum_prover::prover::MerkleSumTreeProver,\n    recursive_prover::prover::RecursiveProver,\n    types::{C, D, F},\n};\n\npub fn batch_prove_accounts\u003cconst RECURSION_BRANCHOUT_NUM: usize\u003e(\n    circuit_registry: \u0026CircuitRegistry\u003cRECURSION_BRANCHOUT_NUM\u003e,\n    account_batches: Vec\u003cAccount\u003e,\n    parallism: usize,\n    batch_size: usize,\n) -\u003e Vec\u003cProofWithPublicInputs\u003cF, C, D\u003e\u003e {\n    let mut batch_proofs: Vec\u003cProofWithPublicInputs\u003cF, C, D\u003e\u003e = Vec::new();\n    let (batch_circuit, account_targets) = circuit_registry.get_batch_circuit();\n\n    let _ = account_batches\n        .chunks(parallism * batch_size)\n        .map(|chunk| {\n            let proofs: Vec\u003cProofWithPublicInputs\u003cF, C, D\u003e\u003e = chunk\n                .par_chunks(batch_size)\n                .map(|accounts| {\n                    let prover = MerkleSumTreeProver { accounts: accounts.to_owned() };\n                    let proof = prover.get_proof_with_circuit_data(account_targets, batch_circuit);\n                    proof\n                })\n                .collect();\n            batch_proofs.extend(proofs.into_iter());\n        })\n        .collect::\u003cVec\u003c_\u003e\u003e();\n\n    batch_proofs\n}\n\npub fn prove_subproofs\u003cconst RECURSION_BRANCHOUT_NUM: usize\u003e(\n    subproofs: Vec\u003cProofWithPublicInputs\u003cF, C, D\u003e\u003e,\n    last_level_circuit_vd: VerifierOnlyCircuitData\u003cC, D\u003e,\n    circuit_registry: \u0026CircuitRegistry\u003cRECURSION_BRANCHOUT_NUM\u003e,\n    parallism: usize,\n    level: usize,\n) -\u003e Vec\u003cProofWithPublicInputs\u003cF, C, D\u003e\u003e {\n    let bar = ProgressBar::new(subproofs.len() as u64);\n    assert_eq!(subproofs.len() % RECURSION_BRANCHOUT_NUM, 0);\n    let last_level_vd_digest = last_level_circuit_vd.circuit_digest;\n\n    let (recursive_circuit, recursive_targets) =\n        circuit_registry.get_recursive_circuit(\u0026last_level_vd_digest).expect(\n            format!(\n                \"No recursive circuit found for inner circuit with vd {:?}\",\n                last_level_vd_digest\n            )\n            .as_str(),\n        );\n\n    let expected_this_level_proof_num = subproofs.len() / RECURSION_BRANCHOUT_NUM;\n    let mut this_level_proofs = vec![];\n\n    let _ = subproofs\n        .chunks(parallism * RECURSION_BRANCHOUT_NUM)\n        .map(|chunk| {\n            let proofs: Vec\u003cProofWithPublicInputs\u003cF, C, D\u003e\u003e = chunk\n                .par_chunks(RECURSION_BRANCHOUT_NUM)\n                .map(|subproofs| {\n                    let recursive_prover = RecursiveProver {\n                        sub_proofs: subproofs\n                            .to_owned()\n                            .try_into()\n                            .expect(\"subproofs length not equal to RECURSION_BRANCHOUT_NUM\"),\n                        sub_circuit_vd: last_level_circuit_vd.clone(),\n                    };\n                    let proof = recursive_prover\n                        .get_proof_with_circuit_data(recursive_targets.clone(), \u0026recursive_circuit);\n                    proof\n                })\n                .collect();\n            this_level_proofs.extend(proofs.into_iter());\n            bar.inc((this_level_proofs.len() * RECURSION_BRANCHOUT_NUM) as u64);\n            tracing::debug!(\n                \"finish {}/{} proofs in level {}/{}\",\n                this_level_proofs.len(),\n                expected_this_level_proof_num,\n                level,\n                circuit_registry.get_recursive_levels()\n            );\n        })\n        .collect::\u003cVec\u003c_\u003e\u003e();\n    bar.finish();\n\n    this_level_proofs\n}\n\npub fn recursive_prove_subproofs\u003cconst RECURSION_BRANCHOUT_NUM: usize\u003e(\n    subproofs: Vec\u003cProofWithPublicInputs\u003cF, C, D\u003e\u003e,\n    circuit_registry: \u0026CircuitRegistry\u003cRECURSION_BRANCHOUT_NUM\u003e,\n    parallism: usize,\n) -\u003e ProofWithPublicInputs\u003cF, C, D\u003e {\n    let (batch_circuit, _) = circuit_registry.get_batch_circuit();\n    let mut last_level_circuit_vd = batch_circuit.verifier_only.clone();\n    let mut last_level_proofs = subproofs;\n    let recursive_levels = circuit_registry.get_recursive_levels();\n    tracing::info!(\"total recursive levels: {:?}\", recursive_levels);\n\n    for level in 1..=recursive_levels {\n        let start = std::time::Instant::now();\n\n        let last_level_vd_digest = last_level_circuit_vd.circuit_digest;\n        let last_level_empty_proof = circuit_registry\n            .get_empty_proof(\u0026last_level_vd_digest)\n            .expect(\n                format!(\"fail to find empty proof for circuit vd {:?}\", last_level_vd_digest)\n                    .as_str(),\n            )\n            .clone();\n\n        let subproof_len = last_level_proofs.len();\n\n        if subproof_len % RECURSION_BRANCHOUT_NUM != 0 {\n            let pad_num = RECURSION_BRANCHOUT_NUM - subproof_len % RECURSION_BRANCHOUT_NUM;\n            tracing::info!(\"At level {}, {} subproofs are not a multiple of RECURSION_BRANCHOUT_NUM {}, hence padding {} empty proofs. \", level, subproof_len, RECURSION_BRANCHOUT_NUM, pad_num);\n\n            last_level_proofs.resize(subproof_len + pad_num, last_level_empty_proof);\n        }\n\n        last_level_proofs = prove_subproofs(\n            last_level_proofs,\n            last_level_circuit_vd.clone(),\n            circuit_registry,\n            parallism,\n            level,\n        );\n\n        let recursive_circuit = circuit_registry\n            .get_recursive_circuit(\u0026last_level_circuit_vd.circuit_digest)\n            .expect(\n                format!(\n                    \"No recursive circuit found for inner circuit with vd {:?}\",\n                    last_level_circuit_vd.circuit_digest\n                )\n                .as_str(),\n            )\n            .0;\n\n        last_level_circuit_vd = recursive_circuit.verifier_only.clone();\n\n        tracing::info!(\n            \"finish recursive level {} with {} proofs in : {:?}\",\n            level,\n            last_level_proofs.len(),\n            start.elapsed()\n        );\n    }\n\n    if last_level_proofs.len() != 1 {\n        panic!(\"The last level proofs should be of length 1, but got {}\", last_level_proofs.len());\n    }\n    let root_proof = last_level_proofs.pop().unwrap();\n    circuit_registry\n        .get_root_circuit()\n        .verify(root_proof.clone())\n        .expect(\"fail to verify root proof\");\n    root_proof\n}\n","traces":[{"line":14,"address":[9347488,9348003],"length":1,"stats":{"Line":0}},{"line":20,"address":[],"length":0,"stats":{"Line":0}},{"line":21,"address":[9347607,9347653],"length":1,"stats":{"Line":0}},{"line":23,"address":[],"length":0,"stats":{"Line":0}},{"line":24,"address":[],"length":0,"stats":{"Line":0}},{"line":25,"address":[],"length":0,"stats":{"Line":0}},{"line":26,"address":[],"length":0,"stats":{"Line":0}},{"line":27,"address":[9348068],"length":1,"stats":{"Line":0}},{"line":28,"address":[],"length":0,"stats":{"Line":0}},{"line":29,"address":[],"length":0,"stats":{"Line":0}},{"line":30,"address":[],"length":0,"stats":{"Line":0}},{"line":31,"address":[],"length":0,"stats":{"Line":0}},{"line":33,"address":[],"length":0,"stats":{"Line":0}},{"line":34,"address":[],"length":0,"stats":{"Line":0}},{"line":38,"address":[9347958],"length":1,"stats":{"Line":0}},{"line":41,"address":[9344942,9343584],"length":1,"stats":{"Line":0}},{"line":48,"address":[],"length":0,"stats":{"Line":0}},{"line":49,"address":[9343756,9343809],"length":1,"stats":{"Line":0}},{"line":50,"address":[9343955],"length":1,"stats":{"Line":0}},{"line":52,"address":[9343987,9344326],"length":1,"stats":{"Line":0}},{"line":53,"address":[],"length":0,"stats":{"Line":0}},{"line":54,"address":[],"length":0,"stats":{"Line":0}},{"line":55,"address":[],"length":0,"stats":{"Line":0}},{"line":56,"address":[],"length":0,"stats":{"Line":0}},{"line":58,"address":[],"length":0,"stats":{"Line":0}},{"line":61,"address":[9344411],"length":1,"stats":{"Line":0}},{"line":62,"address":[],"length":0,"stats":{"Line":0}},{"line":64,"address":[],"length":0,"stats":{"Line":0}},{"line":65,"address":[],"length":0,"stats":{"Line":0}},{"line":66,"address":[],"length":0,"stats":{"Line":0}},{"line":67,"address":[],"length":0,"stats":{"Line":0}},{"line":68,"address":[],"length":0,"stats":{"Line":0}},{"line":69,"address":[],"length":0,"stats":{"Line":0}},{"line":70,"address":[],"length":0,"stats":{"Line":0}},{"line":71,"address":[],"length":0,"stats":{"Line":0}},{"line":72,"address":[],"length":0,"stats":{"Line":0}},{"line":73,"address":[],"length":0,"stats":{"Line":0}},{"line":74,"address":[],"length":0,"stats":{"Line":0}},{"line":75,"address":[],"length":0,"stats":{"Line":0}},{"line":77,"address":[9347380],"length":1,"stats":{"Line":0}},{"line":78,"address":[],"length":0,"stats":{"Line":0}},{"line":79,"address":[],"length":0,"stats":{"Line":0}},{"line":81,"address":[],"length":0,"stats":{"Line":0}},{"line":82,"address":[],"length":0,"stats":{"Line":0}},{"line":83,"address":[9345352,9345173],"length":1,"stats":{"Line":0}},{"line":84,"address":[],"length":0,"stats":{"Line":0}},{"line":85,"address":[],"length":0,"stats":{"Line":0}},{"line":86,"address":[],"length":0,"stats":{"Line":0}},{"line":87,"address":[],"length":0,"stats":{"Line":0}},{"line":88,"address":[],"length":0,"stats":{"Line":0}},{"line":89,"address":[],"length":0,"stats":{"Line":0}},{"line":93,"address":[9344791],"length":1,"stats":{"Line":0}},{"line":95,"address":[],"length":0,"stats":{"Line":0}},{"line":103,"address":[],"length":0,"stats":{"Line":0}},{"line":104,"address":[],"length":0,"stats":{"Line":0}},{"line":105,"address":[],"length":0,"stats":{"Line":0}},{"line":106,"address":[],"length":0,"stats":{"Line":0}},{"line":107,"address":[],"length":0,"stats":{"Line":0}},{"line":109,"address":[],"length":0,"stats":{"Line":0}},{"line":110,"address":[],"length":0,"stats":{"Line":0}},{"line":112,"address":[],"length":0,"stats":{"Line":0}},{"line":113,"address":[],"length":0,"stats":{"Line":0}},{"line":114,"address":[],"length":0,"stats":{"Line":0}},{"line":116,"address":[],"length":0,"stats":{"Line":0}},{"line":117,"address":[],"length":0,"stats":{"Line":0}},{"line":121,"address":[],"length":0,"stats":{"Line":0}},{"line":123,"address":[],"length":0,"stats":{"Line":0}},{"line":124,"address":[],"length":0,"stats":{"Line":0}},{"line":125,"address":[],"length":0,"stats":{"Line":0}},{"line":127,"address":[],"length":0,"stats":{"Line":0}},{"line":130,"address":[],"length":0,"stats":{"Line":0}},{"line":131,"address":[],"length":0,"stats":{"Line":0}},{"line":132,"address":[],"length":0,"stats":{"Line":0}},{"line":133,"address":[],"length":0,"stats":{"Line":0}},{"line":134,"address":[],"length":0,"stats":{"Line":0}},{"line":135,"address":[],"length":0,"stats":{"Line":0}},{"line":138,"address":[],"length":0,"stats":{"Line":0}},{"line":139,"address":[],"length":0,"stats":{"Line":0}},{"line":140,"address":[],"length":0,"stats":{"Line":0}},{"line":141,"address":[],"length":0,"stats":{"Line":0}},{"line":142,"address":[],"length":0,"stats":{"Line":0}},{"line":143,"address":[],"length":0,"stats":{"Line":0}},{"line":145,"address":[],"length":0,"stats":{"Line":0}},{"line":147,"address":[],"length":0,"stats":{"Line":0}},{"line":149,"address":[],"length":0,"stats":{"Line":0}},{"line":151,"address":[],"length":0,"stats":{"Line":0}},{"line":152,"address":[],"length":0,"stats":{"Line":0}},{"line":153,"address":[],"length":0,"stats":{"Line":0}},{"line":154,"address":[],"length":0,"stats":{"Line":0}},{"line":155,"address":[],"length":0,"stats":{"Line":0}},{"line":159,"address":[],"length":0,"stats":{"Line":0}},{"line":160,"address":[],"length":0,"stats":{"Line":0}},{"line":162,"address":[],"length":0,"stats":{"Line":0}},{"line":163,"address":[],"length":0,"stats":{"Line":0}},{"line":165,"address":[],"length":0,"stats":{"Line":0}},{"line":167,"address":[],"length":0,"stats":{"Line":0}}],"covered":0,"coverable":96},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","error.rs"],"content":"use config::ConfigError;\nuse thiserror::Error;\n\n#[derive(Debug, Error)]\npub enum PoRError {\n    #[error(\"Proof is not valid\")]\n    InvalidProof,\n\n    #[error(\"Merkle proof is not valid for accountID {0}\")]\n    InvalidMerkleProof(String),\n\n    #[error(\"config error: {0}\")]\n    ConfigError(#[from] ConfigError),\n\n    #[error(\"IO error occurred: {0}\")]\n    Io(#[from] std::io::Error),\n\n    #[error(\"Unknown error\")]\n    Unknown,\n\n    #[error(\"Invalid parameter: {0}\")]\n    InvalidParameter(String),\n\n    #[error(\"The verification circuit digest does not match the prover. \")]\n    CircuitDigestMismatch,\n\n    #[error(\"User is not valid\")]\n    InvalidUser,\n}\n","traces":[],"covered":0,"coverable":0},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","global.rs"],"content":"use crate::{\n    circuit_utils::recursive_levels,\n    database::PoRDB,\n    merkle_sum_prover::utils::hash_2_subhashes,\n    recursive_prover::prover::hash_n_subhashes,\n    types::{D, F},\n    util::{get_node_level, pad_to_multiple_of},\n};\nuse once_cell::sync::OnceCell;\nuse plonky2::{hash::hash_types::HashOut, util::log2_strict};\nuse std::{ops::Div, sync::RwLock};\nuse tracing::debug;\n\n#[derive(Debug, Clone, Copy)]\npub struct GlobalConfig {\n    pub num_of_tokens: usize,\n    pub num_of_batches: usize,\n    pub batch_size: usize, // num of accounts witin one batch\n    pub recursion_branchout_num: usize,\n}\n\npub static GLOBAL_MST: OnceCell\u003cRwLock\u003cGlobalMst\u003e\u003e = OnceCell::new();\n\npub struct GlobalMst {\n    pub inner: Vec\u003cHashOut\u003cF\u003e\u003e,\n    top_recursion_level: usize,\n    pub cfg: GlobalConfig,\n}\n\nimpl GlobalMst {\n    pub fn new(cfg: GlobalConfig) -\u003e Self {\n        let top_level = recursive_levels(cfg.num_of_batches, cfg.recursion_branchout_num);\n\n        let mst_vec = vec![HashOut::default(); 0]; // will resize later\n        let mut mst = Self { inner: mst_vec, top_recursion_level: top_level, cfg: cfg };\n        // the number of hash is one smaller to the index of the root node of the last recursion level.\n        let root_node_idx = GlobalMst::get_recursive_global_index(\u0026cfg, top_level, 0);\n        let tree_size = root_node_idx + 1;\n        mst.inner.resize(tree_size, HashOut::default());\n        mst\n    }\n\n    pub fn get_tree_length(\u0026self) -\u003e usize {\n        self.inner.len()\n    }\n\n    pub fn get_num_of_leaves(cfg: \u0026GlobalConfig) -\u003e usize {\n        cfg.batch_size * cfg.num_of_batches\n    }\n\n    pub fn get_nodes(\u0026self, range: std::ops::Range\u003cusize\u003e) -\u003e \u0026[HashOut\u003cF\u003e] {\n        \u0026self.inner[range]\n    }\n\n    pub fn get_root(\u0026self) -\u003e Option\u003c\u0026HashOut\u003cF\u003e\u003e {\n        self.inner.last()\n    }\n\n    /// convert a mst node inner index to global index in gmst.\n    /// For a mst, the inner index is level-by-level, e.g.,\n    ///       14\n    ///   12      13\n    ///  8-9,   10-11\n    /// 0 - 3,  4 - 7\n    pub fn get_batch_tree_global_index(\n        cfg: \u0026GlobalConfig,\n        batch_idx: usize,\n        inner_tree_idx: usize,\n    ) -\u003e usize {\n        let batch_size = cfg.batch_size;\n        let tree_depth = log2_strict(batch_size);\n        let batch_tree_level = get_node_level(batch_size, inner_tree_idx);\n\n        let level_from_bottom = tree_depth - batch_tree_level;\n\n        let numeritor = 2 * batch_size * cfg.num_of_batches;\n        let global_tree_vertical_offset = numeritor - numeritor.div(1 \u003c\u003c level_from_bottom); // the gmst idx of the first node at {level_from_bottom} level\n\n        let level_node_counts = batch_size.div(1 \u003c\u003c level_from_bottom);\n        let global_inter_tree_horizontal_offset = level_node_counts * (batch_idx); // the number of preceding nodes at {level_from_bottom} level in the preceding mst.\n\n        let intra_tree_horizontal_offset =\n            inner_tree_idx - (2 * batch_size - 2 * batch_size.div(1 \u003c\u003c level_from_bottom));\n        // the number of preceding nodes at {level_from_bottom} level in the current mst.\n\n        let index = global_tree_vertical_offset\n            + global_inter_tree_horizontal_offset\n            + intra_tree_horizontal_offset;\n        index\n    }\n\n    // mst root node at level 0,\n    pub fn get_recursive_global_index(\n        cfg: \u0026GlobalConfig,\n        recursive_level: usize,\n        inner_level_idx: usize,\n    ) -\u003e usize {\n        let mst_node_num = 2 * cfg.batch_size - 1;\n        let batch_num = cfg.num_of_batches;\n        let branchout_num = cfg.recursion_branchout_num;\n        if recursive_level == 0 {\n            // level of merkle sum tree root\n            if inner_level_idx \u003c cfg.num_of_batches {\n                // the global index of the root of the batch tree\n                let mst_root_idx = mst_node_num - 1;\n                return GlobalMst::get_batch_tree_global_index(cfg, inner_level_idx, mst_root_idx);\n            } else {\n                return batch_num * mst_node_num + (inner_level_idx - cfg.num_of_batches);\n            }\n        }\n\n        // pad num_of_batches to be multiple of recursion_branchout_num.\n        let pad_num = if batch_num % branchout_num == 0 {\n            0\n        } else {\n            branchout_num - batch_num % branchout_num\n        };\n\n        let mut last_level_node_num = batch_num + pad_num;\n        assert_eq!(0, last_level_node_num % branchout_num);\n\n        let mut recursive_offset = batch_num * mst_node_num + pad_num;\n\n        let mut level = recursive_level;\n        while level \u003e 1 {\n            let mut this_level_node_num = last_level_node_num / cfg.recursion_branchout_num;\n            this_level_node_num =\n                pad_to_multiple_of(this_level_node_num, cfg.recursion_branchout_num);\n\n            recursive_offset += this_level_node_num;\n\n            last_level_node_num = this_level_node_num;\n            level -= 1;\n        }\n\n        let global_recursive_index = recursive_offset + inner_level_idx;\n        global_recursive_index\n    }\n\n    /// `batch_idx`: index indicating the batch index\n    /// `i`: the sub batch tree index; e.g the batch tree is of size 1\u003c\u003c10; i \\in [0, 2*batch_size)\n    pub fn set_batch_hash(\u0026mut self, batch_idx: usize, i: usize, hash: HashOut\u003cF\u003e) {\n        let global_mst_idx = GlobalMst::get_batch_tree_global_index(\u0026self.cfg, batch_idx, i);\n        self.inner[global_mst_idx] = hash;\n    }\n\n    pub fn get_batch_root_hash(\u0026self, batch_idx: usize) -\u003e HashOut\u003cF\u003e {\n        debug!(\"get batch root hash, batch_idx: {:?}\", batch_idx);\n        assert!(batch_idx \u003c self.cfg.num_of_batches);\n        let root_idx = GlobalMst::get_batch_tree_global_index(\n            \u0026self.cfg,\n            batch_idx,\n            2 * self.cfg.batch_size - 2,\n        );\n        self.inner[root_idx]\n    }\n\n    /// `recursive_level` count from bottom to top; recursive_level = 1 means the bottom layer; increase whilve moving to the top.\n    pub fn set_recursive_hash(\u0026mut self, recursive_level: usize, index: usize, hash: HashOut\u003cF\u003e) {\n        let idx = GlobalMst::get_recursive_global_index(\u0026self.cfg, recursive_level, index);\n        tracing::debug!(\n            \"set_recursive_hash, recursive_level: {:?}, index: {:?}, hash: {:?}, idx: {:?}\",\n            recursive_level,\n            index,\n            hash,\n            idx,\n        );\n        self.inner[idx] = hash;\n    }\n\n    pub fn is_integral(\u0026self) -\u003e bool {\n        // we check all nodes are examined to ensure global_index-related functions are correct.\n        let mut visited_global_idx = vec![false; self.inner.len()];\n        let batch_num = self.cfg.num_of_batches;\n        for tree_idx in 0..self.cfg.num_of_batches {\n            let leaf_size = self.cfg.batch_size;\n            let mst_size = 2 * leaf_size - 1;\n            for inner_tree_idx in leaf_size..mst_size {\n                let inner_left_child_idx = 2 * (inner_tree_idx - leaf_size);\n                let inner_right_child_idx = 2 * (inner_tree_idx - leaf_size) + 1;\n\n                let global_parent_idx =\n                    GlobalMst::get_batch_tree_global_index(\u0026self.cfg, tree_idx, inner_tree_idx);\n                let global_left_child_idx = GlobalMst::get_batch_tree_global_index(\n                    \u0026self.cfg,\n                    tree_idx,\n                    inner_left_child_idx,\n                );\n                let global_right_child_idx = GlobalMst::get_batch_tree_global_index(\n                    \u0026self.cfg,\n                    tree_idx,\n                    inner_right_child_idx,\n                );\n\n                visited_global_idx[global_left_child_idx] = true;\n                visited_global_idx[global_right_child_idx] = true;\n\n                let expected_parent_hash = hash_2_subhashes::\u003cF, D\u003e(\n                    \u0026self.inner[global_left_child_idx],\n                    \u0026self.inner[global_right_child_idx],\n                );\n                if expected_parent_hash != self.inner[global_parent_idx] {\n                    tracing::error!(\"Inconsistent hash at mst tree {}, global index (parent: {:?}, left child: {:?}, right child: {:?}), inner index (parent: {:?}, left child: {:?}, right child: {:?}), expected parent hash: {:?}, actual parent hash: {:?}\", tree_idx, global_parent_idx, global_left_child_idx, global_right_child_idx,  inner_tree_idx, inner_left_child_idx, inner_right_child_idx, expected_parent_hash, self.inner[global_parent_idx]);\n                    return false;\n                }\n            }\n        }\n        let branchout_num = self.cfg.recursion_branchout_num;\n        let mut last_level_node_count = pad_to_multiple_of(batch_num, branchout_num);\n        for level in 1..=self.top_recursion_level {\n            let this_level_node_count = last_level_node_count / branchout_num;\n            for inner_idx in 0..this_level_node_count {\n                let inner_child_indexes = (0..branchout_num)\n                    .map(|i| inner_idx * branchout_num + i)\n                    .collect::\u003cVec\u003cusize\u003e\u003e();\n                let global_idx = GlobalMst::get_recursive_global_index(\u0026self.cfg, level, inner_idx);\n                let global_child_indexes = inner_child_indexes\n                    .iter()\n                    .map(|\u0026i| {\n                        let child_global_idx =\n                            GlobalMst::get_recursive_global_index(\u0026self.cfg, level - 1, i);\n                        visited_global_idx[child_global_idx] = true;\n                        child_global_idx\n                    })\n                    .collect::\u003cVec\u003cusize\u003e\u003e();\n\n                let children_hashes = global_child_indexes\n                    .iter()\n                    .map(|\u0026i| self.inner[i])\n                    .collect::\u003cVec\u003cHashOut\u003cF\u003e\u003e\u003e();\n\n                let expected_parent_hash = hash_n_subhashes::\u003cF, D\u003e(\u0026children_hashes);\n\n                if expected_parent_hash != self.inner[global_idx] {\n                    tracing::error!(\"Inconsistent hash at recursive level {}, Global index: {:?}, global child indexes: {:?}, inner index: {:?}, child indexes {:?}, expected parent hash: {:?}, actual parent hash: {:?}. \", level, global_idx, global_child_indexes, inner_idx, inner_child_indexes, expected_parent_hash, self.inner[global_idx]);\n                    return false;\n                }\n                last_level_node_count = pad_to_multiple_of(this_level_node_count, branchout_num);\n            }\n        }\n        let global_root_idx =\n            GlobalMst::get_recursive_global_index(\u0026self.cfg, self.top_recursion_level, 0);\n        visited_global_idx[global_root_idx] = true;\n\n        visited_global_idx.iter().all(|\u0026v| v)\n    }\n\n    pub fn persist(\u0026self, db: \u0026mut Box\u003cdyn PoRDB\u003e) {\n        let length = self.get_tree_length();\n        tracing::info!(\"start to persist gmst into db of size: {:?}\", length);\n        let chunk_size = 1 \u003c\u003c 12;\n        let mut i = 0;\n        while i \u003c length {\n            let end = if i + chunk_size \u003c= length { i + chunk_size } else { length };\n            let nodes = self.get_nodes(i..end);\n            let batches = (i..end)\n                .into_iter()\n                .enumerate()\n                .map(|(chunk_idx, j)| ((j).try_into().unwrap(), nodes[chunk_idx]))\n                .collect::\u003cVec\u003c(i32, HashOut\u003cF\u003e)\u003e\u003e();\n            db.add_batch_gmst_nodes(batches);\n            i += chunk_size;\n        }\n    }\n}\n\n#[cfg(test)]\nmod test {\n    use super::GlobalMst;\n    use crate::{\n        account::gen_accounts_with_random_data,\n        merkle_sum_tree::MerkleSumTree,\n        recursive_prover::prover::hash_n_subhashes,\n        types::{D, F},\n        util::pad_to_multiple_of,\n    };\n    use plonky2::hash::hash_types::HashOut;\n    use zk_por_tracing::{init_tracing, TraceConfig};\n\n    #[test]\n    fn test_index() {\n        let gmst = GlobalMst::new(super::GlobalConfig {\n            num_of_tokens: 22,\n            num_of_batches: 6,\n            batch_size: 8,\n            recursion_branchout_num: 4,\n        });\n        let total_len = gmst.get_tree_length();\n\n        /*\n        L2:                                 96\n        L1:         92            93                 94                95\n        L0:     84,    85,    86,     87,        88,      89,       90e,  91e\n                72-73, 74-75,  76-77,  78-79,    80-81,   82-83,\n                48-51, 52-55,  56-59,   60-63,   64-67,   68-71\n                0 - 7, 8 - 15, 16 - 23, 24 - 31, 32 - 39, 40 - 47\n        */\n        assert_eq!(total_len, 97);\n        assert_eq!(gmst.top_recursion_level, 2);\n\n        assert_eq!(GlobalMst::get_batch_tree_global_index(\u0026gmst.cfg, 0, 1), 1);\n        assert_eq!(GlobalMst::get_batch_tree_global_index(\u0026gmst.cfg, 0, 14), 84);\n        assert_eq!(GlobalMst::get_batch_tree_global_index(\u0026gmst.cfg, 1, 1), 9);\n        assert_eq!(GlobalMst::get_batch_tree_global_index(\u0026gmst.cfg, 1, 14), 85);\n        assert_eq!(GlobalMst::get_batch_tree_global_index(\u0026gmst.cfg, 5, 7), 47);\n        assert_eq!(GlobalMst::get_batch_tree_global_index(\u0026gmst.cfg, 5, 14), 89);\n\n        assert_eq!(GlobalMst::get_recursive_global_index(\u0026gmst.cfg, 0, 7), 91);\n        assert_eq!(GlobalMst::get_recursive_global_index(\u0026gmst.cfg, 0, 1), 85);\n        assert_eq!(GlobalMst::get_recursive_global_index(\u0026gmst.cfg, 1, 0), 92);\n        assert_eq!(GlobalMst::get_recursive_global_index(\u0026gmst.cfg, 1, 1), 93);\n        assert_eq!(GlobalMst::get_recursive_global_index(\u0026gmst.cfg, 1, 2), 94);\n        assert_eq!(GlobalMst::get_recursive_global_index(\u0026gmst.cfg, 1, 3), 95);\n        assert_eq!(GlobalMst::get_recursive_global_index(\u0026gmst.cfg, 2, 0), 96);\n    }\n\n    #[test]\n    fn test_integrity() {\n        let cfg = TraceConfig {\n            prefix: \"zkpor\".to_string(),\n            dir: \"logs\".to_string(),\n            level: tracing::Level::DEBUG,\n            console: true,\n            flame: false,\n        };\n\n        {\n            init_tracing(cfg)\n        };\n\n        let mut gmst = GlobalMst::new(super::GlobalConfig {\n            num_of_tokens: 22,\n            num_of_batches: 6,\n            batch_size: 8,\n            recursion_branchout_num: 4,\n        });\n\n        assert!(!gmst.is_integral());\n        let batch_num = gmst.cfg.num_of_batches;\n        let batch_size = gmst.cfg.batch_size;\n        let branchout_num = gmst.cfg.recursion_branchout_num;\n\n        for batch_idx in 0..batch_num {\n            let accounts = gen_accounts_with_random_data(batch_size, 1);\n            let mst = MerkleSumTree::new_tree_from_accounts(\u0026accounts);\n\n            for i in 0..batch_size * 2 - 1 {\n                gmst.set_batch_hash(batch_idx, i, mst.merkle_sum_tree[i].hash);\n            }\n        }\n\n        let mut last_level_node_num = pad_to_multiple_of(batch_num, branchout_num);\n        for level in 1..=gmst.top_recursion_level {\n            let this_level_node_count = last_level_node_num / branchout_num;\n            for inner_idx in 0..this_level_node_count {\n                let children_hashes = (0..branchout_num)\n                    .map(|i| {\n                        let child_global_idx = GlobalMst::get_recursive_global_index(\n                            \u0026gmst.cfg,\n                            level - 1,\n                            inner_idx * branchout_num + i,\n                        );\n                        gmst.inner[child_global_idx]\n                    })\n                    .collect::\u003cVec\u003cHashOut\u003cF\u003e\u003e\u003e();\n\n                let expected_parent_hash = hash_n_subhashes::\u003cF, D\u003e(\u0026children_hashes);\n                gmst.set_recursive_hash(level, inner_idx, expected_parent_hash);\n            }\n\n            last_level_node_num = pad_to_multiple_of(this_level_node_count, branchout_num);\n        }\n        assert!(gmst.is_integral());\n    }\n}\n","traces":[{"line":31,"address":[11360730,11360352],"length":1,"stats":{"Line":1}},{"line":32,"address":[8799670],"length":1,"stats":{"Line":1}},{"line":34,"address":[11360404],"length":1,"stats":{"Line":1}},{"line":35,"address":[11360466],"length":1,"stats":{"Line":1}},{"line":37,"address":[11360523,11360588],"length":1,"stats":{"Line":2}},{"line":38,"address":[8799914,8799872],"length":1,"stats":{"Line":1}},{"line":39,"address":[11360623,11360667],"length":1,"stats":{"Line":2}},{"line":40,"address":[11360699],"length":1,"stats":{"Line":1}},{"line":43,"address":[11360752],"length":1,"stats":{"Line":1}},{"line":44,"address":[11360757],"length":1,"stats":{"Line":1}},{"line":47,"address":[11360768],"length":1,"stats":{"Line":1}},{"line":48,"address":[11360777,11360805],"length":1,"stats":{"Line":1}},{"line":51,"address":[11360832],"length":1,"stats":{"Line":0}},{"line":52,"address":[11360850],"length":1,"stats":{"Line":0}},{"line":55,"address":[11360880],"length":1,"stats":{"Line":0}},{"line":56,"address":[11360885],"length":1,"stats":{"Line":0}},{"line":65,"address":[11360912],"length":1,"stats":{"Line":1}},{"line":70,"address":[8800238],"length":1,"stats":{"Line":1}},{"line":71,"address":[11360975],"length":1,"stats":{"Line":1}},{"line":72,"address":[11361004],"length":1,"stats":{"Line":1}},{"line":74,"address":[11361080,11361026],"length":1,"stats":{"Line":1}},{"line":76,"address":[8800443,8800339,8800385],"length":1,"stats":{"Line":2}},{"line":77,"address":[11361156,11361282,11361190],"length":1,"stats":{"Line":2}},{"line":79,"address":[11361274,11361308,11361360],"length":1,"stats":{"Line":2}},{"line":80,"address":[11361345,11361414,11361386],"length":1,"stats":{"Line":2}},{"line":82,"address":[11361435,11361655,11361394],"length":1,"stats":{"Line":2}},{"line":86,"address":[11361731,11361640,11361681],"length":1,"stats":{"Line":2}},{"line":93,"address":[8801040],"length":1,"stats":{"Line":1}},{"line":98,"address":[11361815,11361961],"length":1,"stats":{"Line":1}},{"line":99,"address":[11361919],"length":1,"stats":{"Line":1}},{"line":100,"address":[11361936],"length":1,"stats":{"Line":1}},{"line":101,"address":[11361953],"length":1,"stats":{"Line":1}},{"line":103,"address":[11361993],"length":1,"stats":{"Line":1}},{"line":105,"address":[11362057,11362271,11362247],"length":1,"stats":{"Line":2}},{"line":106,"address":[8801535],"length":1,"stats":{"Line":1}},{"line":108,"address":[11362034,11362100],"length":1,"stats":{"Line":2}},{"line":113,"address":[8801576,8801286,8801617,8801724],"length":1,"stats":{"Line":4}},{"line":114,"address":[11362326],"length":1,"stats":{"Line":1}},{"line":116,"address":[11362345,11362447,11362388],"length":1,"stats":{"Line":2}},{"line":119,"address":[11362358,11362502,11362473],"length":1,"stats":{"Line":2}},{"line":120,"address":[11362481,11362528],"length":1,"stats":{"Line":2}},{"line":122,"address":[11362687,11362772],"length":1,"stats":{"Line":1}},{"line":124,"address":[11362762],"length":1,"stats":{"Line":1}},{"line":125,"address":[11362788,11362770,11363099],"length":1,"stats":{"Line":3}},{"line":126,"address":[11362921,11362835,11362999],"length":1,"stats":{"Line":2}},{"line":127,"address":[8802241],"length":1,"stats":{"Line":1}},{"line":128,"address":[11362945],"length":1,"stats":{"Line":1}},{"line":130,"address":[11362971,11363071,11363020],"length":1,"stats":{"Line":2}},{"line":132,"address":[11363028],"length":1,"stats":{"Line":1}},{"line":133,"address":[11363104,11363091,11363044],"length":1,"stats":{"Line":2}},{"line":136,"address":[11362895,11362807,11362874],"length":1,"stats":{"Line":2}},{"line":137,"address":[8802161],"length":1,"stats":{"Line":1}},{"line":142,"address":[11363120],"length":1,"stats":{"Line":1}},{"line":143,"address":[11363149],"length":1,"stats":{"Line":1}},{"line":144,"address":[11363172],"length":1,"stats":{"Line":1}},{"line":147,"address":[8802512],"length":1,"stats":{"Line":0}},{"line":148,"address":[8803330,8802997,8802666,8803214,8803287,8803145,8803502],"length":1,"stats":{"Line":0}},{"line":149,"address":[8803782,8803245],"length":1,"stats":{"Line":0}},{"line":151,"address":[8803815],"length":1,"stats":{"Line":0}},{"line":153,"address":[8803827,8803989],"length":1,"stats":{"Line":0}},{"line":155,"address":[8803926],"length":1,"stats":{"Line":0}},{"line":159,"address":[8804016],"length":1,"stats":{"Line":1}},{"line":160,"address":[11364771],"length":1,"stats":{"Line":1}},{"line":161,"address":[8804855,8804898,8804742,8805362,8804525,8804673,8804194],"length":1,"stats":{"Line":7}},{"line":168,"address":[11365494],"length":1,"stats":{"Line":1}},{"line":171,"address":[11366448,11370868,11374389],"length":1,"stats":{"Line":1}},{"line":173,"address":[8805751],"length":1,"stats":{"Line":1}},{"line":174,"address":[8805800],"length":1,"stats":{"Line":1}},{"line":175,"address":[11366637,11366794,11366544],"length":1,"stats":{"Line":3}},{"line":176,"address":[11366810],"length":1,"stats":{"Line":1}},{"line":177,"address":[8810081,8806102,8810176],"length":1,"stats":{"Line":2}},{"line":178,"address":[11370953,11371017],"length":1,"stats":{"Line":2}},{"line":179,"address":[11371271,11371139],"length":1,"stats":{"Line":1}},{"line":180,"address":[11371300,11371242,11371455],"length":1,"stats":{"Line":2}},{"line":182,"address":[8810684,8810612],"length":1,"stats":{"Line":2}},{"line":185,"address":[11371500],"length":1,"stats":{"Line":1}},{"line":190,"address":[8810751],"length":1,"stats":{"Line":1}},{"line":195,"address":[11371618],"length":1,"stats":{"Line":1}},{"line":196,"address":[8810855],"length":1,"stats":{"Line":1}},{"line":199,"address":[11371732],"length":1,"stats":{"Line":1}},{"line":200,"address":[8810954],"length":1,"stats":{"Line":1}},{"line":202,"address":[8811023],"length":1,"stats":{"Line":1}},{"line":203,"address":[8812022,8813167,8812086,8811227,8811809,8811921,8813051,8811622],"length":1,"stats":{"Line":7}},{"line":204,"address":[8811977],"length":1,"stats":{"Line":1}},{"line":208,"address":[11366747],"length":1,"stats":{"Line":1}},{"line":209,"address":[11366876,11366759],"length":1,"stats":{"Line":2}},{"line":210,"address":[8806375,8806156],"length":1,"stats":{"Line":2}},{"line":211,"address":[8806391,8806678,8806745],"length":1,"stats":{"Line":2}},{"line":212,"address":[8806781,8806718],"length":1,"stats":{"Line":2}},{"line":213,"address":[8806895],"length":1,"stats":{"Line":1}},{"line":214,"address":[11374416,11374435],"length":1,"stats":{"Line":2}},{"line":216,"address":[11367713,11367804],"length":1,"stats":{"Line":2}},{"line":217,"address":[11367954,11367812],"length":1,"stats":{"Line":2}},{"line":219,"address":[8813680,8807166,8813699],"length":1,"stats":{"Line":3}},{"line":221,"address":[8813818,8813712],"length":1,"stats":{"Line":1}},{"line":222,"address":[11374635],"length":1,"stats":{"Line":1}},{"line":227,"address":[11368103,11368008],"length":1,"stats":{"Line":2}},{"line":229,"address":[11374688,11374714],"length":1,"stats":{"Line":2}},{"line":232,"address":[11368200],"length":1,"stats":{"Line":1}},{"line":234,"address":[11368279],"length":1,"stats":{"Line":1}},{"line":235,"address":[11370334,11369506,11370462,11369373,11368628,11369243,11369044,11369582],"length":1,"stats":{"Line":0}},{"line":236,"address":[11369438],"length":1,"stats":{"Line":0}},{"line":238,"address":[11368553,11368368],"length":1,"stats":{"Line":2}},{"line":241,"address":[11367073,11367167],"length":1,"stats":{"Line":2}},{"line":243,"address":[11367175],"length":1,"stats":{"Line":1}},{"line":245,"address":[11367220,11374800,11374810],"length":1,"stats":{"Line":3}},{"line":248,"address":[8813968],"length":1,"stats":{"Line":0}},{"line":249,"address":[11374865],"length":1,"stats":{"Line":0}},{"line":250,"address":[11375663,11375620,11375326,11375474,11375836,11374995,11375543],"length":1,"stats":{"Line":0}},{"line":251,"address":[11375569],"length":1,"stats":{"Line":0}},{"line":252,"address":[8814716],"length":1,"stats":{"Line":0}},{"line":253,"address":[11375593,11376116,11376481],"length":1,"stats":{"Line":0}},{"line":254,"address":[11376139,11376439],"length":1,"stats":{"Line":0}},{"line":255,"address":[11376246],"length":1,"stats":{"Line":0}},{"line":256,"address":[11376293],"length":1,"stats":{"Line":0}},{"line":259,"address":[11376512,11376721,11376567],"length":1,"stats":{"Line":0}},{"line":261,"address":[11376390],"length":1,"stats":{"Line":0}},{"line":262,"address":[11376408,11376486,11376473],"length":1,"stats":{"Line":0}}],"covered":94,"coverable":118},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","lib.rs"],"content":"use plonky2::{hash::hash_types::HashOut, plonk::proof::ProofWithPublicInputs};\nuse serde::*;\nuse types::{C, D, F};\n\npub mod account;\npub mod circuit_config;\npub mod circuit_registry;\npub mod circuit_utils;\npub mod config;\npub mod database;\npub mod e2e;\npub mod error;\npub mod global;\npub mod merkle_proof;\npub mod merkle_sum_prover;\npub mod merkle_sum_tree;\npub mod parser;\npub mod recursive_prover;\npub mod types;\npub mod util;\n\n#[derive(Serialize, Deserialize)]\npub struct General {\n    pub round_num: usize,\n    pub batch_num: usize,\n    pub recursion_branchout_num: usize,\n    pub batch_size: usize,\n    pub token_num: usize,\n}\n\n#[derive(Serialize, Deserialize)]\npub struct Proof {\n    pub general: General,\n    pub root_vd_digest: HashOut\u003cF\u003e,\n    pub proof: ProofWithPublicInputs\u003cF, C, D\u003e,\n}\n\n#[derive(Serialize, Deserialize)]\npub struct Info {\n    pub root_hash: String,\n    pub equity_sum: u64,\n    pub debt_sum: u64,\n    pub balance_sum: u64,\n}\n","traces":[],"covered":0,"coverable":0},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","main.rs"],"content":"use tracing::{debug, Level};\nuse zk_por_tracing::{init_tracing, TraceConfig};\n\npub fn main() {\n    let cfg = TraceConfig {\n        prefix: \"zkpor\".to_string(),\n        dir: \"logs\".to_string(),\n        level: Level::DEBUG,\n        console: true,\n        flame: false,\n    };\n    let guard = init_tracing(cfg);\n    debug!(\"tracing works\");\n    drop(guard)\n}\n","traces":[],"covered":0,"coverable":0},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","merkle_proof.rs"],"content":"use itertools::Itertools;\nuse plonky2::{\n    hash::{hash_types::HashOut, poseidon::PoseidonHash},\n    plonk::config::Hasher,\n};\nuse rayon::iter::{IntoParallelRefIterator, ParallelIterator};\nuse serde::{Deserialize, Serialize};\n\nuse crate::{\n    account::Account,\n    circuit_utils::recursive_levels,\n    database::{PoRDB, UserId},\n    error::PoRError,\n    global::{GlobalConfig, GlobalMst},\n    merkle_sum_prover::utils::hash_2_subhashes,\n    types::{D, F},\n};\n\nuse std::sync::Arc;\n\n/// We use this wrapper struct for the left and right indexes of our recursive siblings. This is needed so a user knows the position of\n/// their own hash when hashing.\n#[derive(Debug, Clone, PartialEq)]\npub struct RecursiveIndex {\n    left_indexes: Vec\u003cusize\u003e,\n    right_indexes: Vec\u003cusize\u003e,\n}\n\n/// Indexes for a given users merkle proof of inclusion siblings in the Global Merkle Sum Tree\n#[derive(Debug, Clone, PartialEq)]\npub struct MerkleProofIndex {\n    pub sum_tree_siblings: Vec\u003cusize\u003e,\n    pub recursive_tree_siblings: Vec\u003cRecursiveIndex\u003e,\n}\n\nimpl MerkleProofIndex {\n    pub fn new_from_user_index(user_index: usize, global_mst: \u0026GlobalConfig) -\u003e MerkleProofIndex {\n        let sum_tree_siblings = get_mst_siblings_index(user_index, global_mst);\n        let recursive_tree_siblings = get_recursive_siblings_index(user_index, global_mst);\n\n        MerkleProofIndex { sum_tree_siblings, recursive_tree_siblings }\n    }\n}\n\n/// Get the siblings index for the merkle proof of inclusion given a leaf index of a binary merkle sum tree.\n/// We get the parent index of a leaf using the formula: parent = index / 2 + num_leaves\npub fn get_mst_siblings_index(global_leaf_index: usize, cfg: \u0026GlobalConfig) -\u003e Vec\u003cusize\u003e {\n    // Make sure our global index is within the number of leaves\n    assert!(global_leaf_index \u003c GlobalMst::get_num_of_leaves(cfg));\n\n    let batch_id = global_leaf_index / cfg.batch_size;\n    let mut siblings = Vec::new();\n\n    // This is the index in the local mst tree\n    let mut local_index = global_leaf_index % cfg.batch_size;\n\n    while local_index \u003c (cfg.batch_size * 2 - 2) {\n        if local_index % 2 == 1 {\n            let sibling_index = local_index - 1;\n            siblings.push(sibling_index);\n        } else {\n            let sibling_index = local_index + 1;\n            siblings.push(sibling_index);\n        }\n\n        let local_parent_index = local_index / 2 + cfg.batch_size;\n        local_index = local_parent_index;\n    }\n\n    siblings.par_iter().map(|x| GlobalMst::get_batch_tree_global_index(cfg, batch_id, *x)).collect()\n}\n\n/// Gets the recursive siblings indexes (recursive tree is n-ary tree) as a Vec of vecs, each inner vec is one layer of siblings.\npub fn get_recursive_siblings_index(\n    global_index: usize,\n    cfg: \u0026GlobalConfig,\n) -\u003e Vec\u003cRecursiveIndex\u003e {\n    // Make sure our global index is within the number of leaves\n    assert!(global_index \u003c GlobalMst::get_num_of_leaves(cfg));\n\n    let mut siblings = Vec::new();\n    let mst_batch_idx = global_index / cfg.batch_size;\n    let mut recursive_idx = mst_batch_idx / cfg.recursion_branchout_num;\n    let mut recursive_offset = mst_batch_idx % cfg.recursion_branchout_num;\n\n    let recursive_level_num = recursive_levels(cfg.num_of_batches, cfg.recursion_branchout_num);\n\n    for i in 0..recursive_level_num {\n        let mut left_layer = Vec::new();\n        let mut right_layer = Vec::new();\n        for j in 0..cfg.recursion_branchout_num {\n            let inner_level_idx = recursive_idx * cfg.recursion_branchout_num + j;\n            let index = GlobalMst::get_recursive_global_index(cfg, i, inner_level_idx);\n            if j \u003c recursive_offset {\n                left_layer.push(index);\n            }\n\n            if j \u003e recursive_offset {\n                right_layer.push(index);\n            }\n        }\n\n        siblings.push(RecursiveIndex { left_indexes: left_layer, right_indexes: right_layer });\n\n        recursive_offset = recursive_idx % cfg.recursion_branchout_num;\n        recursive_idx = recursive_idx / cfg.recursion_branchout_num;\n    }\n\n    siblings\n}\n\n/// We use this wrapper struct for the left and right hashes of our recursive siblings. This is needed so a user knows the position of\n/// their own hash when hashing.\n#[derive(Debug, Clone, PartialEq, Serialize, Deserialize)]\npub struct RecursiveHashes {\n    left_hashes: Vec\u003cHashOut\u003cF\u003e\u003e,\n    right_hashes: Vec\u003cHashOut\u003cF\u003e\u003e,\n}\n\nimpl RecursiveHashes {\n    pub fn new_from_index(indexes: \u0026RecursiveIndex, db: Arc\u003cdyn PoRDB\u003e) -\u003e Self {\n        let left_hashes = indexes\n            .left_indexes\n            .iter()\n            .map(|y| db.get_gmst_node_hash(*y as i32).unwrap())\n            .collect_vec();\n        let right_hashes = indexes\n            .right_indexes\n            .iter()\n            .map(|y| db.get_gmst_node_hash(*y as i32).unwrap())\n            .collect_vec();\n        RecursiveHashes { left_hashes, right_hashes }\n    }\n\n    /// Calculated Hash = Left hashes || own hash || Right hashes\n    pub fn get_calculated_hash(self, own_hash: HashOut\u003cF\u003e) -\u003e HashOut\u003cF\u003e {\n        let mut hash_inputs = self.left_hashes;\n        hash_inputs.push(own_hash);\n        hash_inputs.extend(self.right_hashes);\n\n        let inputs: Vec\u003cF\u003e = hash_inputs.iter().map(|x| x.elements).flatten().collect();\n\n        PoseidonHash::hash_no_pad(inputs.as_slice())\n    }\n}\n\n/// Hashes for a given users merkle proof of inclusion siblings in the Global Merkle Sum Tree, also includes account data as it is needed for the verification\n/// of the merkle proof (needed to calculate own hash)\n#[derive(Debug, Clone, Serialize, Deserialize)]\npub struct MerkleProof {\n    pub account: Account,\n    pub index: usize,\n    pub sum_tree_siblings: Vec\u003cHashOut\u003cF\u003e\u003e,\n    pub recursive_tree_siblings: Vec\u003cRecursiveHashes\u003e,\n}\n\nimpl MerkleProof {\n    pub fn new_from_account(\n        account: \u0026Account,\n        db: Arc\u003cdyn PoRDB\u003e,\n        cfg: \u0026GlobalConfig,\n    ) -\u003e Result\u003cMerkleProof, PoRError\u003e {\n        let user_id_res = UserId::from_hex_string(account.id.clone());\n        if user_id_res.is_err() {\n            return Err(user_id_res.unwrap_err());\n        }\n\n        let user_id = user_id_res.unwrap();\n\n        let user_index = db.get_user_index(user_id.clone());\n        if user_index.is_none() {\n            tracing::error!(\"User with id: {:?} does not exist\", user_id.to_string());\n            return Err(PoRError::InvalidParameter(user_id.to_string()));\n        }\n\n        let merkle_proof_indexes =\n            MerkleProofIndex::new_from_user_index(user_index.unwrap() as usize, cfg);\n        let merkle_proof = get_merkle_proof_hashes_from_indexes(\n            account,\n            \u0026merkle_proof_indexes,\n            user_index.unwrap() as usize,\n            db,\n        );\n        Ok(merkle_proof)\n    }\n\n    pub fn verify_merkle_proof(\u0026self, gmst_root: HashOut\u003cF\u003e) -\u003e Result\u003c(), PoRError\u003e {\n        let account_hash = self.account.get_hash();\n\n        let mut index = self.index;\n\n        let calculated_mst_hash = self.sum_tree_siblings.iter().fold(account_hash, |acc, x| {\n            if index % 2 == 0 {\n                index /= 2;\n                hash_2_subhashes::\u003cF, D\u003e(\u0026acc, x)\n            } else {\n                index /= 2;\n                hash_2_subhashes::\u003cF, D\u003e(x, \u0026acc)\n            }\n        });\n\n        let calculated_hash = self\n            .recursive_tree_siblings\n            .iter()\n            .fold(calculated_mst_hash, |acc, x| x.clone().get_calculated_hash(acc));\n\n        if calculated_hash == gmst_root {\n            Ok(())\n        } else {\n            Err(PoRError::InvalidMerkleProof(self.account.id.clone()))\n        }\n    }\n}\n\n/// Given the indexes for the MST siblings, get the hashes from the database for the merkle proof of inclusion.\npub fn get_merkle_proof_hashes_from_indexes(\n    account: \u0026Account,\n    indexes: \u0026MerkleProofIndex,\n    user_index: usize,\n    db: Arc\u003cdyn PoRDB\u003e,\n) -\u003e MerkleProof {\n    let mst_hashes: Vec\u003cHashOut\u003cF\u003e\u003e = indexes\n        .sum_tree_siblings\n        .iter()\n        .map(|x| db.get_gmst_node_hash(*x as i32).unwrap())\n        .collect();\n\n    let recursive_hashes: Vec\u003cRecursiveHashes\u003e = indexes\n        .recursive_tree_siblings\n        .iter()\n        .map(|x| RecursiveHashes::new_from_index(x, db.clone()))\n        .collect();\n\n    MerkleProof {\n        account: account.clone(),\n        sum_tree_siblings: mst_hashes,\n        recursive_tree_siblings: recursive_hashes,\n        index: user_index,\n    }\n}\n\n#[cfg(test)]\npub mod test {\n    use itertools::Itertools;\n    use plonky2::hash::hash_types::HashOut;\n\n    use crate::{\n        account::Account,\n        global::{GlobalConfig, GlobalMst},\n        merkle_proof::{get_recursive_siblings_index, MerkleProofIndex, RecursiveIndex},\n        types::F,\n    };\n    use plonky2_field::types::Field;\n\n    use super::{get_mst_siblings_index, MerkleProof, RecursiveHashes};\n\n    #[test]\n    pub fn test_get_siblings_index() {\n        let gmst = GlobalMst::new(GlobalConfig {\n            num_of_tokens: 100,\n            num_of_batches: 4,\n            batch_size: 8,\n            recursion_branchout_num: 4,\n        });\n\n        let global_index = 0;\n\n        let siblings = get_mst_siblings_index(global_index, \u0026gmst.cfg);\n        assert_eq!(siblings, vec![1, 33, 49]);\n\n        let gmst = GlobalMst::new(GlobalConfig {\n            num_of_tokens: 100,\n            num_of_batches: 8,\n            batch_size: 8,\n            recursion_branchout_num: 4,\n        });\n\n        let global_index = 0;\n\n        let siblings = get_mst_siblings_index(global_index, \u0026gmst.cfg);\n        assert_eq!(siblings, vec![1, 65, 97]);\n\n        let gmst = GlobalMst::new(GlobalConfig {\n            num_of_tokens: 100,\n            num_of_batches: 6,\n            batch_size: 8,\n            recursion_branchout_num: 4,\n        });\n\n        let global_index = 0;\n\n        let siblings = get_mst_siblings_index(global_index, \u0026gmst.cfg);\n        assert_eq!(siblings, vec![1, 49, 73]);\n    }\n\n    #[test]\n    pub fn test_get_recursive_siblings_index() {\n        let gmst = GlobalMst::new(GlobalConfig {\n            num_of_tokens: 100,\n            num_of_batches: 15,\n            batch_size: 4,\n            recursion_branchout_num: 4,\n        });\n\n        let global_index = 0;\n\n        let siblings = get_recursive_siblings_index(global_index, \u0026gmst.cfg);\n\n        assert_eq!(\n            siblings,\n            vec![\n                RecursiveIndex { left_indexes: vec![], right_indexes: vec![91, 92, 93] },\n                RecursiveIndex { left_indexes: vec![], right_indexes: vec![107, 108, 109] }\n            ]\n        );\n\n        let gmst = GlobalMst::new(GlobalConfig {\n            num_of_tokens: 100,\n            num_of_batches: 30,\n            batch_size: 8,\n            recursion_branchout_num: 4,\n        });\n\n        let global_index = 163;\n\n        let siblings = get_recursive_siblings_index(global_index, \u0026gmst.cfg);\n        assert_eq!(\n            siblings,\n            vec![\n                RecursiveIndex { left_indexes: vec![], right_indexes: vec![441, 442, 443] },\n                RecursiveIndex { left_indexes: vec![456], right_indexes: vec![458, 459] },\n                RecursiveIndex { left_indexes: vec![460], right_indexes: vec![462, 463] }\n            ]\n        );\n\n        let gmst = GlobalMst::new(GlobalConfig {\n            num_of_tokens: 10,\n            num_of_batches: 6,\n            batch_size: 4,\n            recursion_branchout_num: 4,\n        });\n\n        let global_index = 20;\n\n        let siblings = get_recursive_siblings_index(global_index, \u0026gmst.cfg);\n        assert_eq!(\n            siblings,\n            vec![\n                RecursiveIndex { left_indexes: vec![40], right_indexes: vec![42, 43] },\n                RecursiveIndex { left_indexes: vec![44], right_indexes: vec![46, 47] },\n            ]\n        );\n    }\n\n    #[test]\n    pub fn test_get_new_merkle_index_from_user_index() {\n        let gmst = GlobalMst::new(GlobalConfig {\n            num_of_tokens: 100,\n            num_of_batches: 15,\n            batch_size: 4,\n            recursion_branchout_num: 4,\n        });\n\n        let global_index = 0;\n\n        let merkle_proof_indexes = MerkleProofIndex::new_from_user_index(global_index, \u0026gmst.cfg);\n\n        assert_eq!(\n            merkle_proof_indexes,\n            MerkleProofIndex {\n                sum_tree_siblings: vec![1, 61],\n                recursive_tree_siblings: vec![\n                    RecursiveIndex { left_indexes: vec![], right_indexes: vec![91, 92, 93] },\n                    RecursiveIndex { left_indexes: vec![], right_indexes: vec![107, 108, 109] }\n                ],\n            }\n        );\n    }\n\n    #[test]\n    pub fn test_verify_merkle_proof() {\n        let _gmst = GlobalMst::new(GlobalConfig {\n            num_of_tokens: 3,\n            num_of_batches: 4,\n            batch_size: 2,\n            recursion_branchout_num: 4,\n        });\n\n        let equity = vec![3, 3, 3].iter().map(|x| F::from_canonical_u32(*x)).collect_vec();\n        let debt = vec![1, 1, 1].iter().map(|x| F::from_canonical_u32(*x)).collect_vec();\n\n        let sum_tree_siblings = vec![HashOut::from_vec(\n            vec![\n                7609058119952049295,\n                8895839458156070742,\n                1052773619972611009,\n                6038312163525827182,\n            ]\n            .iter()\n            .map(|x| F::from_canonical_u64(*x))\n            .collect::\u003cVec\u003cF\u003e\u003e(),\n        )];\n\n        let recursive_tree_siblings = vec![RecursiveHashes {\n            left_hashes: vec![],\n            right_hashes: vec![\n                HashOut::from_vec(\n                    vec![\n                        15026394135096265436,\n                        13313300609834454638,\n                        10151802728958521275,\n                        6200471959130767555,\n                    ]\n                    .iter()\n                    .map(|x| F::from_canonical_u64(*x))\n                    .collect::\u003cVec\u003cF\u003e\u003e(),\n                ),\n                HashOut::from_vec(\n                    vec![\n                        2010803994799996791,\n                        568450490466247075,\n                        18209684900543488748,\n                        7678193912819861368,\n                    ]\n                    .iter()\n                    .map(|x| F::from_canonical_u64(*x))\n                    .collect::\u003cVec\u003cF\u003e\u003e(),\n                ),\n                HashOut::from_vec(\n                    vec![\n                        13089029781628355232,\n                        10704046654659337561,\n                        15794212269117984095,\n                        15948192230150472783,\n                    ]\n                    .iter()\n                    .map(|x| F::from_canonical_u64(*x))\n                    .collect::\u003cVec\u003cF\u003e\u003e(),\n                ),\n            ],\n        }];\n\n        let account = Account {\n            id: \"320b5ea99e653bc2b593db4130d10a4efd3a0b4cc2e1a6672b678d71dfbd33ad\".to_string(),\n            equity: equity.clone(),\n            debt: debt.clone(),\n        };\n\n        let merkle_proof =\n            MerkleProof { account, sum_tree_siblings, recursive_tree_siblings, index: 0 };\n\n        let root = HashOut::from_vec(\n            vec![\n                10628303359772907103,\n                7478459528589413745,\n                12007196562137971174,\n                2652030368197917032,\n            ]\n            .iter()\n            .map(|x| F::from_canonical_u64(*x))\n            .collect::\u003cVec\u003cF\u003e\u003e(),\n        );\n\n        let res = merkle_proof.verify_merkle_proof(root);\n\n        res.unwrap();\n    }\n\n    // THIS IS THE TEST DATA FOR VERIFY\n    // #[test]\n    // pub fn poseidon_hash() {\n    //     let equity = vec![3,3,3,].iter().map(|x| F::from_canonical_u32(*x)).collect_vec();\n    //     let debt = vec![1,1,1,].iter().map(|x| F::from_canonical_u32(*x)).collect_vec();\n\n    //     let accounts = vec![\n    //         Account{\n    //             id: \"320b5ea99e653bc2b593db4130d10a4efd3a0b4cc2e1a6672b678d71dfbd33ad\".to_string(),\n    //             equity: equity.clone(),\n    //             debt: debt.clone(),\n    //         },\n    //         Account{\n    //             id: \"320b5ea99e653bc2b593db4130d10a4efd3a0b4cc2e1a6672b678d71dfbd33ac\".to_string(),\n    //             equity: equity.clone(),\n    //             debt: debt.clone(),\n    //         },\n    //         Account{\n    //             id: \"320b5ea99e653bc2b593db4130d10a4efd3a0b4cc2e1a6672b678d71dfbd33ab\".to_string(),\n    //             equity: equity.clone(),\n    //             debt: debt.clone(),\n    //         },\n    //         Account{\n    //             id: \"320b5ea99e653bc2b593db4130d10a4efd3a0b4cc2e1a6672b678d71dfbd33aa\".to_string(),\n    //             equity: equity.clone(),\n    //             debt: debt.clone(),\n    //         },\n    //         Account{\n    //             id: \"320b5ea99e653bc2b593db4130d10a4efd3a0b4cc2e1a6672b678d71dfbd33a1\".to_string(),\n    //             equity: equity.clone(),\n    //             debt: debt.clone(),\n    //         },\n    //         Account{\n    //             id: \"320b5ea99e653bc2b593db4130d10a4efd3a0b4cc2e1a6672b678d71dfbd33a2\".to_string(),\n    //             equity: equity.clone(),\n    //             debt: debt.clone(),\n    //         },\n    //         Account{\n    //             id: \"320b5ea99e653bc2b593db4130d10a4efd3a0b4cc2e1a6672b678d71dfbd33a3\".to_string(),\n    //             equity: equity.clone(),\n    //             debt: debt.clone(),\n    //         },\n    //         Account{\n    //             id: \"320b5ea99e653bc2b593db4130d10a4efd3a0b4cc2e1a6672b678d71dfbd33a4\".to_string(),\n    //             equity: equity.clone(),\n    //             debt: debt.clone(),\n    //         }\n    //     ];\n\n    //     let msts: Vec\u003cMerkleSumTree\u003e = accounts\n    //         .chunks(2)\n    //         .map(|account_batch| MerkleSumTree::new_tree_from_accounts(\u0026account_batch.to_vec()))\n    //         .collect();\n\n    //     let mst_hashes = msts.iter().map(|x| x.merkle_sum_tree.iter().map(|y| y.hash).collect_vec()).collect_vec();\n    //     println!(\"msts:{:?}\", mst_hashes);\n    //     let inputs = vec![\n    //         HashOut::from_vec(\n    //             vec![\n    //                 8699257539652901730,\n    //                 12847577670763395377,\n    //                 14540605839220144846,\n    //                 1921995570040415498,\n    //             ]\n    //             .iter()\n    //             .map(|x| F::from_canonical_u64(*x))\n    //             .collect::\u003cVec\u003cF\u003e\u003e(),\n    //         ),\n    //         HashOut::from_vec(\n    //             vec![\n    //                 15026394135096265436,\n    //                 13313300609834454638,\n    //                 10151802728958521275,\n    //                 6200471959130767555,\n    //             ]\n    //             .iter()\n    //             .map(|x| F::from_canonical_u64(*x))\n    //             .collect::\u003cVec\u003cF\u003e\u003e(),\n    //         ),\n    //         HashOut::from_vec(\n    //             vec![\n    //                 2010803994799996791,\n    //                 568450490466247075,\n    //                 18209684900543488748,\n    //                 7678193912819861368,\n    //             ]\n    //             .iter()\n    //             .map(|x| F::from_canonical_u64(*x))\n    //             .collect::\u003cVec\u003cF\u003e\u003e(),\n    //         ),\n    //         HashOut::from_vec(\n    //             vec![\n    //                 13089029781628355232,\n    //                 10704046654659337561,\n    //                 15794212269117984095,\n    //                 15948192230150472783,\n    //             ]\n    //             .iter()\n    //             .map(|x| F::from_canonical_u64(*x))\n    //             .collect::\u003cVec\u003cF\u003e\u003e(),\n    //         ),\n    //     ];\n\n    //     let hash = PoseidonHash::hash_no_pad(\n    //         inputs.iter().map(|x| x.elements).flatten().collect_vec().as_slice(),\n    //     );\n    //     println!(\"Hash: {:?}\", hash);\n    // }\n}\n","traces":[{"line":37,"address":[11376880,11377094],"length":1,"stats":{"Line":1}},{"line":38,"address":[8816041],"length":1,"stats":{"Line":1}},{"line":39,"address":[11376940],"length":1,"stats":{"Line":1}},{"line":47,"address":[11377932,11377120],"length":1,"stats":{"Line":1}},{"line":49,"address":[11377174],"length":1,"stats":{"Line":1}},{"line":51,"address":[11377303,11377226],"length":1,"stats":{"Line":1}},{"line":52,"address":[11377267],"length":1,"stats":{"Line":1}},{"line":55,"address":[11377332,11377286,11377347],"length":1,"stats":{"Line":2}},{"line":57,"address":[11377416,11377906,11377345],"length":1,"stats":{"Line":3}},{"line":58,"address":[11377671,11377558],"length":1,"stats":{"Line":2}},{"line":59,"address":[11377681,11377738,11377765],"length":1,"stats":{"Line":0}},{"line":60,"address":[11377786,11377746],"length":1,"stats":{"Line":0}},{"line":62,"address":[11377808,11377835,11377709],"length":1,"stats":{"Line":2}},{"line":63,"address":[8816923,8816963],"length":1,"stats":{"Line":2}},{"line":66,"address":[11377911,11377788,11377868],"length":1,"stats":{"Line":2}},{"line":67,"address":[11377898],"length":1,"stats":{"Line":1}},{"line":70,"address":[11377988,11377529,11377968,11377588],"length":1,"stats":{"Line":4}},{"line":74,"address":[11379619,11378016,11379650],"length":1,"stats":{"Line":1}},{"line":79,"address":[11378082],"length":1,"stats":{"Line":1}},{"line":81,"address":[8817248],"length":1,"stats":{"Line":1}},{"line":82,"address":[8817355,8817269],"length":1,"stats":{"Line":1}},{"line":83,"address":[11378333,11378233,11378377],"length":1,"stats":{"Line":2}},{"line":84,"address":[8817509,8817455,8817553],"length":1,"stats":{"Line":2}},{"line":86,"address":[11378432,11378488],"length":1,"stats":{"Line":2}},{"line":88,"address":[11378496,11378684,11379359],"length":1,"stats":{"Line":3}},{"line":89,"address":[11378705],"length":1,"stats":{"Line":1}},{"line":90,"address":[11378724],"length":1,"stats":{"Line":1}},{"line":91,"address":[11378885,11379150,11378800],"length":1,"stats":{"Line":3}},{"line":92,"address":[11379395,11379171,11379473],"length":1,"stats":{"Line":2}},{"line":93,"address":[11379457,11379504],"length":1,"stats":{"Line":2}},{"line":94,"address":[11379512],"length":1,"stats":{"Line":1}},{"line":95,"address":[8818633],"length":1,"stats":{"Line":1}},{"line":98,"address":[11379527],"length":1,"stats":{"Line":1}},{"line":99,"address":[11379573],"length":1,"stats":{"Line":1}},{"line":103,"address":[11378971],"length":1,"stats":{"Line":1}},{"line":105,"address":[11379210,11379299],"length":1,"stats":{"Line":1}},{"line":106,"address":[11379269,11379364,11379330],"length":1,"stats":{"Line":2}},{"line":109,"address":[11378641],"length":1,"stats":{"Line":1}},{"line":121,"address":[11380163,11379664],"length":1,"stats":{"Line":0}},{"line":122,"address":[11379784,11379712],"length":1,"stats":{"Line":0}},{"line":125,"address":[11380323,11380192,11380221],"length":1,"stats":{"Line":0}},{"line":127,"address":[11379868,11379944],"length":1,"stats":{"Line":0}},{"line":130,"address":[11380467,11380336,11380365],"length":1,"stats":{"Line":0}},{"line":136,"address":[8819536,8820021],"length":1,"stats":{"Line":1}},{"line":137,"address":[8819558],"length":1,"stats":{"Line":1}},{"line":138,"address":[8819591],"length":1,"stats":{"Line":1}},{"line":139,"address":[8819676],"length":1,"stats":{"Line":1}},{"line":141,"address":[11381056,11381069,11380684],"length":1,"stats":{"Line":3}},{"line":143,"address":[8819936,8819860],"length":1,"stats":{"Line":2}},{"line":158,"address":[11381104,11384328,11382689],"length":1,"stats":{"Line":0}},{"line":163,"address":[8820283,8820183],"length":1,"stats":{"Line":0}},{"line":164,"address":[8820306,8820397],"length":1,"stats":{"Line":0}},{"line":165,"address":[8820761,8823220],"length":1,"stats":{"Line":0}},{"line":168,"address":[11381407],"length":1,"stats":{"Line":0}},{"line":170,"address":[8820906],"length":1,"stats":{"Line":0}},{"line":171,"address":[8821046],"length":1,"stats":{"Line":0}},{"line":172,"address":[8822368,8822069,8822546,8822758,8821674,8822482,8822256],"length":1,"stats":{"Line":0}},{"line":173,"address":[11383452,11384117],"length":1,"stats":{"Line":0}},{"line":176,"address":[8821079,8821316],"length":1,"stats":{"Line":0}},{"line":181,"address":[8821468,8821335],"length":1,"stats":{"Line":0}},{"line":182,"address":[8821472],"length":1,"stats":{"Line":0}},{"line":184,"address":[11382551],"length":1,"stats":{"Line":0}},{"line":187,"address":[11384368],"length":1,"stats":{"Line":1}},{"line":188,"address":[11384403],"length":1,"stats":{"Line":1}},{"line":190,"address":[11384419],"length":1,"stats":{"Line":1}},{"line":192,"address":[11384800,11384428],"length":1,"stats":{"Line":2}},{"line":193,"address":[8823766],"length":1,"stats":{"Line":1}},{"line":194,"address":[11384873],"length":1,"stats":{"Line":1}},{"line":195,"address":[11384888],"length":1,"stats":{"Line":1}},{"line":197,"address":[11384915],"length":1,"stats":{"Line":0}},{"line":198,"address":[11384930],"length":1,"stats":{"Line":0}},{"line":202,"address":[11384534],"length":1,"stats":{"Line":1}},{"line":205,"address":[11384960,11385005],"length":1,"stats":{"Line":2}},{"line":207,"address":[11384758,11384635],"length":1,"stats":{"Line":1}},{"line":208,"address":[8823701],"length":1,"stats":{"Line":1}},{"line":210,"address":[11384655],"length":1,"stats":{"Line":0}},{"line":216,"address":[11385104,11385780],"length":1,"stats":{"Line":0}},{"line":222,"address":[11385250,11385178],"length":1,"stats":{"Line":0}},{"line":225,"address":[11385808,11385837,11385939],"length":1,"stats":{"Line":0}},{"line":228,"address":[11385410,11385334],"length":1,"stats":{"Line":0}},{"line":231,"address":[11385952,11385981],"length":1,"stats":{"Line":0}},{"line":235,"address":[11385503],"length":1,"stats":{"Line":0}}],"covered":53,"coverable":82},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","merkle_sum_prover","circuits","account_circuit.rs"],"content":"use plonky2::{\n    hash::{hash_types::HashOutTarget, poseidon::PoseidonHash},\n    iop::{\n        target::Target,\n        witness::{PartialWitness, WitnessWrite},\n    },\n    plonk::circuit_builder::CircuitBuilder,\n};\n\nuse crate::{\n    account::Account,\n    circuit_utils::assert_non_negative_unsigned,\n    types::{D, F},\n};\n\n#[derive(Debug, Clone)]\n/// Targets representing a users account, where their equity and debt are split into individual tokens.\npub struct AccountTargets {\n    pub id: [Target; 5],\n    pub equity: Vec\u003cTarget\u003e,\n    pub debt: Vec\u003cTarget\u003e,\n}\n\nimpl AccountTargets {\n    pub fn new_from_account(\n        account: \u0026Account,\n        builder: \u0026mut CircuitBuilder\u003cF, D\u003e,\n    ) -\u003e AccountTargets {\n        let id: [Target; 5] = std::array::from_fn(|_| builder.add_virtual_target());\n        let equity = builder.add_virtual_targets(account.equity.len());\n        let debt = builder.add_virtual_targets(account.debt.len());\n\n        AccountTargets { id, equity, debt }\n    }\n\n    pub fn set_account_targets(\u0026self, account_info: \u0026Account, pw: \u0026mut PartialWitness\u003cF\u003e) {\n        assert_eq!(self.equity.len(), account_info.equity.len());\n        assert_eq!(self.debt.len(), account_info.debt.len());\n\n        pw.set_target_arr(self.equity.as_slice(), account_info.equity.as_slice());\n        pw.set_target_arr(self.debt.as_slice(), account_info.debt.as_slice());\n        pw.set_target_arr(self.id.as_slice(), account_info.get_user_id_in_field().as_slice());\n    }\n}\n\n#[derive(Debug, Clone)]\n/// Targets representing a users account, where their equity and liabilities are summed into 2 summed values.\npub struct AccountSumTargets {\n    pub id: [Target; 5],\n    pub sum_equity: Target,\n    pub sum_debt: Target,\n}\n\nimpl AccountSumTargets {\n    /// Given Account Targets, sum the account equity and liabilities and return a AccountSumTargets.\n    pub fn from_account_target(\n        account: \u0026AccountTargets,\n        builder: \u0026mut CircuitBuilder\u003cF, D\u003e,\n    ) -\u003e AccountSumTargets {\n        let sum_equity = account.equity.iter().fold(builder.zero(), |x, y| builder.add(x, *y));\n\n        let sum_debt = account.debt.iter().fold(builder.zero(), |x, y| builder.add(x, *y));\n\n        let diff_between_equity_debt = builder.sub(sum_equity, sum_debt);\n\n        // Ensure the equity is greater than the debt. This works as long as we constrict our equity to 62 bits.\n        assert_non_negative_unsigned(builder, diff_between_equity_debt);\n\n        AccountSumTargets { id: account.id, sum_equity, sum_debt }\n    }\n\n    /// Get account hash targets\n    pub fn get_account_hash_targets(\u0026self, builder: \u0026mut CircuitBuilder\u003cF, D\u003e) -\u003e HashOutTarget {\n        #[allow(clippy::useless_vec)]\n        let hash_inputs = vec![self.id.to_vec(), vec![self.sum_equity, self.sum_debt]].concat();\n        builder.hash_n_to_hash_no_pad::\u003cPoseidonHash\u003e(hash_inputs)\n    }\n}\n\n#[cfg(test)]\npub mod test {\n    use crate::{\n        circuit_utils::run_circuit_test,\n        parser::{FileManager, JsonFileManager},\n    };\n\n    use super::{AccountSumTargets, AccountTargets};\n\n    #[test]\n    fn test_account_target() {\n        run_circuit_test(|builder, pw| {\n            let fm = FileManager {};\n            let path = \"../../test-data/batch0.json\";\n            let tokens = vec![\"BTC\".to_owned(), \"ETH\".to_owned()];\n            let accounts = fm.read_json_into_accounts_vec(path, \u0026tokens);\n\n            let account_target =\n                AccountTargets::new_from_account(accounts.get(0).unwrap(), builder);\n            account_target.set_account_targets(accounts.get(0).unwrap(), pw);\n        });\n    }\n\n    #[test]\n    fn test_account_sum_target() {\n        run_circuit_test(|builder, pw| {\n            let path = \"../../test-data/batch0.json\";\n            let fm = FileManager {};\n            let tokens = vec![\"BTC\".to_owned(), \"ETH\".to_owned()];\n            let accounts = fm.read_json_into_accounts_vec(path, \u0026tokens);\n\n            let account_target =\n                AccountTargets::new_from_account(accounts.get(0).unwrap(), builder);\n\n            let account_sum_target =\n                AccountSumTargets::from_account_target(\u0026account_target, builder);\n\n            let total_equity =\n                account_target.equity.iter().fold(builder.zero(), |x, y| builder.add(x, *y));\n            let total_debt =\n                account_target.debt.iter().fold(builder.zero(), |x, y| builder.add(x, *y));\n\n            builder.connect(account_sum_target.sum_equity, total_equity);\n            builder.connect(account_sum_target.sum_debt, total_debt);\n\n            account_target.set_account_targets(accounts.get(0).unwrap(), pw);\n        });\n    }\n\n    #[test]\n    fn test_theory() {}\n}\n","traces":[{"line":25,"address":[8485584,8485954],"length":1,"stats":{"Line":1}},{"line":29,"address":[11871765,11871744,11871379],"length":1,"stats":{"Line":3}},{"line":30,"address":[11871398],"length":1,"stats":{"Line":1}},{"line":31,"address":[11871451,11871518],"length":1,"stats":{"Line":2}},{"line":36,"address":[11871792,11872491],"length":1,"stats":{"Line":1}},{"line":37,"address":[11871838],"length":1,"stats":{"Line":1}},{"line":38,"address":[11871990],"length":1,"stats":{"Line":1}},{"line":40,"address":[11872157],"length":1,"stats":{"Line":1}},{"line":41,"address":[11872251],"length":1,"stats":{"Line":1}},{"line":42,"address":[11872322],"length":1,"stats":{"Line":1}},{"line":56,"address":[8486688],"length":1,"stats":{"Line":1}},{"line":60,"address":[11873072,11873093,11872579],"length":1,"stats":{"Line":3}},{"line":62,"address":[11873184,11872661,11873205],"length":1,"stats":{"Line":3}},{"line":64,"address":[11872754],"length":1,"stats":{"Line":1}},{"line":67,"address":[11872870],"length":1,"stats":{"Line":1}},{"line":69,"address":[11872937],"length":1,"stats":{"Line":1}},{"line":73,"address":[11873296,11874069,11874098],"length":1,"stats":{"Line":1}},{"line":75,"address":[11874107,11873339],"length":1,"stats":{"Line":1}},{"line":76,"address":[11873995],"length":1,"stats":{"Line":1}}],"covered":19,"coverable":19},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","merkle_sum_prover","circuits","merkle_sum_circuit.rs"],"content":"use plonky2::{\n    hash::{\n        hash_types::{HashOutTarget, NUM_HASH_OUT_ELTS},\n        poseidon::PoseidonHash,\n    },\n    iop::target::Target,\n    plonk::{\n        circuit_builder::CircuitBuilder,\n        circuit_data::{CircuitConfig, CircuitData},\n    },\n};\n\nuse plonky2_field::types::Field;\n\nuse crate::{\n    circuit_utils::assert_non_negative_unsigned,\n    types::{C, D, F},\n};\n\nuse super::account_circuit::{AccountSumTargets, AccountTargets};\n\n/// A node in the merkle sum tree, contains the total amount of equity (in usd) and the total amount of debt (in usd) and the hash.\n///\n/// The hash is Hash(hash_left, hash_right).\n///\n/// The amount of equity and amount of debt is the sum of the equity and debt of the children.\n#[derive(Debug, Copy, Clone)]\npub struct MerkleSumNodeTarget {\n    pub sum_equity: Target,\n    pub sum_debt: Target,\n    pub hash: HashOutTarget,\n}\n\nimpl MerkleSumNodeTarget {\n    /// Given children nodes, generate the MerkleSumNodeTarget\n    pub fn get_parent_from_children\u003cconst N: usize\u003e(\n        builder: \u0026mut CircuitBuilder\u003cF, D\u003e,\n        children: \u0026[MerkleSumNodeTarget],\n    ) -\u003e MerkleSumNodeTarget {\n        assert_eq!(N, children.len());\n        let mut sum_equity = builder.constant(F::ZERO);\n        let mut sum_debt = builder.constant(F::ZERO);\n        let mut hash_inputs = Vec::new();\n        children.iter().for_each(|child| {\n            sum_equity = builder.add(sum_equity, child.sum_equity);\n            sum_debt = builder.add(sum_debt, child.sum_debt);\n\n            // Ensure the amount of equity at this node is greater than the total amount of debt\n            let diff_between_equity_debt = builder.sub(sum_equity, sum_debt);\n            assert_non_negative_unsigned(builder, diff_between_equity_debt);\n\n            // Ensure no overflow. We only need to check one child since in any overflow, the new value will be less than both the left and\n            // right children.\n            let diff_between_equity_child_and_sum = builder.sub(sum_equity, child.sum_equity);\n            assert_non_negative_unsigned(builder, diff_between_equity_child_and_sum);\n            let diff_between_debt_child_and_sum = builder.sub(sum_debt, child.sum_debt);\n            assert_non_negative_unsigned(builder, diff_between_debt_child_and_sum);\n\n            hash_inputs.extend(child.hash.elements.iter());\n        });\n        let hash = builder.hash_n_to_hash_no_pad::\u003cPoseidonHash\u003e(hash_inputs);\n        MerkleSumNodeTarget { sum_equity, sum_debt, hash }\n    }\n\n    /// Get a merkle sum node target from account sum targets.\n    pub fn get_node_from_account_targets(\n        builder: \u0026mut CircuitBuilder\u003cF, D\u003e,\n        account_targets: \u0026AccountSumTargets,\n    ) -\u003e MerkleSumNodeTarget {\n        let hash = account_targets.get_account_hash_targets(builder);\n        MerkleSumNodeTarget {\n            sum_equity: account_targets.sum_equity,\n            sum_debt: account_targets.sum_debt,\n            hash,\n        }\n    }\n\n    #[inline(always)]\n    pub fn pub_input_equity_offset() -\u003e usize {\n        0\n    }\n\n    #[inline(always)]\n    pub fn pub_input_debt_offset() -\u003e usize {\n        1\n    }\n\n    pub fn pub_input_root_hash_offset() -\u003e std::ops::Range\u003cusize\u003e {\n        // the first two targets are sum_equity and sum_debt.\n        2..6\n    }\n\n    /// Register this node targets as a public input\n    pub fn register_as_public_input(\u0026self, builder: \u0026mut CircuitBuilder\u003cF, D\u003e) {\n        builder.register_public_input(self.sum_equity);\n        builder.register_public_input(self.sum_debt);\n        builder.register_public_inputs(\u0026self.hash.elements);\n    }\n}\n\nimpl From\u003cMerkleSumNodeTarget\u003e for Vec\u003cTarget\u003e {\n    fn from(node: MerkleSumNodeTarget) -\u003e Vec\u003cTarget\u003e {\n        #[allow(clippy::useless_vec)]\n        vec![vec![node.sum_equity, node.sum_debt], node.hash.elements.to_vec()].concat()\n    }\n}\n\nimpl From\u003cVec\u003cTarget\u003e\u003e for MerkleSumNodeTarget {\n    /// the parsing order must be consistent with the order of public input registration in `registered_as_public_inputs`\n    fn from(inputs: Vec\u003cTarget\u003e) -\u003e MerkleSumNodeTarget {\n        let mut iter = inputs.into_iter();\n        let sum_equity_target = iter.next().unwrap();\n        let sum_debt_target = iter.next().unwrap();\n        let hash_target = HashOutTarget::from_vec(iter.by_ref().take(NUM_HASH_OUT_ELTS).collect());\n\n        MerkleSumNodeTarget {\n            sum_equity: sum_equity_target,\n            sum_debt: sum_debt_target,\n            hash: hash_target,\n        }\n    }\n}\n/// We can represent the Merkle Sum Tree as a vector of merkle sum nodes, with the root being the last node in the vector.\npub struct MerkleSumTreeTarget {\n    pub sum_tree: Vec\u003cMerkleSumNodeTarget\u003e,\n}\n\nimpl MerkleSumTreeTarget {\n    pub fn get_root(\u0026self) -\u003e \u0026MerkleSumNodeTarget {\n        self.sum_tree.last().unwrap()\n    }\n\n    /// Register the root hash, sum_equity and sum_debt as public inputs to be used in recursive proving.\n    pub fn register_public_inputs(\u0026self, builder: \u0026mut CircuitBuilder\u003cF, D\u003e) {\n        let root = self.get_root();\n        root.register_as_public_input(builder);\n    }\n\n    /// Builds a merkle sum tree of a given size (based on the number of leaves). It will build the merkle sum tree on top of the leaves vector\n    /// in order to do the task in place. There is no return value as the input leaves vector is mutated.\n    pub fn build_merkle_sum_tree(\n        builder: \u0026mut CircuitBuilder\u003cF, D\u003e,\n        leaves: \u0026mut Vec\u003cMerkleSumNodeTarget\u003e,\n    ) {\n        let num_leaves = leaves.len();\n\n        for i in num_leaves..(num_leaves * 2 - 1) {\n            let left_child_index = 2 * (i - num_leaves);\n            let right_child_index = 2 * (i - num_leaves) + 1;\n            let left_child = leaves.get(left_child_index).unwrap();\n            let right_child = leaves.get(right_child_index).unwrap();\n            leaves.push(MerkleSumNodeTarget::get_parent_from_children::\u003c2\u003e(\n                builder,\n                \u0026vec![*left_child, *right_child],\n            ));\n        }\n    }\n\n    /// Given a list of account targets, build the corresponding merkle sum tree.\n    pub fn build_new_from_account_targets(\n        builder: \u0026mut CircuitBuilder\u003cF, D\u003e,\n        accounts: \u0026mut [AccountSumTargets],\n    ) -\u003e MerkleSumTreeTarget {\n        let mut leaves: Vec\u003cMerkleSumNodeTarget\u003e = accounts\n            .iter()\n            .map(|x| MerkleSumNodeTarget::get_node_from_account_targets(builder, x))\n            .collect();\n\n        MerkleSumTreeTarget::build_merkle_sum_tree(builder, \u0026mut leaves);\n\n        let tree = MerkleSumTreeTarget { sum_tree: leaves };\n\n        tree.register_public_inputs(builder);\n\n        tree\n    }\n}\n\npub fn build_merkle_sum_tree_circuit(\n    num_of_leaves: usize,\n    token_num: usize,\n    config: CircuitConfig,\n) -\u003e (CircuitData\u003cF, C, D\u003e, Vec\u003cAccountTargets\u003e) {\n    // assert num_of_leaves is a power of 2\n    assert!(num_of_leaves.is_power_of_two(), \"num_of_leaves must be a power of 2.\");\n\n    let mut builder = CircuitBuilder::\u003cF, D\u003e::new(config);\n    let mut account_targets: Vec\u003cAccountTargets\u003e = Vec::new();\n    (0..num_of_leaves).for_each(|_| {\n        let id: [Target; 5] = std::array::from_fn(|_| builder.add_virtual_target());\n        let equity_targets = builder.add_virtual_targets(token_num);\n        let debt_targets = builder.add_virtual_targets(token_num);\n        let account_target = AccountTargets { id, equity: equity_targets, debt: debt_targets };\n        account_targets.push(account_target);\n    });\n    let mut account_sum_targets: Vec\u003cAccountSumTargets\u003e = account_targets\n        .iter()\n        .map(|x| AccountSumTargets::from_account_target(x, \u0026mut builder))\n        .collect();\n\n    _ = MerkleSumTreeTarget::build_new_from_account_targets(\u0026mut builder, \u0026mut account_sum_targets);\n    let circuit_data = builder.build::\u003cC\u003e();\n    (circuit_data, account_targets)\n}\n\n#[cfg(test)]\npub mod test {\n    use crate::{\n        circuit_utils::run_circuit_test,\n        merkle_sum_prover::circuits::account_circuit::{AccountSumTargets, AccountTargets},\n        parser::{FileManager, JsonFileManager},\n    };\n\n    use super::MerkleSumNodeTarget;\n\n    #[test]\n    pub fn test_merkle_sum_node() {\n        run_circuit_test(|builder, pw| {\n            let path = \"../../test-data/batch0.json\";\n            let fm = FileManager {};\n            let tokens = vec![\"BTC\".to_owned(), \"ETH\".to_owned()];\n            let accounts = fm.read_json_into_accounts_vec(path, \u0026tokens);\n\n            let account_target_1 =\n                AccountTargets::new_from_account(accounts.get(0).unwrap(), builder);\n            let account_target_2 =\n                AccountTargets::new_from_account(accounts.get(1).unwrap(), builder);\n\n            let account_sum_target_1 =\n                AccountSumTargets::from_account_target(\u0026account_target_1, builder);\n            let account_sum_target_2 =\n                AccountSumTargets::from_account_target(\u0026account_target_2, builder);\n\n            let merkle_sum_node_target_1 =\n                MerkleSumNodeTarget::get_node_from_account_targets(builder, \u0026account_sum_target_1);\n            let merkle_sum_node_target_2 =\n                MerkleSumNodeTarget::get_node_from_account_targets(builder, \u0026account_sum_target_2);\n\n            let merkle_sum_node_target_3 = MerkleSumNodeTarget::get_parent_from_children::\u003c2\u003e(\n                builder,\n                \u0026vec![merkle_sum_node_target_1, merkle_sum_node_target_2],\n            );\n\n            let sum_equity =\n                builder.add(account_sum_target_1.sum_equity, account_sum_target_2.sum_equity);\n            let sum_debt =\n                builder.add(account_sum_target_1.sum_debt, account_sum_target_2.sum_debt);\n\n            builder.connect(merkle_sum_node_target_3.sum_equity, sum_equity);\n            builder.connect(merkle_sum_node_target_3.sum_debt, sum_debt);\n\n            account_target_1.set_account_targets(accounts.get(0).unwrap(), pw);\n            account_target_2.set_account_targets(accounts.get(1).unwrap(), pw);\n        });\n    }\n}\n","traces":[{"line":36,"address":[9463748,9463056,9463780],"length":1,"stats":{"Line":1}},{"line":40,"address":[8824968],"length":1,"stats":{"Line":1}},{"line":41,"address":[],"length":0,"stats":{"Line":1}},{"line":42,"address":[8825120],"length":1,"stats":{"Line":1}},{"line":43,"address":[11195470],"length":1,"stats":{"Line":1}},{"line":44,"address":[9463792,9463313,9463398],"length":1,"stats":{"Line":3}},{"line":45,"address":[8825667],"length":1,"stats":{"Line":1}},{"line":46,"address":[9463945],"length":1,"stats":{"Line":1}},{"line":49,"address":[8825917],"length":1,"stats":{"Line":1}},{"line":50,"address":[11196402],"length":1,"stats":{"Line":1}},{"line":54,"address":[],"length":0,"stats":{"Line":1}},{"line":55,"address":[9464380],"length":1,"stats":{"Line":1}},{"line":56,"address":[8826289],"length":1,"stats":{"Line":1}},{"line":57,"address":[],"length":0,"stats":{"Line":1}},{"line":59,"address":[9464643],"length":1,"stats":{"Line":1}},{"line":61,"address":[],"length":0,"stats":{"Line":1}},{"line":66,"address":[8826528],"length":1,"stats":{"Line":1}},{"line":70,"address":[11196956],"length":1,"stats":{"Line":1}},{"line":72,"address":[11196976],"length":1,"stats":{"Line":1}},{"line":73,"address":[11197015],"length":1,"stats":{"Line":1}},{"line":79,"address":[],"length":0,"stats":{"Line":0}},{"line":80,"address":[],"length":0,"stats":{"Line":0}},{"line":84,"address":[],"length":0,"stats":{"Line":0}},{"line":85,"address":[],"length":0,"stats":{"Line":0}},{"line":88,"address":[11197168],"length":1,"stats":{"Line":1}},{"line":94,"address":[11197184],"length":1,"stats":{"Line":1}},{"line":95,"address":[11197219],"length":1,"stats":{"Line":1}},{"line":96,"address":[11197266],"length":1,"stats":{"Line":1}},{"line":97,"address":[11197314],"length":1,"stats":{"Line":1}},{"line":102,"address":[10444409,10443792],"length":1,"stats":{"Line":0}},{"line":104,"address":[10444374,10444431,10443834],"length":1,"stats":{"Line":0}},{"line":110,"address":[11197836,11197344],"length":1,"stats":{"Line":0}},{"line":111,"address":[8826987],"length":1,"stats":{"Line":0}},{"line":112,"address":[8827002],"length":1,"stats":{"Line":0}},{"line":113,"address":[11197507],"length":1,"stats":{"Line":0}},{"line":114,"address":[11197617],"length":1,"stats":{"Line":0}},{"line":129,"address":[11197872],"length":1,"stats":{"Line":1}},{"line":130,"address":[8827464],"length":1,"stats":{"Line":1}},{"line":134,"address":[11197952],"length":1,"stats":{"Line":1}},{"line":135,"address":[11197971],"length":1,"stats":{"Line":1}},{"line":136,"address":[11197990],"length":1,"stats":{"Line":1}},{"line":141,"address":[11198016,11199085],"length":1,"stats":{"Line":1}},{"line":145,"address":[11198068],"length":1,"stats":{"Line":1}},{"line":147,"address":[11198265,11198090],"length":1,"stats":{"Line":2}},{"line":148,"address":[8827853,8827954],"length":1,"stats":{"Line":1}},{"line":149,"address":[11198794,11198369,11198408],"length":1,"stats":{"Line":2}},{"line":150,"address":[11198506,11198603],"length":1,"stats":{"Line":2}},{"line":151,"address":[8828176,8828263],"length":1,"stats":{"Line":2}},{"line":152,"address":[11199020],"length":1,"stats":{"Line":1}},{"line":154,"address":[8828271,8828407],"length":1,"stats":{"Line":2}},{"line":160,"address":[11199120,11199510],"length":1,"stats":{"Line":1}},{"line":164,"address":[11199192],"length":1,"stats":{"Line":1}},{"line":166,"address":[8829077,8829056],"length":1,"stats":{"Line":2}},{"line":169,"address":[11199278],"length":1,"stats":{"Line":1}},{"line":171,"address":[8828855],"length":1,"stats":{"Line":1}},{"line":173,"address":[11199398],"length":1,"stats":{"Line":1}},{"line":175,"address":[8828977],"length":1,"stats":{"Line":1}},{"line":179,"address":[11200731,11199600,11200678],"length":1,"stats":{"Line":1}},{"line":185,"address":[11199993,11199643,11199841],"length":1,"stats":{"Line":2}},{"line":187,"address":[11199875,11200018],"length":1,"stats":{"Line":2}},{"line":188,"address":[8829534],"length":1,"stats":{"Line":1}},{"line":189,"address":[11200091,11200768,11201194,11201226],"length":1,"stats":{"Line":2}},{"line":190,"address":[8830656,8830677,8830235],"length":1,"stats":{"Line":3}},{"line":191,"address":[11200826],"length":1,"stats":{"Line":1}},{"line":192,"address":[8830295],"length":1,"stats":{"Line":1}},{"line":193,"address":[11200944],"length":1,"stats":{"Line":1}},{"line":194,"address":[11201155],"length":1,"stats":{"Line":1}},{"line":196,"address":[11200208],"length":1,"stats":{"Line":1}},{"line":198,"address":[11201331,11201296],"length":1,"stats":{"Line":2}},{"line":201,"address":[11200415,11200332],"length":1,"stats":{"Line":2}},{"line":202,"address":[11200461],"length":1,"stats":{"Line":1}},{"line":203,"address":[11200533],"length":1,"stats":{"Line":1}}],"covered":61,"coverable":72},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","merkle_sum_prover","circuits","mod.rs"],"content":"pub mod account_circuit;\npub mod merkle_sum_circuit;\n","traces":[],"covered":0,"coverable":0},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","merkle_sum_prover","mod.rs"],"content":"pub mod circuits;\npub mod prover;\npub mod utils;\n","traces":[],"covered":0,"coverable":0},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","merkle_sum_prover","prover.rs"],"content":"use crate::{\n    account::Account,\n    circuit_config::STANDARD_CONFIG,\n    circuit_utils::prove_timing,\n    merkle_sum_prover::circuits::account_circuit::{AccountSumTargets, AccountTargets},\n    types::{C, D, F},\n};\nuse plonky2::{\n    iop::witness::PartialWitness,\n    plonk::{\n        circuit_builder::CircuitBuilder, circuit_data::CircuitData, proof::ProofWithPublicInputs,\n        prover::prove,\n    },\n};\n\nuse tracing::{error, info};\n\nuse super::circuits::merkle_sum_circuit::MerkleSumTreeTarget;\n\n/// A merkle sum tree prover with a batch id representing its index in the recursive proof tree and a Vec of accounts representing accounts in this batch.\n#[derive(Debug)]\npub struct MerkleSumTreeProver {\n    // batch_id: usize,\n    pub accounts: Vec\u003cAccount\u003e,\n}\n\nimpl MerkleSumTreeProver {\n    /// Sets provided account targets with values from accounts in the prover batch.\n    pub fn set_merkle_tree_targets(\n        \u0026self,\n        pw: \u0026mut PartialWitness\u003cF\u003e,\n        account_targets: \u0026[AccountTargets],\n    ) {\n        for i in 0..self.accounts.len() {\n            // Set account targets\n            account_targets.get(i).unwrap().set_account_targets(self.accounts.get(i).unwrap(), pw);\n        }\n    }\n\n    /// Builds a merkle sum tree targets and returns the account targets to be set with input values.\n    pub fn build_merkle_tree_targets(\n        \u0026self,\n        builder: \u0026mut CircuitBuilder\u003cF, D\u003e,\n    ) -\u003e Vec\u003cAccountTargets\u003e {\n        let mut account_targets: Vec\u003cAccountTargets\u003e = Vec::new();\n\n        for i in 0..self.accounts.len() {\n            // Build account targets\n            let account_target =\n                AccountTargets::new_from_account(self.accounts.get(i).unwrap(), builder);\n            // Set account targets\n            account_targets.push(account_target);\n        }\n\n        let mut account_sum_targets: Vec\u003cAccountSumTargets\u003e = account_targets\n            .iter()\n            .map(|x| AccountSumTargets::from_account_target(x, builder))\n            .collect();\n\n        // build merkle sum tree\n        let _merkle_tree_targets =\n            MerkleSumTreeTarget::build_new_from_account_targets(builder, \u0026mut account_sum_targets);\n\n        account_targets\n    }\n\n    /// Get the merkle sum tree proof of this batch of accounts.\n    pub fn get_proof(\u0026self) -\u003e ProofWithPublicInputs\u003cF, C, D\u003e {\n        let mut builder = CircuitBuilder::\u003cF, D\u003e::new(STANDARD_CONFIG);\n        let mut pw = PartialWitness::\u003cF\u003e::new();\n\n        // Build and set merkle tree targets\n        let account_targets = self.build_merkle_tree_targets(\u0026mut builder);\n        self.set_merkle_tree_targets(\u0026mut pw, \u0026account_targets);\n\n        builder.print_gate_counts(0);\n\n        let mut t = prove_timing();\n        let data = builder.build::\u003cC\u003e();\n\n        let CircuitData { prover_only, common, verifier_only: _ } = \u0026data;\n\n        info!(\"Started Proving\");\n\n        let proof_res = prove(prover_only, common, pw, \u0026mut t);\n\n        match proof_res {\n            Ok(proof) =\u003e {\n                let proof_verification_res = data.verify(proof.clone());\n                match proof_verification_res {\n                    Ok(_) =\u003e proof,\n                    Err(e) =\u003e {\n                        error!(\"Proof verification failed: {:?}\", e);\n                        panic!(\"Proof verification failed!\");\n                    }\n                }\n            }\n            Err(e) =\u003e {\n                error!(\"Proof generation failed: {:?}\", e);\n                panic!(\"Proof generation failed!\");\n            }\n        }\n    }\n\n    /// Get proof with a pre-compiled merkle sum circuit and account targets. In this method we do not need to build the circuit as we use a pre-built circuit.\n    pub fn get_proof_with_circuit_data(\n        \u0026self,\n        account_targets: \u0026[AccountTargets],\n        circuit_data: \u0026CircuitData\u003cF, C, D\u003e,\n    ) -\u003e ProofWithPublicInputs\u003cF, C, D\u003e {\n        let mut pw = PartialWitness::\u003cF\u003e::new();\n        for i in 0..self.accounts.len() {\n            // Build account targets\n            let account_target = account_targets.get(i).unwrap();\n            // Set account targets\n            account_target.set_account_targets(self.accounts.get(i).unwrap(), \u0026mut pw);\n        }\n\n        let CircuitData { prover_only, common, verifier_only: _ } = \u0026circuit_data;\n\n        let mut t = prove_timing();\n        let proof_res = prove(prover_only, common, pw, \u0026mut t);\n\n        match proof_res {\n            Ok(proof) =\u003e {\n                let proof_verification_res = circuit_data.verify(proof.clone());\n                match proof_verification_res {\n                    Ok(_) =\u003e proof,\n                    Err(e) =\u003e {\n                        error!(\"Proof verification failed: {:?}\", e);\n                        panic!(\"Proof verification failed!\");\n                    }\n                }\n            }\n            Err(e) =\u003e {\n                error!(\"Proof generation failed: {:?}\", e);\n                panic!(\"Proof generation failed!\");\n            }\n        }\n    }\n\n    /// Get the merkle sum tree proof of this batch of accounts and the circuit data of the corresponding proof.\n    pub fn get_proof_and_circuit_data(\n        \u0026self,\n    ) -\u003e (ProofWithPublicInputs\u003cF, C, D\u003e, CircuitData\u003cF, C, D\u003e) {\n        let mut builder = CircuitBuilder::\u003cF, D\u003e::new(STANDARD_CONFIG);\n        let mut pw = PartialWitness::\u003cF\u003e::new();\n\n        // Build and set merkle tree targets\n        let account_targets = self.build_merkle_tree_targets(\u0026mut builder);\n        self.set_merkle_tree_targets(\u0026mut pw, \u0026account_targets);\n\n        builder.print_gate_counts(0);\n\n        let data = builder.build::\u003cC\u003e();\n\n        let CircuitData { prover_only, common, verifier_only: _ } = \u0026data;\n\n        tracing::debug!(\"Starting proving!\");\n\n        let mut t = prove_timing();\n        let proof_res = prove(prover_only, common, pw, \u0026mut t);\n\n        match proof_res {\n            Ok(proof) =\u003e {\n                let proof_verification_res = data.verify(proof.clone());\n                match proof_verification_res {\n                    Ok(_) =\u003e (proof, data),\n                    Err(e) =\u003e {\n                        error!(\"Proof verification failed: {:?}\", e);\n                        panic!(\"Proof verification failed!\");\n                    }\n                }\n            }\n            Err(e) =\u003e {\n                error!(\"Proof generation failed: {:?}\", e);\n                panic!(\"Proof generation failed!\");\n            }\n        }\n    }\n}\n\n#[cfg(test)]\npub mod test {\n    use crate::{\n        circuit_utils::run_circuit_test,\n        parser::{FileManager, JsonFileManager},\n    };\n\n    use super::MerkleSumTreeProver;\n\n    #[test]\n    pub fn test_build_and_set_merkle_targets() {\n        run_circuit_test(|builder, pw| {\n            let path = \"../../test-data/batch0.json\";\n            let fm = FileManager {};\n            let tokens = vec![\"BTC\".to_owned(), \"ETH\".to_owned()];\n            let accounts = fm.read_json_into_accounts_vec(path, \u0026tokens);\n\n            let prover = MerkleSumTreeProver {\n                // batch_id: 0,\n                accounts,\n            };\n\n            // Build and set merkle tree targets\n            let account_targets = prover.build_merkle_tree_targets(builder);\n            prover.set_merkle_tree_targets(pw, \u0026account_targets);\n        });\n    }\n\n    #[test]\n    pub fn test_get_proof() {\n        let path = \"../../test-data/batch0.json\";\n        let fm = FileManager {};\n        let tokens = vec![\"BTC\".to_owned(), \"ETH\".to_owned()];\n        let accounts = fm.read_json_into_accounts_vec(path, \u0026tokens);\n        let prover = MerkleSumTreeProver {\n            // batch_id: 0,\n            accounts,\n        };\n\n        let _proof = prover.get_proof();\n    }\n}\n","traces":[{"line":29,"address":[8830768],"length":1,"stats":{"Line":1}},{"line":34,"address":[11386079,11386155],"length":1,"stats":{"Line":2}},{"line":36,"address":[11386330,11386170,11386246],"length":1,"stats":{"Line":3}},{"line":41,"address":[11386352,11387186,11387012],"length":1,"stats":{"Line":1}},{"line":45,"address":[11386404],"length":1,"stats":{"Line":1}},{"line":47,"address":[11386445,11386667,11386513],"length":1,"stats":{"Line":3}},{"line":49,"address":[8831708,8831811,8831396],"length":1,"stats":{"Line":3}},{"line":52,"address":[11387154],"length":1,"stats":{"Line":1}},{"line":55,"address":[11386722,11386630],"length":1,"stats":{"Line":2}},{"line":57,"address":[11387267,11387232],"length":1,"stats":{"Line":2}},{"line":61,"address":[8831584,8831504],"length":1,"stats":{"Line":2}},{"line":64,"address":[11386919],"length":1,"stats":{"Line":1}},{"line":68,"address":[8831952,8837638,8836201],"length":1,"stats":{"Line":1}},{"line":69,"address":[11387350],"length":1,"stats":{"Line":1}},{"line":70,"address":[11387512],"length":1,"stats":{"Line":1}},{"line":73,"address":[11387580],"length":1,"stats":{"Line":1}},{"line":74,"address":[11387653,11387753],"length":1,"stats":{"Line":2}},{"line":76,"address":[11387772],"length":1,"stats":{"Line":1}},{"line":78,"address":[11387795],"length":1,"stats":{"Line":1}},{"line":79,"address":[11387830],"length":1,"stats":{"Line":1}},{"line":81,"address":[11387903],"length":1,"stats":{"Line":1}},{"line":83,"address":[11388892,11388762,11389089,11388147,11389165,11388563],"length":1,"stats":{"Line":5}},{"line":85,"address":[11388965],"length":1,"stats":{"Line":1}},{"line":87,"address":[11389478],"length":1,"stats":{"Line":1}},{"line":88,"address":[11389513],"length":1,"stats":{"Line":1}},{"line":89,"address":[11389796,11389567],"length":1,"stats":{"Line":2}},{"line":90,"address":[11389847],"length":1,"stats":{"Line":1}},{"line":91,"address":[11389884],"length":1,"stats":{"Line":1}},{"line":92,"address":[11389944],"length":1,"stats":{"Line":0}},{"line":93,"address":[11390954,11390209,11390625,11391080,11390824,11391144,11391335],"length":1,"stats":{"Line":0}},{"line":94,"address":[11391019,11391585],"length":1,"stats":{"Line":0}},{"line":98,"address":[11389589],"length":1,"stats":{"Line":0}},{"line":99,"address":[11392761,11392090,11392277,11391695,11392389,11392506,11392570],"length":1,"stats":{"Line":0}},{"line":100,"address":[11393011,11392445],"length":1,"stats":{"Line":0}},{"line":106,"address":[11393104,11395789,11397488],"length":1,"stats":{"Line":1}},{"line":111,"address":[11393183],"length":1,"stats":{"Line":1}},{"line":112,"address":[11393300,11393232,11393530],"length":1,"stats":{"Line":3}},{"line":114,"address":[11397316,11393554],"length":1,"stats":{"Line":2}},{"line":116,"address":[11397324,11397464],"length":1,"stats":{"Line":2}},{"line":119,"address":[11393441],"length":1,"stats":{"Line":1}},{"line":121,"address":[11393600,11393495],"length":1,"stats":{"Line":2}},{"line":122,"address":[11393608],"length":1,"stats":{"Line":1}},{"line":124,"address":[11393683],"length":1,"stats":{"Line":1}},{"line":125,"address":[8838274],"length":1,"stats":{"Line":1}},{"line":126,"address":[8838336,8838553],"length":1,"stats":{"Line":2}},{"line":127,"address":[8838600],"length":1,"stats":{"Line":1}},{"line":128,"address":[11394089],"length":1,"stats":{"Line":1}},{"line":129,"address":[8838695],"length":1,"stats":{"Line":0}},{"line":130,"address":[11394361,11395238,11395508,11395314,11394976,11395106,11394777],"length":1,"stats":{"Line":0}},{"line":131,"address":[11395761,11395171],"length":1,"stats":{"Line":0}},{"line":135,"address":[11393794],"length":1,"stats":{"Line":0}},{"line":136,"address":[11396574,11396755,11396946,11396462,11396691,11395871,11396275],"length":1,"stats":{"Line":0}},{"line":137,"address":[8841170,8841732],"length":1,"stats":{"Line":0}},{"line":143,"address":[11397520,11401997,11403468],"length":1,"stats":{"Line":0}},{"line":146,"address":[8842102],"length":1,"stats":{"Line":0}},{"line":147,"address":[11397744],"length":1,"stats":{"Line":0}},{"line":150,"address":[8842332],"length":1,"stats":{"Line":0}},{"line":151,"address":[11397985,11397885],"length":1,"stats":{"Line":0}},{"line":153,"address":[8842520],"length":1,"stats":{"Line":0}},{"line":155,"address":[11398027],"length":1,"stats":{"Line":0}},{"line":157,"address":[11398108],"length":1,"stats":{"Line":0}},{"line":159,"address":[11398765,11399295,11398349,11399094,11399219,11398964],"length":1,"stats":{"Line":0}},{"line":161,"address":[11399624,11399159],"length":1,"stats":{"Line":0}},{"line":162,"address":[11399632],"length":1,"stats":{"Line":0}},{"line":164,"address":[11399715],"length":1,"stats":{"Line":0}},{"line":165,"address":[11399750],"length":1,"stats":{"Line":0}},{"line":166,"address":[8844529,8844296],"length":1,"stats":{"Line":0}},{"line":167,"address":[11400084],"length":1,"stats":{"Line":0}},{"line":168,"address":[8844593],"length":1,"stats":{"Line":0}},{"line":169,"address":[11400347],"length":1,"stats":{"Line":0}},{"line":170,"address":[11400593,11401528,11401009,11401338,11401719,11401464,11401208],"length":1,"stats":{"Line":0}},{"line":171,"address":[11401403,11401969],"length":1,"stats":{"Line":0}},{"line":175,"address":[11399826],"length":1,"stats":{"Line":0}},{"line":176,"address":[11403145,11402079,11402474,11402954,11402773,11402661,11402890],"length":1,"stats":{"Line":0}},{"line":177,"address":[11403395,11402829],"length":1,"stats":{"Line":0}}],"covered":41,"coverable":75},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","merkle_sum_prover","utils.rs"],"content":"use plonky2::{\n    hash::{\n        hash_types::{HashOut, RichField},\n        poseidon::PoseidonHash,\n    },\n    plonk::config::Hasher,\n};\nuse plonky2_field::extension::Extendable;\n\npub fn hash_2_subhashes\u003cF: RichField + Extendable\u003cD\u003e, const D: usize\u003e(\n    hash_1: \u0026HashOut\u003cF\u003e,\n    hash_2: \u0026HashOut\u003cF\u003e,\n) -\u003e HashOut\u003cF\u003e {\n    #[allow(clippy::useless_vec)]\n    let inputs = vec![hash_1.elements.to_vec(), hash_2.elements.to_vec()].concat();\n    hash_inputs(inputs)\n}\n\npub fn hash_inputs\u003cF: RichField\u003e(inputs: Vec\u003cF\u003e) -\u003e HashOut\u003cF\u003e {\n    let hash = PoseidonHash::hash_no_pad(inputs.as_slice());\n    hash\n}\n","traces":[{"line":10,"address":[11874680,11874112,11874709],"length":1,"stats":{"Line":1}},{"line":15,"address":[],"length":0,"stats":{"Line":1}},{"line":16,"address":[],"length":0,"stats":{"Line":1}},{"line":19,"address":[],"length":0,"stats":{"Line":1}},{"line":20,"address":[],"length":0,"stats":{"Line":2}},{"line":21,"address":[],"length":0,"stats":{"Line":0}}],"covered":5,"coverable":6},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","merkle_sum_tree.rs"],"content":"use plonky2::{hash::hash_types::HashOut, util::log2_strict};\n\nuse crate::{\n    account::Account,\n    merkle_sum_prover::utils::hash_2_subhashes,\n    types::{D, F},\n};\n\nuse plonky2_field::types::Field;\n\n#[derive(Debug, Clone, Copy, PartialEq)]\npub struct MerkleSumNode {\n    pub sum_equity: F,\n    pub sum_debt: F,\n    pub hash: HashOut\u003cF\u003e,\n}\n\nimpl MerkleSumNode {\n    /// Get a new merkle sum node given a account.\n    pub fn new_from_account(account: \u0026Account) -\u003e MerkleSumNode {\n        let sum_equity = account.equity.iter().fold(F::ZERO, |acc, x| acc + *x);\n\n        let sum_debt = account.debt.iter().fold(F::ZERO, |acc, x| acc + *x);\n\n        let hash = account.get_hash();\n        MerkleSumNode { hash, sum_equity, sum_debt }\n    }\n\n    /// Get a new MerkleSumNode given its 2 child nodes.\n    pub fn new_from_children_nodes(node1: \u0026MerkleSumNode, node2: \u0026MerkleSumNode) -\u003e MerkleSumNode {\n        let hash = hash_2_subhashes::\u003cF, D\u003e(\u0026node1.hash, \u0026node2.hash);\n        let sum_equity = node1.sum_equity + node2.sum_equity;\n        let sum_debt = node1.sum_debt + node2.sum_debt;\n        MerkleSumNode { hash, sum_equity, sum_debt }\n    }\n}\n\n/// Struct representing a merkle sum tree, it is represented as a vector of Merkle Sum Nodes.\n#[derive(Debug, Clone)]\npub struct MerkleSumTree {\n    pub merkle_sum_tree: Vec\u003cMerkleSumNode\u003e,\n    pub tree_depth: usize,\n}\n\nimpl MerkleSumTree {\n    pub fn new_tree_from_accounts(accounts: \u0026[Account]) -\u003e MerkleSumTree {\n        let num_leaves = accounts.len();\n        let tree_depth = log2_strict(num_leaves);\n        let mut merkle_sum_tree: Vec\u003cMerkleSumNode\u003e = Vec::new();\n\n        for i in 0..num_leaves * 2 - 1 {\n            if i \u003c num_leaves {\n                let acct = accounts.get(i).unwrap();\n                merkle_sum_tree.push(MerkleSumNode::new_from_account(acct));\n            } else {\n                let left_child_index = 2 * (i - num_leaves);\n                let right_child_index = 2 * (i - num_leaves) + 1;\n                let left_child = merkle_sum_tree.get(left_child_index).unwrap();\n                let right_child = merkle_sum_tree.get(right_child_index).unwrap();\n                let node = MerkleSumNode::new_from_children_nodes(left_child, right_child);\n                merkle_sum_tree.push(node);\n            }\n        }\n\n        MerkleSumTree { merkle_sum_tree, tree_depth }\n    }\n\n    pub fn get_root(\u0026self) -\u003e MerkleSumNode {\n        *self.merkle_sum_tree.last().unwrap()\n    }\n\n    pub fn get_from_index(\u0026self, index: usize) -\u003e Option\u003c\u0026MerkleSumNode\u003e {\n        return self.merkle_sum_tree.get(index);\n    }\n}\n\n#[cfg(test)]\npub mod test {\n    use crate::{\n        account::gen_accounts_with_random_data,\n        circuit_config::STANDARD_CONFIG,\n        merkle_sum_prover::{\n            circuits::merkle_sum_circuit::{build_merkle_sum_tree_circuit, MerkleSumNodeTarget},\n            prover::MerkleSumTreeProver,\n        },\n        parser::{FileManager, JsonFileManager},\n        types::F,\n    };\n    use plonky2::hash::hash_types::HashOut;\n    use plonky2_field::types::Field;\n\n    use super::{MerkleSumNode, MerkleSumTree};\n\n    #[test]\n    pub fn test_new_from_account() {\n        let path = \"../../test-data/batch0.json\";\n        let fm = FileManager {};\n        let tokens = vec![\"BTC\".to_owned(), \"ETH\".to_owned()];\n        let accounts = fm.read_json_into_accounts_vec(path, \u0026tokens);\n\n        let account = accounts.get(0).unwrap();\n        let node = MerkleSumNode::new_from_account(account);\n        let btc_amount = 9195990;\n        let eth_amount = 0;\n        assert_eq!(node.sum_equity, F::from_canonical_u64(btc_amount + eth_amount));\n        assert_eq!(node.sum_debt, F::from_canonical_u64(1));\n    }\n\n    #[test]\n    pub fn test_new_from_children_nodes() {\n        let fm = FileManager {};\n        let path = \"../../test-data/batch0.json\";\n        let tokens = vec![\"BTC\".to_owned(), \"ETH\".to_owned()];\n        let accounts = fm.read_json_into_accounts_vec(path, \u0026tokens);\n\n        let account1 = accounts.get(0).unwrap();\n        let node1 = MerkleSumNode::new_from_account(account1);\n        let acc1_btc_amount = 9195990;\n        let acc1_eth_amount = 0;\n        let acc2_btc_amount = 1729750;\n        let acc2_eth_amount = 0;\n\n        let account2 = accounts.get(1).unwrap();\n        let node2 = MerkleSumNode::new_from_account(account2);\n        let node3 = MerkleSumNode::new_from_children_nodes(\u0026node1, \u0026node2);\n        assert_eq!(\n            node3.sum_equity,\n            F::from_canonical_u64(\n                acc1_btc_amount + acc1_eth_amount + acc2_btc_amount + acc2_eth_amount\n            ),\n        );\n        assert_eq!(node3.sum_debt, F::from_canonical_u64(2));\n    }\n\n    #[test]\n    pub fn test_new_tree_from_accounts() {\n        let fm = FileManager {};\n        let path = \"../../test-data/batch0.json\";\n        let tokens = vec![\"BTC\".to_owned(), \"ETH\".to_owned()];\n        let accounts = fm.read_json_into_accounts_vec(path, \u0026tokens);\n        let mut sum_equity = F::ZERO;\n        let mut sum_debt = F::ZERO;\n\n        for i in 0..accounts.len() {\n            let account = accounts.get(i).unwrap();\n            account.equity.iter().for_each(|x| {\n                sum_equity = sum_equity + *x;\n            });\n\n            account.debt.iter().for_each(|x| {\n                sum_debt = sum_debt + *x;\n            });\n        }\n\n        let tree = MerkleSumTree::new_tree_from_accounts(\u0026accounts);\n\n        let root = tree.get_root();\n        assert_eq!(root.sum_equity, sum_equity);\n        assert_eq!(root.sum_debt, sum_debt);\n    }\n\n    #[test]\n    fn test_identical_root_hash_with_proving() {\n        let batch_num = 4;\n        let num_assets = 4;\n        let accounts = gen_accounts_with_random_data(4, num_assets);\n\n        let merkle_sum_tree = MerkleSumTree::new_tree_from_accounts(\u0026accounts);\n\n        let (batch_circuit, account_targets) =\n            build_merkle_sum_tree_circuit(batch_num, num_assets, STANDARD_CONFIG);\n\n        let prover = MerkleSumTreeProver { accounts };\n        let proof = prover.get_proof_with_circuit_data(\u0026account_targets, \u0026batch_circuit);\n\n        let hash_offset = MerkleSumNodeTarget::pub_input_root_hash_offset();\n        let proof_root_hash = HashOut::\u003cF\u003e::from_partial(\u0026proof.public_inputs[hash_offset]);\n        assert_eq!(proof_root_hash, merkle_sum_tree.get_root().hash);\n    }\n}\n","traces":[{"line":20,"address":[11403504],"length":1,"stats":{"Line":1}},{"line":21,"address":[11403728,11403760,11403536],"length":1,"stats":{"Line":3}},{"line":23,"address":[11403589,11403776,11403808],"length":1,"stats":{"Line":3}},{"line":25,"address":[11403642],"length":1,"stats":{"Line":1}},{"line":30,"address":[10079024],"length":1,"stats":{"Line":1}},{"line":31,"address":[11403857],"length":1,"stats":{"Line":1}},{"line":32,"address":[11403877],"length":1,"stats":{"Line":1}},{"line":33,"address":[11403909],"length":1,"stats":{"Line":1}},{"line":46,"address":[11405395,11404000],"length":1,"stats":{"Line":1}},{"line":47,"address":[11404066],"length":1,"stats":{"Line":1}},{"line":48,"address":[11404074],"length":1,"stats":{"Line":1}},{"line":49,"address":[11404096],"length":1,"stats":{"Line":1}},{"line":51,"address":[11404242,11404528,11404118],"length":1,"stats":{"Line":3}},{"line":52,"address":[11404549],"length":1,"stats":{"Line":1}},{"line":53,"address":[10080503,10079801],"length":1,"stats":{"Line":2}},{"line":54,"address":[11405344],"length":1,"stats":{"Line":1}},{"line":56,"address":[11404567,11404630,11404715],"length":1,"stats":{"Line":2}},{"line":57,"address":[11404741,11404697,11404866],"length":1,"stats":{"Line":2}},{"line":58,"address":[10080036,10080089,10080181],"length":1,"stats":{"Line":3}},{"line":59,"address":[11405006,11405151],"length":1,"stats":{"Line":2}},{"line":60,"address":[11405159],"length":1,"stats":{"Line":1}},{"line":61,"address":[11405178],"length":1,"stats":{"Line":1}},{"line":68,"address":[11405424],"length":1,"stats":{"Line":1}},{"line":69,"address":[11405456,11405528],"length":1,"stats":{"Line":2}},{"line":72,"address":[11405552],"length":1,"stats":{"Line":0}},{"line":73,"address":[11405570],"length":1,"stats":{"Line":0}}],"covered":24,"coverable":26},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","parser.rs"],"content":"use super::account::{gen_accounts_with_random_data, Account};\nuse crate::types::{ASSETS_KEY, F};\nuse plonky2_field::types::Field;\nuse serde_json::{Map, Value};\nuse std::{\n    fs,\n    fs::File,\n    io::BufReader,\n    ops::Div,\n    path::{Path, PathBuf},\n};\nuse tracing::{debug, error, info};\n\n#[derive(Debug, Clone)]\npub struct FilesCfg {\n    pub dir: PathBuf,\n    pub batch_size: usize,\n    pub tokens: Vec\u003cString\u003e,\n}\n\npub trait AccountParser {\n    fn read_n_accounts(\n        \u0026mut self,\n        offset: usize,\n        n: usize,\n        fm: \u0026impl JsonFileManager,\n    ) -\u003e Vec\u003cAccount\u003e;\n    fn total_num_of_users(\u0026self) -\u003e usize;\n}\n\n#[derive(Debug)]\npub struct FileManager {}\n\npub trait JsonFileManager {\n    fn list_json_files(\u0026self, dir: \u0026Path) -\u003e std::io::Result\u003cVec\u003cPathBuf\u003e\u003e;\n    fn read_json_into_accounts_vec(\u0026self, path: \u0026str, tokens: \u0026Vec\u003cString\u003e) -\u003e Vec\u003cAccount\u003e;\n    fn read_json_file_into_map(\u0026self, path: \u0026str) -\u003e Vec\u003cMap\u003cString, Value\u003e\u003e;\n}\n\nimpl JsonFileManager for FileManager {\n    fn list_json_files(\u0026self, dir: \u0026Path) -\u003e std::io::Result\u003cVec\u003cPathBuf\u003e\u003e {\n        let mut json_files = Vec::new();\n        if dir.is_dir() {\n            for entry in fs::read_dir(dir)? {\n                let entry = entry?;\n                let path = entry.path();\n                if path.is_file() {\n                    if let Some(extension) = path.extension() {\n                        if extension == \"json\" {\n                            json_files.push(path);\n                        }\n                    }\n                } else if path.is_dir() {\n                    json_files.extend(self.list_json_files(\u0026path)?);\n                }\n            }\n        }\n        json_files.sort();\n        Ok(json_files)\n    }\n\n    /// Read a json file and return the vec of associated accounts.\n    /// tokens is a list of all possible token names. It is used to fill the account with zero for missing tokens.\n    fn read_json_into_accounts_vec(\u0026self, path: \u0026str, tokens: \u0026Vec\u003cString\u003e) -\u003e Vec\u003cAccount\u003e {\n        let parsed_data = self.read_json_file_into_map(path);\n        parse_exchange_state(\u0026parsed_data, tokens)\n    }\n\n    /// Reads a json file into a json string.\n    fn read_json_file_into_map(\u0026self, path: \u0026str) -\u003e Vec\u003cMap\u003cString, Value\u003e\u003e {\n        let file = File::open(path);\n        match file {\n            Ok(f) =\u003e {\n                let reader = BufReader::new(f);\n                // Deserialize the binary data to a struct\n                serde_json::from_reader(reader).expect(\"Unable to parse Json Data\")\n            }\n            Err(e) =\u003e {\n                error!(\"file open error, {:?}\", e);\n                panic!(\"File not found at specified path\");\n            }\n        }\n    }\n}\n\n#[derive(Debug)]\npub struct FileAccountReader {\n    pub cfg: FilesCfg,\n    pub total_num_of_batches: usize,\n    pub total_num_of_users: usize,\n    num_of_docs: usize,\n    num_of_batches_per_doc: usize,\n    file_idx: usize,\n    offset: usize, // an offset to the buffered_accounts\n    buffered_accounts: Vec\u003cAccount\u003e,\n    last_doc_accounts: Vec\u003cAccount\u003e, // we keep this avoiding double loading of last doc\n    docs: Vec\u003cPathBuf\u003e,\n}\n\nimpl FileAccountReader {\n    pub fn new(cfg: FilesCfg, fm: \u0026impl JsonFileManager) -\u003e Self {\n        let user_data_path = std::path::Path::new(\u0026(cfg.dir));\n        if !user_data_path.exists() {\n            panic!(\"dir: {:?} does not exist\", user_data_path);\n        }\n        let json_files = fm.list_json_files(user_data_path);\n        let mut parser = Self {\n            buffered_accounts: vec![],\n            last_doc_accounts: vec![],\n            file_idx: 0,\n            offset: 0,\n            num_of_docs: 0,\n            cfg: cfg.clone(),\n            num_of_batches_per_doc: 0,\n            total_num_of_users: 0,\n            total_num_of_batches: 0,\n            docs: vec![],\n        };\n\n        match json_files {\n            Ok(docs) =\u003e {\n                info!(\"files: {:?}\", docs);\n                let doc_len = docs.len();\n                parser.docs = docs;\n                parser.num_of_docs = doc_len;\n                if doc_len \u003c 1 {\n                    panic!(\"no json files under the folder: {:?}\", user_data_path);\n                }\n                let first_doc_accounts =\n                    fm.read_json_into_accounts_vec(parser.docs[0].to_str().unwrap(), \u0026cfg.tokens);\n                let first_doc_accounts_len = first_doc_accounts.len();\n\n                if doc_len \u003e 1 {\n                    assert_eq!(first_doc_accounts_len % parser.cfg.batch_size, 0);\n                }\n                parser.num_of_batches_per_doc = first_doc_accounts_len.div(parser.cfg.batch_size);\n                parser.buffered_accounts = first_doc_accounts;\n                parser.file_idx = 0;\n\n                if doc_len \u003e 1 {\n                    let last_doc_accounts = fm.read_json_into_accounts_vec(\n                        parser.docs[doc_len - 1].to_str().unwrap(),\n                        \u0026cfg.tokens,\n                    );\n                    assert!(last_doc_accounts.len() \u003c= first_doc_accounts_len);\n                    parser.last_doc_accounts = last_doc_accounts;\n                }\n\n                let total_num_of_users = if doc_len == 1 {\n                    first_doc_accounts_len\n                } else {\n                    (doc_len - 1) * first_doc_accounts_len + parser.last_doc_accounts.len()\n                };\n\n                let num_of_batches = total_num_of_users.div_ceil(parser.cfg.batch_size);\n                parser.total_num_of_users = total_num_of_users;\n                parser.total_num_of_batches = num_of_batches;\n            }\n            Err(e) =\u003e panic!(\"list json files err: {:?}\", e),\n        }\n\n        parser\n    }\n\n    pub fn log_state(\u0026self) {\n        debug!(\"cfg: {:?},\\n num_of_files: {:?},\\n num_of_batches_per_doc: {:?},\\n file_idx: {:?},\\n offset: {:?},\\n total_num_of_users: {:?},\\n total_num_of_batches: {:?}\",\n        self.cfg, self.num_of_docs, self.num_of_batches_per_doc, self.file_idx, self.offset, self.total_num_of_users, self.total_num_of_batches);\n    }\n}\n\nimpl AccountParser for FileAccountReader {\n    fn total_num_of_users(\u0026self) -\u003e usize {\n        self.total_num_of_users\n    }\n\n    /// `offset` is to the global user vectors;\n    fn read_n_accounts(\n        \u0026mut self,\n        offset: usize,\n        n: usize,\n        fm: \u0026impl JsonFileManager,\n    ) -\u003e Vec\u003cAccount\u003e {\n        debug!(\"read with offset: {:?}, account_num: {:?}\", offset, n);\n        self.log_state();\n        // to make it simpler, we assume only read by a multiple of batch size;\n        // if try to read cross multiple docs; simply can run this function multiple times;\n        assert!(n % self.cfg.batch_size == 0);\n        let min_offset: usize = self.file_idx * self.cfg.batch_size * self.num_of_batches_per_doc;\n        assert!(offset \u003e= min_offset);\n\n        let acct_len =\n            if offset + n \u003e self.total_num_of_users { self.total_num_of_users - offset } else { n };\n        let num_of_tokens = self.cfg.tokens.len();\n        let mut result = vec![Account::get_empty_account(num_of_tokens); acct_len];\n        if (n + offset - min_offset) \u003c= (self.buffered_accounts.len()) {\n            // we have enough account in the buffer\n            result.clone_from_slice(\u0026self.buffered_accounts[self.offset..(self.offset + n)]);\n            self.offset += n;\n        } else {\n            let mut filled_len = 0;\n\n            if self.offset \u003c self.buffered_accounts.len() {\n                let filled_len = self.buffered_accounts.len() - self.offset;\n                result[0..filled_len].clone_from_slice(\u0026self.buffered_accounts[(self.offset)..]);\n            }\n            let mut missing_len = result.len() - (self.buffered_accounts.len() - self.offset);\n            debug!(\n                \"result len: {:?}, self.offset: {:?}, missing_len: {:?}\",\n                result.len(),\n                self.offset,\n                missing_len\n            );\n\n            while missing_len \u003e 0 {\n                let to_read =\n                    std::cmp::min(self.num_of_batches_per_doc * self.cfg.batch_size, missing_len);\n                if self.file_idx \u003c (self.num_of_docs - 1) {\n                    // load the next file; TODO: assert_eq!(accounts_len, last_doc_account_num);\n                    self.file_idx += 1;\n                    self.buffered_accounts = fm.read_json_into_accounts_vec(\n                        self.docs[self.file_idx].to_str().unwrap(),\n                        \u0026self.cfg.tokens,\n                    );\n                    result[filled_len..(filled_len + to_read)]\n                        .clone_from_slice(\u0026self.buffered_accounts[0..to_read]);\n                    filled_len += to_read;\n                    self.offset = to_read;\n                } else {\n                    self.offset += result.len();\n                    break;\n                }\n                missing_len -= to_read;\n            }\n        }\n        result\n    }\n}\n\n/// Parses the exchanges state at some snapshot and returns.\nfn parse_exchange_state(\n    parsed_data: \u0026Vec\u003cMap\u003cString, Value\u003e\u003e,\n    tokens: \u0026Vec\u003cString\u003e,\n) -\u003e Vec\u003cAccount\u003e {\n    let mut accounts_data: Vec\u003cAccount\u003e = Vec::new();\n    for obj in parsed_data {\n        accounts_data.push(parse_account_state(obj, tokens));\n    }\n    accounts_data\n}\n\n/// Parses the exchanges state at some snapshot and returns.\npub fn parse_account_state(parsed_data: \u0026Map\u003cString, Value\u003e, tokens: \u0026Vec\u003cString\u003e) -\u003e Account {\n    let account_id = parsed_data\n        .get(\"id\")\n        .expect(format!(\"Account {:?} dont have key `id`\", parsed_data).as_str())\n        .as_str()\n        .unwrap();\n\n    let token_map = parsed_data\n        .get(ASSETS_KEY)\n        .expect(format!(\"Account {:?} dont have key `tokens`\", parsed_data).as_str())\n        .as_object()\n        .unwrap();\n    let mut parsed_equities = Vec::new();\n    let mut parsed_debts = Vec::new();\n\n    for token in tokens.iter() {\n        let parsed_token = token_map.get(token);\n        if parsed_token.is_none() {\n            continue;\n        }\n\n        let parsed_val = parsed_token.unwrap().as_str().unwrap().parse::\u003ci64\u003e().unwrap();\n        let abs_val = parsed_val.abs() as u64;\n\n        if parsed_val \u003c 0 {\n            parsed_debts.push(F::from_canonical_u64(abs_val));\n            parsed_equities.push(F::ZERO);\n        } else {\n            parsed_equities.push(F::from_canonical_u64(abs_val));\n            parsed_debts.push(F::ZERO);\n        }\n    }\n\n    Account { id: account_id.into(), equity: parsed_equities, debt: parsed_debts }\n}\n\npub struct RandomAccountParser {\n    pub total_num_of_users: usize,\n    pub num_of_tokens: usize,\n}\nimpl RandomAccountParser {\n    pub fn new(total_num_of_users: usize, num_of_tokens: usize) -\u003e Self {\n        RandomAccountParser { total_num_of_users: total_num_of_users, num_of_tokens: num_of_tokens }\n    }\n}\n\nimpl AccountParser for RandomAccountParser {\n    fn total_num_of_users(\u0026self) -\u003e usize {\n        self.total_num_of_users\n    }\n    /// `offset` is to the global user vectors;\n    fn read_n_accounts(\n        \u0026mut self,\n        offset: usize,\n        n: usize,\n        _: \u0026impl JsonFileManager,\n    ) -\u003e Vec\u003cAccount\u003e {\n        let n = std::cmp::min(n, self.total_num_of_users - offset);\n        gen_accounts_with_random_data(n, self.num_of_tokens)\n    }\n}\n\n#[cfg(test)]\nmod test {\n\n    use crate::{\n        account::Account,\n        parser::{parse_exchange_state, FileManager, FilesCfg},\n    };\n    use mockall::*;\n    use serde_json::{Map, Value};\n    use std::{\n        path::{Path, PathBuf},\n        str::FromStr,\n    };\n\n    use super::{AccountParser, FileAccountReader, JsonFileManager};\n\n    #[test]\n    pub fn test_read_json_file_into_map() {\n        let fm = FileManager {};\n        let path = \"../../test-data/batch0.json\";\n        let maps = fm.read_json_file_into_map(path);\n\n        let id_0 = \"0ca5a8a06ad2f88d6b95d219d1018ccc7c1777c557b1a2a72db413eef6264bb0\";\n        let parsed_id_0 = maps.get(0).unwrap().get(\"id\").unwrap();\n        assert_eq!(id_0, parsed_id_0);\n\n        let id_1 = \"1152272906d212dad6419261700a794687b371e8f9b8ec0ecb0f6023a9b3332b\";\n        let parsed_id_1 = maps.get(1).unwrap().get(\"id\").unwrap();\n        assert_eq!(id_1, parsed_id_1);\n    }\n\n    #[test]\n    pub fn test_parse_exchange_state() {\n        let fm = FileManager {};\n        let path = \"../../test-data/batch0.json\";\n        let maps = fm.read_json_file_into_map(path);\n        let tokens = vec![\"BTC\".to_string(), \"ETH\".to_string()];\n        let accounts = parse_exchange_state(\u0026maps, \u0026tokens);\n\n        let id_0 = \"0ca5a8a06ad2f88d6b95d219d1018ccc7c1777c557b1a2a72db413eef6264bb0\";\n        let account_0 = accounts.get(0).unwrap();\n        assert_eq!(id_0, account_0.id);\n\n        let id_1 = \"1152272906d212dad6419261700a794687b371e8f9b8ec0ecb0f6023a9b3332b\";\n        let account_1 = accounts.get(1).unwrap();\n        assert_eq!(id_1, account_1.id);\n    }\n\n    #[test]\n    pub fn test_read_json_into_accounts_vec() {\n        let fm = FileManager {};\n        let path = \"../../test-data/batch0.json\";\n        let tokens = vec![\"BTC\".to_string(), \"ETH\".to_string()];\n        let accounts = fm.read_json_into_accounts_vec(\u0026path, \u0026tokens);\n\n        let id_0 = \"0ca5a8a06ad2f88d6b95d219d1018ccc7c1777c557b1a2a72db413eef6264bb0\";\n        let account_0 = accounts.get(0).unwrap();\n        assert_eq!(id_0, account_0.id);\n\n        let id_1 = \"1152272906d212dad6419261700a794687b371e8f9b8ec0ecb0f6023a9b3332b\";\n        let account_1 = accounts.get(1).unwrap();\n        assert_eq!(id_1, account_1.id);\n    }\n\n    mock! {\n      pub FileManager {}\n\n      impl JsonFileManager for FileManager {\n          fn list_json_files(\u0026self, dir: \u0026Path) -\u003e std::io::Result\u003cVec\u003cPathBuf\u003e\u003e;\n          fn read_json_into_accounts_vec(\u0026self, path: \u0026str, tokens : \u0026Vec\u003cString\u003e) -\u003e Vec\u003cAccount\u003e;\n          fn read_json_file_into_map(\u0026self, path: \u0026str) -\u003e Vec\u003cMap\u003cString, Value\u003e\u003e;\n      }\n    }\n\n    #[test]\n    fn test_file_account_reader() {\n        let mut mock_file_manager = MockFileManager::new();\n        mock_file_manager.expect_list_json_files().returning(|_| {\n            let paths = vec![\n                std::path::PathBuf::from_str(\"file0\").unwrap(),\n                std::path::PathBuf::from_str(\"file1\").unwrap(),\n                std::path::PathBuf::from_str(\"file2\").unwrap(),\n                std::path::PathBuf::from_str(\"file3\").unwrap(),\n                std::path::PathBuf::from_str(\"file4\").unwrap(),\n                std::path::PathBuf::from_str(\"file5\").unwrap(),\n            ];\n            Ok(paths)\n        });\n\n        mock_file_manager.expect_read_json_into_accounts_vec().times(1).returning(|_, _| {\n            let accounts = vec![Account::get_empty_account(20); 4];\n            accounts\n        });\n        mock_file_manager.expect_read_json_into_accounts_vec().times(1).returning(|_, _| {\n            let accounts = vec![Account::get_empty_account(20); 3];\n            accounts\n        });\n\n        let dir = tempdir::TempDir::new(\"user_input_test\").unwrap().into_path();\n\n        let mut file_acct_reader = FileAccountReader::new(\n            FilesCfg { dir, batch_size: 4, tokens: vec![\"BTC\".to_owned(), \"ETH\".to_owned()] },\n            \u0026mock_file_manager,\n        );\n        assert_eq!(file_acct_reader.total_num_of_users(), 23);\n\n        mock_file_manager.expect_read_json_into_accounts_vec().times(1).returning(|_, _| {\n            let accounts = vec![Account::get_empty_account(20); 4];\n            accounts\n        });\n        let users = file_acct_reader.read_n_accounts(0, 8, \u0026mock_file_manager);\n        assert_eq!(users.len(), 8);\n\n        mock_file_manager.expect_read_json_into_accounts_vec().times(1).returning(|_, _| {\n            let accounts = vec![Account::get_empty_account(20); 4];\n            accounts\n        });\n        let users = file_acct_reader.read_n_accounts(8, 4, \u0026mock_file_manager);\n        assert_eq!(users.len(), 4);\n\n        mock_file_manager.expect_read_json_into_accounts_vec().times(3).returning(|_, _| {\n            let accounts = vec![Account::get_empty_account(20); 4];\n            accounts\n        });\n        let users = file_acct_reader.read_n_accounts(12, 12, \u0026mock_file_manager);\n        assert_eq!(users.len(), 11);\n    }\n}\n","traces":[{"line":41,"address":[11405600,11407447,11407412],"length":1,"stats":{"Line":0}},{"line":42,"address":[8848023],"length":1,"stats":{"Line":0}},{"line":43,"address":[11405712,11405781],"length":1,"stats":{"Line":0}},{"line":44,"address":[11405838,11407445,11406110,11406143],"length":1,"stats":{"Line":0}},{"line":45,"address":[11406352,11407421,11406512,11406191],"length":1,"stats":{"Line":0}},{"line":46,"address":[8848790,8848902],"length":1,"stats":{"Line":0}},{"line":47,"address":[11406609,11406674],"length":1,"stats":{"Line":0}},{"line":48,"address":[11406732,11407114],"length":1,"stats":{"Line":0}},{"line":49,"address":[11407226],"length":1,"stats":{"Line":0}},{"line":50,"address":[11407269],"length":1,"stats":{"Line":0}},{"line":53,"address":[11406707,11406762],"length":1,"stats":{"Line":0}},{"line":54,"address":[11406814],"length":1,"stats":{"Line":0}},{"line":58,"address":[11406234,11405787],"length":1,"stats":{"Line":0}},{"line":59,"address":[11406253],"length":1,"stats":{"Line":0}},{"line":64,"address":[11407472,11407603],"length":1,"stats":{"Line":1}},{"line":65,"address":[11407510],"length":1,"stats":{"Line":1}},{"line":66,"address":[11407544],"length":1,"stats":{"Line":1}},{"line":70,"address":[8849888,8851627],"length":1,"stats":{"Line":1}},{"line":71,"address":[11407702],"length":1,"stats":{"Line":1}},{"line":72,"address":[11407716],"length":1,"stats":{"Line":1}},{"line":73,"address":[11407729],"length":1,"stats":{"Line":1}},{"line":74,"address":[11407743],"length":1,"stats":{"Line":1}},{"line":76,"address":[11407757],"length":1,"stats":{"Line":1}},{"line":78,"address":[8850087],"length":1,"stats":{"Line":0}},{"line":79,"address":[11408910,11408035,11408617,11408729,11409100,11408430,11408846],"length":1,"stats":{"Line":0}},{"line":80,"address":[11409349,11408785],"length":1,"stats":{"Line":0}},{"line":101,"address":[9353828,9348432,9353483],"length":1,"stats":{"Line":1}},{"line":102,"address":[8851722,8851841],"length":1,"stats":{"Line":2}},{"line":103,"address":[9348629],"length":1,"stats":{"Line":1}},{"line":104,"address":[9348827],"length":1,"stats":{"Line":0}},{"line":106,"address":[9348792,9348905],"length":1,"stats":{"Line":2}},{"line":108,"address":[9348921],"length":1,"stats":{"Line":1}},{"line":109,"address":[9349006],"length":1,"stats":{"Line":1}},{"line":113,"address":[9349082],"length":1,"stats":{"Line":1}},{"line":117,"address":[9349130],"length":1,"stats":{"Line":1}},{"line":120,"address":[9349432],"length":1,"stats":{"Line":1}},{"line":121,"address":[9349471],"length":1,"stats":{"Line":1}},{"line":122,"address":[9350620,9350752,9351025,9350831,9350487,9350288,9349872],"length":1,"stats":{"Line":6}},{"line":123,"address":[9350693,9351286],"length":1,"stats":{"Line":2}},{"line":124,"address":[9351294],"length":1,"stats":{"Line":1}},{"line":125,"address":[9351484],"length":1,"stats":{"Line":1}},{"line":126,"address":[9351492],"length":1,"stats":{"Line":1}},{"line":127,"address":[9353514],"length":1,"stats":{"Line":0}},{"line":129,"address":[9351655,9351498,9351870],"length":1,"stats":{"Line":3}},{"line":131,"address":[9351901,9351985],"length":1,"stats":{"Line":2}},{"line":133,"address":[9351993],"length":1,"stats":{"Line":1}},{"line":134,"address":[9352040],"length":1,"stats":{"Line":1}},{"line":136,"address":[8855415,8855182],"length":1,"stats":{"Line":2}},{"line":137,"address":[9352248],"length":1,"stats":{"Line":1}},{"line":138,"address":[8855609],"length":1,"stats":{"Line":1}},{"line":140,"address":[9353093,9352450],"length":1,"stats":{"Line":2}},{"line":141,"address":[9352760],"length":1,"stats":{"Line":1}},{"line":142,"address":[9352487],"length":1,"stats":{"Line":1}},{"line":143,"address":[8855927],"length":1,"stats":{"Line":1}},{"line":145,"address":[9352865,9352787],"length":1,"stats":{"Line":2}},{"line":146,"address":[8856066],"length":1,"stats":{"Line":1}},{"line":149,"address":[8856273,8856465,8855635],"length":1,"stats":{"Line":2}},{"line":150,"address":[8856265],"length":1,"stats":{"Line":0}},{"line":152,"address":[8856354,8856470,8856283],"length":1,"stats":{"Line":2}},{"line":155,"address":[8856303,8856504],"length":1,"stats":{"Line":2}},{"line":156,"address":[8856512],"length":1,"stats":{"Line":1}},{"line":157,"address":[9353373],"length":1,"stats":{"Line":1}},{"line":159,"address":[9353634,9349685],"length":1,"stats":{"Line":0}},{"line":162,"address":[9353397],"length":1,"stats":{"Line":1}},{"line":165,"address":[11409408],"length":1,"stats":{"Line":1}},{"line":166,"address":[11410638,11410026,11410542,11410095,11410191,11409878,11410350,11410446,11410734,11410830,11409547,11410922,11410151],"length":1,"stats":{"Line":13}},{"line":172,"address":[8858944],"length":1,"stats":{"Line":1}},{"line":173,"address":[8858949],"length":1,"stats":{"Line":1}},{"line":177,"address":[8858960,8865037],"length":1,"stats":{"Line":1}},{"line":183,"address":[9380034,9379678,9380080,9380375,9379326,9379844,9379925],"length":1,"stats":{"Line":7}},{"line":184,"address":[9379968],"length":1,"stats":{"Line":1}},{"line":187,"address":[9380775,9379982,9380704],"length":1,"stats":{"Line":2}},{"line":188,"address":[9380749,9380885,9380819],"length":1,"stats":{"Line":2}},{"line":189,"address":[9380873,9380901],"length":1,"stats":{"Line":1}},{"line":191,"address":[8860986,8860742],"length":1,"stats":{"Line":2}},{"line":193,"address":[9381071],"length":1,"stats":{"Line":1}},{"line":194,"address":[9381092],"length":1,"stats":{"Line":1}},{"line":195,"address":[9381136,9381310,9385253,9381217],"length":1,"stats":{"Line":3}},{"line":197,"address":[9385051,9381438],"length":1,"stats":{"Line":0}},{"line":198,"address":[9385208,9385258],"length":1,"stats":{"Line":0}},{"line":200,"address":[8861183],"length":1,"stats":{"Line":1}},{"line":202,"address":[9381392,9381480],"length":1,"stats":{"Line":2}},{"line":203,"address":[8861437,8861318],"length":1,"stats":{"Line":1}},{"line":204,"address":[9381707,9381604],"length":1,"stats":{"Line":2}},{"line":206,"address":[8861887,8861292,8861601],"length":1,"stats":{"Line":2}},{"line":207,"address":[9383165],"length":1,"stats":{"Line":7}},{"line":214,"address":[8864775,8862725],"length":1,"stats":{"Line":2}},{"line":215,"address":[8863650],"length":1,"stats":{"Line":1}},{"line":217,"address":[8863754],"length":1,"stats":{"Line":1}},{"line":219,"address":[8864046,8863872,8864003],"length":1,"stats":{"Line":2}},{"line":220,"address":[9384657,9384528],"length":1,"stats":{"Line":2}},{"line":221,"address":[9384244,9384309],"length":1,"stats":{"Line":2}},{"line":222,"address":[8864290],"length":1,"stats":{"Line":1}},{"line":224,"address":[8864639,8864451],"length":1,"stats":{"Line":2}},{"line":225,"address":[8864587],"length":1,"stats":{"Line":1}},{"line":226,"address":[8864741,8864661],"length":1,"stats":{"Line":1}},{"line":227,"address":[9384950],"length":1,"stats":{"Line":1}},{"line":229,"address":[9384152,9384071,9384200],"length":1,"stats":{"Line":0}},{"line":232,"address":[8864780,8864715,8864767],"length":1,"stats":{"Line":2}},{"line":235,"address":[8863599],"length":1,"stats":{"Line":1}},{"line":240,"address":[8865351,8865072],"length":1,"stats":{"Line":1}},{"line":244,"address":[11411435],"length":1,"stats":{"Line":1}},{"line":245,"address":[8865304,8865130,8865194],"length":1,"stats":{"Line":3}},{"line":246,"address":[11411653],"length":1,"stats":{"Line":1}},{"line":248,"address":[8865265],"length":1,"stats":{"Line":1}},{"line":252,"address":[11411728,11414211],"length":1,"stats":{"Line":1}},{"line":253,"address":[8865423,8865739,8865933],"length":1,"stats":{"Line":3}},{"line":255,"address":[11412000,11411883],"length":1,"stats":{"Line":2}},{"line":259,"address":[11412660,11412802,11412344],"length":1,"stats":{"Line":3}},{"line":261,"address":[11412452,11412569],"length":1,"stats":{"Line":2}},{"line":264,"address":[8866467],"length":1,"stats":{"Line":1}},{"line":265,"address":[11412868],"length":1,"stats":{"Line":1}},{"line":267,"address":[8866564,8866674,8866868],"length":1,"stats":{"Line":3}},{"line":268,"address":[11413244,11413495],"length":1,"stats":{"Line":2}},{"line":269,"address":[11413503],"length":1,"stats":{"Line":1}},{"line":273,"address":[11413939,11413763,11413540,11413623],"length":1,"stats":{"Line":4}},{"line":274,"address":[11413947],"length":1,"stats":{"Line":1}},{"line":276,"address":[11413977],"length":1,"stats":{"Line":1}},{"line":277,"address":[8867800],"length":1,"stats":{"Line":1}},{"line":278,"address":[11414183],"length":1,"stats":{"Line":1}},{"line":280,"address":[11414112],"length":1,"stats":{"Line":1}},{"line":281,"address":[11414131],"length":1,"stats":{"Line":1}},{"line":285,"address":[11413194,11413279],"length":1,"stats":{"Line":2}},{"line":293,"address":[11414240],"length":1,"stats":{"Line":0}},{"line":299,"address":[11414272],"length":1,"stats":{"Line":0}},{"line":300,"address":[11414277],"length":1,"stats":{"Line":0}}],"covered":99,"coverable":126},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","recursive_prover","mod.rs"],"content":"pub mod prover;\npub mod recursive_circuit;\n","traces":[],"covered":0,"coverable":0},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","recursive_prover","prover.rs"],"content":"use plonky2::{\n    hash::{\n        hash_types::{HashOut, RichField},\n        poseidon::PoseidonHash,\n    },\n    iop::witness::PartialWitness,\n    plonk::{\n        circuit_data::{CircuitData, VerifierOnlyCircuitData},\n        config::{AlgebraicHasher, GenericConfig, Hasher},\n        proof::ProofWithPublicInputs,\n        prover::prove,\n    },\n};\nuse plonky2_field::extension::Extendable;\n\nuse tracing::error;\n\nuse crate::{\n    circuit_utils::prove_timing,\n    types::{D, F},\n};\n\nuse super::recursive_circuit::RecursiveTargets;\n\npub struct RecursiveProver\u003cC: GenericConfig\u003cD, F = F\u003e, const N: usize\u003e {\n    // pub batch_id: usize,\n    pub sub_proofs: [ProofWithPublicInputs\u003cF, C, D\u003e; N],\n    pub sub_circuit_vd: VerifierOnlyCircuitData\u003cC, D\u003e,\n}\n\nimpl\u003cC: GenericConfig\u003cD, F = F\u003e, const N: usize\u003e RecursiveProver\u003cC, N\u003e {\n    /// Get proof with a pre-compiled merkle sum circuit and recursive targets. In this method we do not need to build the circuit as we use a pre-built circuit.\n    pub fn get_proof_with_circuit_data(\n        \u0026self,\n        recursive_targets: RecursiveTargets\u003cN\u003e,\n        cd: \u0026CircuitData\u003cF, C, D\u003e,\n    ) -\u003e ProofWithPublicInputs\u003cF, C, D\u003e\n    where\n        \u003cC as GenericConfig\u003c2\u003e\u003e::Hasher: AlgebraicHasher\u003cF\u003e,\n    {\n        let mut pw = PartialWitness::\u003cF\u003e::new();\n        let CircuitData { prover_only, common, .. } = \u0026cd;\n\n        recursive_targets.set_targets(\u0026mut pw, self.sub_proofs.to_vec(), \u0026self.sub_circuit_vd);\n\n        let mut t = prove_timing();\n        let proof_res = prove(prover_only, common, pw, \u0026mut t);\n\n        match proof_res {\n            Ok(proof) =\u003e {\n                let proof_verification_res = cd.verify(proof.clone());\n                match proof_verification_res {\n                    Ok(_) =\u003e proof,\n                    Err(e) =\u003e {\n                        error!(\"Proof verification failed: {:?}\", e);\n                        panic!(\"Proof verification failed!\");\n                    }\n                }\n            }\n            Err(e) =\u003e {\n                error!(\"Proof generation failed: {:?}\", e);\n                panic!(\"Proof generation failed!\");\n            }\n        }\n    }\n}\n\npub fn hash_n_subhashes\u003cF: RichField + Extendable\u003cD\u003e, const D: usize\u003e(\n    hashes: \u0026Vec\u003cHashOut\u003cF\u003e\u003e,\n) -\u003e HashOut\u003cF\u003e {\n    let inputs: Vec\u003cF\u003e = hashes.iter().map(|h| h.elements.to_vec()).flatten().collect();\n    let hash = PoseidonHash::hash_no_pad(inputs.as_slice());\n    hash\n}\n","traces":[{"line":33,"address":[9342009,9343470,9339472],"length":1,"stats":{"Line":0}},{"line":41,"address":[9339527],"length":1,"stats":{"Line":0}},{"line":42,"address":[],"length":0,"stats":{"Line":0}},{"line":44,"address":[],"length":0,"stats":{"Line":0}},{"line":46,"address":[],"length":0,"stats":{"Line":0}},{"line":47,"address":[],"length":0,"stats":{"Line":0}},{"line":49,"address":[9339905],"length":1,"stats":{"Line":0}},{"line":50,"address":[],"length":0,"stats":{"Line":0}},{"line":51,"address":[],"length":0,"stats":{"Line":0}},{"line":52,"address":[],"length":0,"stats":{"Line":0}},{"line":53,"address":[],"length":0,"stats":{"Line":0}},{"line":54,"address":[],"length":0,"stats":{"Line":0}},{"line":55,"address":[9341540,9341731,9341211,9341473,9341344,9340596,9341012],"length":1,"stats":{"Line":0}},{"line":56,"address":[],"length":0,"stats":{"Line":0}},{"line":60,"address":[9340016],"length":1,"stats":{"Line":0}},{"line":61,"address":[],"length":0,"stats":{"Line":0}},{"line":62,"address":[],"length":0,"stats":{"Line":0}},{"line":68,"address":[11414288,11414523],"length":1,"stats":{"Line":1}},{"line":71,"address":[],"length":0,"stats":{"Line":3}},{"line":72,"address":[],"length":0,"stats":{"Line":2}},{"line":73,"address":[],"length":0,"stats":{"Line":0}}],"covered":3,"coverable":21},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","recursive_prover","recursive_circuit.rs"],"content":"use plonky2::{\n    iop::{\n        target::Target,\n        witness::{PartialWitness, WitnessWrite},\n    },\n    plonk::{\n        circuit_builder::CircuitBuilder,\n        circuit_data::{\n            CircuitConfig, CircuitData, CommonCircuitData, VerifierCircuitTarget,\n            VerifierOnlyCircuitData,\n        },\n        config::{AlgebraicHasher, GenericConfig},\n        proof::{ProofWithPublicInputs, ProofWithPublicInputsTarget},\n    },\n};\n\nuse crate::merkle_sum_prover::circuits::merkle_sum_circuit::MerkleSumNodeTarget;\n\nuse crate::types::{C, D, F};\n\n/// Struct representing the targets of a recusive circuit. Since we have the same type of subproofs, we only need one type of verifier circuit as\n/// we can verify all the targets using the same circuit.\n#[derive(Clone)]\npub struct RecursiveTargets\u003cconst N: usize\u003e {\n    pub proof_with_pub_input_targets: Vec\u003cProofWithPublicInputsTarget\u003cD\u003e\u003e,\n    pub verifier_circuit_target: VerifierCircuitTarget, // Only one needed instead of N\n}\n\nimpl\u003cconst N: usize\u003e RecursiveTargets\u003cN\u003e {\n    pub fn pub_input_hash_offset() -\u003e std::ops::Range\u003cusize\u003e {\n        // the hash offset of recursive pub input is the same as the merkle sum tree node target\n        MerkleSumNodeTarget::pub_input_root_hash_offset()\n    }\n\n    #[inline]\n    pub fn pub_input_equity_offset() -\u003e usize {\n        MerkleSumNodeTarget::pub_input_equity_offset()\n    }\n\n    #[inline]\n    pub fn pub_input_debt_offset() -\u003e usize {\n        MerkleSumNodeTarget::pub_input_debt_offset()\n    }\n\n    /// Builds a N-ary merkle sum tree and sets its root as a public input. We use a N-ary merkle sum tree instead of the binary one since it requires less hash gates.\n    pub fn build_recursive_merkle_sum_tree_circuit(\u0026mut self, builder: \u0026mut CircuitBuilder\u003cF, D\u003e) {\n        let mut merkle_sum_tree_node_targets: Vec\u003cMerkleSumNodeTarget\u003e = Vec::new();\n\n        (0..N).for_each(|i| {\n            let targets = std::mem::take(\u0026mut self.proof_with_pub_input_targets[i].public_inputs);\n            merkle_sum_tree_node_targets.push(MerkleSumNodeTarget::from(targets));\n        });\n\n        let parent_merkle_sum_node_target = MerkleSumNodeTarget::get_parent_from_children::\u003cN\u003e(\n            builder,\n            \u0026merkle_sum_tree_node_targets,\n        );\n\n        (0..N).for_each(|i| {\n            let public_input_target = Vec::\u003cTarget\u003e::from(merkle_sum_tree_node_targets[i]);\n            self.proof_with_pub_input_targets[i].public_inputs = public_input_target;\n        });\n\n        parent_merkle_sum_node_target.register_as_public_input(builder);\n    }\n\n    /// Sets recursive targets with values from subproof PIs and the verifier cd.\n    pub fn set_targets\u003cC: GenericConfig\u003cD, F = F\u003e\u003e(\n        \u0026self,\n        pw: \u0026mut PartialWitness\u003cF\u003e,\n        sub_proofs: Vec\u003cProofWithPublicInputs\u003cF, C, D\u003e\u003e,\n        inner_circuit_vd: \u0026VerifierOnlyCircuitData\u003cC, D\u003e,\n    ) where\n        C::Hasher: AlgebraicHasher\u003cF\u003e,\n    {\n        pw.set_verifier_data_target(\u0026self.verifier_circuit_target, inner_circuit_vd);\n\n        (0..N).for_each(|i| {\n            pw.set_proof_with_pis_target(\u0026self.proof_with_pub_input_targets[i], \u0026sub_proofs[i]);\n        });\n    }\n}\n\n/// We verify N subproofs in the circuit using the verifier CD. We also ensure the verifier data = constant vd_digest in the circuit to ensure the\n/// vd is embedded in circuit.\npub fn verify_n_subproof_circuit\u003c\n    // C: GenericConfig\u003cD, F = F\u003e,\n    InnerC: GenericConfig\u003cD, F = F\u003e,\n    const N: usize,\n\u003e(\n    builder: \u0026mut CircuitBuilder\u003cF, D\u003e,\n    subproof_common_cd: \u0026CommonCircuitData\u003cF, D\u003e,\n    subproof_verifier_cd: \u0026VerifierOnlyCircuitData\u003cInnerC, D\u003e,\n) -\u003e RecursiveTargets\u003cN\u003e\nwhere\n    InnerC::Hasher: AlgebraicHasher\u003cF\u003e,\n{\n    let verifier_circuit_targets = VerifierCircuitTarget {\n        constants_sigmas_cap: builder\n            .add_virtual_cap(subproof_common_cd.config.fri_config.cap_height),\n        circuit_digest: builder.add_virtual_hash(),\n    };\n\n    let vd_digest = subproof_verifier_cd.circuit_digest;\n    let vd_digest_target = builder.constant_hash(vd_digest);\n    builder.connect_hashes(verifier_circuit_targets.circuit_digest, vd_digest_target);\n\n    // _inner_verifier_circuit_data.circuit_digest;\n    let mut proof_with_pis_targets: Vec\u003cProofWithPublicInputsTarget\u003cD\u003e\u003e = vec![];\n    (0..N).for_each(|_| {\n        let proof_with_pub_input_target =\n            builder.add_virtual_proof_with_pis::\u003cInnerC\u003e(subproof_common_cd);\n        builder.verify_proof::\u003cInnerC\u003e(\n            \u0026proof_with_pub_input_target,\n            \u0026verifier_circuit_targets,\n            subproof_common_cd,\n        );\n        proof_with_pis_targets.push(proof_with_pub_input_target);\n    });\n\n    RecursiveTargets {\n        verifier_circuit_target: verifier_circuit_targets,\n        proof_with_pub_input_targets: proof_with_pis_targets,\n    }\n}\n\n/// build recursive circuit that proves N subproofs and geneate parent merkle sum node targets\n// This circuit hardcode the constraint that the verifier_circuit_target.circuit_digest must be equal to that inner_verifier_circuit_data.circuit_digest;\npub fn build_recursive_n_circuit\u003c\n    // C: GenericConfig\u003cD, F = F\u003e,\n    InnerC: GenericConfig\u003cD, F = F\u003e,\n    const N: usize,\n\u003e(\n    inner_common_circuit_data: \u0026CommonCircuitData\u003cF, D\u003e,\n    inner_verifier_circuit_data: \u0026VerifierOnlyCircuitData\u003cInnerC, D\u003e,\n    circuit_config: CircuitConfig,\n) -\u003e (CircuitData\u003cF, C, D\u003e, RecursiveTargets\u003cN\u003e)\nwhere\n    InnerC::Hasher: AlgebraicHasher\u003cF\u003e,\n{\n    let mut builder = CircuitBuilder::\u003cF, D\u003e::new(circuit_config);\n    let mut recursive_targets = verify_n_subproof_circuit(\n        \u0026mut builder,\n        inner_common_circuit_data,\n        inner_verifier_circuit_data,\n    );\n    recursive_targets.build_recursive_merkle_sum_tree_circuit(\u0026mut builder);\n    let circuit_data = builder.build::\u003cC\u003e();\n    (circuit_data, recursive_targets)\n}\n","traces":[{"line":30,"address":[8946352],"length":1,"stats":{"Line":0}},{"line":32,"address":[],"length":0,"stats":{"Line":0}},{"line":36,"address":[],"length":0,"stats":{"Line":0}},{"line":37,"address":[],"length":0,"stats":{"Line":0}},{"line":41,"address":[],"length":0,"stats":{"Line":0}},{"line":42,"address":[],"length":0,"stats":{"Line":0}},{"line":46,"address":[8946626,8946384],"length":1,"stats":{"Line":0}},{"line":47,"address":[],"length":0,"stats":{"Line":0}},{"line":49,"address":[],"length":0,"stats":{"Line":0}},{"line":50,"address":[],"length":0,"stats":{"Line":0}},{"line":51,"address":[],"length":0,"stats":{"Line":0}},{"line":55,"address":[],"length":0,"stats":{"Line":0}},{"line":56,"address":[],"length":0,"stats":{"Line":0}},{"line":59,"address":[],"length":0,"stats":{"Line":0}},{"line":60,"address":[],"length":0,"stats":{"Line":0}},{"line":61,"address":[],"length":0,"stats":{"Line":0}},{"line":64,"address":[],"length":0,"stats":{"Line":0}},{"line":68,"address":[8946032,8946191],"length":1,"stats":{"Line":0}},{"line":76,"address":[],"length":0,"stats":{"Line":0}},{"line":78,"address":[],"length":0,"stats":{"Line":0}},{"line":79,"address":[],"length":0,"stats":{"Line":0}},{"line":86,"address":[8948519,8947648],"length":1,"stats":{"Line":0}},{"line":99,"address":[],"length":0,"stats":{"Line":0}},{"line":101,"address":[],"length":0,"stats":{"Line":0}},{"line":104,"address":[],"length":0,"stats":{"Line":0}},{"line":105,"address":[8947935],"length":1,"stats":{"Line":0}},{"line":106,"address":[],"length":0,"stats":{"Line":0}},{"line":109,"address":[],"length":0,"stats":{"Line":0}},{"line":110,"address":[],"length":0,"stats":{"Line":0}},{"line":111,"address":[],"length":0,"stats":{"Line":0}},{"line":112,"address":[],"length":0,"stats":{"Line":0}},{"line":113,"address":[],"length":0,"stats":{"Line":0}},{"line":114,"address":[],"length":0,"stats":{"Line":0}},{"line":115,"address":[],"length":0,"stats":{"Line":0}},{"line":116,"address":[],"length":0,"stats":{"Line":0}},{"line":118,"address":[],"length":0,"stats":{"Line":0}},{"line":129,"address":[8947216,8947597],"length":1,"stats":{"Line":0}},{"line":141,"address":[],"length":0,"stats":{"Line":0}},{"line":143,"address":[],"length":0,"stats":{"Line":0}},{"line":144,"address":[],"length":0,"stats":{"Line":0}},{"line":145,"address":[],"length":0,"stats":{"Line":0}},{"line":147,"address":[],"length":0,"stats":{"Line":0}},{"line":148,"address":[],"length":0,"stats":{"Line":0}},{"line":149,"address":[],"length":0,"stats":{"Line":0}}],"covered":0,"coverable":44},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","types.rs"],"content":"use plonky2::plonk::{\n    circuit_data::{CommonCircuitData, VerifierOnlyCircuitData},\n    config::{GenericConfig, PoseidonGoldilocksConfig},\n    proof::ProofWithPublicInputs,\n};\n\n// Extension of size 2\npub const D: usize = 2;\n\n// Constrict our values to 62 bits.\npub const MAX_POSITIVE_AMOUNT_LOG: usize = 62;\n\n// Number of accounts in one merkle sum tree batch.\npub const MERKLE_SUM_TREE_BATCH_SIZE: usize = 1;\n\npub const ASSETS_KEY: \u0026str = \"assets\";\n\npub type C = PoseidonGoldilocksConfig;\npub type F = \u003cC as GenericConfig\u003cD\u003e\u003e::F;\n\npub type ProofTuple\u003cF, C, const D: usize\u003e =\n    (ProofWithPublicInputs\u003cF, C, D\u003e, VerifierOnlyCircuitData\u003cC, D\u003e, CommonCircuitData\u003cF, D\u003e);\n","traces":[],"covered":0,"coverable":0},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","src","util.rs"],"content":"use crate::types::F;\nuse plonky2::hash::hash_types::HashOut;\nuse plonky2_field::types::Field;\n\npub fn pad_to_multiple_of(n: usize, multiple: usize) -\u003e usize {\n    if multiple == 0 {\n        return n; // Avoid division by zero\n    }\n    let remainder = n % multiple;\n    if remainder == 0 {\n        n\n    } else {\n        n + multiple - remainder\n    }\n}\n\n/// node level is the level from tree root; the root node has level of 0;\n/// `node_idx` is the index of the nodes in a vector; the root node has the largest ndoe_idx\npub fn get_node_level(batch_size: usize, node_idx: usize) -\u003e usize {\n    let total_nums = 2 * batch_size - 1;\n    ((total_nums - node_idx) as f64).log(2.0).floor() as usize\n}\n\n/// Given a hash string, get a hashout\npub fn get_hash_from_hash_string(hash_string: String) -\u003e HashOut\u003cF\u003e {\n    let without_brackets = hash_string.trim_matches(|c| c == '[' || c == ']').to_string(); // Remove brackets\n\n    let hash_as_vec_f: Vec\u003cF\u003e = without_brackets\n        .split(',')\n        .map(|s| F::from_canonical_u64(s.parse::\u003cu64\u003e().unwrap()))\n        .collect();\n\n    if hash_as_vec_f.len() != 4 {\n        panic!(\"Incorrect format of hash\");\n    }\n\n    HashOut::from_vec(hash_as_vec_f)\n}\n\n#[cfg(test)]\npub mod test_util {\n    use plonky2::hash::hash_types::HashOut;\n\n    use crate::util::get_node_level;\n\n    use super::{get_hash_from_hash_string, pad_to_multiple_of};\n\n    #[test]\n    fn test_get_node_level() {\n        assert_eq!(get_node_level(8, 14), 0);\n        assert_eq!(get_node_level(8, 13), 1);\n        assert_eq!(get_node_level(8, 9), 2);\n        assert_eq!(get_node_level(8, 11), 2);\n        assert_eq!(get_node_level(8, 0), 3);\n        assert_eq!(get_node_level(8, 4), 3);\n        assert_eq!(get_node_level(8, 7), 3);\n    }\n\n    #[test]\n    fn test_pad_to_multiple_of() {\n        assert_eq!(pad_to_multiple_of(23, 4), 24);\n        assert_eq!(pad_to_multiple_of(24, 4), 24);\n        assert_eq!(pad_to_multiple_of(27, 4), 28);\n    }\n\n    #[test]\n    fn test_get_hash_from_hash_string() {\n        let hash = get_hash_from_hash_string(\"[0000,0000,0000,0000]\".to_string());\n        assert_eq!(hash, HashOut::ZERO);\n    }\n}\n","traces":[{"line":5,"address":[9672960],"length":1,"stats":{"Line":1}},{"line":6,"address":[11657976],"length":1,"stats":{"Line":1}},{"line":7,"address":[11657987],"length":1,"stats":{"Line":0}},{"line":9,"address":[11657999,11658027,11658050],"length":1,"stats":{"Line":2}},{"line":10,"address":[11658042,11658153,11658076],"length":1,"stats":{"Line":3}},{"line":11,"address":[11658071],"length":1,"stats":{"Line":1}},{"line":13,"address":[11658088,11658158],"length":1,"stats":{"Line":1}},{"line":19,"address":[11658176],"length":1,"stats":{"Line":1}},{"line":20,"address":[11658293,11658198],"length":1,"stats":{"Line":1}},{"line":21,"address":[11658313,11658452,11658272],"length":1,"stats":{"Line":2}},{"line":25,"address":[11659035,11658480],"length":1,"stats":{"Line":1}},{"line":26,"address":[11658510,11658586,11659072,11659085],"length":1,"stats":{"Line":4}},{"line":28,"address":[11658634,11658702],"length":1,"stats":{"Line":2}},{"line":30,"address":[11659155,11659136,11659323],"length":1,"stats":{"Line":3}},{"line":33,"address":[11658850,11658785],"length":1,"stats":{"Line":2}},{"line":34,"address":[11658988,11658914],"length":1,"stats":{"Line":0}},{"line":37,"address":[11658861],"length":1,"stats":{"Line":1}}],"covered":15,"coverable":17},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","tests","e2e.rs"],"content":"use plonky2_field::types::Field;\nuse zk_por_core::{\n    account::gen_accounts_with_random_data,\n    circuit_config::STANDARD_CONFIG,\n    circuit_registry::registry::CircuitRegistry,\n    e2e::{batch_prove_accounts, recursive_prove_subproofs},\n    types::F,\n};\n\nuse zk_por_tracing::{init_tracing, TraceConfig};\n\n#[test]\nfn test_prove() {\n    let cfg = TraceConfig {\n        prefix: \"zkpor\".to_string(),\n        dir: \"logs\".to_string(),\n        level: tracing::Level::DEBUG,\n        console: true,\n        flame: false,\n    };\n\n    {\n        init_tracing(cfg)\n    };\n\n    const RECURSION_BRANCHOUT_NUM: usize = 4;\n    let batch_size = 8;\n    let token_num = 4;\n\n    let circuit_registry = CircuitRegistry::\u003cRECURSION_BRANCHOUT_NUM\u003e::init(\n        batch_size,\n        token_num,\n        STANDARD_CONFIG,\n        vec![STANDARD_CONFIG; 2],\n    );\n\n    let proving_thread_num = 2;\n\n    // a total of 9 batches (3x3) to test for padding in each level.\n    let mut equity_sum = 0;\n    let mut debt_sum = 0;\n    let mut batch_proofs = vec![];\n    for _ in 0..3 {\n        let accounts = gen_accounts_with_random_data(batch_size * 3, 4);\n\n        equity_sum += accounts\n            .iter()\n            .map(|account| account.equity.iter().map(|e| e.0).sum::\u003cu64\u003e())\n            .sum::\u003cu64\u003e();\n        debt_sum += accounts\n            .iter()\n            .map(|account| account.debt.iter().map(|e| e.0).sum::\u003cu64\u003e())\n            .sum::\u003cu64\u003e();\n\n        let proofs =\n            batch_prove_accounts(\u0026circuit_registry, accounts, proving_thread_num, batch_size);\n        batch_proofs.extend(proofs.into_iter());\n    }\n\n    let root_proof = recursive_prove_subproofs(batch_proofs, \u0026circuit_registry, proving_thread_num);\n\n    tracing::debug!(\"equity_sum: {}, debt_sum: {}\", equity_sum, debt_sum);\n    assert_eq!(F::from_canonical_u64(equity_sum), root_proof.public_inputs[0],);\n    assert_eq!(F::from_canonical_u64(debt_sum), root_proof.public_inputs[1],);\n}\n","traces":[],"covered":0,"coverable":0},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","tests","recursive_circuit.rs"],"content":"use plonky2::{hash::hash_types::HashOut, plonk::proof::ProofWithPublicInputs};\nuse zk_por_core::{\n    account::gen_accounts_with_random_data,\n    circuit_config::STANDARD_CONFIG,\n    merkle_sum_prover::circuits::merkle_sum_circuit::build_merkle_sum_tree_circuit,\n    recursive_prover::{prover::RecursiveProver, recursive_circuit::RecursiveTargets},\n    types::{C, D, F},\n};\n\nuse zk_por_core::{\n    merkle_sum_prover::prover::MerkleSumTreeProver,\n    recursive_prover::{prover::hash_n_subhashes, recursive_circuit::build_recursive_n_circuit},\n};\n\nuse plonky2_field::types::Field;\n\n#[test]\nfn test() {\n    let batch_size = 4;\n    let token_num = 2;\n    const RECURSION_BRANCHOUT_NUM: usize = 8;\n\n    let accounts = gen_accounts_with_random_data(batch_size, token_num);\n\n    let equity_sum = accounts\n        .iter()\n        .fold(F::ZERO, |acc, x| acc + x.equity.iter().fold(F::ZERO, |acc_2, y| acc_2 + *y));\n\n    let debt_sum = accounts\n        .iter()\n        .fold(F::ZERO, |acc, x| acc + x.debt.iter().fold(F::ZERO, |acc_2, y| acc_2 + *y));\n\n    let start = std::time::Instant::now();\n    let (merkle_sum_circuit, account_targets) =\n        build_merkle_sum_tree_circuit(batch_size, token_num, STANDARD_CONFIG);\n    println!(\"build merkle sum tree circuit in : {:?}\", start.elapsed());\n\n    let prover = MerkleSumTreeProver { accounts };\n\n    let start = std::time::Instant::now();\n    let merkle_sum_proof =\n        prover.get_proof_with_circuit_data(account_targets.as_slice(), \u0026merkle_sum_circuit);\n    println!(\"prove merkle sum tree in : {:?}\", start.elapsed());\n\n    let sub_proofs: [ProofWithPublicInputs\u003cF, C, D\u003e; RECURSION_BRANCHOUT_NUM] =\n        std::array::from_fn(|_| merkle_sum_proof.clone());\n\n    let start = std::time::Instant::now();\n    let (recursive_circuit, recursive_targets) =\n        build_recursive_n_circuit::\u003cC, RECURSION_BRANCHOUT_NUM\u003e(\n            \u0026merkle_sum_circuit.common,\n            \u0026merkle_sum_circuit.verifier_only,\n            STANDARD_CONFIG,\n        );\n    println!(\"build recursive N circuit in : {:?}\", start.elapsed());\n\n    let start = std::time::Instant::now();\n    let hash_offset = RecursiveTargets::\u003cRECURSION_BRANCHOUT_NUM\u003e::pub_input_hash_offset();\n    let subhashes = sub_proofs\n        .clone()\n        .map(|proof| HashOut::\u003cF\u003e::from_partial(\u0026proof.public_inputs[hash_offset.clone()]));\n    let recursive_prover = RecursiveProver {\n        sub_proofs: sub_proofs,\n        sub_circuit_vd: merkle_sum_circuit.verifier_only.clone(),\n    };\n    let recursive_proof_result =\n        recursive_prover.get_proof_with_circuit_data(recursive_targets, \u0026recursive_circuit);\n    println!(\"prove recursive subproofs in : {:?}\", start.elapsed());\n\n    let expected_hash = hash_n_subhashes::\u003cF, D\u003e(\u0026subhashes.to_vec());\n    let actual_hash =\n        HashOut::\u003cF\u003e::from_partial(\u0026recursive_proof_result.public_inputs[hash_offset]);\n\n    assert_eq!(expected_hash, actual_hash);\n\n    // print public inputs in recursive proof\n    assert_eq!(\n        equity_sum * F::from_canonical_u32(RECURSION_BRANCHOUT_NUM as u32),\n        recursive_proof_result.public_inputs[0]\n    );\n    assert_eq!(\n        debt_sum * F::from_canonical_u32(RECURSION_BRANCHOUT_NUM as u32),\n        recursive_proof_result.public_inputs[1]\n    );\n}\n","traces":[],"covered":0,"coverable":0},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-core","tests","registry.rs"],"content":"use plonky2_field::types::Field;\nuse zk_por_core::{circuit_registry::registry::CircuitRegistry, types::F};\n\n#[test]\nfn test() {\n    let batch_circuit_config = zk_por_core::circuit_config::STANDARD_CONFIG;\n    let recursive_levels = 2;\n    let recursive_level_configs = vec![zk_por_core::circuit_config::STANDARD_CONFIG; 2];\n\n    let registry =\n        CircuitRegistry::\u003c2\u003e::init(1024, 2, batch_circuit_config, recursive_level_configs);\n\n    let batch_circuit = registry.get_batch_circuit().0;\n    let batch_proof =\n        registry.get_empty_proof(\u0026batch_circuit.verifier_only.circuit_digest).unwrap().clone();\n\n    assert_eq!(recursive_levels, registry.get_recursive_levels());\n    assert_eq!(F::ZERO, batch_proof.public_inputs[0]);\n    assert_eq!(F::ZERO, batch_proof.public_inputs[1]);\n    assert!(batch_circuit.verify(batch_proof).is_ok());\n    let mut inner_vd_digest = batch_circuit.verifier_only.circuit_digest;\n\n    for _ in 0..recursive_levels {\n        let recursive_circuit = registry.get_recursive_circuit(\u0026inner_vd_digest).unwrap().0;\n        let recursive_empty_proof =\n            registry.get_empty_proof(\u0026recursive_circuit.verifier_only.circuit_digest).unwrap();\n\n        assert_eq!(F::ZERO, recursive_empty_proof.public_inputs[0]);\n        assert_eq!(F::ZERO, recursive_empty_proof.public_inputs[1]);\n        assert!(recursive_circuit.verify(recursive_empty_proof.clone()).is_ok());\n\n        inner_vd_digest = recursive_circuit.verifier_only.circuit_digest;\n    }\n    let root_circuit = registry.get_root_circuit();\n    assert_eq!(inner_vd_digest, root_circuit.verifier_only.circuit_digest);\n}\n","traces":[],"covered":0,"coverable":0},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-db","src","lib.rs"],"content":"extern crate leveldb;\nextern crate tempdir;\n\nuse leveldb::{\n    database::{\n        batch::{Batch, Writebatch},\n        Database,\n    },\n    kv::KV,\n    options::{Options, ReadOptions, WriteOptions},\n};\nuse tracing::warn;\n\npub struct LevelDb\u003cK: db_key::Key\u003e {\n    db: Database\u003cK\u003e,\n}\n\nimpl\u003cK: db_key::Key\u003e LevelDb\u003cK\u003e {\n    pub fn new(db_path: \u0026std::path::PathBuf) -\u003e Self {\n        let mut options = Options::new();\n        options.create_if_missing = true;\n\n        let database = match Database::\u003cK\u003e::open(db_path, options) {\n            Ok(db) =\u003e db,\n            Err(e) =\u003e {\n                panic!(\"Failed to open database: {:?}\", e);\n            }\n        };\n        Self { db: database }\n    }\n\n    pub fn put(\u0026self, key: K, val: \u0026[u8]) {\n        let write_opts = WriteOptions::new();\n\n        match self.db.put(write_opts, key, val) {\n            Ok(_) =\u003e (),\n            Err(e) =\u003e panic!(\"Failed to write key-value pair: {:?}\", e),\n        }\n    }\n\n    /// input is a vector of (k,v) tuple\n    pub fn batch_put(\u0026self, batches: Vec\u003c(K, Vec\u003cu8\u003e)\u003e) {\n        let mut batch = Writebatch::\u003cK\u003e::new();\n        batches.into_iter().for_each(|(k, v)| {\n            batch.put(k, v.as_ref());\n        });\n\n        match self.db.write(WriteOptions::new(), \u0026batch) {\n            Ok(_) =\u003e (),\n            Err(e) =\u003e panic!(\"Batch write failed: {}\", e),\n        }\n    }\n\n    pub fn get(\u0026self, key: K) -\u003e Option\u003cVec\u003cu8\u003e\u003e {\n        let read_opts = ReadOptions::new();\n        match self.db.get(read_opts, key) {\n            Ok(val) =\u003e val,\n            Err(e) =\u003e {\n                warn!(\"Failed to read value: {:?}\", e);\n                None\n            }\n        }\n    }\n\n    pub fn delete(\u0026self, key: K) {\n        let write_opts = WriteOptions::new();\n        match self.db.delete(write_opts, key) {\n            Ok(_) =\u003e (),\n            Err(e) =\u003e warn!(\"Failed to delete key: {:?}\", e),\n        }\n    }\n}\n\n#[cfg(test)]\nmod test {\n\n    use tempdir::TempDir;\n\n    use crate::LevelDb;\n\n    #[test]\n    fn test_db_i32() {\n        let tempdir = TempDir::new(\"example\").unwrap();\n        let db = LevelDb::\u003ci32\u003e::new(\u0026tempdir.path().to_path_buf());\n        db.put(1, b\"hello\");\n        db.put(2, b\"world\");\n        let ret = db.get(1).unwrap();\n\n        assert_eq!(ret, b\"hello\");\n        db.delete(1);\n        let ret = db.get(1);\n        assert_eq!(ret, None);\n        db.delete(2);\n    }\n}\n","traces":[{"line":19,"address":[8788944,8790182,8789542,8789584],"length":1,"stats":{"Line":3}},{"line":20,"address":[785869],"length":1,"stats":{"Line":3}},{"line":21,"address":[785904],"length":1,"stats":{"Line":3}},{"line":23,"address":[],"length":0,"stats":{"Line":6}},{"line":24,"address":[],"length":0,"stats":{"Line":3}},{"line":25,"address":[8789903,8789263],"length":1,"stats":{"Line":0}},{"line":26,"address":[11341580,11342220],"length":1,"stats":{"Line":0}},{"line":32,"address":[],"length":0,"stats":{"Line":1}},{"line":33,"address":[],"length":0,"stats":{"Line":2}},{"line":35,"address":[],"length":0,"stats":{"Line":1}},{"line":36,"address":[],"length":0,"stats":{"Line":0}},{"line":37,"address":[786710,786843],"length":1,"stats":{"Line":0}},{"line":42,"address":[11343008,11343637,11342937,11342336,11342965,11343609],"length":1,"stats":{"Line":2}},{"line":43,"address":[],"length":0,"stats":{"Line":4}},{"line":44,"address":[],"length":0,"stats":{"Line":8}},{"line":45,"address":[11343722,11343946,11344124,11343858],"length":1,"stats":{"Line":2}},{"line":48,"address":[],"length":0,"stats":{"Line":2}},{"line":49,"address":[],"length":0,"stats":{"Line":0}},{"line":50,"address":[],"length":0,"stats":{"Line":0}},{"line":54,"address":[11337152,11339072,11339048,11340931],"length":1,"stats":{"Line":3}},{"line":55,"address":[],"length":0,"stats":{"Line":3}},{"line":56,"address":[],"length":0,"stats":{"Line":3}},{"line":57,"address":[],"length":0,"stats":{"Line":3}},{"line":58,"address":[11339340,11337452],"length":1,"stats":{"Line":0}},{"line":59,"address":[11338402,11339590,11340172,11338097,11340290,11340421,11340488,11340678,11338794,11339985,11338284,11337702,11338536,11338603],"length":1,"stats":{"Line":0}},{"line":60,"address":[788267],"length":1,"stats":{"Line":0}},{"line":65,"address":[],"length":0,"stats":{"Line":1}},{"line":66,"address":[788879,788964],"length":1,"stats":{"Line":2}},{"line":67,"address":[788976],"length":1,"stats":{"Line":1}},{"line":68,"address":[],"length":0,"stats":{"Line":0}},{"line":69,"address":[789668,789967,790327,789855,789042,789225,790077,790141],"length":1,"stats":{"Line":0}}],"covered":20,"coverable":31},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-tracing","src","lib.rs"],"content":"pub mod opentelemetry;\n\nuse crate::opentelemetry::exporter::stdout;\nuse tracing::Level;\npub use tracing_appender::non_blocking::WorkerGuard;\nuse tracing_appender::rolling;\nuse tracing_flame::FlameLayer;\nuse tracing_opentelemetry::OpenTelemetryLayer;\nuse tracing_subscriber::{fmt, prelude::*};\n\n#[derive(Debug)]\npub struct TraceConfig {\n    pub prefix: String,\n    pub dir: String,\n    pub level: Level,\n    pub console: bool,\n    pub flame: bool,\n}\n\npub fn init_tracing(config: TraceConfig) -\u003e Vec\u003cWorkerGuard\u003e {\n    let prefix = config.prefix;\n    let dir = config.dir;\n    let level = config.level;\n    let console = config.console;\n    let flame = config.flame;\n\n    let mut guards = vec![];\n    let (fmt_writer, fmt_guard) = tracing_appender::non_blocking(rolling::daily(\u0026dir, \u0026prefix));\n    guards.push(fmt_guard);\n    let (telemetry_writer, telemetry_guard) =\n        tracing_appender::non_blocking(rolling::daily(\u0026dir, prefix.clone() + \".telemetry\"));\n    guards.push(telemetry_guard);\n    let tracer = stdout::new_pipeline().with_writer(telemetry_writer).install_simple();\n    let layered = tracing_subscriber::fmt()\n        .with_max_level(level)\n        .with_writer(fmt_writer)\n        .with_ansi(false)\n        .finish()\n        .with(OpenTelemetryLayer::new(tracer));\n    if flame {\n        let (folded_writer, folded_guard) =\n            tracing_appender::non_blocking(rolling::daily(\u0026dir, prefix.clone() + \".folded\"));\n        guards.push(folded_guard);\n        if console {\n            layered.with(fmt::Layer::default()).with(FlameLayer::new(folded_writer)).init();\n        } else {\n            layered.with(FlameLayer::new(folded_writer)).init()\n        }\n    } else if console {\n        layered.with(fmt::Layer::default()).init();\n    } else {\n        layered.init()\n    }\n\n    guards\n}\n","traces":[{"line":20,"address":[12669551,12667552,12670872],"length":1,"stats":{"Line":1}},{"line":21,"address":[4460431],"length":1,"stats":{"Line":1}},{"line":22,"address":[4460553],"length":1,"stats":{"Line":1}},{"line":23,"address":[4460571],"length":1,"stats":{"Line":1}},{"line":24,"address":[12667755],"length":1,"stats":{"Line":1}},{"line":25,"address":[4460603],"length":1,"stats":{"Line":1}},{"line":27,"address":[13632859],"length":1,"stats":{"Line":1}},{"line":28,"address":[4460747,4460690],"length":1,"stats":{"Line":2}},{"line":29,"address":[12668050],"length":1,"stats":{"Line":1}},{"line":30,"address":[13633377],"length":1,"stats":{"Line":1}},{"line":32,"address":[4461221],"length":1,"stats":{"Line":1}},{"line":33,"address":[4461362],"length":1,"stats":{"Line":1}},{"line":34,"address":[4461471,4461822,4461623,4461552],"length":1,"stats":{"Line":4}},{"line":36,"address":[4461559],"length":1,"stats":{"Line":1}},{"line":39,"address":[13634173,13635788,13633986],"length":1,"stats":{"Line":2}},{"line":40,"address":[4461881,4462935],"length":1,"stats":{"Line":1}},{"line":41,"address":[13634203,13634632],"length":1,"stats":{"Line":0}},{"line":43,"address":[4462502],"length":1,"stats":{"Line":0}},{"line":44,"address":[13634979],"length":1,"stats":{"Line":0}},{"line":45,"address":[4462754,4462958,4463298],"length":1,"stats":{"Line":0}},{"line":47,"address":[4462818,4462645,4462948],"length":1,"stats":{"Line":0}},{"line":49,"address":[4462594,4461889,4463326,4462919],"length":1,"stats":{"Line":1}},{"line":50,"address":[4461977,4462173],"length":1,"stats":{"Line":1}},{"line":52,"address":[4461922,4462082],"length":1,"stats":{"Line":0}},{"line":55,"address":[4462089],"length":1,"stats":{"Line":1}}],"covered":19,"coverable":25},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-tracing","src","opentelemetry","exporter","stdout.rs"],"content":"//! # Stdout Span Exporter\n//!\n//! The stdout [`SpanExporter`] writes debug printed [`Span`]s to its configured\n//! [`Write`] instance. By default it will write to [`Stdout`].\n//!\n//! [`SpanExporter`]: super::SpanExporter\n//! [`Span`]: crate::trace::Span\n//! [`Write`]: Write\n//! [`Stdout`]: Stdout\n//!\n//! # Examples\n//!\n//! ```no_run\n//! use opentelemetry::trace::Tracer;\n//! use opentelemetry::sdk::export::trace::stdout;\n//! use opentelemetry::global::shutdown_tracer_provider;\n//!\n//! fn main() {\n//!     let tracer = stdout::new_pipeline()\n//!         .with_pretty_print(true)\n//!         .install_simple();\n//!\n//!     tracer.in_span(\"doing_work\", |cx| {\n//!         // Traced app logic here...\n//!     });\n//!\n//!     shutdown_tracer_provider(); // sending remaining spans\n//! }\n//! ```\n#![allow(clippy::needless_doctest_main)]\nuse async_trait::async_trait;\nuse opentelemetry::{\n    global, sdk,\n    sdk::export::{\n        trace::{ExportResult, SpanData, SpanExporter},\n        ExportError,\n    },\n    trace::TracerProvider,\n};\nuse std::{\n    fmt::Debug,\n    io::{stdout, Stdout, Write},\n};\n\n/// Pipeline builder\n#[derive(Debug)]\npub struct PipelineBuilder\u003cW: Write\u003e {\n    pretty_print: bool,\n    trace_config: Option\u003csdk::trace::Config\u003e,\n    writer: W,\n}\n\n/// Create a new stdout exporter pipeline builder.\npub fn new_pipeline() -\u003e PipelineBuilder\u003cStdout\u003e {\n    PipelineBuilder::default()\n}\n\nimpl Default for PipelineBuilder\u003cStdout\u003e {\n    /// Return the default pipeline builder.\n    fn default() -\u003e Self {\n        Self { pretty_print: false, trace_config: None, writer: stdout() }\n    }\n}\n\nimpl\u003cW: Write\u003e PipelineBuilder\u003cW\u003e {\n    /// Specify the pretty print setting.\n    pub fn with_pretty_print(mut self, pretty_print: bool) -\u003e Self {\n        self.pretty_print = pretty_print;\n        self\n    }\n\n    /// Assign the SDK trace configuration.\n    pub fn with_trace_config(mut self, config: sdk::trace::Config) -\u003e Self {\n        self.trace_config = Some(config);\n        self\n    }\n\n    /// Specify the writer to use.\n    pub fn with_writer\u003cT: Write\u003e(self, writer: T) -\u003e PipelineBuilder\u003cT\u003e {\n        PipelineBuilder { pretty_print: self.pretty_print, trace_config: self.trace_config, writer }\n    }\n}\n\nimpl\u003cW\u003e PipelineBuilder\u003cW\u003e\nwhere\n    W: Write + Debug + Send + 'static,\n{\n    /// Install the stdout exporter pipeline with the recommended defaults.\n    pub fn install_simple(mut self) -\u003e sdk::trace::Tracer {\n        let exporter = Exporter::new(self.writer, self.pretty_print);\n\n        let mut provider_builder =\n            sdk::trace::TracerProvider::builder().with_simple_exporter(exporter);\n        if let Some(config) = self.trace_config.take() {\n            provider_builder = provider_builder.with_config(config);\n        }\n        let provider = provider_builder.build();\n\n        let tracer =\n            provider.versioned_tracer(\"opentelemetry\", Some(env!(\"CARGO_PKG_VERSION\")), None);\n        let _ = global::set_tracer_provider(provider);\n\n        tracer\n    }\n}\n\n/// A [`SpanExporter`] that writes to [`Stdout`] or other configured [`Write`].\n///\n/// [`SpanExporter`]: super::SpanExporter\n/// [`Write`]: Write\n/// [`Stdout`]: Stdout\n#[derive(Debug)]\npub struct Exporter\u003cW: Write\u003e {\n    writer: W,\n    pretty_print: bool,\n}\n\nimpl\u003cW: Write\u003e Exporter\u003cW\u003e {\n    /// Create a new stdout `Exporter`.\n    pub fn new(writer: W, pretty_print: bool) -\u003e Self {\n        Self { writer, pretty_print }\n    }\n}\n\n#[async_trait]\nimpl\u003cW\u003e SpanExporter for Exporter\u003cW\u003e\nwhere\n    W: Write + Debug + Send + 'static,\n{\n    /// Export spans to stdout\n    async fn export(\u0026mut self, batch: Vec\u003cSpanData\u003e) -\u003e ExportResult {\n        for span in batch {\n            let json = if self.pretty_print {\n                serde_json::to_string_pretty(\u0026span).map_err::\u003cError, _\u003e(Into::into)?\n            } else {\n                serde_json::to_string(\u0026span).map_err::\u003cError, _\u003e(Into::into)?\n            };\n            self.writer.write_all(json.as_bytes()).map_err::\u003cError, _\u003e(Into::into)?;\n            self.writer.write_all(\"\\n\".as_bytes()).map_err::\u003cError, _\u003e(Into::into)?;\n        }\n\n        Ok(())\n    }\n}\n\n/// Stdout exporter's error\n#[derive(thiserror::Error, Debug)]\n#[error(transparent)]\nenum Error {\n    Json(#[from] serde_json::Error),\n    Io(#[from] std::io::Error),\n}\n\nimpl ExportError for Error {\n    fn exporter_name(\u0026self) -\u003e \u0026'static str {\n        \"stdout\"\n    }\n}\n","traces":[{"line":54,"address":[12864752],"length":1,"stats":{"Line":1}},{"line":55,"address":[13829832],"length":1,"stats":{"Line":1}},{"line":60,"address":[4298160,4298279],"length":1,"stats":{"Line":1}},{"line":61,"address":[13829869],"length":1,"stats":{"Line":1}},{"line":67,"address":[],"length":0,"stats":{"Line":0}},{"line":68,"address":[],"length":0,"stats":{"Line":0}},{"line":69,"address":[],"length":0,"stats":{"Line":0}},{"line":73,"address":[],"length":0,"stats":{"Line":0}},{"line":74,"address":[],"length":0,"stats":{"Line":0}},{"line":75,"address":[],"length":0,"stats":{"Line":0}},{"line":79,"address":[],"length":0,"stats":{"Line":1}},{"line":80,"address":[13830019],"length":1,"stats":{"Line":1}},{"line":89,"address":[4299754,4298432,4299686],"length":1,"stats":{"Line":1}},{"line":90,"address":[4298454,4298575],"length":1,"stats":{"Line":2}},{"line":92,"address":[13830340,13830283],"length":1,"stats":{"Line":2}},{"line":93,"address":[],"length":0,"stats":{"Line":0}},{"line":94,"address":[13830832,13830435,13830499],"length":1,"stats":{"Line":2}},{"line":95,"address":[4299090,4298904],"length":1,"stats":{"Line":0}},{"line":97,"address":[12865784,12865955],"length":1,"stats":{"Line":2}},{"line":99,"address":[4299335],"length":1,"stats":{"Line":1}},{"line":100,"address":[],"length":0,"stats":{"Line":0}},{"line":101,"address":[12866220,12866132],"length":1,"stats":{"Line":2}},{"line":103,"address":[13831332],"length":1,"stats":{"Line":1}},{"line":120,"address":[12866416],"length":1,"stats":{"Line":1}},{"line":131,"address":[],"length":0,"stats":{"Line":0}},{"line":132,"address":[],"length":0,"stats":{"Line":0}},{"line":133,"address":[13832953,13832530,13833250],"length":1,"stats":{"Line":0}},{"line":134,"address":[],"length":0,"stats":{"Line":0}},{"line":136,"address":[13832955,13833041,13832768,13832667],"length":1,"stats":{"Line":0}},{"line":138,"address":[13833021,13833525,13833375,13833847],"length":1,"stats":{"Line":0}},{"line":139,"address":[],"length":0,"stats":{"Line":0}},{"line":142,"address":[],"length":0,"stats":{"Line":0}},{"line":155,"address":[4299840],"length":1,"stats":{"Line":0}}],"covered":15,"coverable":33},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-tracing","src","opentelemetry","exporter.rs"],"content":"pub mod stdout;\n","traces":[],"covered":0,"coverable":0},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-tracing","src","opentelemetry.rs"],"content":"pub mod exporter;\n","traces":[],"covered":0,"coverable":0}]};
         var previousData = null;
     </script>
     <script crossorigin>/** @license React v16.13.1
