logos-storage/plonky2
1
0
Fork 0
mirror of https://github.com/logos-storage/plonky2.git synced 2026-01-05 23:33:07 +00:00
Code Issues Packages Projects Releases Wiki Activity

Remove old field search code

Browse Source 
We've moved on to better options.
This commit is contained in:
Daniel Lubarov 2021-05-13 22:45:46 -07:00
parent 78af8830cb
commit f45c8d9520
1 changed files with 0 additions and 57 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

57
src/bin/field_search.rs
View File

@ -1,57 +0,0 @@
fn main() {
for deg in (61..=64).rev() {
for adic in (28..=32).rev() {
for i in 1u128..100000 {
if i.count_ones() == 1 && i != 1 {
continue;
}
let epsilon = i * (1u128 << adic) - 1;
if epsilon > 1 << 32 {
break;
}
let n = ((1u128) << deg) - epsilon;
let n = n as u64;
let prime = is_prime(n);
if prime {
println!("2^{} - ({} * 2**{} - 1) = {}", deg, i, adic, n);
let perm3 = (n - 1) % 3 != 0;
println!(" x^3 {}", perm3);
if perm3 {
let mut exp = n as u128;
while exp % 3 != 0 {
exp += (n - 1) as u128;
}
exp /= 3;
println!(" exp weight {}", exp.count_ones());
}
let perm5 = (n - 1) % 5 != 0;
println!(" x^5 {}", perm5);
if perm5 {
let mut exp = n as u128;
while exp % 5 != 0 {
exp += (n - 1) as u128;
}
exp /= 5;
println!(" exp weight {}", exp.count_ones());
}
}
}
}
}
}
fn is_prime(n: u64) -> bool {
if (n & 1) == 0 {
return false;
}
let mut d = 3;
while d * d <= n {
if n % d == 0 {
return false;
}
d += 2;
}
true
}