Plectis
This page

Component · spec & evidence

Bridge Campaign DAG Validation

Runs shape checks on a fan-out work plan for unique steps, dependencies, and no cycles, not the plan itself.

Contract

Does Validates the shape of a bridge campaign - a small plan that fans several parallel reads into one synthesis. It checks the plan carries the required identity fields, that every step has a unique name, that each dependency points at a real step, that the steps form no cycle, that there is exactly one synthesis step which can be traced back to at least one probe, that the barrier names that synthesis, and that the requested worker count stays within the provider's safe limit. It shows two well-formed plans accepted - a straight chain and a three-way fan-in - and two broken plans rejected: one with a dependency loop and one with two synthesis steps. It validates plan structure only; it does not run the campaign or dispatch any agents.

Scope limit The bundle validates a public bridge-campaign DAG contract and provider worker ceiling. It is not a dispatcher, not a live multi-agent run, not a provider safety proof, and not launch-scope decision.

Run

Quick probe
microcosm bridge-campaign-dag-validation run --input fixtures/first_wave/bridge_campaign_dag_validation/input --out /tmp/plectis-public-runs/bridge_campaign_dag_validation
Validator command
microcosm bridge-campaign-dag-validation run --input fixtures/first_wave/bridge_campaign_dag_validation/input --out receipts/first_wave/bridge_campaign_dag_validation --acceptance-out receipts/acceptance/first_wave/bridge_campaign_dag_validation_fixture_acceptance.json

Evidence

ClassBounded runtime computationevidence 4/5Real runtime resultRuns real tools

agent-concurrencycontinuityai-safety

Source

Source Design note · Source

Map Show on the map

Paper module

Paper module Bridge Campaign DAG Validation

The bridge campaign DAG validation component surfaces the public bridge_campaign_dag bundle and checks, over bounded public fixtures, that a fan-in campaign graph is well formed: unique labels, existing dependency edges, acyclicity, exactly one synthesis reaching a probe, barrier alignment, and a worker count within the provider safe-parallelism ceiling.