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.216,"max_latency_ms":230825,"minimum_quality":0.8728},"task":{"ambiguity":0.585,"category":"coding","complexity":0.8815,"consequence":0.5197,"evidence_need":0.4503,"family":"migration_planning","input_tokens":7800,"reversibility":0.6396,"risk":0.6892,"summary":"Plan a zero-downtime migration of access control with rollback checkpoints."},"workers":[{"credits_per_call":0.797,"id":"worker_a","p95_latency_ms":28320,"pass_rate":0.6151,"provider_group":"provider_x","quality":0.7887,"strengths":["coding","drafting","speed"]},{"credits_per_call":12.57,"id":"worker_b","p95_latency_ms":63166,"pass_rate":0.9668,"provider_group":"provider_z","quality":0.995,"strengths":["coding","implementation","reasoning","synthesis"]},{"credits_per_call":3.202,"id":"worker_c","p95_latency_ms":76484,"pass_rate":0.8155,"provider_group":"provider_y","quality":0.9057,"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":19.236,"max_latency_ms":235264,"minimum_quality":0.869},"task":{"ambiguity":0.5137,"category":"coding","complexity":0.7297,"consequence":0.7418,"evidence_need":0.7157,"family":"migration_planning","input_tokens":280,"reversibility":0.3421,"risk":0.7125,"summary":"Plan a zero-downtime migration of credit reservation with rollback checkpoints."},"workers":[{"credits_per_call":3.046,"id":"worker_a","p95_latency_ms":78501,"pass_rate":0.8421,"provider_group":"provider_z","quality":0.9083,"strengths":["reasoning","review","writing"]},{"credits_per_call":14.561,"id":"worker_b","p95_latency_ms":88439,"pass_rate":0.9465,"provider_group":"provider_x","quality":0.9232,"strengths":["coding","implementation","reasoning","synthesis"]},{"credits_per_call":1.022,"id":"worker_c","p95_latency_ms":29366,"pass_rate":0.5565,"provider_group":"provider_y","quality":0.7774,"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=

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.332,"max_latency_ms":25538,"minimum_quality":0.5658},"task":{"ambiguity":0.4852,"category":"review","complexity":0.736,"consequence":0.648,"evidence_need":0.6695,"family":"policy_compliance","input_tokens":7560,"reversibility":0.5382,"risk":0.7412,"summary":"Identify evidence required before approving schema evolution for production."},"workers":[{"credits_per_call":14.495,"id":"worker_a","p95_latency_ms":88217,"pass_rate":0.9431,"provider_group":"provider_x","quality":0.995,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":4.173,"id":"worker_b","p95_latency_ms":64114,"pass_rate":0.7216,"provider_group":"provider_z","quality":0.8867,"strengths":["reasoning","review","writing"]},{"credits_per_call":0.931,"id":"worker_c","p95_latency_ms":22160,"pass_rate":0.4702,"provider_group":"provider_y","quality":0.7709,"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":2.953,"max_latency_ms":42668,"minimum_quality":0.6924},"task":{"ambiguity":0.5397,"category":"review","complexity":0.4206,"consequence":0.5371,"evidence_need":0.8019,"family":"policy_compliance","input_tokens":5720,"reversibility":0.3037,"risk":0.5414,"summary":"Audit a workflow for schema evolution against explicit access requirements."},"workers":[{"credits_per_call":1.044,"id":"worker_a","p95_latency_ms":29351,"pass_rate":0.4802,"provider_group":"provider_x","quality":0.7567,"strengths":["coding","drafting","speed"]},{"credits_per_call":4.171,"id":"worker_b","p95_latency_ms":59532,"pass_rate":0.7422,"provider_group":"provider_y","quality":0.84,"strengths":["reasoning","review","writing"]},{"credits_per_call":13.416,"id":"worker_c","p95_latency_ms":78796,"pass_rate":0.9843,"provider_group":"provider_z","quality":0.9271,"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":19.196,"max_latency_ms":189126,"minimum_quality":0.8352},"task":{"ambiguity":0.4881,"category":"coding","complexity":0.8226,"consequence":0.7875,"evidence_need":0.4516,"family":"migration_planning","input_tokens":2240,"reversibility":0.4519,"risk":0.6194,"summary":"Design compatibility testing for a schema evolution schema migration."},"workers":[{"credits_per_call":14.255,"id":"worker_a","p95_latency_ms":60768,"pass_rate":0.9606,"provider_group":"provider_y","quality":0.9246,"strengths":["coding","implementation","reasoning","synthesis"]},{"credits_per_call":0.94,"id":"worker_b","p95_latency_ms":23767,"pass_rate":0.5781,"provider_group":"provider_x","quality":0.7218,"strengths":["coding","drafting","speed"]},{"credits_per_call":3.674,"id":"worker_c","p95_latency_ms":59112,"pass_rate":0.7314,"provider_group":"provider_z","quality":0.7942,"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":10.681,"max_latency_ms":109884,"minimum_quality":0.6977},"task":{"ambiguity":0.3797,"category":"coding","complexity":0.8755,"consequence":0.6581,"evidence_need":0.6289,"family":"migration_planning","input_tokens":680,"reversibility":0.2845,"risk":0.6992,"summary":"Review a staged migration for deployment rollback and identify irreversible steps."},"workers":[{"credits_per_call":14.655,"id":"worker_a","p95_latency_ms":60458,"pass_rate":0.995,"provider_group":"provider_x","quality":0.9585,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":3.163,"id":"worker_b","p95_latency_ms":69755,"pass_rate":0.7979,"provider_group":"provider_z","quality":0.8607,"strengths":["reasoning","review","writing"]},{"credits_per_call":1.184,"id":"worker_c","p95_latency_ms":31625,"pass_rate":0.5139,"provider_group":"provider_y","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":2,"max_credits":2.537,"max_latency_ms":41323,"minimum_quality":0.6836},"task":{"ambiguity":0.7447,"category":"coding","complexity":0.6812,"consequence":0.8019,"evidence_need":0.6842,"family":"migration_planning","input_tokens":7520,"reversibility":0.3265,"risk":0.5363,"summary":"Plan a zero-downtime migration of observability with rollback checkpoints."},"workers":[{"credits_per_call":0.963,"id":"worker_a","p95_latency_ms":23797,"pass_rate":0.4779,"provider_group":"provider_y","quality":0.7272,"strengths":["coding","drafting","speed"]},{"credits_per_call":3.082,"id":"worker_b","p95_latency_ms":77393,"pass_rate":0.7562,"provider_group":"provider_z","quality":0.8486,"strengths":["reasoning","review","writing"]},{"credits_per_call":14.85,"id":"worker_c","p95_latency_ms":79297,"pass_rate":0.995,"provider_group":"provider_x","quality":0.9771,"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.359,"max_latency_ms":34575,"minimum_quality":0.562},"task":{"ambiguity":0.452,"category":"analysis","complexity":0.7001,"consequence":0.2568,"evidence_need":0.7034,"family":"performance_tuning","input_tokens":560,"reversibility":0.6496,"risk":0.2684,"summary":"Review a proposed optimization for credit reservation for hidden regressions."},"workers":[{"credits_per_call":1.185,"id":"worker_a","p95_latency_ms":19288,"pass_rate":0.3965,"provider_group":"provider_y","quality":0.6938,"strengths":["coding","drafting","speed"]},{"credits_per_call":2.738,"id":"worker_b","p95_latency_ms":54143,"pass_rate":0.939,"provider_group":"provider_x","quality":0.9517,"strengths":["reasoning","review","writing"]},{"credits_per_call":13.482,"id":"worker_c","p95_latency_ms":72443,"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.207,"max_latency_ms":216837,"minimum_quality":0.8787},"task":{"ambiguity":0.5281,"category":"coding","complexity":0.9052,"consequence":0.4856,"evidence_need":0.8305,"family":"migration_planning","input_tokens":3600,"reversibility":0.4392,"risk":0.6548,"summary":"Review a staged migration for rate limiting and identify irreversible steps."},"workers":[{"credits_per_call":1.183,"id":"worker_a","p95_latency_ms":30073,"pass_rate":0.4656,"provider_group":"provider_y","quality":0.7681,"strengths":["coding","drafting","speed"]},{"credits_per_call":13.299,"id":"worker_b","p95_latency_ms":58801,"pass_rate":0.995,"provider_group":"provider_z","quality":0.9905,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":3.071,"id":"worker_c","p95_latency_ms":68727,"pass_rate":0.7832,"provider_group":"provider_x","quality":0.8857,"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.421,"max_latency_ms":42165,"minimum_quality":0.6464},"task":{"ambiguity":0.5296,"category":"analysis","complexity":0.6365,"consequence":0.3893,"evidence_need":0.6743,"family":"performance_tuning","input_tokens":1360,"reversibility":0.7141,"risk":0.4534,"summary":"Review a proposed optimization for model routing for hidden regressions."},"workers":[{"credits_per_call":13.295,"id":"worker_a","p95_latency_ms":58292,"pass_rate":0.9595,"provider_group":"provider_x","quality":0.995,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":0.908,"id":"worker_b","p95_latency_ms":32082,"pass_rate":0.4551,"provider_group":"provider_z","quality":0.647,"strengths":["coding","drafting","speed"]},{"credits_per_call":3.323,"id":"worker_c","p95_latency_ms":72990,"pass_rate":0.8073,"provider_group":"provider_y","quality":0.8848,"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":25.398,"max_latency_ms":236393,"minimum_quality":0.9462},"task":{"ambiguity":0.6493,"category":"coding","complexity":0.6999,"consequence":0.668,"evidence_need":0.7728,"family":"migration_planning","input_tokens":4360,"reversibility":0.2587,"risk":0.6375,"summary":"Review a staged migration for rate limiting and identify irreversible steps."},"workers":[{"credits_per_call":3.945,"id":"worker_a","p95_latency_ms":76548,"pass_rate":0.831,"provider_group":"provider_y","quality":0.8086,"strengths":["reasoning","review","writing"]},{"credits_per_call":1.097,"id":"worker_b","p95_latency_ms":24986,"pass_rate":0.4951,"provider_group":"provider_z","quality":0.7042,"strengths":["coding","drafting","speed"]},{"credits_per_call":14.477,"id":"worker_c","p95_latency_ms":62070,"pass_rate":0.9194,"provider_group":"provider_x","quality":0.916,"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":20.813,"max_latency_ms":161861,"minimum_quality":0.8291},"task":{"ambiguity":0.7544,"category":"review","complexity":0.6997,"consequence":0.888,"evidence_need":0.7062,"family":"policy_compliance","input_tokens":720,"reversibility":0.6053,"risk":0.5275,"summary":"Identify evidence required before approving credit reservation for production."},"workers":[{"credits_per_call":13.102,"id":"worker_a","p95_latency_ms":91725,"pass_rate":0.9444,"provider_group":"provider_y","quality":0.9192,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":0.882,"id":"worker_b","p95_latency_ms":27681,"pass_rate":0.4919,"provider_group":"provider_z","quality":0.7637,"strengths":["coding","drafting","speed"]},{"credits_per_call":3.559,"id":"worker_c","p95_latency_ms":45472,"pass_rate":0.7647,"provider_group":"provider_x","quality":0.8576,"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.412,"max_latency_ms":221524,"minimum_quality":0.8018},"task":{"ambiguity":0.4494,"category":"coding","complexity":0.946,"consequence":0.6756,"evidence_need":0.8176,"family":"migration_planning","input_tokens":5360,"reversibility":0.3887,"risk":0.374,"summary":"Design compatibility testing for a provider failover schema migration."},"workers":[{"credits_per_call":14.301,"id":"worker_a","p95_latency_ms":83349,"pass_rate":0.8903,"provider_group":"provider_y","quality":0.995,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":3.29,"id":"worker_b","p95_latency_ms":59429,"pass_rate":0.7682,"provider_group":"provider_z","quality":0.8313,"strengths":["coding","reasoning","review","writing"]},{"credits_per_call":1.135,"id":"worker_c","p95_latency_ms":27010,"pass_rate":0.5902,"provider_group":"provider_x","quality":0.7387,"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.86,"max_latency_ms":37459,"minimum_quality":0.557},"task":{"ambiguity":0.4822,"category":"coding","complexity":0.8848,"consequence":0.6318,"evidence_need":0.7369,"family":"migration_planning","input_tokens":4280,"reversibility":0.4062,"risk":0.702,"summary":"Plan a zero-downtime migration of artifact storage with rollback checkpoints."},"workers":[{"credits_per_call":3.844,"id":"worker_a","p95_latency_ms":56533,"pass_rate":0.8479,"provider_group":"provider_y","quality":0.8233,"strengths":["reasoning","review","writing"]},{"credits_per_call":1.092,"id":"worker_b","p95_latency_ms":20630,"pass_rate":0.48,"provider_group":"provider_z","quality":0.7617,"strengths":["coding","drafting","speed"]},{"credits_per_call":13.085,"id":"worker_c","p95_latency_ms":78853,"pass_rate":0.9909,"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":22.123,"max_latency_ms":205833,"minimum_quality":0.9589},"task":{"ambiguity":0.5697,"category":"coding","complexity":0.7089,"consequence":0.8208,"evidence_need":0.8415,"family":"migration_planning","input_tokens":520,"reversibility":0.3428,"risk":0.4344,"summary":"Plan a zero-downtime migration of observability with rollback checkpoints."},"workers":[{"credits_per_call":0.892,"id":"worker_a","p95_latency_ms":28936,"pass_rate":0.5242,"provider_group":"provider_y","quality":0.7936,"strengths":["coding","drafting","speed"]},{"credits_per_call":3.097,"id":"worker_b","p95_latency_ms":75050,"pass_rate":0.8261,"provider_group":"provider_x","quality":0.858,"strengths":["reasoning","review","writing"]},{"credits_per_call":12.094,"id":"worker_c","p95_latency_ms":50389,"pass_rate":0.9663,"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":1,"max_credits":3.021,"max_latency_ms":47640,"minimum_quality":0.5634},"task":{"ambiguity":0.399,"category":"review","complexity":0.5352,"consequence":0.9078,"evidence_need":0.6554,"family":"policy_compliance","input_tokens":7640,"reversibility":0.318,"risk":0.8199,"summary":"Identify evidence required before approving deployment rollback for production."},"workers":[{"credits_per_call":4.142,"id":"worker_a","p95_latency_ms":74036,"pass_rate":0.7726,"provider_group":"provider_x","quality":0.8251,"strengths":["drafting","reasoning","review","writing"]},{"credits_per_call":12.765,"id":"worker_b","p95_latency_ms":67104,"pass_rate":0.9643,"provider_group":"provider_y","quality":0.9933,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":0.796,"id":"worker_c","p95_latency_ms":27550,"pass_rate":0.474,"provider_group":"provider_z","quality":0.706,"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":18.997,"max_latency_ms":160270,"minimum_quality":0.8766},"task":{"ambiguity":0.7666,"category":"review","complexity":0.6416,"consequence":0.5253,"evidence_need":0.563,"family":"policy_compliance","input_tokens":2360,"reversibility":0.6874,"risk":0.6013,"summary":"Identify evidence required before approving prompt caching for production."},"workers":[{"credits_per_call":3.784,"id":"worker_a","p95_latency_ms":50695,"pass_rate":0.7681,"provider_group":"provider_y","quality":0.8833,"strengths":["drafting","reasoning","review","writing"]},{"credits_per_call":13.308,"id":"worker_b","p95_latency_ms":58489,"pass_rate":0.995,"provider_group":"provider_z","quality":0.968,"strengths":["drafting","implementation","reasoning","synthesis"]},{"credits_per_call":0.903,"id":"worker_c","p95_latency_ms":25713,"pass_rate":0.4972,"provider_group":"provider_x","quality":0.7705,"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":11.042,"max_latency_ms":233738,"minimum_quality":0.7575},"task":{"ambiguity":0.5271,"category":"review","complexity":0.4604,"consequence":0.938,"evidence_need":0.9494,"family":"policy_compliance","input_tokens":2480,"reversibility":0.5229,"risk":0.8184,"summary":"Identify evidence required before approving access control for production."},"workers":[{"credits_per_call":3.001,"id":"worker_a","p95_latency_ms":66003,"pass_rate":0.7508,"provider_group":"provider_z","quality":0.8363,"strengths":["reasoning","review","writing"]},{"credits_per_call":12.716,"id":"worker_b","p95_latency_ms":73353,"pass_rate":0.9717,"provider_group":"provider_y","quality":0.9894,"strengths":["drafting","implementation","reasoning","synthesis"]},{"credits_per_call":1.165,"id":"worker_c","p95_latency_ms":25472,"pass_rate":0.5462,"provider_group":"provider_x","quality":0.6817,"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.436,"max_latency_ms":28582,"minimum_quality":0.6865},"task":{"ambiguity":0.4036,"category":"review","complexity":0.8365,"consequence":0.8248,"evidence_need":0.8236,"family":"policy_compliance","input_tokens":280,"reversibility":0.5143,"risk":0.4602,"summary":"Audit a workflow for database failover against explicit access requirements."},"workers":[{"credits_per_call":1.057,"id":"worker_a","p95_latency_ms":20033,"pass_rate":0.4689,"provider_group":"provider_x","quality":0.7105,"strengths":["coding","drafting","speed"]},{"credits_per_call":12.918,"id":"worker_b","p95_latency_ms":77046,"pass_rate":0.9013,"provider_group":"provider_z","quality":0.995,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":4.169,"id":"worker_c","p95_latency_ms":64003,"pass_rate":0.8419,"provider_group":"provider_y","quality":0.8864,"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.328,"max_latency_ms":110953,"minimum_quality":0.8638},"task":{"ambiguity":0.5958,"category":"coding","complexity":0.7002,"consequence":0.8208,"evidence_need":0.8304,"family":"migration_planning","input_tokens":7320,"reversibility":0.647,"risk":0.7271,"summary":"Plan a zero-downtime migration of private credentials with rollback checkpoints."},"workers":[{"credits_per_call":4.069,"id":"worker_a","p95_latency_ms":64306,"pass_rate":0.872,"provider_group":"provider_y","quality":0.9125,"strengths":["reasoning","review","writing"]},{"credits_per_call":11.913,"id":"worker_b","p95_latency_ms":57764,"pass_rate":0.995,"provider_group":"provider_z","quality":0.9456,"strengths":["coding","implementation","reasoning","synthesis"]},{"credits_per_call":1.191,"id":"worker_c","p95_latency_ms":21296,"pass_rate":0.4891,"provider_group":"provider_x","quality":0.751,"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":23.847,"max_latency_ms":158923,"minimum_quality":0.8385},"task":{"ambiguity":0.4481,"category":"review","complexity":0.5842,"consequence":0.6999,"evidence_need":0.6249,"family":"policy_compliance","input_tokens":7600,"reversibility":0.6618,"risk":0.7111,"summary":"Identify evidence required before approving streaming inference for production."},"workers":[{"credits_per_call":3.089,"id":"worker_a","p95_latency_ms":73029,"pass_rate":0.7374,"provider_group":"provider_y","quality":0.8634,"strengths":["drafting","reasoning","review","writing"]},{"credits_per_call":0.802,"id":"worker_b","p95_latency_ms":19535,"pass_rate":0.5416,"provider_group":"provider_z","quality":0.7794,"strengths":["coding","drafting","speed"]},{"credits_per_call":13.9,"id":"worker_c","p95_latency_ms":52369,"pass_rate":0.995,"provider_group":"provider_x","quality":0.9103,"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":20.926,"max_latency_ms":227461,"minimum_quality":0.7948},"task":{"ambiguity":0.4491,"category":"coding","complexity":0.9339,"consequence":0.4184,"evidence_need":0.7066,"family":"migration_planning","input_tokens":7320,"reversibility":0.6457,"risk":0.5997,"summary":"Review a staged migration for access control and identify irreversible steps."},"workers":[{"credits_per_call":3.305,"id":"worker_a","p95_latency_ms":49450,"pass_rate":0.855,"provider_group":"provider_y","quality":0.8001,"strengths":["coding","reasoning","review","writing"]},{"credits_per_call":1.086,"id":"worker_b","p95_latency_ms":20240,"pass_rate":0.562,"provider_group":"provider_x","quality":0.6751,"strengths":["coding","drafting","speed"]},{"credits_per_call":13.499,"id":"worker_c","p95_latency_ms":87331,"pass_rate":0.9251,"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":19.773,"max_latency_ms":210780,"minimum_quality":0.8563},"task":{"ambiguity":0.4316,"category":"coding","complexity":0.8634,"consequence":0.6855,"evidence_need":0.6058,"family":"migration_planning","input_tokens":1320,"reversibility":0.4361,"risk":0.7163,"summary":"Review a staged migration for background jobs and identify irreversible steps."},"workers":[{"credits_per_call":3.534,"id":"worker_a","p95_latency_ms":76108,"pass_rate":0.8169,"provider_group":"provider_z","quality":0.8093,"strengths":["coding","reasoning","review","writing"]},{"credits_per_call":1.082,"id":"worker_b","p95_latency_ms":28093,"pass_rate":0.5886,"provider_group":"provider_y","quality":0.7805,"strengths":["coding","drafting","speed"]},{"credits_per_call":13.769,"id":"worker_c","p95_latency_ms":61094,"pass_rate":0.8879,"provider_group":"provider_x","quality":0.9766,"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":17.07,"max_latency_ms":189393,"minimum_quality":0.8672},"task":{"ambiguity":0.7467,"category":"analysis","complexity":0.8883,"consequence":0.3032,"evidence_need":0.4453,"family":"performance_tuning","input_tokens":2480,"reversibility":0.5891,"risk":0.2261,"summary":"Diagnose latency variance in webhook delivery and rank the next experiments."},"workers":[{"credits_per_call":11.036,"id":"worker_a","p95_latency_ms":81816,"pass_rate":0.995,"provider_group":"provider_y","quality":0.995,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":0.992,"id":"worker_b","p95_latency_ms":29693,"pass_rate":0.3946,"provider_group":"provider_x","quality":0.6573,"strengths":["coding","drafting","speed"]},{"credits_per_call":3.65,"id":"worker_c","p95_latency_ms":78405,"pass_rate":0.879,"provider_group":"provider_z","quality":0.9542,"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":20.005,"max_latency_ms":200549,"minimum_quality":0.7619},"task":{"ambiguity":0.7725,"category":"review","complexity":0.6117,"consequence":0.6932,"evidence_need":0.9181,"family":"policy_compliance","input_tokens":7160,"reversibility":0.4443,"risk":0.8026,"summary":"Identify evidence required before approving data retention for production."},"workers":[{"credits_per_call":14.033,"id":"worker_a","p95_latency_ms":74693,"pass_rate":0.8862,"provider_group":"provider_y","quality":0.9643,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":0.889,"id":"worker_b","p95_latency_ms":32558,"pass_rate":0.6057,"provider_group":"provider_z","quality":0.803,"strengths":["coding","drafting","speed"]},{"credits_per_call":2.775,"id":"worker_c","p95_latency_ms":75372,"pass_rate":0.8439,"provider_group":"provider_x","quality":0.8275,"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":2,"max_credits":15.725,"max_latency_ms":166044,"minimum_quality":0.8615},"task":{"ambiguity":0.4721,"category":"coding","complexity":0.5832,"consequence":0.5851,"evidence_need":0.7095,"family":"migration_planning","input_tokens":7880,"reversibility":0.6411,"risk":0.421,"summary":"Review a staged migration for deployment rollback and identify irreversible steps."},"workers":[{"credits_per_call":3.602,"id":"worker_a","p95_latency_ms":49826,"pass_rate":0.8143,"provider_group":"provider_x","quality":0.8024,"strengths":["reasoning","review","writing"]},{"credits_per_call":0.948,"id":"worker_b","p95_latency_ms":19882,"pass_rate":0.4652,"provider_group":"provider_y","quality":0.7327,"strengths":["coding","drafting","speed"]},{"credits_per_call":10.846,"id":"worker_c","p95_latency_ms":56445,"pass_rate":0.995,"provider_group":"provider_z","quality":0.9714,"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":3.476,"max_latency_ms":40197,"minimum_quality":0.7419},"task":{"ambiguity":0.4307,"category":"analysis","complexity":0.6513,"consequence":0.6239,"evidence_need":0.5092,"family":"performance_tuning","input_tokens":2560,"reversibility":0.7149,"risk":0.2899,"summary":"Diagnose latency variance in prompt caching and rank the next experiments."},"workers":[{"credits_per_call":12.25,"id":"worker_a","p95_latency_ms":83741,"pass_rate":0.995,"provider_group":"provider_y","quality":0.995,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":3.81,"id":"worker_b","p95_latency_ms":64863,"pass_rate":0.8318,"provider_group":"provider_z","quality":0.9535,"strengths":["reasoning","review","writing"]},{"credits_per_call":0.866,"id":"worker_c","p95_latency_ms":27056,"pass_rate":0.4693,"provider_group":"provider_x","quality":0.6791,"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":21.455,"max_latency_ms":157770,"minimum_quality":0.8365},"task":{"ambiguity":0.6273,"category":"review","complexity":0.6318,"consequence":0.8583,"evidence_need":0.8873,"family":"policy_compliance","input_tokens":2080,"reversibility":0.4341,"risk":0.6566,"summary":"Review whether tenant-scoped caching satisfies a documented retention policy."},"workers":[{"credits_per_call":12.196,"id":"worker_a","p95_latency_ms":69083,"pass_rate":0.9889,"provider_group":"provider_z","quality":0.995,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":3.027,"id":"worker_b","p95_latency_ms":44877,"pass_rate":0.7339,"provider_group":"provider_x","quality":0.7948,"strengths":["reasoning","review","writing"]},{"credits_per_call":1.114,"id":"worker_c","p95_latency_ms":29280,"pass_rate":0.4551,"provider_group":"provider_y","quality":0.7066,"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":7.01,"max_latency_ms":170784,"minimum_quality":0.8261},"task":{"ambiguity":0.3493,"category":"coding","complexity":0.6287,"consequence":0.8361,"evidence_need":0.5298,"family":"migration_planning","input_tokens":7480,"reversibility":0.5355,"risk":0.3978,"summary":"Plan a zero-downtime migration of streaming inference with rollback checkpoints."},"workers":[{"credits_per_call":4.146,"id":"worker_a","p95_latency_ms":61788,"pass_rate":0.7468,"provider_group":"provider_z","quality":0.8682,"strengths":["reasoning","review","writing"]},{"credits_per_call":14.502,"id":"worker_b","p95_latency_ms":78107,"pass_rate":0.8871,"provider_group":"provider_y","quality":0.9638,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":1.019,"id":"worker_c","p95_latency_ms":23006,"pass_rate":0.4769,"provider_group":"provider_x","quality":0.7342,"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":9.966,"max_latency_ms":212417,"minimum_quality":0.8428},"task":{"ambiguity":0.5346,"category":"review","complexity":0.8134,"consequence":0.8477,"evidence_need":0.647,"family":"policy_compliance","input_tokens":5520,"reversibility":0.605,"risk":0.82,"summary":"Review whether usage metering satisfies a documented retention policy."},"workers":[{"credits_per_call":1.03,"id":"worker_a","p95_latency_ms":29508,"pass_rate":0.4941,"provider_group":"provider_y","quality":0.6827,"strengths":["coding","drafting","speed"]},{"credits_per_call":4.118,"id":"worker_b","p95_latency_ms":70667,"pass_rate":0.7798,"provider_group":"provider_x","quality":0.8499,"strengths":["drafting","reasoning","review","writing"]},{"credits_per_call":10.867,"id":"worker_c","p95_latency_ms":74771,"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":18.951,"max_latency_ms":222163,"minimum_quality":0.8675},"task":{"ambiguity":0.6572,"category":"analysis","complexity":0.6533,"consequence":0.3239,"evidence_need":0.7374,"family":"performance_tuning","input_tokens":4520,"reversibility":0.739,"risk":0.3484,"summary":"Diagnose latency variance in data retention and rank the next experiments."},"workers":[{"credits_per_call":3.708,"id":"worker_a","p95_latency_ms":75680,"pass_rate":0.9146,"provider_group":"provider_y","quality":0.9197,"strengths":["reasoning","review","writing"]},{"credits_per_call":12.439,"id":"worker_b","p95_latency_ms":64170,"pass_rate":0.995,"provider_group":"provider_x","quality":0.995,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":0.906,"id":"worker_c","p95_latency_ms":27755,"pass_rate":0.4198,"provider_group":"provider_z","quality":0.6975,"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":23.836,"max_latency_ms":173006,"minimum_quality":0.8028},"task":{"ambiguity":0.7379,"category":"coding","complexity":0.5981,"consequence":0.6684,"evidence_need":0.7787,"family":"migration_planning","input_tokens":7360,"reversibility":0.3342,"risk":0.4741,"summary":"Design compatibility testing for a model routing schema migration."},"workers":[{"credits_per_call":15.364,"id":"worker_a","p95_latency_ms":67022,"pass_rate":0.995,"provider_group":"provider_x","quality":0.9468,"strengths":["coding","implementation","reasoning","synthesis"]},{"credits_per_call":4.221,"id":"worker_b","p95_latency_ms":79194,"pass_rate":0.8433,"provider_group":"provider_y","quality":0.8256,"strengths":["reasoning","review","writing"]},{"credits_per_call":0.823,"id":"worker_c","p95_latency_ms":20089,"pass_rate":0.5517,"provider_group":"provider_z","quality":0.7646,"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.506,"max_latency_ms":196645,"minimum_quality":0.8206},"task":{"ambiguity":0.6504,"category":"review","complexity":0.7643,"consequence":0.6692,"evidence_need":0.7834,"family":"policy_compliance","input_tokens":840,"reversibility":0.6345,"risk":0.7834,"summary":"Review whether prompt caching satisfies a documented retention policy."},"workers":[{"credits_per_call":10.39,"id":"worker_a","p95_latency_ms":56584,"pass_rate":0.995,"provider_group":"provider_z","quality":0.9781,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":3.267,"id":"worker_b","p95_latency_ms":49988,"pass_rate":0.7332,"provider_group":"provider_x","quality":0.9118,"strengths":["reasoning","review","writing"]},{"credits_per_call":1.099,"id":"worker_c","p95_latency_ms":29912,"pass_rate":0.5263,"provider_group":"provider_y","quality":0.6836,"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.792,"max_latency_ms":31843,"minimum_quality":0.5006},"task":{"ambiguity":0.616,"category":"review","complexity":0.7939,"consequence":0.7164,"evidence_need":0.5677,"family":"policy_compliance","input_tokens":8000,"reversibility":0.4578,"risk":0.6027,"summary":"Audit a workflow for API-key rotation against explicit access requirements."},"workers":[{"credits_per_call":1.191,"id":"worker_a","p95_latency_ms":19336,"pass_rate":0.4987,"provider_group":"provider_y","quality":0.6892,"strengths":["coding","drafting","speed"]},{"credits_per_call":3.143,"id":"worker_b","p95_latency_ms":63550,"pass_rate":0.7672,"provider_group":"provider_x","quality":0.8269,"strengths":["reasoning","review","writing"]},{"credits_per_call":11.101,"id":"worker_c","p95_latency_ms":52102,"pass_rate":0.995,"provider_group":"provider_z","quality":0.9285,"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.925,"max_latency_ms":51902,"minimum_quality":0.5345},"task":{"ambiguity":0.3406,"category":"analysis","complexity":0.7267,"consequence":0.6165,"evidence_need":0.3281,"family":"performance_tuning","input_tokens":6240,"reversibility":0.6864,"risk":0.2301,"summary":"Review a proposed optimization for usage metering for hidden regressions."},"workers":[{"credits_per_call":0.942,"id":"worker_a","p95_latency_ms":30170,"pass_rate":0.5093,"provider_group":"provider_z","quality":0.6547,"strengths":["coding","drafting","speed"]},{"credits_per_call":3.349,"id":"worker_b","p95_latency_ms":76700,"pass_rate":0.8792,"provider_group":"provider_y","quality":0.8816,"strengths":["reasoning","review","writing"]},{"credits_per_call":12.643,"id":"worker_c","p95_latency_ms":64491,"pass_rate":0.9723,"provider_group":"provider_x","quality":0.9933,"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.788,"max_latency_ms":195870,"minimum_quality":0.8643},"task":{"ambiguity":0.6772,"category":"review","complexity":0.7286,"consequence":0.9044,"evidence_need":0.5728,"family":"policy_compliance","input_tokens":2360,"reversibility":0.4884,"risk":0.6433,"summary":"Review whether background jobs satisfies a documented retention policy."},"workers":[{"credits_per_call":0.866,"id":"worker_a","p95_latency_ms":26454,"pass_rate":0.5178,"provider_group":"provider_z","quality":0.7058,"strengths":["coding","drafting","speed"]},{"credits_per_call":12.587,"id":"worker_b","p95_latency_ms":52837,"pass_rate":0.9044,"provider_group":"provider_x","quality":0.9568,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":3.663,"id":"worker_c","p95_latency_ms":65960,"pass_rate":0.7497,"provider_group":"provider_y","quality":0.8205,"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.722,"max_latency_ms":40756,"minimum_quality":0.4854},"task":{"ambiguity":0.4353,"category":"coding","complexity":0.7875,"consequence":0.7939,"evidence_need":0.5973,"family":"migration_planning","input_tokens":3120,"reversibility":0.3538,"risk":0.6364,"summary":"Design compatibility testing for a private credentials schema migration."},"workers":[{"credits_per_call":1.109,"id":"worker_a","p95_latency_ms":25018,"pass_rate":0.4815,"provider_group":"provider_x","quality":0.7133,"strengths":["coding","drafting","speed"]},{"credits_per_call":3.323,"id":"worker_b","p95_latency_ms":56648,"pass_rate":0.8715,"provider_group":"provider_y","quality":0.8623,"strengths":["reasoning","review","writing"]},{"credits_per_call":15.219,"id":"worker_c","p95_latency_ms":63808,"pass_rate":0.995,"provider_group":"provider_z","quality":0.9458,"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":1,"max_credits":3.155,"max_latency_ms":53057,"minimum_quality":0.6547},"task":{"ambiguity":0.772,"category":"review","complexity":0.8269,"consequence":0.7589,"evidence_need":0.6956,"family":"policy_compliance","input_tokens":280,"reversibility":0.5018,"risk":0.7413,"summary":"Audit a workflow for private credentials against explicit access requirements."},"workers":[{"credits_per_call":10.283,"id":"worker_a","p95_latency_ms":51357,"pass_rate":0.9701,"provider_group":"provider_x","quality":0.9697,"strengths":["drafting","implementation","reasoning","synthesis"]},{"credits_per_call":3.972,"id":"worker_b","p95_latency_ms":52618,"pass_rate":0.8516,"provider_group":"provider_z","quality":0.8454,"strengths":["reasoning","review","writing"]},{"credits_per_call":0.961,"id":"worker_c","p95_latency_ms":31852,"pass_rate":0.4525,"provider_group":"provider_y","quality":0.7212,"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.647,"max_latency_ms":48937,"minimum_quality":0.7689},"task":{"ambiguity":0.4362,"category":"analysis","complexity":0.4546,"consequence":0.567,"evidence_need":0.4402,"family":"performance_tuning","input_tokens":3240,"reversibility":0.781,"risk":0.3312,"summary":"Choose between throughput and tail-latency changes for OAuth callbacks."},"workers":[{"credits_per_call":1.018,"id":"worker_a","p95_latency_ms":31904,"pass_rate":0.5247,"provider_group":"provider_z","quality":0.6636,"strengths":["coding","drafting","reasoning","speed"]},{"credits_per_call":13.528,"id":"worker_b","p95_latency_ms":90420,"pass_rate":0.995,"provider_group":"provider_x","quality":0.995,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":3.072,"id":"worker_c","p95_latency_ms":51067,"pass_rate":0.7851,"provider_group":"provider_y","quality":0.9318,"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":17.684,"max_latency_ms":230469,"minimum_quality":0.9282},"task":{"ambiguity":0.687,"category":"coding","complexity":0.6319,"consequence":0.6749,"evidence_need":0.6004,"family":"migration_planning","input_tokens":4640,"reversibility":0.4607,"risk":0.5184,"summary":"Review a staged migration for rate limiting and identify irreversible steps."},"workers":[{"credits_per_call":4.016,"id":"worker_a","p95_latency_ms":77269,"pass_rate":0.7637,"provider_group":"provider_y","quality":0.8714,"strengths":["reasoning","review","writing"]},{"credits_per_call":0.833,"id":"worker_b","p95_latency_ms":20984,"pass_rate":0.5425,"provider_group":"provider_x","quality":0.7909,"strengths":["coding","drafting","speed"]},{"credits_per_call":10.477,"id":"worker_c","p95_latency_ms":68696,"pass_rate":0.9686,"provider_group":"provider_z","quality":0.9478,"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":2.995,"max_latency_ms":57344,"minimum_quality":0.6203},"task":{"ambiguity":0.4606,"category":"analysis","complexity":0.8366,"consequence":0.5774,"evidence_need":0.324,"family":"performance_tuning","input_tokens":6360,"reversibility":0.5959,"risk":0.5869,"summary":"Choose between throughput and tail-latency changes for usage metering."},"workers":[{"credits_per_call":3.424,"id":"worker_a","p95_latency_ms":54346,"pass_rate":0.8047,"provider_group":"provider_y","quality":0.9371,"strengths":["reasoning","review","writing"]},{"credits_per_call":13.03,"id":"worker_b","p95_latency_ms":69335,"pass_rate":0.995,"provider_group":"provider_x","quality":0.995,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":0.889,"id":"worker_c","p95_latency_ms":29510,"pass_rate":0.4403,"provider_group":"provider_z","quality":0.6571,"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.547,"max_latency_ms":156574,"minimum_quality":0.8767},"task":{"ambiguity":0.6168,"category":"analysis","complexity":0.8274,"consequence":0.2826,"evidence_need":0.6339,"family":"performance_tuning","input_tokens":7960,"reversibility":0.6991,"risk":0.2847,"summary":"Diagnose latency variance in prompt caching and rank the next experiments."},"workers":[{"credits_per_call":10.639,"id":"worker_a","p95_latency_ms":77963,"pass_rate":0.995,"provider_group":"provider_x","quality":0.995,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":2.776,"id":"worker_b","p95_latency_ms":51646,"pass_rate":0.9388,"provider_group":"provider_y","quality":0.938,"strengths":["reasoning","review","writing"]},{"credits_per_call":1.048,"id":"worker_c","p95_latency_ms":19449,"pass_rate":0.4591,"provider_group":"provider_z","quality":0.7174,"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":2,"max_credits":20.563,"max_latency_ms":155526,"minimum_quality":0.7675},"task":{"ambiguity":0.6336,"category":"coding","complexity":0.6649,"consequence":0.6679,"evidence_need":0.7886,"family":"migration_planning","input_tokens":2240,"reversibility":0.4875,"risk":0.3826,"summary":"Design compatibility testing for a rate limiting schema migration."},"workers":[{"credits_per_call":1.179,"id":"worker_a","p95_latency_ms":28598,"pass_rate":0.4522,"provider_group":"provider_z","quality":0.7874,"strengths":["coding","drafting","speed"]},{"credits_per_call":12.183,"id":"worker_b","p95_latency_ms":84577,"pass_rate":0.9486,"provider_group":"provider_y","quality":0.9664,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":3.717,"id":"worker_c","p95_latency_ms":56355,"pass_rate":0.7732,"provider_group":"provider_x","quality":0.8767,"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":21.532,"max_latency_ms":254088,"minimum_quality":0.8936},"task":{"ambiguity":0.4921,"category":"review","complexity":0.5336,"consequence":0.7145,"evidence_need":0.7147,"family":"policy_compliance","input_tokens":7120,"reversibility":0.3803,"risk":0.6005,"summary":"Review whether schema evolution satisfies a documented retention policy."},"workers":[{"credits_per_call":12.256,"id":"worker_a","p95_latency_ms":68767,"pass_rate":0.9089,"provider_group":"provider_z","quality":0.995,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":3.641,"id":"worker_b","p95_latency_ms":81638,"pass_rate":0.7939,"provider_group":"provider_x","quality":0.906,"strengths":["drafting","reasoning","review","writing"]},{"credits_per_call":1.143,"id":"worker_c","p95_latency_ms":32655,"pass_rate":0.5704,"provider_group":"provider_y","quality":0.7758,"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":2.566,"max_latency_ms":37152,"minimum_quality":0.626},"task":{"ambiguity":0.7067,"category":"review","complexity":0.6073,"consequence":0.6891,"evidence_need":0.829,"family":"policy_compliance","input_tokens":4320,"reversibility":0.6272,"risk":0.5742,"summary":"Identify evidence required before approving API-key rotation for production."},"workers":[{"credits_per_call":1.199,"id":"worker_a","p95_latency_ms":19799,"pass_rate":0.5997,"provider_group":"provider_z","quality":0.7305,"strengths":["coding","drafting","speed"]},{"credits_per_call":2.733,"id":"worker_b","p95_latency_ms":78097,"pass_rate":0.8222,"provider_group":"provider_x","quality":0.814,"strengths":["drafting","reasoning","review","writing"]},{"credits_per_call":12.758,"id":"worker_c","p95_latency_ms":55331,"pass_rate":0.995,"provider_group":"provider_y","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":21.043,"max_latency_ms":232359,"minimum_quality":0.9125},"task":{"ambiguity":0.5463,"category":"coding","complexity":0.6667,"consequence":0.6668,"evidence_need":0.789,"family":"migration_planning","input_tokens":5440,"reversibility":0.3208,"risk":0.3998,"summary":"Plan a zero-downtime migration of data retention with rollback checkpoints."},"workers":[{"credits_per_call":12.866,"id":"worker_a","p95_latency_ms":74154,"pass_rate":0.8989,"provider_group":"provider_z","quality":0.9682,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":3.233,"id":"worker_b","p95_latency_ms":69313,"pass_rate":0.8829,"provider_group":"provider_y","quality":0.8566,"strengths":["reasoning","review","writing"]},{"credits_per_call":0.908,"id":"worker_c","p95_latency_ms":24940,"pass_rate":0.5315,"provider_group":"provider_x","quality":0.7978,"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":23.704,"max_latency_ms":212596,"minimum_quality":0.883},"task":{"ambiguity":0.3844,"category":"coding","complexity":0.812,"consequence":0.5204,"evidence_need":0.6472,"family":"migration_planning","input_tokens":4520,"reversibility":0.4825,"risk":0.6284,"summary":"Review a staged migration for credit reservation and identify irreversible steps."},"workers":[{"credits_per_call":1.214,"id":"worker_a","p95_latency_ms":32714,"pass_rate":0.6028,"provider_group":"provider_x","quality":0.7232,"strengths":["coding","drafting","speed"]},{"credits_per_call":12.722,"id":"worker_b","p95_latency_ms":51906,"pass_rate":0.995,"provider_group":"provider_z","quality":0.9361,"strengths":["coding","implementation","reasoning","synthesis"]},{"credits_per_call":4.255,"id":"worker_c","p95_latency_ms":64066,"pass_rate":0.7871,"provider_group":"provider_y","quality":0.8028,"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":2,"max_credits":6.902,"max_latency_ms":221346,"minimum_quality":0.8797},"task":{"ambiguity":0.6445,"category":"analysis","complexity":0.8977,"consequence":0.6287,"evidence_need":0.7393,"family":"performance_tuning","input_tokens":4120,"reversibility":0.881,"risk":0.5208,"summary":"Review a proposed optimization for webhook delivery for hidden regressions."},"workers":[{"credits_per_call":13.568,"id":"worker_a","p95_latency_ms":88029,"pass_rate":0.9889,"provider_group":"provider_y","quality":0.995,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":1.154,"id":"worker_b","p95_latency_ms":29887,"pass_rate":0.5547,"provider_group":"provider_z","quality":0.7283,"strengths":["coding","drafting","speed"]},{"credits_per_call":3.884,"id":"worker_c","p95_latency_ms":46743,"pass_rate":0.8117,"provider_group":"provider_x","quality":0.9412,"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.73,"max_latency_ms":31088,"minimum_quality":0.6734},"task":{"ambiguity":0.605,"category":"review","complexity":0.6317,"consequence":0.5596,"evidence_need":0.6453,"family":"policy_compliance","input_tokens":920,"reversibility":0.3338,"risk":0.8145,"summary":"Review whether credit reservation satisfies a documented retention policy."},"workers":[{"credits_per_call":12.129,"id":"worker_a","p95_latency_ms":58683,"pass_rate":0.995,"provider_group":"provider_y","quality":0.995,"strengths":["drafting","implementation","reasoning","synthesis"]},{"credits_per_call":1.196,"id":"worker_b","p95_latency_ms":21725,"pass_rate":0.6069,"provider_group":"provider_z","quality":0.7296,"strengths":["coding","drafting","speed"]},{"credits_per_call":3.493,"id":"worker_c","p95_latency_ms":66359,"pass_rate":0.7485,"provider_group":"provider_x","quality":0.8971,"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.353,"max_latency_ms":31553,"minimum_quality":0.5248},"task":{"ambiguity":0.6104,"category":"review","complexity":0.6865,"consequence":0.7431,"evidence_need":0.6674,"family":"policy_compliance","input_tokens":1280,"reversibility":0.6553,"risk":0.47,"summary":"Audit a workflow for streaming inference against explicit access requirements."},"workers":[{"credits_per_call":15.398,"id":"worker_a","p95_latency_ms":65268,"pass_rate":0.9353,"provider_group":"provider_y","quality":0.995,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":3.223,"id":"worker_b","p95_latency_ms":50412,"pass_rate":0.7893,"provider_group":"provider_z","quality":0.8608,"strengths":["reasoning","review","writing"]},{"credits_per_call":0.826,"id":"worker_c","p95_latency_ms":24325,"pass_rate":0.5311,"provider_group":"provider_x","quality":0.7235,"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":16.61,"max_latency_ms":228081,"minimum_quality":0.8166},"task":{"ambiguity":0.3527,"category":"analysis","complexity":0.7925,"consequence":0.6962,"evidence_need":0.3108,"family":"performance_tuning","input_tokens":7200,"reversibility":0.5591,"risk":0.4047,"summary":"Diagnose latency variance in webhook delivery and rank the next experiments."},"workers":[{"credits_per_call":11.041,"id":"worker_a","p95_latency_ms":79035,"pass_rate":0.995,"provider_group":"provider_z","quality":0.995,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":3.227,"id":"worker_b","p95_latency_ms":54741,"pass_rate":0.7845,"provider_group":"provider_y","quality":0.9817,"strengths":["reasoning","review","writing"]},{"credits_per_call":0.877,"id":"worker_c","p95_latency_ms":24775,"pass_rate":0.5026,"provider_group":"provider_x","quality":0.725,"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":2,"max_credits":5.882,"max_latency_ms":116709,"minimum_quality":0.734},"task":{"ambiguity":0.3748,"category":"coding","complexity":0.8344,"consequence":0.6602,"evidence_need":0.7136,"family":"migration_planning","input_tokens":5680,"reversibility":0.3829,"risk":0.6279,"summary":"Design compatibility testing for a private credentials schema migration."},"workers":[{"credits_per_call":3.062,"id":"worker_a","p95_latency_ms":78019,"pass_rate":0.8494,"provider_group":"provider_z","quality":0.8612,"strengths":["coding","reasoning","review","writing"]},{"credits_per_call":0.899,"id":"worker_b","p95_latency_ms":23652,"pass_rate":0.4605,"provider_group":"provider_y","quality":0.799,"strengths":["coding","drafting","speed"]},{"credits_per_call":10.676,"id":"worker_c","p95_latency_ms":67606,"pass_rate":0.9053,"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":18.793,"max_latency_ms":162471,"minimum_quality":0.8237},"task":{"ambiguity":0.37,"category":"analysis","complexity":0.8831,"consequence":0.6891,"evidence_need":0.6536,"family":"performance_tuning","input_tokens":960,"reversibility":0.7617,"risk":0.4441,"summary":"Diagnose latency variance in database failover and rank the next experiments."},"workers":[{"credits_per_call":9.969,"id":"worker_a","p95_latency_ms":61044,"pass_rate":0.995,"provider_group":"provider_z","quality":0.995,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":0.822,"id":"worker_b","p95_latency_ms":27920,"pass_rate":0.4078,"provider_group":"provider_x","quality":0.6812,"strengths":["coding","drafting","reasoning","speed"]},{"credits_per_call":2.936,"id":"worker_c","p95_latency_ms":67555,"pass_rate":0.8092,"provider_group":"provider_y","quality":0.9309,"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":19.1,"max_latency_ms":214493,"minimum_quality":0.8601},"task":{"ambiguity":0.4438,"category":"analysis","complexity":0.8838,"consequence":0.5381,"evidence_need":0.5419,"family":"performance_tuning","input_tokens":6680,"reversibility":0.8306,"risk":0.4094,"summary":"Review a proposed optimization for streaming inference for hidden regressions."},"workers":[{"credits_per_call":3.706,"id":"worker_a","p95_latency_ms":61484,"pass_rate":0.7899,"provider_group":"provider_y","quality":0.9768,"strengths":["reasoning","review","writing"]},{"credits_per_call":0.856,"id":"worker_b","p95_latency_ms":31725,"pass_rate":0.3867,"provider_group":"provider_x","quality":0.6855,"strengths":["coding","drafting","reasoning","speed"]},{"credits_per_call":11.462,"id":"worker_c","p95_latency_ms":90277,"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":1,"max_credits":2.146,"max_latency_ms":42757,"minimum_quality":0.5956},"task":{"ambiguity":0.7321,"category":"analysis","complexity":0.7388,"consequence":0.2559,"evidence_need":0.3256,"family":"performance_tuning","input_tokens":5480,"reversibility":0.6426,"risk":0.4808,"summary":"Review a proposed optimization for streaming inference for hidden regressions."},"workers":[{"credits_per_call":3.469,"id":"worker_a","p95_latency_ms":59314,"pass_rate":0.8405,"provider_group":"provider_x","quality":0.9685,"strengths":["reasoning","review","writing"]},{"credits_per_call":0.788,"id":"worker_b","p95_latency_ms":24002,"pass_rate":0.4814,"provider_group":"provider_y","quality":0.7274,"strengths":["coding","drafting","speed"]},{"credits_per_call":13.749,"id":"worker_c","p95_latency_ms":82015,"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":2,"max_credits":2.94,"max_latency_ms":41465,"minimum_quality":0.703},"task":{"ambiguity":0.4501,"category":"analysis","complexity":0.8919,"consequence":0.3712,"evidence_need":0.4918,"family":"performance_tuning","input_tokens":5920,"reversibility":0.8362,"risk":0.3142,"summary":"Review a proposed optimization for provider failover for hidden regressions."},"workers":[{"credits_per_call":11.196,"id":"worker_a","p95_latency_ms":79670,"pass_rate":0.995,"provider_group":"provider_z","quality":0.9839,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":2.772,"id":"worker_b","p95_latency_ms":46114,"pass_rate":0.9129,"provider_group":"provider_y","quality":0.9372,"strengths":["reasoning","review","writing"]},{"credits_per_call":1.039,"id":"worker_c","p95_latency_ms":30225,"pass_rate":0.4747,"provider_group":"provider_x","quality":0.7229,"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":21.052,"max_latency_ms":167246,"minimum_quality":0.8625},"task":{"ambiguity":0.5632,"category":"coding","complexity":0.702,"consequence":0.6347,"evidence_need":0.4289,"family":"migration_planning","input_tokens":6640,"reversibility":0.6183,"risk":0.6413,"summary":"Design compatibility testing for a artifact storage schema migration."},"workers":[{"credits_per_call":11.153,"id":"worker_a","p95_latency_ms":52423,"pass_rate":0.9697,"provider_group":"provider_x","quality":0.9829,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":3.348,"id":"worker_b","p95_latency_ms":49697,"pass_rate":0.8079,"provider_group":"provider_z","quality":0.8026,"strengths":["reasoning","review","writing"]},{"credits_per_call":1.015,"id":"worker_c","p95_latency_ms":21200,"pass_rate":0.5702,"provider_group":"provider_y","quality":0.7599,"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=