5a3f08293b
Currently the code that rejects old block versions once the majority of the network has upgraded is performed using a loop that iterates backwards from latest enforced block version while checking for a majority upgrade at each version. This is inefficient for blocks early in the chain since it means multiple versions need to be checked when it isn't really necessary. This optimizes the relevant code by taking into account that the relevant enforcement semantics reduce to the following: - Block versions greater than or equal to the latest enforced block version can never be rejected for being old - Block versions must be rejected when the majority of the network has upgraded to ANY version greater than that version The following timing information obtained from profiling shows the overall reduction achieved with the optimized code for mainnet: existing: Total time to check old versions for 645603 headers: 10.61118s optimized: Total time to check old versions for 645603 headers: 3.52555s |
||
|---|---|---|
| .. | ||
| chaingen | ||
| fullblocktests | ||
| indexers | ||
| internal | ||
| stake | ||
| standalone | ||
| testdata | ||
| agendas_test.go | ||
| bench_test.go | ||
| blockindex_test.go | ||
| blockindex.go | ||
| chain_test.go | ||
| chain.go | ||
| chainio_test.go | ||
| chainio.go | ||
| chainquery.go | ||
| chainview_test.go | ||
| chainview.go | ||
| checkpoints.go | ||
| common_test.go | ||
| compress_test.go | ||
| compress.go | ||
| difficulty_test.go | ||
| difficulty.go | ||
| doc.go | ||
| error_test.go | ||
| error.go | ||
| example_test.go | ||
| fullblocks_test.go | ||
| fullblocksstakeversion_test.go | ||
| go.mod | ||
| go.sum | ||
| headercmt_test.go | ||
| headercmt.go | ||
| log.go | ||
| mediantime_test.go | ||
| mediantime.go | ||
| notifications.go | ||
| process_test.go | ||
| process.go | ||
| prune.go | ||
| README.md | ||
| scriptval.go | ||
| sequencelock_test.go | ||
| sequencelock.go | ||
| stakeext.go | ||
| stakenode.go | ||
| stakeversion_test.go | ||
| stakeversion.go | ||
| subsidy.go | ||
| thresholdstate_test.go | ||
| thresholdstate.go | ||
| timesorter_test.go | ||
| timesorter.go | ||
| treasury_policy_test.go | ||
| treasury_test.go | ||
| treasury.go | ||
| upgrade_test.go | ||
| upgrade.go | ||
| utxobackend_test.go | ||
| utxobackend.go | ||
| utxobackenditerator.go | ||
| utxobackendtx.go | ||
| utxocache_test.go | ||
| utxocache.go | ||
| utxoentry_test.go | ||
| utxoentry.go | ||
| utxoio_test.go | ||
| utxoio.go | ||
| utxoviewpoint_test.go | ||
| utxoviewpoint.go | ||
| validate_test.go | ||
| validate.go | ||
| votebits_test.go | ||
| votebits.go | ||
blockchain
Package blockchain implements Decred block handling and chain selection rules.
The Decred block handling and chain selection rules are an integral, and quite likely the most important, part of Decred. At its core, Decred is a distributed consensus of which blocks are valid and which ones will comprise the main block chain (public ledger) that ultimately determines accepted transactions, so it is extremely important that fully validating nodes agree on all rules.
At a high level, this package provides support for inserting new blocks into the block chain according to the aforementioned rules. It includes functionality such as rejecting duplicate blocks, ensuring blocks and transactions follow all rules, and best chain selection along with reorganization.
Since this package does not deal with other Decred specifics such as network communication or wallets, it provides a notification system which gives the caller a high level of flexibility in how they want to react to certain events such as newly connected main chain blocks which might result in wallet updates.
A comprehensive suite of tests is provided to ensure proper functionality.
Decred Chain Processing Overview
Before a block is allowed into the block chain, it must go through an intensive series of validation rules. The following list serves as a general outline of those rules to provide some intuition into what is going on under the hood, but is by no means exhaustive:
- Reject duplicate blocks
- Perform a series of sanity checks on the block and its transactions such as verifying proof of work, timestamps, number and character of transactions, transaction amounts, script complexity, and merkle root calculations
- Compare the block against predetermined checkpoints for expected timestamps and difficulty based on elapsed time since the checkpoint
- Perform a series of more thorough checks that depend on the block's position within the block chain such as verifying block difficulties adhere to difficulty retarget rules, timestamps are after the median of the last several blocks, all transactions are finalized, checkpoint blocks match, and block versions are in line with the previous blocks
- Determine how the block fits into the chain and perform different actions accordingly in order to ensure any side chains which have higher difficulty than the main chain become the new main chain
- When a block is being connected to the main chain (either through reorganization of a side chain to the main chain or just extending the main chain), perform further checks on the block's transactions such as verifying transaction duplicates, script complexity for the combination of connected scripts, coinbase maturity, double spends, and connected transaction values
- Run the transaction scripts to verify the spender is allowed to spend the coins
- Insert the block into the block database
Processing Order
This package supports headers-first semantics such that block data can be processed out of order so long as the associated header is already known.
The headers themselves, however, must be processed in the correct order since headers that do not properly connect are rejected. In other words, orphan headers are not allowed.
The processing code always maintains the best chain as the branch tip that has the most cumulative proof of work, so it is important to keep that in mind when considering errors returned from processing blocks.
Notably, due to the ability to process blocks out of order, and the fact blocks can only be fully validated once all of their ancestors have the block data available, it is to be expected that no error is returned immediately for blocks that are valid enough to make it to the point they require the remaining ancestor block data to be fully validated even though they might ultimately end up failing validation. Similarly, because the data for a block becoming available makes any of its direct descendants that already have their data available eligible for validation, an error being returned does not necessarily mean the block being processed is the one that failed validation.
Installation and Updating
This package is part of the github.com/decred/dcrd/blockchain/v3 module. Use
the standard go tooling for working with modules to incorporate it.
Examples
- ProcessBlock Example Demonstrates how to create a new chain instance and use ProcessBlock to attempt to add a block to the chain. This example intentionally attempts to insert a duplicate genesis block to illustrate how an invalid block is handled.
License
Package blockchain is licensed under the copyfree ISC License.