chore: fix some typos in comment (#5075)

Signed-off-by: riyueguang <[email protected]>

Author: riyueguang

pkg/storageincentives/agent.go

@@ -390,7 +390,7 @@ func (a *Agent) handleClaim(ctx context.Context, round uint64) error {
 }
 
 func (a *Agent) handleSample(ctx context.Context, round uint64) (bool, error) {
-	// minimum proximity between the achor and the stored chunks
+	// minimum proximity between the anchor and the stored chunks
 	committedDepth := a.store.CommittedDepth()
 
 	if a.state.IsFrozen() {

pkg/storer/internal/reserve/reserve.go

@@ -497,7 +497,7 @@ func (r *Reserve) IterateChunksItems(startBin uint8, cb func(*ChunkBinItem) (boo
 	return err
 }
 
-// Reset removes all the entires in the reserve. Must be done before any calls to the reserve.
+// Reset removes all the entries in the reserve. Must be done before any calls to the reserve.
 func (r *Reserve) Reset(ctx context.Context) error {
 	size := r.Size()
 

pkg/storer/sample.go

@@ -54,7 +54,7 @@ type Sample struct {
 // In order to optimize this we use a simple pipeline pattern:
 // Iterate chunk addresses -> Get the chunk data and calculate transformed hash -> Assemble the sample
 // If the node has doubled their capacity by some factor, sampling process need to only pertain to the
-// chunks of the selected neighborhood as determined by the anchor and the "committed depth" and NOT the whole reseve.
+// chunks of the selected neighborhood as determined by the anchor and the "committed depth" and NOT the whole reserve.
 // The committed depth is the sum of the radius and the doubling factor.
 // For example, the committed depth is 11, but the local node has a doubling factor of 3, so the
 // local radius will eventually drop to 8. The sampling must only consider chunks with proximity 11 to the anchor.