diff --git a/coverage-badge.svg b/coverage-badge.svg
index 8813d84..bb5f4ad 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 44.36%</text>
+  <text x="50%" y="50%" alignment-baseline="middle" text-anchor="middle" fill="#000" font-size="11" font-family="Verdana">Coverage 44.79%</text>
 </svg>
diff --git a/tarpaulin-report.html b/tarpaulin-report.html
index 8143103..f1ce116 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 USER_PROOF_DIRNAME: \u0026str = \"user_proofs\";\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":"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    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: ZkPorCommitCommands,\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 ZkPorCommitCommands {\n    fn execute(\u0026self) -\u003e std::result::Result\u003c(), PoRError\u003e {\n        match self {\n            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_file = PathBuf::from_str(\u0026output_path).unwrap();\n                prove(prover_cfg, output_file)\n            }\n\n            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)\n            }\n\n            ZkPorCommitCommands::VerifyUser { global_proof_path, user_proof_path_pattern } =\u003e {\n                let global_proof_path = PathBuf::from_str(\u0026global_proof_path).unwrap();\n                verify_user(global_proof_path, user_proof_path_pattern)\n            }\n        }\n    }\n}\n\nfn main() -\u003e std::result::Result\u003c(), PoRError\u003e {\n    let cli = Cli::parse();\n    let start = std::time::Instant::now();\n    let result = cli.command.execute();\n    println!(\"result: {:?}, elapsed: {:?}\", result, start.elapsed());\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_PROOF_FILENAME, RECURSION_BRANCHOUT_NUM, USER_PROOF_DIRNAME,\n};\nuse indicatif::ProgressBar;\nuse plonky2::hash::hash_types::HashOut;\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, 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    // 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":36,"address":[9224224],"length":1,"stats":{"Line":0}},{"line":37,"address":[9224248],"length":1,"stats":{"Line":0}},{"line":38,"address":[9224268],"length":1,"stats":{"Line":0}},{"line":39,"address":[9224328,9224300],"length":1,"stats":{"Line":0}},{"line":42,"address":[9224352,9225523],"length":1,"stats":{"Line":0}},{"line":43,"address":[9224382,9224535,9225552,9224448,9225560,9225521],"length":1,"stats":{"Line":0}},{"line":44,"address":[9224523,9224669,9225584,9225519,9225592],"length":1,"stats":{"Line":0}},{"line":46,"address":[9224958],"length":1,"stats":{"Line":0}},{"line":47,"address":[9225409],"length":1,"stats":{"Line":0}},{"line":48,"address":[9224967],"length":1,"stats":{"Line":0}},{"line":49,"address":[9225288],"length":1,"stats":{"Line":0}},{"line":51,"address":[9225026,9225162,9224975],"length":1,"stats":{"Line":0}},{"line":55,"address":[9224997],"length":1,"stats":{"Line":0}},{"line":58,"address":[9227063,9225616,9261985],"length":1,"stats":{"Line":0}},{"line":59,"address":[9225730],"length":1,"stats":{"Line":0}},{"line":61,"address":[9226011],"length":1,"stats":{"Line":0}},{"line":62,"address":[9226046,9226126],"length":1,"stats":{"Line":0}},{"line":63,"address":[9226298,9261718,9226174],"length":1,"stats":{"Line":0}},{"line":66,"address":[9226427,9226247,9227245],"length":1,"stats":{"Line":0}},{"line":67,"address":[9226898,9226665],"length":1,"stats":{"Line":0}},{"line":68,"address":[9226496],"length":1,"stats":{"Line":0}},{"line":69,"address":[9226601],"length":1,"stats":{"Line":0}},{"line":72,"address":[9227214,9226503],"length":1,"stats":{"Line":0}},{"line":75,"address":[9227266,9227029],"length":1,"stats":{"Line":0}},{"line":76,"address":[9227274],"length":1,"stats":{"Line":0}},{"line":77,"address":[9227321],"length":1,"stats":{"Line":0}},{"line":78,"address":[9227341],"length":1,"stats":{"Line":0}},{"line":83,"address":[9227542],"length":1,"stats":{"Line":0}},{"line":84,"address":[9227361],"length":1,"stats":{"Line":0}},{"line":86,"address":[9227475],"length":1,"stats":{"Line":0}},{"line":90,"address":[9227653],"length":1,"stats":{"Line":0}},{"line":92,"address":[9227716],"length":1,"stats":{"Line":0}},{"line":94,"address":[9227797],"length":1,"stats":{"Line":0}},{"line":102,"address":[9261671,9227963],"length":1,"stats":{"Line":0}},{"line":106,"address":[9227992],"length":1,"stats":{"Line":0}},{"line":108,"address":[9228031,9228095],"length":1,"stats":{"Line":0}},{"line":110,"address":[9228255,9228870,9229000,9229298,9229374,9229568,9228671],"length":1,"stats":{"Line":0}},{"line":118,"address":[9229065],"length":1,"stats":{"Line":0}},{"line":121,"address":[9231052],"length":1,"stats":{"Line":0}},{"line":129,"address":[9230825,9231859],"length":1,"stats":{"Line":0}},{"line":130,"address":[9231874],"length":1,"stats":{"Line":0}},{"line":131,"address":[9231886],"length":1,"stats":{"Line":0}},{"line":134,"address":[9231925],"length":1,"stats":{"Line":0}},{"line":135,"address":[9231944],"length":1,"stats":{"Line":0}},{"line":136,"address":[9232035,9231951],"length":1,"stats":{"Line":0}},{"line":137,"address":[9232056,9261514,9232159],"length":1,"stats":{"Line":0}},{"line":138,"address":[9232183,9253671,9253717],"length":1,"stats":{"Line":0}},{"line":139,"address":[9253738,9253678],"length":1,"stats":{"Line":0}},{"line":142,"address":[9253746],"length":1,"stats":{"Line":0}},{"line":144,"address":[9253822],"length":1,"stats":{"Line":0}},{"line":145,"address":[9253865],"length":1,"stats":{"Line":0}},{"line":146,"address":[9253955,9254203],"length":1,"stats":{"Line":0}},{"line":147,"address":[9254231,9254976,9254846,9255117,9255193,9255717,9254647],"length":1,"stats":{"Line":0}},{"line":148,"address":[9255041,9256018],"length":1,"stats":{"Line":0}},{"line":151,"address":[9256102,9253925],"length":1,"stats":{"Line":0}},{"line":153,"address":[9257051,9256436,9256852,9257322,9257398,9257181,9257812],"length":1,"stats":{"Line":0}},{"line":160,"address":[9257246,9258113],"length":1,"stats":{"Line":0}},{"line":162,"address":[9262191,9262128],"length":1,"stats":{"Line":0}},{"line":165,"address":[9258197,9258353],"length":1,"stats":{"Line":0}},{"line":166,"address":[9258369],"length":1,"stats":{"Line":0}},{"line":168,"address":[9258473,9258537],"length":1,"stats":{"Line":0}},{"line":170,"address":[9258545],"length":1,"stats":{"Line":0}},{"line":173,"address":[9262350,9262320,9262685],"length":1,"stats":{"Line":0}},{"line":174,"address":[9262397,9262449],"length":1,"stats":{"Line":0}},{"line":175,"address":[9262720,9262520,9262423,9262754],"length":1,"stats":{"Line":0}},{"line":176,"address":[9262764],"length":1,"stats":{"Line":0}},{"line":178,"address":[9262585],"length":1,"stats":{"Line":0}},{"line":181,"address":[9258693],"length":1,"stats":{"Line":0}},{"line":183,"address":[9258779],"length":1,"stats":{"Line":0}},{"line":186,"address":[9258874,9258938],"length":1,"stats":{"Line":0}},{"line":188,"address":[9262863,9259120,9262848],"length":1,"stats":{"Line":0}},{"line":189,"address":[9262908,9263018],"length":1,"stats":{"Line":0}},{"line":191,"address":[9262934],"length":1,"stats":{"Line":0}},{"line":192,"address":[9262964],"length":1,"stats":{"Line":0}},{"line":193,"address":[9263001],"length":1,"stats":{"Line":0}},{"line":194,"address":[9263110],"length":1,"stats":{"Line":0}},{"line":198,"address":[9259385],"length":1,"stats":{"Line":0}},{"line":200,"address":[9260205,9261105,9260018,9259623,9260317,9260435,9260499],"length":1,"stats":{"Line":0}},{"line":207,"address":[9260373],"length":1,"stats":{"Line":0}},{"line":208,"address":[9261469,9261411],"length":1,"stats":{"Line":0}},{"line":210,"address":[9232164],"length":1,"stats":{"Line":0}},{"line":212,"address":[9233560],"length":1,"stats":{"Line":0}},{"line":219,"address":[9233183,9234168],"length":1,"stats":{"Line":0}},{"line":221,"address":[9234192],"length":1,"stats":{"Line":0}},{"line":222,"address":[9234215],"length":1,"stats":{"Line":0}},{"line":223,"address":[9234237],"length":1,"stats":{"Line":0}},{"line":224,"address":[9234293,9234357],"length":1,"stats":{"Line":0}},{"line":227,"address":[9253538,9234365,9234573],"length":1,"stats":{"Line":0}},{"line":228,"address":[9234589,9245791],"length":1,"stats":{"Line":0}},{"line":229,"address":[9245806],"length":1,"stats":{"Line":0}},{"line":230,"address":[9245854,9246199],"length":1,"stats":{"Line":0}},{"line":233,"address":[9246108,9245979],"length":1,"stats":{"Line":0}},{"line":238,"address":[9246324],"length":1,"stats":{"Line":0}},{"line":240,"address":[9247360,9247436,9247850,9246507,9246923,9247122,9247252],"length":1,"stats":{"Line":0}},{"line":247,"address":[9247317,9248135],"length":1,"stats":{"Line":0}},{"line":248,"address":[9248389,9248182],"length":1,"stats":{"Line":0}},{"line":249,"address":[9249379,9249303,9249162,9248417,9248833,9249900,9249032],"length":1,"stats":{"Line":0}},{"line":251,"address":[9249227,9250201],"length":1,"stats":{"Line":0}},{"line":254,"address":[9248153,9250393],"length":1,"stats":{"Line":0}},{"line":255,"address":[9250409],"length":1,"stats":{"Line":0}},{"line":256,"address":[9250593,9250513,9263221,9263184],"length":1,"stats":{"Line":0}},{"line":257,"address":[9263231],"length":1,"stats":{"Line":0}},{"line":258,"address":[9263257],"length":1,"stats":{"Line":0}},{"line":260,"address":[9263294,9263426],"length":1,"stats":{"Line":0}},{"line":262,"address":[9250678],"length":1,"stats":{"Line":0}},{"line":265,"address":[9250712],"length":1,"stats":{"Line":0}},{"line":266,"address":[9250776],"length":1,"stats":{"Line":0}},{"line":272,"address":[9251309,9250919],"length":1,"stats":{"Line":0}},{"line":273,"address":[9250903],"length":1,"stats":{"Line":0}},{"line":275,"address":[9250983,9251081,9251210],"length":1,"stats":{"Line":0}},{"line":281,"address":[9251358,9251233],"length":1,"stats":{"Line":0}},{"line":283,"address":[9251385],"length":1,"stats":{"Line":0}},{"line":284,"address":[9251505],"length":1,"stats":{"Line":0}},{"line":286,"address":[9252185,9252728,9252514,9252652,9252384,9253245,9251769],"length":1,"stats":{"Line":0}},{"line":294,"address":[9234626,9234558],"length":1,"stats":{"Line":0}},{"line":295,"address":[9245697,9245579,9234663],"length":1,"stats":{"Line":0}},{"line":297,"address":[9234754,9234648],"length":1,"stats":{"Line":0}},{"line":300,"address":[9234842,9234762],"length":1,"stats":{"Line":0}},{"line":301,"address":[9234858],"length":1,"stats":{"Line":0}},{"line":303,"address":[9235042,9234927],"length":1,"stats":{"Line":0}},{"line":304,"address":[9235058],"length":1,"stats":{"Line":0}},{"line":305,"address":[9235162,9235258],"length":1,"stats":{"Line":0}},{"line":306,"address":[9235321],"length":1,"stats":{"Line":0}},{"line":308,"address":[9235355],"length":1,"stats":{"Line":0}},{"line":309,"address":[9235411,9235526,9235786],"length":1,"stats":{"Line":0}},{"line":310,"address":[9237008,9236134,9237342,9237084,9236749,9236550,9236879],"length":1,"stats":{"Line":0}},{"line":312,"address":[9237630,9236952],"length":1,"stats":{"Line":0}},{"line":314,"address":[9237595],"length":1,"stats":{"Line":0}},{"line":317,"address":[9238991],"length":1,"stats":{"Line":0}},{"line":323,"address":[9239450,9238665],"length":1,"stats":{"Line":0}},{"line":326,"address":[9239484],"length":1,"stats":{"Line":0}},{"line":339,"address":[9239887,9239728],"length":1,"stats":{"Line":0}},{"line":341,"address":[9239895],"length":1,"stats":{"Line":0}},{"line":342,"address":[9239996,9240075],"length":1,"stats":{"Line":0}},{"line":343,"address":[9241049,9241451,9240919,9241257,9240720,9240304,9241181],"length":1,"stats":{"Line":0}},{"line":344,"address":[9241114,9241719],"length":1,"stats":{"Line":0}},{"line":345,"address":[9241734],"length":1,"stats":{"Line":0}},{"line":346,"address":[9243227,9242893,9242356,9241940,9242555,9242685,9242969],"length":1,"stats":{"Line":0}},{"line":348,"address":[9245309,9242766,9243700,9243496],"length":1,"stats":{"Line":0}},{"line":349,"address":[9244779,9243828,9244443,9244244,9244703,9245037,9244573],"length":1,"stats":{"Line":0}},{"line":351,"address":[9244646],"length":1,"stats":{"Line":0}},{"line":354,"address":[9263456,9267859,9267658],"length":1,"stats":{"Line":0}},{"line":360,"address":[9263634,9263538],"length":1,"stats":{"Line":0}},{"line":362,"address":[9263674,9263757],"length":1,"stats":{"Line":0}},{"line":363,"address":[9263872,9267880,9267872,9263805,9264015,9267727],"length":1,"stats":{"Line":0}},{"line":366,"address":[9264836,9264614],"length":1,"stats":{"Line":0}},{"line":367,"address":[9264526,9263997,9264467],"length":1,"stats":{"Line":0}},{"line":368,"address":[9264710,9264474,9264861,9267667,9267912,9264549,9267904],"length":1,"stats":{"Line":0}},{"line":373,"address":[9263506],"length":1,"stats":{"Line":0}},{"line":374,"address":[9264888],"length":1,"stats":{"Line":0}},{"line":376,"address":[9265132],"length":1,"stats":{"Line":0}},{"line":377,"address":[9264943],"length":1,"stats":{"Line":0}},{"line":379,"address":[9265057],"length":1,"stats":{"Line":0}},{"line":385,"address":[9265243],"length":1,"stats":{"Line":0}},{"line":386,"address":[9265326],"length":1,"stats":{"Line":0}},{"line":390,"address":[9265370],"length":1,"stats":{"Line":0}},{"line":392,"address":[9266307,9266680,9265565,9266489,9265981,9266180,9266425],"length":1,"stats":{"Line":0}},{"line":394,"address":[9266363],"length":1,"stats":{"Line":0}},{"line":395,"address":[9266946,9267011],"length":1,"stats":{"Line":0}},{"line":398,"address":[9267019],"length":1,"stats":{"Line":0}},{"line":399,"address":[9267086],"length":1,"stats":{"Line":0}},{"line":400,"address":[9267159,9267098],"length":1,"stats":{"Line":0}},{"line":401,"address":[9267167],"length":1,"stats":{"Line":0}},{"line":402,"address":[9267243],"length":1,"stats":{"Line":0}},{"line":404,"address":[9267383,9267471,9267936],"length":1,"stats":{"Line":0}},{"line":405,"address":[9270393,9270443,9267991,9268080],"length":1,"stats":{"Line":0}},{"line":406,"address":[9268525,9268113],"length":1,"stats":{"Line":0}},{"line":408,"address":[9268457,9268328],"length":1,"stats":{"Line":0}},{"line":413,"address":[9268898,9268751,9268639],"length":1,"stats":{"Line":0}},{"line":415,"address":[9269289,9268921],"length":1,"stats":{"Line":0}},{"line":416,"address":[9269221,9269092],"length":1,"stats":{"Line":0}},{"line":420,"address":[9269697,9269756,9269441,9269832,9270216],"length":1,"stats":{"Line":0}},{"line":421,"address":[9270150,9270021],"length":1,"stats":{"Line":0}},{"line":426,"address":[9268053],"length":1,"stats":{"Line":0}},{"line":428,"address":[9267585,9267638],"length":1,"stats":{"Line":0}},{"line":430,"address":[9267219],"length":1,"stats":{"Line":0}},{"line":432,"address":[9267300],"length":1,"stats":{"Line":0}}],"covered":0,"coverable":177},{"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) -\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    println!(\"successfully identify {} user proof files\", proof_file_num);\n\n    let bar = ProgressBar::new(proof_file_num as u64);\n    let chunk_size: usize = num_cpus::get();\n    user_proof_paths.chunks(chunk_size).for_each(|chunks| {\n        chunks.par_iter().for_each(|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            if let Err(e) = proof.verify_merkle_proof(root_hash) {\n                panic!(\n                    \"fail to verify the user proof on path {:?} due to error {:?}\",\n                    user_proof_path, e\n                )\n            }\n        });\n        bar.inc(chunks.len() as u64);\n    });\n    bar.finish();\n    println!(\n        \"successfully verify {} user proofs with file pattern {}\",\n        proof_file_num, user_proof_path_pattern\n    );\n\n    Ok(())\n}\n\npub fn verify_global(global_proof_path: PathBuf) -\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    println!(\n        \"start to reconstruct the circuit with {} recursive levels for round {}\",\n        recursive_circuit_configs.len(),\n        round_num\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    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    Ok(())\n}\n","traces":[{"line":25,"address":[9596848,9597660],"length":1,"stats":{"Line":0}},{"line":26,"address":[9596891],"length":1,"stats":{"Line":0}},{"line":29,"address":[9597131,9596975,9596915,9597185],"length":1,"stats":{"Line":0}},{"line":30,"address":[9597249],"length":1,"stats":{"Line":0}},{"line":31,"address":[9597500,9597381],"length":1,"stats":{"Line":0}},{"line":32,"address":[9597437,9597505],"length":1,"stats":{"Line":0}},{"line":36,"address":[9597294],"length":1,"stats":{"Line":0}},{"line":39,"address":[9599805,9597696,9599886],"length":1,"stats":{"Line":0}},{"line":43,"address":[9597735,9598001],"length":1,"stats":{"Line":0}},{"line":44,"address":[9598008],"length":1,"stats":{"Line":0}},{"line":47,"address":[9598391,9598043],"length":1,"stats":{"Line":0}},{"line":48,"address":[9598323,9599849,9598429,9598162],"length":1,"stats":{"Line":0}},{"line":50,"address":[9598500],"length":1,"stats":{"Line":0}},{"line":51,"address":[9598543],"length":1,"stats":{"Line":0}},{"line":52,"address":[9599904,9598826,9598600,9599912],"length":1,"stats":{"Line":0}},{"line":54,"address":[9598996,9598803],"length":1,"stats":{"Line":0}},{"line":55,"address":[9599114],"length":1,"stats":{"Line":0}},{"line":57,"address":[9599183],"length":1,"stats":{"Line":0}},{"line":58,"address":[9599210,9599271],"length":1,"stats":{"Line":0}},{"line":59,"address":[9599287,9599936],"length":1,"stats":{"Line":0}},{"line":60,"address":[9601124,9600048,9599989,9601247],"length":1,"stats":{"Line":0}},{"line":61,"address":[9600073,9600243],"length":1,"stats":{"Line":0}},{"line":62,"address":[9600250],"length":1,"stats":{"Line":0}},{"line":63,"address":[9600261],"length":1,"stats":{"Line":0}},{"line":64,"address":[9600673,9600574],"length":1,"stats":{"Line":0}},{"line":65,"address":[9601030],"length":1,"stats":{"Line":0}},{"line":71,"address":[9600023],"length":1,"stats":{"Line":0}},{"line":73,"address":[9599372],"length":1,"stats":{"Line":0}},{"line":74,"address":[9599611],"length":1,"stats":{"Line":0}},{"line":79,"address":[9599714],"length":1,"stats":{"Line":0}},{"line":82,"address":[9604469,9604607,9601296],"length":1,"stats":{"Line":0}},{"line":83,"address":[9601327,9601657],"length":1,"stats":{"Line":0}},{"line":84,"address":[9601664],"length":1,"stats":{"Line":0}},{"line":87,"address":[9601699,9601917],"length":1,"stats":{"Line":0}},{"line":89,"address":[9601925],"length":1,"stats":{"Line":0}},{"line":90,"address":[9604557,9602031],"length":1,"stats":{"Line":0}},{"line":93,"address":[9601936],"length":1,"stats":{"Line":0}},{"line":94,"address":[9601960],"length":1,"stats":{"Line":0}},{"line":95,"address":[9601976],"length":1,"stats":{"Line":0}},{"line":96,"address":[9601992],"length":1,"stats":{"Line":0}},{"line":97,"address":[9602024,9602101],"length":1,"stats":{"Line":0}},{"line":101,"address":[9602178,9602117],"length":1,"stats":{"Line":0}},{"line":106,"address":[9602491],"length":1,"stats":{"Line":0}},{"line":111,"address":[9602563],"length":1,"stats":{"Line":0}},{"line":114,"address":[9602747,9602810],"length":1,"stats":{"Line":0}},{"line":116,"address":[9602818],"length":1,"stats":{"Line":0}},{"line":117,"address":[9602848],"length":1,"stats":{"Line":0}},{"line":118,"address":[9603009],"length":1,"stats":{"Line":0}},{"line":121,"address":[9603050],"length":1,"stats":{"Line":0}},{"line":127,"address":[9603360,9603297],"length":1,"stats":{"Line":0}},{"line":128,"address":[9603310],"length":1,"stats":{"Line":0}},{"line":129,"address":[9603371,9603434],"length":1,"stats":{"Line":0}},{"line":130,"address":[9603384],"length":1,"stats":{"Line":0}},{"line":131,"address":[9603445],"length":1,"stats":{"Line":0}},{"line":132,"address":[9603637],"length":1,"stats":{"Line":0}},{"line":135,"address":[9604269],"length":1,"stats":{"Line":0}},{"line":138,"address":[9604404],"length":1,"stats":{"Line":0}}],"covered":0,"coverable":57},{"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":[8688512,8689382,8689353],"length":1,"stats":{"Line":1}},{"line":24,"address":[12860838,12861760,12861792],"length":1,"stats":{"Line":3}},{"line":26,"address":[12861840,12860937,12861808],"length":1,"stats":{"Line":3}},{"line":28,"address":[12860997],"length":1,"stats":{"Line":1}},{"line":31,"address":[12861090,12861032,12861690],"length":1,"stats":{"Line":2}},{"line":37,"address":[12862164,12861856],"length":1,"stats":{"Line":0}},{"line":40,"address":[8689639,8689567],"length":1,"stats":{"Line":0}},{"line":41,"address":[12861986,12862050],"length":1,"stats":{"Line":0}},{"line":45,"address":[12862503,12862192],"length":1,"stats":{"Line":1}},{"line":47,"address":[12862219],"length":1,"stats":{"Line":1}},{"line":48,"address":[12862250,12862314],"length":1,"stats":{"Line":2}},{"line":49,"address":[12862389,12862330],"length":1,"stats":{"Line":2}},{"line":54,"address":[12862528,12863627],"length":1,"stats":{"Line":1}},{"line":55,"address":[12862578,12862663],"length":1,"stats":{"Line":1}},{"line":57,"address":[12863226,12862599,12862691,12862927,12862812,12863042,12863443,12863649,12863157],"length":1,"stats":{"Line":2}},{"line":58,"address":[12862759,12862620],"length":1,"stats":{"Line":2}},{"line":59,"address":[12862774,12862874],"length":1,"stats":{"Line":2}},{"line":60,"address":[12862989,12862889],"length":1,"stats":{"Line":2}},{"line":61,"address":[12863004,12863104],"length":1,"stats":{"Line":2}},{"line":62,"address":[8690879,8690779],"length":1,"stats":{"Line":2}},{"line":65,"address":[12863417,12863518],"length":1,"stats":{"Line":2}},{"line":67,"address":[12863872,12863691,12863664],"length":1,"stats":{"Line":3}},{"line":72,"address":[12863888],"length":1,"stats":{"Line":0}},{"line":77,"address":[8691571],"length":1,"stats":{"Line":0}},{"line":80,"address":[12864032,12864096],"length":1,"stats":{"Line":0}},{"line":81,"address":[8691744],"length":1,"stats":{"Line":0}},{"line":83,"address":[12864493,12864418],"length":1,"stats":{"Line":0}},{"line":86,"address":[12863997],"length":1,"stats":{"Line":0}},{"line":90,"address":[8692144,8693383,8693414],"length":1,"stats":{"Line":1}},{"line":91,"address":[12864567],"length":1,"stats":{"Line":1}},{"line":92,"address":[8692244,8692320],"length":1,"stats":{"Line":2}},{"line":93,"address":[12865599,12864700,12864782],"length":1,"stats":{"Line":3}},{"line":94,"address":[12864922],"length":1,"stats":{"Line":1}},{"line":95,"address":[12864965],"length":1,"stats":{"Line":1}},{"line":96,"address":[8692750,8692669],"length":1,"stats":{"Line":2}},{"line":97,"address":[12865608,12865250],"length":1,"stats":{"Line":2}},{"line":98,"address":[12865660,12865615],"length":1,"stats":{"Line":1}},{"line":99,"address":[12865685,12865644],"length":1,"stats":{"Line":2}},{"line":100,"address":[12865708],"length":1,"stats":{"Line":1}},{"line":103,"address":[12865204],"length":1,"stats":{"Line":1}},{"line":104,"address":[8692867],"length":1,"stats":{"Line":1}},{"line":106,"address":[12865286,12865968,12865840,12866223,12866347],"length":1,"stats":{"Line":5}},{"line":107,"address":[12865380],"length":1,"stats":{"Line":1}},{"line":109,"address":[12864872],"length":1,"stats":{"Line":1}},{"line":112,"address":[12866368],"length":1,"stats":{"Line":0}},{"line":113,"address":[12866475],"length":1,"stats":{"Line":0}},{"line":115,"address":[12866411],"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\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 = (batch_num as f64).log(RECURSION_BRANCHOUT_NUM as f64).ceil() as usize;\n\n    let mut configs = vec![STANDARD_CONFIG; level];\n    *configs.last_mut().unwrap() = STANDARD_ZK_CONFIG;\n    configs\n}\n","traces":[{"line":61,"address":[9405760,9406323],"length":1,"stats":{"Line":0}},{"line":64,"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}}],"covered":0,"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":[9164544,9177262,9177526],"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":[9166949],"length":1,"stats":{"Line":0}},{"line":59,"address":[9166995],"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":[9167229],"length":1,"stats":{"Line":0}},{"line":67,"address":[9167301,9167396],"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":[9169372],"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":[9172285],"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":[9174582],"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":[9170820],"length":1,"stats":{"Line":0}},{"line":150,"address":[],"length":0,"stats":{"Line":0}},{"line":151,"address":[],"length":0,"stats":{"Line":0}},{"line":154,"address":[9164224],"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":[9164416],"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\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_i64(-1));\n            assert_non_negative_unsigned(builder, x);\n        });\n    }\n}\n","traces":[{"line":19,"address":[10942208],"length":1,"stats":{"Line":1}},{"line":20,"address":[10942212],"length":1,"stats":{"Line":1}},{"line":22,"address":[10942221],"length":1,"stats":{"Line":1}},{"line":25,"address":[10942240],"length":1,"stats":{"Line":1}},{"line":30,"address":[10883945,10887872,10885920,10886896,10887807,10883903,10884944,10887849,10888825,10888783,10883968,10885855,10885897,10884879,10886831,10886873,10884921,10882992],"length":1,"stats":{"Line":7}},{"line":36,"address":[],"length":0,"stats":{"Line":12}},{"line":37,"address":[],"length":0,"stats":{"Line":6}},{"line":38,"address":[],"length":0,"stats":{"Line":6}},{"line":39,"address":[10883361,10884337,10887265,10888241,10886289,10885313],"length":1,"stats":{"Line":5}},{"line":40,"address":[],"length":0,"stats":{"Line":5}},{"line":41,"address":[10883429,10887333,10884405,10886357,10885381,10888309],"length":1,"stats":{"Line":5}},{"line":42,"address":[],"length":0,"stats":{"Line":5}},{"line":43,"address":[],"length":0,"stats":{"Line":10}},{"line":44,"address":[],"length":0,"stats":{"Line":5}},{"line":45,"address":[],"length":0,"stats":{"Line":5}},{"line":50,"address":[10942272],"length":1,"stats":{"Line":1}},{"line":51,"address":[10942281],"length":1,"stats":{"Line":1}}],"covered":17,"coverable":17},{"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":[10649296,10649341,10648848],"length":1,"stats":{"Line":0}},{"line":20,"address":[12721406],"length":1,"stats":{"Line":0}},{"line":21,"address":[12721423],"length":1,"stats":{"Line":0}},{"line":22,"address":[12721536,12721444],"length":1,"stats":{"Line":0}},{"line":23,"address":[12721723],"length":1,"stats":{"Line":0}},{"line":24,"address":[12721726],"length":1,"stats":{"Line":0}},{"line":46,"address":[11229344,11231596,11231489],"length":1,"stats":{"Line":0}},{"line":47,"address":[11229371,11231609],"length":1,"stats":{"Line":0}},{"line":48,"address":[11231147,11229569,11231019,11230000,11230568,11231203],"length":1,"stats":{"Line":0}},{"line":49,"address":[11231577,11230043,11229629,11229740,11229913],"length":1,"stats":{"Line":0}},{"line":50,"address":[11231539,11230162,11230307,11230452,11230611],"length":1,"stats":{"Line":0}},{"line":51,"address":[11231062,11231498,11230730,11230903],"length":1,"stats":{"Line":0}},{"line":52,"address":[10891003,10890610,10890723],"length":1,"stats":{"Line":0}},{"line":55,"address":[11232000,11232029,11231632],"length":1,"stats":{"Line":0}},{"line":56,"address":[11231649,11231883],"length":1,"stats":{"Line":0}},{"line":57,"address":[11231839],"length":1,"stats":{"Line":0}},{"line":69,"address":[11233764,11232048,11233695],"length":1,"stats":{"Line":0}},{"line":70,"address":[11233777,11232075],"length":1,"stats":{"Line":0}},{"line":71,"address":[10892328,10892941,10892765,10892889,10891759],"length":1,"stats":{"Line":0}},{"line":73,"address":[11232720,11232430,11232319,11232575,11233745,11232879],"length":1,"stats":{"Line":0}},{"line":74,"address":[11233328,11233704,11233171,11232998],"length":1,"stats":{"Line":0}},{"line":75,"address":[11233461,11233344,11233673],"length":1,"stats":{"Line":0}},{"line":78,"address":[11233808,11234205,11234176],"length":1,"stats":{"Line":0}},{"line":79,"address":[11233825,11234059],"length":1,"stats":{"Line":0}},{"line":80,"address":[11234015],"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":[8694112,8694301],"length":1,"stats":{"Line":1}},{"line":15,"address":[12866525],"length":1,"stats":{"Line":1}},{"line":16,"address":[12866538],"length":1,"stats":{"Line":1}},{"line":17,"address":[12866552],"length":1,"stats":{"Line":1}},{"line":18,"address":[12866609],"length":1,"stats":{"Line":1}},{"line":21,"address":[12866736],"length":1,"stats":{"Line":0}},{"line":22,"address":[8694337],"length":1,"stats":{"Line":0}},{"line":25,"address":[12866784,12868063,12871053],"length":1,"stats":{"Line":0}},{"line":26,"address":[12866914,12866826],"length":1,"stats":{"Line":0}},{"line":27,"address":[12869636,12870330,12870566,12870031,12870218,12870630,12870804],"length":1,"stats":{"Line":0}},{"line":28,"address":[8697950],"length":1,"stats":{"Line":0}},{"line":31,"address":[12866928,12867100],"length":1,"stats":{"Line":0}},{"line":33,"address":[12867135,12867241],"length":1,"stats":{"Line":0}},{"line":34,"address":[12868694,12868079,12869169,12869344,12869105,12868824,12868495],"length":1,"stats":{"Line":0}},{"line":35,"address":[12868899],"length":1,"stats":{"Line":0}},{"line":38,"address":[12867251],"length":1,"stats":{"Line":0}},{"line":39,"address":[12867271,12867683],"length":1,"stats":{"Line":0}},{"line":41,"address":[12867844],"length":1,"stats":{"Line":0}},{"line":46,"address":[12871088],"length":1,"stats":{"Line":0}},{"line":47,"address":[12871385,12871124],"length":1,"stats":{"Line":0}},{"line":48,"address":[12871134],"length":1,"stats":{"Line":0}},{"line":52,"address":[12871302],"length":1,"stats":{"Line":0}},{"line":55,"address":[12871584,12871424,12871487,12871623],"length":1,"stats":{"Line":2}},{"line":56,"address":[],"length":0,"stats":{"Line":4}},{"line":57,"address":[],"length":0,"stats":{"Line":2}},{"line":79,"address":[12872351,12871712,12872382],"length":1,"stats":{"Line":1}},{"line":81,"address":[12871742,12871818,12871873],"length":1,"stats":{"Line":3}},{"line":82,"address":[12872021,12872076,12871946],"length":1,"stats":{"Line":3}},{"line":88,"address":[12872400],"length":1,"stats":{"Line":1}},{"line":89,"address":[12872413],"length":1,"stats":{"Line":1}},{"line":91,"address":[12872499,12872480],"length":1,"stats":{"Line":2}},{"line":93,"address":[12872460],"length":1,"stats":{"Line":1}},{"line":96,"address":[12872656],"length":1,"stats":{"Line":1}},{"line":97,"address":[12872671,12872981,12872752],"length":1,"stats":{"Line":2}},{"line":98,"address":[12872761],"length":1,"stats":{"Line":1}},{"line":99,"address":[12872855,12872769],"length":1,"stats":{"Line":2}},{"line":100,"address":[12872930],"length":1,"stats":{"Line":1}},{"line":107,"address":[12873008],"length":1,"stats":{"Line":1}},{"line":108,"address":[12873021],"length":1,"stats":{"Line":1}},{"line":110,"address":[12873107,12873088],"length":1,"stats":{"Line":2}},{"line":111,"address":[8700625],"length":1,"stats":{"Line":1}},{"line":115,"address":[12873068],"length":1,"stats":{"Line":1}},{"line":118,"address":[8700688],"length":1,"stats":{"Line":1}},{"line":119,"address":[12873296,12873423,12873254],"length":1,"stats":{"Line":2}},{"line":120,"address":[12873323,12873391],"length":1,"stats":{"Line":2}},{"line":133,"address":[8700896,8701023],"length":1,"stats":{"Line":1}},{"line":134,"address":[12873473],"length":1,"stats":{"Line":1}},{"line":139,"address":[13042784,13043425],"length":1,"stats":{"Line":1}},{"line":140,"address":[13042804,13042937,13042971],"length":1,"stats":{"Line":3}},{"line":141,"address":[13043258,13043018],"length":1,"stats":{"Line":2}},{"line":145,"address":[13043789,13043456],"length":1,"stats":{"Line":1}},{"line":146,"address":[10498396,10498331,10498167],"length":1,"stats":{"Line":5}},{"line":149,"address":[13043824,13044473],"length":1,"stats":{"Line":1}},{"line":150,"address":[10498516,10498640,10498671],"length":1,"stats":{"Line":3}},{"line":151,"address":[13044296,13044056],"length":1,"stats":{"Line":2}},{"line":155,"address":[13044839,13044496],"length":1,"stats":{"Line":1}},{"line":156,"address":[13044769,13044522,13044701],"length":1,"stats":{"Line":5}},{"line":167,"address":[12873680],"length":1,"stats":{"Line":0}},{"line":168,"address":[8701137],"length":1,"stats":{"Line":0}},{"line":173,"address":[12873776],"length":1,"stats":{"Line":0}},{"line":174,"address":[12873781],"length":1,"stats":{"Line":0}},{"line":177,"address":[12873792],"length":1,"stats":{"Line":0}},{"line":178,"address":[12873801],"length":1,"stats":{"Line":0}},{"line":182,"address":[],"length":0,"stats":{"Line":0}},{"line":184,"address":[],"length":0,"stats":{"Line":0}},{"line":187,"address":[12873840,12874303],"length":1,"stats":{"Line":0}},{"line":188,"address":[12874344,12874206,12874132,12873870,12873944,12874336],"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, \u0026batch_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":[9186371,9185872],"length":1,"stats":{"Line":0}},{"line":20,"address":[],"length":0,"stats":{"Line":0}},{"line":21,"address":[9186034,9185988],"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":[9186436],"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":[9186326],"length":1,"stats":{"Line":0}},{"line":41,"address":[9181968,9183326],"length":1,"stats":{"Line":0}},{"line":48,"address":[],"length":0,"stats":{"Line":0}},{"line":49,"address":[9182140,9182193],"length":1,"stats":{"Line":0}},{"line":50,"address":[9182339],"length":1,"stats":{"Line":0}},{"line":52,"address":[9182752],"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":[9182795],"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":[9185764],"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":[9183557,9183736],"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":[9183175],"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    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 =\n            (cfg.num_of_batches as f64).log(cfg.recursion_branchout_num as f64).ceil() as usize;\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        debug!(\n            \"set_recursive_hash, recursive_level: {:?}, index: {:?}, hash: {:?}\",\n            recursive_level, index, hash\n        );\n        let idx = GlobalMst::get_recursive_global_index(\u0026self.cfg, recursive_level, index);\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":30,"address":[12874384,12874896],"length":1,"stats":{"Line":1}},{"line":31,"address":[8701814],"length":1,"stats":{"Line":1}},{"line":34,"address":[12874574],"length":1,"stats":{"Line":1}},{"line":35,"address":[12874632],"length":1,"stats":{"Line":1}},{"line":37,"address":[12874689,12874754],"length":1,"stats":{"Line":2}},{"line":38,"address":[8702196,8702154],"length":1,"stats":{"Line":1}},{"line":39,"address":[12874789,12874833],"length":1,"stats":{"Line":2}},{"line":40,"address":[12874865],"length":1,"stats":{"Line":1}},{"line":43,"address":[12874928],"length":1,"stats":{"Line":1}},{"line":44,"address":[12874933],"length":1,"stats":{"Line":1}},{"line":47,"address":[12874944],"length":1,"stats":{"Line":1}},{"line":48,"address":[12874981,12874953],"length":1,"stats":{"Line":1}},{"line":51,"address":[12875008],"length":1,"stats":{"Line":0}},{"line":52,"address":[12875026],"length":1,"stats":{"Line":0}},{"line":55,"address":[12875056],"length":1,"stats":{"Line":0}},{"line":56,"address":[12875061],"length":1,"stats":{"Line":0}},{"line":65,"address":[12875088],"length":1,"stats":{"Line":1}},{"line":70,"address":[8702510],"length":1,"stats":{"Line":1}},{"line":71,"address":[12875151],"length":1,"stats":{"Line":1}},{"line":72,"address":[12875180],"length":1,"stats":{"Line":1}},{"line":74,"address":[12875256,12875202],"length":1,"stats":{"Line":1}},{"line":76,"address":[8702657,8702715,8702611],"length":1,"stats":{"Line":2}},{"line":77,"address":[12875332,12875458,12875366],"length":1,"stats":{"Line":2}},{"line":79,"address":[12875536,12875484,12875450],"length":1,"stats":{"Line":2}},{"line":80,"address":[12875562,12875590,12875521],"length":1,"stats":{"Line":2}},{"line":82,"address":[12875831,12875570,12875611],"length":1,"stats":{"Line":2}},{"line":86,"address":[12875857,12875907,12875816],"length":1,"stats":{"Line":2}},{"line":93,"address":[8703312],"length":1,"stats":{"Line":1}},{"line":98,"address":[12875991,12876137],"length":1,"stats":{"Line":1}},{"line":99,"address":[12876095],"length":1,"stats":{"Line":1}},{"line":100,"address":[12876112],"length":1,"stats":{"Line":1}},{"line":101,"address":[12876129],"length":1,"stats":{"Line":1}},{"line":103,"address":[12876169],"length":1,"stats":{"Line":1}},{"line":105,"address":[12876233,12876447,12876423],"length":1,"stats":{"Line":2}},{"line":106,"address":[8703807],"length":1,"stats":{"Line":1}},{"line":108,"address":[12876276,12876210],"length":1,"stats":{"Line":2}},{"line":113,"address":[8703848,8703889,8703558,8703996],"length":1,"stats":{"Line":4}},{"line":114,"address":[12876502],"length":1,"stats":{"Line":1}},{"line":116,"address":[12876564,12876623,12876521],"length":1,"stats":{"Line":2}},{"line":119,"address":[12876678,12876534,12876649],"length":1,"stats":{"Line":2}},{"line":120,"address":[12876704,12876657],"length":1,"stats":{"Line":2}},{"line":122,"address":[12876948,12876863],"length":1,"stats":{"Line":1}},{"line":124,"address":[12876938],"length":1,"stats":{"Line":1}},{"line":125,"address":[12876946,12876964,12877275],"length":1,"stats":{"Line":3}},{"line":126,"address":[12877011,12877175,12877097],"length":1,"stats":{"Line":2}},{"line":127,"address":[8704513],"length":1,"stats":{"Line":1}},{"line":128,"address":[12877121],"length":1,"stats":{"Line":1}},{"line":130,"address":[12877247,12877147,12877196],"length":1,"stats":{"Line":2}},{"line":132,"address":[12877204],"length":1,"stats":{"Line":1}},{"line":133,"address":[12877267,12877220,12877280],"length":1,"stats":{"Line":2}},{"line":136,"address":[12877050,12877071,12876983],"length":1,"stats":{"Line":2}},{"line":137,"address":[8704433],"length":1,"stats":{"Line":1}},{"line":142,"address":[12877296],"length":1,"stats":{"Line":1}},{"line":143,"address":[12877325],"length":1,"stats":{"Line":1}},{"line":144,"address":[12877348],"length":1,"stats":{"Line":1}},{"line":147,"address":[8704784],"length":1,"stats":{"Line":0}},{"line":148,"address":[8705269,8705486,8705559,8705417,8705774,8704938,8705602],"length":1,"stats":{"Line":0}},{"line":149,"address":[8706054,8705517],"length":1,"stats":{"Line":0}},{"line":151,"address":[8706087],"length":1,"stats":{"Line":0}},{"line":153,"address":[8706099,8706261],"length":1,"stats":{"Line":0}},{"line":155,"address":[8706198],"length":1,"stats":{"Line":0}},{"line":159,"address":[8706288],"length":1,"stats":{"Line":1}},{"line":160,"address":[12879397,12879618,12879763,12879806,12880170,12879545,12879066],"length":1,"stats":{"Line":7}},{"line":164,"address":[8707025],"length":1,"stats":{"Line":1}},{"line":165,"address":[12879685],"length":1,"stats":{"Line":1}},{"line":168,"address":[12880512,12888453,12884932],"length":1,"stats":{"Line":1}},{"line":170,"address":[8707895],"length":1,"stats":{"Line":1}},{"line":171,"address":[8707944],"length":1,"stats":{"Line":1}},{"line":172,"address":[12880858,12880701,12880608],"length":1,"stats":{"Line":3}},{"line":173,"address":[12880874],"length":1,"stats":{"Line":1}},{"line":174,"address":[8708246,8712225,8712320],"length":1,"stats":{"Line":2}},{"line":175,"address":[12885017,12885081],"length":1,"stats":{"Line":2}},{"line":176,"address":[12885203,12885335],"length":1,"stats":{"Line":1}},{"line":177,"address":[12885364,12885306,12885519],"length":1,"stats":{"Line":2}},{"line":179,"address":[8712756,8712828],"length":1,"stats":{"Line":2}},{"line":182,"address":[12885564],"length":1,"stats":{"Line":1}},{"line":187,"address":[8712895],"length":1,"stats":{"Line":1}},{"line":192,"address":[12885682],"length":1,"stats":{"Line":1}},{"line":193,"address":[8712999],"length":1,"stats":{"Line":1}},{"line":196,"address":[12885796],"length":1,"stats":{"Line":1}},{"line":197,"address":[8713098],"length":1,"stats":{"Line":1}},{"line":199,"address":[8713167],"length":1,"stats":{"Line":1}},{"line":200,"address":[8714065,8713953,8715311,8714230,8713766,8714166,8715195,8713371],"length":1,"stats":{"Line":7}},{"line":201,"address":[8714121],"length":1,"stats":{"Line":1}},{"line":205,"address":[12880811],"length":1,"stats":{"Line":1}},{"line":206,"address":[12880940,12880823],"length":1,"stats":{"Line":2}},{"line":207,"address":[8708300,8708519],"length":1,"stats":{"Line":2}},{"line":208,"address":[8708535,8708889,8708822],"length":1,"stats":{"Line":2}},{"line":209,"address":[8708925,8708862],"length":1,"stats":{"Line":2}},{"line":210,"address":[8709039],"length":1,"stats":{"Line":1}},{"line":211,"address":[12888480,12888499],"length":1,"stats":{"Line":2}},{"line":213,"address":[12881868,12881777],"length":1,"stats":{"Line":2}},{"line":214,"address":[12881876,12882018],"length":1,"stats":{"Line":2}},{"line":216,"address":[8709310,8715824,8715843],"length":1,"stats":{"Line":3}},{"line":218,"address":[8715856,8715962],"length":1,"stats":{"Line":1}},{"line":219,"address":[12888699],"length":1,"stats":{"Line":1}},{"line":224,"address":[12882072,12882167],"length":1,"stats":{"Line":2}},{"line":226,"address":[12888752,12888778],"length":1,"stats":{"Line":2}},{"line":229,"address":[12882264],"length":1,"stats":{"Line":1}},{"line":231,"address":[12882343],"length":1,"stats":{"Line":1}},{"line":232,"address":[12884526,12882692,12883108,12883437,12883307,12883646,12883570,12884398],"length":1,"stats":{"Line":0}},{"line":233,"address":[12883502],"length":1,"stats":{"Line":0}},{"line":235,"address":[12882617,12882432],"length":1,"stats":{"Line":2}},{"line":238,"address":[12881231,12881137],"length":1,"stats":{"Line":2}},{"line":240,"address":[12881239],"length":1,"stats":{"Line":1}},{"line":242,"address":[12888864,12881284,12888874],"length":1,"stats":{"Line":3}},{"line":245,"address":[8716112],"length":1,"stats":{"Line":0}},{"line":246,"address":[12888929],"length":1,"stats":{"Line":0}},{"line":247,"address":[12889684,12889727,12889900,12889538,12889607,12889059,12889390],"length":1,"stats":{"Line":0}},{"line":248,"address":[12889633],"length":1,"stats":{"Line":0}},{"line":249,"address":[8716860],"length":1,"stats":{"Line":0}},{"line":250,"address":[12890545,12889657,12890180],"length":1,"stats":{"Line":0}},{"line":251,"address":[12890203,12890503],"length":1,"stats":{"Line":0}},{"line":252,"address":[12890310],"length":1,"stats":{"Line":0}},{"line":253,"address":[12890357],"length":1,"stats":{"Line":0}},{"line":256,"address":[12890631,12890785,12890576],"length":1,"stats":{"Line":0}},{"line":258,"address":[12890454],"length":1,"stats":{"Line":0}},{"line":259,"address":[12890537,12890550,12890472],"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","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    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 local_mst_root_index = cfg.batch_size * 2 - 2;\n    let mst_batch_idx = global_index / cfg.batch_size;\n    let this_mst_root_idx =\n        GlobalMst::get_batch_tree_global_index(cfg, mst_batch_idx, local_mst_root_index);\n\n    let first_mst_root_idx = GlobalMst::get_batch_tree_global_index(cfg, 0, local_mst_root_index);\n    assert!(this_mst_root_idx \u003e= first_mst_root_idx);\n\n    let this_mst_root_offset = this_mst_root_idx - first_mst_root_idx;\n    let mut recursive_idx = this_mst_root_offset / cfg.recursion_branchout_num;\n    let mut recursive_offset = this_mst_root_offset % cfg.recursion_branchout_num;\n\n    let layers = (cfg.num_of_batches.next_power_of_two() as f64)\n        .log(cfg.recursion_branchout_num as f64)\n        .ceil() as usize;\n\n    for i in 0..layers {\n        let mut left_layer = Vec::new();\n        let mut right_layer = Vec::new();\n        if i == 0 {\n            for j in 0..cfg.recursion_branchout_num {\n                if j \u003c recursive_offset {\n                    let index =\n                        first_mst_root_idx + (cfg.recursion_branchout_num * recursive_idx) + j;\n                    left_layer.push(index);\n                }\n\n                if j \u003e recursive_offset {\n                    let index =\n                        first_mst_root_idx + (cfg.recursion_branchout_num * recursive_idx) + j;\n                    right_layer.push(index);\n                }\n            }\n        } else {\n            for j in 0..cfg.recursion_branchout_num {\n                if j \u003c recursive_offset {\n                    let index = GlobalMst::get_recursive_global_index(\n                        cfg,\n                        i,\n                        recursive_idx * cfg.recursion_branchout_num + j,\n                    );\n                    left_layer.push(index);\n                }\n\n                if j \u003e recursive_offset {\n                    let index = GlobalMst::get_recursive_global_index(\n                        cfg,\n                        i,\n                        recursive_idx * cfg.recursion_branchout_num + j,\n                    );\n                    right_layer.push(index);\n                }\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":36,"address":[12891158,12890944],"length":1,"stats":{"Line":1}},{"line":37,"address":[8718185],"length":1,"stats":{"Line":1}},{"line":38,"address":[12891004],"length":1,"stats":{"Line":1}},{"line":46,"address":[12891184,12891996],"length":1,"stats":{"Line":1}},{"line":48,"address":[12891238],"length":1,"stats":{"Line":1}},{"line":50,"address":[12891290,12891367],"length":1,"stats":{"Line":1}},{"line":51,"address":[12891331],"length":1,"stats":{"Line":1}},{"line":54,"address":[12891411,12891350,12891396],"length":1,"stats":{"Line":2}},{"line":56,"address":[12891409,12891480,12891970],"length":1,"stats":{"Line":3}},{"line":57,"address":[12891622,12891735],"length":1,"stats":{"Line":2}},{"line":58,"address":[12891802,12891829,12891745],"length":1,"stats":{"Line":0}},{"line":59,"address":[12891850,12891810],"length":1,"stats":{"Line":0}},{"line":61,"address":[12891872,12891773,12891899],"length":1,"stats":{"Line":2}},{"line":62,"address":[12891880,12891920],"length":1,"stats":{"Line":2}},{"line":65,"address":[12891975,12891852,12891932],"length":1,"stats":{"Line":2}},{"line":66,"address":[8719149],"length":1,"stats":{"Line":1}},{"line":69,"address":[12891593,12892052,12892032,12891652],"length":1,"stats":{"Line":4}},{"line":73,"address":[12895009,12892080,12895040],"length":1,"stats":{"Line":1}},{"line":78,"address":[12892146],"length":1,"stats":{"Line":1}},{"line":80,"address":[8719392],"length":1,"stats":{"Line":1}},{"line":81,"address":[12892395,12892231,12892367],"length":1,"stats":{"Line":2}},{"line":82,"address":[12892375,12892437,12892480],"length":1,"stats":{"Line":2}},{"line":83,"address":[12892525,12892461],"length":1,"stats":{"Line":2}},{"line":86,"address":[12892533],"length":1,"stats":{"Line":1}},{"line":87,"address":[12892580],"length":1,"stats":{"Line":1}},{"line":89,"address":[8719804,8719867],"length":1,"stats":{"Line":1}},{"line":90,"address":[8719904,8719948,8719847],"length":1,"stats":{"Line":2}},{"line":91,"address":[12892855,12892758,12892815],"length":1,"stats":{"Line":2}},{"line":93,"address":[8720006,8720062,8720125],"length":1,"stats":{"Line":3}},{"line":94,"address":[12892931],"length":1,"stats":{"Line":1}},{"line":97,"address":[12893288,12893092,12894595],"length":1,"stats":{"Line":3}},{"line":98,"address":[12893312],"length":1,"stats":{"Line":1}},{"line":99,"address":[12893331],"length":1,"stats":{"Line":1}},{"line":100,"address":[12893407],"length":1,"stats":{"Line":1}},{"line":101,"address":[12893429,12893567,12893839],"length":1,"stats":{"Line":3}},{"line":102,"address":[12893863],"length":1,"stats":{"Line":1}},{"line":103,"address":[12893908,12894078],"length":1,"stats":{"Line":1}},{"line":105,"address":[8721225,8721265],"length":1,"stats":{"Line":2}},{"line":108,"address":[12893881],"length":1,"stats":{"Line":1}},{"line":109,"address":[8721436,8721278],"length":1,"stats":{"Line":1}},{"line":111,"address":[12894251,12894291],"length":1,"stats":{"Line":2}},{"line":115,"address":[12893472,12894312],"length":1,"stats":{"Line":2}},{"line":116,"address":[12894419],"length":1,"stats":{"Line":1}},{"line":120,"address":[8721819,8721920],"length":1,"stats":{"Line":1}},{"line":122,"address":[12894792],"length":1,"stats":{"Line":1}},{"line":125,"address":[8721792],"length":1,"stats":{"Line":1}},{"line":129,"address":[8721986,8722087],"length":1,"stats":{"Line":1}},{"line":131,"address":[12894963],"length":1,"stats":{"Line":1}},{"line":136,"address":[12893665],"length":1,"stats":{"Line":1}},{"line":138,"address":[12894535,12894446],"length":1,"stats":{"Line":1}},{"line":139,"address":[12894600,12894505,12894566],"length":1,"stats":{"Line":2}},{"line":142,"address":[12893245],"length":1,"stats":{"Line":1}},{"line":154,"address":[8722224,8722698],"length":1,"stats":{"Line":0}},{"line":155,"address":[12895104,12895176],"length":1,"stats":{"Line":0}},{"line":158,"address":[12895613,12895715,12895584],"length":1,"stats":{"Line":0}},{"line":160,"address":[12895260,12895336],"length":1,"stats":{"Line":0}},{"line":163,"address":[12895859,12895728,12895757],"length":1,"stats":{"Line":0}},{"line":169,"address":[12895872,12896401],"length":1,"stats":{"Line":1}},{"line":170,"address":[12895894],"length":1,"stats":{"Line":1}},{"line":171,"address":[12895927],"length":1,"stats":{"Line":1}},{"line":172,"address":[8723148],"length":1,"stats":{"Line":1}},{"line":174,"address":[12896076,12896461,12896448],"length":1,"stats":{"Line":3}},{"line":176,"address":[8723408,8723332],"length":1,"stats":{"Line":2}},{"line":191,"address":[12898081,12896496,12899720],"length":1,"stats":{"Line":0}},{"line":196,"address":[12896651,12896567],"length":1,"stats":{"Line":0}},{"line":197,"address":[8723869,8723778],"length":1,"stats":{"Line":0}},{"line":198,"address":[8724233,8726692],"length":1,"stats":{"Line":0}},{"line":201,"address":[12896799],"length":1,"stats":{"Line":0}},{"line":203,"address":[12897298],"length":1,"stats":{"Line":0}},{"line":204,"address":[8724518],"length":1,"stats":{"Line":0}},{"line":205,"address":[8725541,8725954,8726230,8725146,8726018,8725728,8725840],"length":1,"stats":{"Line":0}},{"line":206,"address":[8726549,8725912],"length":1,"stats":{"Line":0}},{"line":209,"address":[8724551,8724788],"length":1,"stats":{"Line":0}},{"line":214,"address":[12897743,12897880],"length":1,"stats":{"Line":0}},{"line":215,"address":[12897884],"length":1,"stats":{"Line":0}},{"line":217,"address":[8724999],"length":1,"stats":{"Line":0}},{"line":220,"address":[8726784],"length":1,"stats":{"Line":1}},{"line":221,"address":[12899795],"length":1,"stats":{"Line":1}},{"line":223,"address":[12899811],"length":1,"stats":{"Line":1}},{"line":225,"address":[12900192,12899820],"length":1,"stats":{"Line":2}},{"line":226,"address":[12900230],"length":1,"stats":{"Line":1}},{"line":227,"address":[12900265],"length":1,"stats":{"Line":1}},{"line":228,"address":[8727288],"length":1,"stats":{"Line":1}},{"line":230,"address":[12900307],"length":1,"stats":{"Line":0}},{"line":231,"address":[12900322],"length":1,"stats":{"Line":0}},{"line":235,"address":[12899926],"length":1,"stats":{"Line":1}},{"line":238,"address":[12900352,12900397],"length":1,"stats":{"Line":2}},{"line":240,"address":[12900027,12900150],"length":1,"stats":{"Line":1}},{"line":241,"address":[8727173],"length":1,"stats":{"Line":1}},{"line":243,"address":[12900047],"length":1,"stats":{"Line":0}},{"line":249,"address":[12900496,12901172],"length":1,"stats":{"Line":0}},{"line":255,"address":[12900570,12900642],"length":1,"stats":{"Line":0}},{"line":258,"address":[12901229,12901331,12901200],"length":1,"stats":{"Line":0}},{"line":261,"address":[12900802,12900726],"length":1,"stats":{"Line":0}},{"line":264,"address":[12901344,12901373],"length":1,"stats":{"Line":0}},{"line":268,"address":[12900895],"length":1,"stats":{"Line":0}}],"covered":67,"coverable":96},{"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","traces":[{"line":25,"address":[10078146,10077776],"length":1,"stats":{"Line":1}},{"line":29,"address":[11835765,11835379,11835744],"length":1,"stats":{"Line":3}},{"line":30,"address":[11835398],"length":1,"stats":{"Line":1}},{"line":31,"address":[11835518,11835451],"length":1,"stats":{"Line":2}},{"line":36,"address":[11836491,11835792],"length":1,"stats":{"Line":1}},{"line":37,"address":[11835838],"length":1,"stats":{"Line":1}},{"line":38,"address":[11835990],"length":1,"stats":{"Line":1}},{"line":40,"address":[11836157],"length":1,"stats":{"Line":1}},{"line":41,"address":[11836251],"length":1,"stats":{"Line":1}},{"line":42,"address":[11836322],"length":1,"stats":{"Line":1}},{"line":56,"address":[10078880],"length":1,"stats":{"Line":1}},{"line":60,"address":[11836579,11837072,11837093],"length":1,"stats":{"Line":3}},{"line":62,"address":[11836661,11837184,11837205],"length":1,"stats":{"Line":3}},{"line":64,"address":[11836754],"length":1,"stats":{"Line":1}},{"line":67,"address":[11836870],"length":1,"stats":{"Line":1}},{"line":69,"address":[11836937],"length":1,"stats":{"Line":1}},{"line":73,"address":[11837296,11838069,11838098],"length":1,"stats":{"Line":1}},{"line":75,"address":[11837339,11838107],"length":1,"stats":{"Line":1}},{"line":76,"address":[11837995],"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":[9279924,9279200,9279892],"length":1,"stats":{"Line":1}},{"line":40,"address":[8728440],"length":1,"stats":{"Line":1}},{"line":41,"address":[],"length":0,"stats":{"Line":1}},{"line":42,"address":[8728592],"length":1,"stats":{"Line":1}},{"line":43,"address":[11838334],"length":1,"stats":{"Line":1}},{"line":44,"address":[9279936,9279542,9279457],"length":1,"stats":{"Line":3}},{"line":45,"address":[8729139],"length":1,"stats":{"Line":1}},{"line":46,"address":[9280089],"length":1,"stats":{"Line":1}},{"line":49,"address":[8729389],"length":1,"stats":{"Line":1}},{"line":50,"address":[11839266],"length":1,"stats":{"Line":1}},{"line":54,"address":[],"length":0,"stats":{"Line":1}},{"line":55,"address":[9280524],"length":1,"stats":{"Line":1}},{"line":56,"address":[8729761],"length":1,"stats":{"Line":1}},{"line":57,"address":[],"length":0,"stats":{"Line":1}},{"line":59,"address":[9280787],"length":1,"stats":{"Line":1}},{"line":61,"address":[],"length":0,"stats":{"Line":1}},{"line":66,"address":[8730000],"length":1,"stats":{"Line":1}},{"line":70,"address":[11839820],"length":1,"stats":{"Line":1}},{"line":72,"address":[11839840],"length":1,"stats":{"Line":1}},{"line":73,"address":[11839879],"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":[11840032],"length":1,"stats":{"Line":1}},{"line":94,"address":[11840048],"length":1,"stats":{"Line":1}},{"line":95,"address":[11840083],"length":1,"stats":{"Line":1}},{"line":96,"address":[11840130],"length":1,"stats":{"Line":1}},{"line":97,"address":[11840178],"length":1,"stats":{"Line":1}},{"line":102,"address":[10375337,10374720],"length":1,"stats":{"Line":0}},{"line":104,"address":[10375302,10374762,10375359],"length":1,"stats":{"Line":0}},{"line":110,"address":[11840700,11840208],"length":1,"stats":{"Line":0}},{"line":111,"address":[8730459],"length":1,"stats":{"Line":0}},{"line":112,"address":[8730474],"length":1,"stats":{"Line":0}},{"line":113,"address":[11840371],"length":1,"stats":{"Line":0}},{"line":114,"address":[11840481],"length":1,"stats":{"Line":0}},{"line":129,"address":[11840736],"length":1,"stats":{"Line":1}},{"line":130,"address":[8730936],"length":1,"stats":{"Line":1}},{"line":134,"address":[11840816],"length":1,"stats":{"Line":1}},{"line":135,"address":[11840835],"length":1,"stats":{"Line":1}},{"line":136,"address":[11840854],"length":1,"stats":{"Line":1}},{"line":141,"address":[11841949,11840880],"length":1,"stats":{"Line":1}},{"line":145,"address":[11840932],"length":1,"stats":{"Line":1}},{"line":147,"address":[11840954,11841129],"length":1,"stats":{"Line":2}},{"line":148,"address":[8731325,8731426],"length":1,"stats":{"Line":1}},{"line":149,"address":[11841233,11841658,11841272],"length":1,"stats":{"Line":2}},{"line":150,"address":[11841370,11841467],"length":1,"stats":{"Line":2}},{"line":151,"address":[8731648,8731735],"length":1,"stats":{"Line":2}},{"line":152,"address":[11841884],"length":1,"stats":{"Line":1}},{"line":154,"address":[8731743,8731879],"length":1,"stats":{"Line":2}},{"line":160,"address":[11841984,11842374],"length":1,"stats":{"Line":1}},{"line":164,"address":[11842056],"length":1,"stats":{"Line":1}},{"line":166,"address":[8732528,8732549],"length":1,"stats":{"Line":2}},{"line":169,"address":[11842142],"length":1,"stats":{"Line":1}},{"line":171,"address":[8732327],"length":1,"stats":{"Line":1}},{"line":173,"address":[11842262],"length":1,"stats":{"Line":1}},{"line":175,"address":[8732449],"length":1,"stats":{"Line":1}},{"line":179,"address":[11843542,11843595,11842464],"length":1,"stats":{"Line":1}},{"line":185,"address":[11842705,11842857,11842507],"length":1,"stats":{"Line":2}},{"line":187,"address":[11842882,11842739],"length":1,"stats":{"Line":2}},{"line":188,"address":[8733006],"length":1,"stats":{"Line":1}},{"line":189,"address":[11844058,11842955,11844090,11843632],"length":1,"stats":{"Line":2}},{"line":190,"address":[8733707,8734128,8734149],"length":1,"stats":{"Line":3}},{"line":191,"address":[11843690],"length":1,"stats":{"Line":1}},{"line":192,"address":[8733767],"length":1,"stats":{"Line":1}},{"line":193,"address":[11843808],"length":1,"stats":{"Line":1}},{"line":194,"address":[11844019],"length":1,"stats":{"Line":1}},{"line":196,"address":[11843072],"length":1,"stats":{"Line":1}},{"line":198,"address":[11844160,11844195],"length":1,"stats":{"Line":2}},{"line":201,"address":[11843279,11843196],"length":1,"stats":{"Line":2}},{"line":202,"address":[11843325],"length":1,"stats":{"Line":1}},{"line":203,"address":[11843397],"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            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":[8734240],"length":1,"stats":{"Line":1}},{"line":34,"address":[12901547,12901471],"length":1,"stats":{"Line":2}},{"line":36,"address":[12901722,12901638,12901562],"length":1,"stats":{"Line":3}},{"line":41,"address":[12902578,12901744,12902404],"length":1,"stats":{"Line":1}},{"line":45,"address":[12901796],"length":1,"stats":{"Line":1}},{"line":47,"address":[12901905,12902059,12901837],"length":1,"stats":{"Line":3}},{"line":49,"address":[8734868,8735283,8735180],"length":1,"stats":{"Line":3}},{"line":52,"address":[12902546],"length":1,"stats":{"Line":1}},{"line":55,"address":[12902114,12902022],"length":1,"stats":{"Line":2}},{"line":57,"address":[12902624,12902659],"length":1,"stats":{"Line":2}},{"line":61,"address":[8734976,8735056],"length":1,"stats":{"Line":2}},{"line":64,"address":[12902311],"length":1,"stats":{"Line":1}},{"line":68,"address":[8741110,8739673,8735424],"length":1,"stats":{"Line":1}},{"line":69,"address":[12902742],"length":1,"stats":{"Line":1}},{"line":70,"address":[12902904],"length":1,"stats":{"Line":1}},{"line":73,"address":[12902972],"length":1,"stats":{"Line":1}},{"line":74,"address":[12903045,12903145],"length":1,"stats":{"Line":2}},{"line":76,"address":[12903164],"length":1,"stats":{"Line":1}},{"line":78,"address":[12903187],"length":1,"stats":{"Line":1}},{"line":79,"address":[12903222],"length":1,"stats":{"Line":1}},{"line":81,"address":[12903295],"length":1,"stats":{"Line":1}},{"line":83,"address":[12904557,12904154,12904481,12903955,12904284,12903539],"length":1,"stats":{"Line":5}},{"line":85,"address":[12904357],"length":1,"stats":{"Line":1}},{"line":87,"address":[12904870],"length":1,"stats":{"Line":1}},{"line":88,"address":[12904905],"length":1,"stats":{"Line":1}},{"line":89,"address":[12904959,12905188],"length":1,"stats":{"Line":2}},{"line":90,"address":[12905239],"length":1,"stats":{"Line":1}},{"line":91,"address":[12905276],"length":1,"stats":{"Line":1}},{"line":92,"address":[12905336],"length":1,"stats":{"Line":0}},{"line":93,"address":[12906727,12906216,12905601,12906346,12906536,12906017,12906472],"length":1,"stats":{"Line":0}},{"line":94,"address":[12906411,12906977],"length":1,"stats":{"Line":0}},{"line":98,"address":[12904981],"length":1,"stats":{"Line":0}},{"line":99,"address":[12908153,12907669,12907482,12907087,12907781,12907962,12907898],"length":1,"stats":{"Line":0}},{"line":100,"address":[12907837,12908403],"length":1,"stats":{"Line":0}},{"line":106,"address":[12912880,12911181,12908496],"length":1,"stats":{"Line":1}},{"line":111,"address":[12908575],"length":1,"stats":{"Line":1}},{"line":112,"address":[12908624,12908922,12908692],"length":1,"stats":{"Line":3}},{"line":114,"address":[12908946,12912708],"length":1,"stats":{"Line":2}},{"line":116,"address":[12912716,12912856],"length":1,"stats":{"Line":2}},{"line":119,"address":[12908833],"length":1,"stats":{"Line":1}},{"line":121,"address":[12908887,12908992],"length":1,"stats":{"Line":2}},{"line":122,"address":[12909000],"length":1,"stats":{"Line":1}},{"line":124,"address":[12909075],"length":1,"stats":{"Line":1}},{"line":125,"address":[8741746],"length":1,"stats":{"Line":1}},{"line":126,"address":[8741808,8742025],"length":1,"stats":{"Line":2}},{"line":127,"address":[8742072],"length":1,"stats":{"Line":1}},{"line":128,"address":[12909481],"length":1,"stats":{"Line":1}},{"line":129,"address":[8742167],"length":1,"stats":{"Line":0}},{"line":130,"address":[12909753,12910498,12910368,12910169,12910630,12910706,12910900],"length":1,"stats":{"Line":0}},{"line":131,"address":[12910563,12911153],"length":1,"stats":{"Line":0}},{"line":135,"address":[12909186],"length":1,"stats":{"Line":0}},{"line":136,"address":[12912338,12911263,12912083,12911667,12911854,12911966,12912147],"length":1,"stats":{"Line":0}},{"line":137,"address":[8744642,8745204],"length":1,"stats":{"Line":0}},{"line":143,"address":[12917389,12912912,12918860],"length":1,"stats":{"Line":0}},{"line":146,"address":[8745574],"length":1,"stats":{"Line":0}},{"line":147,"address":[12913136],"length":1,"stats":{"Line":0}},{"line":150,"address":[8745804],"length":1,"stats":{"Line":0}},{"line":151,"address":[12913277,12913377],"length":1,"stats":{"Line":0}},{"line":153,"address":[8745992],"length":1,"stats":{"Line":0}},{"line":155,"address":[12913419],"length":1,"stats":{"Line":0}},{"line":157,"address":[12913500],"length":1,"stats":{"Line":0}},{"line":159,"address":[12913741,12914356,12914687,12914157,12914611,12914486],"length":1,"stats":{"Line":0}},{"line":161,"address":[12915016,12914551],"length":1,"stats":{"Line":0}},{"line":162,"address":[12915024],"length":1,"stats":{"Line":0}},{"line":164,"address":[12915107],"length":1,"stats":{"Line":0}},{"line":165,"address":[12915142],"length":1,"stats":{"Line":0}},{"line":166,"address":[8747768,8748001],"length":1,"stats":{"Line":0}},{"line":167,"address":[12915476],"length":1,"stats":{"Line":0}},{"line":168,"address":[8748065],"length":1,"stats":{"Line":0}},{"line":169,"address":[12915739],"length":1,"stats":{"Line":0}},{"line":170,"address":[12917111,12916600,12916920,12916401,12916730,12915985,12916856],"length":1,"stats":{"Line":0}},{"line":171,"address":[12917361,12916795],"length":1,"stats":{"Line":0}},{"line":175,"address":[12915218],"length":1,"stats":{"Line":0}},{"line":176,"address":[12917866,12918282,12918537,12918165,12917471,12918053,12918346],"length":1,"stats":{"Line":0}},{"line":177,"address":[12918787,12918221],"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":[11234224,11234792,11234821],"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 = node2.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 = 574041;\n        let eth_amount = 38553;\n        assert_eq!(node.sum_equity, F::from_canonical_u64(btc_amount + eth_amount));\n        assert_eq!(node.sum_debt, F::from_canonical_u64(0));\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 = 574041;\n        let acc1_eth_amount = 38553;\n        let acc2_btc_amount = 4864585;\n        let acc2_eth_amount = 6877764;\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(0));\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\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\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, F::ZERO);\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":[12918896],"length":1,"stats":{"Line":1}},{"line":21,"address":[12919152,12918928,12919120],"length":1,"stats":{"Line":3}},{"line":23,"address":[12919200,12918981,12919168],"length":1,"stats":{"Line":3}},{"line":25,"address":[12919034],"length":1,"stats":{"Line":1}},{"line":30,"address":[10353968],"length":1,"stats":{"Line":1}},{"line":31,"address":[12919249],"length":1,"stats":{"Line":1}},{"line":32,"address":[12919269],"length":1,"stats":{"Line":1}},{"line":33,"address":[12919297],"length":1,"stats":{"Line":1}},{"line":46,"address":[12919392,12920787],"length":1,"stats":{"Line":1}},{"line":47,"address":[12919458],"length":1,"stats":{"Line":1}},{"line":48,"address":[12919466],"length":1,"stats":{"Line":1}},{"line":49,"address":[12919488],"length":1,"stats":{"Line":1}},{"line":51,"address":[12919920,12919510,12919634],"length":1,"stats":{"Line":3}},{"line":52,"address":[12919941],"length":1,"stats":{"Line":1}},{"line":53,"address":[10354745,10355447],"length":1,"stats":{"Line":2}},{"line":54,"address":[12920736],"length":1,"stats":{"Line":1}},{"line":56,"address":[12919959,12920107,12920022],"length":1,"stats":{"Line":2}},{"line":57,"address":[12920089,12920258,12920133],"length":1,"stats":{"Line":2}},{"line":58,"address":[10354980,10355125,10355033],"length":1,"stats":{"Line":3}},{"line":59,"address":[12920398,12920543],"length":1,"stats":{"Line":2}},{"line":60,"address":[12920551],"length":1,"stats":{"Line":1}},{"line":61,"address":[12920570],"length":1,"stats":{"Line":1}},{"line":68,"address":[12920816],"length":1,"stats":{"Line":1}},{"line":69,"address":[12920848,12920920],"length":1,"stats":{"Line":2}},{"line":72,"address":[12920944],"length":1,"stats":{"Line":0}},{"line":73,"address":[12920962],"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::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 =\n                    (doc_len - 1) * first_doc_accounts_len + parser.last_doc_accounts.len();\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 equities = parsed_data\n        .get(\"equity\")\n        .expect(format!(\"Account {:?} dont have key `equity`\", parsed_data).as_str())\n        .as_object()\n        .unwrap();\n    let mut parsed_equities = Vec::new();\n    for token in tokens.iter() {\n        let parsed_equity = equities.get(token).map_or(F::ZERO, |val| {\n            F::from_canonical_u64(val.as_str().unwrap().parse::\u003cu64\u003e().unwrap())\n        });\n        parsed_equities.push(parsed_equity);\n    }\n\n    let mut parsed_debts = Vec::new();\n    if let Some(debts) = parsed_data.get(\"debt\") {\n        let debts = debts.as_object().unwrap();\n        for token in tokens.iter() {\n            let parsed_debt = debts.get(token).map_or(F::ZERO, |val| {\n                F::from_canonical_u64(val.as_str().unwrap().parse::\u003cu64\u003e().unwrap())\n            });\n            parsed_debts.push(parsed_debt);\n        }\n    } else {\n        // if there is no debt, we fill it with zero\n        parsed_debts = vec![F::ZERO; parsed_equities.len()];\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 = \"4282aed0318e3271db2649f3a4a6855d9f83285d04ea541d741fd53a602eb73e\";\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 = \"bfad15056e9c14831ee4351f180b7cbd141a1b372ba8696c8505f7335282126d\";\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 = \"4282aed0318e3271db2649f3a4a6855d9f83285d04ea541d741fd53a602eb73e\";\n        let account_0 = accounts.get(0).unwrap();\n        assert_eq!(id_0, account_0.id);\n\n        let id_1 = \"bfad15056e9c14831ee4351f180b7cbd141a1b372ba8696c8505f7335282126d\";\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 = \"4282aed0318e3271db2649f3a4a6855d9f83285d04ea541d741fd53a602eb73e\";\n        let account_0 = accounts.get(0).unwrap();\n        assert_eq!(id_0, account_0.id);\n\n        let id_1 = \"bfad15056e9c14831ee4351f180b7cbd141a1b372ba8696c8505f7335282126d\";\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":[8753203,8753169,8751424],"length":1,"stats":{"Line":0}},{"line":42,"address":[12921063],"length":1,"stats":{"Line":0}},{"line":43,"address":[12921104,12921173],"length":1,"stats":{"Line":0}},{"line":44,"address":[12922837,12921502,12921535,12921230],"length":1,"stats":{"Line":0}},{"line":45,"address":[12921904,12922813,12921583,12921744],"length":1,"stats":{"Line":0}},{"line":46,"address":[12921985,12921869],"length":1,"stats":{"Line":0}},{"line":47,"address":[12922001,12922066],"length":1,"stats":{"Line":0}},{"line":48,"address":[12922124,12922506],"length":1,"stats":{"Line":0}},{"line":49,"address":[12922618],"length":1,"stats":{"Line":0}},{"line":50,"address":[12922661],"length":1,"stats":{"Line":0}},{"line":53,"address":[12922154,12922099],"length":1,"stats":{"Line":0}},{"line":54,"address":[12922206],"length":1,"stats":{"Line":0}},{"line":58,"address":[8752023,8751611],"length":1,"stats":{"Line":0}},{"line":59,"address":[12921645],"length":1,"stats":{"Line":0}},{"line":64,"address":[12922995,12922864],"length":1,"stats":{"Line":1}},{"line":65,"address":[12922902],"length":1,"stats":{"Line":1}},{"line":66,"address":[8753284],"length":1,"stats":{"Line":1}},{"line":70,"address":[12923024,12924769],"length":1,"stats":{"Line":1}},{"line":71,"address":[12923094],"length":1,"stats":{"Line":1}},{"line":72,"address":[12923108],"length":1,"stats":{"Line":1}},{"line":73,"address":[12923121],"length":1,"stats":{"Line":1}},{"line":74,"address":[12923135],"length":1,"stats":{"Line":1}},{"line":76,"address":[8753485],"length":1,"stats":{"Line":1}},{"line":78,"address":[12923225],"length":1,"stats":{"Line":0}},{"line":79,"address":[12924238,12923822,12924302,12923427,12924009,12924492,12924121],"length":1,"stats":{"Line":0}},{"line":80,"address":[12924741,12924177],"length":1,"stats":{"Line":0}},{"line":101,"address":[9192159,9186816,9191814],"length":1,"stats":{"Line":1}},{"line":102,"address":[9186997,9186874],"length":1,"stats":{"Line":2}},{"line":103,"address":[8755329],"length":1,"stats":{"Line":1}},{"line":104,"address":[9187211],"length":1,"stats":{"Line":0}},{"line":106,"address":[9187176,9187289],"length":1,"stats":{"Line":2}},{"line":108,"address":[9187305],"length":1,"stats":{"Line":1}},{"line":109,"address":[9187390],"length":1,"stats":{"Line":1}},{"line":113,"address":[9187466],"length":1,"stats":{"Line":1}},{"line":117,"address":[9187514],"length":1,"stats":{"Line":1}},{"line":120,"address":[9187816],"length":1,"stats":{"Line":1}},{"line":121,"address":[8756143],"length":1,"stats":{"Line":1}},{"line":122,"address":[9189215,9189409,9188256,9188871,9189004,9188672,9189136],"length":1,"stats":{"Line":6}},{"line":123,"address":[9189077,9189670],"length":1,"stats":{"Line":2}},{"line":124,"address":[9189678],"length":1,"stats":{"Line":1}},{"line":125,"address":[9189868],"length":1,"stats":{"Line":1}},{"line":126,"address":[9189876],"length":1,"stats":{"Line":1}},{"line":127,"address":[9191845],"length":1,"stats":{"Line":0}},{"line":129,"address":[9189882,9190254,9190039],"length":1,"stats":{"Line":3}},{"line":131,"address":[9190369,9190285],"length":1,"stats":{"Line":2}},{"line":133,"address":[9190377],"length":1,"stats":{"Line":1}},{"line":134,"address":[9190424],"length":1,"stats":{"Line":1}},{"line":136,"address":[9190391,9190624],"length":1,"stats":{"Line":2}},{"line":137,"address":[9190632],"length":1,"stats":{"Line":1}},{"line":138,"address":[9190822],"length":1,"stats":{"Line":1}},{"line":140,"address":[9190834,9191489],"length":1,"stats":{"Line":2}},{"line":141,"address":[9191156],"length":1,"stats":{"Line":1}},{"line":142,"address":[9190883],"length":1,"stats":{"Line":1}},{"line":143,"address":[9191152],"length":1,"stats":{"Line":1}},{"line":145,"address":[8759446,8759512],"length":1,"stats":{"Line":2}},{"line":146,"address":[8759550],"length":1,"stats":{"Line":1}},{"line":149,"address":[8759893,8759107,8759754],"length":1,"stats":{"Line":2}},{"line":152,"address":[8759867,8759931],"length":1,"stats":{"Line":2}},{"line":153,"address":[8759939],"length":1,"stats":{"Line":1}},{"line":154,"address":[8759947],"length":1,"stats":{"Line":1}},{"line":156,"address":[8756357,8760191],"length":1,"stats":{"Line":0}},{"line":159,"address":[8759971],"length":1,"stats":{"Line":1}},{"line":162,"address":[8760400],"length":1,"stats":{"Line":1}},{"line":163,"address":[12925934,12925418,12926030,12926126,12925543,12925487,12926222,12925838,12925742,12925270,12924939,12925583,12926314],"length":1,"stats":{"Line":13}},{"line":169,"address":[8762368],"length":1,"stats":{"Line":1}},{"line":170,"address":[8762373],"length":1,"stats":{"Line":1}},{"line":174,"address":[8762384,8768461],"length":1,"stats":{"Line":1}},{"line":180,"address":[8762926,8763092,8763275,8763170,8762574,8763318,8763612],"length":1,"stats":{"Line":7}},{"line":181,"address":[9218416],"length":1,"stats":{"Line":1}},{"line":184,"address":[9219223,9218430,9219152],"length":1,"stats":{"Line":2}},{"line":185,"address":[9219267,9219333,9219197],"length":1,"stats":{"Line":2}},{"line":186,"address":[9219321,9219349],"length":1,"stats":{"Line":1}},{"line":188,"address":[8764166,8764410],"length":1,"stats":{"Line":2}},{"line":190,"address":[9219519],"length":1,"stats":{"Line":1}},{"line":191,"address":[8764329],"length":1,"stats":{"Line":1}},{"line":192,"address":[9219758,9219665,9223701,9219584],"length":1,"stats":{"Line":3}},{"line":194,"address":[9219886,9223499],"length":1,"stats":{"Line":0}},{"line":195,"address":[9223656,9223706],"length":1,"stats":{"Line":0}},{"line":197,"address":[9219828],"length":1,"stats":{"Line":1}},{"line":199,"address":[9219840,9219928],"length":1,"stats":{"Line":2}},{"line":200,"address":[9219971,9220094],"length":1,"stats":{"Line":1}},{"line":201,"address":[9220155,9220052],"length":1,"stats":{"Line":2}},{"line":203,"address":[9220258,9219933,9220548],"length":1,"stats":{"Line":2}},{"line":204,"address":[8766371],"length":1,"stats":{"Line":1}},{"line":211,"address":[8766149,8768199],"length":1,"stats":{"Line":2}},{"line":212,"address":[9222328],"length":1,"stats":{"Line":1}},{"line":214,"address":[8767178],"length":1,"stats":{"Line":1}},{"line":216,"address":[8767470,8767296,8767427],"length":1,"stats":{"Line":2}},{"line":217,"address":[8767726,8767839],"length":1,"stats":{"Line":2}},{"line":218,"address":[8767434,8767499],"length":1,"stats":{"Line":2}},{"line":219,"address":[9222972],"length":1,"stats":{"Line":1}},{"line":221,"address":[9223329,9223141],"length":1,"stats":{"Line":2}},{"line":222,"address":[8768011],"length":1,"stats":{"Line":1}},{"line":223,"address":[8768085,8768165],"length":1,"stats":{"Line":1}},{"line":224,"address":[8768132],"length":1,"stats":{"Line":1}},{"line":226,"address":[8767342,8767273,8767390],"length":1,"stats":{"Line":0}},{"line":229,"address":[9223405,9223457,9223470],"length":1,"stats":{"Line":2}},{"line":232,"address":[9222277],"length":1,"stats":{"Line":1}},{"line":237,"address":[8768775,8768496],"length":1,"stats":{"Line":1}},{"line":241,"address":[8768544],"length":1,"stats":{"Line":1}},{"line":242,"address":[12926846,12927032,12926918],"length":1,"stats":{"Line":3}},{"line":243,"address":[12927045],"length":1,"stats":{"Line":1}},{"line":245,"address":[12926993],"length":1,"stats":{"Line":1}},{"line":249,"address":[12927120,12929628,12929559],"length":1,"stats":{"Line":1}},{"line":250,"address":[8769357,8769163,8768847],"length":1,"stats":{"Line":3}},{"line":252,"address":[12927275,12927392],"length":1,"stats":{"Line":2}},{"line":256,"address":[8769412,8769728,8769866],"length":1,"stats":{"Line":3}},{"line":258,"address":[12927844,12927961],"length":1,"stats":{"Line":2}},{"line":261,"address":[12928219],"length":1,"stats":{"Line":1}},{"line":262,"address":[12928244,12928331,12928526],"length":1,"stats":{"Line":3}},{"line":263,"address":[12928542,12929648,12929573],"length":1,"stats":{"Line":3}},{"line":264,"address":[12929657,12929727],"length":1,"stats":{"Line":2}},{"line":266,"address":[8771264],"length":1,"stats":{"Line":1}},{"line":269,"address":[12928499],"length":1,"stats":{"Line":1}},{"line":270,"address":[12928561,12928646,12929327],"length":1,"stats":{"Line":3}},{"line":271,"address":[12928830,12928699],"length":1,"stats":{"Line":2}},{"line":272,"address":[8770510,8770735],"length":1,"stats":{"Line":2}},{"line":273,"address":[12929904,12929079],"length":1,"stats":{"Line":2}},{"line":274,"address":[8771577,8771647],"length":1,"stats":{"Line":2}},{"line":276,"address":[12929133],"length":1,"stats":{"Line":1}},{"line":280,"address":[12929162,12928715],"length":1,"stats":{"Line":2}},{"line":283,"address":[12929348,12929029],"length":1,"stats":{"Line":2}},{"line":291,"address":[12930160],"length":1,"stats":{"Line":0}},{"line":297,"address":[12930192],"length":1,"stats":{"Line":0}},{"line":298,"address":[12930197],"length":1,"stats":{"Line":0}}],"covered":99,"coverable":125},{"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":[9181854,9177856,9180393],"length":1,"stats":{"Line":0}},{"line":41,"address":[9177911],"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":[9178289],"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":[9178980,9179857,9179728,9179396,9179924,9180115,9179595],"length":1,"stats":{"Line":0}},{"line":56,"address":[],"length":0,"stats":{"Line":0}},{"line":60,"address":[9178400],"length":1,"stats":{"Line":0}},{"line":61,"address":[],"length":0,"stats":{"Line":0}},{"line":62,"address":[],"length":0,"stats":{"Line":0}},{"line":68,"address":[12930208,12930443],"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":[8924960],"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":[8925234,8924992],"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":[8924640,8924799],"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":[8927127,8926256],"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":[8926543],"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":[8925824,8926205],"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 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":[8772176],"length":1,"stats":{"Line":1}},{"line":6,"address":[12930568],"length":1,"stats":{"Line":1}},{"line":7,"address":[12930579],"length":1,"stats":{"Line":0}},{"line":9,"address":[12930619,12930642,12930591],"length":1,"stats":{"Line":2}},{"line":10,"address":[12930745,12930668,12930634],"length":1,"stats":{"Line":3}},{"line":11,"address":[12930663],"length":1,"stats":{"Line":1}},{"line":13,"address":[12930680,12930750],"length":1,"stats":{"Line":1}},{"line":19,"address":[12930768],"length":1,"stats":{"Line":1}},{"line":20,"address":[12930790,12930885],"length":1,"stats":{"Line":1}},{"line":21,"address":[12930864,12930905,12931044],"length":1,"stats":{"Line":2}},{"line":25,"address":[12931072,12931627],"length":1,"stats":{"Line":1}},{"line":26,"address":[12931677,12931178,12931664,12931102],"length":1,"stats":{"Line":4}},{"line":28,"address":[12931294,12931226],"length":1,"stats":{"Line":2}},{"line":30,"address":[12931728,12931747,12931915],"length":1,"stats":{"Line":3}},{"line":33,"address":[12931377,12931442],"length":1,"stats":{"Line":2}},{"line":34,"address":[12931580,12931506],"length":1,"stats":{"Line":0}},{"line":37,"address":[12931453],"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":[8685488,8686086,8686726,8686128],"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":[8685807,8686447],"length":1,"stats":{"Line":0}},{"line":26,"address":[12858220,12858860],"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":[12860277,12858976,12860249,12859605,12859577,12859648],"length":1,"stats":{"Line":2}},{"line":43,"address":[],"length":0,"stats":{"Line":4}},{"line":44,"address":[],"length":0,"stats":{"Line":8}},{"line":45,"address":[12860362,12860498,12860586,12860764],"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":[12857571,12855712,12853792,12855688],"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":[12854092,12855980],"length":1,"stats":{"Line":0}},{"line":59,"address":[12856625,12857318,12854737,12854342,12855042,12855176,12856230,12854924,12857061,12855243,12856812,12857128,12855434,12856930],"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":[789225,789668,789967,790327,790077,789855,789042,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":[12660920,12657600,12659599],"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":[12657803],"length":1,"stats":{"Line":1}},{"line":25,"address":[4460603],"length":1,"stats":{"Line":1}},{"line":27,"address":[13565643],"length":1,"stats":{"Line":1}},{"line":28,"address":[4460690,4460747],"length":1,"stats":{"Line":2}},{"line":29,"address":[12658098],"length":1,"stats":{"Line":1}},{"line":30,"address":[13566043],"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,4461552,4461822,4461623],"length":1,"stats":{"Line":4}},{"line":36,"address":[4461559],"length":1,"stats":{"Line":1}},{"line":39,"address":[13566957,13568572,13566770],"length":1,"stats":{"Line":2}},{"line":40,"address":[4461881,4462935],"length":1,"stats":{"Line":1}},{"line":41,"address":[13567510],"length":1,"stats":{"Line":0}},{"line":43,"address":[4462502],"length":1,"stats":{"Line":0}},{"line":44,"address":[13567763],"length":1,"stats":{"Line":0}},{"line":45,"address":[4462754,4462958,4463298],"length":1,"stats":{"Line":0}},{"line":47,"address":[4462948,4462645,4462818],"length":1,"stats":{"Line":0}},{"line":49,"address":[4461889,4462919,4462594,4463326],"length":1,"stats":{"Line":1}},{"line":50,"address":[4462173,4461977],"length":1,"stats":{"Line":1}},{"line":52,"address":[4462082,4461922],"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":[12854800],"length":1,"stats":{"Line":1}},{"line":55,"address":[13762616],"length":1,"stats":{"Line":1}},{"line":60,"address":[4298160,4298279],"length":1,"stats":{"Line":1}},{"line":61,"address":[13762653],"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":[13762803],"length":1,"stats":{"Line":1}},{"line":89,"address":[4298432,4299754,4299686],"length":1,"stats":{"Line":1}},{"line":90,"address":[4298454,4298575],"length":1,"stats":{"Line":2}},{"line":92,"address":[13763124,13763067],"length":1,"stats":{"Line":2}},{"line":93,"address":[],"length":0,"stats":{"Line":0}},{"line":94,"address":[13763283,13763219,13763616],"length":1,"stats":{"Line":2}},{"line":95,"address":[4298904,4299090],"length":1,"stats":{"Line":0}},{"line":97,"address":[12856003,12855832],"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":[12856180,12856268],"length":1,"stats":{"Line":2}},{"line":103,"address":[13764116],"length":1,"stats":{"Line":1}},{"line":120,"address":[12856464],"length":1,"stats":{"Line":1}},{"line":131,"address":[],"length":0,"stats":{"Line":0}},{"line":132,"address":[],"length":0,"stats":{"Line":0}},{"line":133,"address":[13765737,13766034,13765314],"length":1,"stats":{"Line":0}},{"line":134,"address":[],"length":0,"stats":{"Line":0}},{"line":136,"address":[13765739,13765825,13765451,13765552],"length":1,"stats":{"Line":0}},{"line":138,"address":[13765805,13766631,13766159,13766309],"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 USER_PROOF_DIRNAME: \u0026str = \"user_proofs\";\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":"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    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: ZkPorCommitCommands,\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 ZkPorCommitCommands {\n    fn execute(\u0026self) -\u003e std::result::Result\u003c(), PoRError\u003e {\n        match self {\n            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_file = PathBuf::from_str(\u0026output_path).unwrap();\n                prove(prover_cfg, output_file)\n            }\n\n            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)\n            }\n\n            ZkPorCommitCommands::VerifyUser { global_proof_path, user_proof_path_pattern } =\u003e {\n                let global_proof_path = PathBuf::from_str(\u0026global_proof_path).unwrap();\n                verify_user(global_proof_path, user_proof_path_pattern)\n            }\n        }\n    }\n}\n\nfn main() -\u003e std::result::Result\u003c(), PoRError\u003e {\n    let cli = Cli::parse();\n    let start = std::time::Instant::now();\n    let result = cli.command.execute();\n    println!(\"result: {:?}, elapsed: {:?}\", result, start.elapsed());\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_PROOF_FILENAME, RECURSION_BRANCHOUT_NUM, USER_PROOF_DIRNAME,\n};\nuse indicatif::ProgressBar;\nuse plonky2::hash::hash_types::HashOut;\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, 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    // 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":36,"address":[8948000],"length":1,"stats":{"Line":0}},{"line":37,"address":[8948024],"length":1,"stats":{"Line":0}},{"line":38,"address":[8948044],"length":1,"stats":{"Line":0}},{"line":39,"address":[8948104,8948076],"length":1,"stats":{"Line":0}},{"line":42,"address":[8949299,8948128],"length":1,"stats":{"Line":0}},{"line":43,"address":[8949297,8949328,8948224,8949336,8948158,8948311],"length":1,"stats":{"Line":0}},{"line":44,"address":[8948299,8948445,8949360,8949368,8949295],"length":1,"stats":{"Line":0}},{"line":46,"address":[8948734],"length":1,"stats":{"Line":0}},{"line":47,"address":[8949185],"length":1,"stats":{"Line":0}},{"line":48,"address":[8948743],"length":1,"stats":{"Line":0}},{"line":49,"address":[8949064],"length":1,"stats":{"Line":0}},{"line":51,"address":[8948802,8948751,8948938],"length":1,"stats":{"Line":0}},{"line":55,"address":[8948773],"length":1,"stats":{"Line":0}},{"line":58,"address":[8949392,8950839,8985761],"length":1,"stats":{"Line":0}},{"line":59,"address":[8949506],"length":1,"stats":{"Line":0}},{"line":61,"address":[8949787],"length":1,"stats":{"Line":0}},{"line":62,"address":[8949902,8949822],"length":1,"stats":{"Line":0}},{"line":63,"address":[8985494,8949950,8950074],"length":1,"stats":{"Line":0}},{"line":66,"address":[8950203,8951021,8950023],"length":1,"stats":{"Line":0}},{"line":67,"address":[8950674,8950441],"length":1,"stats":{"Line":0}},{"line":68,"address":[8950272],"length":1,"stats":{"Line":0}},{"line":69,"address":[8950377],"length":1,"stats":{"Line":0}},{"line":72,"address":[8950990,8950279],"length":1,"stats":{"Line":0}},{"line":75,"address":[8951042,8950805],"length":1,"stats":{"Line":0}},{"line":76,"address":[8951050],"length":1,"stats":{"Line":0}},{"line":77,"address":[8951097],"length":1,"stats":{"Line":0}},{"line":78,"address":[8951117],"length":1,"stats":{"Line":0}},{"line":83,"address":[8951318],"length":1,"stats":{"Line":0}},{"line":84,"address":[8951137],"length":1,"stats":{"Line":0}},{"line":86,"address":[8951251],"length":1,"stats":{"Line":0}},{"line":90,"address":[8951429],"length":1,"stats":{"Line":0}},{"line":92,"address":[8951492],"length":1,"stats":{"Line":0}},{"line":94,"address":[8951573],"length":1,"stats":{"Line":0}},{"line":102,"address":[8985447,8951739],"length":1,"stats":{"Line":0}},{"line":106,"address":[8951768],"length":1,"stats":{"Line":0}},{"line":108,"address":[8951807,8951871],"length":1,"stats":{"Line":0}},{"line":110,"address":[8952646,8952776,8953074,8953344,8952031,8953150,8952447],"length":1,"stats":{"Line":0}},{"line":118,"address":[8952841],"length":1,"stats":{"Line":0}},{"line":121,"address":[8954828],"length":1,"stats":{"Line":0}},{"line":129,"address":[8954601,8955635],"length":1,"stats":{"Line":0}},{"line":130,"address":[8955650],"length":1,"stats":{"Line":0}},{"line":131,"address":[8955662],"length":1,"stats":{"Line":0}},{"line":134,"address":[8955701],"length":1,"stats":{"Line":0}},{"line":135,"address":[8955720],"length":1,"stats":{"Line":0}},{"line":136,"address":[8955811,8955727],"length":1,"stats":{"Line":0}},{"line":137,"address":[8955832,8955935,8985290],"length":1,"stats":{"Line":0}},{"line":138,"address":[8977493,8955959,8977447],"length":1,"stats":{"Line":0}},{"line":139,"address":[8977514,8977454],"length":1,"stats":{"Line":0}},{"line":142,"address":[8977522],"length":1,"stats":{"Line":0}},{"line":144,"address":[8977598],"length":1,"stats":{"Line":0}},{"line":145,"address":[8977641],"length":1,"stats":{"Line":0}},{"line":146,"address":[8977731,8977979],"length":1,"stats":{"Line":0}},{"line":147,"address":[8978622,8979493,8978007,8978752,8978893,8978969,8978423],"length":1,"stats":{"Line":0}},{"line":148,"address":[8978817,8979794],"length":1,"stats":{"Line":0}},{"line":151,"address":[8977701,8979878],"length":1,"stats":{"Line":0}},{"line":153,"address":[8980628,8981588,8980212,8981098,8980957,8981174,8980827],"length":1,"stats":{"Line":0}},{"line":160,"address":[8981889,8981022],"length":1,"stats":{"Line":0}},{"line":162,"address":[8985967,8985904],"length":1,"stats":{"Line":0}},{"line":165,"address":[8981973,8982129],"length":1,"stats":{"Line":0}},{"line":166,"address":[8982145],"length":1,"stats":{"Line":0}},{"line":168,"address":[8982249,8982313],"length":1,"stats":{"Line":0}},{"line":170,"address":[8982321],"length":1,"stats":{"Line":0}},{"line":173,"address":[8986096,8986126,8986461],"length":1,"stats":{"Line":0}},{"line":174,"address":[8986173,8986225],"length":1,"stats":{"Line":0}},{"line":175,"address":[8986496,8986296,8986530,8986199],"length":1,"stats":{"Line":0}},{"line":176,"address":[8986540],"length":1,"stats":{"Line":0}},{"line":178,"address":[8986361],"length":1,"stats":{"Line":0}},{"line":181,"address":[8982469],"length":1,"stats":{"Line":0}},{"line":183,"address":[8982555],"length":1,"stats":{"Line":0}},{"line":186,"address":[8982714,8982650],"length":1,"stats":{"Line":0}},{"line":188,"address":[8986624,8986639,8982896],"length":1,"stats":{"Line":0}},{"line":189,"address":[8986794,8986684],"length":1,"stats":{"Line":0}},{"line":191,"address":[8986710],"length":1,"stats":{"Line":0}},{"line":192,"address":[8986740],"length":1,"stats":{"Line":0}},{"line":193,"address":[8986777],"length":1,"stats":{"Line":0}},{"line":194,"address":[8986886],"length":1,"stats":{"Line":0}},{"line":198,"address":[8983161],"length":1,"stats":{"Line":0}},{"line":200,"address":[8984364],"length":1,"stats":{"Line":0}},{"line":207,"address":[8984149],"length":1,"stats":{"Line":0}},{"line":208,"address":[8985187,8985245],"length":1,"stats":{"Line":0}},{"line":210,"address":[8955940],"length":1,"stats":{"Line":0}},{"line":212,"address":[8957477],"length":1,"stats":{"Line":0}},{"line":219,"address":[8956959,8957944],"length":1,"stats":{"Line":0}},{"line":221,"address":[8957968],"length":1,"stats":{"Line":0}},{"line":222,"address":[8957991],"length":1,"stats":{"Line":0}},{"line":223,"address":[8958013],"length":1,"stats":{"Line":0}},{"line":224,"address":[8958069,8958133],"length":1,"stats":{"Line":0}},{"line":227,"address":[8958141,8958349,8977314],"length":1,"stats":{"Line":0}},{"line":228,"address":[8969567,8958365],"length":1,"stats":{"Line":0}},{"line":229,"address":[8969582],"length":1,"stats":{"Line":0}},{"line":230,"address":[8969630,8969975],"length":1,"stats":{"Line":0}},{"line":233,"address":[8969884,8969755],"length":1,"stats":{"Line":0}},{"line":238,"address":[8970100],"length":1,"stats":{"Line":0}},{"line":240,"address":[8970898,8971028,8971626,8971212,8970283,8971136,8970699],"length":1,"stats":{"Line":0}},{"line":247,"address":[8971911,8971093],"length":1,"stats":{"Line":0}},{"line":248,"address":[8971958,8972165],"length":1,"stats":{"Line":0}},{"line":249,"address":[8973676,8972609,8972938,8973155,8973079,8972193,8972808],"length":1,"stats":{"Line":0}},{"line":251,"address":[8973977,8973003],"length":1,"stats":{"Line":0}},{"line":254,"address":[8971929,8974169],"length":1,"stats":{"Line":0}},{"line":255,"address":[8974185],"length":1,"stats":{"Line":0}},{"line":256,"address":[8986997,8974289,8986960,8974369],"length":1,"stats":{"Line":0}},{"line":257,"address":[8987007],"length":1,"stats":{"Line":0}},{"line":258,"address":[8987033],"length":1,"stats":{"Line":0}},{"line":260,"address":[8987070,8987202],"length":1,"stats":{"Line":0}},{"line":262,"address":[8974454],"length":1,"stats":{"Line":0}},{"line":265,"address":[8974488],"length":1,"stats":{"Line":0}},{"line":266,"address":[8974552],"length":1,"stats":{"Line":0}},{"line":272,"address":[8975085,8974695],"length":1,"stats":{"Line":0}},{"line":273,"address":[8974679],"length":1,"stats":{"Line":0}},{"line":275,"address":[8974759,8974986,8974857],"length":1,"stats":{"Line":0}},{"line":281,"address":[8975009,8975134],"length":1,"stats":{"Line":0}},{"line":283,"address":[8975161],"length":1,"stats":{"Line":0}},{"line":284,"address":[8975281],"length":1,"stats":{"Line":0}},{"line":286,"address":[8976706],"length":1,"stats":{"Line":0}},{"line":294,"address":[8958334,8958402],"length":1,"stats":{"Line":0}},{"line":295,"address":[8958439,8969473,8969355],"length":1,"stats":{"Line":0}},{"line":297,"address":[8958424,8958530],"length":1,"stats":{"Line":0}},{"line":300,"address":[8958538,8958618],"length":1,"stats":{"Line":0}},{"line":301,"address":[8958634],"length":1,"stats":{"Line":0}},{"line":303,"address":[8958818,8958703],"length":1,"stats":{"Line":0}},{"line":304,"address":[8958834],"length":1,"stats":{"Line":0}},{"line":305,"address":[8959034,8958938],"length":1,"stats":{"Line":0}},{"line":306,"address":[8959097],"length":1,"stats":{"Line":0}},{"line":308,"address":[8959131],"length":1,"stats":{"Line":0}},{"line":309,"address":[8959302,8959187,8959562],"length":1,"stats":{"Line":0}},{"line":310,"address":[8959910,8960326,8960784,8960525,8960655,8960860,8961118],"length":1,"stats":{"Line":0}},{"line":312,"address":[8961406,8960728],"length":1,"stats":{"Line":0}},{"line":314,"address":[8961371],"length":1,"stats":{"Line":0}},{"line":317,"address":[8962767],"length":1,"stats":{"Line":0}},{"line":323,"address":[8963226,8962441],"length":1,"stats":{"Line":0}},{"line":326,"address":[8963260],"length":1,"stats":{"Line":0}},{"line":339,"address":[8963663,8963504],"length":1,"stats":{"Line":0}},{"line":341,"address":[8963671],"length":1,"stats":{"Line":0}},{"line":342,"address":[8963851,8963772],"length":1,"stats":{"Line":0}},{"line":343,"address":[8965033,8964695,8965227,8964080,8964496,8964825,8964957],"length":1,"stats":{"Line":0}},{"line":344,"address":[8964890,8965495],"length":1,"stats":{"Line":0}},{"line":345,"address":[8965510],"length":1,"stats":{"Line":0}},{"line":346,"address":[8966331,8966461,8966745,8966132,8967003,8965716,8966669],"length":1,"stats":{"Line":0}},{"line":348,"address":[8966542,8969085,8967272,8967476],"length":1,"stats":{"Line":0}},{"line":349,"address":[8968020,8968219,8968349,8968479,8968813,8967604,8968555],"length":1,"stats":{"Line":0}},{"line":351,"address":[8968422],"length":1,"stats":{"Line":0}},{"line":354,"address":[8991635,8987232,8991434],"length":1,"stats":{"Line":0}},{"line":360,"address":[8987410,8987314],"length":1,"stats":{"Line":0}},{"line":362,"address":[8987533,8987450],"length":1,"stats":{"Line":0}},{"line":363,"address":[8987581,8987648,8987791,8991503,8991656,8991648],"length":1,"stats":{"Line":0}},{"line":366,"address":[8988612,8988390],"length":1,"stats":{"Line":0}},{"line":367,"address":[8987773,8988243,8988302],"length":1,"stats":{"Line":0}},{"line":368,"address":[8988637,8991443,8991680,8988486,8988250,8988325,8991688],"length":1,"stats":{"Line":0}},{"line":373,"address":[8987282],"length":1,"stats":{"Line":0}},{"line":374,"address":[8988664],"length":1,"stats":{"Line":0}},{"line":376,"address":[8988908],"length":1,"stats":{"Line":0}},{"line":377,"address":[8988719],"length":1,"stats":{"Line":0}},{"line":379,"address":[8988833],"length":1,"stats":{"Line":0}},{"line":385,"address":[8989019],"length":1,"stats":{"Line":0}},{"line":386,"address":[8989102],"length":1,"stats":{"Line":0}},{"line":390,"address":[8989146],"length":1,"stats":{"Line":0}},{"line":392,"address":[8990083,8989956,8990201,8990265,8990456,8989341,8989757],"length":1,"stats":{"Line":0}},{"line":394,"address":[8990139],"length":1,"stats":{"Line":0}},{"line":395,"address":[8990722,8990787],"length":1,"stats":{"Line":0}},{"line":398,"address":[8990795],"length":1,"stats":{"Line":0}},{"line":399,"address":[8990862],"length":1,"stats":{"Line":0}},{"line":400,"address":[8990874,8990935],"length":1,"stats":{"Line":0}},{"line":401,"address":[8990943],"length":1,"stats":{"Line":0}},{"line":402,"address":[8991019],"length":1,"stats":{"Line":0}},{"line":404,"address":[8991712,8991159,8991247],"length":1,"stats":{"Line":0}},{"line":405,"address":[8991856,8994169,8994219,8991767],"length":1,"stats":{"Line":0}},{"line":406,"address":[8992301,8991889],"length":1,"stats":{"Line":0}},{"line":408,"address":[8992104,8992233],"length":1,"stats":{"Line":0}},{"line":413,"address":[8992674,8992415,8992527],"length":1,"stats":{"Line":0}},{"line":415,"address":[8992697,8993065],"length":1,"stats":{"Line":0}},{"line":416,"address":[8992868,8992997],"length":1,"stats":{"Line":0}},{"line":420,"address":[8993473,8993532,8993608,8993217,8993992],"length":1,"stats":{"Line":0}},{"line":421,"address":[8993926,8993797],"length":1,"stats":{"Line":0}},{"line":426,"address":[8991829],"length":1,"stats":{"Line":0}},{"line":428,"address":[8991361,8991414],"length":1,"stats":{"Line":0}},{"line":430,"address":[8990995],"length":1,"stats":{"Line":0}},{"line":432,"address":[8991076],"length":1,"stats":{"Line":0}}],"covered":0,"coverable":177},{"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) -\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    println!(\"successfully identify {} user proof files\", proof_file_num);\n\n    let bar = ProgressBar::new(proof_file_num as u64);\n    let chunk_size: usize = num_cpus::get();\n    user_proof_paths.chunks(chunk_size).for_each(|chunks| {\n        chunks.par_iter().for_each(|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            if let Err(e) = proof.verify_merkle_proof(root_hash) {\n                panic!(\n                    \"fail to verify the user proof on path {:?} due to error {:?}\",\n                    user_proof_path, e\n                )\n            }\n        });\n        bar.inc(chunks.len() as u64);\n    });\n    bar.finish();\n    println!(\n        \"successfully verify {} user proofs with file pattern {}\",\n        proof_file_num, user_proof_path_pattern\n    );\n\n    Ok(())\n}\n\npub fn verify_global(global_proof_path: PathBuf) -\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    println!(\n        \"start to reconstruct the circuit with {} recursive levels for round {}\",\n        recursive_circuit_configs.len(),\n        round_num\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    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    Ok(())\n}\n","traces":[{"line":25,"address":[8877440,8878252],"length":1,"stats":{"Line":0}},{"line":26,"address":[8877483],"length":1,"stats":{"Line":0}},{"line":29,"address":[8877777,8877723,8877567,8877507],"length":1,"stats":{"Line":0}},{"line":30,"address":[8877841],"length":1,"stats":{"Line":0}},{"line":31,"address":[8878092,8877973],"length":1,"stats":{"Line":0}},{"line":32,"address":[8878029,8878097],"length":1,"stats":{"Line":0}},{"line":36,"address":[8877886],"length":1,"stats":{"Line":0}},{"line":39,"address":[8880478,8878288,8880397],"length":1,"stats":{"Line":0}},{"line":43,"address":[8878593,8878327],"length":1,"stats":{"Line":0}},{"line":44,"address":[8878600],"length":1,"stats":{"Line":0}},{"line":47,"address":[8878983,8878635],"length":1,"stats":{"Line":0}},{"line":48,"address":[8880441,8878754,8878915,8879021],"length":1,"stats":{"Line":0}},{"line":50,"address":[8879092],"length":1,"stats":{"Line":0}},{"line":51,"address":[8879135],"length":1,"stats":{"Line":0}},{"line":52,"address":[8880504,8879418,8879192,8880496],"length":1,"stats":{"Line":0}},{"line":54,"address":[8879395,8879588],"length":1,"stats":{"Line":0}},{"line":55,"address":[8879706],"length":1,"stats":{"Line":0}},{"line":57,"address":[8879775],"length":1,"stats":{"Line":0}},{"line":58,"address":[8879802,8879863],"length":1,"stats":{"Line":0}},{"line":59,"address":[8879879,8880528],"length":1,"stats":{"Line":0}},{"line":60,"address":[8880581,8881716,8880640,8881839],"length":1,"stats":{"Line":0}},{"line":61,"address":[8880835,8880665],"length":1,"stats":{"Line":0}},{"line":62,"address":[8880842],"length":1,"stats":{"Line":0}},{"line":63,"address":[8880853],"length":1,"stats":{"Line":0}},{"line":64,"address":[8881265,8881166],"length":1,"stats":{"Line":0}},{"line":65,"address":[8881622],"length":1,"stats":{"Line":0}},{"line":71,"address":[8880615],"length":1,"stats":{"Line":0}},{"line":73,"address":[8879964],"length":1,"stats":{"Line":0}},{"line":74,"address":[8880203],"length":1,"stats":{"Line":0}},{"line":79,"address":[8880306],"length":1,"stats":{"Line":0}},{"line":82,"address":[8885199,8885061,8881888],"length":1,"stats":{"Line":0}},{"line":83,"address":[8881919,8882249],"length":1,"stats":{"Line":0}},{"line":84,"address":[8882256],"length":1,"stats":{"Line":0}},{"line":87,"address":[8882509,8882291],"length":1,"stats":{"Line":0}},{"line":89,"address":[8882517],"length":1,"stats":{"Line":0}},{"line":90,"address":[8885149,8882623],"length":1,"stats":{"Line":0}},{"line":93,"address":[8882528],"length":1,"stats":{"Line":0}},{"line":94,"address":[8882552],"length":1,"stats":{"Line":0}},{"line":95,"address":[8882568],"length":1,"stats":{"Line":0}},{"line":96,"address":[8882584],"length":1,"stats":{"Line":0}},{"line":97,"address":[8882616,8882693],"length":1,"stats":{"Line":0}},{"line":101,"address":[8882709,8882770],"length":1,"stats":{"Line":0}},{"line":106,"address":[8883083],"length":1,"stats":{"Line":0}},{"line":111,"address":[8883155],"length":1,"stats":{"Line":0}},{"line":114,"address":[8883339,8883402],"length":1,"stats":{"Line":0}},{"line":116,"address":[8883410],"length":1,"stats":{"Line":0}},{"line":117,"address":[8883440],"length":1,"stats":{"Line":0}},{"line":118,"address":[8883601],"length":1,"stats":{"Line":0}},{"line":121,"address":[8883804],"length":1,"stats":{"Line":0}},{"line":127,"address":[8883889,8883952],"length":1,"stats":{"Line":0}},{"line":128,"address":[8883902],"length":1,"stats":{"Line":0}},{"line":129,"address":[8884026,8883963],"length":1,"stats":{"Line":0}},{"line":130,"address":[8883976],"length":1,"stats":{"Line":0}},{"line":131,"address":[8884037],"length":1,"stats":{"Line":0}},{"line":132,"address":[8884229],"length":1,"stats":{"Line":0}},{"line":135,"address":[8884679,8884401,8884544],"length":1,"stats":{"Line":0}},{"line":138,"address":[8884996],"length":1,"stats":{"Line":0}}],"covered":0,"coverable":57},{"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":[10178585,10178614,10177744],"length":1,"stats":{"Line":1}},{"line":24,"address":[12155654,12156576,12156608],"length":1,"stats":{"Line":3}},{"line":26,"address":[12156656,12156624,12155753],"length":1,"stats":{"Line":3}},{"line":28,"address":[12155813],"length":1,"stats":{"Line":1}},{"line":31,"address":[12156506,12155906,12155848],"length":1,"stats":{"Line":2}},{"line":37,"address":[12156980,12156672],"length":1,"stats":{"Line":0}},{"line":40,"address":[10178799,10178871],"length":1,"stats":{"Line":0}},{"line":41,"address":[12156802,12156866],"length":1,"stats":{"Line":0}},{"line":45,"address":[12157008,12157319],"length":1,"stats":{"Line":1}},{"line":47,"address":[12157035],"length":1,"stats":{"Line":1}},{"line":48,"address":[12157130,12157066],"length":1,"stats":{"Line":2}},{"line":49,"address":[12157146,12157205],"length":1,"stats":{"Line":2}},{"line":54,"address":[12157344,12158443],"length":1,"stats":{"Line":1}},{"line":55,"address":[12157479,12157394],"length":1,"stats":{"Line":1}},{"line":57,"address":[12157973,12157507,12158259,12157628,12158465,12157858,12157743,12157415,12158042],"length":1,"stats":{"Line":2}},{"line":58,"address":[12157575,12157436],"length":1,"stats":{"Line":2}},{"line":59,"address":[12157690,12157590],"length":1,"stats":{"Line":2}},{"line":60,"address":[12157805,12157705],"length":1,"stats":{"Line":2}},{"line":61,"address":[12157920,12157820],"length":1,"stats":{"Line":2}},{"line":62,"address":[10180111,10180011],"length":1,"stats":{"Line":2}},{"line":65,"address":[12158334,12158233],"length":1,"stats":{"Line":2}},{"line":67,"address":[12158507,12158688,12158480],"length":1,"stats":{"Line":3}},{"line":72,"address":[12158704],"length":1,"stats":{"Line":0}},{"line":77,"address":[10180803],"length":1,"stats":{"Line":0}},{"line":80,"address":[12158912,12158848],"length":1,"stats":{"Line":0}},{"line":81,"address":[10180976],"length":1,"stats":{"Line":0}},{"line":83,"address":[12159309,12159234],"length":1,"stats":{"Line":0}},{"line":86,"address":[12158813],"length":1,"stats":{"Line":0}},{"line":90,"address":[10182615,10182646,10181376],"length":1,"stats":{"Line":1}},{"line":91,"address":[12159383],"length":1,"stats":{"Line":1}},{"line":92,"address":[10181476,10181552],"length":1,"stats":{"Line":2}},{"line":93,"address":[12159598,12159516,12160415],"length":1,"stats":{"Line":3}},{"line":94,"address":[12159738],"length":1,"stats":{"Line":1}},{"line":95,"address":[12159781],"length":1,"stats":{"Line":1}},{"line":96,"address":[10181901,10181982],"length":1,"stats":{"Line":2}},{"line":97,"address":[12160066,12160424],"length":1,"stats":{"Line":2}},{"line":98,"address":[12160431,12160476],"length":1,"stats":{"Line":1}},{"line":99,"address":[12160460,12160501],"length":1,"stats":{"Line":2}},{"line":100,"address":[12160524],"length":1,"stats":{"Line":1}},{"line":103,"address":[12160020],"length":1,"stats":{"Line":1}},{"line":104,"address":[10182099],"length":1,"stats":{"Line":1}},{"line":106,"address":[12161039,12160656,12160102,12161163,12160784],"length":1,"stats":{"Line":5}},{"line":107,"address":[12160196],"length":1,"stats":{"Line":1}},{"line":109,"address":[12159688],"length":1,"stats":{"Line":1}},{"line":112,"address":[12161184],"length":1,"stats":{"Line":0}},{"line":113,"address":[12161291],"length":1,"stats":{"Line":0}},{"line":115,"address":[12161227],"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\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 = (batch_num as f64).log(RECURSION_BRANCHOUT_NUM as f64).ceil() as usize;\n\n    let mut configs = vec![STANDARD_CONFIG; level];\n\n    if let Some(last) = configs.last_mut() {\n        *last = STANDARD_ZK_CONFIG; // Change the last element to 0\n    } else {\n        configs.push(STANDARD_ZK_CONFIG); // Add 0 if the vec is empty\n    }\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":61,"address":[9051298,9050624],"length":1,"stats":{"Line":1}},{"line":64,"address":[],"length":0,"stats":{"Line":1}},{"line":66,"address":[],"length":0,"stats":{"Line":1}},{"line":68,"address":[],"length":0,"stats":{"Line":2}},{"line":69,"address":[9051042,9051186],"length":1,"stats":{"Line":1}},{"line":71,"address":[9051056,9051296],"length":1,"stats":{"Line":2}},{"line":73,"address":[],"length":0,"stats":{"Line":1}}],"covered":7,"coverable":7},{"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":[8888640,8901622,8901358],"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":[8891045],"length":1,"stats":{"Line":0}},{"line":59,"address":[8891091],"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":[8891325],"length":1,"stats":{"Line":0}},{"line":67,"address":[8891492,8891397],"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":[8893468],"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":[8896381],"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":[8898678],"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":[8894916],"length":1,"stats":{"Line":0}},{"line":150,"address":[],"length":0,"stats":{"Line":0}},{"line":151,"address":[],"length":0,"stats":{"Line":0}},{"line":154,"address":[8888320],"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":[8888512],"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\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_i64(-1));\n            assert_non_negative_unsigned(builder, x);\n        });\n    }\n}\n","traces":[{"line":19,"address":[10603360],"length":1,"stats":{"Line":1}},{"line":20,"address":[10603364],"length":1,"stats":{"Line":1}},{"line":22,"address":[10603373],"length":1,"stats":{"Line":1}},{"line":25,"address":[10603392],"length":1,"stats":{"Line":1}},{"line":30,"address":[10184319,10187312,10188265,10189241,10184361,10188288,10185295,10189199,10188223,10184384,10185337,10187247,10186271,10183408,10185360,10187289,10186336,10186313],"length":1,"stats":{"Line":7}},{"line":36,"address":[],"length":0,"stats":{"Line":12}},{"line":37,"address":[],"length":0,"stats":{"Line":6}},{"line":38,"address":[],"length":0,"stats":{"Line":6}},{"line":39,"address":[10188657,10187681,10185729,10184753,10186705,10183777],"length":1,"stats":{"Line":5}},{"line":40,"address":[],"length":0,"stats":{"Line":5}},{"line":41,"address":[10186773,10185797,10187749,10184821,10183845,10188725],"length":1,"stats":{"Line":5}},{"line":42,"address":[],"length":0,"stats":{"Line":5}},{"line":43,"address":[],"length":0,"stats":{"Line":10}},{"line":44,"address":[],"length":0,"stats":{"Line":5}},{"line":45,"address":[],"length":0,"stats":{"Line":5}},{"line":50,"address":[10603424],"length":1,"stats":{"Line":1}},{"line":51,"address":[10603433],"length":1,"stats":{"Line":1}}],"covered":17,"coverable":17},{"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":[10305536,10306029,10305984],"length":1,"stats":{"Line":0}},{"line":20,"address":[11213838],"length":1,"stats":{"Line":0}},{"line":21,"address":[11213855],"length":1,"stats":{"Line":0}},{"line":22,"address":[11213968,11213876],"length":1,"stats":{"Line":0}},{"line":23,"address":[11214155],"length":1,"stats":{"Line":0}},{"line":24,"address":[11214158],"length":1,"stats":{"Line":0}},{"line":46,"address":[12555168,12557313,12557420],"length":1,"stats":{"Line":0}},{"line":47,"address":[12555195,12557433],"length":1,"stats":{"Line":0}},{"line":48,"address":[12555824,12556392,12556843,12556971,12555393,12557027],"length":1,"stats":{"Line":0}},{"line":49,"address":[12555564,12555867,12555453,12557401,12555737],"length":1,"stats":{"Line":0}},{"line":50,"address":[12557363,12556131,12555986,12556276,12556435],"length":1,"stats":{"Line":0}},{"line":51,"address":[12557322,12556727,12556554,12556886],"length":1,"stats":{"Line":0}},{"line":52,"address":[10546795,10546402,10546515],"length":1,"stats":{"Line":0}},{"line":55,"address":[12557853,12557456,12557824],"length":1,"stats":{"Line":0}},{"line":56,"address":[12557473,12557707],"length":1,"stats":{"Line":0}},{"line":57,"address":[12557663],"length":1,"stats":{"Line":0}},{"line":69,"address":[12557872,12559519,12559588],"length":1,"stats":{"Line":0}},{"line":70,"address":[12557899,12559601],"length":1,"stats":{"Line":0}},{"line":71,"address":[10547551,10548120,10548733,10548557,10548681],"length":1,"stats":{"Line":0}},{"line":73,"address":[12558544,12559569,12558703,12558254,12558143,12558399],"length":1,"stats":{"Line":0}},{"line":74,"address":[12558995,12559152,12558822,12559528],"length":1,"stats":{"Line":0}},{"line":75,"address":[12559285,12559497,12559168],"length":1,"stats":{"Line":0}},{"line":78,"address":[12559632,12560029,12560000],"length":1,"stats":{"Line":0}},{"line":79,"address":[12559883,12559649],"length":1,"stats":{"Line":0}},{"line":80,"address":[12559839],"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":[9627885,9627696],"length":1,"stats":{"Line":1}},{"line":15,"address":[10603501],"length":1,"stats":{"Line":1}},{"line":16,"address":[10603514],"length":1,"stats":{"Line":1}},{"line":17,"address":[10603528],"length":1,"stats":{"Line":1}},{"line":18,"address":[10603585],"length":1,"stats":{"Line":1}},{"line":21,"address":[10603712],"length":1,"stats":{"Line":0}},{"line":22,"address":[9627921],"length":1,"stats":{"Line":0}},{"line":25,"address":[10605039,10603760,10608029],"length":1,"stats":{"Line":0}},{"line":26,"address":[10603890,10603802],"length":1,"stats":{"Line":0}},{"line":27,"address":[10607007,10607542,10607606,10607780,10607194,10607306,10606612],"length":1,"stats":{"Line":0}},{"line":28,"address":[9631534],"length":1,"stats":{"Line":0}},{"line":31,"address":[10603904,10604076],"length":1,"stats":{"Line":0}},{"line":33,"address":[10604111,10604217],"length":1,"stats":{"Line":0}},{"line":34,"address":[10605800,10605471,10606081,10606145,10605670,10606320,10605055],"length":1,"stats":{"Line":0}},{"line":35,"address":[10605875],"length":1,"stats":{"Line":0}},{"line":38,"address":[10604227],"length":1,"stats":{"Line":0}},{"line":39,"address":[10604659,10604247],"length":1,"stats":{"Line":0}},{"line":41,"address":[10604820],"length":1,"stats":{"Line":0}},{"line":46,"address":[10608064],"length":1,"stats":{"Line":0}},{"line":47,"address":[10608361,10608100],"length":1,"stats":{"Line":0}},{"line":48,"address":[10608110],"length":1,"stats":{"Line":0}},{"line":52,"address":[10608278],"length":1,"stats":{"Line":0}},{"line":55,"address":[10608560,10608463,10608400,10608599],"length":1,"stats":{"Line":2}},{"line":56,"address":[],"length":0,"stats":{"Line":4}},{"line":57,"address":[],"length":0,"stats":{"Line":2}},{"line":79,"address":[10609358,10608688,10609327],"length":1,"stats":{"Line":1}},{"line":81,"address":[10608718,10608794,10608849],"length":1,"stats":{"Line":3}},{"line":82,"address":[10609052,10608922,10608997],"length":1,"stats":{"Line":3}},{"line":88,"address":[10609376],"length":1,"stats":{"Line":1}},{"line":89,"address":[10609389],"length":1,"stats":{"Line":1}},{"line":91,"address":[10609456,10609475],"length":1,"stats":{"Line":2}},{"line":93,"address":[10609436],"length":1,"stats":{"Line":1}},{"line":96,"address":[10609632],"length":1,"stats":{"Line":1}},{"line":97,"address":[10609728,10609647,10609957],"length":1,"stats":{"Line":2}},{"line":98,"address":[10609737],"length":1,"stats":{"Line":1}},{"line":99,"address":[10609831,10609745],"length":1,"stats":{"Line":2}},{"line":100,"address":[10609906],"length":1,"stats":{"Line":1}},{"line":107,"address":[10609984],"length":1,"stats":{"Line":1}},{"line":108,"address":[10609997],"length":1,"stats":{"Line":1}},{"line":110,"address":[10610083,10610064],"length":1,"stats":{"Line":2}},{"line":111,"address":[9634209],"length":1,"stats":{"Line":1}},{"line":115,"address":[10610044],"length":1,"stats":{"Line":1}},{"line":118,"address":[9634272],"length":1,"stats":{"Line":1}},{"line":119,"address":[10610399,10610230,10610272],"length":1,"stats":{"Line":2}},{"line":120,"address":[10610299,10610367],"length":1,"stats":{"Line":2}},{"line":133,"address":[9634607,9634480],"length":1,"stats":{"Line":1}},{"line":134,"address":[10610449],"length":1,"stats":{"Line":1}},{"line":139,"address":[12828433,12827792],"length":1,"stats":{"Line":1}},{"line":140,"address":[12827945,12827812,12827979],"length":1,"stats":{"Line":3}},{"line":141,"address":[12828026,12828266],"length":1,"stats":{"Line":2}},{"line":145,"address":[12828464,12828797],"length":1,"stats":{"Line":1}},{"line":146,"address":[9634640,9634645],"length":1,"stats":{"Line":5}},{"line":149,"address":[12828832,12829481],"length":1,"stats":{"Line":1}},{"line":150,"address":[8552804,8552928,8552959],"length":1,"stats":{"Line":3}},{"line":151,"address":[12829064,12829304],"length":1,"stats":{"Line":2}},{"line":155,"address":[12829504,12829847],"length":1,"stats":{"Line":1}},{"line":156,"address":[12829777,12829530,12829709],"length":1,"stats":{"Line":5}},{"line":167,"address":[10610656],"length":1,"stats":{"Line":0}},{"line":168,"address":[9634721],"length":1,"stats":{"Line":0}},{"line":173,"address":[10610752],"length":1,"stats":{"Line":0}},{"line":174,"address":[10610757],"length":1,"stats":{"Line":0}},{"line":177,"address":[10610768],"length":1,"stats":{"Line":0}},{"line":178,"address":[10610777],"length":1,"stats":{"Line":0}},{"line":182,"address":[],"length":0,"stats":{"Line":0}},{"line":184,"address":[],"length":0,"stats":{"Line":0}},{"line":187,"address":[10611279,10610816],"length":1,"stats":{"Line":0}},{"line":188,"address":[10611320,10611108,10611182,10611312,10610846,10610920],"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":[8909968,8910483],"length":1,"stats":{"Line":0}},{"line":20,"address":[],"length":0,"stats":{"Line":0}},{"line":21,"address":[8910133,8910087],"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":[8910548],"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":[8910438],"length":1,"stats":{"Line":0}},{"line":41,"address":[8907422,8906064],"length":1,"stats":{"Line":0}},{"line":48,"address":[],"length":0,"stats":{"Line":0}},{"line":49,"address":[8906289,8906236],"length":1,"stats":{"Line":0}},{"line":50,"address":[8906435],"length":1,"stats":{"Line":0}},{"line":52,"address":[8906848],"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":[8906891],"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":[8909860],"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":[8907653,8907832],"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":[8907271],"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    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 =\n            (cfg.num_of_batches as f64).log(cfg.recursion_branchout_num as f64).ceil() as usize;\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        debug!(\n            \"set_recursive_hash, recursive_level: {:?}, index: {:?}, hash: {:?}\",\n            recursive_level, index, hash\n        );\n        let idx = GlobalMst::get_recursive_global_index(\u0026self.cfg, recursive_level, index);\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":30,"address":[10611360,10611872],"length":1,"stats":{"Line":1}},{"line":31,"address":[9635398],"length":1,"stats":{"Line":1}},{"line":34,"address":[10611550],"length":1,"stats":{"Line":1}},{"line":35,"address":[10611608],"length":1,"stats":{"Line":1}},{"line":37,"address":[10611665,10611730],"length":1,"stats":{"Line":2}},{"line":38,"address":[9635738,9635780],"length":1,"stats":{"Line":1}},{"line":39,"address":[10611765,10611809],"length":1,"stats":{"Line":2}},{"line":40,"address":[10611841],"length":1,"stats":{"Line":1}},{"line":43,"address":[10611904],"length":1,"stats":{"Line":1}},{"line":44,"address":[10611909],"length":1,"stats":{"Line":1}},{"line":47,"address":[10611920],"length":1,"stats":{"Line":1}},{"line":48,"address":[10611957,10611929],"length":1,"stats":{"Line":1}},{"line":51,"address":[10611984],"length":1,"stats":{"Line":0}},{"line":52,"address":[10612002],"length":1,"stats":{"Line":0}},{"line":55,"address":[10612032],"length":1,"stats":{"Line":0}},{"line":56,"address":[10612037],"length":1,"stats":{"Line":0}},{"line":65,"address":[10612064],"length":1,"stats":{"Line":1}},{"line":70,"address":[9636094],"length":1,"stats":{"Line":1}},{"line":71,"address":[10612127],"length":1,"stats":{"Line":1}},{"line":72,"address":[10612156],"length":1,"stats":{"Line":1}},{"line":74,"address":[10612178,10612232],"length":1,"stats":{"Line":1}},{"line":76,"address":[9636241,9636195,9636299],"length":1,"stats":{"Line":2}},{"line":77,"address":[10612308,10612434,10612342],"length":1,"stats":{"Line":2}},{"line":79,"address":[10612512,10612426,10612460],"length":1,"stats":{"Line":2}},{"line":80,"address":[10612497,10612566,10612538],"length":1,"stats":{"Line":2}},{"line":82,"address":[10612546,10612587,10612807],"length":1,"stats":{"Line":2}},{"line":86,"address":[10612883,10612833,10612792],"length":1,"stats":{"Line":2}},{"line":93,"address":[9636896],"length":1,"stats":{"Line":1}},{"line":98,"address":[10612967,10613113],"length":1,"stats":{"Line":1}},{"line":99,"address":[10613071],"length":1,"stats":{"Line":1}},{"line":100,"address":[10613088],"length":1,"stats":{"Line":1}},{"line":101,"address":[10613105],"length":1,"stats":{"Line":1}},{"line":103,"address":[10613145],"length":1,"stats":{"Line":1}},{"line":105,"address":[10613209,10613399,10613423],"length":1,"stats":{"Line":2}},{"line":106,"address":[9637391],"length":1,"stats":{"Line":1}},{"line":108,"address":[10613252,10613186],"length":1,"stats":{"Line":2}},{"line":113,"address":[9637142,9637432,9637473,9637580],"length":1,"stats":{"Line":4}},{"line":114,"address":[10613478],"length":1,"stats":{"Line":1}},{"line":116,"address":[10613540,10613599,10613497],"length":1,"stats":{"Line":2}},{"line":119,"address":[10613510,10613625,10613654],"length":1,"stats":{"Line":2}},{"line":120,"address":[10613680,10613633],"length":1,"stats":{"Line":2}},{"line":122,"address":[10613924,10613839],"length":1,"stats":{"Line":1}},{"line":124,"address":[10613914],"length":1,"stats":{"Line":1}},{"line":125,"address":[10613922,10614251,10613940],"length":1,"stats":{"Line":3}},{"line":126,"address":[10613987,10614073,10614151],"length":1,"stats":{"Line":2}},{"line":127,"address":[9638097],"length":1,"stats":{"Line":1}},{"line":128,"address":[10614097],"length":1,"stats":{"Line":1}},{"line":130,"address":[10614223,10614123,10614172],"length":1,"stats":{"Line":2}},{"line":132,"address":[10614180],"length":1,"stats":{"Line":1}},{"line":133,"address":[10614243,10614196,10614256],"length":1,"stats":{"Line":2}},{"line":136,"address":[10614026,10614047,10613959],"length":1,"stats":{"Line":2}},{"line":137,"address":[9638017],"length":1,"stats":{"Line":1}},{"line":142,"address":[10614272],"length":1,"stats":{"Line":1}},{"line":143,"address":[10614301],"length":1,"stats":{"Line":1}},{"line":144,"address":[10614324],"length":1,"stats":{"Line":1}},{"line":147,"address":[9638368],"length":1,"stats":{"Line":0}},{"line":148,"address":[9639186,9639070,9639143,9639358,9639001,9638522,9638853],"length":1,"stats":{"Line":0}},{"line":149,"address":[9639101,9639638],"length":1,"stats":{"Line":0}},{"line":151,"address":[9639671],"length":1,"stats":{"Line":0}},{"line":153,"address":[9639683,9639845],"length":1,"stats":{"Line":0}},{"line":155,"address":[9639782],"length":1,"stats":{"Line":0}},{"line":159,"address":[9639872],"length":1,"stats":{"Line":1}},{"line":160,"address":[10616782,10616373,10616521,10616042,10616739,10616594,10617146],"length":1,"stats":{"Line":7}},{"line":164,"address":[9640609],"length":1,"stats":{"Line":1}},{"line":165,"address":[10616661],"length":1,"stats":{"Line":1}},{"line":168,"address":[10625429,10621908,10617488],"length":1,"stats":{"Line":1}},{"line":170,"address":[9641479],"length":1,"stats":{"Line":1}},{"line":171,"address":[9641528],"length":1,"stats":{"Line":1}},{"line":172,"address":[10617677,10617584,10617834],"length":1,"stats":{"Line":3}},{"line":173,"address":[10617850],"length":1,"stats":{"Line":1}},{"line":174,"address":[9645809,9645904,9641830],"length":1,"stats":{"Line":2}},{"line":175,"address":[10622057,10621993],"length":1,"stats":{"Line":2}},{"line":176,"address":[10622311,10622179],"length":1,"stats":{"Line":1}},{"line":177,"address":[10622340,10622282,10622495],"length":1,"stats":{"Line":2}},{"line":179,"address":[9646340,9646412],"length":1,"stats":{"Line":2}},{"line":182,"address":[10622540],"length":1,"stats":{"Line":1}},{"line":187,"address":[9646479],"length":1,"stats":{"Line":1}},{"line":192,"address":[10622658],"length":1,"stats":{"Line":1}},{"line":193,"address":[9646583],"length":1,"stats":{"Line":1}},{"line":196,"address":[10622772],"length":1,"stats":{"Line":1}},{"line":197,"address":[9646682],"length":1,"stats":{"Line":1}},{"line":199,"address":[9646751],"length":1,"stats":{"Line":1}},{"line":200,"address":[9647350,9647649,9648895,9647750,9646955,9647537,9647814,9648779],"length":1,"stats":{"Line":7}},{"line":201,"address":[9647705],"length":1,"stats":{"Line":1}},{"line":205,"address":[10617787],"length":1,"stats":{"Line":1}},{"line":206,"address":[10617799,10617916],"length":1,"stats":{"Line":2}},{"line":207,"address":[9641884,9642103],"length":1,"stats":{"Line":2}},{"line":208,"address":[9642406,9642119,9642473],"length":1,"stats":{"Line":2}},{"line":209,"address":[9642509,9642446],"length":1,"stats":{"Line":2}},{"line":210,"address":[9642623],"length":1,"stats":{"Line":1}},{"line":211,"address":[10625475,10625456],"length":1,"stats":{"Line":2}},{"line":213,"address":[10618753,10618844],"length":1,"stats":{"Line":2}},{"line":214,"address":[10618852,10618994],"length":1,"stats":{"Line":2}},{"line":216,"address":[9642894,9649408,9649427],"length":1,"stats":{"Line":3}},{"line":218,"address":[9649546,9649440],"length":1,"stats":{"Line":1}},{"line":219,"address":[10625675],"length":1,"stats":{"Line":1}},{"line":224,"address":[10619143,10619048],"length":1,"stats":{"Line":2}},{"line":226,"address":[10625728,10625754],"length":1,"stats":{"Line":2}},{"line":229,"address":[10619240],"length":1,"stats":{"Line":1}},{"line":231,"address":[10619319],"length":1,"stats":{"Line":1}},{"line":232,"address":[10620413,10620546,10620084,10620622,10621502,10619668,10621374,10620283],"length":1,"stats":{"Line":0}},{"line":233,"address":[10620478],"length":1,"stats":{"Line":0}},{"line":235,"address":[10619408,10619593],"length":1,"stats":{"Line":2}},{"line":238,"address":[10618113,10618207],"length":1,"stats":{"Line":2}},{"line":240,"address":[10618215],"length":1,"stats":{"Line":1}},{"line":242,"address":[10625840,10625850,10618260],"length":1,"stats":{"Line":3}},{"line":245,"address":[9649696],"length":1,"stats":{"Line":0}},{"line":246,"address":[10625905],"length":1,"stats":{"Line":0}},{"line":247,"address":[10626583,10626660,10626703,10626876,10626035,10626366,10626514],"length":1,"stats":{"Line":0}},{"line":248,"address":[10626609],"length":1,"stats":{"Line":0}},{"line":249,"address":[9650444],"length":1,"stats":{"Line":0}},{"line":250,"address":[10626633,10627156,10627521],"length":1,"stats":{"Line":0}},{"line":251,"address":[10627179,10627479],"length":1,"stats":{"Line":0}},{"line":252,"address":[10627286],"length":1,"stats":{"Line":0}},{"line":253,"address":[10627333],"length":1,"stats":{"Line":0}},{"line":256,"address":[10627761,10627607,10627552],"length":1,"stats":{"Line":0}},{"line":258,"address":[10627430],"length":1,"stats":{"Line":0}},{"line":259,"address":[10627448,10627513,10627526],"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","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    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 local_mst_root_index = cfg.batch_size * 2 - 2;\n    let mst_batch_idx = global_index / cfg.batch_size;\n    let this_mst_root_idx =\n        GlobalMst::get_batch_tree_global_index(cfg, mst_batch_idx, local_mst_root_index);\n\n    let first_mst_root_idx = GlobalMst::get_batch_tree_global_index(cfg, 0, local_mst_root_index);\n    assert!(this_mst_root_idx \u003e= first_mst_root_idx);\n\n    let this_mst_root_offset = this_mst_root_idx - first_mst_root_idx;\n    let mut recursive_idx = this_mst_root_offset / cfg.recursion_branchout_num;\n    let mut recursive_offset = this_mst_root_offset % cfg.recursion_branchout_num;\n\n    let layers = (cfg.num_of_batches.next_power_of_two() as f64)\n        .log(cfg.recursion_branchout_num as f64)\n        .ceil() as usize;\n\n    for i in 0..layers {\n        let mut left_layer = Vec::new();\n        let mut right_layer = Vec::new();\n        if i == 0 {\n            for j in 0..cfg.recursion_branchout_num {\n                if j \u003c recursive_offset {\n                    let index =\n                        first_mst_root_idx + (cfg.recursion_branchout_num * recursive_idx) + j;\n                    left_layer.push(index);\n                }\n\n                if j \u003e recursive_offset {\n                    let index =\n                        first_mst_root_idx + (cfg.recursion_branchout_num * recursive_idx) + j;\n                    right_layer.push(index);\n                }\n            }\n        } else {\n            for j in 0..cfg.recursion_branchout_num {\n                if j \u003c recursive_offset {\n                    let index = GlobalMst::get_recursive_global_index(\n                        cfg,\n                        i,\n                        recursive_idx * cfg.recursion_branchout_num + j,\n                    );\n                    left_layer.push(index);\n                }\n\n                if j \u003e recursive_offset {\n                    let index = GlobalMst::get_recursive_global_index(\n                        cfg,\n                        i,\n                        recursive_idx * cfg.recursion_branchout_num + j,\n                    );\n                    right_layer.push(index);\n                }\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":36,"address":[10628134,10627920],"length":1,"stats":{"Line":1}},{"line":37,"address":[9651769],"length":1,"stats":{"Line":1}},{"line":38,"address":[10627980],"length":1,"stats":{"Line":1}},{"line":46,"address":[10628972,10628160],"length":1,"stats":{"Line":1}},{"line":48,"address":[10628214],"length":1,"stats":{"Line":1}},{"line":50,"address":[10628343,10628266],"length":1,"stats":{"Line":1}},{"line":51,"address":[10628307],"length":1,"stats":{"Line":1}},{"line":54,"address":[10628387,10628326,10628372],"length":1,"stats":{"Line":2}},{"line":56,"address":[10628456,10628385,10628946],"length":1,"stats":{"Line":3}},{"line":57,"address":[10628598,10628711],"length":1,"stats":{"Line":2}},{"line":58,"address":[10628805,10628721,10628778],"length":1,"stats":{"Line":0}},{"line":59,"address":[10628786,10628826],"length":1,"stats":{"Line":0}},{"line":61,"address":[10628848,10628875,10628749],"length":1,"stats":{"Line":2}},{"line":62,"address":[10628856,10628896],"length":1,"stats":{"Line":2}},{"line":65,"address":[10628828,10628908,10628951],"length":1,"stats":{"Line":2}},{"line":66,"address":[9652733],"length":1,"stats":{"Line":1}},{"line":69,"address":[10629028,10629008,10628628,10628569],"length":1,"stats":{"Line":4}},{"line":73,"address":[10632016,10629056,10631985],"length":1,"stats":{"Line":1}},{"line":78,"address":[10629122],"length":1,"stats":{"Line":1}},{"line":80,"address":[9652976],"length":1,"stats":{"Line":1}},{"line":81,"address":[10629371,10629343,10629207],"length":1,"stats":{"Line":2}},{"line":82,"address":[10629456,10629351,10629413],"length":1,"stats":{"Line":2}},{"line":83,"address":[10629437,10629501],"length":1,"stats":{"Line":2}},{"line":86,"address":[10629509],"length":1,"stats":{"Line":1}},{"line":87,"address":[10629556],"length":1,"stats":{"Line":1}},{"line":89,"address":[9653388,9653451],"length":1,"stats":{"Line":1}},{"line":90,"address":[9653532,9653431,9653488],"length":1,"stats":{"Line":2}},{"line":91,"address":[10629831,10629734,10629791],"length":1,"stats":{"Line":2}},{"line":93,"address":[9653709,9653590,9653646],"length":1,"stats":{"Line":3}},{"line":94,"address":[10629907],"length":1,"stats":{"Line":1}},{"line":97,"address":[10631571,10630068,10630264],"length":1,"stats":{"Line":3}},{"line":98,"address":[10630288],"length":1,"stats":{"Line":1}},{"line":99,"address":[10630307],"length":1,"stats":{"Line":1}},{"line":100,"address":[10630383],"length":1,"stats":{"Line":1}},{"line":101,"address":[10630405,10630815,10630543],"length":1,"stats":{"Line":3}},{"line":102,"address":[10630839],"length":1,"stats":{"Line":1}},{"line":103,"address":[10630884,10631054],"length":1,"stats":{"Line":1}},{"line":105,"address":[9654809,9654849],"length":1,"stats":{"Line":2}},{"line":108,"address":[10630857],"length":1,"stats":{"Line":1}},{"line":109,"address":[9655020,9654862],"length":1,"stats":{"Line":1}},{"line":111,"address":[10631267,10631227],"length":1,"stats":{"Line":2}},{"line":115,"address":[10630448,10631288],"length":1,"stats":{"Line":2}},{"line":116,"address":[10631395],"length":1,"stats":{"Line":1}},{"line":120,"address":[9655504,9655403],"length":1,"stats":{"Line":1}},{"line":122,"address":[10631768],"length":1,"stats":{"Line":1}},{"line":125,"address":[9655376],"length":1,"stats":{"Line":1}},{"line":129,"address":[9655671,9655570],"length":1,"stats":{"Line":1}},{"line":131,"address":[10631939],"length":1,"stats":{"Line":1}},{"line":136,"address":[10630641],"length":1,"stats":{"Line":1}},{"line":138,"address":[10631511,10631422],"length":1,"stats":{"Line":1}},{"line":139,"address":[10631542,10631576,10631481],"length":1,"stats":{"Line":2}},{"line":142,"address":[10630221],"length":1,"stats":{"Line":1}},{"line":154,"address":[9656282,9655808],"length":1,"stats":{"Line":0}},{"line":155,"address":[10632080,10632152],"length":1,"stats":{"Line":0}},{"line":158,"address":[10632589,10632691,10632560],"length":1,"stats":{"Line":0}},{"line":160,"address":[10632236,10632312],"length":1,"stats":{"Line":0}},{"line":163,"address":[10632704,10632835,10632733],"length":1,"stats":{"Line":0}},{"line":169,"address":[10633377,10632848],"length":1,"stats":{"Line":1}},{"line":170,"address":[10632870],"length":1,"stats":{"Line":1}},{"line":171,"address":[10632903],"length":1,"stats":{"Line":1}},{"line":172,"address":[9656732],"length":1,"stats":{"Line":1}},{"line":174,"address":[10633052,10633437,10633424],"length":1,"stats":{"Line":3}},{"line":176,"address":[9656992,9656916],"length":1,"stats":{"Line":2}},{"line":191,"address":[10635057,10636696,10633472],"length":1,"stats":{"Line":0}},{"line":196,"address":[10633627,10633543],"length":1,"stats":{"Line":0}},{"line":197,"address":[9657362,9657453],"length":1,"stats":{"Line":0}},{"line":198,"address":[9657817,9660276],"length":1,"stats":{"Line":0}},{"line":201,"address":[10633775],"length":1,"stats":{"Line":0}},{"line":203,"address":[10634274],"length":1,"stats":{"Line":0}},{"line":204,"address":[9658102],"length":1,"stats":{"Line":0}},{"line":205,"address":[9659602,9659814,9659125,9659538,9658730,9659312,9659424],"length":1,"stats":{"Line":0}},{"line":206,"address":[9659496,9660133],"length":1,"stats":{"Line":0}},{"line":209,"address":[9658372,9658135],"length":1,"stats":{"Line":0}},{"line":214,"address":[10634856,10634719],"length":1,"stats":{"Line":0}},{"line":215,"address":[10634860],"length":1,"stats":{"Line":0}},{"line":217,"address":[9658583],"length":1,"stats":{"Line":0}},{"line":220,"address":[9660368],"length":1,"stats":{"Line":1}},{"line":221,"address":[10636771],"length":1,"stats":{"Line":1}},{"line":223,"address":[10636787],"length":1,"stats":{"Line":1}},{"line":225,"address":[10637168,10636796],"length":1,"stats":{"Line":2}},{"line":226,"address":[10637206],"length":1,"stats":{"Line":1}},{"line":227,"address":[10637241],"length":1,"stats":{"Line":1}},{"line":228,"address":[9660872],"length":1,"stats":{"Line":1}},{"line":230,"address":[10637283],"length":1,"stats":{"Line":0}},{"line":231,"address":[10637298],"length":1,"stats":{"Line":0}},{"line":235,"address":[10636902],"length":1,"stats":{"Line":1}},{"line":238,"address":[10637373,10637328],"length":1,"stats":{"Line":2}},{"line":240,"address":[10637126,10637003],"length":1,"stats":{"Line":1}},{"line":241,"address":[9660757],"length":1,"stats":{"Line":1}},{"line":243,"address":[10637023],"length":1,"stats":{"Line":0}},{"line":249,"address":[10637472,10638148],"length":1,"stats":{"Line":0}},{"line":255,"address":[10637618,10637546],"length":1,"stats":{"Line":0}},{"line":258,"address":[10638205,10638176,10638307],"length":1,"stats":{"Line":0}},{"line":261,"address":[10637702,10637778],"length":1,"stats":{"Line":0}},{"line":264,"address":[10638349,10638320],"length":1,"stats":{"Line":0}},{"line":268,"address":[10637871],"length":1,"stats":{"Line":0}}],"covered":67,"coverable":96},{"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":[9464592,9464962],"length":1,"stats":{"Line":1}},{"line":29,"address":[13041219,13041584,13041605],"length":1,"stats":{"Line":3}},{"line":30,"address":[13041238],"length":1,"stats":{"Line":1}},{"line":31,"address":[13041291,13041358],"length":1,"stats":{"Line":2}},{"line":36,"address":[13041632,13042331],"length":1,"stats":{"Line":1}},{"line":37,"address":[13041678],"length":1,"stats":{"Line":1}},{"line":38,"address":[13041830],"length":1,"stats":{"Line":1}},{"line":40,"address":[13041997],"length":1,"stats":{"Line":1}},{"line":41,"address":[13042091],"length":1,"stats":{"Line":1}},{"line":42,"address":[13042162],"length":1,"stats":{"Line":1}},{"line":56,"address":[9465696],"length":1,"stats":{"Line":1}},{"line":60,"address":[13042419,13042933,13042912],"length":1,"stats":{"Line":3}},{"line":62,"address":[13043024,13042501,13043045],"length":1,"stats":{"Line":3}},{"line":64,"address":[13042594],"length":1,"stats":{"Line":1}},{"line":67,"address":[13042710],"length":1,"stats":{"Line":1}},{"line":69,"address":[13042777],"length":1,"stats":{"Line":1}},{"line":73,"address":[13043136,13043909,13043938],"length":1,"stats":{"Line":1}},{"line":75,"address":[13043179,13043947],"length":1,"stats":{"Line":1}},{"line":76,"address":[13043835],"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":[9130912,9131604,9131636],"length":1,"stats":{"Line":1}},{"line":40,"address":[9662024],"length":1,"stats":{"Line":1}},{"line":41,"address":[],"length":0,"stats":{"Line":1}},{"line":42,"address":[9662176],"length":1,"stats":{"Line":1}},{"line":43,"address":[11908574],"length":1,"stats":{"Line":1}},{"line":44,"address":[9131254,9131169,9131648],"length":1,"stats":{"Line":3}},{"line":45,"address":[9662723],"length":1,"stats":{"Line":1}},{"line":46,"address":[9131801],"length":1,"stats":{"Line":1}},{"line":49,"address":[9662973],"length":1,"stats":{"Line":1}},{"line":50,"address":[11909506],"length":1,"stats":{"Line":1}},{"line":54,"address":[],"length":0,"stats":{"Line":1}},{"line":55,"address":[9132236],"length":1,"stats":{"Line":1}},{"line":56,"address":[9663345],"length":1,"stats":{"Line":1}},{"line":57,"address":[],"length":0,"stats":{"Line":1}},{"line":59,"address":[9132499],"length":1,"stats":{"Line":1}},{"line":61,"address":[],"length":0,"stats":{"Line":1}},{"line":66,"address":[9663584],"length":1,"stats":{"Line":1}},{"line":70,"address":[11910060],"length":1,"stats":{"Line":1}},{"line":72,"address":[11910080],"length":1,"stats":{"Line":1}},{"line":73,"address":[11910119],"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":[11910272],"length":1,"stats":{"Line":1}},{"line":94,"address":[11910288],"length":1,"stats":{"Line":1}},{"line":95,"address":[11910323],"length":1,"stats":{"Line":1}},{"line":96,"address":[11910370],"length":1,"stats":{"Line":1}},{"line":97,"address":[11910418],"length":1,"stats":{"Line":1}},{"line":102,"address":[10376297,10375680],"length":1,"stats":{"Line":0}},{"line":104,"address":[10376319,10375722,10376262],"length":1,"stats":{"Line":0}},{"line":110,"address":[11910448,11910940],"length":1,"stats":{"Line":0}},{"line":111,"address":[9664043],"length":1,"stats":{"Line":0}},{"line":112,"address":[9664058],"length":1,"stats":{"Line":0}},{"line":113,"address":[11910611],"length":1,"stats":{"Line":0}},{"line":114,"address":[11910721],"length":1,"stats":{"Line":0}},{"line":129,"address":[11910976],"length":1,"stats":{"Line":1}},{"line":130,"address":[9664520],"length":1,"stats":{"Line":1}},{"line":134,"address":[11911056],"length":1,"stats":{"Line":1}},{"line":135,"address":[11911075],"length":1,"stats":{"Line":1}},{"line":136,"address":[11911094],"length":1,"stats":{"Line":1}},{"line":141,"address":[11912189,11911120],"length":1,"stats":{"Line":1}},{"line":145,"address":[11911172],"length":1,"stats":{"Line":1}},{"line":147,"address":[11911194,11911369],"length":1,"stats":{"Line":2}},{"line":148,"address":[9664909,9665010],"length":1,"stats":{"Line":1}},{"line":149,"address":[11911898,11911512,11911473],"length":1,"stats":{"Line":2}},{"line":150,"address":[11911707,11911610],"length":1,"stats":{"Line":2}},{"line":151,"address":[9665232,9665319],"length":1,"stats":{"Line":2}},{"line":152,"address":[11912124],"length":1,"stats":{"Line":1}},{"line":154,"address":[9665463,9665327],"length":1,"stats":{"Line":2}},{"line":160,"address":[11912614,11912224],"length":1,"stats":{"Line":1}},{"line":164,"address":[11912296],"length":1,"stats":{"Line":1}},{"line":166,"address":[9666112,9666133],"length":1,"stats":{"Line":2}},{"line":169,"address":[11912382],"length":1,"stats":{"Line":1}},{"line":171,"address":[9665911],"length":1,"stats":{"Line":1}},{"line":173,"address":[11912502],"length":1,"stats":{"Line":1}},{"line":175,"address":[9666033],"length":1,"stats":{"Line":1}},{"line":179,"address":[11913782,11912704,11913835],"length":1,"stats":{"Line":1}},{"line":185,"address":[11912945,11912747,11913097],"length":1,"stats":{"Line":2}},{"line":187,"address":[11913122,11912979],"length":1,"stats":{"Line":2}},{"line":188,"address":[9666590],"length":1,"stats":{"Line":1}},{"line":189,"address":[11914298,11913195,11913872,11914330],"length":1,"stats":{"Line":2}},{"line":190,"address":[9667712,9667291,9667733],"length":1,"stats":{"Line":3}},{"line":191,"address":[11913930],"length":1,"stats":{"Line":1}},{"line":192,"address":[9667351],"length":1,"stats":{"Line":1}},{"line":193,"address":[11914048],"length":1,"stats":{"Line":1}},{"line":194,"address":[11914259],"length":1,"stats":{"Line":1}},{"line":196,"address":[11913312],"length":1,"stats":{"Line":1}},{"line":198,"address":[11914400,11914435],"length":1,"stats":{"Line":2}},{"line":201,"address":[11913436,11913519],"length":1,"stats":{"Line":2}},{"line":202,"address":[11913565],"length":1,"stats":{"Line":1}},{"line":203,"address":[11913637],"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":[9667824],"length":1,"stats":{"Line":1}},{"line":34,"address":[10638523,10638447],"length":1,"stats":{"Line":2}},{"line":36,"address":[10638614,10638698,10638538],"length":1,"stats":{"Line":3}},{"line":41,"address":[10638720,10639380,10639554],"length":1,"stats":{"Line":1}},{"line":45,"address":[10638772],"length":1,"stats":{"Line":1}},{"line":47,"address":[10638881,10639035,10638813],"length":1,"stats":{"Line":3}},{"line":49,"address":[9668452,9668764,9668867],"length":1,"stats":{"Line":3}},{"line":52,"address":[10639522],"length":1,"stats":{"Line":1}},{"line":55,"address":[10638998,10639090],"length":1,"stats":{"Line":2}},{"line":57,"address":[10639635,10639600],"length":1,"stats":{"Line":2}},{"line":61,"address":[9668560,9668640],"length":1,"stats":{"Line":2}},{"line":64,"address":[10639287],"length":1,"stats":{"Line":1}},{"line":68,"address":[9669008,9674694,9673257],"length":1,"stats":{"Line":1}},{"line":69,"address":[10639718],"length":1,"stats":{"Line":1}},{"line":70,"address":[10639880],"length":1,"stats":{"Line":1}},{"line":73,"address":[10639948],"length":1,"stats":{"Line":1}},{"line":74,"address":[10640121,10640021],"length":1,"stats":{"Line":2}},{"line":76,"address":[10640140],"length":1,"stats":{"Line":1}},{"line":78,"address":[10640163],"length":1,"stats":{"Line":1}},{"line":79,"address":[10640198],"length":1,"stats":{"Line":1}},{"line":81,"address":[10640271],"length":1,"stats":{"Line":1}},{"line":83,"address":[10641260,10641457,10640515,10641533,10641130,10640931],"length":1,"stats":{"Line":5}},{"line":85,"address":[10641333],"length":1,"stats":{"Line":1}},{"line":87,"address":[10641846],"length":1,"stats":{"Line":1}},{"line":88,"address":[10641881],"length":1,"stats":{"Line":1}},{"line":89,"address":[10641935,10642164],"length":1,"stats":{"Line":2}},{"line":90,"address":[10642215],"length":1,"stats":{"Line":1}},{"line":91,"address":[10642252],"length":1,"stats":{"Line":1}},{"line":92,"address":[10642312],"length":1,"stats":{"Line":0}},{"line":93,"address":[10643703,10642577,10643322,10642993,10643192,10643512,10643448],"length":1,"stats":{"Line":0}},{"line":94,"address":[10643387,10643953],"length":1,"stats":{"Line":0}},{"line":98,"address":[10641957],"length":1,"stats":{"Line":0}},{"line":99,"address":[10644063,10644458,10644757,10644645,10645129,10644874,10644938],"length":1,"stats":{"Line":0}},{"line":100,"address":[10644813,10645379],"length":1,"stats":{"Line":0}},{"line":106,"address":[10645472,10648157,10649856],"length":1,"stats":{"Line":1}},{"line":111,"address":[10645551],"length":1,"stats":{"Line":1}},{"line":112,"address":[10645668,10645898,10645600],"length":1,"stats":{"Line":3}},{"line":114,"address":[10645922,10649684],"length":1,"stats":{"Line":2}},{"line":116,"address":[10649692,10649832],"length":1,"stats":{"Line":2}},{"line":119,"address":[10645809],"length":1,"stats":{"Line":1}},{"line":121,"address":[10645968,10645863],"length":1,"stats":{"Line":2}},{"line":122,"address":[10645976],"length":1,"stats":{"Line":1}},{"line":124,"address":[10646051],"length":1,"stats":{"Line":1}},{"line":125,"address":[9675330],"length":1,"stats":{"Line":1}},{"line":126,"address":[9675392,9675609],"length":1,"stats":{"Line":2}},{"line":127,"address":[9675656],"length":1,"stats":{"Line":1}},{"line":128,"address":[10646457],"length":1,"stats":{"Line":1}},{"line":129,"address":[9675751],"length":1,"stats":{"Line":0}},{"line":130,"address":[10647682,10647145,10646729,10647474,10647606,10647876,10647344],"length":1,"stats":{"Line":0}},{"line":131,"address":[10647539,10648129],"length":1,"stats":{"Line":0}},{"line":135,"address":[10646162],"length":1,"stats":{"Line":0}},{"line":136,"address":[10648239,10648942,10648643,10649123,10649314,10648830,10649059],"length":1,"stats":{"Line":0}},{"line":137,"address":[9678788,9678226],"length":1,"stats":{"Line":0}},{"line":143,"address":[10654365,10649888,10655836],"length":1,"stats":{"Line":0}},{"line":146,"address":[9679158],"length":1,"stats":{"Line":0}},{"line":147,"address":[10650112],"length":1,"stats":{"Line":0}},{"line":150,"address":[9679388],"length":1,"stats":{"Line":0}},{"line":151,"address":[10650253,10650353],"length":1,"stats":{"Line":0}},{"line":153,"address":[9679576],"length":1,"stats":{"Line":0}},{"line":155,"address":[10650395],"length":1,"stats":{"Line":0}},{"line":157,"address":[10650476],"length":1,"stats":{"Line":0}},{"line":159,"address":[10651332,10650717,10651133,10651462,10651663,10651587],"length":1,"stats":{"Line":0}},{"line":161,"address":[10651992,10651527],"length":1,"stats":{"Line":0}},{"line":162,"address":[10652000],"length":1,"stats":{"Line":0}},{"line":164,"address":[10652083],"length":1,"stats":{"Line":0}},{"line":165,"address":[10652118],"length":1,"stats":{"Line":0}},{"line":166,"address":[9681352,9681585],"length":1,"stats":{"Line":0}},{"line":167,"address":[10652452],"length":1,"stats":{"Line":0}},{"line":168,"address":[9681649],"length":1,"stats":{"Line":0}},{"line":169,"address":[10652715],"length":1,"stats":{"Line":0}},{"line":170,"address":[10653706,10653896,10652961,10653832,10653377,10654087,10653576],"length":1,"stats":{"Line":0}},{"line":171,"address":[10654337,10653771],"length":1,"stats":{"Line":0}},{"line":175,"address":[10652194],"length":1,"stats":{"Line":0}},{"line":176,"address":[10655258,10655322,10655513,10654447,10654842,10655029,10655141],"length":1,"stats":{"Line":0}},{"line":177,"address":[10655197,10655763],"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":[10655872,10656440,10656469],"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":[10656624],"length":1,"stats":{"Line":1}},{"line":21,"address":[10656880,10656848,10656656],"length":1,"stats":{"Line":3}},{"line":23,"address":[10656709,10656928,10656896],"length":1,"stats":{"Line":3}},{"line":25,"address":[10656762],"length":1,"stats":{"Line":1}},{"line":30,"address":[8974672],"length":1,"stats":{"Line":1}},{"line":31,"address":[10656977],"length":1,"stats":{"Line":1}},{"line":32,"address":[10656997],"length":1,"stats":{"Line":1}},{"line":33,"address":[10657029],"length":1,"stats":{"Line":1}},{"line":46,"address":[10657120,10658515],"length":1,"stats":{"Line":1}},{"line":47,"address":[10657186],"length":1,"stats":{"Line":1}},{"line":48,"address":[10657194],"length":1,"stats":{"Line":1}},{"line":49,"address":[10657216],"length":1,"stats":{"Line":1}},{"line":51,"address":[10657362,10657648,10657238],"length":1,"stats":{"Line":3}},{"line":52,"address":[10657669],"length":1,"stats":{"Line":1}},{"line":53,"address":[8976151,8975449],"length":1,"stats":{"Line":2}},{"line":54,"address":[10658464],"length":1,"stats":{"Line":1}},{"line":56,"address":[10657750,10657687,10657835],"length":1,"stats":{"Line":2}},{"line":57,"address":[10657861,10657986,10657817],"length":1,"stats":{"Line":2}},{"line":58,"address":[8975829,8975684,8975737],"length":1,"stats":{"Line":3}},{"line":59,"address":[10658126,10658271],"length":1,"stats":{"Line":2}},{"line":60,"address":[10658279],"length":1,"stats":{"Line":1}},{"line":61,"address":[10658298],"length":1,"stats":{"Line":1}},{"line":68,"address":[10658544],"length":1,"stats":{"Line":1}},{"line":69,"address":[10658576,10658648],"length":1,"stats":{"Line":2}},{"line":72,"address":[10658672],"length":1,"stats":{"Line":0}},{"line":73,"address":[10658690],"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 =\n                    (doc_len - 1) * first_doc_accounts_len + parser.last_doc_accounts.len();\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":[10660532,10658720,10660567],"length":1,"stats":{"Line":0}},{"line":42,"address":[9685079],"length":1,"stats":{"Line":0}},{"line":43,"address":[10658832,10658901],"length":1,"stats":{"Line":0}},{"line":44,"address":[10660565,10658958,10659263,10659230],"length":1,"stats":{"Line":0}},{"line":45,"address":[10660541,10659311,10659632,10659472],"length":1,"stats":{"Line":0}},{"line":46,"address":[9685846,9685958],"length":1,"stats":{"Line":0}},{"line":47,"address":[10659729,10659794],"length":1,"stats":{"Line":0}},{"line":48,"address":[10660234,10659852],"length":1,"stats":{"Line":0}},{"line":49,"address":[10660346],"length":1,"stats":{"Line":0}},{"line":50,"address":[10660389],"length":1,"stats":{"Line":0}},{"line":53,"address":[10659882,10659827],"length":1,"stats":{"Line":0}},{"line":54,"address":[10659934],"length":1,"stats":{"Line":0}},{"line":58,"address":[10659354,10658907],"length":1,"stats":{"Line":0}},{"line":59,"address":[10659373],"length":1,"stats":{"Line":0}},{"line":64,"address":[10660592,10660723],"length":1,"stats":{"Line":1}},{"line":65,"address":[10660630],"length":1,"stats":{"Line":1}},{"line":66,"address":[10660664],"length":1,"stats":{"Line":1}},{"line":70,"address":[9686944,9688683],"length":1,"stats":{"Line":1}},{"line":71,"address":[10660822],"length":1,"stats":{"Line":1}},{"line":72,"address":[10660836],"length":1,"stats":{"Line":1}},{"line":73,"address":[10660849],"length":1,"stats":{"Line":1}},{"line":74,"address":[10660863],"length":1,"stats":{"Line":1}},{"line":76,"address":[10660877],"length":1,"stats":{"Line":1}},{"line":78,"address":[9687143],"length":1,"stats":{"Line":0}},{"line":79,"address":[10661966,10662220,10662030,10661155,10661550,10661737,10661849],"length":1,"stats":{"Line":0}},{"line":80,"address":[10662469,10661905],"length":1,"stats":{"Line":0}},{"line":101,"address":[8916255,8910912,8915910],"length":1,"stats":{"Line":1}},{"line":102,"address":[9688778,9688897],"length":1,"stats":{"Line":2}},{"line":103,"address":[8911109],"length":1,"stats":{"Line":1}},{"line":104,"address":[8911307],"length":1,"stats":{"Line":0}},{"line":106,"address":[8911385,8911272],"length":1,"stats":{"Line":2}},{"line":108,"address":[8911401],"length":1,"stats":{"Line":1}},{"line":109,"address":[8911486],"length":1,"stats":{"Line":1}},{"line":113,"address":[8911562],"length":1,"stats":{"Line":1}},{"line":117,"address":[8911610],"length":1,"stats":{"Line":1}},{"line":120,"address":[8911912],"length":1,"stats":{"Line":1}},{"line":121,"address":[8911951],"length":1,"stats":{"Line":1}},{"line":122,"address":[8913232,8913311,8913505,8912768,8912967,8912352,8913100],"length":1,"stats":{"Line":6}},{"line":123,"address":[8913766,8913173],"length":1,"stats":{"Line":2}},{"line":124,"address":[8913774],"length":1,"stats":{"Line":1}},{"line":125,"address":[8913964],"length":1,"stats":{"Line":1}},{"line":126,"address":[8913972],"length":1,"stats":{"Line":1}},{"line":127,"address":[8915941],"length":1,"stats":{"Line":0}},{"line":129,"address":[8914135,8913978,8914350],"length":1,"stats":{"Line":3}},{"line":131,"address":[8914465,8914381],"length":1,"stats":{"Line":2}},{"line":133,"address":[8914473],"length":1,"stats":{"Line":1}},{"line":134,"address":[8914520],"length":1,"stats":{"Line":1}},{"line":136,"address":[9692471,9692238],"length":1,"stats":{"Line":2}},{"line":137,"address":[8914728],"length":1,"stats":{"Line":1}},{"line":138,"address":[8914918],"length":1,"stats":{"Line":1}},{"line":140,"address":[8915585,8914930],"length":1,"stats":{"Line":2}},{"line":141,"address":[8915252],"length":1,"stats":{"Line":1}},{"line":142,"address":[8914979],"length":1,"stats":{"Line":1}},{"line":143,"address":[9692995],"length":1,"stats":{"Line":1}},{"line":145,"address":[8915357,8915279],"length":1,"stats":{"Line":2}},{"line":146,"address":[9693134],"length":1,"stats":{"Line":1}},{"line":149,"address":[9693477,9692691,9693338],"length":1,"stats":{"Line":2}},{"line":152,"address":[9693451,9693515],"length":1,"stats":{"Line":2}},{"line":153,"address":[9693523],"length":1,"stats":{"Line":1}},{"line":154,"address":[9693531],"length":1,"stats":{"Line":1}},{"line":156,"address":[9689941,9693775],"length":1,"stats":{"Line":0}},{"line":159,"address":[8915824],"length":1,"stats":{"Line":1}},{"line":162,"address":[9693984],"length":1,"stats":{"Line":1}},{"line":163,"address":[10663311,10662998,10663470,10663662,10664042,10663854,10662667,10663146,10663758,10663215,10663271,10663566,10663950],"length":1,"stats":{"Line":13}},{"line":169,"address":[10664496],"length":1,"stats":{"Line":1}},{"line":170,"address":[10664501],"length":1,"stats":{"Line":1}},{"line":174,"address":[9695968,9702045],"length":1,"stats":{"Line":1}},{"line":180,"address":[9696859,9696902,9697196,9696754,9696676,9696158,9696510],"length":1,"stats":{"Line":7}},{"line":181,"address":[9696797],"length":1,"stats":{"Line":1}},{"line":184,"address":[8942935,8942142,8942864],"length":1,"stats":{"Line":2}},{"line":185,"address":[8942909,8942979,8943045],"length":1,"stats":{"Line":2}},{"line":186,"address":[8943061,8943033],"length":1,"stats":{"Line":1}},{"line":188,"address":[8943089,8943335],"length":1,"stats":{"Line":2}},{"line":190,"address":[8943231],"length":1,"stats":{"Line":1}},{"line":191,"address":[9697913],"length":1,"stats":{"Line":1}},{"line":192,"address":[8943377,8943296,8943470,8947413],"length":1,"stats":{"Line":3}},{"line":194,"address":[8943598,8947211],"length":1,"stats":{"Line":0}},{"line":195,"address":[8947368,8947418],"length":1,"stats":{"Line":0}},{"line":197,"address":[8943540],"length":1,"stats":{"Line":1}},{"line":199,"address":[8943640,8943552],"length":1,"stats":{"Line":2}},{"line":200,"address":[9698326,9698445],"length":1,"stats":{"Line":1}},{"line":201,"address":[9698403,9698506],"length":1,"stats":{"Line":2}},{"line":203,"address":[8944260,8943645,8943970],"length":1,"stats":{"Line":2}},{"line":204,"address":[8945325],"length":1,"stats":{"Line":1}},{"line":211,"address":[8947177,8945101],"length":1,"stats":{"Line":2}},{"line":212,"address":[8946040],"length":1,"stats":{"Line":1}},{"line":214,"address":[9700762],"length":1,"stats":{"Line":1}},{"line":216,"address":[9701054,9700880,9701011],"length":1,"stats":{"Line":2}},{"line":217,"address":[9701310,9701423],"length":1,"stats":{"Line":2}},{"line":218,"address":[9701018,9701083],"length":1,"stats":{"Line":2}},{"line":219,"address":[8946684],"length":1,"stats":{"Line":1}},{"line":221,"address":[8947041,8946853],"length":1,"stats":{"Line":2}},{"line":222,"address":[9701595],"length":1,"stats":{"Line":1}},{"line":223,"address":[9701669,9701749],"length":1,"stats":{"Line":1}},{"line":224,"address":[9701716],"length":1,"stats":{"Line":1}},{"line":226,"address":[9700857,9700926,9700974],"length":1,"stats":{"Line":0}},{"line":229,"address":[9701723,9701775,9701788],"length":1,"stats":{"Line":2}},{"line":232,"address":[9700607],"length":1,"stats":{"Line":1}},{"line":237,"address":[9702080,9702359],"length":1,"stats":{"Line":1}},{"line":241,"address":[10664555],"length":1,"stats":{"Line":1}},{"line":242,"address":[9702312,9702138,9702202],"length":1,"stats":{"Line":3}},{"line":243,"address":[10664773],"length":1,"stats":{"Line":1}},{"line":245,"address":[10664721],"length":1,"stats":{"Line":1}},{"line":249,"address":[10667331,10664848],"length":1,"stats":{"Line":1}},{"line":250,"address":[9702747,9702941,9702431],"length":1,"stats":{"Line":3}},{"line":252,"address":[10665120,10665003],"length":1,"stats":{"Line":2}},{"line":256,"address":[9702996,9703312,9703450],"length":1,"stats":{"Line":3}},{"line":258,"address":[10665689,10665572],"length":1,"stats":{"Line":2}},{"line":261,"address":[9703475],"length":1,"stats":{"Line":1}},{"line":262,"address":[10665988],"length":1,"stats":{"Line":1}},{"line":264,"address":[10666348,10666154,10666044],"length":1,"stats":{"Line":3}},{"line":265,"address":[10666364,10666615],"length":1,"stats":{"Line":2}},{"line":266,"address":[9704159],"length":1,"stats":{"Line":1}},{"line":270,"address":[10666743,10666660,10666883,10667059],"length":1,"stats":{"Line":4}},{"line":271,"address":[9704591],"length":1,"stats":{"Line":1}},{"line":273,"address":[10667097],"length":1,"stats":{"Line":1}},{"line":274,"address":[9704808],"length":1,"stats":{"Line":1}},{"line":275,"address":[10667303],"length":1,"stats":{"Line":1}},{"line":277,"address":[10667232],"length":1,"stats":{"Line":1}},{"line":278,"address":[10667251],"length":1,"stats":{"Line":1}},{"line":282,"address":[10666399,10666314],"length":1,"stats":{"Line":2}},{"line":290,"address":[10667360],"length":1,"stats":{"Line":0}},{"line":296,"address":[10667392],"length":1,"stats":{"Line":0}},{"line":297,"address":[10667397],"length":1,"stats":{"Line":0}}],"covered":98,"coverable":124},{"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":[8905950,8901952,8904489],"length":1,"stats":{"Line":0}},{"line":41,"address":[8902007],"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":[8902385],"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":[8904020,8903492,8903076,8904211,8903953,8903691,8903824],"length":1,"stats":{"Line":0}},{"line":56,"address":[],"length":0,"stats":{"Line":0}},{"line":60,"address":[8902496],"length":1,"stats":{"Line":0}},{"line":61,"address":[],"length":0,"stats":{"Line":0}},{"line":62,"address":[],"length":0,"stats":{"Line":0}},{"line":68,"address":[10667408,10667643],"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":[9292320],"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":[9292352,9292594],"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":[9292000,9292159],"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":[9293616,9294487],"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":[9293903],"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":[9293184,9293565],"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":[10189328],"length":1,"stats":{"Line":1}},{"line":6,"address":[12161352],"length":1,"stats":{"Line":1}},{"line":7,"address":[12161363],"length":1,"stats":{"Line":0}},{"line":9,"address":[12161426,12161403,12161375],"length":1,"stats":{"Line":2}},{"line":10,"address":[12161529,12161452,12161418],"length":1,"stats":{"Line":3}},{"line":11,"address":[12161447],"length":1,"stats":{"Line":1}},{"line":13,"address":[12161464,12161534],"length":1,"stats":{"Line":1}},{"line":19,"address":[12161552],"length":1,"stats":{"Line":1}},{"line":20,"address":[12161574,12161669],"length":1,"stats":{"Line":1}},{"line":21,"address":[12161648,12161689,12161828],"length":1,"stats":{"Line":2}},{"line":25,"address":[12161856,12162411],"length":1,"stats":{"Line":1}},{"line":26,"address":[12161886,12161962,12162448,12162461],"length":1,"stats":{"Line":4}},{"line":28,"address":[12162078,12162010],"length":1,"stats":{"Line":2}},{"line":30,"address":[12162699,12162512,12162531],"length":1,"stats":{"Line":3}},{"line":33,"address":[12162161,12162226],"length":1,"stats":{"Line":2}},{"line":34,"address":[12162290,12162364],"length":1,"stats":{"Line":0}},{"line":37,"address":[12162237],"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":[9625270,9625312,9624672,9625910],"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":[9624991,9625631],"length":1,"stats":{"Line":0}},{"line":26,"address":[10601420,10600780],"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":[10602809,10602837,10602165,10602137,10601536,10602208],"length":1,"stats":{"Line":2}},{"line":43,"address":[],"length":0,"stats":{"Line":4}},{"line":44,"address":[],"length":0,"stats":{"Line":8}},{"line":45,"address":[10602922,10603324,10603146,10603058],"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":[10596352,10598272,10600131,10598248],"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":[10598540,10596652],"length":1,"stats":{"Line":0}},{"line":59,"address":[10597736,10597484,10597602,10597297,10597803,10598790,10599185,10599490,10599621,10599688,10599372,10599878,10596902,10597994],"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":[788964,788879],"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":[790327,789855,789042,789668,789967,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":[12673192,12669872,12671871],"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":[12670075],"length":1,"stats":{"Line":1}},{"line":25,"address":[4460603],"length":1,"stats":{"Line":1}},{"line":27,"address":[13565915],"length":1,"stats":{"Line":1}},{"line":28,"address":[4460747,4460690],"length":1,"stats":{"Line":2}},{"line":29,"address":[12670370],"length":1,"stats":{"Line":1}},{"line":30,"address":[13566315],"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,4461552,4461822,4461623],"length":1,"stats":{"Line":4}},{"line":36,"address":[4461559],"length":1,"stats":{"Line":1}},{"line":39,"address":[13567042,13567229,13568844],"length":1,"stats":{"Line":2}},{"line":40,"address":[4462935,4461881],"length":1,"stats":{"Line":1}},{"line":41,"address":[13567782],"length":1,"stats":{"Line":0}},{"line":43,"address":[4462502],"length":1,"stats":{"Line":0}},{"line":44,"address":[13568035],"length":1,"stats":{"Line":0}},{"line":45,"address":[4462754,4462958,4463298],"length":1,"stats":{"Line":0}},{"line":47,"address":[4462645,4462818,4462948],"length":1,"stats":{"Line":0}},{"line":49,"address":[4463326,4461889,4462919,4462594],"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":[12867072],"length":1,"stats":{"Line":1}},{"line":55,"address":[13762888],"length":1,"stats":{"Line":1}},{"line":60,"address":[4298279,4298160],"length":1,"stats":{"Line":1}},{"line":61,"address":[13762925],"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":[13763075],"length":1,"stats":{"Line":1}},{"line":89,"address":[4298432,4299686,4299754],"length":1,"stats":{"Line":1}},{"line":90,"address":[4298454,4298575],"length":1,"stats":{"Line":2}},{"line":92,"address":[13763339,13763396],"length":1,"stats":{"Line":2}},{"line":93,"address":[],"length":0,"stats":{"Line":0}},{"line":94,"address":[13763555,13763491,13763888],"length":1,"stats":{"Line":2}},{"line":95,"address":[4299090,4298904],"length":1,"stats":{"Line":0}},{"line":97,"address":[12868104,12868275],"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":[12868452,12868540],"length":1,"stats":{"Line":2}},{"line":103,"address":[13764388],"length":1,"stats":{"Line":1}},{"line":120,"address":[12868736],"length":1,"stats":{"Line":1}},{"line":131,"address":[],"length":0,"stats":{"Line":0}},{"line":132,"address":[],"length":0,"stats":{"Line":0}},{"line":133,"address":[13766306,13765586,13766009],"length":1,"stats":{"Line":0}},{"line":134,"address":[],"length":0,"stats":{"Line":0}},{"line":136,"address":[13766097,13765723,13766011,13765824],"length":1,"stats":{"Line":0}},{"line":138,"address":[13766077,13766431,13766903,13766581],"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
