fix: Don't consider skipping

barretenberg/cpp/src/barretenberg/relations/ecc_op_queue_relation.hpp

@@ -20,9 +20,8 @@ template <typename FF_> class EccOpQueueRelationImpl {
 
     template <typename AllEntities> inline static bool skip([[maybe_unused]] const AllEntities& in)
     {
-        // The prover can skip execution of this relation altogether since an honest input will lead to a zero
-        // contribution at every row, even when the selector lagrange_ecc_op is on
-        return true;
+        // The prover can skip execution of this relation if the ecc op selector is identically zero
+        return in.lagrange_ecc_op.is_zero();
     }
 
     /**

barretenberg/cpp/src/barretenberg/relations/utils.hpp

@@ -158,7 +158,7 @@ template <typename Flavor> class RelationUtils {
     {
         constexpr_for<0, NUM_RELATIONS, 1>([&]<size_t rel_index>() {
             // FIXME: You wan't /*consider_skipping=*/false here, but tests need to be fixed.
-            accumulate_single_relation<Parameters, rel_index, /*consider_skipping=*/true>(
+            accumulate_single_relation<Parameters, rel_index, /*consider_skipping=*/false>(
                 evaluations, relation_evaluations, relation_parameters, partial_evaluation_result);
         });
     }

barretenberg/cpp/src/barretenberg/sumcheck/sumcheck.test.cpp

@@ -211,17 +211,22 @@ template <typename Flavor> class SumcheckTests : public ::testing::Test {
             auto r = FF::random_element();
 
             std::array<FF, multivariate_n> z_perm = { 0, 0, 0, 0, 0, 0, z_1, z_2 };
-            std::array<FF, multivariate_n> lookup_inverses = { 0, 0, 0, 0, 0, 0, r * r, r };
-
+            std::array<FF, multivariate_n> lookup_inverses = { 0, 0, 0, 0, 0, r, r * r, r * r * r };
+            // To avoid triggering the skipping mechanism in LogDerivativeRelation, we have to ensure
+            // that the condition (in.q_lookup.is_zero() && in.lookup_read_counts.is_zero()) is not satisfied in the
+            // blinded rows
+            std::array<FF, multivariate_n> skipping_disabler = { 0, 0, 0, 0, 0, 1, 1, 1 };
             full_polynomials.z_perm = bb::Polynomial<FF>(z_perm);
             full_polynomials.lookup_inverses = bb::Polynomial<FF>(lookup_inverses);
-
+            full_polynomials.lookup_read_counts = bb::Polynomial<FF>(skipping_disabler);
             if constexpr (std::is_same<Flavor, MegaZKFlavor>::value) {
-                std::array<FF, multivariate_n> ecc_op_wire = { 0, 0, 0, 0, 0, 0, r * r * r, w_4[6] };
-                std::array<FF, multivariate_n> return_data_inverses = { 0, 0, 0, 0, 0, 0, FF(7) * r * r, -r };
-
-                full_polynomials.ecc_op_wire_1 = bb::Polynomial<FF>(ecc_op_wire);
+                std::array<FF, multivariate_n> return_data_inverses = { 0, 0, 0, 0, 0, 0, r * r, -r };
                 full_polynomials.return_data_inverses = bb::Polynomial<FF>(return_data_inverses);
+
+                // To avoid triggering the skipping mechanism in DatabusLookupRelation, we have to ensure that the
+                // condition (in.calldata_read_counts.is_zero() && in.secondary_calldata_read_counts.is_zero() &&
+                //  in.return_data_read_counts.is_zero()) is not satisfied in the blinded rows
+                full_polynomials.calldata_read_counts = bb::Polynomial<FF>(skipping_disabler);
             }
         }
         full_polynomials.w_l = bb::Polynomial<FF>(w_l);