interesting
/
go-ethereum
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

chore: fix various comments (#31082)

This commit is contained in:
Christina 2025-01-28 17:56:23 +02:00 committed by GitHub
parent f0e8a3e9c8
commit 9516e0f6b6
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
4 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
core/vm/eof_validation_test.go
View File

@ -363,7 +363,7 @@ func BenchmarkEOFValidation(b *testing.B) {
} }
} }
// BenchmarkEOFValidation tries to benchmark the code validation for the CALLF/RETF operation. // BenchmarkEOFValidation2 tries to benchmark the code validation for the CALLF/RETF operation.
// For this we set up code that calls into 1024 code sections which // For this we set up code that calls into 1024 code sections which
// - contain calls to some other code sections. // - contain calls to some other code sections.
// We can't have all code sections calling each other, otherwise we would exceed 48KB. // We can't have all code sections calling each other, otherwise we would exceed 48KB.

2
tests/fuzzers/bls12381/bls12381_fuzz.go
View File

@ -346,7 +346,7 @@ func multiExpG1Gnark(gs []gnark.G1Affine, scalars []fr.Element) gnark.G1Affine {
return res return res
} }
// multiExpG1Gnark is a naive implementation of G1 multi-exponentiation // multiExpG2Gnark is a naive implementation of G2 multi-exponentiation
func multiExpG2Gnark(gs []gnark.G2Affine, scalars []fr.Element) gnark.G2Affine { func multiExpG2Gnark(gs []gnark.G2Affine, scalars []fr.Element) gnark.G2Affine {
res := gnark.G2Affine{} res := gnark.G2Affine{}
for i := 0; i < len(gs); i++ { for i := 0; i < len(gs); i++ {

4
triedb/pathdb/database.go
View File

@ -471,8 +471,8 @@ func (db *Database) Recoverable(root common.Hash) bool {
if id == nil { if id == nil {
return false return false
} }
// Recoverable state must below the disk layer. The recoverable // Recoverable state must be below the disk layer. The recoverable
// state only refers the state that is currently not available, // state only refers to the state that is currently not available,
// but can be restored by applying state history. // but can be restored by applying state history.
dl := db.tree.bottom() dl := db.tree.bottom()
if *id >= dl.stateID() { if *id >= dl.stateID() {

4
triedb/pathdb/difflayer.go
View File

@ -27,8 +27,8 @@ import (
// diffLayer represents a collection of modifications made to the in-memory tries // diffLayer represents a collection of modifications made to the in-memory tries
// along with associated state changes after running a block on top. // along with associated state changes after running a block on top.
// //
// The goal of a diff layer is to act as a journal, tracking recent modifications // The purpose of a diff layer is to serve as a journal, recording recent state modifications
// made to the state, that have not yet graduated into a semi-immutable state. // that have not yet been committed to a more stable or semi-permanent state.
type diffLayer struct { type diffLayer struct {
// Immutables // Immutables
root common.Hash // Root hash to which this layer diff belongs to root common.Hash // Root hash to which this layer diff belongs to