ruv db047e0bf2 fix(sota-bench): validate every Pareto axis, and drop to two objectives ... Audit of the new Pareto gate found its headline safety property was implemented for only one of its three axes, and that when the guard did fire it took the run down with it. `dominates` returned out of its comparison loop on the first axis where the candidate was worse, before `readObjective` ran on the remaining ones, so the non-finite guard only ever inspected an axis the loop reached. Through the real promotion rule, a candidate carrying NaN in `costPerWin`, NaN in `p99Us`, -Infinity in `costPerWin`, or simply MISSING the `p99Us` field -- which is the shape an older replay bundle carries -- each produced `{promote: true, reasons: []}`. Nothing else caught it: the cost rule compares with `>`, and `NaN > x` is false. Both existing tests put the bad value in `primary`, the one axis where the guard worked, so they appeared to protect the property and did not. `assertComparable` now pre-reads every objective of every point before any comparison, in `dominates`, `frontier` and `admitToFrontier`, and the latter validates frontier members too. When the guard fired it threw out of the promotion rule. `@metaharness/ flywheel` calls the rule without a try/catch in both `run.js` and inside `verifyReplayBundle`, so a bad objective aborted the generation loop in-run and, in replay, prevented the structured `checks` output from ever being produced. The same class of data therefore yielded either a silent promotion or a dead run, and never "reject this candidate." The gate call site now catches and pushes `non_finite_objective`; the pure API still throws, which is right for a library and wrong for a gate. THE THIRD AXIS IS REMOVED, reversing this PR's own framing. Dominance requires "no worse on every axis", so each added axis is one more chance for that condition to fail: a Pareto gate weakens monotonically as axes grow, and this one was described as tightening. `p99Us` was also not independent evidence -- it is already a factor of `costPerWin` (`memoryMb * p99Us / qps`) and a term inside `primary`'s `darwinScore`, so it bought no information while costing real blocking power. Concretely, a candidate burning ten times the memory to halve tail latency is dominated and blocked under two axes and sailed through under three. A test pins both halves so the frontier cannot quietly become a second cost gate. The candidate can no longer choose its own judges: the `frontier` field is removed from the score outright rather than special-casing the empty array, because it rode on the object the evaluator produces and a deserialized bundle carrying `frontier: []` would have switched the gate off silently. The manifest's declared directions are now cross-checked against the gate's actual objectives, so a manifest can no longer declare an inverted direction that would invert promotion the day it is wired in, and declared bounds must be ones `normalizePolicy` can actually effect. The module now opens by stating plainly that it is inert: `declaredObjectives()` has no caller and schema registration happens by glob, so the schema constant was decorative -- a research-gate test now validates the fixture through it. All six negative checks bit before their fix. 157 of 158 harness tests pass (one pre-existing skip), 26 research-gate tests pass. Co-Authored-By: claude-flow <ruv@ruv.net> Claude-Session: https://claude.ai/code/session_016QSCkKnxDjqU49NVVpWMK5		2026-08-23 10:40:47 -04:00
..
test_research_gate.py	fix(sota-bench): validate every Pareto axis, and drop to two objectives	2026-08-23 10:40:47 -04:00