Closed teor2345 closed 3 months ago
In #9 we're going to modify the polynomial multiplication algorithm.
But we don't have comprehensive tests yet, we're missing some edge cases like:
X
And we don't have full coverage of our implementation:
We might also want to:
X^0
X^1
X^{N-1}
X^N
0
1
MODULUS-1
Let's implement a reasonable number of edge cases, then close this ticket. We don't need to do them all.
We’re pretty confident this works, so I don’t think we need extra tests.
In #9 we're going to modify the polynomial multiplication algorithm.
But we don't have comprehensive tests yet, we're missing some edge cases like:
X
And we don't have full coverage of our implementation:
We might also want to:
X^0
,X^1
,X^{N-1}
,X^N
(partly done for some tests)0
,1
,MODULUS-1
Let's implement a reasonable number of edge cases, then close this ticket. We don't need to do them all.