robbond/confidence-engine
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

experiment: confirm deterministic post-refactor closure path

Browse Source
This commit is contained in:
robbond
2026-08-14 16:06:22 +01:00
parent 1ca5026352
commit 6cb91099c2
2 changed files with 135 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files
docs/current-handoff.md
+23
View File
@@ -3432,3 +3432,26 @@ Key outcomes:
Post-refactor live equivalence established against 60B.66.
Decision-sufficiency extraction is now behaviourally baselined.
---
### EXPERIMENT 60B.69 — POST-REFACTOR DETERMINISTIC CLOSURE PATH REPLAY (PASS)
**Date:** 2026-08-14
**Branch:** `feature/decision-sufficiency-module-v0.44`
**Experiment commit:** 1ca5026 experiment: confirm post-refactor live equivalence
**Result:** A — EXACT DETERMINISTIC EQUIVALENCE CONFIRMED
When the post-refactor production code receives an unresolved parent decision and only resolves the customer factor (leaving the decision to be closed by deterministic sufficiency closure), the extracted `decision-sufficiency.js` path closes the decision exactly as the pre-refactor 60B.66 baseline did:
Key outcomes:
- Decision `n_product_launch_decision` resolved unknown→resolved via deterministic closure (not via proposal mutation)
- Decision value = null (no directional recommendation invented)
- `finalActiveUnknownNodeId = null`, `finalSelectedQuestion = null` (both closure-correct)
- Customer factor resolves in place with negative meaning preserved
- Zero addedNodes, zero addedEdges
- Decision identity preserved; both options preserved
Apparatus: Reused existing regression `60B.64 Test 1 — exact 60B.56 wording closes` (no new harness created).
Post-refactor deterministic closure path verified as equivalent to pre-refactor baseline.