IETF Key Transparency interop evidence

kt is a Rust implementation of draft-ietf-keytrans-protocol-05, built to produce and consume the same bytes as the Go implementations. This page is generated by the same code that runs in CI: every row below is a comparison against a value produced by katie, and it is regenerated on every push to main.

What “verified” means here. A committed test vector records what the Go peer computed, at a named commit, and this implementation recomputes it from the draft and compares byte for byte. It does not mean the two implementations have talked to each other over a wire — that is the next tier of work, and the coverage table says so plainly. Areas with no vector are listed there as unverified rather than omitted.

all checks agree 6577 checks across 768 cases in 16 vector files
PrimitiveCasesChecksResult
Commitment 7 25 agrees
Implicit binary search tree 38 1456 agrees
Binary ladders 76 76 agrees
Search ladder interpretation 211 422 agrees
Updating a view 190 380 agrees
Distinguished log entries 42 84 agrees
VRF 11 52 agrees
Log tree structure 24 1679 agrees
Log tree 19 1928 agrees
Log tree, grown one leaf at a time 64 192 agrees
Prefix tree 11 55 agrees
Prefix tree mutation 8 32 agrees
Third-party auditor 14 34 agrees
Tree head signatures 9 96 agrees
Requests and building blocks 22 44 agrees
Must reject 22 22 agrees

Provenance

Everything needed to reproduce this page or to blame a failure: which commit of this implementation was tested, and which commit of the peer produced the expected values. A vector without its generator's commit cannot be regenerated, which makes it worthless the day it fails.

Generated2026-07-28T21:28:23Z
kt commit5a21e99dbc69
CI runhttps://github.com/OR13/kt/actions/runs/30400746160
Rust toolchainrustc 1.97.1 (8bab26f4f 2026-07-14)
Go toolchaingo version go1.26.5 linux/amd64
Commitment oraclekatie @ 00da52541f6a
Implicit binary search tree oraclekatie @ 00da52541f6a
Binary ladders oraclekatie @ 00da52541f6a
Search ladder interpretation oraclekatie @ 00da52541f6a
Updating a view oraclekatie @ 00da52541f6a
Distinguished log entries oraclekatie @ 00da52541f6a
VRF oraclekatie @ 00da52541f6a
Log tree structure oraclekatie @ 00da52541f6a
Log tree oraclekatie @ 00da52541f6a
Log tree, grown one leaf at a time oraclekatie @ 00da52541f6a
Prefix tree oraclekatie @ 00da52541f6a
Prefix tree mutation oraclekatie @ 00da52541f6a
Third-party auditor oraclekatie @ 00da52541f6a
Tree head signatures oraclekatie @ 00da52541f6a
Requests and building blocks oraclekatie @ 00da52541f6a
Must reject oraclekatie @ 00da52541f6a

Reproduce it

git clone --recurse-submodules https://github.com/OR13/kt.git
cd kt

# regenerate the vectors from the pinned Go peer — this must produce no diff
cd interop/go && go run ./cmd/gen -out ../vectors && cd ../..
git diff --exit-code -- interop/vectors

# check them from the Rust side, and rebuild this page
cargo test --workspace
cargo run -p kt-interop --bin kt-interop-report -- --vectors interop/vectors --out site

Commitment §11.6

Vectors: commitment.json · oracle: katie @ 00da52541f6a · cipher suite 0x0002 KT_128_SHA256_Ed25519 · 7 cases, 25 checks agrees

1 of these cases assert a refusal: the peer says the input must be rejected, and accepting it would be the failure.

CaseInputChecksResult
empty-label-empty-value label 0 bytes, version 0, value 0 bytes
4 checks
agrees CommitmentValue encoding (§2.1, §11.5, §11.6)
peer000102030405060708090a0b0c0d0e0f000000000000000000
kt000102030405060708090a0b0c0d0e0f000000000000000000
agrees decode(encode(CommitmentValue)) is the identity
peerround-trips
ktround-trips
agrees commitment = HMAC(Kc, CommitmentValue) (§11.6)
peer1ca642a2380c1d7b8b9904be90f31b4f356390a133ae079d77a4b351bc20971e
kt1ca642a2380c1d7b8b9904be90f31b4f356390a133ae079d77a4b351bc20971e
agrees verify() accepts the peer's commitment (§11.6)
peeraccepted
ktaccepted
 agrees
simple label 17 bytes, version 0, value 14 bytes
4 checks
agrees CommitmentValue encoding (§2.1, §11.5, §11.6)
peer101112131415161718191a1b1c1d1e1f11616c696365406578616d706c652e636f6d000000000000000e6b65792d6d6174657269616c2d31
kt101112131415161718191a1b1c1d1e1f11616c696365406578616d706c652e636f6d000000000000000e6b65792d6d6174657269616c2d31
agrees decode(encode(CommitmentValue)) is the identity
peerround-trips
ktround-trips
agrees commitment = HMAC(Kc, CommitmentValue) (§11.6)
peerd59be42d9c42be3f4f3c24870b2dcb1dafa6022f2ac64eee904e4e577257f125
ktd59be42d9c42be3f4f3c24870b2dcb1dafa6022f2ac64eee904e4e577257f125
agrees verify() accepts the peer's commitment (§11.6)
peeraccepted
ktaccepted
 agrees
version-one label 17 bytes, version 1, value 14 bytes
4 checks
agrees CommitmentValue encoding (§2.1, §11.5, §11.6)
peer101112131415161718191a1b1c1d1e1f11616c696365406578616d706c652e636f6d000000010000000e6b65792d6d6174657269616c2d32
kt101112131415161718191a1b1c1d1e1f11616c696365406578616d706c652e636f6d000000010000000e6b65792d6d6174657269616c2d32
agrees decode(encode(CommitmentValue)) is the identity
peerround-trips
ktround-trips
agrees commitment = HMAC(Kc, CommitmentValue) (§11.6)
peer480bd9422e842df3ca3ff274488f393d4105a89da508df92b5a665a8d618f878
kt480bd9422e842df3ca3ff274488f393d4105a89da508df92b5a665a8d618f878
agrees verify() accepts the peer's commitment (§11.6)
peeraccepted
ktaccepted
 agrees
version-max label 15 bytes, version 4294967295, value 1 bytes
4 checks
agrees CommitmentValue encoding (§2.1, §11.5, §11.6)
peer202122232425262728292a2b2c2d2e2f0f626f62406578616d706c652e636f6dffffffff000000016b
kt202122232425262728292a2b2c2d2e2f0f626f62406578616d706c652e636f6dffffffff000000016b
agrees decode(encode(CommitmentValue)) is the identity
peerround-trips
ktround-trips
agrees commitment = HMAC(Kc, CommitmentValue) (§11.6)
peerbe1782f33de56f269ee994fc11171f309ae1d934b93297c496458225a38cd7bd
ktbe1782f33de56f269ee994fc11171f309ae1d934b93297c496458225a38cd7bd
agrees verify() accepts the peer's commitment (§11.6)
peeraccepted
ktaccepted
 agrees
label-max-len label 255 bytes, version 7, value 1 bytes
4 checks
agrees CommitmentValue encoding (§2.1, §11.5, §11.6)
peer303132333435363738393a3b3c3d3e3fff616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161000000070000000176
kt303132333435363738393a3b3c3d3e3fff616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161000000070000000176
agrees decode(encode(CommitmentValue)) is the identity
peerround-trips
ktround-trips
agrees commitment = HMAC(Kc, CommitmentValue) (§11.6)
peera48889712624b1746c18d783407878b1d8637b4803748b99c6d5e2ddd9c2cc55
kta48889712624b1746c18d783407878b1d8637b4803748b99c6d5e2ddd9c2cc55
agrees verify() accepts the peer's commitment (§11.6)
peeraccepted
ktaccepted
 agrees
value-with-nulls label 5 bytes, version 3, value 4 bytes
4 checks
agrees CommitmentValue encoding (§2.1, §11.5, §11.6)
peer404142434445464748494a4b4c4d4e4f056361726f6c0000000300000004000100ff
kt404142434445464748494a4b4c4d4e4f056361726f6c0000000300000004000100ff
agrees decode(encode(CommitmentValue)) is the identity
peerround-trips
ktround-trips
agrees commitment = HMAC(Kc, CommitmentValue) (§11.6)
peer69ff8afbb9edd644af83a239bdb71a98557ce4b8651fb764e638ddb415078d39
kt69ff8afbb9edd644af83a239bdb71a98557ce4b8651fb764e638ddb415078d39
agrees verify() accepts the peer's commitment (§11.6)
peeraccepted
ktaccepted
 agrees
wrong-opening-does-not-verify must refuse label 17 bytes, version 0, value 14 bytes
1 checks
agrees verify() rejects this opening (§11.6)
peerrejected
ktrejected
 agrees

Implicit binary search tree §4.1, Appendix A

Vectors: ibst.json · oracle: katie @ 00da52541f6a · 38 cases, 1456 checks agrees

CaseInputChecksResult
size-1 log of 1 entries
3 checks
agrees root(size) (§4.1)
peer0
kt0
agrees frontier(size) (§4.1)
peer[0]
kt[0]
agrees children of each node (§4.1, App. A)
peer2 sub-checks match
kt2 sub-checks match

2 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-2 log of 2 entries
3 checks
agrees root(size) (§4.1)
peer1
kt1
agrees frontier(size) (§4.1)
peer[1]
kt[1]
agrees children of each node (§4.1, App. A)
peer4 sub-checks match
kt4 sub-checks match

4 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-3 log of 3 entries
3 checks
agrees root(size) (§4.1)
peer1
kt1
agrees frontier(size) (§4.1)
peer[1, 2]
kt[1, 2]
agrees children of each node (§4.1, App. A)
peer6 sub-checks match
kt6 sub-checks match

6 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-4 log of 4 entries
3 checks
agrees root(size) (§4.1)
peer3
kt3
agrees frontier(size) (§4.1)
peer[3]
kt[3]
agrees children of each node (§4.1, App. A)
peer8 sub-checks match
kt8 sub-checks match

8 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-5 log of 5 entries
3 checks
agrees root(size) (§4.1)
peer3
kt3
agrees frontier(size) (§4.1)
peer[3, 4]
kt[3, 4]
agrees children of each node (§4.1, App. A)
peer10 sub-checks match
kt10 sub-checks match

10 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-6 log of 6 entries
3 checks
agrees root(size) (§4.1)
peer3
kt3
agrees frontier(size) (§4.1)
peer[3, 5]
kt[3, 5]
agrees children of each node (§4.1, App. A)
peer12 sub-checks match
kt12 sub-checks match

12 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-7 log of 7 entries
3 checks
agrees root(size) (§4.1)
peer3
kt3
agrees frontier(size) (§4.1)
peer[3, 5, 6]
kt[3, 5, 6]
agrees children of each node (§4.1, App. A)
peer14 sub-checks match
kt14 sub-checks match

14 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-8 log of 8 entries
3 checks
agrees root(size) (§4.1)
peer7
kt7
agrees frontier(size) (§4.1)
peer[7]
kt[7]
agrees children of each node (§4.1, App. A)
peer16 sub-checks match
kt16 sub-checks match

16 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-9 log of 9 entries
3 checks
agrees root(size) (§4.1)
peer7
kt7
agrees frontier(size) (§4.1)
peer[7, 8]
kt[7, 8]
agrees children of each node (§4.1, App. A)
peer18 sub-checks match
kt18 sub-checks match

18 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-13 log of 13 entries
3 checks
agrees root(size) (§4.1)
peer7
kt7
agrees frontier(size) (§4.1)
peer[7, 11, 12]
kt[7, 11, 12]
agrees children of each node (§4.1, App. A)
peer26 sub-checks match
kt26 sub-checks match

26 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-14 log of 14 entries
3 checks
agrees root(size) (§4.1)
peer7
kt7
agrees frontier(size) (§4.1)
peer[7, 11, 13]
kt[7, 11, 13]
agrees children of each node (§4.1, App. A)
peer28 sub-checks match
kt28 sub-checks match

28 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-15 log of 15 entries
3 checks
agrees root(size) (§4.1)
peer7
kt7
agrees frontier(size) (§4.1)
peer[7, 11, 13, 14]
kt[7, 11, 13, 14]
agrees children of each node (§4.1, App. A)
peer30 sub-checks match
kt30 sub-checks match

30 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-16 log of 16 entries
3 checks
agrees root(size) (§4.1)
peer15
kt15
agrees frontier(size) (§4.1)
peer[15]
kt[15]
agrees children of each node (§4.1, App. A)
peer32 sub-checks match
kt32 sub-checks match

32 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-17 log of 17 entries
3 checks
agrees root(size) (§4.1)
peer15
kt15
agrees frontier(size) (§4.1)
peer[15, 16]
kt[15, 16]
agrees children of each node (§4.1, App. A)
peer34 sub-checks match
kt34 sub-checks match

34 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-31 log of 31 entries
3 checks
agrees root(size) (§4.1)
peer15
kt15
agrees frontier(size) (§4.1)
peer[15, 23, 27, 29, 30]
kt[15, 23, 27, 29, 30]
agrees children of each node (§4.1, App. A)
peer62 sub-checks match
kt62 sub-checks match

62 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-32 log of 32 entries
3 checks
agrees root(size) (§4.1)
peer31
kt31
agrees frontier(size) (§4.1)
peer[31]
kt[31]
agrees children of each node (§4.1, App. A)
peer64 sub-checks match
kt64 sub-checks match

64 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-33 log of 33 entries
3 checks
agrees root(size) (§4.1)
peer31
kt31
agrees frontier(size) (§4.1)
peer[31, 32]
kt[31, 32]
agrees children of each node (§4.1, App. A)
peer66 sub-checks match
kt66 sub-checks match

66 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-49 log of 49 entries
3 checks
agrees root(size) (§4.1)
peer31
kt31
agrees frontier(size) (§4.1)
peer[31, 47, 48]
kt[31, 47, 48]
agrees children of each node (§4.1, App. A)
peer98 sub-checks match
kt98 sub-checks match

98 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-50 log of 50 entries
3 checks
agrees root(size) (§4.1)
peer31
kt31
agrees frontier(size) (§4.1)
peer[31, 47, 49]
kt[31, 47, 49]
agrees children of each node (§4.1, App. A)
peer100 sub-checks match
kt100 sub-checks match

100 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-51 log of 51 entries
3 checks
agrees root(size) (§4.1)
peer31
kt31
agrees frontier(size) (§4.1)
peer[31, 47, 49, 50]
kt[31, 47, 49, 50]
agrees children of each node (§4.1, App. A)
peer102 sub-checks match
kt102 sub-checks match

102 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-63 log of 63 entries
3 checks
agrees root(size) (§4.1)
peer31
kt31
agrees frontier(size) (§4.1)
peer[31, 47, 55, 59, 61, 62]
kt[31, 47, 55, 59, 61, 62]
agrees children of each node (§4.1, App. A)
peer126 sub-checks match
kt126 sub-checks match

126 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-64 log of 64 entries
3 checks
agrees root(size) (§4.1)
peer63
kt63
agrees frontier(size) (§4.1)
peer[63]
kt[63]
agrees children of each node (§4.1, App. A)
peer128 sub-checks match
kt128 sub-checks match

128 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-65 log of 65 entries
3 checks
agrees root(size) (§4.1)
peer63
kt63
agrees frontier(size) (§4.1)
peer[63, 64]
kt[63, 64]
agrees children of each node (§4.1, App. A)
peer4 sub-checks match
kt4 sub-checks match

4 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-100 log of 100 entries
3 checks
agrees root(size) (§4.1)
peer63
kt63
agrees frontier(size) (§4.1)
peer[63, 95, 99]
kt[63, 95, 99]
agrees children of each node (§4.1, App. A)
peer6 sub-checks match
kt6 sub-checks match

6 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-127 log of 127 entries
3 checks
agrees root(size) (§4.1)
peer63
kt63
agrees frontier(size) (§4.1)
peer[63, 95, 111, 119, 123, 125, 126]
kt[63, 95, 111, 119, 123, 125, 126]
agrees children of each node (§4.1, App. A)
peer14 sub-checks match
kt14 sub-checks match

14 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-128 log of 128 entries
3 checks
agrees root(size) (§4.1)
peer127
kt127
agrees frontier(size) (§4.1)
peer[127]
kt[127]
agrees children of each node (§4.1, App. A)
peer2 sub-checks match
kt2 sub-checks match

2 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-129 log of 129 entries
3 checks
agrees root(size) (§4.1)
peer127
kt127
agrees frontier(size) (§4.1)
peer[127, 128]
kt[127, 128]
agrees children of each node (§4.1, App. A)
peer4 sub-checks match
kt4 sub-checks match

4 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-1000 log of 1000 entries
3 checks
agrees root(size) (§4.1)
peer511
kt511
agrees frontier(size) (§4.1)
peer[511, 767, 895, 959, 991, 999]
kt[511, 767, 895, 959, 991, 999]
agrees children of each node (§4.1, App. A)
peer12 sub-checks match
kt12 sub-checks match

12 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-1023 log of 1023 entries
3 checks
agrees root(size) (§4.1)
peer511
kt511
agrees frontier(size) (§4.1)
peer[511, 767, 895, 959, 991, 1007, 1015, 1019, 1021, 1022]
kt[511, 767, 895, 959, 991, 1007, 1015, 1019, 1021, 1022]
agrees children of each node (§4.1, App. A)
peer20 sub-checks match
kt20 sub-checks match

20 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-1024 log of 1024 entries
3 checks
agrees root(size) (§4.1)
peer1023
kt1023
agrees frontier(size) (§4.1)
peer[1023]
kt[1023]
agrees children of each node (§4.1, App. A)
peer2 sub-checks match
kt2 sub-checks match

2 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-1025 log of 1025 entries
3 checks
agrees root(size) (§4.1)
peer1023
kt1023
agrees frontier(size) (§4.1)
peer[1023, 1024]
kt[1023, 1024]
agrees children of each node (§4.1, App. A)
peer4 sub-checks match
kt4 sub-checks match

4 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-1048576 log of 1048576 entries
3 checks
agrees root(size) (§4.1)
peer1048575
kt1048575
agrees frontier(size) (§4.1)
peer[1048575]
kt[1048575]
agrees children of each node (§4.1, App. A)
peer2 sub-checks match
kt2 sub-checks match

2 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-1099511627776 log of 1099511627776 entries
3 checks
agrees root(size) (§4.1)
peer1099511627775
kt1099511627775
agrees frontier(size) (§4.1)
peer[1099511627775]
kt[1099511627775]
agrees children of each node (§4.1, App. A)
peer2 sub-checks match
kt2 sub-checks match

2 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-4611686018427387904 log of 4611686018427387904 entries
3 checks
agrees root(size) (§4.1)
peer4611686018427387903
kt4611686018427387903
agrees frontier(size) (§4.1)
peer[4611686018427387903]
kt[4611686018427387903]
agrees children of each node (§4.1, App. A)
peer2 sub-checks match
kt2 sub-checks match

2 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-9223372036854775808 log of 9223372036854775808 entries
3 checks
agrees root(size) (§4.1)
peer9223372036854775807
kt9223372036854775807
agrees frontier(size) (§4.1)
peer[9223372036854775807]
kt[9223372036854775807]
agrees children of each node (§4.1, App. A)
peer2 sub-checks match
kt2 sub-checks match

2 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-6148914691236517205 log of 6148914691236517205 entries
3 checks
agrees root(size) (§4.1)
peer4611686018427387903
kt4611686018427387903
agrees frontier(size) (§4.1)
peer[4611686018427387903, 5764607523034234879, 6052837899185946623, 6124895493223874559, 6142909891733356543, 6147413491360727039, 6148539391267569663, 6148820866244280319, 6148891234988457983, 6148908827174502399, 6148913225221013503, 6148914324732641279, 6148914599610548223, 6148914668330024959, 6148914685509894143, 6148914689804861439, 6148914690878603263, 6148914691147038719, 6148914691214147583, 6148914691230924799, 6148914691235119103, 6148914691236167679, 6148914691236429823, 6148914691236495359, 6148914691236511743, 6148914691236515839, 6148914691236516863, 6148914691236517119, 6148914691236517183, 6148914691236517199, 6148914691236517203, 6148914691236517204]
kt[4611686018427387903, 5764607523034234879, 6052837899185946623, 6124895493223874559, 6142909891733356543, 6147413491360727039, 6148539391267569663, 6148820866244280319, 6148891234988457983, 6148908827174502399, 6148913225221013503, 6148914324732641279, 6148914599610548223, 6148914668330024959, 6148914685509894143, 6148914689804861439, 6148914690878603263, 6148914691147038719, 6148914691214147583, 6148914691230924799, 6148914691235119103, 6148914691236167679, 6148914691236429823, 6148914691236495359, 6148914691236511743, 6148914691236515839, 6148914691236516863, 6148914691236517119, 6148914691236517183, 6148914691236517199, 6148914691236517203, 6148914691236517204]
agrees children of each node (§4.1, App. A)
peer64 sub-checks match
kt64 sub-checks match

64 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-18446744073709551614 log of 18446744073709551614 entries
3 checks
agrees root(size) (§4.1)
peer9223372036854775807
kt9223372036854775807
agrees frontier(size) (§4.1)
peer[9223372036854775807, 13835058055282163711, 16140901064495857663, 17293822569102704639, 17870283321406128127, 18158513697557839871, 18302628885633695743, 18374686479671623679, 18410715276690587647, 18428729675200069631, 18437736874454810623, 18442240474082181119, 18444492273895866367, 18445618173802708991, 18446181123756130303, 18446462598732840959, 18446603336221196287, 18446673704965373951, 18446708889337462783, 18446726481523507199, 18446735277616529407, 18446739675663040511, 18446741874686296063, 18446742974197923839, 18446743523953737727, 18446743798831644671, 18446743936270598143, 18446744004990074879, 18446744039349813247, 18446744056529682431, 18446744065119617023, 18446744069414584319, 18446744071562067967, 18446744072635809791, 18446744073172680703, 18446744073441116159, 18446744073575333887, 18446744073642442751, 18446744073675997183, 18446744073692774399, 18446744073701163007, 18446744073705357311, 18446744073707454463, 18446744073708503039, 18446744073709027327, 18446744073709289471, 18446744073709420543, 18446744073709486079, 18446744073709518847, 18446744073709535231, 18446744073709543423, 18446744073709547519, 18446744073709549567, 18446744073709550591, 18446744073709551103, 18446744073709551359, 18446744073709551487, 18446744073709551551, 18446744073709551583, 18446744073709551599, 18446744073709551607, 18446744073709551611, 18446744073709551613]
kt[9223372036854775807, 13835058055282163711, 16140901064495857663, 17293822569102704639, 17870283321406128127, 18158513697557839871, 18302628885633695743, 18374686479671623679, 18410715276690587647, 18428729675200069631, 18437736874454810623, 18442240474082181119, 18444492273895866367, 18445618173802708991, 18446181123756130303, 18446462598732840959, 18446603336221196287, 18446673704965373951, 18446708889337462783, 18446726481523507199, 18446735277616529407, 18446739675663040511, 18446741874686296063, 18446742974197923839, 18446743523953737727, 18446743798831644671, 18446743936270598143, 18446744004990074879, 18446744039349813247, 18446744056529682431, 18446744065119617023, 18446744069414584319, 18446744071562067967, 18446744072635809791, 18446744073172680703, 18446744073441116159, 18446744073575333887, 18446744073642442751, 18446744073675997183, 18446744073692774399, 18446744073701163007, 18446744073705357311, 18446744073707454463, 18446744073708503039, 18446744073709027327, 18446744073709289471, 18446744073709420543, 18446744073709486079, 18446744073709518847, 18446744073709535231, 18446744073709543423, 18446744073709547519, 18446744073709549567, 18446744073709550591, 18446744073709551103, 18446744073709551359, 18446744073709551487, 18446744073709551551, 18446744073709551583, 18446744073709551599, 18446744073709551607, 18446744073709551611, 18446744073709551613]
agrees children of each node (§4.1, App. A)
peer126 sub-checks match
kt126 sub-checks match

126 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-18446744073709551615 log of 18446744073709551615 entries
3 checks
agrees root(size) (§4.1)
peer9223372036854775807
kt9223372036854775807
agrees frontier(size) (§4.1)
peer[9223372036854775807, 13835058055282163711, 16140901064495857663, 17293822569102704639, 17870283321406128127, 18158513697557839871, 18302628885633695743, 18374686479671623679, 18410715276690587647, 18428729675200069631, 18437736874454810623, 18442240474082181119, 18444492273895866367, 18445618173802708991, 18446181123756130303, 18446462598732840959, 18446603336221196287, 18446673704965373951, 18446708889337462783, 18446726481523507199, 18446735277616529407, 18446739675663040511, 18446741874686296063, 18446742974197923839, 18446743523953737727, 18446743798831644671, 18446743936270598143, 18446744004990074879, 18446744039349813247, 18446744056529682431, 18446744065119617023, 18446744069414584319, 18446744071562067967, 18446744072635809791, 18446744073172680703, 18446744073441116159, 18446744073575333887, 18446744073642442751, 18446744073675997183, 18446744073692774399, 18446744073701163007, 18446744073705357311, 18446744073707454463, 18446744073708503039, 18446744073709027327, 18446744073709289471, 18446744073709420543, 18446744073709486079, 18446744073709518847, 18446744073709535231, 18446744073709543423, 18446744073709547519, 18446744073709549567, 18446744073709550591, 18446744073709551103, 18446744073709551359, 18446744073709551487, 18446744073709551551, 18446744073709551583, 18446744073709551599, 18446744073709551607, 18446744073709551611, 18446744073709551613, 18446744073709551614]
kt[9223372036854775807, 13835058055282163711, 16140901064495857663, 17293822569102704639, 17870283321406128127, 18158513697557839871, 18302628885633695743, 18374686479671623679, 18410715276690587647, 18428729675200069631, 18437736874454810623, 18442240474082181119, 18444492273895866367, 18445618173802708991, 18446181123756130303, 18446462598732840959, 18446603336221196287, 18446673704965373951, 18446708889337462783, 18446726481523507199, 18446735277616529407, 18446739675663040511, 18446741874686296063, 18446742974197923839, 18446743523953737727, 18446743798831644671, 18446743936270598143, 18446744004990074879, 18446744039349813247, 18446744056529682431, 18446744065119617023, 18446744069414584319, 18446744071562067967, 18446744072635809791, 18446744073172680703, 18446744073441116159, 18446744073575333887, 18446744073642442751, 18446744073675997183, 18446744073692774399, 18446744073701163007, 18446744073705357311, 18446744073707454463, 18446744073708503039, 18446744073709027327, 18446744073709289471, 18446744073709420543, 18446744073709486079, 18446744073709518847, 18446744073709535231, 18446744073709543423, 18446744073709547519, 18446744073709549567, 18446744073709550591, 18446744073709551103, 18446744073709551359, 18446744073709551487, 18446744073709551551, 18446744073709551583, 18446744073709551599, 18446744073709551607, 18446744073709551611, 18446744073709551613, 18446744073709551614]
agrees children of each node (§4.1, App. A)
peer128 sub-checks match
kt128 sub-checks match

128 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees

Binary ladders §5, Appendix B

Vectors: binary-ladder.json · oracle: katie @ 00da52541f6a · 76 cases, 76 checks agrees

CaseInputChecksResult
base-greatest-0 greatest version 0
1 checks
agrees base_binary_ladder(greatest) (§5, App. B)
peer[0, 1]
kt[0, 1]
 agrees
base-greatest-1 greatest version 1
1 checks
agrees base_binary_ladder(greatest) (§5, App. B)
peer[0, 1, 3, 2]
kt[0, 1, 3, 2]
 agrees
base-greatest-2 greatest version 2
1 checks
agrees base_binary_ladder(greatest) (§5, App. B)
peer[0, 1, 3, 2]
kt[0, 1, 3, 2]
 agrees
base-greatest-3 greatest version 3
1 checks
agrees base_binary_ladder(greatest) (§5, App. B)
peer[0, 1, 3, 7, 5, 4]
kt[0, 1, 3, 7, 5, 4]
 agrees
base-greatest-4 greatest version 4
1 checks
agrees base_binary_ladder(greatest) (§5, App. B)
peer[0, 1, 3, 7, 5, 4]
kt[0, 1, 3, 7, 5, 4]
 agrees
base-greatest-5 greatest version 5
1 checks
agrees base_binary_ladder(greatest) (§5, App. B)
peer[0, 1, 3, 7, 5, 6]
kt[0, 1, 3, 7, 5, 6]
 agrees
base-greatest-6 greatest version 6
1 checks
agrees base_binary_ladder(greatest) (§5, App. B)
peer[0, 1, 3, 7, 5, 6]
kt[0, 1, 3, 7, 5, 6]
 agrees
base-greatest-7 greatest version 7
1 checks
agrees base_binary_ladder(greatest) (§5, App. B)
peer[0, 1, 3, 7, 15, 11, 9, 8]
kt[0, 1, 3, 7, 15, 11, 9, 8]
 agrees
base-greatest-8 greatest version 8
1 checks
agrees base_binary_ladder(greatest) (§5, App. B)
peer[0, 1, 3, 7, 15, 11, 9, 8]
kt[0, 1, 3, 7, 15, 11, 9, 8]
 agrees
base-greatest-9 greatest version 9
1 checks
agrees base_binary_ladder(greatest) (§5, App. B)
peer[0, 1, 3, 7, 15, 11, 9, 10]
kt[0, 1, 3, 7, 15, 11, 9, 10]
 agrees
base-greatest-10 greatest version 10
1 checks
agrees base_binary_ladder(greatest) (§5, App. B)
peer[0, 1, 3, 7, 15, 11, 9, 10]
kt[0, 1, 3, 7, 15, 11, 9, 10]
 agrees
base-greatest-15 greatest version 15
1 checks
agrees base_binary_ladder(greatest) (§5, App. B)
peer[0, 1, 3, 7, 15, 31, 23, 19, 17, 16]
kt[0, 1, 3, 7, 15, 31, 23, 19, 17, 16]
 agrees
base-greatest-16 greatest version 16
1 checks
agrees base_binary_ladder(greatest) (§5, App. B)
peer[0, 1, 3, 7, 15, 31, 23, 19, 17, 16]
kt[0, 1, 3, 7, 15, 31, 23, 19, 17, 16]
 agrees
base-greatest-17 greatest version 17
1 checks
agrees base_binary_ladder(greatest) (§5, App. B)
peer[0, 1, 3, 7, 15, 31, 23, 19, 17, 18]
kt[0, 1, 3, 7, 15, 31, 23, 19, 17, 18]
 agrees
base-greatest-31 greatest version 31
1 checks
agrees base_binary_ladder(greatest) (§5, App. B)
peer[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 33, 32]
kt[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 33, 32]
 agrees
base-greatest-32 greatest version 32
1 checks
agrees base_binary_ladder(greatest) (§5, App. B)
peer[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 33, 32]
kt[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 33, 32]
 agrees
base-greatest-33 greatest version 33
1 checks
agrees base_binary_ladder(greatest) (§5, App. B)
peer[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 33, 34]
kt[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 33, 34]
 agrees
base-greatest-63 greatest version 63
1 checks
agrees base_binary_ladder(greatest) (§5, App. B)
peer[0, 1, 3, 7, 15, 31, 63, 127, 95, 79, 71, 67, 65, 64]
kt[0, 1, 3, 7, 15, 31, 63, 127, 95, 79, 71, 67, 65, 64]
 agrees
base-greatest-64 greatest version 64
1 checks
agrees base_binary_ladder(greatest) (§5, App. B)
peer[0, 1, 3, 7, 15, 31, 63, 127, 95, 79, 71, 67, 65, 64]
kt[0, 1, 3, 7, 15, 31, 63, 127, 95, 79, 71, 67, 65, 64]
 agrees
base-greatest-65 greatest version 65
1 checks
agrees base_binary_ladder(greatest) (§5, App. B)
peer[0, 1, 3, 7, 15, 31, 63, 127, 95, 79, 71, 67, 65, 66]
kt[0, 1, 3, 7, 15, 31, 63, 127, 95, 79, 71, 67, 65, 66]
 agrees
base-greatest-100 greatest version 100
1 checks
agrees base_binary_ladder(greatest) (§5, App. B)
peer[0, 1, 3, 7, 15, 31, 63, 127, 95, 111, 103, 99, 101, 100]
kt[0, 1, 3, 7, 15, 31, 63, 127, 95, 111, 103, 99, 101, 100]
 agrees
base-greatest-255 greatest version 255
1 checks
agrees base_binary_ladder(greatest) (§5, App. B)
peer[0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 383, 319, 287, 271, 263, 259, 257, 256]
kt[0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 383, 319, 287, 271, 263, 259, 257, 256]
 agrees
base-greatest-256 greatest version 256
1 checks
agrees base_binary_ladder(greatest) (§5, App. B)
peer[0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 383, 319, 287, 271, 263, 259, 257, 256]
kt[0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 383, 319, 287, 271, 263, 259, 257, 256]
 agrees
base-greatest-257 greatest version 257
1 checks
agrees base_binary_ladder(greatest) (§5, App. B)
peer[0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 383, 319, 287, 271, 263, 259, 257, 258]
kt[0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 383, 319, 287, 271, 263, 259, 257, 258]
 agrees
base-greatest-1000 greatest version 1000
1 checks
agrees base_binary_ladder(greatest) (§5, App. B)
peer[0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 767, 895, 959, 991, 1007, 999, 1003, 1001, 1000]
kt[0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 767, 895, 959, 991, 1007, 999, 1003, 1001, 1000]
 agrees
base-greatest-65535 greatest version 65535
1 checks
agrees base_binary_ladder(greatest) (§5, App. B)
peer[0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 2047, 4095, 8191, 16383, 32767, 65535, 131071, 98303, 81919, 73727, 69631, 67583, 66559, 66047, 65791, 65663, 65599, 65567, 65551, 65543, 65539, 65537, 65536]
kt[0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 2047, 4095, 8191, 16383, 32767, 65535, 131071, 98303, 81919, 73727, 69631, 67583, 66559, 66047, 65791, 65663, 65599, 65567, 65551, 65543, 65539, 65537, 65536]
 agrees
base-greatest-65536 greatest version 65536
1 checks
agrees base_binary_ladder(greatest) (§5, App. B)
peer[0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 2047, 4095, 8191, 16383, 32767, 65535, 131071, 98303, 81919, 73727, 69631, 67583, 66559, 66047, 65791, 65663, 65599, 65567, 65551, 65543, 65539, 65537, 65536]
kt[0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 2047, 4095, 8191, 16383, 32767, 65535, 131071, 98303, 81919, 73727, 69631, 67583, 66559, 66047, 65791, 65663, 65599, 65567, 65551, 65543, 65539, 65537, 65536]
 agrees
base-greatest-1048576 greatest version 1048576
1 checks
agrees base_binary_ladder(greatest) (§5, App. B)
peer[0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 2047, 4095, 8191, 16383, 32767, 65535, 131071, 262143, 524287, 1048575, 2097151, 1572863, 1310719, 1179647, 1114111, 1081343, 1064959, 1056767, 1052671, 1050623, 1049599, 1049087, 1048831, 1048703, 1048639, 1048607, 1048591, 1048583, 1048579, 1048577, 1048576]
kt[0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 2047, 4095, 8191, 16383, 32767, 65535, 131071, 262143, 524287, 1048575, 2097151, 1572863, 1310719, 1179647, 1114111, 1081343, 1064959, 1056767, 1052671, 1050623, 1049599, 1049087, 1048831, 1048703, 1048639, 1048607, 1048591, 1048583, 1048579, 1048577, 1048576]
 agrees
base-greatest-1073741824 greatest version 1073741824
1 checks
agrees base_binary_ladder(greatest) (§5, App. B)
peer[0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 2047, 4095, 8191, 16383, 32767, 65535, 131071, 262143, 524287, 1048575, 2097151, 4194303, 8388607, 16777215, 33554431, 67108863, 134217727, 268435455, 536870911, 1073741823, 2147483647, 1610612735, 1342177279, 1207959551, 1140850687, 1107296255, 1090519039, 1082130431, 1077936127, 1075838975, 1074790399, 1074266111, 1074003967, 1073872895, 1073807359, 1073774591, 1073758207, 1073750015, 1073745919, 1073743871, 1073742847, 1073742335, 1073742079, 1073741951, 1073741887, 1073741855, 1073741839, 1073741831, 1073741827, 1073741825, 1073741824]
kt[0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 2047, 4095, 8191, 16383, 32767, 65535, 131071, 262143, 524287, 1048575, 2097151, 4194303, 8388607, 16777215, 33554431, 67108863, 134217727, 268435455, 536870911, 1073741823, 2147483647, 1610612735, 1342177279, 1207959551, 1140850687, 1107296255, 1090519039, 1082130431, 1077936127, 1075838975, 1074790399, 1074266111, 1074003967, 1073872895, 1073807359, 1073774591, 1073758207, 1073750015, 1073745919, 1073743871, 1073742847, 1073742335, 1073742079, 1073741951, 1073741887, 1073741855, 1073741839, 1073741831, 1073741827, 1073741825, 1073741824]
 agrees
base-greatest-2147483645 greatest version 2147483645
1 checks
agrees base_binary_ladder(greatest) (§5, App. B)
peer[0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 2047, 4095, 8191, 16383, 32767, 65535, 131071, 262143, 524287, 1048575, 2097151, 4194303, 8388607, 16777215, 33554431, 67108863, 134217727, 268435455, 536870911, 1073741823, 2147483647, 1610612735, 1879048191, 2013265919, 2080374783, 2113929215, 2130706431, 2139095039, 2143289343, 2145386495, 2146435071, 2146959359, 2147221503, 2147352575, 2147418111, 2147450879, 2147467263, 2147475455, 2147479551, 2147481599, 2147482623, 2147483135, 2147483391, 2147483519, 2147483583, 2147483615, 2147483631, 2147483639, 2147483643, 2147483645, 2147483646]
kt[0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 2047, 4095, 8191, 16383, 32767, 65535, 131071, 262143, 524287, 1048575, 2097151, 4194303, 8388607, 16777215, 33554431, 67108863, 134217727, 268435455, 536870911, 1073741823, 2147483647, 1610612735, 1879048191, 2013265919, 2080374783, 2113929215, 2130706431, 2139095039, 2143289343, 2145386495, 2146435071, 2146959359, 2147221503, 2147352575, 2147418111, 2147450879, 2147467263, 2147475455, 2147479551, 2147481599, 2147482623, 2147483135, 2147483391, 2147483519, 2147483583, 2147483615, 2147483631, 2147483639, 2147483643, 2147483645, 2147483646]
 agrees
base-greatest-2147483646 greatest version 2147483646
1 checks
agrees base_binary_ladder(greatest) (§5, App. B)
peer[0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 2047, 4095, 8191, 16383, 32767, 65535, 131071, 262143, 524287, 1048575, 2097151, 4194303, 8388607, 16777215, 33554431, 67108863, 134217727, 268435455, 536870911, 1073741823, 2147483647, 1610612735, 1879048191, 2013265919, 2080374783, 2113929215, 2130706431, 2139095039, 2143289343, 2145386495, 2146435071, 2146959359, 2147221503, 2147352575, 2147418111, 2147450879, 2147467263, 2147475455, 2147479551, 2147481599, 2147482623, 2147483135, 2147483391, 2147483519, 2147483583, 2147483615, 2147483631, 2147483639, 2147483643, 2147483645, 2147483646]
kt[0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 2047, 4095, 8191, 16383, 32767, 65535, 131071, 262143, 524287, 1048575, 2097151, 4194303, 8388607, 16777215, 33554431, 67108863, 134217727, 268435455, 536870911, 1073741823, 2147483647, 1610612735, 1879048191, 2013265919, 2080374783, 2113929215, 2130706431, 2139095039, 2143289343, 2145386495, 2146435071, 2146959359, 2147221503, 2147352575, 2147418111, 2147450879, 2147467263, 2147475455, 2147479551, 2147481599, 2147482623, 2147483135, 2147483391, 2147483519, 2147483583, 2147483615, 2147483631, 2147483639, 2147483643, 2147483645, 2147483646]
 agrees
search-0-target-0-greatest-0 target 0, greatest 0, already proven left [], right []
1 checks
agrees search_binary_ladder(target, greatest) (§6.2, App. B)
peer[0, 1]
kt[0, 1]
 agrees
search-1-target-0-greatest-1 target 0, greatest 1, already proven left [], right []
1 checks
agrees search_binary_ladder(target, greatest) (§6.2, App. B)
peer[0, 1]
kt[0, 1]
 agrees
search-2-target-1-greatest-0 target 1, greatest 0, already proven left [], right []
1 checks
agrees search_binary_ladder(target, greatest) (§6.2, App. B)
peer[0, 1]
kt[0, 1]
 agrees
search-3-target-5-greatest-100 target 5, greatest 100, already proven left [], right []
1 checks
agrees search_binary_ladder(target, greatest) (§6.2, App. B)
peer[0, 1, 3, 7]
kt[0, 1, 3, 7]
 agrees
search-4-target-100-greatest-5 target 100, greatest 5, already proven left [], right []
1 checks
agrees search_binary_ladder(target, greatest) (§6.2, App. B)
peer[0, 1, 3, 7]
kt[0, 1, 3, 7]
 agrees
search-5-target-6-greatest-6 target 6, greatest 6, already proven left [], right []
1 checks
agrees search_binary_ladder(target, greatest) (§6.2, App. B)
peer[0, 1, 3, 7, 5, 6]
kt[0, 1, 3, 7, 5, 6]
 agrees
search-6-target-7-greatest-6 target 7, greatest 6, already proven left [], right []
1 checks
agrees search_binary_ladder(target, greatest) (§6.2, App. B)
peer[0, 1, 3, 7]
kt[0, 1, 3, 7]
 agrees
search-7-target-6-greatest-7 target 6, greatest 7, already proven left [], right []
1 checks
agrees search_binary_ladder(target, greatest) (§6.2, App. B)
peer[0, 1, 3, 7]
kt[0, 1, 3, 7]
 agrees
search-8-target-63-greatest-64 target 63, greatest 64, already proven left [], right []
1 checks
agrees search_binary_ladder(target, greatest) (§6.2, App. B)
peer[0, 1, 3, 7, 15, 31, 63, 127, 95, 79, 71, 67, 65, 64]
kt[0, 1, 3, 7, 15, 31, 63, 127, 95, 79, 71, 67, 65, 64]
 agrees
search-9-target-64-greatest-63 target 64, greatest 63, already proven left [], right []
1 checks
agrees search_binary_ladder(target, greatest) (§6.2, App. B)
peer[0, 1, 3, 7, 15, 31, 63, 127, 95, 79, 71, 67, 65, 64]
kt[0, 1, 3, 7, 15, 31, 63, 127, 95, 79, 71, 67, 65, 64]
 agrees
search-10-target-1000-greatest-1000 target 1000, greatest 1000, already proven left [], right []
1 checks
agrees search_binary_ladder(target, greatest) (§6.2, App. B)
peer[0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 767, 895, 959, 991, 1007, 999, 1003, 1001, 1000]
kt[0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 767, 895, 959, 991, 1007, 999, 1003, 1001, 1000]
 agrees
search-11-target-999-greatest-1000 target 999, greatest 1000, already proven left [], right []
1 checks
agrees search_binary_ladder(target, greatest) (§6.2, App. B)
peer[0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 767, 895, 959, 991, 1007, 999, 1003, 1001, 1000]
kt[0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 767, 895, 959, 991, 1007, 999, 1003, 1001, 1000]
 agrees
search-12-target-1000-greatest-999 target 1000, greatest 999, already proven left [], right []
1 checks
agrees search_binary_ladder(target, greatest) (§6.2, App. B)
peer[0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 767, 895, 959, 991, 1007, 999, 1003, 1001, 1000]
kt[0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 767, 895, 959, 991, 1007, 999, 1003, 1001, 1000]
 agrees
search-13-target-0-greatest-2147483646 target 0, greatest 2147483646, already proven left [], right []
1 checks
agrees search_binary_ladder(target, greatest) (§6.2, App. B)
peer[0, 1]
kt[0, 1]
 agrees
search-14-target-2147483646-greatest-0 target 2147483646, greatest 0, already proven left [], right []
1 checks
agrees search_binary_ladder(target, greatest) (§6.2, App. B)
peer[0, 1]
kt[0, 1]
 agrees
search-15-target-2147483646-greatest-2147483646 target 2147483646, greatest 2147483646, already proven left [], right []
1 checks
agrees search_binary_ladder(target, greatest) (§6.2, App. B)
peer[0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 2047, 4095, 8191, 16383, 32767, 65535, 131071, 262143, 524287, 1048575, 2097151, 4194303, 8388607, 16777215, 33554431, 67108863, 134217727, 268435455, 536870911, 1073741823, 2147483647, 1610612735, 1879048191, 2013265919, 2080374783, 2113929215, 2130706431, 2139095039, 2143289343, 2145386495, 2146435071, 2146959359, 2147221503, 2147352575, 2147418111, 2147450879, 2147467263, 2147475455, 2147479551, 2147481599, 2147482623, 2147483135, 2147483391, 2147483519, 2147483583, 2147483615, 2147483631, 2147483639, 2147483643, 2147483645, 2147483646]
kt[0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 2047, 4095, 8191, 16383, 32767, 65535, 131071, 262143, 524287, 1048575, 2097151, 4194303, 8388607, 16777215, 33554431, 67108863, 134217727, 268435455, 536870911, 1073741823, 2147483647, 1610612735, 1879048191, 2013265919, 2080374783, 2113929215, 2130706431, 2139095039, 2143289343, 2145386495, 2146435071, 2146959359, 2147221503, 2147352575, 2147418111, 2147450879, 2147467263, 2147475455, 2147479551, 2147481599, 2147482623, 2147483135, 2147483391, 2147483519, 2147483583, 2147483615, 2147483631, 2147483639, 2147483643, 2147483645, 2147483646]
 agrees
search-16-target-2147483645-greatest-2147483646 target 2147483645, greatest 2147483646, already proven left [], right []
1 checks
agrees search_binary_ladder(target, greatest) (§6.2, App. B)
peer[0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 2047, 4095, 8191, 16383, 32767, 65535, 131071, 262143, 524287, 1048575, 2097151, 4194303, 8388607, 16777215, 33554431, 67108863, 134217727, 268435455, 536870911, 1073741823, 2147483647, 1610612735, 1879048191, 2013265919, 2080374783, 2113929215, 2130706431, 2139095039, 2143289343, 2145386495, 2146435071, 2146959359, 2147221503, 2147352575, 2147418111, 2147450879, 2147467263, 2147475455, 2147479551, 2147481599, 2147482623, 2147483135, 2147483391, 2147483519, 2147483583, 2147483615, 2147483631, 2147483639, 2147483643, 2147483645, 2147483646]
kt[0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 2047, 4095, 8191, 16383, 32767, 65535, 131071, 262143, 524287, 1048575, 2097151, 4194303, 8388607, 16777215, 33554431, 67108863, 134217727, 268435455, 536870911, 1073741823, 2147483647, 1610612735, 1879048191, 2013265919, 2080374783, 2113929215, 2130706431, 2139095039, 2143289343, 2145386495, 2146435071, 2146959359, 2147221503, 2147352575, 2147418111, 2147450879, 2147467263, 2147475455, 2147479551, 2147481599, 2147482623, 2147483135, 2147483391, 2147483519, 2147483583, 2147483615, 2147483631, 2147483639, 2147483643, 2147483645, 2147483646]
 agrees
search-17-target-5-greatest-100 target 5, greatest 100, already proven left [0, 1], right []
1 checks
agrees search_binary_ladder(target, greatest) (§6.2, App. B)
peer[3, 7]
kt[3, 7]
 agrees
search-18-target-5-greatest-100 target 5, greatest 100, already proven left [7], right []
1 checks
agrees search_binary_ladder(target, greatest) (§6.2, App. B)
peer[0, 1, 3]
kt[0, 1, 3]
 agrees
search-19-target-5-greatest-100 target 5, greatest 100, already proven left [], right [3]
1 checks
agrees search_binary_ladder(target, greatest) (§6.2, App. B)
peer[0, 1, 7]
kt[0, 1, 7]
 agrees
search-20-target-5-greatest-100 target 5, greatest 100, already proven left [0, 1, 3, 7], right []
1 checks
agrees search_binary_ladder(target, greatest) (§6.2, App. B)
peer[]
kt[]
 agrees
search-21-target-6-greatest-6 target 6, greatest 6, already proven left [0, 1, 3], right [5]
1 checks
agrees search_binary_ladder(target, greatest) (§6.2, App. B)
peer[7, 6]
kt[7, 6]
 agrees
search-22-target-1000-greatest-1000 target 1000, greatest 1000, already proven left [0, 1, 3, 7, 15, 31], right [1023]
1 checks
agrees search_binary_ladder(target, greatest) (§6.2, App. B)
peer[63, 127, 255, 511, 767, 895, 959, 991, 1007, 999, 1003, 1001, 1000]
kt[63, 127, 255, 511, 767, 895, 959, 991, 1007, 999, 1003, 1001, 1000]
 agrees
monitoring-target-0 target 0, already proven left []
1 checks
agrees monitoring_binary_ladder(target) (§8.1, App. B)
peer[0]
kt[0]
 agrees
monitoring-target-1 target 1, already proven left []
1 checks
agrees monitoring_binary_ladder(target) (§8.1, App. B)
peer[0, 1]
kt[0, 1]
 agrees
monitoring-target-2 target 2, already proven left []
1 checks
agrees monitoring_binary_ladder(target) (§8.1, App. B)
peer[0, 1, 2]
kt[0, 1, 2]
 agrees
monitoring-target-3 target 3, already proven left []
1 checks
agrees monitoring_binary_ladder(target) (§8.1, App. B)
peer[0, 1, 3]
kt[0, 1, 3]
 agrees
monitoring-target-4 target 4, already proven left []
1 checks
agrees monitoring_binary_ladder(target) (§8.1, App. B)
peer[0, 1, 3, 4]
kt[0, 1, 3, 4]
 agrees
monitoring-target-5 target 5, already proven left []
1 checks
agrees monitoring_binary_ladder(target) (§8.1, App. B)
peer[0, 1, 3, 5]
kt[0, 1, 3, 5]
 agrees
monitoring-target-6 target 6, already proven left []
1 checks
agrees monitoring_binary_ladder(target) (§8.1, App. B)
peer[0, 1, 3, 5, 6]
kt[0, 1, 3, 5, 6]
 agrees
monitoring-target-7 target 7, already proven left []
1 checks
agrees monitoring_binary_ladder(target) (§8.1, App. B)
peer[0, 1, 3, 7]
kt[0, 1, 3, 7]
 agrees
monitoring-target-8 target 8, already proven left []
1 checks
agrees monitoring_binary_ladder(target) (§8.1, App. B)
peer[0, 1, 3, 7, 8]
kt[0, 1, 3, 7, 8]
 agrees
monitoring-target-15 target 15, already proven left []
1 checks
agrees monitoring_binary_ladder(target) (§8.1, App. B)
peer[0, 1, 3, 7, 15]
kt[0, 1, 3, 7, 15]
 agrees
monitoring-target-16 target 16, already proven left []
1 checks
agrees monitoring_binary_ladder(target) (§8.1, App. B)
peer[0, 1, 3, 7, 15, 16]
kt[0, 1, 3, 7, 15, 16]
 agrees
monitoring-target-17 target 17, already proven left []
1 checks
agrees monitoring_binary_ladder(target) (§8.1, App. B)
peer[0, 1, 3, 7, 15, 17]
kt[0, 1, 3, 7, 15, 17]
 agrees
monitoring-target-63 target 63, already proven left []
1 checks
agrees monitoring_binary_ladder(target) (§8.1, App. B)
peer[0, 1, 3, 7, 15, 31, 63]
kt[0, 1, 3, 7, 15, 31, 63]
 agrees
monitoring-target-64 target 64, already proven left []
1 checks
agrees monitoring_binary_ladder(target) (§8.1, App. B)
peer[0, 1, 3, 7, 15, 31, 63, 64]
kt[0, 1, 3, 7, 15, 31, 63, 64]
 agrees
monitoring-target-100 target 100, already proven left []
1 checks
agrees monitoring_binary_ladder(target) (§8.1, App. B)
peer[0, 1, 3, 7, 15, 31, 63, 95, 99, 100]
kt[0, 1, 3, 7, 15, 31, 63, 95, 99, 100]
 agrees
monitoring-target-255 target 255, already proven left []
1 checks
agrees monitoring_binary_ladder(target) (§8.1, App. B)
peer[0, 1, 3, 7, 15, 31, 63, 127, 255]
kt[0, 1, 3, 7, 15, 31, 63, 127, 255]
 agrees
monitoring-target-256 target 256, already proven left []
1 checks
agrees monitoring_binary_ladder(target) (§8.1, App. B)
peer[0, 1, 3, 7, 15, 31, 63, 127, 255, 256]
kt[0, 1, 3, 7, 15, 31, 63, 127, 255, 256]
 agrees
monitoring-target-1000 target 1000, already proven left []
1 checks
agrees monitoring_binary_ladder(target) (§8.1, App. B)
peer[0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 767, 895, 959, 991, 999, 1000]
kt[0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 767, 895, 959, 991, 999, 1000]
 agrees
monitoring-target-65535 target 65535, already proven left []
1 checks
agrees monitoring_binary_ladder(target) (§8.1, App. B)
peer[0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 2047, 4095, 8191, 16383, 32767, 65535]
kt[0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 2047, 4095, 8191, 16383, 32767, 65535]
 agrees
monitoring-target-1048576 target 1048576, already proven left []
1 checks
agrees monitoring_binary_ladder(target) (§8.1, App. B)
peer[0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 2047, 4095, 8191, 16383, 32767, 65535, 131071, 262143, 524287, 1048575, 1048576]
kt[0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 2047, 4095, 8191, 16383, 32767, 65535, 131071, 262143, 524287, 1048575, 1048576]
 agrees
monitoring-target-1073741824 target 1073741824, already proven left []
1 checks
agrees monitoring_binary_ladder(target) (§8.1, App. B)
peer[0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 2047, 4095, 8191, 16383, 32767, 65535, 131071, 262143, 524287, 1048575, 2097151, 4194303, 8388607, 16777215, 33554431, 67108863, 134217727, 268435455, 536870911, 1073741823, 1073741824]
kt[0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 2047, 4095, 8191, 16383, 32767, 65535, 131071, 262143, 524287, 1048575, 2097151, 4194303, 8388607, 16777215, 33554431, 67108863, 134217727, 268435455, 536870911, 1073741823, 1073741824]
 agrees
monitoring-target-2147483646 target 2147483646, already proven left []
1 checks
agrees monitoring_binary_ladder(target) (§8.1, App. B)
peer[0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 2047, 4095, 8191, 16383, 32767, 65535, 131071, 262143, 524287, 1048575, 2097151, 4194303, 8388607, 16777215, 33554431, 67108863, 134217727, 268435455, 536870911, 1073741823, 1610612735, 1879048191, 2013265919, 2080374783, 2113929215, 2130706431, 2139095039, 2143289343, 2145386495, 2146435071, 2146959359, 2147221503, 2147352575, 2147418111, 2147450879, 2147467263, 2147475455, 2147479551, 2147481599, 2147482623, 2147483135, 2147483391, 2147483519, 2147483583, 2147483615, 2147483631, 2147483639, 2147483643, 2147483645, 2147483646]
kt[0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 2047, 4095, 8191, 16383, 32767, 65535, 131071, 262143, 524287, 1048575, 2097151, 4194303, 8388607, 16777215, 33554431, 67108863, 134217727, 268435455, 536870911, 1073741823, 1610612735, 1879048191, 2013265919, 2080374783, 2113929215, 2130706431, 2139095039, 2143289343, 2145386495, 2146435071, 2146959359, 2147221503, 2147352575, 2147418111, 2147450879, 2147467263, 2147475455, 2147479551, 2147481599, 2147482623, 2147483135, 2147483391, 2147483519, 2147483583, 2147483615, 2147483631, 2147483639, 2147483643, 2147483645, 2147483646]
 agrees

Search ladder interpretation §6.2

Vectors: ladder-interpretation.json · oracle: katie @ 00da52541f6a · 211 cases, 422 checks agrees

CaseInputChecksResult
target-0-greatest-0 target 0, greatest 0
2 checks
agrees the ladder itself (§6.2)
peer[0, 1]
kt[0, 1]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer0
kt0
 agrees
target-0-greatest-1 target 0, greatest 1
2 checks
agrees the ladder itself (§6.2)
peer[0, 1]
kt[0, 1]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-0-greatest-2 target 0, greatest 2
2 checks
agrees the ladder itself (§6.2)
peer[0, 1]
kt[0, 1]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-0-greatest-13 target 0, greatest 13
2 checks
agrees the ladder itself (§6.2)
peer[0, 1]
kt[0, 1]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-0-greatest-26 target 0, greatest 26
2 checks
agrees the ladder itself (§6.2)
peer[0, 1]
kt[0, 1]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-0-greatest-39 target 0, greatest 39
2 checks
agrees the ladder itself (§6.2)
peer[0, 1]
kt[0, 1]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-1-greatest-0 target 1, greatest 0
2 checks
agrees the ladder itself (§6.2)
peer[0, 1]
kt[0, 1]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-1-greatest-1 target 1, greatest 1
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 2]
kt[0, 1, 3, 2]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer0
kt0
 agrees
target-1-greatest-2 target 1, greatest 2
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 2]
kt[0, 1, 3, 2]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-1-greatest-3 target 1, greatest 3
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3]
kt[0, 1, 3]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-2-greatest-0 target 2, greatest 0
2 checks
agrees the ladder itself (§6.2)
peer[0, 1]
kt[0, 1]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-2-greatest-1 target 2, greatest 1
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 2]
kt[0, 1, 3, 2]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-2-greatest-2 target 2, greatest 2
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 2]
kt[0, 1, 3, 2]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer0
kt0
 agrees
target-2-greatest-3 target 2, greatest 3
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3]
kt[0, 1, 3]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-2-greatest-4 target 2, greatest 4
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3]
kt[0, 1, 3]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-3-greatest-1 target 3, greatest 1
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3]
kt[0, 1, 3]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-3-greatest-2 target 3, greatest 2
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3]
kt[0, 1, 3]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-3-greatest-3 target 3, greatest 3
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 5, 4]
kt[0, 1, 3, 7, 5, 4]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer0
kt0
 agrees
target-3-greatest-4 target 3, greatest 4
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 5, 4]
kt[0, 1, 3, 7, 5, 4]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-3-greatest-5 target 3, greatest 5
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 5]
kt[0, 1, 3, 7, 5]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-4-greatest-2 target 4, greatest 2
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3]
kt[0, 1, 3]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-4-greatest-3 target 4, greatest 3
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 5, 4]
kt[0, 1, 3, 7, 5, 4]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-4-greatest-4 target 4, greatest 4
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 5, 4]
kt[0, 1, 3, 7, 5, 4]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer0
kt0
 agrees
target-4-greatest-5 target 4, greatest 5
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 5]
kt[0, 1, 3, 7, 5]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-4-greatest-6 target 4, greatest 6
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 5]
kt[0, 1, 3, 7, 5]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-5-greatest-3 target 5, greatest 3
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 5]
kt[0, 1, 3, 7, 5]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-5-greatest-4 target 5, greatest 4
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 5]
kt[0, 1, 3, 7, 5]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-5-greatest-5 target 5, greatest 5
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 5, 6]
kt[0, 1, 3, 7, 5, 6]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer0
kt0
 agrees
target-5-greatest-6 target 5, greatest 6
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 5, 6]
kt[0, 1, 3, 7, 5, 6]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-5-greatest-7 target 5, greatest 7
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7]
kt[0, 1, 3, 7]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-6-greatest-4 target 6, greatest 4
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 5]
kt[0, 1, 3, 7, 5]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-6-greatest-5 target 6, greatest 5
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 5, 6]
kt[0, 1, 3, 7, 5, 6]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-6-greatest-6 target 6, greatest 6
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 5, 6]
kt[0, 1, 3, 7, 5, 6]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer0
kt0
 agrees
target-6-greatest-7 target 6, greatest 7
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7]
kt[0, 1, 3, 7]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-6-greatest-8 target 6, greatest 8
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7]
kt[0, 1, 3, 7]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-7-greatest-5 target 7, greatest 5
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7]
kt[0, 1, 3, 7]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-7-greatest-6 target 7, greatest 6
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7]
kt[0, 1, 3, 7]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-7-greatest-7 target 7, greatest 7
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 11, 9, 8]
kt[0, 1, 3, 7, 15, 11, 9, 8]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer0
kt0
 agrees
target-7-greatest-8 target 7, greatest 8
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 11, 9, 8]
kt[0, 1, 3, 7, 15, 11, 9, 8]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-7-greatest-9 target 7, greatest 9
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 11, 9]
kt[0, 1, 3, 7, 15, 11, 9]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-8-greatest-6 target 8, greatest 6
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7]
kt[0, 1, 3, 7]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-8-greatest-7 target 8, greatest 7
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 11, 9, 8]
kt[0, 1, 3, 7, 15, 11, 9, 8]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-8-greatest-8 target 8, greatest 8
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 11, 9, 8]
kt[0, 1, 3, 7, 15, 11, 9, 8]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer0
kt0
 agrees
target-8-greatest-9 target 8, greatest 9
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 11, 9]
kt[0, 1, 3, 7, 15, 11, 9]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-8-greatest-10 target 8, greatest 10
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 11, 9]
kt[0, 1, 3, 7, 15, 11, 9]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-9-greatest-7 target 9, greatest 7
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 11, 9]
kt[0, 1, 3, 7, 15, 11, 9]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-9-greatest-8 target 9, greatest 8
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 11, 9]
kt[0, 1, 3, 7, 15, 11, 9]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-9-greatest-9 target 9, greatest 9
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 11, 9, 10]
kt[0, 1, 3, 7, 15, 11, 9, 10]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer0
kt0
 agrees
target-9-greatest-10 target 9, greatest 10
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 11, 9, 10]
kt[0, 1, 3, 7, 15, 11, 9, 10]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-9-greatest-11 target 9, greatest 11
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 11]
kt[0, 1, 3, 7, 15, 11]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-10-greatest-8 target 10, greatest 8
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 11, 9]
kt[0, 1, 3, 7, 15, 11, 9]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-10-greatest-9 target 10, greatest 9
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 11, 9, 10]
kt[0, 1, 3, 7, 15, 11, 9, 10]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-10-greatest-10 target 10, greatest 10
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 11, 9, 10]
kt[0, 1, 3, 7, 15, 11, 9, 10]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer0
kt0
 agrees
target-10-greatest-11 target 10, greatest 11
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 11]
kt[0, 1, 3, 7, 15, 11]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-10-greatest-12 target 10, greatest 12
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 11]
kt[0, 1, 3, 7, 15, 11]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-11-greatest-9 target 11, greatest 9
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 11]
kt[0, 1, 3, 7, 15, 11]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-11-greatest-10 target 11, greatest 10
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 11]
kt[0, 1, 3, 7, 15, 11]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-11-greatest-11 target 11, greatest 11
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 11, 13, 12]
kt[0, 1, 3, 7, 15, 11, 13, 12]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer0
kt0
 agrees
target-11-greatest-12 target 11, greatest 12
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 11, 13, 12]
kt[0, 1, 3, 7, 15, 11, 13, 12]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-11-greatest-13 target 11, greatest 13
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 11, 13]
kt[0, 1, 3, 7, 15, 11, 13]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-12-greatest-10 target 12, greatest 10
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 11]
kt[0, 1, 3, 7, 15, 11]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-12-greatest-11 target 12, greatest 11
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 11, 13, 12]
kt[0, 1, 3, 7, 15, 11, 13, 12]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-12-greatest-12 target 12, greatest 12
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 11, 13, 12]
kt[0, 1, 3, 7, 15, 11, 13, 12]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer0
kt0
 agrees
target-12-greatest-13 target 12, greatest 13
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 11, 13]
kt[0, 1, 3, 7, 15, 11, 13]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-12-greatest-14 target 12, greatest 14
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 11, 13]
kt[0, 1, 3, 7, 15, 11, 13]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-13-greatest-0 target 13, greatest 0
2 checks
agrees the ladder itself (§6.2)
peer[0, 1]
kt[0, 1]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-13-greatest-11 target 13, greatest 11
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 11, 13]
kt[0, 1, 3, 7, 15, 11, 13]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-13-greatest-12 target 13, greatest 12
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 11, 13]
kt[0, 1, 3, 7, 15, 11, 13]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-13-greatest-13 target 13, greatest 13
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 11, 13, 14]
kt[0, 1, 3, 7, 15, 11, 13, 14]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer0
kt0
 agrees
target-13-greatest-14 target 13, greatest 14
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 11, 13, 14]
kt[0, 1, 3, 7, 15, 11, 13, 14]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-13-greatest-15 target 13, greatest 15
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15]
kt[0, 1, 3, 7, 15]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-13-greatest-26 target 13, greatest 26
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15]
kt[0, 1, 3, 7, 15]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-13-greatest-39 target 13, greatest 39
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15]
kt[0, 1, 3, 7, 15]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-14-greatest-12 target 14, greatest 12
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 11, 13]
kt[0, 1, 3, 7, 15, 11, 13]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-14-greatest-13 target 14, greatest 13
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 11, 13, 14]
kt[0, 1, 3, 7, 15, 11, 13, 14]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-14-greatest-14 target 14, greatest 14
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 11, 13, 14]
kt[0, 1, 3, 7, 15, 11, 13, 14]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer0
kt0
 agrees
target-14-greatest-15 target 14, greatest 15
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15]
kt[0, 1, 3, 7, 15]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-14-greatest-16 target 14, greatest 16
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15]
kt[0, 1, 3, 7, 15]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-15-greatest-13 target 15, greatest 13
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15]
kt[0, 1, 3, 7, 15]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-15-greatest-14 target 15, greatest 14
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15]
kt[0, 1, 3, 7, 15]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-15-greatest-15 target 15, greatest 15
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 19, 17, 16]
kt[0, 1, 3, 7, 15, 31, 23, 19, 17, 16]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer0
kt0
 agrees
target-15-greatest-16 target 15, greatest 16
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 19, 17, 16]
kt[0, 1, 3, 7, 15, 31, 23, 19, 17, 16]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-15-greatest-17 target 15, greatest 17
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 19, 17]
kt[0, 1, 3, 7, 15, 31, 23, 19, 17]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-16-greatest-14 target 16, greatest 14
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15]
kt[0, 1, 3, 7, 15]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-16-greatest-15 target 16, greatest 15
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 19, 17, 16]
kt[0, 1, 3, 7, 15, 31, 23, 19, 17, 16]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-16-greatest-16 target 16, greatest 16
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 19, 17, 16]
kt[0, 1, 3, 7, 15, 31, 23, 19, 17, 16]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer0
kt0
 agrees
target-16-greatest-17 target 16, greatest 17
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 19, 17]
kt[0, 1, 3, 7, 15, 31, 23, 19, 17]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-16-greatest-18 target 16, greatest 18
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 19, 17]
kt[0, 1, 3, 7, 15, 31, 23, 19, 17]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-17-greatest-15 target 17, greatest 15
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 19, 17]
kt[0, 1, 3, 7, 15, 31, 23, 19, 17]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-17-greatest-16 target 17, greatest 16
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 19, 17]
kt[0, 1, 3, 7, 15, 31, 23, 19, 17]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-17-greatest-17 target 17, greatest 17
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 19, 17, 18]
kt[0, 1, 3, 7, 15, 31, 23, 19, 17, 18]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer0
kt0
 agrees
target-17-greatest-18 target 17, greatest 18
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 19, 17, 18]
kt[0, 1, 3, 7, 15, 31, 23, 19, 17, 18]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-17-greatest-19 target 17, greatest 19
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 19]
kt[0, 1, 3, 7, 15, 31, 23, 19]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-18-greatest-16 target 18, greatest 16
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 19, 17]
kt[0, 1, 3, 7, 15, 31, 23, 19, 17]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-18-greatest-17 target 18, greatest 17
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 19, 17, 18]
kt[0, 1, 3, 7, 15, 31, 23, 19, 17, 18]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-18-greatest-18 target 18, greatest 18
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 19, 17, 18]
kt[0, 1, 3, 7, 15, 31, 23, 19, 17, 18]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer0
kt0
 agrees
target-18-greatest-19 target 18, greatest 19
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 19]
kt[0, 1, 3, 7, 15, 31, 23, 19]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-18-greatest-20 target 18, greatest 20
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 19]
kt[0, 1, 3, 7, 15, 31, 23, 19]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-19-greatest-17 target 19, greatest 17
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 19]
kt[0, 1, 3, 7, 15, 31, 23, 19]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-19-greatest-18 target 19, greatest 18
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 19]
kt[0, 1, 3, 7, 15, 31, 23, 19]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-19-greatest-19 target 19, greatest 19
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 19, 21, 20]
kt[0, 1, 3, 7, 15, 31, 23, 19, 21, 20]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer0
kt0
 agrees
target-19-greatest-20 target 19, greatest 20
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 19, 21, 20]
kt[0, 1, 3, 7, 15, 31, 23, 19, 21, 20]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-19-greatest-21 target 19, greatest 21
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 19, 21]
kt[0, 1, 3, 7, 15, 31, 23, 19, 21]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-20-greatest-18 target 20, greatest 18
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 19]
kt[0, 1, 3, 7, 15, 31, 23, 19]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-20-greatest-19 target 20, greatest 19
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 19, 21, 20]
kt[0, 1, 3, 7, 15, 31, 23, 19, 21, 20]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-20-greatest-20 target 20, greatest 20
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 19, 21, 20]
kt[0, 1, 3, 7, 15, 31, 23, 19, 21, 20]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer0
kt0
 agrees
target-20-greatest-21 target 20, greatest 21
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 19, 21]
kt[0, 1, 3, 7, 15, 31, 23, 19, 21]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-20-greatest-22 target 20, greatest 22
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 19, 21]
kt[0, 1, 3, 7, 15, 31, 23, 19, 21]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-21-greatest-19 target 21, greatest 19
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 19, 21]
kt[0, 1, 3, 7, 15, 31, 23, 19, 21]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-21-greatest-20 target 21, greatest 20
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 19, 21]
kt[0, 1, 3, 7, 15, 31, 23, 19, 21]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-21-greatest-21 target 21, greatest 21
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 19, 21, 22]
kt[0, 1, 3, 7, 15, 31, 23, 19, 21, 22]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer0
kt0
 agrees
target-21-greatest-22 target 21, greatest 22
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 19, 21, 22]
kt[0, 1, 3, 7, 15, 31, 23, 19, 21, 22]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-21-greatest-23 target 21, greatest 23
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23]
kt[0, 1, 3, 7, 15, 31, 23]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-22-greatest-20 target 22, greatest 20
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 19, 21]
kt[0, 1, 3, 7, 15, 31, 23, 19, 21]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-22-greatest-21 target 22, greatest 21
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 19, 21, 22]
kt[0, 1, 3, 7, 15, 31, 23, 19, 21, 22]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-22-greatest-22 target 22, greatest 22
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 19, 21, 22]
kt[0, 1, 3, 7, 15, 31, 23, 19, 21, 22]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer0
kt0
 agrees
target-22-greatest-23 target 22, greatest 23
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23]
kt[0, 1, 3, 7, 15, 31, 23]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-22-greatest-24 target 22, greatest 24
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23]
kt[0, 1, 3, 7, 15, 31, 23]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-23-greatest-21 target 23, greatest 21
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23]
kt[0, 1, 3, 7, 15, 31, 23]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-23-greatest-22 target 23, greatest 22
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23]
kt[0, 1, 3, 7, 15, 31, 23]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-23-greatest-23 target 23, greatest 23
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 27, 25, 24]
kt[0, 1, 3, 7, 15, 31, 23, 27, 25, 24]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer0
kt0
 agrees
target-23-greatest-24 target 23, greatest 24
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 27, 25, 24]
kt[0, 1, 3, 7, 15, 31, 23, 27, 25, 24]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-23-greatest-25 target 23, greatest 25
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 27, 25]
kt[0, 1, 3, 7, 15, 31, 23, 27, 25]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-24-greatest-22 target 24, greatest 22
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23]
kt[0, 1, 3, 7, 15, 31, 23]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-24-greatest-23 target 24, greatest 23
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 27, 25, 24]
kt[0, 1, 3, 7, 15, 31, 23, 27, 25, 24]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-24-greatest-24 target 24, greatest 24
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 27, 25, 24]
kt[0, 1, 3, 7, 15, 31, 23, 27, 25, 24]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer0
kt0
 agrees
target-24-greatest-25 target 24, greatest 25
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 27, 25]
kt[0, 1, 3, 7, 15, 31, 23, 27, 25]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-24-greatest-26 target 24, greatest 26
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 27, 25]
kt[0, 1, 3, 7, 15, 31, 23, 27, 25]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-25-greatest-23 target 25, greatest 23
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 27, 25]
kt[0, 1, 3, 7, 15, 31, 23, 27, 25]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-25-greatest-24 target 25, greatest 24
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 27, 25]
kt[0, 1, 3, 7, 15, 31, 23, 27, 25]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-25-greatest-25 target 25, greatest 25
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 27, 25, 26]
kt[0, 1, 3, 7, 15, 31, 23, 27, 25, 26]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer0
kt0
 agrees
target-25-greatest-26 target 25, greatest 26
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 27, 25, 26]
kt[0, 1, 3, 7, 15, 31, 23, 27, 25, 26]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-25-greatest-27 target 25, greatest 27
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 27]
kt[0, 1, 3, 7, 15, 31, 23, 27]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-26-greatest-0 target 26, greatest 0
2 checks
agrees the ladder itself (§6.2)
peer[0, 1]
kt[0, 1]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-26-greatest-13 target 26, greatest 13
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15]
kt[0, 1, 3, 7, 15]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-26-greatest-24 target 26, greatest 24
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 27, 25]
kt[0, 1, 3, 7, 15, 31, 23, 27, 25]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-26-greatest-25 target 26, greatest 25
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 27, 25, 26]
kt[0, 1, 3, 7, 15, 31, 23, 27, 25, 26]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-26-greatest-26 target 26, greatest 26
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 27, 25, 26]
kt[0, 1, 3, 7, 15, 31, 23, 27, 25, 26]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer0
kt0
 agrees
target-26-greatest-27 target 26, greatest 27
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 27]
kt[0, 1, 3, 7, 15, 31, 23, 27]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-26-greatest-28 target 26, greatest 28
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 27]
kt[0, 1, 3, 7, 15, 31, 23, 27]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-26-greatest-39 target 26, greatest 39
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31]
kt[0, 1, 3, 7, 15, 31]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-27-greatest-25 target 27, greatest 25
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 27]
kt[0, 1, 3, 7, 15, 31, 23, 27]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-27-greatest-26 target 27, greatest 26
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 27]
kt[0, 1, 3, 7, 15, 31, 23, 27]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-27-greatest-27 target 27, greatest 27
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 27, 29, 28]
kt[0, 1, 3, 7, 15, 31, 23, 27, 29, 28]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer0
kt0
 agrees
target-27-greatest-28 target 27, greatest 28
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 27, 29, 28]
kt[0, 1, 3, 7, 15, 31, 23, 27, 29, 28]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-27-greatest-29 target 27, greatest 29
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 27, 29]
kt[0, 1, 3, 7, 15, 31, 23, 27, 29]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-28-greatest-26 target 28, greatest 26
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 27]
kt[0, 1, 3, 7, 15, 31, 23, 27]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-28-greatest-27 target 28, greatest 27
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 27, 29, 28]
kt[0, 1, 3, 7, 15, 31, 23, 27, 29, 28]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-28-greatest-28 target 28, greatest 28
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 27, 29, 28]
kt[0, 1, 3, 7, 15, 31, 23, 27, 29, 28]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer0
kt0
 agrees
target-28-greatest-29 target 28, greatest 29
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 27, 29]
kt[0, 1, 3, 7, 15, 31, 23, 27, 29]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-28-greatest-30 target 28, greatest 30
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 27, 29]
kt[0, 1, 3, 7, 15, 31, 23, 27, 29]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-29-greatest-27 target 29, greatest 27
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 27, 29]
kt[0, 1, 3, 7, 15, 31, 23, 27, 29]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-29-greatest-28 target 29, greatest 28
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 27, 29]
kt[0, 1, 3, 7, 15, 31, 23, 27, 29]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-29-greatest-29 target 29, greatest 29
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 27, 29, 30]
kt[0, 1, 3, 7, 15, 31, 23, 27, 29, 30]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer0
kt0
 agrees
target-29-greatest-30 target 29, greatest 30
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 27, 29, 30]
kt[0, 1, 3, 7, 15, 31, 23, 27, 29, 30]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-29-greatest-31 target 29, greatest 31
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31]
kt[0, 1, 3, 7, 15, 31]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-30-greatest-28 target 30, greatest 28
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 27, 29]
kt[0, 1, 3, 7, 15, 31, 23, 27, 29]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-30-greatest-29 target 30, greatest 29
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 27, 29, 30]
kt[0, 1, 3, 7, 15, 31, 23, 27, 29, 30]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-30-greatest-30 target 30, greatest 30
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 23, 27, 29, 30]
kt[0, 1, 3, 7, 15, 31, 23, 27, 29, 30]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer0
kt0
 agrees
target-30-greatest-31 target 30, greatest 31
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31]
kt[0, 1, 3, 7, 15, 31]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-30-greatest-32 target 30, greatest 32
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31]
kt[0, 1, 3, 7, 15, 31]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-31-greatest-29 target 31, greatest 29
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31]
kt[0, 1, 3, 7, 15, 31]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-31-greatest-30 target 31, greatest 30
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31]
kt[0, 1, 3, 7, 15, 31]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-31-greatest-31 target 31, greatest 31
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 33, 32]
kt[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 33, 32]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer0
kt0
 agrees
target-31-greatest-32 target 31, greatest 32
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 33, 32]
kt[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 33, 32]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-31-greatest-33 target 31, greatest 33
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 33]
kt[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 33]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-32-greatest-30 target 32, greatest 30
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31]
kt[0, 1, 3, 7, 15, 31]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-32-greatest-31 target 32, greatest 31
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 33, 32]
kt[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 33, 32]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-32-greatest-32 target 32, greatest 32
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 33, 32]
kt[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 33, 32]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer0
kt0
 agrees
target-32-greatest-33 target 32, greatest 33
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 33]
kt[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 33]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-32-greatest-34 target 32, greatest 34
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 33]
kt[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 33]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-33-greatest-31 target 33, greatest 31
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 33]
kt[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 33]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-33-greatest-32 target 33, greatest 32
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 33]
kt[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 33]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-33-greatest-33 target 33, greatest 33
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 33, 34]
kt[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 33, 34]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer0
kt0
 agrees
target-33-greatest-34 target 33, greatest 34
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 33, 34]
kt[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 33, 34]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-33-greatest-35 target 33, greatest 35
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 63, 47, 39, 35]
kt[0, 1, 3, 7, 15, 31, 63, 47, 39, 35]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-34-greatest-32 target 34, greatest 32
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 33]
kt[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 33]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-34-greatest-33 target 34, greatest 33
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 33, 34]
kt[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 33, 34]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-34-greatest-34 target 34, greatest 34
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 33, 34]
kt[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 33, 34]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer0
kt0
 agrees
target-34-greatest-35 target 34, greatest 35
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 63, 47, 39, 35]
kt[0, 1, 3, 7, 15, 31, 63, 47, 39, 35]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-34-greatest-36 target 34, greatest 36
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 63, 47, 39, 35]
kt[0, 1, 3, 7, 15, 31, 63, 47, 39, 35]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-35-greatest-33 target 35, greatest 33
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 63, 47, 39, 35]
kt[0, 1, 3, 7, 15, 31, 63, 47, 39, 35]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-35-greatest-34 target 35, greatest 34
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 63, 47, 39, 35]
kt[0, 1, 3, 7, 15, 31, 63, 47, 39, 35]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-35-greatest-35 target 35, greatest 35
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 37, 36]
kt[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 37, 36]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer0
kt0
 agrees
target-35-greatest-36 target 35, greatest 36
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 37, 36]
kt[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 37, 36]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-35-greatest-37 target 35, greatest 37
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 37]
kt[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 37]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-36-greatest-34 target 36, greatest 34
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 63, 47, 39, 35]
kt[0, 1, 3, 7, 15, 31, 63, 47, 39, 35]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-36-greatest-35 target 36, greatest 35
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 37, 36]
kt[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 37, 36]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-36-greatest-36 target 36, greatest 36
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 37, 36]
kt[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 37, 36]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer0
kt0
 agrees
target-36-greatest-37 target 36, greatest 37
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 37]
kt[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 37]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-36-greatest-38 target 36, greatest 38
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 37]
kt[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 37]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-37-greatest-35 target 37, greatest 35
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 37]
kt[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 37]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-37-greatest-36 target 37, greatest 36
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 37]
kt[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 37]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-37-greatest-37 target 37, greatest 37
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 37, 38]
kt[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 37, 38]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer0
kt0
 agrees
target-37-greatest-38 target 37, greatest 38
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 37, 38]
kt[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 37, 38]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-37-greatest-39 target 37, greatest 39
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 63, 47, 39]
kt[0, 1, 3, 7, 15, 31, 63, 47, 39]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-38-greatest-36 target 38, greatest 36
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 37]
kt[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 37]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-38-greatest-37 target 38, greatest 37
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 37, 38]
kt[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 37, 38]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-38-greatest-38 target 38, greatest 38
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 37, 38]
kt[0, 1, 3, 7, 15, 31, 63, 47, 39, 35, 37, 38]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer0
kt0
 agrees
target-38-greatest-39 target 38, greatest 39
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 63, 47, 39]
kt[0, 1, 3, 7, 15, 31, 63, 47, 39]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-38-greatest-40 target 38, greatest 40
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 63, 47, 39]
kt[0, 1, 3, 7, 15, 31, 63, 47, 39]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-39-greatest-0 target 39, greatest 0
2 checks
agrees the ladder itself (§6.2)
peer[0, 1]
kt[0, 1]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-39-greatest-13 target 39, greatest 13
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15]
kt[0, 1, 3, 7, 15]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-39-greatest-26 target 39, greatest 26
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31]
kt[0, 1, 3, 7, 15, 31]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-39-greatest-37 target 39, greatest 37
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 63, 47, 39]
kt[0, 1, 3, 7, 15, 31, 63, 47, 39]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-39-greatest-38 target 39, greatest 38
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 63, 47, 39]
kt[0, 1, 3, 7, 15, 31, 63, 47, 39]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-39-greatest-39 target 39, greatest 39
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 63, 47, 39, 43, 41, 40]
kt[0, 1, 3, 7, 15, 31, 63, 47, 39, 43, 41, 40]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer0
kt0
 agrees
target-39-greatest-40 target 39, greatest 40
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 63, 47, 39, 43, 41, 40]
kt[0, 1, 3, 7, 15, 31, 63, 47, 39, 43, 41, 40]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer1
kt1
 agrees
target-40-greatest-38 target 40, greatest 38
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 63, 47, 39]
kt[0, 1, 3, 7, 15, 31, 63, 47, 39]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-40-greatest-39 target 40, greatest 39
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 63, 47, 39, 43, 41, 40]
kt[0, 1, 3, 7, 15, 31, 63, 47, 39, 43, 41, 40]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer-1
kt-1
 agrees
target-40-greatest-40 target 40, greatest 40
2 checks
agrees the ladder itself (§6.2)
peer[0, 1, 3, 7, 15, 31, 63, 47, 39, 43, 41, 40]
kt[0, 1, 3, 7, 15, 31, 63, 47, 39, 43, 41, 40]
agrees interpret_search_ladder: is the greatest version below, at, or above the target (§6.2)
peer0
kt0
 agrees

Updating a view §4.2

Vectors: update-view.json · oracle: katie @ 00da52541f6a · 190 cases, 380 checks agrees

CaseInputChecksResult
size-1-no-previous-view log of 1 entries, no previous view
2 checks
agrees update_view(size, advertised) (§4.2)
peer[0]
kt[0]
agrees frontier(size) (§4.1)
peer[0]
kt[0]
 agrees
size-1-advertised-1 log of 1 entries, advertised 1
2 checks
agrees update_view(size, advertised) (§4.2)
peer[]
kt[]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-2-no-previous-view log of 2 entries, no previous view
2 checks
agrees update_view(size, advertised) (§4.2)
peer[1]
kt[1]
agrees frontier(size) (§4.1)
peer[1]
kt[1]
 agrees
size-2-advertised-1 log of 2 entries, advertised 1
2 checks
agrees update_view(size, advertised) (§4.2)
peer[1]
kt[1]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-2-advertised-2 log of 2 entries, advertised 2
2 checks
agrees update_view(size, advertised) (§4.2)
peer[]
kt[]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-3-no-previous-view log of 3 entries, no previous view
2 checks
agrees update_view(size, advertised) (§4.2)
peer[1, 2]
kt[1, 2]
agrees frontier(size) (§4.1)
peer[1, 2]
kt[1, 2]
 agrees
size-3-advertised-1 log of 3 entries, advertised 1
2 checks
agrees update_view(size, advertised) (§4.2)
peer[1, 2]
kt[1, 2]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-3-advertised-2 log of 3 entries, advertised 2
2 checks
agrees update_view(size, advertised) (§4.2)
peer[]
kt[]
agrees whether the rightmost entry is left unchecked (§4.2)
peertrue
kttrue
 agrees
size-3-advertised-3 log of 3 entries, advertised 3
2 checks
agrees update_view(size, advertised) (§4.2)
peer[]
kt[]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-4-no-previous-view log of 4 entries, no previous view
2 checks
agrees update_view(size, advertised) (§4.2)
peer[3]
kt[3]
agrees frontier(size) (§4.1)
peer[3]
kt[3]
 agrees
size-4-advertised-1 log of 4 entries, advertised 1
2 checks
agrees update_view(size, advertised) (§4.2)
peer[1, 3]
kt[1, 3]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-4-advertised-2 log of 4 entries, advertised 2
2 checks
agrees update_view(size, advertised) (§4.2)
peer[3]
kt[3]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-4-advertised-3 log of 4 entries, advertised 3
2 checks
agrees update_view(size, advertised) (§4.2)
peer[3]
kt[3]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-4-advertised-4 log of 4 entries, advertised 4
2 checks
agrees update_view(size, advertised) (§4.2)
peer[]
kt[]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-5-no-previous-view log of 5 entries, no previous view
2 checks
agrees update_view(size, advertised) (§4.2)
peer[3, 4]
kt[3, 4]
agrees frontier(size) (§4.1)
peer[3, 4]
kt[3, 4]
 agrees
size-5-advertised-1 log of 5 entries, advertised 1
2 checks
agrees update_view(size, advertised) (§4.2)
peer[1, 3, 4]
kt[1, 3, 4]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-5-advertised-2 log of 5 entries, advertised 2
2 checks
agrees update_view(size, advertised) (§4.2)
peer[3, 4]
kt[3, 4]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-5-advertised-3 log of 5 entries, advertised 3
2 checks
agrees update_view(size, advertised) (§4.2)
peer[3, 4]
kt[3, 4]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-5-advertised-4 log of 5 entries, advertised 4
2 checks
agrees update_view(size, advertised) (§4.2)
peer[]
kt[]
agrees whether the rightmost entry is left unchecked (§4.2)
peertrue
kttrue
 agrees
size-5-advertised-5 log of 5 entries, advertised 5
2 checks
agrees update_view(size, advertised) (§4.2)
peer[]
kt[]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-6-no-previous-view log of 6 entries, no previous view
2 checks
agrees update_view(size, advertised) (§4.2)
peer[3, 5]
kt[3, 5]
agrees frontier(size) (§4.1)
peer[3, 5]
kt[3, 5]
 agrees
size-6-advertised-1 log of 6 entries, advertised 1
2 checks
agrees update_view(size, advertised) (§4.2)
peer[1, 3, 5]
kt[1, 3, 5]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-6-advertised-2 log of 6 entries, advertised 2
2 checks
agrees update_view(size, advertised) (§4.2)
peer[3, 5]
kt[3, 5]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-6-advertised-3 log of 6 entries, advertised 3
2 checks
agrees update_view(size, advertised) (§4.2)
peer[3, 5]
kt[3, 5]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-6-advertised-4 log of 6 entries, advertised 4
2 checks
agrees update_view(size, advertised) (§4.2)
peer[]
kt[]
agrees whether the rightmost entry is left unchecked (§4.2)
peertrue
kttrue
 agrees
size-6-advertised-5 log of 6 entries, advertised 5
2 checks
agrees update_view(size, advertised) (§4.2)
peer[5]
kt[5]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-6-advertised-6 log of 6 entries, advertised 6
2 checks
agrees update_view(size, advertised) (§4.2)
peer[]
kt[]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-7-no-previous-view log of 7 entries, no previous view
2 checks
agrees update_view(size, advertised) (§4.2)
peer[3, 5, 6]
kt[3, 5, 6]
agrees frontier(size) (§4.1)
peer[3, 5, 6]
kt[3, 5, 6]
 agrees
size-7-advertised-1 log of 7 entries, advertised 1
2 checks
agrees update_view(size, advertised) (§4.2)
peer[1, 3, 5, 6]
kt[1, 3, 5, 6]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-7-advertised-2 log of 7 entries, advertised 2
2 checks
agrees update_view(size, advertised) (§4.2)
peer[3, 5, 6]
kt[3, 5, 6]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-7-advertised-3 log of 7 entries, advertised 3
2 checks
agrees update_view(size, advertised) (§4.2)
peer[3, 5, 6]
kt[3, 5, 6]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-7-advertised-4 log of 7 entries, advertised 4
2 checks
agrees update_view(size, advertised) (§4.2)
peer[]
kt[]
agrees whether the rightmost entry is left unchecked (§4.2)
peertrue
kttrue
 agrees
size-7-advertised-5 log of 7 entries, advertised 5
2 checks
agrees update_view(size, advertised) (§4.2)
peer[5, 6]
kt[5, 6]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-7-advertised-6 log of 7 entries, advertised 6
2 checks
agrees update_view(size, advertised) (§4.2)
peer[]
kt[]
agrees whether the rightmost entry is left unchecked (§4.2)
peertrue
kttrue
 agrees
size-7-advertised-7 log of 7 entries, advertised 7
2 checks
agrees update_view(size, advertised) (§4.2)
peer[]
kt[]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-8-no-previous-view log of 8 entries, no previous view
2 checks
agrees update_view(size, advertised) (§4.2)
peer[7]
kt[7]
agrees frontier(size) (§4.1)
peer[7]
kt[7]
 agrees
size-8-advertised-1 log of 8 entries, advertised 1
2 checks
agrees update_view(size, advertised) (§4.2)
peer[1, 3, 7]
kt[1, 3, 7]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-8-advertised-2 log of 8 entries, advertised 2
2 checks
agrees update_view(size, advertised) (§4.2)
peer[3, 7]
kt[3, 7]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-8-advertised-3 log of 8 entries, advertised 3
2 checks
agrees update_view(size, advertised) (§4.2)
peer[3, 7]
kt[3, 7]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-8-advertised-4 log of 8 entries, advertised 4
2 checks
agrees update_view(size, advertised) (§4.2)
peer[7]
kt[7]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-8-advertised-5 log of 8 entries, advertised 5
2 checks
agrees update_view(size, advertised) (§4.2)
peer[5, 7]
kt[5, 7]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-8-advertised-6 log of 8 entries, advertised 6
2 checks
agrees update_view(size, advertised) (§4.2)
peer[7]
kt[7]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-8-advertised-7 log of 8 entries, advertised 7
2 checks
agrees update_view(size, advertised) (§4.2)
peer[7]
kt[7]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-8-advertised-8 log of 8 entries, advertised 8
2 checks
agrees update_view(size, advertised) (§4.2)
peer[]
kt[]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-9-no-previous-view log of 9 entries, no previous view
2 checks
agrees update_view(size, advertised) (§4.2)
peer[7, 8]
kt[7, 8]
agrees frontier(size) (§4.1)
peer[7, 8]
kt[7, 8]
 agrees
size-9-advertised-1 log of 9 entries, advertised 1
2 checks
agrees update_view(size, advertised) (§4.2)
peer[1, 3, 7, 8]
kt[1, 3, 7, 8]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-9-advertised-2 log of 9 entries, advertised 2
2 checks
agrees update_view(size, advertised) (§4.2)
peer[3, 7, 8]
kt[3, 7, 8]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-9-advertised-3 log of 9 entries, advertised 3
2 checks
agrees update_view(size, advertised) (§4.2)
peer[3, 7, 8]
kt[3, 7, 8]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-9-advertised-4 log of 9 entries, advertised 4
2 checks
agrees update_view(size, advertised) (§4.2)
peer[7, 8]
kt[7, 8]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-9-advertised-5 log of 9 entries, advertised 5
2 checks
agrees update_view(size, advertised) (§4.2)
peer[5, 7, 8]
kt[5, 7, 8]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-9-advertised-6 log of 9 entries, advertised 6
2 checks
agrees update_view(size, advertised) (§4.2)
peer[7, 8]
kt[7, 8]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-9-advertised-7 log of 9 entries, advertised 7
2 checks
agrees update_view(size, advertised) (§4.2)
peer[7, 8]
kt[7, 8]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-9-advertised-8 log of 9 entries, advertised 8
2 checks
agrees update_view(size, advertised) (§4.2)
peer[]
kt[]
agrees whether the rightmost entry is left unchecked (§4.2)
peertrue
kttrue
 agrees
size-9-advertised-9 log of 9 entries, advertised 9
2 checks
agrees update_view(size, advertised) (§4.2)
peer[]
kt[]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-12-no-previous-view log of 12 entries, no previous view
2 checks
agrees update_view(size, advertised) (§4.2)
peer[7, 11]
kt[7, 11]
agrees frontier(size) (§4.1)
peer[7, 11]
kt[7, 11]
 agrees
size-12-advertised-1 log of 12 entries, advertised 1
2 checks
agrees update_view(size, advertised) (§4.2)
peer[1, 3, 7, 11]
kt[1, 3, 7, 11]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-12-advertised-2 log of 12 entries, advertised 2
2 checks
agrees update_view(size, advertised) (§4.2)
peer[3, 7, 11]
kt[3, 7, 11]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-12-advertised-3 log of 12 entries, advertised 3
2 checks
agrees update_view(size, advertised) (§4.2)
peer[3, 7, 11]
kt[3, 7, 11]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-12-advertised-4 log of 12 entries, advertised 4
2 checks
agrees update_view(size, advertised) (§4.2)
peer[7, 11]
kt[7, 11]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-12-advertised-5 log of 12 entries, advertised 5
2 checks
agrees update_view(size, advertised) (§4.2)
peer[5, 7, 11]
kt[5, 7, 11]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-12-advertised-6 log of 12 entries, advertised 6
2 checks
agrees update_view(size, advertised) (§4.2)
peer[7, 11]
kt[7, 11]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-12-advertised-7 log of 12 entries, advertised 7
2 checks
agrees update_view(size, advertised) (§4.2)
peer[7, 11]
kt[7, 11]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-12-advertised-8 log of 12 entries, advertised 8
2 checks
agrees update_view(size, advertised) (§4.2)
peer[]
kt[]
agrees whether the rightmost entry is left unchecked (§4.2)
peertrue
kttrue
 agrees
size-12-advertised-9 log of 12 entries, advertised 9
2 checks
agrees update_view(size, advertised) (§4.2)
peer[9, 11]
kt[9, 11]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-12-advertised-10 log of 12 entries, advertised 10
2 checks
agrees update_view(size, advertised) (§4.2)
peer[11]
kt[11]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-12-advertised-11 log of 12 entries, advertised 11
2 checks
agrees update_view(size, advertised) (§4.2)
peer[11]
kt[11]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-12-advertised-12 log of 12 entries, advertised 12
2 checks
agrees update_view(size, advertised) (§4.2)
peer[]
kt[]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-16-no-previous-view log of 16 entries, no previous view
2 checks
agrees update_view(size, advertised) (§4.2)
peer[15]
kt[15]
agrees frontier(size) (§4.1)
peer[15]
kt[15]
 agrees
size-16-advertised-1 log of 16 entries, advertised 1
2 checks
agrees update_view(size, advertised) (§4.2)
peer[1, 3, 7, 15]
kt[1, 3, 7, 15]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-16-advertised-2 log of 16 entries, advertised 2
2 checks
agrees update_view(size, advertised) (§4.2)
peer[3, 7, 15]
kt[3, 7, 15]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-16-advertised-3 log of 16 entries, advertised 3
2 checks
agrees update_view(size, advertised) (§4.2)
peer[3, 7, 15]
kt[3, 7, 15]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-16-advertised-4 log of 16 entries, advertised 4
2 checks
agrees update_view(size, advertised) (§4.2)
peer[7, 15]
kt[7, 15]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-16-advertised-5 log of 16 entries, advertised 5
2 checks
agrees update_view(size, advertised) (§4.2)
peer[5, 7, 15]
kt[5, 7, 15]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-16-advertised-6 log of 16 entries, advertised 6
2 checks
agrees update_view(size, advertised) (§4.2)
peer[7, 15]
kt[7, 15]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-16-advertised-7 log of 16 entries, advertised 7
2 checks
agrees update_view(size, advertised) (§4.2)
peer[7, 15]
kt[7, 15]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-16-advertised-8 log of 16 entries, advertised 8
2 checks
agrees update_view(size, advertised) (§4.2)
peer[15]
kt[15]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-16-advertised-9 log of 16 entries, advertised 9
2 checks
agrees update_view(size, advertised) (§4.2)
peer[9, 11, 15]
kt[9, 11, 15]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-16-advertised-10 log of 16 entries, advertised 10
2 checks
agrees update_view(size, advertised) (§4.2)
peer[11, 15]
kt[11, 15]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-16-advertised-11 log of 16 entries, advertised 11
2 checks
agrees update_view(size, advertised) (§4.2)
peer[11, 15]
kt[11, 15]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-16-advertised-12 log of 16 entries, advertised 12
2 checks
agrees update_view(size, advertised) (§4.2)
peer[15]
kt[15]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-16-advertised-13 log of 16 entries, advertised 13
2 checks
agrees update_view(size, advertised) (§4.2)
peer[13, 15]
kt[13, 15]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-16-advertised-14 log of 16 entries, advertised 14
2 checks
agrees update_view(size, advertised) (§4.2)
peer[15]
kt[15]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-16-advertised-15 log of 16 entries, advertised 15
2 checks
agrees update_view(size, advertised) (§4.2)
peer[15]
kt[15]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-16-advertised-16 log of 16 entries, advertised 16
2 checks
agrees update_view(size, advertised) (§4.2)
peer[]
kt[]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-17-no-previous-view log of 17 entries, no previous view
2 checks
agrees update_view(size, advertised) (§4.2)
peer[15, 16]
kt[15, 16]
agrees frontier(size) (§4.1)
peer[15, 16]
kt[15, 16]
 agrees
size-17-advertised-1 log of 17 entries, advertised 1
2 checks
agrees update_view(size, advertised) (§4.2)
peer[1, 3, 7, 15, 16]
kt[1, 3, 7, 15, 16]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-17-advertised-2 log of 17 entries, advertised 2
2 checks
agrees update_view(size, advertised) (§4.2)
peer[3, 7, 15, 16]
kt[3, 7, 15, 16]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-17-advertised-3 log of 17 entries, advertised 3
2 checks
agrees update_view(size, advertised) (§4.2)
peer[3, 7, 15, 16]
kt[3, 7, 15, 16]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-17-advertised-4 log of 17 entries, advertised 4
2 checks
agrees update_view(size, advertised) (§4.2)
peer[7, 15, 16]
kt[7, 15, 16]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-17-advertised-5 log of 17 entries, advertised 5
2 checks
agrees update_view(size, advertised) (§4.2)
peer[5, 7, 15, 16]
kt[5, 7, 15, 16]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-17-advertised-6 log of 17 entries, advertised 6
2 checks
agrees update_view(size, advertised) (§4.2)
peer[7, 15, 16]
kt[7, 15, 16]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-17-advertised-7 log of 17 entries, advertised 7
2 checks
agrees update_view(size, advertised) (§4.2)
peer[7, 15, 16]
kt[7, 15, 16]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-17-advertised-8 log of 17 entries, advertised 8
2 checks
agrees update_view(size, advertised) (§4.2)
peer[15, 16]
kt[15, 16]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-17-advertised-9 log of 17 entries, advertised 9
2 checks
agrees update_view(size, advertised) (§4.2)
peer[9, 11, 15, 16]
kt[9, 11, 15, 16]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-17-advertised-10 log of 17 entries, advertised 10
2 checks
agrees update_view(size, advertised) (§4.2)
peer[11, 15, 16]
kt[11, 15, 16]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-17-advertised-11 log of 17 entries, advertised 11
2 checks
agrees update_view(size, advertised) (§4.2)
peer[11, 15, 16]
kt[11, 15, 16]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-17-advertised-12 log of 17 entries, advertised 12
2 checks
agrees update_view(size, advertised) (§4.2)
peer[15, 16]
kt[15, 16]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-17-advertised-13 log of 17 entries, advertised 13
2 checks
agrees update_view(size, advertised) (§4.2)
peer[13, 15, 16]
kt[13, 15, 16]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-17-advertised-14 log of 17 entries, advertised 14
2 checks
agrees update_view(size, advertised) (§4.2)
peer[15, 16]
kt[15, 16]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-17-advertised-15 log of 17 entries, advertised 15
2 checks
agrees update_view(size, advertised) (§4.2)
peer[15, 16]
kt[15, 16]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-17-advertised-16 log of 17 entries, advertised 16
2 checks
agrees update_view(size, advertised) (§4.2)
peer[]
kt[]
agrees whether the rightmost entry is left unchecked (§4.2)
peertrue
kttrue
 agrees
size-17-advertised-17 log of 17 entries, advertised 17
2 checks
agrees update_view(size, advertised) (§4.2)
peer[]
kt[]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-31-no-previous-view log of 31 entries, no previous view
2 checks
agrees update_view(size, advertised) (§4.2)
peer[15, 23, 27, 29, 30]
kt[15, 23, 27, 29, 30]
agrees frontier(size) (§4.1)
peer[15, 23, 27, 29, 30]
kt[15, 23, 27, 29, 30]
 agrees
size-31-advertised-1 log of 31 entries, advertised 1
2 checks
agrees update_view(size, advertised) (§4.2)
peer[1, 3, 7, 15, 23, 27, 29, 30]
kt[1, 3, 7, 15, 23, 27, 29, 30]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-31-advertised-2 log of 31 entries, advertised 2
2 checks
agrees update_view(size, advertised) (§4.2)
peer[3, 7, 15, 23, 27, 29, 30]
kt[3, 7, 15, 23, 27, 29, 30]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-31-advertised-3 log of 31 entries, advertised 3
2 checks
agrees update_view(size, advertised) (§4.2)
peer[3, 7, 15, 23, 27, 29, 30]
kt[3, 7, 15, 23, 27, 29, 30]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-31-advertised-4 log of 31 entries, advertised 4
2 checks
agrees update_view(size, advertised) (§4.2)
peer[7, 15, 23, 27, 29, 30]
kt[7, 15, 23, 27, 29, 30]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-31-advertised-5 log of 31 entries, advertised 5
2 checks
agrees update_view(size, advertised) (§4.2)
peer[5, 7, 15, 23, 27, 29, 30]
kt[5, 7, 15, 23, 27, 29, 30]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-31-advertised-6 log of 31 entries, advertised 6
2 checks
agrees update_view(size, advertised) (§4.2)
peer[7, 15, 23, 27, 29, 30]
kt[7, 15, 23, 27, 29, 30]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-31-advertised-7 log of 31 entries, advertised 7
2 checks
agrees update_view(size, advertised) (§4.2)
peer[7, 15, 23, 27, 29, 30]
kt[7, 15, 23, 27, 29, 30]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-31-advertised-8 log of 31 entries, advertised 8
2 checks
agrees update_view(size, advertised) (§4.2)
peer[15, 23, 27, 29, 30]
kt[15, 23, 27, 29, 30]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-31-advertised-9 log of 31 entries, advertised 9
2 checks
agrees update_view(size, advertised) (§4.2)
peer[9, 11, 15, 23, 27, 29, 30]
kt[9, 11, 15, 23, 27, 29, 30]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-31-advertised-10 log of 31 entries, advertised 10
2 checks
agrees update_view(size, advertised) (§4.2)
peer[11, 15, 23, 27, 29, 30]
kt[11, 15, 23, 27, 29, 30]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-31-advertised-11 log of 31 entries, advertised 11
2 checks
agrees update_view(size, advertised) (§4.2)
peer[11, 15, 23, 27, 29, 30]
kt[11, 15, 23, 27, 29, 30]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-31-advertised-12 log of 31 entries, advertised 12
2 checks
agrees update_view(size, advertised) (§4.2)
peer[15, 23, 27, 29, 30]
kt[15, 23, 27, 29, 30]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-31-advertised-13 log of 31 entries, advertised 13
2 checks
agrees update_view(size, advertised) (§4.2)
peer[13, 15, 23, 27, 29, 30]
kt[13, 15, 23, 27, 29, 30]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-31-advertised-14 log of 31 entries, advertised 14
2 checks
agrees update_view(size, advertised) (§4.2)
peer[15, 23, 27, 29, 30]
kt[15, 23, 27, 29, 30]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-31-advertised-15 log of 31 entries, advertised 15
2 checks
agrees update_view(size, advertised) (§4.2)
peer[15, 23, 27, 29, 30]
kt[15, 23, 27, 29, 30]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-31-advertised-16 log of 31 entries, advertised 16
2 checks
agrees update_view(size, advertised) (§4.2)
peer[]
kt[]
agrees whether the rightmost entry is left unchecked (§4.2)
peertrue
kttrue
 agrees
size-31-advertised-17 log of 31 entries, advertised 17
2 checks
agrees update_view(size, advertised) (§4.2)
peer[17, 19, 23, 27, 29, 30]
kt[17, 19, 23, 27, 29, 30]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-31-advertised-18 log of 31 entries, advertised 18
2 checks
agrees update_view(size, advertised) (§4.2)
peer[19, 23, 27, 29, 30]
kt[19, 23, 27, 29, 30]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-31-advertised-19 log of 31 entries, advertised 19
2 checks
agrees update_view(size, advertised) (§4.2)
peer[19, 23, 27, 29, 30]
kt[19, 23, 27, 29, 30]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-31-advertised-20 log of 31 entries, advertised 20
2 checks
agrees update_view(size, advertised) (§4.2)
peer[23, 27, 29, 30]
kt[23, 27, 29, 30]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-31-advertised-21 log of 31 entries, advertised 21
2 checks
agrees update_view(size, advertised) (§4.2)
peer[21, 23, 27, 29, 30]
kt[21, 23, 27, 29, 30]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-31-advertised-22 log of 31 entries, advertised 22
2 checks
agrees update_view(size, advertised) (§4.2)
peer[23, 27, 29, 30]
kt[23, 27, 29, 30]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-31-advertised-23 log of 31 entries, advertised 23
2 checks
agrees update_view(size, advertised) (§4.2)
peer[23, 27, 29, 30]
kt[23, 27, 29, 30]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-31-advertised-24 log of 31 entries, advertised 24
2 checks
agrees update_view(size, advertised) (§4.2)
peer[]
kt[]
agrees whether the rightmost entry is left unchecked (§4.2)
peertrue
kttrue
 agrees
size-31-advertised-25 log of 31 entries, advertised 25
2 checks
agrees update_view(size, advertised) (§4.2)
peer[25, 27, 29, 30]
kt[25, 27, 29, 30]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-31-advertised-26 log of 31 entries, advertised 26
2 checks
agrees update_view(size, advertised) (§4.2)
peer[27, 29, 30]
kt[27, 29, 30]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-31-advertised-27 log of 31 entries, advertised 27
2 checks
agrees update_view(size, advertised) (§4.2)
peer[27, 29, 30]
kt[27, 29, 30]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-31-advertised-28 log of 31 entries, advertised 28
2 checks
agrees update_view(size, advertised) (§4.2)
peer[]
kt[]
agrees whether the rightmost entry is left unchecked (§4.2)
peertrue
kttrue
 agrees
size-31-advertised-29 log of 31 entries, advertised 29
2 checks
agrees update_view(size, advertised) (§4.2)
peer[29, 30]
kt[29, 30]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-31-advertised-30 log of 31 entries, advertised 30
2 checks
agrees update_view(size, advertised) (§4.2)
peer[]
kt[]
agrees whether the rightmost entry is left unchecked (§4.2)
peertrue
kttrue
 agrees
size-31-advertised-31 log of 31 entries, advertised 31
2 checks
agrees update_view(size, advertised) (§4.2)
peer[]
kt[]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-32-no-previous-view log of 32 entries, no previous view
2 checks
agrees update_view(size, advertised) (§4.2)
peer[31]
kt[31]
agrees frontier(size) (§4.1)
peer[31]
kt[31]
 agrees
size-32-advertised-1 log of 32 entries, advertised 1
2 checks
agrees update_view(size, advertised) (§4.2)
peer[1, 3, 7, 15, 31]
kt[1, 3, 7, 15, 31]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-32-advertised-2 log of 32 entries, advertised 2
2 checks
agrees update_view(size, advertised) (§4.2)
peer[3, 7, 15, 31]
kt[3, 7, 15, 31]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-32-advertised-3 log of 32 entries, advertised 3
2 checks
agrees update_view(size, advertised) (§4.2)
peer[3, 7, 15, 31]
kt[3, 7, 15, 31]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-32-advertised-4 log of 32 entries, advertised 4
2 checks
agrees update_view(size, advertised) (§4.2)
peer[7, 15, 31]
kt[7, 15, 31]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-32-advertised-5 log of 32 entries, advertised 5
2 checks
agrees update_view(size, advertised) (§4.2)
peer[5, 7, 15, 31]
kt[5, 7, 15, 31]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-32-advertised-6 log of 32 entries, advertised 6
2 checks
agrees update_view(size, advertised) (§4.2)
peer[7, 15, 31]
kt[7, 15, 31]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-32-advertised-7 log of 32 entries, advertised 7
2 checks
agrees update_view(size, advertised) (§4.2)
peer[7, 15, 31]
kt[7, 15, 31]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-32-advertised-8 log of 32 entries, advertised 8
2 checks
agrees update_view(size, advertised) (§4.2)
peer[15, 31]
kt[15, 31]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-32-advertised-9 log of 32 entries, advertised 9
2 checks
agrees update_view(size, advertised) (§4.2)
peer[9, 11, 15, 31]
kt[9, 11, 15, 31]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-32-advertised-10 log of 32 entries, advertised 10
2 checks
agrees update_view(size, advertised) (§4.2)
peer[11, 15, 31]
kt[11, 15, 31]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-32-advertised-11 log of 32 entries, advertised 11
2 checks
agrees update_view(size, advertised) (§4.2)
peer[11, 15, 31]
kt[11, 15, 31]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-32-advertised-12 log of 32 entries, advertised 12
2 checks
agrees update_view(size, advertised) (§4.2)
peer[15, 31]
kt[15, 31]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-32-advertised-13 log of 32 entries, advertised 13
2 checks
agrees update_view(size, advertised) (§4.2)
peer[13, 15, 31]
kt[13, 15, 31]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-32-advertised-14 log of 32 entries, advertised 14
2 checks
agrees update_view(size, advertised) (§4.2)
peer[15, 31]
kt[15, 31]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-32-advertised-15 log of 32 entries, advertised 15
2 checks
agrees update_view(size, advertised) (§4.2)
peer[15, 31]
kt[15, 31]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-32-advertised-16 log of 32 entries, advertised 16
2 checks
agrees update_view(size, advertised) (§4.2)
peer[31]
kt[31]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-32-advertised-17 log of 32 entries, advertised 17
2 checks
agrees update_view(size, advertised) (§4.2)
peer[17, 19, 23, 31]
kt[17, 19, 23, 31]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-32-advertised-18 log of 32 entries, advertised 18
2 checks
agrees update_view(size, advertised) (§4.2)
peer[19, 23, 31]
kt[19, 23, 31]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-32-advertised-19 log of 32 entries, advertised 19
2 checks
agrees update_view(size, advertised) (§4.2)
peer[19, 23, 31]
kt[19, 23, 31]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-32-advertised-20 log of 32 entries, advertised 20
2 checks
agrees update_view(size, advertised) (§4.2)
peer[23, 31]
kt[23, 31]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-32-advertised-21 log of 32 entries, advertised 21
2 checks
agrees update_view(size, advertised) (§4.2)
peer[21, 23, 31]
kt[21, 23, 31]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-32-advertised-22 log of 32 entries, advertised 22
2 checks
agrees update_view(size, advertised) (§4.2)
peer[23, 31]
kt[23, 31]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-32-advertised-23 log of 32 entries, advertised 23
2 checks
agrees update_view(size, advertised) (§4.2)
peer[23, 31]
kt[23, 31]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-32-advertised-24 log of 32 entries, advertised 24
2 checks
agrees update_view(size, advertised) (§4.2)
peer[31]
kt[31]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-32-advertised-25 log of 32 entries, advertised 25
2 checks
agrees update_view(size, advertised) (§4.2)
peer[25, 27, 31]
kt[25, 27, 31]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-32-advertised-26 log of 32 entries, advertised 26
2 checks
agrees update_view(size, advertised) (§4.2)
peer[27, 31]
kt[27, 31]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-32-advertised-27 log of 32 entries, advertised 27
2 checks
agrees update_view(size, advertised) (§4.2)
peer[27, 31]
kt[27, 31]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-32-advertised-28 log of 32 entries, advertised 28
2 checks
agrees update_view(size, advertised) (§4.2)
peer[31]
kt[31]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-32-advertised-29 log of 32 entries, advertised 29
2 checks
agrees update_view(size, advertised) (§4.2)
peer[29, 31]
kt[29, 31]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-32-advertised-30 log of 32 entries, advertised 30
2 checks
agrees update_view(size, advertised) (§4.2)
peer[31]
kt[31]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-32-advertised-31 log of 32 entries, advertised 31
2 checks
agrees update_view(size, advertised) (§4.2)
peer[31]
kt[31]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-32-advertised-32 log of 32 entries, advertised 32
2 checks
agrees update_view(size, advertised) (§4.2)
peer[]
kt[]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-50-no-previous-view log of 50 entries, no previous view
2 checks
agrees update_view(size, advertised) (§4.2)
peer[31, 47, 49]
kt[31, 47, 49]
agrees frontier(size) (§4.1)
peer[31, 47, 49]
kt[31, 47, 49]
 agrees
size-50-advertised-1 log of 50 entries, advertised 1
2 checks
agrees update_view(size, advertised) (§4.2)
peer[1, 3, 7, 15, 31, 47, 49]
kt[1, 3, 7, 15, 31, 47, 49]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-50-advertised-25 log of 50 entries, advertised 25
2 checks
agrees update_view(size, advertised) (§4.2)
peer[25, 27, 31, 47, 49]
kt[25, 27, 31, 47, 49]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-50-advertised-32 log of 50 entries, advertised 32
2 checks
agrees update_view(size, advertised) (§4.2)
peer[]
kt[]
agrees whether the rightmost entry is left unchecked (§4.2)
peertrue
kttrue
 agrees
size-50-advertised-49 log of 50 entries, advertised 49
2 checks
agrees update_view(size, advertised) (§4.2)
peer[49]
kt[49]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-50-advertised-50 log of 50 entries, advertised 50
2 checks
agrees update_view(size, advertised) (§4.2)
peer[]
kt[]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-64-no-previous-view log of 64 entries, no previous view
2 checks
agrees update_view(size, advertised) (§4.2)
peer[63]
kt[63]
agrees frontier(size) (§4.1)
peer[63]
kt[63]
 agrees
size-64-advertised-1 log of 64 entries, advertised 1
2 checks
agrees update_view(size, advertised) (§4.2)
peer[1, 3, 7, 15, 31, 63]
kt[1, 3, 7, 15, 31, 63]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-64-advertised-32 log of 64 entries, advertised 32
2 checks
agrees update_view(size, advertised) (§4.2)
peer[63]
kt[63]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-64-advertised-63 log of 64 entries, advertised 63
2 checks
agrees update_view(size, advertised) (§4.2)
peer[63]
kt[63]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-64-advertised-64 log of 64 entries, advertised 64
2 checks
agrees update_view(size, advertised) (§4.2)
peer[]
kt[]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-100-no-previous-view log of 100 entries, no previous view
2 checks
agrees update_view(size, advertised) (§4.2)
peer[63, 95, 99]
kt[63, 95, 99]
agrees frontier(size) (§4.1)
peer[63, 95, 99]
kt[63, 95, 99]
 agrees
size-100-advertised-1 log of 100 entries, advertised 1
2 checks
agrees update_view(size, advertised) (§4.2)
peer[1, 3, 7, 15, 31, 63, 95, 99]
kt[1, 3, 7, 15, 31, 63, 95, 99]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-100-advertised-50 log of 100 entries, advertised 50
2 checks
agrees update_view(size, advertised) (§4.2)
peer[51, 55, 63, 95, 99]
kt[51, 55, 63, 95, 99]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-100-advertised-64 log of 100 entries, advertised 64
2 checks
agrees update_view(size, advertised) (§4.2)
peer[]
kt[]
agrees whether the rightmost entry is left unchecked (§4.2)
peertrue
kttrue
 agrees
size-100-advertised-99 log of 100 entries, advertised 99
2 checks
agrees update_view(size, advertised) (§4.2)
peer[99]
kt[99]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-100-advertised-100 log of 100 entries, advertised 100
2 checks
agrees update_view(size, advertised) (§4.2)
peer[]
kt[]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-1000-no-previous-view log of 1000 entries, no previous view
2 checks
agrees update_view(size, advertised) (§4.2)
peer[511, 767, 895, 959, 991, 999]
kt[511, 767, 895, 959, 991, 999]
agrees frontier(size) (§4.1)
peer[511, 767, 895, 959, 991, 999]
kt[511, 767, 895, 959, 991, 999]
 agrees
size-1000-advertised-1 log of 1000 entries, advertised 1
2 checks
agrees update_view(size, advertised) (§4.2)
peer[1, 3, 7, 15, 31, 63, 127, 255, 511, 767, 895, 959, 991, 999]
kt[1, 3, 7, 15, 31, 63, 127, 255, 511, 767, 895, 959, 991, 999]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-1000-advertised-500 log of 1000 entries, advertised 500
2 checks
agrees update_view(size, advertised) (§4.2)
peer[503, 511, 767, 895, 959, 991, 999]
kt[503, 511, 767, 895, 959, 991, 999]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-1000-advertised-512 log of 1000 entries, advertised 512
2 checks
agrees update_view(size, advertised) (§4.2)
peer[]
kt[]
agrees whether the rightmost entry is left unchecked (§4.2)
peertrue
kttrue
 agrees
size-1000-advertised-999 log of 1000 entries, advertised 999
2 checks
agrees update_view(size, advertised) (§4.2)
peer[999]
kt[999]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees
size-1000-advertised-1000 log of 1000 entries, advertised 1000
2 checks
agrees update_view(size, advertised) (§4.2)
peer[]
kt[]
agrees whether the rightmost entry is left unchecked (§4.2)
peerfalse
ktfalse
 agrees

Distinguished log entries §6.1

Vectors: distinguished.json · oracle: katie @ 00da52541f6a · 42 cases, 84 checks agrees

CaseInputChecksResult
evenly-size-0 size 0, window 8000 · no distinguished entries · peer read 0 timestamps
2 checks
agrees rightmost distinguished log entry (§6.1)
peernone
ktnone
agrees rightmost distinguished entry left of the last one (§6.1)
peernone
ktnone
 agrees
evenly-size-1 size 1, window 8000 · no distinguished entries · peer read 1 timestamps
2 checks
agrees rightmost distinguished log entry (§6.1)
peernone
ktnone
agrees rightmost distinguished entry left of the last one (§6.1)
peernone
ktnone
 agrees
evenly-size-2 size 2, window 8000 · no distinguished entries · peer read 1 timestamps
2 checks
agrees rightmost distinguished log entry (§6.1)
peernone
ktnone
agrees rightmost distinguished entry left of the last one (§6.1)
peernone
ktnone
 agrees
evenly-size-3 size 3, window 8000 · no distinguished entries · peer read 1 timestamps
2 checks
agrees rightmost distinguished log entry (§6.1)
peernone
ktnone
agrees rightmost distinguished entry left of the last one (§6.1)
peernone
ktnone
 agrees
evenly-size-4 size 4, window 8000 · no distinguished entries · peer read 1 timestamps
2 checks
agrees rightmost distinguished log entry (§6.1)
peernone
ktnone
agrees rightmost distinguished entry left of the last one (§6.1)
peernone
ktnone
 agrees
evenly-size-5 size 5, window 8000 · no distinguished entries · peer read 1 timestamps
2 checks
agrees rightmost distinguished log entry (§6.1)
peernone
ktnone
agrees rightmost distinguished entry left of the last one (§6.1)
peernone
ktnone
 agrees
evenly-size-7 size 7, window 8000 · no distinguished entries · peer read 1 timestamps
2 checks
agrees rightmost distinguished log entry (§6.1)
peernone
ktnone
agrees rightmost distinguished entry left of the last one (§6.1)
peernone
ktnone
 agrees
evenly-size-8 size 8, window 8000 · no distinguished entries · peer read 1 timestamps
2 checks
agrees rightmost distinguished log entry (§6.1)
peernone
ktnone
agrees rightmost distinguished entry left of the last one (§6.1)
peernone
ktnone
 agrees
evenly-size-9 size 9, window 8000 · 1 distinguished: [7] · peer read 2 timestamps
2 checks
agrees rightmost distinguished log entry (§6.1)
peer7
kt7
agrees rightmost distinguished entry left of the last one (§6.1)
peer7
kt7
 agrees
evenly-size-15 size 15, window 8000 · 1 distinguished: [7] · peer read 2 timestamps
2 checks
agrees rightmost distinguished log entry (§6.1)
peer7
kt7
agrees rightmost distinguished entry left of the last one (§6.1)
peer7
kt7
 agrees
evenly-size-16 size 16, window 8000 · 3 distinguished: [7, 11, 15] · peer read 3 timestamps
2 checks
agrees rightmost distinguished log entry (§6.1)
peer15
kt15
agrees rightmost distinguished entry left of the last one (§6.1)
peer11
kt11
 agrees
evenly-size-17 size 17, window 8000 · 3 distinguished: [7, 11, 15] · peer read 2 timestamps
2 checks
agrees rightmost distinguished log entry (§6.1)
peer15
kt15
agrees rightmost distinguished entry left of the last one (§6.1)
peer15
kt15
 agrees
evenly-size-31 size 31, window 8000 · 5 distinguished: [7, 11, 15, 19, 23] · peer read 3 timestamps
2 checks
agrees rightmost distinguished log entry (§6.1)
peer23
kt23
agrees rightmost distinguished entry left of the last one (§6.1)
peer23
kt23
 agrees
evenly-size-32 size 32, window 8000 · 7 distinguished: [7, 11, 15, 19, 23, 27, 31] · peer read 4 timestamps
2 checks
agrees rightmost distinguished log entry (§6.1)
peer31
kt31
agrees rightmost distinguished entry left of the last one (§6.1)
peer27
kt27
 agrees
evenly-size-33 size 33, window 8000 · 7 distinguished: [7, 11, 15, 19, 23, 27, 31] · peer read 2 timestamps
2 checks
agrees rightmost distinguished log entry (§6.1)
peer31
kt31
agrees rightmost distinguished entry left of the last one (§6.1)
peer31
kt31
 agrees
evenly-size-63 size 63, window 8000 · 13 distinguished: [7, 11, 15, 19, 23, 27, 31, 35] · peer read 4 timestamps
2 checks
agrees rightmost distinguished log entry (§6.1)
peer55
kt55
agrees rightmost distinguished entry left of the last one (§6.1)
peer55
kt55
 agrees
evenly-size-64 size 64, window 8000 · 15 distinguished: [7, 11, 15, 19, 23, 27, 31, 35] · peer read 5 timestamps
2 checks
agrees rightmost distinguished log entry (§6.1)
peer63
kt63
agrees rightmost distinguished entry left of the last one (§6.1)
peer59
kt59
 agrees
evenly-size-65 size 65, window 8000 · 15 distinguished: [7, 11, 15, 19, 23, 27, 31, 35] · peer read 2 timestamps
2 checks
agrees rightmost distinguished log entry (§6.1)
peer63
kt63
agrees rightmost distinguished entry left of the last one (§6.1)
peer63
kt63
 agrees
evenly-size-100 size 100, window 8000 · 23 distinguished: [7, 11, 15, 19, 23, 27, 31, 35] · peer read 3 timestamps
2 checks
agrees rightmost distinguished log entry (§6.1)
peer95
kt95
agrees rightmost distinguished entry left of the last one (§6.1)
peer95
kt95
 agrees
evenly-size-127 size 127, window 8000 · 29 distinguished: [7, 11, 15, 19, 23, 27, 31, 35] · peer read 5 timestamps
2 checks
agrees rightmost distinguished log entry (§6.1)
peer119
kt119
agrees rightmost distinguished entry left of the last one (§6.1)
peer119
kt119
 agrees
evenly-size-128 size 128, window 8000 · 31 distinguished: [7, 11, 15, 19, 23, 27, 31, 35] · peer read 6 timestamps
2 checks
agrees rightmost distinguished log entry (§6.1)
peer127
kt127
agrees rightmost distinguished entry left of the last one (§6.1)
peer123
kt123
 agrees
evenly-size-129 size 129, window 8000 · 31 distinguished: [7, 11, 15, 19, 23, 27, 31, 35] · peer read 2 timestamps
2 checks
agrees rightmost distinguished log entry (§6.1)
peer127
kt127
agrees rightmost distinguished entry left of the last one (§6.1)
peer127
kt127
 agrees
evenly-size-200 size 200, window 8000 · 49 distinguished: [7, 11, 15, 19, 23, 27, 31, 35] · peer read 4 timestamps
2 checks
agrees rightmost distinguished log entry (§6.1)
peer199
kt199
agrees rightmost distinguished entry left of the last one (§6.1)
peer195
kt195
 agrees
evenly-size-255 size 255, window 8000 · 61 distinguished: [7, 11, 15, 19, 23, 27, 31, 35] · peer read 6 timestamps
2 checks
agrees rightmost distinguished log entry (§6.1)
peer247
kt247
agrees rightmost distinguished entry left of the last one (§6.1)
peer247
kt247
 agrees
evenly-size-256 size 256, window 8000 · 63 distinguished: [7, 11, 15, 19, 23, 27, 31, 35] · peer read 7 timestamps
2 checks
agrees rightmost distinguished log entry (§6.1)
peer255
kt255
agrees rightmost distinguished entry left of the last one (§6.1)
peer251
kt251
 agrees
evenly-size-257 size 257, window 8000 · 63 distinguished: [7, 11, 15, 19, 23, 27, 31, 35] · peer read 2 timestamps
2 checks
agrees rightmost distinguished log entry (§6.1)
peer255
kt255
agrees rightmost distinguished entry left of the last one (§6.1)
peer255
kt255
 agrees
evenly-size-1000 size 1000, window 8000 · 249 distinguished: [7, 11, 15, 19, 23, 27, 31, 35] · peer read 7 timestamps
2 checks
agrees rightmost distinguished log entry (§6.1)
peer999
kt999
agrees rightmost distinguished entry left of the last one (§6.1)
peer995
kt995
 agrees
window-0-size-100 size 100, window 0 · 100 distinguished: [0, 1, 2, 3, 4, 5, 6, 7] · peer read 4 timestamps
2 checks
agrees rightmost distinguished log entry (§6.1)
peer99
kt99
agrees rightmost distinguished entry left of the last one (§6.1)
peer98
kt98
 agrees
window-1-size-100 size 100, window 1 · 100 distinguished: [0, 1, 2, 3, 4, 5, 6, 7] · peer read 4 timestamps
2 checks
agrees rightmost distinguished log entry (§6.1)
peer99
kt99
agrees rightmost distinguished entry left of the last one (§6.1)
peer98
kt98
 agrees
window-1000-size-100 size 100, window 1000 · 100 distinguished: [0, 1, 2, 3, 4, 5, 6, 7] · peer read 4 timestamps
2 checks
agrees rightmost distinguished log entry (§6.1)
peer99
kt99
agrees rightmost distinguished entry left of the last one (§6.1)
peer98
kt98
 agrees
window-2000-size-100 size 100, window 2000 · 99 distinguished: [1, 2, 3, 4, 5, 6, 7, 8] · peer read 4 timestamps
2 checks
agrees rightmost distinguished log entry (§6.1)
peer99
kt99
agrees rightmost distinguished entry left of the last one (§6.1)
peer98
kt98
 agrees
window-8000-size-100 size 100, window 8000 · 23 distinguished: [7, 11, 15, 19, 23, 27, 31, 35] · peer read 3 timestamps
2 checks
agrees rightmost distinguished log entry (§6.1)
peer95
kt95
agrees rightmost distinguished entry left of the last one (§6.1)
peer95
kt95
 agrees
window-32000-size-100 size 100, window 32000 · 5 distinguished: [31, 47, 63, 79, 95] · peer read 3 timestamps
2 checks
agrees rightmost distinguished log entry (§6.1)
peer95
kt95
agrees rightmost distinguished entry left of the last one (§6.1)
peer95
kt95
 agrees
window-99000-size-100 size 100, window 99000 · 1 distinguished: [63] · peer read 2 timestamps
2 checks
agrees rightmost distinguished log entry (§6.1)
peer63
kt63
agrees rightmost distinguished entry left of the last one (§6.1)
peer63
kt63
 agrees
window-100000-size-100 size 100, window 100000 · no distinguished entries · peer read 1 timestamps
2 checks
agrees rightmost distinguished log entry (§6.1)
peernone
ktnone
agrees rightmost distinguished entry left of the last one (§6.1)
peernone
ktnone
 agrees
window-1099511627776-size-100 size 100, window 1099511627776 · no distinguished entries · peer read 1 timestamps
2 checks
agrees rightmost distinguished log entry (§6.1)
peernone
ktnone
agrees rightmost distinguished entry left of the last one (§6.1)
peernone
ktnone
 agrees
bursty-size-33 size 33, window 5000 · no distinguished entries · peer read 1 timestamps
2 checks
agrees rightmost distinguished log entry (§6.1)
peernone
ktnone
agrees rightmost distinguished entry left of the last one (§6.1)
peernone
ktnone
 agrees
bursty-size-40 size 40, window 5000 · 9 distinguished: [31, 32, 33, 34, 35, 36, 37, 38] · peer read 4 timestamps
2 checks
agrees rightmost distinguished log entry (§6.1)
peer39
kt39
agrees rightmost distinguished entry left of the last one (§6.1)
peer38
kt38
 agrees
bursty-size-64 size 64, window 5000 · 33 distinguished: [31, 32, 33, 34, 35, 36, 37, 38] · peer read 6 timestamps
2 checks
agrees rightmost distinguished log entry (§6.1)
peer63
kt63
agrees rightmost distinguished entry left of the last one (§6.1)
peer62
kt62
 agrees
bursty-size-100 size 100, window 5000 · 69 distinguished: [31, 32, 33, 34, 35, 36, 37, 38] · peer read 4 timestamps
2 checks
agrees rightmost distinguished log entry (§6.1)
peer99
kt99
agrees rightmost distinguished entry left of the last one (§6.1)
peer98
kt98
 agrees
simultaneous-window-0 size 50, window 0 · 50 distinguished: [0, 1, 2, 3, 4, 5, 6, 7] · peer read 3 timestamps
2 checks
agrees rightmost distinguished log entry (§6.1)
peer49
kt49
agrees rightmost distinguished entry left of the last one (§6.1)
peer48
kt48
 agrees
simultaneous-window-1 size 50, window 1 · 6 distinguished: [0, 1, 3, 7, 15, 31] · peer read 2 timestamps
2 checks
agrees rightmost distinguished log entry (§6.1)
peer31
kt31
agrees rightmost distinguished entry left of the last one (§6.1)
peer31
kt31
 agrees

VRF §11.7

Vectors: vrf.json · oracle: katie @ 00da52541f6a · cipher suite 0x0002 KT_128_SHA256_Ed25519 · 11 cases, 52 checks agrees

1 of these cases assert a refusal: the peer says the input must be rejected, and accepting it would be the failure.

CaseInputChecksResult
empty-label-version-0 label 0 bytes, version 0
5 checks
agrees public key derived from the seed (RFC 8032 §5.1.5)
peer0d7550754e0800a5d237eef5826035766b9b3e5a15868a940ab289958788e3b0
kt0d7550754e0800a5d237eef5826035766b9b3e5a15868a940ab289958788e3b0
agrees VrfInput encoding is alpha_string (§2.1, §11.7)
peer0000000000
kt0000000000
agrees VRF proof, VRF.Np = 80 bytes (§11.7, RFC 9381 §5.1)
peer5d60ea6b32e37c0c17c0db8be2be17d2ff6d7a73a59c936364c6efbd4c53beca0f72bc5a8774043ce4845e2b3d2329f812bb68227fff369befd8393b158cad982a46f6cfc89cdaabae087a558d61770e
kt5d60ea6b32e37c0c17c0db8be2be17d2ff6d7a73a59c936364c6efbd4c53beca0f72bc5a8774043ce4845e2b3d2329f812bb68227fff369befd8393b158cad982a46f6cfc89cdaabae087a558d61770e
agrees VRF output, truncated to VRF.Nh = 32 bytes (§17.1)
peer68e41c4842588636ccbec5d7fb7b2fa7a5a80f50bcd9380b6845601c92511a75
kt68e41c4842588636ccbec5d7fb7b2fa7a5a80f50bcd9380b6845601c92511a75
agrees verifying the peer's proof yields the peer's search key (§11.7)
peer68e41c4842588636ccbec5d7fb7b2fa7a5a80f50bcd9380b6845601c92511a75
kt68e41c4842588636ccbec5d7fb7b2fa7a5a80f50bcd9380b6845601c92511a75
 agrees
simple label 17 bytes, version 0
5 checks
agrees public key derived from the seed (RFC 8032 §5.1.5)
peer0d7550754e0800a5d237eef5826035766b9b3e5a15868a940ab289958788e3b0
kt0d7550754e0800a5d237eef5826035766b9b3e5a15868a940ab289958788e3b0
agrees VrfInput encoding is alpha_string (§2.1, §11.7)
peer11616c696365406578616d706c652e636f6d00000000
kt11616c696365406578616d706c652e636f6d00000000
agrees VRF proof, VRF.Np = 80 bytes (§11.7, RFC 9381 §5.1)
peerced7ea2e063e5e55db04fc17c64cbd6e1a58f6fe3fa64c0afd66e0315f3210f0c1e775f9cff0173344e4e19fc301c504f3dcb20a83615a7ca09ed75e32a2f7e47aa42b0b3d193c28d5839e488ac19009
ktced7ea2e063e5e55db04fc17c64cbd6e1a58f6fe3fa64c0afd66e0315f3210f0c1e775f9cff0173344e4e19fc301c504f3dcb20a83615a7ca09ed75e32a2f7e47aa42b0b3d193c28d5839e488ac19009
agrees VRF output, truncated to VRF.Nh = 32 bytes (§17.1)
peera0ed13f449810f5a5dfecb58c287f3fbe1f78bf70460c790a4f8d04616d07265
kta0ed13f449810f5a5dfecb58c287f3fbe1f78bf70460c790a4f8d04616d07265
agrees verifying the peer's proof yields the peer's search key (§11.7)
peera0ed13f449810f5a5dfecb58c287f3fbe1f78bf70460c790a4f8d04616d07265
kta0ed13f449810f5a5dfecb58c287f3fbe1f78bf70460c790a4f8d04616d07265
 agrees
version-1 label 17 bytes, version 1
5 checks
agrees public key derived from the seed (RFC 8032 §5.1.5)
peer0d7550754e0800a5d237eef5826035766b9b3e5a15868a940ab289958788e3b0
kt0d7550754e0800a5d237eef5826035766b9b3e5a15868a940ab289958788e3b0
agrees VrfInput encoding is alpha_string (§2.1, §11.7)
peer11616c696365406578616d706c652e636f6d00000001
kt11616c696365406578616d706c652e636f6d00000001
agrees VRF proof, VRF.Np = 80 bytes (§11.7, RFC 9381 §5.1)
peer15f37fbdac790c1db7bb81b217a570c223d19a605e3254b5f9efe3c4210021c2d1660a6b0d77a1eda77580711ad1c125d1f9159a6e645b06d9f2008d05d80f191b45196d45b0a6c75660a352e4159301
kt15f37fbdac790c1db7bb81b217a570c223d19a605e3254b5f9efe3c4210021c2d1660a6b0d77a1eda77580711ad1c125d1f9159a6e645b06d9f2008d05d80f191b45196d45b0a6c75660a352e4159301
agrees VRF output, truncated to VRF.Nh = 32 bytes (§17.1)
peer2b9527bc6c8f593ed334fa9827263db867a92b265373192f7a92c87b93086cab
kt2b9527bc6c8f593ed334fa9827263db867a92b265373192f7a92c87b93086cab
agrees verifying the peer's proof yields the peer's search key (§11.7)
peer2b9527bc6c8f593ed334fa9827263db867a92b265373192f7a92c87b93086cab
kt2b9527bc6c8f593ed334fa9827263db867a92b265373192f7a92c87b93086cab
 agrees
version-2 label 17 bytes, version 2
5 checks
agrees public key derived from the seed (RFC 8032 §5.1.5)
peer0d7550754e0800a5d237eef5826035766b9b3e5a15868a940ab289958788e3b0
kt0d7550754e0800a5d237eef5826035766b9b3e5a15868a940ab289958788e3b0
agrees VrfInput encoding is alpha_string (§2.1, §11.7)
peer11616c696365406578616d706c652e636f6d00000002
kt11616c696365406578616d706c652e636f6d00000002
agrees VRF proof, VRF.Np = 80 bytes (§11.7, RFC 9381 §5.1)
peer0cc0b270ae0972346c28bd45dc4fea92a5940ae69e60f191e8ee18db0ee028f8ab4a7e009b9e699f9c44dc00fa0995a1597277add494563956dd639894ba950df5b72afd800c0f77859576e91776410f
kt0cc0b270ae0972346c28bd45dc4fea92a5940ae69e60f191e8ee18db0ee028f8ab4a7e009b9e699f9c44dc00fa0995a1597277add494563956dd639894ba950df5b72afd800c0f77859576e91776410f
agrees VRF output, truncated to VRF.Nh = 32 bytes (§17.1)
peerd41133edf52862910e01cc6bbc889cb325e9c365e42020a2ab778f47fc8b9736
ktd41133edf52862910e01cc6bbc889cb325e9c365e42020a2ab778f47fc8b9736
agrees verifying the peer's proof yields the peer's search key (§11.7)
peerd41133edf52862910e01cc6bbc889cb325e9c365e42020a2ab778f47fc8b9736
ktd41133edf52862910e01cc6bbc889cb325e9c365e42020a2ab778f47fc8b9736
 agrees
version-max label 17 bytes, version 4294967295
5 checks
agrees public key derived from the seed (RFC 8032 §5.1.5)
peer0d7550754e0800a5d237eef5826035766b9b3e5a15868a940ab289958788e3b0
kt0d7550754e0800a5d237eef5826035766b9b3e5a15868a940ab289958788e3b0
agrees VrfInput encoding is alpha_string (§2.1, §11.7)
peer11616c696365406578616d706c652e636f6dffffffff
kt11616c696365406578616d706c652e636f6dffffffff
agrees VRF proof, VRF.Np = 80 bytes (§11.7, RFC 9381 §5.1)
peerf544bbc548e86ba0af637cf0b0c558ec61fa8beae12343a3fcec0192218f0fdec481c52522a69ba815de73540b9a8f1b0c511fee31eeefa060731839400adf717c55538193e22780e60ccaae96f0f005
ktf544bbc548e86ba0af637cf0b0c558ec61fa8beae12343a3fcec0192218f0fdec481c52522a69ba815de73540b9a8f1b0c511fee31eeefa060731839400adf717c55538193e22780e60ccaae96f0f005
agrees VRF output, truncated to VRF.Nh = 32 bytes (§17.1)
peerac4cf914054dad97c5f1b73a1252efacd3a214823f7bf95c4579899598197ba5
ktac4cf914054dad97c5f1b73a1252efacd3a214823f7bf95c4579899598197ba5
agrees verifying the peer's proof yields the peer's search key (§11.7)
peerac4cf914054dad97c5f1b73a1252efacd3a214823f7bf95c4579899598197ba5
ktac4cf914054dad97c5f1b73a1252efacd3a214823f7bf95c4579899598197ba5
 agrees
other-label-same-version label 15 bytes, version 0
5 checks
agrees public key derived from the seed (RFC 8032 §5.1.5)
peer0d7550754e0800a5d237eef5826035766b9b3e5a15868a940ab289958788e3b0
kt0d7550754e0800a5d237eef5826035766b9b3e5a15868a940ab289958788e3b0
agrees VrfInput encoding is alpha_string (§2.1, §11.7)
peer0f626f62406578616d706c652e636f6d00000000
kt0f626f62406578616d706c652e636f6d00000000
agrees VRF proof, VRF.Np = 80 bytes (§11.7, RFC 9381 §5.1)
peer0adf701cbcaebea36d56b107df988427bebb498e1682812381e2bbc444e68d13e4ffc8537f5c2cd77079b994fff2ee87e94ac6ed3ab4ba1bc2d57fa0b4af973933d66796a4d7fd815d62724e3134e004
kt0adf701cbcaebea36d56b107df988427bebb498e1682812381e2bbc444e68d13e4ffc8537f5c2cd77079b994fff2ee87e94ac6ed3ab4ba1bc2d57fa0b4af973933d66796a4d7fd815d62724e3134e004
agrees VRF output, truncated to VRF.Nh = 32 bytes (§17.1)
peer47f86687b9b6bc7baa46c76baccaeafab521aa1cb5716907e34318ec55af9b41
kt47f86687b9b6bc7baa46c76baccaeafab521aa1cb5716907e34318ec55af9b41
agrees verifying the peer's proof yields the peer's search key (§11.7)
peer47f86687b9b6bc7baa46c76baccaeafab521aa1cb5716907e34318ec55af9b41
kt47f86687b9b6bc7baa46c76baccaeafab521aa1cb5716907e34318ec55af9b41
 agrees
label-a label 1 bytes, version 1644167168
5 checks
agrees public key derived from the seed (RFC 8032 §5.1.5)
peer0d7550754e0800a5d237eef5826035766b9b3e5a15868a940ab289958788e3b0
kt0d7550754e0800a5d237eef5826035766b9b3e5a15868a940ab289958788e3b0
agrees VrfInput encoding is alpha_string (§2.1, §11.7)
peer016162000000
kt016162000000
agrees VRF proof, VRF.Np = 80 bytes (§11.7, RFC 9381 §5.1)
peer3c761d3e059a863d3b8f7ca090977f5f2805a05b00ac4bd3a5deb5c9be5b6fa62023277653f427f7ac78085859f60c07d1b210b4b75f4cfb6dd1ab6dabe4bf7179be059769b1e2d3dbe5df797d6a9e0f
kt3c761d3e059a863d3b8f7ca090977f5f2805a05b00ac4bd3a5deb5c9be5b6fa62023277653f427f7ac78085859f60c07d1b210b4b75f4cfb6dd1ab6dabe4bf7179be059769b1e2d3dbe5df797d6a9e0f
agrees VRF output, truncated to VRF.Nh = 32 bytes (§17.1)
peercff879645fc043ddcef04bfaae0a531713fc06200f493c5524042d6ea765eb2c
ktcff879645fc043ddcef04bfaae0a531713fc06200f493c5524042d6ea765eb2c
agrees verifying the peer's proof yields the peer's search key (§11.7)
peercff879645fc043ddcef04bfaae0a531713fc06200f493c5524042d6ea765eb2c
ktcff879645fc043ddcef04bfaae0a531713fc06200f493c5524042d6ea765eb2c
 agrees
label-ab label 2 bytes, version 0
5 checks
agrees public key derived from the seed (RFC 8032 §5.1.5)
peer0d7550754e0800a5d237eef5826035766b9b3e5a15868a940ab289958788e3b0
kt0d7550754e0800a5d237eef5826035766b9b3e5a15868a940ab289958788e3b0
agrees VrfInput encoding is alpha_string (§2.1, §11.7)
peer02616200000000
kt02616200000000
agrees VRF proof, VRF.Np = 80 bytes (§11.7, RFC 9381 §5.1)
peer41817558737906e1b0e3a7cac280e1b2e97891ecffc914da3002def6e6de216459b33e4dee419b49d1f3f4180fdb65e963dd66523804da0db153c5b67be8c534e565cd4f499fc4d7f70b679a546e920d
kt41817558737906e1b0e3a7cac280e1b2e97891ecffc914da3002def6e6de216459b33e4dee419b49d1f3f4180fdb65e963dd66523804da0db153c5b67be8c534e565cd4f499fc4d7f70b679a546e920d
agrees VRF output, truncated to VRF.Nh = 32 bytes (§17.1)
peercf0e6ce9cbb206b3c55dac85332d68ff723f31f1856332dafb4003cad6b837e7
ktcf0e6ce9cbb206b3c55dac85332d68ff723f31f1856332dafb4003cad6b837e7
agrees verifying the peer's proof yields the peer's search key (§11.7)
peercf0e6ce9cbb206b3c55dac85332d68ff723f31f1856332dafb4003cad6b837e7
ktcf0e6ce9cbb206b3c55dac85332d68ff723f31f1856332dafb4003cad6b837e7
 agrees
label-max-len label 255 bytes, version 7
5 checks
agrees public key derived from the seed (RFC 8032 §5.1.5)
peer0d7550754e0800a5d237eef5826035766b9b3e5a15868a940ab289958788e3b0
kt0d7550754e0800a5d237eef5826035766b9b3e5a15868a940ab289958788e3b0
agrees VrfInput encoding is alpha_string (§2.1, §11.7)
peerff61616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616100000007
ktff61616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616100000007
agrees VRF proof, VRF.Np = 80 bytes (§11.7, RFC 9381 §5.1)
peercc8c045e0e5b773870e880137b4e84a3b926768971a77775ce42be7647c7cbc32362ef5a542a30f06d6c27c106a100c3de41e80b8268913ca9c3e68021ac3acbb8ba3cf2d97716696df012cf933b6a04
ktcc8c045e0e5b773870e880137b4e84a3b926768971a77775ce42be7647c7cbc32362ef5a542a30f06d6c27c106a100c3de41e80b8268913ca9c3e68021ac3acbb8ba3cf2d97716696df012cf933b6a04
agrees VRF output, truncated to VRF.Nh = 32 bytes (§17.1)
peerdce7050aef83b4246b23f1998d23c665843fb551586219361b378e7a5cf317c2
ktdce7050aef83b4246b23f1998d23c665843fb551586219361b378e7a5cf317c2
agrees verifying the peer's proof yields the peer's search key (§11.7)
peerdce7050aef83b4246b23f1998d23c665843fb551586219361b378e7a5cf317c2
ktdce7050aef83b4246b23f1998d23c665843fb551586219361b378e7a5cf317c2
 agrees
label-with-nulls label 4 bytes, version 3
5 checks
agrees public key derived from the seed (RFC 8032 §5.1.5)
peer0d7550754e0800a5d237eef5826035766b9b3e5a15868a940ab289958788e3b0
kt0d7550754e0800a5d237eef5826035766b9b3e5a15868a940ab289958788e3b0
agrees VrfInput encoding is alpha_string (§2.1, §11.7)
peer04000100ff00000003
kt04000100ff00000003
agrees VRF proof, VRF.Np = 80 bytes (§11.7, RFC 9381 §5.1)
peer1f19ad43c440cdfc9da0f5b351970a3ca1fe64166c4c9ff91cade9ecd68d842369432dd81964d1055fc1db21a10778f9d2fa165c2fb22cf7509874ac9c49b24714b74a006638b31d7108165601a36e0e
kt1f19ad43c440cdfc9da0f5b351970a3ca1fe64166c4c9ff91cade9ecd68d842369432dd81964d1055fc1db21a10778f9d2fa165c2fb22cf7509874ac9c49b24714b74a006638b31d7108165601a36e0e
agrees VRF output, truncated to VRF.Nh = 32 bytes (§17.1)
peer6775e7a07a79cd986d87238a743c3d40df82c4143c6ad8b688b81211b2312c24
kt6775e7a07a79cd986d87238a743c3d40df82c4143c6ad8b688b81211b2312c24
agrees verifying the peer's proof yields the peer's search key (§11.7)
peer6775e7a07a79cd986d87238a743c3d40df82c4143c6ad8b688b81211b2312c24
kt6775e7a07a79cd986d87238a743c3d40df82c4143c6ad8b688b81211b2312c24
 agrees
proof-for-another-version-does-not-verify must refuse label 17 bytes, version 1
2 checks
agrees public key derived from the seed (RFC 8032 §5.1.5)
peer0d7550754e0800a5d237eef5826035766b9b3e5a15868a940ab289958788e3b0
kt0d7550754e0800a5d237eef5826035766b9b3e5a15868a940ab289958788e3b0
agrees verify() rejects a proof for another label-version pair (§11.7)
peerrejected
ktrejected
 agrees

Log tree structure §3.2, §4.2, §12.1

Vectors: log-math.json · oracle: katie @ 00da52541f6a · 24 cases, 1679 checks agrees

CaseInputChecksResult
size-1 log of 1 entries, 4 decompositions
1 checks
agrees node indices for a log of 1 entries (§3.2, §4.2, §12.1)
peer4 sub-checks match
kt4 sub-checks match

4 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-2 log of 2 entries, 12 decompositions
1 checks
agrees node indices for a log of 2 entries (§3.2, §4.2, §12.1)
peer12 sub-checks match
kt12 sub-checks match

12 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-3 log of 3 entries, 28 decompositions
1 checks
agrees node indices for a log of 3 entries (§3.2, §4.2, §12.1)
peer28 sub-checks match
kt28 sub-checks match

28 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-4 log of 4 entries, 45 decompositions
1 checks
agrees node indices for a log of 4 entries (§3.2, §4.2, §12.1)
peer45 sub-checks match
kt45 sub-checks match

45 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-5 log of 5 entries, 55 decompositions
1 checks
agrees node indices for a log of 5 entries (§3.2, §4.2, §12.1)
peer55 sub-checks match
kt55 sub-checks match

55 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-6 log of 6 entries, 65 decompositions
1 checks
agrees node indices for a log of 6 entries (§3.2, §4.2, §12.1)
peer65 sub-checks match
kt65 sub-checks match

65 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-7 log of 7 entries, 75 decompositions
1 checks
agrees node indices for a log of 7 entries (§3.2, §4.2, §12.1)
peer75 sub-checks match
kt75 sub-checks match

75 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-8 log of 8 entries, 85 decompositions
1 checks
agrees node indices for a log of 8 entries (§3.2, §4.2, §12.1)
peer85 sub-checks match
kt85 sub-checks match

85 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-9 log of 9 entries, 95 decompositions
1 checks
agrees node indices for a log of 9 entries (§3.2, §4.2, §12.1)
peer95 sub-checks match
kt95 sub-checks match

95 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-10 log of 10 entries, 105 decompositions
1 checks
agrees node indices for a log of 10 entries (§3.2, §4.2, §12.1)
peer105 sub-checks match
kt105 sub-checks match

105 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-11 log of 11 entries, 115 decompositions
1 checks
agrees node indices for a log of 11 entries (§3.2, §4.2, §12.1)
peer115 sub-checks match
kt115 sub-checks match

115 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-12 log of 12 entries, 125 decompositions
1 checks
agrees node indices for a log of 12 entries (§3.2, §4.2, §12.1)
peer125 sub-checks match
kt125 sub-checks match

125 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-13 log of 13 entries, 135 decompositions
1 checks
agrees node indices for a log of 13 entries (§3.2, §4.2, §12.1)
peer135 sub-checks match
kt135 sub-checks match

135 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-15 log of 15 entries, 155 decompositions
1 checks
agrees node indices for a log of 15 entries (§3.2, §4.2, §12.1)
peer155 sub-checks match
kt155 sub-checks match

155 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-16 log of 16 entries, 165 decompositions
1 checks
agrees node indices for a log of 16 entries (§3.2, §4.2, §12.1)
peer165 sub-checks match
kt165 sub-checks match

165 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-17 log of 17 entries, 175 decompositions
1 checks
agrees node indices for a log of 17 entries (§3.2, §4.2, §12.1)
peer175 sub-checks match
kt175 sub-checks match

175 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-20 log of 20 entries, 30 decompositions
1 checks
agrees node indices for a log of 20 entries (§3.2, §4.2, §12.1)
peer30 sub-checks match
kt30 sub-checks match

30 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-31 log of 31 entries, 30 decompositions
1 checks
agrees node indices for a log of 31 entries (§3.2, §4.2, §12.1)
peer30 sub-checks match
kt30 sub-checks match

30 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-32 log of 32 entries, 30 decompositions
1 checks
agrees node indices for a log of 32 entries (§3.2, §4.2, §12.1)
peer30 sub-checks match
kt30 sub-checks match

30 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-33 log of 33 entries, 30 decompositions
1 checks
agrees node indices for a log of 33 entries (§3.2, §4.2, §12.1)
peer30 sub-checks match
kt30 sub-checks match

30 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-50 log of 50 entries, 30 decompositions
1 checks
agrees node indices for a log of 50 entries (§3.2, §4.2, §12.1)
peer30 sub-checks match
kt30 sub-checks match

30 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-64 log of 64 entries, 30 decompositions
1 checks
agrees node indices for a log of 64 entries (§3.2, §4.2, §12.1)
peer30 sub-checks match
kt30 sub-checks match

30 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-100 log of 100 entries, 30 decompositions
1 checks
agrees node indices for a log of 100 entries (§3.2, §4.2, §12.1)
peer30 sub-checks match
kt30 sub-checks match

30 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-1000 log of 1000 entries, 30 decompositions
1 checks
agrees node indices for a log of 1000 entries (§3.2, §4.2, §12.1)
peer30 sub-checks match
kt30 sub-checks match

30 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees

Log tree §3.2, §11.8, §12.1

Vectors: log-tree.json · oracle: katie @ 00da52541f6a · 19 cases, 1928 checks agrees

CaseInputChecksResult
size-1 log of 1 entries, 3 proof requests
4 checks
agrees leaf values (§11.8)
peer1 sub-checks match
kt1 sub-checks match

1 sub-checks, every one an agreement. Each is listed \ individually in report.json.

agrees root of the log tree (§3.2, §11.8)
peerfc3dd2f2eed140d5a631a5df0e8e5d18a901f70d6e83c8f76784ee79eb7cbd03
ktfc3dd2f2eed140d5a631a5df0e8e5d18a901f70d6e83c8f76784ee79eb7cbd03
agrees full subtree heads (§4.2)
peer[fc3dd2f2eed140d5a631a5df0e8e5d18a901f70d6e83c8f76784ee79eb7cbd03]
kt[fc3dd2f2eed140d5a631a5df0e8e5d18a901f70d6e83c8f76784ee79eb7cbd03]
agrees batch proofs (§12.1)
peer9 sub-checks match
kt9 sub-checks match

9 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-2 log of 2 entries, 7 proof requests
4 checks
agrees leaf values (§11.8)
peer2 sub-checks match
kt2 sub-checks match

2 sub-checks, every one an agreement. Each is listed \ individually in report.json.

agrees root of the log tree (§3.2, §11.8)
peer460ac5388da9f422a93267d318838340fba917a9b19d56af19a994029eb186f0
kt460ac5388da9f422a93267d318838340fba917a9b19d56af19a994029eb186f0
agrees full subtree heads (§4.2)
peer[460ac5388da9f422a93267d318838340fba917a9b19d56af19a994029eb186f0]
kt[460ac5388da9f422a93267d318838340fba917a9b19d56af19a994029eb186f0]
agrees batch proofs (§12.1)
peer21 sub-checks match
kt21 sub-checks match

21 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-3 log of 3 entries, 11 proof requests
4 checks
agrees leaf values (§11.8)
peer3 sub-checks match
kt3 sub-checks match

3 sub-checks, every one an agreement. Each is listed \ individually in report.json.

agrees root of the log tree (§3.2, §11.8)
peer37a7a19c1de20b7c6638e0542f2f8af64ba3fffac4cd6502eff3ff8260dd58dd
kt37a7a19c1de20b7c6638e0542f2f8af64ba3fffac4cd6502eff3ff8260dd58dd
agrees full subtree heads (§4.2)
peer[460ac5388da9f422a93267d318838340fba917a9b19d56af19a994029eb186f0, 0b03bb98c456c33e2a718fc09c81044e207e66d231245be87a8f4cce6c724f50]
kt[460ac5388da9f422a93267d318838340fba917a9b19d56af19a994029eb186f0, 0b03bb98c456c33e2a718fc09c81044e207e66d231245be87a8f4cce6c724f50]
agrees batch proofs (§12.1)
peer33 sub-checks match
kt33 sub-checks match

33 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-4 log of 4 entries, 16 proof requests
4 checks
agrees leaf values (§11.8)
peer4 sub-checks match
kt4 sub-checks match

4 sub-checks, every one an agreement. Each is listed \ individually in report.json.

agrees root of the log tree (§3.2, §11.8)
peer75c0c725ddf9dd295d4548e0cd7b2415b1b410496a8e0cb0d31421e706daa741
kt75c0c725ddf9dd295d4548e0cd7b2415b1b410496a8e0cb0d31421e706daa741
agrees full subtree heads (§4.2)
peer[75c0c725ddf9dd295d4548e0cd7b2415b1b410496a8e0cb0d31421e706daa741]
kt[75c0c725ddf9dd295d4548e0cd7b2415b1b410496a8e0cb0d31421e706daa741]
agrees batch proofs (§12.1)
peer48 sub-checks match
kt48 sub-checks match

48 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-5 log of 5 entries, 20 proof requests
4 checks
agrees leaf values (§11.8)
peer5 sub-checks match
kt5 sub-checks match

5 sub-checks, every one an agreement. Each is listed \ individually in report.json.

agrees root of the log tree (§3.2, §11.8)
peerf95485da09a459bf7dac0ab8e13d753ae55ab035f95c177b7cfade568d2b1752
ktf95485da09a459bf7dac0ab8e13d753ae55ab035f95c177b7cfade568d2b1752
agrees full subtree heads (§4.2)
peer[75c0c725ddf9dd295d4548e0cd7b2415b1b410496a8e0cb0d31421e706daa741, 0322843bf84586bc646e7f05a43f904fd5582e67c8f7062b4dac0d18b2debb3a]
kt[75c0c725ddf9dd295d4548e0cd7b2415b1b410496a8e0cb0d31421e706daa741, 0322843bf84586bc646e7f05a43f904fd5582e67c8f7062b4dac0d18b2debb3a]
agrees batch proofs (§12.1)
peer60 sub-checks match
kt60 sub-checks match

60 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-6 log of 6 entries, 24 proof requests
4 checks
agrees leaf values (§11.8)
peer6 sub-checks match
kt6 sub-checks match

6 sub-checks, every one an agreement. Each is listed \ individually in report.json.

agrees root of the log tree (§3.2, §11.8)
peerb470aac60c6bb2ec3eac88ef390af3645541ab44fdb828b38fa8dfd1c7475325
ktb470aac60c6bb2ec3eac88ef390af3645541ab44fdb828b38fa8dfd1c7475325
agrees full subtree heads (§4.2)
peer[75c0c725ddf9dd295d4548e0cd7b2415b1b410496a8e0cb0d31421e706daa741, 24e6b6f95bf9d4c1b12105ccf73b4651a160c90f416dde4cbff7f615604ff65a]
kt[75c0c725ddf9dd295d4548e0cd7b2415b1b410496a8e0cb0d31421e706daa741, 24e6b6f95bf9d4c1b12105ccf73b4651a160c90f416dde4cbff7f615604ff65a]
agrees batch proofs (§12.1)
peer72 sub-checks match
kt72 sub-checks match

72 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-7 log of 7 entries, 28 proof requests
4 checks
agrees leaf values (§11.8)
peer7 sub-checks match
kt7 sub-checks match

7 sub-checks, every one an agreement. Each is listed \ individually in report.json.

agrees root of the log tree (§3.2, §11.8)
peer1a1e3c2fdb6956c38759496b8190ad649df7cd823c7673c69b25c906d74eefd0
kt1a1e3c2fdb6956c38759496b8190ad649df7cd823c7673c69b25c906d74eefd0
agrees full subtree heads (§4.2)
peer[75c0c725ddf9dd295d4548e0cd7b2415b1b410496a8e0cb0d31421e706daa741, 24e6b6f95bf9d4c1b12105ccf73b4651a160c90f416dde4cbff7f615604ff65a, fc874b0761418adc00e775228ac6ac8ca3a71c8616f3ced3d620c7ae740efde9]
kt[75c0c725ddf9dd295d4548e0cd7b2415b1b410496a8e0cb0d31421e706daa741, 24e6b6f95bf9d4c1b12105ccf73b4651a160c90f416dde4cbff7f615604ff65a, fc874b0761418adc00e775228ac6ac8ca3a71c8616f3ced3d620c7ae740efde9]
agrees batch proofs (§12.1)
peer84 sub-checks match
kt84 sub-checks match

84 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-8 log of 8 entries, 32 proof requests
4 checks
agrees leaf values (§11.8)
peer8 sub-checks match
kt8 sub-checks match

8 sub-checks, every one an agreement. Each is listed \ individually in report.json.

agrees root of the log tree (§3.2, §11.8)
peerd1311dd997a7b87a48314781b25e8a355d8c3879ae852bcba6181df7e8e26f51
ktd1311dd997a7b87a48314781b25e8a355d8c3879ae852bcba6181df7e8e26f51
agrees full subtree heads (§4.2)
peer[d1311dd997a7b87a48314781b25e8a355d8c3879ae852bcba6181df7e8e26f51]
kt[d1311dd997a7b87a48314781b25e8a355d8c3879ae852bcba6181df7e8e26f51]
agrees batch proofs (§12.1)
peer96 sub-checks match
kt96 sub-checks match

96 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-9 log of 9 entries, 35 proof requests
4 checks
agrees leaf values (§11.8)
peer9 sub-checks match
kt9 sub-checks match

9 sub-checks, every one an agreement. Each is listed \ individually in report.json.

agrees root of the log tree (§3.2, §11.8)
peerf152e3fa459912da8bb8c0d304dd08140ed720b4154c6cab2280ac78cf5c0650
ktf152e3fa459912da8bb8c0d304dd08140ed720b4154c6cab2280ac78cf5c0650
agrees full subtree heads (§4.2)
peer[d1311dd997a7b87a48314781b25e8a355d8c3879ae852bcba6181df7e8e26f51, 51725873edfeece02c2758491f90cc9c11870a50c30cc035a4957295e6cdf803]
kt[d1311dd997a7b87a48314781b25e8a355d8c3879ae852bcba6181df7e8e26f51, 51725873edfeece02c2758491f90cc9c11870a50c30cc035a4957295e6cdf803]
agrees batch proofs (§12.1)
peer105 sub-checks match
kt105 sub-checks match

105 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-11 log of 11 entries, 43 proof requests
4 checks
agrees leaf values (§11.8)
peer11 sub-checks match
kt11 sub-checks match

11 sub-checks, every one an agreement. Each is listed \ individually in report.json.

agrees root of the log tree (§3.2, §11.8)
peer3e92e20d401c8533e78af0e75ed12e081e0de8f91ce434820cf4f523fb605a57
kt3e92e20d401c8533e78af0e75ed12e081e0de8f91ce434820cf4f523fb605a57
agrees full subtree heads (§4.2)
peer[d1311dd997a7b87a48314781b25e8a355d8c3879ae852bcba6181df7e8e26f51, be8c7adee4b2fb0289a11c540473d1f878133025d2b1ccad04d09b2ad754dfdf, 40b58a603976405df47c330453ce362b7f41900d58fe673690e048e8347da474]
kt[d1311dd997a7b87a48314781b25e8a355d8c3879ae852bcba6181df7e8e26f51, be8c7adee4b2fb0289a11c540473d1f878133025d2b1ccad04d09b2ad754dfdf, 40b58a603976405df47c330453ce362b7f41900d58fe673690e048e8347da474]
agrees batch proofs (§12.1)
peer129 sub-checks match
kt129 sub-checks match

129 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-15 log of 15 entries, 59 proof requests
4 checks
agrees leaf values (§11.8)
peer15 sub-checks match
kt15 sub-checks match

15 sub-checks, every one an agreement. Each is listed \ individually in report.json.

agrees root of the log tree (§3.2, §11.8)
peerca6d636912ac0c0fdd15b712f87e72e79fe14f83e0a5ce84fdcf0dcc6d97084f
ktca6d636912ac0c0fdd15b712f87e72e79fe14f83e0a5ce84fdcf0dcc6d97084f
agrees full subtree heads (§4.2)
peer[d1311dd997a7b87a48314781b25e8a355d8c3879ae852bcba6181df7e8e26f51, f7053bed2d97e716313bde1fe35bd56134af3acc107b2c2444aa9ce18ecd71a6, 09fe8d01b1f4aa073829c0257dd716637602b4ff3bfd79c3bfdb7027e7a3fa85, c235ba092a7133ff9acc7cef64b95e817c87d013108b2b08e7143644f6d30f47]
kt[d1311dd997a7b87a48314781b25e8a355d8c3879ae852bcba6181df7e8e26f51, f7053bed2d97e716313bde1fe35bd56134af3acc107b2c2444aa9ce18ecd71a6, 09fe8d01b1f4aa073829c0257dd716637602b4ff3bfd79c3bfdb7027e7a3fa85, c235ba092a7133ff9acc7cef64b95e817c87d013108b2b08e7143644f6d30f47]
agrees batch proofs (§12.1)
peer177 sub-checks match
kt177 sub-checks match

177 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-16 log of 16 entries, 63 proof requests
4 checks
agrees leaf values (§11.8)
peer16 sub-checks match
kt16 sub-checks match

16 sub-checks, every one an agreement. Each is listed \ individually in report.json.

agrees root of the log tree (§3.2, §11.8)
peer71f0ff59ce2867c4717a81ddc637e21a4eff27b099d3de6472dbeea96061a38e
kt71f0ff59ce2867c4717a81ddc637e21a4eff27b099d3de6472dbeea96061a38e
agrees full subtree heads (§4.2)
peer[71f0ff59ce2867c4717a81ddc637e21a4eff27b099d3de6472dbeea96061a38e]
kt[71f0ff59ce2867c4717a81ddc637e21a4eff27b099d3de6472dbeea96061a38e]
agrees batch proofs (§12.1)
peer189 sub-checks match
kt189 sub-checks match

189 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-17 log of 17 entries, 67 proof requests
4 checks
agrees leaf values (§11.8)
peer17 sub-checks match
kt17 sub-checks match

17 sub-checks, every one an agreement. Each is listed \ individually in report.json.

agrees root of the log tree (§3.2, §11.8)
peer51c591652d67aa45f15910e41404506aaa496c93f4c4a09bd662784246b8ce8b
kt51c591652d67aa45f15910e41404506aaa496c93f4c4a09bd662784246b8ce8b
agrees full subtree heads (§4.2)
peer[71f0ff59ce2867c4717a81ddc637e21a4eff27b099d3de6472dbeea96061a38e, 25397793ec346527fa718b064d16d0bb05ba11c7ebf95cc82f2aea67f115f617]
kt[71f0ff59ce2867c4717a81ddc637e21a4eff27b099d3de6472dbeea96061a38e, 25397793ec346527fa718b064d16d0bb05ba11c7ebf95cc82f2aea67f115f617]
agrees batch proofs (§12.1)
peer201 sub-checks match
kt201 sub-checks match

201 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-31 log of 31 entries, 14 proof requests
4 checks
agrees leaf values (§11.8)
peer31 sub-checks match
kt31 sub-checks match

31 sub-checks, every one an agreement. Each is listed \ individually in report.json.

agrees root of the log tree (§3.2, §11.8)
peerfeb7b52706ff6f68ab56bc33b06f05727eba94d04c21beba448878c3954f7bb2
ktfeb7b52706ff6f68ab56bc33b06f05727eba94d04c21beba448878c3954f7bb2
agrees full subtree heads (§4.2)
peer[71f0ff59ce2867c4717a81ddc637e21a4eff27b099d3de6472dbeea96061a38e, c72ce6569cd6689e68e08cb77378d5f9dd156ba1a3ee5af795e181a92ab82b1b, 8d25dc3f4338cf9d3d6d92dbec2d77e7d7e1bb00b2b521cbe9b4df18a3c4d28f, ad0788f11a3568e93645d34293b02ec4fa9eaac50248c875cf8a44509c1d8f33, 90980a9bd66473cc9469cc7153ce7832eca5f6f41eb420f123d294f57db407c9]
kt[71f0ff59ce2867c4717a81ddc637e21a4eff27b099d3de6472dbeea96061a38e, c72ce6569cd6689e68e08cb77378d5f9dd156ba1a3ee5af795e181a92ab82b1b, 8d25dc3f4338cf9d3d6d92dbec2d77e7d7e1bb00b2b521cbe9b4df18a3c4d28f, ad0788f11a3568e93645d34293b02ec4fa9eaac50248c875cf8a44509c1d8f33, 90980a9bd66473cc9469cc7153ce7832eca5f6f41eb420f123d294f57db407c9]
agrees batch proofs (§12.1)
peer42 sub-checks match
kt42 sub-checks match

42 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-32 log of 32 entries, 14 proof requests
4 checks
agrees leaf values (§11.8)
peer32 sub-checks match
kt32 sub-checks match

32 sub-checks, every one an agreement. Each is listed \ individually in report.json.

agrees root of the log tree (§3.2, §11.8)
peerd6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53
ktd6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53
agrees full subtree heads (§4.2)
peer[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53]
kt[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53]
agrees batch proofs (§12.1)
peer42 sub-checks match
kt42 sub-checks match

42 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-33 log of 33 entries, 14 proof requests
4 checks
agrees leaf values (§11.8)
peer33 sub-checks match
kt33 sub-checks match

33 sub-checks, every one an agreement. Each is listed \ individually in report.json.

agrees root of the log tree (§3.2, §11.8)
peer56a0ea987e104793de359fc4e9dce3b363d65ea10233a3d86bfa4c78449ce2f7
kt56a0ea987e104793de359fc4e9dce3b363d65ea10233a3d86bfa4c78449ce2f7
agrees full subtree heads (§4.2)
peer[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, 4d3ea048961d227d4e07010f40fde48baa69ba14f52c09fcf32ab0cf7aa7b7e2]
kt[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, 4d3ea048961d227d4e07010f40fde48baa69ba14f52c09fcf32ab0cf7aa7b7e2]
agrees batch proofs (§12.1)
peer42 sub-checks match
kt42 sub-checks match

42 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-50 log of 50 entries, 14 proof requests
4 checks
agrees leaf values (§11.8)
peer50 sub-checks match
kt50 sub-checks match

50 sub-checks, every one an agreement. Each is listed \ individually in report.json.

agrees root of the log tree (§3.2, §11.8)
peer67681ff8f57aaeb95be91c9f199dc31faadd937e52c0ecfdb412db3b4030e336
kt67681ff8f57aaeb95be91c9f199dc31faadd937e52c0ecfdb412db3b4030e336
agrees full subtree heads (§4.2)
peer[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, eba98e51569b1727dd8e9298e2a2885f382f1ef7de73ea86eda5aac2387465a0, 8630beadffab2d96da32af61450a66da6e7bc264d209b410a3345b4f217e91b1]
kt[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, eba98e51569b1727dd8e9298e2a2885f382f1ef7de73ea86eda5aac2387465a0, 8630beadffab2d96da32af61450a66da6e7bc264d209b410a3345b4f217e91b1]
agrees batch proofs (§12.1)
peer42 sub-checks match
kt42 sub-checks match

42 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-64 log of 64 entries, 14 proof requests
4 checks
agrees leaf values (§11.8)
peer64 sub-checks match
kt64 sub-checks match

64 sub-checks, every one an agreement. Each is listed \ individually in report.json.

agrees root of the log tree (§3.2, §11.8)
peerfc994f6c5665be1231b39d00c08cd15a266b23d664b8efc9517c37b77d922741
ktfc994f6c5665be1231b39d00c08cd15a266b23d664b8efc9517c37b77d922741
agrees full subtree heads (§4.2)
peer[fc994f6c5665be1231b39d00c08cd15a266b23d664b8efc9517c37b77d922741]
kt[fc994f6c5665be1231b39d00c08cd15a266b23d664b8efc9517c37b77d922741]
agrees batch proofs (§12.1)
peer42 sub-checks match
kt42 sub-checks match

42 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees
size-100 log of 100 entries, 14 proof requests
4 checks
agrees leaf values (§11.8)
peer100 sub-checks match
kt100 sub-checks match

100 sub-checks, every one an agreement. Each is listed \ individually in report.json.

agrees root of the log tree (§3.2, §11.8)
peer4f74da80af0971041e940523e700efafe1c7e31e250ee5304c171646a75362be
kt4f74da80af0971041e940523e700efafe1c7e31e250ee5304c171646a75362be
agrees full subtree heads (§4.2)
peer[fc994f6c5665be1231b39d00c08cd15a266b23d664b8efc9517c37b77d922741, 66df9aaf0a58ca323d83034f0f59504fe2d66a9cad6caf3855e74a6c81a81d67, 50784451d30d3678441806c08bfde38e6734a119aaaa380d3ce22e4c9ff5bcab]
kt[fc994f6c5665be1231b39d00c08cd15a266b23d664b8efc9517c37b77d922741, 66df9aaf0a58ca323d83034f0f59504fe2d66a9cad6caf3855e74a6c81a81d67, 50784451d30d3678441806c08bfde38e6734a119aaaa380d3ce22e4c9ff5bcab]
agrees batch proofs (§12.1)
peer42 sub-checks match
kt42 sub-checks match

42 sub-checks, every one an agreement. Each is listed \ individually in report.json.

 agrees

Log tree, grown one leaf at a time §3.2, §11.8

Vectors: log-append.json · oracle: katie @ 00da52541f6a · cipher suite 0x0002 KT_128_SHA256_Ed25519 · 64 cases, 192 checks agrees

CaseInputChecksResult
size-1 1 leaves, 1 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[fc3dd2f2eed140d5a631a5df0e8e5d18a901f70d6e83c8f76784ee79eb7cbd03]
kt[fc3dd2f2eed140d5a631a5df0e8e5d18a901f70d6e83c8f76784ee79eb7cbd03]
agrees root folded from those heads (§11.8)
peerfc3dd2f2eed140d5a631a5df0e8e5d18a901f70d6e83c8f76784ee79eb7cbd03
ktfc3dd2f2eed140d5a631a5df0e8e5d18a901f70d6e83c8f76784ee79eb7cbd03
agrees the same root computed from every leaf instead (§3.2)
peerfc3dd2f2eed140d5a631a5df0e8e5d18a901f70d6e83c8f76784ee79eb7cbd03
ktfc3dd2f2eed140d5a631a5df0e8e5d18a901f70d6e83c8f76784ee79eb7cbd03
 agrees
size-2 2 leaves, 1 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[460ac5388da9f422a93267d318838340fba917a9b19d56af19a994029eb186f0]
kt[460ac5388da9f422a93267d318838340fba917a9b19d56af19a994029eb186f0]
agrees root folded from those heads (§11.8)
peer460ac5388da9f422a93267d318838340fba917a9b19d56af19a994029eb186f0
kt460ac5388da9f422a93267d318838340fba917a9b19d56af19a994029eb186f0
agrees the same root computed from every leaf instead (§3.2)
peer460ac5388da9f422a93267d318838340fba917a9b19d56af19a994029eb186f0
kt460ac5388da9f422a93267d318838340fba917a9b19d56af19a994029eb186f0
 agrees
size-3 3 leaves, 2 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[460ac5388da9f422a93267d318838340fba917a9b19d56af19a994029eb186f0, 0b03bb98c456c33e2a718fc09c81044e207e66d231245be87a8f4cce6c724f50]
kt[460ac5388da9f422a93267d318838340fba917a9b19d56af19a994029eb186f0, 0b03bb98c456c33e2a718fc09c81044e207e66d231245be87a8f4cce6c724f50]
agrees root folded from those heads (§11.8)
peer37a7a19c1de20b7c6638e0542f2f8af64ba3fffac4cd6502eff3ff8260dd58dd
kt37a7a19c1de20b7c6638e0542f2f8af64ba3fffac4cd6502eff3ff8260dd58dd
agrees the same root computed from every leaf instead (§3.2)
peer37a7a19c1de20b7c6638e0542f2f8af64ba3fffac4cd6502eff3ff8260dd58dd
kt37a7a19c1de20b7c6638e0542f2f8af64ba3fffac4cd6502eff3ff8260dd58dd
 agrees
size-4 4 leaves, 1 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[75c0c725ddf9dd295d4548e0cd7b2415b1b410496a8e0cb0d31421e706daa741]
kt[75c0c725ddf9dd295d4548e0cd7b2415b1b410496a8e0cb0d31421e706daa741]
agrees root folded from those heads (§11.8)
peer75c0c725ddf9dd295d4548e0cd7b2415b1b410496a8e0cb0d31421e706daa741
kt75c0c725ddf9dd295d4548e0cd7b2415b1b410496a8e0cb0d31421e706daa741
agrees the same root computed from every leaf instead (§3.2)
peer75c0c725ddf9dd295d4548e0cd7b2415b1b410496a8e0cb0d31421e706daa741
kt75c0c725ddf9dd295d4548e0cd7b2415b1b410496a8e0cb0d31421e706daa741
 agrees
size-5 5 leaves, 2 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[75c0c725ddf9dd295d4548e0cd7b2415b1b410496a8e0cb0d31421e706daa741, 0322843bf84586bc646e7f05a43f904fd5582e67c8f7062b4dac0d18b2debb3a]
kt[75c0c725ddf9dd295d4548e0cd7b2415b1b410496a8e0cb0d31421e706daa741, 0322843bf84586bc646e7f05a43f904fd5582e67c8f7062b4dac0d18b2debb3a]
agrees root folded from those heads (§11.8)
peerf95485da09a459bf7dac0ab8e13d753ae55ab035f95c177b7cfade568d2b1752
ktf95485da09a459bf7dac0ab8e13d753ae55ab035f95c177b7cfade568d2b1752
agrees the same root computed from every leaf instead (§3.2)
peerf95485da09a459bf7dac0ab8e13d753ae55ab035f95c177b7cfade568d2b1752
ktf95485da09a459bf7dac0ab8e13d753ae55ab035f95c177b7cfade568d2b1752
 agrees
size-6 6 leaves, 2 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[75c0c725ddf9dd295d4548e0cd7b2415b1b410496a8e0cb0d31421e706daa741, 24e6b6f95bf9d4c1b12105ccf73b4651a160c90f416dde4cbff7f615604ff65a]
kt[75c0c725ddf9dd295d4548e0cd7b2415b1b410496a8e0cb0d31421e706daa741, 24e6b6f95bf9d4c1b12105ccf73b4651a160c90f416dde4cbff7f615604ff65a]
agrees root folded from those heads (§11.8)
peerb470aac60c6bb2ec3eac88ef390af3645541ab44fdb828b38fa8dfd1c7475325
ktb470aac60c6bb2ec3eac88ef390af3645541ab44fdb828b38fa8dfd1c7475325
agrees the same root computed from every leaf instead (§3.2)
peerb470aac60c6bb2ec3eac88ef390af3645541ab44fdb828b38fa8dfd1c7475325
ktb470aac60c6bb2ec3eac88ef390af3645541ab44fdb828b38fa8dfd1c7475325
 agrees
size-7 7 leaves, 3 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[75c0c725ddf9dd295d4548e0cd7b2415b1b410496a8e0cb0d31421e706daa741, 24e6b6f95bf9d4c1b12105ccf73b4651a160c90f416dde4cbff7f615604ff65a, fc874b0761418adc00e775228ac6ac8ca3a71c8616f3ced3d620c7ae740efde9]
kt[75c0c725ddf9dd295d4548e0cd7b2415b1b410496a8e0cb0d31421e706daa741, 24e6b6f95bf9d4c1b12105ccf73b4651a160c90f416dde4cbff7f615604ff65a, fc874b0761418adc00e775228ac6ac8ca3a71c8616f3ced3d620c7ae740efde9]
agrees root folded from those heads (§11.8)
peer1a1e3c2fdb6956c38759496b8190ad649df7cd823c7673c69b25c906d74eefd0
kt1a1e3c2fdb6956c38759496b8190ad649df7cd823c7673c69b25c906d74eefd0
agrees the same root computed from every leaf instead (§3.2)
peer1a1e3c2fdb6956c38759496b8190ad649df7cd823c7673c69b25c906d74eefd0
kt1a1e3c2fdb6956c38759496b8190ad649df7cd823c7673c69b25c906d74eefd0
 agrees
size-8 8 leaves, 1 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[d1311dd997a7b87a48314781b25e8a355d8c3879ae852bcba6181df7e8e26f51]
kt[d1311dd997a7b87a48314781b25e8a355d8c3879ae852bcba6181df7e8e26f51]
agrees root folded from those heads (§11.8)
peerd1311dd997a7b87a48314781b25e8a355d8c3879ae852bcba6181df7e8e26f51
ktd1311dd997a7b87a48314781b25e8a355d8c3879ae852bcba6181df7e8e26f51
agrees the same root computed from every leaf instead (§3.2)
peerd1311dd997a7b87a48314781b25e8a355d8c3879ae852bcba6181df7e8e26f51
ktd1311dd997a7b87a48314781b25e8a355d8c3879ae852bcba6181df7e8e26f51
 agrees
size-9 9 leaves, 2 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[d1311dd997a7b87a48314781b25e8a355d8c3879ae852bcba6181df7e8e26f51, 51725873edfeece02c2758491f90cc9c11870a50c30cc035a4957295e6cdf803]
kt[d1311dd997a7b87a48314781b25e8a355d8c3879ae852bcba6181df7e8e26f51, 51725873edfeece02c2758491f90cc9c11870a50c30cc035a4957295e6cdf803]
agrees root folded from those heads (§11.8)
peerf152e3fa459912da8bb8c0d304dd08140ed720b4154c6cab2280ac78cf5c0650
ktf152e3fa459912da8bb8c0d304dd08140ed720b4154c6cab2280ac78cf5c0650
agrees the same root computed from every leaf instead (§3.2)
peerf152e3fa459912da8bb8c0d304dd08140ed720b4154c6cab2280ac78cf5c0650
ktf152e3fa459912da8bb8c0d304dd08140ed720b4154c6cab2280ac78cf5c0650
 agrees
size-10 10 leaves, 2 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[d1311dd997a7b87a48314781b25e8a355d8c3879ae852bcba6181df7e8e26f51, be8c7adee4b2fb0289a11c540473d1f878133025d2b1ccad04d09b2ad754dfdf]
kt[d1311dd997a7b87a48314781b25e8a355d8c3879ae852bcba6181df7e8e26f51, be8c7adee4b2fb0289a11c540473d1f878133025d2b1ccad04d09b2ad754dfdf]
agrees root folded from those heads (§11.8)
peerccacade09ef66de0fa3012d2dc7743c38ac0d037be22067f5b06b1a4896cdf43
ktccacade09ef66de0fa3012d2dc7743c38ac0d037be22067f5b06b1a4896cdf43
agrees the same root computed from every leaf instead (§3.2)
peerccacade09ef66de0fa3012d2dc7743c38ac0d037be22067f5b06b1a4896cdf43
ktccacade09ef66de0fa3012d2dc7743c38ac0d037be22067f5b06b1a4896cdf43
 agrees
size-11 11 leaves, 3 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[d1311dd997a7b87a48314781b25e8a355d8c3879ae852bcba6181df7e8e26f51, be8c7adee4b2fb0289a11c540473d1f878133025d2b1ccad04d09b2ad754dfdf, 40b58a603976405df47c330453ce362b7f41900d58fe673690e048e8347da474]
kt[d1311dd997a7b87a48314781b25e8a355d8c3879ae852bcba6181df7e8e26f51, be8c7adee4b2fb0289a11c540473d1f878133025d2b1ccad04d09b2ad754dfdf, 40b58a603976405df47c330453ce362b7f41900d58fe673690e048e8347da474]
agrees root folded from those heads (§11.8)
peer3e92e20d401c8533e78af0e75ed12e081e0de8f91ce434820cf4f523fb605a57
kt3e92e20d401c8533e78af0e75ed12e081e0de8f91ce434820cf4f523fb605a57
agrees the same root computed from every leaf instead (§3.2)
peer3e92e20d401c8533e78af0e75ed12e081e0de8f91ce434820cf4f523fb605a57
kt3e92e20d401c8533e78af0e75ed12e081e0de8f91ce434820cf4f523fb605a57
 agrees
size-12 12 leaves, 2 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[d1311dd997a7b87a48314781b25e8a355d8c3879ae852bcba6181df7e8e26f51, f7053bed2d97e716313bde1fe35bd56134af3acc107b2c2444aa9ce18ecd71a6]
kt[d1311dd997a7b87a48314781b25e8a355d8c3879ae852bcba6181df7e8e26f51, f7053bed2d97e716313bde1fe35bd56134af3acc107b2c2444aa9ce18ecd71a6]
agrees root folded from those heads (§11.8)
peer273c78bf4d2192070ddc1e2a198744c54a807b50cd72df607a14ff8963994c46
kt273c78bf4d2192070ddc1e2a198744c54a807b50cd72df607a14ff8963994c46
agrees the same root computed from every leaf instead (§3.2)
peer273c78bf4d2192070ddc1e2a198744c54a807b50cd72df607a14ff8963994c46
kt273c78bf4d2192070ddc1e2a198744c54a807b50cd72df607a14ff8963994c46
 agrees
size-13 13 leaves, 3 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[d1311dd997a7b87a48314781b25e8a355d8c3879ae852bcba6181df7e8e26f51, f7053bed2d97e716313bde1fe35bd56134af3acc107b2c2444aa9ce18ecd71a6, d88c169be57b71c02509f62587c7473896caa5ee92b57d2e3822779fe08e181e]
kt[d1311dd997a7b87a48314781b25e8a355d8c3879ae852bcba6181df7e8e26f51, f7053bed2d97e716313bde1fe35bd56134af3acc107b2c2444aa9ce18ecd71a6, d88c169be57b71c02509f62587c7473896caa5ee92b57d2e3822779fe08e181e]
agrees root folded from those heads (§11.8)
peer6428ff70efc0d836a5e17fe1a3c52eb973ed47c49e038bc9b1d9df7ae9bb1c34
kt6428ff70efc0d836a5e17fe1a3c52eb973ed47c49e038bc9b1d9df7ae9bb1c34
agrees the same root computed from every leaf instead (§3.2)
peer6428ff70efc0d836a5e17fe1a3c52eb973ed47c49e038bc9b1d9df7ae9bb1c34
kt6428ff70efc0d836a5e17fe1a3c52eb973ed47c49e038bc9b1d9df7ae9bb1c34
 agrees
size-14 14 leaves, 3 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[d1311dd997a7b87a48314781b25e8a355d8c3879ae852bcba6181df7e8e26f51, f7053bed2d97e716313bde1fe35bd56134af3acc107b2c2444aa9ce18ecd71a6, 09fe8d01b1f4aa073829c0257dd716637602b4ff3bfd79c3bfdb7027e7a3fa85]
kt[d1311dd997a7b87a48314781b25e8a355d8c3879ae852bcba6181df7e8e26f51, f7053bed2d97e716313bde1fe35bd56134af3acc107b2c2444aa9ce18ecd71a6, 09fe8d01b1f4aa073829c0257dd716637602b4ff3bfd79c3bfdb7027e7a3fa85]
agrees root folded from those heads (§11.8)
peerefe6c49cc72f37d7886a3e858e3a08b549e03cee92c83c3a6e52d6ed7f16e039
ktefe6c49cc72f37d7886a3e858e3a08b549e03cee92c83c3a6e52d6ed7f16e039
agrees the same root computed from every leaf instead (§3.2)
peerefe6c49cc72f37d7886a3e858e3a08b549e03cee92c83c3a6e52d6ed7f16e039
ktefe6c49cc72f37d7886a3e858e3a08b549e03cee92c83c3a6e52d6ed7f16e039
 agrees
size-15 15 leaves, 4 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[d1311dd997a7b87a48314781b25e8a355d8c3879ae852bcba6181df7e8e26f51, f7053bed2d97e716313bde1fe35bd56134af3acc107b2c2444aa9ce18ecd71a6, 09fe8d01b1f4aa073829c0257dd716637602b4ff3bfd79c3bfdb7027e7a3fa85, c235ba092a7133ff9acc7cef64b95e817c87d013108b2b08e7143644f6d30f47]
kt[d1311dd997a7b87a48314781b25e8a355d8c3879ae852bcba6181df7e8e26f51, f7053bed2d97e716313bde1fe35bd56134af3acc107b2c2444aa9ce18ecd71a6, 09fe8d01b1f4aa073829c0257dd716637602b4ff3bfd79c3bfdb7027e7a3fa85, c235ba092a7133ff9acc7cef64b95e817c87d013108b2b08e7143644f6d30f47]
agrees root folded from those heads (§11.8)
peerca6d636912ac0c0fdd15b712f87e72e79fe14f83e0a5ce84fdcf0dcc6d97084f
ktca6d636912ac0c0fdd15b712f87e72e79fe14f83e0a5ce84fdcf0dcc6d97084f
agrees the same root computed from every leaf instead (§3.2)
peerca6d636912ac0c0fdd15b712f87e72e79fe14f83e0a5ce84fdcf0dcc6d97084f
ktca6d636912ac0c0fdd15b712f87e72e79fe14f83e0a5ce84fdcf0dcc6d97084f
 agrees
size-16 16 leaves, 1 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[71f0ff59ce2867c4717a81ddc637e21a4eff27b099d3de6472dbeea96061a38e]
kt[71f0ff59ce2867c4717a81ddc637e21a4eff27b099d3de6472dbeea96061a38e]
agrees root folded from those heads (§11.8)
peer71f0ff59ce2867c4717a81ddc637e21a4eff27b099d3de6472dbeea96061a38e
kt71f0ff59ce2867c4717a81ddc637e21a4eff27b099d3de6472dbeea96061a38e
agrees the same root computed from every leaf instead (§3.2)
peer71f0ff59ce2867c4717a81ddc637e21a4eff27b099d3de6472dbeea96061a38e
kt71f0ff59ce2867c4717a81ddc637e21a4eff27b099d3de6472dbeea96061a38e
 agrees
size-17 17 leaves, 2 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[71f0ff59ce2867c4717a81ddc637e21a4eff27b099d3de6472dbeea96061a38e, 25397793ec346527fa718b064d16d0bb05ba11c7ebf95cc82f2aea67f115f617]
kt[71f0ff59ce2867c4717a81ddc637e21a4eff27b099d3de6472dbeea96061a38e, 25397793ec346527fa718b064d16d0bb05ba11c7ebf95cc82f2aea67f115f617]
agrees root folded from those heads (§11.8)
peer51c591652d67aa45f15910e41404506aaa496c93f4c4a09bd662784246b8ce8b
kt51c591652d67aa45f15910e41404506aaa496c93f4c4a09bd662784246b8ce8b
agrees the same root computed from every leaf instead (§3.2)
peer51c591652d67aa45f15910e41404506aaa496c93f4c4a09bd662784246b8ce8b
kt51c591652d67aa45f15910e41404506aaa496c93f4c4a09bd662784246b8ce8b
 agrees
size-18 18 leaves, 2 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[71f0ff59ce2867c4717a81ddc637e21a4eff27b099d3de6472dbeea96061a38e, a4715cf6de3574b567dc86b6121f53c8b24dbd295c06b46a9977632fa3822b36]
kt[71f0ff59ce2867c4717a81ddc637e21a4eff27b099d3de6472dbeea96061a38e, a4715cf6de3574b567dc86b6121f53c8b24dbd295c06b46a9977632fa3822b36]
agrees root folded from those heads (§11.8)
peer3a9defbf1df117d310e9a4a7ae350f847e22e56fc4074e5507789744d6fdc27b
kt3a9defbf1df117d310e9a4a7ae350f847e22e56fc4074e5507789744d6fdc27b
agrees the same root computed from every leaf instead (§3.2)
peer3a9defbf1df117d310e9a4a7ae350f847e22e56fc4074e5507789744d6fdc27b
kt3a9defbf1df117d310e9a4a7ae350f847e22e56fc4074e5507789744d6fdc27b
 agrees
size-19 19 leaves, 3 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[71f0ff59ce2867c4717a81ddc637e21a4eff27b099d3de6472dbeea96061a38e, a4715cf6de3574b567dc86b6121f53c8b24dbd295c06b46a9977632fa3822b36, f99fd1f572f2d321a30d50c4ae015847f8e57e826e60759267c8144f9c4eb249]
kt[71f0ff59ce2867c4717a81ddc637e21a4eff27b099d3de6472dbeea96061a38e, a4715cf6de3574b567dc86b6121f53c8b24dbd295c06b46a9977632fa3822b36, f99fd1f572f2d321a30d50c4ae015847f8e57e826e60759267c8144f9c4eb249]
agrees root folded from those heads (§11.8)
peer1667bcc42ff9c26131d2a79d3dac1ee53390d5939391468d84e1e270ae5c7129
kt1667bcc42ff9c26131d2a79d3dac1ee53390d5939391468d84e1e270ae5c7129
agrees the same root computed from every leaf instead (§3.2)
peer1667bcc42ff9c26131d2a79d3dac1ee53390d5939391468d84e1e270ae5c7129
kt1667bcc42ff9c26131d2a79d3dac1ee53390d5939391468d84e1e270ae5c7129
 agrees
size-20 20 leaves, 2 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[71f0ff59ce2867c4717a81ddc637e21a4eff27b099d3de6472dbeea96061a38e, 658a9827ba2d0808163cad242e8f67f80aeefd545577324e6821065532197172]
kt[71f0ff59ce2867c4717a81ddc637e21a4eff27b099d3de6472dbeea96061a38e, 658a9827ba2d0808163cad242e8f67f80aeefd545577324e6821065532197172]
agrees root folded from those heads (§11.8)
peer860a677a71b0dfd32f75486d03a2c5e6f8f164f1ff395521b193b6cd89c1b036
kt860a677a71b0dfd32f75486d03a2c5e6f8f164f1ff395521b193b6cd89c1b036
agrees the same root computed from every leaf instead (§3.2)
peer860a677a71b0dfd32f75486d03a2c5e6f8f164f1ff395521b193b6cd89c1b036
kt860a677a71b0dfd32f75486d03a2c5e6f8f164f1ff395521b193b6cd89c1b036
 agrees
size-21 21 leaves, 3 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[71f0ff59ce2867c4717a81ddc637e21a4eff27b099d3de6472dbeea96061a38e, 658a9827ba2d0808163cad242e8f67f80aeefd545577324e6821065532197172, ae9ee23b253153263922c0fb70e785c6b1f32e125c40ebf03dead1f5cef1c5d4]
kt[71f0ff59ce2867c4717a81ddc637e21a4eff27b099d3de6472dbeea96061a38e, 658a9827ba2d0808163cad242e8f67f80aeefd545577324e6821065532197172, ae9ee23b253153263922c0fb70e785c6b1f32e125c40ebf03dead1f5cef1c5d4]
agrees root folded from those heads (§11.8)
peer7fe70471f52f9d114a096640d83e5ee4b4f90251ebb349eb30d64ec9c68e2cf9
kt7fe70471f52f9d114a096640d83e5ee4b4f90251ebb349eb30d64ec9c68e2cf9
agrees the same root computed from every leaf instead (§3.2)
peer7fe70471f52f9d114a096640d83e5ee4b4f90251ebb349eb30d64ec9c68e2cf9
kt7fe70471f52f9d114a096640d83e5ee4b4f90251ebb349eb30d64ec9c68e2cf9
 agrees
size-22 22 leaves, 3 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[71f0ff59ce2867c4717a81ddc637e21a4eff27b099d3de6472dbeea96061a38e, 658a9827ba2d0808163cad242e8f67f80aeefd545577324e6821065532197172, 4330918523159d5de6ae81caa8be08221afc8a99c8b69069a4babd6a1aa858fa]
kt[71f0ff59ce2867c4717a81ddc637e21a4eff27b099d3de6472dbeea96061a38e, 658a9827ba2d0808163cad242e8f67f80aeefd545577324e6821065532197172, 4330918523159d5de6ae81caa8be08221afc8a99c8b69069a4babd6a1aa858fa]
agrees root folded from those heads (§11.8)
peerf186b3d20b11bd3eca531ea6a78d0b6704b6cbf9b43403a03ed28ed59015b610
ktf186b3d20b11bd3eca531ea6a78d0b6704b6cbf9b43403a03ed28ed59015b610
agrees the same root computed from every leaf instead (§3.2)
peerf186b3d20b11bd3eca531ea6a78d0b6704b6cbf9b43403a03ed28ed59015b610
ktf186b3d20b11bd3eca531ea6a78d0b6704b6cbf9b43403a03ed28ed59015b610
 agrees
size-23 23 leaves, 4 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[71f0ff59ce2867c4717a81ddc637e21a4eff27b099d3de6472dbeea96061a38e, 658a9827ba2d0808163cad242e8f67f80aeefd545577324e6821065532197172, 4330918523159d5de6ae81caa8be08221afc8a99c8b69069a4babd6a1aa858fa, a2f0735717015b74dd7f2fe355838f2a7fdfd21f8533296046f5179b4a3e086b]
kt[71f0ff59ce2867c4717a81ddc637e21a4eff27b099d3de6472dbeea96061a38e, 658a9827ba2d0808163cad242e8f67f80aeefd545577324e6821065532197172, 4330918523159d5de6ae81caa8be08221afc8a99c8b69069a4babd6a1aa858fa, a2f0735717015b74dd7f2fe355838f2a7fdfd21f8533296046f5179b4a3e086b]
agrees root folded from those heads (§11.8)
peer424bba80a39a34f19668cd0ad6a5a1bea5aefe391304cf281cbe0bc3c5cbca6f
kt424bba80a39a34f19668cd0ad6a5a1bea5aefe391304cf281cbe0bc3c5cbca6f
agrees the same root computed from every leaf instead (§3.2)
peer424bba80a39a34f19668cd0ad6a5a1bea5aefe391304cf281cbe0bc3c5cbca6f
kt424bba80a39a34f19668cd0ad6a5a1bea5aefe391304cf281cbe0bc3c5cbca6f
 agrees
size-24 24 leaves, 2 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[71f0ff59ce2867c4717a81ddc637e21a4eff27b099d3de6472dbeea96061a38e, c72ce6569cd6689e68e08cb77378d5f9dd156ba1a3ee5af795e181a92ab82b1b]
kt[71f0ff59ce2867c4717a81ddc637e21a4eff27b099d3de6472dbeea96061a38e, c72ce6569cd6689e68e08cb77378d5f9dd156ba1a3ee5af795e181a92ab82b1b]
agrees root folded from those heads (§11.8)
peer5cac0cacb4cd98dc12df5cdb0db854c6de8160ce65ec5f08278d119c9058a5d5
kt5cac0cacb4cd98dc12df5cdb0db854c6de8160ce65ec5f08278d119c9058a5d5
agrees the same root computed from every leaf instead (§3.2)
peer5cac0cacb4cd98dc12df5cdb0db854c6de8160ce65ec5f08278d119c9058a5d5
kt5cac0cacb4cd98dc12df5cdb0db854c6de8160ce65ec5f08278d119c9058a5d5
 agrees
size-25 25 leaves, 3 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[71f0ff59ce2867c4717a81ddc637e21a4eff27b099d3de6472dbeea96061a38e, c72ce6569cd6689e68e08cb77378d5f9dd156ba1a3ee5af795e181a92ab82b1b, d660096bbccb3bb6efda05cd77772e35e412d8cf153c269019144f7dc9073188]
kt[71f0ff59ce2867c4717a81ddc637e21a4eff27b099d3de6472dbeea96061a38e, c72ce6569cd6689e68e08cb77378d5f9dd156ba1a3ee5af795e181a92ab82b1b, d660096bbccb3bb6efda05cd77772e35e412d8cf153c269019144f7dc9073188]
agrees root folded from those heads (§11.8)
peer6ae83d617b2ffef17715966f2a15543ef6fd142ed9c22c10b7943496dfb9da87
kt6ae83d617b2ffef17715966f2a15543ef6fd142ed9c22c10b7943496dfb9da87
agrees the same root computed from every leaf instead (§3.2)
peer6ae83d617b2ffef17715966f2a15543ef6fd142ed9c22c10b7943496dfb9da87
kt6ae83d617b2ffef17715966f2a15543ef6fd142ed9c22c10b7943496dfb9da87
 agrees
size-26 26 leaves, 3 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[71f0ff59ce2867c4717a81ddc637e21a4eff27b099d3de6472dbeea96061a38e, c72ce6569cd6689e68e08cb77378d5f9dd156ba1a3ee5af795e181a92ab82b1b, 734434aef58b9e0e34065f4759d3b6fa8f8a0e572802dc817cfb62a1af5fdde4]
kt[71f0ff59ce2867c4717a81ddc637e21a4eff27b099d3de6472dbeea96061a38e, c72ce6569cd6689e68e08cb77378d5f9dd156ba1a3ee5af795e181a92ab82b1b, 734434aef58b9e0e34065f4759d3b6fa8f8a0e572802dc817cfb62a1af5fdde4]
agrees root folded from those heads (§11.8)
peer9fdca3fe8b6dea3343f062fea96dada2d3d8a061f5d3af8813331bbe2fd3aebe
kt9fdca3fe8b6dea3343f062fea96dada2d3d8a061f5d3af8813331bbe2fd3aebe
agrees the same root computed from every leaf instead (§3.2)
peer9fdca3fe8b6dea3343f062fea96dada2d3d8a061f5d3af8813331bbe2fd3aebe
kt9fdca3fe8b6dea3343f062fea96dada2d3d8a061f5d3af8813331bbe2fd3aebe
 agrees
size-27 27 leaves, 4 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[71f0ff59ce2867c4717a81ddc637e21a4eff27b099d3de6472dbeea96061a38e, c72ce6569cd6689e68e08cb77378d5f9dd156ba1a3ee5af795e181a92ab82b1b, 734434aef58b9e0e34065f4759d3b6fa8f8a0e572802dc817cfb62a1af5fdde4, a7157b4584f350103fef2087e3018aa873347bdf07d5ab406695895e7edfdaf0]
kt[71f0ff59ce2867c4717a81ddc637e21a4eff27b099d3de6472dbeea96061a38e, c72ce6569cd6689e68e08cb77378d5f9dd156ba1a3ee5af795e181a92ab82b1b, 734434aef58b9e0e34065f4759d3b6fa8f8a0e572802dc817cfb62a1af5fdde4, a7157b4584f350103fef2087e3018aa873347bdf07d5ab406695895e7edfdaf0]
agrees root folded from those heads (§11.8)
peer2acb7d4c18d7e424dae733c2b25e0ccbac64aa009816783ab1b6eb8579c76ed7
kt2acb7d4c18d7e424dae733c2b25e0ccbac64aa009816783ab1b6eb8579c76ed7
agrees the same root computed from every leaf instead (§3.2)
peer2acb7d4c18d7e424dae733c2b25e0ccbac64aa009816783ab1b6eb8579c76ed7
kt2acb7d4c18d7e424dae733c2b25e0ccbac64aa009816783ab1b6eb8579c76ed7
 agrees
size-28 28 leaves, 3 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[71f0ff59ce2867c4717a81ddc637e21a4eff27b099d3de6472dbeea96061a38e, c72ce6569cd6689e68e08cb77378d5f9dd156ba1a3ee5af795e181a92ab82b1b, 8d25dc3f4338cf9d3d6d92dbec2d77e7d7e1bb00b2b521cbe9b4df18a3c4d28f]
kt[71f0ff59ce2867c4717a81ddc637e21a4eff27b099d3de6472dbeea96061a38e, c72ce6569cd6689e68e08cb77378d5f9dd156ba1a3ee5af795e181a92ab82b1b, 8d25dc3f4338cf9d3d6d92dbec2d77e7d7e1bb00b2b521cbe9b4df18a3c4d28f]
agrees root folded from those heads (§11.8)
peer307926094517f0fb094ddb56f4d7cc5e103c95444b91d9227686d995a6600fd9
kt307926094517f0fb094ddb56f4d7cc5e103c95444b91d9227686d995a6600fd9
agrees the same root computed from every leaf instead (§3.2)
peer307926094517f0fb094ddb56f4d7cc5e103c95444b91d9227686d995a6600fd9
kt307926094517f0fb094ddb56f4d7cc5e103c95444b91d9227686d995a6600fd9
 agrees
size-29 29 leaves, 4 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[71f0ff59ce2867c4717a81ddc637e21a4eff27b099d3de6472dbeea96061a38e, c72ce6569cd6689e68e08cb77378d5f9dd156ba1a3ee5af795e181a92ab82b1b, 8d25dc3f4338cf9d3d6d92dbec2d77e7d7e1bb00b2b521cbe9b4df18a3c4d28f, bc0af4d1f9e34ca5235c89e62ecf42430c7b639cc8544351d0bf3f248c477431]
kt[71f0ff59ce2867c4717a81ddc637e21a4eff27b099d3de6472dbeea96061a38e, c72ce6569cd6689e68e08cb77378d5f9dd156ba1a3ee5af795e181a92ab82b1b, 8d25dc3f4338cf9d3d6d92dbec2d77e7d7e1bb00b2b521cbe9b4df18a3c4d28f, bc0af4d1f9e34ca5235c89e62ecf42430c7b639cc8544351d0bf3f248c477431]
agrees root folded from those heads (§11.8)
peer9e62c642bbb55cb21c61b8aa0debcb628360bf1b2ed12bad1e839b3b1daa6816
kt9e62c642bbb55cb21c61b8aa0debcb628360bf1b2ed12bad1e839b3b1daa6816
agrees the same root computed from every leaf instead (§3.2)
peer9e62c642bbb55cb21c61b8aa0debcb628360bf1b2ed12bad1e839b3b1daa6816
kt9e62c642bbb55cb21c61b8aa0debcb628360bf1b2ed12bad1e839b3b1daa6816
 agrees
size-30 30 leaves, 4 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[71f0ff59ce2867c4717a81ddc637e21a4eff27b099d3de6472dbeea96061a38e, c72ce6569cd6689e68e08cb77378d5f9dd156ba1a3ee5af795e181a92ab82b1b, 8d25dc3f4338cf9d3d6d92dbec2d77e7d7e1bb00b2b521cbe9b4df18a3c4d28f, ad0788f11a3568e93645d34293b02ec4fa9eaac50248c875cf8a44509c1d8f33]
kt[71f0ff59ce2867c4717a81ddc637e21a4eff27b099d3de6472dbeea96061a38e, c72ce6569cd6689e68e08cb77378d5f9dd156ba1a3ee5af795e181a92ab82b1b, 8d25dc3f4338cf9d3d6d92dbec2d77e7d7e1bb00b2b521cbe9b4df18a3c4d28f, ad0788f11a3568e93645d34293b02ec4fa9eaac50248c875cf8a44509c1d8f33]
agrees root folded from those heads (§11.8)
peer8a08cda94c05fe4b3612bd6f8488582bfff1c1d803b95f126920e811b3266642
kt8a08cda94c05fe4b3612bd6f8488582bfff1c1d803b95f126920e811b3266642
agrees the same root computed from every leaf instead (§3.2)
peer8a08cda94c05fe4b3612bd6f8488582bfff1c1d803b95f126920e811b3266642
kt8a08cda94c05fe4b3612bd6f8488582bfff1c1d803b95f126920e811b3266642
 agrees
size-31 31 leaves, 5 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[71f0ff59ce2867c4717a81ddc637e21a4eff27b099d3de6472dbeea96061a38e, c72ce6569cd6689e68e08cb77378d5f9dd156ba1a3ee5af795e181a92ab82b1b, 8d25dc3f4338cf9d3d6d92dbec2d77e7d7e1bb00b2b521cbe9b4df18a3c4d28f, ad0788f11a3568e93645d34293b02ec4fa9eaac50248c875cf8a44509c1d8f33, 90980a9bd66473cc9469cc7153ce7832eca5f6f41eb420f123d294f57db407c9]
kt[71f0ff59ce2867c4717a81ddc637e21a4eff27b099d3de6472dbeea96061a38e, c72ce6569cd6689e68e08cb77378d5f9dd156ba1a3ee5af795e181a92ab82b1b, 8d25dc3f4338cf9d3d6d92dbec2d77e7d7e1bb00b2b521cbe9b4df18a3c4d28f, ad0788f11a3568e93645d34293b02ec4fa9eaac50248c875cf8a44509c1d8f33, 90980a9bd66473cc9469cc7153ce7832eca5f6f41eb420f123d294f57db407c9]
agrees root folded from those heads (§11.8)
peerfeb7b52706ff6f68ab56bc33b06f05727eba94d04c21beba448878c3954f7bb2
ktfeb7b52706ff6f68ab56bc33b06f05727eba94d04c21beba448878c3954f7bb2
agrees the same root computed from every leaf instead (§3.2)
peerfeb7b52706ff6f68ab56bc33b06f05727eba94d04c21beba448878c3954f7bb2
ktfeb7b52706ff6f68ab56bc33b06f05727eba94d04c21beba448878c3954f7bb2
 agrees
size-32 32 leaves, 1 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53]
kt[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53]
agrees root folded from those heads (§11.8)
peerd6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53
ktd6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53
agrees the same root computed from every leaf instead (§3.2)
peerd6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53
ktd6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53
 agrees
size-33 33 leaves, 2 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, 4d3ea048961d227d4e07010f40fde48baa69ba14f52c09fcf32ab0cf7aa7b7e2]
kt[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, 4d3ea048961d227d4e07010f40fde48baa69ba14f52c09fcf32ab0cf7aa7b7e2]
agrees root folded from those heads (§11.8)
peer56a0ea987e104793de359fc4e9dce3b363d65ea10233a3d86bfa4c78449ce2f7
kt56a0ea987e104793de359fc4e9dce3b363d65ea10233a3d86bfa4c78449ce2f7
agrees the same root computed from every leaf instead (§3.2)
peer56a0ea987e104793de359fc4e9dce3b363d65ea10233a3d86bfa4c78449ce2f7
kt56a0ea987e104793de359fc4e9dce3b363d65ea10233a3d86bfa4c78449ce2f7
 agrees
size-34 34 leaves, 2 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, f6492efc0a0f5a7fb96e7b3edfee7116659b8620fd03d54367ee1241334e8afb]
kt[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, f6492efc0a0f5a7fb96e7b3edfee7116659b8620fd03d54367ee1241334e8afb]
agrees root folded from those heads (§11.8)
peer7456e845b4e9a4e1c2eaaf6e45a9038024050e2f9575f8eaae1a0dd7c841527a
kt7456e845b4e9a4e1c2eaaf6e45a9038024050e2f9575f8eaae1a0dd7c841527a
agrees the same root computed from every leaf instead (§3.2)
peer7456e845b4e9a4e1c2eaaf6e45a9038024050e2f9575f8eaae1a0dd7c841527a
kt7456e845b4e9a4e1c2eaaf6e45a9038024050e2f9575f8eaae1a0dd7c841527a
 agrees
size-35 35 leaves, 3 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, f6492efc0a0f5a7fb96e7b3edfee7116659b8620fd03d54367ee1241334e8afb, b86d7c6570d3920ba9b07e776965b6edddd86dcf9ceca37bcfac5af1dd9976cd]
kt[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, f6492efc0a0f5a7fb96e7b3edfee7116659b8620fd03d54367ee1241334e8afb, b86d7c6570d3920ba9b07e776965b6edddd86dcf9ceca37bcfac5af1dd9976cd]
agrees root folded from those heads (§11.8)
peere652e021a31439c07a9f30aaeb50fe8cdfc8201f735323cfd6f67d499c7a47ca
kte652e021a31439c07a9f30aaeb50fe8cdfc8201f735323cfd6f67d499c7a47ca
agrees the same root computed from every leaf instead (§3.2)
peere652e021a31439c07a9f30aaeb50fe8cdfc8201f735323cfd6f67d499c7a47ca
kte652e021a31439c07a9f30aaeb50fe8cdfc8201f735323cfd6f67d499c7a47ca
 agrees
size-36 36 leaves, 2 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, be249435d3cc6f1e64ce41b65f876a4277ff6c2ccfdf7465890c5744044d509e]
kt[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, be249435d3cc6f1e64ce41b65f876a4277ff6c2ccfdf7465890c5744044d509e]
agrees root folded from those heads (§11.8)
peer0fdf9d981ede10ae3f8cd5af4b69bd0612c9e2243e57d8ff0727563050707fbf
kt0fdf9d981ede10ae3f8cd5af4b69bd0612c9e2243e57d8ff0727563050707fbf
agrees the same root computed from every leaf instead (§3.2)
peer0fdf9d981ede10ae3f8cd5af4b69bd0612c9e2243e57d8ff0727563050707fbf
kt0fdf9d981ede10ae3f8cd5af4b69bd0612c9e2243e57d8ff0727563050707fbf
 agrees
size-37 37 leaves, 3 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, be249435d3cc6f1e64ce41b65f876a4277ff6c2ccfdf7465890c5744044d509e, 165a74ea86e5032326eb823a4be039e5b874f04d828c767e194da36f53271947]
kt[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, be249435d3cc6f1e64ce41b65f876a4277ff6c2ccfdf7465890c5744044d509e, 165a74ea86e5032326eb823a4be039e5b874f04d828c767e194da36f53271947]
agrees root folded from those heads (§11.8)
peerc81489129e71d36a7e55343deded8e4ab434beb970042fbb6d261b967aca0c61
ktc81489129e71d36a7e55343deded8e4ab434beb970042fbb6d261b967aca0c61
agrees the same root computed from every leaf instead (§3.2)
peerc81489129e71d36a7e55343deded8e4ab434beb970042fbb6d261b967aca0c61
ktc81489129e71d36a7e55343deded8e4ab434beb970042fbb6d261b967aca0c61
 agrees
size-38 38 leaves, 3 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, be249435d3cc6f1e64ce41b65f876a4277ff6c2ccfdf7465890c5744044d509e, 4934fe13c41755ccdfa36269b16d92eea148b5430de93fa60d2b56ed638165c0]
kt[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, be249435d3cc6f1e64ce41b65f876a4277ff6c2ccfdf7465890c5744044d509e, 4934fe13c41755ccdfa36269b16d92eea148b5430de93fa60d2b56ed638165c0]
agrees root folded from those heads (§11.8)
peerb69d70b45bf7a77a7a181df9320fba524ff536e00a150ce4198610c5dfc67c5a
ktb69d70b45bf7a77a7a181df9320fba524ff536e00a150ce4198610c5dfc67c5a
agrees the same root computed from every leaf instead (§3.2)
peerb69d70b45bf7a77a7a181df9320fba524ff536e00a150ce4198610c5dfc67c5a
ktb69d70b45bf7a77a7a181df9320fba524ff536e00a150ce4198610c5dfc67c5a
 agrees
size-39 39 leaves, 4 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, be249435d3cc6f1e64ce41b65f876a4277ff6c2ccfdf7465890c5744044d509e, 4934fe13c41755ccdfa36269b16d92eea148b5430de93fa60d2b56ed638165c0, 1c03c56f3e4c511522e93db19e069f049d3a4cb33dc63718d30ed7348266b0d6]
kt[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, be249435d3cc6f1e64ce41b65f876a4277ff6c2ccfdf7465890c5744044d509e, 4934fe13c41755ccdfa36269b16d92eea148b5430de93fa60d2b56ed638165c0, 1c03c56f3e4c511522e93db19e069f049d3a4cb33dc63718d30ed7348266b0d6]
agrees root folded from those heads (§11.8)
peerc229956316f172cb362830a66db66959f9899d7624435634de308a01cf366ad1
ktc229956316f172cb362830a66db66959f9899d7624435634de308a01cf366ad1
agrees the same root computed from every leaf instead (§3.2)
peerc229956316f172cb362830a66db66959f9899d7624435634de308a01cf366ad1
ktc229956316f172cb362830a66db66959f9899d7624435634de308a01cf366ad1
 agrees
size-40 40 leaves, 2 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, 5694517a401c47bffb7513e486e140545d75d2afa414e172b384cb0907ead59e]
kt[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, 5694517a401c47bffb7513e486e140545d75d2afa414e172b384cb0907ead59e]
agrees root folded from those heads (§11.8)
peerc705c9a014a1fa15c6522dcec22581989b2e5fa68ccc621f6d0312fb83e6ab68
ktc705c9a014a1fa15c6522dcec22581989b2e5fa68ccc621f6d0312fb83e6ab68
agrees the same root computed from every leaf instead (§3.2)
peerc705c9a014a1fa15c6522dcec22581989b2e5fa68ccc621f6d0312fb83e6ab68
ktc705c9a014a1fa15c6522dcec22581989b2e5fa68ccc621f6d0312fb83e6ab68
 agrees
size-41 41 leaves, 3 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, 5694517a401c47bffb7513e486e140545d75d2afa414e172b384cb0907ead59e, 7cc976c2ac4a8c7a6e34a78239186bffebffffa998787ac6377fca1f08d4bbdc]
kt[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, 5694517a401c47bffb7513e486e140545d75d2afa414e172b384cb0907ead59e, 7cc976c2ac4a8c7a6e34a78239186bffebffffa998787ac6377fca1f08d4bbdc]
agrees root folded from those heads (§11.8)
peerbb60927792dd480b10f4eedb45e808d43ed433020a4a8b8d46c5919507f954ab
ktbb60927792dd480b10f4eedb45e808d43ed433020a4a8b8d46c5919507f954ab
agrees the same root computed from every leaf instead (§3.2)
peerbb60927792dd480b10f4eedb45e808d43ed433020a4a8b8d46c5919507f954ab
ktbb60927792dd480b10f4eedb45e808d43ed433020a4a8b8d46c5919507f954ab
 agrees
size-42 42 leaves, 3 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, 5694517a401c47bffb7513e486e140545d75d2afa414e172b384cb0907ead59e, 448529e69e0d4ec8eb9314cab5b8404452e3b89f373f491c408c1f972bf6ac84]
kt[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, 5694517a401c47bffb7513e486e140545d75d2afa414e172b384cb0907ead59e, 448529e69e0d4ec8eb9314cab5b8404452e3b89f373f491c408c1f972bf6ac84]
agrees root folded from those heads (§11.8)
peer97ca535454ed95029b6482abfd02b45fb86c081131ef63861140fb18debb5740
kt97ca535454ed95029b6482abfd02b45fb86c081131ef63861140fb18debb5740
agrees the same root computed from every leaf instead (§3.2)
peer97ca535454ed95029b6482abfd02b45fb86c081131ef63861140fb18debb5740
kt97ca535454ed95029b6482abfd02b45fb86c081131ef63861140fb18debb5740
 agrees
size-43 43 leaves, 4 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, 5694517a401c47bffb7513e486e140545d75d2afa414e172b384cb0907ead59e, 448529e69e0d4ec8eb9314cab5b8404452e3b89f373f491c408c1f972bf6ac84, 2f80390529043045f897f634dc090ce78e49bbfbc9a905a4edf4a2be7c8241f7]
kt[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, 5694517a401c47bffb7513e486e140545d75d2afa414e172b384cb0907ead59e, 448529e69e0d4ec8eb9314cab5b8404452e3b89f373f491c408c1f972bf6ac84, 2f80390529043045f897f634dc090ce78e49bbfbc9a905a4edf4a2be7c8241f7]
agrees root folded from those heads (§11.8)
peerc45096a96932013b3ba4697ecb3440e3082985d658da85135f37ff4750d8839b
ktc45096a96932013b3ba4697ecb3440e3082985d658da85135f37ff4750d8839b
agrees the same root computed from every leaf instead (§3.2)
peerc45096a96932013b3ba4697ecb3440e3082985d658da85135f37ff4750d8839b
ktc45096a96932013b3ba4697ecb3440e3082985d658da85135f37ff4750d8839b
 agrees
size-44 44 leaves, 3 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, 5694517a401c47bffb7513e486e140545d75d2afa414e172b384cb0907ead59e, bbefa89243b4719b1e5ab6471b2ce8e61aa1945217be79b3e588c9ff2617264a]
kt[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, 5694517a401c47bffb7513e486e140545d75d2afa414e172b384cb0907ead59e, bbefa89243b4719b1e5ab6471b2ce8e61aa1945217be79b3e588c9ff2617264a]
agrees root folded from those heads (§11.8)
peer73c32d050db615bf49916cefbb74822352420d2b6b90187a561c1f81a582d81b
kt73c32d050db615bf49916cefbb74822352420d2b6b90187a561c1f81a582d81b
agrees the same root computed from every leaf instead (§3.2)
peer73c32d050db615bf49916cefbb74822352420d2b6b90187a561c1f81a582d81b
kt73c32d050db615bf49916cefbb74822352420d2b6b90187a561c1f81a582d81b
 agrees
size-45 45 leaves, 4 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, 5694517a401c47bffb7513e486e140545d75d2afa414e172b384cb0907ead59e, bbefa89243b4719b1e5ab6471b2ce8e61aa1945217be79b3e588c9ff2617264a, 5fc32f3843e87c70acf07db88b92380f733ac27426c6b8af5b87b6f3929dea4a]
kt[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, 5694517a401c47bffb7513e486e140545d75d2afa414e172b384cb0907ead59e, bbefa89243b4719b1e5ab6471b2ce8e61aa1945217be79b3e588c9ff2617264a, 5fc32f3843e87c70acf07db88b92380f733ac27426c6b8af5b87b6f3929dea4a]
agrees root folded from those heads (§11.8)
peer3256d415940a2e7a5f646dd3783f77f89af27ba813228e01018da22d7494598f
kt3256d415940a2e7a5f646dd3783f77f89af27ba813228e01018da22d7494598f
agrees the same root computed from every leaf instead (§3.2)
peer3256d415940a2e7a5f646dd3783f77f89af27ba813228e01018da22d7494598f
kt3256d415940a2e7a5f646dd3783f77f89af27ba813228e01018da22d7494598f
 agrees
size-46 46 leaves, 4 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, 5694517a401c47bffb7513e486e140545d75d2afa414e172b384cb0907ead59e, bbefa89243b4719b1e5ab6471b2ce8e61aa1945217be79b3e588c9ff2617264a, ecc188aecdc505b1ce1aa77d0dc10a00f7acf93f977d1aa7acb93d9082e45c33]
kt[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, 5694517a401c47bffb7513e486e140545d75d2afa414e172b384cb0907ead59e, bbefa89243b4719b1e5ab6471b2ce8e61aa1945217be79b3e588c9ff2617264a, ecc188aecdc505b1ce1aa77d0dc10a00f7acf93f977d1aa7acb93d9082e45c33]
agrees root folded from those heads (§11.8)
peer868c54c4f925e7ceeb137545ae0164efe3f0527be5897d513458556e8a1aa951
kt868c54c4f925e7ceeb137545ae0164efe3f0527be5897d513458556e8a1aa951
agrees the same root computed from every leaf instead (§3.2)
peer868c54c4f925e7ceeb137545ae0164efe3f0527be5897d513458556e8a1aa951
kt868c54c4f925e7ceeb137545ae0164efe3f0527be5897d513458556e8a1aa951
 agrees
size-47 47 leaves, 5 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, 5694517a401c47bffb7513e486e140545d75d2afa414e172b384cb0907ead59e, bbefa89243b4719b1e5ab6471b2ce8e61aa1945217be79b3e588c9ff2617264a, ecc188aecdc505b1ce1aa77d0dc10a00f7acf93f977d1aa7acb93d9082e45c33, 9c2666b6df9dd8a92fa800a00072a5942e2338651d7303ce083b75726af0dbf2]
kt[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, 5694517a401c47bffb7513e486e140545d75d2afa414e172b384cb0907ead59e, bbefa89243b4719b1e5ab6471b2ce8e61aa1945217be79b3e588c9ff2617264a, ecc188aecdc505b1ce1aa77d0dc10a00f7acf93f977d1aa7acb93d9082e45c33, 9c2666b6df9dd8a92fa800a00072a5942e2338651d7303ce083b75726af0dbf2]
agrees root folded from those heads (§11.8)
peer31b40429aab4c700138a2980f1c0e9145cfd7ffed4aff5c9bd78e1c2a8329d36
kt31b40429aab4c700138a2980f1c0e9145cfd7ffed4aff5c9bd78e1c2a8329d36
agrees the same root computed from every leaf instead (§3.2)
peer31b40429aab4c700138a2980f1c0e9145cfd7ffed4aff5c9bd78e1c2a8329d36
kt31b40429aab4c700138a2980f1c0e9145cfd7ffed4aff5c9bd78e1c2a8329d36
 agrees
size-48 48 leaves, 2 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, eba98e51569b1727dd8e9298e2a2885f382f1ef7de73ea86eda5aac2387465a0]
kt[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, eba98e51569b1727dd8e9298e2a2885f382f1ef7de73ea86eda5aac2387465a0]
agrees root folded from those heads (§11.8)
peer0f6347024e068cf119daf657895d33b510a8ebde415d0afd4f74235d45d76fa2
kt0f6347024e068cf119daf657895d33b510a8ebde415d0afd4f74235d45d76fa2
agrees the same root computed from every leaf instead (§3.2)
peer0f6347024e068cf119daf657895d33b510a8ebde415d0afd4f74235d45d76fa2
kt0f6347024e068cf119daf657895d33b510a8ebde415d0afd4f74235d45d76fa2
 agrees
size-49 49 leaves, 3 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, eba98e51569b1727dd8e9298e2a2885f382f1ef7de73ea86eda5aac2387465a0, 978753b8efa737e1d88eaefff5ad5b6fd68b014392244e77034d1acdf801e6c6]
kt[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, eba98e51569b1727dd8e9298e2a2885f382f1ef7de73ea86eda5aac2387465a0, 978753b8efa737e1d88eaefff5ad5b6fd68b014392244e77034d1acdf801e6c6]
agrees root folded from those heads (§11.8)
peerab0738714070d127cbb2a96584d8ec75b0953a8b618dc7c71498de3d96fb5408
ktab0738714070d127cbb2a96584d8ec75b0953a8b618dc7c71498de3d96fb5408
agrees the same root computed from every leaf instead (§3.2)
peerab0738714070d127cbb2a96584d8ec75b0953a8b618dc7c71498de3d96fb5408
ktab0738714070d127cbb2a96584d8ec75b0953a8b618dc7c71498de3d96fb5408
 agrees
size-50 50 leaves, 3 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, eba98e51569b1727dd8e9298e2a2885f382f1ef7de73ea86eda5aac2387465a0, 8630beadffab2d96da32af61450a66da6e7bc264d209b410a3345b4f217e91b1]
kt[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, eba98e51569b1727dd8e9298e2a2885f382f1ef7de73ea86eda5aac2387465a0, 8630beadffab2d96da32af61450a66da6e7bc264d209b410a3345b4f217e91b1]
agrees root folded from those heads (§11.8)
peer67681ff8f57aaeb95be91c9f199dc31faadd937e52c0ecfdb412db3b4030e336
kt67681ff8f57aaeb95be91c9f199dc31faadd937e52c0ecfdb412db3b4030e336
agrees the same root computed from every leaf instead (§3.2)
peer67681ff8f57aaeb95be91c9f199dc31faadd937e52c0ecfdb412db3b4030e336
kt67681ff8f57aaeb95be91c9f199dc31faadd937e52c0ecfdb412db3b4030e336
 agrees
size-51 51 leaves, 4 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, eba98e51569b1727dd8e9298e2a2885f382f1ef7de73ea86eda5aac2387465a0, 8630beadffab2d96da32af61450a66da6e7bc264d209b410a3345b4f217e91b1, b31f2b2292e2db2444d0811473de9ef8bbb1eda25cc66f9f36428bf63cb90e93]
kt[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, eba98e51569b1727dd8e9298e2a2885f382f1ef7de73ea86eda5aac2387465a0, 8630beadffab2d96da32af61450a66da6e7bc264d209b410a3345b4f217e91b1, b31f2b2292e2db2444d0811473de9ef8bbb1eda25cc66f9f36428bf63cb90e93]
agrees root folded from those heads (§11.8)
peerbd78645137c99c47787ac29a43060f5400611de378283e01cf9268b23f06166b
ktbd78645137c99c47787ac29a43060f5400611de378283e01cf9268b23f06166b
agrees the same root computed from every leaf instead (§3.2)
peerbd78645137c99c47787ac29a43060f5400611de378283e01cf9268b23f06166b
ktbd78645137c99c47787ac29a43060f5400611de378283e01cf9268b23f06166b
 agrees
size-52 52 leaves, 3 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, eba98e51569b1727dd8e9298e2a2885f382f1ef7de73ea86eda5aac2387465a0, 5d5c5407bb5bc77186215b859e8e37a4b367106b0e1c686b5d343739ed51073f]
kt[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, eba98e51569b1727dd8e9298e2a2885f382f1ef7de73ea86eda5aac2387465a0, 5d5c5407bb5bc77186215b859e8e37a4b367106b0e1c686b5d343739ed51073f]
agrees root folded from those heads (§11.8)
peer57051aaf2ba14f1d97bbfd34fe702532fff5ff9ff6de862526d7c4cb49f60d7d
kt57051aaf2ba14f1d97bbfd34fe702532fff5ff9ff6de862526d7c4cb49f60d7d
agrees the same root computed from every leaf instead (§3.2)
peer57051aaf2ba14f1d97bbfd34fe702532fff5ff9ff6de862526d7c4cb49f60d7d
kt57051aaf2ba14f1d97bbfd34fe702532fff5ff9ff6de862526d7c4cb49f60d7d
 agrees
size-53 53 leaves, 4 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, eba98e51569b1727dd8e9298e2a2885f382f1ef7de73ea86eda5aac2387465a0, 5d5c5407bb5bc77186215b859e8e37a4b367106b0e1c686b5d343739ed51073f, 29059ff1cde57f6983e178a334b4573b43eaf746c3d1415a351b172e6af472b6]
kt[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, eba98e51569b1727dd8e9298e2a2885f382f1ef7de73ea86eda5aac2387465a0, 5d5c5407bb5bc77186215b859e8e37a4b367106b0e1c686b5d343739ed51073f, 29059ff1cde57f6983e178a334b4573b43eaf746c3d1415a351b172e6af472b6]
agrees root folded from those heads (§11.8)
peer7c1c04e48ea1438e4c60bd01ff586845a6741e9b645f8cd96c87fb49eb0303d9
kt7c1c04e48ea1438e4c60bd01ff586845a6741e9b645f8cd96c87fb49eb0303d9
agrees the same root computed from every leaf instead (§3.2)
peer7c1c04e48ea1438e4c60bd01ff586845a6741e9b645f8cd96c87fb49eb0303d9
kt7c1c04e48ea1438e4c60bd01ff586845a6741e9b645f8cd96c87fb49eb0303d9
 agrees
size-54 54 leaves, 4 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, eba98e51569b1727dd8e9298e2a2885f382f1ef7de73ea86eda5aac2387465a0, 5d5c5407bb5bc77186215b859e8e37a4b367106b0e1c686b5d343739ed51073f, fb259c2c660e899bf5473de4469af737796c97f8bfa0a1f6df6633925fb840d7]
kt[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, eba98e51569b1727dd8e9298e2a2885f382f1ef7de73ea86eda5aac2387465a0, 5d5c5407bb5bc77186215b859e8e37a4b367106b0e1c686b5d343739ed51073f, fb259c2c660e899bf5473de4469af737796c97f8bfa0a1f6df6633925fb840d7]
agrees root folded from those heads (§11.8)
peer779fafb8a717769c11f24a07e837697854cd6dc7d87873c6d924f060b4410465
kt779fafb8a717769c11f24a07e837697854cd6dc7d87873c6d924f060b4410465
agrees the same root computed from every leaf instead (§3.2)
peer779fafb8a717769c11f24a07e837697854cd6dc7d87873c6d924f060b4410465
kt779fafb8a717769c11f24a07e837697854cd6dc7d87873c6d924f060b4410465
 agrees
size-55 55 leaves, 5 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, eba98e51569b1727dd8e9298e2a2885f382f1ef7de73ea86eda5aac2387465a0, 5d5c5407bb5bc77186215b859e8e37a4b367106b0e1c686b5d343739ed51073f, fb259c2c660e899bf5473de4469af737796c97f8bfa0a1f6df6633925fb840d7, abf1fddacd31e7a73fd734a7c96754f230f5c216f9dc129b7555b1dcd38189aa]
kt[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, eba98e51569b1727dd8e9298e2a2885f382f1ef7de73ea86eda5aac2387465a0, 5d5c5407bb5bc77186215b859e8e37a4b367106b0e1c686b5d343739ed51073f, fb259c2c660e899bf5473de4469af737796c97f8bfa0a1f6df6633925fb840d7, abf1fddacd31e7a73fd734a7c96754f230f5c216f9dc129b7555b1dcd38189aa]
agrees root folded from those heads (§11.8)
peer1c27a1a657e81a14710c1ae04aafae1218a7de25b4e092cea178bb2b00e18bf5
kt1c27a1a657e81a14710c1ae04aafae1218a7de25b4e092cea178bb2b00e18bf5
agrees the same root computed from every leaf instead (§3.2)
peer1c27a1a657e81a14710c1ae04aafae1218a7de25b4e092cea178bb2b00e18bf5
kt1c27a1a657e81a14710c1ae04aafae1218a7de25b4e092cea178bb2b00e18bf5
 agrees
size-56 56 leaves, 3 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, eba98e51569b1727dd8e9298e2a2885f382f1ef7de73ea86eda5aac2387465a0, ea24b4bad3c145c467f3f4ef17658c4ca91438d3c8b161414fe2c193887d969e]
kt[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, eba98e51569b1727dd8e9298e2a2885f382f1ef7de73ea86eda5aac2387465a0, ea24b4bad3c145c467f3f4ef17658c4ca91438d3c8b161414fe2c193887d969e]
agrees root folded from those heads (§11.8)
peerb7b2bc9b8cc38ba4f528e5f9d506d477a783d1124634a1cd94cfb12b8f984ed7
ktb7b2bc9b8cc38ba4f528e5f9d506d477a783d1124634a1cd94cfb12b8f984ed7
agrees the same root computed from every leaf instead (§3.2)
peerb7b2bc9b8cc38ba4f528e5f9d506d477a783d1124634a1cd94cfb12b8f984ed7
ktb7b2bc9b8cc38ba4f528e5f9d506d477a783d1124634a1cd94cfb12b8f984ed7
 agrees
size-57 57 leaves, 4 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, eba98e51569b1727dd8e9298e2a2885f382f1ef7de73ea86eda5aac2387465a0, ea24b4bad3c145c467f3f4ef17658c4ca91438d3c8b161414fe2c193887d969e, 7365de3a7ea04eea8ba3814d329848b21e76431f711fa0d36c86c31d8bebd781]
kt[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, eba98e51569b1727dd8e9298e2a2885f382f1ef7de73ea86eda5aac2387465a0, ea24b4bad3c145c467f3f4ef17658c4ca91438d3c8b161414fe2c193887d969e, 7365de3a7ea04eea8ba3814d329848b21e76431f711fa0d36c86c31d8bebd781]
agrees root folded from those heads (§11.8)
peer261d66a8b48f4fe119e81f6479da225b318f0d5217763e3c330efcaf5ba7a3b8
kt261d66a8b48f4fe119e81f6479da225b318f0d5217763e3c330efcaf5ba7a3b8
agrees the same root computed from every leaf instead (§3.2)
peer261d66a8b48f4fe119e81f6479da225b318f0d5217763e3c330efcaf5ba7a3b8
kt261d66a8b48f4fe119e81f6479da225b318f0d5217763e3c330efcaf5ba7a3b8
 agrees
size-58 58 leaves, 4 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, eba98e51569b1727dd8e9298e2a2885f382f1ef7de73ea86eda5aac2387465a0, ea24b4bad3c145c467f3f4ef17658c4ca91438d3c8b161414fe2c193887d969e, 644bf46f00bfc2d77705440a81a05a50f7b2c9dc8b5788726db3bd72213ca6bb]
kt[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, eba98e51569b1727dd8e9298e2a2885f382f1ef7de73ea86eda5aac2387465a0, ea24b4bad3c145c467f3f4ef17658c4ca91438d3c8b161414fe2c193887d969e, 644bf46f00bfc2d77705440a81a05a50f7b2c9dc8b5788726db3bd72213ca6bb]
agrees root folded from those heads (§11.8)
peer931cf86e042e4e15d816c4083b2b4a91093de2604f5901c979e507f9404518db
kt931cf86e042e4e15d816c4083b2b4a91093de2604f5901c979e507f9404518db
agrees the same root computed from every leaf instead (§3.2)
peer931cf86e042e4e15d816c4083b2b4a91093de2604f5901c979e507f9404518db
kt931cf86e042e4e15d816c4083b2b4a91093de2604f5901c979e507f9404518db
 agrees
size-59 59 leaves, 5 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, eba98e51569b1727dd8e9298e2a2885f382f1ef7de73ea86eda5aac2387465a0, ea24b4bad3c145c467f3f4ef17658c4ca91438d3c8b161414fe2c193887d969e, 644bf46f00bfc2d77705440a81a05a50f7b2c9dc8b5788726db3bd72213ca6bb, f54649699c0a16e948b12b0a5f32a8eb95a2b522e551412e99b82ecae6c11540]
kt[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, eba98e51569b1727dd8e9298e2a2885f382f1ef7de73ea86eda5aac2387465a0, ea24b4bad3c145c467f3f4ef17658c4ca91438d3c8b161414fe2c193887d969e, 644bf46f00bfc2d77705440a81a05a50f7b2c9dc8b5788726db3bd72213ca6bb, f54649699c0a16e948b12b0a5f32a8eb95a2b522e551412e99b82ecae6c11540]
agrees root folded from those heads (§11.8)
peer20b014df975aed59f881383c749a657eaa0b45a334d2b5264612452cb7ab8f49
kt20b014df975aed59f881383c749a657eaa0b45a334d2b5264612452cb7ab8f49
agrees the same root computed from every leaf instead (§3.2)
peer20b014df975aed59f881383c749a657eaa0b45a334d2b5264612452cb7ab8f49
kt20b014df975aed59f881383c749a657eaa0b45a334d2b5264612452cb7ab8f49
 agrees
size-60 60 leaves, 4 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, eba98e51569b1727dd8e9298e2a2885f382f1ef7de73ea86eda5aac2387465a0, ea24b4bad3c145c467f3f4ef17658c4ca91438d3c8b161414fe2c193887d969e, efe4ee7d2f90c8d01c95b9f818b3c9df4651fb9540fcb2512e9bd7fc9e9221ed]
kt[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, eba98e51569b1727dd8e9298e2a2885f382f1ef7de73ea86eda5aac2387465a0, ea24b4bad3c145c467f3f4ef17658c4ca91438d3c8b161414fe2c193887d969e, efe4ee7d2f90c8d01c95b9f818b3c9df4651fb9540fcb2512e9bd7fc9e9221ed]
agrees root folded from those heads (§11.8)
peer0b69ae5f03522ea3faeffa408e7df2533922bcdd78ff3d56b3093796aeb714bd
kt0b69ae5f03522ea3faeffa408e7df2533922bcdd78ff3d56b3093796aeb714bd
agrees the same root computed from every leaf instead (§3.2)
peer0b69ae5f03522ea3faeffa408e7df2533922bcdd78ff3d56b3093796aeb714bd
kt0b69ae5f03522ea3faeffa408e7df2533922bcdd78ff3d56b3093796aeb714bd
 agrees
size-61 61 leaves, 5 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, eba98e51569b1727dd8e9298e2a2885f382f1ef7de73ea86eda5aac2387465a0, ea24b4bad3c145c467f3f4ef17658c4ca91438d3c8b161414fe2c193887d969e, efe4ee7d2f90c8d01c95b9f818b3c9df4651fb9540fcb2512e9bd7fc9e9221ed, a6f19c9e99f3fd2629a65ab78e07ccac54af4023aa371fa3aaf886349324f5ae]
kt[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, eba98e51569b1727dd8e9298e2a2885f382f1ef7de73ea86eda5aac2387465a0, ea24b4bad3c145c467f3f4ef17658c4ca91438d3c8b161414fe2c193887d969e, efe4ee7d2f90c8d01c95b9f818b3c9df4651fb9540fcb2512e9bd7fc9e9221ed, a6f19c9e99f3fd2629a65ab78e07ccac54af4023aa371fa3aaf886349324f5ae]
agrees root folded from those heads (§11.8)
peer030bd6ad5b99ce0c03b2ee5878610e0641fc3635d43d1ee176056322af8d8114
kt030bd6ad5b99ce0c03b2ee5878610e0641fc3635d43d1ee176056322af8d8114
agrees the same root computed from every leaf instead (§3.2)
peer030bd6ad5b99ce0c03b2ee5878610e0641fc3635d43d1ee176056322af8d8114
kt030bd6ad5b99ce0c03b2ee5878610e0641fc3635d43d1ee176056322af8d8114
 agrees
size-62 62 leaves, 5 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, eba98e51569b1727dd8e9298e2a2885f382f1ef7de73ea86eda5aac2387465a0, ea24b4bad3c145c467f3f4ef17658c4ca91438d3c8b161414fe2c193887d969e, efe4ee7d2f90c8d01c95b9f818b3c9df4651fb9540fcb2512e9bd7fc9e9221ed, 28cd744ea2b71d790569a84f8290940c3d3bf6b16f84aad67eade5e92b070afb]
kt[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, eba98e51569b1727dd8e9298e2a2885f382f1ef7de73ea86eda5aac2387465a0, ea24b4bad3c145c467f3f4ef17658c4ca91438d3c8b161414fe2c193887d969e, efe4ee7d2f90c8d01c95b9f818b3c9df4651fb9540fcb2512e9bd7fc9e9221ed, 28cd744ea2b71d790569a84f8290940c3d3bf6b16f84aad67eade5e92b070afb]
agrees root folded from those heads (§11.8)
peer81022502100ce20a803620dc88b25b82505912a610729e4577bb922868f3a700
kt81022502100ce20a803620dc88b25b82505912a610729e4577bb922868f3a700
agrees the same root computed from every leaf instead (§3.2)
peer81022502100ce20a803620dc88b25b82505912a610729e4577bb922868f3a700
kt81022502100ce20a803620dc88b25b82505912a610729e4577bb922868f3a700
 agrees
size-63 63 leaves, 6 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, eba98e51569b1727dd8e9298e2a2885f382f1ef7de73ea86eda5aac2387465a0, ea24b4bad3c145c467f3f4ef17658c4ca91438d3c8b161414fe2c193887d969e, efe4ee7d2f90c8d01c95b9f818b3c9df4651fb9540fcb2512e9bd7fc9e9221ed, 28cd744ea2b71d790569a84f8290940c3d3bf6b16f84aad67eade5e92b070afb, 13ef832754a3ceebbeb94e935e2f051c7270ee4141843407c31a6f6e065a7833]
kt[d6a160c9025353c6d27f636aea139539016f6a89464414f7b4aa039de5e2aa53, eba98e51569b1727dd8e9298e2a2885f382f1ef7de73ea86eda5aac2387465a0, ea24b4bad3c145c467f3f4ef17658c4ca91438d3c8b161414fe2c193887d969e, efe4ee7d2f90c8d01c95b9f818b3c9df4651fb9540fcb2512e9bd7fc9e9221ed, 28cd744ea2b71d790569a84f8290940c3d3bf6b16f84aad67eade5e92b070afb, 13ef832754a3ceebbeb94e935e2f051c7270ee4141843407c31a6f6e065a7833]
agrees root folded from those heads (§11.8)
peer655c420789453d350dabe376b585fcfa01fe10986fca41a700fc5f6ebc151998
kt655c420789453d350dabe376b585fcfa01fe10986fca41a700fc5f6ebc151998
agrees the same root computed from every leaf instead (§3.2)
peer655c420789453d350dabe376b585fcfa01fe10986fca41a700fc5f6ebc151998
kt655c420789453d350dabe376b585fcfa01fe10986fca41a700fc5f6ebc151998
 agrees
size-64 64 leaves, 1 heads
3 checks
agrees full subtree heads after the append (§3.2)
peer[fc994f6c5665be1231b39d00c08cd15a266b23d664b8efc9517c37b77d922741]
kt[fc994f6c5665be1231b39d00c08cd15a266b23d664b8efc9517c37b77d922741]
agrees root folded from those heads (§11.8)
peerfc994f6c5665be1231b39d00c08cd15a266b23d664b8efc9517c37b77d922741
ktfc994f6c5665be1231b39d00c08cd15a266b23d664b8efc9517c37b77d922741
agrees the same root computed from every leaf instead (§3.2)
peerfc994f6c5665be1231b39d00c08cd15a266b23d664b8efc9517c37b77d922741
ktfc994f6c5665be1231b39d00c08cd15a266b23d664b8efc9517c37b77d922741
 agrees

Prefix tree §3.3, §11.9, §12.2

Vectors: prefix-tree.json · oracle: katie @ 00da52541f6a · 11 cases, 55 checks agrees

CaseInputChecksResult
single-entry-inclusion 1 entries, 1 searches
5 checks
agrees root of the prefix tree (§3.3, §11.9)
peer4538338fe0c00c52e07147f6be3267aeed9d19792624529e0fc1eddd5c9c43ca
kt4538338fe0c00c52e07147f6be3267aeed9d19792624529e0fc1eddd5c9c43ca
agrees search results (§12.2)
peer[1@0]
kt[1@0]
agrees copath elements (§12.2)
peer[]
kt[]
agrees wire encoding (§12.2)
peer0101000000
kt0101000000
agrees verifying the peer's proof against the peer's root
peeraccepted
ktaccepted
 agrees
single-entry-non-inclusion-leaf 1 entries, 1 searches
5 checks
agrees root of the prefix tree (§3.3, §11.9)
peer4538338fe0c00c52e07147f6be3267aeed9d19792624529e0fc1eddd5c9c43ca
kt4538338fe0c00c52e07147f6be3267aeed9d19792624529e0fc1eddd5c9c43ca
agrees search results (§12.2)
peer[2@0(10000000…)]
kt[2@0(10000000…)]
agrees copath elements (§12.2)
peer[]
kt[]
agrees wire encoding (§12.2)
peer01021000000000000000000000000000000000000000000000000000000000000001a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1000000
kt01021000000000000000000000000000000000000000000000000000000000000001a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1000000
agrees verifying the peer's proof against the peer's root
peeraccepted
ktaccepted
 agrees
figure-each-key-included 5 entries, 5 searches
5 checks
agrees root of the prefix tree (§3.3, §11.9)
peerbb0a41868d61177f0b22c608ee1382cbee6685aafba53395cfc67ba3ef217064
ktbb0a41868d61177f0b22c608ee1382cbee6685aafba53395cfc67ba3ef217064
agrees search results (§12.2)
peer[1@3, 1@3, 1@3, 1@3, 1@2]
kt[1@3, 1@3, 1@3, 1@3, 1@2]
agrees copath elements (§12.2)
peer[0000000000000000000000000000000000000000000000000000000000000000]
kt[0000000000000000000000000000000000000000000000000000000000000000]
agrees wire encoding (§12.2)
peer050103010301030103010200010000000000000000000000000000000000000000000000000000000000000000
kt050103010301030103010200010000000000000000000000000000000000000000000000000000000000000000
agrees verifying the peer's proof against the peer's root
peeraccepted
ktaccepted
 agrees
figure-inclusion-one-key 5 entries, 1 searches
5 checks
agrees root of the prefix tree (§3.3, §11.9)
peerbb0a41868d61177f0b22c608ee1382cbee6685aafba53395cfc67ba3ef217064
ktbb0a41868d61177f0b22c608ee1382cbee6685aafba53395cfc67ba3ef217064
agrees search results (§12.2)
peer[1@3]
kt[1@3]
agrees copath elements (§12.2)
peer[9c04d4a3efa2feb6bce95a77128cb0d678a9385d1f9de70d7da91a07842b1213, 543db9e12e0b6853e4c7f9a45e09dee1c28f94f25a7b691abc138fd0a89b5f61, 971ab802a960cfbccfe4f981748d45b14a682e4e425a071a9811a813f03656d7]
kt[9c04d4a3efa2feb6bce95a77128cb0d678a9385d1f9de70d7da91a07842b1213, 543db9e12e0b6853e4c7f9a45e09dee1c28f94f25a7b691abc138fd0a89b5f61, 971ab802a960cfbccfe4f981748d45b14a682e4e425a071a9811a813f03656d7]
agrees wire encoding (§12.2)
peer01010300039c04d4a3efa2feb6bce95a77128cb0d678a9385d1f9de70d7da91a07842b1213543db9e12e0b6853e4c7f9a45e09dee1c28f94f25a7b691abc138fd0a89b5f61971ab802a960cfbccfe4f981748d45b14a682e4e425a071a9811a813f03656d7
kt01010300039c04d4a3efa2feb6bce95a77128cb0d678a9385d1f9de70d7da91a07842b1213543db9e12e0b6853e4c7f9a45e09dee1c28f94f25a7b691abc138fd0a89b5f61971ab802a960cfbccfe4f981748d45b14a682e4e425a071a9811a813f03656d7
agrees verifying the peer's proof against the peer's root
peeraccepted
ktaccepted
 agrees
figure-non-inclusion-leaf 5 entries, 1 searches
5 checks
agrees root of the prefix tree (§3.3, §11.9)
peerbb0a41868d61177f0b22c608ee1382cbee6685aafba53395cfc67ba3ef217064
ktbb0a41868d61177f0b22c608ee1382cbee6685aafba53395cfc67ba3ef217064
agrees search results (§12.2)
peer[2@3(10000000…)]
kt[2@3(10000000…)]
agrees copath elements (§12.2)
peer[32979dbb7c8c7e3d9b97b12cd22fcb1048bf64a6392498101c7a87d53d9351de, 0000000000000000000000000000000000000000000000000000000000000000, 840fde7724baa1fb7afc57fcd6648d5c4200e74af68cc93cd67a664da0855ff4]
kt[32979dbb7c8c7e3d9b97b12cd22fcb1048bf64a6392498101c7a87d53d9351de, 0000000000000000000000000000000000000000000000000000000000000000, 840fde7724baa1fb7afc57fcd6648d5c4200e74af68cc93cd67a664da0855ff4]
agrees wire encoding (§12.2)
peer01021000000000000000000000000000000000000000000000000000000000000001a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a103000332979dbb7c8c7e3d9b97b12cd22fcb1048bf64a6392498101c7a87d53d9351de0000000000000000000000000000000000000000000000000000000000000000840fde7724baa1fb7afc57fcd6648d5c4200e74af68cc93cd67a664da0855ff4
kt01021000000000000000000000000000000000000000000000000000000000000001a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a103000332979dbb7c8c7e3d9b97b12cd22fcb1048bf64a6392498101c7a87d53d9351de0000000000000000000000000000000000000000000000000000000000000000840fde7724baa1fb7afc57fcd6648d5c4200e74af68cc93cd67a664da0855ff4
agrees verifying the peer's proof against the peer's root
peeraccepted
ktaccepted
 agrees
figure-non-inclusion-parent 5 entries, 1 searches
5 checks
agrees root of the prefix tree (§3.3, §11.9)
peerbb0a41868d61177f0b22c608ee1382cbee6685aafba53395cfc67ba3ef217064
ktbb0a41868d61177f0b22c608ee1382cbee6685aafba53395cfc67ba3ef217064
agrees search results (§12.2)
peer[3@2]
kt[3@2]
agrees copath elements (§12.2)
peer[5a1c6bae0558ae049303918250e4e32dc4280f0e0a899683ff92a263c431c511, 840fde7724baa1fb7afc57fcd6648d5c4200e74af68cc93cd67a664da0855ff4]
kt[5a1c6bae0558ae049303918250e4e32dc4280f0e0a899683ff92a263c431c511, 840fde7724baa1fb7afc57fcd6648d5c4200e74af68cc93cd67a664da0855ff4]
agrees wire encoding (§12.2)
peer01030200025a1c6bae0558ae049303918250e4e32dc4280f0e0a899683ff92a263c431c511840fde7724baa1fb7afc57fcd6648d5c4200e74af68cc93cd67a664da0855ff4
kt01030200025a1c6bae0558ae049303918250e4e32dc4280f0e0a899683ff92a263c431c511840fde7724baa1fb7afc57fcd6648d5c4200e74af68cc93cd67a664da0855ff4
agrees verifying the peer's proof against the peer's root
peeraccepted
ktaccepted
 agrees
figure-mixed-result-types 5 entries, 5 searches
5 checks
agrees root of the prefix tree (§3.3, §11.9)
peerbb0a41868d61177f0b22c608ee1382cbee6685aafba53395cfc67ba3ef217064
ktbb0a41868d61177f0b22c608ee1382cbee6685aafba53395cfc67ba3ef217064
agrees search results (§12.2)
peer[1@3, 3@2, 2@3(10000000…), 1@2, 2@2(d8000000…)]
kt[1@3, 3@2, 2@3(10000000…), 1@2, 2@2(d8000000…)]
agrees copath elements (§12.2)
peer[32979dbb7c8c7e3d9b97b12cd22fcb1048bf64a6392498101c7a87d53d9351de, 768cfaeb4039e3a06cff66651da824ea6373b65842c2423dc8d0465cdd518029]
kt[32979dbb7c8c7e3d9b97b12cd22fcb1048bf64a6392498101c7a87d53d9351de, 768cfaeb4039e3a06cff66651da824ea6373b65842c2423dc8d0465cdd518029]
agrees wire encoding (§12.2)
peer0501030302021000000000000000000000000000000000000000000000000000000000000001a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a103010202d800000000000000000000000000000000000000000000000000000000000005e5e5e5e5e5e5e5e5e5e5e5e5e5e5e5e5e5e5e5e5e5e5e5e5e5e5e5e5e5e5e5e502000232979dbb7c8c7e3d9b97b12cd22fcb1048bf64a6392498101c7a87d53d9351de768cfaeb4039e3a06cff66651da824ea6373b65842c2423dc8d0465cdd518029
kt0501030302021000000000000000000000000000000000000000000000000000000000000001a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a103010202d800000000000000000000000000000000000000000000000000000000000005e5e5e5e5e5e5e5e5e5e5e5e5e5e5e5e5e5e5e5e5e5e5e5e5e5e5e5e5e5e5e5e502000232979dbb7c8c7e3d9b97b12cd22fcb1048bf64a6392498101c7a87d53d9351de768cfaeb4039e3a06cff66651da824ea6373b65842c2423dc8d0465cdd518029
agrees verifying the peer's proof against the peer's root
peeraccepted
ktaccepted
 agrees
deep-spine-inclusion 3 entries, 3 searches
5 checks
agrees root of the prefix tree (§3.3, §11.9)
peer23a3436af3d8c9095b7812177955ef8da7aff9b76c212af42004a1e700899ae9
kt23a3436af3d8c9095b7812177955ef8da7aff9b76c212af42004a1e700899ae9
agrees search results (§12.2)
peer[1@41, 1@41, 1@21]
kt[1@41, 1@41, 1@21]
agrees copath elements (§12.2)
peer[0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000]
kt[0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000]
agrees wire encoding (§12.2)
peer030129012901150027000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
kt030129012901150027000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
agrees verifying the peer's proof against the peer's root
peeraccepted
ktaccepted
 agrees
deep-spine-non-inclusion 3 entries, 2 searches
5 checks
agrees root of the prefix tree (§3.3, §11.9)
peer23a3436af3d8c9095b7812177955ef8da7aff9b76c212af42004a1e700899ae9
kt23a3436af3d8c9095b7812177955ef8da7aff9b76c212af42004a1e700899ae9
agrees search results (§12.2)
peer[3@31, 3@1]
kt[3@31, 3@1]
agrees copath elements (§12.2)
peer[fde0c6a586f5ad0a6ae6024389b3e7a4d5a7626e6a1b103136c41df7d300a3de, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 4c316d37b8d6909e14bb7f27db2cdf4b477004aedbdc1a8a8610361d1dcde5e0, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000]
kt[fde0c6a586f5ad0a6ae6024389b3e7a4d5a7626e6a1b103136c41df7d300a3de, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 4c316d37b8d6909e14bb7f27db2cdf4b477004aedbdc1a8a8610361d1dcde5e0, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000, 0000000000000000000000000000000000000000000000000000000000000000]
agrees wire encoding (§12.2)
peer02031f0301001efde0c6a586f5ad0a6ae6024389b3e7a4d5a7626e6a1b103136c41df7d300a3de0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004c316d37b8d6909e14bb7f27db2cdf4b477004aedbdc1a8a8610361d1dcde5e00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
kt02031f0301001efde0c6a586f5ad0a6ae6024389b3e7a4d5a7626e6a1b103136c41df7d300a3de0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004c316d37b8d6909e14bb7f27db2cdf4b477004aedbdc1a8a8610361d1dcde5e00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
agrees verifying the peer's proof against the peer's root
peeraccepted
ktaccepted
 agrees
wide-single 64 entries, 1 searches
5 checks
agrees root of the prefix tree (§3.3, §11.9)
peer2a9187c9edc2166e2ef3887f48f33866484b80340271c351b125f963353ad044
kt2a9187c9edc2166e2ef3887f48f33866484b80340271c351b125f963353ad044
agrees search results (§12.2)
peer[1@6]
kt[1@6]
agrees copath elements (§12.2)
peer[e7fde92168d3e3e3c2059e41e5e06195a69a8e4fbaead03171a38b42536e0427, e165859f0e295ef410036c66ce0bdc83edf76bffa73772393c0bfef647a22076, 134a35afc877e7b9517cf36039a8ec2548c8973167307b89034bc5cf492a8f70, dc3fbcb73ca3d95e68aba9c9fa4fd8cb7fbd174567fad72b487bc2b8a96af29e, 7979da295f17dbb8fefd431e38a4d64278323d5d3effd5c9a0cb37e85ea54dec, 7977f115f3315fb7d1da23e0f7046ba227b314291383a228b0af5fd8a22e6610]
kt[e7fde92168d3e3e3c2059e41e5e06195a69a8e4fbaead03171a38b42536e0427, e165859f0e295ef410036c66ce0bdc83edf76bffa73772393c0bfef647a22076, 134a35afc877e7b9517cf36039a8ec2548c8973167307b89034bc5cf492a8f70, dc3fbcb73ca3d95e68aba9c9fa4fd8cb7fbd174567fad72b487bc2b8a96af29e, 7979da295f17dbb8fefd431e38a4d64278323d5d3effd5c9a0cb37e85ea54dec, 7977f115f3315fb7d1da23e0f7046ba227b314291383a228b0af5fd8a22e6610]
agrees wire encoding (§12.2)
peer0101060006e7fde92168d3e3e3c2059e41e5e06195a69a8e4fbaead03171a38b42536e0427e165859f0e295ef410036c66ce0bdc83edf76bffa73772393c0bfef647a22076134a35afc877e7b9517cf36039a8ec2548c8973167307b89034bc5cf492a8f70dc3fbcb73ca3d95e68aba9c9fa4fd8cb7fbd174567fad72b487bc2b8a96af29e7979da295f17dbb8fefd431e38a4d64278323d5d3effd5c9a0cb37e85ea54dec7977f115f3315fb7d1da23e0f7046ba227b314291383a228b0af5fd8a22e6610
kt0101060006e7fde92168d3e3e3c2059e41e5e06195a69a8e4fbaead03171a38b42536e0427e165859f0e295ef410036c66ce0bdc83edf76bffa73772393c0bfef647a22076134a35afc877e7b9517cf36039a8ec2548c8973167307b89034bc5cf492a8f70dc3fbcb73ca3d95e68aba9c9fa4fd8cb7fbd174567fad72b487bc2b8a96af29e7979da295f17dbb8fefd431e38a4d64278323d5d3effd5c9a0cb37e85ea54dec7977f115f3315fb7d1da23e0f7046ba227b314291383a228b0af5fd8a22e6610
agrees verifying the peer's proof against the peer's root
peeraccepted
ktaccepted
 agrees
wide-batch 64 entries, 5 searches
5 checks
agrees root of the prefix tree (§3.3, §11.9)
peer2a9187c9edc2166e2ef3887f48f33866484b80340271c351b125f963353ad044
kt2a9187c9edc2166e2ef3887f48f33866484b80340271c351b125f963353ad044
agrees search results (§12.2)
peer[1@6, 1@6, 1@6, 1@6, 1@6]
kt[1@6, 1@6, 1@6, 1@6, 1@6]
agrees copath elements (§12.2)
peer[dfd020d8e08269c616a552c532ecd50d5935968a1ff34bafd1f0c662315ddaf9, 8093cf0ee5740fba5d93da949a5b100a5d39f7a37ba696205e5a4a54ad0cf258, a26812553409c249bbd71dff4bb0030c23751ad2bf9e73cc5abe3032187c3f66, e5f56462c26f74da990b07e839491dc605347202b7839cb07c2227a805bdb5b5, 8cb05376d8049705b40819b91a8be6b8a071d52a5ee4a6fb511cba871a99d978, 0e678eb744c4230f3be56938919650c177df5a0c07440e84b1e0503e769dcbc9, ce590c1a77c4bbab2316c09bbb253ac032bebaf0a015713b27a90ad31483ca00, b93207788f214b1b59e22bc0c62b319037c963beee0e5eb8e1e1189913e072b3, 0e3dd1f0114e95debba33f498e5cf7a766027fee7d3ddc088db67208bb42e861, 35706e53d56213db5754f0ef4ca4ee6ddc04463d5edda9fe391150c767c0cbe8, d80e1ea9926d10bf2d4caed81d9c160d4506f593a39b79ee6e7e2f463b6f2d17, fc2905d8a36748eba8f8607d9a8b7655c66b962fca7045a8e11ee5b02f1b1def, 704b2e1deb6160cd359a14be1d45acbae368cb2390df49dae4c8ad8da64ec7c3, 295aa97134971a090c0dbfa279895e8e581bfd9eafcd02e9005d56a2c3e37ed3, 650a6fe44eec16a4e081366b89177bba25c4f374634f8aef2368279d4fb856eb]
kt[dfd020d8e08269c616a552c532ecd50d5935968a1ff34bafd1f0c662315ddaf9, 8093cf0ee5740fba5d93da949a5b100a5d39f7a37ba696205e5a4a54ad0cf258, a26812553409c249bbd71dff4bb0030c23751ad2bf9e73cc5abe3032187c3f66, e5f56462c26f74da990b07e839491dc605347202b7839cb07c2227a805bdb5b5, 8cb05376d8049705b40819b91a8be6b8a071d52a5ee4a6fb511cba871a99d978, 0e678eb744c4230f3be56938919650c177df5a0c07440e84b1e0503e769dcbc9, ce590c1a77c4bbab2316c09bbb253ac032bebaf0a015713b27a90ad31483ca00, b93207788f214b1b59e22bc0c62b319037c963beee0e5eb8e1e1189913e072b3, 0e3dd1f0114e95debba33f498e5cf7a766027fee7d3ddc088db67208bb42e861, 35706e53d56213db5754f0ef4ca4ee6ddc04463d5edda9fe391150c767c0cbe8, d80e1ea9926d10bf2d4caed81d9c160d4506f593a39b79ee6e7e2f463b6f2d17, fc2905d8a36748eba8f8607d9a8b7655c66b962fca7045a8e11ee5b02f1b1def, 704b2e1deb6160cd359a14be1d45acbae368cb2390df49dae4c8ad8da64ec7c3, 295aa97134971a090c0dbfa279895e8e581bfd9eafcd02e9005d56a2c3e37ed3, 650a6fe44eec16a4e081366b89177bba25c4f374634f8aef2368279d4fb856eb]
agrees wire encoding (§12.2)
peer0501060106010601060106000fdfd020d8e08269c616a552c532ecd50d5935968a1ff34bafd1f0c662315ddaf98093cf0ee5740fba5d93da949a5b100a5d39f7a37ba696205e5a4a54ad0cf258a26812553409c249bbd71dff4bb0030c23751ad2bf9e73cc5abe3032187c3f66e5f56462c26f74da990b07e839491dc605347202b7839cb07c2227a805bdb5b58cb05376d8049705b40819b91a8be6b8a071d52a5ee4a6fb511cba871a99d9780e678eb744c4230f3be56938919650c177df5a0c07440e84b1e0503e769dcbc9ce590c1a77c4bbab2316c09bbb253ac032bebaf0a015713b27a90ad31483ca00b93207788f214b1b59e22bc0c62b319037c963beee0e5eb8e1e1189913e072b30e3dd1f0114e95debba33f498e5cf7a766027fee7d3ddc088db67208bb42e86135706e53d56213db5754f0ef4ca4ee6ddc04463d5edda9fe391150c767c0cbe8d80e1ea9926d10bf2d4caed81d9c160d4506f593a39b79ee6e7e2f463b6f2d17fc2905d8a36748eba8f8607d9a8b7655c66b962fca7045a8e11ee5b02f1b1def704b2e1deb6160cd359a14be1d45acbae368cb2390df49dae4c8ad8da64ec7c3295aa97134971a090c0dbfa279895e8e581bfd9eafcd02e9005d56a2c3e37ed3650a6fe44eec16a4e081366b89177bba25c4f374634f8aef2368279d4fb856eb
kt0501060106010601060106000fdfd020d8e08269c616a552c532ecd50d5935968a1ff34bafd1f0c662315ddaf98093cf0ee5740fba5d93da949a5b100a5d39f7a37ba696205e5a4a54ad0cf258a26812553409c249bbd71dff4bb0030c23751ad2bf9e73cc5abe3032187c3f66e5f56462c26f74da990b07e839491dc605347202b7839cb07c2227a805bdb5b58cb05376d8049705b40819b91a8be6b8a071d52a5ee4a6fb511cba871a99d9780e678eb744c4230f3be56938919650c177df5a0c07440e84b1e0503e769dcbc9ce590c1a77c4bbab2316c09bbb253ac032bebaf0a015713b27a90ad31483ca00b93207788f214b1b59e22bc0c62b319037c963beee0e5eb8e1e1189913e072b30e3dd1f0114e95debba33f498e5cf7a766027fee7d3ddc088db67208bb42e86135706e53d56213db5754f0ef4ca4ee6ddc04463d5edda9fe391150c767c0cbe8d80e1ea9926d10bf2d4caed81d9c160d4506f593a39b79ee6e7e2f463b6f2d17fc2905d8a36748eba8f8607d9a8b7655c66b962fca7045a8e11ee5b02f1b1def704b2e1deb6160cd359a14be1d45acbae368cb2390df49dae4c8ad8da64ec7c3295aa97134971a090c0dbfa279895e8e581bfd9eafcd02e9005d56a2c3e37ed3650a6fe44eec16a4e081366b89177bba25c4f374634f8aef2368279d4fb856eb
agrees verifying the peer's proof against the peer's root
peeraccepted
ktaccepted
 agrees

Prefix tree mutation §15.2

Vectors: prefix-mutation.json · oracle: katie @ 00da52541f6a · cipher suite 0x0002 KT_128_SHA256_Ed25519 · 8 cases, 32 checks agrees

CaseInputChecksResult
add-two-leaves 2 entries, +2 −0
4 checks
agrees batch proof for the update's keys (§12.2)
peer02020000000000000000000000000000000000000000000000000000000000000001a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a101028000000000000000000000000000000000000000000000000000000000000004d4d4d4d4d4d4d4d4d4d4d4d4d4d4d4d4d4d4d4d4d4d4d4d4d4d4d4d4d4d4d4d4010000
kt02020000000000000000000000000000000000000000000000000000000000000001a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a101028000000000000000000000000000000000000000000000000000000000000004d4d4d4d4d4d4d4d4d4d4d4d4d4d4d4d4d4d4d4d4d4d4d4d4d4d4d4d4d4d4d4d4010000
agrees root before the update (§15.2 step 6)
peera0281728172889568ab22f74f10ecf1edc626c8ea87aaa8583f055574cb12057
kta0281728172889568ab22f74f10ecf1edc626c8ea87aaa8583f055574cb12057
agrees root after the update (§15.2 step 7)
peerf1c59c6bf8c2d147ce833a4993f437362fc3f702b49fd3e56ae2d3acc204c10c
ktf1c59c6bf8c2d147ce833a4993f437362fc3f702b49fd3e56ae2d3acc204c10c
agrees whether the proof determines the root it produced (§15.2)
peerdetermined
ktdetermined
 agrees
add-pushing-a-leaf-down 2 entries, +1 −0
4 checks
agrees batch proof for the update's keys (§12.2)
peer01020000000000000000000000000000000000000000000000000000000000000001a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a101000150555332243effa9f64c7b332e3c8c6d52058bd4b8bdf928e6f7d33b1840d81d
kt01020000000000000000000000000000000000000000000000000000000000000001a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a101000150555332243effa9f64c7b332e3c8c6d52058bd4b8bdf928e6f7d33b1840d81d
agrees root before the update (§15.2 step 6)
peera0281728172889568ab22f74f10ecf1edc626c8ea87aaa8583f055574cb12057
kta0281728172889568ab22f74f10ecf1edc626c8ea87aaa8583f055574cb12057
agrees root after the update (§15.2 step 7)
peera2c1cdca8d5f31b25d34f55e34d8364296883792aab7dc6a16a607e66f9923c2
kta2c1cdca8d5f31b25d34f55e34d8364296883792aab7dc6a16a607e66f9923c2
agrees whether the proof determines the root it produced (§15.2)
peerdetermined
ktdetermined
 agrees
remove-the-only-leaf 1 entries, +0 −1
4 checks
agrees batch proof for the update's keys (§12.2)
peer0101000000
kt0101000000
agrees root before the update (§15.2 step 6)
peer1635d4cb735a16759a1a26fcda0c309ea0577aae20128a59075f6fea73dfb360
kt1635d4cb735a16759a1a26fcda0c309ea0577aae20128a59075f6fea73dfb360
agrees root after the update (§15.2 step 7)
peer0000000000000000000000000000000000000000000000000000000000000000
kt0000000000000000000000000000000000000000000000000000000000000000
agrees whether the proof determines the root it produced (§15.2)
peerdetermined
ktdetermined
 agrees
remove-every-leaf 2 entries, +0 −2
4 checks
agrees batch proof for the update's keys (§12.2)
peer020102010200010000000000000000000000000000000000000000000000000000000000000000
kt020102010200010000000000000000000000000000000000000000000000000000000000000000
agrees root before the update (§15.2 step 6)
peerfea1b8a147cc1fa73c5a1938f9bd4cb50a8ed3423d067921b8ea69b181335c17
ktfea1b8a147cc1fa73c5a1938f9bd4cb50a8ed3423d067921b8ea69b181335c17
agrees root after the update (§15.2 step 7) — the peer's verifier returns dc48a742ae32…, which its own tree does not have
peer0000000000000000000000000000000000000000000000000000000000000000
kt0000000000000000000000000000000000000000000000000000000000000000
agrees whether the proof determines the root it produced (§15.2)
peerdetermined
ktdetermined
 agrees
remove-beside-a-leaf 3 entries, +0 −1
4 checks
agrees batch proof for the update's keys (§12.2)
peer0101020002c3f1f4cbbc6e44c52a308eaad3b44133bf09c996d6d48b5b75804fb3062bc5dd50555332243effa9f64c7b332e3c8c6d52058bd4b8bdf928e6f7d33b1840d81d
kt0101020002c3f1f4cbbc6e44c52a308eaad3b44133bf09c996d6d48b5b75804fb3062bc5dd50555332243effa9f64c7b332e3c8c6d52058bd4b8bdf928e6f7d33b1840d81d
agrees root before the update (§15.2 step 6)
peerffb5bd83bfea74a93ad6303a0f281926d057ba64f6f00e174642fccef52a2024
ktffb5bd83bfea74a93ad6303a0f281926d057ba64f6f00e174642fccef52a2024
agrees root after the update, assuming no collapse (§15.2 step 7) — the assumption is wrong here and the tree's root is unreachable
peerdfff45ee5c91b419047c2429da5466b70d5c888e195547e601709e6803690672
ktdfff45ee5c91b419047c2429da5466b70d5c888e195547e601709e6803690672
agrees whether the proof determines the root it produced (§15.2)
peerassumed
ktassumed
 agrees
remove-beside-a-parent 4 entries, +0 −1
4 checks
agrees batch proof for the update's keys (§12.2)
peer01010200029d5fddd5f90a5e2345bf2d4bead266ed8cf77a7e6cbc66aedfca0254694b5a2650555332243effa9f64c7b332e3c8c6d52058bd4b8bdf928e6f7d33b1840d81d
kt01010200029d5fddd5f90a5e2345bf2d4bead266ed8cf77a7e6cbc66aedfca0254694b5a2650555332243effa9f64c7b332e3c8c6d52058bd4b8bdf928e6f7d33b1840d81d
agrees root before the update (§15.2 step 6)
peer88ed4b1392d180e07e78ba15904335a4a5b925ecb96e32b94d0630e486e3a701
kt88ed4b1392d180e07e78ba15904335a4a5b925ecb96e32b94d0630e486e3a701
agrees root after the update, assuming no collapse (§15.2 step 7) — the assumption holds here, but the proof does not say so
peerf27e6478dd5ed27dbf144d2820154d0a681ae7e43101522e23de7566bedaadd6
ktf27e6478dd5ed27dbf144d2820154d0a681ae7e43101522e23de7566bedaadd6
agrees whether the proof determines the root it produced (§15.2)
peerassumed
ktassumed
 agrees
remove-refilled-by-an-add 3 entries, +1 −1
4 checks
agrees batch proof for the update's keys (§12.2)
peer02020000000000000000000000000000000000000000000000000000000000000001a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a10201020002c3f1f4cbbc6e44c52a308eaad3b44133bf09c996d6d48b5b75804fb3062bc5dd50555332243effa9f64c7b332e3c8c6d52058bd4b8bdf928e6f7d33b1840d81d
kt02020000000000000000000000000000000000000000000000000000000000000001a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a10201020002c3f1f4cbbc6e44c52a308eaad3b44133bf09c996d6d48b5b75804fb3062bc5dd50555332243effa9f64c7b332e3c8c6d52058bd4b8bdf928e6f7d33b1840d81d
agrees root before the update (§15.2 step 6)
peerffb5bd83bfea74a93ad6303a0f281926d057ba64f6f00e174642fccef52a2024
ktffb5bd83bfea74a93ad6303a0f281926d057ba64f6f00e174642fccef52a2024
agrees root after the update (§15.2 step 7)
peer0110136424d77202f37c8eb18b629eaf230998f20ab6ab232a9d7d13f7faa554
kt0110136424d77202f37c8eb18b629eaf230998f20ab6ab232a9d7d13f7faa554
agrees whether the proof determines the root it produced (§15.2)
peerdetermined
ktdetermined
 agrees
replace-in-place 3 entries, +1 −1
4 checks
agrees batch proof for the update's keys (§12.2)
peer02010201020002c3f1f4cbbc6e44c52a308eaad3b44133bf09c996d6d48b5b75804fb3062bc5dd50555332243effa9f64c7b332e3c8c6d52058bd4b8bdf928e6f7d33b1840d81d
kt02010201020002c3f1f4cbbc6e44c52a308eaad3b44133bf09c996d6d48b5b75804fb3062bc5dd50555332243effa9f64c7b332e3c8c6d52058bd4b8bdf928e6f7d33b1840d81d
agrees root before the update (§15.2 step 6)
peerffb5bd83bfea74a93ad6303a0f281926d057ba64f6f00e174642fccef52a2024
ktffb5bd83bfea74a93ad6303a0f281926d057ba64f6f00e174642fccef52a2024
agrees root after the update (§15.2 step 7) — the peer declines this update: same vrf output present multiple times
peerc7eb32d3a33da19b6c8863f435a7435a32dd3192441716fa99c339465ac14eca
ktc7eb32d3a33da19b6c8863f435a7435a32dd3192441716fa99c339465ac14eca
agrees whether the proof determines the root it produced (§15.2)
peerdetermined
ktdetermined
 agrees

Third-party auditor §15.2

Vectors: auditor-update.json · oracle: katie @ 00da52541f6a · cipher suite 0x0002 KT_128_SHA256_Ed25519 · 14 cases, 34 checks agrees

8 of these cases assert a refusal: the peer says the input must be rejected, and accepting it would be the failure.

CaseInputChecksResult
add-one-leaf 2 entries, +1 −0
3 checks
agrees AuditorUpdate wire encoding (§15.2)
peer0000018bcfe6526000014000000000000000000000000000000000000000000000000000000000000002b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2000001020000000000000000000000000000000000000000000000000000000000000001a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a10100019c1390b810b1ca0a2e2cfe96ab119f139c42475d0b4587d41682a7aa20917821
kt0000018bcfe6526000014000000000000000000000000000000000000000000000000000000000000002b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2000001020000000000000000000000000000000000000000000000000000000000000001a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a10100019c1390b810b1ca0a2e2cfe96ab119f139c42475d0b4587d41682a7aa20917821
agrees the auditor's verdict (§15.2 steps 1–7)
peeraccepted
ktaccepted
agrees log tree root over the new entry (§15.2 step 7, §11.3)
peersize 2, root 44ef2d8088fcd8cc60d26ded8afe3e2520251844909c5cb92fe30bf3c3182f90
ktsize 2, root 44ef2d8088fcd8cc60d26ded8afe3e2520251844909c5cb92fe30bf3c3182f90
 agrees
add-two-leaves 1 entries, +2 −0
3 checks
agrees AuditorUpdate wire encoding (§15.2)
peer0000018bcfe6526000024000000000000000000000000000000000000000000000000000000000000002b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b28000000000000000000000000000000000000000000000000000000000000003c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3000002020000000000000000000000000000000000000000000000000000000000000001a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a100020000000000000000000000000000000000000000000000000000000000000001a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1000000
kt0000018bcfe6526000024000000000000000000000000000000000000000000000000000000000000002b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b28000000000000000000000000000000000000000000000000000000000000003c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3000002020000000000000000000000000000000000000000000000000000000000000001a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a100020000000000000000000000000000000000000000000000000000000000000001a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1000000
agrees the auditor's verdict (§15.2 steps 1–7)
peeraccepted
ktaccepted
agrees log tree root over the new entry (§15.2 step 7, §11.3)
peersize 2, root b97778306128dee6d624b2223012c30080c79360192063f3f6242ed727469c3a
ktsize 2, root b97778306128dee6d624b2223012c30080c79360192063f3f6242ed727469c3a
 agrees
change-nothing must refuse 2 entries, +0 −0 · rejected: evaluating the proof: proof needs 1 copath elements, got 0
2 checks
agrees AuditorUpdate wire encoding (§15.2)
peer0000018bcfe6526000000000000000
kt0000018bcfe6526000000000000000
agrees the auditor's verdict (§15.2 steps 1–7) — the peer's reason: wrong number of copath nodes provided
peerrejected
ktrejected
 agrees
same-timestamp-is-allowed 2 entries, +1 −0
3 checks
agrees AuditorUpdate wire encoding (§15.2)
peer0000018bcfe5680000014000000000000000000000000000000000000000000000000000000000000002b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2000001020000000000000000000000000000000000000000000000000000000000000001a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a10100019c1390b810b1ca0a2e2cfe96ab119f139c42475d0b4587d41682a7aa20917821
kt0000018bcfe5680000014000000000000000000000000000000000000000000000000000000000000002b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2000001020000000000000000000000000000000000000000000000000000000000000001a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a10100019c1390b810b1ca0a2e2cfe96ab119f139c42475d0b4587d41682a7aa20917821
agrees the auditor's verdict (§15.2 steps 1–7)
peeraccepted
ktaccepted
agrees log tree root over the new entry (§15.2 step 7, §11.3)
peersize 2, root be4635dec305d49596c98b56f01b453d1bd75dee67123d619971cbd7cf220f62
ktsize 2, root be4635dec305d49596c98b56f01b453d1bd75dee67123d619971cbd7cf220f62
 agrees
timestamp-goes-backwards must refuse 2 entries, +1 −0 · rejected: the update's timestamp 1700000000000 is before the previous entry's 1700000060000
2 checks
agrees AuditorUpdate wire encoding (§15.2)
peer0000018bcfe5680000014000000000000000000000000000000000000000000000000000000000000002b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2000001020000000000000000000000000000000000000000000000000000000000000001a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a10100019c1390b810b1ca0a2e2cfe96ab119f139c42475d0b4587d41682a7aa20917821
kt0000018bcfe5680000014000000000000000000000000000000000000000000000000000000000000002b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2000001020000000000000000000000000000000000000000000000000000000000000001a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a10100019c1390b810b1ca0a2e2cfe96ab119f139c42475d0b4587d41682a7aa20917821
agrees the auditor's verdict (§15.2 steps 1–7) — the peer's reason: update timestamp is less than rightmost timestamp
peerrejected
ktrejected
 agrees
added-out-of-order must refuse 1 entries, +2 −0 · rejected: `added` does not ascend by vrf_output at index 1
2 checks
agrees AuditorUpdate wire encoding (§15.2)
peer0000018bcfe6526000028000000000000000000000000000000000000000000000000000000000000003c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c34000000000000000000000000000000000000000000000000000000000000002b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2000002020000000000000000000000000000000000000000000000000000000000000001a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a100020000000000000000000000000000000000000000000000000000000000000001a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1000000
kt0000018bcfe6526000028000000000000000000000000000000000000000000000000000000000000003c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c34000000000000000000000000000000000000000000000000000000000000002b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2000002020000000000000000000000000000000000000000000000000000000000000001a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a100020000000000000000000000000000000000000000000000000000000000000001a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1000000
agrees the auditor's verdict (§15.2 steps 1–7) — the peer's reason: list of added prefix tree entries is invalid
peerrejected
ktrejected
 agrees
added-repeats-a-key must refuse 1 entries, +2 −0 · rejected: `added` does not ascend by vrf_output at index 1
2 checks
agrees AuditorUpdate wire encoding (§15.2)
peer0000018bcfe6526000024000000000000000000000000000000000000000000000000000000000000002b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b24000000000000000000000000000000000000000000000000000000000000002b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2000002020000000000000000000000000000000000000000000000000000000000000001a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a100020000000000000000000000000000000000000000000000000000000000000001a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1000000
kt0000018bcfe6526000024000000000000000000000000000000000000000000000000000000000000002b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b24000000000000000000000000000000000000000000000000000000000000002b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2000002020000000000000000000000000000000000000000000000000000000000000001a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a100020000000000000000000000000000000000000000000000000000000000000001a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1000000
agrees the auditor's verdict (§15.2 steps 1–7) — the peer's reason: list of added prefix tree entries is invalid
peerrejected
ktrejected
 agrees
added-is-already-present must refuse 2 entries, +1 −0 · rejected: added[0] is already in the tree and is not also being removed
2 checks
agrees AuditorUpdate wire encoding (§15.2)
peer0000018bcfe6526000010000000000000000000000000000000000000000000000000000000000000001a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1000001010100019c1390b810b1ca0a2e2cfe96ab119f139c42475d0b4587d41682a7aa20917821
kt0000018bcfe6526000010000000000000000000000000000000000000000000000000000000000000001a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1000001010100019c1390b810b1ca0a2e2cfe96ab119f139c42475d0b4587d41682a7aa20917821
agrees the auditor's verdict (§15.2 steps 1–7) — the peer's reason: proof shows inclusion for added leaf
peerrejected
ktrejected
 agrees
removed-is-absent must refuse 2 entries, +0 −1 · rejected: removed[0] is not in the tree
2 checks
agrees AuditorUpdate wire encoding (§15.2)
peer0000018bcfe65260000000014000000000000000000000000000000000000000000000000000000000000002b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b201020000000000000000000000000000000000000000000000000000000000000001a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a10100019c1390b810b1ca0a2e2cfe96ab119f139c42475d0b4587d41682a7aa20917821
kt0000018bcfe65260000000014000000000000000000000000000000000000000000000000000000000000002b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b201020000000000000000000000000000000000000000000000000000000000000001a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a10100019c1390b810b1ca0a2e2cfe96ab119f139c42475d0b4587d41682a7aa20917821
agrees the auditor's verdict (§15.2 steps 1–7) — the peer's reason: proof shows non-inclusion for removed leaf
peerrejected
ktrejected
 agrees
results-do-not-cover-the-keys must refuse 2 entries, +1 −0 · rejected: the proof answers 0 keys but the update names 1
2 checks
agrees AuditorUpdate wire encoding (§15.2)
peer0000018bcfe6526000014000000000000000000000000000000000000000000000000000000000000002b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b200000000019c1390b810b1ca0a2e2cfe96ab119f139c42475d0b4587d41682a7aa20917821
kt0000018bcfe6526000014000000000000000000000000000000000000000000000000000000000000002b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b200000000019c1390b810b1ca0a2e2cfe96ab119f139c42475d0b4587d41682a7aa20917821
agrees the auditor's verdict (§15.2 steps 1–7) — the peer's reason: unexpected number of prefix proof results
peerrejected
ktrejected
 agrees
first-entry-adds-two-leaves 0 entries, +2 −0
3 checks
agrees AuditorUpdate wire encoding (§15.2)
peer0000018bcfe6526000020000000000000000000000000000000000000000000000000000000000000001a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a14000000000000000000000000000000000000000000000000000000000000002b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2000002030003000000
kt0000018bcfe6526000020000000000000000000000000000000000000000000000000000000000000001a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a14000000000000000000000000000000000000000000000000000000000000002b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2b2000002030003000000
agrees the auditor's verdict (§15.2 steps 1–7)
peeraccepted
ktaccepted
agrees log tree root over the new entry (§15.2 step 7, §11.3)
peersize 1, root 2a596ab32c93b7b02ca64b796480dcd22e956e18b727afbfaa46ea77e16854a7
ktsize 1, root 2a596ab32c93b7b02ca64b796480dcd22e956e18b727afbfaa46ea77e16854a7
 agrees
remove-a-leaf-no-distinguished-entry-published must refuse 3 entries, +0 −1 · rejected: removed[0] was inserted at entry 2, after the last distinguished entry 1, so it was never published in one
2 checks
agrees AuditorUpdate wire encoding (§15.2)
peer0000018bcfe82720000000018000000000000000000000000000000000000000000000000000000000000003c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3010101000119cf37f03cd682a70acc255986a9b8ecad28b9955ebc9f4e65cf099002349be8
kt0000018bcfe82720000000018000000000000000000000000000000000000000000000000000000000000003c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3c3010101000119cf37f03cd682a70acc255986a9b8ecad28b9955ebc9f4e65cf099002349be8
agrees the auditor's verdict (§15.2 steps 1–7) — the peer's reason: prefix tree leaf is not eligible for removal
peerrejected
ktrejected
 agrees
remove-a-leaf-a-distinguished-entry-published 3 entries, +0 −1 · accepted, but the new root was assumed: a removal emptied a slot beside a sibling the proof does not identify
3 checks
agrees AuditorUpdate wire encoding (§15.2)
peer0000018bcfe82720000000010000000000000000000000000000000000000000000000000000000000000001a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a10101020002c3f1f4cbbc6e44c52a308eaad3b44133bf09c996d6d48b5b75804fb3062bc5dd9c1390b810b1ca0a2e2cfe96ab119f139c42475d0b4587d41682a7aa20917821
kt0000018bcfe82720000000010000000000000000000000000000000000000000000000000000000000000001a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a10101020002c3f1f4cbbc6e44c52a308eaad3b44133bf09c996d6d48b5b75804fb3062bc5dd9c1390b810b1ca0a2e2cfe96ab119f139c42475d0b4587d41682a7aa20917821
agrees the auditor's verdict (§15.2 steps 1–7)
peeraccepted
ktaccepted
agrees log tree root over the new entry (§15.2 step 7, §11.3)
peersize 4, root cce6cc34462e33baeaa0a756aac24aadcaee20c53acb9d225ef72bb33fd43660
ktsize 4, root cce6cc34462e33baeaa0a756aac24aadcaee20c53acb9d225ef72bb33fd43660
 agrees
remove-one-leaf 4 entries, +0 −1 · accepted, but the new root was assumed: a removal emptied a slot beside a sibling the proof does not identify
3 checks
agrees AuditorUpdate wire encoding (§15.2)
peer0000018bcfe65260000000010000000000000000000000000000000000000000000000000000000000000001a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a10101020002c3f1f4cbbc6e44c52a308eaad3b44133bf09c996d6d48b5b75804fb3062bc5ddb652e128af70d2f459a4c0943352447b115c7e4a1ede795a39d899d44d93d2c2
kt0000018bcfe65260000000010000000000000000000000000000000000000000000000000000000000000001a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a10101020002c3f1f4cbbc6e44c52a308eaad3b44133bf09c996d6d48b5b75804fb3062bc5ddb652e128af70d2f459a4c0943352447b115c7e4a1ede795a39d899d44d93d2c2
agrees the auditor's verdict (§15.2 steps 1–7)
peeraccepted
ktaccepted
agrees log tree root over the new entry (§15.2 step 7, §11.3)
peersize 2, root b3181395e48e9433e5ef09f7f23dae8528f8f0af882f26dcefe9c063f10d213d
ktsize 2, root b3181395e48e9433e5ef09f7f23dae8528f8f0af882f26dcefe9c063f10d213d
 agrees

Tree head signatures §11.2, §11.3, §11.4

Vectors: tree-head.json · oracle: katie @ 00da52541f6a · cipher suite 0x0002 KT_128_SHA256_Ed25519 · 9 cases, 96 checks agrees

CaseInputChecksResult
contact-monitoring-size-1 ContactMonitoring, tree size 1
10 checks
agrees Configuration encoding (§11.2)
peer0002010020e2fe2a39b7326642827d6d82d497622cd6c297fe78270eaa436b01f086b6f3cb0020555f469c22188e90015bdd85b889678d459f86bdf8f7bd34971b10b9b38586090000000000002710000000000000271000000000240c840000
kt0002010020e2fe2a39b7326642827d6d82d497622cd6c297fe78270eaa436b01f086b6f3cb0020555f469c22188e90015bdd85b889678d459f86bdf8f7bd34971b10b9b38586090000000000002710000000000000271000000000240c840000
agrees decoding the peer's Configuration gives the same value
peerround-trips
ktround-trips
agrees TreeHeadTBS encoding — the bytes signed (§11.2)
peer0002010020e2fe2a39b7326642827d6d82d497622cd6c297fe78270eaa436b01f086b6f3cb0020555f469c22188e90015bdd85b889678d459f86bdf8f7bd34971b10b9b38586090000000000002710000000000000271000000000240c84000000000000000000010101010101010101010101010101010101010101010101010101010101010101
kt0002010020e2fe2a39b7326642827d6d82d497622cd6c297fe78270eaa436b01f086b6f3cb0020555f469c22188e90015bdd85b889678d459f86bdf8f7bd34971b10b9b38586090000000000002710000000000000271000000000240c84000000000000000000010101010101010101010101010101010101010101010101010101010101010101
agrees TreeHead encoding (§11.2)
peer00000000000000010040a18c76bc1d38661d3f6c0c454c1f7221c232475430ee07533c99360997b44153b3663d0a718a98335a86cf2287f7f655182246f4ba8cec4b8a39c821938d6201
kt00000000000000010040a18c76bc1d38661d3f6c0c454c1f7221c232475430ee07533c99360997b44153b3663d0a718a98335a86cf2287f7f655182246f4ba8cec4b8a39c821938d6201
agrees the peer's tree head signature verifies (§11.2)
peeraccepted
ktaccepted
agrees FullTreeHead `same` round-trips through the mode (§11.4)
peer01
kt01
agrees `same` carries an auditor head only under thirdPartyAuditing (§11.4)
peerfalse
ktfalse
agrees FullTreeHead `updated` round-trips through the mode (§11.4)
peer0200000000000000010040a18c76bc1d38661d3f6c0c454c1f7221c232475430ee07533c99360997b44153b3663d0a718a98335a86cf2287f7f655182246f4ba8cec4b8a39c821938d6201
kt0200000000000000010040a18c76bc1d38661d3f6c0c454c1f7221c232475430ee07533c99360997b44153b3663d0a718a98335a86cf2287f7f655182246f4ba8cec4b8a39c821938d6201
agrees `updated` carries an auditor head only under thirdPartyAuditing (§11.4)
peerfalse
ktfalse
agrees FullTreeHead verification accepts the peer's head (§11.4)
peeraccepted
ktaccepted
 agrees
contact-monitoring-size-8 ContactMonitoring, tree size 8
10 checks
agrees Configuration encoding (§11.2)
peer0002010020e2fe2a39b7326642827d6d82d497622cd6c297fe78270eaa436b01f086b6f3cb0020555f469c22188e90015bdd85b889678d459f86bdf8f7bd34971b10b9b38586090000000000002710000000000000271000000000240c840000
kt0002010020e2fe2a39b7326642827d6d82d497622cd6c297fe78270eaa436b01f086b6f3cb0020555f469c22188e90015bdd85b889678d459f86bdf8f7bd34971b10b9b38586090000000000002710000000000000271000000000240c840000
agrees decoding the peer's Configuration gives the same value
peerround-trips
ktround-trips
agrees TreeHeadTBS encoding — the bytes signed (§11.2)
peer0002010020e2fe2a39b7326642827d6d82d497622cd6c297fe78270eaa436b01f086b6f3cb0020555f469c22188e90015bdd85b889678d459f86bdf8f7bd34971b10b9b38586090000000000002710000000000000271000000000240c84000000000000000000080808080808080808080808080808080808080808080808080808080808080808
kt0002010020e2fe2a39b7326642827d6d82d497622cd6c297fe78270eaa436b01f086b6f3cb0020555f469c22188e90015bdd85b889678d459f86bdf8f7bd34971b10b9b38586090000000000002710000000000000271000000000240c84000000000000000000080808080808080808080808080808080808080808080808080808080808080808
agrees TreeHead encoding (§11.2)
peer00000000000000080040d5cefc9b5fa202e3ba715c5ae0ca4a879a94fb7ac62c96ff2c8b6f5d5abf652558f562fc25d7965ec384ec130a88ee4e424b9016051f486de9a4fdd58067f90c
kt00000000000000080040d5cefc9b5fa202e3ba715c5ae0ca4a879a94fb7ac62c96ff2c8b6f5d5abf652558f562fc25d7965ec384ec130a88ee4e424b9016051f486de9a4fdd58067f90c
agrees the peer's tree head signature verifies (§11.2)
peeraccepted
ktaccepted
agrees FullTreeHead `same` round-trips through the mode (§11.4)
peer01
kt01
agrees `same` carries an auditor head only under thirdPartyAuditing (§11.4)
peerfalse
ktfalse
agrees FullTreeHead `updated` round-trips through the mode (§11.4)
peer0200000000000000080040d5cefc9b5fa202e3ba715c5ae0ca4a879a94fb7ac62c96ff2c8b6f5d5abf652558f562fc25d7965ec384ec130a88ee4e424b9016051f486de9a4fdd58067f90c
kt0200000000000000080040d5cefc9b5fa202e3ba715c5ae0ca4a879a94fb7ac62c96ff2c8b6f5d5abf652558f562fc25d7965ec384ec130a88ee4e424b9016051f486de9a4fdd58067f90c
agrees `updated` carries an auditor head only under thirdPartyAuditing (§11.4)
peerfalse
ktfalse
agrees FullTreeHead verification accepts the peer's head (§11.4)
peeraccepted
ktaccepted
 agrees
contact-monitoring-size-50 ContactMonitoring, tree size 50
10 checks
agrees Configuration encoding (§11.2)
peer0002010020e2fe2a39b7326642827d6d82d497622cd6c297fe78270eaa436b01f086b6f3cb0020555f469c22188e90015bdd85b889678d459f86bdf8f7bd34971b10b9b38586090000000000002710000000000000271000000000240c840000
kt0002010020e2fe2a39b7326642827d6d82d497622cd6c297fe78270eaa436b01f086b6f3cb0020555f469c22188e90015bdd85b889678d459f86bdf8f7bd34971b10b9b38586090000000000002710000000000000271000000000240c840000
agrees decoding the peer's Configuration gives the same value
peerround-trips
ktround-trips
agrees TreeHeadTBS encoding — the bytes signed (§11.2)
peer0002010020e2fe2a39b7326642827d6d82d497622cd6c297fe78270eaa436b01f086b6f3cb0020555f469c22188e90015bdd85b889678d459f86bdf8f7bd34971b10b9b38586090000000000002710000000000000271000000000240c84000000000000000000323232323232323232323232323232323232323232323232323232323232323232
kt0002010020e2fe2a39b7326642827d6d82d497622cd6c297fe78270eaa436b01f086b6f3cb0020555f469c22188e90015bdd85b889678d459f86bdf8f7bd34971b10b9b38586090000000000002710000000000000271000000000240c84000000000000000000323232323232323232323232323232323232323232323232323232323232323232
agrees TreeHead encoding (§11.2)
peer00000000000000320040ec579ecee075cb7fa684fb42c0586f061efc508bc9d0c92de5d6b917a60e4bfba4a112e4ab807cdf1cdbfe020281b8eb5635492367e375999df6f0334d9f5001
kt00000000000000320040ec579ecee075cb7fa684fb42c0586f061efc508bc9d0c92de5d6b917a60e4bfba4a112e4ab807cdf1cdbfe020281b8eb5635492367e375999df6f0334d9f5001
agrees the peer's tree head signature verifies (§11.2)
peeraccepted
ktaccepted
agrees FullTreeHead `same` round-trips through the mode (§11.4)
peer01
kt01
agrees `same` carries an auditor head only under thirdPartyAuditing (§11.4)
peerfalse
ktfalse
agrees FullTreeHead `updated` round-trips through the mode (§11.4)
peer0200000000000000320040ec579ecee075cb7fa684fb42c0586f061efc508bc9d0c92de5d6b917a60e4bfba4a112e4ab807cdf1cdbfe020281b8eb5635492367e375999df6f0334d9f5001
kt0200000000000000320040ec579ecee075cb7fa684fb42c0586f061efc508bc9d0c92de5d6b917a60e4bfba4a112e4ab807cdf1cdbfe020281b8eb5635492367e375999df6f0334d9f5001
agrees `updated` carries an auditor head only under thirdPartyAuditing (§11.4)
peerfalse
ktfalse
agrees FullTreeHead verification accepts the peer's head (§11.4)
peeraccepted
ktaccepted
 agrees
third-party-management-size-1 ThirdPartyManagement, tree size 1
10 checks
agrees Configuration encoding (§11.2)
peer0002020020e2fe2a39b7326642827d6d82d497622cd6c297fe78270eaa436b01f086b6f3cb0020555f469c22188e90015bdd85b889678d459f86bdf8f7bd34971b10b9b38586090020fec1428673f6afe89264b3807344ae8b269d125a503855202687db5a7128579f0000000000002710000000000000271000000000240c840000
kt0002020020e2fe2a39b7326642827d6d82d497622cd6c297fe78270eaa436b01f086b6f3cb0020555f469c22188e90015bdd85b889678d459f86bdf8f7bd34971b10b9b38586090020fec1428673f6afe89264b3807344ae8b269d125a503855202687db5a7128579f0000000000002710000000000000271000000000240c840000
agrees decoding the peer's Configuration gives the same value
peerround-trips
ktround-trips
agrees TreeHeadTBS encoding — the bytes signed (§11.2)
peer0002020020e2fe2a39b7326642827d6d82d497622cd6c297fe78270eaa436b01f086b6f3cb0020555f469c22188e90015bdd85b889678d459f86bdf8f7bd34971b10b9b38586090020fec1428673f6afe89264b3807344ae8b269d125a503855202687db5a7128579f0000000000002710000000000000271000000000240c84000000000000000000010101010101010101010101010101010101010101010101010101010101010101
kt0002020020e2fe2a39b7326642827d6d82d497622cd6c297fe78270eaa436b01f086b6f3cb0020555f469c22188e90015bdd85b889678d459f86bdf8f7bd34971b10b9b38586090020fec1428673f6afe89264b3807344ae8b269d125a503855202687db5a7128579f0000000000002710000000000000271000000000240c84000000000000000000010101010101010101010101010101010101010101010101010101010101010101
agrees TreeHead encoding (§11.2)
peer00000000000000010040a7861387eecfb8c4485d9ac3816fe7d17dd0187167dc536d2db1df4514c7da4bee4399d43a93db1958cc11069aef1feace78c7d65f0b8a7fcde360693db79007
kt00000000000000010040a7861387eecfb8c4485d9ac3816fe7d17dd0187167dc536d2db1df4514c7da4bee4399d43a93db1958cc11069aef1feace78c7d65f0b8a7fcde360693db79007
agrees the peer's tree head signature verifies (§11.2)
peeraccepted
ktaccepted
agrees FullTreeHead `same` round-trips through the mode (§11.4)
peer01
kt01
agrees `same` carries an auditor head only under thirdPartyAuditing (§11.4)
peerfalse
ktfalse
agrees FullTreeHead `updated` round-trips through the mode (§11.4)
peer0200000000000000010040a7861387eecfb8c4485d9ac3816fe7d17dd0187167dc536d2db1df4514c7da4bee4399d43a93db1958cc11069aef1feace78c7d65f0b8a7fcde360693db79007
kt0200000000000000010040a7861387eecfb8c4485d9ac3816fe7d17dd0187167dc536d2db1df4514c7da4bee4399d43a93db1958cc11069aef1feace78c7d65f0b8a7fcde360693db79007
agrees `updated` carries an auditor head only under thirdPartyAuditing (§11.4)
peerfalse
ktfalse
agrees FullTreeHead verification accepts the peer's head (§11.4)
peeraccepted
ktaccepted
 agrees
third-party-management-size-8 ThirdPartyManagement, tree size 8
10 checks
agrees Configuration encoding (§11.2)
peer0002020020e2fe2a39b7326642827d6d82d497622cd6c297fe78270eaa436b01f086b6f3cb0020555f469c22188e90015bdd85b889678d459f86bdf8f7bd34971b10b9b38586090020fec1428673f6afe89264b3807344ae8b269d125a503855202687db5a7128579f0000000000002710000000000000271000000000240c840000
kt0002020020e2fe2a39b7326642827d6d82d497622cd6c297fe78270eaa436b01f086b6f3cb0020555f469c22188e90015bdd85b889678d459f86bdf8f7bd34971b10b9b38586090020fec1428673f6afe89264b3807344ae8b269d125a503855202687db5a7128579f0000000000002710000000000000271000000000240c840000
agrees decoding the peer's Configuration gives the same value
peerround-trips
ktround-trips
agrees TreeHeadTBS encoding — the bytes signed (§11.2)
peer0002020020e2fe2a39b7326642827d6d82d497622cd6c297fe78270eaa436b01f086b6f3cb0020555f469c22188e90015bdd85b889678d459f86bdf8f7bd34971b10b9b38586090020fec1428673f6afe89264b3807344ae8b269d125a503855202687db5a7128579f0000000000002710000000000000271000000000240c84000000000000000000080808080808080808080808080808080808080808080808080808080808080808
kt0002020020e2fe2a39b7326642827d6d82d497622cd6c297fe78270eaa436b01f086b6f3cb0020555f469c22188e90015bdd85b889678d459f86bdf8f7bd34971b10b9b38586090020fec1428673f6afe89264b3807344ae8b269d125a503855202687db5a7128579f0000000000002710000000000000271000000000240c84000000000000000000080808080808080808080808080808080808080808080808080808080808080808
agrees TreeHead encoding (§11.2)
peer00000000000000080040b6750c4de425bdbc4efc608d7e1a571c762fd5bf3cafebfe20ae6a000d3fb5d40c8fa2ee8bc4f09232890b817fc34bedd6cdba5b263277fddf06bca6c3453902
kt00000000000000080040b6750c4de425bdbc4efc608d7e1a571c762fd5bf3cafebfe20ae6a000d3fb5d40c8fa2ee8bc4f09232890b817fc34bedd6cdba5b263277fddf06bca6c3453902
agrees the peer's tree head signature verifies (§11.2)
peeraccepted
ktaccepted
agrees FullTreeHead `same` round-trips through the mode (§11.4)
peer01
kt01
agrees `same` carries an auditor head only under thirdPartyAuditing (§11.4)
peerfalse
ktfalse
agrees FullTreeHead `updated` round-trips through the mode (§11.4)
peer0200000000000000080040b6750c4de425bdbc4efc608d7e1a571c762fd5bf3cafebfe20ae6a000d3fb5d40c8fa2ee8bc4f09232890b817fc34bedd6cdba5b263277fddf06bca6c3453902
kt0200000000000000080040b6750c4de425bdbc4efc608d7e1a571c762fd5bf3cafebfe20ae6a000d3fb5d40c8fa2ee8bc4f09232890b817fc34bedd6cdba5b263277fddf06bca6c3453902
agrees `updated` carries an auditor head only under thirdPartyAuditing (§11.4)
peerfalse
ktfalse
agrees FullTreeHead verification accepts the peer's head (§11.4)
peeraccepted
ktaccepted
 agrees
third-party-management-size-50 ThirdPartyManagement, tree size 50
10 checks
agrees Configuration encoding (§11.2)
peer0002020020e2fe2a39b7326642827d6d82d497622cd6c297fe78270eaa436b01f086b6f3cb0020555f469c22188e90015bdd85b889678d459f86bdf8f7bd34971b10b9b38586090020fec1428673f6afe89264b3807344ae8b269d125a503855202687db5a7128579f0000000000002710000000000000271000000000240c840000
kt0002020020e2fe2a39b7326642827d6d82d497622cd6c297fe78270eaa436b01f086b6f3cb0020555f469c22188e90015bdd85b889678d459f86bdf8f7bd34971b10b9b38586090020fec1428673f6afe89264b3807344ae8b269d125a503855202687db5a7128579f0000000000002710000000000000271000000000240c840000
agrees decoding the peer's Configuration gives the same value
peerround-trips
ktround-trips
agrees TreeHeadTBS encoding — the bytes signed (§11.2)
peer0002020020e2fe2a39b7326642827d6d82d497622cd6c297fe78270eaa436b01f086b6f3cb0020555f469c22188e90015bdd85b889678d459f86bdf8f7bd34971b10b9b38586090020fec1428673f6afe89264b3807344ae8b269d125a503855202687db5a7128579f0000000000002710000000000000271000000000240c84000000000000000000323232323232323232323232323232323232323232323232323232323232323232
kt0002020020e2fe2a39b7326642827d6d82d497622cd6c297fe78270eaa436b01f086b6f3cb0020555f469c22188e90015bdd85b889678d459f86bdf8f7bd34971b10b9b38586090020fec1428673f6afe89264b3807344ae8b269d125a503855202687db5a7128579f0000000000002710000000000000271000000000240c84000000000000000000323232323232323232323232323232323232323232323232323232323232323232
agrees TreeHead encoding (§11.2)
peer00000000000000320040da3ad93753a9a5612ebab00584ae32ddb76ce62029ef2878c80e6940059297b9208216cbc45862021b7c70743504cf0b91d1ed71b9725c5307e7b830172d5c02
kt00000000000000320040da3ad93753a9a5612ebab00584ae32ddb76ce62029ef2878c80e6940059297b9208216cbc45862021b7c70743504cf0b91d1ed71b9725c5307e7b830172d5c02
agrees the peer's tree head signature verifies (§11.2)
peeraccepted
ktaccepted
agrees FullTreeHead `same` round-trips through the mode (§11.4)
peer01
kt01
agrees `same` carries an auditor head only under thirdPartyAuditing (§11.4)
peerfalse
ktfalse
agrees FullTreeHead `updated` round-trips through the mode (§11.4)
peer0200000000000000320040da3ad93753a9a5612ebab00584ae32ddb76ce62029ef2878c80e6940059297b9208216cbc45862021b7c70743504cf0b91d1ed71b9725c5307e7b830172d5c02
kt0200000000000000320040da3ad93753a9a5612ebab00584ae32ddb76ce62029ef2878c80e6940059297b9208216cbc45862021b7c70743504cf0b91d1ed71b9725c5307e7b830172d5c02
agrees `updated` carries an auditor head only under thirdPartyAuditing (§11.4)
peerfalse
ktfalse
agrees FullTreeHead verification accepts the peer's head (§11.4)
peeraccepted
ktaccepted
 agrees
third-party-auditing-size-1 ThirdPartyAuditing, tree size 1
12 checks
agrees Configuration encoding (§11.2)
peer0002030020e2fe2a39b7326642827d6d82d497622cd6c297fe78270eaa436b01f086b6f3cb0020555f469c22188e90015bdd85b889678d459f86bdf8f7bd34971b10b9b3858609000000000000ea60000000000000000000205b6489c9c7fd0dcf50545e7c164886ef40491ec06c7f1b123041797e8117535e0000000000002710000000000000271000000000240c840000
kt0002030020e2fe2a39b7326642827d6d82d497622cd6c297fe78270eaa436b01f086b6f3cb0020555f469c22188e90015bdd85b889678d459f86bdf8f7bd34971b10b9b3858609000000000000ea60000000000000000000205b6489c9c7fd0dcf50545e7c164886ef40491ec06c7f1b123041797e8117535e0000000000002710000000000000271000000000240c840000
agrees decoding the peer's Configuration gives the same value
peerround-trips
ktround-trips
agrees TreeHeadTBS encoding — the bytes signed (§11.2)
peer0002030020e2fe2a39b7326642827d6d82d497622cd6c297fe78270eaa436b01f086b6f3cb0020555f469c22188e90015bdd85b889678d459f86bdf8f7bd34971b10b9b3858609000000000000ea60000000000000000000205b6489c9c7fd0dcf50545e7c164886ef40491ec06c7f1b123041797e8117535e0000000000002710000000000000271000000000240c84000000000000000000010101010101010101010101010101010101010101010101010101010101010101
kt0002030020e2fe2a39b7326642827d6d82d497622cd6c297fe78270eaa436b01f086b6f3cb0020555f469c22188e90015bdd85b889678d459f86bdf8f7bd34971b10b9b3858609000000000000ea60000000000000000000205b6489c9c7fd0dcf50545e7c164886ef40491ec06c7f1b123041797e8117535e0000000000002710000000000000271000000000240c84000000000000000000010101010101010101010101010101010101010101010101010101010101010101
agrees TreeHead encoding (§11.2)
peer00000000000000010040f74a99f76cf49cc8947a1e82bda288369205c710ce578914dc3b07651fa5c63b2d256f5b1544ea6fbbb7a9e962160c74bb87ab25e11f5b473a7f33922d9aeb08
kt00000000000000010040f74a99f76cf49cc8947a1e82bda288369205c710ce578914dc3b07651fa5c63b2d256f5b1544ea6fbbb7a9e962160c74bb87ab25e11f5b473a7f33922d9aeb08
agrees the peer's tree head signature verifies (§11.2)
peeraccepted
ktaccepted
agrees FullTreeHead `same` round-trips through the mode (§11.4)
peer01
kt01
agrees `same` carries an auditor head only under thirdPartyAuditing (§11.4)
peerfalse
ktfalse
agrees FullTreeHead `updated` round-trips through the mode (§11.4)
peer0200000000000000010040f74a99f76cf49cc8947a1e82bda288369205c710ce578914dc3b07651fa5c63b2d256f5b1544ea6fbbb7a9e962160c74bb87ab25e11f5b473a7f33922d9aeb080000018bcfe5680000000000000000010040daca4f2ecfd754728c6f88a82001ad9d52770a25ad608e8971a839e2b505abacd7ade56d58dfcda3b28b8617417b79b7fbceb23983e959924a0e71fefc1ac807
kt0200000000000000010040f74a99f76cf49cc8947a1e82bda288369205c710ce578914dc3b07651fa5c63b2d256f5b1544ea6fbbb7a9e962160c74bb87ab25e11f5b473a7f33922d9aeb080000018bcfe5680000000000000000010040daca4f2ecfd754728c6f88a82001ad9d52770a25ad608e8971a839e2b505abacd7ade56d58dfcda3b28b8617417b79b7fbceb23983e959924a0e71fefc1ac807
agrees `updated` carries an auditor head only under thirdPartyAuditing (§11.4)
peertrue
kttrue
agrees AuditorTreeHeadTBS encoding (§11.3)
peer0002030020e2fe2a39b7326642827d6d82d497622cd6c297fe78270eaa436b01f086b6f3cb0020555f469c22188e90015bdd85b889678d459f86bdf8f7bd34971b10b9b3858609000000000000ea60000000000000000000205b6489c9c7fd0dcf50545e7c164886ef40491ec06c7f1b123041797e8117535e0000000000002710000000000000271000000000240c8400000000018bcfe5680000000000000000010101010101010101010101010101010101010101010101010101010101010101
kt0002030020e2fe2a39b7326642827d6d82d497622cd6c297fe78270eaa436b01f086b6f3cb0020555f469c22188e90015bdd85b889678d459f86bdf8f7bd34971b10b9b3858609000000000000ea60000000000000000000205b6489c9c7fd0dcf50545e7c164886ef40491ec06c7f1b123041797e8117535e0000000000002710000000000000271000000000240c8400000000018bcfe5680000000000000000010101010101010101010101010101010101010101010101010101010101010101
agrees the auditor's signature verifies (§11.3)
peeraccepted
ktaccepted
agrees FullTreeHead verification accepts the peer's heads (§11.4)
peeraccepted
ktaccepted
 agrees
third-party-auditing-size-8 ThirdPartyAuditing, tree size 8
12 checks
agrees Configuration encoding (§11.2)
peer0002030020e2fe2a39b7326642827d6d82d497622cd6c297fe78270eaa436b01f086b6f3cb0020555f469c22188e90015bdd85b889678d459f86bdf8f7bd34971b10b9b3858609000000000000ea60000000000000000000205b6489c9c7fd0dcf50545e7c164886ef40491ec06c7f1b123041797e8117535e0000000000002710000000000000271000000000240c840000
kt0002030020e2fe2a39b7326642827d6d82d497622cd6c297fe78270eaa436b01f086b6f3cb0020555f469c22188e90015bdd85b889678d459f86bdf8f7bd34971b10b9b3858609000000000000ea60000000000000000000205b6489c9c7fd0dcf50545e7c164886ef40491ec06c7f1b123041797e8117535e0000000000002710000000000000271000000000240c840000
agrees decoding the peer's Configuration gives the same value
peerround-trips
ktround-trips
agrees TreeHeadTBS encoding — the bytes signed (§11.2)
peer0002030020e2fe2a39b7326642827d6d82d497622cd6c297fe78270eaa436b01f086b6f3cb0020555f469c22188e90015bdd85b889678d459f86bdf8f7bd34971b10b9b3858609000000000000ea60000000000000000000205b6489c9c7fd0dcf50545e7c164886ef40491ec06c7f1b123041797e8117535e0000000000002710000000000000271000000000240c84000000000000000000080808080808080808080808080808080808080808080808080808080808080808
kt0002030020e2fe2a39b7326642827d6d82d497622cd6c297fe78270eaa436b01f086b6f3cb0020555f469c22188e90015bdd85b889678d459f86bdf8f7bd34971b10b9b3858609000000000000ea60000000000000000000205b6489c9c7fd0dcf50545e7c164886ef40491ec06c7f1b123041797e8117535e0000000000002710000000000000271000000000240c84000000000000000000080808080808080808080808080808080808080808080808080808080808080808
agrees TreeHead encoding (§11.2)
peer000000000000000800405ccb043600d309f55ae637d7aa3a6987aa8693b26aef4ba42620e66940d244d4e61d40e788c0ae1b1f93be2c8540a5fe90b321d9f8240305f21379768abc300d
kt000000000000000800405ccb043600d309f55ae637d7aa3a6987aa8693b26aef4ba42620e66940d244d4e61d40e788c0ae1b1f93be2c8540a5fe90b321d9f8240305f21379768abc300d
agrees the peer's tree head signature verifies (§11.2)
peeraccepted
ktaccepted
agrees FullTreeHead `same` round-trips through the mode (§11.4)
peer01
kt01
agrees `same` carries an auditor head only under thirdPartyAuditing (§11.4)
peerfalse
ktfalse
agrees FullTreeHead `updated` round-trips through the mode (§11.4)
peer02000000000000000800405ccb043600d309f55ae637d7aa3a6987aa8693b26aef4ba42620e66940d244d4e61d40e788c0ae1b1f93be2c8540a5fe90b321d9f8240305f21379768abc300d0000018bcfe56800000000000000000800409f1bccf9ae20d07c7c4445b630dcdb1698e94c5ea4e5992a15cabc9d7b5f52b7b5b7df7f85080ab4a2d5f834d5d8efd7c257533b6f0aa9e7196a27ab48a8900e
kt02000000000000000800405ccb043600d309f55ae637d7aa3a6987aa8693b26aef4ba42620e66940d244d4e61d40e788c0ae1b1f93be2c8540a5fe90b321d9f8240305f21379768abc300d0000018bcfe56800000000000000000800409f1bccf9ae20d07c7c4445b630dcdb1698e94c5ea4e5992a15cabc9d7b5f52b7b5b7df7f85080ab4a2d5f834d5d8efd7c257533b6f0aa9e7196a27ab48a8900e
agrees `updated` carries an auditor head only under thirdPartyAuditing (§11.4)
peertrue
kttrue
agrees AuditorTreeHeadTBS encoding (§11.3)
peer0002030020e2fe2a39b7326642827d6d82d497622cd6c297fe78270eaa436b01f086b6f3cb0020555f469c22188e90015bdd85b889678d459f86bdf8f7bd34971b10b9b3858609000000000000ea60000000000000000000205b6489c9c7fd0dcf50545e7c164886ef40491ec06c7f1b123041797e8117535e0000000000002710000000000000271000000000240c8400000000018bcfe5680000000000000000080808080808080808080808080808080808080808080808080808080808080808
kt0002030020e2fe2a39b7326642827d6d82d497622cd6c297fe78270eaa436b01f086b6f3cb0020555f469c22188e90015bdd85b889678d459f86bdf8f7bd34971b10b9b3858609000000000000ea60000000000000000000205b6489c9c7fd0dcf50545e7c164886ef40491ec06c7f1b123041797e8117535e0000000000002710000000000000271000000000240c8400000000018bcfe5680000000000000000080808080808080808080808080808080808080808080808080808080808080808
agrees the auditor's signature verifies (§11.3)
peeraccepted
ktaccepted
agrees FullTreeHead verification accepts the peer's heads (§11.4)
peeraccepted
ktaccepted
 agrees
third-party-auditing-size-50 ThirdPartyAuditing, tree size 50
12 checks
agrees Configuration encoding (§11.2)
peer0002030020e2fe2a39b7326642827d6d82d497622cd6c297fe78270eaa436b01f086b6f3cb0020555f469c22188e90015bdd85b889678d459f86bdf8f7bd34971b10b9b3858609000000000000ea60000000000000000000205b6489c9c7fd0dcf50545e7c164886ef40491ec06c7f1b123041797e8117535e0000000000002710000000000000271000000000240c840000
kt0002030020e2fe2a39b7326642827d6d82d497622cd6c297fe78270eaa436b01f086b6f3cb0020555f469c22188e90015bdd85b889678d459f86bdf8f7bd34971b10b9b3858609000000000000ea60000000000000000000205b6489c9c7fd0dcf50545e7c164886ef40491ec06c7f1b123041797e8117535e0000000000002710000000000000271000000000240c840000
agrees decoding the peer's Configuration gives the same value
peerround-trips
ktround-trips
agrees TreeHeadTBS encoding — the bytes signed (§11.2)
peer0002030020e2fe2a39b7326642827d6d82d497622cd6c297fe78270eaa436b01f086b6f3cb0020555f469c22188e90015bdd85b889678d459f86bdf8f7bd34971b10b9b3858609000000000000ea60000000000000000000205b6489c9c7fd0dcf50545e7c164886ef40491ec06c7f1b123041797e8117535e0000000000002710000000000000271000000000240c84000000000000000000323232323232323232323232323232323232323232323232323232323232323232
kt0002030020e2fe2a39b7326642827d6d82d497622cd6c297fe78270eaa436b01f086b6f3cb0020555f469c22188e90015bdd85b889678d459f86bdf8f7bd34971b10b9b3858609000000000000ea60000000000000000000205b6489c9c7fd0dcf50545e7c164886ef40491ec06c7f1b123041797e8117535e0000000000002710000000000000271000000000240c84000000000000000000323232323232323232323232323232323232323232323232323232323232323232
agrees TreeHead encoding (§11.2)
peer00000000000000320040f8486c5b61a60a6d097f4a50f0cc965500046d90c595c1a9450f647c32a4cee9e0df383feb038a4481bc6d57be8e13fa1656c5daa1f784a3eb5f073465520403
kt00000000000000320040f8486c5b61a60a6d097f4a50f0cc965500046d90c595c1a9450f647c32a4cee9e0df383feb038a4481bc6d57be8e13fa1656c5daa1f784a3eb5f073465520403
agrees the peer's tree head signature verifies (§11.2)
peeraccepted
ktaccepted
agrees FullTreeHead `same` round-trips through the mode (§11.4)
peer01
kt01
agrees `same` carries an auditor head only under thirdPartyAuditing (§11.4)
peerfalse
ktfalse
agrees FullTreeHead `updated` round-trips through the mode (§11.4)
peer0200000000000000320040f8486c5b61a60a6d097f4a50f0cc965500046d90c595c1a9450f647c32a4cee9e0df383feb038a4481bc6d57be8e13fa1656c5daa1f784a3eb5f0734655204030000018bcfe568000000000000000032004031357d08a0dae6999e8d340c55ef6db7d06a0d2aa5bbeb4cd8cb8e8e0fa97447226bf652738580659eac7dee3763836e89d78808ccf7f07920352c8ba76d0106
kt0200000000000000320040f8486c5b61a60a6d097f4a50f0cc965500046d90c595c1a9450f647c32a4cee9e0df383feb038a4481bc6d57be8e13fa1656c5daa1f784a3eb5f0734655204030000018bcfe568000000000000000032004031357d08a0dae6999e8d340c55ef6db7d06a0d2aa5bbeb4cd8cb8e8e0fa97447226bf652738580659eac7dee3763836e89d78808ccf7f07920352c8ba76d0106
agrees `updated` carries an auditor head only under thirdPartyAuditing (§11.4)
peertrue
kttrue
agrees AuditorTreeHeadTBS encoding (§11.3)
peer0002030020e2fe2a39b7326642827d6d82d497622cd6c297fe78270eaa436b01f086b6f3cb0020555f469c22188e90015bdd85b889678d459f86bdf8f7bd34971b10b9b3858609000000000000ea60000000000000000000205b6489c9c7fd0dcf50545e7c164886ef40491ec06c7f1b123041797e8117535e0000000000002710000000000000271000000000240c8400000000018bcfe5680000000000000000323232323232323232323232323232323232323232323232323232323232323232
kt0002030020e2fe2a39b7326642827d6d82d497622cd6c297fe78270eaa436b01f086b6f3cb0020555f469c22188e90015bdd85b889678d459f86bdf8f7bd34971b10b9b3858609000000000000ea60000000000000000000205b6489c9c7fd0dcf50545e7c164886ef40491ec06c7f1b123041797e8117535e0000000000002710000000000000271000000000240c8400000000018bcfe5680000000000000000323232323232323232323232323232323232323232323232323232323232323232
agrees the auditor's signature verifies (§11.3)
peeraccepted
ktaccepted
agrees FullTreeHead verification accepts the peer's heads (§11.4)
peeraccepted
ktaccepted
 agrees

Requests and building blocks §11.5, §13.1–§13.5

Vectors: requests.json · oracle: katie @ 00da52541f6a · cipher suite 0x0002 KT_128_SHA256_Ed25519 · 22 cases, 44 checks agrees

CaseInputChecksResult
search-greatest-version-with-last SearchRequest (§13.1)
2 checks
agrees SearchRequest (§13.1) encoding
peer01000000000000003211616c696365406578616d706c652e636f6d00
kt01000000000000003211616c696365406578616d706c652e636f6d00
agrees SearchRequest (§13.1) decodes back
peerround-trips
ktround-trips
 agrees
search-greatest-version-first-time SearchRequest (§13.1)
2 checks
agrees SearchRequest (§13.1) encoding
peer0011616c696365406578616d706c652e636f6d00
kt0011616c696365406578616d706c652e636f6d00
agrees SearchRequest (§13.1) decodes back
peerround-trips
ktround-trips
 agrees
search-fixed-version SearchRequest (§13.1)
2 checks
agrees SearchRequest (§13.1) encoding
peer01000000000000003211616c696365406578616d706c652e636f6d0100000003
kt01000000000000003211616c696365406578616d706c652e636f6d0100000003
agrees SearchRequest (§13.1) decodes back
peerround-trips
ktround-trips
 agrees
search-fixed-version-zero SearchRequest (§13.1)
2 checks
agrees SearchRequest (§13.1) encoding
peer01000000000000000111616c696365406578616d706c652e636f6d0100000000
kt01000000000000000111616c696365406578616d706c652e636f6d0100000000
agrees SearchRequest (§13.1) decodes back
peerround-trips
ktround-trips
 agrees
search-fixed-version-max SearchRequest (§13.1)
2 checks
agrees SearchRequest (§13.1) encoding
peer01000000000000000111616c696365406578616d706c652e636f6d01ffffffff
kt01000000000000000111616c696365406578616d706c652e636f6d01ffffffff
agrees SearchRequest (§13.1) decodes back
peerround-trips
ktround-trips
 agrees
binary-ladder-step-with-commitment BinaryLadderStep (§13.1)
2 checks
agrees BinaryLadderStep (§13.1) encoding
peerf73cf4600d657de46b1c253865fb864c21c61d2f953e0de8783551a320a6ead8db24ada8c88dc61ef91918546bfbcf7a368978fa3fd0be323df12dd9e33158b6030f85a1626f67b9ce76824925638f0001c0c0c0c0c0c0c0c0c0c0c0c0c0c0c0c0c0c0c0c0c0c0c0c0c0c0c0c0c0c0c0c0
ktf73cf4600d657de46b1c253865fb864c21c61d2f953e0de8783551a320a6ead8db24ada8c88dc61ef91918546bfbcf7a368978fa3fd0be323df12dd9e33158b6030f85a1626f67b9ce76824925638f0001c0c0c0c0c0c0c0c0c0c0c0c0c0c0c0c0c0c0c0c0c0c0c0c0c0c0c0c0c0c0c0c0
agrees BinaryLadderStep (§13.1) decodes back
peerround-trips
ktround-trips
 agrees
binary-ladder-step-without-commitment BinaryLadderStep (§13.1)
2 checks
agrees BinaryLadderStep (§13.1) encoding
peerf73cf4600d657de46b1c253865fb864c21c61d2f953e0de8783551a320a6ead8db24ada8c88dc61ef91918546bfbcf7a368978fa3fd0be323df12dd9e33158b6030f85a1626f67b9ce76824925638f0000
ktf73cf4600d657de46b1c253865fb864c21c61d2f953e0de8783551a320a6ead8db24ada8c88dc61ef91918546bfbcf7a368978fa3fd0be323df12dd9e33158b6030f85a1626f67b9ce76824925638f0000
agrees BinaryLadderStep (§13.1) decodes back
peerround-trips
ktround-trips
 agrees
monitor-map-entry MonitorMapEntry (§13.2)
2 checks
agrees MonitorMapEntry (§13.2) encoding
peer010203040506070800000009
kt010203040506070800000009
agrees MonitorMapEntry (§13.2) decodes back
peerround-trips
ktround-trips
 agrees
contact-monitor-three-entries ContactMonitorRequest (§13.2)
2 checks
agrees ContactMonitorRequest (§13.2) encoding
peer01000000000000000a11616c696365406578616d706c652e636f6d03000000000000000100000001000000000000000500000002000000000000000900000003
kt01000000000000000a11616c696365406578616d706c652e636f6d03000000000000000100000001000000000000000500000002000000000000000900000003
agrees ContactMonitorRequest (§13.2) decodes back
peerround-trips
ktround-trips
 agrees
contact-monitor-no-entries ContactMonitorRequest (§13.2)
2 checks
agrees ContactMonitorRequest (§13.2) encoding
peer01000000000000000a11616c696365406578616d706c652e636f6d00
kt01000000000000000a11616c696365406578616d706c652e636f6d00
agrees ContactMonitorRequest (§13.2) decodes back
peerround-trips
ktround-trips
 agrees
contact-monitor-first-time ContactMonitorRequest (§13.2)
2 checks
agrees ContactMonitorRequest (§13.2) encoding
peer0011616c696365406578616d706c652e636f6d03000000000000000100000001000000000000000500000002000000000000000900000003
kt0011616c696365406578616d706c652e636f6d03000000000000000100000001000000000000000500000002000000000000000900000003
agrees ContactMonitorRequest (§13.2) decodes back
peerround-trips
ktround-trips
 agrees
owner-init OwnerInitRequest (§13.3)
2 checks
agrees OwnerInitRequest (§13.3) encoding
peer01000000000000004011616c696365406578616d706c652e636f6d000000000000001f
kt01000000000000004011616c696365406578616d706c652e636f6d000000000000001f
agrees OwnerInitRequest (§13.3) decodes back
peerround-trips
ktround-trips
 agrees
owner-init-first-time OwnerInitRequest (§13.3)
2 checks
agrees OwnerInitRequest (§13.3) encoding
peer0011616c696365406578616d706c652e636f6d0000000000000000
kt0011616c696365406578616d706c652e636f6d0000000000000000
agrees OwnerInitRequest (§13.3) decodes back
peerround-trips
ktround-trips
 agrees
owner-monitor-with-greatest-version OwnerMonitorRequest (§13.4)
2 checks
agrees OwnerMonitorRequest (§13.4) encoding
peer01000000000000004011616c696365406578616d706c652e636f6d01000000000000000100000001000000000000001f0100000005
kt01000000000000004011616c696365406578616d706c652e636f6d01000000000000000100000001000000000000001f0100000005
agrees OwnerMonitorRequest (§13.4) decodes back
peerround-trips
ktround-trips
 agrees
owner-monitor-without-greatest-version OwnerMonitorRequest (§13.4)
2 checks
agrees OwnerMonitorRequest (§13.4) encoding
peer01000000000000004011616c696365406578616d706c652e636f6d01000000000000000100000001000000000000001f00
kt01000000000000004011616c696365406578616d706c652e636f6d01000000000000000100000001000000000000001f00
agrees OwnerMonitorRequest (§13.4) decodes back
peerround-trips
ktround-trips
 agrees
label-value LabelValue (§13.5)
2 checks
agrees LabelValue (§13.5) encoding
peer0000000e6b65792d6d6174657269616c2d31
kt0000000e6b65792d6d6174657269616c2d31
agrees LabelValue (§13.5) decodes back
peerround-trips
ktround-trips
 agrees
label-value-empty LabelValue (§13.5)
2 checks
agrees LabelValue (§13.5) encoding
peer00000000
kt00000000
agrees LabelValue (§13.5) decodes back
peerround-trips
ktround-trips
 agrees
update-info-contact-monitoring UpdateInfo (§13.5)
2 checks
agrees UpdateInfo (§13.5) encoding
peer101112131415161718191a1b1c1d1e1f
kt101112131415161718191a1b1c1d1e1f
agrees UpdateInfo (§13.5) decodes back
peerround-trips
ktround-trips
 agrees
update-two-values UpdateRequest (§13.5)
2 checks
agrees UpdateRequest (§13.5) encoding
peer01000000000000000811616c696365406578616d706c652e636f6d0100000002020000000e6b65792d6d6174657269616c2d310000000e6b65792d6d6174657269616c2d32
kt01000000000000000811616c696365406578616d706c652e636f6d0100000002020000000e6b65792d6d6174657269616c2d310000000e6b65792d6d6174657269616c2d32
agrees UpdateRequest (§13.5) decodes back
peerround-trips
ktround-trips
 agrees
update-no-values-asking-only UpdateRequest (§13.5)
2 checks
agrees UpdateRequest (§13.5) encoding
peer01000000000000000811616c696365406578616d706c652e636f6d010000000200
kt01000000000000000811616c696365406578616d706c652e636f6d010000000200
agrees UpdateRequest (§13.5) decodes back
peerround-trips
ktround-trips
 agrees
update-first-version UpdateRequest (§13.5)
2 checks
agrees UpdateRequest (§13.5) encoding
peer01000000000000000811616c696365406578616d706c652e636f6d00010000000e6b65792d6d6174657269616c2d31
kt01000000000000000811616c696365406578616d706c652e636f6d00010000000e6b65792d6d6174657269616c2d31
agrees UpdateRequest (§13.5) decodes back
peerround-trips
ktround-trips
 agrees
update-tbs UpdateTBS (§11.5)
2 checks
agrees UpdateTBS (§11.5) encoding
peer0002020020e2fe2a39b7326642827d6d82d497622cd6c297fe78270eaa436b01f086b6f3cb0020555f469c22188e90015bdd85b889678d459f86bdf8f7bd34971b10b9b38586090020fec1428673f6afe89264b3807344ae8b269d125a503855202687db5a7128579f0000000000002710000000000000271000000000240c84000011616c696365406578616d706c652e636f6d000000040000000e6b65792d6d6174657269616c2d31
kt0002020020e2fe2a39b7326642827d6d82d497622cd6c297fe78270eaa436b01f086b6f3cb0020555f469c22188e90015bdd85b889678d459f86bdf8f7bd34971b10b9b38586090020fec1428673f6afe89264b3807344ae8b269d125a503855202687db5a7128579f0000000000002710000000000000271000000000240c84000011616c696365406578616d706c652e636f6d000000040000000e6b65792d6d6174657269616c2d31
agrees UpdateTBS (§11.5) decodes back
peerround-trips
ktround-trips
 agrees

Must reject §11.2, §11.6, §11.7, §12.1, §12.2

Vectors: tampered.json · oracle: katie @ 00da52541f6a · cipher suite 0x0002 KT_128_SHA256_Ed25519 · 22 cases, 22 checks agrees

22 of these cases assert a refusal: the peer says the input must be rejected, and accepting it would be the failure.

CaseInputChecksResult
log-flipped-element must refuse one bit flipped in the first proof element
1 checks
agrees log::verify rejects it (§12.1)
peerrejected
ktrejected
 agrees
log-dropped-element must refuse the last proof element removed
1 checks
agrees log::verify rejects it (§12.1)
peerrejected
ktrejected
 agrees
log-extra-element must refuse an extra all-zero proof element appended
1 checks
agrees log::verify rejects it (§12.1)
peerrejected
ktrejected
 agrees
log-swapped-elements must refuse the first two proof elements exchanged
1 checks
agrees log::verify rejects it (§12.1)
peerrejected
ktrejected
 agrees
log-wrong-leaf-value must refuse a different leaf's value claimed for the proven index
1 checks
agrees log::verify rejects it (§12.1)
peerrejected
ktrejected
 agrees
log-corrupted-retained-head must refuse a retained full subtree head corrupted, with a proven leaf inside it
1 checks
agrees log::verify rejects it (§12.1)
peerrejected
ktrejected
 agrees
prefix-flipped-element must refuse one bit flipped in the first copath element
1 checks
agrees prefix::verify rejects it (§12.2)
peerrejected
ktrejected
 agrees
prefix-dropped-element must refuse the last copath element removed
1 checks
agrees prefix::verify rejects it (§12.2)
peerrejected
ktrejected
 agrees
prefix-extra-element must refuse an extra all-zero copath element appended
1 checks
agrees prefix::verify rejects it (§12.2)
peerrejected
ktrejected
 agrees
prefix-reordered-elements must refuse the first two copath elements exchanged
1 checks
agrees prefix::verify rejects it (§12.2)
peerrejected
ktrejected
 agrees
vrf-flipped-proof-byte must refuse one bit flipped in the proof's Gamma
1 checks
agrees vrf verify rejects it (§11.7)
peerrejected
ktrejected
 agrees
vrf-flipped-challenge must refuse one bit flipped in the proof's challenge
1 checks
agrees vrf verify rejects it (§11.7)
peerrejected
ktrejected
 agrees
vrf-flipped-scalar must refuse one bit flipped in the proof's s
1 checks
agrees vrf verify rejects it (§11.7)
peerrejected
ktrejected
 agrees
vrf-wrong-public-key must refuse a valid proof checked against a different public key
1 checks
agrees vrf verify rejects it (§11.7)
peerrejected
ktrejected
 agrees
commitment-flipped-bit must refuse one bit flipped in the commitment
1 checks
agrees commitment::verify rejects it (§11.6)
peerrejected
ktrejected
 agrees
commitment-wrong-label must refuse a different label opened against the same commitment
1 checks
agrees commitment::verify rejects it (§11.6)
peerrejected
ktrejected
 agrees
commitment-wrong-version must refuse a different version opened against the same commitment
1 checks
agrees commitment::verify rejects it (§11.6)
peerrejected
ktrejected
 agrees
commitment-wrong-value must refuse a different value opened against the same commitment
1 checks
agrees commitment::verify rejects it (§11.6)
peerrejected
ktrejected
 agrees
tree-head-flipped-signature must refuse one bit flipped in the tree head signature
1 checks
agrees signature::verify_tree_head rejects it (§11.2)
peerrejected
ktrejected
 agrees
tree-head-wrong-key must refuse a valid signature checked against a different public key
1 checks
agrees signature::verify_tree_head rejects it (§11.2)
peerrejected
ktrejected
 agrees
tree-head-signature-from-another-key must refuse the head signed by a key other than the one the configuration names
1 checks
agrees signature::verify_tree_head rejects it (§11.2)
peerrejected
ktrejected
 agrees
tree-head-signed-over-the-other-reading-of-11-2 must refuse a signature valid over the grouped-case reading of §11.2, where a contactMonitoring Configuration carries leaf_public_key; it must not verify against the reading katie and the draft's prose use
1 checks
agrees signature::verify_tree_head rejects it (§11.2)
peerrejected
ktrejected
 agrees

Coverage

19 areas of the protocol are verified against the peer, 4 are implemented without a peer confirming the bytes, 7 are not implemented, and 1 are deliberately excluded. The unimplemented rows are listed on purpose: a page that showed only the passing ones would be a claim about this implementation's completeness that is not true.

The Refuses column is the one to read second. “Values only” means the peer and this implementation agree on what to compute — which a verifier that accepted everything would also satisfy, because nothing in that file asks it to say no. 4 areas additionally have vectors in tampered.json, where the peer has confirmed a proof is invalid and this implementation has to reject it too. Areas with no verifier to speak of — the tree arithmetic in §4.1 and §5 — have nothing to refuse.

DraftAreaModuleStateEvidenceRefuses
§2.1 Presentation-language codec kt-wire::codec verified against peer commitment.json values only
§11.5 UpdateValue kt-wire::structs verified against peer commitment.json values only
§11.6 CommitmentValue kt-wire::structs verified against peer commitment.json values only
§11.6 Commitment, HMAC(Kc, CommitmentValue) kt-crypto::commitment verified against peer commitment.json
tampered.json		 yes
§4.1, App. A Implicit binary search tree kt-tree::ibst verified against peer ibst.json values only
§5, App. B Binary ladders kt-tree::ladder verified against peer binary-ladder.json values only
§11.7 VRF: ECVRF-EDWARDS25519-SHA512-TAI kt-crypto::vrf verified against peer vrf.json
tampered.json		 yes
§3.2, §11.8, §12.1 Log tree: root, batch inclusion and consistency proofs kt-tree::log verified against peer log-tree.json
log-math.json
tampered.json		 yes
§6.2 Search ladder interpretation: is the greatest version below, at, or above kt-tree::ladder verified against peer ladder-interpretation.json values only
§11.5, §13.1–§13.5 Request structures and response building blocks kt-wire::requests verified against peer requests.json values only
§4.2 Updating a view of the tree: which entries must be checked kt-tree::ibst verified against peer update-view.json values only
§11.2, §11.4 Configuration, TreeHead, and FullTreeHead verification kt-crypto::signature verified against peer tree-head.json values only
§11.4 FullTreeHead wire encoding, whose shape the deployment mode decides kt-wire::heads verified against peer tree-head.json values only
§11.3 AuditorTreeHead verification kt-crypto::signature verified against peer tree-head.json values only
§3.3, §11.9, §12.2 Prefix tree: root, membership and non-membership proofs kt-tree::prefix verified against peer prefix-tree.json
tampered.json		 yes
§11.1, §17.1 Cipher suite registry kt-crypto::suite implemented, unverified — —
§11.1 Cipher suite hash function kt-crypto::hash implemented, unverified — —
§11.2 DeploymentMode kt-wire::structs implemented, unverified — —
§11.7, §17.1 VRF: ECVRF-P256-SHA256-TAI (KT_128_SHA256_P256) — out of scope — —
§3.4, §12.3 Combined tree and CombinedTreeProof — not implemented — —
§6, §7, §13.1 Greatest-version and fixed-version search — not implemented — —
§8, §13.2–§13.4 Contact and owner monitoring — not implemented — —
§9, §13.5 Updating a label — not implemented — —
§13.6 Requesting distinguished heads, and fork detection (§10.2) — not implemented — —
§14 Credentials — not implemented — —
§15.2 AuditorUpdate, and all of the auditor's checks on one log entry kt-wire::audit, kt-tree::audit verified against peer auditor-update.json values only
§6.1 Distinguished log entries: which entries every user checks against kt-tree::distinguished verified against peer distinguished.json values only
§10.1 Walking recent distinguished heads kt-tree::distinguished implemented, unverified — —
§3.2, §11.8 Growing the log tree one leaf at a time, from retained subtree heads kt-tree::log verified against peer log-append.json
auditor-update.json		 values only
§15.2, §3.3 Prefix tree root before and after an audited update kt-tree::prefix verified against peer prefix-mutation.json
auditor-update.json		 values only
live wire HTTP interop against a running Go peer — not implemented — —

Use these vectors

The vectors are data, not code, and are meant to be reused by any implementation of the draft. They carry no licence obligation from the AGPL-3.0 generator that produced them; the generator is a separate Go module for exactly that reason.

The format is one JSON file per primitive. The rules that matter when consuming them:

Both directions. Everything on this page is Go → Rust: the peer computed a value and this implementation recomputed it. The other direction runs in CI rather than here, because the peer is the one deciding and its verdict is not ours to render: kt-interop-emit writes proofs built by this implementation, half of them deliberately corrupted, and interop/go/cmd/verify runs each one through katie’s own verifiers — every honest proof must be accepted and evaluate to the root we claim, every corrupted one must be rejected. That is the direction that catches over-acceptance, where a client believes a proof the peer would refuse, and comparing recomputed values cannot see it. The fixtures are from-kt.json.

This page's own results are also available as report.json, with every sub-check included, in case you would rather diff than read.

If your implementation disagrees with a vector, that is worth reporting — it is either a bug here, a bug in the peer, or an ambiguity in the draft, and the third is the most valuable of the three. Issues go to https://github.com/OR13/kt/issues. The second Go implementation, keytrans-verification, is Gobra-verified and is a useful third opinion when two implementations disagree.