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.

Sign up for GitHub

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

chore:fix typo #9952

Merged
merged 2 commits into from
Apr 24, 2024
Merged

chore:fix typo #9952

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
8329cf7
chore:fix typo
goofylfg Apr 16, 2024
2287499
Update util.go
goofylfg Apr 16, 2024
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
2 changes: 1 addition & 1 deletion cl/phase1/core/state/shuffling/util.go
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -23,7 +23,7 @@ func ComputeShuffledIndex(conf *clparams.BeaconChainConfig, ind, ind_count uint6
// Read hash value.
hashValue := binary.LittleEndian.Uint64(preInputs[i][:8])

// Caclulate pivot and flip.
// Calculate pivot and flip.
pivot := hashValue % ind_count
flip := (pivot + ind_count - ind) % ind_count

Expand Down
2 changes: 1 addition & 1 deletion eth/stagedsync/bor_heimdall_shared.go
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -176,7 +176,7 @@ func fetchAndWriteHeimdallStateSyncEvents(
/* TODO
// we want to get as many historical events as we can in
// each call to heimdall - but we need to make sure we
// don't type to get too recent a sync othewise it will
// don't type to get too recent a sync otherwise it will
// return a nil response

// to implement this we need to do block processing vs the
Expand Down
Loading