30 lines
972 B
Markdown
30 lines
972 B
Markdown
# Sprint 197 Plan: Long-Range Edit Reliability II (Planning)
|
|
|
|
## Context
|
|
Contracts alone are insufficient; planner must produce deterministic edit graph.
|
|
|
|
## Goals
|
|
1. Build deterministic long-range edit planner
|
|
2. Add graph-based edit ordering and checkpoints
|
|
3. Expose planner output to execution pipeline
|
|
|
|
## Steps
|
|
|
|
### Step 2024: Long-range edit graph planner (10 tests)
|
|
Construct ordered edit graph with dependency edges.
|
|
|
|
### Step 2025: Checkpoint and rollback node insertion (10 tests)
|
|
Insert deterministic checkpoints into long edit sequences.
|
|
|
|
### Step 2026: Planner-executor handoff packet (8 tests)
|
|
Emit machine-readable plan for execution tools.
|
|
|
|
### Step 2027: Plan fingerprinting and replay checks (8 tests)
|
|
Add stable plan fingerprint and replay verification.
|
|
|
|
### Step 2028: Sprint 197 Integration Summary (8 tests)
|
|
Add `editor/src/Sprint197IntegrationSummary.h`.
|
|
|
|
## Architecture Gate
|
|
- Long-range edit plans must be ordered, checkpointed, and replayable.
|