From 9f21cf426cae080f8871ec2043573ce5652dad72 Mon Sep 17 00:00:00 2001 From: Irakliy Khaburzaniya Date: Mon, 24 Jun 2024 13:11:56 -0700 Subject: [PATCH] fixed lint checks --- air/src/air/context.rs | 24 +++++++++++++++++------- 1 file changed, 17 insertions(+), 7 deletions(-) diff --git a/air/src/air/context.rs b/air/src/air/context.rs index fb428a305..183f575fc 100644 --- a/air/src/air/context.rs +++ b/air/src/air/context.rs @@ -266,13 +266,23 @@ impl AirContext { /// transition constraint divisor divided by trace length. /// 2. `1`, because the constraint composition polynomial requires at least one column. /// - /// Since the degree of a constraint `C(x)` can be computed as `[constraint.base + - /// constraint.cycles.len()] * [trace_length - 1]` the degree of the constraint composition - /// polynomial can be computed as: `([constraint.base + constraint.cycles.len()] * [trace_length - /// - 1] - [trace_length - n])` where `constraint` is the constraint attaining the maximum and - /// `n` is the number of exemption points. In the case `n = 1`, the expression simplifies to: - /// `[constraint.base + constraint.cycles.len() - 1] * [trace_length - 1]` Thus, if each column - /// is of length `trace_length`, we would need `[constraint.base + constraint.cycles.len() - 1]` + /// Since the degree of a constraint `C(x)` can be computed as + /// + /// `[constraint.base + constraint.cycles.len()] * [trace_length - 1]` + /// + /// the degree of the constraint composition polynomial can be computed as: + /// + /// `([constraint.base + constraint.cycles.len()] * [trace_length - 1] - [trace_length - n])` + /// + /// where `constraint` is the constraint attaining the maximum and `n` is the number of + /// exemption points. In the case `n = 1`, the expression simplifies to: + /// + /// `[constraint.base + constraint.cycles.len() - 1] * [trace_length - 1]` + /// + /// Thus, if each column is of length `trace_length`, we would need + /// + /// `[constraint.base + constraint.cycles.len() - 1]` + /// /// columns to store the coefficients of the constraint composition polynomial. This means that /// if the highest constraint degree is equal to `5`, the constraint composition polynomial will /// require four columns and if the highest constraint degree is equal to `7`, it will require