Branch: master
Find file Copy path
fcd3461 Jul 7, 2017
1 contributor

Users who have contributed to this file

214 lines (144 sloc) 12.2 KB

  BIP: 8
  Title: Version bits with lock-in by height
  Author: Shaolin Fry <>
  Comments-Summary: No comments yet.
  Status: Draft
  Type: Informational
  Created: 2017-02-01
  License: BSD-3-Clause

Table of Contents


This document specifies an alteration to BIP9 that replaces time based activation with block height, as well as guaranteed activation of backward-compatible changes (further called "soft forks").

The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted as described in RFC 2119.


BIP9 introduced a mechanism for doing parallel soft forking deployments based on repurposing the block nVersion field. Activation is dependent on near unanimous hashrate signalling which may be impractical and result in veto by a small minority of non-signalling hashrate. Super majority hashrate based activation triggers allow for accelerated activation where the majority hash power enforces the new rules in lieu of full nodes upgrading. Since all consensus rules are ultimately enforced by full nodes, eventually any new soft fork will be enforced by the economy. This proposal combines these two aspects to provide eventual flag day activation after a reasonable time (recommended a year), as well as for accelerated activation by majority of hash rate before the flag date.

Block time is somewhat unreliable and may be intentionally or unintentionally inaccurate, so thresholds based on block time are not ideal. Secondly, BIP9 specified triggers based on the first retarget after a given time, which is non-intuitive. Since each new block must increase the height by one, thresholds based on block height are much more reliable and intuitive and can be calculated exactly for difficulty retarget.



This specification is the same as BIP9 except that MTP time based threshold are replaced with block height, and the state machine has no FAILED condition. The state transition from STARTED to LOCKED_IN will occur under two condition:

The first is when the threshold of blocks signalling is reached as per BIP9, before LOCKED_IN state has been reached. The second condition is when the block height reaches the timeout block height while still being in the STARTED state.


Each soft fork deployment is specified by the following per-chain parameters (further elaborated below):

  1. The name specifies a very brief description of the soft fork, reasonable for use as an identifier. For deployments described in a single BIP, it is recommended to use the name "bipN" where N is the appropriate BIP number.
  2. The bit determines which bit in the nVersion field of the block is to be used to signal the soft fork lock-in and activation. It is chosen from the set {0,1,2,...,28}.
  3. The startheight specifies a minimum block height at which a block at which the bit gains its meaning.
  4. The timeoutheight specifies a block height at which the deployment should lock-in if not already locked in or activated.

Selection guidelines

The following guidelines are suggested for selecting these parameters for a soft fork:

  1. name should be selected such that no two softforks, concurrent or otherwise, ever use the same name.
  2. bit should be selected such that no two concurrent softforks use the same bit.
  3. startheight should be set to some block height in the future, approximately 30 days (or 4320 blocks) after a software release date including the soft fork. This allows for some release delays, while preventing triggers as a result of parties running pre-release software. The startheight should be a retarget block height for simplicity.
  4. timeoutheight should be 1 year, or 52416 blocks (26 retarget intervals) after startheight.
A later deployment using the same bit is possible as long as the startheight is after the previous one's timeoutheight or activation, but it is discouraged until necessary, and even then recommended to have a pause in between to detect buggy software.


With each block and soft fork, we associate a deployment state. The possible states are:

  1. DEFINED is the first state that each soft fork starts out as. The genesis block is by definition in this state for each deployment.
  2. STARTED for blocks past the startheight.
  3. LOCKED_IN for one retarget period after the first retarget period with STARTED blocks of which at least threshold have the associated bit set in nVersion.
  4. ACTIVE for all blocks after the LOCKED_IN retarget period.
  5. FAILED if block height is greater than or equal to timeoutheight during the DEFINED state.

Bit flags

The nVersion block header field is to be interpreted as a 32-bit little-endian integer (as present), and bits are selected within this integer as values (1 << N) where N is the bit number.

Blocks in the STARTED state get an nVersion whose bit position bit is set to 1. The top 3 bits of such blocks must be 001, so the range of actually possible nVersion values is [0x20000000...0x3FFFFFFF], inclusive.

Due to the constraints set by BIP 34, BIP 66 and BIP 65, we only have 0x7FFFFFFB possible nVersion values available. This restricts us to at most 30 independent deployments. By restricting the top 3 bits to 001 we get 29 out of those for the purposes of this proposal, and support two future upgrades for different mechanisms (top bits 010 and 011). When a block nVersion does not have top bits 001, it is treated as if all bits are 0 for the purposes of deployments.

Miners should continue setting the bit in LOCKED_IN phase so uptake is visible, though this has no effect on consensus rules.

New consensus rules

The new consensus rules for each soft fork are enforced for each block that has ACTIVE state.

State transitions

