On this page
- §0 The area in one paragraph
- §1 The chain identity and the public sources
- §2 Hashes and generators
- §3 Keys, addresses and signatures
- §4 The index of tests
- §5 Conformance checklist, level L1 (Follower)
- §6 Conformance checklist, level L2 (Blocksmith)
- §7 Conformance checklist, level L3 (Server)
- §8 Conformance checklist, level L4 (Keeper)
- §9 Consensus and local; summary of defects
33 — Vectors and conformance: the chain identity, the primitive vectors, the index of every test, and the checklist per compatibility level
Out of scope the working of each test (it is in the owning chapter's "Vector" heading; this chapter indexes it); mechanisms that produce no bytes (their chapters say none)
§0 The area in one paragraph
This chapter is the test bench of the specification. Every mechanism of chapters 01–36 ends with a "Vector" heading that gives at least one complete INPUT → EXPECTED OUTPUT example, with every value written out, and, where the mechanism refuses things, an invalid input with its exact refusal; those examples are the tests, and §4 indexes them all. This chapter adds what belongs to no single mechanism: the identity of the chain an implementation can join today and where to read it (§1), and the primitive vectors (hashes, generators, keys, signatures) every higher test rests on (§2, §3). It ends with the conformance checklists of the four compatibility levels (§5–§8): Follower (L1), Blocksmith (L2), Server (L3) and Keeper (L4). A test is computed (derived from the specification or from the shipped genesis files; reproducible offline) or none (the mechanism produces no bytes). Both chains, the TestNet and the DevNet, relaunch from their genesis files on 0.6.1 with every one of the 125 rules at height 0 and survival_min_producers 5, so nothing observed on an earlier chain is a test here: every test rests on the specification and the genesis files alone.
§1 The chain identity and the public sources
Purpose. An implementation must recognise the chain it joins and know where to read reference values.
Output and effect.
| Field | TestNet | DevNet |
|---|---|---|
chain_id / spine |
zoobc-test / zoobc-spine-test |
zoobc-dev / zoobc-spine-dev |
| Genesis hash (block 0, the identity) | the builder's output over the shipped file (06 §3): 3a2897e7c5ad6143429bab33a92d14d11ffd6fc281f2b62a6fd6b49c183b863d (config hash b4d46ec1…b381), fixed by the file alone, since the config hash commits every parameter and every rule height; a launch that restamps the file's timestamp changes it (06 §12), and the node announces the live value as genesis_hash on GET /api/v1/node/info and refuses a handshake with any other |
a37b1692ec47c7b17a7f9cb4c13cc8a73a1d5e843565a5733b9da2a544df99f8 (config hash 442a9ea5…b9d6), the same way |
| Block-0 id | the int64 LE of the first 8 bytes of the genesis hash (05): 4,855,352,938,787,711,034 for the shipped file |
−5,636,457,327,242,085,469 for the shipped file |
| Genesis timestamp (main and spine) in the shipped files | 1,793,509,027 | 1,793,509,027 |
| Spine genesis hash | the spine file's block 0 (25, 06 §7): 7cd929c4d52d9c9455ed179d24a65f90ecbf3d1a3e1214a19611635791b3545c for the shipped file; spine block 1 is due at the genesis timestamp + spine_smithing_period (86,400) |
5876b908090a5bca4bd735dd96a559fd8fbbe64c1419c053de227be3cacceef3; spine_smithing_period 3,600 |
| Node software | 0.6.1 (block.version 601): the 125 rules of 29 at height 0, bundle 601's 24 among them |
the same |
| Genesis state | 11 genesis registered nodes, 61 accounts, 14 genesis tokens (32 §15); counted_seats (the counted registered nodes) 11; survival_min_producers 5, so block 1 is in survival mode and the chain leaves it at the first height whose preceding 120 blocks show 5 distinct blocksmiths (36 §12) |
the same nodes, accounts and tokens; the DevNet parameters of 32 §12 |
| Public read source | the archival API https://zoobc.network/api/v1/… with fall-through to a node (31 §9); send a browser-like User-Agent (the default user agent of some HTTP libraries is refused). The registered nodes' P2P addresses are listed by GET /api/v1/node/peers and GET /api/v1/nodes (node_address); every RPC of 27 is signed by the caller's node key |
— |
Rule activation. 29.
Rejections and errors. A node whose block 0 differs never completes a handshake (27).
Vector. computed. INPUT: the shipped TestNet genesis hash, whose first 8 bytes are 3a2897e7c5ad6143, read as int64 little-endian → EXPECTED block-0 id 4,855,352,938,787,711,034; the DevNet's a37b1692ec47c7b1 → −5,636,457,327,242,085,469. INPUT: GET /api/v1/spine/blocks/0 on a node built from the shipped files → EXPECTED "height":0 and "timestamp":1793509027 (the shipped spine file's genesis_timestamp). INPUT: GET /api/v1/blockchain/rules → "bundle_id":601 and 125 rules at height 0. INVALID INPUT: a node built from a genesis file with one parameter changed → another genesis_hash; its handshake with the chain's nodes never completes.
Test cases · §1
7 cases · 6 valid · 1 invalid · 4 reference
The TestNet's identity, from its shipped genesis files
A launch that restamps the file's timestamp changes the genesis hash (06 §12); the node announces the live value as genesis_hash on GET /api/v1/node/info.
A stated value: there is nothing to compute. A compatible node shows the same value.
- chain_id
zoobc-test- spine_chain_id
zoobc-spine-test- config_hash
b4d46ec1c521cbd143109591bdc5188c76e120779a048f858a5b2c29125ab381- genesis_hash
3a2897e7c5ad6143429bab33a92d14d11ffd6fc281f2b62a6fd6b49c183b863d- block_0_id
4855352938787711034- genesis_timestamp
1793509027- spine_genesis_hash
7cd929c4d52d9c9455ed179d24a65f90ecbf3d1a3e1214a19611635791b3545c- spine_smithing_period
86400- block_version
601- rules
125- bundle_601_rules
24- genesis_registered_nodes
11- accounts
61- genesis_tokens
14- counted_seats
11- survival_min_producers
5
The DevNet's identity, from its shipped genesis files
A stated value: there is nothing to compute. A compatible node shows the same value.
- chain_id
zoobc-dev- spine_chain_id
zoobc-spine-dev- config_hash
442a9ea5cd5ab99f49ecaf80cc581e1961485e3909a6ab1a3c5c81380eb4b9d6- genesis_hash
a37b1692ec47c7b17a7f9cb4c13cc8a73a1d5e843565a5733b9da2a544df99f8- block_0_id
-5636457327242085469- genesis_timestamp
1793509027- spine_genesis_hash
5876b908090a5bca4bd735dd96a559fd8fbbe64c1419c053de227be3cacceef3- spine_smithing_period
3600- block_version
601- rules
125- bundle_601_rules
24- genesis_registered_nodes
11- accounts
61- genesis_tokens
14- survival_min_producers
5
The TestNet genesis hash and its block-0 id: the first 8 bytes 3a2897e7c5ad6143 as int64 little-endian
Loading the test widget…
The DevNet genesis hash and its block-0 id: the first 8 bytes a37b1692ec47c7b1 as int64 little-endian
Loading the test widget…
A genesis file with one parameter changed builds another genesis hash: the chain's nodes refuse the handshake
Loading the test widget…
Spine block 0 of a node built from the shipped files
The timestamp is the shipped spine file's genesis_timestamp; the block itself is computed by case 06-7-spine-genesis.
A stated value: there is nothing to compute. A compatible node shows the same value.
- request
GET /api/v1/spine/blocks/0- height
0- timestamp
1793509027
The rules of a node built from the shipped files
Every one of the 125 rules at height 0 (29).
A stated value: there is nothing to compute. A compatible node shows the same value.
- request
GET /api/v1/blockchain/rules- bundle_id
601- rules
125- height
0
Defects to match. None.
§2 Hashes and generators
Purpose. The primitive vectors every higher test rests on: SHA3-256, Keccak-256, Splitmix64, Xoroshiro128+ and the prefixed generator of 20.
Inputs. The strings, seeds and prefixes below.
Output and effect. Every row was reproduced by an implementation written from 01 and 20 alone.
SHA3-256 (01): 'test' → 36f028580bb02cc8272a9a020f4200e346e276ae664e45ee80745574e2f5ab80; '' → a7ffc6f8bf1ed76651c14756a061d662f580ff4de43b49fa82d80a4b80f8434a; 'hello world' → 644bcc7e564373040999aac89e7622f3ca71fba1d972fd94a31c3bfbf24e3938; 'ZooBC blockchain' → f8e50cad47a432631fc4c294d16cc3be828e0c5feb6c837c2f23a1c06fc14e8d.
Keccak-256 (02; the Ethereum hash is Keccak with the 0x01 padding, not SHA3's 0x06): '' → c5d2460186f7233c927e7db2dcc703c0e500b653ca82273b7bfad8045d85a470; 'hello' → 1c8aff950685c2ed4bc3174f3472287b56d9517b9c948127319a09a7a36deac8; 'hello world' → 47173285a8d7341e5e972fc677286384f802f8ef42a5ec5f03bbfa254cb01fad; 'test' → 9c22ff5f21f0b81b113e63f7db6da94fedef11b2119b4088b89664fb9a3cb658.
Splitmix64 (20: state = seed as u64; each output: state += 0x9E3779B97F4A7C15; z = state; z = (z ⊕ z≫30) × 0xBF58476D1CE4E5B9; z = (z ⊕ z≫27) × 0x94D049BB133111EB; out = z ⊕ z≫31; all mod 2⁶⁴), the first five outputs:
| seed (i64) | outputs 1–5 (u64) |
|---|---|
| 0 | 16294208416658607535, 7960286522194355700, 487617019471545679, 17909611376780542444, 1961750202426094747 |
| 1 | 10451216379200822465, 13757245211066428519, 17911839290282890590, 8196980753821780235, 8195237237126968761 |
| -1 | 16490336266968443936, 16834447057089888969, 4048727598324417001, 7862637804313477842, 13015481187462834606 |
| 12345 | 2454886589211414944, 3778200017661327597, 2205171434679333405, 3248800117070709450, 9350289611492784363 |
| 9876543210 | 16965301019760327471, 10275923502779094317, 9057763014174484733, 16254899801525447328, 6828271271999350159 |
| -9876543210 | 1351069659026832759, 2254389488592102209, 11048214108705841535, 14433481701645120553, 11677512056825562725 |
Xoroshiro128+ seeded from an i64 (20: s0, s1 = the first two Splitmix64 outputs of the seed; each draw: out = s0 + s1; s1 ⊕= s0; s0' = rotl(s0, 24) ⊕ s1 ⊕ (s1 ≪ 16); s1' = rotl(s1, 37); NextInt63 = out ≫ 1):
| seed | s0, s1 | NextInt63 outputs |
|---|---|---|
| 0 | 16294208416658607535, 7960286522194355700 | 2903875432571705809, 7783062752243886519, 7885241620833484273, 3537338830842728562 |
| 1 | 10451216379200822465, 13757245211066428519 | 2880858758278849684, 8817399022667424292, 3726292897828630722, 4815175979507302698 |
| -1 | 16490336266968443936, 16834447057089888969 | 7439019625174390644, 207593191878675672, 4967924389198505284, 4534029503514182557 |
| 12345 | 2454886589211414944, 3778200017661327597 | 3116543303436371270, 8386966431082539069, 3736225197729558312, 1284521530802632453 |
| 9876543210 | 16965301019760327471, 10275923502779094317 | 4397240224414935086, 2273251577023633764, 4838872711924625201 |
| -9876543210 | 1351069659026832759, 2254389488592102209 | 1802729573809467484, 6651524712777625727, 3035703366335574495 |
The prefixed generator RNG(prefix, seed) (20: h = SHA3-256(prefix ‖ seed); v = int64 big-endian of h[24..31]; Xoroshiro128+ seeded from v; draws = NextInt63). The live prefixes are ASCII zbc-blocksmith and zbc-coinbase (32 §4); the test prefixes below are arbitrary:
| prefix ‖ seed | h | v | first draws |
|---|---|---|---|
'BLOCKSMITH' ‖ 12345678 |
0bb4e1117249e721f03990fff175daacdd4ef51d943f52b8e1dce2013046baee |
-2171612425566635282 | 2811371144777292947, 4468523782695074205, 203846456688352722, 8323597467905407413, 2838484494516804126, 5582655932793395444 |
'LOTTERY' ‖ 626c6f636b5f686173685f68657265 |
a313ea50318d36c7769a02307702969a3b0a837d879e76e86e5e69dc9346c4ce |
7952910388067484878 | 4449625934249970533, 7765175150063633242, 904277176276276592, 4290620913491273615, 5384579898424254274, 4735139758705734715 |
'COINBASE' ‖ 0001020304050607 |
9ee9b93479ef65fd2faa38bcfee5cb40c1e59a03b0ac7a0dd364fed3169440b3 |
-3214164051465322317 | 530065552955017003, 6519009941629946501, 296975169654642886, 6197296743133201122, 8794905658328741624, 7869681857914037736 |
'' ‖ ffffffff |
904200c7d454fe3e8e1dfaa21b4e667f250cabd8f5730bd361feacf77fab1686 |
7061271444762334854 | 7107426145773671752, 4144607134654680158, 134309059395316265, 7976252563634138999, 1026306591421606501, 9221585736233423683 |
How to compute it. As stated in the tables; the modulus of a draw is taken of the non-negative i63.
Rule activation. None.
Rejections and errors. None.
Vector. The tables (computed). INPUT: SHA3-256 of the ASCII test → EXPECTED 36f028580bb02cc8272a9a020f4200e346e276ae664e45ee80745574e2f5ab80. INVALID INPUT (a common mistake): Keccak-256 of test given where SHA3-256 is required → 9c22ff5f…b658, which no ZooBC hash ever equals. The receipt picks of 23 use another engine (MT19937-64); its vector is in 23.
Test cases · §2
25 cases · 24 valid · 1 invalid · 1 reference
SHA3-256 of 'test'
Loading the test widget…
SHA3-256 of 'hello world'
Loading the test widget…
SHA3-256 of 'ZooBC blockchain'
Loading the test widget…
Keccak-256 of 'hello'
Loading the test widget…
Keccak-256 of 'hello world'
Loading the test widget…
Keccak-256 of 'test'
Loading the test widget…
SHA3-256 of the empty string
Loading the test widget…
Keccak-256 of the empty string
Loading the test widget…
Keccak-256 given where SHA3-256 is required: no ZooBC hash ever equals it
A common mistake: the Ethereum hash uses the padding byte 0x01, SHA3 uses 0x06.
A stated value: there is nothing to compute. The statement is a refusal: what a compatible node does with this input.
- sha3_256_of_test
36f028580bb02cc8272a9a020f4200e346e276ae664e45ee80745574e2f5ab80- keccak_256_of_test
9c22ff5f21f0b81b113e63f7db6da94fedef11b2119b4088b89664fb9a3cb658
Splitmix64 from the seed 0: the first five outputs
Loading the test widget…
Splitmix64 from the seed 1: the first five outputs
Loading the test widget…
Splitmix64 from the seed -1: the first five outputs
Loading the test widget…
Splitmix64 from the seed 12345: the first five outputs
Loading the test widget…
Splitmix64 from the seed 9876543210: the first five outputs
Loading the test widget…
Splitmix64 from the seed -9876543210: the first five outputs
Loading the test widget…
Xoroshiro128+ seeded from 0: the state and 4 draws
Loading the test widget…
Xoroshiro128+ seeded from 1: the state and 4 draws
Loading the test widget…
Xoroshiro128+ seeded from -1: the state and 4 draws
Loading the test widget…
Xoroshiro128+ seeded from 12345: the state and 4 draws
Loading the test widget…
Xoroshiro128+ seeded from 9876543210: the state and 3 draws
Loading the test widget…
Xoroshiro128+ seeded from -9876543210: the state and 3 draws
Loading the test widget…
The prefixed generator: 'BLOCKSMITH' and the seed 12345678
Loading the test widget…
The prefixed generator: 'LOTTERY' and the seed 626c6f636b5f686173685f68657265
Loading the test widget…
The prefixed generator: 'COINBASE' and the seed 0001020304050607
Loading the test widget…
The prefixed generator: '' and the seed ffffffff
Loading the test widget…
Defects to match. None.
§3 Keys, addresses and signatures
Purpose. The signing vectors of every account family an implementation must verify (02).
Inputs. The keys and messages below.
Output and effect.
Ed25519 (02): seed → public key: 4844e4045e1b8d8e862679db624a6f04a173a31ce2316c57029202b8915e438e → 768fe2180e414d437f5287c7edfc5d7df429af5272fca07e795f1bca38adeed2; 6e0a577f3b4c13b66bd04604752cb136a4b6292376310d601c847dfde4da150d → 9ec6d017149bcf78a61c4814f3d40386fa92eec51d4b45a9da35c36fba143814; 59a0c0673bab9fe6acf621e6dbf90801ba8adbf061b2c11aa8b7c36de05274da → 9f1343dc59acec240a985d6d943c5a75adc55542180f1452974cd80884293880. Signatures under the first seed over the raw ASCII message: 'hello' → 89877517afe260ed77e79f7760973e136dcc7ded1f80576fa392356e30da31cba50099b9b350dc4fc447e22a4569042ecad628e976770a143c3cf1781969f306; 'block data' → 8e817ec27788664d533ad635e51e3497a8da6899c93277f803ac58680ef136d17e2f07f63ee44461ca6064f7e0ad6a7616c100be10971923bca4fbd1656ebd09; 'transaction payload' → 0e24113f049540fec29f2fd0449b55201e1d91e574bd1167e127d2d11732b0126755e3df4d86ef7944d7e42583a67c609ed328615884b9e158efacf0a60daf01.
BIP-340 Schnorr (02, type-9 accounts = 09000000 ‖ x-only key; a signature with byte 10 flipped is refused):
| x-only public key | message (32) | signature (64) | source |
|---|---|---|---|
dff1d77f2a671c5f36183726db2341be58feae1da2deced843240f7b502ba659 |
243f6a8885a308d313198a2e03707344a4093822299f31d0082efa98ec4e6c89 |
6896bd60eeae296db48a229ff71dfe071bde413e6d43f917dc8dcf8c78de33418906d11ac976abccb20b091292bff4ea897efcb639ea871cfa95f6de339e4b0a |
BIP-340 specification vector 1 |
4f355bdcb7cc0af728ef3cceb9615d90684bb5b2ca5f859ab0f0b704075871aa |
2222222222222222222222222222222222222222222222222222222222222222 |
2600b9fff18847ba6486b575d70623f929cabecd7050c050da42f8e9a72f02ef8a73403ed1f92f1868e0077fc15a8e2528c09f5a2e9579a4859123ee3ad497e8 |
private key 0x11 × 32 |
a60869f0dbcf1dc659c9cecbaf8050135ea9e8cdc487053f1dc6880949dc684c |
db4bd5932f3d5094fd124202d6cf419b876fc5202c4a4fbbc874380d1d808028 |
3deef95b5580792eba7e7c45e77e24252daed45d50be227d3e01e0cbae768ddcffcba86b8df7177c907fe2e36c7569ceadb1437f4ba02709efab1a144e5c8c91 |
BIP-86 derivation → BIP-341 key-path tweak → BIP-340 |
Ethereum, legacy EIP-155 transactions (02; chain id 883 in these test transactions — a live chain derives its own id, 30): signing digest = Keccak-256(RLP(nonce, gasPrice, gas, to, value, data, chainId, 0, 0)); recovery id = v − 35 − 2 × chainId:
| raw transaction (hex) | Keccak-256 (the Ethereum hash) | nonce / to / value (wei) | recovered sender |
|---|---|---|---|
f86980018252089400000000000000000000000000000000000000aa880de0b6b3a76400008082070aa050954af8b961487a615f507bcf91b6472003e3980ee5673e728377e1a9f7f3dda0243c7a7cb63a8965b4977663f3c1b3697f6cfb833f66dc376d9a53656d8cb739 |
284485368bcfe248771ef716466e6d4d9df22b75c8d26cfc0f9f97b99baf785f |
0 / 00000000000000000000000000000000000000aa / 1,000,000,000,000,000,000 |
a4cb4cf242cf8d309e7f7cf1587c50b410f5e7e0 |
f86a80018252089400000000000000000000000000000000000000aa891b1ae4d6e2ef5000008082070aa060acfc8963116802dc0910b53dc5c76220efac1b8bb521064064297e1ab80315a0321b04733a880618404ba40f20e934b2ac3819c587123cc5e85d4aabbe2f66dd |
659f0947c0f94c3f429e2761c8077809acac3e569ab140434d1b47f3def49509 |
0 / 00000000000000000000000000000000000000aa / 500,000,000,000,000,000,000 |
19e7e376e7c213b7e7e7e46cc70a5dd086daff2a |
Ethereum, EIP-1559 transactions (hash = Keccak-256(0x02 ‖ RLP(list)); digest = Keccak-256(0x02 ‖ RLP(the first nine fields)); recovery id = y_parity):
| raw transaction (hex) | hash | chain / nonce / to / value | sender |
|---|---|---|---|
02f87682037380843b9aca00862b4f2c6af9e8825208946139a624f2d5cc37803f0d99136e3ac387396377880de0b6b3a764000080c001a0b63dd2e39e15b8533ae650c6d417ce7b4b09ed158ab589ff81a580def2c98404a0301bab249898c7a8e961e049233cca0b14c335cc45f20e53fb7935648ccb153c |
1220d667268f94a19a0cb3832cd900d9ab5ed0eea76ddeb7269c0e4b2d05b4b8 |
883 / 0 / 6139a624f2d5cc37803f0d99136e3ac387396377 / 1,000,000,000,000,000,000 |
1563915e194d8cfba1943570603f7606a3115508 |
02f87682037301843b9aca00862b4f2c6af9e8825208946139a624f2d5cc37803f0d99136e3ac387396377881bc16d674ec8000080c080a039e58f3604d7fe0aa67c77c581a34ec6b525e6e560ac0858d4c1405585e0cec7a0351ebba5e8b6818845358325f012da7292e0451858c4cf197317fa24b532e49e |
61dcb2de6cc1f55784ac3f48759c2f5e3a0b5e93b182ca4e2c86685082335dce |
883 / 1 / 6139a624f2d5cc37803f0d99136e3ac387396377 / 2,000,000,000,000,000,000 |
1563915e194d8cfba1943570603f7606a3115508 |
The private key 51bae95d58f32304a5c9d894819989a4fb04da6115d9a43612a026e7a5dd5d96 owns the Ethereum address 3bc64c92d9bb1c5826643b081108b892e2e7f590 (a type-4 account is 04000000 ‖ the 20-byte address, 01). EIP-55 of 2c7536e3605d9c16a7a3d7b1898e529396a65c23 is 0x2c7536E3605D9C16a7a3D7b1898e529396a65c23.
Polkadot (02 §7, type-12 accounts, 01 §4): seed 42 × 32 → sr25519 public key a4d007a95b28ce117e4051904503612abdcbd22b60475121f92a8b5dedac375a (the mini secret expanded the Ed25519 way: SHA-512 of the seed, its first 32 bytes clamped — byte 0 AND F8, byte 31 AND 3F OR 40 — read little-endian and divided by the cofactor 8, times the Ed25519 base point, encoded as a Ristretto255 point), SS58 prefix 0 14j6ekb87LG6TgqexArYBTLsemPXshEzEkdWaufm95Sw3u2L, prefix 2 GJRAjfvsv1YmoeamEcawFsiwjg7z4W2cdjmpGxN4nducawX, prefix 42 5FnoWRL4FYzd29q8zXoY3JWio9PtBPgrAFu2RcgQazRQsiCs (prefix byte ‖ key ‖ the first 2 bytes of BLAKE2b-512(ASCII SS58PRE ‖ prefix byte ‖ key), in Bitcoin base58). All four values were re-derived by an implementation written from this paragraph alone.
Addresses (01): the base32 text form, the checksum, the prefixes ZBC_/ZNK_/ZBG_/ZBR_/ZBS_/ZBK_ and the typed byte forms carry their tests in 01; the group address in 18; the dataset deposit address in 10; the multisignature address in 12. Computed by 01's text form: ZBC_XTFYBAQN_HY7443TC_6HBIHLHW_WCVYQSUT_PL2HCIG6_F77IRI4T_WTLOGT6O is the account 00000000bccb80820d3e3fce6e62f1c283acf6b0ab884a937af47120de2ffe88a393b4d6 (31 §9).
How to compute it. 02 per family; RLP as in the Ethereum yellow paper, Keccak-256 with 0x01 domain padding, secp256k1 recovery with the parity of the recovery id; BIP-340 verification with the tagged hash BIP0340/challenge.
Rule activation. Signing version 2 from genesis (02). Rule eth_signature_canonical_v, active from height 0 on every chain: a signature a ZooBC transaction carries for an Ethereum- or Tron-typed key (its envelope, a multisig participant's signature, an escrow co-signature, an account-group consent, a fee-vote reveal) is 65 bytes ending in 27 or 28; the raw Ethereum transactions of the tables are foreign carriers and keep their own chain's v (EIP-155 or y_parity).
Rejections and errors. 02 per family.
Vector. The tables (computed). INVALID INPUT: the first BIP-340 row with byte 10 of the signature flipped → refused. INVALID INPUT: a ZooBC transaction from a type-4 account whose 65-byte envelope signature ends in 01 (the same r ‖ s, v 1 instead of 28) → refused Ethereum signature recovery id must be 27 or 28.
Test cases · §3
23 cases · 21 valid · 2 invalid
Ed25519 public key of test seed 1
Loading the test widget…
Ed25519 public key of test seed 2
Loading the test widget…
Ed25519 public key of test seed 3
Loading the test widget…
Ed25519 signature of 'hello' under test seed 1
Loading the test widget…
Ed25519 signature of 'block data' under test seed 1
Loading the test widget…
Ed25519 signature of 'transaction payload' under test seed 1
Loading the test widget…
BIP-340 specification vector 1
Loading the test widget…
A BIP-340 signature by the private key 0x11 × 32
Loading the test widget…
A Taproot key-path signature (BIP-86 key, BIP-341 tweak)
Loading the test widget…
The first BIP-340 signature with byte 10 flipped is refused
Loading the test widget…
A legacy EIP-155 transfer of 1 ether (chain 883)
Loading the test widget…
A legacy EIP-155 transfer of 500 ether (chain 883)
Loading the test widget…
An EIP-1559 transfer of 1 ether, nonce 0
Loading the test widget…
An EIP-1559 transfer of 2 ether, nonce 1
Loading the test widget…
The Ethereum address of the test private key
Loading the test widget…
The EIP-55 form of an address
Loading the test widget…
The sr25519 public key of the seed 42 × 32 (expanded the Ed25519 way, a Ristretto255 point)
Loading the test widget…
The SS58 text of that key with prefix 0
Loading the test widget…
The SS58 text of that key with prefix 2
Loading the test widget…
The SS58 text of that key with prefix 42
Loading the test widget…
ZBC_XTFYBAQN_…_WTLOGT6O is the account 00000000 ‖ bccb8082…b4d6
Loading the test widget…
A SendZBC from a type-4 account with its 65-byte envelope signature ending in 28
Loading the test widget…
The same signature with v 1 instead of 28 (the same recovery id) is refused
Loading the test widget…
Defects to match. None.
§4 The index of tests
Purpose. Every test of the specification in one list, so a test page can run them all and an implementer can track coverage.
Inputs. The "Vector" heading of every mechanism of chapters 01–36 as they stand in this edition.
Output and effect. One row per mechanism that carries a "Vector" heading (401 mechanisms; a subsection is its own row when it carries its own "Purpose" heading, else it belongs to its section; this index is not a row): the chapter and section, the mechanism's title, the source of its tests (computed: derived from the specification or from the shipped genesis files and reproducible offline; none: the mechanism produces no bytes), and the number of valid tests (an INPUT with its EXPECTED OUTPUT) and invalid tests (an invalid input with its exact refusal) the section gives. The count is mechanical, so that anyone recounts the same numbers: in a Vector heading every INPUT or Input marker is one test and every INVALID INPUT, Invalid input or INVALID marker one invalid test; a heading without input markers counts one test per arrow →, an arrow whose output is a refusal (refused, rejected, invalid, or a quoted error text) being an invalid test; a heading with neither states one worked example and counts 1; a heading that says none or "None needed" counts 0. Only tests that hold on a chain built from 0.6.1 are counted: an example read from a chain that no longer runs is not a test. Totals: 816 valid and 191 invalid tests, 1,007 in all. This index counts the tests the chapters state, with the rule above; the conformance catalogue that the website runs holds more cases (2,508 in this edition: one case per checked output and per refusal of every stated test, plus the reference statements of sections that give a fact rather than a vector), every computed one proven equal to the reference implementation. The two numbers count different things and both are exact. Among them: the genesis identities of both chains (06 §3, §1 above), the signed P2P call (27 §1a), the signed-request preimage and signature (31 §2), the survival-flag sequence and the survival-adjusted vote age (36 §12), the miss and suspension sequence with scores (36 §3), the 544-byte EquivocationReport with its refusals (35 §2–§3), the 372-byte SpineEquivocationReport with its four refusals (35 §7), the bridge attestation body (34 §3), the withdrawal id (34 §9), the foreign-carrier bindings (34 §10), the serialized block size (05 §10.1, 19 §8) and the receipt-once window (19 §9, 32 §8).
| Chapter § | Mechanism | Source | Valid | Invalid |
|---|---|---|---|---|
01 §1 |
Integers, byte order and units | computed | 1 | 0 |
01 §2 |
Hash functions | computed | 1 | 0 |
01 §3 |
Text encodings | computed | 2 | 0 |
01 §4 |
The account address (byte form) | computed | 1 | 1 |
01 §5 |
The ZooBC text address (ZBC_ family) |
computed | 2 | 1 |
01 §6 |
Foreign text forms | computed | 1 | 0 |
01 §7 |
Keyless and derived addresses | computed | 1 | 0 |
01 §8 |
The verifiable random function (ECVRF, ZooBC variant) | computed | 1 | 1 |
02 §1 |
The transaction signing digest and the transaction hash | computed | 1 | 0 |
02 §2 |
Verification dispatch by account type | computed | 3 | 0 |
02 §3.1 |
Native accounts (type 0, type 11, unknown types) and raw node-key signatures | computed | 1 | 0 |
02 §3.2 |
Key-carrying envelope (Cardano type 13, Tezos type 16) | computed | 1 | 0 |
02 §4 |
secp256k1 ECDSA, Bitcoin style (types 1, 5, 6, 7, 14) | computed | 1 | 0 |
02 §5 |
secp256k1 ECDSA, Ethereum style (types 4, 15) | computed | 1 | 0 |
02 §6 |
BIP-340 Schnorr (Taproot, type 9) | computed | 1 | 0 |
02 §7 |
sr25519 (Polkadot, type 12) | computed | 1 | 0 |
02 §8 |
Accounts that cannot sign | computed | 3 | 0 |
02 §9 |
Native foreign transactions carried in the message field | computed | 1 | 5 |
02 §10 |
Multi-signature accounts | computed | 1 | 1 |
02 §11 |
Everything else a key signs on this chain | computed | 4 | 0 |
02 §12 |
Off-chain message signing (tools and wallets, not consensus) | computed | 1 | 0 |
02 §13 |
Encrypted messages (not consensus) | computed | 1 | 0 |
02 §14 |
Key derivation (not consensus) | computed | 2 | 0 |
03 §1 |
The envelope byte layout | computed | 1 | 0 |
03 §2 |
Transaction type identifiers | computed | 9 | 2 |
03 §3 |
Sender and recipient | computed | 3 | 1 |
03 §4 |
Version, fee, survival and expiry | computed | 1 | 0 |
03 §5 |
Timestamp | computed | 1 | 1 |
03 §6 |
The body | computed | 2 | 1 |
03 §7 |
The escrow part | computed | 1 | 1 |
03 §8 |
The message | computed | 1 | 3 |
03 §9 |
The signature field, the hash and the id | computed | 1 | 1 |
03 §10 |
Wire and submission forms | computed | 1 | 0 |
03 §11 |
Parsing an envelope | computed | 1 | 3 |
03 §12 |
What makes a well-formed envelope unacceptable | computed | 3 | 0 |
04 §1 |
The storage-rent primitive | computed | 1 | 0 |
04 §2 |
The fee floor | computed | 1 | 0 |
04 §3 |
The fee scale | computed | 1 | 0 |
04 §4 |
The escrow rent | computed | 1 | 1 |
04 §5 |
What is charged and refunded (consensus) | computed | 5 | 0 |
04 §6 |
Admission: the checks a transaction passes before it is pooled (node-local) | computed | 6 | 0 |
04 §7 |
The reservation of spendable balance (node-local) | computed | 3 | 1 |
04 §8 |
Fee per byte and the pool's order (node-local) | computed | 2 | 0 |
04 §9 |
The worst-case ZBC outflow of a transaction | computed | 5 | 0 |
04 §10 |
Block assembly: selecting transactions for a candidate (blocksmith policy) | computed | 1 | 1 |
04 §11 |
The rejection log and the status route (node-local observability) | computed | 2 | 0 |
04 §12 |
The fee-estimate and fee-parameter routes | computed | 6 | 1 |
05 §1 |
The header fields | computed | 1 | 0 |
05 §2 |
The header bytes | computed | 1 | 0 |
05 §3 |
The block signature | computed | 2 | 1 |
05 §4 |
The block hash and the block id | computed | 2 | 1 |
05 §5 |
The block seed | computed | 3 | 1 |
05 §6 |
The payload hash and the payload length | computed | 1 | 1 |
05 §7 |
The transaction Merkle root | computed | 5 | 1 |
05 §8 |
The totals and the constant fields | computed | 2 | 2 |
05 §9 |
The cumulative difficulty | computed | 2 | 1 |
05 §10 |
Size ceilings and the order of format checks | computed | 3 | 0 |
05 §10.1 |
The serialized block size | computed | 2 | 1 |
05 §11 |
The wire form | computed | 1 | 0 |
05 §12 |
The API form | computed | 1 | 0 |
06 §1 |
The configuration files | computed | 1 | 2 |
06 §2 |
Consensus parameters and rule heights | computed | 2 | 1 |
06 §3 |
The config hash and the genesis hash | computed | 5 | 1 |
06 §4 |
The genesis block of the main chain | computed | 1 | 0 |
06 §5 |
Accounts, tokens and token balances at height 0 | computed | 1 | 0 |
06 §6 |
The node registry, node accounts and scores at height 0 | computed | 1 | 0 |
06 §7 |
The spine genesis block | computed | 1 | 0 |
06 §8 |
The coinbase ceiling | computed | 2 | 1 |
06 §9 |
Everything else at height 0 | computed | 1 | 0 |
06 §10 |
Build-time invariants | computed | 4 | 1 |
06 §11 |
How the node reads genesis | computed | 1 | 0 |
06 §12 |
Launching a chain, and the live chains | computed | 1 | 0 |
06 §13 |
Appendix: the genesis texts every snapshot carries | computed | 1 | 1 |
07 §1 |
The consensus state tables and their schemas | computed | 2 | 0 |
07 §2 |
Versioning: the one rule behind every table | computed | 1 | 1 |
07 §3 |
Accounts | computed | 1 | 1 |
07 §4 |
Tokens and token balances | computed | 1 | 0 |
07 §5 |
The ledger | computed | 1 | 1 |
07 §6 |
Objects with a lifetime: datasets, files, longevity, escrow, streams, schedules, multisig | computed | 1 | 0 |
07 §7 |
Exchange and apps | computed | 3 | 0 |
07 §8 |
Registry, consensus and governance tables | computed | 4 | 0 |
07 §9 |
History and node-local tables | none | 0 | 0 |
07 §10 |
What a reorganisation does to the state | computed | 1 | 0 |
07 §11 |
What a snapshot carries | computed | 2 | 1 |
07 §12 |
Touched accounts of a transaction | computed | 1 | 0 |
07 §13 |
The node's spendable-balance view | computed | 1 | 0 |
08 §1 |
What every transaction passes through before its type runs | computed | 5 | 0 |
08 §2 |
Empty (0) | computed | 2 | 0 |
08 §3 |
SendZBC (1) | computed | 6 | 0 |
08 §3.1 |
SendZBCBatch (257) | computed | 1 | 1 |
08 §4 |
LiquidPayment (6) and LiquidPaymentStop (262) | computed | 1 | 1 |
08 §5 |
CreateTrigger (15) and CancelTrigger (16) | computed | 2 | 1 |
08 §6 |
ScheduledTransfer (29) | computed | 2 | 1 |
08 §7 |
CancelSchedule (30) | computed | 1 | 1 |
08 §8 |
ReassignSchedule (31) | computed | 1 | 1 |
08 §9 |
SetSplitPolicy (54) and SetTransactPolicy (50): the bodies | computed | 1 | 1 |
08 §10 |
The split policy's effect on every incoming payment | computed | 1 | 0 |
08 §11 |
The transact policy's effect on every transaction | computed | 3 | 0 |
08 §12 |
The ledger rows of this family | computed | 1 | 0 |
09 §1 |
The registry row, the three statuses and the reads the protocol makes of them | computed | 2 | 0 |
09 §2 |
Proof of ownership | computed | 1 | 1 |
09 §3 |
NodeRegistration (2) | computed | 2 | 1 |
09 §4 |
NodeRegistrationUpdate (258) | computed | 2 | 1 |
09 §5 |
RemoveNodeRegistration (514): the exit | computed | 3 | 1 |
09 §6 |
ClaimNodeRegistration (770) | computed | 1 | 1 |
09 §7 |
QueueAttendance (59) | computed | 1 | 1 |
09 §8 |
The admission timer | computed | 1 | 0 |
09 §9 |
Queue order and the attendance gate | computed | 1 | 0 |
09 §10 |
Admission, and the resume admission | computed | 1 | 0 |
09 §11 |
Expulsion and the return of the stake | computed | 1 | 0 |
09 §12 |
Maturity | computed | 1 | 0 |
09 §13 |
Status transitions, and what is consensus here | none | 0 | 0 |
09 §14 |
RollCall (61): the roll call at a chain's start | computed | 4 | 1 |
10 §1 |
The state of this area and its read views | computed | 4 | 0 |
10 §2 |
SetupAccountDataset (3) to an ordinary recipient: create an object or rewrite its row | computed | 1 | 0 |
10 §3 |
Writing and removing a record of a dataset | computed | 4 | 0 |
10 §4 |
RemoveAccountDataset (259) of an ordinary row | computed | 1 | 0 |
10 §5 |
AddPrepaidStorage (9) | computed | 1 | 0 |
10 §6 |
TransferDataset (42) and AcceptDataset (44) | computed | 6 | 0 |
10 §7 |
SetDatasetPolicy (43) | computed | 1 | 0 |
10 §8 |
Funding a dataset: the deposit list and the unconsumed parts | computed | 2 | 0 |
10 §9 |
DeleteDataset (45): the vote and the deletion | computed | 5 | 0 |
10 §10 |
DFS files: the metadata record, the path rules and the chunks | computed | 1 | 0 |
10 §11 |
DFSCreateFile (8), DFSUpdateFile (264), DFSDeleteFile (520) | computed | 2 | 0 |
10 §12 |
Dataset rent: the per-block billing step | computed | 3 | 0 |
10 §13 |
The reserved namespaces | computed | 2 | 0 |
11 §1 |
Pieces, the manifest and the root | computed | 2 | 0 |
11 §2 |
StoreFile (40) | computed | 2 | 1 |
11 §3 |
FundStoredFile (296) | computed | 1 | 1 |
11 §4 |
Stored-file rent and the storage pool | computed | 2 | 0 |
11 §5 |
Replica placement and epochs | computed | 1 | 0 |
11 §6 |
Proof of possession: SubmitStorageProof (41) and SubmitStorageProofBatch (297) | computed | 1 | 1 |
11 §7 |
The epoch tally | computed | 3 | 0 |
11 §8 |
Access control at fetch (HTTP) | computed | 5 | 0 |
11 §9 |
Piece transport (P2P) and placement upkeep | computed | 2 | 0 |
11 §10 |
Upload admission and the quote (HTTP) | computed | 3 | 1 |
11 §12 |
The snapshot archive | computed | 2 | 1 |
12 §1 |
The escrow part of a transfer | computed | 8 | 2 |
12 §2 |
Creating an escrow: the hold | computed | 1 | 1 |
12 §3 |
Escrow rent | computed | 2 | 0 |
12 §4 |
ApprovalEscrow (4) | computed | 4 | 2 |
12 §5 |
Expiry | computed | 2 | 0 |
12 §6 |
EscrowRequest (260) | computed | 3 | 0 |
12 §7 |
Funding a request | computed | 2 | 0 |
12 §8 |
DeclineEscrowRequest (516) | computed | 4 | 0 |
12 §9 |
The multisignature account | computed | 1 | 0 |
12 §10 |
MultiSignature (5) | computed | 5 | 2 |
12 §11 |
Lifecycles, ledger rows and the state | none | 0 | 0 |
13 §1 |
The survival field and the header survival | computed | 2 | 1 |
13 §2 |
The longevity record, the interval, the period and the free window | computed | 1 | 1 |
13 §3 |
FundLongevity (52) | computed | 4 | 1 |
13 §4 |
CancelLongevity (53) | computed | 1 | 0 |
13 §5 |
CloseLongevity (309) | computed | 5 | 0 |
13 §6 |
Longevity rent | computed | 2 | 0 |
13 §7 |
The longevity pool payout (per block, through the lottery) | computed | 2 | 0 |
13 §8 |
The pruning horizon and what is pruned | computed | 3 | 0 |
13 §9 |
Account rent and account pruning | computed | 4 | 0 |
13 §10 |
Token persistence and expiry | computed | 4 | 0 |
14 §1 |
The token row, the balances and the asset kinds | computed | 1 | 0 |
14 §2 |
The symbol and name rules | computed | 3 | 11 |
14 §3 |
IssueToken (10) | computed | 4 | 1 |
14 §4 |
TransferToken (11) | computed | 3 | 1 |
14 §4a |
TransferTokenBatch (267) | computed | 4 | 1 |
14 §5 |
A fee paid in the token | computed | 4 | 0 |
14 §6 |
MintToken (12) | computed | 1 | 1 |
14 §7 |
BurnToken (13) | computed | 2 | 1 |
14 §8 |
FinanceToken (14) | computed | 2 | 1 |
14 §9 |
Persistence and expiry, as the operations see them | computed | 1 | 0 |
15 §1 |
Assets, prices and the tables | computed | 2 | 0 |
15 §2 |
CreateSwapOffer (18) | computed | 1 | 1 |
15 §3 |
AcceptSwapOffer (19) | computed | 1 | 1 |
15 §4 |
CancelSwapOffer (20) | computed | 1 | 1 |
15 §5 |
CreateMarket (21) | computed | 2 | 1 |
15 §6 |
PlaceOrder (22): hold, match, rest | computed | 6 | 1 |
15 §7 |
CancelOrder (23) | computed | 1 | 1 |
15 §8 |
Order expiry and market rent | computed | 3 | 0 |
16 §1 |
The app row, seats, the pool and the shared settlement | computed | 2 | 0 |
16 §2 |
CreateApp (24) | computed | 1 | 2 |
16 §3 |
JoinApp (25) | computed | 3 | 1 |
16 §3a |
An unstarted multiplayer app closes itself | computed | 1 | 1 |
16 §4 |
AppMove (26) | computed | 4 | 1 |
16 §5 |
ResignApp (27) and ClaimAppTimeout (28) | computed | 2 | 1 |
16 §6 |
Solo apps: the draw, the payout tables and the resolver | computed | 2 | 0 |
16 §7 |
The rules engine | computed | 2 | 1 |
16 §8 |
SettleApp (39) and the channel settlement | computed | 3 | 1 |
17 §1 |
Who may vote: attesters, counted registered nodes and quorums | computed | 4 | 0 |
17 §1a |
Governance in survival mode | computed | 3 | 0 |
17 §2 |
FeeVoteCommitment (7) and FeeVoteReveal (263) | computed | 1 | 1 |
17 §3 |
The fee-scale count | computed | 4 | 0 |
17 §4 |
AttestEvent (17) and the oracle resolution | computed | 2 | 1 |
17 §5 |
SetConsensusParam (51) and the price count | computed | 4 | 1 |
17 §6 |
RegisterRelease (32), ReleaseAuthorityPropose (33), ReleaseAuthorityAccept (34), RevokeRelease (35) | computed | 6 | 1 |
17 §7 |
RegisterGateway (36), GatewayHeartbeat (37), UnregisterGateway (38) and the prune | computed | 1 | 1 |
17 §8 |
RegisterArchival (46), UnregisterArchival (47), RegisterRelay (48), UnregisterRelay (49) | computed | 3 | 1 |
17 §9 |
The announcement registry (node-local) | none | 0 | 0 |
18 §1 |
The group address, the tables and the resolution rule | computed | 1 | 0 |
18 §2 |
The bodies and the consent proof | computed | 5 | 1 |
18 §3 |
LinkAccount (55) | computed | 2 | 1 |
18 §4 |
UnlinkAccount (56) | computed | 2 | 1 |
18 §5 |
SetMemberPermissions (57) and TransferGroupControl (58) | computed | 1 | 1 |
18 §6 |
What joining moves | computed | 1 | 0 |
18 §7 |
The join blockers | computed | 3 | 0 |
18 §8 |
A member's transaction: the gate and the limit | computed | 1 | 1 |
18 §9 |
Rent, dissolution and the views | computed | 4 | 0 |
19 §1 |
The four ways in and the pre-checks | computed | 4 | 0 |
19 §2 |
The validator's ordered checks | computed | 1 | 1 |
19 §3 |
The timestamp window and the blocksmith's right | computed | 1 | 1 |
19 §4 |
Application: what can still refuse a valid block | computed | 4 | 0 |
19 §5 |
The candidate pool | computed | 3 | 0 |
19 §6 |
Fork resolution | computed | 3 | 0 |
19 §8 |
The serialized block size | computed | 5 | 0 |
19 §9 |
A receipt counts in one block | computed | 3 | 0 |
19 §10 |
Survival mode | computed | 6 | 0 |
20 §1 |
The selection generator and the active and selectable sets | computed | 3 | 0 |
20 §2 |
Rounds, targets and windows | computed | 1 | 0 |
20 §3 |
Priority, position and the empty-block rule | computed | 3 | 0 |
20 §4 |
Producing a block | computed | 5 | 0 |
20 §5 |
Skipped blocksmiths | computed | 3 | 0 |
20 §6 |
Difficulty and cumulative difficulty | computed | 3 | 1 |
20 §7 |
Who earns, and the production set | computed | 2 | 0 |
21 §1 |
The order of application | computed | 1 | 0 |
21 §2 |
The coinbase, the pool and the lottery | computed | 5 | 1 |
21 §3 |
Participation scores (what a block applies) | computed | 3 | 0 |
21 §4 |
Registry changes at the block boundary | computed | 2 | 0 |
22 §1 |
The schedule | computed | 1 | 0 |
22 §2 |
Escrow expiry (S1) | computed | 1 | 0 |
22 §3 |
Liquid-payment completion (S2) | computed | 1 | 0 |
22 §4 |
Due solo bets, channel settlements, unstarted apps and order expiry (S3–S5) | computed | 1 | 0 |
22 §5 |
The fee-scale count (P1) | computed | 1 | 0 |
22 §6 |
Dataset rent (P2) | computed | 2 | 0 |
22 §7 |
Token expiry settlement (P3) | computed | 3 | 0 |
22 §8 |
Account rent and account pruning (P4) | computed | 2 | 0 |
22 §9 |
Height triggers (P5) and timed schedules (P6) | computed | 2 | 0 |
22 §10 |
Gateway pruning (P7) | computed | 1 | 0 |
22 §11 |
Stored-file rent (P8), the storage-proof tally (P11) and the archive reward (A) | computed | 1 | 0 |
22 §12 |
Longevity rent (P9) and the longevity payout (P10) | computed | 1 | 0 |
22 §13 |
Oracle resolution (P12), bridge deposits and withdrawals (P13–P14), the price count (P15), release governance (P15b) | computed | 6 | 0 |
22 §14 |
The prune (P16) and the snapshot trigger | computed | 3 | 0 |
23 §1 |
The receipt and its bytes | computed | 1 | 1 |
23 §2 |
Receipt requests, issuing and keeping receipts | computed | 1 | 1 |
23 §3 |
Batches and the receipt Merkle root | computed | 1 | 0 |
23 §4 |
Published receipts in a block | computed | 1 | 1 |
23 §5 |
Validation of published receipts | computed | 7 | 1 |
23 §6 |
Receipt selection by the blocksmith (reproduced behaviour) | computed | 1 | 0 |
23 §7 |
The scramble and the priority peers | computed | 1 | 1 |
23 §8 |
Linked receipts and their proof | computed | 1 | 1 |
23 §9 |
The random picks (reproduced exactly) | computed | 3 | 0 |
23 §10 |
Receipts and the participation score | computed | 2 | 0 |
23 §11 |
State and the consensus/local split | computed | 1 | 0 |
24 §1 |
Cumulative difficulty and its comparison | computed | 1 | 0 |
24 §2 |
The sync loop, the sync source and the fork triggers | computed | 1 | 0 |
24 §3 |
Fork resolution | computed | 1 | 0 |
24 §4 |
Finding the common block (milestones) and the split point | computed | 1 | 0 |
24 §5 |
The peer polls | computed | 1 | 0 |
24 §6 |
Rollback: popping blocks and restoring state | computed | 1 | 0 |
24 §7 |
The candidate pool and the selection loop | computed | 3 | 0 |
24 §8 |
Health check, investigation and deeper rollback | computed | 1 | 0 |
24 §9 |
The incomplete-block queue | computed | 2 | 0 |
24 §10 |
The wedge: declaration, in-place rebuild, resync marker | computed | 1 | 0 |
25 §1 |
The spine block | computed | 1 | 0 |
25 §2 |
The payload hash | computed | 1 | 1 |
25 §3 |
Public-key changes and the spine signers | computed | 1 | 0 |
25 §4 |
Manifests | computed | 1 | 0 |
25 §5 |
Production: timing, the spine blocksmith selection and the weight | computed | 1 | 0 |
25 §6 |
The required spine signatures and the aggregate signature | computed | 1 | 0 |
25 §6a |
How a registered node decides to give its spine signature, and the signing commitment | computed | 1 | 1 |
25 §6b |
Non-signing statements and the non-signing round | computed | 1 | 1 |
25 §6c |
A late spine block | computed | 1 | 1 |
25 §7 |
Validation and application of a received spine block | computed | 1 | 1 |
25 §8 |
Sync and fork choice on the spine | computed | 1 | 0 |
25 §9 |
Chain identity, the finalized height, the pin and the hierarchy | computed | 1 | 0 |
26 §1 |
When a snapshot is taken | computed | 1 | 0 |
26 §2 |
The snapshot document | computed | 1 | 1 |
26 §3 |
Chunks, names and the directory | computed | 1 | 0 |
26 §4 |
Serving chunks | computed | 1 | 0 |
26 §5 |
When a node fast-syncs, and the manifest walk | computed | 1 | 0 |
26 §6 |
Download and verification | computed | 1 | 0 |
26 §7 |
Attesting and applying the snapshot | computed | 1 | 1 |
26 §8 |
Catch-up | computed | 1 | 0 |
26 §9 |
Retention and the prune horizon | computed | 1 | 0 |
26 §10a |
The snapshot attestation | computed | 1 | 0 |
26 §10b |
The archive | computed | 1 | 0 |
27 §1 |
Transport, framing and limits | computed | 1 | 0 |
27 §1a |
The signed call | computed | 1 | 1 |
27 §2 |
Messages | computed | 2 | 0 |
27 §3 |
Handshake | computed | 1 | 1 |
27 §4 |
Heartbeat | computed | 1 | 1 |
27 §5 |
Peer discovery | computed | 6 | 0 |
27 §6 |
Node address announcements | computed | 1 | 0 |
27 §7 |
Proof of origin | computed | 1 | 0 |
27 §8 |
Receipt requests | computed | 3 | 1 |
27 §9 |
Block delivery | computed | 4 | 0 |
27 §10 |
Transaction delivery | computed | 4 | 0 |
27 §11 |
Chain sync queries and the block-read budget | computed | 4 | 0 |
27 §12 |
Spine signature and non-signing statement RPCs | computed | 1 | 1 |
27 §13 |
Snapshot chunk download | computed | 2 | 0 |
27 §14 |
Block candidates and storage pieces | computed | 1 | 1 |
27 §15 |
GetStateSample | computed | 3 | 0 |
27 §16 |
Load levels | computed | 4 | 2 |
28 §1 |
The peer record and the peer table | computed | 5 | 1 |
28 §2 |
Bootstrap: the advertised address, seeds and the start-up gate | computed | 3 | 0 |
28 §3 |
Outbound connection and the pending list | computed | 1 | 0 |
28 §4 |
Heartbeat loop and stale cleanup | computed | 1 | 0 |
28 §5 |
Failure accounting, backoff, disconnection and recovery | computed | 1 | 0 |
28 §6 |
Charging, rate limits and the blacklist | computed | 3 | 0 |
28 §7 |
Known-data tracking | computed | 1 | 0 |
28 §8 |
Propagation: what goes to whom, and when | computed | 1 | 0 |
28 §9 |
Sync drivers and the health check | computed | 2 | 0 |
28 §9a |
Block-production gate | computed | 4 | 0 |
28 §9b |
Clock-skew production veto | computed | 6 | 0 |
28 §10 |
Address announcement loop | computed | 1 | 0 |
28 §11 |
Peer discovery loop | computed | 1 | 0 |
28 §12 |
Node health monitor | computed | 2 | 0 |
28 §13 |
Storage transport | computed | 1 | 0 |
29 §1 |
The activation clock | computed | 6 | 0 |
29 §2 |
Where a height comes from | computed | 2 | 1 |
29 §3 |
Transaction-type gates | computed | 3 | 0 |
29 §4 |
The rule table | computed | 1 | 0 |
29 §4a |
Intervals, retirement and warm-up | computed | 1 | 2 |
29 §4b |
Rule bundles and the readiness gate | computed | 2 | 1 |
29 §4c |
The rule-activation record | computed | 1 | 0 |
29 §5 |
What a boundary means for an implementation | computed | 1 | 0 |
29 §6 |
The rules API | computed | 1 | 0 |
30 §1 |
Command line, process and signals | computed | 1 | 0 |
30 §2 |
The configuration file | computed | 6 | 0 |
30 §3 |
Key material and identity | computed | 2 | 1 |
30 §4 |
Start-up sequence | computed | 1 | 1 |
30 §4a |
The clock | computed | 1 | 0 |
30 §4b |
The spine pin | computed | 6 | 0 |
30 §4c |
The node's signed P2P calls, from the operator's view | computed | 4 | 0 |
30 §5 |
The daemon loop | computed | 1 | 0 |
30 §6 |
What persists across restarts | computed | 1 | 0 |
30 §7 |
Timers | computed | 1 | 0 |
30 §8 |
Roles and supervisors | computed | 1 | 0 |
30 §8a |
The gateway identity file | computed | 1 | 1 |
30 §9 |
Self-update and the wedge rebuild | computed | 1 | 0 |
30 §9a |
Relaunching a chain | computed | 1 | 1 |
31 §1 |
Transport, admission and errors | computed | 5 | 0 |
31 §2 |
Signed requests and scopes | computed | 1 | 1 |
31 §3 |
Conventions shared by the read routes | computed | 1 | 1 |
31 §4 |
Chain and block routes | computed | 6 | 0 |
31 §5 |
Transaction routes | computed | 4 | 0 |
31 §6 |
Account routes | computed | 4 | 3 |
31 §7 |
Markets, apps, tokens, bridge, releases, registries, governance, longevity, storage | computed | 6 | 1 |
31 §8 |
Node, admin, internal and announce routes | computed | 1 | 1 |
31 §9 |
The gateway form | computed | 3 | 0 |
32 §1 |
Where a value comes from: the parameter table, defaults, changes | computed | 3 | 1 |
32 §2 |
Units, sizes and fixed identities | computed | 3 | 1 |
32 §3 |
Participation-score constants | computed | 2 | 0 |
32 §4 |
Block timing and size | computed | 1 | 1 |
32 §5 |
Transaction limits and fee constants | computed | 1 | 0 |
32 §6 |
Node registry, admission, liveness and the queue | computed | 2 | 0 |
32 §7 |
Coinbase and maturity | computed | 1 | 0 |
32 §8 |
Receipts and topology | computed | 1 | 1 |
32 §9 |
Snapshots, pruning and the confirmed tail | computed | 1 | 0 |
32 §10 |
Feature constants | computed | 1 | 0 |
32 §11 |
Ledger event types | computed | 1 | 0 |
32 §12 |
The consensus-parameter table | computed | 1 | 0 |
32 §13 |
Governable parameters and their bounds | computed | 3 | 1 |
32 §14 |
Chain types | computed | 1 | 0 |
32 §15 |
The TestNet genesis inputs | computed | 1 | 1 |
32 §16 |
Survival-mode and network-protocol constants | computed | 4 | 0 |
32 §17 |
Local constants | none | 0 | 0 |
33 §1 |
The chain identity and the public sources | computed | 3 | 1 |
33 §2 |
Hashes and generators | computed | 1 | 1 |
33 §3 |
Keys, addresses and signatures | computed | 2 | 2 |
33 §5 |
Conformance checklist, level L1 (Follower) | computed | 1 | 0 |
33 §6 |
Conformance checklist, level L2 (Blocksmith) | computed | 1 | 0 |
33 §7 |
Conformance checklist, level L3 (Server) | computed | 1 | 0 |
33 §8 |
Conformance checklist, level L4 (Keeper) | computed | 1 | 0 |
34 §1 |
Bridge coins | computed | 1 | 0 |
34 §1a |
Custody accounts and open withdrawals | computed | 2 | 1 |
34 §2 |
Attesters and the quorum | computed | 1 | 0 |
34 §3 |
A bridge attestation | computed | 1 | 1 |
34 §4 |
Deposit resolution and the mint | computed | 3 | 3 |
34 §5 |
The withdrawal trigger: its checks and the request row | computed | 1 | 1 |
34 §5a |
A custody account receives nothing else | computed | 4 | 1 |
34 §6 |
Withdrawal resolution and the burn | computed | 2 | 1 |
34 §7 |
The idle window and the one-shot guards | computed | 1 | 0 |
34 §8 |
The API views (local) | computed | 5 | 1 |
34 §9 |
The keeper and its supervisor (local) | computed | 1 | 1 |
34 §10 |
Foreign-signed carriers: the chain bindings and the once-only rule | computed | 7 | 2 |
35 §1 |
The blocksmith's one block per parent | computed | 1 | 0 |
35 §2 |
The EquivocationReport transaction (type 60) | computed | 1 | 1 |
35 §3 |
Validity of an EquivocationReport | computed | 1 | 4 |
35 §4 |
The charge (one miss, once per blocksmith and height) | computed | 1 | 0 |
35 §5 |
The resume exemption (equivocation_resume_exempt) | computed | 4 | 0 |
35 §6 |
The peer-side verdict and ban | computed | 1 | 0 |
35 §7 |
The SpineEquivocationReport (type 62) | computed | 1 | 4 |
36 §1 |
The liveness row and the unit clock | computed | 1 | 0 |
36 §2 |
The score road: loss, climb, effective score | computed | 2 | 0 |
36 §3 |
One block's transitions | computed | 1 | 0 |
36 §4 |
Suspension and its exits | computed | 1 | 0 |
36 §5 |
Expulsion at score zero, and the floor | computed | 1 | 0 |
36 §6 |
Signs of life: receipts and pings | computed | 1 | 2 |
36 §7 |
Income: missing, maturity, the payout view | computed | 1 | 0 |
36 §8 |
The pre-genesis roll call (type 61) | computed | 1 | 0 |
36 §9 |
The leaving registered node (the exit hold) | computed | 1 | 0 |
36 §10 |
The previous blocksmith, demoted to round 10 | computed | 1 | 0 |
36 §11 |
The fork weigher's replay parity | none | 0 | 0 |
36 §12 |
Survival mode | computed | 2 | 0 |
How to compute it. Read each listed section's "Vector" heading; run every INPUT and compare with the EXPECTED OUTPUT byte for byte; run every invalid input and compare the refusal text exactly.
Rule activation. Each test applies at the heights its chapter states; on both chains every rule is active from height 0.
Rejections and errors. None of its own.
Vector. This index: INPUT the chapters 01–36 of this edition → EXPECTED OUTPUT the 401 rows above, 1,007 tests. A section renumbered or a test added changes its row and the totals.
Test cases · §4
1 case · 1 valid · 1 reference
The index lists one row per mechanism of chapters 01-32 and 34-36, with its valid and invalid tests
Sources: computed (from the specification or the shipped genesis files), none (no bytes produced).
A stated value: there is nothing to compute. A compatible node shows the same value.
- rows
398- valid
804- invalid
186- tests
990
Defects to match. None.
§5 Conformance checklist, level L1 (Follower)
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.
Test cases · §5
1 case · 1 valid · 1 reference
Level L1 (Follower) checks
A stated value: there is nothing to compute. A compatible node shows the same value.
- checks
L1-01 L1-02 L1-03 L1-04 L1-05 L1-06 L1-07 L1-08 L1-09 L1-10 L1-11 L1-12 L1-13 L1-14 L1-15 L1-16 L1-17
Defects to match. Every "Defects to match" of the owning chapters must be reproduced for L1-08 to pass.
§6 Conformance checklist, level L2 (Blocksmith)
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.
Test cases · §6
1 case · 1 valid · 1 reference
Level L2 (Blocksmith) checks
A stated value: there is nothing to compute. A compatible node shows the same value.
- checks
L2-01 L2-02 L2-03 L2-04 L2-05 L2-06 L2-07 L2-08 L2-09 L2-10
§7 Conformance checklist, level L3 (Server)
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.
Test cases · §7
1 case · 1 valid · 1 reference
Level L3 (Server) checks
A stated value: there is nothing to compute. A compatible node shows the same value.
- checks
L3-01 L3-02 L3-03 L3-04 L3-05 L3-06 L3-07 L3-08
Defects to match. 31 §10.
§8 Conformance checklist, level L4 (Keeper)
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.
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.
Vector. §4 (chapters 11, 25, 26).
Test cases · §8
1 case · 1 valid · 1 reference
Level L4 (Keeper) checks
A stated value: there is nothing to compute. A compatible node shows the same value.
- checks
L4-01 L4-02 L4-03 L4-04 L4-05 L4-06 L4-07
§9 Consensus and local; summary of defects
Consensus: the identity of §1, the primitives of §2–§3 and every test of §4 that its chapter marks as consensus. Local: the API tests of L3 (a compatibility promise to the clients, not to the chain). This chapter has no defects of its own; every defect a test exercises is listed in its owning chapter.
A question about this chapter, or a statement that does not match the network? Discuss on zoobc.pro.