You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: zk_prover/src/circuits/tests.rs
-98Lines changed: 0 additions & 98 deletions
Original file line number
Diff line number
Diff line change
@@ -463,104 +463,6 @@ mod test {
463
463
);
464
464
}
465
465
466
-
// // Adding a balance at the verge of overflowing should fail the range check for any following computed sum and, because we are adding a fake balance.
467
-
// // Furthermore, the public input check on the root hash and on root_balances[0] should fail too
// let merkle_proof = merkle_sum_tree.generate_proof(user_index).unwrap();
477
-
// let user_entry = merkle_sum_tree.get_entry(user_index);
478
-
479
-
// // Only now we can instantiate the circuit with the actual inputs
480
-
// let mut circuit = MstInclusionCircuit::<LEVELS, N_ASSETS, N_BYTES>::init(
481
-
// merkle_proof,
482
-
// user_entry.clone(),
483
-
// );
484
-
485
-
// let balance = BigUint::from(2u64).pow(N_BYTES as u32 * 8) - BigUint::from(1u64);
486
-
487
-
// circuit.path_element_balances[0][0] = big_uint_to_fp(&balance); // 2^64 - 1. It means that as soon as it is summed with the other balances, it will overflow
488
-
489
-
// let invalid_prover = MockProver::run(K, &circuit, circuit.instances()).unwrap();
0 commit comments