30 lines
950 B
Markdown
30 lines
950 B
Markdown
|
# Sprint 204 Plan: Recursive Taskitem Validation II
|
||
|
|
|
||
|
|
## Context
|
||
|
|
Need recursive quality loops to prevent local-minimum promotion.
|
||
|
|
|
||
|
|
## Goals
|
||
|
|
1. Add recursive taskitem re-validation loops
|
||
|
|
2. Track dependency correctness and blocker detectability
|
||
|
|
3. Cap recursion deterministically
|
||
|
|
|
||
|
|
## Steps
|
||
|
|
|
||
|
|
### Step 2059: Recursive validation loop engine (10 tests)
|
||
|
|
Run bounded recursive validation with deterministic ordering.
|
||
|
|
|
||
|
|
### Step 2060: Dependency correctness scorer (10 tests)
|
||
|
|
Score dependency graph consistency and missing edges.
|
||
|
|
|
||
|
|
### Step 2061: Blocker detectability scorer (8 tests)
|
||
|
|
Measure whether blockers are surfaced early and clearly.
|
||
|
|
|
||
|
|
### Step 2062: Recursion bound/termination contracts (8 tests)
|
||
|
|
Enforce deterministic recursion depth and stop reasons.
|
||
|
|
|
||
|
|
### Step 2063: Sprint 204 Integration Summary (8 tests)
|
||
|
|
Add `editor/src/Sprint204IntegrationSummary.h`.
|
||
|
|
|
||
|
|
## Architecture Gate
|
||
|
|
- Recursive validation must be bounded, deterministic, and auditable.
|