From 470916de461e46b8770a0a36ebffe674a5d2fca5 Mon Sep 17 00:00:00 2001 From: Gary Rong Date: Mon, 11 Mar 2024 18:05:34 +0800 Subject: [PATCH] core: fix comment --- core/blockchain.go | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/core/blockchain.go b/core/blockchain.go index 33e302b03c..4fd344616b 100644 --- a/core/blockchain.go +++ b/core/blockchain.go @@ -628,14 +628,14 @@ func (bc *BlockChain) rewindHashHead(root common.Hash) (*types.Header, uint64) { start = time.Now() // Timestamp the rewinding is restarted logged = time.Now() // Timestamp last progress log was printed ) - // The oldest block to be searched is determined by the pivot block or a soft - // finality threshold. The rationale behind this is as follows: + // The oldest block to be searched is determined by the pivot block or a constant + // searching threshold. The rationale behind this is as follows: // // - Snap sync is selected if the pivot block is available. The earliest available // state is the pivot block itself, so there is no sense in going further back. // // - Full sync is selected if the pivot block does not exist. The hash database - // periodically flushes the state to disk, and the soft finality threshold is + // periodically flushes the state to disk, and the used searching threshold is // considered sufficient to find a persistent state, even for the testnet. It // might be not enough for a chain that is nearly empty. In the worst case, // the entire chain is reset to genesis, and snap sync is re-enabled on top,