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.694,"max_latency_ms":159149,"minimum_quality":0.9123},"task":{"ambiguity":0.5036,"category":"analysis","complexity":0.8881,"consequence":0.3858,"evidence_need":0.7097,"family":"performance_tuning","input_tokens":5280,"reversibility":0.8995,"risk":0.2854,"summary":"Diagnose latency variance in model routing and rank the next experiments."},"workers":[{"credits_per_call":0.989,"id":"worker_a","p95_latency_ms":19291,"pass_rate":0.4252,"provider_group":"provider_z","quality":0.7267,"strengths":["coding","drafting","reasoning","speed"]},{"credits_per_call":2.895,"id":"worker_b","p95_latency_ms":72073,"pass_rate":0.8799,"provider_group":"provider_y","quality":0.9348,"strengths":["reasoning","review","writing"]},{"credits_per_call":11.765,"id":"worker_c","p95_latency_ms":61915,"pass_rate":0.995,"provider_group":"provider_x","quality":0.995,"strengths":["implementation","reasoning","synthesis"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":2,"max_credits":3.168,"max_latency_ms":52638,"minimum_quality":0.5297},"task":{"ambiguity":0.5061,"category":"review","complexity":0.8375,"consequence":0.6808,"evidence_need":0.654,"family":"policy_compliance","input_tokens":3280,"reversibility":0.4189,"risk":0.6961,"summary":"Review whether schema evolution satisfies a documented retention policy."},"workers":[{"credits_per_call":12.937,"id":"worker_a","p95_latency_ms":85369,"pass_rate":0.8988,"provider_group":"provider_x","quality":0.9104,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":3.839,"id":"worker_b","p95_latency_ms":53381,"pass_rate":0.7951,"provider_group":"provider_z","quality":0.8057,"strengths":["reasoning","review","writing"]},{"credits_per_call":0.958,"id":"worker_c","p95_latency_ms":26444,"pass_rate":0.5216,"provider_group":"provider_y","quality":0.759,"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.698,"max_latency_ms":33083,"minimum_quality":0.5722},"task":{"ambiguity":0.6457,"category":"coding","complexity":0.8153,"consequence":0.5079,"evidence_need":0.7225,"family":"migration_planning","input_tokens":3640,"reversibility":0.3742,"risk":0.5651,"summary":"Review a staged migration for rate limiting and identify irreversible steps."},"workers":[{"credits_per_call":1.068,"id":"worker_a","p95_latency_ms":24332,"pass_rate":0.5121,"provider_group":"provider_x","quality":0.702,"strengths":["coding","drafting","speed"]},{"credits_per_call":4.063,"id":"worker_b","p95_latency_ms":64659,"pass_rate":0.8764,"provider_group":"provider_z","quality":0.8096,"strengths":["reasoning","review","writing"]},{"credits_per_call":13.508,"id":"worker_c","p95_latency_ms":58808,"pass_rate":0.9772,"provider_group":"provider_y","quality":0.995,"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=

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":3,"max_credits":6.068,"max_latency_ms":194768,"minimum_quality":0.8998},"task":{"ambiguity":0.6777,"category":"coding","complexity":0.8549,"consequence":0.8252,"evidence_need":0.84,"family":"migration_planning","input_tokens":3400,"reversibility":0.4395,"risk":0.582,"summary":"Review a staged migration for artifact storage and identify irreversible steps."},"workers":[{"credits_per_call":14.737,"id":"worker_a","p95_latency_ms":78835,"pass_rate":0.8933,"provider_group":"provider_z","quality":0.9533,"strengths":["coding","implementation","reasoning","synthesis"]},{"credits_per_call":3.982,"id":"worker_b","p95_latency_ms":69059,"pass_rate":0.8505,"provider_group":"provider_x","quality":0.7973,"strengths":["coding","reasoning","review","writing"]},{"credits_per_call":0.84,"id":"worker_c","p95_latency_ms":21725,"pass_rate":0.4656,"provider_group":"provider_y","quality":0.6773,"strengths":["coding","drafting","speed"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":3,"max_credits":22.943,"max_latency_ms":202292,"minimum_quality":0.8128},"task":{"ambiguity":0.4326,"category":"review","complexity":0.8435,"consequence":0.8675,"evidence_need":0.9014,"family":"policy_compliance","input_tokens":1200,"reversibility":0.631,"risk":0.4508,"summary":"Review whether data retention satisfies a documented retention policy."},"workers":[{"credits_per_call":14.037,"id":"worker_a","p95_latency_ms":63739,"pass_rate":0.9851,"provider_group":"provider_y","quality":0.922,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":1.095,"id":"worker_b","p95_latency_ms":30732,"pass_rate":0.5482,"provider_group":"provider_x","quality":0.7403,"strengths":["coding","drafting","speed"]},{"credits_per_call":2.997,"id":"worker_c","p95_latency_ms":79022,"pass_rate":0.8363,"provider_group":"provider_z","quality":0.9075,"strengths":["drafting","reasoning","review","writing"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":3,"max_credits":18.873,"max_latency_ms":192562,"minimum_quality":0.826},"task":{"ambiguity":0.4664,"category":"review","complexity":0.6526,"consequence":0.7964,"evidence_need":0.7866,"family":"policy_compliance","input_tokens":5160,"reversibility":0.6012,"risk":0.496,"summary":"Identify evidence required before approving provider failover for production."},"workers":[{"credits_per_call":3.03,"id":"worker_a","p95_latency_ms":45037,"pass_rate":0.8595,"provider_group":"provider_y","quality":0.8437,"strengths":["drafting","reasoning","review","writing"]},{"credits_per_call":1.199,"id":"worker_b","p95_latency_ms":29947,"pass_rate":0.5382,"provider_group":"provider_z","quality":0.7468,"strengths":["coding","drafting","speed"]},{"credits_per_call":13.68,"id":"worker_c","p95_latency_ms":64997,"pass_rate":0.9802,"provider_group":"provider_x","quality":0.9588,"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":25.682,"max_latency_ms":218968,"minimum_quality":0.8094},"task":{"ambiguity":0.7908,"category":"review","complexity":0.6708,"consequence":0.8907,"evidence_need":0.8425,"family":"policy_compliance","input_tokens":2560,"reversibility":0.5882,"risk":0.7625,"summary":"Identify evidence required before approving tenant-scoped caching for production."},"workers":[{"credits_per_call":2.794,"id":"worker_a","p95_latency_ms":67204,"pass_rate":0.7419,"provider_group":"provider_x","quality":0.7987,"strengths":["drafting","reasoning","review","writing"]},{"credits_per_call":1.214,"id":"worker_b","p95_latency_ms":25538,"pass_rate":0.5285,"provider_group":"provider_z","quality":0.6958,"strengths":["coding","drafting","speed"]},{"credits_per_call":14.724,"id":"worker_c","p95_latency_ms":83689,"pass_rate":0.9091,"provider_group":"provider_y","quality":0.9477,"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":3,"max_credits":18.458,"max_latency_ms":157047,"minimum_quality":0.8846},"task":{"ambiguity":0.6341,"category":"review","complexity":0.7452,"consequence":0.7882,"evidence_need":0.6059,"family":"policy_compliance","input_tokens":1360,"reversibility":0.5143,"risk":0.691,"summary":"Identify evidence required before approving prompt caching for production."},"workers":[{"credits_per_call":0.798,"id":"worker_a","p95_latency_ms":19767,"pass_rate":0.577,"provider_group":"provider_y","quality":0.6842,"strengths":["coding","drafting","speed"]},{"credits_per_call":3.101,"id":"worker_b","p95_latency_ms":47129,"pass_rate":0.7207,"provider_group":"provider_z","quality":0.7951,"strengths":["drafting","reasoning","review","writing"]},{"credits_per_call":10.929,"id":"worker_c","p95_latency_ms":49670,"pass_rate":0.995,"provider_group":"provider_x","quality":0.93,"strengths":["drafting","implementation","reasoning","synthesis"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":2,"max_credits":18.462,"max_latency_ms":242047,"minimum_quality":0.8686},"task":{"ambiguity":0.4981,"category":"analysis","complexity":0.6261,"consequence":0.3505,"evidence_need":0.5955,"family":"performance_tuning","input_tokens":2080,"reversibility":0.8276,"risk":0.4839,"summary":"Diagnose latency variance in credit reservation and rank the next experiments."},"workers":[{"credits_per_call":0.809,"id":"worker_a","p95_latency_ms":24407,"pass_rate":0.4949,"provider_group":"provider_z","quality":0.7391,"strengths":["coding","drafting","reasoning","speed"]},{"credits_per_call":3.331,"id":"worker_b","p95_latency_ms":72029,"pass_rate":0.7985,"provider_group":"provider_x","quality":0.9008,"strengths":["reasoning","review","writing"]},{"credits_per_call":10.72,"id":"worker_c","p95_latency_ms":82172,"pass_rate":0.9775,"provider_group":"provider_y","quality":0.995,"strengths":["implementation","reasoning","synthesis"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":1,"max_credits":3.45,"max_latency_ms":35029,"minimum_quality":0.6671},"task":{"ambiguity":0.4378,"category":"coding","complexity":0.6212,"consequence":0.5939,"evidence_need":0.6184,"family":"migration_planning","input_tokens":1440,"reversibility":0.5579,"risk":0.5688,"summary":"Design compatibility testing for a artifact storage schema migration."},"workers":[{"credits_per_call":2.76,"id":"worker_a","p95_latency_ms":71224,"pass_rate":0.8204,"provider_group":"provider_y","quality":0.8802,"strengths":["coding","reasoning","review","writing"]},{"credits_per_call":12.116,"id":"worker_b","p95_latency_ms":50221,"pass_rate":0.995,"provider_group":"provider_x","quality":0.9589,"strengths":["coding","implementation","reasoning","synthesis"]},{"credits_per_call":0.892,"id":"worker_c","p95_latency_ms":30242,"pass_rate":0.5774,"provider_group":"provider_z","quality":0.7766,"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":10.963,"max_latency_ms":123282,"minimum_quality":0.7912},"task":{"ambiguity":0.4373,"category":"coding","complexity":0.9278,"consequence":0.4455,"evidence_need":0.7346,"family":"migration_planning","input_tokens":2120,"reversibility":0.4406,"risk":0.731,"summary":"Review a staged migration for webhook delivery and identify irreversible steps."},"workers":[{"credits_per_call":3.45,"id":"worker_a","p95_latency_ms":70646,"pass_rate":0.8604,"provider_group":"provider_x","quality":0.9043,"strengths":["reasoning","review","writing"]},{"credits_per_call":1.216,"id":"worker_b","p95_latency_ms":32101,"pass_rate":0.5535,"provider_group":"provider_z","quality":0.7737,"strengths":["coding","drafting","speed"]},{"credits_per_call":12.946,"id":"worker_c","p95_latency_ms":76408,"pass_rate":0.924,"provider_group":"provider_y","quality":0.995,"strengths":["implementation","reasoning","synthesis"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":1,"max_credits":3.645,"max_latency_ms":42550,"minimum_quality":0.647},"task":{"ambiguity":0.5086,"category":"coding","complexity":0.6365,"consequence":0.4006,"evidence_need":0.6609,"family":"migration_planning","input_tokens":6320,"reversibility":0.4984,"risk":0.6222,"summary":"Plan a zero-downtime migration of API-key rotation with rollback checkpoints."},"workers":[{"credits_per_call":2.829,"id":"worker_a","p95_latency_ms":72813,"pass_rate":0.7419,"provider_group":"provider_z","quality":0.8685,"strengths":["reasoning","review","writing"]},{"credits_per_call":0.912,"id":"worker_b","p95_latency_ms":25860,"pass_rate":0.4741,"provider_group":"provider_x","quality":0.7618,"strengths":["coding","drafting","speed"]},{"credits_per_call":10.531,"id":"worker_c","p95_latency_ms":83740,"pass_rate":0.9337,"provider_group":"provider_y","quality":0.9233,"strengths":["coding","implementation","reasoning","synthesis"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":3,"max_credits":21.506,"max_latency_ms":227240,"minimum_quality":0.8922},"task":{"ambiguity":0.6802,"category":"review","complexity":0.8394,"consequence":0.8605,"evidence_need":0.8559,"family":"policy_compliance","input_tokens":1440,"reversibility":0.485,"risk":0.4928,"summary":"Review whether artifact storage satisfies a documented retention policy."},"workers":[{"credits_per_call":3.704,"id":"worker_a","p95_latency_ms":47323,"pass_rate":0.8694,"provider_group":"provider_x","quality":0.8851,"strengths":["drafting","reasoning","review","writing"]},{"credits_per_call":1.191,"id":"worker_b","p95_latency_ms":28903,"pass_rate":0.5226,"provider_group":"provider_z","quality":0.7575,"strengths":["coding","drafting","speed"]},{"credits_per_call":14.784,"id":"worker_c","p95_latency_ms":90786,"pass_rate":0.995,"provider_group":"provider_y","quality":0.9387,"strengths":["drafting","implementation","reasoning","synthesis"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":1,"max_credits":2.507,"max_latency_ms":51801,"minimum_quality":0.5495},"task":{"ambiguity":0.4892,"category":"coding","complexity":0.6518,"consequence":0.4421,"evidence_need":0.5606,"family":"migration_planning","input_tokens":5680,"reversibility":0.4008,"risk":0.4819,"summary":"Plan a zero-downtime migration of prompt caching with rollback checkpoints."},"workers":[{"credits_per_call":3.407,"id":"worker_a","p95_latency_ms":68403,"pass_rate":0.8704,"provider_group":"provider_y","quality":0.8871,"strengths":["coding","reasoning","review","writing"]},{"credits_per_call":1.133,"id":"worker_b","p95_latency_ms":26427,"pass_rate":0.5062,"provider_group":"provider_x","quality":0.8043,"strengths":["coding","drafting","speed"]},{"credits_per_call":13.062,"id":"worker_c","p95_latency_ms":57925,"pass_rate":0.9578,"provider_group":"provider_z","quality":0.9156,"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.171,"max_latency_ms":220632,"minimum_quality":0.9487},"task":{"ambiguity":0.3477,"category":"coding","complexity":0.8192,"consequence":0.4417,"evidence_need":0.623,"family":"migration_planning","input_tokens":6440,"reversibility":0.315,"risk":0.7137,"summary":"Design compatibility testing for a model routing schema migration."},"workers":[{"credits_per_call":3.077,"id":"worker_a","p95_latency_ms":48162,"pass_rate":0.7526,"provider_group":"provider_x","quality":0.8452,"strengths":["reasoning","review","writing"]},{"credits_per_call":13.77,"id":"worker_b","p95_latency_ms":86574,"pass_rate":0.9171,"provider_group":"provider_z","quality":0.995,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":0.885,"id":"worker_c","p95_latency_ms":23357,"pass_rate":0.545,"provider_group":"provider_y","quality":0.7912,"strengths":["coding","drafting","speed"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":3,"max_credits":17.831,"max_latency_ms":227888,"minimum_quality":0.8463},"task":{"ambiguity":0.6072,"category":"coding","complexity":0.7453,"consequence":0.5216,"evidence_need":0.7184,"family":"migration_planning","input_tokens":5000,"reversibility":0.2687,"risk":0.5022,"summary":"Design compatibility testing for a provider failover schema migration."},"workers":[{"credits_per_call":10.53,"id":"worker_a","p95_latency_ms":89632,"pass_rate":0.9934,"provider_group":"provider_y","quality":0.995,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":4.001,"id":"worker_b","p95_latency_ms":66067,"pass_rate":0.7473,"provider_group":"provider_z","quality":0.8262,"strengths":["reasoning","review","writing"]},{"credits_per_call":0.782,"id":"worker_c","p95_latency_ms":29607,"pass_rate":0.546,"provider_group":"provider_x","quality":0.7573,"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":13.004,"max_latency_ms":128853,"minimum_quality":0.7432},"task":{"ambiguity":0.5237,"category":"coding","complexity":0.7961,"consequence":0.811,"evidence_need":0.7099,"family":"migration_planning","input_tokens":7160,"reversibility":0.3285,"risk":0.4811,"summary":"Design compatibility testing for a rate limiting schema migration."},"workers":[{"credits_per_call":4.182,"id":"worker_a","p95_latency_ms":49160,"pass_rate":0.8764,"provider_group":"provider_y","quality":0.8013,"strengths":["reasoning","review","writing"]},{"credits_per_call":10.869,"id":"worker_b","p95_latency_ms":62310,"pass_rate":0.9433,"provider_group":"provider_x","quality":0.9471,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":0.885,"id":"worker_c","p95_latency_ms":31063,"pass_rate":0.5995,"provider_group":"provider_z","quality":0.801,"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.488,"max_latency_ms":205042,"minimum_quality":0.792},"task":{"ambiguity":0.4118,"category":"review","complexity":0.7515,"consequence":0.6921,"evidence_need":0.7518,"family":"policy_compliance","input_tokens":1440,"reversibility":0.348,"risk":0.6221,"summary":"Review whether artifact storage satisfies a documented retention policy."},"workers":[{"credits_per_call":12.556,"id":"worker_a","p95_latency_ms":64196,"pass_rate":0.8998,"provider_group":"provider_y","quality":0.995,"strengths":["drafting","implementation","reasoning","synthesis"]},{"credits_per_call":1.029,"id":"worker_b","p95_latency_ms":24002,"pass_rate":0.5162,"provider_group":"provider_x","quality":0.7666,"strengths":["coding","drafting","speed"]},{"credits_per_call":3.48,"id":"worker_c","p95_latency_ms":66958,"pass_rate":0.7666,"provider_group":"provider_z","quality":0.9105,"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.242,"max_latency_ms":38293,"minimum_quality":0.6104},"task":{"ambiguity":0.3715,"category":"coding","complexity":0.9129,"consequence":0.4644,"evidence_need":0.5729,"family":"migration_planning","input_tokens":3080,"reversibility":0.5601,"risk":0.44,"summary":"Plan a zero-downtime migration of observability with rollback checkpoints."},"workers":[{"credits_per_call":2.954,"id":"worker_a","p95_latency_ms":61955,"pass_rate":0.843,"provider_group":"provider_x","quality":0.8079,"strengths":["coding","reasoning","review","writing"]},{"credits_per_call":1.074,"id":"worker_b","p95_latency_ms":29623,"pass_rate":0.5353,"provider_group":"provider_z","quality":0.752,"strengths":["coding","drafting","speed"]},{"credits_per_call":13.761,"id":"worker_c","p95_latency_ms":70104,"pass_rate":0.9077,"provider_group":"provider_y","quality":0.9148,"strengths":["coding","implementation","reasoning","synthesis"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":3,"max_credits":26.052,"max_latency_ms":164617,"minimum_quality":0.9103},"task":{"ambiguity":0.796,"category":"review","complexity":0.6333,"consequence":0.6484,"evidence_need":0.8608,"family":"policy_compliance","input_tokens":4840,"reversibility":0.387,"risk":0.7749,"summary":"Identify evidence required before approving private credentials for production."},"workers":[{"credits_per_call":3.583,"id":"worker_a","p95_latency_ms":78431,"pass_rate":0.7276,"provider_group":"provider_z","quality":0.9225,"strengths":["drafting","reasoning","review","writing"]},{"credits_per_call":14.704,"id":"worker_b","p95_latency_ms":53052,"pass_rate":0.995,"provider_group":"provider_x","quality":0.995,"strengths":["drafting","implementation","reasoning","synthesis"]},{"credits_per_call":0.911,"id":"worker_c","p95_latency_ms":29169,"pass_rate":0.5538,"provider_group":"provider_y","quality":0.7675,"strengths":["coding","drafting","speed"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":3,"max_credits":22.332,"max_latency_ms":208227,"minimum_quality":0.931},"task":{"ambiguity":0.666,"category":"coding","complexity":0.9048,"consequence":0.7765,"evidence_need":0.407,"family":"migration_planning","input_tokens":3960,"reversibility":0.2853,"risk":0.7332,"summary":"Plan a zero-downtime migration of prompt caching with rollback checkpoints."},"workers":[{"credits_per_call":4.225,"id":"worker_a","p95_latency_ms":81290,"pass_rate":0.8372,"provider_group":"provider_x","quality":0.8172,"strengths":["reasoning","review","writing"]},{"credits_per_call":13.604,"id":"worker_b","p95_latency_ms":66004,"pass_rate":0.995,"provider_group":"provider_y","quality":0.9197,"strengths":["coding","implementation","reasoning","synthesis"]},{"credits_per_call":1.217,"id":"worker_c","p95_latency_ms":30950,"pass_rate":0.5757,"provider_group":"provider_z","quality":0.8027,"strengths":["coding","drafting","speed"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":3,"max_credits":17.054,"max_latency_ms":151471,"minimum_quality":0.849},"task":{"ambiguity":0.5646,"category":"coding","complexity":0.7881,"consequence":0.6454,"evidence_need":0.5141,"family":"migration_planning","input_tokens":6440,"reversibility":0.5717,"risk":0.6444,"summary":"Design compatibility testing for a database failover schema migration."},"workers":[{"credits_per_call":9.955,"id":"worker_a","p95_latency_ms":55720,"pass_rate":0.995,"provider_group":"provider_z","quality":0.9638,"strengths":["coding","implementation","reasoning","synthesis"]},{"credits_per_call":1.147,"id":"worker_b","p95_latency_ms":22212,"pass_rate":0.5477,"provider_group":"provider_y","quality":0.7435,"strengths":["coding","drafting","speed"]},{"credits_per_call":2.985,"id":"worker_c","p95_latency_ms":49693,"pass_rate":0.8194,"provider_group":"provider_x","quality":0.8331,"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":14.373,"max_latency_ms":236325,"minimum_quality":0.8795},"task":{"ambiguity":0.6979,"category":"review","complexity":0.4885,"consequence":0.9055,"evidence_need":0.9205,"family":"policy_compliance","input_tokens":2760,"reversibility":0.3113,"risk":0.5117,"summary":"Audit a workflow for database failover against explicit access requirements."},"workers":[{"credits_per_call":10.774,"id":"worker_a","p95_latency_ms":67921,"pass_rate":0.9355,"provider_group":"provider_z","quality":0.995,"strengths":["drafting","implementation","reasoning","synthesis"]},{"credits_per_call":4.256,"id":"worker_b","p95_latency_ms":77058,"pass_rate":0.8649,"provider_group":"provider_x","quality":0.8444,"strengths":["reasoning","review","writing"]},{"credits_per_call":0.957,"id":"worker_c","p95_latency_ms":23626,"pass_rate":0.5682,"provider_group":"provider_y","quality":0.7561,"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":8.894,"max_latency_ms":148465,"minimum_quality":0.833},"task":{"ambiguity":0.7509,"category":"review","complexity":0.503,"consequence":0.7145,"evidence_need":0.8543,"family":"policy_compliance","input_tokens":6760,"reversibility":0.661,"risk":0.5499,"summary":"Review whether background jobs satisfies a documented retention policy."},"workers":[{"credits_per_call":0.803,"id":"worker_a","p95_latency_ms":27863,"pass_rate":0.4762,"provider_group":"provider_z","quality":0.7453,"strengths":["coding","drafting","speed"]},{"credits_per_call":3.018,"id":"worker_b","p95_latency_ms":64934,"pass_rate":0.7659,"provider_group":"provider_y","quality":0.818,"strengths":["reasoning","review","writing"]},{"credits_per_call":12.037,"id":"worker_c","p95_latency_ms":91626,"pass_rate":0.9051,"provider_group":"provider_x","quality":0.9909,"strengths":["drafting","implementation","reasoning","synthesis"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":1,"max_credits":3.369,"max_latency_ms":36626,"minimum_quality":0.6067},"task":{"ambiguity":0.6587,"category":"analysis","complexity":0.5993,"consequence":0.4142,"evidence_need":0.5826,"family":"performance_tuning","input_tokens":1520,"reversibility":0.6133,"risk":0.3815,"summary":"Review a proposed optimization for data retention for hidden regressions."},"workers":[{"credits_per_call":1.095,"id":"worker_a","p95_latency_ms":28472,"pass_rate":0.5492,"provider_group":"provider_z","quality":0.649,"strengths":["coding","drafting","reasoning","speed"]},{"credits_per_call":12.754,"id":"worker_b","p95_latency_ms":91242,"pass_rate":0.9893,"provider_group":"provider_y","quality":0.995,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":3.155,"id":"worker_c","p95_latency_ms":81193,"pass_rate":0.9209,"provider_group":"provider_x","quality":0.8729,"strengths":["reasoning","review","writing"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":3,"max_credits":16.605,"max_latency_ms":85431,"minimum_quality":0.7266},"task":{"ambiguity":0.7531,"category":"review","complexity":0.7026,"consequence":0.8925,"evidence_need":0.6394,"family":"policy_compliance","input_tokens":3920,"reversibility":0.6181,"risk":0.7245,"summary":"Identify evidence required before approving model routing for production."},"workers":[{"credits_per_call":11.942,"id":"worker_a","p95_latency_ms":57814,"pass_rate":0.995,"provider_group":"provider_z","quality":0.995,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":0.83,"id":"worker_b","p95_latency_ms":20521,"pass_rate":0.544,"provider_group":"provider_x","quality":0.7989,"strengths":["coding","drafting","speed"]},{"credits_per_call":4.174,"id":"worker_c","p95_latency_ms":63687,"pass_rate":0.8568,"provider_group":"provider_y","quality":0.8714,"strengths":["reasoning","review","writing"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":3,"max_credits":16.219,"max_latency_ms":154468,"minimum_quality":0.7208},"task":{"ambiguity":0.4302,"category":"coding","complexity":0.6956,"consequence":0.7224,"evidence_need":0.5436,"family":"migration_planning","input_tokens":3120,"reversibility":0.4064,"risk":0.6804,"summary":"Review a staged migration for credit reservation and identify irreversible steps."},"workers":[{"credits_per_call":3.218,"id":"worker_a","p95_latency_ms":52996,"pass_rate":0.8685,"provider_group":"provider_y","quality":0.8135,"strengths":["coding","reasoning","review","writing"]},{"credits_per_call":13.586,"id":"worker_b","p95_latency_ms":53208,"pass_rate":0.995,"provider_group":"provider_z","quality":0.995,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":0.801,"id":"worker_c","p95_latency_ms":32231,"pass_rate":0.5281,"provider_group":"provider_x","quality":0.7425,"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":15.145,"max_latency_ms":92005,"minimum_quality":0.7858},"task":{"ambiguity":0.5653,"category":"review","complexity":0.8085,"consequence":0.8883,"evidence_need":0.8894,"family":"policy_compliance","input_tokens":7120,"reversibility":0.3877,"risk":0.5287,"summary":"Audit a workflow for data retention against explicit access requirements."},"workers":[{"credits_per_call":12.002,"id":"worker_a","p95_latency_ms":59910,"pass_rate":0.995,"provider_group":"provider_y","quality":0.9646,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":1.008,"id":"worker_b","p95_latency_ms":24688,"pass_rate":0.5566,"provider_group":"provider_z","quality":0.7789,"strengths":["coding","drafting","speed"]},{"credits_per_call":2.782,"id":"worker_c","p95_latency_ms":53219,"pass_rate":0.8781,"provider_group":"provider_x","quality":0.8541,"strengths":["drafting","reasoning","review","writing"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":1,"max_credits":3.029,"max_latency_ms":42236,"minimum_quality":0.6009},"task":{"ambiguity":0.563,"category":"analysis","complexity":0.8092,"consequence":0.2951,"evidence_need":0.5894,"family":"performance_tuning","input_tokens":4560,"reversibility":0.8779,"risk":0.3193,"summary":"Diagnose latency variance in schema evolution and rank the next experiments."},"workers":[{"credits_per_call":11.333,"id":"worker_a","p95_latency_ms":76386,"pass_rate":0.995,"provider_group":"provider_y","quality":0.995,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":3.878,"id":"worker_b","p95_latency_ms":70971,"pass_rate":0.9009,"provider_group":"provider_x","quality":0.9109,"strengths":["reasoning","review","writing"]},{"credits_per_call":0.84,"id":"worker_c","p95_latency_ms":32472,"pass_rate":0.4297,"provider_group":"provider_z","quality":0.6415,"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":18.311,"max_latency_ms":221425,"minimum_quality":0.7096},"task":{"ambiguity":0.3838,"category":"analysis","complexity":0.7007,"consequence":0.5831,"evidence_need":0.5907,"family":"performance_tuning","input_tokens":680,"reversibility":0.5692,"risk":0.4008,"summary":"Choose between throughput and tail-latency changes for database failover."},"workers":[{"credits_per_call":0.783,"id":"worker_a","p95_latency_ms":30230,"pass_rate":0.5133,"provider_group":"provider_z","quality":0.6625,"strengths":["coding","drafting","reasoning","speed"]},{"credits_per_call":3.799,"id":"worker_b","p95_latency_ms":61818,"pass_rate":0.9366,"provider_group":"provider_x","quality":0.8906,"strengths":["reasoning","review","writing"]},{"credits_per_call":12.68,"id":"worker_c","p95_latency_ms":90397,"pass_rate":0.995,"provider_group":"provider_y","quality":0.995,"strengths":["implementation","reasoning","synthesis"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":2,"max_credits":11.759,"max_latency_ms":233081,"minimum_quality":0.7641},"task":{"ambiguity":0.6246,"category":"review","complexity":0.6462,"consequence":0.6262,"evidence_need":0.5549,"family":"policy_compliance","input_tokens":6000,"reversibility":0.4948,"risk":0.8142,"summary":"Review whether webhook delivery satisfies a documented retention policy."},"workers":[{"credits_per_call":15.344,"id":"worker_a","p95_latency_ms":89499,"pass_rate":0.921,"provider_group":"provider_x","quality":0.995,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":0.814,"id":"worker_b","p95_latency_ms":25739,"pass_rate":0.5796,"provider_group":"provider_z","quality":0.7938,"strengths":["coding","drafting","speed"]},{"credits_per_call":3.931,"id":"worker_c","p95_latency_ms":53220,"pass_rate":0.7711,"provider_group":"provider_y","quality":0.8765,"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.61,"max_latency_ms":30033,"minimum_quality":0.6907},"task":{"ambiguity":0.7424,"category":"analysis","complexity":0.805,"consequence":0.3473,"evidence_need":0.5023,"family":"performance_tuning","input_tokens":2520,"reversibility":0.8699,"risk":0.4159,"summary":"Review a proposed optimization for provider failover for hidden regressions."},"workers":[{"credits_per_call":0.846,"id":"worker_a","p95_latency_ms":19319,"pass_rate":0.4418,"provider_group":"provider_y","quality":0.6614,"strengths":["coding","drafting","speed"]},{"credits_per_call":3.305,"id":"worker_b","p95_latency_ms":74911,"pass_rate":0.7894,"provider_group":"provider_z","quality":0.9381,"strengths":["reasoning","review","writing"]},{"credits_per_call":9.959,"id":"worker_c","p95_latency_ms":59619,"pass_rate":0.995,"provider_group":"provider_x","quality":0.995,"strengths":["implementation","reasoning","synthesis"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":1,"max_credits":1.565,"max_latency_ms":35666,"minimum_quality":0.7783},"task":{"ambiguity":0.562,"category":"coding","complexity":0.9429,"consequence":0.6319,"evidence_need":0.6947,"family":"migration_planning","input_tokens":6080,"reversibility":0.4081,"risk":0.3653,"summary":"Plan a zero-downtime migration of rate limiting with rollback checkpoints."},"workers":[{"credits_per_call":12.117,"id":"worker_a","p95_latency_ms":89002,"pass_rate":0.9304,"provider_group":"provider_x","quality":0.995,"strengths":["coding","implementation","reasoning","synthesis"]},{"credits_per_call":3.018,"id":"worker_b","p95_latency_ms":75073,"pass_rate":0.8491,"provider_group":"provider_y","quality":0.8808,"strengths":["reasoning","review","writing"]},{"credits_per_call":0.792,"id":"worker_c","p95_latency_ms":18098,"pass_rate":0.5248,"provider_group":"provider_z","quality":0.6944,"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.194,"max_latency_ms":116969,"minimum_quality":0.7899},"task":{"ambiguity":0.6279,"category":"review","complexity":0.7511,"consequence":0.6559,"evidence_need":0.6583,"family":"policy_compliance","input_tokens":4400,"reversibility":0.3746,"risk":0.5135,"summary":"Identify evidence required before approving data retention for production."},"workers":[{"credits_per_call":15.225,"id":"worker_a","p95_latency_ms":65106,"pass_rate":0.9322,"provider_group":"provider_x","quality":0.9421,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":1.004,"id":"worker_b","p95_latency_ms":20326,"pass_rate":0.4867,"provider_group":"provider_z","quality":0.6876,"strengths":["coding","drafting","speed"]},{"credits_per_call":3.141,"id":"worker_c","p95_latency_ms":71207,"pass_rate":0.735,"provider_group":"provider_y","quality":0.8816,"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":13.284,"max_latency_ms":250094,"minimum_quality":0.7496},"task":{"ambiguity":0.4906,"category":"coding","complexity":0.8387,"consequence":0.7516,"evidence_need":0.6683,"family":"migration_planning","input_tokens":6840,"reversibility":0.2703,"risk":0.4827,"summary":"Plan a zero-downtime migration of webhook delivery with rollback checkpoints."},"workers":[{"credits_per_call":13.611,"id":"worker_a","p95_latency_ms":79848,"pass_rate":0.995,"provider_group":"provider_x","quality":0.9422,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":3.281,"id":"worker_b","p95_latency_ms":72354,"pass_rate":0.8361,"provider_group":"provider_z","quality":0.9221,"strengths":["coding","reasoning","review","writing"]},{"credits_per_call":1.017,"id":"worker_c","p95_latency_ms":26955,"pass_rate":0.5698,"provider_group":"provider_y","quality":0.6891,"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.863,"max_latency_ms":53025,"minimum_quality":0.5506},"task":{"ambiguity":0.5255,"category":"analysis","complexity":0.8225,"consequence":0.2511,"evidence_need":0.6274,"family":"performance_tuning","input_tokens":3440,"reversibility":0.7061,"risk":0.5263,"summary":"Choose between throughput and tail-latency changes for artifact storage."},"workers":[{"credits_per_call":11.118,"id":"worker_a","p95_latency_ms":77767,"pass_rate":0.995,"provider_group":"provider_z","quality":0.995,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":4.124,"id":"worker_b","p95_latency_ms":68075,"pass_rate":0.889,"provider_group":"provider_y","quality":0.859,"strengths":["reasoning","review","writing"]},{"credits_per_call":1.048,"id":"worker_c","p95_latency_ms":27328,"pass_rate":0.4625,"provider_group":"provider_x","quality":0.6217,"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":26.941,"max_latency_ms":181685,"minimum_quality":0.916},"task":{"ambiguity":0.6852,"category":"analysis","complexity":0.6471,"consequence":0.4754,"evidence_need":0.6693,"family":"performance_tuning","input_tokens":3520,"reversibility":0.7013,"risk":0.4535,"summary":"Review a proposed optimization for provider failover for hidden regressions."},"workers":[{"credits_per_call":1.004,"id":"worker_a","p95_latency_ms":29262,"pass_rate":0.4567,"provider_group":"provider_z","quality":0.694,"strengths":["coding","drafting","speed"]},{"credits_per_call":3.434,"id":"worker_b","p95_latency_ms":50324,"pass_rate":0.8657,"provider_group":"provider_y","quality":0.8696,"strengths":["reasoning","review","writing"]},{"credits_per_call":15.383,"id":"worker_c","p95_latency_ms":53622,"pass_rate":0.995,"provider_group":"provider_x","quality":0.995,"strengths":["implementation","reasoning","synthesis"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":3,"max_credits":9.053,"max_latency_ms":171405,"minimum_quality":0.8616},"task":{"ambiguity":0.4684,"category":"review","complexity":0.5806,"consequence":0.8168,"evidence_need":0.5607,"family":"policy_compliance","input_tokens":2160,"reversibility":0.5783,"risk":0.6172,"summary":"Review whether API-key rotation satisfies a documented retention policy."},"workers":[{"credits_per_call":1.182,"id":"worker_a","p95_latency_ms":29069,"pass_rate":0.5277,"provider_group":"provider_z","quality":0.7346,"strengths":["coding","drafting","speed"]},{"credits_per_call":15.201,"id":"worker_b","p95_latency_ms":49255,"pass_rate":0.995,"provider_group":"provider_x","quality":0.9807,"strengths":["drafting","implementation","reasoning","synthesis"]},{"credits_per_call":4.06,"id":"worker_c","p95_latency_ms":57653,"pass_rate":0.8721,"provider_group":"provider_y","quality":0.9058,"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":1.679,"max_latency_ms":27805,"minimum_quality":0.7425},"task":{"ambiguity":0.5579,"category":"coding","complexity":0.6492,"consequence":0.8161,"evidence_need":0.8298,"family":"migration_planning","input_tokens":4400,"reversibility":0.3613,"risk":0.371,"summary":"Review a staged migration for credit reservation and identify irreversible steps."},"workers":[{"credits_per_call":3.192,"id":"worker_a","p95_latency_ms":48677,"pass_rate":0.8579,"provider_group":"provider_x","quality":0.8982,"strengths":["reasoning","review","writing"]},{"credits_per_call":13.561,"id":"worker_b","p95_latency_ms":53979,"pass_rate":0.995,"provider_group":"provider_z","quality":0.9691,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":1.063,"id":"worker_c","p95_latency_ms":20340,"pass_rate":0.6056,"provider_group":"provider_y","quality":0.7316,"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":8.677,"max_latency_ms":192071,"minimum_quality":0.7503},"task":{"ambiguity":0.4699,"category":"review","complexity":0.4044,"consequence":0.7095,"evidence_need":0.5502,"family":"policy_compliance","input_tokens":2840,"reversibility":0.5794,"risk":0.5758,"summary":"Review whether background jobs satisfies a documented retention policy."},"workers":[{"credits_per_call":1.114,"id":"worker_a","p95_latency_ms":22542,"pass_rate":0.576,"provider_group":"provider_z","quality":0.6798,"strengths":["coding","drafting","speed"]},{"credits_per_call":14.361,"id":"worker_b","p95_latency_ms":84506,"pass_rate":0.9223,"provider_group":"provider_y","quality":0.9117,"strengths":["drafting","implementation","reasoning","synthesis"]},{"credits_per_call":2.842,"id":"worker_c","p95_latency_ms":75868,"pass_rate":0.8711,"provider_group":"provider_x","quality":0.8082,"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.085,"max_latency_ms":205506,"minimum_quality":0.7946},"task":{"ambiguity":0.7437,"category":"coding","complexity":0.6347,"consequence":0.5418,"evidence_need":0.4549,"family":"migration_planning","input_tokens":5960,"reversibility":0.5578,"risk":0.534,"summary":"Design compatibility testing for a database failover schema migration."},"workers":[{"credits_per_call":3.857,"id":"worker_a","p95_latency_ms":53362,"pass_rate":0.841,"provider_group":"provider_y","quality":0.8778,"strengths":["reasoning","review","writing"]},{"credits_per_call":10.03,"id":"worker_b","p95_latency_ms":76433,"pass_rate":0.953,"provider_group":"provider_x","quality":0.995,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":1.045,"id":"worker_c","p95_latency_ms":32675,"pass_rate":0.5961,"provider_group":"provider_z","quality":0.7664,"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.309,"max_latency_ms":171501,"minimum_quality":0.7838},"task":{"ambiguity":0.7223,"category":"coding","complexity":0.5789,"consequence":0.7183,"evidence_need":0.6645,"family":"migration_planning","input_tokens":7080,"reversibility":0.5054,"risk":0.5523,"summary":"Review a staged migration for usage metering and identify irreversible steps."},"workers":[{"credits_per_call":1.003,"id":"worker_a","p95_latency_ms":24421,"pass_rate":0.5155,"provider_group":"provider_y","quality":0.8004,"strengths":["coding","drafting","speed"]},{"credits_per_call":11.811,"id":"worker_b","p95_latency_ms":57769,"pass_rate":0.9637,"provider_group":"provider_x","quality":0.995,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":2.803,"id":"worker_c","p95_latency_ms":79581,"pass_rate":0.7377,"provider_group":"provider_z","quality":0.9029,"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":16.534,"max_latency_ms":209827,"minimum_quality":0.8987},"task":{"ambiguity":0.3702,"category":"analysis","complexity":0.8504,"consequence":0.3933,"evidence_need":0.7119,"family":"performance_tuning","input_tokens":6120,"reversibility":0.843,"risk":0.2711,"summary":"Diagnose latency variance in schema evolution and rank the next experiments."},"workers":[{"credits_per_call":10.613,"id":"worker_a","p95_latency_ms":82443,"pass_rate":0.995,"provider_group":"provider_y","quality":0.9924,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":1.149,"id":"worker_b","p95_latency_ms":26958,"pass_rate":0.492,"provider_group":"provider_x","quality":0.7259,"strengths":["coding","drafting","speed"]},{"credits_per_call":2.905,"id":"worker_c","p95_latency_ms":60487,"pass_rate":0.8537,"provider_group":"provider_z","quality":0.9086,"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":3.539,"max_latency_ms":34949,"minimum_quality":0.6986},"task":{"ambiguity":0.4337,"category":"coding","complexity":0.6833,"consequence":0.4623,"evidence_need":0.4532,"family":"migration_planning","input_tokens":400,"reversibility":0.2598,"risk":0.4403,"summary":"Design compatibility testing for a rate limiting schema migration."},"workers":[{"credits_per_call":2.968,"id":"worker_a","p95_latency_ms":72509,"pass_rate":0.7692,"provider_group":"provider_z","quality":0.8825,"strengths":["reasoning","review","writing"]},{"credits_per_call":1.079,"id":"worker_b","p95_latency_ms":22525,"pass_rate":0.4504,"provider_group":"provider_x","quality":0.7938,"strengths":["coding","drafting","speed"]},{"credits_per_call":10.451,"id":"worker_c","p95_latency_ms":51529,"pass_rate":0.9306,"provider_group":"provider_y","quality":0.9549,"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":5.489,"max_latency_ms":144746,"minimum_quality":0.7748},"task":{"ambiguity":0.5271,"category":"review","complexity":0.646,"consequence":0.8409,"evidence_need":0.6897,"family":"policy_compliance","input_tokens":3280,"reversibility":0.6248,"risk":0.7635,"summary":"Identify evidence required before approving webhook delivery for production."},"workers":[{"credits_per_call":0.921,"id":"worker_a","p95_latency_ms":30266,"pass_rate":0.5541,"provider_group":"provider_y","quality":0.7348,"strengths":["coding","drafting","speed"]},{"credits_per_call":2.995,"id":"worker_b","p95_latency_ms":71433,"pass_rate":0.7508,"provider_group":"provider_x","quality":0.8923,"strengths":["drafting","reasoning","review","writing"]},{"credits_per_call":13.243,"id":"worker_c","p95_latency_ms":55309,"pass_rate":0.995,"provider_group":"provider_z","quality":0.9823,"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":15.129,"max_latency_ms":248157,"minimum_quality":0.9592},"task":{"ambiguity":0.5257,"category":"coding","complexity":0.7102,"consequence":0.8006,"evidence_need":0.6159,"family":"migration_planning","input_tokens":1840,"reversibility":0.3678,"risk":0.517,"summary":"Review a staged migration for credit reservation and identify irreversible steps."},"workers":[{"credits_per_call":0.873,"id":"worker_a","p95_latency_ms":30239,"pass_rate":0.6091,"provider_group":"provider_y","quality":0.7352,"strengths":["coding","drafting","speed"]},{"credits_per_call":3.448,"id":"worker_b","p95_latency_ms":71134,"pass_rate":0.7963,"provider_group":"provider_z","quality":0.8408,"strengths":["reasoning","review","writing"]},{"credits_per_call":9.893,"id":"worker_c","p95_latency_ms":72325,"pass_rate":0.9454,"provider_group":"provider_x","quality":0.9661,"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.778,"max_latency_ms":240884,"minimum_quality":0.895},"task":{"ambiguity":0.3705,"category":"review","complexity":0.8476,"consequence":0.6212,"evidence_need":0.569,"family":"policy_compliance","input_tokens":7440,"reversibility":0.3944,"risk":0.8187,"summary":"Audit a workflow for API-key rotation against explicit access requirements."},"workers":[{"credits_per_call":10.293,"id":"worker_a","p95_latency_ms":89095,"pass_rate":0.995,"provider_group":"provider_z","quality":0.995,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":3.557,"id":"worker_b","p95_latency_ms":57555,"pass_rate":0.8283,"provider_group":"provider_x","quality":0.832,"strengths":["reasoning","review","writing"]},{"credits_per_call":0.962,"id":"worker_c","p95_latency_ms":24548,"pass_rate":0.451,"provider_group":"provider_y","quality":0.7593,"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.142,"max_latency_ms":162854,"minimum_quality":0.9305},"task":{"ambiguity":0.7268,"category":"review","complexity":0.5929,"consequence":0.5428,"evidence_need":0.6805,"family":"policy_compliance","input_tokens":5920,"reversibility":0.3255,"risk":0.7178,"summary":"Audit a workflow for access control against explicit access requirements."},"workers":[{"credits_per_call":3.814,"id":"worker_a","p95_latency_ms":44620,"pass_rate":0.7208,"provider_group":"provider_y","quality":0.887,"strengths":["reasoning","review","writing"]},{"credits_per_call":0.791,"id":"worker_b","p95_latency_ms":28656,"pass_rate":0.5547,"provider_group":"provider_z","quality":0.8006,"strengths":["coding","drafting","speed"]},{"credits_per_call":11.117,"id":"worker_c","p95_latency_ms":75133,"pass_rate":0.995,"provider_group":"provider_x","quality":0.9694,"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":10.795,"max_latency_ms":164766,"minimum_quality":0.8443},"task":{"ambiguity":0.5819,"category":"coding","complexity":0.7139,"consequence":0.7345,"evidence_need":0.7641,"family":"migration_planning","input_tokens":3480,"reversibility":0.3821,"risk":0.601,"summary":"Review a staged migration for rate limiting and identify irreversible steps."},"workers":[{"credits_per_call":1.017,"id":"worker_a","p95_latency_ms":20952,"pass_rate":0.5385,"provider_group":"provider_z","quality":0.7074,"strengths":["coding","drafting","speed"]},{"credits_per_call":3.42,"id":"worker_b","p95_latency_ms":78090,"pass_rate":0.8474,"provider_group":"provider_y","quality":0.8616,"strengths":["reasoning","review","writing"]},{"credits_per_call":11.726,"id":"worker_c","p95_latency_ms":77220,"pass_rate":0.9139,"provider_group":"provider_x","quality":0.974,"strengths":["implementation","reasoning","synthesis"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":2,"max_credits":15.953,"max_latency_ms":162782,"minimum_quality":0.8166},"task":{"ambiguity":0.5437,"category":"analysis","complexity":0.806,"consequence":0.2521,"evidence_need":0.5071,"family":"performance_tuning","input_tokens":280,"reversibility":0.5907,"risk":0.5392,"summary":"Choose between throughput and tail-latency changes for streaming inference."},"workers":[{"credits_per_call":1.019,"id":"worker_a","p95_latency_ms":30313,"pass_rate":0.4,"provider_group":"provider_y","quality":0.6361,"strengths":["coding","drafting","speed"]},{"credits_per_call":12.462,"id":"worker_b","p95_latency_ms":53285,"pass_rate":0.995,"provider_group":"provider_z","quality":0.995,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":2.957,"id":"worker_c","p95_latency_ms":53910,"pass_rate":0.7955,"provider_group":"provider_x","quality":0.869,"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.492,"max_latency_ms":42173,"minimum_quality":0.7271},"task":{"ambiguity":0.3857,"category":"review","complexity":0.4969,"consequence":0.7783,"evidence_need":0.7148,"family":"policy_compliance","input_tokens":7640,"reversibility":0.6393,"risk":0.6889,"summary":"Identify evidence required before approving OAuth callbacks for production."},"workers":[{"credits_per_call":2.798,"id":"worker_a","p95_latency_ms":62488,"pass_rate":0.8493,"provider_group":"provider_y","quality":0.8288,"strengths":["drafting","reasoning","review","writing"]},{"credits_per_call":11.673,"id":"worker_b","p95_latency_ms":64872,"pass_rate":0.9341,"provider_group":"provider_z","quality":0.9421,"strengths":["drafting","implementation","reasoning","synthesis"]},{"credits_per_call":1.164,"id":"worker_c","p95_latency_ms":21673,"pass_rate":0.5365,"provider_group":"provider_x","quality":0.686,"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.779,"max_latency_ms":39413,"minimum_quality":0.5458},"task":{"ambiguity":0.4489,"category":"coding","complexity":0.9007,"consequence":0.6805,"evidence_need":0.4787,"family":"migration_planning","input_tokens":360,"reversibility":0.3634,"risk":0.4718,"summary":"Review a staged migration for database failover and identify irreversible steps."},"workers":[{"credits_per_call":1.176,"id":"worker_a","p95_latency_ms":29960,"pass_rate":0.5786,"provider_group":"provider_x","quality":0.8047,"strengths":["coding","drafting","speed"]},{"credits_per_call":13.135,"id":"worker_b","p95_latency_ms":49495,"pass_rate":0.9563,"provider_group":"provider_z","quality":0.9653,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":3.194,"id":"worker_c","p95_latency_ms":77649,"pass_rate":0.8352,"provider_group":"provider_y","quality":0.83,"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":1.425,"max_latency_ms":39295,"minimum_quality":0.5639},"task":{"ambiguity":0.3491,"category":"coding","complexity":0.8359,"consequence":0.6481,"evidence_need":0.4856,"family":"migration_planning","input_tokens":2320,"reversibility":0.3028,"risk":0.6918,"summary":"Review a staged migration for deployment rollback and identify irreversible steps."},"workers":[{"credits_per_call":0.887,"id":"worker_a","p95_latency_ms":23961,"pass_rate":0.462,"provider_group":"provider_x","quality":0.7651,"strengths":["coding","drafting","speed"]},{"credits_per_call":13.182,"id":"worker_b","p95_latency_ms":64849,"pass_rate":0.995,"provider_group":"provider_y","quality":0.995,"strengths":["implementation","reasoning","synthesis"]},{"credits_per_call":3.784,"id":"worker_c","p95_latency_ms":67173,"pass_rate":0.8092,"provider_group":"provider_z","quality":0.8107,"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":10.203,"max_latency_ms":150236,"minimum_quality":0.8232},"task":{"ambiguity":0.4239,"category":"review","complexity":0.4831,"consequence":0.8799,"evidence_need":0.6895,"family":"policy_compliance","input_tokens":680,"reversibility":0.5262,"risk":0.5789,"summary":"Review whether prompt caching satisfies a documented retention policy."},"workers":[{"credits_per_call":3.545,"id":"worker_a","p95_latency_ms":63159,"pass_rate":0.7667,"provider_group":"provider_x","quality":0.8091,"strengths":["reasoning","review","writing"]},{"credits_per_call":0.956,"id":"worker_b","p95_latency_ms":23918,"pass_rate":0.5686,"provider_group":"provider_z","quality":0.6885,"strengths":["coding","drafting","speed"]},{"credits_per_call":14.606,"id":"worker_c","p95_latency_ms":50515,"pass_rate":0.9677,"provider_group":"provider_y","quality":0.9948,"strengths":["drafting","implementation","reasoning","synthesis"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":3,"max_credits":19.297,"max_latency_ms":206510,"minimum_quality":0.7873},"task":{"ambiguity":0.4491,"category":"analysis","complexity":0.6328,"consequence":0.261,"evidence_need":0.3483,"family":"performance_tuning","input_tokens":3640,"reversibility":0.6774,"risk":0.3601,"summary":"Review a proposed optimization for credit reservation for hidden regressions."},"workers":[{"credits_per_call":4.086,"id":"worker_a","p95_latency_ms":63733,"pass_rate":0.8595,"provider_group":"provider_x","quality":0.8996,"strengths":["reasoning","review","writing"]},{"credits_per_call":0.877,"id":"worker_b","p95_latency_ms":32277,"pass_rate":0.3921,"provider_group":"provider_z","quality":0.7268,"strengths":["coding","drafting","speed"]},{"credits_per_call":13.861,"id":"worker_c","p95_latency_ms":52266,"pass_rate":0.9506,"provider_group":"provider_y","quality":0.995,"strengths":["implementation","reasoning","synthesis"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":2,"max_credits":13.59,"max_latency_ms":135951,"minimum_quality":0.7031},"task":{"ambiguity":0.3151,"category":"analysis","complexity":0.8841,"consequence":0.446,"evidence_need":0.7226,"family":"performance_tuning","input_tokens":7480,"reversibility":0.7608,"risk":0.5987,"summary":"Choose between throughput and tail-latency changes for streaming inference."},"workers":[{"credits_per_call":1.019,"id":"worker_a","p95_latency_ms":23969,"pass_rate":0.511,"provider_group":"provider_z","quality":0.7166,"strengths":["coding","drafting","reasoning","speed"]},{"credits_per_call":3.525,"id":"worker_b","p95_latency_ms":55889,"pass_rate":0.934,"provider_group":"provider_x","quality":0.8803,"strengths":["reasoning","review","writing"]},{"credits_per_call":11.851,"id":"worker_c","p95_latency_ms":78853,"pass_rate":0.995,"provider_group":"provider_y","quality":0.995,"strengths":["implementation","reasoning","synthesis"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=


Prompt:
You are the Dot Loom conductor. Select the highest-utility execution plan that obeys all hard call, credit, and latency limits. Use cheap workers when sufficient. Require an independent provider when consequences and verification needs justify it. Return exactly one compact JSON object and no prose.
INPUT={"constraints":{"max_calls":2,"max_credits":5.414,"max_latency_ms":109116,"minimum_quality":0.8195},"task":{"ambiguity":0.7144,"category":"analysis","complexity":0.8996,"consequence":0.5457,"evidence_need":0.5069,"family":"performance_tuning","input_tokens":6240,"reversibility":0.7957,"risk":0.417,"summary":"Choose between throughput and tail-latency changes for observability."},"workers":[{"credits_per_call":3.891,"id":"worker_a","p95_latency_ms":67041,"pass_rate":0.7873,"provider_group":"provider_x","quality":0.9672,"strengths":["reasoning","review","writing"]},{"credits_per_call":1.032,"id":"worker_b","p95_latency_ms":30979,"pass_rate":0.5282,"provider_group":"provider_z","quality":0.6973,"strengths":["coding","drafting","reasoning","speed"]},{"credits_per_call":13.238,"id":"worker_c","p95_latency_ms":54948,"pass_rate":0.9574,"provider_group":"provider_y","quality":0.995,"strengths":["implementation","reasoning","synthesis"]}]}
OUTPUT_SCHEMA={"access":{"finalizer":[],"reviewer":[],"writer":[]},"estimated_credits":"number","estimated_latency_ms":"integer","estimated_pass_rate":"number","estimated_quality":"number","finalizer":"worker id|null","independent_verification":"boolean","max_calls":"integer","max_credits":"number","max_latency_ms":"integer","policy":"lean|balanced|strict","reason_codes":["bounded machine-readable codes"],"reviewer":"worker id|null","writer":"worker id"}
OUTPUT=