Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

multi: Fix a few typos. #2923

Merged
merged 1 commit into from
Apr 12, 2022
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
8 changes: 4 additions & 4 deletions blockchain/validate.go
Original file line number Diff line number Diff line change
Expand Up @@ -4027,10 +4027,10 @@ func (b *BlockChain) checkConnectBlock(node *blockNode, block, parent *dcrutil.B
// earlier in the block which will typically not already be available in the
// view for the caller until after this function returns. That means the
// caller would have to perform duplicate work that this function already
// performs to be able to create the filter. Since the filter is is needed
// at this point to verify the header commitments, a good option is to
// simply create it here and allow the caller to request the filter be
// returned to it.
// performs to be able to create the filter. Since the filter is needed at
// this point to verify the header commitments, a good option is to simply
// create it here and allow the caller to request the filter be returned to
// it.
filter, err := blockcf2.Regular(block.MsgBlock(), view)
if err != nil {
return ruleError(ErrMissingTxOut, err.Error())
Expand Down
2 changes: 1 addition & 1 deletion dcrec/secp256k1/ecdsa/signature.go
Original file line number Diff line number Diff line change
Expand Up @@ -822,7 +822,7 @@ func RecoverCompact(signature, hash []byte) (*secp256k1.PublicKey, bool, error)
// The method described by section 4.1.6 of [SEC1] to determine which one is
// the correct one involves calculating each possibility as a candidate
// public key and comparing the candidate to the authentic public key. It
// also hints that is is possible to generate the signature in a such a
// also hints that it is possible to generate the signature in a such a
// way that only one of the candidate public keys is viable.
//
// A more efficient approach that is specific to the secp256k1 curve is used
Expand Down
2 changes: 1 addition & 1 deletion dcrec/secp256k1/schnorr/signature_test.go
Original file line number Diff line number Diff line change
Expand Up @@ -265,7 +265,7 @@ func TestSchnorrSignAndVerify(t *testing.T) {
// Ensure the test data is sane by comparing the provided hashed message
// and nonce, in the case rfc6979 was used, to their calculated values.
// These values could just be calculated instead of specified in the
// test data, but it's nice to have all of the calcuated values
// test data, but it's nice to have all of the calculated values
// available in the test data for cross implementation testing and
// verification.
calcHash := blake256.Sum256(msg)
Expand Down