File size: 26,860 Bytes
3cd4de9 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 | {
"note": "Compute each `expected` from its `input` in any language, sharing none of this code, and compare PER VECTOR. That per-vector agreement is the whole of the evidence. THE ROOT IS NOT EVIDENCE: it is sha256 over spec, then for each vector sorted by id, a NUL byte, the id, a NUL byte, and the canonical JSON of expected (sorted keys, no spaces) -- all of which is written above, so anyone can reproduce the root in nine lines without implementing climb or attest at all. Jens Egholm Pedersen (DTU) demonstrated exactly that on 2026-09-15; see docs/KNOWN_ISSUES.md A121. The root is a label for WHICH expecteds these are, nothing more. A per-vector disagreement is a finding worth reporting, not a failure to hide.",
"root": "0c398099d7e9df6798f3cae1cea5f6dd71f28860300b2ae56e2dddd40f0ddcef",
"roots": {
"A": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa",
"B": "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb",
"C": "cccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccc"
},
"spec": "covenant-conformance-v1",
"vectors": [
{
"expected": {
"clean": true,
"divergences": 0,
"reference": "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb",
"silent_diverged": [],
"silent_unproven": [],
"speaks_upward": true,
"verdict": "AGREE"
},
"id": "S.clean.distinct-root",
"input": {
"op": "climb",
"tree": {
"children": [
{
"children": [
{
"leaf": "n0",
"root": "B"
},
{
"leaf": "n1",
"root": "B"
},
{
"leaf": "n2",
"root": "B"
}
],
"level": "k1"
},
{
"children": [
{
"leaf": "n0",
"root": "B"
},
{
"leaf": "n1",
"root": "B"
},
{
"leaf": "n2",
"root": "B"
}
],
"level": "k2"
},
{
"children": [
{
"leaf": "n0",
"root": "B"
},
{
"leaf": "n1",
"root": "B"
},
{
"leaf": "n2",
"root": "B"
}
],
"level": "k3"
}
],
"level": "allB"
}
},
"why": "KILLS THE CONSTANT-ROOT-UPWARD READING. Every other climb vector agrees on the single root A, so an implementation that speaks a hardcoded value upward -- or the first child's root, or the level's own name -- answers all of them identically to one that speaks what was actually agreed. This climb agrees on B and publishes, in full, the reference it speaks. A party handed a verdict must be able to check it against its own view rather than trust the verdict's word for it, and a boolean cannot be checked against anything"
},
{
"expected": {
"clean": true,
"divergences": 0,
"reference": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa",
"silent_diverged": [],
"silent_unproven": [],
"speaks_upward": true,
"verdict": "AGREE"
},
"id": "S.clean.is-reachable",
"input": {
"op": "climb",
"tree": {
"children": [
{
"children": [
{
"leaf": "n0",
"root": "A"
},
{
"leaf": "n1",
"root": "A"
},
{
"leaf": "n2",
"root": "A"
}
],
"level": "k1"
},
{
"children": [
{
"leaf": "n0",
"root": "A"
},
{
"leaf": "n1",
"root": "A"
},
{
"leaf": "n2",
"root": "A"
}
],
"level": "k2"
},
{
"children": [
{
"leaf": "n0",
"root": "A"
},
{
"leaf": "n1",
"root": "A"
},
{
"leaf": "n2",
"root": "A"
}
],
"level": "k3"
}
],
"level": "ok"
}
},
"why": "a genuinely clean tree DOES report clean, or the check is only a machine for saying no"
},
{
"expected": {
"clean": true,
"divergences": 0,
"reference": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa",
"silent_diverged": [],
"silent_unproven": [],
"speaks_upward": true,
"verdict": "AGREE"
},
"id": "S.compose.agree",
"input": {
"op": "climb",
"tree": {
"children": [
{
"leaf": "n0",
"root": "A"
},
{
"leaf": "n1",
"root": "A"
},
{
"leaf": "n2",
"root": "A"
}
],
"level": "L"
}
},
"why": "a level whose carriers agree, agrees, and speaks upward"
},
{
"expected": {
"clean": true,
"divergences": 0,
"reference": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa",
"silent_diverged": [],
"silent_unproven": [],
"speaks_upward": true,
"verdict": "AGREE"
},
"id": "S.compose.height-invariant",
"input": {
"op": "climb",
"tree": {
"children": [
{
"leaf": "bare",
"root": "A"
},
{
"children": [
{
"leaf": "n0",
"root": "A"
},
{
"leaf": "n1",
"root": "A"
},
{
"leaf": "n2",
"root": "A"
}
],
"level": "one"
},
{
"children": [
{
"children": [
{
"leaf": "n0",
"root": "A"
},
{
"leaf": "n1",
"root": "A"
},
{
"leaf": "n2",
"root": "A"
}
],
"level": "d"
},
{
"children": [
{
"leaf": "n0",
"root": "A"
},
{
"leaf": "n1",
"root": "A"
},
{
"leaf": "n2",
"root": "A"
}
],
"level": "e"
}
],
"level": "three"
}
],
"level": "MH"
}
},
"why": "THE INVARIANCE: a bare carrier, a one-deep level and a three-deep sub-federation holding the same content all agree. A level's value must not depend on how deep it sits"
},
{
"expected": {
"clean": false,
"divergences": 1,
"reference": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa",
"silent_diverged": [
"k2"
],
"silent_unproven": [],
"speaks_upward": true,
"verdict": "AGREE"
},
"id": "S.divergence.survives-climb",
"input": {
"op": "climb",
"tree": {
"children": [
{
"children": [
{
"leaf": "n0",
"root": "A"
},
{
"leaf": "n1",
"root": "A"
},
{
"leaf": "n2",
"root": "A"
}
],
"level": "k1"
},
{
"children": [
{
"leaf": "n0",
"root": "A"
},
{
"leaf": "n1",
"root": "B"
},
{
"leaf": "n2",
"root": "A"
}
],
"level": "k2"
},
{
"children": [
{
"leaf": "n0",
"root": "A"
},
{
"leaf": "n1",
"root": "A"
},
{
"leaf": "n2",
"root": "A"
}
],
"level": "k3"
}
],
"level": "top"
}
},
"why": "a divergence three levels down is still counted at the summit, and the summit refuses to call itself clean"
},
{
"expected": {
"clean": false,
"divergences": 3,
"reference": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa",
"silent_diverged": [
"k1"
],
"silent_unproven": [],
"speaks_upward": true,
"verdict": "AGREE"
},
"id": "S.divergences.split-counts-every-party",
"input": {
"op": "climb",
"tree": {
"children": [
{
"children": [
{
"leaf": "n0",
"root": "A"
},
{
"leaf": "n1",
"root": "B"
},
{
"leaf": "n2",
"root": "C"
}
],
"level": "k1"
},
{
"children": [
{
"leaf": "n0",
"root": "A"
},
{
"leaf": "n1",
"root": "A"
},
{
"leaf": "n2",
"root": "A"
}
],
"level": "k2"
},
{
"children": [
{
"leaf": "n0",
"root": "A"
},
{
"leaf": "n1",
"root": "A"
},
{
"leaf": "n2",
"root": "A"
}
],
"level": "k3"
}
],
"level": "split"
}
},
"why": "KILLS THE READING THAT A LEVEL WITH NO REFERENCE COUNTS FOR NOTHING -- the trap that the no-reference rule opens and that a naive count walks straight into. A three-way split names no outliers, correctly, since there is no reference to be an outlier FROM; so a tally taken from 'outliers' alone scores the whole split ZERO, it vanishes as the report climbs, and the summit reports clean over a hidden disagreement -- the one output this system must never produce. Every witness that answered into the split is party to it: three dissenters, and no clean summit"
},
{
"expected": {
"clean": false,
"divergences": 2,
"reference": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa",
"silent_diverged": [
"k1",
"k2"
],
"silent_unproven": [],
"speaks_upward": true,
"verdict": "AGREE"
},
"id": "S.divergences.two-levels",
"input": {
"op": "climb",
"tree": {
"children": [
{
"children": [
{
"leaf": "n0",
"root": "A"
},
{
"leaf": "n1",
"root": "A"
},
{
"leaf": "n2",
"root": "B"
}
],
"level": "k1"
},
{
"children": [
{
"leaf": "n0",
"root": "A"
},
{
"leaf": "n1",
"root": "A"
},
{
"leaf": "n2",
"root": "B"
}
],
"level": "k2"
},
{
"children": [
{
"leaf": "n0",
"root": "A"
},
{
"leaf": "n1",
"root": "A"
},
{
"leaf": "n2",
"root": "A"
}
],
"level": "k3"
},
{
"children": [
{
"leaf": "n0",
"root": "A"
},
{
"leaf": "n1",
"root": "A"
},
{
"leaf": "n2",
"root": "A"
}
],
"level": "k4"
},
{
"children": [
{
"leaf": "n0",
"root": "A"
},
{
"leaf": "n1",
"root": "A"
},
{
"leaf": "n2",
"root": "A"
}
],
"level": "k5"
}
],
"level": "two-bad"
}
},
"why": "the other half of that split, and the half that stops the count being read as 'outliers at the top level'. Two DIFFERENT levels with one dissenter each also total 2, so the number is over witnesses wherever in the tree they stand. Note what the summit does: it AGREES, and it still refuses to call itself clean"
},
{
"expected": {
"clean": false,
"divergences": 2,
"reference": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa",
"silent_diverged": [],
"silent_unproven": [],
"speaks_upward": false,
"verdict": "DIVERGED"
},
"id": "S.divergences.two-outliers-one-level",
"input": {
"op": "climb",
"tree": {
"children": [
{
"leaf": "n0",
"root": "A"
},
{
"leaf": "n1",
"root": "A"
},
{
"leaf": "n2",
"root": "B"
},
{
"leaf": "n3",
"root": "C"
}
],
"level": "four"
}
},
"why": "SPLITS 'COUNT DIVERGED LEVELS' FROM 'COUNT DISSENTING WITNESSES', which every earlier climb vector left identical because each of its diverged levels held exactly one outlier. One level over four carriers A,A,B,C: two witnesses dissent from one reference. Counting levels says 1; counting dissenters says 2. Two dissenters flattened into one number is the outvoted-into-invisibility failure happening at the tally instead of at the vote. It pins one thing more: a DIVERGED level still REPORTS its reference while SPEAKING nothing upward"
},
{
"expected": {
"clean": false,
"divergences": 0,
"reference": null,
"silent_diverged": [],
"silent_unproven": [
"s3",
"s4",
"s5"
],
"speaks_upward": false,
"verdict": "UNPROVEN"
},
"id": "S.quorum.default-scales-at-a-level",
"input": {
"op": "climb",
"tree": {
"children": [
{
"children": [
{
"leaf": "n0",
"root": "A"
},
{
"leaf": "n1",
"root": "A"
},
{
"leaf": "n2",
"root": "A"
}
],
"level": "k1"
},
{
"children": [
{
"leaf": "n0",
"root": "A"
},
{
"leaf": "n1",
"root": "A"
},
{
"leaf": "n2",
"root": "A"
}
],
"level": "k2"
},
{
"leaf": "s3",
"root": null
},
{
"leaf": "s4",
"root": null
},
{
"leaf": "s5",
"root": null
}
],
"level": "wide"
}
},
"why": "KILLS THE CONSTANT-QUORUM READING WHERE IT COSTS MOST: inside a federation. Five children, two agreeing, three that never answered. Under a constant 2 this level AGREES and speaks upward, so a federation of any size speaks on the word of two of its members and every level above it reads that as the whole. Under a majority of the five ASKED it is UNPROVEN and silent. It also pins a null-rooted leaf, which the two cold reimplementations split three ways: it is a SILENT witness, not a disagreeing one"
},
{
"expected": {
"clean": false,
"divergences": 1,
"reference": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa",
"silent_diverged": [
"dv"
],
"silent_unproven": [
"un"
],
"speaks_upward": true,
"verdict": "AGREE"
},
"id": "S.silence.two-kinds",
"input": {
"op": "climb",
"tree": {
"children": [
{
"children": [
{
"leaf": "n0",
"root": "A"
},
{
"leaf": "n1",
"root": "A"
},
{
"leaf": "n2",
"root": "B"
}
],
"level": "dv"
},
{
"children": [
{
"leaf": "n0",
"root": "A"
},
{
"leaf": "n1",
"root": null
},
{
"leaf": "n2",
"root": null
}
],
"level": "un"
},
{
"children": [
{
"leaf": "n0",
"root": "A"
},
{
"leaf": "n1",
"root": "A"
},
{
"leaf": "n2",
"root": "A"
}
],
"level": "k3"
},
{
"children": [
{
"leaf": "n0",
"root": "A"
},
{
"leaf": "n1",
"root": "A"
},
{
"leaf": "n2",
"root": "A"
}
],
"level": "k4"
},
{
"children": [
{
"leaf": "n0",
"root": "A"
},
{
"leaf": "n1",
"root": "A"
},
{
"leaf": "n2",
"root": "A"
}
],
"level": "k5"
}
],
"level": "both"
}
},
"why": "KILLS THE READING THAT ONE SILENCE IS ENOUGH. A DIVERGED child and an UNPROVEN child both speak nothing upward, so a report that publishes only 'silent' makes them the same fact -- but 'my child disagreed internally' and 'my child could not establish anything' call for different responses, and merging them loses the difference at exactly the level where someone would act on it. This is the not_understood / infrastructure_failure distinction the project already draws, drawn here for the same reason. dv lands in silent_diverged, un in silent_unproven, and only dv's dissenter is counted -- silence is not disagreement"
},
{
"expected": {
"clean": false,
"divergences": 1,
"reference": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa",
"silent_diverged": [],
"silent_unproven": [],
"speaks_upward": false,
"verdict": "DIVERGED"
},
"id": "S.silence.upward",
"input": {
"op": "climb",
"tree": {
"children": [
{
"leaf": "n0",
"root": "A"
},
{
"leaf": "n1",
"root": "B"
},
{
"leaf": "n2",
"root": "A"
}
],
"level": "D"
}
},
"why": "a DIVERGED level speaks silence upward, never its majority root -- the rule that stops disagreement laundering itself into consensus one level at a time"
},
{
"expected": {
"clean": true,
"divergences": 0,
"reference": "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb",
"silent_diverged": [],
"silent_unproven": [
"u"
],
"speaks_upward": true,
"verdict": "AGREE"
},
"id": "S.unproven.speaks-silence",
"input": {
"op": "climb",
"tree": {
"children": [
{
"children": [
{
"leaf": "n0",
"root": "A"
},
{
"leaf": "n1",
"root": null
},
{
"leaf": "n2",
"root": null
}
],
"level": "u"
},
{
"children": [
{
"leaf": "n0",
"root": "B"
},
{
"leaf": "n1",
"root": "B"
},
{
"leaf": "n2",
"root": "B"
}
],
"level": "k2"
},
{
"children": [
{
"leaf": "n0",
"root": "B"
},
{
"leaf": "n1",
"root": "B"
},
{
"leaf": "n2",
"root": "B"
}
],
"level": "k3"
}
],
"level": "mixed"
}
},
"why": "PINS WHAT AN UNPROVEN LEVEL SPEAKS UPWARD, which no vector ever reached, so an implementation could have chosen anything. Child 'u' has one carrier answering out of three: UNPROVEN, and it holds A. Its two siblings agree on B. If UNPROVEN spoke its root the parent would see A against B and report DIVERGED with a dissenter -- reading 'could not be established' as 'established', a claim stronger than its evidence. Speaking silence, the parent agrees on B over two of the three it asked, and u is reported under silent_unproven and never under silent_diverged. This is also a CLEAN climb containing two distinct roots"
},
{
"expected": {
"agreed": true,
"answered": [
"x",
"y",
"z"
],
"outliers": [],
"reference": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa",
"silent": [],
"verdict": "AGREE"
},
"id": "T.agree.all",
"input": {
"op": "attest",
"roots": {
"x": "A",
"y": "A",
"z": "A"
}
},
"why": "three witnesses holding one root agree"
},
{
"expected": {
"agreed": true,
"answered": [
"x",
"y"
],
"outliers": [],
"reference": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa",
"silent": [
"z"
],
"verdict": "AGREE"
},
"id": "T.agree.one-silent",
"input": {
"op": "attest",
"roots": {
"x": "A",
"y": "A",
"z": null
}
},
"why": "a witness that did not answer is not a witness that disagreed; it is named, never counted as an outlier"
},
{
"expected": {
"agreed": false,
"answered": [
"x",
"y",
"z"
],
"outliers": [
"z"
],
"reference": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa",
"silent": [],
"verdict": "DIVERGED"
},
"id": "T.diverged.one-outlier",
"input": {
"op": "attest",
"roots": {
"x": "A",
"y": "A",
"z": "B"
}
},
"why": "one differing witness is DIVERGED and the outlier is named"
},
{
"expected": {
"agreed": false,
"answered": [
"w",
"x",
"y",
"z"
],
"outliers": [
"y",
"z"
],
"reference": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa",
"silent": [],
"verdict": "DIVERGED"
},
"id": "T.diverged.plurality-without-majority",
"input": {
"op": "attest",
"roots": {
"w": "A",
"x": "A",
"y": "B",
"z": "C"
}
},
"why": "KILLS THE ABSOLUTE-MAJORITY READING of the reference. Four witnesses holding A,A,B,C: A has strictly more holders than any other root, but only two of four -- a strict plurality and not more than half. It is the reference, and BOTH dissenters are named. A rule demanding over half would report no reference and no outliers here, and a reader would learn nothing about who differs from whom"
},
{
"expected": {
"agreed": false,
"answered": [
"x",
"y",
"z"
],
"outliers": [
"x"
],
"reference": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa",
"silent": [],
"verdict": "DIVERGED"
},
"id": "T.diverged.reference-is-tallied",
"input": {
"op": "attest",
"roots": {
"x": "B",
"y": "A",
"z": "A"
}
},
"why": "KILLS THE NO-TALLYING READING -- 'the reference is the root of the first answering witness'. Every other DIVERGED vector happens to seat the most-held root on the ordinally-first witness, so an implementation that counts nothing passes all of them and the word 'majority' is never once exercised AS a majority. Here the first witness is the lone dissenter: roots B,A,A, so the reference is A, held by y and z, and the outlier is x. An implementation that does not tally returns the exact inverse"
},
{
"expected": {
"agreed": false,
"answered": [
"x",
"y",
"z"
],
"outliers": [],
"reference": null,
"silent": [],
"verdict": "DIVERGED"
},
"id": "T.diverged.three-way",
"input": {
"op": "attest",
"roots": {
"x": "A",
"y": "B",
"z": "C"
}
},
"why": "three-way disagreement declares no winner by luck of ordering -- and now MEANS it. KILLS THE ORDERING READING that this vector used to enshrine: it once expected outliers ['y','z'], which silently made x's root the reference for no reason but that x sorts first, asserting the opposite of its own sentence. One holder each is no strict plurality, so there is NO reference, and with no reference nothing is an outlier -- the word means 'differs from the reference' and there is nothing to differ from"
},
{
"expected": {
"agreed": false,
"answered": [
"v",
"w",
"x",
"y",
"z"
],
"outliers": [],
"reference": null,
"silent": [],
"verdict": "DIVERGED"
},
"id": "T.diverged.tie-for-top",
"input": {
"op": "attest",
"roots": {
"v": "A",
"w": "A",
"x": "B",
"y": "B",
"z": "C"
}
},
"why": "KILLS EVERY INVENTED TIE-BREAK, including the ordinally-lowest-root rule both cold reimplementations independently chose. Five witnesses holding A,A,B,B,C: two roots tie for most-held. A tie-break would crown A and report three outliers. There is no strict plurality, so there is NO reference and nothing is an outlier. Choosing between equally-held roots would be a DECISION, and this mechanism reports evidence and decides nothing -- the same reason it never overwrites the party it disagrees with"
},
{
"expected": {
"agreed": true,
"answered": [
"v",
"w",
"x"
],
"outliers": [],
"reference": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa",
"silent": [
"y",
"z"
],
"verdict": "AGREE"
},
"id": "T.quorum.default-met-at-five",
"input": {
"op": "attest",
"roots": {
"v": "A",
"w": "A",
"x": "A",
"y": null,
"z": null
}
},
"why": "the far side of the same bracket, without which the rule above could be read as 'five witnesses can never agree'. Three of five answering DOES clear the derived quorum. With T.unproven.too-few and T.agree.one-silent fixing it at 2 for three witnesses, the two brackets together admit a majority of those asked and admit no constant, no unanimity rule, and no count of the answerers"
},
{
"expected": {
"agreed": false,
"answered": [
"v",
"w"
],
"outliers": [],
"reference": null,
"silent": [
"x",
"y",
"z"
],
"verdict": "UNPROVEN"
},
"id": "T.quorum.default-scales-with-witnesses",
"input": {
"op": "attest",
"roots": {
"v": "A",
"w": "A",
"x": null,
"y": null,
"z": null
}
},
"why": "KILLS THE CONSTANT-QUORUM READING, and the majority-of-those-PRESENT reading with it, in one case. Five witnesses asked, two answer and agree. A constant 2 calls that agreement for all five; so does a majority of the two who ANSWERED. A majority of the five ASKED is 3, so this is UNPROVEN. Two of a hundred witnesses must not be able to speak for the hundred, and silencing witnesses must never make agreement EASIER -- a mechanism where suppressing others is what wins you the verdict is exactly the transaction at another's expense this project refuses"
},
{
"expected": {
"agreed": false,
"answered": [
"x",
"y",
"z"
],
"outliers": [],
"reference": null,
"silent": [],
"verdict": "UNPROVEN"
},
"id": "T.quorum.raised",
"input": {
"op": "attest",
"quorum": 4,
"roots": {
"x": "A",
"y": "A",
"z": "A"
}
},
"why": "a raised quorum is honoured"
},
{
"expected": {
"agreed": false,
"answered": [
"x"
],
"outliers": [],
"reference": null,
"silent": [
"y",
"z"
],
"verdict": "UNPROVEN"
},
"id": "T.unproven.too-few",
"input": {
"op": "attest",
"roots": {
"x": "A",
"y": null,
"z": null
}
},
"why": "fewer answers than the quorum is UNPROVEN, never agreement with itself"
}
]
}
|