diff options
| author | Bitflash <btf01@proton.me> | 2026-07-31 08:53:27 -0300 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2026-07-31 08:53:27 -0300 |
| commit | 3bbfb50ef85feeddad936eb1fe8cce232410b8a6 (patch) | |
| tree | a3a8b628489f81159aa417bbe44650b9c9eaf5c4 /src/db.cpp | |
| parent | 50b0a91b5dddd38f3094b9e97db77773d8299442 (diff) | |
db: verify the tail of the chain on startup and back out of a bad tip (#61)
A node that accepted blocks its current rules would reject -- because it
was running an older build, or because the tip it landed on was never valid
-- had no way to notice. It kept the branch, kept building on it, and kept
mining coins the rest of the network throws away. The only cure was
deleting blk*.dat by hand, which requires knowing something is wrong. A
node here once mined a 323-block fork for five days that way.
On load, walk back from the tip running CheckBlock on each block. If one
fails, move the best chain back to its parent, disconnect what came after,
and let the node re-download from peers. Satoshi added this after the block
74638 incident for the same reason: so it would not have needed anyone to
delete files.
Only the last 288 blocks are checked by default -- about ten hours at a
two-minute target -- because every check costs a RandomX hash.
/checkblocks=N changes it, 0 does the whole chain.
The repair deliberately runs in LoadBlockIndex() in main.cpp rather than in
CTxDB::LoadBlockIndex where the detection happens. CTxDB::LoadBlockIndex
walks the index with a cursor it never closes, so it still holds read locks
when it returns, and a write transaction opened alongside it waits on them
forever. That is measured, not guessed: the first version came up, printed
the diagnosis, and hung with nothing in any log. Closing that cursor is a
separate fix worth making on its own.
A failed rollback reports and starts anyway. Refusing to start would leave
the operator with no node to read the message from.
What this catches is what CheckBlock catches: proof of work, merkle root,
duplicate transactions, sigops, timestamps. It does not re-verify
signatures or spends, which would mean rebuilding the transaction index.
Verified by forcing a block at tip-5 to fail: the node reported the bad
block, moved back six, stayed up, and re-synced past its old tip. Without
the forced failure it verifies 288 and says so.
Diffstat (limited to 'src/db.cpp')
| -rw-r--r-- | src/db.cpp | 41 |
1 files changed, 41 insertions, 0 deletions
| @@ -435,6 +435,47 @@ bool CTxDB::LoadBlockIndex() | |||
| 435 | nBestHeight = pindexBest->nHeight; | 435 | nBestHeight = pindexBest->nHeight; |
| 436 | printf("LoadBlockIndex(): hashBestChain=%s height=%d\n", hashBestChain.ToString().substr(0,14).c_str(), nBestHeight); | 436 | printf("LoadBlockIndex(): hashBestChain=%s height=%d\n", hashBestChain.ToString().substr(0,14).c_str(), nBestHeight); |
| 437 | 437 | ||
| 438 | // Verify the tail of the best chain, and fall back to the last good block | ||
| 439 | // if any of it fails. | ||
| 440 | // | ||
| 441 | // A node that accepted blocks its current rules would reject -- because it | ||
| 442 | // was running an older build, or because the tip it landed on was never | ||
| 443 | // valid -- has no way to notice on its own. It keeps the branch, keeps | ||
| 444 | // building on it, and keeps mining coins that the rest of the network | ||
| 445 | // throws away. The only cure used to be deleting blk*.dat by hand, which | ||
| 446 | // requires knowing something is wrong in the first place. That is how a | ||
| 447 | // node here once mined a 323-block fork for five days. | ||
| 448 | // | ||
| 449 | // Checking every block on every start would mean a RandomX hash per block, | ||
| 450 | // so only the tail is checked by default. /checkblocks=0 does the lot. | ||
| 451 | int nCheckBlocks = nCheckBlocksOnLoad; | ||
| 452 | CBlockIndex* pindexFork = NULL; | ||
| 453 | int nChecked = 0; | ||
| 454 | for (CBlockIndex* pindex = pindexBest; pindex && pindex->pprev; pindex = pindex->pprev) | ||
| 455 | { | ||
| 456 | if (nCheckBlocks > 0 && nChecked >= nCheckBlocks) | ||
| 457 | break; | ||
| 458 | nChecked++; | ||
| 459 | CBlock block; | ||
| 460 | if (!block.ReadFromDisk(pindex->nFile, pindex->nBlockPos, true)) | ||
| 461 | return error("LoadBlockIndex() : ReadFromDisk failed at height %d", pindex->nHeight); | ||
| 462 | if (!block.CheckBlock()) | ||
| 463 | { | ||
| 464 | printf("LoadBlockIndex() : *** bad block at height %d, hash=%s\n", | ||
| 465 | pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,14).c_str()); | ||
| 466 | // Keep going: an older bad block further back wins, because | ||
| 467 | // everything after it has to come off too. | ||
| 468 | pindexFork = pindex->pprev; | ||
| 469 | } | ||
| 470 | } | ||
| 471 | printf("LoadBlockIndex(): verified %d block(s)\n", nChecked); | ||
| 472 | |||
| 473 | // The repair itself happens in the caller, after this handle is closed. | ||
| 474 | // The cursor above is still open and holds read locks, so a write | ||
| 475 | // transaction opened here waits on it forever -- measured: the node came | ||
| 476 | // up, printed the diagnosis, and hung with no error anywhere. | ||
| 477 | pindexBadChainFork = pindexFork; | ||
| 478 | |||
| 438 | return true; | 479 | return true; |
| 439 | } | 480 | } |
| 440 | 481 | ||