KB-6D08

07 — Computed Proof Matrix (No Literal PASS)

2 min read Revision 1

07 — Computed Proof Matrix (No Literal PASS)

v_rp_dynamic_drill_proof_matrix_computed derives every verdict from v_rp_full_population_drill_invariant by aggregation. No PASS_WITH_EXPECTED_BLOCKER is hardcoded for any node.

Output

axis nodes pass pass_expected_blocker fail axis_verdict fail_demonstrated_in_data
AX-BASE 39 39 0 0 PASS false
AX-PROCESS 22 18 4 0 PASS false
AX-PXT 12 10 0 2 FAIL true
AX-TOPIC 7 7 0 0 PASS false
AX-TRIGGER 7 7 0 0 PASS false
ALL_AXES 87 81 4 2 FAIL true

Why this is not cosmetic

  • verdict_source = 'computed_from_full_population_invariant' and verdict_is_computed = true on every row.
  • rule_can_structurally_fail = true: the verdict CASE has reachable FAIL branches.
  • fail_demonstrated_in_data = true for AX-PXT and ALL_AXES — the rule actually fired FAIL on real data, proving the proof can fail. A matrix whose verdict can only ever be PASS is impossible here.
  • Contrast: the legacy curated v_rp_dynamic_drill_proof_matrix_v2 (26 rows) reported 22 PASS / 4 EXPECTED_BLOCKER / 0 FAIL — it could not have surfaced the 2 AX-PXT count failures because its verdicts were curated, not computed.

v_rp_dynamic_drill_proof_matrix_current points here, so the UI consumes the computable proof.

Back to Knowledge Hub knowledge/dev/reports/architecture/rp-contract-canonical-registry-driven-fullpop-nohardcode-closeout-2026-06-05/07-computed-proof-matrix.md