chore: For compute_kzg_proof_multi remove remainder polynomial when in monomial form

[kevaundray]

Computing the quotient polynomial in monomial form means we can ignore the remainder term. In #3695 I can extend the comments to explain the transformation. Putting this up for now, so that we can check the performance diff.

[asn-d6]

Good one!

Agreed that we should doc this optimization in some way. Arkworks docs it like this.

Seems like also the "Compute the quotient polynomial directly in evaluation form" comment above is wrong? Anyhow, let's handle docs in the other PR.

[kevaundray]

Good one!

Agreed that we should doc this optimization in some way. Arkworks docs it like this.

Seems like also the "Compute the quotient polynomial directly in evaluation form" comment above is wrong? Anyhow, let's handle docs in the other PR.

Yep! #3695 fixes the comments in that function -- once we merge it in, I can note that we do not need to compute the remainder polynomial

[kevaundray]

Merged dev into the branch updated the comment to briefly explain why we can remove the computation for r(x)