@@ -50,11 +50,6 @@ void g1_lincomb_naive(g1_t *out, const g1_t *p, const fr_t *coeffs, size_t len)
5050 * @param[in] coeffs Array of field elements, length `len`
5151 * @param[in] len The number of group/field elements
5252 *
53- * @remark This function CAN be called with the point at infinity in `p`.
54- * @remark While this function is significantly faster than g1_lincomb_naive(), we refrain from
55- * using it in security-critical places (like verification) because the blst Pippenger code has not
56- * been audited. In those critical places, we prefer using g1_lincomb_naive() which is much simpler.
57- *
5853 * For the benefit of future generations (since blst has no documentation to speak of), there are
5954 * two ways to pass the arrays of scalars and points into blst_p1s_mult_pippenger().
6055 *
@@ -71,16 +66,6 @@ C_KZG_RET g1_lincomb_fast(g1_t *out, const g1_t *p, const fr_t *coeffs, size_t l
7166 blst_p1_affine * p_affine = NULL ;
7267 blst_scalar * scalars = NULL ;
7368
74- /* Tunable parameter: must be at least 2 since blst fails for 0 or 1 */
75- const size_t min_length_threshold = 8 ;
76-
77- /* Use naive method if it's less than the threshold */
78- if (len < min_length_threshold ) {
79- g1_lincomb_naive (out , p , coeffs , len );
80- ret = C_KZG_OK ;
81- goto out ;
82- }
83-
8469 /* Allocate space for arrays */
8570 ret = c_kzg_calloc ((void * * )& p_affine , len , sizeof (blst_p1_affine ));
8671 if (ret != C_KZG_OK ) goto out ;
0 commit comments