On this page
- §0 The area in one paragraph
- §1 The activation clock
- §2 Where a height comes from
- §3 Transaction-type gates
- §4 The rule table
- §4a Intervals, retirement and warm-up
- §4b Rule bundles and the readiness gate
- §4c The rule-activation record
- §5 What a boundary means for an implementation
- §6 The rules API
- §7 Data, consensus and local
29 — Rule-activation index
Out of scope the behaviour each rule switches (specified in the chapters the table cites); the genesis consensus-parameter encoding itself (06 §2); governance votes and the release registry's transactions (17 §5, §6); the self-updater that installs a registered release (30 §9)
§0 The area in one paragraph
Every consensus change is scoped to a block height: a named rule is off below its activation height,
on from it, and off again from an optional retirement height, so a rule is an interval [on, off); the decision is always taken against the height of the block being judged, never the node's tip,
so every node switches at the same block whatever day it was upgraded and an implementation replays
history under the rules in force when each block was made. There are 125 named rules. Both
relaunched chains, the DevNet and the TestNet, and the mainnet template list every one of them at height
0 in their genesis files, so the whole history of every chain built from 0.6.1 runs under all 125 and no
live chain runs the "before" side of any rule. The machinery stays part of the protocol because the next
release uses it: a rule may be retired at an off-height (§4a); a stateful rule may have a warm-up
(§4a); the rules a release adds form a bundle (the 24 rules of 0.6.1 are bundle 601) whose activation
waits for two thirds of the counted registered nodes to make blocks that signal the release, and a
node running an older release computes the same activation height from the release registry and the
block headers and stops producing exactly there (§4b); and every node writes a rule-activation
record of each edge it passes and refuses to start if its binary resolves an edge differently from the
chain's record (§4c). The 125 names, their compiled defaults, the interval / retirement / warm-up /
bundle fields, the precedence of §2, the type gates of §3, the readiness gate of §4b and the height each
check uses are consensus: an implementation must carry the table verbatim and evaluate every gated
decision at the block's height.
§1 The activation clock
Purpose. The one function an implementation uses to answer "is rule R in force for block h?" for every gated decision.
Inputs. A rule name (ASCII), a block height (u32), the overrides loaded at start (§2), the heights the readiness gate sets (§4b).
Output and effect. A boolean that selects one of two behaviours; nothing is written.
How to compute it.
on(name)= the readiness gate's height fornameif the gate set one (§4b: the bundle's effective height once decided, the pinned-off value0xFFFFFFFEwhile a gated bundle is pending), else the override from the genesis (§2), else the compiled default (§4), else 0 for a name not in the table (an unknown rule is on: a typo must never silently disable a check).off(name)= the genesisrule_off.<name>if set, else the table's default off-height, else never (0xFFFFFFFF).active(name, h): for a real height,on(name) ≤ h < off(name). Forh = 0xFFFFFFFF("unknown: the newest rules"), true only whenon(name) < 0xFFFFFFFE(the pinned-off value) and the rule is never retired.accumulating(name, h):max(on(name) − warmup(name), 0) ≤ h < off(name); forh = 0xFFFFFFFFit isactive(name, h).warmup(name)is the table's warm-up (0 for every rule of 0.6.1).- Which height each check uses: block validation and block application use the height of the block being judged; transaction admission uses "unknown", resolved to the node's highest block height + 1 (the block the transaction would land in; unresolved when the chain cannot be read); the fee estimate uses tip + 1; the pool's account-group gate and worst-case-outflow checks use "unknown" unresolved (the newest rules); the queue-attendance recency check uses the tip.
Rule activation. This is the activation mechanism; it has no height of its own.
Rejections and errors. None.
Vector. computed. INPUT: a rule with on(name) 5,000 and no retirement. EXPECTED OUTPUT: active
false at 4,999, true at 5,000 and 5,001, true at 0xFFFFFFFF. INPUT: the same rule retired at 9,000 →
true at 8,999, false at 9,000, false at 0xFFFFFFFF. INPUT: active("no_such_rule", 0) → true. INPUT:
a rule pinned off (on(name) = 0xFFFFFFFE) → false at every height and at 0xFFFFFFFF. INPUT: a rule
on at 10,000 with warm-up 1,440 → accumulating true from 8,560, active true from 10,000. INPUT:
receipt_once on either relaunched chain → on = 0, active true at every height.
Test cases · §1
7 cases · 7 valid · 1 reference
A rule on at 5,000 and never retired
Loading the test widget…
The same rule retired at 9,000
Loading the test widget…
A name not in the table is on
Loading the test widget…
A rule pinned off is off at every height, the unknown one included
Loading the test widget…
A rule on at 10,000 with a 1,440-block warm-up
Loading the test widget…
receipt_once on a relaunched chain (on-height 0) is active at every height
Loading the test widget…
Which height each check uses
A stated value: there is nothing to compute. A compatible node shows the same value.
- block_validation
the block's height- admission
the highest block height + 1- fee_estimate
tip + 1- pool_group_and_outflow
unknown (the newest rules)- queue_attendance_recency
the tip
Defects to match. An unknown name is always on, so a misspelt rule name in a check enforces unconditionally.
§2 Where a height comes from
Purpose. The precedence of the readiness gate, the genesis and the compiled heights, what the genesis builder accepts, and the fact that votes cannot change a height.
Inputs. The genesis config's rule_activation and rule_off objects; the compiled table; the
consensus_parameters state (07); the builder's options --existing-chain (also the environment
variable ZBC_GENESIS_EXISTING_CHAIN=1), --check-rules and --list-rules.
Output and effect. The overrides of §1, filled once at start before any block is validated; the genesis rows that carry them.
How to compute it.
- Readiness gate (§4b): for a rule in a gated bundle, the gate's height wins over every source below.
- Genesis. The builder first validates the config: every key of
rule_activationmust name a rule of the binary ("rule_activation names no rule of this binary: <key>") and hold an integer ("rule_activation.<key> must be a block height."); every key ofrule_offis checked as §4a says. These refusals are reported together with the other parameter checks ("ERROR: genesis consensus_params failed validation (N problem(s)):"followed by one" - <problem>"line each) and the builder exits 1. It then copies everyrule_activationkey into the genesis consensus parameters as the parameterrule.<name>, and everyrule_offkey asrule_off.<name>, each an int64 encoded among the other consensus parameters (06§2), so the rows exist inconsensus_parametersfrom block 0 and are part of the genesis hash. - The listing check. A table rule the config does not list gets no row; the builder prints
"Rules not listed in rule_activation (N, each at its compiled default height on a chain launched from this genesis): <name>=<height> …". For a new chain (no--existing-chain) any unlisted rule refuses the build:"ERROR: N rule(s) of this binary are not listed in rule_activation. A NEW chain lists every rule ("<rule>": 0), or those rules only switch on at the compiled default height.", exit 1. With--existing-chain(rebuilding the genesis of a chain that already runs) the unlisted rules keep their compiled defaults.--check-rules <config>runs the validation and the listing check without building and prints"Rule check passed: N rules are listed and the consensus parameters validate.".--list-rulesprints the name of every rule the binary knows, one per line, in table order. - At start, for each table rule, the node reads the
consensus_parametersrowrule.<name>; a row with a value ≥ 0 sets the override. The same forrule_off.<name>. It logs one line per rule ("rule <name>: active|pending|retired at height <H>[, off at height <off>]"), and on a chain whose tip is below 1,000 it warns for every rule whose height is above 10,000. - Compiled default (§4) otherwise.
- The record check (§4c) runs before any block is validated.
- Not governable.
SetConsensusParam(17§5) accepts only the eight governable prices; a vote naming anything else,rule.*included, is refused at admission ("SetConsensusParam: parameter is not governable: <name>") and is a fee-only no-op if mined.
Rule activation. None.
Rejections and errors. As listed in steps 2 and 3. A rule.<name> row with a negative value is
ignored at start.
Vector. computed. INPUT: any of the three shipped genesis files (DevNet, TestNet, mainnet template)
with --check-rules. EXPECTED OUTPUT: "Rule check passed: 125 rules are listed and the consensus parameters validate.". INPUT: a config whose rule_activation holds only "split_policy": 0, built
without --existing-chain → refused, "ERROR: 124 rule(s) of this binary are not listed in rule_activation. …". The same with --existing-chain → built; split_policy on from 0,
taproot_recipients at its compiled default 30,000, receipt_once scheduled at its compiled 1,000,000
and readiness-gated (§4b). INVALID: a rule_activation key "split_polcy": 0 → " - rule_activation names no rule of this binary: split_polcy", exit 1; "split_policy": "0" → " - rule_activation.split_policy must be a block height.".
Test cases · §2
8 cases · 4 valid · 4 invalid
A shipped genesis file (every rule at 0) passes --check-rules
Loading the test widget…
A new chain whose rule_activation lists only split_policy is refused
Loading the test widget…
The same config built with --existing-chain: 124 rules stay at their compiled heights
Loading the test widget…
The heights of that chain: split_policy 0, taproot_recipients 30,000, receipt_once 1,000,000 and readiness-gated
Loading the test widget…
A rule_activation key that names no rule is refused by the builder
Loading the test widget…
A rule_activation value that is a string is refused by the builder
Loading the test widget…
A negative rule.<name> row is ignored at start
Loading the test widget…
A SetConsensusParam vote naming a rule height is refused at admission
Loading the test widget…
Defects to match. None.
§3 Transaction-type gates
Purpose. Transaction types an implementation must refuse below their rule's height, and the one type retired from a height.
Inputs. A transaction type and a height.
Output and effect. An admission refusal, or a block refusal.
How to compute it.
- Gated types: 54 SetSplitPolicy →
split_policy; 516 DeclineEscrowRequest →escrow_request; 55, 56, 57, 58 (LinkAccount, UnlinkAccount, SetMemberPermissions, TransferGroupControl) →account_groups; 309 CloseLongevity →survival_field; 296 FundStoredFile →stored_file_topup; 60 EquivocationReport →equivocation_miss; 62 SpineEquivocationReport →spine_equivocation_report. Every other type is never gated. A type is active at h when it has no rule or its rule isactiveat h. - Retired type: 53 CancelLongevity, retired by
survival_field(retired at h whensurvival_fieldis active at h). - Admission (after the version and timestamp checks): a retired type →
Transaction type 53 is retired from height <H>; an inactive type →Transaction type <t> is not active until height <H> (rule <R>). - Block validation runs the same checks on every transaction of the block at the block's height, so a block carrying a retired or an inactive type is invalid with the text of step 3.
- Execution repeats the inactive-type check (also for the inner transaction of a multisig envelope,
which block validation does not see as a transaction of its own):
Transaction type <t> is not active until height <H>, the block invalid. A CancelLongevity that reaches execution at a height where it is retired charges only the fee (it cannot arrive there inside a valid block). min_user_tx_height: at execution only, any type other than 0 belowon("min_user_tx_height")→user transactions are not accepted below height <H>(block invalid).
Rule activation. The rules named above, all active from height 0 on every chain.
Rejections and errors. As listed.
Vector. computed. INPUT: a chain whose genesis omits split_policy (built with --existing-chain;
compiled default 30,000); a SetSplitPolicy at admission while the tip is 29,998. EXPECTED OUTPUT: refused,
Transaction type 54 is not active until height 30000 (rule split_policy). The same at tip 29,999 (lands
in 30,000) → accepted. INPUT: CancelLongevity on either relaunched chain → Transaction type 53 is retired from height 0, at admission and inside a block. INPUT: a SpineEquivocationReport on either relaunched
chain → not refused by the type gate (spine_equivocation_report on from 0).
Test cases · §3
11 cases · 4 valid · 7 invalid
SetSplitPolicy at admission at tip 29,998 (lands in 29,999) on a chain whose genesis omits split_policy
Loading the test widget…
SetSplitPolicy at tip 29,999 lands in 30,000 and is accepted
Loading the test widget…
SetSplitPolicy in block 29,999 makes the block invalid with the admission text
Loading the test widget…
SetSplitPolicy reaching execution at 29,999 (inside a multisig envelope) fails the block
Loading the test widget…
CancelLongevity at admission on a relaunched chain is retired from 0
Loading the test widget…
A block carrying a CancelLongevity on a relaunched chain is invalid
Loading the test widget…
A CancelLongevity reaching execution where it is retired charges only the fee
Loading the test widget…
A SpineEquivocationReport on a relaunched chain passes the type gate
Loading the test widget…
LinkAccount below account_groups is refused
Loading the test widget…
A type without a rule is never gated
Loading the test widget…
A user transaction below min_user_tx_height fails the block at execution
Loading the test widget…
Defects to match. (a) min_user_tx_height is enforced at execution only (a transaction below the
height is admitted and makes the block that carries it invalid). (b) split_policy and account_groups
gate only their transaction types.
§4 The rule table
Purpose. Every rule an implementation must carry: its name, compiled default, height in each shipped genesis file, whether it may be retired, its bundle, and the chapters that specify the behaviour it switches.
Inputs. The compiled table of 0.6.1; the DevNet and TestNet genesis files and the mainnet template.
Output and effect. The complete set of consensus switches.
How to compute it. Rows in table order (the order /api/v1/blockchain/rules and --list-rules
return). "Compiled default" is the height a chain gets for a rule its genesis does not list (§2); the
1,000,000 of the 24 rules of bundle 601 is a placeholder ahead of every chain, never reached by a chain
built from 0.6.1, because all three shipped genesis files list every rule at 0. Every rule's default
off-height is "never", its warm-up 0, and no shipped genesis file has a rule_off entry. "Specified in"
names the sections that describe the active behaviour.
| # | Rule | Compiled default | DevNet, TestNet, mainnet template | Retirable | Bundle | Specified in |
|---|---|---|---|---|---|---|
| 1 | split_policy |
30,000 | 0, 0, 0 | no | 0 | 03 §2; 08 §9; 31 §4 |
| 2 | taproot_recipients |
30,000 | 0, 0, 0 | yes | 0 | 02 §6; 03 §3; 08 §3 |
| 3 | storage_acl |
30,000 | 0, 0, 0 | no | 0 | 11 §2; 11 §8 |
| 4 | token_name_shape |
30,000 | 0, 0, 0 | yes | 0 | 14 §2; 14 §3 |
| 5 | topology_full_id |
30,000 | 0, 0, 0 | no | 0 | 23 §7 |
| 6 | oracle_full_registry_quorum |
30,000 | 0, 0, 0 | no | 0 | 17 §1; 17 §4; 22 §13; 34 §2 |
| 7 | uniform_fee_refund |
30,000 | 0, 0, 0 | no | 0 | 04 §2; 04 §4; 04 §5; 04 §7; 04 §9; 04 §12; 07 §5; 12 §2; 12 §3; 12 §4; 13 §3; 13 §10; 14 §3; 14 §4; 14 §5; 14 §6; 14 §7; 14 §8; 14 §9 |
| 8 | escrow_request |
30,000 | 0, 0, 0 | no | 0 | 03 §2; 03 §7; 07 §1; 07 §6; 12 §1; 12 §2; 12 §4; 12 §6; 12 §7; 12 §8; 12 §11; 24 §6; 26 §2 |
| 9 | account_groups |
30,000 | 0, 0, 0 | no | 0 | 03 §2; 18 §1; 18 §3; 18 §4; 18 §5; 18 §6; 31 §3 |
| 10 | balance_credit_full_row |
30,000 | 0, 0, 0 | no | 0 | 07 §3; 08 §4; 08 §6; 12 §5; 18 §1; 21 §2; 22 §2; 22 §3 |
| 11 | multisig_no_replay |
30,000 | 0, 0, 0 | no | 0 | 02 §10; 12 §10 |
| 12 | longevity_stated_target |
30,000 | 0, 0, 0 | no | 0 | 13 §3 |
| 13 | token_expiry_to_holders |
30,000 | 0, 0, 0 | no | 0 | 13 §10; 14 §9; 22 §7 |
| 14 | survival_field |
30,000 | 0, 0, 0 | no | 0 | 03 §1; 03 §2; 03 §4; 04 §4; 04 §5; 04 §7; 07 §5; 10 §4; 10 §9; 10 §11; 10 §12; 11 §4; 13 §1; 13 §3; 13 §4; 13 §5; 13 §10; 21 §2; 22 §6; 22 §11; 31 §3 |
| 15 | stored_file_topup |
30,000 | 0, 0, 0 | no | 0 | 03 §2; 11 §2; 11 §3 |
| 16 | market_known_tokens |
30,000 | 0, 0, 0 | no | 0 | 15 §5 |
| 17 | reassign_schedule_moved |
30,000 | 0, 0, 0 | no | 0 | 04 §10; 08 §8 |
| 18 | token_exact_backing |
30,000 | 0, 0, 0 | no | 0 | 14 §4; 14 §5; 14 §6; 14 §7 |
| 19 | schedule_end_refund |
30,000 | 0, 0, 0 | no | 0 | 08 §6; 22 §9 |
| 20 | liquid_exact_vesting |
30,000 | 0, 0, 0 | no | 0 | 08 §4; 31 §3 |
| 21 | dataset_property_nonempty |
30,000 | 0, 0, 0 | yes | 0 | 10 §2 |
| 22 | tx_timestamp_bound |
30,000 | 0, 0, 0 | yes | 0 | 03 §5; 19 §2 |
| 23 | fee_in_token_step |
30,000 | 0, 0, 0 | no | 0 | 08 §4; 14 §4; 14 §5 |
| 24 | group_spend_invalid_block |
30,000 | 0, 0, 0 | no | 0 | 02 §10; 04 §9; 04 §10; 08 §1; 12 §10; 18 §8 |
| 25 | fee_vote_noop |
30,000 | 0, 0, 0 | no | 0 | 04 §5; 17 §2 |
| 26 | schedule_reclaim_locked |
30,000 | 0, 0, 0 | no | 0 | 08 §7 |
| 27 | dfs_moved_state |
30,000 | 0, 0, 0 | no | 0 | 04 §10; 10 §11 |
| 28 | recipient_address_shape |
30,000 | 0, 0, 0 | yes | 0 | 03 §3; 03 §12; 04 §6; 08 §1; 08 §4 |
| 29 | dfs_namespace_reserved |
30,000 | 0, 0, 0 | yes | 0 | 10 §2; 10 §13 |
| 30 | state_answer_noop |
30,000 | 0, 0, 0 | no | 0 | 02 §10; 04 §5; 08 §2; 08 §4; 08 §7; 09 §3; 10 §6; 10 §7; 10 §9; 11 §6; 12 §2; 12 §4; 12 §6; 12 §10; 13 §3; 14 §3; 14 §4; 14 §5; 14 §6; 15 §2; 16 §1; 16 §2; 17 §6 |
| 31 | dataset_update_keeps_deposit |
30,000 | 0, 0, 0 | no | 0 | 10 §2 |
| 32 | schedule_fire_member_gate |
30,000 | 0, 0, 0 | no | 0 | 04 §9; 08 §6; 18 §8; 22 §9 |
| 33 | liveness_miss_rule |
142,000 | 0, 0, 0 | no | 0 | 09 §10; 20 §1; 21 §2; 21 §3; 21 §4; 35 §4; 35 §7; 35 §8; 36 §1; 36 §2; 36 §3; 36 §4; 36 §5; 36 §7 |
| 34 | market_deposit_refund |
142,000 | 0, 0, 0 | no | 0 | 15 §1; 15 §6 |
| 35 | market_min_notional |
142,000 | 0, 0, 0 | yes | 0 | 15 §6 |
| 36 | queue_attendance |
142,000 | 0, 0, 0 | no | 0 | 03 §2; 07 §1; 07 §8; 07 §11; 09 §1; 09 §7; 09 §9; 13 §8; 21 §4; 24 §6; 26 §2 |
| 37 | poown_required |
142,000 | 0, 0, 0 | yes | 0 | 09 §2; 09 §3; 09 §4 |
| 38 | relay_owner_gates |
142,000 | 0, 0, 0 | yes | 0 | 17 §8 |
| 39 | oracle_registered_only |
142,000 | 0, 0, 0 | yes | 0 | 17 §4; 22 §13; 34 §3 |
| 40 | smith_window_anchor |
142,000 | 0, 0, 0 | no | 0 | 19 §3; 20 §2 |
| 41 | halt_recovery_param |
142,000 | 0, 0, 0 | no | 0 | 19 §2; 35 §1 |
| 42 | topology_window_fix |
0 | 0, 0, 0 | no | 0 | 23 §7 |
| 43 | small_n_measurement |
0 | 0, 0, 0 | no | 0 | 11 §7; 21 §2; 21 §3; 22 §11; 23 §10; 36 §2 |
| 44 | receipt_count_active |
0 | 0, 0, 0 | no | 0 | 19 §2; 21 §3; 23 §4; 23 §10; 36 §2; 36 §3 |
| 45 | payout_instant |
0 | 0, 0, 0 | no | 0 | 09 §12; 15 §6; 20 §7; 21 §2; 36 §7 |
| 46 | longevity_continuous |
0 | 0, 0, 0 | no | 0 | 04 §5; 13 §7; 21 §1; 21 §2; 22 §1; 22 §12 |
| 47 | draw_count_previous_gap |
0 | 0, 0, 0 | no | 0 | 21 §2 |
| 48 | late_stamp_priced |
0 | 0, 0, 0 | no | 0 | 05 §9; 20 §6; 24 §3 |
| 49 | apps_seed_after_bet |
0 | 0, 0, 0 | no | 0 | 16 §3; 16 §4; 16 §6 |
| 50 | receipt_datum_prefix |
0 | 0, 0, 0 | no | 0 | 01 §2; 23 §9 |
| 51 | attendance_any_sign |
0 | 0, 0, 0 | no | 0 | 09 §9 |
| 52 | attendance_fee_floor |
0 | 0, 0, 0 | no | 0 | 04 §5; 09 §7; 09 §11 |
| 53 | admission_small_registry_cap |
0 | 0, 0, 0 | no | 0 | 09 §8 |
| 54 | admission_timer_reanchor |
0 | 0, 0, 0 | no | 0 | 09 §8; 21 §4 |
| 55 | claim_two_step |
0 | 0, 0, 0 | no | 0 | 07 §8; 09 §6; 21 §4 |
| 56 | floor_spares_recent |
0 | 0, 0, 0 | no | 0 | 21 §3; 36 §3; 36 §5 |
| 57 | storage_tally_no_penalty |
0 | 0, 0, 0 | no | 0 | 11 §7; 22 §11 |
| 58 | spine_content_validated |
0 | 0, 0, 0 | no | 0 | 02 §11; 25 §3; 25 §6a; 25 §7 |
| 59 | spine_producer_by_reference |
0 | 0, 0, 0 | no | 0 | 25 §1; 25 §5; 25 §6a; 25 §7 |
| 60 | spine_reference_commit |
0 | 0, 0, 0 | no | 0 | 02 §11; 25 §1; 25 §2; 25 §6a; 25 §7 |
| 61 | spine_min_spacing |
0 | 0, 0, 0 | yes | 0 | 25 §5; 25 §6a; 25 §7 |
| 62 | checkpoint_finality |
0 | 0, 0, 0 | no | 0 | 19 §6; 24 §3; 24 §6; 25 §9; 34 §5 |
| 63 | escrow_horizon_pure |
0 | 0, 0, 0 | no | 0 | 12 §5; 13 §8; 22 §2 |
| 64 | escrow_timeout_cap |
0 | 0, 0, 0 | yes | 0 | 03 §7; 04 §4; 12 §1 |
| 65 | queue_state_reset |
0 | 0, 0, 0 | no | 0 | 09 §3 |
| 66 | resume_by_queue |
0 | 0, 0, 0 | no | 0 | 09 §10; 20 §1 |
| 67 | liveness_attestation |
0 | 0, 0, 0 | no | 0 | 02 §11; 04 §2; 09 §7; 36 §3; 36 §6 |
| 68 | floor_on_draw_set |
0 | 0, 0, 0 | no | 0 | 21 §3; 36 §3; 36 §5 |
| 69 | miss_by_rounds |
0 | 0, 0, 0 | no | 0 | 20 §5 |
| 70 | validator_no_fallback |
0 | 0, 0, 0 | no | 0 | 19 §2 |
| 71 | one_round_formula |
0 | 0, 0, 0 | no | 0 | 20 §2; 20 §5; 21 §3 |
| 72 | difficulty_draw_set |
0 | 0, 0, 0 | no | 0 | 05 §9; 19 §6; 20 §6; 24 §3 |
| 73 | attendance_tail |
0 | 0, 0, 0 | no | 0 | 07 §11; 09 §9; 13 §8; 21 §4 |
| 74 | snapshot_funded_transactions |
0 | 0, 0, 0 | no | 0 | 13 §8; 26 §2 |
| 75 | expiry_previous_stamp |
0 | 0, 0, 0 | no | 0 | 08 §4; 08 §6; 12 §5; 15 §8; 22 §1; 22 §2; 22 §3; 22 §9 |
| 76 | governance_window |
0 | 0, 0, 0 | no | 0 | 13 §9; 13 §10; 17 §5; 17 §6; 18 §9; 22 §13; 34 §2 |
| 77 | release_registry_veto |
0 | 0, 0, 0 | no | 0 | 17 §4; 17 §5; 17 §6; 22 §13 |
| 78 | duty_fee_free |
0 | 0, 0, 0 | no | 0 | 04 §2; 04 §5; 04 §7; 04 §13; 11 §6; 11 §7; 17 §1; 17 §2; 17 §5; 22 §11; 34 §3 |
| 79 | permanent_state_priced |
0 | 0, 0, 0 | no | 0 | 04 §2; 04 §12; 04 §13; 15 §6 |
| 80 | market_rent |
0 | 0, 0, 0 | no | 0 | 04 §9; 07 §5; 15 §1; 15 §5; 15 §6; 15 §7; 15 §8; 15 §9; 18 §8 |
| 81 | apps_payout_cap |
0 | 0, 0, 0 | no | 0 | 16 §6; 22 §4 |
| 82 | quorum_floor |
0 | 0, 0, 0 | no | 0 | 04 §3; 17 §1; 17 §3; 17 §4; 17 §5; 17 §6; 22 §13; 25 §6; 25 §7; 34 §2 |
| 83 | node_key_rotation |
0 | 0, 0, 0 | no | 0 | 02 §11; 09 §4; 21 §4; 30 §3 |
| 84 | weight_by_draw_share |
0 | 0, 0, 0 | no | 0 | 05 §9; 19 §6; 20 §6; 24 §3 |
| 85 | fork_tie_by_hash |
0 | 0, 0, 0 | yes | 0 | 19 §6; 24 §1; 24 §3 |
| 86 | equivocation_miss |
0 | 0, 0, 0 | no | 0 | 03 §2; 07 §8; 27 §9; 35 §1; 35 §2; 35 §3; 35 §4; 35 §6; 35 §8 |
| 87 | equivocation_resume_exempt |
0 | 0, 0, 0 | no | 0 | 27 §9; 35 §1; 35 §3; 35 §4; 35 §5; 35 §6; 35 §8 |
| 88 | seed_vrf |
0 | 0, 0, 0 | no | 0 | 01 §8; 02 §11; 05 §2; 05 §5; 19 §2; 19 §8; 27 §2 |
| 89 | apps_seed_prefix |
0 | 0, 0, 0 | no | 0 | 01 §2; 16 §4; 16 §6 |
| 90 | apps_turn_plus_two |
0 | 0, 0, 0 | no | 0 | 16 §3; 16 §6 |
| 91 | activation_readiness_gate |
0 | 0, 0, 0 | no | 0 | 05 §8; 19 §2; 20 §4; 29 §4b |
| 92 | registry_as_of_prev |
0 | 0, 0, 0 | no | 0 | 11 §5; 11 §7; 21 §2 |
| 93 | branch_registry_replay |
0 | 0, 0, 0 | no | 0 | 19 §6; 24 §3 |
| 94 | tx_expiry_field |
0 | 0, 0, 0 | no | 0 | 02 §1; 03 §1; 03 §4; 03 §5; 13 §1; 19 §2 |
| 95 | dataset_owner_only_write |
0 | 0, 0, 0 | no | 0 | 10 §2; 10 §4; 10 §6; 10 §7 |
| 96 | genesis_rent_clock |
0 | 0, 0, 0 | no | 0 | 06 §5; 07 §3; 13 §9; 22 §8 |
| 97 | apps_payout_cap_net |
0 | 0, 0, 0 | no | 0 | 16 §6; 22 §4 |
| 98 | token_name_not_address |
0 | 0, 0, 0 | no | 0 | 14 §2; 14 §3 |
| 99 | typed_accounts_only |
0 | 0, 0, 0 | no | 0 | 01 §4; 02 §1; 03 §1; 03 §3; 07 §3; 08 §1; 12 §9; 12 §10; 17 §1; 31 §3 |
| 100 | receipt_once |
1,000,000 | 0, 0, 0 | yes | 601 | 06 §1; 07 §9; 19 §2; 19 §9; 23 §5; 23 §6; 23 §11 |
| 101 | readiness_decision_state |
1,000,000 | 0, 0, 0 | yes | 601 | 05 §8; 07 §1; 07 §8; 21 §1; 26 §2; 26 §7; 29 §4b |
| 102 | readiness_registry_schedule |
1,000,000 | 0, 0, 0 | yes | 601 | 05 §8; 13 §8; 17 §6; 20 §4; 22 §14; 26 §2; 26 §7; 29 §4b |
| 103 | spine_threshold_capped |
1,000,000 | 0, 0, 0 | yes | 601 | 25 §6; 25 §7 |
| 104 | cosign_promise_binds |
1,000,000 | 0, 0, 0 | yes | 601 | 02 §11; 07 §9; 25 §5; 25 §6a; 25 §6b; 27 §12 |
| 105 | survival_mode |
1,000,000 | 0, 0, 0 | no | 601 | 03 §2; 04 §3; 04 §6; 04 §10; 07 §1; 07 §11; 08 §1; 09 §11; 11 §12; 13 §8; 17 §1a; 17 §2; 17 §3; 17 §4; 17 §5; 17 §6; 19 §2; 19 §4; 19 §6; 19 §10; 20 §4; 21 §3; 21 §4; 22 §1; 22 §5; 22 §13; 22 §14; 24 §3; 26 §2; 31 §4; 34 §3; 34 §4; 34 §6; 34 §7; 36 §3; 36 §5; 36 §11; 36 §12 |
| 106 | block_size_serialized |
1,000,000 | 0, 0, 0 | yes | 601 | 04 §10; 05 §1; 05 §10; 05 §11; 19 §1; 19 §2; 19 §8; 20 §4; 23 §4; 27 §2; 27 §9 |
| 107 | escrow_commission_nonnegative |
1,000,000 | 0, 0, 0 | yes | 601 | 03 §7; 04 §7; 07 §1; 07 §6; 08 §3; 12 §1; 12 §2; 12 §4; 26 §2 |
| 108 | foreign_carrier_bound |
1,000,000 | 0, 0, 0 | yes | 601 | 02 §9; 03 §8; 04 §6; 04 §10; 05 §10; 08 §1; 12 §1; 19 §2; 19 §4; 20 §4; 34 §10 |
| 109 | eth_signature_canonical_v |
1,000,000 | 0, 0, 0 | yes | 601 | 02 §5; 02 §10; 12 §1; 12 §10; 17 §2; 18 §2; 18 §3; 18 §5; 19 §2; 24 §3; 34 §10 |
| 110 | canonical_account_forms |
1,000,000 | 0, 0, 0 | yes | 601 | 01 §4; 02 §4; 02 §5; 02 §11; 03 §3; 07 §3; 08 §1; 08 §3; 08 §9; 08 §10; 10 §6; 11 §2; 12 §1; 12 §6; 12 §10; 14 §4; 14 §4a; 15 §2; 16 §2; 16 §3; 17 §6; 18 §2; 18 §3; 18 §4; 18 §5; 19 §2; 22 §13; 34 §4 |
| 111 | bridge_burn_supply_first |
1,000,000 | 0, 0, 0 | yes | 601 | 34 §6 |
| 112 | bridge_withdrawal_credit |
1,000,000 | 0, 0, 0 | yes | 601 | 03 §3; 07 §1; 07 §3; 07 §8; 14 §4; 19 §2; 26 §2; 31 §7; 34 §1a; 34 §4; 34 §5; 34 §5a; 34 §6; 34 §8 |
| 113 | admission_checks_in_block |
1,000,000 | 0, 0, 0 | yes | 601 | 04 §6; 14 §4; 16 §2; 17 §4, §7 |
| 114 | receipt_reference_in_window |
1,000,000 | 0, 0, 0 | yes | 601 | 19 §2; 23 §5 |
| 115 | failed_credit_to_pool |
1,000,000 | 0, 0, 0 | yes | 601 | 07 §3; 07 §5; 08 §5; 08 §6; 13 §10; 13 §11; 17 §7; 22 §7; 22 §9; 22 §10 |
| 116 | one_node_per_owner |
1,000,000 | 0, 0, 0 | yes | 601 | 09 §1; 09 §3; 09 §4; 21 §4 |
| 117 | dataset_rent_object_clock |
1,000,000 | 0, 0, 0 | no | 601 | 07 §1; 07 §6; 07 §11; 10 §1; 10 §3; 10 §4; 10 §12; 22 §6; 26 §2 |
| 118 | spine_bar_follows_registry |
1,000,000 | 0, 0, 0 | yes | 601 | 25 §3; 25 §6; 25 §6a; 25 §6b; 25 §7; 27 §12 |
| 119 | claim_notifies_owner |
1,000,000 | 0, 0, 0 | yes | 601 | 09 §6 |
| 120 | spine_late_vote |
1,000,000 | 0, 0, 0 | no | 601 | 07 §9; 25 §3; 25 §5; 25 §6; 25 §6a; 25 §6b; 25 §6c; 25 §7; 27 §12 |
| 121 | spine_equivocation_report |
1,000,000 | 0, 0, 0 | no | 601 | 02 §11; 03 §2; 07 §1; 07 §8; 25 §6b; 26 §2; 31 §4; 35 §7; 35 §8 |
| 122 | fee_collected_explicit |
1,000,000 | 0, 0, 0 | yes | 601 | 04 §5; 07 §5; 08 §1; 14 §5; 14 §7; 15 §7 |
| 123 | liquid_chain_clock |
1,000,000 | 0, 0, 0 | yes | 601 | 07 §6; 08 §4; 15 §3 |
| 124 | invoice_namespace_shape |
175,000 | 0, 0, 0 | yes | 0 | 10 §13 |
| 125 | min_user_tx_height |
0 | 0, 0, 0 | no | 0 | 08 §1 |
Totals: 125 rules. Compiled defaults: 59 at 0, 32 at 30,000, 9 at 142,000, 1 at 175,000, 24 at
1,000,000. 34 retirable (14 of bundle 0, 20 of bundle 601). Bundle 601: 24 rules (rows 100–123);
the other 101 are bundle 0, never gated. None retired, none warming. All 125 at 0 in the DevNet, the
TestNet and the mainnet template. Some names keep older words: spine_producer_by_reference (the spine
blocksmith is the one the reference seed draws), spine_threshold_capped (the required spine signatures
are capped), spine_bar_follows_registry (the signature floor follows the main registry) and
cosign_promise_binds (a spine signature is a binding signing commitment).
Rule activation. The table; every rule active from height 0 on every chain.
Rejections and errors. None (the decisions live in the cited chapters).
Vector. computed: GET /api/v1/blockchain/rules on a node of either relaunched chain lists 125 rule
objects in the order above, each with height 0, scheduled_height 0, source "consensus_parameters",
active true; default_height is the compiled default of the table (30,000 for split_policy,
1,000,000 for receipt_once), bundle 0 or 601.
Test cases · §4
4 cases · 4 valid
The 125 rules in table order, their compiled heights and the 34 retirable ones
Loading the test widget…
The 24 rules of 0.6.1 ship in bundle 601
Loading the test widget…
On a chain built from 0.6.1 the 24 rules of bundle 601 are on from 0 and not gated
Loading the test widget…
The rules route of a relaunched chain lists the 125 rules in table order, each on from 0
Loading the test widget…
Defects to match. None. (uniform_fee_refund, survival_field and state_answer_noop are checked in
many places; an implementation that checks them at a single point must make sure every decision the
cited sections list is covered.)
§4a Intervals, retirement and warm-up
Purpose. How a rule is switched off again once a newer rule supersedes it, and how a stateful rule's ledger fills before its consequences bite.
Inputs. The table's default off-height and warm-up per rule; the genesis rule_off.<name>; the block
height.
Output and effect. A rule is the interval [on(name), off(name)); at the off-height the
superseding rule's on-height is the same height, so exactly one of a pair governs each block.
accumulating is true from on − warm_up: the state is recorded from there, the accept / refuse
consequence waits until on.
How to compute it. The off-height precedence: genesis rule_off.<name> → table default → never.
Only a retirable rule (a judgement rule, whose off-road is the earlier judgement over the same state)
may be retired. The builder checks each rule_off key in this order: it must hold an integer
("… rule_off.<name> must be a block height."); it must name a rule of the binary
("… rule_off names no rule of this binary: <name>"); the rule must be retirable
("… rule_off.<name>: this rule wrote state and is not retirable; …"); and the
off-height must lie above the on-height the chain will use, the config's rule_activation value or else
the compiled default ("… rule_off.<name> (<off>) must be above the rule's on-height (<on>), or the rule never switches on."). A rule that writes state (a column, a table, a new meaning for
stored rows) is never retirable. Retirement and warm-up heights, like on-heights, are consensus and are
bound by the record (§4c).
Rule activation. No rule of 0.6.1 is retired or warming; carried for future releases and fresh chains.
Rejections and errors. As listed; each is reported among the parameter checks of §2 step 2, exit 1.
Vector. computed: a retirable rule with off-height 200,000 governs [on, 200,000); its successor
with on-height 200,000 governs from there. A genesis with "rule_off": {"survival_mode": 50000} → refused
by the builder (survival_mode writes survival_state and is not retirable). A genesis listing
"tx_timestamp_bound": 0 and "rule_off": {"tx_timestamp_bound": 0} → refused ("… rule_off.tx_timestamp_bound (0) must be above the rule's on-height (0), or the rule never switches on.").
Test cases · §4a
8 cases · 3 valid · 5 invalid
A retirable rule with off-height 200,000 governs up to 199,999
Loading the test widget…
Its successor on at 200,000 governs from there
Loading the test widget…
A genesis retiring survival_mode is refused by the builder
Loading the test widget…
tx_timestamp_bound listed at 0 and retired at 0 is refused
Loading the test widget…
A genesis retiring a retirable rule above its on-height is accepted
Loading the test widget…
An off-height at or below the compiled on-height is refused when the config lists no on-height
Loading the test widget…
rule_off naming no rule is refused
Loading the test widget…
A rule_off value that is a string is refused
Loading the test widget…
Defects to match. Retirement and warm-up heights are guarded against a silent binary change only by the record of §4c.
§4b Rule bundles and the readiness gate
Purpose. How the rules of a release activate only once the blocksmiths demonstrably run that release, and how a node running an older release learns the activation height of a newer one and stops producing there.
Inputs. Each rule's bundle id (0 = not bundled) and scheduled height (§2 without the gate); the
version of every main block (the producer's bundle id, 05); the release registry (17 §6): per
version string, rows versioned by height, each with its registration height and a revoked flag; the
counted registered nodes R at a height (registered and not suspended at that height, 09, 36); the
stored decision rows; the constants SIGNAL_WINDOW_BLOCKS 720, SIGNAL_WINDOW_MAX_BLOCKS 1,440 (=
MIN_ROLLBACK_BLOCKS, the blocks every node holds below its tip and a snapshot carries below its height,
26 §2), ACTIVATION_FLOOR_BLOCKS 5,760 and 5 blocks per counted registered node.
Output and effect. For each gated bundle: an effective height h*, or pending. The rules of a
pending bundle are held off (the pinned-off value of §1); from h* they are on, the gate's height ranking
above every other source. A decision row in versioned chain state. For a node whose own bundle id is below
an activated bundle: a production halt from h*, validation continuing.
How to compute it.
- Bundle id of a release string: an optional leading
vorV; three dot-separated decimal parts (anything after the third part, such as-rc1or-testnet-amd64, ends it); minor and patch ≤ 99;major × 10,000 + minor × 100 + patch; anything else → 0. A binary signals its own bundle id (601 for 0.6.1) in theversionof every block it produces; the genesis block keeps version 1. - Threshold and window.
threshold(R) = (2R + 2) div 3(that is ⌈2R/3⌉).W(R) = max(720, 5R); under rulereadiness_registry_schedule(judged at the height evaluated)W(R) = min(max(720, 5R), 1,440). - The gated bundles (built at start and at every rebuild, step 9):
a. Group the table rules by bundle id > 0. A bundle's scheduled height
H= the largest scheduled height of its rules. b. A rule the genesis lists explicitly at 0 (itsrule.<name>row is 0) leaves its bundle: it is on from block 0 and never gated. A bundle with no rule left is not gated at all. On every chain built from 0.6.1 (the DevNet, the TestNet, the mainnet template) all 24 rules of bundle 601 are listed at 0, so bundle 601 is not gated there and the only bundles the gate ever holds are observation bundles (d). c. A remaining bundle is gated whenactivation_readiness_gateis active atH; otherwise its scheduled height stands. d. Observation bundles: every bundle id above the binary's own among the version strings of the release registry rows with a registration height at or below the evaluation height (revoked rows included: a revocation stops a pending bundle but cannot erase an activation), not already known. Such a bundle has no rules in this binary's table; it is always gated and itsHis 0. e. Bundles are evaluated in ascending id order, so a rule a lower bundle carries is judged released for the bundles above it. - The floor
F(b, a)as of heighta: over the release registry rows in force ata(for each version string its row with the greatest height ≤a), take the rows whose version string has bundle idband that are not revoked;F= the earliest of their registration heights + 5,760 (of several rows, such as one per architecture, the first registered). None → no floor: the bundle cannot activate at that height. - The tally
T(h*, b, W): the number of distinct producer keys among the main blocks at heightsmax(1, h* − W)…h* − 1whoseversion≥b; a block the node does not hold counts as not signalled; 0 whenh* < 2. Keys are counted, not blocks: a minority branch that makes every block on its side of a partition never holds two thirds of the registered keys. - Evaluation, after block
his applied, forh* = h + 1(the window forh*is now complete): first the observation bundles registered as ofhare added (3d); then for each gated bundle still pending, in id order: a. Whenreadiness_registry_scheduleis not active ath*: skip whileh* < H. When it is active,His not consulted: the floor alone is the schedule. b. An observation bundle is skipped whileactivation_readiness_gateis not active ath*. c. The floor as ofh* − 1: skip when there is none orh* < F. d.R= the counted registered nodes ath* − 1;t = T(h*, b, W(R)); the tally, threshold,Randh*are kept for the API (§6). e. An observation bundle whilereadiness_registry_scheduleis not active ath*is only watched: nothing is decided. f. WhenR > 0andt ≥ threshold(R),h*is the bundle's effective height. g. Underreadiness_decision_state(judged ath*), for each bundle decided in this evaluation the node writes, inside the application of blockh, the row (bundle_id= b,effective_height=h*,height=h* − 1,latest= 1) of the tablereadiness_bundle_decision(07: columnsbundle_id,effective_height,height,latest, all integers; key (bundle_id,height)), after clearinglateston the bundle's earlier rows. A write that fails puts every bundle decided in this evaluation back to pending and blockhis not applied. A fault later in the application of blockh(a storage or read fault after the evaluation), and a database commit of blockhthat fails, put the bundles decided forh + 1back to pending with the block: the decision taken in memory never outlives the row that did not commit. The "on" edge of each rule of a decided bundle is recorded when blockh*is applied (§4c). - Rollback to a target
t: the decision rows whoseheightis abovetare deleted and the newest remaining row of each bundle is markedlatestagain, inside the rollback's database transaction; only once that rollback has committed does every decided bundle whose effective height is abovet + 1return to pending (re-evaluated on the way back up). A rollback that fails before its commit leaves the decisions as they were, with the chain it did not change; a rollback that keeps blockh* − 1keeps the decision. - The signal check (rule
activation_readiness_gate): a block'sversionmay not be below the newest bundle id that has a rule of this binary's table active at the block's height. On a chain built from 0.6.1 bundle 601's rules are active from 0, so every block from height 1 must carryversion≥ 601. An observation bundle has no rules here, so a node never refuses a block for being below a bundle it does not carry; the nodes that carry it do. - Rebuild (at start, and for a snapshot joiner after the snapshot is applied, at the snapshot's
reference height, before the catch-up): the gated bundles are rebuilt (step 3) with the observation
bundles registered as of the tip; every latest decision row is read (a row that does not parse, a
bundle id, effective height or height out of range →
"Malformed readiness bundle decision row"; two latest rows for one bundle →"More than one latest readiness decision for bundle <b>"; either refuses the start). Then for each gated pending bundle in id order: a. With a row: it must haveheight≠0xFFFFFFFF,effective_height = height + 1andeffective_height ≤ tip + 1, else"Invalid stored readiness decision for bundle <b>"; the bundle is decided at the row's effective height; then, whenreadiness_registry_scheduleis not active at that height and the effective height is belowH:"Invalid stored readiness decision for bundle <b>: effective height <E> is below the compiled schedule <H>". Either refuses the start. b. Without a row, whenreadiness_decision_stateis active at the tip: the chain has not activated the bundle; nothing is scanned. c. Otherwise (a chain wherereadiness_decision_stateis not active at the tip): the heights frommax(1, H)(from 1 whenreadiness_registry_scheduleis active at the tip) totip + 1are evaluated as in step 6 a, c, d, f, without writing rows, until the first qualifying one; an observation bundle stops the scan at the first height wherereadiness_registry_scheduleis not active. A window that reaches a block this node does not hold refuses the start:"resync from a snapshot: the signal window below height <h> is not held (block <m> is missing), so the activation height of bundle <b> cannot be recomputed from this node's headers". On every chain built from 0.6.1 bothreadiness_decision_stateandreadiness_registry_scheduleare active from 0: a restart reads the rows and never scans. - Production halt: before producing block
n, a node checks every bundle with an id above its own whose effective height is ≤n; for the first such bundle it does not produce and logs once per height"FATAL: rule bundle <b> is active from height <h*> and this binary carries bundle <own>: block production stops at height <n> (validation continues). Remedy: install the registered release of bundle <b> (the self-updater, or the release the registry lists), then restart"; for an observation bundle the line begins"FATAL: readiness for future rule bundle <b> observed from height <h*>". The node keeps validating and syncing;GET /api/v1/blockchain/rulesreports the line asproduction_halt(§6). Underreadiness_registry_schedulean older node'sh*for a newer release is the same height the newer nodes compute, so it stops producing exactly where its blocks would start to be refused.
Rule activation. activation_readiness_gate, readiness_decision_state and
readiness_registry_schedule, all three active from height 0 on every chain. The steps above specify
both sides of each: before readiness_registry_schedule a bundle waits for h* ≥ max(H, F), the window
is uncapped, an observation bundle is watched and never decided (it halts production only on a stored
decision row); before readiness_decision_state no row is written and a restart rescans the headers.
Rejections and errors. A block whose version is below the newest active bundle: "Block version N is below the active bundle M (activation_readiness_gate)" (05 §8, 19 §2); version 0 stays refused
("Invalid block version"). The start refusals of step 9. The halt stops local production only.
Vector. computed. Bundle ids: "0.6.1" → 601, "v0.5.9" → 509, "0.6.1-rc1" → 601, "0.6.0" →
600, "0.6" → 0, "1.2.100" → 0, "v0.6.2-testnet-amd64" → 602, "[email protected]" → 0. Thresholds
and windows (under readiness_registry_schedule): R = 5 → 4, W 720; R = 11 → 8, W 720; R = 22 → 15, W 720;
R = 200 → 134, W 1,000; R = 288 → 192, W 1,440; R = 289 → 193, W 1,440 (1,445 without the rule); R = 1,000
→ 667, W 1,440 (5,000 without the rule). INPUT: either relaunched chain. EXPECTED OUTPUT: no bundle gated,
bundles empty; a block of version 600 at height 1 → "Block version 600 is below the active bundle 601 (activation_readiness_gate)". INPUT: a chain built from 0.6.1 with R = 11 counted registered nodes; the
release v0.6.2-devnet-amd64 registered at height 50,000 and never revoked (floor 55,760); seven distinct
keys produce version 602 blocks between 55,300 and 55,998, an eighth key's first version 602 block is
55,999; all other blocks carry 601. EXPECTED OUTPUT: no evaluation below 55,760; for h* = 55,999 the
window 55,279 … 55,998 holds 7 keys < 8, pending; when block 55,999 is applied, the window 55,280 … 55,999
holds 8 keys: bundle 602 is decided at h* = 56,000 and the row (602, 56,000, 55,999, latest 1) is
written; a node running 0.6.1 does not produce block 56,000 and logs "FATAL: readiness for future rule bundle 602 observed from height 56000 and this binary carries bundle 601: block production stops at height 56000 (validation continues). …"; a rollback to 55,999 keeps the decision, a rollback to 55,998 deletes
the row and returns the bundle to pending. The same with the release revoked at 55,500 and nothing
registered after → no floor as of 55,999, the bundle stays pending. INVALID: a stored row (602, 56,001,
55,999) at start → "Invalid stored readiness decision for bundle 602", the node does not start.
Test cases · §4b
9 cases · 8 valid · 1 invalid
Bundle ids of release strings
Loading the test widget…
Thresholds and windows for 5 to 1,000 counted registered nodes
Loading the test widget…
A relaunched chain gates no bundle; a block of version 600 at height 1 is invalid
Loading the test widget…
Bundle 602 of a registered release is decided at 56,000 from the signals of 8 of 11 keys
Loading the test widget…
Between the registration and the decision the bundle is watched
Loading the test widget…
The same release revoked at 55,500 with nothing registered after: no floor, the bundle stays pending
Loading the test widget…
A stored decision row (602, 56,001, 55,999) refuses the start
Loading the test widget…
Before readiness_registry_schedule: bundle 601 at H = 20,000, floor 20,760, four of five signal from 20,900
Loading the test widget…
A bundle whose release is never registered never activates
Loading the test widget…
Defects to match. (1) Above 288 counted registered nodes the capped window gives each fewer than five
turns: at 650 about one ready registered node in nine goes unseen (about three quarters of the registry
must run the release instead of two thirds), and above about 1,300 the 1,440-block window cannot show two
thirds, so no bundle activates until a release raises SIGNAL_WINDOW_MAX_BLOCKS. (2) The signal measures
producers that tell the truth: a producer may signal a bundle it does not run, which only brings the
activation forward to a height where it forks itself off.
§4c The rule-activation record
Purpose. What binds every rule edge to the chain, so a binary that resolves a height differently from the chain's history cannot run silently.
Inputs. Each applied block; the activation table; the genesis builder.
Output and effect. The local table rule_activation_record: columns rule (text), edge ("on" or
"off"), edge_height (u32), block_hash (32 bytes), height (u32); key (rule, edge). When the block
at a rule's on-height or off-height (as §1 resolves them at that moment, the readiness gate's height
included) is applied, a row (rule, edge, edge height, that block's hash, height) is written if none exists
for (rule, edge); the genesis builder writes the "on" rows of every rule whose on-height is 0 (listed at
0, or unlisted with a compiled default of 0) with the genesis hash and prints "rule activation records written for N rule(s) on from genesis". A rollback deletes the rows whose height is above the target.
At start every recorded edge is compared with the height this binary resolves (on(name) for "on",
off(name) for "off"); any disagreement, or a recorded rule the binary no longer knows, refuses the start.
How to compute it. The rows are written once per applied block, before the readiness gate's
evaluation; the table is node-local derived state, never in a snapshot; a node that did not apply an edge
(a joiner, a late upgrader) has no row for it, and the absence is not a disagreement. A node that
fast-synced past an edge (26) never recorded it and so cannot detect a binary that disagrees about it.
Rule activation. None.
Rejections and errors. The start refusal, one line per disagreement: "FATAL: rule <name> <edge>-height recorded on this chain at <recorded>: this binary resolves the <edge>-height to <resolved>, the chain recorded <recorded>", or "…: this binary no longer has the rule (its gate was removed; retire it with an off-height instead)", then "FATAL: this binary was built for another rule schedule than this chain recorded. …", exit 1.
Vector. computed: a chain built from 0.6.1 holds 125 "on" rows at edge_height 0 with its genesis
hash and no "off" rows (the builder prints "rule activation records written for 125 rule(s) on from genesis"). A binary that resolves taproot_recipients to 500 on that chain refuses to start ("… this binary resolves the on-height to 500, the chain recorded 0").
Test cases · §4c
2 cases · 1 valid · 1 invalid
A chain built from 0.6.1 records 125 on-edges at 0 and no off-edge
Loading the test widget…
A binary resolving taproot_recipients to 500 refuses to start
Loading the test widget…
Defects to match. None.
§5 What a boundary means for an implementation
Purpose. The replay obligation.
Inputs. A block at height h.
Output and effect. The rules applied to that block.
How to compute it. To validate a block at height h an implementation evaluates every gated decision
with the rules active at h. On every chain built from 0.6.1 (the DevNet, the TestNet, a chain from the
mainnet template) every rule is on from 0, so no pre-activation behaviour is ever needed, and the other
chapters of this specification describe only the active behaviour. A chain whose genesis lists a rule
above 0 (one built with --existing-chain) runs that rule's earlier behaviour below the height; this
specification does not describe it outside the activation machinery of this chapter. A node that joins by
snapshot (26) still judges every later block at its own height. A future release adds a bundle whose
rules have both sides on a live chain: an implementation then carries both sides of each and switches at
the bundle's effective height (§4b). At a boundary where two implementations disagree, the minority stops
accepting the majority's blocks: the record (§4c) and the readiness gate (§4b) exist to prevent the silent
case.
Rule activation. As per rule. Rejections and errors. As per rule.
Vector. computed: on a chain built from 0.6.1 a block whose two published receipts carry the same
recipient signature is invalid (DuplicateReceiptInBlock, 19 §2; receipt_once on from 0).
Test cases · §5
1 case · 1 invalid
On a chain built from 0.6.1 a block with the same receipt twice is invalid
Loading the test widget…
§6 The rules API
Purpose. The read-only view a wallet, explorer or implementation uses to check its clock against a live node.
Inputs. GET /api/v1/blockchain/rules.
Output and effect. One JSON object whose keys are in alphabetical order (every nested object's too):
activation_floor_blocks (5,760); bundle_id (this binary's bundle id, 601 for 0.6.1); bundles (one
entry per bundle of §4b step 3, gated or not, observation bundles included, in id order; empty when
there is none);
counted_seats (the counted registered nodes at the tip); current_height (tip); next_height (tip +
1); production_halt (the halt line of §4b step 10 for tip + 1, empty when the node may produce);
rules (one object per table row, in table order); signal_window_blocks (the window of §4b step 2 for
counted_seats at tip + 1). Each bundle entry: bundle (the id), checked_for_height (the last height
whose tally was taken, 0 before any), effective_height (null while pending), floor_blocks (5,760), floor_height
(null when the release is not registered), gated, observation_only, registered, registry_size (the
R of the last evaluation), rules (its rule names; empty for an observation bundle),
scheduled_height, signalling_producers (the last tally), state, threshold, window_blocks (the
window for registry_size at checked_for_height, or at tip + 1 before any evaluation). state is, in
this order: for an observation bundle "readiness observed; this binary must be upgraded" once decided,
else "watching a registered future release"; otherwise "not gated (compiled height stands)",
"active" (decided, tip + 1 ≥ effective), "activating" (decided, not yet), "unregistered (never activates until the release is registered)" or "pending". Each rule object: accumulating (at tip +
1), active (at the tip), active_next_block (at tip + 1), blocks_until_active (max(0, height − (tip + 1))), bundle, default_height, default_off_height (null when never), description (the table's
text), height (on(name), 4,294,967,294 while its bundle is pending), name, off_height (null when
never), off_source, recorded_off, recorded_on ({block_hash, height} or null, §4c), retirable,
retired (tip ≥ off-height), scheduled_height (before the readiness gate), source
("consensus_parameters" when the genesis holds a rule.<name> row, else "compiled_default"),
transaction_types ([{name, type}], types 0–4,095 scanned), warm_up_blocks. There is no
finalized_height key.
How to compute it. As stated (31).
Rule activation. None. Rejections and errors. HTTP 500 on an internal error.
Vector. computed. INPUT: GET /api/v1/blockchain/rules on either relaunched chain with its 11
genesis registered nodes counted. EXPECTED OUTPUT: bundle_id 601, counted_seats 11,
signal_window_blocks 720, activation_floor_blocks 5760, bundles [], production_halt "", 125
rules; the split_policy object has accumulating true, active true, active_next_block true,
blocks_until_active 0, bundle 0, default_height 30000, default_off_height null, height 0,
off_height null, off_source "compiled_default", recorded_off null, recorded_on {block_hash: the chain's block-0 hash, height: 0}, retirable false, retired false, scheduled_height 0, source
"consensus_parameters", transaction_types [{type 54}], warm_up_blocks 0; the receipt_once object
has bundle 601, default_height 1000000, height 0, retirable true. After the release of bundle 602 is
registered at 50,000 (§4b vector) bundles holds one entry {bundle 602, floor_height 55760, gated true, observation_only true, registered true, rules [], scheduled_height 0, state "watching a registered future release", …}, and from 56,000 on a 0.6.1 node state reads "readiness observed; this binary must be upgraded" and production_halt holds the FATAL line.
Test cases · §6
2 cases · 2 valid
The rules route on a relaunched chain with its 11 genesis registered nodes counted: the summary and split_policy
Loading the test widget…
The receipt_once object of the same route
Loading the test widget…
Defects to match. None.
§7 Data, consensus and local
Data: the consensus_parameters rows rule.<name> / rule_off.<name> (genesis, consensus, 07); the
versioned readiness_bundle_decision rows (consensus state under readiness_decision_state, carried in
snapshots, 26); the local rule_activation_record (§4c); the readiness gate's in-memory state (rebuilt
from the rows, or from the headers on a chain without the rows). Consensus: the 125 names, their compiled
defaults, off-heights, warm-ups and bundles, the precedence of §2, the type gates of §3, the readiness gate
and the signal check of §4b, the height each check uses, and the behaviour on each side of every edge.
Local: the API, the start log lines, the production halt, the record (derived per node).
A question about this chapter, or a statement that does not match the network? Discuss on zoobc.pro.