|
@ -1,6 +1,6 @@ |
|
|
use super::{
|
|
|
use super::{
|
|
|
BaseElement, ElementDigest, ElementHasher, FieldElement, HashFn, Rpo, StarkField, ALPHA,
|
|
|
|
|
|
INV_ALPHA, INV_MDS, MDS, STATE_WIDTH,
|
|
|
|
|
|
|
|
|
ElementHasher, Felt, FieldElement, HashFn, Rpo, RpoDigest256, StarkField, ALPHA, INV_ALPHA,
|
|
|
|
|
|
INV_MDS, MDS, STATE_WIDTH, ZERO,
|
|
|
};
|
|
|
};
|
|
|
|
|
|
|
|
|
use core::convert::TryInto;
|
|
|
use core::convert::TryInto;
|
|
@ -9,11 +9,11 @@ use rand_utils::rand_value; |
|
|
|
|
|
|
|
|
#[test]
|
|
|
#[test]
|
|
|
fn mds_inv_test() {
|
|
|
fn mds_inv_test() {
|
|
|
let mut mul_result = [[BaseElement::new(0); STATE_WIDTH]; STATE_WIDTH];
|
|
|
|
|
|
|
|
|
let mut mul_result = [[Felt::new(0); STATE_WIDTH]; STATE_WIDTH];
|
|
|
for i in 0..STATE_WIDTH {
|
|
|
for i in 0..STATE_WIDTH {
|
|
|
for j in 0..STATE_WIDTH {
|
|
|
for j in 0..STATE_WIDTH {
|
|
|
let result = {
|
|
|
let result = {
|
|
|
let mut result = BaseElement::new(0);
|
|
|
|
|
|
|
|
|
let mut result = Felt::new(0);
|
|
|
for k in 0..STATE_WIDTH {
|
|
|
for k in 0..STATE_WIDTH {
|
|
|
result += MDS[i][k] * INV_MDS[k][j]
|
|
|
result += MDS[i][k] * INV_MDS[k][j]
|
|
|
}
|
|
|
}
|
|
@ -21,23 +21,23 @@ fn mds_inv_test() { |
|
|
};
|
|
|
};
|
|
|
mul_result[i][j] = result;
|
|
|
mul_result[i][j] = result;
|
|
|
if i == j {
|
|
|
if i == j {
|
|
|
assert_eq!(result, BaseElement::new(1));
|
|
|
|
|
|
|
|
|
assert_eq!(result, Felt::new(1));
|
|
|
} else {
|
|
|
} else {
|
|
|
assert_eq!(result, BaseElement::new(0));
|
|
|
|
|
|
|
|
|
assert_eq!(result, Felt::new(0));
|
|
|
}
|
|
|
}
|
|
|
}
|
|
|
}
|
|
|
}
|
|
|
}
|
|
|
}
|
|
|
}
|
|
|
#[test]
|
|
|
#[test]
|
|
|
fn test_alphas() {
|
|
|
fn test_alphas() {
|
|
|
let e: BaseElement = BaseElement::new(rand_value());
|
|
|
|
|
|
|
|
|
let e: Felt = Felt::new(rand_value());
|
|
|
let e_exp = e.exp(ALPHA.into());
|
|
|
let e_exp = e.exp(ALPHA.into());
|
|
|
assert_eq!(e, e_exp.exp(INV_ALPHA));
|
|
|
assert_eq!(e, e_exp.exp(INV_ALPHA));
|
|
|
}
|
|
|
}
|
|
|
|
|
|
|
|
|
#[test]
|
|
|
#[test]
|
|
|
fn test_sbox() {
|
|
|
fn test_sbox() {
|
|
|
let state = [BaseElement::new(rand_value()); STATE_WIDTH];
|
|
|
|
|
|
|
|
|
let state = [Felt::new(rand_value()); STATE_WIDTH];
|
|
|
|
|
|
|
|
|
let mut expected = state;
|
|
|
let mut expected = state;
|
|
|
expected.iter_mut().for_each(|v| *v = v.exp(ALPHA));
|
|
|
expected.iter_mut().for_each(|v| *v = v.exp(ALPHA));
|
|
@ -50,7 +50,7 @@ fn test_sbox() { |
|
|
|
|
|
|
|
|
#[test]
|
|
|
#[test]
|
|
|
fn test_inv_sbox() {
|
|
|
fn test_inv_sbox() {
|
|
|
let state = [BaseElement::new(rand_value()); STATE_WIDTH];
|
|
|
|
|
|
|
|
|
let state = [Felt::new(rand_value()); STATE_WIDTH];
|
|
|
|
|
|
|
|
|
let mut expected = state;
|
|
|
let mut expected = state;
|
|
|
expected.iter_mut().for_each(|v| *v = v.exp(INV_ALPHA));
|
|
|
expected.iter_mut().for_each(|v| *v = v.exp(INV_ALPHA));
|
|
@ -63,11 +63,11 @@ fn test_inv_sbox() { |
|
|
|
|
|
|
|
|
#[test]
|
|
|
#[test]
|
|
|
fn hash_elements_vs_merge() {
|
|
|
fn hash_elements_vs_merge() {
|
|
|
let elements = [BaseElement::new(rand_value()); 8];
|
|
|
|
|
|
|
|
|
let elements = [Felt::new(rand_value()); 8];
|
|
|
|
|
|
|
|
|
let digests: [ElementDigest; 2] = [
|
|
|
|
|
|
ElementDigest::new(elements[..4].try_into().unwrap()),
|
|
|
|
|
|
ElementDigest::new(elements[4..].try_into().unwrap()),
|
|
|
|
|
|
|
|
|
let digests: [RpoDigest256; 2] = [
|
|
|
|
|
|
RpoDigest256::new(elements[..4].try_into().unwrap()),
|
|
|
|
|
|
RpoDigest256::new(elements[4..].try_into().unwrap()),
|
|
|
];
|
|
|
];
|
|
|
|
|
|
|
|
|
let m_result = Rpo::merge(&digests);
|
|
|
let m_result = Rpo::merge(&digests);
|
|
@ -77,11 +77,11 @@ fn hash_elements_vs_merge() { |
|
|
|
|
|
|
|
|
#[test]
|
|
|
#[test]
|
|
|
fn hash_elements_vs_merge_with_int() {
|
|
|
fn hash_elements_vs_merge_with_int() {
|
|
|
let tmp = [BaseElement::new(rand_value()); 4];
|
|
|
|
|
|
let seed = ElementDigest::new(tmp);
|
|
|
|
|
|
|
|
|
let tmp = [Felt::new(rand_value()); 4];
|
|
|
|
|
|
let seed = RpoDigest256::new(tmp);
|
|
|
|
|
|
|
|
|
// ----- value fits into a field element ------------------------------------------------------
|
|
|
// ----- value fits into a field element ------------------------------------------------------
|
|
|
let val: BaseElement = BaseElement::new(rand_value());
|
|
|
|
|
|
|
|
|
let val: Felt = Felt::new(rand_value());
|
|
|
let m_result = Rpo::merge_with_int(seed, val.as_int());
|
|
|
let m_result = Rpo::merge_with_int(seed, val.as_int());
|
|
|
|
|
|
|
|
|
let mut elements = seed.as_elements().to_vec();
|
|
|
let mut elements = seed.as_elements().to_vec();
|
|
@ -91,12 +91,12 @@ fn hash_elements_vs_merge_with_int() { |
|
|
assert_eq!(m_result, h_result);
|
|
|
assert_eq!(m_result, h_result);
|
|
|
|
|
|
|
|
|
// ----- value does not fit into a field element ----------------------------------------------
|
|
|
// ----- value does not fit into a field element ----------------------------------------------
|
|
|
let val = BaseElement::MODULUS + 2;
|
|
|
|
|
|
|
|
|
let val = Felt::MODULUS + 2;
|
|
|
let m_result = Rpo::merge_with_int(seed, val);
|
|
|
let m_result = Rpo::merge_with_int(seed, val);
|
|
|
|
|
|
|
|
|
let mut elements = seed.as_elements().to_vec();
|
|
|
let mut elements = seed.as_elements().to_vec();
|
|
|
elements.push(BaseElement::new(val));
|
|
|
|
|
|
elements.push(BaseElement::new(1));
|
|
|
|
|
|
|
|
|
elements.push(Felt::new(val));
|
|
|
|
|
|
elements.push(Felt::new(1));
|
|
|
let h_result = Rpo::hash_elements(&elements);
|
|
|
let h_result = Rpo::hash_elements(&elements);
|
|
|
|
|
|
|
|
|
assert_eq!(m_result, h_result);
|
|
|
assert_eq!(m_result, h_result);
|
|
@ -127,8 +127,8 @@ fn hash_padding() { |
|
|
|
|
|
|
|
|
#[test]
|
|
|
#[test]
|
|
|
fn hash_elements_padding() {
|
|
|
fn hash_elements_padding() {
|
|
|
let e1 = [BaseElement::new(rand_value()); 2];
|
|
|
|
|
|
let e2 = [e1[0], e1[1], BaseElement::ZERO];
|
|
|
|
|
|
|
|
|
let e1 = [Felt::new(rand_value()); 2];
|
|
|
|
|
|
let e2 = [e1[0], e1[1], ZERO];
|
|
|
|
|
|
|
|
|
let r1 = Rpo::hash_elements(&e1);
|
|
|
let r1 = Rpo::hash_elements(&e1);
|
|
|
let r2 = Rpo::hash_elements(&e2);
|
|
|
let r2 = Rpo::hash_elements(&e2);
|
|
@ -138,24 +138,22 @@ fn hash_elements_padding() { |
|
|
#[test]
|
|
|
#[test]
|
|
|
fn hash_elements() {
|
|
|
fn hash_elements() {
|
|
|
let elements = [
|
|
|
let elements = [
|
|
|
BaseElement::new(0),
|
|
|
|
|
|
BaseElement::new(1),
|
|
|
|
|
|
BaseElement::new(2),
|
|
|
|
|
|
BaseElement::new(3),
|
|
|
|
|
|
BaseElement::new(4),
|
|
|
|
|
|
BaseElement::new(5),
|
|
|
|
|
|
BaseElement::new(6),
|
|
|
|
|
|
BaseElement::new(7)
|
|
|
|
|
|
|
|
|
Felt::new(0),
|
|
|
|
|
|
Felt::new(1),
|
|
|
|
|
|
Felt::new(2),
|
|
|
|
|
|
Felt::new(3),
|
|
|
|
|
|
Felt::new(4),
|
|
|
|
|
|
Felt::new(5),
|
|
|
|
|
|
Felt::new(6),
|
|
|
|
|
|
Felt::new(7),
|
|
|
];
|
|
|
];
|
|
|
|
|
|
|
|
|
let digests: [ElementDigest; 2] = [
|
|
|
|
|
|
ElementDigest::new(elements[..4].try_into().unwrap()),
|
|
|
|
|
|
ElementDigest::new(elements[4..8].try_into().unwrap()),
|
|
|
|
|
|
|
|
|
let digests: [RpoDigest256; 2] = [
|
|
|
|
|
|
RpoDigest256::new(elements[..4].try_into().unwrap()),
|
|
|
|
|
|
RpoDigest256::new(elements[4..8].try_into().unwrap()),
|
|
|
];
|
|
|
];
|
|
|
|
|
|
|
|
|
let m_result = Rpo::merge(&digests);
|
|
|
let m_result = Rpo::merge(&digests);
|
|
|
let h_result = Rpo::hash_elements(&elements);
|
|
|
let h_result = Rpo::hash_elements(&elements);
|
|
|
let m_elements :Vec<u64> = m_result.as_elements().iter().map(|a| {a.as_int()}).collect();
|
|
|
|
|
|
let h_elements :Vec<u64> = h_result.as_elements().iter().map(|a| {a.as_int()}).collect();
|
|
|
|
|
|
assert_eq!(m_elements, h_elements);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
assert_eq!(m_result, h_result);
|
|
|
|
|
|
}
|