The genesis block has state DEFINED for each deployment, by definition.

    State GetStateForBlock(block) {
        if (block.height == 0) {
            return DEFINED;

All blocks within a retarget period have the same state. This means that if floor(block1.height / 2016) = floor(block2.height / 2016), they are guaranteed to have the same state for every deployment.

        if ((block.height % 2016) != 0) {
            return GetStateForBlock(block.parent);

Otherwise, the next state depends on the previous state:

    switch (GetStateForBlock(GetAncestorAtHeight(block, block.height - 2016))) {

We remain in the initial state until either we pass the start block height or the timeout height.

        case DEFINED:
            if (block.height >= timeoutheight) {
                return FAILED;
            if (block.height >= startheight) {
                return STARTED;
            return DEFINED;

After a period in the STARTED state, if we're past the timeout, we switch to LOCKED_IN. If not, we tally the bits set, and transition to LOCKED_IN if a sufficient number of blocks in the past period set the deployment bit in their version numbers. The threshold is ≥1916 blocks (95% of 2016), or ≥1512 for testnet (75% of 2016).

There could be two non-overlapping deployments on the same bit, where the first one transitions to LOCKED_IN while the other one simultaneously transitions to STARTED, which would mean both would demand setting the bit.

Note that a block's state never depends on its own nVersion; only on that of its ancestors.

        case STARTED:
            if (block.height >= timeoutheight)
                return LOCKED_IN;

            int count = 0;
            walk = block;
            for (i = 0; i < 2016; i++) {
                walk = walk.parent;
                if (walk.nVersion & 0xE0000000 == 0x20000000 && (walk.nVersion >> bit) & 1 == 1) {
            if (count >= threshold) {
                return LOCKED_IN;
            return STARTED;

After a retarget period of LOCKED_IN, we automatically transition to ACTIVE.

        case LOCKED_IN:
            return ACTIVE;

And ACTIVE is terminal a state, which a deployment stays in once reached.

        case ACTIVE:
            return ACTIVE;

Implementation It should be noted that the states are maintained along block chain branches, but may need recomputation when a reorganization happens.

Given that the state for a specific block/deployment combination is completely determined by its ancestry before the current retarget period (i.e. up to and including its ancestor with height block.height - 1 - (block.height % 2016)), it is possible to implement the mechanism above efficiently and safely by caching the resulting state of every multiple-of-2016 block, indexed by its parent.

Warning mechanism

To support upgrade warnings, an extra "unknown upgrade" is tracked, using the "implicit bit" mask = (block.nVersion & ~expectedVersion) != 0. Mask will be non-zero whenever an unexpected bit is set in nVersion. Whenever LOCKED_IN for the unknown upgrade is detected, the software should warn loudly about the upcoming soft fork. It should warn even more loudly after the next retarget period (when the unknown upgrade is in the ACTIVE state).

getblocktemplate changes

The template request Object is extended to include a new item:

template request
Key Required Type Description
rules No Array of Strings list of supported softfork deployments, by name

The template Object is also extended:

Key Required Type Description
rules Yes Array of Strings list of softfork deployments, by name, that are active state
vbavailable Yes Object set of pending, supported softfork deployments; each uses the softfork name as the key, and the softfork bit as its value
vbrequired No Number bit mask of softfork deployment version bits the server requires enabled in submissions

The "version" key of the template is retained, and used to indicate the server's preference of deployments. If versionbits is being used, "version" MUST be within the versionbits range of [0x20000000...0x3FFFFFFF]. Miners MAY clear or set bits in the block version WITHOUT any special "mutable" key, provided they are listed among the template's "vbavailable" and (when clearing is desired) NOT included as a bit in "vbrequired".

Softfork deployment names listed in "rules" or as keys in "vbavailable" may be prefixed by a '!' character. Without this prefix, GBT clients may assume the rule will not impact usage of the template as-is; typical examples of this would be when previously valid transactions cease to be valid, such as BIPs 16, 65, 66, 68, 112, and 113. If a client does not understand a rule without the prefix, it may use it unmodified for mining. On the other hand, when this prefix is used, it indicates a more subtle change to the block structure or generation transaction; examples of this would be BIP 34 (because it modifies coinbase construction) and 141 (since it modifies the txid hashing and adds a commitment to the generation transaction). A client that does not understand a rule prefixed by '!' must not attempt to process the template, and must not attempt to use it for mining even unmodified.

Reference implementation

Backwards compatibility

BIP8 and BIP9 deployments should not share concurrent active deployment bits. Nodes that only implement BIP9 will not activate a BIP8 soft fork if hashpower threshold is not reached by timeout, however, those nodes will still accept the blocks generated by activated nodes.


A living list of deployment proposals can be found here.



Mailing list discussion


This document is dual licensed as BSD 3-clause, and Creative Commons CC0 1.0 Universal.