docs: fixed original minus underflow test

barretenberg/cpp/src/barretenberg/stdlib/primitives/safe_uint/safe_uint.cpp

@@ -21,6 +21,150 @@ template <typename Builder> safe_uint_t<Builder> safe_uint_t<Builder>::operator*
     return safe_uint_t((value * other.value), new_max.lo, IS_UNSAFE);
 }
 
+/**
+ * @brief Subtraction when you have a pre-determined bound on the difference size
+ * @details Same as operator- except with this pre-determined bound `difference_bit_size`.
+ *
+ * @tparam Builder
+ * @param other
+ * @param difference_bit_size
+ * @param description
+ * @return safe_uint_t<Builder>
+ */
+template <typename Builder>
+safe_uint_t<Builder> safe_uint_t<Builder>::subtract(const safe_uint_t& other,
+                                                    const size_t difference_bit_size,
+                                                    std::string const& description) const
+{
+    ASSERT(difference_bit_size <= MAX_BIT_NUM);
+    ASSERT(!(this->value.is_constant() && other.value.is_constant()));
+    field_ct difference_val = this->value - other.value;
+    // Creates the range constraint that difference_val is in [0, (1<<difference_bit_size) - 1].
+    safe_uint_t<Builder> difference(difference_val, difference_bit_size, format("subtract: ", description));
+    // It is possible for underflow to happen and the range constraint to not catch it.
+    // This is when (a - b) + modulus <= (1<<difference_bit_size) - 1 (or difference.current_max)
+    // Checking that difference.current_max + max of (b - a) >= modulus will ensure that underflow is caught in all
+    // cases
+    if (difference.current_max + other.current_max > MAX_VALUE)
+        throw_or_abort("maximum value exceeded in safe_uint subtract");
+    return difference;
+}
+
+/**
+ * @brief Subtraction on two safe_uint_t objects
+ * @details The function first checks the case when both operands are constants and there is underflow.
+ *          Then, it computes the difference and create a safe_uint_t from its value
+ *          with the same max value as `current_max`.
+ *          Constructing the `difference` safe_uint_t will create a range constraint,
+ *          which catches underflow as long as the difference value does not end up in the range [0,
+ *          current_max]. The only case where it is possible that the difference value can end up in this range, is when
+ *          `current_max` + `other.current_max` exceeds MAX_VALUE (the modulus - 1), so we throw an error in this case.
+ *
+ * @tparam Builder
+ * @param other
+ * @return safe_uint_t<Builder>
+ */
+template <typename Builder> safe_uint_t<Builder> safe_uint_t<Builder>::operator-(const safe_uint_t& other) const
+{
+    // If both are constants and the operation is an underflow, throw an error since circuit itself underflows
+    ASSERT(!(this->value.is_constant() && other.value.is_constant() &&
+             static_cast<uint256_t>(value.get_value()) < static_cast<uint256_t>(other.value.get_value())));
+    field_ct difference_val = this->value - other.value;
+
+    // safe_uint_t constructor creates a range constraint which checks that `difference_val` is within [0,
+    // current_max].
+    safe_uint_t<Builder> difference(difference_val, (size_t)(current_max.get_msb() + 1), "- operator");
+
+    // Call the two operands a and b. If this operations is underflow and the range constraint fails to catch it,
+    // this means that (a-b) + modulus is IN the range [0, a.current_max].
+    // This is equivalent to the condition that (a - b) + modulus <= a.current_max.
+    // IF b.current_max >= modulus - a.current_max, then it is possible for this condition to be true
+    // because we can let a be 0, and b be b.current_max -> (0 - b.current_max) + modulus <= a.current_max is true.
+    // IF b.current_max < modulus - a.current_max, it is impossible for underflow to happen, no matter how you set a and
+    // b. Therefore, we check that b.current_max >= modulus - a.current_max, which is equivalent to
+    // difference.current_max + other.current_max > MAX_VALUE Note that we will throw an error sometimes even if a-b is
+    // not an underflow but we cannot distinguish it from a case that underflows, so we must throw an error.
+    if (difference.current_max + other.current_max > MAX_VALUE)
+        throw_or_abort("maximum value exceeded in safe_uint minus operator");
+    return difference;
+}
+
+/**
+ * @brief division when you have a pre-determined bound on the sizes of the quotient and remainder
+ *
+ * @tparam Builder
+ * @param other
+ * @param quotient_bit_size
+ * @param remainder_bit_size
+ * @param description
+ * @param get_quotient
+ * @return safe_uint_t<Builder>
+ */
+template <typename Builder>
+safe_uint_t<Builder> safe_uint_t<Builder>::divide(
+    const safe_uint_t& other,
+    const size_t quotient_bit_size,
+    const size_t remainder_bit_size,
+    std::string const& description,
+    const std::function<std::pair<uint256_t, uint256_t>(uint256_t, uint256_t)>& get_quotient) const
+{
+    ASSERT(this->value.is_constant() == false);
+    ASSERT(quotient_bit_size <= MAX_BIT_NUM);
+    ASSERT(remainder_bit_size <= MAX_BIT_NUM);
+    uint256_t val = this->value.get_value();
+    auto [quotient_val, remainder_val] = get_quotient(val, (uint256_t)other.value.get_value());
+    field_ct quotient_field(witness_t(value.context, quotient_val));
+    field_ct remainder_field(witness_t(value.context, remainder_val));
+    safe_uint_t<Builder> quotient(quotient_field, quotient_bit_size, format("divide method quotient: ", description));
+    safe_uint_t<Builder> remainder(
+        remainder_field, remainder_bit_size, format("divide method remainder: ", description));
+
+    // This line implicitly checks we are not overflowing
+    safe_uint_t int_val = quotient * other + remainder;
+
+    // We constrain divisor - remainder - 1 to be non-negative to ensure that remainder < divisor.
+    // Define remainder_plus_one to avoid multiple subtractions
+    const safe_uint_t<Builder> remainder_plus_one = remainder + 1;
+    // Subtraction of safe_uint_t's imposes the desired range constraint
+    other - remainder_plus_one;
+
+    this->assert_equal(int_val, "divide method quotient and/or remainder incorrect");
+
+    return quotient;
+}
+
+/**
+ * @brief Potentially less efficient than divide function - bounds remainder and quotient by max of this
+ *
+ * @tparam Builder
+ * @param other
+ * @return safe_uint_t<Builder>
+ */
+template <typename Builder> safe_uint_t<Builder> safe_uint_t<Builder>::operator/(const safe_uint_t& other) const
+{
+    ASSERT(this->value.is_constant() == false);
+    uint256_t val = this->value.get_value();
+    auto [quotient_val, remainder_val] = val.divmod((uint256_t)other.value.get_value());
+    field_ct quotient_field(witness_t(value.context, quotient_val));
+    field_ct remainder_field(witness_t(value.context, remainder_val));
+    safe_uint_t<Builder> quotient(quotient_field, (size_t)(current_max.get_msb() + 1), format("/ operator quotient"));
+    safe_uint_t<Builder> remainder(
+        remainder_field, (size_t)(other.current_max.get_msb() + 1), format("/ operator remainder"));
+
+    // This line implicitly checks we are not overflowing
+    safe_uint_t int_val = quotient * other + remainder;
+
+    // We constrain divisor - remainder - 1 to be non-negative to ensure that remainder < divisor.
+    // // define remainder_plus_one to avoid multiple subtractions
+    const safe_uint_t<Builder> remainder_plus_one = remainder + 1;
+    // // subtraction of safe_uint_t's imposes the desired range constraint
+    other - remainder_plus_one;
+
+    this->assert_equal(int_val, "/ operator quotient and/or remainder incorrect");
+
+    return quotient;
+}
+
 template <typename Builder> safe_uint_t<Builder> safe_uint_t<Builder>::normalize() const
 {
     auto norm_value = value.normalize();

barretenberg/cpp/src/barretenberg/stdlib/primitives/safe_uint/safe_uint.hpp

@@ -98,30 +98,9 @@ template <typename Builder> class safe_uint_t {
     // Subtraction when you have a pre-determined bound on the difference size
     safe_uint_t subtract(const safe_uint_t& other,
                          const size_t difference_bit_size,
-                         std::string const& description = "") const
-    {
-        ASSERT(difference_bit_size <= MAX_BIT_NUM);
-        ASSERT(!(this->value.is_constant() && other.value.is_constant()));
-        field_ct difference_val = this->value - other.value;
-        safe_uint_t<Builder> difference(difference_val, difference_bit_size, format("subtract: ", description));
-        // This checks the subtraction is correct for integers without any wraps
-        if (difference.current_max + other.current_max > MAX_VALUE)
-            throw_or_abort("maximum value exceeded in safe_uint subtract");
-        return difference;
-    }
+                         std::string const& description = "") const;
 
-    safe_uint_t operator-(const safe_uint_t& other) const
-    {
-        // We could get a constant underflow
-        ASSERT(!(this->value.is_constant() && other.value.is_constant() &&
-                 static_cast<uint256_t>(value.get_value()) < static_cast<uint256_t>(other.value.get_value())));
-        field_ct difference_val = this->value - other.value;
-        safe_uint_t<Builder> difference(difference_val, (size_t)(current_max.get_msb() + 1), "- operator");
-        // This checks the subtraction is correct for integers without any wraps
-        if (difference.current_max + other.current_max > MAX_VALUE)
-            throw_or_abort("maximum value exceeded in safe_uint minus operator");
-        return difference;
-    }
+    safe_uint_t operator-(const safe_uint_t& other) const;
 
     // division when you have a pre-determined bound on the sizes of the quotient and remainder
     safe_uint_t divide(
@@ -132,60 +111,10 @@ template <typename Builder> class safe_uint_t {
         const std::function<std::pair<uint256_t, uint256_t>(uint256_t, uint256_t)>& get_quotient =
             [](uint256_t val, uint256_t divisor) {
                 return std::make_pair((uint256_t)(val / (uint256_t)divisor), (uint256_t)(val % (uint256_t)divisor));
-            })
-    {
-        ASSERT(this->value.is_constant() == false);
-        ASSERT(quotient_bit_size <= MAX_BIT_NUM);
-        ASSERT(remainder_bit_size <= MAX_BIT_NUM);
-        uint256_t val = this->value.get_value();
-        auto [quotient_val, remainder_val] = get_quotient(val, (uint256_t)other.value.get_value());
-        field_ct quotient_field(witness_t(value.context, quotient_val));
-        field_ct remainder_field(witness_t(value.context, remainder_val));
-        safe_uint_t<Builder> quotient(
-            quotient_field, quotient_bit_size, format("divide method quotient: ", description));
-        safe_uint_t<Builder> remainder(
-            remainder_field, remainder_bit_size, format("divide method remainder: ", description));
-
-        // This line implicitly checks we are not overflowing
-        safe_uint_t int_val = quotient * other + remainder;
-
-        // We constrain divisor - remainder - 1 to be non-negative to ensure that remainder < divisor.
-        // Define remainder_plus_one to avoid multiple subtractions
-        const safe_uint_t<Builder> remainder_plus_one = remainder + 1;
-        // Subtraction of safe_uint_t's imposes the desired range constraint
-        other - remainder_plus_one;
-
-        this->assert_equal(int_val, "divide method quotient and/or remainder incorrect");
-
-        return quotient;
-    }
+            }) const;
 
     // Potentially less efficient than divide function - bounds remainder and quotient by max of this
