# Constrained pairwise fixture composer

Build-time release reference. Runtime readiness, deployment, payment settlement and external indexing are not evaluated here. Prices are proposed; this file cannot authorize execution or payment.

Generate concrete rows covering every pair with a feasible complete assignment under bounded forbidden tuples, with exhaustive-coverage certificate and deterministic greedy ties. No minimum-suite or target-behavior claim.

Release: 0.29.0. Built: 2026-10-06T15:38:00Z.

## Choose for
- Ordered finite factors with literal forbidden tuples; caller separately runs tests

## Outside this profile
- Minimum test suites, arbitrary SAT predicates, unlimited Cartesian products or bug-finding guarantees
- Execute target code, call APIs, fetch data, run external agents, mutate accounts or deploy

Proposed nominal USD 0.01 per successful call; payer fees excluded. No verified runtime availability.

- [Exact release contract](/reference/services/pairwise-cases-compose.json)
- [Input schema](/reference/schemas/pairwise-cases-compose.input.json)
- [Output schema](/reference/schemas/pairwise-cases-compose.output.json)
- [Fixed example](/reference/examples/pairwise-cases-compose.json)
- [Complete HTML reference](/discover/tools/pairwise-cases-compose)