Skip to content

Commit

Permalink
chore: fix some problematic method name and typos in comment
Browse files Browse the repository at this point in the history
Signed-off-by: thirdkeyword <[email protected]>
  • Loading branch information
thirdkeyword committed Dec 19, 2024
1 parent 36ac667 commit f7bacf6
Show file tree
Hide file tree
Showing 5 changed files with 5 additions and 5 deletions.
2 changes: 1 addition & 1 deletion cmd/datool/datool.go
Original file line number Diff line number Diff line change
Expand Up @@ -99,7 +99,7 @@ func parseClientStoreConfig(args []string) (*ClientStoreConfig, error) {
f.String("url", "", "URL of DAS server to connect to")
f.String("message", "", "message to send")
f.Int("random-message-size", 0, "send a message of a specified number of random bytes")
f.String("signing-key", "", "ecdsa private key to sign the message with, treated as a hex string if prefixed with 0x otherise treated as a file; if not specified the message is not signed")
f.String("signing-key", "", "ecdsa private key to sign the message with, treated as a hex string if prefixed with 0x otherwise treated as a file; if not specified the message is not signed")
f.String("signing-wallet", "", "wallet containing ecdsa key to sign the message with")
f.String("signing-wallet-password", genericconf.PASSWORD_NOT_SET, "password to unlock the wallet, if not specified the user is prompted for the password")
f.Duration("das-retention-period", 24*time.Hour, "The period which DASes are requested to retain the stored batches.")
Expand Down
2 changes: 1 addition & 1 deletion execution/nodeInterface/NodeInterface.go
Original file line number Diff line number Diff line change
Expand Up @@ -405,7 +405,7 @@ func (n NodeInterface) ConstructOutboxProof(c ctx, evm mech, size, leaf uint64)

if !balanced {
// This tree isn't balanced, so we'll need to use the partials to recover the missing info.
// To do this, we'll walk the boundry of what's known, computing hashes along the way
// To do this, we'll walk the boundary of what's known, computing hashes along the way

step := *minPartialPlace
step.Leaf += 1 << step.Level // we start on the min partial's zero-hash sibling
Expand Down
2 changes: 1 addition & 1 deletion relay/relay_stress_test.go
Original file line number Diff line number Diff line change
Expand Up @@ -93,7 +93,7 @@ func (ts *dummyTxStreamer) AddBroadcastMessages(feedMessages []*message.Broadcas
time.Sleep(50 * time.Millisecond)
if !ts.logConnection {
ts.logConnection = true
log.Info("test client is succesfully receiving messages", "client_Id", ts.id, "msg_size", feedMessages[0].Size())
log.Info("test client is successfully receiving messages", "client_Id", ts.id, "msg_size", feedMessages[0].Size())
}
return nil
}
Expand Down
2 changes: 1 addition & 1 deletion system_tests/outbox_test.go
Original file line number Diff line number Diff line change
Expand Up @@ -283,7 +283,7 @@ func TestOutboxProofs(t *testing.T) {

if !balanced {
// This tree isn't balanced, so we'll need to use the partials to recover the missing info.
// To do this, we'll walk the boundry of what's known, computing hashes along the way
// To do this, we'll walk the boundary of what's known, computing hashes along the way

zero := common.Hash{}

Expand Down
2 changes: 1 addition & 1 deletion system_tests/seqinbox_test.go
Original file line number Diff line number Diff line change
Expand Up @@ -353,7 +353,7 @@ func testSequencerInboxReaderImpl(t *testing.T, validator bool) {
AfterDelayedMessagesRead: 1,
})
if diff := diffAccessList(accessed, *wantAL); diff != "" {
t.Errorf("Access list mistmatch:\n%s\n", diff)
t.Errorf("Access list mismatch:\n%s\n", diff)
}
if i%5 == 0 {
tx, err = seqInbox.AddSequencerL2Batch(&seqOpts, big.NewInt(int64(len(blockStates))), batchData, big.NewInt(1), gasRefunderAddr, big.NewInt(0), big.NewInt(0))
Expand Down

0 comments on commit f7bacf6

Please sign in to comment.