-    safe_uint_t operator/(const safe_uint_t& other) const
-    {
-        ASSERT(this->value.is_constant() == false);
-        uint256_t val = this->value.get_value();
-        auto [quotient_val, remainder_val] = val.divmod((uint256_t)other.value.get_value());
-        field_ct quotient_field(witness_t(value.context, quotient_val));
-        field_ct remainder_field(witness_t(value.context, remainder_val));
-        safe_uint_t<Builder> quotient(
-            quotient_field, (size_t)(current_max.get_msb() + 1), format("/ operator quotient"));
-        safe_uint_t<Builder> remainder(
-            remainder_field, (size_t)(other.current_max.get_msb() + 1), format("/ operator remainder"));
-
-        // This line implicitly checks we are not overflowing
-        safe_uint_t int_val = quotient * other + remainder;
-
-        // We constrain divisor - remainder - 1 to be non-negative to ensure that remainder < divisor.
-        // // define remainder_plus_one to avoid multiple subtractions
-        const safe_uint_t<Builder> remainder_plus_one = remainder + 1;
-        // // subtraction of safe_uint_t's imposes the desired range constraint
-        other - remainder_plus_one;
-
-        this->assert_equal(int_val, "/ operator quotient and/or remainder incorrect");
-
-        return quotient;
-    }
+    safe_uint_t operator/(const safe_uint_t& other) const;
 
     safe_uint_t add_two(const safe_uint_t& add_a, const safe_uint_t& add_b) const
     {