diff --git a/tarpaulin-report.html b/tarpaulin-report.html
index 475713b..1dc08c0 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 BATCH_PROVING_THREADS_NUM: usize = 2;\npub const RECURSIVE_PROVING_THREADS_NUM: usize = 2;\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 merkle_proof;\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::{merkle_proof::get_merkle_proof, prover::prove, verifier::verify};\nuse zk_por_core::{config::ProverConfig, 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    GetMerkleProof {\n        #[arg(short, long)]\n        cfg_path: String, // path to config file\n        #[arg(short, long)]\n        account_path: String,\n        #[arg(short, long)]\n        output_path: String, // path to output file\n    },\n    Verify {\n        #[arg(short, long)]\n        global_proof_path: String,\n        #[arg(short, long)]\n        inclusion_proof_path: Option\u003cString\u003e,\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            ZkPorCommitCommands::GetMerkleProof { cfg_path, account_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: ProverConfig = cfg.try_deserialize().unwrap();\n                get_merkle_proof(account_path.to_string(), prover_cfg, output_path.to_string())\n            }\n            ZkPorCommitCommands::Verify { global_proof_path, inclusion_proof_path } =\u003e {\n                let global_proof_path = PathBuf::from_str(\u0026global_proof_path).unwrap();\n                let inclusion_proof_path =\n                    inclusion_proof_path.as_ref().map(|p| PathBuf::from_str(\u0026p).unwrap());\n                verify(global_proof_path, inclusion_proof_path)\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","merkle_proof.rs"],"content":"use std::{fs::File, io::Write, str::FromStr};\n\nuse serde_json::json;\nuse zk_por_core::{\n    account::Account,\n    config::ProverConfig,\n    database::{DataBase, DbOption},\n    error::PoRError,\n    global::GlobalConfig,\n    merkle_proof::MerkleProof,\n    parser::{AccountParser, FileAccountReader, FileManager, FilesCfg},\n};\n\nuse crate::constant::RECURSION_BRANCHOUT_NUM;\n\npub fn get_merkle_proof(\n    account_path: String,\n    cfg: ProverConfig,\n    output_path: String,\n) -\u003e Result\u003c(), PoRError\u003e {\n    let database = DataBase::new(DbOption {\n        user_map_dir: cfg.db.level_db_user_path.to_string(),\n        gmst_dir: cfg.db.level_db_gmst_path.to_string(),\n    });\n\n    let batch_size = cfg.prover.batch_size as usize;\n    let token_num = cfg.prover.num_of_tokens as usize;\n\n    // the path to dump the final generated proof\n    let file_manager = FileManager {};\n    let account_parser = FileAccountReader::new(\n        FilesCfg {\n            dir: std::path::PathBuf::from_str(\u0026cfg.prover.user_data_path).unwrap(),\n            batch_size: cfg.prover.batch_size,\n            num_of_tokens: cfg.prover.num_of_tokens,\n        },\n        \u0026file_manager,\n    );\n    account_parser.log_state();\n    // let mut account_parser: Box\u003cdyn AccountParser\u003e = Box::new(parser);\n\n    let batch_num = account_parser.total_num_of_users().div_ceil(batch_size);\n\n    let global_cfg = 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\n    // the account json format is a map of tokens to token values, wheras the format in the merkle proof is given by a vec of token values.\n    let account = Account::new_from_file_path(account_path);\n\n    if account.is_err() {\n        return Err(account.unwrap_err());\n    }\n\n    let merkle_proof = MerkleProof::new_from_account(\u0026account.unwrap(), \u0026database, \u0026global_cfg)\n        .expect(\"Una ble to generate merkle proof\");\n\n    let mut file = File::create(output_path.clone())\n        .expect(format!(\"fail to create proof file at {:#?}\", output_path).as_str());\n    file.write_all(json!(merkle_proof).to_string().as_bytes())\n        .expect(\"fail to write proof to file\");\n\n    Ok(())\n}\n","traces":[{"line":16,"address":[8858309,8855184,8858543],"length":1,"stats":{"Line":0}},{"line":21,"address":[8855408,8855242],"length":1,"stats":{"Line":0}},{"line":22,"address":[8855274],"length":1,"stats":{"Line":0}},{"line":23,"address":[8855345],"length":1,"stats":{"Line":0}},{"line":26,"address":[8855507],"length":1,"stats":{"Line":0}},{"line":27,"address":[8855531],"length":1,"stats":{"Line":0}},{"line":32,"address":[8855698],"length":1,"stats":{"Line":0}},{"line":33,"address":[8855548,8855627],"length":1,"stats":{"Line":0}},{"line":34,"address":[8855690],"length":1,"stats":{"Line":0}},{"line":35,"address":[8855694],"length":1,"stats":{"Line":0}},{"line":39,"address":[8855777],"length":1,"stats":{"Line":0}},{"line":42,"address":[8855840],"length":1,"stats":{"Line":0}},{"line":52,"address":[8855960],"length":1,"stats":{"Line":0}},{"line":54,"address":[8856034,8856110],"length":1,"stats":{"Line":0}},{"line":55,"address":[8858367,8856434],"length":1,"stats":{"Line":0}},{"line":58,"address":[8856120,8856571,8856658],"length":1,"stats":{"Line":0}},{"line":61,"address":[8856771,8857443],"length":1,"stats":{"Line":0}},{"line":62,"address":[8857375,8858318,8856917,8857213,8857488],"length":1,"stats":{"Line":0}},{"line":63,"address":[8857910,8857986,8857851,8857595],"length":1,"stats":{"Line":0}},{"line":66,"address":[8858085],"length":1,"stats":{"Line":0}}],"covered":0,"coverable":20},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-cli","src","prover.rs"],"content":"use super::constant::{\n    BATCH_PROVING_THREADS_NUM, RECURSION_BRANCHOUT_NUM, RECURSIVE_PROVING_THREADS_NUM,\n};\nuse indicatif::ProgressBar;\nuse plonky2::hash::hash_types::HashOut;\nuse rayon::{iter::ParallelIterator, prelude::*};\nuse serde_json::json;\nuse std::{fs::File, io::Write, path::PathBuf, str::FromStr, sync::RwLock};\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::ProverConfig,\n    database::{DataBase, DbOption},\n    e2e::{batch_prove_accounts, prove_subproofs},\n    error::PoRError,\n    global::{GlobalConfig, GlobalMst, GLOBAL_MST},\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\npub fn prove(cfg: ProverConfig, proof_output_path: PathBuf) -\u003e Result\u003c(), PoRError\u003e {\n    let trace_cfg: TraceConfig = cfg.log.into();\n    let _g = init_tracing(trace_cfg);\n\n    let mut database = DataBase::new(DbOption {\n        user_map_dir: cfg.db.level_db_user_path.to_string(),\n        gmst_dir: cfg.db.level_db_gmst_path.to_string(),\n    });\n\n    let batch_size = cfg.prover.batch_size as usize;\n    let token_num = cfg.prover.num_of_tokens as usize;\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: cfg.prover.batch_size,\n            num_of_tokens: cfg.prover.num_of_tokens,\n        },\n        \u0026file_manager,\n    );\n    account_parser.log_state();\n    // let mut account_parser: Box\u003cdyn AccountParser\u003e = Box::new(parser);\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 num_cpus = num_cpus::get();\n    let num_cpus =\n        if BATCH_PROVING_THREADS_NUM \u003c num_cpus { BATCH_PROVING_THREADS_NUM } else { num_cpus };\n    let per_parse_account_num = num_cpus * batch_size; // as we use one thread to prove each batch, we load num_cpus batches to increase the parallelism.\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: Vec\u003cAccount\u003e =\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 = batch_prove_accounts(\n            \u0026circuit_registry,\n            accounts,\n            BATCH_PROVING_THREADS_NUM,\n            batch_size,\n        );\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_PROVING_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    let mut file = File::create(proof_output_path.clone())\n        .expect(format!(\"fail to create proof file at {:#?}\", proof_output_path).as_str());\n    file.write_all(json!(proof).to_string().as_bytes()).expect(\"fail to write proof to file\");\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    return Ok(());\n}\n","traces":[{"line":27,"address":[8731024,8749478],"length":1,"stats":{"Line":0}},{"line":28,"address":[8731123],"length":1,"stats":{"Line":0}},{"line":29,"address":[8731368],"length":1,"stats":{"Line":0}},{"line":31,"address":[8731534],"length":1,"stats":{"Line":0}},{"line":32,"address":[8731403],"length":1,"stats":{"Line":0}},{"line":33,"address":[8731471],"length":1,"stats":{"Line":0}},{"line":36,"address":[8731633],"length":1,"stats":{"Line":0}},{"line":37,"address":[8731652],"length":1,"stats":{"Line":0}},{"line":42,"address":[8731826],"length":1,"stats":{"Line":0}},{"line":43,"address":[8731755,8731664],"length":1,"stats":{"Line":0}},{"line":44,"address":[8731818],"length":1,"stats":{"Line":0}},{"line":45,"address":[8731822],"length":1,"stats":{"Line":0}},{"line":49,"address":[8731905],"length":1,"stats":{"Line":0}},{"line":52,"address":[8731968],"length":1,"stats":{"Line":0}},{"line":54,"address":[8732049],"length":1,"stats":{"Line":0}},{"line":62,"address":[8765677,8732215],"length":1,"stats":{"Line":0}},{"line":66,"address":[8732244],"length":1,"stats":{"Line":0}},{"line":68,"address":[8732283,8732347],"length":1,"stats":{"Line":0}},{"line":70,"address":[8733820,8732507,8733550,8733252,8733122,8732923,8733626],"length":1,"stats":{"Line":0}},{"line":78,"address":[8733317],"length":1,"stats":{"Line":0}},{"line":81,"address":[8735304],"length":1,"stats":{"Line":0}},{"line":89,"address":[8735077,8736103],"length":1,"stats":{"Line":0}},{"line":90,"address":[8736118],"length":1,"stats":{"Line":0}},{"line":91,"address":[8736130],"length":1,"stats":{"Line":0}},{"line":92,"address":[8736161],"length":1,"stats":{"Line":0}},{"line":94,"address":[8736201,8736272],"length":1,"stats":{"Line":0}},{"line":96,"address":[8736246],"length":1,"stats":{"Line":0}},{"line":97,"address":[8736265],"length":1,"stats":{"Line":0}},{"line":98,"address":[8736376,8736292],"length":1,"stats":{"Line":0}},{"line":99,"address":[8765520,8736500,8736397],"length":1,"stats":{"Line":0}},{"line":100,"address":[8757721,8757675,8736524],"length":1,"stats":{"Line":0}},{"line":101,"address":[8757682,8757742],"length":1,"stats":{"Line":0}},{"line":104,"address":[8757750],"length":1,"stats":{"Line":0}},{"line":106,"address":[8757826],"length":1,"stats":{"Line":0}},{"line":107,"address":[8757869],"length":1,"stats":{"Line":0}},{"line":108,"address":[8757959,8758207],"length":1,"stats":{"Line":0}},{"line":109,"address":[8758980,8758850,8759121,8758651,8759197,8758235,8759721],"length":1,"stats":{"Line":0}},{"line":110,"address":[8759045,8760022],"length":1,"stats":{"Line":0}},{"line":113,"address":[8760106,8757929],"length":1,"stats":{"Line":0}},{"line":115,"address":[8761055,8760440,8761326,8760856,8761185,8761402,8761816],"length":1,"stats":{"Line":0}},{"line":122,"address":[8761250,8762117],"length":1,"stats":{"Line":0}},{"line":124,"address":[8765807,8765744],"length":1,"stats":{"Line":0}},{"line":127,"address":[8762353,8762201],"length":1,"stats":{"Line":0}},{"line":128,"address":[8762369],"length":1,"stats":{"Line":0}},{"line":130,"address":[8762473,8762537],"length":1,"stats":{"Line":0}},{"line":132,"address":[8762545],"length":1,"stats":{"Line":0}},{"line":135,"address":[8766301,8765936,8765966],"length":1,"stats":{"Line":0}},{"line":136,"address":[8766013,8766065],"length":1,"stats":{"Line":0}},{"line":137,"address":[8766136,8766039,8766336,8766370],"length":1,"stats":{"Line":0}},{"line":138,"address":[8766380],"length":1,"stats":{"Line":0}},{"line":140,"address":[8766201],"length":1,"stats":{"Line":0}},{"line":143,"address":[8762693],"length":1,"stats":{"Line":0}},{"line":147,"address":[8762771],"length":1,"stats":{"Line":0}},{"line":152,"address":[8762871,8762935],"length":1,"stats":{"Line":0}},{"line":154,"address":[8766479,8766464,8763117],"length":1,"stats":{"Line":0}},{"line":155,"address":[8766634,8766524],"length":1,"stats":{"Line":0}},{"line":157,"address":[8766550],"length":1,"stats":{"Line":0}},{"line":158,"address":[8766580],"length":1,"stats":{"Line":0}},{"line":159,"address":[8766617],"length":1,"stats":{"Line":0}},{"line":160,"address":[8766726],"length":1,"stats":{"Line":0}},{"line":164,"address":[8763382],"length":1,"stats":{"Line":0}},{"line":166,"address":[8764949],"length":1,"stats":{"Line":0}},{"line":173,"address":[8764379],"length":1,"stats":{"Line":0}},{"line":174,"address":[8765475,8765417],"length":1,"stats":{"Line":0}},{"line":176,"address":[8736505],"length":1,"stats":{"Line":0}},{"line":178,"address":[8737740],"length":1,"stats":{"Line":0}},{"line":185,"address":[8737524,8738509],"length":1,"stats":{"Line":0}},{"line":187,"address":[8738533],"length":1,"stats":{"Line":0}},{"line":188,"address":[8738556],"length":1,"stats":{"Line":0}},{"line":189,"address":[8738578],"length":1,"stats":{"Line":0}},{"line":190,"address":[8738698,8738634],"length":1,"stats":{"Line":0}},{"line":193,"address":[8738914,8757542,8738706],"length":1,"stats":{"Line":0}},{"line":194,"address":[8738930,8749801],"length":1,"stats":{"Line":0}},{"line":195,"address":[8749816],"length":1,"stats":{"Line":0}},{"line":196,"address":[8750209,8749864],"length":1,"stats":{"Line":0}},{"line":199,"address":[8750118,8749989],"length":1,"stats":{"Line":0}},{"line":204,"address":[8750334],"length":1,"stats":{"Line":0}},{"line":206,"address":[8751446,8750933,8751132,8751860,8750517,8751262,8751370],"length":1,"stats":{"Line":0}},{"line":213,"address":[8752145,8751327],"length":1,"stats":{"Line":0}},{"line":214,"address":[8752395,8752188],"length":1,"stats":{"Line":0}},{"line":215,"address":[8753168,8752839,8753038,8752423,8753385,8753309,8753906],"length":1,"stats":{"Line":0}},{"line":217,"address":[8754207,8753233],"length":1,"stats":{"Line":0}},{"line":220,"address":[8752163,8754399],"length":1,"stats":{"Line":0}},{"line":221,"address":[8754415],"length":1,"stats":{"Line":0}},{"line":222,"address":[8766800,8766837,8754599,8754519],"length":1,"stats":{"Line":0}},{"line":223,"address":[8766847],"length":1,"stats":{"Line":0}},{"line":224,"address":[8766873],"length":1,"stats":{"Line":0}},{"line":226,"address":[8767042,8766910],"length":1,"stats":{"Line":0}},{"line":228,"address":[8754684],"length":1,"stats":{"Line":0}},{"line":231,"address":[8754718],"length":1,"stats":{"Line":0}},{"line":232,"address":[8754782],"length":1,"stats":{"Line":0}},{"line":238,"address":[8755313,8754923],"length":1,"stats":{"Line":0}},{"line":239,"address":[8754907],"length":1,"stats":{"Line":0}},{"line":241,"address":[8755085,8755214,8754987],"length":1,"stats":{"Line":0}},{"line":247,"address":[8755362,8755237],"length":1,"stats":{"Line":0}},{"line":249,"address":[8755389],"length":1,"stats":{"Line":0}},{"line":250,"address":[8755509],"length":1,"stats":{"Line":0}},{"line":252,"address":[8756732,8756189,8755773,8756388,8756518,8756656,8757249],"length":1,"stats":{"Line":0}},{"line":260,"address":[8738899,8738967],"length":1,"stats":{"Line":0}},{"line":261,"address":[8749589,8749707,8739004],"length":1,"stats":{"Line":0}},{"line":263,"address":[8739095,8738989],"length":1,"stats":{"Line":0}},{"line":266,"address":[8739183,8739103],"length":1,"stats":{"Line":0}},{"line":267,"address":[8739199],"length":1,"stats":{"Line":0}},{"line":269,"address":[8739268,8739379],"length":1,"stats":{"Line":0}},{"line":270,"address":[8739395],"length":1,"stats":{"Line":0}},{"line":271,"address":[8739499,8739595],"length":1,"stats":{"Line":0}},{"line":272,"address":[8739658],"length":1,"stats":{"Line":0}},{"line":274,"address":[8739692],"length":1,"stats":{"Line":0}},{"line":275,"address":[8739867,8740111,8739748],"length":1,"stats":{"Line":0}},{"line":276,"address":[8741318,8740860,8741189,8741394,8740444,8741059,8741652],"length":1,"stats":{"Line":0}},{"line":278,"address":[8741262,8741940],"length":1,"stats":{"Line":0}},{"line":280,"address":[8741905],"length":1,"stats":{"Line":0}},{"line":283,"address":[8743301],"length":1,"stats":{"Line":0}},{"line":289,"address":[8742975,8743760],"length":1,"stats":{"Line":0}},{"line":292,"address":[8743794],"length":1,"stats":{"Line":0}},{"line":303,"address":[8744054,8744770,8744121],"length":1,"stats":{"Line":0}},{"line":304,"address":[8744232,8744528,8744690,8749500,8744821],"length":1,"stats":{"Line":0}},{"line":305,"address":[8745202,8744940],"length":1,"stats":{"Line":0}},{"line":309,"address":[8745547,8745436],"length":1,"stats":{"Line":0}},{"line":311,"address":[8745563],"length":1,"stats":{"Line":0}},{"line":312,"address":[8745723,8745660],"length":1,"stats":{"Line":0}},{"line":313,"address":[8746567,8746905,8747099,8746368,8745952,8746697,8746829],"length":1,"stats":{"Line":0}},{"line":314,"address":[8746762,8747367],"length":1,"stats":{"Line":0}},{"line":315,"address":[8747390],"length":1,"stats":{"Line":0}},{"line":316,"address":[8748000,8747584,8748806,8748329,8748548,8748472,8748199],"length":1,"stats":{"Line":0}},{"line":318,"address":[8748412],"length":1,"stats":{"Line":0}}],"covered":0,"coverable":126},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-cli","src","verifier.rs"],"content":"use 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;\n\npub fn verify(\n    global_proof_path: PathBuf,\n    merkle_inclusion_path: Option\u003cPathBuf\u003e,\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).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    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    if !root_circuit.verify(proof.proof).is_ok() {\n        return Err(PoRError::InvalidProof);\n    }\n    println!(\"successfully verify the global proof for round {}\", round_num);\n\n    if let Some(merkle_inclusion_path) = merkle_inclusion_path {\n        let merkle_path = File::open(\u0026merkle_inclusion_path).unwrap();\n        let reader = std::io::BufReader::new(merkle_path);\n\n        // Parse the JSON as Proof\n        let proof: MerkleProof = from_reader(reader).unwrap();\n\n        let res = proof.verify_merkle_proof(root_hash);\n\n        if res.is_err() {\n            let res_err = res.unwrap_err();\n            return Err(res_err);\n        } else {\n            println!(\"successfully verify the inclusion proof for user for round {}\", round_num);\n            return Ok(());\n        }\n    }\n\n    Ok(())\n}\n","traces":[{"line":18,"address":[8994352,8998604,8998252],"length":1,"stats":{"Line":0}},{"line":22,"address":[8994406,8994791],"length":1,"stats":{"Line":0}},{"line":23,"address":[8994798],"length":1,"stats":{"Line":0}},{"line":26,"address":[8994833,8995051],"length":1,"stats":{"Line":0}},{"line":28,"address":[8995059],"length":1,"stats":{"Line":0}},{"line":29,"address":[8995165,8998518],"length":1,"stats":{"Line":0}},{"line":32,"address":[8995070],"length":1,"stats":{"Line":0}},{"line":33,"address":[8995094],"length":1,"stats":{"Line":0}},{"line":34,"address":[8995110],"length":1,"stats":{"Line":0}},{"line":35,"address":[8995126],"length":1,"stats":{"Line":0}},{"line":36,"address":[8995235,8995158],"length":1,"stats":{"Line":0}},{"line":40,"address":[8995540],"length":1,"stats":{"Line":0}},{"line":45,"address":[8995625],"length":1,"stats":{"Line":0}},{"line":50,"address":[8995697],"length":1,"stats":{"Line":0}},{"line":53,"address":[8995881,8995938],"length":1,"stats":{"Line":0}},{"line":55,"address":[8995946],"length":1,"stats":{"Line":0}},{"line":56,"address":[8995976],"length":1,"stats":{"Line":0}},{"line":57,"address":[8996137],"length":1,"stats":{"Line":0}},{"line":60,"address":[8996340],"length":1,"stats":{"Line":0}},{"line":65,"address":[8996425],"length":1,"stats":{"Line":0}},{"line":66,"address":[8996468],"length":1,"stats":{"Line":0}},{"line":67,"address":[8996525],"length":1,"stats":{"Line":0}},{"line":68,"address":[8996714],"length":1,"stats":{"Line":0}},{"line":70,"address":[8996878],"length":1,"stats":{"Line":0}},{"line":72,"address":[8996955],"length":1,"stats":{"Line":0}},{"line":73,"address":[8997350,8997040],"length":1,"stats":{"Line":0}},{"line":74,"address":[8997357],"length":1,"stats":{"Line":0}},{"line":77,"address":[8997392],"length":1,"stats":{"Line":0}},{"line":79,"address":[8997604,8997715],"length":1,"stats":{"Line":0}},{"line":81,"address":[8997784,8997731],"length":1,"stats":{"Line":0}},{"line":82,"address":[8997905],"length":1,"stats":{"Line":0}},{"line":83,"address":[8998150],"length":1,"stats":{"Line":0}},{"line":85,"address":[8998039],"length":1,"stats":{"Line":0}},{"line":86,"address":[8998116],"length":1,"stats":{"Line":0}},{"line":90,"address":[8997065],"length":1,"stats":{"Line":0}}],"covered":0,"coverable":35},{"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 plonky2::{\n    hash::{hash_types::HashOut, poseidon::PoseidonHash},\n    plonk::config::Hasher,\n};\nuse plonky2_field::types::Field;\nuse serde::{Deserialize, Serialize};\nuse serde_json::Value;\nuse std::{collections::BTreeMap, fs::File, io::BufReader};\n\nuse crate::{\n    database::{DataBase, UserId},\n    error::PoRError,\n    parser::parse_account_state,\n    types::F,\n};\nuse rand::Rng;\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    /// Get a new account from a file path\n    pub fn new_from_file_path(path: String) -\u003e Result\u003cSelf, PoRError\u003e {\n        let file_res = File::open(path);\n\n        if file_res.is_err() {\n            return Err(PoRError::InvalidParameter(\"Invalid account json file path\".to_string()));\n        }\n\n        let reader = BufReader::new(file_res.unwrap());\n        // Deserialize the json data to a struct\n        let account_map_res: Result\u003cBTreeMap\u003cString, Value\u003e, _\u003e = serde_json::from_reader(reader);\n\n        if account_map_res.is_err() {\n            return Err(PoRError::InvalidParameter(\"Invalid account json\".to_string()));\n        }\n\n        let account = parse_account_state(\u0026account_map_res.unwrap());\n\n        Ok(account)\n    }\n}\n\npub fn persist_account_id_to_gmst_pos(\n    db: \u0026mut DataBase,\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":28,"address":[8802377,8801536,8802406],"length":1,"stats":{"Line":1}},{"line":29,"address":[8802448,8802480,8801574],"length":1,"stats":{"Line":3}},{"line":31,"address":[12338832,12338800,12337929],"length":1,"stats":{"Line":3}},{"line":33,"address":[12337989],"length":1,"stats":{"Line":1}},{"line":36,"address":[12338682,12338082,12338024],"length":1,"stats":{"Line":2}},{"line":42,"address":[12339156,12338848],"length":1,"stats":{"Line":0}},{"line":45,"address":[12338895,12338962],"length":1,"stats":{"Line":0}},{"line":46,"address":[12339042,12338978],"length":1,"stats":{"Line":0}},{"line":50,"address":[8803183,8802880],"length":1,"stats":{"Line":1}},{"line":52,"address":[12339211],"length":1,"stats":{"Line":1}},{"line":53,"address":[12339306,12339242],"length":1,"stats":{"Line":2}},{"line":54,"address":[12339322,12339381],"length":1,"stats":{"Line":2}},{"line":59,"address":[12339520,12340619],"length":1,"stats":{"Line":1}},{"line":60,"address":[12339570,12339655],"length":1,"stats":{"Line":1}},{"line":62,"address":[12339683,12340034,12340641,12340435,12340149,12339919,12340218,12339591,12339804],"length":1,"stats":{"Line":2}},{"line":63,"address":[12339612,12339751],"length":1,"stats":{"Line":2}},{"line":64,"address":[12339866,12339766],"length":1,"stats":{"Line":2}},{"line":65,"address":[12339881,12339981],"length":1,"stats":{"Line":2}},{"line":66,"address":[12339996,12340096],"length":1,"stats":{"Line":2}},{"line":67,"address":[12340111,12340211],"length":1,"stats":{"Line":2}},{"line":70,"address":[12340510,12340409],"length":1,"stats":{"Line":2}},{"line":72,"address":[12340864,12340656,12340683],"length":1,"stats":{"Line":3}},{"line":77,"address":[12340880,12341970,12342271],"length":1,"stats":{"Line":0}},{"line":78,"address":[12340897],"length":1,"stats":{"Line":0}},{"line":80,"address":[12340945,12341025],"length":1,"stats":{"Line":0}},{"line":81,"address":[12342171,12341246],"length":1,"stats":{"Line":0}},{"line":84,"address":[12341035,12341280],"length":1,"stats":{"Line":0}},{"line":86,"address":[12341299],"length":1,"stats":{"Line":0}},{"line":88,"address":[12341334,12341422],"length":1,"stats":{"Line":0}},{"line":89,"address":[12341709,12341984],"length":1,"stats":{"Line":0}},{"line":92,"address":[12341739,12341432],"length":1,"stats":{"Line":0}},{"line":94,"address":[12341873],"length":1,"stats":{"Line":0}},{"line":98,"address":[12342304],"length":1,"stats":{"Line":0}},{"line":103,"address":[12342339],"length":1,"stats":{"Line":0}},{"line":106,"address":[8806080,8806144],"length":1,"stats":{"Line":0}},{"line":107,"address":[12342512],"length":1,"stats":{"Line":0}},{"line":109,"address":[8806461,8806536],"length":1,"stats":{"Line":0}},{"line":112,"address":[12342413],"length":1,"stats":{"Line":0}},{"line":116,"address":[12344206,12342912,12344175],"length":1,"stats":{"Line":1}},{"line":117,"address":[12342967],"length":1,"stats":{"Line":1}},{"line":118,"address":[8806736,8806660],"length":1,"stats":{"Line":2}},{"line":119,"address":[12343182,12343999,12343100],"length":1,"stats":{"Line":3}},{"line":120,"address":[12343322],"length":1,"stats":{"Line":1}},{"line":121,"address":[12343365],"length":1,"stats":{"Line":1}},{"line":122,"address":[12343441,12343522],"length":1,"stats":{"Line":2}},{"line":123,"address":[12343650,12344008],"length":1,"stats":{"Line":2}},{"line":124,"address":[8807684,8807639],"length":1,"stats":{"Line":1}},{"line":125,"address":[12344085,12344044],"length":1,"stats":{"Line":2}},{"line":126,"address":[12344108],"length":1,"stats":{"Line":1}},{"line":129,"address":[12343604],"length":1,"stats":{"Line":1}},{"line":130,"address":[12343623],"length":1,"stats":{"Line":1}},{"line":132,"address":[12344747,12344240,12344368,12344623,12343686],"length":1,"stats":{"Line":5}},{"line":133,"address":[12343780],"length":1,"stats":{"Line":1}},{"line":135,"address":[12343272],"length":1,"stats":{"Line":1}},{"line":138,"address":[12344768],"length":1,"stats":{"Line":0}},{"line":139,"address":[12344875],"length":1,"stats":{"Line":0}},{"line":141,"address":[12344811],"length":1,"stats":{"Line":0}}],"covered":35,"coverable":57},{"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":[9220752,9221315],"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":[8688550,8675568,8688286],"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":[8677973],"length":1,"stats":{"Line":0}},{"line":59,"address":[8678019],"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":[8678253],"length":1,"stats":{"Line":0}},{"line":67,"address":[8678420,8678325],"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":[8680396],"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":[8683309],"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":[8685606],"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":[8681844],"length":1,"stats":{"Line":0}},{"line":150,"address":[],"length":0,"stats":{"Line":0}},{"line":151,"address":[],"length":0,"stats":{"Line":0}},{"line":154,"address":[8675248],"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":[8675440],"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":[11140576],"length":1,"stats":{"Line":1}},{"line":20,"address":[11140580],"length":1,"stats":{"Line":1}},{"line":22,"address":[11140589],"length":1,"stats":{"Line":1}},{"line":25,"address":[11140608],"length":1,"stats":{"Line":1}},{"line":30,"address":[10806368,10809273,10804416,10805369,10810249,10806345,10807321,10808320,10810207,10809231,10809296,10807279,10807344,10805392,10806303,10805327,10808297,10808255],"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":[10809665,10807713,10804785,10808689,10806737,10805761],"length":1,"stats":{"Line":5}},{"line":40,"address":[],"length":0,"stats":{"Line":5}},{"line":41,"address":[10808757,10809733,10804853,10805829,10806805,10807781],"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":[11140640],"length":1,"stats":{"Line":1}},{"line":51,"address":[11140649],"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: usize,\n    pub num_of_tokens: usize,\n    pub user_data_path: String,\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: ConfigDb,\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":[10314256,10313808,10314301],"length":1,"stats":{"Line":0}},{"line":20,"address":[10313838],"length":1,"stats":{"Line":0}},{"line":21,"address":[10313855],"length":1,"stats":{"Line":0}},{"line":22,"address":[10313876,10313968],"length":1,"stats":{"Line":0}},{"line":23,"address":[8453419],"length":1,"stats":{"Line":0}},{"line":24,"address":[10314158],"length":1,"stats":{"Line":0}},{"line":44,"address":[10314320,10315967,10316036],"length":1,"stats":{"Line":0}},{"line":45,"address":[10314347,10316049],"length":1,"stats":{"Line":0}},{"line":46,"address":[10315685,10315108,10315557,10314531,10315741],"length":1,"stats":{"Line":0}},{"line":48,"address":[10314702,10314992,10316017,10315151,10314591,10314847],"length":1,"stats":{"Line":0}},{"line":49,"address":[10315270,10315600,10315443,10315976],"length":1,"stats":{"Line":0}},{"line":50,"address":[10315616,10315945,10315733],"length":1,"stats":{"Line":0}},{"line":53,"address":[10316080,10316448,10316477],"length":1,"stats":{"Line":0}},{"line":54,"address":[10316331,10316097],"length":1,"stats":{"Line":0}},{"line":55,"address":[10812253],"length":1,"stats":{"Line":0}},{"line":67,"address":[10318212,10316496,10318143],"length":1,"stats":{"Line":0}},{"line":68,"address":[10814133,10812475],"length":1,"stats":{"Line":0}},{"line":69,"address":[10317861,10316707,10317917,10317733,10317284],"length":1,"stats":{"Line":0}},{"line":71,"address":[10317168,10318193,10317023,10316878,10317327,10316767],"length":1,"stats":{"Line":0}},{"line":72,"address":[10317446,10317619,10317776,10318152],"length":1,"stats":{"Line":0}},{"line":73,"address":[10317792,10317909,10318121],"length":1,"stats":{"Line":0}},{"line":76,"address":[10318624,10318653,10318256],"length":1,"stats":{"Line":0}},{"line":77,"address":[10318507,10318273],"length":1,"stats":{"Line":0}},{"line":78,"address":[10318463],"length":1,"stats":{"Line":0}}],"covered":0,"coverable":24},{"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, types::F};\n\n#[derive(Debug, Clone, Copy)]\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 struct DbOption {\n    pub user_map_dir: String,\n    pub gmst_dir: String,\n}\n\npub struct DataBase {\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}\nimpl DataBase {\n    pub fn new(opt: DbOption) -\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    pub 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    pub 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    pub 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    pub 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\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::{DataBase, DbOption, UserId},\n        types::F,\n    };\n\n    #[test]\n    fn test_database() {\n        let tempdir_user = TempDir::new(\"example_user\").unwrap();\n        let tempdir_gmst = TempDir::new(\"example_gmst\").unwrap();\n        let mut db = DataBase::new(DbOption {\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\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","traces":[{"line":14,"address":[10336272,10336461],"length":1,"stats":{"Line":1}},{"line":15,"address":[10336285],"length":1,"stats":{"Line":1}},{"line":16,"address":[12344938],"length":1,"stats":{"Line":1}},{"line":17,"address":[12344952],"length":1,"stats":{"Line":1}},{"line":18,"address":[12345009],"length":1,"stats":{"Line":1}},{"line":21,"address":[12345136],"length":1,"stats":{"Line":0}},{"line":22,"address":[10336497],"length":1,"stats":{"Line":0}},{"line":25,"address":[12346463,12349453,12345184],"length":1,"stats":{"Line":0}},{"line":26,"address":[12345226,12345314],"length":1,"stats":{"Line":0}},{"line":27,"address":[12348618,12348730,12349030,12349204,12348966,12348431,12348036],"length":1,"stats":{"Line":0}},{"line":28,"address":[10340110],"length":1,"stats":{"Line":0}},{"line":31,"address":[10336656,10336844],"length":1,"stats":{"Line":0}},{"line":33,"address":[12345641,12345535],"length":1,"stats":{"Line":0}},{"line":34,"address":[12347505,12346895,12347094,12347224,12346479,12347569,12347744],"length":1,"stats":{"Line":0}},{"line":35,"address":[12347299],"length":1,"stats":{"Line":0}},{"line":38,"address":[12345651],"length":1,"stats":{"Line":0}},{"line":39,"address":[12346083,12345671],"length":1,"stats":{"Line":0}},{"line":41,"address":[12346244],"length":1,"stats":{"Line":0}},{"line":46,"address":[12349488],"length":1,"stats":{"Line":0}},{"line":47,"address":[10340836,10341097],"length":1,"stats":{"Line":0}},{"line":48,"address":[12349534],"length":1,"stats":{"Line":0}},{"line":52,"address":[10341014],"length":1,"stats":{"Line":0}},{"line":55,"address":[12349863,12350015,12349952,12349824],"length":1,"stats":{"Line":2}},{"line":56,"address":[10341299,10341178,10341236,10341350],"length":1,"stats":{"Line":4}},{"line":57,"address":[],"length":0,"stats":{"Line":2}},{"line":71,"address":[10342010,10341392,10342041],"length":1,"stats":{"Line":1}},{"line":73,"address":[12350142,12350218,12350273],"length":1,"stats":{"Line":3}},{"line":74,"address":[12350346,12350421,12350476],"length":1,"stats":{"Line":3}},{"line":78,"address":[12350800],"length":1,"stats":{"Line":1}},{"line":79,"address":[12350813],"length":1,"stats":{"Line":1}},{"line":81,"address":[12350880,12350899],"length":1,"stats":{"Line":2}},{"line":83,"address":[12350860],"length":1,"stats":{"Line":1}},{"line":86,"address":[10342320],"length":1,"stats":{"Line":1}},{"line":87,"address":[12351152,12351381,12351071],"length":1,"stats":{"Line":2}},{"line":88,"address":[12351161],"length":1,"stats":{"Line":1}},{"line":89,"address":[10342422,10342499],"length":1,"stats":{"Line":2}},{"line":90,"address":[12351330],"length":1,"stats":{"Line":1}},{"line":97,"address":[12351408],"length":1,"stats":{"Line":1}},{"line":98,"address":[10342653],"length":1,"stats":{"Line":1}},{"line":100,"address":[12351488,12351507],"length":1,"stats":{"Line":2}},{"line":101,"address":[12351553],"length":1,"stats":{"Line":1}},{"line":105,"address":[12351468],"length":1,"stats":{"Line":1}},{"line":108,"address":[12351632],"length":1,"stats":{"Line":1}},{"line":109,"address":[12351654,12351696,12351823],"length":1,"stats":{"Line":2}},{"line":110,"address":[12351791,12351723],"length":1,"stats":{"Line":2}}],"covered":28,"coverable":45},{"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":[8696896,8697395],"length":1,"stats":{"Line":0}},{"line":20,"address":[],"length":0,"stats":{"Line":0}},{"line":21,"address":[8697012,8697058],"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":[8697460],"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":[8697350],"length":1,"stats":{"Line":0}},{"line":41,"address":[8692992,8694350],"length":1,"stats":{"Line":0}},{"line":48,"address":[],"length":0,"stats":{"Line":0}},{"line":49,"address":[8693164,8693217],"length":1,"stats":{"Line":0}},{"line":50,"address":[8693363],"length":1,"stats":{"Line":0}},{"line":52,"address":[8693734,8693395],"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":[8693819],"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":[8696788],"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":[8694581,8694760],"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":[8694199],"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\")]\n    InvalidMerkleProof,\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::DataBase,\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 DataBase) {\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":[12351856,12352368],"length":1,"stats":{"Line":1}},{"line":31,"address":[10343078],"length":1,"stats":{"Line":1}},{"line":34,"address":[12352046],"length":1,"stats":{"Line":1}},{"line":35,"address":[12352104],"length":1,"stats":{"Line":1}},{"line":37,"address":[12352161,12352226],"length":1,"stats":{"Line":2}},{"line":38,"address":[10343418,10343460],"length":1,"stats":{"Line":1}},{"line":39,"address":[12352305,12352261],"length":1,"stats":{"Line":2}},{"line":40,"address":[12352337],"length":1,"stats":{"Line":1}},{"line":43,"address":[12352400],"length":1,"stats":{"Line":1}},{"line":44,"address":[12352405],"length":1,"stats":{"Line":1}},{"line":47,"address":[12352416],"length":1,"stats":{"Line":1}},{"line":48,"address":[12352425,12352453],"length":1,"stats":{"Line":1}},{"line":51,"address":[12352480],"length":1,"stats":{"Line":0}},{"line":52,"address":[12352498],"length":1,"stats":{"Line":0}},{"line":55,"address":[12352528],"length":1,"stats":{"Line":0}},{"line":56,"address":[12352533],"length":1,"stats":{"Line":0}},{"line":65,"address":[12352560],"length":1,"stats":{"Line":1}},{"line":70,"address":[10343774],"length":1,"stats":{"Line":1}},{"line":71,"address":[12352623],"length":1,"stats":{"Line":1}},{"line":72,"address":[12352652],"length":1,"stats":{"Line":1}},{"line":74,"address":[12352674,12352728],"length":1,"stats":{"Line":1}},{"line":76,"address":[10343921,10343979,10343875],"length":1,"stats":{"Line":2}},{"line":77,"address":[12352930,12352838,12352804],"length":1,"stats":{"Line":2}},{"line":79,"address":[12352956,12353008,12352922],"length":1,"stats":{"Line":2}},{"line":80,"address":[12353062,12353034,12352993],"length":1,"stats":{"Line":2}},{"line":82,"address":[12353042,12353083,12353303],"length":1,"stats":{"Line":2}},{"line":86,"address":[12353329,12353288,12353379],"length":1,"stats":{"Line":2}},{"line":93,"address":[10344576],"length":1,"stats":{"Line":1}},{"line":98,"address":[12353463,12353609],"length":1,"stats":{"Line":1}},{"line":99,"address":[12353567],"length":1,"stats":{"Line":1}},{"line":100,"address":[12353584],"length":1,"stats":{"Line":1}},{"line":101,"address":[12353601],"length":1,"stats":{"Line":1}},{"line":103,"address":[12353641],"length":1,"stats":{"Line":1}},{"line":105,"address":[12353919,12353705,12353895],"length":1,"stats":{"Line":2}},{"line":106,"address":[10345071],"length":1,"stats":{"Line":1}},{"line":108,"address":[12353682,12353748],"length":1,"stats":{"Line":2}},{"line":113,"address":[10345112,10344822,10345260,10345153],"length":1,"stats":{"Line":4}},{"line":114,"address":[12353974],"length":1,"stats":{"Line":1}},{"line":116,"address":[12354036,12354095,12353993],"length":1,"stats":{"Line":2}},{"line":119,"address":[12354150,12354006,12354121],"length":1,"stats":{"Line":2}},{"line":120,"address":[12354129,12354176],"length":1,"stats":{"Line":2}},{"line":122,"address":[12354335,12354420],"length":1,"stats":{"Line":1}},{"line":124,"address":[12354410],"length":1,"stats":{"Line":1}},{"line":125,"address":[12354747,12354418,12354436],"length":1,"stats":{"Line":3}},{"line":126,"address":[12354569,12354647,12354483],"length":1,"stats":{"Line":2}},{"line":127,"address":[10345777],"length":1,"stats":{"Line":1}},{"line":128,"address":[12354593],"length":1,"stats":{"Line":1}},{"line":130,"address":[12354619,12354719,12354668],"length":1,"stats":{"Line":2}},{"line":132,"address":[12354676],"length":1,"stats":{"Line":1}},{"line":133,"address":[12354752,12354692,12354739],"length":1,"stats":{"Line":2}},{"line":136,"address":[12354543,12354455,12354522],"length":1,"stats":{"Line":2}},{"line":137,"address":[10345697],"length":1,"stats":{"Line":1}},{"line":142,"address":[12354768],"length":1,"stats":{"Line":1}},{"line":143,"address":[12354797],"length":1,"stats":{"Line":1}},{"line":144,"address":[12354820],"length":1,"stats":{"Line":1}},{"line":147,"address":[10346048],"length":1,"stats":{"Line":0}},{"line":148,"address":[10346823,10346202,10346750,10346681,10346533,10346866,10347038],"length":1,"stats":{"Line":0}},{"line":149,"address":[10347318,10346781],"length":1,"stats":{"Line":0}},{"line":151,"address":[10347351],"length":1,"stats":{"Line":0}},{"line":153,"address":[10347363,10347525],"length":1,"stats":{"Line":0}},{"line":155,"address":[10347462],"length":1,"stats":{"Line":0}},{"line":159,"address":[10347552],"length":1,"stats":{"Line":1}},{"line":160,"address":[12356538,12357278,12356869,12357235,12357642,12357017,12357090],"length":1,"stats":{"Line":7}},{"line":164,"address":[10348289],"length":1,"stats":{"Line":1}},{"line":165,"address":[12357157],"length":1,"stats":{"Line":1}},{"line":168,"address":[12362404,12365925,12357984],"length":1,"stats":{"Line":1}},{"line":170,"address":[10349159],"length":1,"stats":{"Line":1}},{"line":171,"address":[10349208],"length":1,"stats":{"Line":1}},{"line":172,"address":[12358173,12358080,12358330],"length":1,"stats":{"Line":3}},{"line":173,"address":[12358346],"length":1,"stats":{"Line":1}},{"line":174,"address":[10353489,10349510,10353584],"length":1,"stats":{"Line":2}},{"line":175,"address":[12362489,12362553],"length":1,"stats":{"Line":2}},{"line":176,"address":[12362807,12362675],"length":1,"stats":{"Line":1}},{"line":177,"address":[12362778,12362991,12362836],"length":1,"stats":{"Line":2}},{"line":179,"address":[10354020,10354092],"length":1,"stats":{"Line":2}},{"line":182,"address":[12363036],"length":1,"stats":{"Line":1}},{"line":187,"address":[10354159],"length":1,"stats":{"Line":1}},{"line":192,"address":[12363154],"length":1,"stats":{"Line":1}},{"line":193,"address":[10354263],"length":1,"stats":{"Line":1}},{"line":196,"address":[12363268],"length":1,"stats":{"Line":1}},{"line":197,"address":[10354362],"length":1,"stats":{"Line":1}},{"line":199,"address":[10354431],"length":1,"stats":{"Line":1}},{"line":200,"address":[10355030,10355217,10354635,10355329,10356575,10356459,10355494,10355430],"length":1,"stats":{"Line":7}},{"line":201,"address":[10355385],"length":1,"stats":{"Line":1}},{"line":205,"address":[12358283],"length":1,"stats":{"Line":1}},{"line":206,"address":[12358412,12358295],"length":1,"stats":{"Line":2}},{"line":207,"address":[10349783,10349564],"length":1,"stats":{"Line":2}},{"line":208,"address":[10349799,10350086,10350153],"length":1,"stats":{"Line":2}},{"line":209,"address":[10350189,10350126],"length":1,"stats":{"Line":2}},{"line":210,"address":[10350303],"length":1,"stats":{"Line":1}},{"line":211,"address":[12365952,12365971],"length":1,"stats":{"Line":2}},{"line":213,"address":[12359340,12359249],"length":1,"stats":{"Line":2}},{"line":214,"address":[12359348,12359490],"length":1,"stats":{"Line":2}},{"line":216,"address":[10357088,10357107,10350574],"length":1,"stats":{"Line":3}},{"line":218,"address":[10357226,10357120],"length":1,"stats":{"Line":1}},{"line":219,"address":[12366171],"length":1,"stats":{"Line":1}},{"line":224,"address":[12359639,12359544],"length":1,"stats":{"Line":2}},{"line":226,"address":[12366250,12366224],"length":1,"stats":{"Line":2}},{"line":229,"address":[12359736],"length":1,"stats":{"Line":1}},{"line":231,"address":[12359815],"length":1,"stats":{"Line":1}},{"line":232,"address":[12361998,12360580,12360909,12360779,12361870,12360164,12361118,12361042],"length":1,"stats":{"Line":0}},{"line":233,"address":[12360974],"length":1,"stats":{"Line":0}},{"line":235,"address":[12359904,12360089],"length":1,"stats":{"Line":2}},{"line":238,"address":[12358609,12358703],"length":1,"stats":{"Line":2}},{"line":240,"address":[12358711],"length":1,"stats":{"Line":1}},{"line":242,"address":[12366346,12358756,12366336],"length":1,"stats":{"Line":3}},{"line":245,"address":[10357376],"length":1,"stats":{"Line":0}},{"line":246,"address":[12366401],"length":1,"stats":{"Line":0}},{"line":247,"address":[12366531,12367199,12367372,12366862,12367156,12367010,12367079],"length":1,"stats":{"Line":0}},{"line":248,"address":[12367105],"length":1,"stats":{"Line":0}},{"line":249,"address":[10358124],"length":1,"stats":{"Line":0}},{"line":250,"address":[12368013,12367129,12367652],"length":1,"stats":{"Line":0}},{"line":251,"address":[12367971,12367675],"length":1,"stats":{"Line":0}},{"line":252,"address":[12367782],"length":1,"stats":{"Line":0}},{"line":253,"address":[12367829],"length":1,"stats":{"Line":0}},{"line":256,"address":[12368103,12368257,12368048],"length":1,"stats":{"Line":0}},{"line":258,"address":[12367926],"length":1,"stats":{"Line":0}},{"line":259,"address":[12368005,12367940,12368018],"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::{DataBase, UserId},\n    error::PoRError,\n    global::{GlobalConfig, GlobalMst},\n    merkle_sum_prover::utils::hash_2_subhashes,\n    types::{D, F},\n};\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: \u0026DataBase) -\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: \u0026DataBase,\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)\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: \u0026DataBase,\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))\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":34,"address":[10359408,10359614],"length":1,"stats":{"Line":1}},{"line":35,"address":[12368452],"length":1,"stats":{"Line":1}},{"line":36,"address":[12368476],"length":1,"stats":{"Line":1}},{"line":44,"address":[12368656,12369468],"length":1,"stats":{"Line":1}},{"line":46,"address":[12368710],"length":1,"stats":{"Line":1}},{"line":48,"address":[12368839,12368762],"length":1,"stats":{"Line":1}},{"line":49,"address":[12368803],"length":1,"stats":{"Line":1}},{"line":52,"address":[12368883,12368868,12368822],"length":1,"stats":{"Line":2}},{"line":54,"address":[10360421,10359943,10359872],"length":1,"stats":{"Line":3}},{"line":55,"address":[12369094,12369207],"length":1,"stats":{"Line":2}},{"line":56,"address":[12369274,12369301,12369217],"length":1,"stats":{"Line":0}},{"line":57,"address":[12369322,12369282],"length":1,"stats":{"Line":0}},{"line":59,"address":[12369371,12369344,12369245],"length":1,"stats":{"Line":2}},{"line":60,"address":[12369392,12369352],"length":1,"stats":{"Line":2}},{"line":63,"address":[10360303,10360383,10360426],"length":1,"stats":{"Line":2}},{"line":64,"address":[12369434],"length":1,"stats":{"Line":1}},{"line":67,"address":[12369065,12369504,12369124,12369524],"length":1,"stats":{"Line":4}},{"line":71,"address":[12372512,12372481,12369552],"length":1,"stats":{"Line":1}},{"line":76,"address":[12369618],"length":1,"stats":{"Line":1}},{"line":78,"address":[12369681],"length":1,"stats":{"Line":1}},{"line":79,"address":[10360837,10360677,10360809],"length":1,"stats":{"Line":2}},{"line":80,"address":[12369847,12369952,12369909],"length":1,"stats":{"Line":2}},{"line":81,"address":[12369933,12369997],"length":1,"stats":{"Line":2}},{"line":84,"address":[12370005],"length":1,"stats":{"Line":1}},{"line":85,"address":[12370052],"length":1,"stats":{"Line":1}},{"line":87,"address":[12370169,12370106],"length":1,"stats":{"Line":1}},{"line":88,"address":[12370206,12370149,12370250],"length":1,"stats":{"Line":2}},{"line":89,"address":[12370327,12370287,12370230],"length":1,"stats":{"Line":2}},{"line":91,"address":[12370427,12370308,12370364],"length":1,"stats":{"Line":3}},{"line":92,"address":[12370403],"length":1,"stats":{"Line":1}},{"line":95,"address":[12372067,12370564,12370760],"length":1,"stats":{"Line":3}},{"line":96,"address":[12370784],"length":1,"stats":{"Line":1}},{"line":97,"address":[12370803],"length":1,"stats":{"Line":1}},{"line":98,"address":[12370879],"length":1,"stats":{"Line":1}},{"line":99,"address":[12371311,12370901,12371039],"length":1,"stats":{"Line":3}},{"line":100,"address":[12371335],"length":1,"stats":{"Line":1}},{"line":101,"address":[12371550,12371380],"length":1,"stats":{"Line":1}},{"line":103,"address":[12371531,12371571],"length":1,"stats":{"Line":2}},{"line":106,"address":[12371353],"length":1,"stats":{"Line":1}},{"line":107,"address":[12371742,12371584],"length":1,"stats":{"Line":1}},{"line":109,"address":[12371763,12371723],"length":1,"stats":{"Line":2}},{"line":113,"address":[12370944,12371784],"length":1,"stats":{"Line":2}},{"line":114,"address":[12371891],"length":1,"stats":{"Line":1}},{"line":118,"address":[10363083,10363184],"length":1,"stats":{"Line":1}},{"line":120,"address":[10363218],"length":1,"stats":{"Line":1}},{"line":123,"address":[10363056],"length":1,"stats":{"Line":1}},{"line":127,"address":[10363250,10363351],"length":1,"stats":{"Line":1}},{"line":129,"address":[12372435],"length":1,"stats":{"Line":1}},{"line":134,"address":[12371137],"length":1,"stats":{"Line":1}},{"line":136,"address":[12371918,12372007],"length":1,"stats":{"Line":1}},{"line":137,"address":[10362996,10363030,10362935],"length":1,"stats":{"Line":2}},{"line":140,"address":[12370717],"length":1,"stats":{"Line":1}},{"line":152,"address":[12372941,12372528],"length":1,"stats":{"Line":0}},{"line":153,"address":[12372579],"length":1,"stats":{"Line":0}},{"line":156,"address":[12372999,12373086,12372976],"length":1,"stats":{"Line":0}},{"line":158,"address":[12372664,12372733],"length":1,"stats":{"Line":0}},{"line":161,"address":[10364055,10364141,10364032],"length":1,"stats":{"Line":0}},{"line":167,"address":[12373232,12373761],"length":1,"stats":{"Line":1}},{"line":168,"address":[12373254],"length":1,"stats":{"Line":1}},{"line":169,"address":[12373287],"length":1,"stats":{"Line":1}},{"line":170,"address":[10364300],"length":1,"stats":{"Line":1}},{"line":172,"address":[12373821,12373808,12373436],"length":1,"stats":{"Line":3}},{"line":174,"address":[12373668,12373580],"length":1,"stats":{"Line":2}},{"line":189,"address":[10364736,10366155,10367746],"length":1,"stats":{"Line":0}},{"line":194,"address":[10364807],"length":1,"stats":{"Line":0}},{"line":195,"address":[12374009,12374107],"length":1,"stats":{"Line":0}},{"line":196,"address":[10367701,10365343],"length":1,"stats":{"Line":0}},{"line":199,"address":[10364989],"length":1,"stats":{"Line":0}},{"line":201,"address":[12374632],"length":1,"stats":{"Line":0}},{"line":202,"address":[12374696],"length":1,"stats":{"Line":0}},{"line":203,"address":[10367040,10367252,10366976,10366750,10366168,10366862,10366563],"length":1,"stats":{"Line":0}},{"line":204,"address":[10366934,10367571],"length":1,"stats":{"Line":0}},{"line":207,"address":[10365826,10365589],"length":1,"stats":{"Line":0}},{"line":212,"address":[12375134,12374989],"length":1,"stats":{"Line":0}},{"line":215,"address":[10366021],"length":1,"stats":{"Line":0}},{"line":218,"address":[10367776],"length":1,"stats":{"Line":1}},{"line":219,"address":[12376995],"length":1,"stats":{"Line":1}},{"line":221,"address":[12377011],"length":1,"stats":{"Line":1}},{"line":223,"address":[12377020,12377328],"length":1,"stats":{"Line":2}},{"line":224,"address":[12377366],"length":1,"stats":{"Line":1}},{"line":225,"address":[12377401],"length":1,"stats":{"Line":1}},{"line":226,"address":[12377416],"length":1,"stats":{"Line":1}},{"line":228,"address":[12377443],"length":1,"stats":{"Line":0}},{"line":229,"address":[12377458],"length":1,"stats":{"Line":0}},{"line":233,"address":[10367938],"length":1,"stats":{"Line":1}},{"line":236,"address":[12377488,12377533],"length":1,"stats":{"Line":2}},{"line":238,"address":[12377227,12377283],"length":1,"stats":{"Line":1}},{"line":239,"address":[12377290],"length":1,"stats":{"Line":1}},{"line":241,"address":[10368055],"length":1,"stats":{"Line":0}},{"line":247,"address":[12377632,12378215],"length":1,"stats":{"Line":0}},{"line":253,"address":[12377709],"length":1,"stats":{"Line":0}},{"line":256,"address":[12378240,12378263,12378350],"length":1,"stats":{"Line":0}},{"line":259,"address":[12377860,12377784],"length":1,"stats":{"Line":0}},{"line":262,"address":[12378368,12378403],"length":1,"stats":{"Line":0}},{"line":266,"address":[12377955],"length":1,"stats":{"Line":0}}],"covered":67,"coverable":95},{"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 accounts = fm.read_json_into_accounts_vec(path);\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 accounts = fm.read_json_into_accounts_vec(path);\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":[10369554,10369184],"length":1,"stats":{"Line":1}},{"line":29,"address":[11713509,11713488,11713123],"length":1,"stats":{"Line":3}},{"line":30,"address":[11713142],"length":1,"stats":{"Line":1}},{"line":31,"address":[11713262,11713195],"length":1,"stats":{"Line":2}},{"line":36,"address":[11713536,11714235],"length":1,"stats":{"Line":1}},{"line":37,"address":[11713582],"length":1,"stats":{"Line":1}},{"line":38,"address":[11713734],"length":1,"stats":{"Line":1}},{"line":40,"address":[11713901],"length":1,"stats":{"Line":1}},{"line":41,"address":[11713995],"length":1,"stats":{"Line":1}},{"line":42,"address":[11714066],"length":1,"stats":{"Line":1}},{"line":56,"address":[10370288],"length":1,"stats":{"Line":1}},{"line":60,"address":[11714816,11714323,11714837],"length":1,"stats":{"Line":3}},{"line":62,"address":[11714949,11714405,11714928],"length":1,"stats":{"Line":3}},{"line":64,"address":[11714498],"length":1,"stats":{"Line":1}},{"line":67,"address":[11714614],"length":1,"stats":{"Line":1}},{"line":69,"address":[11714681],"length":1,"stats":{"Line":1}},{"line":73,"address":[11715813,11715842,11715040],"length":1,"stats":{"Line":1}},{"line":75,"address":[11715851,11715083],"length":1,"stats":{"Line":1}},{"line":76,"address":[11715739],"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    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 accounts = fm.read_json_into_accounts_vec(path);\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":[9323087,9322416,9323119],"length":1,"stats":{"Line":1}},{"line":40,"address":[],"length":0,"stats":{"Line":1}},{"line":41,"address":[9322601],"length":1,"stats":{"Line":1}},{"line":42,"address":[9322624],"length":1,"stats":{"Line":1}},{"line":43,"address":[8878878],"length":1,"stats":{"Line":1}},{"line":44,"address":[],"length":0,"stats":{"Line":3}},{"line":45,"address":[],"length":0,"stats":{"Line":1}},{"line":46,"address":[9323288],"length":1,"stats":{"Line":1}},{"line":49,"address":[],"length":0,"stats":{"Line":1}},{"line":50,"address":[10908210],"length":1,"stats":{"Line":1}},{"line":54,"address":[10908285],"length":1,"stats":{"Line":1}},{"line":55,"address":[8879980],"length":1,"stats":{"Line":1}},{"line":56,"address":[9323793],"length":1,"stats":{"Line":1}},{"line":57,"address":[],"length":0,"stats":{"Line":1}},{"line":59,"address":[],"length":0,"stats":{"Line":1}},{"line":61,"address":[8879066],"length":1,"stats":{"Line":1}},{"line":66,"address":[10908720],"length":1,"stats":{"Line":1}},{"line":70,"address":[10908764],"length":1,"stats":{"Line":1}},{"line":72,"address":[9324095],"length":1,"stats":{"Line":1}},{"line":73,"address":[10908823],"length":1,"stats":{"Line":1}},{"line":78,"address":[10908976],"length":1,"stats":{"Line":1}},{"line":84,"address":[10908992],"length":1,"stats":{"Line":1}},{"line":85,"address":[10909027],"length":1,"stats":{"Line":1}},{"line":86,"address":[10909074],"length":1,"stats":{"Line":1}},{"line":87,"address":[10909122],"length":1,"stats":{"Line":1}},{"line":92,"address":[10106672,10107289],"length":1,"stats":{"Line":0}},{"line":94,"address":[10106714,10107311,10107254],"length":1,"stats":{"Line":0}},{"line":100,"address":[10909152,10909644],"length":1,"stats":{"Line":0}},{"line":101,"address":[9324491],"length":1,"stats":{"Line":0}},{"line":102,"address":[9324506],"length":1,"stats":{"Line":0}},{"line":103,"address":[10909315],"length":1,"stats":{"Line":0}},{"line":104,"address":[10909425],"length":1,"stats":{"Line":0}},{"line":119,"address":[10909680],"length":1,"stats":{"Line":1}},{"line":120,"address":[9324968],"length":1,"stats":{"Line":1}},{"line":124,"address":[10909760],"length":1,"stats":{"Line":1}},{"line":125,"address":[10909779],"length":1,"stats":{"Line":1}},{"line":126,"address":[9325077],"length":1,"stats":{"Line":1}},{"line":131,"address":[10910893,10909824],"length":1,"stats":{"Line":1}},{"line":135,"address":[9325140],"length":1,"stats":{"Line":1}},{"line":137,"address":[10909898,10910073],"length":1,"stats":{"Line":2}},{"line":138,"address":[9325458,9325357],"length":1,"stats":{"Line":1}},{"line":139,"address":[10910602,10910216,10910177],"length":1,"stats":{"Line":2}},{"line":140,"address":[10910314,10910411],"length":1,"stats":{"Line":2}},{"line":141,"address":[9325680,9325767],"length":1,"stats":{"Line":2}},{"line":142,"address":[10910828],"length":1,"stats":{"Line":1}},{"line":144,"address":[9325911,9325775],"length":1,"stats":{"Line":2}},{"line":150,"address":[10910928,10911318],"length":1,"stats":{"Line":1}},{"line":154,"address":[10911000],"length":1,"stats":{"Line":1}},{"line":156,"address":[9326560,9326581],"length":1,"stats":{"Line":2}},{"line":159,"address":[10911086],"length":1,"stats":{"Line":1}},{"line":161,"address":[9326359],"length":1,"stats":{"Line":1}},{"line":163,"address":[10911206],"length":1,"stats":{"Line":1}},{"line":165,"address":[9326481],"length":1,"stats":{"Line":1}},{"line":169,"address":[10912486,10912539,10911408],"length":1,"stats":{"Line":1}},{"line":175,"address":[10911649,10911801,10911451],"length":1,"stats":{"Line":2}},{"line":177,"address":[10911683,10911826],"length":1,"stats":{"Line":2}},{"line":178,"address":[9327038],"length":1,"stats":{"Line":1}},{"line":179,"address":[10911899,10913034,10913002,10912576],"length":1,"stats":{"Line":2}},{"line":180,"address":[9328160,9327739,9328181],"length":1,"stats":{"Line":3}},{"line":181,"address":[10912634],"length":1,"stats":{"Line":1}},{"line":182,"address":[10912684],"length":1,"stats":{"Line":1}},{"line":183,"address":[10912752],"length":1,"stats":{"Line":1}},{"line":184,"address":[10912963],"length":1,"stats":{"Line":1}},{"line":186,"address":[10912016],"length":1,"stats":{"Line":1}},{"line":188,"address":[10913139,10913104],"length":1,"stats":{"Line":2}},{"line":191,"address":[10912140,10912223],"length":1,"stats":{"Line":2}},{"line":192,"address":[10912269],"length":1,"stats":{"Line":1}},{"line":193,"address":[10912341],"length":1,"stats":{"Line":1}}],"covered":61,"coverable":68},{"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 accounts = fm.read_json_into_accounts_vec(path);\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 accounts = fm.read_json_into_accounts_vec(path);\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":[10371840],"length":1,"stats":{"Line":1}},{"line":34,"address":[12378479,12378555],"length":1,"stats":{"Line":2}},{"line":36,"address":[12378570,12378646,12378730],"length":1,"stats":{"Line":3}},{"line":41,"address":[12379412,12379586,12378752],"length":1,"stats":{"Line":1}},{"line":45,"address":[12378804],"length":1,"stats":{"Line":1}},{"line":47,"address":[12378913,12379067,12378845],"length":1,"stats":{"Line":3}},{"line":49,"address":[10372780,10372883,10372468],"length":1,"stats":{"Line":3}},{"line":52,"address":[12379554],"length":1,"stats":{"Line":1}},{"line":55,"address":[12379122,12379030],"length":1,"stats":{"Line":2}},{"line":57,"address":[12379667,12379632],"length":1,"stats":{"Line":2}},{"line":61,"address":[10372576,10372656],"length":1,"stats":{"Line":2}},{"line":64,"address":[12379319],"length":1,"stats":{"Line":1}},{"line":68,"address":[10378710,10377273,10373024],"length":1,"stats":{"Line":1}},{"line":69,"address":[12379750],"length":1,"stats":{"Line":1}},{"line":70,"address":[12379912],"length":1,"stats":{"Line":1}},{"line":73,"address":[12379980],"length":1,"stats":{"Line":1}},{"line":74,"address":[12380053,12380153],"length":1,"stats":{"Line":2}},{"line":76,"address":[12380172],"length":1,"stats":{"Line":1}},{"line":78,"address":[12380195],"length":1,"stats":{"Line":1}},{"line":79,"address":[12380230],"length":1,"stats":{"Line":1}},{"line":81,"address":[12380303],"length":1,"stats":{"Line":1}},{"line":83,"address":[12381565,12381162,12380963,12381292,12380547,12381489],"length":1,"stats":{"Line":5}},{"line":85,"address":[12381365],"length":1,"stats":{"Line":1}},{"line":87,"address":[12381878],"length":1,"stats":{"Line":1}},{"line":88,"address":[12381913],"length":1,"stats":{"Line":1}},{"line":89,"address":[12381967,12382196],"length":1,"stats":{"Line":2}},{"line":90,"address":[12382247],"length":1,"stats":{"Line":1}},{"line":91,"address":[12382284],"length":1,"stats":{"Line":1}},{"line":92,"address":[12382344],"length":1,"stats":{"Line":0}},{"line":93,"address":[12383025,12383354,12383544,12383224,12383480,12383735,12382609],"length":1,"stats":{"Line":0}},{"line":94,"address":[12383419,12383985],"length":1,"stats":{"Line":0}},{"line":98,"address":[12381989],"length":1,"stats":{"Line":0}},{"line":99,"address":[12384789,12384906,12384970,12385161,12384095,12384490,12384677],"length":1,"stats":{"Line":0}},{"line":100,"address":[12384845,12385411],"length":1,"stats":{"Line":0}},{"line":106,"address":[12385504,12388189,12389888],"length":1,"stats":{"Line":1}},{"line":111,"address":[12385583],"length":1,"stats":{"Line":1}},{"line":112,"address":[12385632,12385700,12385930],"length":1,"stats":{"Line":3}},{"line":114,"address":[12385954,12389716],"length":1,"stats":{"Line":2}},{"line":116,"address":[12389724,12389864],"length":1,"stats":{"Line":2}},{"line":119,"address":[12385841],"length":1,"stats":{"Line":1}},{"line":121,"address":[12385895,12386000],"length":1,"stats":{"Line":2}},{"line":122,"address":[12386008],"length":1,"stats":{"Line":1}},{"line":124,"address":[12386083],"length":1,"stats":{"Line":1}},{"line":125,"address":[10379346],"length":1,"stats":{"Line":1}},{"line":126,"address":[10379625,10379408],"length":1,"stats":{"Line":2}},{"line":127,"address":[10379672],"length":1,"stats":{"Line":1}},{"line":128,"address":[12386489],"length":1,"stats":{"Line":1}},{"line":129,"address":[10379767],"length":1,"stats":{"Line":0}},{"line":130,"address":[12387376,12387908,12387177,12386761,12387506,12387638,12387714],"length":1,"stats":{"Line":0}},{"line":131,"address":[12387571,12388161],"length":1,"stats":{"Line":0}},{"line":135,"address":[12386194],"length":1,"stats":{"Line":0}},{"line":136,"address":[12389091,12389155,12389346,12388675,12388862,12388271,12388974],"length":1,"stats":{"Line":0}},{"line":137,"address":[10382242,10382804],"length":1,"stats":{"Line":0}},{"line":143,"address":[12395868,12389920,12394397],"length":1,"stats":{"Line":0}},{"line":146,"address":[10383174],"length":1,"stats":{"Line":0}},{"line":147,"address":[12390144],"length":1,"stats":{"Line":0}},{"line":150,"address":[10383404],"length":1,"stats":{"Line":0}},{"line":151,"address":[12390285,12390385],"length":1,"stats":{"Line":0}},{"line":153,"address":[10383592],"length":1,"stats":{"Line":0}},{"line":155,"address":[12390427],"length":1,"stats":{"Line":0}},{"line":157,"address":[12390508],"length":1,"stats":{"Line":0}},{"line":159,"address":[12391494,12391619,12391695,12390749,12391364,12391165],"length":1,"stats":{"Line":0}},{"line":161,"address":[12391559,12392024],"length":1,"stats":{"Line":0}},{"line":162,"address":[12392032],"length":1,"stats":{"Line":0}},{"line":164,"address":[12392115],"length":1,"stats":{"Line":0}},{"line":165,"address":[12392150],"length":1,"stats":{"Line":0}},{"line":166,"address":[10385368,10385601],"length":1,"stats":{"Line":0}},{"line":167,"address":[12392484],"length":1,"stats":{"Line":0}},{"line":168,"address":[10385665],"length":1,"stats":{"Line":0}},{"line":169,"address":[12392747],"length":1,"stats":{"Line":0}},{"line":170,"address":[12392993,12393864,12393928,12393409,12393608,12393738,12394119],"length":1,"stats":{"Line":0}},{"line":171,"address":[12393803,12394369],"length":1,"stats":{"Line":0}},{"line":175,"address":[12392226],"length":1,"stats":{"Line":0}},{"line":176,"address":[12394874,12395061,12394479,12395290,12395354,12395173,12395545],"length":1,"stats":{"Line":0}},{"line":177,"address":[12395795,12395229],"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":[11928741,11928712,11928144],"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 accounts = fm.read_json_into_accounts_vec(path);\n\n        let account = accounts.get(0).unwrap();\n        let node = MerkleSumNode::new_from_account(account);\n        assert_eq!(node.sum_equity, F::from_canonical_u64(133876586));\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 accounts = fm.read_json_into_accounts_vec(path);\n\n        let account1 = accounts.get(0).unwrap();\n        let node1 = MerkleSumNode::new_from_account(account1);\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(138512215) + F::from_canonical_u64(133876586)\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 accounts = fm.read_json_into_accounts_vec(path);\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":[12395904],"length":1,"stats":{"Line":1}},{"line":21,"address":[12396128,12395936,12396160],"length":1,"stats":{"Line":3}},{"line":23,"address":[12396176,12396208,12395989],"length":1,"stats":{"Line":3}},{"line":25,"address":[12396042],"length":1,"stats":{"Line":1}},{"line":30,"address":[10814880],"length":1,"stats":{"Line":1}},{"line":31,"address":[12396257],"length":1,"stats":{"Line":1}},{"line":32,"address":[12396277],"length":1,"stats":{"Line":1}},{"line":33,"address":[12396305],"length":1,"stats":{"Line":1}},{"line":46,"address":[12397795,12396400],"length":1,"stats":{"Line":1}},{"line":47,"address":[12396466],"length":1,"stats":{"Line":1}},{"line":48,"address":[12396474],"length":1,"stats":{"Line":1}},{"line":49,"address":[12396496],"length":1,"stats":{"Line":1}},{"line":51,"address":[12396518,12396642,12396928],"length":1,"stats":{"Line":3}},{"line":52,"address":[12396949],"length":1,"stats":{"Line":1}},{"line":53,"address":[10815657,10816359],"length":1,"stats":{"Line":2}},{"line":54,"address":[12397744],"length":1,"stats":{"Line":1}},{"line":56,"address":[12397030,12397115,12396967],"length":1,"stats":{"Line":2}},{"line":57,"address":[12397097,12397141,12397266],"length":1,"stats":{"Line":2}},{"line":58,"address":[10815892,10815945,10816037],"length":1,"stats":{"Line":3}},{"line":59,"address":[12397551,12397406],"length":1,"stats":{"Line":2}},{"line":60,"address":[12397559],"length":1,"stats":{"Line":1}},{"line":61,"address":[12397578],"length":1,"stats":{"Line":1}},{"line":68,"address":[12397824],"length":1,"stats":{"Line":1}},{"line":69,"address":[12397856,12397928],"length":1,"stats":{"Line":2}},{"line":72,"address":[12397952],"length":1,"stats":{"Line":0}},{"line":73,"address":[12397970],"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::Value;\nuse std::{\n    collections::BTreeMap,\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 num_of_tokens: usize,\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) -\u003e Vec\u003cAccount\u003e;\n    fn read_json_file_into_map(\u0026self, path: \u0026str) -\u003e Vec\u003cBTreeMap\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    fn read_json_into_accounts_vec(\u0026self, path: \u0026str) -\u003e Vec\u003cAccount\u003e {\n        let parsed_data = self.read_json_file_into_map(path);\n        parse_exchange_state(\u0026parsed_data)\n    }\n\n    /// Reads a json file into a json string.\n    fn read_json_file_into_map(\u0026self, path: \u0026str) -\u003e Vec\u003cBTreeMap\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());\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 =\n                        fm.read_json_into_accounts_vec(parser.docs[doc_len - 1].to_str().unwrap());\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\n        let mut result = vec![Account::get_empty_account(self.cfg.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 =\n                        fm.read_json_into_accounts_vec(self.docs[self.file_idx].to_str().unwrap());\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(parsed_data: \u0026Vec\u003cBTreeMap\u003cString, Value\u003e\u003e) -\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));\n    }\n    accounts_data\n}\n\n/// Parses the exchanges state at some snapshot and returns.\npub fn parse_account_state(parsed_data: \u0026BTreeMap\u003cString, Value\u003e) -\u003e Account {\n    let mut account_id = \"\";\n    let mut inner_vec: Vec\u003cF\u003e = Vec::new();\n    for (key, value) in parsed_data.iter() {\n        if key != \"id\" {\n            if let Some(number_str) = value.as_str() {\n                match number_str.parse::\u003cu64\u003e() {\n                    Ok(number) =\u003e inner_vec.push(F::from_canonical_u64(number)),\n                    Err(e) =\u003e {\n                        error!(\"Error in parsing token value number: {:?}\", e);\n                        panic!(\"Error in parsing token value number: {:?}\", e);\n                    }\n                }\n            } else {\n                error!(\"Error in parsing string from json: {:?}\", value);\n                panic!(\"Error in parsing string from json: {:?}\", value);\n            }\n        } else {\n            account_id = value.as_str().unwrap();\n        }\n    }\n    // todo:: currently, we fill debt all to zero\n    let asset_len = inner_vec.len();\n    Account { id: account_id.into(), equity: inner_vec, debt: vec![F::ZERO; asset_len] }\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::Value;\n    use std::{\n        collections::BTreeMap,\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 = \"320b5ea99e653bc2b593db4130d10a4efd3a0b4cc2e1a6672b678d71dfbd33ad\";\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 = \"47db1d296a7c146eab653591583a9a4873c626d8de47ae11393edd153e40f1ed\";\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 accounts = parse_exchange_state(\u0026maps);\n\n        let id_0 = \"320b5ea99e653bc2b593db4130d10a4efd3a0b4cc2e1a6672b678d71dfbd33ad\";\n        let account_0 = accounts.get(0).unwrap();\n        assert_eq!(id_0, account_0.id);\n\n        let id_1 = \"47db1d296a7c146eab653591583a9a4873c626d8de47ae11393edd153e40f1ed\";\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 accounts = fm.read_json_into_accounts_vec(\u0026path);\n\n        let id_0 = \"320b5ea99e653bc2b593db4130d10a4efd3a0b4cc2e1a6672b678d71dfbd33ad\";\n        let account_0 = accounts.get(0).unwrap();\n        assert_eq!(id_0, account_0.id);\n\n        let id_1 = \"47db1d296a7c146eab653591583a9a4873c626d8de47ae11393edd153e40f1ed\";\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) -\u003e Vec\u003cAccount\u003e;\n          fn read_json_file_into_map(\u0026self, path: \u0026str) -\u003e Vec\u003cBTreeMap\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, num_of_tokens: 20 },\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":42,"address":[12398000,12399812,12399847],"length":1,"stats":{"Line":0}},{"line":43,"address":[10389095],"length":1,"stats":{"Line":0}},{"line":44,"address":[12398112,12398181],"length":1,"stats":{"Line":0}},{"line":45,"address":[12398238,12398510,12398543,12399845],"length":1,"stats":{"Line":0}},{"line":46,"address":[12398752,12398591,12398912,12399821],"length":1,"stats":{"Line":0}},{"line":47,"address":[10389862,10389974],"length":1,"stats":{"Line":0}},{"line":48,"address":[12399009,12399074],"length":1,"stats":{"Line":0}},{"line":49,"address":[12399514,12399132],"length":1,"stats":{"Line":0}},{"line":50,"address":[12399626],"length":1,"stats":{"Line":0}},{"line":51,"address":[12399669],"length":1,"stats":{"Line":0}},{"line":54,"address":[12399107,12399162],"length":1,"stats":{"Line":0}},{"line":55,"address":[12399214],"length":1,"stats":{"Line":0}},{"line":59,"address":[12398187,12398634],"length":1,"stats":{"Line":0}},{"line":60,"address":[12398653],"length":1,"stats":{"Line":0}},{"line":64,"address":[12399872,12399988],"length":1,"stats":{"Line":1}},{"line":65,"address":[12399900],"length":1,"stats":{"Line":1}},{"line":66,"address":[12399929],"length":1,"stats":{"Line":1}},{"line":70,"address":[10390944,10392683],"length":1,"stats":{"Line":1}},{"line":71,"address":[12400086],"length":1,"stats":{"Line":1}},{"line":72,"address":[12400100],"length":1,"stats":{"Line":1}},{"line":73,"address":[12400113],"length":1,"stats":{"Line":1}},{"line":74,"address":[10391055],"length":1,"stats":{"Line":1}},{"line":76,"address":[12400141],"length":1,"stats":{"Line":1}},{"line":78,"address":[12400217],"length":1,"stats":{"Line":0}},{"line":79,"address":[12400814,12400419,12401294,12401484,12401113,12401230,12401001],"length":1,"stats":{"Line":0}},{"line":80,"address":[12401733,12401169],"length":1,"stats":{"Line":0}},{"line":101,"address":[8702814,8697840,8703159],"length":1,"stats":{"Line":1}},{"line":102,"address":[10392778,10392897],"length":1,"stats":{"Line":2}},{"line":103,"address":[8698037],"length":1,"stats":{"Line":1}},{"line":104,"address":[8698235],"length":1,"stats":{"Line":0}},{"line":106,"address":[8698313,8698200],"length":1,"stats":{"Line":2}},{"line":108,"address":[8698329],"length":1,"stats":{"Line":1}},{"line":109,"address":[8698414],"length":1,"stats":{"Line":1}},{"line":113,"address":[8698490],"length":1,"stats":{"Line":1}},{"line":117,"address":[10393402],"length":1,"stats":{"Line":1}},{"line":120,"address":[8698840],"length":1,"stats":{"Line":1}},{"line":121,"address":[10393727],"length":1,"stats":{"Line":1}},{"line":122,"address":[8699280,8699895,8699696,8700160,8700433,8700028,8700239],"length":1,"stats":{"Line":6}},{"line":123,"address":[8700101,8700694],"length":1,"stats":{"Line":2}},{"line":124,"address":[8700702],"length":1,"stats":{"Line":1}},{"line":125,"address":[8700892],"length":1,"stats":{"Line":1}},{"line":126,"address":[8700900],"length":1,"stats":{"Line":1}},{"line":127,"address":[8702845],"length":1,"stats":{"Line":0}},{"line":129,"address":[8700906,8701270,8701063],"length":1,"stats":{"Line":3}},{"line":131,"address":[8701297,8701381],"length":1,"stats":{"Line":2}},{"line":133,"address":[10396212],"length":1,"stats":{"Line":1}},{"line":134,"address":[8701436],"length":1,"stats":{"Line":1}},{"line":136,"address":[8701403,8701636],"length":1,"stats":{"Line":2}},{"line":137,"address":[8701644],"length":1,"stats":{"Line":1}},{"line":138,"address":[8701834],"length":1,"stats":{"Line":1}},{"line":140,"address":[8701846,8702489],"length":1,"stats":{"Line":2}},{"line":141,"address":[10396714,10396983],"length":1,"stats":{"Line":2}},{"line":143,"address":[8702183,8702261],"length":1,"stats":{"Line":2}},{"line":144,"address":[8702299],"length":1,"stats":{"Line":1}},{"line":147,"address":[8701860,8702507,8702650],"length":1,"stats":{"Line":2}},{"line":150,"address":[10397427,10397491],"length":1,"stats":{"Line":2}},{"line":151,"address":[10397499],"length":1,"stats":{"Line":1}},{"line":152,"address":[10397507],"length":1,"stats":{"Line":1}},{"line":154,"address":[10393941,10397751],"length":1,"stats":{"Line":0}},{"line":157,"address":[10397531],"length":1,"stats":{"Line":1}},{"line":160,"address":[10397968],"length":1,"stats":{"Line":1}},{"line":161,"address":[10398107,10398751,10399293,10398909,10399386,10398711,10398438,10398586,10399005,10398655,10399476,10399197,10399101],"length":1,"stats":{"Line":13}},{"line":167,"address":[12403760],"length":1,"stats":{"Line":1}},{"line":168,"address":[10399941],"length":1,"stats":{"Line":1}},{"line":172,"address":[8723168,8729276],"length":1,"stats":{"Line":1}},{"line":178,"address":[8723358,8724066,8723876,8723710,8723957,8724112,8724407],"length":1,"stats":{"Line":7}},{"line":179,"address":[10400781],"length":1,"stats":{"Line":1}},{"line":182,"address":[10400794,10401509,10401580],"length":1,"stats":{"Line":2}},{"line":183,"address":[8724781,8724917,8724851],"length":1,"stats":{"Line":2}},{"line":184,"address":[8724905,8724933],"length":1,"stats":{"Line":1}},{"line":186,"address":[10401955,10401734],"length":1,"stats":{"Line":2}},{"line":189,"address":[8725097],"length":1,"stats":{"Line":1}},{"line":190,"address":[8725226,8729250,8725145,8725319],"length":1,"stats":{"Line":3}},{"line":192,"address":[8725447,8729048],"length":1,"stats":{"Line":0}},{"line":193,"address":[10405923,10405973],"length":1,"stats":{"Line":0}},{"line":195,"address":[8725389],"length":1,"stats":{"Line":1}},{"line":197,"address":[10402248,10402164],"length":1,"stats":{"Line":2}},{"line":198,"address":[8725532,8725655],"length":1,"stats":{"Line":1}},{"line":199,"address":[10402364,10402467],"length":1,"stats":{"Line":2}},{"line":201,"address":[8725819,8726109,8725494],"length":1,"stats":{"Line":2}},{"line":202,"address":[10403629,10402884,10404065,10403828,10403300,10403752,10403499,10404267],"length":1,"stats":{"Line":7}},{"line":209,"address":[10403694,10405732],"length":1,"stats":{"Line":2}},{"line":210,"address":[10404619],"length":1,"stats":{"Line":1}},{"line":212,"address":[10404723],"length":1,"stats":{"Line":1}},{"line":214,"address":[8728246,8728115,8728289],"length":1,"stats":{"Line":2}},{"line":215,"address":[8728654,8728552],"length":1,"stats":{"Line":2}},{"line":216,"address":[10405259,10405044,10404979,10405329],"length":1,"stats":{"Line":3}},{"line":217,"address":[10405596,10405408],"length":1,"stats":{"Line":2}},{"line":218,"address":[10405544],"length":1,"stats":{"Line":1}},{"line":219,"address":[10405618,10405698],"length":1,"stats":{"Line":1}},{"line":220,"address":[8728947],"length":1,"stats":{"Line":1}},{"line":222,"address":[8728080,8728161,8728209],"length":1,"stats":{"Line":0}},{"line":225,"address":[8729006,8728954,8729019],"length":1,"stats":{"Line":2}},{"line":228,"address":[10404568],"length":1,"stats":{"Line":1}},{"line":233,"address":[10406016,10406277],"length":1,"stats":{"Line":1}},{"line":234,"address":[12403806],"length":1,"stats":{"Line":1}},{"line":235,"address":[12404006,12403897,12403825],"length":1,"stats":{"Line":3}},{"line":236,"address":[12404019],"length":1,"stats":{"Line":1}},{"line":238,"address":[12403972],"length":1,"stats":{"Line":1}},{"line":242,"address":[12404816,12408686,12404096],"length":1,"stats":{"Line":1}},{"line":243,"address":[12404135],"length":1,"stats":{"Line":1}},{"line":244,"address":[12404167],"length":1,"stats":{"Line":1}},{"line":245,"address":[12404200,12404260,12404436],"length":1,"stats":{"Line":3}},{"line":246,"address":[12405086,12404468,12404854],"length":1,"stats":{"Line":3}},{"line":247,"address":[12404895,12405107],"length":1,"stats":{"Line":2}},{"line":248,"address":[12405356,12405184],"length":1,"stats":{"Line":2}},{"line":249,"address":[10407831,10407578],"length":1,"stats":{"Line":2}},{"line":250,"address":[12405458],"length":1,"stats":{"Line":0}},{"line":251,"address":[12406074,12406679,12406273,12406403,12406615,12406870,12405658],"length":1,"stats":{"Line":0}},{"line":252,"address":[12407120],"length":1,"stats":{"Line":0}},{"line":256,"address":[10410366,10410553,10410099,10409405,10409800,10409987,10410302],"length":1,"stats":{"Line":0}},{"line":257,"address":[12408607],"length":1,"stats":{"Line":0}},{"line":260,"address":[12405070,12404860],"length":1,"stats":{"Line":2}},{"line":264,"address":[12404409,12404512],"length":1,"stats":{"Line":2}},{"line":265,"address":[12404520,12404825],"length":1,"stats":{"Line":1}},{"line":273,"address":[12408720],"length":1,"stats":{"Line":0}},{"line":279,"address":[12408752],"length":1,"stats":{"Line":0}},{"line":280,"address":[12408757],"length":1,"stats":{"Line":0}}],"covered":87,"coverable":118},{"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":[8691417,8692878,8688880],"length":1,"stats":{"Line":0}},{"line":41,"address":[8688935],"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":[8689313],"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":[8690004,8690420,8690752,8690881,8690619,8690948,8691139],"length":1,"stats":{"Line":0}},{"line":56,"address":[],"length":0,"stats":{"Line":0}},{"line":60,"address":[8689424],"length":1,"stats":{"Line":0}},{"line":61,"address":[],"length":0,"stats":{"Line":0}},{"line":62,"address":[],"length":0,"stats":{"Line":0}},{"line":68,"address":[12409003,12408768],"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    /// 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":[9116288],"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":39,"address":[9116362,9116576],"length":1,"stats":{"Line":0}},{"line":40,"address":[],"length":0,"stats":{"Line":0}},{"line":41,"address":[],"length":0,"stats":{"Line":0}},{"line":45,"address":[],"length":0,"stats":{"Line":0}},{"line":46,"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":54,"address":[],"length":0,"stats":{"Line":0}},{"line":58,"address":[9115984,9116143],"length":1,"stats":{"Line":0}},{"line":66,"address":[],"length":0,"stats":{"Line":0}},{"line":68,"address":[],"length":0,"stats":{"Line":0}},{"line":69,"address":[],"length":0,"stats":{"Line":0}},{"line":76,"address":[9117568,9118439],"length":1,"stats":{"Line":0}},{"line":89,"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":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":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":108,"address":[],"length":0,"stats":{"Line":0}},{"line":119,"address":[9117136,9117517],"length":1,"stats":{"Line":0}},{"line":131,"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":137,"address":[],"length":0,"stats":{"Line":0}},{"line":138,"address":[],"length":0,"stats":{"Line":0}},{"line":139,"address":[],"length":0,"stats":{"Line":0}}],"covered":0,"coverable":40},{"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":[8808528],"length":1,"stats":{"Line":1}},{"line":6,"address":[12170248],"length":1,"stats":{"Line":1}},{"line":7,"address":[12170259],"length":1,"stats":{"Line":0}},{"line":9,"address":[12170322,12170299,12170271],"length":1,"stats":{"Line":2}},{"line":10,"address":[12170348,12170425,12170314],"length":1,"stats":{"Line":3}},{"line":11,"address":[12170343],"length":1,"stats":{"Line":1}},{"line":13,"address":[12170360,12170430],"length":1,"stats":{"Line":1}},{"line":19,"address":[12170448],"length":1,"stats":{"Line":1}},{"line":20,"address":[12170565,12170470],"length":1,"stats":{"Line":1}},{"line":21,"address":[12170585,12170544,12170724],"length":1,"stats":{"Line":2}},{"line":25,"address":[12171307,12170752],"length":1,"stats":{"Line":1}},{"line":26,"address":[12171344,12170782,12171357,12170858],"length":1,"stats":{"Line":4}},{"line":28,"address":[12170906,12170974],"length":1,"stats":{"Line":2}},{"line":30,"address":[12171427,12171595,12171408],"length":1,"stats":{"Line":3}},{"line":33,"address":[12171057,12171122],"length":1,"stats":{"Line":2}},{"line":34,"address":[12171260,12171186],"length":1,"stats":{"Line":0}},{"line":37,"address":[12171133],"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":[10333846,10334486,10333888,10333248],"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":[10334207,10333567],"length":1,"stats":{"Line":0}},{"line":26,"address":[12335212,12335852],"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":[12336597,12337241,12335968,12337269,12336640,12336569],"length":1,"stats":{"Line":2}},{"line":43,"address":[],"length":0,"stats":{"Line":4}},{"line":44,"address":[],"length":0,"stats":{"Line":8}},{"line":45,"address":[12337354,12337578,12337756,12337490],"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":[12332643,12334568,12330784,12332672],"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":[12331052,12332972],"length":1,"stats":{"Line":0}},{"line":59,"address":[12332390,12334056,12331697,12332002,12333222,12334123,12331884,12332200,12332133,12333804,12334314,12331302,12333617,12333922],"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":[789668,789042,789967,789225,790327,789855,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":[12591240,12589919,12587920],"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":[12588123],"length":1,"stats":{"Line":1}},{"line":25,"address":[4460603],"length":1,"stats":{"Line":1}},{"line":27,"address":[13905291],"length":1,"stats":{"Line":1}},{"line":28,"address":[4460747,4460690],"length":1,"stats":{"Line":2}},{"line":29,"address":[12588418],"length":1,"stats":{"Line":1}},{"line":30,"address":[13905809],"length":1,"stats":{"Line":1}},{"line":32,"address":[4461221],"length":1,"stats":{"Line":1}},{"line":33,"address":[4461362],"length":1,"stats":{"Line":1}},{"line":34,"address":[4461623,4461552,4461471,4461822],"length":1,"stats":{"Line":4}},{"line":36,"address":[4461559],"length":1,"stats":{"Line":1}},{"line":39,"address":[13908220,13906418,13906605],"length":1,"stats":{"Line":2}},{"line":40,"address":[4462935,4461881],"length":1,"stats":{"Line":1}},{"line":41,"address":[13907158],"length":1,"stats":{"Line":0}},{"line":43,"address":[4462502],"length":1,"stats":{"Line":0}},{"line":44,"address":[13907411],"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":[4461889,4462594,4463326,4462919],"length":1,"stats":{"Line":1}},{"line":50,"address":[4461977,4462173],"length":1,"stats":{"Line":1}},{"line":52,"address":[4461922,4462082],"length":1,"stats":{"Line":0}},{"line":55,"address":[4462089],"length":1,"stats":{"Line":1}}],"covered":19,"coverable":25},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-tracing","src","opentelemetry","exporter","stdout.rs"],"content":"//! # Stdout Span Exporter\n//!\n//! The stdout [`SpanExporter`] writes debug printed [`Span`]s to its configured\n//! [`Write`] instance. By default it will write to [`Stdout`].\n//!\n//! [`SpanExporter`]: super::SpanExporter\n//! [`Span`]: crate::trace::Span\n//! [`Write`]: Write\n//! [`Stdout`]: Stdout\n//!\n//! # Examples\n//!\n//! ```no_run\n//! use opentelemetry::trace::Tracer;\n//! use opentelemetry::sdk::export::trace::stdout;\n//! use opentelemetry::global::shutdown_tracer_provider;\n//!\n//! fn main() {\n//!     let tracer = stdout::new_pipeline()\n//!         .with_pretty_print(true)\n//!         .install_simple();\n//!\n//!     tracer.in_span(\"doing_work\", |cx| {\n//!         // Traced app logic here...\n//!     });\n//!\n//!     shutdown_tracer_provider(); // sending remaining spans\n//! }\n//! ```\n#![allow(clippy::needless_doctest_main)]\nuse async_trait::async_trait;\nuse opentelemetry::{\n    global, sdk,\n    sdk::export::{\n        trace::{ExportResult, SpanData, SpanExporter},\n        ExportError,\n    },\n    trace::TracerProvider,\n};\nuse std::{\n    fmt::Debug,\n    io::{stdout, Stdout, Write},\n};\n\n/// Pipeline builder\n#[derive(Debug)]\npub struct PipelineBuilder\u003cW: Write\u003e {\n    pretty_print: bool,\n    trace_config: Option\u003csdk::trace::Config\u003e,\n    writer: W,\n}\n\n/// Create a new stdout exporter pipeline builder.\npub fn new_pipeline() -\u003e PipelineBuilder\u003cStdout\u003e {\n    PipelineBuilder::default()\n}\n\nimpl Default for PipelineBuilder\u003cStdout\u003e {\n    /// Return the default pipeline builder.\n    fn default() -\u003e Self {\n        Self { pretty_print: false, trace_config: None, writer: stdout() }\n    }\n}\n\nimpl\u003cW: Write\u003e PipelineBuilder\u003cW\u003e {\n    /// Specify the pretty print setting.\n    pub fn with_pretty_print(mut self, pretty_print: bool) -\u003e Self {\n        self.pretty_print = pretty_print;\n        self\n    }\n\n    /// Assign the SDK trace configuration.\n    pub fn with_trace_config(mut self, config: sdk::trace::Config) -\u003e Self {\n        self.trace_config = Some(config);\n        self\n    }\n\n    /// Specify the writer to use.\n    pub fn with_writer\u003cT: Write\u003e(self, writer: T) -\u003e PipelineBuilder\u003cT\u003e {\n        PipelineBuilder { pretty_print: self.pretty_print, trace_config: self.trace_config, writer }\n    }\n}\n\nimpl\u003cW\u003e PipelineBuilder\u003cW\u003e\nwhere\n    W: Write + Debug + Send + 'static,\n{\n    /// Install the stdout exporter pipeline with the recommended defaults.\n    pub fn install_simple(mut self) -\u003e sdk::trace::Tracer {\n        let exporter = Exporter::new(self.writer, self.pretty_print);\n\n        let mut provider_builder =\n            sdk::trace::TracerProvider::builder().with_simple_exporter(exporter);\n        if let Some(config) = self.trace_config.take() {\n            provider_builder = provider_builder.with_config(config);\n        }\n        let provider = provider_builder.build();\n\n        let tracer =\n            provider.versioned_tracer(\"opentelemetry\", Some(env!(\"CARGO_PKG_VERSION\")), None);\n        let _ = global::set_tracer_provider(provider);\n\n        tracer\n    }\n}\n\n/// A [`SpanExporter`] that writes to [`Stdout`] or other configured [`Write`].\n///\n/// [`SpanExporter`]: super::SpanExporter\n/// [`Write`]: Write\n/// [`Stdout`]: Stdout\n#[derive(Debug)]\npub struct Exporter\u003cW: Write\u003e {\n    writer: W,\n    pretty_print: bool,\n}\n\nimpl\u003cW: Write\u003e Exporter\u003cW\u003e {\n    /// Create a new stdout `Exporter`.\n    pub fn new(writer: W, pretty_print: bool) -\u003e Self {\n        Self { writer, pretty_print }\n    }\n}\n\n#[async_trait]\nimpl\u003cW\u003e SpanExporter for Exporter\u003cW\u003e\nwhere\n    W: Write + Debug + Send + 'static,\n{\n    /// Export spans to stdout\n    async fn export(\u0026mut self, batch: Vec\u003cSpanData\u003e) -\u003e ExportResult {\n        for span in batch {\n            let json = if self.pretty_print {\n                serde_json::to_string_pretty(\u0026span).map_err::\u003cError, _\u003e(Into::into)?\n            } else {\n                serde_json::to_string(\u0026span).map_err::\u003cError, _\u003e(Into::into)?\n            };\n            self.writer.write_all(json.as_bytes()).map_err::\u003cError, _\u003e(Into::into)?;\n            self.writer.write_all(\"\\n\".as_bytes()).map_err::\u003cError, _\u003e(Into::into)?;\n        }\n\n        Ok(())\n    }\n}\n\n/// Stdout exporter's error\n#[derive(thiserror::Error, Debug)]\n#[error(transparent)]\nenum Error {\n    Json(#[from] serde_json::Error),\n    Io(#[from] std::io::Error),\n}\n\nimpl ExportError for Error {\n    fn exporter_name(\u0026self) -\u003e \u0026'static str {\n        \"stdout\"\n    }\n}\n","traces":[{"line":54,"address":[12785120],"length":1,"stats":{"Line":1}},{"line":55,"address":[14102264],"length":1,"stats":{"Line":1}},{"line":60,"address":[4298160,4298279],"length":1,"stats":{"Line":1}},{"line":61,"address":[14102301],"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":[14102451],"length":1,"stats":{"Line":1}},{"line":89,"address":[4299754,4298432,4299686],"length":1,"stats":{"Line":1}},{"line":90,"address":[4298454,4298575],"length":1,"stats":{"Line":2}},{"line":92,"address":[14102772,14102715],"length":1,"stats":{"Line":2}},{"line":93,"address":[],"length":0,"stats":{"Line":0}},{"line":94,"address":[14102867,14102931,14103264],"length":1,"stats":{"Line":2}},{"line":95,"address":[4298904,4299090],"length":1,"stats":{"Line":0}},{"line":97,"address":[12786152,12786323],"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":[12786588,12786500],"length":1,"stats":{"Line":2}},{"line":103,"address":[14103764],"length":1,"stats":{"Line":1}},{"line":120,"address":[12786784],"length":1,"stats":{"Line":1}},{"line":131,"address":[],"length":0,"stats":{"Line":0}},{"line":132,"address":[],"length":0,"stats":{"Line":0}},{"line":133,"address":[14105682,14104962,14105385],"length":1,"stats":{"Line":0}},{"line":134,"address":[],"length":0,"stats":{"Line":0}},{"line":136,"address":[14105387,14105200,14105473,14105099],"length":1,"stats":{"Line":0}},{"line":138,"address":[14106279,14105957,14105453,14105807],"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 BATCH_PROVING_THREADS_NUM: usize = 2;\npub const RECURSIVE_PROVING_THREADS_NUM: usize = 2;\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 merkle_proof;\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::{merkle_proof::get_merkle_proof, prover::prove, verifier::verify};\nuse zk_por_core::{config::ProverConfig, 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    GetMerkleProof {\n        #[arg(short, long)]\n        cfg_path: String, // path to config file\n        #[arg(short, long)]\n        account_path: String,\n        #[arg(short, long)]\n        output_path: String, // path to output file\n    },\n    Verify {\n        #[arg(short, long)]\n        global_proof_path: String,\n        #[arg(short, long)]\n        inclusion_proof_path: Option\u003cString\u003e,\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            ZkPorCommitCommands::GetMerkleProof { cfg_path, account_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: ProverConfig = cfg.try_deserialize().unwrap();\n                get_merkle_proof(account_path.to_string(), prover_cfg, output_path.to_string())\n            }\n            ZkPorCommitCommands::Verify { global_proof_path, inclusion_proof_path } =\u003e {\n                let global_proof_path = PathBuf::from_str(\u0026global_proof_path).unwrap();\n                let inclusion_proof_path =\n                    inclusion_proof_path.as_ref().map(|p| PathBuf::from_str(\u0026p).unwrap());\n                verify(global_proof_path, inclusion_proof_path)\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","merkle_proof.rs"],"content":"use std::{fs::File, io::Write, str::FromStr};\n\nuse serde_json::json;\nuse zk_por_core::{\n    account::Account,\n    config::ProverConfig,\n    database::{DataBase, DbOption},\n    error::PoRError,\n    global::GlobalConfig,\n    merkle_proof::MerkleProof,\n    parser::{AccountParser, FileAccountReader, FileManager, FilesCfg},\n};\n\nuse crate::constant::RECURSION_BRANCHOUT_NUM;\n\npub fn get_merkle_proof(\n    account_path: String,\n    cfg: ProverConfig,\n    output_path: String,\n) -\u003e Result\u003c(), PoRError\u003e {\n    let database = DataBase::new(DbOption {\n        user_map_dir: cfg.db.level_db_user_path.to_string(),\n        gmst_dir: cfg.db.level_db_gmst_path.to_string(),\n    });\n\n    let batch_size = cfg.prover.batch_size as usize;\n    let token_num = cfg.prover.num_of_tokens as usize;\n\n    // the path to dump the final generated proof\n    let file_manager = FileManager {};\n    let account_parser = FileAccountReader::new(\n        FilesCfg {\n            dir: std::path::PathBuf::from_str(\u0026cfg.prover.user_data_path).unwrap(),\n            batch_size: cfg.prover.batch_size,\n            num_of_tokens: cfg.prover.num_of_tokens,\n        },\n        \u0026file_manager,\n    );\n    account_parser.log_state();\n    // let mut account_parser: Box\u003cdyn AccountParser\u003e = Box::new(parser);\n\n    let batch_num = account_parser.total_num_of_users().div_ceil(batch_size);\n\n    let global_cfg = 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\n    // the account json format is a map of tokens to token values, wheras the format in the merkle proof is given by a vec of token values.\n    let account = Account::new_from_file_path(account_path);\n\n    if account.is_err() {\n        return Err(account.unwrap_err());\n    }\n\n    let merkle_proof = MerkleProof::new_from_account(\u0026account.unwrap(), \u0026database, \u0026global_cfg)\n        .expect(\"Una ble to generate merkle proof\");\n\n    let mut file = File::create(output_path.clone())\n        .expect(format!(\"fail to create proof file at {:#?}\", output_path).as_str());\n    file.write_all(json!(merkle_proof).to_string().as_bytes())\n        .expect(\"fail to write proof to file\");\n\n    Ok(())\n}\n","traces":[{"line":16,"address":[8858543,8855184,8858309],"length":1,"stats":{"Line":0}},{"line":21,"address":[8855242,8855408],"length":1,"stats":{"Line":0}},{"line":22,"address":[8855274],"length":1,"stats":{"Line":0}},{"line":23,"address":[8855345],"length":1,"stats":{"Line":0}},{"line":26,"address":[8855507],"length":1,"stats":{"Line":0}},{"line":27,"address":[8855531],"length":1,"stats":{"Line":0}},{"line":32,"address":[8855698],"length":1,"stats":{"Line":0}},{"line":33,"address":[8855627,8855548],"length":1,"stats":{"Line":0}},{"line":34,"address":[8855690],"length":1,"stats":{"Line":0}},{"line":35,"address":[8855694],"length":1,"stats":{"Line":0}},{"line":39,"address":[8855777],"length":1,"stats":{"Line":0}},{"line":42,"address":[8855840],"length":1,"stats":{"Line":0}},{"line":52,"address":[8855960],"length":1,"stats":{"Line":0}},{"line":54,"address":[8856034,8856110],"length":1,"stats":{"Line":0}},{"line":55,"address":[8856434,8858367],"length":1,"stats":{"Line":0}},{"line":58,"address":[8856658,8856120,8856571],"length":1,"stats":{"Line":0}},{"line":61,"address":[8856771,8857443],"length":1,"stats":{"Line":0}},{"line":62,"address":[8857488,8856917,8858318,8857375,8857213],"length":1,"stats":{"Line":0}},{"line":63,"address":[8857595,8857851,8857910,8857986],"length":1,"stats":{"Line":0}},{"line":66,"address":[8858085],"length":1,"stats":{"Line":0}}],"covered":0,"coverable":20},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-cli","src","prover.rs"],"content":"use super::constant::{\n    BATCH_PROVING_THREADS_NUM, RECURSION_BRANCHOUT_NUM, RECURSIVE_PROVING_THREADS_NUM,\n};\nuse indicatif::ProgressBar;\nuse plonky2::hash::hash_types::HashOut;\nuse rayon::{iter::ParallelIterator, prelude::*};\nuse serde_json::json;\nuse std::{fs::File, io::Write, path::PathBuf, str::FromStr, sync::RwLock};\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::ProverConfig,\n    database::{DataBase, DbOption},\n    e2e::{batch_prove_accounts, prove_subproofs},\n    error::PoRError,\n    global::{GlobalConfig, GlobalMst, GLOBAL_MST},\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\npub fn prove(cfg: ProverConfig, proof_output_path: PathBuf) -\u003e Result\u003c(), PoRError\u003e {\n    let trace_cfg: TraceConfig = cfg.log.into();\n    let _g = init_tracing(trace_cfg);\n\n    let mut database = DataBase::new(DbOption {\n        user_map_dir: cfg.db.level_db_user_path.to_string(),\n        gmst_dir: cfg.db.level_db_gmst_path.to_string(),\n    });\n\n    let batch_size = cfg.prover.batch_size as usize;\n    let token_num = cfg.prover.num_of_tokens as usize;\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: cfg.prover.batch_size,\n            num_of_tokens: cfg.prover.num_of_tokens,\n        },\n        \u0026file_manager,\n    );\n    account_parser.log_state();\n    // let mut account_parser: Box\u003cdyn AccountParser\u003e = Box::new(parser);\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 num_cpus = num_cpus::get();\n    let num_cpus =\n        if BATCH_PROVING_THREADS_NUM \u003c num_cpus { BATCH_PROVING_THREADS_NUM } else { num_cpus };\n    let per_parse_account_num = num_cpus * batch_size; // as we use one thread to prove each batch, we load num_cpus batches to increase the parallelism.\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: Vec\u003cAccount\u003e =\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 = batch_prove_accounts(\n            \u0026circuit_registry,\n            accounts,\n            BATCH_PROVING_THREADS_NUM,\n            batch_size,\n        );\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_PROVING_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    let mut file = File::create(proof_output_path.clone())\n        .expect(format!(\"fail to create proof file at {:#?}\", proof_output_path).as_str());\n    file.write_all(json!(proof).to_string().as_bytes()).expect(\"fail to write proof to file\");\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    return Ok(());\n}\n","traces":[{"line":27,"address":[8731024,8749478],"length":1,"stats":{"Line":0}},{"line":28,"address":[8731123],"length":1,"stats":{"Line":0}},{"line":29,"address":[8731368],"length":1,"stats":{"Line":0}},{"line":31,"address":[8731534],"length":1,"stats":{"Line":0}},{"line":32,"address":[8731403],"length":1,"stats":{"Line":0}},{"line":33,"address":[8731471],"length":1,"stats":{"Line":0}},{"line":36,"address":[8731633],"length":1,"stats":{"Line":0}},{"line":37,"address":[8731652],"length":1,"stats":{"Line":0}},{"line":42,"address":[8731826],"length":1,"stats":{"Line":0}},{"line":43,"address":[8731755,8731664],"length":1,"stats":{"Line":0}},{"line":44,"address":[8731818],"length":1,"stats":{"Line":0}},{"line":45,"address":[8731822],"length":1,"stats":{"Line":0}},{"line":49,"address":[8731905],"length":1,"stats":{"Line":0}},{"line":52,"address":[8731968],"length":1,"stats":{"Line":0}},{"line":54,"address":[8732049],"length":1,"stats":{"Line":0}},{"line":62,"address":[8732215,8765677],"length":1,"stats":{"Line":0}},{"line":66,"address":[8732244],"length":1,"stats":{"Line":0}},{"line":68,"address":[8732283,8732347],"length":1,"stats":{"Line":0}},{"line":70,"address":[8732507,8732923,8733550,8733122,8733252,8733626,8733820],"length":1,"stats":{"Line":0}},{"line":78,"address":[8733317],"length":1,"stats":{"Line":0}},{"line":81,"address":[8735304],"length":1,"stats":{"Line":0}},{"line":89,"address":[8736103,8735077],"length":1,"stats":{"Line":0}},{"line":90,"address":[8736118],"length":1,"stats":{"Line":0}},{"line":91,"address":[8736130],"length":1,"stats":{"Line":0}},{"line":92,"address":[8736161],"length":1,"stats":{"Line":0}},{"line":94,"address":[8736201,8736272],"length":1,"stats":{"Line":0}},{"line":96,"address":[8736246],"length":1,"stats":{"Line":0}},{"line":97,"address":[8736265],"length":1,"stats":{"Line":0}},{"line":98,"address":[8736376,8736292],"length":1,"stats":{"Line":0}},{"line":99,"address":[8765520,8736500,8736397],"length":1,"stats":{"Line":0}},{"line":100,"address":[8757675,8736524,8757721],"length":1,"stats":{"Line":0}},{"line":101,"address":[8757682,8757742],"length":1,"stats":{"Line":0}},{"line":104,"address":[8757750],"length":1,"stats":{"Line":0}},{"line":106,"address":[8757826],"length":1,"stats":{"Line":0}},{"line":107,"address":[8757869],"length":1,"stats":{"Line":0}},{"line":108,"address":[8758207,8757959],"length":1,"stats":{"Line":0}},{"line":109,"address":[8758980,8759121,8759197,8759721,8758651,8758850,8758235],"length":1,"stats":{"Line":0}},{"line":110,"address":[8759045,8760022],"length":1,"stats":{"Line":0}},{"line":113,"address":[8757929,8760106],"length":1,"stats":{"Line":0}},{"line":115,"address":[8761402,8760856,8761326,8761816,8761055,8761185,8760440],"length":1,"stats":{"Line":0}},{"line":122,"address":[8761250,8762117],"length":1,"stats":{"Line":0}},{"line":124,"address":[8765807,8765744],"length":1,"stats":{"Line":0}},{"line":127,"address":[8762353,8762201],"length":1,"stats":{"Line":0}},{"line":128,"address":[8762369],"length":1,"stats":{"Line":0}},{"line":130,"address":[8762473,8762537],"length":1,"stats":{"Line":0}},{"line":132,"address":[8762545],"length":1,"stats":{"Line":0}},{"line":135,"address":[8765936,8766301,8765966],"length":1,"stats":{"Line":0}},{"line":136,"address":[8766013,8766065],"length":1,"stats":{"Line":0}},{"line":137,"address":[8766039,8766370,8766136,8766336],"length":1,"stats":{"Line":0}},{"line":138,"address":[8766380],"length":1,"stats":{"Line":0}},{"line":140,"address":[8766201],"length":1,"stats":{"Line":0}},{"line":143,"address":[8762693],"length":1,"stats":{"Line":0}},{"line":147,"address":[8762771],"length":1,"stats":{"Line":0}},{"line":152,"address":[8762871,8762935],"length":1,"stats":{"Line":0}},{"line":154,"address":[8763117,8766464,8766479],"length":1,"stats":{"Line":0}},{"line":155,"address":[8766634,8766524],"length":1,"stats":{"Line":0}},{"line":157,"address":[8766550],"length":1,"stats":{"Line":0}},{"line":158,"address":[8766580],"length":1,"stats":{"Line":0}},{"line":159,"address":[8766617],"length":1,"stats":{"Line":0}},{"line":160,"address":[8766726],"length":1,"stats":{"Line":0}},{"line":164,"address":[8763382],"length":1,"stats":{"Line":0}},{"line":166,"address":[8764024,8764323,8764441,8764505,8765111,8763620,8764211],"length":1,"stats":{"Line":0}},{"line":173,"address":[8764379],"length":1,"stats":{"Line":0}},{"line":174,"address":[8765475,8765417],"length":1,"stats":{"Line":0}},{"line":176,"address":[8736505],"length":1,"stats":{"Line":0}},{"line":178,"address":[8737901],"length":1,"stats":{"Line":0}},{"line":185,"address":[8737524,8738509],"length":1,"stats":{"Line":0}},{"line":187,"address":[8738533],"length":1,"stats":{"Line":0}},{"line":188,"address":[8738556],"length":1,"stats":{"Line":0}},{"line":189,"address":[8738578],"length":1,"stats":{"Line":0}},{"line":190,"address":[8738698,8738634],"length":1,"stats":{"Line":0}},{"line":193,"address":[8757542,8738914,8738706],"length":1,"stats":{"Line":0}},{"line":194,"address":[8738930,8749801],"length":1,"stats":{"Line":0}},{"line":195,"address":[8749816],"length":1,"stats":{"Line":0}},{"line":196,"address":[8750209,8749864],"length":1,"stats":{"Line":0}},{"line":199,"address":[8750118,8749989],"length":1,"stats":{"Line":0}},{"line":204,"address":[8750334],"length":1,"stats":{"Line":0}},{"line":206,"address":[8751446,8750933,8751860,8751370,8750517,8751132,8751262],"length":1,"stats":{"Line":0}},{"line":213,"address":[8752145,8751327],"length":1,"stats":{"Line":0}},{"line":214,"address":[8752395,8752188],"length":1,"stats":{"Line":0}},{"line":215,"address":[8753385,8752839,8753168,8753309,8752423,8753906,8753038],"length":1,"stats":{"Line":0}},{"line":217,"address":[8754207,8753233],"length":1,"stats":{"Line":0}},{"line":220,"address":[8752163,8754399],"length":1,"stats":{"Line":0}},{"line":221,"address":[8754415],"length":1,"stats":{"Line":0}},{"line":222,"address":[8766837,8754519,8766800,8754599],"length":1,"stats":{"Line":0}},{"line":223,"address":[8766847],"length":1,"stats":{"Line":0}},{"line":224,"address":[8766873],"length":1,"stats":{"Line":0}},{"line":226,"address":[8766910,8767042],"length":1,"stats":{"Line":0}},{"line":228,"address":[8754684],"length":1,"stats":{"Line":0}},{"line":231,"address":[8754718],"length":1,"stats":{"Line":0}},{"line":232,"address":[8754782],"length":1,"stats":{"Line":0}},{"line":238,"address":[8755313,8754923],"length":1,"stats":{"Line":0}},{"line":239,"address":[8754907],"length":1,"stats":{"Line":0}},{"line":241,"address":[8754987,8755214,8755085],"length":1,"stats":{"Line":0}},{"line":247,"address":[8755237,8755362],"length":1,"stats":{"Line":0}},{"line":249,"address":[8755389],"length":1,"stats":{"Line":0}},{"line":250,"address":[8755509],"length":1,"stats":{"Line":0}},{"line":252,"address":[8757249,8756388,8755773,8756518,8756656,8756189,8756732],"length":1,"stats":{"Line":0}},{"line":260,"address":[8738899,8738967],"length":1,"stats":{"Line":0}},{"line":261,"address":[8749589,8749707,8739004],"length":1,"stats":{"Line":0}},{"line":263,"address":[8739095,8738989],"length":1,"stats":{"Line":0}},{"line":266,"address":[8739183,8739103],"length":1,"stats":{"Line":0}},{"line":267,"address":[8739199],"length":1,"stats":{"Line":0}},{"line":269,"address":[8739268,8739379],"length":1,"stats":{"Line":0}},{"line":270,"address":[8739395],"length":1,"stats":{"Line":0}},{"line":271,"address":[8739499,8739595],"length":1,"stats":{"Line":0}},{"line":272,"address":[8739658],"length":1,"stats":{"Line":0}},{"line":274,"address":[8739692],"length":1,"stats":{"Line":0}},{"line":275,"address":[8739867,8739748,8740111],"length":1,"stats":{"Line":0}},{"line":276,"address":[8741394,8741059,8741189,8741652,8740444,8740860,8741318],"length":1,"stats":{"Line":0}},{"line":278,"address":[8741262,8741940],"length":1,"stats":{"Line":0}},{"line":280,"address":[8741905],"length":1,"stats":{"Line":0}},{"line":283,"address":[8743301],"length":1,"stats":{"Line":0}},{"line":289,"address":[8742975,8743760],"length":1,"stats":{"Line":0}},{"line":292,"address":[8743794],"length":1,"stats":{"Line":0}},{"line":303,"address":[8744121,8744770,8744054],"length":1,"stats":{"Line":0}},{"line":304,"address":[8744528,8744690,8744821,8744232,8749500],"length":1,"stats":{"Line":0}},{"line":305,"address":[8745202,8744940],"length":1,"stats":{"Line":0}},{"line":309,"address":[8745436,8745547],"length":1,"stats":{"Line":0}},{"line":311,"address":[8745563],"length":1,"stats":{"Line":0}},{"line":312,"address":[8745660,8745723],"length":1,"stats":{"Line":0}},{"line":313,"address":[8745952,8746905,8747099,8746697,8746368,8746829,8746567],"length":1,"stats":{"Line":0}},{"line":314,"address":[8746762,8747367],"length":1,"stats":{"Line":0}},{"line":315,"address":[8747390],"length":1,"stats":{"Line":0}},{"line":316,"address":[8748806,8748548,8747584,8748000,8748199,8748472,8748329],"length":1,"stats":{"Line":0}},{"line":318,"address":[8748412],"length":1,"stats":{"Line":0}}],"covered":0,"coverable":126},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-cli","src","verifier.rs"],"content":"use 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;\n\npub fn verify(\n    global_proof_path: PathBuf,\n    merkle_inclusion_path: Option\u003cPathBuf\u003e,\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).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    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    if !root_circuit.verify(proof.proof).is_ok() {\n        return Err(PoRError::InvalidProof);\n    }\n    println!(\"successfully verify the global proof for round {}\", round_num);\n\n    if let Some(merkle_inclusion_path) = merkle_inclusion_path {\n        let merkle_path = File::open(\u0026merkle_inclusion_path).unwrap();\n        let reader = std::io::BufReader::new(merkle_path);\n\n        // Parse the JSON as Proof\n        let proof: MerkleProof = from_reader(reader).unwrap();\n\n        let res = proof.verify_merkle_proof(root_hash);\n\n        if res.is_err() {\n            let res_err = res.unwrap_err();\n            return Err(res_err);\n        } else {\n            println!(\"successfully verify the inclusion proof for user for round {}\", round_num);\n            return Ok(());\n        }\n    }\n\n    Ok(())\n}\n","traces":[{"line":18,"address":[8998252,8998604,8994352],"length":1,"stats":{"Line":0}},{"line":22,"address":[8994406,8994791],"length":1,"stats":{"Line":0}},{"line":23,"address":[8994798],"length":1,"stats":{"Line":0}},{"line":26,"address":[8994833,8995051],"length":1,"stats":{"Line":0}},{"line":28,"address":[8995059],"length":1,"stats":{"Line":0}},{"line":29,"address":[8998518,8995165],"length":1,"stats":{"Line":0}},{"line":32,"address":[8995070],"length":1,"stats":{"Line":0}},{"line":33,"address":[8995094],"length":1,"stats":{"Line":0}},{"line":34,"address":[8995110],"length":1,"stats":{"Line":0}},{"line":35,"address":[8995126],"length":1,"stats":{"Line":0}},{"line":36,"address":[8995235,8995158],"length":1,"stats":{"Line":0}},{"line":40,"address":[8995251,8995312],"length":1,"stats":{"Line":0}},{"line":45,"address":[8995625],"length":1,"stats":{"Line":0}},{"line":50,"address":[8995697],"length":1,"stats":{"Line":0}},{"line":53,"address":[8995938,8995881],"length":1,"stats":{"Line":0}},{"line":55,"address":[8995946],"length":1,"stats":{"Line":0}},{"line":56,"address":[8995976],"length":1,"stats":{"Line":0}},{"line":57,"address":[8996137],"length":1,"stats":{"Line":0}},{"line":60,"address":[8996340],"length":1,"stats":{"Line":0}},{"line":65,"address":[8996425],"length":1,"stats":{"Line":0}},{"line":66,"address":[8996468],"length":1,"stats":{"Line":0}},{"line":67,"address":[8996525],"length":1,"stats":{"Line":0}},{"line":68,"address":[8996714],"length":1,"stats":{"Line":0}},{"line":70,"address":[8996878],"length":1,"stats":{"Line":0}},{"line":72,"address":[8996955],"length":1,"stats":{"Line":0}},{"line":73,"address":[8997040,8997350],"length":1,"stats":{"Line":0}},{"line":74,"address":[8997357],"length":1,"stats":{"Line":0}},{"line":77,"address":[8997392],"length":1,"stats":{"Line":0}},{"line":79,"address":[8997604,8997715],"length":1,"stats":{"Line":0}},{"line":81,"address":[8997731,8997784],"length":1,"stats":{"Line":0}},{"line":82,"address":[8997905],"length":1,"stats":{"Line":0}},{"line":83,"address":[8998150],"length":1,"stats":{"Line":0}},{"line":85,"address":[8998039],"length":1,"stats":{"Line":0}},{"line":86,"address":[8998116],"length":1,"stats":{"Line":0}},{"line":90,"address":[8997065],"length":1,"stats":{"Line":0}}],"covered":0,"coverable":35},{"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 plonky2::{\n    hash::{hash_types::HashOut, poseidon::PoseidonHash},\n    plonk::config::Hasher,\n};\nuse plonky2_field::types::Field;\nuse serde::{Deserialize, Serialize};\nuse serde_json::Value;\nuse std::{collections::BTreeMap, fs::File, io::BufReader};\n\nuse crate::{\n    database::{DataBase, UserId},\n    error::PoRError,\n    parser::parse_account_state,\n    types::F,\n};\nuse rand::Rng;\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    /// Get a new account from a file path\n    pub fn new_from_file_path(path: String) -\u003e Result\u003cSelf, PoRError\u003e {\n        let file_res = File::open(path);\n\n        if file_res.is_err() {\n            return Err(PoRError::InvalidParameter(\"Invalid account json file path\".to_string()));\n        }\n\n        let reader = BufReader::new(file_res.unwrap());\n        // Deserialize the json data to a struct\n        let account_map_res: Result\u003cBTreeMap\u003cString, Value\u003e, _\u003e = serde_json::from_reader(reader);\n\n        if account_map_res.is_err() {\n            return Err(PoRError::InvalidParameter(\"Invalid account json\".to_string()));\n        }\n\n        let account = parse_account_state(\u0026account_map_res.unwrap());\n\n        Ok(account)\n    }\n}\n\npub fn persist_account_id_to_gmst_pos(\n    db: \u0026mut DataBase,\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":28,"address":[8802377,8801536,8802406],"length":1,"stats":{"Line":1}},{"line":29,"address":[8802480,8801574,8802448],"length":1,"stats":{"Line":3}},{"line":31,"address":[12338800,12338832,12337929],"length":1,"stats":{"Line":3}},{"line":33,"address":[12337989],"length":1,"stats":{"Line":1}},{"line":36,"address":[12338682,12338082,12338024],"length":1,"stats":{"Line":2}},{"line":42,"address":[12339156,12338848],"length":1,"stats":{"Line":0}},{"line":45,"address":[12338962,12338895],"length":1,"stats":{"Line":0}},{"line":46,"address":[12338978,12339042],"length":1,"stats":{"Line":0}},{"line":50,"address":[8802880,8803183],"length":1,"stats":{"Line":1}},{"line":52,"address":[12339211],"length":1,"stats":{"Line":1}},{"line":53,"address":[12339306,12339242],"length":1,"stats":{"Line":2}},{"line":54,"address":[12339322,12339381],"length":1,"stats":{"Line":2}},{"line":59,"address":[12340619,12339520],"length":1,"stats":{"Line":1}},{"line":60,"address":[12339570,12339655],"length":1,"stats":{"Line":1}},{"line":62,"address":[12340034,12339591,12339683,12339919,12340435,12340149,12340641,12340218,12339804],"length":1,"stats":{"Line":2}},{"line":63,"address":[12339612,12339751],"length":1,"stats":{"Line":2}},{"line":64,"address":[12339766,12339866],"length":1,"stats":{"Line":2}},{"line":65,"address":[12339881,12339981],"length":1,"stats":{"Line":2}},{"line":66,"address":[12339996,12340096],"length":1,"stats":{"Line":2}},{"line":67,"address":[12340211,12340111],"length":1,"stats":{"Line":2}},{"line":70,"address":[12340409,12340510],"length":1,"stats":{"Line":2}},{"line":72,"address":[12340656,12340683,12340864],"length":1,"stats":{"Line":3}},{"line":77,"address":[12340880,12341970,12342271],"length":1,"stats":{"Line":0}},{"line":78,"address":[12340897],"length":1,"stats":{"Line":0}},{"line":80,"address":[12340945,12341025],"length":1,"stats":{"Line":0}},{"line":81,"address":[12341246,12342171],"length":1,"stats":{"Line":0}},{"line":84,"address":[12341280,12341035],"length":1,"stats":{"Line":0}},{"line":86,"address":[12341299],"length":1,"stats":{"Line":0}},{"line":88,"address":[12341334,12341422],"length":1,"stats":{"Line":0}},{"line":89,"address":[12341709,12341984],"length":1,"stats":{"Line":0}},{"line":92,"address":[12341739,12341432],"length":1,"stats":{"Line":0}},{"line":94,"address":[12341873],"length":1,"stats":{"Line":0}},{"line":98,"address":[12342304],"length":1,"stats":{"Line":0}},{"line":103,"address":[12342339],"length":1,"stats":{"Line":0}},{"line":106,"address":[8806080,8806144],"length":1,"stats":{"Line":0}},{"line":107,"address":[12342512],"length":1,"stats":{"Line":0}},{"line":109,"address":[8806461,8806536],"length":1,"stats":{"Line":0}},{"line":112,"address":[12342413],"length":1,"stats":{"Line":0}},{"line":116,"address":[12342912,12344175,12344206],"length":1,"stats":{"Line":1}},{"line":117,"address":[12342967],"length":1,"stats":{"Line":1}},{"line":118,"address":[8806736,8806660],"length":1,"stats":{"Line":2}},{"line":119,"address":[12343182,12343999,12343100],"length":1,"stats":{"Line":3}},{"line":120,"address":[12343322],"length":1,"stats":{"Line":1}},{"line":121,"address":[12343365],"length":1,"stats":{"Line":1}},{"line":122,"address":[12343522,12343441],"length":1,"stats":{"Line":2}},{"line":123,"address":[12344008,12343650],"length":1,"stats":{"Line":2}},{"line":124,"address":[8807639,8807684],"length":1,"stats":{"Line":1}},{"line":125,"address":[12344044,12344085],"length":1,"stats":{"Line":2}},{"line":126,"address":[12344108],"length":1,"stats":{"Line":1}},{"line":129,"address":[12343604],"length":1,"stats":{"Line":1}},{"line":130,"address":[12343623],"length":1,"stats":{"Line":1}},{"line":132,"address":[12344368,12344623,12343686,12344240,12344747],"length":1,"stats":{"Line":5}},{"line":133,"address":[12343780],"length":1,"stats":{"Line":1}},{"line":135,"address":[12343272],"length":1,"stats":{"Line":1}},{"line":138,"address":[12344768],"length":1,"stats":{"Line":0}},{"line":139,"address":[12344875],"length":1,"stats":{"Line":0}},{"line":141,"address":[12344811],"length":1,"stats":{"Line":0}}],"covered":35,"coverable":57},{"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":[9221315,9220752],"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":[8688286,8688550,8675568],"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":[8677973],"length":1,"stats":{"Line":0}},{"line":59,"address":[8678019],"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":[8678253],"length":1,"stats":{"Line":0}},{"line":67,"address":[8678420,8678325],"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":[8680396],"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":[8683309],"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":[8685606],"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":[8681844],"length":1,"stats":{"Line":0}},{"line":150,"address":[],"length":0,"stats":{"Line":0}},{"line":151,"address":[],"length":0,"stats":{"Line":0}},{"line":154,"address":[8675248],"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":[8675440],"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":[11140576],"length":1,"stats":{"Line":1}},{"line":20,"address":[11140580],"length":1,"stats":{"Line":1}},{"line":22,"address":[11140589],"length":1,"stats":{"Line":1}},{"line":25,"address":[11140608],"length":1,"stats":{"Line":1}},{"line":30,"address":[10805392,10809231,10807321,10806368,10807344,10808297,10810207,10810249,10808320,10809273,10809296,10806345,10805327,10805369,10806303,10807279,10808255,10804416],"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":[10806737,10804785,10808689,10807713,10809665,10805761],"length":1,"stats":{"Line":5}},{"line":40,"address":[],"length":0,"stats":{"Line":5}},{"line":41,"address":[10807781,10808757,10804853,10809733,10806805,10805829],"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":[11140640],"length":1,"stats":{"Line":1}},{"line":51,"address":[11140649],"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: usize,\n    pub num_of_tokens: usize,\n    pub user_data_path: String,\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: ConfigDb,\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":[10313808,10314256,10314301],"length":1,"stats":{"Line":0}},{"line":20,"address":[10313838],"length":1,"stats":{"Line":0}},{"line":21,"address":[10313855],"length":1,"stats":{"Line":0}},{"line":22,"address":[10313876,10313968],"length":1,"stats":{"Line":0}},{"line":23,"address":[8453419],"length":1,"stats":{"Line":0}},{"line":24,"address":[10314158],"length":1,"stats":{"Line":0}},{"line":44,"address":[10315967,10314320,10316036],"length":1,"stats":{"Line":0}},{"line":45,"address":[10314347,10316049],"length":1,"stats":{"Line":0}},{"line":46,"address":[10315685,10315557,10315741,10314531,10315108],"length":1,"stats":{"Line":0}},{"line":48,"address":[10314591,10316017,10314992,10315151,10314702,10314847],"length":1,"stats":{"Line":0}},{"line":49,"address":[10315270,10315976,10315600,10315443],"length":1,"stats":{"Line":0}},{"line":50,"address":[10315945,10315616,10315733],"length":1,"stats":{"Line":0}},{"line":53,"address":[10316448,10316477,10316080],"length":1,"stats":{"Line":0}},{"line":54,"address":[10316097,10316331],"length":1,"stats":{"Line":0}},{"line":55,"address":[10812253],"length":1,"stats":{"Line":0}},{"line":67,"address":[10316496,10318143,10318212],"length":1,"stats":{"Line":0}},{"line":68,"address":[10814133,10812475],"length":1,"stats":{"Line":0}},{"line":69,"address":[10316707,10317284,10317861,10317917,10317733],"length":1,"stats":{"Line":0}},{"line":71,"address":[10316767,10317327,10317168,10317023,10318193,10316878],"length":1,"stats":{"Line":0}},{"line":72,"address":[10318152,10317619,10317446,10317776],"length":1,"stats":{"Line":0}},{"line":73,"address":[10317909,10318121,10317792],"length":1,"stats":{"Line":0}},{"line":76,"address":[10318256,10318624,10318653],"length":1,"stats":{"Line":0}},{"line":77,"address":[10318507,10318273],"length":1,"stats":{"Line":0}},{"line":78,"address":[10318463],"length":1,"stats":{"Line":0}}],"covered":0,"coverable":24},{"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, types::F};\n\n#[derive(Debug, Clone, Copy)]\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 struct DbOption {\n    pub user_map_dir: String,\n    pub gmst_dir: String,\n}\n\npub struct DataBase {\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}\nimpl DataBase {\n    pub fn new(opt: DbOption) -\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    pub 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    pub 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    pub 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    pub 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\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::{DataBase, DbOption, UserId},\n        types::F,\n    };\n\n    #[test]\n    fn test_database() {\n        let tempdir_user = TempDir::new(\"example_user\").unwrap();\n        let tempdir_gmst = TempDir::new(\"example_gmst\").unwrap();\n        let mut db = DataBase::new(DbOption {\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\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","traces":[{"line":14,"address":[10336272,10336461],"length":1,"stats":{"Line":1}},{"line":15,"address":[10336285],"length":1,"stats":{"Line":1}},{"line":16,"address":[12344938],"length":1,"stats":{"Line":1}},{"line":17,"address":[12344952],"length":1,"stats":{"Line":1}},{"line":18,"address":[12345009],"length":1,"stats":{"Line":1}},{"line":21,"address":[12345136],"length":1,"stats":{"Line":0}},{"line":22,"address":[10336497],"length":1,"stats":{"Line":0}},{"line":25,"address":[12346463,12349453,12345184],"length":1,"stats":{"Line":0}},{"line":26,"address":[12345314,12345226],"length":1,"stats":{"Line":0}},{"line":27,"address":[12349204,12348431,12348036,12348966,12349030,12348730,12348618],"length":1,"stats":{"Line":0}},{"line":28,"address":[10340110],"length":1,"stats":{"Line":0}},{"line":31,"address":[10336656,10336844],"length":1,"stats":{"Line":0}},{"line":33,"address":[12345535,12345641],"length":1,"stats":{"Line":0}},{"line":34,"address":[12346895,12347094,12347505,12347744,12346479,12347224,12347569],"length":1,"stats":{"Line":0}},{"line":35,"address":[12347299],"length":1,"stats":{"Line":0}},{"line":38,"address":[12345651],"length":1,"stats":{"Line":0}},{"line":39,"address":[12346083,12345671],"length":1,"stats":{"Line":0}},{"line":41,"address":[12346244],"length":1,"stats":{"Line":0}},{"line":46,"address":[12349488],"length":1,"stats":{"Line":0}},{"line":47,"address":[10341097,10340836],"length":1,"stats":{"Line":0}},{"line":48,"address":[12349534],"length":1,"stats":{"Line":0}},{"line":52,"address":[10341014],"length":1,"stats":{"Line":0}},{"line":55,"address":[12349863,12350015,12349824,12349952],"length":1,"stats":{"Line":2}},{"line":56,"address":[10341178,10341299,10341236,10341350],"length":1,"stats":{"Line":4}},{"line":57,"address":[],"length":0,"stats":{"Line":2}},{"line":71,"address":[10342041,10342010,10341392],"length":1,"stats":{"Line":1}},{"line":73,"address":[12350218,12350273,12350142],"length":1,"stats":{"Line":3}},{"line":74,"address":[12350421,12350476,12350346],"length":1,"stats":{"Line":3}},{"line":78,"address":[12350800],"length":1,"stats":{"Line":1}},{"line":79,"address":[12350813],"length":1,"stats":{"Line":1}},{"line":81,"address":[12350880,12350899],"length":1,"stats":{"Line":2}},{"line":83,"address":[12350860],"length":1,"stats":{"Line":1}},{"line":86,"address":[10342320],"length":1,"stats":{"Line":1}},{"line":87,"address":[12351071,12351381,12351152],"length":1,"stats":{"Line":2}},{"line":88,"address":[12351161],"length":1,"stats":{"Line":1}},{"line":89,"address":[10342422,10342499],"length":1,"stats":{"Line":2}},{"line":90,"address":[12351330],"length":1,"stats":{"Line":1}},{"line":97,"address":[12351408],"length":1,"stats":{"Line":1}},{"line":98,"address":[10342653],"length":1,"stats":{"Line":1}},{"line":100,"address":[12351507,12351488],"length":1,"stats":{"Line":2}},{"line":101,"address":[12351553],"length":1,"stats":{"Line":1}},{"line":105,"address":[12351468],"length":1,"stats":{"Line":1}},{"line":108,"address":[12351632],"length":1,"stats":{"Line":1}},{"line":109,"address":[12351654,12351696,12351823],"length":1,"stats":{"Line":2}},{"line":110,"address":[12351723,12351791],"length":1,"stats":{"Line":2}}],"covered":28,"coverable":45},{"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":[8696896,8697395],"length":1,"stats":{"Line":0}},{"line":20,"address":[],"length":0,"stats":{"Line":0}},{"line":21,"address":[8697012,8697058],"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":[8697460],"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":[8697350],"length":1,"stats":{"Line":0}},{"line":41,"address":[8692992,8694350],"length":1,"stats":{"Line":0}},{"line":48,"address":[],"length":0,"stats":{"Line":0}},{"line":49,"address":[8693164,8693217],"length":1,"stats":{"Line":0}},{"line":50,"address":[8693363],"length":1,"stats":{"Line":0}},{"line":52,"address":[8693734,8693395],"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":[8693819],"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":[8696788],"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":[8694760,8694581],"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":[8694199],"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\")]\n    InvalidMerkleProof,\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::DataBase,\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 DataBase) {\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":[12351856,12352368],"length":1,"stats":{"Line":1}},{"line":31,"address":[10343078],"length":1,"stats":{"Line":1}},{"line":34,"address":[12352046],"length":1,"stats":{"Line":1}},{"line":35,"address":[12352104],"length":1,"stats":{"Line":1}},{"line":37,"address":[12352226,12352161],"length":1,"stats":{"Line":2}},{"line":38,"address":[10343418,10343460],"length":1,"stats":{"Line":1}},{"line":39,"address":[12352305,12352261],"length":1,"stats":{"Line":2}},{"line":40,"address":[12352337],"length":1,"stats":{"Line":1}},{"line":43,"address":[12352400],"length":1,"stats":{"Line":1}},{"line":44,"address":[12352405],"length":1,"stats":{"Line":1}},{"line":47,"address":[12352416],"length":1,"stats":{"Line":1}},{"line":48,"address":[12352453,12352425],"length":1,"stats":{"Line":1}},{"line":51,"address":[12352480],"length":1,"stats":{"Line":0}},{"line":52,"address":[12352498],"length":1,"stats":{"Line":0}},{"line":55,"address":[12352528],"length":1,"stats":{"Line":0}},{"line":56,"address":[12352533],"length":1,"stats":{"Line":0}},{"line":65,"address":[12352560],"length":1,"stats":{"Line":1}},{"line":70,"address":[10343774],"length":1,"stats":{"Line":1}},{"line":71,"address":[12352623],"length":1,"stats":{"Line":1}},{"line":72,"address":[12352652],"length":1,"stats":{"Line":1}},{"line":74,"address":[12352728,12352674],"length":1,"stats":{"Line":1}},{"line":76,"address":[10343921,10343875,10343979],"length":1,"stats":{"Line":2}},{"line":77,"address":[12352804,12352838,12352930],"length":1,"stats":{"Line":2}},{"line":79,"address":[12353008,12352922,12352956],"length":1,"stats":{"Line":2}},{"line":80,"address":[12352993,12353034,12353062],"length":1,"stats":{"Line":2}},{"line":82,"address":[12353083,12353042,12353303],"length":1,"stats":{"Line":2}},{"line":86,"address":[12353379,12353288,12353329],"length":1,"stats":{"Line":2}},{"line":93,"address":[10344576],"length":1,"stats":{"Line":1}},{"line":98,"address":[12353463,12353609],"length":1,"stats":{"Line":1}},{"line":99,"address":[12353567],"length":1,"stats":{"Line":1}},{"line":100,"address":[12353584],"length":1,"stats":{"Line":1}},{"line":101,"address":[12353601],"length":1,"stats":{"Line":1}},{"line":103,"address":[12353641],"length":1,"stats":{"Line":1}},{"line":105,"address":[12353705,12353919,12353895],"length":1,"stats":{"Line":2}},{"line":106,"address":[10345071],"length":1,"stats":{"Line":1}},{"line":108,"address":[12353748,12353682],"length":1,"stats":{"Line":2}},{"line":113,"address":[10344822,10345112,10345153,10345260],"length":1,"stats":{"Line":4}},{"line":114,"address":[12353974],"length":1,"stats":{"Line":1}},{"line":116,"address":[12354095,12354036,12353993],"length":1,"stats":{"Line":2}},{"line":119,"address":[12354121,12354150,12354006],"length":1,"stats":{"Line":2}},{"line":120,"address":[12354129,12354176],"length":1,"stats":{"Line":2}},{"line":122,"address":[12354335,12354420],"length":1,"stats":{"Line":1}},{"line":124,"address":[12354410],"length":1,"stats":{"Line":1}},{"line":125,"address":[12354436,12354747,12354418],"length":1,"stats":{"Line":3}},{"line":126,"address":[12354483,12354569,12354647],"length":1,"stats":{"Line":2}},{"line":127,"address":[10345777],"length":1,"stats":{"Line":1}},{"line":128,"address":[12354593],"length":1,"stats":{"Line":1}},{"line":130,"address":[12354719,12354668,12354619],"length":1,"stats":{"Line":2}},{"line":132,"address":[12354676],"length":1,"stats":{"Line":1}},{"line":133,"address":[12354692,12354752,12354739],"length":1,"stats":{"Line":2}},{"line":136,"address":[12354543,12354455,12354522],"length":1,"stats":{"Line":2}},{"line":137,"address":[10345697],"length":1,"stats":{"Line":1}},{"line":142,"address":[12354768],"length":1,"stats":{"Line":1}},{"line":143,"address":[12354797],"length":1,"stats":{"Line":1}},{"line":144,"address":[12354820],"length":1,"stats":{"Line":1}},{"line":147,"address":[10346048],"length":1,"stats":{"Line":0}},{"line":148,"address":[10347038,10346533,10346202,10346681,10346750,10346823,10346866],"length":1,"stats":{"Line":0}},{"line":149,"address":[10347318,10346781],"length":1,"stats":{"Line":0}},{"line":151,"address":[10347351],"length":1,"stats":{"Line":0}},{"line":153,"address":[10347363,10347525],"length":1,"stats":{"Line":0}},{"line":155,"address":[10347462],"length":1,"stats":{"Line":0}},{"line":159,"address":[10347552],"length":1,"stats":{"Line":1}},{"line":160,"address":[12356538,12357017,12357278,12357090,12357235,12357642,12356869],"length":1,"stats":{"Line":7}},{"line":164,"address":[10348289],"length":1,"stats":{"Line":1}},{"line":165,"address":[12357157],"length":1,"stats":{"Line":1}},{"line":168,"address":[12362404,12357984,12365925],"length":1,"stats":{"Line":1}},{"line":170,"address":[10349159],"length":1,"stats":{"Line":1}},{"line":171,"address":[10349208],"length":1,"stats":{"Line":1}},{"line":172,"address":[12358330,12358080,12358173],"length":1,"stats":{"Line":3}},{"line":173,"address":[12358346],"length":1,"stats":{"Line":1}},{"line":174,"address":[10353489,10353584,10349510],"length":1,"stats":{"Line":2}},{"line":175,"address":[12362553,12362489],"length":1,"stats":{"Line":2}},{"line":176,"address":[12362807,12362675],"length":1,"stats":{"Line":1}},{"line":177,"address":[12362836,12362778,12362991],"length":1,"stats":{"Line":2}},{"line":179,"address":[10354092,10354020],"length":1,"stats":{"Line":2}},{"line":182,"address":[12363036],"length":1,"stats":{"Line":1}},{"line":187,"address":[10354159],"length":1,"stats":{"Line":1}},{"line":192,"address":[12363154],"length":1,"stats":{"Line":1}},{"line":193,"address":[10354263],"length":1,"stats":{"Line":1}},{"line":196,"address":[12363268],"length":1,"stats":{"Line":1}},{"line":197,"address":[10354362],"length":1,"stats":{"Line":1}},{"line":199,"address":[10354431],"length":1,"stats":{"Line":1}},{"line":200,"address":[10355329,10356459,10355430,10355030,10355494,10356575,10354635,10355217],"length":1,"stats":{"Line":7}},{"line":201,"address":[10355385],"length":1,"stats":{"Line":1}},{"line":205,"address":[12358283],"length":1,"stats":{"Line":1}},{"line":206,"address":[12358412,12358295],"length":1,"stats":{"Line":2}},{"line":207,"address":[10349783,10349564],"length":1,"stats":{"Line":2}},{"line":208,"address":[10349799,10350086,10350153],"length":1,"stats":{"Line":2}},{"line":209,"address":[10350126,10350189],"length":1,"stats":{"Line":2}},{"line":210,"address":[10350303],"length":1,"stats":{"Line":1}},{"line":211,"address":[12365971,12365952],"length":1,"stats":{"Line":2}},{"line":213,"address":[12359249,12359340],"length":1,"stats":{"Line":2}},{"line":214,"address":[12359348,12359490],"length":1,"stats":{"Line":2}},{"line":216,"address":[10350574,10357088,10357107],"length":1,"stats":{"Line":3}},{"line":218,"address":[10357226,10357120],"length":1,"stats":{"Line":1}},{"line":219,"address":[12366171],"length":1,"stats":{"Line":1}},{"line":224,"address":[12359544,12359639],"length":1,"stats":{"Line":2}},{"line":226,"address":[12366224,12366250],"length":1,"stats":{"Line":2}},{"line":229,"address":[12359736],"length":1,"stats":{"Line":1}},{"line":231,"address":[12359815],"length":1,"stats":{"Line":1}},{"line":232,"address":[12361042,12361998,12360909,12360164,12360779,12360580,12361118,12361870],"length":1,"stats":{"Line":0}},{"line":233,"address":[12360974],"length":1,"stats":{"Line":0}},{"line":235,"address":[12359904,12360089],"length":1,"stats":{"Line":2}},{"line":238,"address":[12358609,12358703],"length":1,"stats":{"Line":2}},{"line":240,"address":[12358711],"length":1,"stats":{"Line":1}},{"line":242,"address":[12358756,12366336,12366346],"length":1,"stats":{"Line":3}},{"line":245,"address":[10357376],"length":1,"stats":{"Line":0}},{"line":246,"address":[12366401],"length":1,"stats":{"Line":0}},{"line":247,"address":[12367156,12366862,12367372,12367010,12366531,12367079,12367199],"length":1,"stats":{"Line":0}},{"line":248,"address":[12367105],"length":1,"stats":{"Line":0}},{"line":249,"address":[10358124],"length":1,"stats":{"Line":0}},{"line":250,"address":[12368013,12367129,12367652],"length":1,"stats":{"Line":0}},{"line":251,"address":[12367971,12367675],"length":1,"stats":{"Line":0}},{"line":252,"address":[12367782],"length":1,"stats":{"Line":0}},{"line":253,"address":[12367829],"length":1,"stats":{"Line":0}},{"line":256,"address":[12368048,12368103,12368257],"length":1,"stats":{"Line":0}},{"line":258,"address":[12367926],"length":1,"stats":{"Line":0}},{"line":259,"address":[12368005,12368018,12367940],"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::{DataBase, UserId},\n    error::PoRError,\n    global::{GlobalConfig, GlobalMst},\n    merkle_sum_prover::utils::hash_2_subhashes,\n    types::{D, F},\n};\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: \u0026DataBase) -\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: \u0026DataBase,\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)\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: \u0026DataBase,\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))\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":34,"address":[10359408,10359614],"length":1,"stats":{"Line":1}},{"line":35,"address":[12368452],"length":1,"stats":{"Line":1}},{"line":36,"address":[12368476],"length":1,"stats":{"Line":1}},{"line":44,"address":[12369468,12368656],"length":1,"stats":{"Line":1}},{"line":46,"address":[12368710],"length":1,"stats":{"Line":1}},{"line":48,"address":[12368839,12368762],"length":1,"stats":{"Line":1}},{"line":49,"address":[12368803],"length":1,"stats":{"Line":1}},{"line":52,"address":[12368822,12368883,12368868],"length":1,"stats":{"Line":2}},{"line":54,"address":[10359943,10359872,10360421],"length":1,"stats":{"Line":3}},{"line":55,"address":[12369207,12369094],"length":1,"stats":{"Line":2}},{"line":56,"address":[12369301,12369274,12369217],"length":1,"stats":{"Line":0}},{"line":57,"address":[12369322,12369282],"length":1,"stats":{"Line":0}},{"line":59,"address":[12369371,12369245,12369344],"length":1,"stats":{"Line":2}},{"line":60,"address":[12369352,12369392],"length":1,"stats":{"Line":2}},{"line":63,"address":[10360303,10360383,10360426],"length":1,"stats":{"Line":2}},{"line":64,"address":[12369434],"length":1,"stats":{"Line":1}},{"line":67,"address":[12369065,12369504,12369524,12369124],"length":1,"stats":{"Line":4}},{"line":71,"address":[12369552,12372481,12372512],"length":1,"stats":{"Line":1}},{"line":76,"address":[12369618],"length":1,"stats":{"Line":1}},{"line":78,"address":[12369681],"length":1,"stats":{"Line":1}},{"line":79,"address":[10360837,10360677,10360809],"length":1,"stats":{"Line":2}},{"line":80,"address":[12369847,12369909,12369952],"length":1,"stats":{"Line":2}},{"line":81,"address":[12369997,12369933],"length":1,"stats":{"Line":2}},{"line":84,"address":[12370005],"length":1,"stats":{"Line":1}},{"line":85,"address":[12370052],"length":1,"stats":{"Line":1}},{"line":87,"address":[12370106,12370169],"length":1,"stats":{"Line":1}},{"line":88,"address":[12370149,12370206,12370250],"length":1,"stats":{"Line":2}},{"line":89,"address":[12370327,12370230,12370287],"length":1,"stats":{"Line":2}},{"line":91,"address":[12370308,12370364,12370427],"length":1,"stats":{"Line":3}},{"line":92,"address":[12370403],"length":1,"stats":{"Line":1}},{"line":95,"address":[12370760,12370564,12372067],"length":1,"stats":{"Line":3}},{"line":96,"address":[12370784],"length":1,"stats":{"Line":1}},{"line":97,"address":[12370803],"length":1,"stats":{"Line":1}},{"line":98,"address":[12370879],"length":1,"stats":{"Line":1}},{"line":99,"address":[12370901,12371039,12371311],"length":1,"stats":{"Line":3}},{"line":100,"address":[12371335],"length":1,"stats":{"Line":1}},{"line":101,"address":[12371380,12371550],"length":1,"stats":{"Line":1}},{"line":103,"address":[12371571,12371531],"length":1,"stats":{"Line":2}},{"line":106,"address":[12371353],"length":1,"stats":{"Line":1}},{"line":107,"address":[12371584,12371742],"length":1,"stats":{"Line":1}},{"line":109,"address":[12371763,12371723],"length":1,"stats":{"Line":2}},{"line":113,"address":[12371784,12370944],"length":1,"stats":{"Line":2}},{"line":114,"address":[12371891],"length":1,"stats":{"Line":1}},{"line":118,"address":[10363083,10363184],"length":1,"stats":{"Line":1}},{"line":120,"address":[10363218],"length":1,"stats":{"Line":1}},{"line":123,"address":[10363056],"length":1,"stats":{"Line":1}},{"line":127,"address":[10363250,10363351],"length":1,"stats":{"Line":1}},{"line":129,"address":[12372435],"length":1,"stats":{"Line":1}},{"line":134,"address":[12371137],"length":1,"stats":{"Line":1}},{"line":136,"address":[12372007,12371918],"length":1,"stats":{"Line":1}},{"line":137,"address":[10362996,10363030,10362935],"length":1,"stats":{"Line":2}},{"line":140,"address":[12370717],"length":1,"stats":{"Line":1}},{"line":152,"address":[12372528,12372941],"length":1,"stats":{"Line":0}},{"line":153,"address":[12372579],"length":1,"stats":{"Line":0}},{"line":156,"address":[12373086,12372976,12372999],"length":1,"stats":{"Line":0}},{"line":158,"address":[12372733,12372664],"length":1,"stats":{"Line":0}},{"line":161,"address":[10364055,10364141,10364032],"length":1,"stats":{"Line":0}},{"line":167,"address":[12373761,12373232],"length":1,"stats":{"Line":1}},{"line":168,"address":[12373254],"length":1,"stats":{"Line":1}},{"line":169,"address":[12373287],"length":1,"stats":{"Line":1}},{"line":170,"address":[10364300],"length":1,"stats":{"Line":1}},{"line":172,"address":[12373808,12373821,12373436],"length":1,"stats":{"Line":3}},{"line":174,"address":[12373580,12373668],"length":1,"stats":{"Line":2}},{"line":189,"address":[10366155,10364736,10367746],"length":1,"stats":{"Line":0}},{"line":194,"address":[10364807],"length":1,"stats":{"Line":0}},{"line":195,"address":[12374009,12374107],"length":1,"stats":{"Line":0}},{"line":196,"address":[10365343,10367701],"length":1,"stats":{"Line":0}},{"line":199,"address":[10364989],"length":1,"stats":{"Line":0}},{"line":201,"address":[12374632],"length":1,"stats":{"Line":0}},{"line":202,"address":[12374696],"length":1,"stats":{"Line":0}},{"line":203,"address":[10367252,10366563,10367040,10366750,10366168,10366862,10366976],"length":1,"stats":{"Line":0}},{"line":204,"address":[10366934,10367571],"length":1,"stats":{"Line":0}},{"line":207,"address":[10365589,10365826],"length":1,"stats":{"Line":0}},{"line":212,"address":[12375134,12374989],"length":1,"stats":{"Line":0}},{"line":215,"address":[10366021],"length":1,"stats":{"Line":0}},{"line":218,"address":[10367776],"length":1,"stats":{"Line":1}},{"line":219,"address":[12376995],"length":1,"stats":{"Line":1}},{"line":221,"address":[12377011],"length":1,"stats":{"Line":1}},{"line":223,"address":[12377020,12377328],"length":1,"stats":{"Line":2}},{"line":224,"address":[12377366],"length":1,"stats":{"Line":1}},{"line":225,"address":[12377401],"length":1,"stats":{"Line":1}},{"line":226,"address":[12377416],"length":1,"stats":{"Line":1}},{"line":228,"address":[12377443],"length":1,"stats":{"Line":0}},{"line":229,"address":[12377458],"length":1,"stats":{"Line":0}},{"line":233,"address":[10367938],"length":1,"stats":{"Line":1}},{"line":236,"address":[12377533,12377488],"length":1,"stats":{"Line":2}},{"line":238,"address":[12377227,12377283],"length":1,"stats":{"Line":1}},{"line":239,"address":[12377290],"length":1,"stats":{"Line":1}},{"line":241,"address":[10368055],"length":1,"stats":{"Line":0}},{"line":247,"address":[12378215,12377632],"length":1,"stats":{"Line":0}},{"line":253,"address":[12377709],"length":1,"stats":{"Line":0}},{"line":256,"address":[12378240,12378263,12378350],"length":1,"stats":{"Line":0}},{"line":259,"address":[12377860,12377784],"length":1,"stats":{"Line":0}},{"line":262,"address":[12378368,12378403],"length":1,"stats":{"Line":0}},{"line":266,"address":[12377955],"length":1,"stats":{"Line":0}}],"covered":67,"coverable":95},{"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 accounts = fm.read_json_into_accounts_vec(path);\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 accounts = fm.read_json_into_accounts_vec(path);\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":[10369184,10369554],"length":1,"stats":{"Line":1}},{"line":29,"address":[11713123,11713488,11713509],"length":1,"stats":{"Line":3}},{"line":30,"address":[11713142],"length":1,"stats":{"Line":1}},{"line":31,"address":[11713195,11713262],"length":1,"stats":{"Line":2}},{"line":36,"address":[11714235,11713536],"length":1,"stats":{"Line":1}},{"line":37,"address":[11713582],"length":1,"stats":{"Line":1}},{"line":38,"address":[11713734],"length":1,"stats":{"Line":1}},{"line":40,"address":[11713901],"length":1,"stats":{"Line":1}},{"line":41,"address":[11713995],"length":1,"stats":{"Line":1}},{"line":42,"address":[11714066],"length":1,"stats":{"Line":1}},{"line":56,"address":[10370288],"length":1,"stats":{"Line":1}},{"line":60,"address":[11714816,11714837,11714323],"length":1,"stats":{"Line":3}},{"line":62,"address":[11714405,11714928,11714949],"length":1,"stats":{"Line":3}},{"line":64,"address":[11714498],"length":1,"stats":{"Line":1}},{"line":67,"address":[11714614],"length":1,"stats":{"Line":1}},{"line":69,"address":[11714681],"length":1,"stats":{"Line":1}},{"line":73,"address":[11715813,11715842,11715040],"length":1,"stats":{"Line":1}},{"line":75,"address":[11715083,11715851],"length":1,"stats":{"Line":1}},{"line":76,"address":[11715739],"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    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 accounts = fm.read_json_into_accounts_vec(path);\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":[9322416,9323087,9323119],"length":1,"stats":{"Line":1}},{"line":40,"address":[],"length":0,"stats":{"Line":1}},{"line":41,"address":[9322601],"length":1,"stats":{"Line":1}},{"line":42,"address":[9322624],"length":1,"stats":{"Line":1}},{"line":43,"address":[8878878],"length":1,"stats":{"Line":1}},{"line":44,"address":[],"length":0,"stats":{"Line":3}},{"line":45,"address":[],"length":0,"stats":{"Line":1}},{"line":46,"address":[9323288],"length":1,"stats":{"Line":1}},{"line":49,"address":[],"length":0,"stats":{"Line":1}},{"line":50,"address":[10908210],"length":1,"stats":{"Line":1}},{"line":54,"address":[10908285],"length":1,"stats":{"Line":1}},{"line":55,"address":[8879980],"length":1,"stats":{"Line":1}},{"line":56,"address":[9323793],"length":1,"stats":{"Line":1}},{"line":57,"address":[],"length":0,"stats":{"Line":1}},{"line":59,"address":[],"length":0,"stats":{"Line":1}},{"line":61,"address":[8879066],"length":1,"stats":{"Line":1}},{"line":66,"address":[10908720],"length":1,"stats":{"Line":1}},{"line":70,"address":[10908764],"length":1,"stats":{"Line":1}},{"line":72,"address":[9324095],"length":1,"stats":{"Line":1}},{"line":73,"address":[10908823],"length":1,"stats":{"Line":1}},{"line":78,"address":[10908976],"length":1,"stats":{"Line":1}},{"line":84,"address":[10908992],"length":1,"stats":{"Line":1}},{"line":85,"address":[10909027],"length":1,"stats":{"Line":1}},{"line":86,"address":[10909074],"length":1,"stats":{"Line":1}},{"line":87,"address":[10909122],"length":1,"stats":{"Line":1}},{"line":92,"address":[10106672,10107289],"length":1,"stats":{"Line":0}},{"line":94,"address":[10107311,10107254,10106714],"length":1,"stats":{"Line":0}},{"line":100,"address":[10909152,10909644],"length":1,"stats":{"Line":0}},{"line":101,"address":[9324491],"length":1,"stats":{"Line":0}},{"line":102,"address":[9324506],"length":1,"stats":{"Line":0}},{"line":103,"address":[10909315],"length":1,"stats":{"Line":0}},{"line":104,"address":[10909425],"length":1,"stats":{"Line":0}},{"line":119,"address":[10909680],"length":1,"stats":{"Line":1}},{"line":120,"address":[9324968],"length":1,"stats":{"Line":1}},{"line":124,"address":[10909760],"length":1,"stats":{"Line":1}},{"line":125,"address":[10909779],"length":1,"stats":{"Line":1}},{"line":126,"address":[9325077],"length":1,"stats":{"Line":1}},{"line":131,"address":[10909824,10910893],"length":1,"stats":{"Line":1}},{"line":135,"address":[9325140],"length":1,"stats":{"Line":1}},{"line":137,"address":[10909898,10910073],"length":1,"stats":{"Line":2}},{"line":138,"address":[9325357,9325458],"length":1,"stats":{"Line":1}},{"line":139,"address":[10910216,10910602,10910177],"length":1,"stats":{"Line":2}},{"line":140,"address":[10910314,10910411],"length":1,"stats":{"Line":2}},{"line":141,"address":[9325680,9325767],"length":1,"stats":{"Line":2}},{"line":142,"address":[10910828],"length":1,"stats":{"Line":1}},{"line":144,"address":[9325911,9325775],"length":1,"stats":{"Line":2}},{"line":150,"address":[10911318,10910928],"length":1,"stats":{"Line":1}},{"line":154,"address":[10911000],"length":1,"stats":{"Line":1}},{"line":156,"address":[9326581,9326560],"length":1,"stats":{"Line":2}},{"line":159,"address":[10911086],"length":1,"stats":{"Line":1}},{"line":161,"address":[9326359],"length":1,"stats":{"Line":1}},{"line":163,"address":[10911206],"length":1,"stats":{"Line":1}},{"line":165,"address":[9326481],"length":1,"stats":{"Line":1}},{"line":169,"address":[10912486,10912539,10911408],"length":1,"stats":{"Line":1}},{"line":175,"address":[10911451,10911801,10911649],"length":1,"stats":{"Line":2}},{"line":177,"address":[10911826,10911683],"length":1,"stats":{"Line":2}},{"line":178,"address":[9327038],"length":1,"stats":{"Line":1}},{"line":179,"address":[10911899,10913034,10913002,10912576],"length":1,"stats":{"Line":2}},{"line":180,"address":[9328181,9327739,9328160],"length":1,"stats":{"Line":3}},{"line":181,"address":[10912634],"length":1,"stats":{"Line":1}},{"line":182,"address":[10912684],"length":1,"stats":{"Line":1}},{"line":183,"address":[10912752],"length":1,"stats":{"Line":1}},{"line":184,"address":[10912963],"length":1,"stats":{"Line":1}},{"line":186,"address":[10912016],"length":1,"stats":{"Line":1}},{"line":188,"address":[10913139,10913104],"length":1,"stats":{"Line":2}},{"line":191,"address":[10912223,10912140],"length":1,"stats":{"Line":2}},{"line":192,"address":[10912269],"length":1,"stats":{"Line":1}},{"line":193,"address":[10912341],"length":1,"stats":{"Line":1}}],"covered":61,"coverable":68},{"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 accounts = fm.read_json_into_accounts_vec(path);\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 accounts = fm.read_json_into_accounts_vec(path);\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":[10371840],"length":1,"stats":{"Line":1}},{"line":34,"address":[12378555,12378479],"length":1,"stats":{"Line":2}},{"line":36,"address":[12378646,12378570,12378730],"length":1,"stats":{"Line":3}},{"line":41,"address":[12379412,12379586,12378752],"length":1,"stats":{"Line":1}},{"line":45,"address":[12378804],"length":1,"stats":{"Line":1}},{"line":47,"address":[12378845,12378913,12379067],"length":1,"stats":{"Line":3}},{"line":49,"address":[10372468,10372780,10372883],"length":1,"stats":{"Line":3}},{"line":52,"address":[12379554],"length":1,"stats":{"Line":1}},{"line":55,"address":[12379030,12379122],"length":1,"stats":{"Line":2}},{"line":57,"address":[12379632,12379667],"length":1,"stats":{"Line":2}},{"line":61,"address":[10372576,10372656],"length":1,"stats":{"Line":2}},{"line":64,"address":[12379319],"length":1,"stats":{"Line":1}},{"line":68,"address":[10378710,10373024,10377273],"length":1,"stats":{"Line":1}},{"line":69,"address":[12379750],"length":1,"stats":{"Line":1}},{"line":70,"address":[12379912],"length":1,"stats":{"Line":1}},{"line":73,"address":[12379980],"length":1,"stats":{"Line":1}},{"line":74,"address":[12380053,12380153],"length":1,"stats":{"Line":2}},{"line":76,"address":[12380172],"length":1,"stats":{"Line":1}},{"line":78,"address":[12380195],"length":1,"stats":{"Line":1}},{"line":79,"address":[12380230],"length":1,"stats":{"Line":1}},{"line":81,"address":[12380303],"length":1,"stats":{"Line":1}},{"line":83,"address":[12381162,12381489,12381292,12381565,12380547,12380963],"length":1,"stats":{"Line":5}},{"line":85,"address":[12381365],"length":1,"stats":{"Line":1}},{"line":87,"address":[12381878],"length":1,"stats":{"Line":1}},{"line":88,"address":[12381913],"length":1,"stats":{"Line":1}},{"line":89,"address":[12381967,12382196],"length":1,"stats":{"Line":2}},{"line":90,"address":[12382247],"length":1,"stats":{"Line":1}},{"line":91,"address":[12382284],"length":1,"stats":{"Line":1}},{"line":92,"address":[12382344],"length":1,"stats":{"Line":0}},{"line":93,"address":[12383224,12383025,12383544,12383354,12382609,12383480,12383735],"length":1,"stats":{"Line":0}},{"line":94,"address":[12383985,12383419],"length":1,"stats":{"Line":0}},{"line":98,"address":[12381989],"length":1,"stats":{"Line":0}},{"line":99,"address":[12384906,12384970,12384490,12385161,12384095,12384677,12384789],"length":1,"stats":{"Line":0}},{"line":100,"address":[12384845,12385411],"length":1,"stats":{"Line":0}},{"line":106,"address":[12389888,12388189,12385504],"length":1,"stats":{"Line":1}},{"line":111,"address":[12385583],"length":1,"stats":{"Line":1}},{"line":112,"address":[12385700,12385930,12385632],"length":1,"stats":{"Line":3}},{"line":114,"address":[12389716,12385954],"length":1,"stats":{"Line":2}},{"line":116,"address":[12389724,12389864],"length":1,"stats":{"Line":2}},{"line":119,"address":[12385841],"length":1,"stats":{"Line":1}},{"line":121,"address":[12386000,12385895],"length":1,"stats":{"Line":2}},{"line":122,"address":[12386008],"length":1,"stats":{"Line":1}},{"line":124,"address":[12386083],"length":1,"stats":{"Line":1}},{"line":125,"address":[10379346],"length":1,"stats":{"Line":1}},{"line":126,"address":[10379625,10379408],"length":1,"stats":{"Line":2}},{"line":127,"address":[10379672],"length":1,"stats":{"Line":1}},{"line":128,"address":[12386489],"length":1,"stats":{"Line":1}},{"line":129,"address":[10379767],"length":1,"stats":{"Line":0}},{"line":130,"address":[12386761,12387638,12387376,12387506,12387714,12387177,12387908],"length":1,"stats":{"Line":0}},{"line":131,"address":[12388161,12387571],"length":1,"stats":{"Line":0}},{"line":135,"address":[12386194],"length":1,"stats":{"Line":0}},{"line":136,"address":[12388974,12388862,12388675,12389346,12389091,12389155,12388271],"length":1,"stats":{"Line":0}},{"line":137,"address":[10382804,10382242],"length":1,"stats":{"Line":0}},{"line":143,"address":[12389920,12395868,12394397],"length":1,"stats":{"Line":0}},{"line":146,"address":[10383174],"length":1,"stats":{"Line":0}},{"line":147,"address":[12390144],"length":1,"stats":{"Line":0}},{"line":150,"address":[10383404],"length":1,"stats":{"Line":0}},{"line":151,"address":[12390285,12390385],"length":1,"stats":{"Line":0}},{"line":153,"address":[10383592],"length":1,"stats":{"Line":0}},{"line":155,"address":[12390427],"length":1,"stats":{"Line":0}},{"line":157,"address":[12390508],"length":1,"stats":{"Line":0}},{"line":159,"address":[12391494,12391364,12390749,12391165,12391619,12391695],"length":1,"stats":{"Line":0}},{"line":161,"address":[12392024,12391559],"length":1,"stats":{"Line":0}},{"line":162,"address":[12392032],"length":1,"stats":{"Line":0}},{"line":164,"address":[12392115],"length":1,"stats":{"Line":0}},{"line":165,"address":[12392150],"length":1,"stats":{"Line":0}},{"line":166,"address":[10385601,10385368],"length":1,"stats":{"Line":0}},{"line":167,"address":[12392484],"length":1,"stats":{"Line":0}},{"line":168,"address":[10385665],"length":1,"stats":{"Line":0}},{"line":169,"address":[12392747],"length":1,"stats":{"Line":0}},{"line":170,"address":[12393409,12393738,12393864,12393928,12392993,12393608,12394119],"length":1,"stats":{"Line":0}},{"line":171,"address":[12394369,12393803],"length":1,"stats":{"Line":0}},{"line":175,"address":[12392226],"length":1,"stats":{"Line":0}},{"line":176,"address":[12395354,12395061,12394874,12395173,12395290,12394479,12395545],"length":1,"stats":{"Line":0}},{"line":177,"address":[12395229,12395795],"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":[11928741,11928712,11928144],"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 accounts = fm.read_json_into_accounts_vec(path);\n\n        let account = accounts.get(0).unwrap();\n        let node = MerkleSumNode::new_from_account(account);\n        assert_eq!(node.sum_equity, F::from_canonical_u64(133876586));\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 accounts = fm.read_json_into_accounts_vec(path);\n\n        let account1 = accounts.get(0).unwrap();\n        let node1 = MerkleSumNode::new_from_account(account1);\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(138512215) + F::from_canonical_u64(133876586)\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 accounts = fm.read_json_into_accounts_vec(path);\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":[12395904],"length":1,"stats":{"Line":1}},{"line":21,"address":[12396160,12395936,12396128],"length":1,"stats":{"Line":3}},{"line":23,"address":[12395989,12396176,12396208],"length":1,"stats":{"Line":3}},{"line":25,"address":[12396042],"length":1,"stats":{"Line":1}},{"line":30,"address":[10814880],"length":1,"stats":{"Line":1}},{"line":31,"address":[12396257],"length":1,"stats":{"Line":1}},{"line":32,"address":[12396277],"length":1,"stats":{"Line":1}},{"line":33,"address":[12396305],"length":1,"stats":{"Line":1}},{"line":46,"address":[12396400,12397795],"length":1,"stats":{"Line":1}},{"line":47,"address":[12396466],"length":1,"stats":{"Line":1}},{"line":48,"address":[12396474],"length":1,"stats":{"Line":1}},{"line":49,"address":[12396496],"length":1,"stats":{"Line":1}},{"line":51,"address":[12396518,12396642,12396928],"length":1,"stats":{"Line":3}},{"line":52,"address":[12396949],"length":1,"stats":{"Line":1}},{"line":53,"address":[10816359,10815657],"length":1,"stats":{"Line":2}},{"line":54,"address":[12397744],"length":1,"stats":{"Line":1}},{"line":56,"address":[12396967,12397030,12397115],"length":1,"stats":{"Line":2}},{"line":57,"address":[12397097,12397266,12397141],"length":1,"stats":{"Line":2}},{"line":58,"address":[10815945,10815892,10816037],"length":1,"stats":{"Line":3}},{"line":59,"address":[12397406,12397551],"length":1,"stats":{"Line":2}},{"line":60,"address":[12397559],"length":1,"stats":{"Line":1}},{"line":61,"address":[12397578],"length":1,"stats":{"Line":1}},{"line":68,"address":[12397824],"length":1,"stats":{"Line":1}},{"line":69,"address":[12397928,12397856],"length":1,"stats":{"Line":2}},{"line":72,"address":[12397952],"length":1,"stats":{"Line":0}},{"line":73,"address":[12397970],"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::Value;\nuse std::{\n    collections::BTreeMap,\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 num_of_tokens: usize,\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) -\u003e Vec\u003cAccount\u003e;\n    fn read_json_file_into_map(\u0026self, path: \u0026str) -\u003e Vec\u003cBTreeMap\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    fn read_json_into_accounts_vec(\u0026self, path: \u0026str) -\u003e Vec\u003cAccount\u003e {\n        let parsed_data = self.read_json_file_into_map(path);\n        parse_exchange_state(\u0026parsed_data)\n    }\n\n    /// Reads a json file into a json string.\n    fn read_json_file_into_map(\u0026self, path: \u0026str) -\u003e Vec\u003cBTreeMap\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());\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 =\n                        fm.read_json_into_accounts_vec(parser.docs[doc_len - 1].to_str().unwrap());\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\n        let mut result = vec![Account::get_empty_account(self.cfg.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 =\n                        fm.read_json_into_accounts_vec(self.docs[self.file_idx].to_str().unwrap());\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(parsed_data: \u0026Vec\u003cBTreeMap\u003cString, Value\u003e\u003e) -\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));\n    }\n    accounts_data\n}\n\n/// Parses the exchanges state at some snapshot and returns.\npub fn parse_account_state(parsed_data: \u0026BTreeMap\u003cString, Value\u003e) -\u003e Account {\n    let mut account_id = \"\";\n    let mut inner_vec: Vec\u003cF\u003e = Vec::new();\n    for (key, value) in parsed_data.iter() {\n        if key != \"id\" {\n            if let Some(number_str) = value.as_str() {\n                match number_str.parse::\u003cu64\u003e() {\n                    Ok(number) =\u003e inner_vec.push(F::from_canonical_u64(number)),\n                    Err(e) =\u003e {\n                        error!(\"Error in parsing token value number: {:?}\", e);\n                        panic!(\"Error in parsing token value number: {:?}\", e);\n                    }\n                }\n            } else {\n                error!(\"Error in parsing string from json: {:?}\", value);\n                panic!(\"Error in parsing string from json: {:?}\", value);\n            }\n        } else {\n            account_id = value.as_str().unwrap();\n        }\n    }\n    // todo:: currently, we fill debt all to zero\n    let asset_len = inner_vec.len();\n    Account { id: account_id.into(), equity: inner_vec, debt: vec![F::ZERO; asset_len] }\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::Value;\n    use std::{\n        collections::BTreeMap,\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 = \"320b5ea99e653bc2b593db4130d10a4efd3a0b4cc2e1a6672b678d71dfbd33ad\";\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 = \"47db1d296a7c146eab653591583a9a4873c626d8de47ae11393edd153e40f1ed\";\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 accounts = parse_exchange_state(\u0026maps);\n\n        let id_0 = \"320b5ea99e653bc2b593db4130d10a4efd3a0b4cc2e1a6672b678d71dfbd33ad\";\n        let account_0 = accounts.get(0).unwrap();\n        assert_eq!(id_0, account_0.id);\n\n        let id_1 = \"47db1d296a7c146eab653591583a9a4873c626d8de47ae11393edd153e40f1ed\";\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 accounts = fm.read_json_into_accounts_vec(\u0026path);\n\n        let id_0 = \"320b5ea99e653bc2b593db4130d10a4efd3a0b4cc2e1a6672b678d71dfbd33ad\";\n        let account_0 = accounts.get(0).unwrap();\n        assert_eq!(id_0, account_0.id);\n\n        let id_1 = \"47db1d296a7c146eab653591583a9a4873c626d8de47ae11393edd153e40f1ed\";\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) -\u003e Vec\u003cAccount\u003e;\n          fn read_json_file_into_map(\u0026self, path: \u0026str) -\u003e Vec\u003cBTreeMap\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, num_of_tokens: 20 },\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":42,"address":[12399847,12398000,12399812],"length":1,"stats":{"Line":0}},{"line":43,"address":[10389095],"length":1,"stats":{"Line":0}},{"line":44,"address":[12398112,12398181],"length":1,"stats":{"Line":0}},{"line":45,"address":[12398238,12398510,12398543,12399845],"length":1,"stats":{"Line":0}},{"line":46,"address":[12398912,12398591,12399821,12398752],"length":1,"stats":{"Line":0}},{"line":47,"address":[10389862,10389974],"length":1,"stats":{"Line":0}},{"line":48,"address":[12399009,12399074],"length":1,"stats":{"Line":0}},{"line":49,"address":[12399132,12399514],"length":1,"stats":{"Line":0}},{"line":50,"address":[12399626],"length":1,"stats":{"Line":0}},{"line":51,"address":[12399669],"length":1,"stats":{"Line":0}},{"line":54,"address":[12399107,12399162],"length":1,"stats":{"Line":0}},{"line":55,"address":[12399214],"length":1,"stats":{"Line":0}},{"line":59,"address":[12398187,12398634],"length":1,"stats":{"Line":0}},{"line":60,"address":[12398653],"length":1,"stats":{"Line":0}},{"line":64,"address":[12399872,12399988],"length":1,"stats":{"Line":1}},{"line":65,"address":[12399900],"length":1,"stats":{"Line":1}},{"line":66,"address":[12399929],"length":1,"stats":{"Line":1}},{"line":70,"address":[10390944,10392683],"length":1,"stats":{"Line":1}},{"line":71,"address":[12400086],"length":1,"stats":{"Line":1}},{"line":72,"address":[12400100],"length":1,"stats":{"Line":1}},{"line":73,"address":[12400113],"length":1,"stats":{"Line":1}},{"line":74,"address":[10391055],"length":1,"stats":{"Line":1}},{"line":76,"address":[12400141],"length":1,"stats":{"Line":1}},{"line":78,"address":[12400217],"length":1,"stats":{"Line":0}},{"line":79,"address":[12401294,12401484,12401113,12400814,12400419,12401001,12401230],"length":1,"stats":{"Line":0}},{"line":80,"address":[12401733,12401169],"length":1,"stats":{"Line":0}},{"line":101,"address":[8697840,8702814,8703159],"length":1,"stats":{"Line":1}},{"line":102,"address":[10392897,10392778],"length":1,"stats":{"Line":2}},{"line":103,"address":[8698037],"length":1,"stats":{"Line":1}},{"line":104,"address":[8698235],"length":1,"stats":{"Line":0}},{"line":106,"address":[8698313,8698200],"length":1,"stats":{"Line":2}},{"line":108,"address":[8698329],"length":1,"stats":{"Line":1}},{"line":109,"address":[8698414],"length":1,"stats":{"Line":1}},{"line":113,"address":[8698490],"length":1,"stats":{"Line":1}},{"line":117,"address":[10393402],"length":1,"stats":{"Line":1}},{"line":120,"address":[8698840],"length":1,"stats":{"Line":1}},{"line":121,"address":[10393727],"length":1,"stats":{"Line":1}},{"line":122,"address":[8700028,8699696,8700239,8700433,8699280,8699895,8700160],"length":1,"stats":{"Line":6}},{"line":123,"address":[8700101,8700694],"length":1,"stats":{"Line":2}},{"line":124,"address":[8700702],"length":1,"stats":{"Line":1}},{"line":125,"address":[8700892],"length":1,"stats":{"Line":1}},{"line":126,"address":[8700900],"length":1,"stats":{"Line":1}},{"line":127,"address":[8702845],"length":1,"stats":{"Line":0}},{"line":129,"address":[8701270,8701063,8700906],"length":1,"stats":{"Line":3}},{"line":131,"address":[8701297,8701381],"length":1,"stats":{"Line":2}},{"line":133,"address":[10396212],"length":1,"stats":{"Line":1}},{"line":134,"address":[8701436],"length":1,"stats":{"Line":1}},{"line":136,"address":[8701403,8701636],"length":1,"stats":{"Line":2}},{"line":137,"address":[8701644],"length":1,"stats":{"Line":1}},{"line":138,"address":[8701834],"length":1,"stats":{"Line":1}},{"line":140,"address":[8701846,8702489],"length":1,"stats":{"Line":2}},{"line":141,"address":[10396983,10396714],"length":1,"stats":{"Line":2}},{"line":143,"address":[8702183,8702261],"length":1,"stats":{"Line":2}},{"line":144,"address":[8702299],"length":1,"stats":{"Line":1}},{"line":147,"address":[8702650,8701860,8702507],"length":1,"stats":{"Line":2}},{"line":150,"address":[10397427,10397491],"length":1,"stats":{"Line":2}},{"line":151,"address":[10397499],"length":1,"stats":{"Line":1}},{"line":152,"address":[10397507],"length":1,"stats":{"Line":1}},{"line":154,"address":[10393941,10397751],"length":1,"stats":{"Line":0}},{"line":157,"address":[10397531],"length":1,"stats":{"Line":1}},{"line":160,"address":[10397968],"length":1,"stats":{"Line":1}},{"line":161,"address":[10399101,10399293,10398438,10399005,10398655,10398711,10398909,10399197,10399476,10399386,10398751,10398107,10398586],"length":1,"stats":{"Line":13}},{"line":167,"address":[12403760],"length":1,"stats":{"Line":1}},{"line":168,"address":[10399941],"length":1,"stats":{"Line":1}},{"line":172,"address":[8723168,8729276],"length":1,"stats":{"Line":1}},{"line":178,"address":[8724066,8724407,8723876,8723358,8723710,8723957,8724112],"length":1,"stats":{"Line":7}},{"line":179,"address":[10400781],"length":1,"stats":{"Line":1}},{"line":182,"address":[10401580,10401509,10400794],"length":1,"stats":{"Line":2}},{"line":183,"address":[8724851,8724917,8724781],"length":1,"stats":{"Line":2}},{"line":184,"address":[8724905,8724933],"length":1,"stats":{"Line":1}},{"line":186,"address":[10401734,10401955],"length":1,"stats":{"Line":2}},{"line":189,"address":[8725097],"length":1,"stats":{"Line":1}},{"line":190,"address":[8725319,8729250,8725145,8725226],"length":1,"stats":{"Line":3}},{"line":192,"address":[8725447,8729048],"length":1,"stats":{"Line":0}},{"line":193,"address":[10405973,10405923],"length":1,"stats":{"Line":0}},{"line":195,"address":[8725389],"length":1,"stats":{"Line":1}},{"line":197,"address":[10402248,10402164],"length":1,"stats":{"Line":2}},{"line":198,"address":[8725532,8725655],"length":1,"stats":{"Line":1}},{"line":199,"address":[10402467,10402364],"length":1,"stats":{"Line":2}},{"line":201,"address":[8725494,8725819,8726109],"length":1,"stats":{"Line":2}},{"line":202,"address":[10403916],"length":1,"stats":{"Line":1}},{"line":209,"address":[10403694,10405732],"length":1,"stats":{"Line":2}},{"line":210,"address":[10404619],"length":1,"stats":{"Line":1}},{"line":212,"address":[10404723],"length":1,"stats":{"Line":1}},{"line":214,"address":[8728115,8728246,8728289],"length":1,"stats":{"Line":2}},{"line":215,"address":[8728552,8728654],"length":1,"stats":{"Line":2}},{"line":216,"address":[10405044,10405329,10404979,10405259],"length":1,"stats":{"Line":3}},{"line":217,"address":[10405408,10405596],"length":1,"stats":{"Line":2}},{"line":218,"address":[10405544],"length":1,"stats":{"Line":1}},{"line":219,"address":[10405698,10405618],"length":1,"stats":{"Line":1}},{"line":220,"address":[8728947],"length":1,"stats":{"Line":1}},{"line":222,"address":[8728209,8728161,8728080],"length":1,"stats":{"Line":0}},{"line":225,"address":[8729006,8729019,8728954],"length":1,"stats":{"Line":2}},{"line":228,"address":[10404568],"length":1,"stats":{"Line":1}},{"line":233,"address":[10406016,10406277],"length":1,"stats":{"Line":1}},{"line":234,"address":[12403806],"length":1,"stats":{"Line":1}},{"line":235,"address":[12403897,12403825,12404006],"length":1,"stats":{"Line":3}},{"line":236,"address":[12404019],"length":1,"stats":{"Line":1}},{"line":238,"address":[12403972],"length":1,"stats":{"Line":1}},{"line":242,"address":[12404096,12404816,12408686],"length":1,"stats":{"Line":1}},{"line":243,"address":[12404135],"length":1,"stats":{"Line":1}},{"line":244,"address":[12404167],"length":1,"stats":{"Line":1}},{"line":245,"address":[12404200,12404260,12404436],"length":1,"stats":{"Line":3}},{"line":246,"address":[12404854,12405086,12404468],"length":1,"stats":{"Line":3}},{"line":247,"address":[12405107,12404895],"length":1,"stats":{"Line":2}},{"line":248,"address":[12405356,12405184],"length":1,"stats":{"Line":2}},{"line":249,"address":[10407578,10407831],"length":1,"stats":{"Line":2}},{"line":250,"address":[12405458],"length":1,"stats":{"Line":0}},{"line":251,"address":[12406615,12406273,12406403,12406679,12406870,12405658,12406074],"length":1,"stats":{"Line":0}},{"line":252,"address":[12407120],"length":1,"stats":{"Line":0}},{"line":256,"address":[10410553,10409405,10409987,10409800,10410099,10410302,10410366],"length":1,"stats":{"Line":0}},{"line":257,"address":[12408607],"length":1,"stats":{"Line":0}},{"line":260,"address":[12405070,12404860],"length":1,"stats":{"Line":2}},{"line":264,"address":[12404512,12404409],"length":1,"stats":{"Line":2}},{"line":265,"address":[12404520,12404825],"length":1,"stats":{"Line":1}},{"line":273,"address":[12408720],"length":1,"stats":{"Line":0}},{"line":279,"address":[12408752],"length":1,"stats":{"Line":0}},{"line":280,"address":[12408757],"length":1,"stats":{"Line":0}}],"covered":87,"coverable":118},{"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":[8688880,8691417,8692878],"length":1,"stats":{"Line":0}},{"line":41,"address":[8688935],"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":[8689313],"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":[8690752,8690004,8690948,8690619,8690420,8690881,8691139],"length":1,"stats":{"Line":0}},{"line":56,"address":[],"length":0,"stats":{"Line":0}},{"line":60,"address":[8689424],"length":1,"stats":{"Line":0}},{"line":61,"address":[],"length":0,"stats":{"Line":0}},{"line":62,"address":[],"length":0,"stats":{"Line":0}},{"line":68,"address":[12408768,12409003],"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    /// 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":[9116288],"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":39,"address":[9116576,9116362],"length":1,"stats":{"Line":0}},{"line":40,"address":[],"length":0,"stats":{"Line":0}},{"line":41,"address":[],"length":0,"stats":{"Line":0}},{"line":45,"address":[],"length":0,"stats":{"Line":0}},{"line":46,"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":54,"address":[],"length":0,"stats":{"Line":0}},{"line":58,"address":[9115984,9116143],"length":1,"stats":{"Line":0}},{"line":66,"address":[],"length":0,"stats":{"Line":0}},{"line":68,"address":[],"length":0,"stats":{"Line":0}},{"line":69,"address":[],"length":0,"stats":{"Line":0}},{"line":76,"address":[9117568,9118439],"length":1,"stats":{"Line":0}},{"line":89,"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":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":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":108,"address":[],"length":0,"stats":{"Line":0}},{"line":119,"address":[9117136,9117517],"length":1,"stats":{"Line":0}},{"line":131,"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":137,"address":[],"length":0,"stats":{"Line":0}},{"line":138,"address":[],"length":0,"stats":{"Line":0}},{"line":139,"address":[],"length":0,"stats":{"Line":0}}],"covered":0,"coverable":40},{"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":[8808528],"length":1,"stats":{"Line":1}},{"line":6,"address":[12170248],"length":1,"stats":{"Line":1}},{"line":7,"address":[12170259],"length":1,"stats":{"Line":0}},{"line":9,"address":[12170322,12170299,12170271],"length":1,"stats":{"Line":2}},{"line":10,"address":[12170425,12170314,12170348],"length":1,"stats":{"Line":3}},{"line":11,"address":[12170343],"length":1,"stats":{"Line":1}},{"line":13,"address":[12170430,12170360],"length":1,"stats":{"Line":1}},{"line":19,"address":[12170448],"length":1,"stats":{"Line":1}},{"line":20,"address":[12170565,12170470],"length":1,"stats":{"Line":1}},{"line":21,"address":[12170544,12170724,12170585],"length":1,"stats":{"Line":2}},{"line":25,"address":[12170752,12171307],"length":1,"stats":{"Line":1}},{"line":26,"address":[12171344,12171357,12170858,12170782],"length":1,"stats":{"Line":4}},{"line":28,"address":[12170906,12170974],"length":1,"stats":{"Line":2}},{"line":30,"address":[12171427,12171595,12171408],"length":1,"stats":{"Line":3}},{"line":33,"address":[12171122,12171057],"length":1,"stats":{"Line":2}},{"line":34,"address":[12171260,12171186],"length":1,"stats":{"Line":0}},{"line":37,"address":[12171133],"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":[10333846,10334486,10333888,10333248],"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":[10333567,10334207],"length":1,"stats":{"Line":0}},{"line":26,"address":[12335852,12335212],"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":[12336597,12337269,12337241,12336640,12336569,12335968],"length":1,"stats":{"Line":2}},{"line":43,"address":[],"length":0,"stats":{"Line":4}},{"line":44,"address":[],"length":0,"stats":{"Line":8}},{"line":45,"address":[12337490,12337756,12337578,12337354],"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":[12334568,12332643,12332672,12330784],"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":[12331052,12332972],"length":1,"stats":{"Line":0}},{"line":59,"address":[12334314,12333922,12331302,12331697,12333617,12332390,12333804,12332200,12332002,12333222,12334056,12334123,12332133,12331884],"length":1,"stats":{"Line":0}},{"line":60,"address":[788267],"length":1,"stats":{"Line":0}},{"line":65,"address":[],"length":0,"stats":{"Line":1}},{"line":66,"address":[788879,788964],"length":1,"stats":{"Line":2}},{"line":67,"address":[788976],"length":1,"stats":{"Line":1}},{"line":68,"address":[],"length":0,"stats":{"Line":0}},{"line":69,"address":[789668,790327,789855,790141,789967,789042,790077,789225],"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":[12587920,12589919,12591240],"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":[12588123],"length":1,"stats":{"Line":1}},{"line":25,"address":[4460603],"length":1,"stats":{"Line":1}},{"line":27,"address":[13905291],"length":1,"stats":{"Line":1}},{"line":28,"address":[4460690,4460747],"length":1,"stats":{"Line":2}},{"line":29,"address":[12588418],"length":1,"stats":{"Line":1}},{"line":30,"address":[13905809],"length":1,"stats":{"Line":1}},{"line":32,"address":[4461221],"length":1,"stats":{"Line":1}},{"line":33,"address":[4461362],"length":1,"stats":{"Line":1}},{"line":34,"address":[4461623,4461471,4461822,4461552],"length":1,"stats":{"Line":4}},{"line":36,"address":[4461559],"length":1,"stats":{"Line":1}},{"line":39,"address":[13908220,13906418,13906605],"length":1,"stats":{"Line":2}},{"line":40,"address":[4462935,4461881],"length":1,"stats":{"Line":1}},{"line":41,"address":[13907158],"length":1,"stats":{"Line":0}},{"line":43,"address":[4462502],"length":1,"stats":{"Line":0}},{"line":44,"address":[13907411],"length":1,"stats":{"Line":0}},{"line":45,"address":[4462754,4463298,4462958],"length":1,"stats":{"Line":0}},{"line":47,"address":[4462948,4462818,4462645],"length":1,"stats":{"Line":0}},{"line":49,"address":[4461889,4462594,4462919,4463326],"length":1,"stats":{"Line":1}},{"line":50,"address":[4461977,4462173],"length":1,"stats":{"Line":1}},{"line":52,"address":[4461922,4462082],"length":1,"stats":{"Line":0}},{"line":55,"address":[4462089],"length":1,"stats":{"Line":1}}],"covered":19,"coverable":25},{"path":["/","home","runner","work","proof-of-reserves-v2","proof-of-reserves-v2","crates","zk-por-tracing","src","opentelemetry","exporter","stdout.rs"],"content":"//! # Stdout Span Exporter\n//!\n//! The stdout [`SpanExporter`] writes debug printed [`Span`]s to its configured\n//! [`Write`] instance. By default it will write to [`Stdout`].\n//!\n//! [`SpanExporter`]: super::SpanExporter\n//! [`Span`]: crate::trace::Span\n//! [`Write`]: Write\n//! [`Stdout`]: Stdout\n//!\n//! # Examples\n//!\n//! ```no_run\n//! use opentelemetry::trace::Tracer;\n//! use opentelemetry::sdk::export::trace::stdout;\n//! use opentelemetry::global::shutdown_tracer_provider;\n//!\n//! fn main() {\n//!     let tracer = stdout::new_pipeline()\n//!         .with_pretty_print(true)\n//!         .install_simple();\n//!\n//!     tracer.in_span(\"doing_work\", |cx| {\n//!         // Traced app logic here...\n//!     });\n//!\n//!     shutdown_tracer_provider(); // sending remaining spans\n//! }\n//! ```\n#![allow(clippy::needless_doctest_main)]\nuse async_trait::async_trait;\nuse opentelemetry::{\n    global, sdk,\n    sdk::export::{\n        trace::{ExportResult, SpanData, SpanExporter},\n        ExportError,\n    },\n    trace::TracerProvider,\n};\nuse std::{\n    fmt::Debug,\n    io::{stdout, Stdout, Write},\n};\n\n/// Pipeline builder\n#[derive(Debug)]\npub struct PipelineBuilder\u003cW: Write\u003e {\n    pretty_print: bool,\n    trace_config: Option\u003csdk::trace::Config\u003e,\n    writer: W,\n}\n\n/// Create a new stdout exporter pipeline builder.\npub fn new_pipeline() -\u003e PipelineBuilder\u003cStdout\u003e {\n    PipelineBuilder::default()\n}\n\nimpl Default for PipelineBuilder\u003cStdout\u003e {\n    /// Return the default pipeline builder.\n    fn default() -\u003e Self {\n        Self { pretty_print: false, trace_config: None, writer: stdout() }\n    }\n}\n\nimpl\u003cW: Write\u003e PipelineBuilder\u003cW\u003e {\n    /// Specify the pretty print setting.\n    pub fn with_pretty_print(mut self, pretty_print: bool) -\u003e Self {\n        self.pretty_print = pretty_print;\n        self\n    }\n\n    /// Assign the SDK trace configuration.\n    pub fn with_trace_config(mut self, config: sdk::trace::Config) -\u003e Self {\n        self.trace_config = Some(config);\n        self\n    }\n\n    /// Specify the writer to use.\n    pub fn with_writer\u003cT: Write\u003e(self, writer: T) -\u003e PipelineBuilder\u003cT\u003e {\n        PipelineBuilder { pretty_print: self.pretty_print, trace_config: self.trace_config, writer }\n    }\n}\n\nimpl\u003cW\u003e PipelineBuilder\u003cW\u003e\nwhere\n    W: Write + Debug + Send + 'static,\n{\n    /// Install the stdout exporter pipeline with the recommended defaults.\n    pub fn install_simple(mut self) -\u003e sdk::trace::Tracer {\n        let exporter = Exporter::new(self.writer, self.pretty_print);\n\n        let mut provider_builder =\n            sdk::trace::TracerProvider::builder().with_simple_exporter(exporter);\n        if let Some(config) = self.trace_config.take() {\n            provider_builder = provider_builder.with_config(config);\n        }\n        let provider = provider_builder.build();\n\n        let tracer =\n            provider.versioned_tracer(\"opentelemetry\", Some(env!(\"CARGO_PKG_VERSION\")), None);\n        let _ = global::set_tracer_provider(provider);\n\n        tracer\n    }\n}\n\n/// A [`SpanExporter`] that writes to [`Stdout`] or other configured [`Write`].\n///\n/// [`SpanExporter`]: super::SpanExporter\n/// [`Write`]: Write\n/// [`Stdout`]: Stdout\n#[derive(Debug)]\npub struct Exporter\u003cW: Write\u003e {\n    writer: W,\n    pretty_print: bool,\n}\n\nimpl\u003cW: Write\u003e Exporter\u003cW\u003e {\n    /// Create a new stdout `Exporter`.\n    pub fn new(writer: W, pretty_print: bool) -\u003e Self {\n        Self { writer, pretty_print }\n    }\n}\n\n#[async_trait]\nimpl\u003cW\u003e SpanExporter for Exporter\u003cW\u003e\nwhere\n    W: Write + Debug + Send + 'static,\n{\n    /// Export spans to stdout\n    async fn export(\u0026mut self, batch: Vec\u003cSpanData\u003e) -\u003e ExportResult {\n        for span in batch {\n            let json = if self.pretty_print {\n                serde_json::to_string_pretty(\u0026span).map_err::\u003cError, _\u003e(Into::into)?\n            } else {\n                serde_json::to_string(\u0026span).map_err::\u003cError, _\u003e(Into::into)?\n            };\n            self.writer.write_all(json.as_bytes()).map_err::\u003cError, _\u003e(Into::into)?;\n            self.writer.write_all(\"\\n\".as_bytes()).map_err::\u003cError, _\u003e(Into::into)?;\n        }\n\n        Ok(())\n    }\n}\n\n/// Stdout exporter's error\n#[derive(thiserror::Error, Debug)]\n#[error(transparent)]\nenum Error {\n    Json(#[from] serde_json::Error),\n    Io(#[from] std::io::Error),\n}\n\nimpl ExportError for Error {\n    fn exporter_name(\u0026self) -\u003e \u0026'static str {\n        \"stdout\"\n    }\n}\n","traces":[{"line":54,"address":[12785120],"length":1,"stats":{"Line":1}},{"line":55,"address":[14102264],"length":1,"stats":{"Line":1}},{"line":60,"address":[4298160,4298279],"length":1,"stats":{"Line":1}},{"line":61,"address":[14102301],"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":[14102451],"length":1,"stats":{"Line":1}},{"line":89,"address":[4298432,4299686,4299754],"length":1,"stats":{"Line":1}},{"line":90,"address":[4298575,4298454],"length":1,"stats":{"Line":2}},{"line":92,"address":[14102772,14102715],"length":1,"stats":{"Line":2}},{"line":93,"address":[],"length":0,"stats":{"Line":0}},{"line":94,"address":[14102867,14102931,14103264],"length":1,"stats":{"Line":2}},{"line":95,"address":[4298904,4299090],"length":1,"stats":{"Line":0}},{"line":97,"address":[12786323,12786152],"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":[12786500,12786588],"length":1,"stats":{"Line":2}},{"line":103,"address":[14103764],"length":1,"stats":{"Line":1}},{"line":120,"address":[12786784],"length":1,"stats":{"Line":1}},{"line":131,"address":[],"length":0,"stats":{"Line":0}},{"line":132,"address":[],"length":0,"stats":{"Line":0}},{"line":133,"address":[14104962,14105682,14105385],"length":1,"stats":{"Line":0}},{"line":134,"address":[],"length":0,"stats":{"Line":0}},{"line":136,"address":[14105387,14105099,14105200,14105473],"length":1,"stats":{"Line":0}},{"line":138,"address":[14105957,14105453,14105807,14106279],"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
