P12 · Assembly knowledge node
Deterministic composition planner Retrieve candidates, eliminate incompatible sets mechanically, then let AI choose among feasible plans and write only bounded glue.
What we learned Current synthesis from the research packet. Exact records and complete source artifacts remain visible below.
Research conclusions Compose plan-then-fill: retrieve, eliminate incompatibilities deterministically, then let models choose among feasible options. Deterministic systems own identity, authority, compatibility, dependency and evidence gates. The composer must surface UNDERDETERMINED rather than invent compatibility. What it owns Demand-to-capability retrieval Port/dependency/namespace compatibility Packaging and runtime resolution Assembly graph and glue budget UNDERDETERMINED questions What research already tells us Phase 8 selected plan-then-fill over monolithic generation A model-free solver and 26 fixtures were designed Blocks can be fitted without AI once contracts and bindings are explicit Open first-principles questions What is the optimization objective? When should a whole service beat several blocks? Which fields are necessary for deterministic compatibility? How should optional recommendations be presented to the client? Inputs ProductSpec Capability shelf Archetype Host contracts Taste profile Outputs AssemblyPlan CompatibilityProof ClarifyingQuestions Agent-sized workstream Implement the model-free solver against synthetic service/module/package records and positive/negative fixtures.
Linked research Composition agent architecture research/actionmodel-builder-research-2026-08-26/phase-8/lanes/05-composition-agent-evals/outputs/composition-agent-architecture.mdComposition eval suite research/actionmodel-builder-research-2026-08-26/phase-8/lanes/05-composition-agent-evals/outputs/composition-eval-suite.jsonSynthetic pilot plan research/actionmodel-builder-research-2026-08-26/phase-8/lanes/05-composition-agent-evals/outputs/synthetic-pilot-plan.mdConnected knowledge nodes Where this beats a generator When a model both chooses the architecture and writes it, an incompatibility surfaces as a runtime bug the client pays to fix. Eliminating incompatible sets mechanically before any code is written means the failure mode becomes an UNDERDETERMINED question asked up front instead of a repair loop discovered later.
← P11 · Connector and external-action plane P13 · Preview, editor and change loop → Source: site/system-map/data/parts.json#P12 · preserved research datasets remain inline below their source-backed synthesis.