chore(bb): remove poly downsizing, other fast-follow from structured …

…polys (#8475)

barretenberg/cpp/src/barretenberg/bb/main.cpp

@@ -643,7 +643,7 @@ void prove(const std::string& bytecodePath, const std::string& witnessPath, cons
 
     acir_proofs::AcirComposer acir_composer{ 0, verbose_logging };
     acir_composer.create_circuit(constraint_system, witness);
-    init_bn254_crs(acir_composer.get_dyadic_circuit_size() * 2);
+    init_bn254_crs(acir_composer.get_dyadic_circuit_size());
     acir_composer.init_proving_key();
     auto proof = acir_composer.create_proof();
 

barretenberg/cpp/src/barretenberg/eccvm/eccvm_flavor.hpp

@@ -350,7 +350,7 @@ class ECCVMFlavor {
         {
             // Storage is only needed after the first partial evaluation, hence polynomials of size (n / 2)
             for (auto& poly : this->get_all()) {
-                poly = Polynomial(circuit_size / 2, circuit_size / 2);
+                poly = Polynomial(circuit_size / 2);
             }
         }
     };

barretenberg/cpp/src/barretenberg/plonk_honk_shared/composer/composer_lib.hpp

@@ -53,9 +53,6 @@ void construct_lookup_read_counts(typename Flavor::Polynomial& read_counts,
 {
     // TODO(https://github.com/AztecProtocol/barretenberg/issues/1033): construct tables and counts at top of trace
     size_t offset = dyadic_circuit_size - circuit.get_tables_size();
-    read_counts = typename Flavor::Polynomial(circuit.get_tables_size(), dyadic_circuit_size, /*start index*/ offset);
-    // TODO(AD) we dont need to initialize read_tags
-    read_tags = typename Flavor::Polynomial(circuit.get_tables_size(), dyadic_circuit_size, /*start index*/ offset);
 
     size_t table_offset = offset; // offset of the present table in the table polynomials
     // loop over all tables used in the circuit; each table contains data about the lookups made on it
@@ -71,7 +68,7 @@ void construct_lookup_read_counts(typename Flavor::Polynomial& read_counts,
 
             // increment the read count at the corresponding index in the full polynomial
             size_t index_in_poly = table_offset + index_in_table;
-            read_counts.at(index_in_poly) = read_counts[index_in_poly] + 1;
+            read_counts.at(index_in_poly)++;
             read_tags.at(index_in_poly) = 1; // tag is 1 if entry has been read 1 or more times
         }
         table_offset += table.size(); // set the offset of the next table within the polynomials

barretenberg/cpp/src/barretenberg/plonk_honk_shared/library/grand_product_library.hpp

@@ -73,7 +73,7 @@ void compute_grand_product(typename Flavor::ProverPolynomials& full_polynomials,
         // calling get_row which creates full copies. avoid?
         for (size_t i = start; i < end; ++i) {
             for (auto [eval, full_poly] : zip_view(evaluations.get_all(), full_polynomials.get_all())) {
-                eval = full_poly.size() > i ? full_poly.get(i) : 0;
+                eval = full_poly.size() > i ? full_poly[i] : 0;
             }
             numerator.at(i) = GrandProdRelation::template compute_grand_product_numerator<Accumulator>(
                 evaluations, relation_parameters);

barretenberg/cpp/src/barretenberg/polynomials/polynomial.hpp

@@ -172,17 +172,16 @@ template <typename Fr> class Polynomial {
     Fr compute_kate_opening_coefficients(const Fr& z)
         requires polynomial_arithmetic::SupportsFFT<Fr>;
 
-    // /**
-    //  * @brief Divides p(X) by (X-r₁)⋯(X−rₘ) in-place.
-    //  * Assumes that p(rⱼ)=0 for all j
-    //  *
-    //  * @details we specialize the method when only a single root is given.
-    //  * if one of the roots is 0, then we first factor all other roots.
-    //  * dividing by X requires only a left shift of all coefficient.
-    //  *
-    //  * @param roots list of roots (r₁,…,rₘ)
-    //  */
-    // void factor_roots(std::span<const Fr> roots) { polynomial_arithmetic::factor_roots(std::span{ *this }, roots); };
+    /**
+     * @brief Divides p(X) by (X-r) in-place.
+     * Assumes that p(rⱼ)=0 for all j
+     *
+     * @details we specialize the method when only a single root is given.
+     * if one of the roots is 0, then we first factor all other roots.
+     * dividing by X requires only a left shift of all coefficient.
+     *
+     * @param root a single root r
+     */
     void factor_roots(const Fr& root) { polynomial_arithmetic::factor_roots(coeffs(), root); };
 
     Fr evaluate(const Fr& z, size_t target_size) const;

barretenberg/cpp/src/barretenberg/stdlib_circuit_builders/ultra_flavor.hpp

@@ -563,7 +563,7 @@ class UltraFlavor {
             // Storage is only needed after the first partial evaluation, hence polynomials of
             // size (n / 2)
             for (auto& poly : this->get_all()) {
-                poly = Polynomial(circuit_size / 2, circuit_size / 2);
+                poly = Polynomial(circuit_size / 2);
             }
         }
     };

barretenberg/cpp/src/barretenberg/stdlib_circuit_builders/ultra_keccak_flavor.hpp

@@ -521,7 +521,7 @@ class UltraKeccakFlavor {
             // Storage is only needed after the first partial evaluation, hence polynomials of
             // size (n / 2)
             for (auto& poly : this->get_all()) {
-                poly = Polynomial(circuit_size / 2, circuit_size / 2);
+                poly = Polynomial(circuit_size / 2);
             }
         }
     };

barretenberg/cpp/src/barretenberg/translator_vm/translator_flavor.hpp

@@ -919,7 +919,7 @@ class TranslatorFlavor {
         {
             // Storage is only needed after the first partial evaluation, hence polynomials of size (n / 2)
             for (auto& poly : this->get_all()) {
-                poly = Polynomial(circuit_size / 2, circuit_size / 2);
+                poly = Polynomial(circuit_size / 2);
             }
         }
     };