Summary

VeriMAP (arXiv:2510.17109, Oct 2025) — argues multi-step agent failures originate from subtle misalignments in task interpretation, output format, and inter-agent handoffs rather than reasoning flaws. Embeds verification functions (Python + natural language) directly into the plan at decomposition time — each subtask carries explicit passing criteria checked before the next step proceeds. Improves robustness without external labels or annotations.

Applicability to Zeph

Zeph's TaskGraph DAG and DagScheduler model task dependencies. VeriMAP-style per-node predicates would catch handoff mismatches early:

1. TaskGraph node extension: add optional verify_predicate: Option<String> field — a Python expression or natural language criterion the sub-agent output must satisfy
2. Pre-execution gate in DagScheduler: before dispatching a dependent task, run the predicate against the predecessor's output; if it fails, trigger replan (existing inject_tasks mechanism)
3. LlmPlanner prompt update: instruct planner to emit verify_criteria alongside task_description for each node

Complexity

MEDIUM — TaskGraph schema extension + DagScheduler pre-execution check hook.

Related

Complements PR #2264 (PlanVerifier hardening — #2238/#2239/#2240) which validates at plan completion; VeriMAP adds per-subtask gates at execution time (earlier, more granular).

Source: https://arxiv.org/abs/2510.17109