Skip to content

Commit d77170a

Browse files
committed
Fix typos
1 parent efe85c7 commit d77170a

File tree

2 files changed

+3
-3
lines changed

2 files changed

+3
-3
lines changed

CONTRIBUTING.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -44,7 +44,7 @@ The Contributor Workflow & Peer Review in libsecp256k1 are similar to Bitcoin Co
4444

4545
In addition, libsecp256k1 tries to maintain the following coding conventions:
4646

47-
* 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.
47+
* 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.
4848
* The tests should cover all lines and branches of the library (see [Test coverage](#coverage)).
4949
* 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)).
5050
* Local variables containing secret data should be cleared explicitly to try to delete secrets from memory.

src/scalar_impl.h

+2-2
Original file line numberDiff line numberDiff line change
@@ -229,7 +229,7 @@ static void secp256k1_scalar_split_lambda(secp256k1_scalar * SECP256K1_RESTRICT
229229
* <= {triangle inequality}
230230
* a1*|k*b2/n - c1| + a2*|k*(-b1)/n - c2|
231231
* < {Lemma 1 and Lemma 2}
232-
* a1*(2^-1 + epslion1) + a2*(2^-1 + epsilon2)
232+
* a1*(2^-1 + epsilon1) + a2*(2^-1 + epsilon2)
233233
* < {rounding up to an integer}
234234
* (a1 + a2 + 1)/2
235235
* < {rounding up to a power of 2}
@@ -247,7 +247,7 @@ static void secp256k1_scalar_split_lambda(secp256k1_scalar * SECP256K1_RESTRICT
247247
* <= {triangle inequality}
248248
* (-b1)*|k*b2/n - c1| + b2*|k*(-b1)/n - c2|
249249
* < {Lemma 1 and Lemma 2}
250-
* (-b1)*(2^-1 + epslion1) + b2*(2^-1 + epsilon2)
250+
* (-b1)*(2^-1 + epsilon1) + b2*(2^-1 + epsilon2)
251251
* < {rounding up to an integer}
252252
* (-b1 + b2)/2 + 1
253253
* < {rounding up to a power of 2}

0 commit comments

Comments
 (0)