Conformance

An implementation claims a level when every check of that level's list in chapter 33 passes. The levels build on each other: a blocksmith is first a follower.

The four levels

L1 Follower

The node can sync from genesis or from a snapshot, validate every block and transaction, hold the same state as the network, follow the same fork choice.

The checklist from 33 §5

Purpose. The checks an implementation passes to claim L1: it syncs, validates and holds the same state as the network.

Inputs. The implementation; a P2P client of 27 (read RPCs only); the TestNet public API; the genesis files of 06; the tests of §2–§4. No key and no registration are needed.

Output and effect. L1 is claimed when every check passes.

Id The implementation computes Reference Pass when Chapters
L1-01 the config hash, the genesis hash and the block-0 id of the TestNet from its genesis file §1 equal 06
L1-02 every hash and generator test §2 equal 01, 20
L1-03 every key and signature test, the tampered-signature refusals included §3 equal; refusals refused 02
L1-04 every test of chapters 01–26, 29, 32, 34, 35, 36 listed in §4 §4 every EXPECTED value equal; every INVALID input refused with the exact text all
L1-05 the signature, hash and id of every transaction in the TestNet blocks it syncs the blocks over P2P; /transactions/:hash all valid; hashes equal 02, 03
L1-06 the header bytes, signature, hash, seed and VRF proof, payload, Merkle root and difficulty increment of every TestNet block /blocks/height/:h (31 §4) every hash equals; every signature and proof verifies 05, 20
L1-07 the full validation of 19 on every TestNet block; a copy with one byte altered — every block accepted; the altered copy refused with the reason 19 names 19, 20, 23
L1-08 a sync of the TestNet from genesis to the tip over signed P2P calls (ZBC-P2P-RPC-V3, 27), decoding every fetched block under the transport caps (more than max(500, max_transactions_per_block) transactions or ids, or more than 65,536 receipts, spine keys, manifests or non-signing statements, refuse the block, 27 §2) /blockchain/status and /blocks/height/:h the tip hash equals; no block refused 24, 27, 29
L1-09 the state at a confirmed height: balances, token balances, registry rows, scores and liveness, governable prices, releases, markets, apps, longevity records, stored files, groups, datasets the routes of 31 at the same height (/accounts/:a, /accounts/:a/tokens, /nodes, /governance/params, /release/list, /exchange/*, /apps, /longevity, /storage/files/:root, /groups/:g, /objects/:id) every value equal 07–18, 36
L1-10 the periodic steps (rent, longevity payout, escrow expiry, schedule fires, storage tally, bridge and oracle resolution) the ledger rows through /accounts/:a/movements the same accounts move by the same amounts at the same heights 22, 13, 08, 34
L1-11 fork choice and a reorganisation on a private two-node chain 24 the heavier branch wins; popped rows deleted; state restored 24
L1-12 the rule table and each rule's active at the tip /blockchain/rules the same 125 names, every height 0 and active true on both chains, bundle_id 601 29
L1-13 the snapshot of a reference height from its own state (65 state tables, format 3), and its chunks; a fast sync from a peer's snapshot the manifest on the spine (25, 26) the file hash and every chunk name equal; the fast-synced state equals L1-09 26
L1-14 the spine chain: every spine block's validity, required spine signatures and spine signers, the capped required spine signatures for 3–5 spine signers, a late spine block's majority (spine_late_vote) /spine/blocks/:h the same spine 25
L1-15 the 24 rules of bundle 601, among them receipt_once (a republished receipt refused), receipt_reference_in_window, block_size_serialized (the 1,288-per-receipt size), spine_threshold_capped (the cap on the required spine signatures), cosign_promise_binds (the signing commitment, 25), spine_equivocation_report (35 §7), foreign_carrier_bound (34 §10: a replayed carrier id and an Ethereum carrier whose nonce is not the account nonce each make the block invalid, ForeignCarrierReplayed / ForeignCarrierNonce), eth_signature_canonical_v (every ZooBC-signed signature by an Ethereum- or Tron-typed key carries v 27 or 28: the envelope, a multisig participant's signature, an escrow co-signature, the account-group consents of kind 0, 1 and 2, a fee-vote reveal's voter signature; a 0/1 or 29/30 copy refused, 02), canonical_account_forms (a full-key Ethereum, Tron or Bitcoin account form refused wherever a transaction names an account, a state-channel app taking only ZooBC, Solana, Polkadot and Taproot players, the typed multisig consent and the Tron kind-2 consent, 01, 16, 18), bridge_withdrawal_credit (34 §1a, §5, §5a: the custody account of each bridge coin, a ZBW1| TransferToken refused unless it is a withdrawal of an open coin to its custody with a destination its chain can pay (EIP-55 on mixed-case Ethereum addresses), every other transaction naming a custody account refused) and bridge_burn_supply_first (34), survival_mode (the flag at every height equals the stored one, a governance or bridge transaction refused while it is true, expulsions paused, the oracle, bridge and release resolutions paused and resumed at the first block whose flag is false, the survival-adjusted ages) 32 §4, §8, §16; 36 §12; /blockchain/status (survival_mode, survival_mode_tip, survival_distinct_producers: the distinct blocksmiths of the survival window) equal at every height 01, 02, 16, 18, 19, 23, 25, 34, 35, 36
L1-16 the liveness of every node after every block: effective score, missing, earns, mature, suspension, expulsion at zero /nodes equal for every node and block 36
L1-17 the envelope round trip for every sending account type: a transaction signed by each type (ZooBC, Solana, Polkadot, Taproot 64 bytes; Ethereum and Tron 65; Cardano and Tezos 98; Bitcoin legacy, P2PKH, P2SH, P2WPKH and Ripple the carried key, 99 or 131 bytes, to the end of the envelope), with a recipient and an escrow approver of the same type, serialized, parsed back and verified; the types that cannot send (Empty, Estonia eID, P2WSH, the dataset address) never verify 03, 02, 32 §2 every parsed transaction equals the one signed and verifies 02, 03

How to compute it. In the order above; L1-01 … L1-04 need no network; L1-05 … L1-08 need the P2P port of a TestNet node and a node key to sign the calls with (27); L1-09 … L1-10 need the API; L1-11 and L1-15 need a private chain (06) or the DevNet.

Rule activation. Every rule is active from height 0 on both chains.

Rejections and errors. A failing check names the chapter to re-read; a hash mismatch in L1-06 is almost always in 05's byte order or in the receipt serialisation of 23.

Vector. §1–§4.

Defects to match. Every "Defects to match" of the owning chapters must be reproduced for L1-08 to pass.

The chapters it needs, and their tests

The chapters whose level in the chapter table includes L1 (the level is the lowest one that needs the chapter; chapter 33 serves all levels). Test cases from the catalogue.

L2 Blocksmith

The node can be registered, make accepted blocks, sign and publish receipts, be scored, suspended and expelled by the same rules, send its fee-free duties. Builds on L1.

The checklist from 33 §6

Purpose. The checks an implementation passes to claim L2: it produces accepted blocks, publishes receipts, scores and is scored.

Inputs. L1; a node key registered on the chain (09: a NodeRegistration with its proof and stake, then admission from the queue); the implementation running as a peer for one admission cycle plus its maturity (4 units after admission and one own block, 36).

Output and effect.

Id The implementation does Reference Pass when Chapters
L2-01 handshake (timestamp within ±600 s), heartbeat, address announcement and proof of origin with its own key 27 accepted; its address listed by its peers 27
L2-02 stays connected for 24 h, signs every P2P call it makes with its node key for the node it calls (ZBC-P2P-RPC-V3), relays blocks and transactions, signs every receipt request (ZBC-RCPT digest) and names its key in RequestBlockTransactions (answered only for a caller whose key completed a handshake); charges a relayed invalid transaction to the sender's bound identity; keeps one in-flight copy per signed block hash and waits at most 10 s 27, 28 no ban, no RESOURCE_EXHAUSTED, no UNAUTHENTICATED, no throttling 27, 28
L2-03 is admitted and becomes mature 09, 36 /nodes shows mature and earns once 4 units have passed and it produced a block 09, 36
L2-04 produces its block when drawn (round timing, VRF seed, receipts for its priority peers, size within max_block_size_bytes as serialized, block.version 601) 20, 21, 23, 05 every block it produces is in every node's main chain 05, 20, 21, 23
L2-05 publishes receipts and never republishes one within 40 blocks 23, 19 its receipts appear in others' blocks and validate 23
L2-06 computes every node's score after every block /nodes equal 21, 36
L2-07 liveness on a private chain with one node stopped 36 missing from its first skipped turn, suspended at the 4th miss, expelled at score zero (never below 3 nodes; never in survival mode) 36
L2-08 the previous blocksmith from round 10; a key rotation 120 blocks after its block; an exit's hold and return 20, 09, 36 its blocks accepted at those rounds and keys 09, 20
L2-09 its fee-free duties (fee exactly 0: attendance, attestations, storage-proof batch, roll call, equivocation reports, the SpineEquivocationReport of type 62) and their relay; holds governance and bridge transactions while in survival mode 04, 27, 35, 36 mined in others' blocks; a copy with a fee refused 04, 27, 35, 36
L2-10 the empty-block rule and the position-1 candidate timing 20, 19 as 20 20

How to compute it. A private chain (06) with three registered keys first; then the DevNet, with the implementation's own node key registered (09).

Rule activation. Every rule is active from height 0 on both chains.

Rejections and errors. A refused block's reason names the check of 19.

Vector. §4.

Defects to match. Those of 20, 21, 23, 36.

The chapters it needs, and their tests

The chapters whose level in the chapter table includes L2 (the level is the lowest one that needs the chapter; chapter 33 serves all levels). Test cases from the catalogue.

#ChapterLevelsCasesValidInvalidComputedReference
20Blocksmith selection and timingL1, L232284311
23ReceiptsL1, L2473512443
27P2P wire protocolL1, L2169117521645
28P2P behaviourL2635585310
30Node operationL27960196118
33Vectors and conformanceall605645010
6 chapters4503519940347

L3 Server

The node can answer wallets, explorers, tools and gateways with the same HTTP routes, JSON shapes and errors. Builds on L1.

The checklist from 33 §7

Purpose. The checks an implementation passes to claim L3: wallets, explorers, tools and gateways get the same answers.

Inputs. L1; the implementation's HTTP API; a reference node's answers at the same height.

Output and effect.

Id The implementation serves Reference Pass when Chapters
L3-01 the 104 routes under /api/v1/ with the parameters, defaults, bounds, field names and order, types, hex case and id spellings of 31 §3–§8 31 a key-by-key comparison at the same confirmed height is empty for every read route 31
L3-02 CORS, OPTIONS, the empty-body 404, the error shape and its sanitising, Retry-After 31 §1 identical 31
L3-03 signed requests (METHOD:PATH:TIMESTAMP:BODY, ±300 s, the scopes, the lockout) 31 §2 (the signed-request test) the same requests accepted and refused 31
L3-04 POST /transactions (gates, body fields, 202 answers) and the cancel route (ZBC-CANCEL digest) 31 §5 identical for valid, duplicate, confirmed and invalid submissions 31, 04
L3-05 /blockchain/status with survival_mode, survival_mode_tip, survival_min_producers, survival_distinct_producers; /bridge/withdrawals/:hash with withdrawal_id and release_amount_wei, /bridge/coins with custody_account, zbc_withdraw_address, withdrawals_open and withdrawals_closed_reason, /bridge/withdrawal-requests, /bridge/deposits/:event_id; /accounts/:a/eth-tx-count with pending 31 §4, §6, §7, 36 §12, 34 §8 equal at every height 31, 34, 36
L3-06 /accounts/:a/transactions with scan_blocks held to 500 31 §6 the same rows for the same parameters 31
L3-07 the gateway form, when it serves as a gateway 31 §9 identical 31
L3-08 the admission limits (300 writes per 60 s, the lockout, the upload quotas) 31 §1, §7 the same 429 at the same count 31

How to compute it. Replay the requests of 31's tests against both servers at the same height; compare.

Rule activation. None.

Rejections and errors. 31.

Vector. 31's tests.

Defects to match. 31 §10.

The chapters it needs, and their tests

The chapters whose level in the chapter table includes L3 (the level is the lowest one that needs the chapter; chapter 33 serves all levels). Test cases from the catalogue.

#ChapterLevelsCasesValidInvalidComputedReference
31HTTP APIL36841273038
33Vectors and conformanceall605645010
2 chapters12897318048

L4 Keeper

The node can give spine signatures on spine block candidates, take, serve and attest snapshots, hold storage pieces and prove them. Builds on L2.

The checklist from 33 §8

Purpose. The checks an implementation passes to claim L4: it gives its spine signature on spine block candidates, takes and serves snapshots, holds and proves storage pieces.

Inputs. L2; 11, 25, 26.

Output and effect.

Id The implementation does Reference Pass when Chapters
L4-01 gives its spine signature on spine block candidates; keeps its signing commitment (one candidate per spine height until a spine block is stored there), re-signs exactly the candidate it committed to at any time, gives and counts non-signing statements (ZBC-SPINE-REFUSE) and records each one before signing it, never votes both ways on one candidate (35 §7), refuses a candidate whose spine blocksmith is not the one the selection draws or which comes too early 25, 27, 35 its signatures appear in the next spine blocks and verify; it is never charged by a SpineEquivocationReport 25, 35
L4-02 builds the spine block when the selection draws it as spine blocksmith, with the capped required spine signatures for 3–5 spine signers and the non-signing round for spine signers bound by a commitment; a late spine block with a majority of the spine signers 25 applied by every node 25
L4-03 takes the snapshot at every interval multiple (65 state tables, format 3) and writes its chunks 26 the file hash and every chunk equal the network's 26
L4-04 serves its chunks and fast-syncs a fresh instance of itself 26 the fresh instance reaches the tip with the same state 26
L4-05 holds its pieces, answers piece requests, submits one storage-proof batch per epoch 11, 26 accepted and paid 11, 26
L4-06 keeps the manifest rows and three snapshot generations; prunes at the same horizon 26, 22 equal 26
L4-07 attests each snapshot it builds (ZBCSNAP1:) and holds its share of the archive 26 its holder set equals the network's 26

How to compute it. On the DevNet or a private chain (the TestNet's snapshot interval is 172,800 blocks and its spine daily).

Rule activation. cosign_promise_binds (the signing commitment), spine_threshold_capped (the cap on the required spine signatures), spine_late_vote, spine_equivocation_report, active from height 0 on every chain.

Rejections and errors. 25, 26, 11.

Vector. §4 (chapters 11, 25, 26).

Defects to match. Those of 25, 26, 11.

The chapters it needs, and their tests

The chapters whose level in the chapter table includes L4 (the level is the lowest one that needs the chapter; chapter 33 serves all levels). Test cases from the catalogue.

#ChapterLevelsCasesValidInvalidComputedReference
11Decentralised storageL1, L4563917479
25The spine chainL1, L4713437710
26Snapshots and fast syncL1, L4775621707
33Vectors and conformanceall605645010
4 chapters2641857923826