TRACE — TRACE and connections

Authored design — 2026-09-15. Section 3. This cascade elaborates the existing checklist item. It is not a dispatch, implementation receipt or completion verdict. Work outside WM-01–14 still requires Joe’s explicit greenlight; having a cascade is necessary but not permission.

Section 3/4 index · Exact TODO · Cascade JSON

Situation and design problem

A collection of genuine logs can still omit a mandatory edge or combine incompatible occurrences. TRACE must account for semantic connections in the same run.

Governing checklist snapshot

TRACE — TRACE and connections. PARTIAL: complete current node/edge census, semantic identity and actual mandatory-edge firing in the same run. Include R6→R13→R14→R16→R2; reconcile conditional and retired edges and drawn/source differences. Built evidence: Durable checkpoints, terminal records, source pins and some joined receipts

This is the checklist’s dated evidence account, not a new deployment census. Existing source/test evidence keeps its bounded credit. The acceptance obligation above governs this design.

Pattern applications

TRACE-1 — Declare the required graph

Pattern: wm-qualifying-run/one-episode-all-required-connections

Reconcile the catalogue, drawing, source and ruled conditional/retired edges. Produce a versioned node/edge universe including R3a hosting and R17 variants. Do not infer completeness from whichever logs exist.

TRACE-2 — Bind producer and consumer identities

Pattern: wm-connected-learning/observation-to-next-choice

For each required edge declare carried quantity, model/policy revision, source and destination call sites, occurrence and cutoff. Distinguish transport receipt from semantic consumption.

TRACE-3 — Acquire the complete occurrence

Pattern: wm-qualifying-run/one-episode-all-required-connections

Retain actual firings through R6→R13→R14→R16→R2 and every other mandatory edge in that same run. Conditional edges need the ruled applicability evidence; absence is not automatic inapplicability.

TRACE-4 — Validate joins and surface missing edges

Pattern: wm-connected-learning/observation-to-next-choice

Check producer output against consumer input and collect independently bound evidence. Produce complete/partial/rejected graph coverage with reasons. A positive result requires every applicable mandatory edge; counting records is insufficient.

Composition and interfaces

Each node’s stated artifact is the input or constraint for the related node below. These are design dependencies, not a claim that a runtime scheduler automatically fires patterns. Existing WM producers are reused through the linked contracts; no second implementation is implied.

Retain the actual subject, source/model revision, task/occurrence, cutoff, producer and consumer for each interface. A missing field is a named gap; a default that changes the meaning is not an adapter. Reuse existing records where they satisfy these obligations. If a new component is indispensable, identify its exact TODO/cascade clause before seeking a separately bounded implementation instruction.

Worked situation

A depth calculation from yesterday, today’s actuation and tomorrow’s observation are individually authentic. Their union does not establish a same-run R6-to-R2 chain. The join validator must expose the occurrence switch.

This is a distinguishing design example, not a claimed production experiment.

Implementation sequence and closure evidence

1. Bind the first application to the actual source, task and authority. Resolve the decisions below before their dependent change; do not reproduce a known gap merely to claim activity.
2. Implement only the specifically dispatched producer/consumer change from the middle applications. Retain the meaningful pre-change failure and relevant post-change controls; do not start a general infrastructure project.
3. Acquire the final application’s evidence and independent review. Compare it against every clause of the exact TODO, identifying any still-open dependency. Source, tests, serving state, ordinary use and whole-run validation receive different credit.

Distinguishing controls: Delete a mandatory edge, substitute another run, swap model revisions and label an absent conditional edge retired without authority. Test producer/consumer value mismatch.

Closure rule: every part of the quoted obligation must be supported by the indicated artifacts and actual connections. A useful rejection proves the rejecting boundary only. One accepted subclause does not tick the whole item. A bellback must supply the exact reviewed subject, executed checks, independent verdict and remaining clauses.

Dependencies and authority boundaries

R6 · R13 · R14 · R16 · R2 · E02 · E05

The graph census is versioned; source and drawing disagreements require explicit resolution, not drawing edits that waive behavior.

Dependency links describe required interfaces; they do not authorize work on those items. No implementation outside the existing TODO list is approved. Publication does not select a numerical law, settle an unresolved operator ruling or authorize a run.

Pattern and source scope

All seeded patterns are applied above. The JSON pins their source bytes and the governing checklist/rulings. Historical formulas, thresholds and examples in a pattern remain scoped examples unless the governing contract adopts them. This draft adds no pattern-library entries and claims no independent semantic ratification.