Fix typos

CONTRIBUTING.md

@@ -44,7 +44,7 @@ The Contributor Workflow & Peer Review in libsecp256k1 are similar to Bitcoin Co
 
 In addition, libsecp256k1 tries to maintain the following coding conventions:
 
-* No runtime heap allocation (e.g., no `malloc`) unless explicitly requested by the caller (via `secp256k1_context_create` or `secp256k1_scratch_space_create`, for example). Morever, it should be possible to use the library without any heap allocations.
+* No runtime heap allocation (e.g., no `malloc`) unless explicitly requested by the caller (via `secp256k1_context_create` or `secp256k1_scratch_space_create`, for example). Moreover, it should be possible to use the library without any heap allocations.
 * The tests should cover all lines and branches of the library (see [Test coverage](#coverage)).
 * Operations involving secret data should be tested for being constant time with respect to the secrets (see [src/ctime_tests.c](src/ctime_tests.c)).
 * Local variables containing secret data should be cleared explicitly to try to delete secrets from memory.

include/secp256k1.h

@@ -553,7 +553,7 @@ SECP256K1_API int secp256k1_ecdsa_signature_serialize_compact(
 /** Verify an ECDSA signature.
  *
  * Returns: 1: correct signature
- * 0: incorrect or unparseable signature
+ * 0: incorrect or unparsable signature
  * Args: ctx: a secp256k1 context object.
  * In: sig: the signature being verified.
  * msghash32: the 32-byte message hash being verified.

src/scalar_impl.h

@@ -229,7 +229,7 @@ static void secp256k1_scalar_split_lambda(secp256k1_scalar * SECP256K1_RESTRICT
  * <= {triangle inequality}
  * a1*|k*b2/n - c1| + a2*|k*(-b1)/n - c2|
  * < {Lemma 1 and Lemma 2}
- * a1*(2^-1 + epslion1) + a2*(2^-1 + epsilon2)
+ * a1*(2^-1 + epsilon1) + a2*(2^-1 + epsilon2)
  * < {rounding up to an integer}
  * (a1 + a2 + 1)/2
  * < {rounding up to a power of 2}
@@ -247,7 +247,7 @@ static void secp256k1_scalar_split_lambda(secp256k1_scalar * SECP256K1_RESTRICT
  * <= {triangle inequality}
  * (-b1)*|k*b2/n - c1| + b2*|k*(-b1)/n - c2|
  * < {Lemma 1 and Lemma 2}
- * (-b1)*(2^-1 + epslion1) + b2*(2^-1 + epsilon2)
+ * (-b1)*(2^-1 + epsilon1) + b2*(2^-1 + epsilon2)
  * < {rounding up to an integer}
  * (-b1 + b2)/2 + 1
  * < {rounding up to a power of 2}