LaconicNetwork/cosmos-sdk
7
0
Fork 0
Code Issues Pull Requests Packages Projects Releases 2 Wiki Activity

docs: fix typos (#25075)

Browse Source 
Co-authored-by: Alex | Interchain Labs <alex@interchainlabs.io>
This commit is contained in:
maksneprik 2025-08-04 21:29:38 +02:00 committed by GitHub
parent 13e272b5cc
commit 86245cba91
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
10 changed files with 12 additions and 12 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
collections/indexes/unique.go
View File

@ -57,7 +57,7 @@ func (i *Unique[ReferenceKey, PrimaryKey, Value]) Reference(ctx context.Context,
return err
}
if has {
return fmt.Errorf("%w: index uniqueness constrain violation: %s", collections.ErrConflict, i.refKeys.KeyCodec().Stringify(refKey))
return fmt.Errorf("%w: index uniqueness constraint violation: %s", collections.ErrConflict, i.refKeys.KeyCodec().Stringify(refKey))
}
return i.refKeys.Set(ctx, refKey, pk)
}

2
crypto/keys/secp256k1/internal/secp256k1/libsecp256k1/contrib/lax_der_parsing.h
View File

@ -63,7 +63,7 @@ extern "C" {
* Args: ctx: a secp256k1 context object
* Out: sig: a pointer to a signature object
* In: input: a pointer to the signature to be parsed
* inputlen: the length of the array pointed to be input
* inputlen: the length of the array pointed to by input
*
* This function will accept any valid DER encoded signature, even if the
* encoded numbers are out of range. In addition, it will accept signatures

2
crypto/keys/secp256k1/internal/secp256k1/libsecp256k1/contrib/lax_der_privatekey_parsing.h
View File

@ -68,7 +68,7 @@ SECP256K1_WARN_UNUSED_RESULT int ec_privkey_export_der(
* Out: seckey: pointer to a 32-byte array for storing the private key.
* (cannot be NULL).
* In: privkey: pointer to a private key in DER format (cannot be NULL).
* privkeylen: length of the DER private key pointed to be privkey.
* privkeylen: length of the DER private key pointed to by privkey.
*
* This function will accept more than just strict DER, and even allow some BER
* violations. The public key stored inside the DER-encoded private key is not

2
crypto/keys/secp256k1/internal/secp256k1/libsecp256k1/include/secp256k1.h
View File

@ -534,7 +534,7 @@ SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_ec_privkey_tweak_mul(
* uniformly random 32-byte arrays, or equal to zero. 1 otherwise.
* Args: ctx: pointer to a context object initialized for validation
* (cannot be NULL).
* In/Out: pubkey: pointer to a public key obkect.
* In/Out: pubkey: pointer to a public key object.
* In: tweak: pointer to a 32-byte tweak.
*/
SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_ec_pubkey_tweak_mul(

2
crypto/keys/secp256k1/internal/secp256k1/libsecp256k1/src/ecmult_gen_impl.h
View File

@ -69,7 +69,7 @@ static void secp256k1_ecmult_gen_context_build(secp256k1_ecmult_gen_context *ctx
for (i = 0; i < 4; i++) {
secp256k1_gej_double_var(&gbase, &gbase, NULL);
}
/* Multiply numbase by 2. */
/* Multiply numsbase by 2. */
secp256k1_gej_double_var(&numsbase, &numsbase, NULL);
if (j == 62) {
/* In the last iteration, numsbase is (1 - 2^j) * nums instead. */

2
crypto/keys/secp256k1/internal/secp256k1/libsecp256k1/src/field_10x26.h
View File

@ -18,7 +18,7 @@ typedef struct {
#endif
} secp256k1_fe;
/* Unpacks a constant into a overlapping multi-limbed FE element. */
/* Unpacks a constant into an overlapping multi-limbed FE element. */
#define SECP256K1_FE_CONST_INNER(d7, d6, d5, d4, d3, d2, d1, d0) { \
(d0) & 0x3FFFFFFUL, \
(((uint32_t)d0) >> 26) | (((uint32_t)(d1) & 0xFFFFFUL) << 6), \

2
crypto/keys/secp256k1/internal/secp256k1/libsecp256k1/src/field_5x52.h
View File

@ -18,7 +18,7 @@ typedef struct {
#endif
} secp256k1_fe;
/* Unpacks a constant into a overlapping multi-limbed FE element. */
/* Unpacks a constant into an overlapping multi-limbed FE element. */
#define SECP256K1_FE_CONST_INNER(d7, d6, d5, d4, d3, d2, d1, d0) { \
(d0) | (((uint64_t)(d1) & 0xFFFFFUL) << 32), \
((uint64_t)(d1) >> 20) | (((uint64_t)(d2)) << 12) | (((uint64_t)(d3) & 0xFFUL) << 44), \

4
crypto/keys/secp256k1/internal/secp256k1/libsecp256k1/src/java/org/bitcoin/NativeSecp256k1.java
View File

@ -359,8 +359,8 @@ public class NativeSecp256k1 {
/**
* libsecp256k1 create ECDH secret - constant time ECDH calculation
*
* @param seckey byte array of secret key used in exponentiaion
* @param pubkey byte array of public key used in exponentiaion
* @param seckey byte array of secret key used in exponentiation
* @param pubkey byte array of public key used in exponentiation
*/
public static byte[] createECDHSecret(byte[] seckey, byte[] pubkey) throws AssertFailException{
Preconditions.checkArgument(seckey.length <= 32 && pubkey.length <= 65);

2
crypto/keys/secp256k1/internal/secp256k1/libsecp256k1/src/scalar.h
View File

@ -72,7 +72,7 @@ static int secp256k1_scalar_is_zero(const secp256k1_scalar *a);
/** Check whether a scalar equals one. */
static int secp256k1_scalar_is_one(const secp256k1_scalar *a);
/** Check whether a scalar, considered as an nonnegative integer, is even. */
/** Check whether a scalar, considered as a nonnegative integer, is even. */
static int secp256k1_scalar_is_even(const secp256k1_scalar *a);
/** Check whether a scalar is higher than the group order divided by 2. */

4
crypto/keys/secp256k1/internal/secp256k1/libsecp256k1/src/tests_exhaustive.c
View File

@ -262,7 +262,7 @@ void test_exhaustive_sign(const secp256k1_context *ctx, const secp256k1_ge *grou
secp256k1_ecdsa_signature_load(ctx, &r, &s, &sig);
/* Note that we compute expected_r *after* signing -- this is important
* because our nonce-computing function function might change k during
* because our nonce-computing function might change k during
* signing. */
r_from_k(&expected_r, group, k);
CHECK(r == expected_r);
@ -335,7 +335,7 @@ void test_exhaustive_recovery_sign(const secp256k1_context *ctx, const secp256k1
secp256k1_ecdsa_recoverable_signature_convert(ctx, &sig, &rsig);
secp256k1_ecdsa_signature_load(ctx, &r, &s, &sig);
/* Note that we compute expected_r *after* signing -- this is important
* because our nonce-computing function function might change k during
* because our nonce-computing function might change k during
* signing. */
r_from_k(&expected_r, group, k);
CHECK(r == expected_r);