smeb_y/ceremonyclient
1
0
Fork 0
mirror of https://source.quilibrium.com/quilibrium/ceremonyclient.git synced 2024-12-28 01:25:18 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Reduce prime check iterations to 1

Browse Source
This commit is contained in:
Agost Biro 2024-06-05 22:48:49 +02:00
parent 5d9659d118
commit a8f91fe50a
No known key found for this signature in database
2 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
crates/vdf/src/create_discriminant.rs
View File

@ -112,7 +112,7 @@ pub fn create_discriminant<T: BigNumExt>(seed: &[u8], length: u16) -> T {
if !x { if !x {
let q = u64::from(M) * u64::from(i as u32); let q = u64::from(M) * u64::from(i as u32);
n = n + q; n = n + q;
if n.probab_prime(2) { if n.probab_prime(1) {
return -n; return -n;
} }
n = n - q; n = n - q;

2
crates/vdf/src/proof_wesolowski.rs
View File

@ -119,7 +119,7 @@ fn hash_prime<T: BigNum>(seed: &[&[u8]]) -> T {
hasher.input(i); hasher.input(i);
} }
let n = T::from(&hasher.fixed_result()[..16]); let n = T::from(&hasher.fixed_result()[..16]);
if n.probab_prime(2) { if n.probab_prime(1) {
break n; break n;
} }
j += 1; j += 1;