logos-storage/rust-poseidon-bn254-pure
1
0
Fork 0
mirror of https://github.com/logos-storage/rust-poseidon-bn254-pure.git synced 2026-02-10 19:23:23 +00:00
Code Issues Packages Projects Releases Wiki Activity

fix an embarrassing thing (256-bit specific routines were "generic"...)

Browse Source
This commit is contained in:
Balazs Komuves 2026-01-29 21:42:43 +01:00
parent e596c5b16b
commit 0c4b1934f3
No known key found for this signature in database
GPG Key ID: F63B7AEF18435562
1 changed files with 67 additions and 63 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

130
src/bn254/bigint.rs
View File

@ -258,69 +258,6 @@ impl<const N: usize> BigInt<N> {
out
}
//------------------------------------
// specialize to the prime number
#[inline(always)]
#[unroll_for_loops]
pub fn is_lt_prime(big: BigInt<N>) -> bool {
let mut less: bool = false;
for i in (0..N).rev() {
if big.0[i] < PRIME_ARRAY[i] {
less = true;
break;
}
if big.0[i] > PRIME_ARRAY[i] {
break;
}
}
less
}
#[inline(always)]
pub fn is_ge_prime(big: BigInt<N>) -> bool {
!BigInt::is_lt_prime(big)
}
#[inline(always)]
#[unroll_for_loops]
pub fn add_prime(big: BigInt<N>) -> (BigInt<N>, bool) {
let mut c : bool = false;
let mut zs : [u32; N] = [0; N];
for i in 0..N {
let (z,cout) = addCarry32( big.0[i] , PRIME_ARRAY[i] , c );
zs[i] = z;
c = cout;
}
let big: BigInt<N> = BigInt(zs);
(big, c)
}
#[inline(always)]
#[unroll_for_loops]
pub fn subtract_prime(big: BigInt<N>) -> (BigInt<N>, bool) {
let mut c : bool = false;
let mut zs : [u32; N] = [0; N];
for i in 0..N {
let (z,cout) = subBorrow32( big.0[i] , PRIME_ARRAY[i] , c );
zs[i] = z;
c = cout;
}
let big: BigInt<N> = BigInt(zs);
(big, c)
}
#[inline(always)]
pub fn subtract_prime_if_necessary(big: BigInt<N>) -> BigInt<N> {
if BigInt::is_lt_prime(big) {
big
}
else {
let (corrected, _) = BigInt::subtract_prime(big);
corrected
}
}
//------------------------------------
// multiplication
@ -446,3 +383,70 @@ impl<const N: usize> BigInt<N> {
}
// -----------------------------------------------------------------------------
// routines specialized to the prime number
impl BigInt256 {
#[inline(always)]
#[unroll_for_loops]
pub fn is_lt_prime(big: BigInt256) -> bool {
let mut less: bool = false;
for i in (0..8).rev() {
if big.0[i] < PRIME_ARRAY[i] {
less = true;
break;
}
if big.0[i] > PRIME_ARRAY[i] {
break;
}
}
less
}
#[inline(always)]
pub fn is_ge_prime(big: BigInt256) -> bool {
!BigInt256::is_lt_prime(big)
}
#[inline(always)]
#[unroll_for_loops]
pub fn add_prime(big: BigInt256) -> (BigInt256, bool) {
let mut c : bool = false;
let mut zs : [u32; 8] = [0; 8];
for i in 0..8 {
let (z,cout) = addCarry32( big.0[i] , PRIME_ARRAY[i] , c );
zs[i] = z;
c = cout;
}
let big: BigInt256 = BigInt(zs);
(big, c)
}
#[inline(always)]
#[unroll_for_loops]
pub fn subtract_prime(big: BigInt256) -> (BigInt256, bool) {
let mut c : bool = false;
let mut zs : [u32; 8] = [0; 8];
for i in 0..8 {
let (z,cout) = subBorrow32( big.0[i] , PRIME_ARRAY[i] , c );
zs[i] = z;
c = cout;
}
let big: BigInt256 = BigInt(zs);
(big, c)
}
#[inline(always)]
pub fn subtract_prime_if_necessary(big: BigInt256) -> BigInt256 {
if BigInt256::is_lt_prime(big) {
big
}
else {
let (corrected, _) = BigInt256::subtract_prime(big);
corrected
}
}
}