From ffff38351c0a07c6e8eed1508e544c85384badc5 Mon Sep 17 00:00:00 2001 From: Maxim Evtush <154841002+maximevtush@users.noreply.github.com> Date: Sun, 16 Feb 2025 16:14:42 +0100 Subject: [PATCH 1/5] Update generic_lookup_relation.hpp --- .../relations/generic_lookup/generic_lookup_relation.hpp | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/cpp/src/barretenberg/relations/generic_lookup/generic_lookup_relation.hpp b/cpp/src/barretenberg/relations/generic_lookup/generic_lookup_relation.hpp index 320216495b..8b6cd0b7f8 100644 --- a/cpp/src/barretenberg/relations/generic_lookup/generic_lookup_relation.hpp +++ b/cpp/src/barretenberg/relations/generic_lookup/generic_lookup_relation.hpp @@ -6,7 +6,7 @@ * * @details Lookup is a mechanism to ensure that a particular value or tuple of values (these can be values of * witnesses, selectors or a function of these) is contained within a particular set. It is a relative of set - * permutation, but has a one-to-many relationship beween elements that are being looked up and the table of values they + * permutation, but has a one-to-many relationship between elements that are being looked up and the table of values they * are being looked up from. In this relation template we use the following terminology: * + READ - the action of looking up the value in the table * + WRITE - the action of adding the value to the lookup table From d2f4fddba23c7bcae5b80496976aa9f3e86840fe Mon Sep 17 00:00:00 2001 From: Maxim Evtush <154841002+maximevtush@users.noreply.github.com> Date: Sun, 16 Feb 2025 16:14:59 +0100 Subject: [PATCH 2/5] Update auxiliary_relation.hpp --- cpp/src/barretenberg/relations/auxiliary_relation.hpp | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/cpp/src/barretenberg/relations/auxiliary_relation.hpp b/cpp/src/barretenberg/relations/auxiliary_relation.hpp index 10801c0a27..f369806e53 100644 --- a/cpp/src/barretenberg/relations/auxiliary_relation.hpp +++ b/cpp/src/barretenberg/relations/auxiliary_relation.hpp @@ -156,7 +156,7 @@ template class AuxiliaryRelationImpl { auto non_native_field_gate_1_m = limb_subproduct; non_native_field_gate_1_m -= (w_3_m + w_4_m); // We transform into ShortAccumulator to extend the degree of `non_native_field_gate_1` beyond degree-2 - // (CoefficientAccumulator only supports Monomials of up to degree 2 as it is not efficient to peform + // (CoefficientAccumulator only supports Monomials of up to degree 2 as it is not efficient to perform // higher-degree computations in the coefficient basis) We use ShortAccumulator instead of Accumulator, because // this term is only used in subrelations that have the same degree as subrelation `0` (which can be lower than // the degree of subrelation `3`, which is how `Accumulator` is defined) From 29a8d84677cbd04d49696876b34652d79ab207d9 Mon Sep 17 00:00:00 2001 From: Maxim Evtush <154841002+maximevtush@users.noreply.github.com> Date: Sun, 16 Feb 2025 16:15:35 +0100 Subject: [PATCH 3/5] Update ecc_transcript_relation_impl.hpp --- .../relations/ecc_vm/ecc_transcript_relation_impl.hpp | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/cpp/src/barretenberg/relations/ecc_vm/ecc_transcript_relation_impl.hpp b/cpp/src/barretenberg/relations/ecc_vm/ecc_transcript_relation_impl.hpp index 025e45361d..78fc7d360b 100644 --- a/cpp/src/barretenberg/relations/ecc_vm/ecc_transcript_relation_impl.hpp +++ b/cpp/src/barretenberg/relations/ecc_vm/ecc_transcript_relation_impl.hpp @@ -22,7 +22,7 @@ namespace bb { * that must be evaluated. * * One mul opcode can generate up to TWO multiplications. Each 128-bit scalar `z1, z2` is treated as an independent mul. - * The purpose of this is to reduce the length of the MSM algorithm evalauted in `ecc_msm_relation.hpp` to 128 bits + * The purpose of this is to reduce the length of the MSM algorithm evaluated in `ecc_msm_relation.hpp` to 128 bits * (from 256 bits). Many scalar muls required to recursively verify a proof are only 128-bits in length; this prevents * us doing redundant computation. * @tparam FF From 3277f0fb231e2175610ba30c98eeff0ab41836e0 Mon Sep 17 00:00:00 2001 From: Maxim Evtush <154841002+maximevtush@users.noreply.github.com> Date: Sun, 16 Feb 2025 16:16:02 +0100 Subject: [PATCH 4/5] Update translator_relation_consistency.test.cpp --- .../translator_vm/translator_relation_consistency.test.cpp | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/cpp/src/barretenberg/relations/translator_vm/translator_relation_consistency.test.cpp b/cpp/src/barretenberg/relations/translator_vm/translator_relation_consistency.test.cpp index ec94e7cfc0..04f3431f4e 100644 --- a/cpp/src/barretenberg/relations/translator_vm/translator_relation_consistency.test.cpp +++ b/cpp/src/barretenberg/relations/translator_vm/translator_relation_consistency.test.cpp @@ -396,7 +396,7 @@ TEST_F(TranslatorRelationConsistency, DecompositionRelation) // All decomposition happen only at odd indices, so we use lagrange odd /** - * @brief Check decomposition of a relation limb. Relation limbs are 84 bits, so the decompositon takes 6 + * @brief Check decomposition of a relation limb. Relation limbs are 84 bits, so the decomposition takes 6 * 14-bit microlimbs * */ From 191af4403297c8089c555420e68f50ee12bbce29 Mon Sep 17 00:00:00 2001 From: Maxim Evtush <154841002+maximevtush@users.noreply.github.com> Date: Sun, 16 Feb 2025 16:18:47 +0100 Subject: [PATCH 5/5] Update translator_extra_relations.hpp --- .../relations/translator_vm/translator_extra_relations.hpp | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/cpp/src/barretenberg/relations/translator_vm/translator_extra_relations.hpp b/cpp/src/barretenberg/relations/translator_vm/translator_extra_relations.hpp index 7692d7133f..c1868ce846 100644 --- a/cpp/src/barretenberg/relations/translator_vm/translator_extra_relations.hpp +++ b/cpp/src/barretenberg/relations/translator_vm/translator_extra_relations.hpp @@ -62,7 +62,7 @@ template class TranslatorAccumulatorTransferRelationImpl { * @brief Returns true if the contribution from all subrelations for the provided inputs is identically zero * * @details This has a negligible chance of failing in sumcheck (not in the first round) because effectively - * transfrom original coefficients into a random linear combination. But checking each individually is noticeably + * transform original coefficients into a random linear combination. But checking each individually is noticeably * slower. * */