ProvableHQ/leo
1
1
Fork 0
mirror of https://github.com/ProvableHQ/leo.git synced 2024-12-18 07:11:53 +03:00
Code Issues Packages Projects Releases Wiki Activity

Update signed integer pow impl

Browse Source
This commit is contained in:
raychu86 2020-08-14 16:10:26 -07:00
parent 3cf8c481fb
commit ce4c2977a8
1 changed files with 1 additions and 17 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

18
gadgets/src/signed_integer/arithmetic/pow.rs
View File

@ -28,13 +28,6 @@ macro_rules! pow_int_impl {
// let mut found_one = false; // let mut found_one = false;
// //
// for i in BitIterator::new(exp) { // for i in BitIterator::new(exp) {
// if !found_one {
// if i {
// found_one = true;
// } else {
// continue;
// }
// }
// //
// res.square_in_place(); // res.square_in_place();
// //
@ -55,16 +48,7 @@ macro_rules! pow_int_impl {
)?; )?;
for (i, bit) in other.bits.iter().rev().enumerate() { for (i, bit) in other.bits.iter().rev().enumerate() {
let found_one = Boolean::constant(result.eq(&one_const)); result = result.mul(cs.ns(|| format!("square_{}", i)), &result).unwrap();
let cond1 = Boolean::and(cs.ns(|| format!("found_one_{}", i)), &bit.not(), &found_one)?;
let square = result.mul(cs.ns(|| format!("square_{}", i)), &result).unwrap();
result = Self::conditionally_select(
&mut cs.ns(|| format!("result_or_square_{}", i)),
&cond1,
&result,
&square,
)?;
let mul_by_self = result let mul_by_self = result
.mul(cs.ns(|| format!("multiply_by_self_{}", i)), &self); .mul(cs.ns(|| format!("multiply_by_self_{}", i)), &self);