Remove cbytes wrapper from m'

bip-DLEQ.mediawiki

@@ -81,7 +81,7 @@ The algorithm ''VerifyProof(A, B, C, proof, G, m)'' is defined as:
 * Let ''R<sub>2</sub> = s⋅B - e⋅C''.
 * Fail if ''is_infinite(R<sub>2</sub>)''.
 * Let ''m' = m if m is provided, otherwise an empty byte array''.
-* Fail if ''e ≠ int(hash<sub>BIP0???/challenge</sub>(cbytes(A) || cbytes(B) || cbytes(C) || cbytes(G) || cbytes(R<sub>1</sub>) || cbytes(R<sub>2</sub>) || cbytes(m')))''.
+* Fail if ''e ≠ int(hash<sub>BIP0???/challenge</sub>(cbytes(A) || cbytes(B) || cbytes(C) || cbytes(G) || cbytes(R<sub>1</sub>) || cbytes(R<sub>2</sub>) || m'))''.
 * Return success iff no failure occurred before reaching this point.
 
 ==Backwards Compatibility==