Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":2,"max_credits":11.857,"max_latency_ms":125930,"minimum_quality":0.7128},"task":{"ambiguity":0.3801,"category":"review","complexity":0.5892,"consequence":0.6334,"evidence_need":0.6962,"family":"policy_compliance","input_tokens":5680,"reversibility":0.4242,"risk":0.8308,"summary":"Review whether background jobs satisfies a documented retention policy."},"workers":[{"credits_per_call":12.547,"id":"worker_a","p95_latency_ms":65558,"pass_rate":0.9387,"provider_group":"provider_z","quality":0.995,"strengths":["drafting","implementation","reasoning","synthesis"]},{"credits_per_call":1.066,"id":"worker_b","p95_latency_ms":25475,"pass_rate":0.5509,"provider_group":"provider_y","quality":0.7604,"strengths":["coding","drafting","speed"]},{"credits_per_call":3.839,"id":"worker_c","p95_latency_ms":48614,"pass_rate":0.8207,"provider_group":"provider_x","quality":0.9078,"strengths":["reasoning","review","writing"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":1,"max_credits":2.433,"max_latency_ms":33846,"minimum_quality":0.7593},"task":{"ambiguity":0.3644,"category":"analysis","complexity":0.5767,"consequence":0.3363,"evidence_need":0.6888,"family":"performance_tuning","input_tokens":7600,"reversibility":0.6657,"risk":0.541,"summary":"Review a proposed optimization for observability for hidden regressions."},"workers":[{"credits_per_call":11.599,"id":"worker_a","p95_latency_ms":77468,"pass_rate":0.9916,"provider_group":"provider_x","quality":0.995,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":0.795,"id":"worker_b","p95_latency_ms":20527,"pass_rate":0.5548,"provider_group":"provider_z","quality":0.689,"strengths":["coding","drafting","speed"]},{"credits_per_call":3.271,"id":"worker_c","p95_latency_ms":50464,"pass_rate":0.9064,"provider_group":"provider_y","quality":0.9704,"strengths":["reasoning","review","writing"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":3,"max_credits":4.388,"max_latency_ms":171338,"minimum_quality":0.7793},"task":{"ambiguity":0.4773,"category":"coding","complexity":0.8977,"consequence":0.6507,"evidence_need":0.4028,"family":"migration_planning","input_tokens":2000,"reversibility":0.4472,"risk":0.5072,"summary":"Review a staged migration for OAuth callbacks and identify irreversible steps."},"workers":[{"credits_per_call":0.842,"id":"worker_a","p95_latency_ms":21148,"pass_rate":0.4937,"provider_group":"provider_y","quality":0.6956,"strengths":["coding","drafting","speed"]},{"credits_per_call":10.095,"id":"worker_b","p95_latency_ms":84033,"pass_rate":0.995,"provider_group":"provider_x","quality":0.9653,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":3.205,"id":"worker_c","p95_latency_ms":52656,"pass_rate":0.8624,"provider_group":"provider_z","quality":0.8777,"strengths":["coding","reasoning","review","writing"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":3,"max_credits":24.911,"max_latency_ms":214875,"minimum_quality":0.7848},"task":{"ambiguity":0.6714,"category":"review","complexity":0.7502,"consequence":0.62,"evidence_need":0.6704,"family":"policy_compliance","input_tokens":2160,"reversibility":0.5994,"risk":0.6332,"summary":"Review whether rate limiting satisfies a documented retention policy."},"workers":[{"credits_per_call":0.989,"id":"worker_a","p95_latency_ms":19544,"pass_rate":0.5047,"provider_group":"provider_z","quality":0.7445,"strengths":["coding","drafting","speed"]},{"credits_per_call":2.933,"id":"worker_b","p95_latency_ms":67890,"pass_rate":0.7804,"provider_group":"provider_x","quality":0.8642,"strengths":["reasoning","review","writing"]},{"credits_per_call":14.421,"id":"worker_c","p95_latency_ms":76792,"pass_rate":0.995,"provider_group":"provider_y","quality":0.9561,"strengths":["drafting","implementation","reasoning","synthesis"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=

drafting implementation reasoning synthesis


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":2,"max_credits":1.528,"max_latency_ms":39086,"minimum_quality":0.6388},"task":{"ambiguity":0.7355,"category":"coding","complexity":0.9306,"consequence":0.5152,"evidence_need":0.7051,"family":"migration_planning","input_tokens":6880,"reversibility":0.3097,"risk":0.466,"summary":"Design compatibility testing for a provider failover schema migration."},"workers":[{"credits_per_call":3.48,"id":"worker_a","p95_latency_ms":81401,"pass_rate":0.7353,"provider_group":"provider_y","quality":0.8375,"strengths":["coding","reasoning","review","writing"]},{"credits_per_call":1.158,"id":"worker_b","p95_latency_ms":25020,"pass_rate":0.4873,"provider_group":"provider_x","quality":0.7876,"strengths":["coding","drafting","speed"]},{"credits_per_call":12.613,"id":"worker_c","p95_latency_ms":63719,"pass_rate":0.995,"provider_group":"provider_z","quality":0.9148,"strengths":["implementation","reasoning","synthesis"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":1,"max_credits":1.135,"max_latency_ms":32008,"minimum_quality":0.6452},"task":{"ambiguity":0.4903,"category":"review","complexity":0.843,"consequence":0.5893,"evidence_need":0.8545,"family":"policy_compliance","input_tokens":7080,"reversibility":0.543,"risk":0.4501,"summary":"Review whether usage metering satisfies a documented retention policy."},"workers":[{"credits_per_call":3.418,"id":"worker_a","p95_latency_ms":72764,"pass_rate":0.8264,"provider_group":"provider_z","quality":0.8137,"strengths":["reasoning","review","writing"]},{"credits_per_call":0.99,"id":"worker_b","p95_latency_ms":25664,"pass_rate":0.5434,"provider_group":"provider_y","quality":0.7606,"strengths":["coding","drafting","speed"]},{"credits_per_call":10.729,"id":"worker_c","p95_latency_ms":71729,"pass_rate":0.995,"provider_group":"provider_x","quality":0.9779,"strengths":["implementation","reasoning","synthesis"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":2,"max_credits":18.298,"max_latency_ms":120273,"minimum_quality":0.8615},"task":{"ambiguity":0.5754,"category":"review","complexity":0.6971,"consequence":0.7793,"evidence_need":0.6648,"family":"policy_compliance","input_tokens":5560,"reversibility":0.6373,"risk":0.7697,"summary":"Review whether access control satisfies a documented retention policy."},"workers":[{"credits_per_call":3.891,"id":"worker_a","p95_latency_ms":61513,"pass_rate":0.7267,"provider_group":"provider_z","quality":0.8222,"strengths":["reasoning","review","writing"]},{"credits_per_call":0.841,"id":"worker_b","p95_latency_ms":18291,"pass_rate":0.5214,"provider_group":"provider_x","quality":0.7095,"strengths":["coding","drafting","speed"]},{"credits_per_call":11.154,"id":"worker_c","p95_latency_ms":60762,"pass_rate":0.8984,"provider_group":"provider_y","quality":0.9911,"strengths":["implementation","reasoning","synthesis"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":3,"max_credits":16.578,"max_latency_ms":242876,"minimum_quality":0.8048},"task":{"ambiguity":0.578,"category":"coding","complexity":0.8015,"consequence":0.4015,"evidence_need":0.7145,"family":"migration_planning","input_tokens":6880,"reversibility":0.6419,"risk":0.6364,"summary":"Design compatibility testing for a private credentials schema migration."},"workers":[{"credits_per_call":11.123,"id":"worker_a","p95_latency_ms":70211,"pass_rate":0.93,"provider_group":"provider_y","quality":0.9777,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":3.05,"id":"worker_b","p95_latency_ms":72746,"pass_rate":0.8187,"provider_group":"provider_x","quality":0.8175,"strengths":["reasoning","review","writing"]},{"credits_per_call":0.995,"id":"worker_c","p95_latency_ms":29082,"pass_rate":0.591,"provider_group":"provider_z","quality":0.7739,"strengths":["coding","drafting","speed"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":2,"max_credits":1.469,"max_latency_ms":22044,"minimum_quality":0.7541},"task":{"ambiguity":0.6004,"category":"coding","complexity":0.7694,"consequence":0.6369,"evidence_need":0.4136,"family":"migration_planning","input_tokens":520,"reversibility":0.614,"risk":0.5059,"summary":"Design compatibility testing for a data retention schema migration."},"workers":[{"credits_per_call":0.992,"id":"worker_a","p95_latency_ms":18650,"pass_rate":0.5889,"provider_group":"provider_y","quality":0.6798,"strengths":["coding","drafting","speed"]},{"credits_per_call":4.037,"id":"worker_b","p95_latency_ms":73569,"pass_rate":0.8876,"provider_group":"provider_x","quality":0.9002,"strengths":["reasoning","review","writing"]},{"credits_per_call":10.715,"id":"worker_c","p95_latency_ms":67355,"pass_rate":0.995,"provider_group":"provider_z","quality":0.995,"strengths":["implementation","reasoning","synthesis"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":3,"max_credits":23.475,"max_latency_ms":195522,"minimum_quality":0.9241},"task":{"ambiguity":0.5663,"category":"coding","complexity":0.616,"consequence":0.7393,"evidence_need":0.4725,"family":"migration_planning","input_tokens":5560,"reversibility":0.5503,"risk":0.739,"summary":"Design compatibility testing for a deployment rollback schema migration."},"workers":[{"credits_per_call":1.097,"id":"worker_a","p95_latency_ms":22358,"pass_rate":0.4554,"provider_group":"provider_x","quality":0.7786,"strengths":["coding","drafting","speed"]},{"credits_per_call":14.555,"id":"worker_b","p95_latency_ms":72757,"pass_rate":0.9137,"provider_group":"provider_y","quality":0.99,"strengths":["coding","implementation","reasoning","synthesis"]},{"credits_per_call":3.945,"id":"worker_c","p95_latency_ms":74184,"pass_rate":0.7357,"provider_group":"provider_z","quality":0.8879,"strengths":["coding","reasoning","review","writing"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=

coding implementation reasoning synthesis


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":1,"max_credits":2.351,"max_latency_ms":37065,"minimum_quality":0.6127},"task":{"ambiguity":0.3617,"category":"review","complexity":0.6673,"consequence":0.6258,"evidence_need":0.6827,"family":"policy_compliance","input_tokens":5440,"reversibility":0.3816,"risk":0.8371,"summary":"Identify evidence required before approving deployment rollback for production."},"workers":[{"credits_per_call":3.13,"id":"worker_a","p95_latency_ms":56109,"pass_rate":0.8009,"provider_group":"provider_x","quality":0.8842,"strengths":["reasoning","review","writing"]},{"credits_per_call":1.186,"id":"worker_b","p95_latency_ms":20825,"pass_rate":0.546,"provider_group":"provider_z","quality":0.7148,"strengths":["coding","drafting","speed"]},{"credits_per_call":11.25,"id":"worker_c","p95_latency_ms":91869,"pass_rate":0.995,"provider_group":"provider_y","quality":0.9465,"strengths":["drafting","implementation","reasoning","synthesis"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":2,"max_credits":1.884,"max_latency_ms":35361,"minimum_quality":0.6912},"task":{"ambiguity":0.7248,"category":"review","complexity":0.447,"consequence":0.5763,"evidence_need":0.7706,"family":"policy_compliance","input_tokens":3200,"reversibility":0.6975,"risk":0.5896,"summary":"Review whether database failover satisfies a documented retention policy."},"workers":[{"credits_per_call":13.563,"id":"worker_a","p95_latency_ms":74241,"pass_rate":0.9675,"provider_group":"provider_y","quality":0.989,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":1.078,"id":"worker_b","p95_latency_ms":20867,"pass_rate":0.4994,"provider_group":"provider_x","quality":0.6763,"strengths":["coding","drafting","speed"]},{"credits_per_call":3.049,"id":"worker_c","p95_latency_ms":71796,"pass_rate":0.7848,"provider_group":"provider_z","quality":0.8708,"strengths":["drafting","reasoning","review","writing"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":3,"max_credits":17.664,"max_latency_ms":238699,"minimum_quality":0.9445},"task":{"ambiguity":0.7285,"category":"coding","complexity":0.7153,"consequence":0.6703,"evidence_need":0.5717,"family":"migration_planning","input_tokens":5480,"reversibility":0.304,"risk":0.5281,"summary":"Review a staged migration for tenant-scoped caching and identify irreversible steps."},"workers":[{"credits_per_call":11.399,"id":"worker_a","p95_latency_ms":86182,"pass_rate":0.9668,"provider_group":"provider_z","quality":0.995,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":3.342,"id":"worker_b","p95_latency_ms":70404,"pass_rate":0.7533,"provider_group":"provider_y","quality":0.9115,"strengths":["reasoning","review","writing"]},{"credits_per_call":1.003,"id":"worker_c","p95_latency_ms":24477,"pass_rate":0.6051,"provider_group":"provider_x","quality":0.6931,"strengths":["coding","drafting","speed"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":3,"max_credits":20.131,"max_latency_ms":171352,"minimum_quality":0.8549},"task":{"ambiguity":0.7172,"category":"review","complexity":0.8098,"consequence":0.7862,"evidence_need":0.5637,"family":"policy_compliance","input_tokens":320,"reversibility":0.4079,"risk":0.5119,"summary":"Audit a workflow for artifact storage against explicit access requirements."},"workers":[{"credits_per_call":13.142,"id":"worker_a","p95_latency_ms":71673,"pass_rate":0.903,"provider_group":"provider_x","quality":0.9215,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":1.028,"id":"worker_b","p95_latency_ms":32875,"pass_rate":0.5592,"provider_group":"provider_z","quality":0.7017,"strengths":["coding","drafting","speed"]},{"credits_per_call":2.966,"id":"worker_c","p95_latency_ms":55341,"pass_rate":0.8832,"provider_group":"provider_y","quality":0.9077,"strengths":["reasoning","review","writing"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":3,"max_credits":14.344,"max_latency_ms":93298,"minimum_quality":0.7677},"task":{"ambiguity":0.5053,"category":"coding","complexity":0.9375,"consequence":0.5461,"evidence_need":0.7653,"family":"migration_planning","input_tokens":680,"reversibility":0.6332,"risk":0.6024,"summary":"Plan a zero-downtime migration of API-key rotation with rollback checkpoints."},"workers":[{"credits_per_call":13.109,"id":"worker_a","p95_latency_ms":50133,"pass_rate":0.995,"provider_group":"provider_z","quality":0.9537,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":1.124,"id":"worker_b","p95_latency_ms":30090,"pass_rate":0.5453,"provider_group":"provider_x","quality":0.7595,"strengths":["coding","drafting","speed"]},{"credits_per_call":3.817,"id":"worker_c","p95_latency_ms":44823,"pass_rate":0.7427,"provider_group":"provider_y","quality":0.8619,"strengths":["reasoning","review","writing"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":3,"max_credits":21.629,"max_latency_ms":202220,"minimum_quality":0.8185},"task":{"ambiguity":0.5574,"category":"review","complexity":0.6877,"consequence":0.6495,"evidence_need":0.934,"family":"policy_compliance","input_tokens":4400,"reversibility":0.4228,"risk":0.5035,"summary":"Identify evidence required before approving rate limiting for production."},"workers":[{"credits_per_call":0.812,"id":"worker_a","p95_latency_ms":28795,"pass_rate":0.6029,"provider_group":"provider_y","quality":0.7247,"strengths":["coding","drafting","speed"]},{"credits_per_call":15.437,"id":"worker_b","p95_latency_ms":83655,"pass_rate":0.9335,"provider_group":"provider_x","quality":0.995,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":3.5,"id":"worker_c","p95_latency_ms":65730,"pass_rate":0.7683,"provider_group":"provider_z","quality":0.843,"strengths":["drafting","reasoning","review","writing"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":1,"max_credits":2.082,"max_latency_ms":36030,"minimum_quality":0.6505},"task":{"ambiguity":0.4104,"category":"analysis","complexity":0.5502,"consequence":0.2965,"evidence_need":0.6336,"family":"performance_tuning","input_tokens":4760,"reversibility":0.5884,"risk":0.4378,"summary":"Review a proposed optimization for model routing for hidden regressions."},"workers":[{"credits_per_call":10.716,"id":"worker_a","p95_latency_ms":61490,"pass_rate":0.973,"provider_group":"provider_x","quality":0.995,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":1.135,"id":"worker_b","p95_latency_ms":28176,"pass_rate":0.5458,"provider_group":"provider_y","quality":0.6442,"strengths":["coding","drafting","reasoning","speed"]},{"credits_per_call":2.957,"id":"worker_c","p95_latency_ms":73849,"pass_rate":0.9299,"provider_group":"provider_z","quality":0.9008,"strengths":["reasoning","review","writing"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":2,"max_credits":17.364,"max_latency_ms":179252,"minimum_quality":0.8347},"task":{"ambiguity":0.5381,"category":"coding","complexity":0.8834,"consequence":0.4907,"evidence_need":0.8294,"family":"migration_planning","input_tokens":6960,"reversibility":0.3377,"risk":0.4405,"summary":"Design compatibility testing for a model routing schema migration."},"workers":[{"credits_per_call":0.859,"id":"worker_a","p95_latency_ms":26814,"pass_rate":0.5404,"provider_group":"provider_z","quality":0.8043,"strengths":["coding","drafting","speed"]},{"credits_per_call":13.898,"id":"worker_b","p95_latency_ms":67636,"pass_rate":0.995,"provider_group":"provider_y","quality":0.9928,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":3.718,"id":"worker_c","p95_latency_ms":82753,"pass_rate":0.8882,"provider_group":"provider_x","quality":0.8299,"strengths":["reasoning","review","writing"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":1,"max_credits":3.538,"max_latency_ms":23776,"minimum_quality":0.6139},"task":{"ambiguity":0.7801,"category":"review","complexity":0.8006,"consequence":0.7965,"evidence_need":0.8286,"family":"policy_compliance","input_tokens":200,"reversibility":0.488,"risk":0.8433,"summary":"Review whether OAuth callbacks satisfies a documented retention policy."},"workers":[{"credits_per_call":1.111,"id":"worker_a","p95_latency_ms":19227,"pass_rate":0.4848,"provider_group":"provider_x","quality":0.7841,"strengths":["coding","drafting","speed"]},{"credits_per_call":3.622,"id":"worker_b","p95_latency_ms":54706,"pass_rate":0.8863,"provider_group":"provider_z","quality":0.8096,"strengths":["drafting","reasoning","review","writing"]},{"credits_per_call":12.193,"id":"worker_c","p95_latency_ms":75729,"pass_rate":0.9778,"provider_group":"provider_y","quality":0.9589,"strengths":["implementation","reasoning","synthesis"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":2,"max_credits":15.021,"max_latency_ms":115926,"minimum_quality":0.7192},"task":{"ambiguity":0.6455,"category":"coding","complexity":0.6857,"consequence":0.4151,"evidence_need":0.6119,"family":"migration_planning","input_tokens":600,"reversibility":0.262,"risk":0.4762,"summary":"Design compatibility testing for a deployment rollback schema migration."},"workers":[{"credits_per_call":12.837,"id":"worker_a","p95_latency_ms":62933,"pass_rate":0.995,"provider_group":"provider_x","quality":0.9755,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":0.8,"id":"worker_b","p95_latency_ms":27097,"pass_rate":0.6182,"provider_group":"provider_y","quality":0.7484,"strengths":["coding","drafting","speed"]},{"credits_per_call":3.536,"id":"worker_c","p95_latency_ms":50184,"pass_rate":0.8008,"provider_group":"provider_z","quality":0.8943,"strengths":["coding","reasoning","review","writing"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":1,"max_credits":1.962,"max_latency_ms":53117,"minimum_quality":0.5343},"task":{"ambiguity":0.3547,"category":"review","complexity":0.4062,"consequence":0.5492,"evidence_need":0.631,"family":"policy_compliance","input_tokens":3960,"reversibility":0.3685,"risk":0.7155,"summary":"Audit a workflow for credit reservation against explicit access requirements."},"workers":[{"credits_per_call":0.932,"id":"worker_a","p95_latency_ms":29906,"pass_rate":0.5894,"provider_group":"provider_y","quality":0.685,"strengths":["coding","drafting","speed"]},{"credits_per_call":13.082,"id":"worker_b","p95_latency_ms":77008,"pass_rate":0.9949,"provider_group":"provider_z","quality":0.9164,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":3.674,"id":"worker_c","p95_latency_ms":73966,"pass_rate":0.7819,"provider_group":"provider_x","quality":0.7997,"strengths":["drafting","reasoning","review","writing"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":3,"max_credits":24.653,"max_latency_ms":208661,"minimum_quality":0.845},"task":{"ambiguity":0.4485,"category":"review","complexity":0.5571,"consequence":0.564,"evidence_need":0.6042,"family":"policy_compliance","input_tokens":5320,"reversibility":0.6472,"risk":0.7693,"summary":"Audit a workflow for access control against explicit access requirements."},"workers":[{"credits_per_call":4.197,"id":"worker_a","p95_latency_ms":51989,"pass_rate":0.8135,"provider_group":"provider_y","quality":0.8541,"strengths":["drafting","reasoning","review","writing"]},{"credits_per_call":0.882,"id":"worker_b","p95_latency_ms":29621,"pass_rate":0.5708,"provider_group":"provider_x","quality":0.7423,"strengths":["coding","drafting","speed"]},{"credits_per_call":14.565,"id":"worker_c","p95_latency_ms":91248,"pass_rate":0.8949,"provider_group":"provider_z","quality":0.99,"strengths":["implementation","reasoning","synthesis"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":3,"max_credits":17.36,"max_latency_ms":183740,"minimum_quality":0.7848},"task":{"ambiguity":0.7253,"category":"review","complexity":0.4379,"consequence":0.5734,"evidence_need":0.9257,"family":"policy_compliance","input_tokens":4000,"reversibility":0.5327,"risk":0.6697,"summary":"Audit a workflow for usage metering against explicit access requirements."},"workers":[{"credits_per_call":1.175,"id":"worker_a","p95_latency_ms":26993,"pass_rate":0.5385,"provider_group":"provider_y","quality":0.7454,"strengths":["coding","drafting","speed"]},{"credits_per_call":11.318,"id":"worker_b","p95_latency_ms":62307,"pass_rate":0.995,"provider_group":"provider_z","quality":0.995,"strengths":["drafting","implementation","reasoning","synthesis"]},{"credits_per_call":2.772,"id":"worker_c","p95_latency_ms":53542,"pass_rate":0.7477,"provider_group":"provider_x","quality":0.908,"strengths":["reasoning","review","writing"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":2,"max_credits":18.87,"max_latency_ms":214660,"minimum_quality":0.7688},"task":{"ambiguity":0.5133,"category":"coding","complexity":0.9499,"consequence":0.5896,"evidence_need":0.5263,"family":"migration_planning","input_tokens":4000,"reversibility":0.5877,"risk":0.3833,"summary":"Review a staged migration for API-key rotation and identify irreversible steps."},"workers":[{"credits_per_call":4.061,"id":"worker_a","p95_latency_ms":52486,"pass_rate":0.8465,"provider_group":"provider_y","quality":0.843,"strengths":["reasoning","review","writing"]},{"credits_per_call":1.192,"id":"worker_b","p95_latency_ms":25162,"pass_rate":0.5532,"provider_group":"provider_x","quality":0.7741,"strengths":["coding","drafting","speed"]},{"credits_per_call":10.473,"id":"worker_c","p95_latency_ms":77055,"pass_rate":0.995,"provider_group":"provider_z","quality":0.9247,"strengths":["coding","implementation","reasoning","synthesis"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":3,"max_credits":19.699,"max_latency_ms":241049,"minimum_quality":0.8952},"task":{"ambiguity":0.7567,"category":"review","complexity":0.6328,"consequence":0.6111,"evidence_need":0.7842,"family":"policy_compliance","input_tokens":640,"reversibility":0.6935,"risk":0.4664,"summary":"Identify evidence required before approving webhook delivery for production."},"workers":[{"credits_per_call":0.831,"id":"worker_a","p95_latency_ms":27089,"pass_rate":0.5959,"provider_group":"provider_z","quality":0.6995,"strengths":["coding","drafting","speed"]},{"credits_per_call":3.168,"id":"worker_b","p95_latency_ms":82049,"pass_rate":0.8598,"provider_group":"provider_x","quality":0.82,"strengths":["reasoning","review","writing"]},{"credits_per_call":12.651,"id":"worker_c","p95_latency_ms":85751,"pass_rate":0.995,"provider_group":"provider_y","quality":0.995,"strengths":["drafting","implementation","reasoning","synthesis"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":1,"max_credits":3.614,"max_latency_ms":21505,"minimum_quality":0.6607},"task":{"ambiguity":0.4797,"category":"coding","complexity":0.6023,"consequence":0.4708,"evidence_need":0.7308,"family":"migration_planning","input_tokens":7040,"reversibility":0.6477,"risk":0.53,"summary":"Review a staged migration for streaming inference and identify irreversible steps."},"workers":[{"credits_per_call":11.088,"id":"worker_a","p95_latency_ms":89592,"pass_rate":0.995,"provider_group":"provider_y","quality":0.9301,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":1.057,"id":"worker_b","p95_latency_ms":19172,"pass_rate":0.4684,"provider_group":"provider_x","quality":0.6982,"strengths":["coding","drafting","speed"]},{"credits_per_call":3.362,"id":"worker_c","p95_latency_ms":55726,"pass_rate":0.7976,"provider_group":"provider_z","quality":0.8625,"strengths":["reasoning","review","writing"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":3,"max_credits":20.015,"max_latency_ms":251417,"minimum_quality":0.9591},"task":{"ambiguity":0.6959,"category":"review","complexity":0.7145,"consequence":0.6998,"evidence_need":0.7978,"family":"policy_compliance","input_tokens":5480,"reversibility":0.6749,"risk":0.7855,"summary":"Review whether background jobs satisfies a documented retention policy."},"workers":[{"credits_per_call":1.22,"id":"worker_a","p95_latency_ms":30168,"pass_rate":0.5628,"provider_group":"provider_x","quality":0.7394,"strengths":["coding","drafting","speed"]},{"credits_per_call":10.878,"id":"worker_b","p95_latency_ms":92017,"pass_rate":0.8882,"provider_group":"provider_y","quality":0.995,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":4.114,"id":"worker_c","p95_latency_ms":73001,"pass_rate":0.8751,"provider_group":"provider_z","quality":0.8678,"strengths":["reasoning","review","writing"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":3,"max_credits":23.517,"max_latency_ms":202194,"minimum_quality":0.8578},"task":{"ambiguity":0.511,"category":"review","complexity":0.6703,"consequence":0.7034,"evidence_need":0.8626,"family":"policy_compliance","input_tokens":7000,"reversibility":0.5957,"risk":0.4539,"summary":"Review whether data retention satisfies a documented retention policy."},"workers":[{"credits_per_call":12.15,"id":"worker_a","p95_latency_ms":79583,"pass_rate":0.8856,"provider_group":"provider_y","quality":0.9181,"strengths":["drafting","implementation","reasoning","synthesis"]},{"credits_per_call":4.184,"id":"worker_b","p95_latency_ms":60556,"pass_rate":0.85,"provider_group":"provider_x","quality":0.8164,"strengths":["drafting","reasoning","review","writing"]},{"credits_per_call":0.995,"id":"worker_c","p95_latency_ms":32926,"pass_rate":0.5193,"provider_group":"provider_z","quality":0.7896,"strengths":["coding","drafting","speed"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":1,"max_credits":3.07,"max_latency_ms":34632,"minimum_quality":0.7336},"task":{"ambiguity":0.4277,"category":"review","complexity":0.4404,"consequence":0.8829,"evidence_need":0.8759,"family":"policy_compliance","input_tokens":6200,"reversibility":0.3971,"risk":0.8476,"summary":"Review whether data retention satisfies a documented retention policy."},"workers":[{"credits_per_call":3.272,"id":"worker_a","p95_latency_ms":65741,"pass_rate":0.7251,"provider_group":"provider_y","quality":0.826,"strengths":["drafting","reasoning","review","writing"]},{"credits_per_call":0.991,"id":"worker_b","p95_latency_ms":20847,"pass_rate":0.5408,"provider_group":"provider_z","quality":0.7079,"strengths":["coding","drafting","speed"]},{"credits_per_call":15.025,"id":"worker_c","p95_latency_ms":69175,"pass_rate":0.995,"provider_group":"provider_x","quality":0.995,"strengths":["implementation","reasoning","synthesis"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":3,"max_credits":5.567,"max_latency_ms":145618,"minimum_quality":0.7022},"task":{"ambiguity":0.5561,"category":"review","complexity":0.5152,"consequence":0.6721,"evidence_need":0.7406,"family":"policy_compliance","input_tokens":6280,"reversibility":0.4387,"risk":0.8477,"summary":"Review whether data retention satisfies a documented retention policy."},"workers":[{"credits_per_call":3.721,"id":"worker_a","p95_latency_ms":67928,"pass_rate":0.8049,"provider_group":"provider_x","quality":0.8236,"strengths":["reasoning","review","writing"]},{"credits_per_call":12.543,"id":"worker_b","p95_latency_ms":49418,"pass_rate":0.9146,"provider_group":"provider_z","quality":0.9537,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":1.023,"id":"worker_c","p95_latency_ms":20428,"pass_rate":0.5274,"provider_group":"provider_y","quality":0.6835,"strengths":["coding","drafting","speed"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":1,"max_credits":1.21,"max_latency_ms":37220,"minimum_quality":0.7348},"task":{"ambiguity":0.5273,"category":"coding","complexity":0.6484,"consequence":0.5891,"evidence_need":0.5648,"family":"migration_planning","input_tokens":2920,"reversibility":0.2625,"risk":0.4985,"summary":"Review a staged migration for rate limiting and identify irreversible steps."},"workers":[{"credits_per_call":3.385,"id":"worker_a","p95_latency_ms":71427,"pass_rate":0.7225,"provider_group":"provider_x","quality":0.8457,"strengths":["reasoning","review","writing"]},{"credits_per_call":15.114,"id":"worker_b","p95_latency_ms":74210,"pass_rate":0.9075,"provider_group":"provider_z","quality":0.995,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":0.816,"id":"worker_c","p95_latency_ms":28253,"pass_rate":0.6,"provider_group":"provider_y","quality":0.7173,"strengths":["coding","drafting","speed"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":2,"max_credits":21.975,"max_latency_ms":147206,"minimum_quality":0.7094},"task":{"ambiguity":0.6782,"category":"coding","complexity":0.8894,"consequence":0.8486,"evidence_need":0.5559,"family":"migration_planning","input_tokens":6400,"reversibility":0.2969,"risk":0.6496,"summary":"Design compatibility testing for a artifact storage schema migration."},"workers":[{"credits_per_call":4.003,"id":"worker_a","p95_latency_ms":71794,"pass_rate":0.8168,"provider_group":"provider_y","quality":0.8775,"strengths":["reasoning","review","writing"]},{"credits_per_call":1.19,"id":"worker_b","p95_latency_ms":18514,"pass_rate":0.5533,"provider_group":"provider_z","quality":0.7801,"strengths":["coding","drafting","speed"]},{"credits_per_call":14.289,"id":"worker_c","p95_latency_ms":87412,"pass_rate":0.9906,"provider_group":"provider_x","quality":0.995,"strengths":["implementation","reasoning","synthesis"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":3,"max_credits":8.793,"max_latency_ms":103377,"minimum_quality":0.7447},"task":{"ambiguity":0.4626,"category":"coding","complexity":0.9441,"consequence":0.6082,"evidence_need":0.786,"family":"migration_planning","input_tokens":6440,"reversibility":0.4275,"risk":0.5619,"summary":"Review a staged migration for deployment rollback and identify irreversible steps."},"workers":[{"credits_per_call":11.787,"id":"worker_a","p95_latency_ms":57976,"pass_rate":0.8874,"provider_group":"provider_y","quality":0.995,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":4.107,"id":"worker_b","p95_latency_ms":58116,"pass_rate":0.7347,"provider_group":"provider_z","quality":0.9121,"strengths":["reasoning","review","writing"]},{"credits_per_call":0.937,"id":"worker_c","p95_latency_ms":29252,"pass_rate":0.5426,"provider_group":"provider_x","quality":0.8021,"strengths":["coding","drafting","speed"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":2,"max_credits":12.082,"max_latency_ms":78295,"minimum_quality":0.7821},"task":{"ambiguity":0.548,"category":"analysis","complexity":0.7634,"consequence":0.5616,"evidence_need":0.5894,"family":"performance_tuning","input_tokens":4920,"reversibility":0.5682,"risk":0.5158,"summary":"Diagnose latency variance in provider failover and rank the next experiments."},"workers":[{"credits_per_call":13.338,"id":"worker_a","p95_latency_ms":92544,"pass_rate":0.995,"provider_group":"provider_z","quality":0.995,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":3.221,"id":"worker_b","p95_latency_ms":52702,"pass_rate":0.9419,"provider_group":"provider_y","quality":0.8603,"strengths":["reasoning","review","writing"]},{"credits_per_call":0.87,"id":"worker_c","p95_latency_ms":18103,"pass_rate":0.4174,"provider_group":"provider_x","quality":0.6781,"strengths":["coding","drafting","reasoning","speed"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":3,"max_credits":26.834,"max_latency_ms":188444,"minimum_quality":0.8403},"task":{"ambiguity":0.659,"category":"coding","complexity":0.6513,"consequence":0.5616,"evidence_need":0.4468,"family":"migration_planning","input_tokens":5520,"reversibility":0.4315,"risk":0.6551,"summary":"Design compatibility testing for a streaming inference schema migration."},"workers":[{"credits_per_call":1.199,"id":"worker_a","p95_latency_ms":19259,"pass_rate":0.5822,"provider_group":"provider_z","quality":0.6752,"strengths":["coding","drafting","speed"]},{"credits_per_call":4.164,"id":"worker_b","p95_latency_ms":56420,"pass_rate":0.836,"provider_group":"provider_x","quality":0.8606,"strengths":["coding","reasoning","review","writing"]},{"credits_per_call":14.888,"id":"worker_c","p95_latency_ms":63368,"pass_rate":0.995,"provider_group":"provider_y","quality":0.9277,"strengths":["implementation","reasoning","synthesis"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":2,"max_credits":12.351,"max_latency_ms":177037,"minimum_quality":0.8212},"task":{"ambiguity":0.3745,"category":"review","complexity":0.5583,"consequence":0.6595,"evidence_need":0.7537,"family":"policy_compliance","input_tokens":1880,"reversibility":0.5654,"risk":0.7211,"summary":"Review whether observability satisfies a documented retention policy."},"workers":[{"credits_per_call":3.234,"id":"worker_a","p95_latency_ms":77101,"pass_rate":0.7732,"provider_group":"provider_x","quality":0.8143,"strengths":["reasoning","review","writing"]},{"credits_per_call":12.537,"id":"worker_b","p95_latency_ms":85635,"pass_rate":0.961,"provider_group":"provider_z","quality":0.9384,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":1.177,"id":"worker_c","p95_latency_ms":27540,"pass_rate":0.5532,"provider_group":"provider_y","quality":0.7608,"strengths":["coding","drafting","speed"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":1,"max_credits":2.444,"max_latency_ms":26082,"minimum_quality":0.4986},"task":{"ambiguity":0.5346,"category":"analysis","complexity":0.737,"consequence":0.5371,"evidence_need":0.6911,"family":"performance_tuning","input_tokens":7680,"reversibility":0.708,"risk":0.3163,"summary":"Review a proposed optimization for provider failover for hidden regressions."},"workers":[{"credits_per_call":1.123,"id":"worker_a","p95_latency_ms":22396,"pass_rate":0.423,"provider_group":"provider_z","quality":0.6228,"strengths":["coding","drafting","reasoning","speed"]},{"credits_per_call":3.07,"id":"worker_b","p95_latency_ms":80594,"pass_rate":0.8347,"provider_group":"provider_x","quality":0.9219,"strengths":["reasoning","review","writing"]},{"credits_per_call":15.14,"id":"worker_c","p95_latency_ms":51696,"pass_rate":0.995,"provider_group":"provider_y","quality":0.995,"strengths":["implementation","reasoning","synthesis"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":3,"max_credits":8.514,"max_latency_ms":143454,"minimum_quality":0.8624},"task":{"ambiguity":0.4654,"category":"coding","complexity":0.6077,"consequence":0.7743,"evidence_need":0.8026,"family":"migration_planning","input_tokens":7040,"reversibility":0.3152,"risk":0.4131,"summary":"Plan a zero-downtime migration of schema evolution with rollback checkpoints."},"workers":[{"credits_per_call":14.468,"id":"worker_a","p95_latency_ms":75383,"pass_rate":0.981,"provider_group":"provider_y","quality":0.9824,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":1.184,"id":"worker_b","p95_latency_ms":25487,"pass_rate":0.4683,"provider_group":"provider_x","quality":0.7586,"strengths":["coding","drafting","speed"]},{"credits_per_call":2.757,"id":"worker_c","p95_latency_ms":63317,"pass_rate":0.847,"provider_group":"provider_z","quality":0.8982,"strengths":["reasoning","review","writing"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":2,"max_credits":17.739,"max_latency_ms":95782,"minimum_quality":0.7435},"task":{"ambiguity":0.4158,"category":"review","complexity":0.6906,"consequence":0.9242,"evidence_need":0.5635,"family":"policy_compliance","input_tokens":5920,"reversibility":0.6333,"risk":0.6203,"summary":"Audit a workflow for private credentials against explicit access requirements."},"workers":[{"credits_per_call":3.378,"id":"worker_a","p95_latency_ms":75810,"pass_rate":0.8266,"provider_group":"provider_z","quality":0.8053,"strengths":["reasoning","review","writing"]},{"credits_per_call":12.915,"id":"worker_b","p95_latency_ms":63445,"pass_rate":0.9901,"provider_group":"provider_y","quality":0.9726,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":0.851,"id":"worker_c","p95_latency_ms":24836,"pass_rate":0.5967,"provider_group":"provider_x","quality":0.7173,"strengths":["coding","drafting","speed"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":3,"max_credits":17.181,"max_latency_ms":213902,"minimum_quality":0.9104},"task":{"ambiguity":0.5753,"category":"review","complexity":0.6475,"consequence":0.6368,"evidence_need":0.8216,"family":"policy_compliance","input_tokens":2720,"reversibility":0.6481,"risk":0.5757,"summary":"Identify evidence required before approving usage metering for production."},"workers":[{"credits_per_call":1.199,"id":"worker_a","p95_latency_ms":27356,"pass_rate":0.5456,"provider_group":"provider_z","quality":0.8032,"strengths":["coding","drafting","speed"]},{"credits_per_call":2.834,"id":"worker_b","p95_latency_ms":56157,"pass_rate":0.7582,"provider_group":"provider_y","quality":0.9054,"strengths":["reasoning","review","writing"]},{"credits_per_call":11.532,"id":"worker_c","p95_latency_ms":87733,"pass_rate":0.995,"provider_group":"provider_x","quality":0.9438,"strengths":["drafting","implementation","reasoning","synthesis"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":2,"max_credits":16.279,"max_latency_ms":164277,"minimum_quality":0.8701},"task":{"ambiguity":0.5138,"category":"coding","complexity":0.9221,"consequence":0.7997,"evidence_need":0.4446,"family":"migration_planning","input_tokens":800,"reversibility":0.2865,"risk":0.5903,"summary":"Review a staged migration for model routing and identify irreversible steps."},"workers":[{"credits_per_call":4.03,"id":"worker_a","p95_latency_ms":48934,"pass_rate":0.845,"provider_group":"provider_z","quality":0.8388,"strengths":["reasoning","review","writing"]},{"credits_per_call":14.742,"id":"worker_b","p95_latency_ms":77699,"pass_rate":0.995,"provider_group":"provider_x","quality":0.9104,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":1.142,"id":"worker_c","p95_latency_ms":22212,"pass_rate":0.5885,"provider_group":"provider_y","quality":0.7084,"strengths":["coding","drafting","speed"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":1,"max_credits":1.012,"max_latency_ms":45418,"minimum_quality":0.7335},"task":{"ambiguity":0.6875,"category":"coding","complexity":0.6668,"consequence":0.8069,"evidence_need":0.4452,"family":"migration_planning","input_tokens":1480,"reversibility":0.5467,"risk":0.3504,"summary":"Plan a zero-downtime migration of data retention with rollback checkpoints."},"workers":[{"credits_per_call":15.412,"id":"worker_a","p95_latency_ms":78095,"pass_rate":0.9797,"provider_group":"provider_x","quality":0.995,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":3.266,"id":"worker_b","p95_latency_ms":51282,"pass_rate":0.8595,"provider_group":"provider_z","quality":0.7996,"strengths":["reasoning","review","writing"]},{"credits_per_call":0.83,"id":"worker_c","p95_latency_ms":26117,"pass_rate":0.5322,"provider_group":"provider_y","quality":0.7778,"strengths":["coding","drafting","speed"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":2,"max_credits":20.214,"max_latency_ms":158436,"minimum_quality":0.9},"task":{"ambiguity":0.6653,"category":"coding","complexity":0.704,"consequence":0.7212,"evidence_need":0.4639,"family":"migration_planning","input_tokens":4760,"reversibility":0.4359,"risk":0.5084,"summary":"Design compatibility testing for a prompt caching schema migration."},"workers":[{"credits_per_call":12.547,"id":"worker_a","p95_latency_ms":53088,"pass_rate":0.995,"provider_group":"provider_y","quality":0.9924,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":3.303,"id":"worker_b","p95_latency_ms":53758,"pass_rate":0.8837,"provider_group":"provider_x","quality":0.8415,"strengths":["coding","reasoning","review","writing"]},{"credits_per_call":0.847,"id":"worker_c","p95_latency_ms":33076,"pass_rate":0.5211,"provider_group":"provider_z","quality":0.7809,"strengths":["coding","drafting","speed"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":3,"max_credits":22.745,"max_latency_ms":235241,"minimum_quality":0.8365},"task":{"ambiguity":0.3846,"category":"review","complexity":0.7924,"consequence":0.7072,"evidence_need":0.745,"family":"policy_compliance","input_tokens":680,"reversibility":0.6956,"risk":0.7377,"summary":"Audit a workflow for access control against explicit access requirements."},"workers":[{"credits_per_call":3.048,"id":"worker_a","p95_latency_ms":76902,"pass_rate":0.7191,"provider_group":"provider_x","quality":0.8892,"strengths":["drafting","reasoning","review","writing"]},{"credits_per_call":1.131,"id":"worker_b","p95_latency_ms":18260,"pass_rate":0.506,"provider_group":"provider_z","quality":0.7181,"strengths":["coding","drafting","speed"]},{"credits_per_call":14.997,"id":"worker_c","p95_latency_ms":70150,"pass_rate":0.9764,"provider_group":"provider_y","quality":0.9445,"strengths":["implementation","reasoning","synthesis"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":1,"max_credits":1.664,"max_latency_ms":36890,"minimum_quality":0.5455},"task":{"ambiguity":0.4972,"category":"analysis","complexity":0.5364,"consequence":0.6251,"evidence_need":0.6918,"family":"performance_tuning","input_tokens":6000,"reversibility":0.5626,"risk":0.321,"summary":"Review a proposed optimization for OAuth callbacks for hidden regressions."},"workers":[{"credits_per_call":11.7,"id":"worker_a","p95_latency_ms":85554,"pass_rate":0.995,"provider_group":"provider_z","quality":0.9924,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":3.88,"id":"worker_b","p95_latency_ms":76178,"pass_rate":0.8623,"provider_group":"provider_y","quality":0.9157,"strengths":["reasoning","review","writing"]},{"credits_per_call":0.939,"id":"worker_c","p95_latency_ms":32121,"pass_rate":0.4123,"provider_group":"provider_x","quality":0.7221,"strengths":["coding","drafting","reasoning","speed"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":3,"max_credits":26.445,"max_latency_ms":257602,"minimum_quality":0.7822},"task":{"ambiguity":0.3596,"category":"coding","complexity":0.9273,"consequence":0.4893,"evidence_need":0.6332,"family":"migration_planning","input_tokens":6720,"reversibility":0.4763,"risk":0.5969,"summary":"Review a staged migration for data retention and identify irreversible steps."},"workers":[{"credits_per_call":13.657,"id":"worker_a","p95_latency_ms":91942,"pass_rate":0.8937,"provider_group":"provider_x","quality":0.9272,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":4.267,"id":"worker_b","p95_latency_ms":79566,"pass_rate":0.8599,"provider_group":"provider_y","quality":0.8757,"strengths":["coding","reasoning","review","writing"]},{"credits_per_call":0.968,"id":"worker_c","p95_latency_ms":20715,"pass_rate":0.5426,"provider_group":"provider_z","quality":0.7096,"strengths":["coding","drafting","speed"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":1,"max_credits":2.009,"max_latency_ms":35489,"minimum_quality":0.6762},"task":{"ambiguity":0.3078,"category":"coding","complexity":0.6085,"consequence":0.5815,"evidence_need":0.7141,"family":"migration_planning","input_tokens":2760,"reversibility":0.6091,"risk":0.4728,"summary":"Design compatibility testing for a tenant-scoped caching schema migration."},"workers":[{"credits_per_call":3.9,"id":"worker_a","p95_latency_ms":74302,"pass_rate":0.784,"provider_group":"provider_z","quality":0.921,"strengths":["reasoning","review","writing"]},{"credits_per_call":15.195,"id":"worker_b","p95_latency_ms":58887,"pass_rate":0.9597,"provider_group":"provider_y","quality":0.995,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":1.129,"id":"worker_c","p95_latency_ms":20944,"pass_rate":0.4797,"provider_group":"provider_x","quality":0.7777,"strengths":["coding","drafting","speed"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":3,"max_credits":19.673,"max_latency_ms":168490,"minimum_quality":0.8835},"task":{"ambiguity":0.4752,"category":"analysis","complexity":0.866,"consequence":0.4471,"evidence_need":0.5299,"family":"performance_tuning","input_tokens":6440,"reversibility":0.7858,"risk":0.2504,"summary":"Diagnose latency variance in schema evolution and rank the next experiments."},"workers":[{"credits_per_call":1.07,"id":"worker_a","p95_latency_ms":25099,"pass_rate":0.4793,"provider_group":"provider_z","quality":0.6967,"strengths":["coding","drafting","speed"]},{"credits_per_call":14.708,"id":"worker_b","p95_latency_ms":84042,"pass_rate":0.995,"provider_group":"provider_x","quality":0.995,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":3.281,"id":"worker_c","p95_latency_ms":46224,"pass_rate":0.8566,"provider_group":"provider_y","quality":0.9291,"strengths":["reasoning","review","writing"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":1,"max_credits":1.846,"max_latency_ms":36803,"minimum_quality":0.7658},"task":{"ambiguity":0.6732,"category":"review","complexity":0.6235,"consequence":0.5399,"evidence_need":0.6737,"family":"policy_compliance","input_tokens":3280,"reversibility":0.4255,"risk":0.618,"summary":"Audit a workflow for prompt caching against explicit access requirements."},"workers":[{"credits_per_call":15.087,"id":"worker_a","p95_latency_ms":56117,"pass_rate":0.979,"provider_group":"provider_y","quality":0.9168,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":1.041,"id":"worker_b","p95_latency_ms":20791,"pass_rate":0.5061,"provider_group":"provider_x","quality":0.7756,"strengths":["coding","drafting","speed"]},{"credits_per_call":3.301,"id":"worker_c","p95_latency_ms":81522,"pass_rate":0.8037,"provider_group":"provider_z","quality":0.8906,"strengths":["drafting","reasoning","review","writing"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":3,"max_credits":20.482,"max_latency_ms":227383,"minimum_quality":0.8099},"task":{"ambiguity":0.6801,"category":"coding","complexity":0.7087,"consequence":0.7069,"evidence_need":0.822,"family":"migration_planning","input_tokens":960,"reversibility":0.314,"risk":0.4065,"summary":"Plan a zero-downtime migration of data retention with rollback checkpoints."},"workers":[{"credits_per_call":0.941,"id":"worker_a","p95_latency_ms":21583,"pass_rate":0.606,"provider_group":"provider_y","quality":0.7876,"strengths":["coding","drafting","speed"]},{"credits_per_call":3.19,"id":"worker_b","p95_latency_ms":63719,"pass_rate":0.8165,"provider_group":"provider_x","quality":0.8596,"strengths":["reasoning","review","writing"]},{"credits_per_call":11.632,"id":"worker_c","p95_latency_ms":71747,"pass_rate":0.9063,"provider_group":"provider_z","quality":0.9883,"strengths":["implementation","reasoning","synthesis"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":3,"max_credits":21.547,"max_latency_ms":193964,"minimum_quality":0.8545},"task":{"ambiguity":0.3639,"category":"coding","complexity":0.778,"consequence":0.4519,"evidence_need":0.6198,"family":"migration_planning","input_tokens":6120,"reversibility":0.3054,"risk":0.4824,"summary":"Review a staged migration for prompt caching and identify irreversible steps."},"workers":[{"credits_per_call":0.799,"id":"worker_a","p95_latency_ms":24413,"pass_rate":0.4842,"provider_group":"provider_x","quality":0.747,"strengths":["coding","drafting","speed"]},{"credits_per_call":4.264,"id":"worker_b","p95_latency_ms":51115,"pass_rate":0.7617,"provider_group":"provider_y","quality":0.8639,"strengths":["coding","reasoning","review","writing"]},{"credits_per_call":13.352,"id":"worker_c","p95_latency_ms":60112,"pass_rate":0.8897,"provider_group":"provider_z","quality":0.9185,"strengths":["coding","implementation","reasoning","synthesis"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":2,"max_credits":2.133,"max_latency_ms":50995,"minimum_quality":0.7687},"task":{"ambiguity":0.7301,"category":"analysis","complexity":0.5703,"consequence":0.6326,"evidence_need":0.6417,"family":"performance_tuning","input_tokens":6520,"reversibility":0.5855,"risk":0.2536,"summary":"Review a proposed optimization for observability for hidden regressions."},"workers":[{"credits_per_call":4.19,"id":"worker_a","p95_latency_ms":66153,"pass_rate":0.9047,"provider_group":"provider_z","quality":0.8905,"strengths":["reasoning","review","writing"]},{"credits_per_call":1.092,"id":"worker_b","p95_latency_ms":31127,"pass_rate":0.4784,"provider_group":"provider_x","quality":0.7309,"strengths":["coding","drafting","speed"]},{"credits_per_call":14.577,"id":"worker_c","p95_latency_ms":91231,"pass_rate":0.995,"provider_group":"provider_y","quality":0.995,"strengths":["implementation","reasoning","synthesis"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":1,"max_credits":2.301,"max_latency_ms":47433,"minimum_quality":0.6628},"task":{"ambiguity":0.5172,"category":"review","complexity":0.4289,"consequence":0.5678,"evidence_need":0.933,"family":"policy_compliance","input_tokens":6920,"reversibility":0.3673,"risk":0.6504,"summary":"Review whether database failover satisfies a documented retention policy."},"workers":[{"credits_per_call":1.027,"id":"worker_a","p95_latency_ms":29291,"pass_rate":0.5724,"provider_group":"provider_x","quality":0.7911,"strengths":["coding","drafting","speed"]},{"credits_per_call":10.811,"id":"worker_b","p95_latency_ms":88648,"pass_rate":0.9238,"provider_group":"provider_y","quality":0.937,"strengths":["drafting","implementation","reasoning","synthesis"]},{"credits_per_call":3.988,"id":"worker_c","p95_latency_ms":66230,"pass_rate":0.7981,"provider_group":"provider_z","quality":0.8633,"strengths":["reasoning","review","writing"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":3,"max_credits":16.275,"max_latency_ms":223036,"minimum_quality":0.9457},"task":{"ambiguity":0.3377,"category":"coding","complexity":0.7876,"consequence":0.5383,"evidence_need":0.4357,"family":"migration_planning","input_tokens":1600,"reversibility":0.4937,"risk":0.4833,"summary":"Review a staged migration for tenant-scoped caching and identify irreversible steps."},"workers":[{"credits_per_call":2.87,"id":"worker_a","p95_latency_ms":55817,"pass_rate":0.8154,"provider_group":"provider_y","quality":0.7935,"strengths":["reasoning","review","writing"]},{"credits_per_call":10.477,"id":"worker_b","p95_latency_ms":75331,"pass_rate":0.9378,"provider_group":"provider_x","quality":0.9748,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":1.16,"id":"worker_c","p95_latency_ms":28754,"pass_rate":0.6175,"provider_group":"provider_z","quality":0.7587,"strengths":["coding","drafting","speed"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":3,"max_credits":19.749,"max_latency_ms":230257,"minimum_quality":0.9132},"task":{"ambiguity":0.4843,"category":"review","complexity":0.6931,"consequence":0.6845,"evidence_need":0.5549,"family":"policy_compliance","input_tokens":7760,"reversibility":0.4225,"risk":0.6886,"summary":"Identify evidence required before approving artifact storage for production."},"workers":[{"credits_per_call":2.812,"id":"worker_a","p95_latency_ms":70165,"pass_rate":0.8665,"provider_group":"provider_z","quality":0.9173,"strengths":["reasoning","review","writing"]},{"credits_per_call":1.18,"id":"worker_b","p95_latency_ms":20210,"pass_rate":0.5453,"provider_group":"provider_y","quality":0.7876,"strengths":["coding","drafting","speed"]},{"credits_per_call":11.874,"id":"worker_c","p95_latency_ms":72463,"pass_rate":0.9433,"provider_group":"provider_x","quality":0.9785,"strengths":["drafting","implementation","reasoning","synthesis"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":3,"max_credits":16.928,"max_latency_ms":216929,"minimum_quality":0.7924},"task":{"ambiguity":0.517,"category":"coding","complexity":0.6844,"consequence":0.4882,"evidence_need":0.7824,"family":"migration_planning","input_tokens":2880,"reversibility":0.3041,"risk":0.5251,"summary":"Review a staged migration for background jobs and identify irreversible steps."},"workers":[{"credits_per_call":1.085,"id":"worker_a","p95_latency_ms":24893,"pass_rate":0.5755,"provider_group":"provider_z","quality":0.7799,"strengths":["coding","drafting","speed"]},{"credits_per_call":3.032,"id":"worker_b","p95_latency_ms":75954,"pass_rate":0.7945,"provider_group":"provider_x","quality":0.8785,"strengths":["reasoning","review","writing"]},{"credits_per_call":11.454,"id":"worker_c","p95_latency_ms":86033,"pass_rate":0.994,"provider_group":"provider_y","quality":0.9122,"strengths":["implementation","reasoning","synthesis"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":2,"max_credits":12.494,"max_latency_ms":161899,"minimum_quality":0.7184},"task":{"ambiguity":0.5031,"category":"review","complexity":0.6981,"consequence":0.789,"evidence_need":0.7421,"family":"policy_compliance","input_tokens":5080,"reversibility":0.5675,"risk":0.5968,"summary":"Identify evidence required before approving artifact storage for production."},"workers":[{"credits_per_call":14.534,"id":"worker_a","p95_latency_ms":61703,"pass_rate":0.9746,"provider_group":"provider_x","quality":0.9862,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":3.266,"id":"worker_b","p95_latency_ms":63116,"pass_rate":0.8152,"provider_group":"provider_z","quality":0.8868,"strengths":["drafting","reasoning","review","writing"]},{"credits_per_call":0.841,"id":"worker_c","p95_latency_ms":23139,"pass_rate":0.464,"provider_group":"provider_y","quality":0.7544,"strengths":["coding","drafting","speed"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=