Longest-Chain Rule

Nakamoto's fork-choice rule: honest nodes build on the branch with the most cumulative work, so competing blocks become orphans and deep reorgs get exponentially unlikely. Expect to explain why confirmations give probabilistic finality only, and where the six-confirmation habit comes from.