`n` structs each conforming to a shared interface. Stresses interface conformance checking / witness synthesis in the front end (compiled to a .slang-module so the signal is sema, not codegen). Scaling null: n scales conforming structs against ONE interface; ideal checking cost is O(n).
bucket: sema · mode: module · flags: (none)
compileInner split into phase buckets (named leaves + (self) residuals) stacked across the sweep sizes — the top edge is compileInner, so you can see which phase drives the scaling.
floor-subtracted power-law fit (t − floor) = a·Nk; floor = the minimal workload (fixed per-compile cost), k the global exponent, top-2× the local high-end doubling ratio.
| N range | floor (ms) | k (work) | fit R² | t(Nmin) | t(Nmax) | top-2× |
|---|---|---|---|---|---|---|
| 600–4800 | 9 | 1.06 | 0.999 | 76 | 616 | 2.16× |
compileInner grows by 541 ms across the sweep; the mutually-exclusive phase buckets below partition that growth exactly (no nested-timer double counting). × lin is the same metric as the top-level panels, per bucket: the end point vs a linear expectation anchored to the bucket's share of the minimal floor and fitted on the low-N half — 1.0 = grew exactly linearly, >1 bends up. The super-linearity lives where × lin (and k) are red.
| bucket | t@N=600 | t@N=4800 | Δ ms | share | × lin | ∝Nk |
|---|---|---|---|---|---|---|
| generateIR | 21 | 212 | +192 | 35% | 1.26× | 1.12 |
| generateOutput (self) | 18 | 184 | +166 | 31% | 1.32× | 1.16 |
| SemanticChecking | 32 | 179 | +147 | 27% | 0.89× | 0.90 |
| parseTranslationUnit | 4 | 37 | +33 | 6% | 1.06× | 1.04 |
Near-constant (≤2% of growth each): compileInner (self) (0→4 ms), frontEndExecute (self) (0→0 ms).
| N | compileInner | SemanticChecking | frontEndExecute |
|---|---|---|---|
| 600 | 76 | 32 | 57 |
| 1200 | 143 | 52 | 104 |
| 2400 | 286 | 95 | 203 |
| 4800 | 616 | 179 | 428 |