diff --git a/barretenberg/cpp/src/barretenberg/translator_vm/translator_flavor.hpp b/barretenberg/cpp/src/barretenberg/translator_vm/translator_flavor.hpp
index cd8b1ecb98f8..1511e72ba132 100644
--- a/barretenberg/cpp/src/barretenberg/translator_vm/translator_flavor.hpp
+++ b/barretenberg/cpp/src/barretenberg/translator_vm/translator_flavor.hpp
@@ -111,21 +111,10 @@ class TranslatorFlavor {
     // The bitness of the range constraint
     static constexpr size_t MICRO_LIMB_BITS = CircuitBuilder::MICRO_LIMB_BITS;
 
-    // The number of "steps" inserted in ordered range constraint polynomials to ensure that the
-    // DeltaRangeConstraintRelation can always be satisfied if the polynomial is within the appropriate range.
-    static constexpr size_t SORTED_STEPS_COUNT = ((1 << MICRO_LIMB_BITS) / SORT_STEP) + 1;
-    static_assert(SORTED_STEPS_COUNT * (NUM_CONCATENATED_POLYS + 1) < MINI_CIRCUIT_SIZE * CONCATENATION_GROUP_SIZE,
-                  "Translator circuit is too small for defined number of steps "
-                  "(TranslatorDeltaRangeConstraintRelation). ");
-
     // Number of bits in a binary limb
     // This is not a configurable value. Relations are sepcifically designed for it to be 68
     static constexpr size_t NUM_LIMB_BITS = CircuitBuilder::NUM_LIMB_BITS;
 
-    // Lowest possible size of the Translator mini circuit due to the desing of range constraints.
-    static constexpr size_t MINIMUM_MINI_CIRCUIT_SIZE = 2048;
-    static_assert(MINI_CIRCUIT_SIZE > MINIMUM_MINI_CIRCUIT_SIZE);
-
     using GrandProductRelations = std::tuple<TranslatorPermutationRelation<FF>>;
     // define the tuple of Relations that comprise the Sumcheck relation
     template <typename FF>
@@ -783,6 +772,23 @@ class TranslatorFlavor {
         PROOF_LENGTH +
         CONST_TRANSLATOR_LOG_N * (num_frs_comm + 2 * num_frs_fr - BATCHED_RELATION_PARTIAL_LENGTH * num_frs_fr);
 
+    // ===== Static assert to ensure a valid trace can be proven ======
+
+    // The number of "steps" inserted in ordered range constraint polynomials to ensure that the
+    // DeltaRangeConstraintRelation can always be satisfied if the polynomial is within the appropriate range.
+    static constexpr size_t SORTED_STEPS_COUNT = ((1 << MICRO_LIMB_BITS) / SORT_STEP) + 1;
+
+    // The number of masking values in the overflow columns used for the ordered range constraint
+    static constexpr size_t MASKING_OVERFLOW_COLUMN =
+        MAX_RANDOM_VALUES_PER_ORDERED * (NUM_ORDERED_RANGE - 1) / NUM_ORDERED_RANGE;
+
+    static_assert(SORTED_STEPS_COUNT * NUM_ORDERED_RANGE + MASKING_OVERFLOW_COLUMN <
+                      MINI_CIRCUIT_SIZE * CONCATENATION_GROUP_SIZE,
+                  "Translator circuit is too small for defined number of steps "
+                  "(TranslatorDeltaRangeConstraintRelation). ");
+
+    // ================================================================
+
     /**
      * @brief Partition minicircuit wire references into concatenation groups.
      * @details Takes a flat list of minicircuit wire refs (NonRangeMain followed by RangeConstraint)
@@ -1082,7 +1088,7 @@ class TranslatorFlavor {
                                              /*virtual_size*/ circuit_size,
                                              /*start_index*/ circuit_size - MAX_RANDOM_VALUES_PER_ORDERED - 1 };
             ordered_extra_range_constraints_numerator =
-                Polynomial{ /*size*/ SORTED_STEPS_COUNT * (NUM_CONCATENATED_POLYS + 1),
+                Polynomial{ /*size*/ SORTED_STEPS_COUNT * NUM_CONCATENATED_POLYS + MASKING_OVERFLOW_COLUMN,
                             /*virtual_size*/ circuit_size,
                             /*start_index*/ 0 };