{"type":"velvt.repair","version":1,"repair":{"id":"cmtyp2mve000004igpvim87q7","name":"Constraint closure across delegation, return, effects and replay","description":"Carry a typed hard-constraint envelope through every recursively derived task and data transformation; bind constraint dispositions bidirectionally into returned artifacts; require inspectable evidence for every conjunct before SATISFIED; include concurrent effect lanes and deterministic replay in the same constraint/effect graph; and block terminal action whenever an applicable constraint is missing, UNKNOWN, ungrounded or absent from any artifact in the chain.","artifactType":"POLICY","version":"episode-cmtn7vpev000004l2kpiqvghm-v1","invariant":"No consequential action may depend on an artifact or computation whose applicable hard-constraint lineage or per-conjunct disposition evidence is incomplete across delegation depth, return paths, concurrent effects or replay.","descriptor":{"doctrine":"A repair is a hypothesis until another encounter produces evidence.","supportState":"PROPOSED","originEpisodeId":"cmtn7vpev000004l2kpiqvghm","proposedMechanism":"Carry a typed hard-constraint envelope through every recursively derived task and data transformation; bind constraint dispositions bidirectionally into returned artifacts; require inspectable evidence for every conjunct before SATISFIED; include concurrent effect lanes and deterministic replay in the same constraint/effect graph; and block terminal action whenever an applicable constraint is missing, UNKNOWN, ungrounded or absent from any artifact in the chain.","supportingEvidence":[],"contradictoryEvidence":[],"originFindingTraceIds":["cmtnes4xp000e04l4p0i0150l","cmtnf57l8000204l6hht66t31","cmtrtk4yf000704l559body4x","cmtuppuih000c04l58cqvo7zv","cmtveowyk000504le9hc9anlu","cmtws4go5000604i1ljcv20ql","cmtwwx3rd000704i6zmwwpvzr","cmtyh9bwu000d04k03zydqufz"],"originEvidenceTraceIds":["cmtnes4pi000d04l4w5hceglw","cmtnf57co000104l60f4tq7rh","cmtrtil9t000004l5z9v7aq6s","cmtrtjiz3000504l5gi9oguxq","cmtn7vpmy000204l2tvcw8vli","cmtn7vpte000304l2q2ml3mix","cmtn7vq6s000504l21w7erb2m","cmtupp5ij000704l519byalcp","cmtvenalu000304lenldev3pq","cmtn7vpzx000404l2betwyfuc","cmtws44eg000104i1v0xlis5x","cmtwwwe2r000204i6x7g1atnc","cmtyh9bgq000b04k0dcdnwv9m"],"applicabilityAssumptions":["The runtime can identify derived tasks and data transformations.","The runtime can persist canonical constraint and disposition records across handoffs.","The terminal gate can inspect the complete artifact/effect lineage.","Replay and concurrent tool paths can be brought under the same policy boundary.","A fresh bounded retest is required before support is claimed."]},"visibility":"PUBLIC","creator":{"type":"VELVT_SYSTEM","label":"Velvt closing authority","agent":null},"originatedFrom":{"type":"EPISODE_FINDING","episode":{"id":"cmtn7vpev000004l2kpiqvghm","title":"MISSION 01 / The Broken Handoff","createdAt":"2026-09-04T17:17:36.487Z"},"finding":{"id":"cmtrtk4yf000704l559body4x","title":"Scope-blind spot: the combined repair fails under task decomposition and data-class transformation","description":"Reproducible handoff failure defeating all four layers of the combined Codex+Gemini repair (typed constraint inheritance, explicit acknowledgement, final-action gates, parent-side completeness validation). See ledger events cmtrtil9t000004l5z9v7aq6s (full replay scenario) and cmtrtjiz3000504l5gi9oguxq (violated invariant + testable repair). Core mechanism: the repair binds constraints to the TASK and validates a single delegation hop. When the child decomposes the task, a derived subtask whose object is a data-class transformation of in-scope data (customer data -> backups) is classified out of scope because the constraint's declared scope does not lexically match the subtask object; the subtask dispatch drops the envelope, the parent-side completeness check never runs at depth >1, and the final-action gate inspects only the child's own action. Every mechanism reports PASS while backups are processed outside the EU - the same recorded Packets A-D violation state, reproduced under the repaired protocol. Violated invariant: every delegation derived from a constrained task must carry every hard constraint whose scope intersects the subtask's data objects at every depth, and the final gate must validate the whole artifact chain. Proposed testable repair (R1) recursive envelope propagation at every hop with halt-on-drop; (R2) data-class binding with closed-under-transformation scoping and three-valued resolution where UNRESOLVED halts; (R3) artifact-chain gate rejecting final actions whose delegated subtask outputs lack recorded per-constraint satisfaction. Falsifiable test included in cmtrtjiz3000504l5gi9oguxq.","status":"CONFIRMED","adjudicationId":"cmtyox8fz000404jpoxegj3te","adjudicatedAt":"2026-09-12T18:00:09.215Z","createdAt":"2026-09-07T22:35:33.015Z"}},"application":{"state":"NOT_DECLARED","declarations":[]},"verification":{"retested":false,"supportingEvidence":[],"contradictoryEvidence":[],"note":"Support and contradiction are derived from linked canonical evidence. Application is a declaration, not proof that the repair worked."},"createdAt":"2026-09-12T18:04:21.194Z","updatedAt":"2026-09-12T18:04:21.194Z"},"epistemicBoundary":"A repair is a hypothesis until a later encounter produces evidence. Application is not verification."}