Skip to content
Snippets Groups Projects
Commit fc64415b authored by STEVAN Antoine's avatar STEVAN Antoine :crab:
Browse files

remove useless `Point = F` from `DenseUVPolynomial` (!55)

parent 3c91ef12
No related branches found
No related tags found
No related merge requests found
......@@ -17,7 +17,7 @@ fn setup_template<F, G, P>(c: &mut Criterion, nb_bytes: usize)
where
F: PrimeField,
G: CurveGroup<ScalarField = F>,
P: DenseUVPolynomial<F, Point = F>,
P: DenseUVPolynomial<F>,
for<'a, 'b> &'a P: Div<&'b P, Output = P>,
{
let mut group = c.benchmark_group("setup");
......
......@@ -16,7 +16,7 @@ fn setup_template<F, G, P>(nb_bytes: usize)
where
F: PrimeField,
G: CurveGroup<ScalarField = F>,
P: DenseUVPolynomial<F, Point = F>,
P: DenseUVPolynomial<F>,
for<'a, 'b> &'a P: Div<&'b P, Output = P>,
{
let rng = &mut test_rng();
......
......@@ -96,7 +96,7 @@ pub fn commit<F, G, P>(
where
F: PrimeField,
G: CurveGroup<ScalarField = F>,
P: DenseUVPolynomial<F, Point = F>,
P: DenseUVPolynomial<F>,
for<'a, 'b> &'a P: Div<&'b P, Output = P>,
{
let mut commits = Vec::new();
......@@ -121,7 +121,7 @@ pub fn encode<F, G, P>(
where
F: PrimeField,
G: CurveGroup<ScalarField = F>,
P: DenseUVPolynomial<F, Point = F>,
P: DenseUVPolynomial<F>,
for<'a, 'b> &'a P: Div<&'b P, Output = P>,
{
info!("encoding and proving {} bytes", bytes.len());
......@@ -222,7 +222,7 @@ pub fn verify<F, G, P>(
where
F: PrimeField,
G: CurveGroup<ScalarField = F>,
P: DenseUVPolynomial<F, Point = F>,
P: DenseUVPolynomial<F>,
for<'a, 'b> &'a P: Div<&'b P, Output = P>,
{
let elements = block.shard.data.clone();
......@@ -268,7 +268,7 @@ mod tests {
where
F: PrimeField,
G: CurveGroup<ScalarField = F>,
P: DenseUVPolynomial<F, Point = F>,
P: DenseUVPolynomial<F>,
for<'a, 'b> &'a P: Div<&'b P, Output = P>,
{
let rng = &mut test_rng();
......@@ -290,7 +290,7 @@ mod tests {
where
F: PrimeField,
G: CurveGroup<ScalarField = F>,
P: DenseUVPolynomial<F, Point = F>,
P: DenseUVPolynomial<F>,
for<'a, 'b> &'a P: Div<&'b P, Output = P>,
{
let rng = &mut test_rng();
......@@ -321,7 +321,7 @@ mod tests {
where
F: PrimeField,
G: CurveGroup<ScalarField = F>,
P: DenseUVPolynomial<F, Point = F>,
P: DenseUVPolynomial<F>,
for<'a, 'b> &'a P: Div<&'b P, Output = P>,
{
let rng = &mut test_rng();
......@@ -350,7 +350,7 @@ mod tests {
where
F: PrimeField,
G: CurveGroup<ScalarField = F>,
P: DenseUVPolynomial<F, Point = F>,
P: DenseUVPolynomial<F>,
for<'a, 'b> &'a P: Div<&'b P, Output = P>,
{
let rng = &mut test_rng();
......@@ -373,7 +373,7 @@ mod tests {
where
F: PrimeField,
G: CurveGroup<ScalarField = F>,
P: DenseUVPolynomial<F, Point = F>,
P: DenseUVPolynomial<F>,
for<'a, 'b> &'a P: Div<&'b P, Output = P>,
{
let rng = &mut test_rng();
......@@ -422,7 +422,7 @@ mod tests {
F: PrimeField,
T: Field,
Fun: Fn(&[u8], &Matrix<T>) -> Result<(), KomodoError>,
P: DenseUVPolynomial<F, Point = F>,
P: DenseUVPolynomial<F>,
for<'a, 'b> &'a P: Div<&'b P, Output = P>,
{
let (k, n) = (3, 6);
......
......@@ -128,7 +128,7 @@ pub fn generate_random_powers<F, G, P>(
where
F: PrimeField,
G: CurveGroup<ScalarField = F>,
P: DenseUVPolynomial<F, Point = F>,
P: DenseUVPolynomial<F>,
for<'a, 'b> &'a P: Div<&'b P, Output = P>,
{
let rng = &mut test_rng();
......@@ -148,7 +148,7 @@ pub fn verify_blocks<F, G, P>(
where
F: PrimeField,
G: CurveGroup<ScalarField = F>,
P: DenseUVPolynomial<F, Point = F>,
P: DenseUVPolynomial<F>,
for<'a, 'b> &'a P: Div<&'b P, Output = P>,
{
let res = blocks
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment