use super::matrix::matrix_vector_product;
use super::sbox::*;
use super::sponge::circuit_generic_hash_num;
use crate::traits::{HashFamily, HashParams};
use crate::{rescue_prime::params::RescuePrimeParams, DomainStrategy};
use franklin_crypto::bellman::plonk::better_better_cs::cs::ConstraintSystem;
use franklin_crypto::bellman::SynthesisError;
use franklin_crypto::{
bellman::Engine,
plonk::circuit::{allocated_num::Num, linear_combination::LinearCombination},
};
pub fn gadget_rescue_prime_hash<E: Engine, CS: ConstraintSystem<E>, const L: usize>(cs: &mut CS, input: &[Num<E>; L], domain_strategy: Option<DomainStrategy>) -> Result<[Num<E>; 2], SynthesisError> {
const WIDTH: usize = 3;
const RATE: usize = 2;
let params = RescuePrimeParams::<E, RATE, WIDTH>::default();
circuit_generic_hash_num(cs, input, ¶ms, domain_strategy)
}
pub(crate) fn gadget_rescue_prime_round_function<E: Engine, CS: ConstraintSystem<E>, P: HashParams<E, RATE, WIDTH>, const RATE: usize, const WIDTH: usize>(
cs: &mut CS,
params: &P,
state: &mut [LinearCombination<E>; WIDTH],
) -> Result<(), SynthesisError> {
assert_eq!(params.hash_family(), HashFamily::RescuePrime, "Incorrect hash family!");
for round in 0..params.number_of_full_rounds() - 1 {
sbox(cs, params.alpha(), state, None, params.custom_gate())?;
matrix_vector_product(¶ms.mds_matrix(), state)?;
let constants = params.constants_of_round(round);
for (s, c) in state.iter_mut().zip(constants.iter().cloned()) {
s.add_assign_constant(c);
}
sbox(cs, params.alpha_inv(), state, None, params.custom_gate())?;
matrix_vector_product(¶ms.mds_matrix(), state)?;
let constants = params.constants_of_round(round + 1);
for (s, c) in state.iter_mut().zip(constants.iter().cloned()) {
s.add_assign_constant(c);
}
}
Ok(())
}