04 · Capital Systems Integrator (wiring synthesis)
Wiring synthesis
Can it route each signal along the cheapest path through a harness network with costed constraints?
Route signals through a meshed bundle network where bundles carry different costs per millimetre and crossing an inline connector costs extra, exactly the cost model Capital’s synthesis documents. The shortest path is often not the cheapest one.
Capital reference. How Synthesis Calculates the Cost of a Wiring Route for a Signal (systems-integrator/how-synthesis-calculates-the-cost-of-a-wiring-route-for-a-signal). This domain stands for the capability that article describes; the task gives the model the rules in full rather than testing whether it remembers Capital’s.
Not tested here. Splice and multicore creation during synthesis, bypass wiring, and modular (per-harness) synthesis.
Scale ladder. S: 8 nodes, 10 bundles, 4 signals · M: 16 nodes, 23 bundles, 10 signals · L: 28 nodes, 40 bundles, 24 signals.
Results
| Model | Verdict | S passed | M passed | L passed | Mean score |
|---|---|---|---|---|---|
| Claude Opus 5.5 | Ready | 3 / 3 | 3 / 3 | 3 / 3 | 100 |
| Claude Fable 5.1 | Ready | 3 / 3 | 3 / 3 | 3 / 3 | 100 |
| Claude Sonnet 5.5 | Assist | 3 / 3 | 2 / 3 | 2 / 3 | 98.9 |
Every trial
| Model | Size | Seed | Score | Checks | Time |
|---|---|---|---|---|---|
| Claude Fable 5.1 | L#0 | 3962244049 | 100 | cheapest routes: 24 of 24 routes optimal · valid routes: 24 of 24 routes connected and loop-free · stated cost: 24 of 24 stated costs match the route given | 41 s |
| Claude Fable 5.1 | L#1 | 3945466430 | 100 | cheapest routes: 24 of 24 routes optimal · valid routes: 24 of 24 routes connected and loop-free · stated cost: 24 of 24 stated costs match the route given | 35 s |
| Claude Fable 5.1 | L#2 | 3928688811 | 100 | cheapest routes: 24 of 24 routes optimal · valid routes: 24 of 24 routes connected and loop-free · stated cost: 24 of 24 stated costs match the route given | 40 s |
| Claude Fable 5.1 | M#0 | 4255649806 | 100 | cheapest routes: 10 of 10 routes optimal · valid routes: 10 of 10 routes connected and loop-free · stated cost: 10 of 10 stated costs match the route given | 18 s |
| Claude Fable 5.1 | M#1 | 4272427425 | 100 | cheapest routes: 10 of 10 routes optimal · valid routes: 10 of 10 routes connected and loop-free · stated cost: 10 of 10 stated costs match the route given | 20 s |
| Claude Fable 5.1 | M#2 | 4222094568 | 100 | cheapest routes: 10 of 10 routes optimal · valid routes: 10 of 10 routes connected and loop-free · stated cost: 10 of 10 stated costs match the route given | 19 s |
| Claude Fable 5.1 | S#0 | 715569604 | 100 | cheapest routes: 4 of 4 routes optimal · valid routes: 4 of 4 routes connected and loop-free · stated cost: 4 of 4 stated costs match the route given | 10 s |
| Claude Fable 5.1 | S#1 | 732347223 | 100 | cheapest routes: 4 of 4 routes optimal · valid routes: 4 of 4 routes connected and loop-free · stated cost: 4 of 4 stated costs match the route given | 9 s |
| Claude Fable 5.1 | S#2 | 749124842 | 100 | cheapest routes: 4 of 4 routes optimal · valid routes: 4 of 4 routes connected and loop-free · stated cost: 4 of 4 stated costs match the route given | 11 s |
| Claude Opus 5.5 | L#0 | 3962244049 | 100 | cheapest routes: 24 of 24 routes optimal · valid routes: 24 of 24 routes connected and loop-free · stated cost: 24 of 24 stated costs match the route given | 45 s |
| Claude Opus 5.5 | L#1 | 3945466430 | 100 | cheapest routes: 24 of 24 routes optimal · valid routes: 24 of 24 routes connected and loop-free · stated cost: 24 of 24 stated costs match the route given | 42 s |
| Claude Opus 5.5 | L#2 | 3928688811 | 100 | cheapest routes: 24 of 24 routes optimal · valid routes: 24 of 24 routes connected and loop-free · stated cost: 24 of 24 stated costs match the route given | 52 s |
| Claude Opus 5.5 | M#0 | 4255649806 | 100 | cheapest routes: 10 of 10 routes optimal · valid routes: 10 of 10 routes connected and loop-free · stated cost: 10 of 10 stated costs match the route given | 22 s |
| Claude Opus 5.5 | M#1 | 4272427425 | 100 | cheapest routes: 10 of 10 routes optimal · valid routes: 10 of 10 routes connected and loop-free · stated cost: 10 of 10 stated costs match the route given | 23 s |
| Claude Opus 5.5 | M#2 | 4222094568 | 100 | cheapest routes: 10 of 10 routes optimal · valid routes: 10 of 10 routes connected and loop-free · stated cost: 10 of 10 stated costs match the route given | 22 s |
| Claude Opus 5.5 | S#0 | 715569604 | 100 | cheapest routes: 4 of 4 routes optimal · valid routes: 4 of 4 routes connected and loop-free · stated cost: 4 of 4 stated costs match the route given | 13 s |
| Claude Opus 5.5 | S#1 | 732347223 | 100 | cheapest routes: 4 of 4 routes optimal · valid routes: 4 of 4 routes connected and loop-free · stated cost: 4 of 4 stated costs match the route given | 11 s |
| Claude Opus 5.5 | S#2 | 749124842 | 100 | cheapest routes: 4 of 4 routes optimal · valid routes: 4 of 4 routes connected and loop-free · stated cost: 4 of 4 stated costs match the route given | 12 s |
| Claude Sonnet 5.5 | L#0 | 3962244049 | 100 | cheapest routes: 24 of 24 routes optimal · valid routes: 24 of 24 routes connected and loop-free · stated cost: 24 of 24 stated costs match the route given | 34 s |
| Claude Sonnet 5.5 | L#1 | 3945466430 | 100 | cheapest routes: 24 of 24 routes optimal · valid routes: 24 of 24 routes connected and loop-free · stated cost: 24 of 24 stated costs match the route given | 27 s |
| Claude Sonnet 5.5 | L#2 | 3928688811 | 97.1 | cheapest routes: 23 of 24 routes optimal · valid routes: 24 of 24 routes connected and loop-free · stated cost: 24 of 24 stated costs match the route given | 27 s |
| Claude Sonnet 5.5 | M#0 | 4255649806 | 100 | cheapest routes: 10 of 10 routes optimal · valid routes: 10 of 10 routes connected and loop-free · stated cost: 10 of 10 stated costs match the route given | 11 s |
| Claude Sonnet 5.5 | M#1 | 4272427425 | 93 | cheapest routes: 9 of 10 routes optimal · valid routes: 10 of 10 routes connected and loop-free · stated cost: 10 of 10 stated costs match the route given | 12 s |
| Claude Sonnet 5.5 | M#2 | 4222094568 | 100 | cheapest routes: 10 of 10 routes optimal · valid routes: 10 of 10 routes connected and loop-free · stated cost: 10 of 10 stated costs match the route given | 12 s |
| Claude Sonnet 5.5 | S#0 | 715569604 | 100 | cheapest routes: 4 of 4 routes optimal · valid routes: 4 of 4 routes connected and loop-free · stated cost: 4 of 4 stated costs match the route given | 6 s |
| Claude Sonnet 5.5 | S#1 | 732347223 | 100 | cheapest routes: 4 of 4 routes optimal · valid routes: 4 of 4 routes connected and loop-free · stated cost: 4 of 4 stated costs match the route given | 5 s |
| Claude Sonnet 5.5 | S#2 | 749124842 | 100 | cheapest routes: 4 of 4 routes optimal · valid routes: 4 of 4 routes connected and loop-free · stated cost: 4 of 4 stated costs match the route given | 6 s |
What the model is asked
The small instance at seed 715569604, exactly as sent. Regenerate any instance with npm run sample -- synthesis M 2.
Show the prompt (1,478 characters)
TASK: Wiring synthesis.
Route each signal from its `from` node to its `to` node through the bundle network, choosing the CHEAPEST route.
Route cost = sum over the bundles used of (lengthMm x costPerMm) + inlineCost for every inline node the route passes THROUGH
(an inline node that is the start or end of the route is not charged). A route may not visit a node twice.
Bundles are undirected.
Inline nodes: ["N2","N7"]
inlineCost: 800
Bundles:
[
{"id":"BN1","a":"N1","b":"N2","lengthMm":230,"costPerMm":1.5},
{"id":"BN2","a":"N1","b":"N3","lengthMm":980,"costPerMm":1.5},
{"id":"BN3","a":"N3","b":"N4","lengthMm":870,"costPerMm":1},
{"id":"BN4","a":"N3","b":"N5","lengthMm":750,"costPerMm":3},
{"id":"BN5","a":"N4","b":"N6","lengthMm":750,"costPerMm":1},
{"id":"BN6","a":"N4","b":"N7","lengthMm":1120,"costPerMm":1.5},
{"id":"BN7","a":"N5","b":"N8","lengthMm":940,"costPerMm":1},
{"id":"BN8","a":"N1","b":"N5","lengthMm":280,"costPerMm":1},
{"id":"BN9","a":"N3","b":"N7","lengthMm":430,"costPerMm":1},
{"id":"BN10","a":"N6","b":"N1","lengthMm":1640,"costPerMm":1}
]
Signals:
[
{"id":"SIG1","from":"N5","to":"N4"},
{"id":"SIG2","from":"N3","to":"N6"},
{"id":"SIG3","from":"N5","to":"N8"},
{"id":"SIG4","from":"N6","to":"N1"}
]
Output format (JSON, exactly these keys):
```json
{
"routes": [
{
"signal": "SIG1",
"path": [
"N3",
"N7",
"N2"
],
"cost": 1840
}
]
}
```
path lists every node in order, including both ends.