erase

# erase — from findings to deletions, safely CodeEraser finds entropy; this skill is the OTHER half — acting on it without breaking anything. The contract: **never delete what you have not read, and never claim convergence without re-running the gates.** ## 0. Snapshot first ```sh ce check . # the before-score and the current ratchet state ``` Record the score line. Every deletion below must leave `ce check` passing; the score should not fall. ## 1. The deterministic pass FIRST — `ce erase` ```sh ce erase . # dry-run plan: what is PROVABLY safe to remove ce erase . --apply # act on it (git repo + clean worktree required) ``` Three classes erase without judgment (dead files, verbatim doc duplicates, whole-unit byte-identical twins in dead files) — the tool plans them deterministically, applies behind preconditions, and proves its own convergence (contract: docs/reference/erase.md). Do NOT hand-delete anything the plan already covers. Everything it prints as `advisory` is YOUR half — that is where the judgment below begins. ## 2. Collect the advisory candidates (three signals, JSON faces) ```sh ce dedup . --format json # T1/T2 clone blocks ce deadcode . --format json # zero-liveness verdicts (graph-based) ce join . --days 14 --format json # similarity × position × churn ``` `ce join` ranks the strongest deletion candidates: high similarity, weak graph position, low churn. Start from the top of that list. ## 3. Verify each candidate — n...