How do fork choice rules operate?
Fork choice rules are the algorithms by which nodes select the canonical chain when two or more competing chain branches exist simultaneously. These rules evaluate competing branches against defined criteria and select one as the authoritative chain that all subsequent block production builds upon. The specific criteria vary by consensus mechanism, with proof-of-work chains applying accumulated difficulty metrics and proof-of-stake chains applying attestation weight calculations to determine which branch represents the valid canonical chain at any given point. https://crypto.games/ fork choice accuracy determines whether settlement transactions, deposit confirmations, and outcome records are treated as permanently included in the canonical chain or require resubmission following a branch reorganisation that displaces previously confirmed blocks from the active chain.
What fork choice algorithms apply?
- Longest chain rule
Proof-of-work networks select the branch with the greatest accumulated computational difficulty as the canonical chain. Nodes switch to a longer branch when one is discovered, reorganising any blocks from the shorter branch that are not part of the newly selected canonical sequence.
- LMD GHOST
Latest Message Driven Greediest Heaviest Observed SubTree weights competing branches by the most recent attestations from each validator, selecting the branch with the greatest attestation weight at each fork point rather than counting total attestations across all historical time.
- Finalised checkpoint anchoring
Fork choice rules on networks with explicit finality mechanisms anchor canonical chain selection to the most recently finalised checkpoint. Branches that do not build on the finalised checkpoint are excluded from canonical chain consideration regardless of their attestation weight or accumulated difficulty values.
- Attestation weight calculation
Attestation-weighted fork choice sums the effective balance of all validators whose most recent attestation supports each competing branch. The branch with the greater total attesting balance is selected as canonical, making the fork choice outcome a function of stake distribution rather than block production speed.
Reorganisation effects on confirmations
Reorganisations occur when the fork choice rule selects a different branch as canonical, displacing blocks previously treated as confirmed. Transactions within displaced blocks return to unconfirmed status and must be reincluded in subsequent blocks on the newly selected canonical branch before regaining confirmed status on the active chain. Shallow reorganisations affecting one or two blocks are resolved quickly as the newly canonical branch extends and transactions are reincluded by validators processing the pending mempool entries. Deeper reorganisations affecting multiple block depths produce longer periods during which affected transactions remain unconfirmed, and platform operations dependent on those transactions are held in a pending state.
Confirmation depth and platform policy
Gaming platforms define confirmation depth policies that align with the fork choice characteristics of their host chain. A platform on a network where the fork choice rule produces rapid finality sets lower confirmation depth requirements than one operating on a network where reorganisation probability decreases gradually with additional block depth above the transaction’s containing block.
- Confirmation policies are applied at the transaction processing layer, queuing incoming deposit and settlement transactions until their containing block reaches the required depth.
- Fork choice behaviour under normal network conditions sets the baseline for this depth requirement.
- Platform settlement reliability standards determine the margin applied above the baseline threshold for each transaction category.
- Transactions reincluded after a reorganisation carry identical content to their original submissions, as transaction data is preserved in the mempool until confirmation depth thresholds are met and the platform processing layer accepts the transaction as actionable.
Fork choice rules determine which chain branch is treated as canonical at every point of competing branch production. Confirmation depth policies, reorganisation handling, and algorithm-specific selection criteria collectively govern how accurately a gaming platform treats block confirmations as permanent across its transaction processing pipeline.
