@trazum/core 1.50.7 → 1.50.9

package/dist/index.d.ts

@@ -19,7 +19,11 @@ export type { PlanAction, PlanActionKind, PlanAssumption, PlanDocument } from '.
 export { verifyPlan } from './verify.js';
 export { buildHistory, storedReportFrom, MIN_RUN } from './history.js';
 export { outcomeReport, judgeOutcome, OUTCOME_UNLOCKS } from './outcome.js';
+export { verifySemanticProposals, semanticPassCost, SEMANTIC_SYSTEM_PROMPT, ALREADY_DETECTED_SIMILARITY, } from './semantic.js';
+export type { SemanticFinding, SemanticKind, SemanticProposal, SemanticRejection, SemanticResult, } from './semantic.js';
 export { runExperiment } from './experiment.js';
+export { qualityGate, MIN_OUTCOMES_EACH_SIDE, MAX_MODEL_MIX_DRIFT, MAX_VOLUME_RATIO, MAX_COVERAGE_DRIFT, } from './quality-gate.js';
+export type { Confounder, GateSide, GateUnknown, GateVerdict, QualityGate } from './quality-gate.js';
 export type { ArmResult, ExperimentArm, ExperimentDeclaration, ExperimentResult, Marginal, NotSeparableReason, Separation, } from './experiment.js';
 export { ladderArithmetic, ladderPosition, validateLadder, MIN_CALLS_FOR_LADDER, BREAK_EVEN_BAND, } from './ladder.js';
 export type { LadderArithmetic, LadderPolicy, LadderPosition, LadderProblem, LadderUnknown, LadderVerdict, } from './ladder.js';

package/dist/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAC;AAC3B,OAAO,EAAE,uBAAuB,EAAE,cAAc,EAAE,oBAAoB,EAAE,MAAM,gBAAgB,CAAC;AAC/F,OAAO,EACL,UAAU,EACV,cAAc,EACd,YAAY,EACZ,cAAc,EACd,YAAY,EACZ,QAAQ,GACT,MAAM,YAAY,CAAC;AACpB,YAAY,EACV,cAAc,EACd,YAAY,EACZ,mBAAmB,EACnB,cAAc,EACd,aAAa,EACb,kBAAkB,EAClB,WAAW,EACX,WAAW,GACZ,MAAM,YAAY,CAAC;AACpB,OAAO,EAAE,kBAAkB,EAAE,yBAAyB,EAAE,MAAM,mBAAmB,CAAC;AAGlF,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,WAAW,EAAE,mBAAmB,EAAE,MAAM,cAAc,CAAC;AACtF,YAAY,EAAE,WAAW,EAAE,aAAa,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAQ7F,OAAO,EACL,mBAAmB,EACnB,uBAAuB,EACvB,wBAAwB,EACxB,6BAA6B,EAC7B,YAAY,GACb,MAAM,UAAU,CAAC;AAClB,YAAY,EAAE,iBAAiB,EAAE,eAAe,EAAE,MAAM,UAAU,CAAC;AACnE,OAAO,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAC9C,YAAY,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAClD,OAAO,EAAE,aAAa,EAAE,eAAe,EAAE,kBAAkB,EAAE,MAAM,qBAAqB,CAAC;AACzF,OAAO,EAAE,kBAAkB,EAAE,UAAU,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAC;AACtF,OAAO,EAAE,aAAa,EAAE,aAAa,EAAE,cAAc,EAAE,aAAa,EAAE,MAAM,uBAAuB,CAAC;AACpG,OAAO,EAAE,aAAa,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AACxD,OAAO,EAAE,SAAS,EAAE,aAAa,EAAE,iBAAiB,EAAE,iBAAiB,EAAE,MAAM,WAAW,CAAC;AAC3F,YAAY,EAAE,gBAAgB,EAAE,eAAe,EAAE,MAAM,WAAW,CAAC;AACnE,YAAY,EAAE,UAAU,EAAE,cAAc,EAAE,cAAc,EAAE,YAAY,EAAE,MAAM,WAAW,CAAC;AAC1F,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,YAAY,EAAE,gBAAgB,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AACvE,OAAO,EAAE,aAAa,EAAE,YAAY,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAC5E,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,YAAY,EACV,SAAS,EACT,aAAa,EACb,qBAAqB,EACrB,gBAAgB,EAChB,QAAQ,EACR,kBAAkB,EAClB,UAAU,GACX,MAAM,iBAAiB,CAAC;AACzB,OAAO,EACL,gBAAgB,EAChB,cAAc,EACd,cAAc,EACd,oBAAoB,EACpB,eAAe,GAChB,MAAM,aAAa,CAAC;AACrB,YAAY,EACV,gBAAgB,EAChB,YAAY,EACZ,cAAc,EACd,aAAa,EACb,aAAa,EACb,aAAa,GACd,MAAM,aAAa,CAAC;AACrB,OAAO,EACL,UAAU,EACV,cAAc,EACd,qBAAqB,EACrB,qBAAqB,GACtB,MAAM,kBAAkB,CAAC;AAC1B,YAAY,EACV,UAAU,EACV,iBAAiB,EACjB,WAAW,EACX,UAAU,EACV,cAAc,GACf,MAAM,kBAAkB,CAAC;AAC1B,YAAY,EACV,eAAe,EACf,aAAa,EACb,YAAY,EACZ,YAAY,EACZ,aAAa,EACb,cAAc,EACd,iBAAiB,GAClB,MAAM,cAAc,CAAC;AACtB,OAAO,EAAE,eAAe,EAAE,iBAAiB,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AACpF,YAAY,EACV,eAAe,EACf,aAAa,EACb,kBAAkB,EAClB,WAAW,EACX,eAAe,EACf,cAAc,EACd,aAAa,EACb,eAAe,EACf,YAAY,GACb,MAAM,cAAc,CAAC;AACtB,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AACvC,YAAY,EACV,cAAc,EACd,kBAAkB,EAClB,iBAAiB,EACjB,YAAY,GACb,MAAM,cAAc,CAAC;AACtB,OAAO,EAAE,eAAe,EAAE,OAAO,EAAE,oBAAoB,EAAE,MAAM,aAAa,CAAC;AAC7E,YAAY,EACV,cAAc,EACd,aAAa,EACb,YAAY,EACZ,cAAc,EACd,YAAY,EACZ,WAAW,EACX,QAAQ,EACR,SAAS,GACV,MAAM,aAAa,CAAC;AACrB,OAAO,EAAE,aAAa,EAAE,SAAS,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AACrE,YAAY,EAAE,WAAW,EAAE,aAAa,EAAE,SAAS,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AACzF,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AACxC,YAAY,EAAE,gBAAgB,EAAE,WAAW,EAAE,YAAY,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAC5F,OAAO,EAAE,WAAW,EAAE,oBAAoB,EAAE,aAAa,EAAE,MAAM,WAAW,CAAC;AAC7E,YAAY,EACV,WAAW,EACX,YAAY,EACZ,iBAAiB,EACjB,OAAO,EACP,gBAAgB,EAChB,WAAW,EACX,YAAY,EACZ,UAAU,EACV,gBAAgB,EAChB,aAAa,GACd,MAAM,WAAW,CAAC;AACnB,YAAY,EACV,aAAa,EACb,aAAa,EACb,cAAc,EACd,YAAY,EACZ,sBAAsB,EACtB,UAAU,GACX,MAAM,aAAa,CAAC;AACrB,OAAO,EAAE,aAAa,EAAE,QAAQ,EAAE,cAAc,EAAE,MAAM,EAAE,MAAM,YAAY,CAAC;AAC7E,YAAY,EACV,YAAY,EACZ,eAAe,EACf,aAAa,EACb,SAAS,EACT,YAAY,EACZ,WAAW,EACX,eAAe,GAChB,MAAM,YAAY,CAAC;AACpB,OAAO,EACL,oBAAoB,EACpB,UAAU,EACV,YAAY,EACZ,kBAAkB,EAClB,kBAAkB,EAClB,cAAc,EACd,YAAY,GACb,MAAM,YAAY,CAAC;AACpB,YAAY,EAAE,WAAW,EAAE,aAAa,EAAE,cAAc,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAC1F,OAAO,EACL,UAAU,EACV,YAAY,EACZ,uBAAuB,EACvB,oBAAoB,EACpB,eAAe,EACf,sBAAsB,GACvB,MAAM,gBAAgB,CAAC;AACxB,YAAY,EACV,cAAc,EACd,aAAa,EACb,mBAAmB,EACnB,oBAAoB,EACpB,aAAa,EACb,OAAO,EACP,kBAAkB,EAClB,WAAW,GACZ,MAAM,gBAAgB,CAAC;AACxB,YAAY,EAAE,eAAe,EAAE,UAAU,EAAE,kBAAkB,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAClG,YAAY,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,cAAc,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AACrG,YAAY,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAC3D,YAAY,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,uBAAuB,CAAC;AAC1E,YAAY,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACzD,YAAY,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AAKxE,OAAO,EAAE,uBAAuB,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AACxE,YAAY,EAAE,UAAU,EAAE,iBAAiB,EAAE,iBAAiB,EAAE,MAAM,kBAAkB,CAAC;AAGzF,OAAO,EAAE,oBAAoB,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAGnE,OAAO,EAAE,4BAA4B,EAAE,iBAAiB,EAAE,MAAM,uBAAuB,CAAC;AACxF,YAAY,EAAE,eAAe,EAAE,sBAAsB,EAAE,sBAAsB,EAAE,MAAM,uBAAuB,CAAC;AAC7G,YAAY,EAAE,aAAa,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAIlF,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AACxD,YAAY,EAAE,eAAe,EAAE,sBAAsB,EAAE,MAAM,uBAAuB,CAAC;AACrF,OAAO,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAC7D,YAAY,EAAE,gBAAgB,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AACnF,OAAO,EAAE,0BAA0B,EAAE,qBAAqB,EAAE,MAAM,qBAAqB,CAAC;AAExF,OAAO,EAAE,wBAAwB,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAC;AAChF,YAAY,EAAE,kBAAkB,EAAE,gBAAgB,EAAE,kBAAkB,EAAE,MAAM,mBAAmB,CAAC;AAClG,YAAY,EACV,oBAAoB,EACpB,oBAAoB,EACpB,qBAAqB,GACtB,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAAE,wBAAwB,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAC3E,YAAY,EAAE,WAAW,EAAE,kBAAkB,EAAE,kBAAkB,EAAE,MAAM,mBAAmB,CAAC;AAC7F,YAAY,EAAE,kBAAkB,EAAE,mBAAmB,EAAE,mBAAmB,EAAE,MAAM,mBAAmB,CAAC;AACtG,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,YAAY,EAAE,UAAU,EAAE,gBAAgB,EAAE,OAAO,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AACtF,OAAO,EAAE,oBAAoB,EAAE,kBAAkB,EAAE,MAAM,eAAe,CAAC;AACzE,OAAO,EAAE,cAAc,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAC7D,OAAO,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AAChD,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAC7C,OAAO,EAAE,aAAa,EAAE,MAAM,WAAW,CAAC;AAC1C,YAAY,EAAE,aAAa,EAAE,aAAa,EAAE,SAAS,EAAE,UAAU,EAAE,WAAW,EAAE,MAAM,WAAW,CAAC;AAClG,YAAY,EAAE,eAAe,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,MAAM,gBAAgB,CAAC;AAC1F,YAAY,EAAE,cAAc,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAClE,OAAO,EAAE,qBAAqB,EAAE,aAAa,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AACpG,YAAY,EACV,cAAc,EACd,iBAAiB,EACjB,cAAc,EACd,aAAa,GACd,MAAM,cAAc,CAAC;AACtB,YAAY,EAAE,iBAAiB,EAAE,uBAAuB,EAAE,MAAM,gBAAgB,CAAC;AACjF,OAAO,EACL,MAAM,EACN,aAAa,EACb,gBAAgB,EAChB,qBAAqB,EACrB,aAAa,EACb,iBAAiB,EACjB,QAAQ,EACR,UAAU,EACV,gBAAgB,EAChB,cAAc,EACd,SAAS,EACT,gBAAgB,EAChB,cAAc,GACf,MAAM,cAAc,CAAC;AACtB,YAAY,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AACrD,YAAY,EAAE,WAAW,EAAE,UAAU,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAG3E,OAAO,EACL,iBAAiB,EACjB,kBAAkB,EAClB,oBAAoB,EACpB,mBAAmB,EACnB,mBAAmB,EACnB,oBAAoB,EACpB,mBAAmB,GACpB,MAAM,sBAAsB,CAAC;AAC9B,YAAY,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AAC3D,OAAO,EAAE,iBAAiB,EAAE,MAAM,iBAAiB,CAAC;AAMpD,OAAO,EAAE,QAAQ,EAAE,gBAAgB,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AACrF,YAAY,EAAE,SAAS,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AAC/D,OAAO,EAAE,WAAW,EAAE,YAAY,EAAE,SAAS,EAAE,MAAM,eAAe,CAAC;AACrE,YAAY,EAAE,WAAW,EAAE,cAAc,EAAE,MAAM,eAAe,CAAC;AACjE,YAAY,EAAE,gBAAgB,EAAE,MAAM,iBAAiB,CAAC;AACxD,OAAO,EACL,iBAAiB,EACjB,gBAAgB,EAChB,aAAa,EACb,kBAAkB,EAClB,QAAQ,EACR,iBAAiB,EACjB,cAAc,EACd,iBAAiB,EACjB,aAAa,GACd,MAAM,eAAe,CAAC;AACvB,YAAY,EACV,cAAc,EACd,cAAc,EACd,kBAAkB,EAClB,gBAAgB,EAChB,kBAAkB,GACnB,MAAM,eAAe,CAAC;AACvB,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AAC5C,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAC7D,OAAO,EAAE,cAAc,EAAE,UAAU,EAAE,SAAS,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AACtF,OAAO,EAAE,eAAe,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AACjE,YAAY,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAC;AACvD,OAAO,EAAE,kBAAkB,EAAE,MAAM,YAAY,CAAC;AAKhD,OAAO,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAC/C,YAAY,EACV,aAAa,EACb,cAAc,EACd,aAAa,EACb,cAAc,GACf,MAAM,cAAc,CAAC;AACtB,YAAY,EAAE,mBAAmB,EAAE,MAAM,YAAY,CAAC;AAKtD,OAAO,EAAE,gBAAgB,EAAE,cAAc,EAAE,MAAM,oBAAoB,CAAC;AACtE,YAAY,EACV,eAAe,EACf,YAAY,EACZ,mBAAmB,GACpB,MAAM,oBAAoB,CAAC;AAI5B,OAAO,EAAE,cAAc,EAAE,QAAQ,EAAE,SAAS,EAAE,iBAAiB,EAAE,MAAM,cAAc,CAAC;AACtF,YAAY,EAAE,eAAe,EAAE,cAAc,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AAItF,OAAO,EAAE,gBAAgB,EAAE,MAAM,aAAa,CAAC;AAC/C,YAAY,EAAE,SAAS,EAAE,QAAQ,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AACpF,OAAO,EAAE,QAAQ,EAAE,oBAAoB,EAAE,aAAa,EAAE,MAAM,eAAe,CAAC;AAC9E,OAAO,EACL,aAAa,EACb,gBAAgB,EAChB,iBAAiB,EACjB,eAAe,EACf,cAAc,EACd,cAAc,EACd,cAAc,EACd,eAAe,EACf,qBAAqB,GACtB,MAAM,UAAU,CAAC;AAClB,YAAY,EACV,aAAa,EACb,uBAAuB,EACvB,wBAAwB,EACxB,sBAAsB,EACtB,qBAAqB,EACrB,qBAAqB,EACrB,qBAAqB,GACtB,MAAM,UAAU,CAAC;AAGlB,OAAO,EACL,cAAc,EACd,OAAO,EACP,WAAW,EACX,QAAQ,EACR,WAAW,EACX,aAAa,EACb,EAAE,EACF,EAAE,GACH,MAAM,iBAAiB,CAAC;AACzB,YAAY,EAAE,YAAY,EAAE,MAAM,EAAE,gBAAgB,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,iBAAiB,CAAC;AAGhG,OAAO,EACL,eAAe,EACf,kBAAkB,EAClB,YAAY,EACZ,iBAAiB,EACjB,kBAAkB,GACnB,MAAM,gBAAgB,CAAC;AACxB,YAAY,EACV,aAAa,EACb,iBAAiB,EACjB,iBAAiB,EACjB,eAAe,EACf,YAAY,EACZ,aAAa,EACb,gBAAgB,EAChB,cAAc,GACf,MAAM,gBAAgB,CAAC;AACxB,OAAO,EAAE,OAAO,EAAE,mBAAmB,EAAE,MAAM,iBAAiB,CAAC;AAC/D,OAAO,EAAE,WAAW,EAAE,uBAAuB,EAAE,MAAM,cAAc,CAAC;AAGpE,OAAO,EACL,eAAe,EACf,gBAAgB,EAChB,eAAe,EACf,aAAa,EACb,eAAe,EACf,mBAAmB,GACpB,MAAM,UAAU,CAAC;AAClB,YAAY,EAAE,iBAAiB,EAAE,uBAAuB,EAAE,MAAM,UAAU,CAAC;AAG3E,OAAO,EAAE,cAAc,EAAE,oBAAoB,EAAE,MAAM,cAAc,CAAC;AACpE,YAAY,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAG/C,OAAO,EAAE,cAAc,EAAE,4BAA4B,EAAE,MAAM,aAAa,CAAC;AAC3E,YAAY,EAAE,aAAa,EAAE,iBAAiB,EAAE,qBAAqB,EAAE,MAAM,aAAa,CAAC;AAK3F,OAAO,EAAE,cAAc,EAAE,YAAY,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AACzF,YAAY,EAAE,mBAAmB,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAGjF,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AACjE,YAAY,EAAE,QAAQ,EAAE,UAAU,EAAE,WAAW,EAAE,eAAe,EAAE,MAAM,eAAe,CAAC;AAGxF,OAAO,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAC9C,YAAY,EACV,gBAAgB,EAChB,cAAc,EACd,SAAS,EACT,aAAa,GACd,MAAM,cAAc,CAAC;AAKtB,OAAO,EAAE,SAAS,EAAE,iBAAiB,EAAE,WAAW,EAAE,MAAM,WAAW,CAAC;AACtE,OAAO,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAKzD,OAAO,EACL,eAAe,EACf,WAAW,EACX,iBAAiB,EACjB,WAAW,EACX,kBAAkB,EAClB,gBAAgB,EAChB,uBAAuB,EACvB,SAAS,EACT,WAAW,GACZ,MAAM,oBAAoB,CAAC;AAC5B,YAAY,EAAE,cAAc,EAAE,WAAW,EAAE,YAAY,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAChG,OAAO,EAAE,cAAc,EAAE,MAAM,oBAAoB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAC;AAC3B,OAAO,EAAE,uBAAuB,EAAE,cAAc,EAAE,oBAAoB,EAAE,MAAM,gBAAgB,CAAC;AAC/F,OAAO,EACL,UAAU,EACV,cAAc,EACd,YAAY,EACZ,cAAc,EACd,YAAY,EACZ,QAAQ,GACT,MAAM,YAAY,CAAC;AACpB,YAAY,EACV,cAAc,EACd,YAAY,EACZ,mBAAmB,EACnB,cAAc,EACd,aAAa,EACb,kBAAkB,EAClB,WAAW,EACX,WAAW,GACZ,MAAM,YAAY,CAAC;AACpB,OAAO,EAAE,kBAAkB,EAAE,yBAAyB,EAAE,MAAM,mBAAmB,CAAC;AAGlF,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,WAAW,EAAE,mBAAmB,EAAE,MAAM,cAAc,CAAC;AACtF,YAAY,EAAE,WAAW,EAAE,aAAa,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAQ7F,OAAO,EACL,mBAAmB,EACnB,uBAAuB,EACvB,wBAAwB,EACxB,6BAA6B,EAC7B,YAAY,GACb,MAAM,UAAU,CAAC;AAClB,YAAY,EAAE,iBAAiB,EAAE,eAAe,EAAE,MAAM,UAAU,CAAC;AACnE,OAAO,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAC9C,YAAY,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAClD,OAAO,EAAE,aAAa,EAAE,eAAe,EAAE,kBAAkB,EAAE,MAAM,qBAAqB,CAAC;AACzF,OAAO,EAAE,kBAAkB,EAAE,UAAU,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAC;AACtF,OAAO,EAAE,aAAa,EAAE,aAAa,EAAE,cAAc,EAAE,aAAa,EAAE,MAAM,uBAAuB,CAAC;AACpG,OAAO,EAAE,aAAa,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AACxD,OAAO,EAAE,SAAS,EAAE,aAAa,EAAE,iBAAiB,EAAE,iBAAiB,EAAE,MAAM,WAAW,CAAC;AAC3F,YAAY,EAAE,gBAAgB,EAAE,eAAe,EAAE,MAAM,WAAW,CAAC;AACnE,YAAY,EAAE,UAAU,EAAE,cAAc,EAAE,cAAc,EAAE,YAAY,EAAE,MAAM,WAAW,CAAC;AAC1F,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,YAAY,EAAE,gBAAgB,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AACvE,OAAO,EAAE,aAAa,EAAE,YAAY,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAC5E,OAAO,EACL,uBAAuB,EACvB,gBAAgB,EAChB,sBAAsB,EACtB,2BAA2B,GAC5B,MAAM,eAAe,CAAC;AACvB,YAAY,EACV,eAAe,EACf,YAAY,EACZ,gBAAgB,EAChB,iBAAiB,EACjB,cAAc,GACf,MAAM,eAAe,CAAC;AACvB,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EACL,WAAW,EACX,sBAAsB,EACtB,mBAAmB,EACnB,gBAAgB,EAChB,kBAAkB,GACnB,MAAM,mBAAmB,CAAC;AAC3B,YAAY,EAAE,UAAU,EAAE,QAAQ,EAAE,WAAW,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AACrG,YAAY,EACV,SAAS,EACT,aAAa,EACb,qBAAqB,EACrB,gBAAgB,EAChB,QAAQ,EACR,kBAAkB,EAClB,UAAU,GACX,MAAM,iBAAiB,CAAC;AACzB,OAAO,EACL,gBAAgB,EAChB,cAAc,EACd,cAAc,EACd,oBAAoB,EACpB,eAAe,GAChB,MAAM,aAAa,CAAC;AACrB,YAAY,EACV,gBAAgB,EAChB,YAAY,EACZ,cAAc,EACd,aAAa,EACb,aAAa,EACb,aAAa,GACd,MAAM,aAAa,CAAC;AACrB,OAAO,EACL,UAAU,EACV,cAAc,EACd,qBAAqB,EACrB,qBAAqB,GACtB,MAAM,kBAAkB,CAAC;AAC1B,YAAY,EACV,UAAU,EACV,iBAAiB,EACjB,WAAW,EACX,UAAU,EACV,cAAc,GACf,MAAM,kBAAkB,CAAC;AAC1B,YAAY,EACV,eAAe,EACf,aAAa,EACb,YAAY,EACZ,YAAY,EACZ,aAAa,EACb,cAAc,EACd,iBAAiB,GAClB,MAAM,cAAc,CAAC;AACtB,OAAO,EAAE,eAAe,EAAE,iBAAiB,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AACpF,YAAY,EACV,eAAe,EACf,aAAa,EACb,kBAAkB,EAClB,WAAW,EACX,eAAe,EACf,cAAc,EACd,aAAa,EACb,eAAe,EACf,YAAY,GACb,MAAM,cAAc,CAAC;AACtB,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AACvC,YAAY,EACV,cAAc,EACd,kBAAkB,EAClB,iBAAiB,EACjB,YAAY,GACb,MAAM,cAAc,CAAC;AACtB,OAAO,EAAE,eAAe,EAAE,OAAO,EAAE,oBAAoB,EAAE,MAAM,aAAa,CAAC;AAC7E,YAAY,EACV,cAAc,EACd,aAAa,EACb,YAAY,EACZ,cAAc,EACd,YAAY,EACZ,WAAW,EACX,QAAQ,EACR,SAAS,GACV,MAAM,aAAa,CAAC;AACrB,OAAO,EAAE,aAAa,EAAE,SAAS,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AACrE,YAAY,EAAE,WAAW,EAAE,aAAa,EAAE,SAAS,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AACzF,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AACxC,YAAY,EAAE,gBAAgB,EAAE,WAAW,EAAE,YAAY,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAC5F,OAAO,EAAE,WAAW,EAAE,oBAAoB,EAAE,aAAa,EAAE,MAAM,WAAW,CAAC;AAC7E,YAAY,EACV,WAAW,EACX,YAAY,EACZ,iBAAiB,EACjB,OAAO,EACP,gBAAgB,EAChB,WAAW,EACX,YAAY,EACZ,UAAU,EACV,gBAAgB,EAChB,aAAa,GACd,MAAM,WAAW,CAAC;AACnB,YAAY,EACV,aAAa,EACb,aAAa,EACb,cAAc,EACd,YAAY,EACZ,sBAAsB,EACtB,UAAU,GACX,MAAM,aAAa,CAAC;AACrB,OAAO,EAAE,aAAa,EAAE,QAAQ,EAAE,cAAc,EAAE,MAAM,EAAE,MAAM,YAAY,CAAC;AAC7E,YAAY,EACV,YAAY,EACZ,eAAe,EACf,aAAa,EACb,SAAS,EACT,YAAY,EACZ,WAAW,EACX,eAAe,GAChB,MAAM,YAAY,CAAC;AACpB,OAAO,EACL,oBAAoB,EACpB,UAAU,EACV,YAAY,EACZ,kBAAkB,EAClB,kBAAkB,EAClB,cAAc,EACd,YAAY,GACb,MAAM,YAAY,CAAC;AACpB,YAAY,EAAE,WAAW,EAAE,aAAa,EAAE,cAAc,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAC1F,OAAO,EACL,UAAU,EACV,YAAY,EACZ,uBAAuB,EACvB,oBAAoB,EACpB,eAAe,EACf,sBAAsB,GACvB,MAAM,gBAAgB,CAAC;AACxB,YAAY,EACV,cAAc,EACd,aAAa,EACb,mBAAmB,EACnB,oBAAoB,EACpB,aAAa,EACb,OAAO,EACP,kBAAkB,EAClB,WAAW,GACZ,MAAM,gBAAgB,CAAC;AACxB,YAAY,EAAE,eAAe,EAAE,UAAU,EAAE,kBAAkB,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAClG,YAAY,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,cAAc,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AACrG,YAAY,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAC3D,YAAY,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,uBAAuB,CAAC;AAC1E,YAAY,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACzD,YAAY,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AAKxE,OAAO,EAAE,uBAAuB,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AACxE,YAAY,EAAE,UAAU,EAAE,iBAAiB,EAAE,iBAAiB,EAAE,MAAM,kBAAkB,CAAC;AAGzF,OAAO,EAAE,oBAAoB,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAGnE,OAAO,EAAE,4BAA4B,EAAE,iBAAiB,EAAE,MAAM,uBAAuB,CAAC;AACxF,YAAY,EAAE,eAAe,EAAE,sBAAsB,EAAE,sBAAsB,EAAE,MAAM,uBAAuB,CAAC;AAC7G,YAAY,EAAE,aAAa,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAIlF,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AACxD,YAAY,EAAE,eAAe,EAAE,sBAAsB,EAAE,MAAM,uBAAuB,CAAC;AACrF,OAAO,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAC7D,YAAY,EAAE,gBAAgB,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AACnF,OAAO,EAAE,0BAA0B,EAAE,qBAAqB,EAAE,MAAM,qBAAqB,CAAC;AAExF,OAAO,EAAE,wBAAwB,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAC;AAChF,YAAY,EAAE,kBAAkB,EAAE,gBAAgB,EAAE,kBAAkB,EAAE,MAAM,mBAAmB,CAAC;AAClG,YAAY,EACV,oBAAoB,EACpB,oBAAoB,EACpB,qBAAqB,GACtB,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAAE,wBAAwB,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAC3E,YAAY,EAAE,WAAW,EAAE,kBAAkB,EAAE,kBAAkB,EAAE,MAAM,mBAAmB,CAAC;AAC7F,YAAY,EAAE,kBAAkB,EAAE,mBAAmB,EAAE,mBAAmB,EAAE,MAAM,mBAAmB,CAAC;AACtG,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,YAAY,EAAE,UAAU,EAAE,gBAAgB,EAAE,OAAO,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AACtF,OAAO,EAAE,oBAAoB,EAAE,kBAAkB,EAAE,MAAM,eAAe,CAAC;AACzE,OAAO,EAAE,cAAc,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAC7D,OAAO,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AAChD,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAC7C,OAAO,EAAE,aAAa,EAAE,MAAM,WAAW,CAAC;AAC1C,YAAY,EAAE,aAAa,EAAE,aAAa,EAAE,SAAS,EAAE,UAAU,EAAE,WAAW,EAAE,MAAM,WAAW,CAAC;AAClG,YAAY,EAAE,eAAe,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,MAAM,gBAAgB,CAAC;AAC1F,YAAY,EAAE,cAAc,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAClE,OAAO,EAAE,qBAAqB,EAAE,aAAa,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AACpG,YAAY,EACV,cAAc,EACd,iBAAiB,EACjB,cAAc,EACd,aAAa,GACd,MAAM,cAAc,CAAC;AACtB,YAAY,EAAE,iBAAiB,EAAE,uBAAuB,EAAE,MAAM,gBAAgB,CAAC;AACjF,OAAO,EACL,MAAM,EACN,aAAa,EACb,gBAAgB,EAChB,qBAAqB,EACrB,aAAa,EACb,iBAAiB,EACjB,QAAQ,EACR,UAAU,EACV,gBAAgB,EAChB,cAAc,EACd,SAAS,EACT,gBAAgB,EAChB,cAAc,GACf,MAAM,cAAc,CAAC;AACtB,YAAY,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AACrD,YAAY,EAAE,WAAW,EAAE,UAAU,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAG3E,OAAO,EACL,iBAAiB,EACjB,kBAAkB,EAClB,oBAAoB,EACpB,mBAAmB,EACnB,mBAAmB,EACnB,oBAAoB,EACpB,mBAAmB,GACpB,MAAM,sBAAsB,CAAC;AAC9B,YAAY,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AAC3D,OAAO,EAAE,iBAAiB,EAAE,MAAM,iBAAiB,CAAC;AAMpD,OAAO,EAAE,QAAQ,EAAE,gBAAgB,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AACrF,YAAY,EAAE,SAAS,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AAC/D,OAAO,EAAE,WAAW,EAAE,YAAY,EAAE,SAAS,EAAE,MAAM,eAAe,CAAC;AACrE,YAAY,EAAE,WAAW,EAAE,cAAc,EAAE,MAAM,eAAe,CAAC;AACjE,YAAY,EAAE,gBAAgB,EAAE,MAAM,iBAAiB,CAAC;AACxD,OAAO,EACL,iBAAiB,EACjB,gBAAgB,EAChB,aAAa,EACb,kBAAkB,EAClB,QAAQ,EACR,iBAAiB,EACjB,cAAc,EACd,iBAAiB,EACjB,aAAa,GACd,MAAM,eAAe,CAAC;AACvB,YAAY,EACV,cAAc,EACd,cAAc,EACd,kBAAkB,EAClB,gBAAgB,EAChB,kBAAkB,GACnB,MAAM,eAAe,CAAC;AACvB,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AAC5C,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAC7D,OAAO,EAAE,cAAc,EAAE,UAAU,EAAE,SAAS,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AACtF,OAAO,EAAE,eAAe,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AACjE,YAAY,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAC;AACvD,OAAO,EAAE,kBAAkB,EAAE,MAAM,YAAY,CAAC;AAKhD,OAAO,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAC/C,YAAY,EACV,aAAa,EACb,cAAc,EACd,aAAa,EACb,cAAc,GACf,MAAM,cAAc,CAAC;AACtB,YAAY,EAAE,mBAAmB,EAAE,MAAM,YAAY,CAAC;AAKtD,OAAO,EAAE,gBAAgB,EAAE,cAAc,EAAE,MAAM,oBAAoB,CAAC;AACtE,YAAY,EACV,eAAe,EACf,YAAY,EACZ,mBAAmB,GACpB,MAAM,oBAAoB,CAAC;AAI5B,OAAO,EAAE,cAAc,EAAE,QAAQ,EAAE,SAAS,EAAE,iBAAiB,EAAE,MAAM,cAAc,CAAC;AACtF,YAAY,EAAE,eAAe,EAAE,cAAc,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AAItF,OAAO,EAAE,gBAAgB,EAAE,MAAM,aAAa,CAAC;AAC/C,YAAY,EAAE,SAAS,EAAE,QAAQ,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AACpF,OAAO,EAAE,QAAQ,EAAE,oBAAoB,EAAE,aAAa,EAAE,MAAM,eAAe,CAAC;AAC9E,OAAO,EACL,aAAa,EACb,gBAAgB,EAChB,iBAAiB,EACjB,eAAe,EACf,cAAc,EACd,cAAc,EACd,cAAc,EACd,eAAe,EACf,qBAAqB,GACtB,MAAM,UAAU,CAAC;AAClB,YAAY,EACV,aAAa,EACb,uBAAuB,EACvB,wBAAwB,EACxB,sBAAsB,EACtB,qBAAqB,EACrB,qBAAqB,EACrB,qBAAqB,GACtB,MAAM,UAAU,CAAC;AAGlB,OAAO,EACL,cAAc,EACd,OAAO,EACP,WAAW,EACX,QAAQ,EACR,WAAW,EACX,aAAa,EACb,EAAE,EACF,EAAE,GACH,MAAM,iBAAiB,CAAC;AACzB,YAAY,EAAE,YAAY,EAAE,MAAM,EAAE,gBAAgB,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,iBAAiB,CAAC;AAGhG,OAAO,EACL,eAAe,EACf,kBAAkB,EAClB,YAAY,EACZ,iBAAiB,EACjB,kBAAkB,GACnB,MAAM,gBAAgB,CAAC;AACxB,YAAY,EACV,aAAa,EACb,iBAAiB,EACjB,iBAAiB,EACjB,eAAe,EACf,YAAY,EACZ,aAAa,EACb,gBAAgB,EAChB,cAAc,GACf,MAAM,gBAAgB,CAAC;AACxB,OAAO,EAAE,OAAO,EAAE,mBAAmB,EAAE,MAAM,iBAAiB,CAAC;AAC/D,OAAO,EAAE,WAAW,EAAE,uBAAuB,EAAE,MAAM,cAAc,CAAC;AAGpE,OAAO,EACL,eAAe,EACf,gBAAgB,EAChB,eAAe,EACf,aAAa,EACb,eAAe,EACf,mBAAmB,GACpB,MAAM,UAAU,CAAC;AAClB,YAAY,EAAE,iBAAiB,EAAE,uBAAuB,EAAE,MAAM,UAAU,CAAC;AAG3E,OAAO,EAAE,cAAc,EAAE,oBAAoB,EAAE,MAAM,cAAc,CAAC;AACpE,YAAY,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAG/C,OAAO,EAAE,cAAc,EAAE,4BAA4B,EAAE,MAAM,aAAa,CAAC;AAC3E,YAAY,EAAE,aAAa,EAAE,iBAAiB,EAAE,qBAAqB,EAAE,MAAM,aAAa,CAAC;AAK3F,OAAO,EAAE,cAAc,EAAE,YAAY,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AACzF,YAAY,EAAE,mBAAmB,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAGjF,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AACjE,YAAY,EAAE,QAAQ,EAAE,UAAU,EAAE,WAAW,EAAE,eAAe,EAAE,MAAM,eAAe,CAAC;AAGxF,OAAO,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAC9C,YAAY,EACV,gBAAgB,EAChB,cAAc,EACd,SAAS,EACT,aAAa,GACd,MAAM,cAAc,CAAC;AAKtB,OAAO,EAAE,SAAS,EAAE,iBAAiB,EAAE,WAAW,EAAE,MAAM,WAAW,CAAC;AACtE,OAAO,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAKzD,OAAO,EACL,eAAe,EACf,WAAW,EACX,iBAAiB,EACjB,WAAW,EACX,kBAAkB,EAClB,gBAAgB,EAChB,uBAAuB,EACvB,SAAS,EACT,WAAW,GACZ,MAAM,oBAAoB,CAAC;AAC5B,YAAY,EAAE,cAAc,EAAE,WAAW,EAAE,YAAY,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAChG,OAAO,EAAE,cAAc,EAAE,MAAM,oBAAoB,CAAC"}

package/dist/index.js

@@ -22,7 +22,9 @@ export { buildPlan, planLabelName, parsePlanDocument, PLAN_ACTION_KINDS } from '
 export { verifyPlan } from './verify.js';
 export { buildHistory, storedReportFrom, MIN_RUN } from './history.js';
 export { outcomeReport, judgeOutcome, OUTCOME_UNLOCKS } from './outcome.js';
+export { verifySemanticProposals, semanticPassCost, SEMANTIC_SYSTEM_PROMPT, ALREADY_DETECTED_SIMILARITY, } from './semantic.js';
 export { runExperiment } from './experiment.js';
+export { qualityGate, MIN_OUTCOMES_EACH_SIDE, MAX_MODEL_MIX_DRIFT, MAX_VOLUME_RATIO, MAX_COVERAGE_DRIFT, } from './quality-gate.js';
 export { ladderArithmetic, ladderPosition, validateLadder, MIN_CALLS_FOR_LADDER, BREAK_EVEN_BAND, } from './ladder.js';
 export { perOutcome, rankPerOutcome, MIN_OUTCOMES_FOR_RATE, MIN_COVERAGE_FOR_RATE, } from './per-outcome.js';
 export { gatewayDecision, usageFromResponse, FAILURE_POLICIES } from './gateway.js';

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAC;AAC3B,OAAO,EAAE,uBAAuB,EAAE,cAAc,EAAE,oBAAoB,EAAE,MAAM,gBAAgB,CAAC;AAC/F,OAAO,EACL,UAAU,EACV,cAAc,EACd,YAAY,EACZ,cAAc,EACd,YAAY,EACZ,QAAQ,GACT,MAAM,YAAY,CAAC;AAWpB,OAAO,EAAE,kBAAkB,EAAE,yBAAyB,EAAE,MAAM,mBAAmB,CAAC;AAClF,gFAAgF;AAChF,4EAA4E;AAC5E,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,WAAW,EAAE,mBAAmB,EAAE,MAAM,cAAc,CAAC;AAEtF,2EAA2E;AAC3E,+EAA+E;AAC/E,8EAA8E;AAC9E,0EAA0E;AAC1E,yCAAyC;AACzC,4EAA4E;AAC5E,qDAAqD;AACrD,OAAO,EACL,mBAAmB,EACnB,uBAAuB,EACvB,wBAAwB,EACxB,6BAA6B,EAC7B,YAAY,GACb,MAAM,UAAU,CAAC;AAElB,OAAO,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAE9C,OAAO,EAAE,aAAa,EAAE,eAAe,EAAE,kBAAkB,EAAE,MAAM,qBAAqB,CAAC;AACzF,OAAO,EAAE,kBAAkB,EAAE,UAAU,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAC;AACtF,OAAO,EAAE,aAAa,EAAE,aAAa,EAAE,cAAc,EAAE,aAAa,EAAE,MAAM,uBAAuB,CAAC;AACpG,OAAO,EAAE,aAAa,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AACxD,OAAO,EAAE,SAAS,EAAE,aAAa,EAAE,iBAAiB,EAAE,iBAAiB,EAAE,MAAM,WAAW,CAAC;AAG3F,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,YAAY,EAAE,gBAAgB,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AACvE,OAAO,EAAE,aAAa,EAAE,YAAY,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAC5E,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAUhD,OAAO,EACL,gBAAgB,EAChB,cAAc,EACd,cAAc,EACd,oBAAoB,EACpB,eAAe,GAChB,MAAM,aAAa,CAAC;AASrB,OAAO,EACL,UAAU,EACV,cAAc,EACd,qBAAqB,EACrB,qBAAqB,GACtB,MAAM,kBAAkB,CAAC;AAiB1B,OAAO,EAAE,eAAe,EAAE,iBAAiB,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AAYpF,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AAOvC,OAAO,EAAE,eAAe,EAAE,OAAO,EAAE,oBAAoB,EAAE,MAAM,aAAa,CAAC;AAW7E,OAAO,EAAE,aAAa,EAAE,SAAS,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAErE,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAExC,OAAO,EAAE,WAAW,EAAE,oBAAoB,EAAE,aAAa,EAAE,MAAM,WAAW,CAAC;AAqB7E,OAAO,EAAE,aAAa,EAAE,QAAQ,EAAE,cAAc,EAAE,MAAM,EAAE,MAAM,YAAY,CAAC;AAU7E,OAAO,EACL,oBAAoB,EACpB,UAAU,EACV,YAAY,EACZ,kBAAkB,EAClB,kBAAkB,EAClB,cAAc,EACd,YAAY,GACb,MAAM,YAAY,CAAC;AAEpB,OAAO,EACL,UAAU,EACV,YAAY,EACZ,uBAAuB,EACvB,oBAAoB,EACpB,eAAe,EACf,sBAAsB,GACvB,MAAM,gBAAgB,CAAC;AAiBxB,4EAA4E;AAC5E,8EAA8E;AAC9E,8EAA8E;AAC9E,sBAAsB;AACtB,OAAO,EAAE,uBAAuB,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAExE,2EAA2E;AAC3E,8DAA8D;AAC9D,OAAO,EAAE,oBAAoB,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AACnE,2EAA2E;AAC3E,+DAA+D;AAC/D,OAAO,EAAE,4BAA4B,EAAE,iBAAiB,EAAE,MAAM,uBAAuB,CAAC;AAGxF,yEAAyE;AACzE,mEAAmE;AACnE,2BAA2B;AAC3B,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AAExD,OAAO,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAE7D,OAAO,EAAE,0BAA0B,EAAE,qBAAqB,EAAE,MAAM,qBAAqB,CAAC;AACxF,4EAA4E;AAC5E,OAAO,EAAE,wBAAwB,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAC;AAOhF,OAAO,EAAE,wBAAwB,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAG3E,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAEzC,OAAO,EAAE,oBAAoB,EAAE,kBAAkB,EAAE,MAAM,eAAe,CAAC;AACzE,OAAO,EAAE,cAAc,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAC7D,OAAO,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AAChD,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAC7C,OAAO,EAAE,aAAa,EAAE,MAAM,WAAW,CAAC;AAI1C,OAAO,EAAE,qBAAqB,EAAE,aAAa,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAQpG,OAAO,EACL,MAAM,EACN,aAAa,EACb,gBAAgB,EAChB,qBAAqB,EACrB,aAAa,EACb,iBAAiB,EACjB,QAAQ,EACR,UAAU,EACV,gBAAgB,EAChB,cAAc,EACd,SAAS,EACT,gBAAgB,EAChB,cAAc,GACf,MAAM,cAAc,CAAC;AAItB,uEAAuE;AACvE,OAAO,EACL,iBAAiB,EACjB,kBAAkB,EAClB,oBAAoB,EACpB,mBAAmB,EACnB,mBAAmB,EACnB,oBAAoB,EACpB,mBAAmB,GACpB,MAAM,sBAAsB,CAAC;AAE9B,OAAO,EAAE,iBAAiB,EAAE,MAAM,iBAAiB,CAAC;AAEpD,8EAA8E;AAC9E,+EAA+E;AAC/E,6EAA6E;AAC7E,UAAU;AACV,OAAO,EAAE,QAAQ,EAAE,gBAAgB,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAErF,OAAO,EAAE,WAAW,EAAE,YAAY,EAAE,SAAS,EAAE,MAAM,eAAe,CAAC;AAGrE,OAAO,EACL,iBAAiB,EACjB,gBAAgB,EAChB,aAAa,EACb,kBAAkB,EAClB,QAAQ,EACR,iBAAiB,EACjB,cAAc,EACd,iBAAiB,EACjB,aAAa,GACd,MAAM,eAAe,CAAC;AAQvB,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AAC5C,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAC7D,OAAO,EAAE,cAAc,EAAE,UAAU,EAAE,SAAS,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AACtF,OAAO,EAAE,eAAe,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAEjE,OAAO,EAAE,kBAAkB,EAAE,MAAM,YAAY,CAAC;AAEhD,+EAA+E;AAC/E,+EAA+E;AAC/E,6DAA6D;AAC7D,OAAO,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAS/C,gFAAgF;AAChF,gFAAgF;AAChF,iEAAiE;AACjE,OAAO,EAAE,gBAAgB,EAAE,cAAc,EAAE,MAAM,oBAAoB,CAAC;AAOtE,4EAA4E;AAC5E,6EAA6E;AAC7E,OAAO,EAAE,cAAc,EAAE,QAAQ,EAAE,SAAS,EAAE,iBAAiB,EAAE,MAAM,cAAc,CAAC;AAGtF,8EAA8E;AAC9E,2EAA2E;AAC3E,OAAO,EAAE,gBAAgB,EAAE,MAAM,aAAa,CAAC;AAE/C,OAAO,EAAE,QAAQ,EAAE,oBAAoB,EAAE,aAAa,EAAE,MAAM,eAAe,CAAC;AAC9E,OAAO,EACL,aAAa,EACb,gBAAgB,EAChB,iBAAiB,EACjB,eAAe,EACf,cAAc,EACd,cAAc,EACd,cAAc,EACd,eAAe,EACf,qBAAqB,GACtB,MAAM,UAAU,CAAC;AAWlB,uBAAuB;AACvB,OAAO,EACL,cAAc,EACd,OAAO,EACP,WAAW,EACX,QAAQ,EACR,WAAW,EACX,aAAa,EACb,EAAE,EACF,EAAE,GACH,MAAM,iBAAiB,CAAC;AAGzB,sBAAsB;AACtB,OAAO,EACL,eAAe,EACf,kBAAkB,EAClB,YAAY,EACZ,iBAAiB,EACjB,kBAAkB,GACnB,MAAM,gBAAgB,CAAC;AAWxB,OAAO,EAAE,OAAO,EAAE,mBAAmB,EAAE,MAAM,iBAAiB,CAAC;AAC/D,OAAO,EAAE,WAAW,EAAE,uBAAuB,EAAE,MAAM,cAAc,CAAC;AAEpE,kDAAkD;AAClD,OAAO,EACL,eAAe,EACf,gBAAgB,EAChB,eAAe,EACf,aAAa,EACb,eAAe,EACf,mBAAmB,GACpB,MAAM,UAAU,CAAC;AAGlB,6BAA6B;AAC7B,OAAO,EAAE,cAAc,EAAE,oBAAoB,EAAE,MAAM,cAAc,CAAC;AAGpE,qEAAqE;AACrE,OAAO,EAAE,cAAc,EAAE,4BAA4B,EAAE,MAAM,aAAa,CAAC;AAG3E,kFAAkF;AAClF,kFAAkF;AAClF,wCAAwC;AACxC,OAAO,EAAE,cAAc,EAAE,YAAY,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAGzF,mEAAmE;AACnE,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AAGjE,gCAAgC;AAChC,OAAO,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAQ9C,0EAA0E;AAC1E,+EAA+E;AAC/E,8EAA8E;AAC9E,OAAO,EAAE,SAAS,EAAE,iBAAiB,EAAE,WAAW,EAAE,MAAM,WAAW,CAAC;AACtE,OAAO,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAEzD,8EAA8E;AAC9E,6EAA6E;AAC7E,2DAA2D;AAC3D,OAAO,EACL,eAAe,EACf,WAAW,EACX,iBAAiB,EACjB,WAAW,EACX,kBAAkB,EAClB,gBAAgB,EAChB,uBAAuB,EACvB,SAAS,EACT,WAAW,GACZ,MAAM,oBAAoB,CAAC;AAE5B,OAAO,EAAE,cAAc,EAAE,MAAM,oBAAoB,CAAC"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAC;AAC3B,OAAO,EAAE,uBAAuB,EAAE,cAAc,EAAE,oBAAoB,EAAE,MAAM,gBAAgB,CAAC;AAC/F,OAAO,EACL,UAAU,EACV,cAAc,EACd,YAAY,EACZ,cAAc,EACd,YAAY,EACZ,QAAQ,GACT,MAAM,YAAY,CAAC;AAWpB,OAAO,EAAE,kBAAkB,EAAE,yBAAyB,EAAE,MAAM,mBAAmB,CAAC;AAClF,gFAAgF;AAChF,4EAA4E;AAC5E,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,WAAW,EAAE,mBAAmB,EAAE,MAAM,cAAc,CAAC;AAEtF,2EAA2E;AAC3E,+EAA+E;AAC/E,8EAA8E;AAC9E,0EAA0E;AAC1E,yCAAyC;AACzC,4EAA4E;AAC5E,qDAAqD;AACrD,OAAO,EACL,mBAAmB,EACnB,uBAAuB,EACvB,wBAAwB,EACxB,6BAA6B,EAC7B,YAAY,GACb,MAAM,UAAU,CAAC;AAElB,OAAO,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAE9C,OAAO,EAAE,aAAa,EAAE,eAAe,EAAE,kBAAkB,EAAE,MAAM,qBAAqB,CAAC;AACzF,OAAO,EAAE,kBAAkB,EAAE,UAAU,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAC;AACtF,OAAO,EAAE,aAAa,EAAE,aAAa,EAAE,cAAc,EAAE,aAAa,EAAE,MAAM,uBAAuB,CAAC;AACpG,OAAO,EAAE,aAAa,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AACxD,OAAO,EAAE,SAAS,EAAE,aAAa,EAAE,iBAAiB,EAAE,iBAAiB,EAAE,MAAM,WAAW,CAAC;AAG3F,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,YAAY,EAAE,gBAAgB,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AACvE,OAAO,EAAE,aAAa,EAAE,YAAY,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAC5E,OAAO,EACL,uBAAuB,EACvB,gBAAgB,EAChB,sBAAsB,EACtB,2BAA2B,GAC5B,MAAM,eAAe,CAAC;AAQvB,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EACL,WAAW,EACX,sBAAsB,EACtB,mBAAmB,EACnB,gBAAgB,EAChB,kBAAkB,GACnB,MAAM,mBAAmB,CAAC;AAW3B,OAAO,EACL,gBAAgB,EAChB,cAAc,EACd,cAAc,EACd,oBAAoB,EACpB,eAAe,GAChB,MAAM,aAAa,CAAC;AASrB,OAAO,EACL,UAAU,EACV,cAAc,EACd,qBAAqB,EACrB,qBAAqB,GACtB,MAAM,kBAAkB,CAAC;AAiB1B,OAAO,EAAE,eAAe,EAAE,iBAAiB,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AAYpF,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AAOvC,OAAO,EAAE,eAAe,EAAE,OAAO,EAAE,oBAAoB,EAAE,MAAM,aAAa,CAAC;AAW7E,OAAO,EAAE,aAAa,EAAE,SAAS,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAErE,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAExC,OAAO,EAAE,WAAW,EAAE,oBAAoB,EAAE,aAAa,EAAE,MAAM,WAAW,CAAC;AAqB7E,OAAO,EAAE,aAAa,EAAE,QAAQ,EAAE,cAAc,EAAE,MAAM,EAAE,MAAM,YAAY,CAAC;AAU7E,OAAO,EACL,oBAAoB,EACpB,UAAU,EACV,YAAY,EACZ,kBAAkB,EAClB,kBAAkB,EAClB,cAAc,EACd,YAAY,GACb,MAAM,YAAY,CAAC;AAEpB,OAAO,EACL,UAAU,EACV,YAAY,EACZ,uBAAuB,EACvB,oBAAoB,EACpB,eAAe,EACf,sBAAsB,GACvB,MAAM,gBAAgB,CAAC;AAiBxB,4EAA4E;AAC5E,8EAA8E;AAC9E,8EAA8E;AAC9E,sBAAsB;AACtB,OAAO,EAAE,uBAAuB,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAExE,2EAA2E;AAC3E,8DAA8D;AAC9D,OAAO,EAAE,oBAAoB,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AACnE,2EAA2E;AAC3E,+DAA+D;AAC/D,OAAO,EAAE,4BAA4B,EAAE,iBAAiB,EAAE,MAAM,uBAAuB,CAAC;AAGxF,yEAAyE;AACzE,mEAAmE;AACnE,2BAA2B;AAC3B,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AAExD,OAAO,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAE7D,OAAO,EAAE,0BAA0B,EAAE,qBAAqB,EAAE,MAAM,qBAAqB,CAAC;AACxF,4EAA4E;AAC5E,OAAO,EAAE,wBAAwB,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAC;AAOhF,OAAO,EAAE,wBAAwB,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAG3E,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAEzC,OAAO,EAAE,oBAAoB,EAAE,kBAAkB,EAAE,MAAM,eAAe,CAAC;AACzE,OAAO,EAAE,cAAc,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAC7D,OAAO,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AAChD,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAC7C,OAAO,EAAE,aAAa,EAAE,MAAM,WAAW,CAAC;AAI1C,OAAO,EAAE,qBAAqB,EAAE,aAAa,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAQpG,OAAO,EACL,MAAM,EACN,aAAa,EACb,gBAAgB,EAChB,qBAAqB,EACrB,aAAa,EACb,iBAAiB,EACjB,QAAQ,EACR,UAAU,EACV,gBAAgB,EAChB,cAAc,EACd,SAAS,EACT,gBAAgB,EAChB,cAAc,GACf,MAAM,cAAc,CAAC;AAItB,uEAAuE;AACvE,OAAO,EACL,iBAAiB,EACjB,kBAAkB,EAClB,oBAAoB,EACpB,mBAAmB,EACnB,mBAAmB,EACnB,oBAAoB,EACpB,mBAAmB,GACpB,MAAM,sBAAsB,CAAC;AAE9B,OAAO,EAAE,iBAAiB,EAAE,MAAM,iBAAiB,CAAC;AAEpD,8EAA8E;AAC9E,+EAA+E;AAC/E,6EAA6E;AAC7E,UAAU;AACV,OAAO,EAAE,QAAQ,EAAE,gBAAgB,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAErF,OAAO,EAAE,WAAW,EAAE,YAAY,EAAE,SAAS,EAAE,MAAM,eAAe,CAAC;AAGrE,OAAO,EACL,iBAAiB,EACjB,gBAAgB,EAChB,aAAa,EACb,kBAAkB,EAClB,QAAQ,EACR,iBAAiB,EACjB,cAAc,EACd,iBAAiB,EACjB,aAAa,GACd,MAAM,eAAe,CAAC;AAQvB,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AAC5C,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAC7D,OAAO,EAAE,cAAc,EAAE,UAAU,EAAE,SAAS,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AACtF,OAAO,EAAE,eAAe,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAEjE,OAAO,EAAE,kBAAkB,EAAE,MAAM,YAAY,CAAC;AAEhD,+EAA+E;AAC/E,+EAA+E;AAC/E,6DAA6D;AAC7D,OAAO,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAS/C,gFAAgF;AAChF,gFAAgF;AAChF,iEAAiE;AACjE,OAAO,EAAE,gBAAgB,EAAE,cAAc,EAAE,MAAM,oBAAoB,CAAC;AAOtE,4EAA4E;AAC5E,6EAA6E;AAC7E,OAAO,EAAE,cAAc,EAAE,QAAQ,EAAE,SAAS,EAAE,iBAAiB,EAAE,MAAM,cAAc,CAAC;AAGtF,8EAA8E;AAC9E,2EAA2E;AAC3E,OAAO,EAAE,gBAAgB,EAAE,MAAM,aAAa,CAAC;AAE/C,OAAO,EAAE,QAAQ,EAAE,oBAAoB,EAAE,aAAa,EAAE,MAAM,eAAe,CAAC;AAC9E,OAAO,EACL,aAAa,EACb,gBAAgB,EAChB,iBAAiB,EACjB,eAAe,EACf,cAAc,EACd,cAAc,EACd,cAAc,EACd,eAAe,EACf,qBAAqB,GACtB,MAAM,UAAU,CAAC;AAWlB,uBAAuB;AACvB,OAAO,EACL,cAAc,EACd,OAAO,EACP,WAAW,EACX,QAAQ,EACR,WAAW,EACX,aAAa,EACb,EAAE,EACF,EAAE,GACH,MAAM,iBAAiB,CAAC;AAGzB,sBAAsB;AACtB,OAAO,EACL,eAAe,EACf,kBAAkB,EAClB,YAAY,EACZ,iBAAiB,EACjB,kBAAkB,GACnB,MAAM,gBAAgB,CAAC;AAWxB,OAAO,EAAE,OAAO,EAAE,mBAAmB,EAAE,MAAM,iBAAiB,CAAC;AAC/D,OAAO,EAAE,WAAW,EAAE,uBAAuB,EAAE,MAAM,cAAc,CAAC;AAEpE,kDAAkD;AAClD,OAAO,EACL,eAAe,EACf,gBAAgB,EAChB,eAAe,EACf,aAAa,EACb,eAAe,EACf,mBAAmB,GACpB,MAAM,UAAU,CAAC;AAGlB,6BAA6B;AAC7B,OAAO,EAAE,cAAc,EAAE,oBAAoB,EAAE,MAAM,cAAc,CAAC;AAGpE,qEAAqE;AACrE,OAAO,EAAE,cAAc,EAAE,4BAA4B,EAAE,MAAM,aAAa,CAAC;AAG3E,kFAAkF;AAClF,kFAAkF;AAClF,wCAAwC;AACxC,OAAO,EAAE,cAAc,EAAE,YAAY,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAGzF,mEAAmE;AACnE,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AAGjE,gCAAgC;AAChC,OAAO,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAQ9C,0EAA0E;AAC1E,+EAA+E;AAC/E,8EAA8E;AAC9E,OAAO,EAAE,SAAS,EAAE,iBAAiB,EAAE,WAAW,EAAE,MAAM,WAAW,CAAC;AACtE,OAAO,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAEzD,8EAA8E;AAC9E,6EAA6E;AAC7E,2DAA2D;AAC3D,OAAO,EACL,eAAe,EACf,WAAW,EACX,iBAAiB,EACjB,WAAW,EACX,kBAAkB,EAClB,gBAAgB,EAChB,uBAAuB,EACvB,SAAS,EACT,WAAW,GACZ,MAAM,oBAAoB,CAAC;AAE5B,OAAO,EAAE,cAAc,EAAE,MAAM,oBAAoB,CAAC"}

package/dist/quality-gate.d.ts

@@ -0,0 +1,134 @@
+/**
+ * The failure that actually matters, and the four ways of getting it wrong.
+ *
+ * CI has been able to fail a build for tokens since 1.4 and for dollars since
+ * 1.21. A prompt edit that quietly made the product worse has never been
+ * gateable — which means every cost saving this tool has ever recommended went
+ * into a repository with its most important consequence unmeasured.
+ *
+ * ## This is a before-and-after, not an experiment
+ *
+ * Worth saying in the first paragraph, because the arithmetic is the same as
+ * `experiment`'s and the epistemics are not. An experiment splits traffic
+ * randomly, so the two arms differ only in the thing under test. A
+ * before-and-after splits it by **time**, and everything else that changed at
+ * the same time is in the difference too.
+ *
+ * So this module spends most of its code looking for reasons *not* to blame the
+ * prompt, and it reports `cannot-tell` far more readily than a randomised
+ * comparison would. That is not timidity. A gate that blames the prompt because
+ * the prompt is the thing it can see will be switched off within a month, and a
+ * switched-off gate catches nothing at all.
+ *
+ * ## The three confounders it can actually see
+ *
+ * **The model moved.** If the mix of models shifted across the boundary, the
+ * prompt is not the only variable, and the drop may be entirely somebody else's
+ * migration.
+ *
+ * **The volume moved.** A workload whose traffic tripled is usually a workload
+ * whose *population* changed — a new surface, a new customer, a marketing
+ * campaign — and the questions being asked are not the questions from before.
+ *
+ * **The coverage moved.** The subtle one, and the one nobody thinks of: if the
+ * share of calls recording an outcome changed, the two rates describe different
+ * populations. A team that started instrumenting its hard cases will see its
+ * measured rate fall without anything getting worse.
+ *
+ * Any of them present, and the verdict is `cannot-tell` with the confounder
+ * **named**. Not a hedge attached to a blame — a refusal to blame.
+ *
+ * ## What it cannot see, and says so
+ *
+ * Everything else deployed that day. This module has one label's numbers and no
+ * knowledge of the world, and it never pretends otherwise: a `dropped` verdict
+ * is a statement that the rate fell and the three things it can check did not
+ * move, which is a smaller claim than "the prompt did it" and is the largest
+ * claim the evidence supports.
+ */
+import type { ArmResult, ExperimentArm } from './experiment.js';
+import type { OutcomeVocabulary } from './outcome.js';
+/**
+ * Outcomes each side of the change needs before a verdict is offered.
+ *
+ * A hundred rather than the ten used for a rate elsewhere, because this one
+ * fails builds. The cost of a wrong `dropped` is somebody reverting a good
+ * change and losing the saving; the cost of a wrong `cannot-tell` is waiting a
+ * day. Those are not symmetric and the threshold is not either.
+ */
+export declare const MIN_OUTCOMES_EACH_SIDE = 100;
+/** How far the model mix may move before the comparison stops being about the prompt. */
+export declare const MAX_MODEL_MIX_DRIFT = 0.1;
+/**
+ * How far the call volume may move, as a ratio.
+ *
+ * Half again, either way. Ordinary week-to-week traffic moves less than that;
+ * a workload that doubled is usually a workload whose population changed.
+ */
+export declare const MAX_VOLUME_RATIO = 1.5;
+/** How far outcome coverage may move before the two rates describe different populations. */
+export declare const MAX_COVERAGE_DRIFT = 0.1;
+export type Confounder = {
+    kind: 'model-mix-moved';
+    drift: number;
+    model: string;
+} | {
+    kind: 'volume-moved';
+    beforeCalls: number;
+    afterCalls: number;
+    ratio: number;
+} | {
+    kind: 'coverage-moved';
+    before: number;
+    after: number;
+};
+export type GateVerdict = 'held' | 'dropped' | 'cannot-tell';
+export type GateUnknown = 'too-few-before' | 'too-few-after' | 'confounded' | 'no-vocabulary' | 'not-separable';
+/** One side of the boundary, as the caller measured it. */
+export interface GateSide {
+    arm: ExperimentArm;
+    /** Every call in the window, outcome or not — the coverage denominator. */
+    calls: number;
+    /** Spend per model, for the mix comparison. */
+    usdByModel: Array<{
+        model: string;
+        usd: number;
+    }>;
+}
+export interface QualityGate {
+    verdict: GateVerdict;
+    /** Why, when the verdict is `cannot-tell`. A refusal never arrives bare. */
+    unknown: GateUnknown | null;
+    before: ArmResult;
+    after: ArmResult;
+    /** The 95% interval on (after − before), or null. */
+    difference: {
+        point: number;
+        low: number;
+        high: number;
+    } | null;
+    /**
+     * Everything found that means the prompt is not the only variable.
+     *
+     * Non-empty forces `cannot-tell`. Reported even on a `held` verdict, because
+     * a rate that held while the model changed underneath is not evidence that
+     * the prompt is fine either.
+     */
+    confounders: Confounder[];
+    /**
+     * The cost half — measured, and kept beside the quality half rather than
+     * merged with it. The sentence teams argue about needs both.
+     */
+    cost: {
+        beforeUsdPerCall: number;
+        afterUsdPerCall: number;
+        deltaUsdPerCall: number;
+    } | null;
+    /** Outcomes behind the comparison, so the claim carries its own sample size. */
+    outcomes: {
+        before: number;
+        after: number;
+    };
+}
+export declare function qualityGate(before: GateSide, after: GateSide, vocabulary: OutcomeVocabulary | null): QualityGate;
+//# sourceMappingURL=quality-gate.d.ts.map

package/dist/quality-gate.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"quality-gate.d.ts","sourceRoot":"","sources":["../src/quality-gate.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+CG;AAGH,OAAO,KAAK,EAAE,SAAS,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChE,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,cAAc,CAAC;AAEtD;;;;;;;GAOG;AACH,eAAO,MAAM,sBAAsB,MAAM,CAAC;AAE1C,yFAAyF;AACzF,eAAO,MAAM,mBAAmB,MAAM,CAAC;AAEvC;;;;;GAKG;AACH,eAAO,MAAM,gBAAgB,MAAM,CAAC;AAEpC,6FAA6F;AAC7F,eAAO,MAAM,kBAAkB,MAAM,CAAC;AAEtC,MAAM,MAAM,UAAU,GAClB;IAAE,IAAI,EAAE,iBAAiB,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,GACzD;IAAE,IAAI,EAAE,cAAc,CAAC;IAAC,WAAW,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,GAChF;IAAE,IAAI,EAAE,gBAAgB,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,CAAC;AAE9D,MAAM,MAAM,WAAW,GAAG,MAAM,GAAG,SAAS,GAAG,aAAa,CAAC;AAE7D,MAAM,MAAM,WAAW,GACnB,gBAAgB,GAChB,eAAe,GACf,YAAY,GACZ,eAAe,GACf,eAAe,CAAC;AAEpB,2DAA2D;AAC3D,MAAM,WAAW,QAAQ;IACvB,GAAG,EAAE,aAAa,CAAC;IACnB,2EAA2E;IAC3E,KAAK,EAAE,MAAM,CAAC;IACd,+CAA+C;IAC/C,UAAU,EAAE,KAAK,CAAC;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,GAAG,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CACnD;AAED,MAAM,WAAW,WAAW;IAC1B,OAAO,EAAE,WAAW,CAAC;IACrB,4EAA4E;IAC5E,OAAO,EAAE,WAAW,GAAG,IAAI,CAAC;IAC5B,MAAM,EAAE,SAAS,CAAC;IAClB,KAAK,EAAE,SAAS,CAAC;IACjB,qDAAqD;IACrD,UAAU,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,GAAG,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,GAAG,IAAI,CAAC;IAChE;;;;;;OAMG;IACH,WAAW,EAAE,UAAU,EAAE,CAAC;IAC1B;;;OAGG;IACH,IAAI,EAAE;QAAE,gBAAgB,EAAE,MAAM,CAAC;QAAC,eAAe,EAAE,MAAM,CAAC;QAAC,eAAe,EAAE,MAAM,CAAA;KAAE,GAAG,IAAI,CAAC;IAC5F,gFAAgF;IAChF,QAAQ,EAAE;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC;CAC7C;AAwBD,wBAAgB,WAAW,CACzB,MAAM,EAAE,QAAQ,EAChB,KAAK,EAAE,QAAQ,EACf,UAAU,EAAE,iBAAiB,GAAG,IAAI,GACnC,WAAW,CAqGb"}

package/dist/quality-gate.js

@@ -0,0 +1,185 @@
+/**
+ * The failure that actually matters, and the four ways of getting it wrong.
+ *
+ * CI has been able to fail a build for tokens since 1.4 and for dollars since
+ * 1.21. A prompt edit that quietly made the product worse has never been
+ * gateable — which means every cost saving this tool has ever recommended went
+ * into a repository with its most important consequence unmeasured.
+ *
+ * ## This is a before-and-after, not an experiment
+ *
+ * Worth saying in the first paragraph, because the arithmetic is the same as
+ * `experiment`'s and the epistemics are not. An experiment splits traffic
+ * randomly, so the two arms differ only in the thing under test. A
+ * before-and-after splits it by **time**, and everything else that changed at
+ * the same time is in the difference too.
+ *
+ * So this module spends most of its code looking for reasons *not* to blame the
+ * prompt, and it reports `cannot-tell` far more readily than a randomised
+ * comparison would. That is not timidity. A gate that blames the prompt because
+ * the prompt is the thing it can see will be switched off within a month, and a
+ * switched-off gate catches nothing at all.
+ *
+ * ## The three confounders it can actually see
+ *
+ * **The model moved.** If the mix of models shifted across the boundary, the
+ * prompt is not the only variable, and the drop may be entirely somebody else's
+ * migration.
+ *
+ * **The volume moved.** A workload whose traffic tripled is usually a workload
+ * whose *population* changed — a new surface, a new customer, a marketing
+ * campaign — and the questions being asked are not the questions from before.
+ *
+ * **The coverage moved.** The subtle one, and the one nobody thinks of: if the
+ * share of calls recording an outcome changed, the two rates describe different
+ * populations. A team that started instrumenting its hard cases will see its
+ * measured rate fall without anything getting worse.
+ *
+ * Any of them present, and the verdict is `cannot-tell` with the confounder
+ * **named**. Not a hedge attached to a blame — a refusal to blame.
+ *
+ * ## What it cannot see, and says so
+ *
+ * Everything else deployed that day. This module has one label's numbers and no
+ * knowledge of the world, and it never pretends otherwise: a `dropped` verdict
+ * is a statement that the rate fell and the three things it can check did not
+ * move, which is a smaller claim than "the prompt did it" and is the largest
+ * claim the evidence supports.
+ */
+import { runExperiment } from './experiment.js';
+/**
+ * Outcomes each side of the change needs before a verdict is offered.
+ *
+ * A hundred rather than the ten used for a rate elsewhere, because this one
+ * fails builds. The cost of a wrong `dropped` is somebody reverting a good
+ * change and losing the saving; the cost of a wrong `cannot-tell` is waiting a
+ * day. Those are not symmetric and the threshold is not either.
+ */
+export const MIN_OUTCOMES_EACH_SIDE = 100;
+/** How far the model mix may move before the comparison stops being about the prompt. */
+export const MAX_MODEL_MIX_DRIFT = 0.1;
+/**
+ * How far the call volume may move, as a ratio.
+ *
+ * Half again, either way. Ordinary week-to-week traffic moves less than that;
+ * a workload that doubled is usually a workload whose population changed.
+ */
+export const MAX_VOLUME_RATIO = 1.5;
+/** How far outcome coverage may move before the two rates describe different populations. */
+export const MAX_COVERAGE_DRIFT = 0.1;
+function mixDrift(before, after) {
+    const share = (rows) => {
+        const total = rows.reduce((sum, row) => sum + row.usd, 0);
+        const out = new Map();
+        if (total <= 0)
+            return out;
+        for (const row of rows)
+            out.set(row.model, (out.get(row.model) ?? 0) + row.usd / total);
+        return out;
+    };
+    const a = share(before);
+    const b = share(after);
+    let worst = null;
+    for (const model of new Set([...a.keys(), ...b.keys()])) {
+        const drift = Math.abs((b.get(model) ?? 0) - (a.get(model) ?? 0));
+        if (worst === null || drift > worst.drift)
+            worst = { model, drift };
+    }
+    if (worst === null || worst.drift <= MAX_MODEL_MIX_DRIFT)
+        return null;
+    return { kind: 'model-mix-moved', drift: worst.drift, model: worst.model };
+}
+export function qualityGate(before, after, vocabulary) {
+    /**
+     * The statistics are `experiment`'s, deliberately.
+     *
+     * One implementation of a two-proportion comparison, so a gate and a
+     * deliberate experiment can never disagree about the same two numbers — the
+     * failure mode where a team runs both and gets two answers, then trusts
+     * whichever one they liked.
+     */
+    const stats = runExperiment({ arms: ['before', 'after'], minOutcomesPerArm: MIN_OUTCOMES_EACH_SIDE }, { a: { ...after.arm, name: 'after' }, b: { ...before.arm, name: 'before' } }, vocabulary);
+    const outcomes = { before: stats.b.recorded, after: stats.a.recorded };
+    const cost = before.calls > 0 && after.calls > 0
+        ? {
+            beforeUsdPerCall: before.arm.totalUsd / before.calls,
+            afterUsdPerCall: after.arm.totalUsd / after.calls,
+            deltaUsdPerCall: after.arm.totalUsd / after.calls - before.arm.totalUsd / before.calls,
+        }
+        : null;
+    const confounders = [];
+    const mix = mixDrift(before.usdByModel, after.usdByModel);
+    if (mix !== null)
+        confounders.push(mix);
+    if (before.calls > 0 && after.calls > 0) {
+        const ratio = after.calls / before.calls;
+        if (ratio > MAX_VOLUME_RATIO || ratio < 1 / MAX_VOLUME_RATIO) {
+            confounders.push({
+                kind: 'volume-moved',
+                beforeCalls: before.calls,
+                afterCalls: after.calls,
+                ratio,
+            });
+        }
+        /**
+         * Coverage, the one nobody thinks of.
+         *
+         * A team that starts instrumenting its hard cases sees its measured rate
+         * fall without anything having got worse. Comparing two rates over
+         * differently-selected populations is the most convincing wrong answer
+         * this module could produce.
+         */
+        const coverageBefore = outcomes.before / before.calls;
+        const coverageAfter = outcomes.after / after.calls;
+        if (Math.abs(coverageAfter - coverageBefore) > MAX_COVERAGE_DRIFT) {
+            confounders.push({ kind: 'coverage-moved', before: coverageBefore, after: coverageAfter });
+        }
+    }
+    const shell = {
+        before: stats.b,
+        after: stats.a,
+        difference: stats.difference,
+        confounders,
+        cost,
+        outcomes,
+    };
+    if (vocabulary === null || vocabulary.success.length === 0) {
+        return { ...shell, verdict: 'cannot-tell', unknown: 'no-vocabulary' };
+    }
+    if (outcomes.before < MIN_OUTCOMES_EACH_SIDE) {
+        return { ...shell, verdict: 'cannot-tell', unknown: 'too-few-before' };
+    }
+    if (outcomes.after < MIN_OUTCOMES_EACH_SIDE) {
+        return { ...shell, verdict: 'cannot-tell', unknown: 'too-few-after' };
+    }
+    /**
+     * A confounder outranks the statistics.
+     *
+     * Checked after the sample sizes and before the verdict, so a build is never
+     * failed on a difference that something else could equally explain. A gate
+     * that blames the prompt because the prompt is the thing it can see gets
+     * switched off within a month, and a switched-off gate catches nothing.
+     */
+    if (confounders.length > 0) {
+        return { ...shell, verdict: 'cannot-tell', unknown: 'confounded' };
+    }
+    if (stats.separation === 'not-separable') {
+        /**
+         * Not separable is `cannot-tell`, never `held`.
+         *
+         * "The rate did not measurably fall" and "the rate held" are different
+         * claims, and a gate that spells them the same way passes a real
+         * regression it merely lacked the power to see. `verify` has held this
+         * line since 1.39 and it matters more here, because this one is wired to
+         * an exit code.
+         */
+        return { ...shell, verdict: 'cannot-tell', unknown: 'not-separable' };
+    }
+    // `a` is the *after* arm, so `a-wins` means the rate went up.
+    return {
+        ...shell,
+        verdict: stats.separation === 'a-wins' ? 'held' : 'dropped',
+        unknown: null,
+    };
+}
+//# sourceMappingURL=quality-gate.js.map

package/dist/quality-gate.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"quality-gate.js","sourceRoot":"","sources":["../src/quality-gate.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+CG;AAEH,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAIhD;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,sBAAsB,GAAG,GAAG,CAAC;AAE1C,yFAAyF;AACzF,MAAM,CAAC,MAAM,mBAAmB,GAAG,GAAG,CAAC;AAEvC;;;;;GAKG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,GAAG,CAAC;AAEpC,6FAA6F;AAC7F,MAAM,CAAC,MAAM,kBAAkB,GAAG,GAAG,CAAC;AAkDtC,SAAS,QAAQ,CACf,MAA6C,EAC7C,KAA4C;IAE5C,MAAM,KAAK,GAAG,CAAC,IAA2C,EAAuB,EAAE;QACjF,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAC1D,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;QACtC,IAAI,KAAK,IAAI,CAAC;YAAE,OAAO,GAAG,CAAC;QAC3B,KAAK,MAAM,GAAG,IAAI,IAAI;YAAE,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,KAAK,CAAC,CAAC;QACxF,OAAO,GAAG,CAAC;IACb,CAAC,CAAC;IACF,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;IACxB,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;IACvB,IAAI,KAAK,GAA4C,IAAI,CAAC;IAC1D,KAAK,MAAM,KAAK,IAAI,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC;QACxD,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClE,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,GAAG,KAAK,CAAC,KAAK;YAAE,KAAK,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;IACtE,CAAC;IACD,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,CAAC,KAAK,IAAI,mBAAmB;QAAE,OAAO,IAAI,CAAC;IACtE,OAAO,EAAE,IAAI,EAAE,iBAAiB,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC;AAC7E,CAAC;AAED,MAAM,UAAU,WAAW,CACzB,MAAgB,EAChB,KAAe,EACf,UAAoC;IAEpC;;;;;;;OAOG;IACH,MAAM,KAAK,GAAG,aAAa,CACzB,EAAE,IAAI,EAAE,CAAC,QAAQ,EAAE,OAAO,CAAC,EAAE,iBAAiB,EAAE,sBAAsB,EAAE,EACxE,EAAE,CAAC,EAAE,EAAE,GAAG,KAAK,CAAC,GAAG,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,CAAC,EAAE,EAAE,GAAG,MAAM,CAAC,GAAG,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,EAC5E,UAAU,CACX,CAAC;IAEF,MAAM,QAAQ,GAAG,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IACvE,MAAM,IAAI,GACR,MAAM,CAAC,KAAK,GAAG,CAAC,IAAI,KAAK,CAAC,KAAK,GAAG,CAAC;QACjC,CAAC,CAAC;YACE,gBAAgB,EAAE,MAAM,CAAC,GAAG,CAAC,QAAQ,GAAG,MAAM,CAAC,KAAK;YACpD,eAAe,EAAE,KAAK,CAAC,GAAG,CAAC,QAAQ,GAAG,KAAK,CAAC,KAAK;YACjD,eAAe,EAAE,KAAK,CAAC,GAAG,CAAC,QAAQ,GAAG,KAAK,CAAC,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,QAAQ,GAAG,MAAM,CAAC,KAAK;SACvF;QACH,CAAC,CAAC,IAAI,CAAC;IAEX,MAAM,WAAW,GAAiB,EAAE,CAAC;IACrC,MAAM,GAAG,GAAG,QAAQ,CAAC,MAAM,CAAC,UAAU,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC;IAC1D,IAAI,GAAG,KAAK,IAAI;QAAE,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAExC,IAAI,MAAM,CAAC,KAAK,GAAG,CAAC,IAAI,KAAK,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC;QACxC,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC;QACzC,IAAI,KAAK,GAAG,gBAAgB,IAAI,KAAK,GAAG,CAAC,GAAG,gBAAgB,EAAE,CAAC;YAC7D,WAAW,CAAC,IAAI,CAAC;gBACf,IAAI,EAAE,cAAc;gBACpB,WAAW,EAAE,MAAM,CAAC,KAAK;gBACzB,UAAU,EAAE,KAAK,CAAC,KAAK;gBACvB,KAAK;aACN,CAAC,CAAC;QACL,CAAC;QACD;;;;;;;WAOG;QACH,MAAM,cAAc,GAAG,QAAQ,CAAC,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC;QACtD,MAAM,aAAa,GAAG,QAAQ,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QACnD,IAAI,IAAI,CAAC,GAAG,CAAC,aAAa,GAAG,cAAc,CAAC,GAAG,kBAAkB,EAAE,CAAC;YAClE,WAAW,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,gBAAgB,EAAE,MAAM,EAAE,cAAc,EAAE,KAAK,EAAE,aAAa,EAAE,CAAC,CAAC;QAC7F,CAAC;IACH,CAAC;IAED,MAAM,KAAK,GAAG;QACZ,MAAM,EAAE,KAAK,CAAC,CAAC;QACf,KAAK,EAAE,KAAK,CAAC,CAAC;QACd,UAAU,EAAE,KAAK,CAAC,UAAU;QAC5B,WAAW;QACX,IAAI;QACJ,QAAQ;KACT,CAAC;IAEF,IAAI,UAAU,KAAK,IAAI,IAAI,UAAU,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC3D,OAAO,EAAE,GAAG,KAAK,EAAE,OAAO,EAAE,aAAa,EAAE,OAAO,EAAE,eAAe,EAAE,CAAC;IACxE,CAAC;IACD,IAAI,QAAQ,CAAC,MAAM,GAAG,sBAAsB,EAAE,CAAC;QAC7C,OAAO,EAAE,GAAG,KAAK,EAAE,OAAO,EAAE,aAAa,EAAE,OAAO,EAAE,gBAAgB,EAAE,CAAC;IACzE,CAAC;IACD,IAAI,QAAQ,CAAC,KAAK,GAAG,sBAAsB,EAAE,CAAC;QAC5C,OAAO,EAAE,GAAG,KAAK,EAAE,OAAO,EAAE,aAAa,EAAE,OAAO,EAAE,eAAe,EAAE,CAAC;IACxE,CAAC;IACD;;;;;;;OAOG;IACH,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC3B,OAAO,EAAE,GAAG,KAAK,EAAE,OAAO,EAAE,aAAa,EAAE,OAAO,EAAE,YAAY,EAAE,CAAC;IACrE,CAAC;IACD,IAAI,KAAK,CAAC,UAAU,KAAK,eAAe,EAAE,CAAC;QACzC;;;;;;;;WAQG;QACH,OAAO,EAAE,GAAG,KAAK,EAAE,OAAO,EAAE,aAAa,EAAE,OAAO,EAAE,eAAe,EAAE,CAAC;IACxE,CAAC;IACD,8DAA8D;IAC9D,OAAO;QACL,GAAG,KAAK;QACR,OAAO,EAAE,KAAK,CAAC,UAAU,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS;QAC3D,OAAO,EAAE,IAAI;KACd,CAAC;AACJ,CAAC"}

package/dist/semantic.d.ts

@@ -0,0 +1,148 @@
+/**
+ * The findings the rules engine has deferred since 0.1.0, and the layer that
+ * throws most of them away.
+ *
+ * A dictionary cannot see meaning. Two few-shot examples teaching the same
+ * boundary in different words, an instruction restated four paragraphs later, a
+ * policy contradicted by a clarification — none of them are findable by
+ * pattern, and the near-copy detector deliberately does not flag them because
+ * flagging them would mean flagging everything.
+ *
+ * A model can see them. A model can also **invent** them, fluently, and a
+ * hallucinated finding is worse than a missed one: a missed finding costs
+ * somebody nothing, and an invented one costs them an afternoon and the next
+ * finding's credibility.
+ *
+ * ## The model proposes; this disposes
+ *
+ * The discipline `--suggest` has had since 1.6, applied to a harder claim. A
+ * rewrite suggestion is checkable by construction — the replacement is either
+ * shorter or it is not. A *semantic* finding is a claim about meaning, and the
+ * only part of it this layer can check is the **evidence**.
+ *
+ * So it checks the evidence, ruthlessly:
+ *
+ * 1. **Every quoted span must appear in the prompt character for character.**
+ *    The single strongest signal available. A model reporting on a prompt
+ *    while paraphrasing what it quotes has stopped reading and started
+ *    writing, and everything else it said in that response is suspect.
+ * 2. **The spans must be distinct and must not overlap.** A "pair" that is one
+ *    span quoted twice is not a finding about redundancy; it is a finding
+ *    about nothing.
+ * 3. **The near-copy detector must not already catch it.** A model paid to
+ *    re-report a finding the deterministic layer produces for free is a model
+ *    being paid for nothing, and the reader sees the same thing twice with two
+ *    different confidences attached.
+ * 4. **Nothing the model says about size is believed.** Tokens are counted
+ *    here, from the spans, with the same counter everything else uses.
+ *
+ * ## It never becomes a prerequisite
+ *
+ * The deterministic core keeps working with no key, no network and no model.
+ * This is a pass *on top*, and the rule from 0.1.0 stands unchanged — which is
+ * why the verification lives here, in the package that has no network, and the
+ * call lives in the CLI.
+ */
+import type { TokenCounter } from './types.js';
+export type SemanticKind = 
+/** Two spans teaching the same boundary in different words. */
+'paraphrase-pair'
+/** An instruction repeated in a distant part of the prompt. */
+ | 'restated-instruction'
+/** A policy and a later clarification that disagree. */
+ | 'contradiction';
+/** What the model returns, before anything has been checked. */
+export interface SemanticProposal {
+    kind: SemanticKind;
+    /** Two spans, quoted from the prompt. */
+    spans: [string, string];
+    /** One sentence saying what the relation is. Never used to decide anything. */
+    because: string;
+}
+export type SemanticRejection = 
+/** A span is not in the prompt. The model paraphrased its own evidence. */
+'span-not-found'
+/** The two spans are the same text. */
+ | 'spans-identical'
+/** The two spans overlap in the prompt. */
+ | 'spans-overlap'
+/** Near-identical: the deterministic detector already reports this for free. */
+ | 'already-detected'
+/**
+ * A contradiction whose spans are near-identical.
+ *
+ * Two spans that say the same thing cannot contradict each other, and a
+ * model that labels a near-copy a contradiction has mislabelled it — which
+ * makes every other label in the same response worth less.
+ */
+ | 'contradiction-of-a-copy'
+/** A duplicate of a finding already accepted. */
+ | 'duplicate';
+export interface SemanticFinding {
+    kind: SemanticKind;
+    spans: [string, string];
+    because: string;
+    /** Where each span sits, so a reader can go and look. */
+    offsets: [number, number];
+    /**
+     * Tokens the shorter span holds — a **ceiling** on what resolving this could
+     * save, and named as one.
+     *
+     * Not a saving. Resolving a paraphrase pair means rewriting both spans into
+     * one, and how much that recovers depends on what the merged version says,
+     * which nobody knows yet. The ceiling is the honest figure: it cannot save
+     * more than deleting the smaller half.
+     */
+    ceilingTokens: number;
+}
+export interface SemanticResult {
+    findings: SemanticFinding[];
+    rejected: Array<{
+        proposal: SemanticProposal;
+        reason: SemanticRejection;
+    }>;
+}
+/**
+ * How similar two spans may be before the deterministic detector owns them.
+ *
+ * **0.92, read off `rules.ts` rather than chosen.** The duplicate-example rule
+ * drops a few-shot example when its Jaccard similarity to a kept one is at
+ * least 0.92, so that is exactly the line above which a model is being paid to
+ * re-report something the rules engine produces for free.
+ *
+ * The first version of this file said 0.8 and claimed in a comment that it
+ * matched the deterministic pass. It did not, and the error ran the dangerous
+ * way: everything between 0.8 and 0.92 is a pair the rules engine does **not**
+ * catch, and this layer was silently throwing those away — discarding exactly
+ * the findings the chapter exists to surface, while a comment asserted the
+ * opposite.
+ */
+export declare const ALREADY_DETECTED_SIMILARITY = 0.92;
+export interface VerifyOptions {
+    tokenCounter?: TokenCounter;
+    /** Cap on findings, largest ceiling first. Defaults to 20. */
+    max?: number;
+}
+export declare function verifySemanticProposals(prompt: string, proposals: readonly SemanticProposal[], options?: VerifyOptions): SemanticResult;
+/**
+ * What running the pass costs, computed before it runs.
+ *
+ * A tool that spends somebody's money to tell them how to spend less must be
+ * the first thing audited by its own arithmetic. The figure is an estimate of
+ * one call — the prompt in, a small structured answer out — and it says which
+ * half is which by having only one half.
+ */
+export declare function semanticPassCost(prompt: string, rates: {
+    inputPerMTok: number;
+    outputPerMTok: number;
+}, options?: {
+    tokenCounter?: TokenCounter;
+    expectedOutputTokens?: number;
+}): {
+    inputTokens: number;
+    outputTokens: number;
+    usd: number;
+    provenance: 'estimated';
+};
+export declare const SEMANTIC_SYSTEM_PROMPT = "You find places where a prompt says the same thing twice in different words, or contradicts itself.\n\nReturn ONLY a JSON array. Each element is {\"kind\": \"...\", \"spans\": [\"...\", \"...\"], \"because\": \"...\"}.\n\n\"kind\" is one of:\n- \"paraphrase-pair\": two passages teaching the same rule or boundary in different words.\n- \"restated-instruction\": an instruction given once and then given again elsewhere.\n- \"contradiction\": two passages that cannot both be followed.\n\nRules:\n- Both strings in \"spans\" MUST be copied character for character from the prompt. Do not paraphrase them, do not fix their punctuation, do not trim them differently. If you cannot copy a passage exactly, leave the finding out.\n- The two spans must be different passages in different places. Never quote the same passage twice.\n- Do not report passages that are near-identical wordings of each other \u2014 those are already found without you. Report only pairs whose WORDS differ while their MEANING is the same.\n- \"because\" is one sentence naming the relation, for a human to read.\n- Prefer a few certain findings to many possible ones. Return [] if there is nothing you are sure of.\n\nNo explanation, no code fences, no commentary. The array alone.";
+//# sourceMappingURL=semantic.d.ts.map

package/dist/semantic.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"semantic.d.ts","sourceRoot":"","sources":["../src/semantic.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4CG;AAIH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAE/C,MAAM,MAAM,YAAY;AACtB,+DAA+D;AAC7D,iBAAiB;AACnB,+DAA+D;GAC7D,sBAAsB;AACxB,wDAAwD;GACtD,eAAe,CAAC;AAEpB,gEAAgE;AAChE,MAAM,WAAW,gBAAgB;IAC/B,IAAI,EAAE,YAAY,CAAC;IACnB,yCAAyC;IACzC,KAAK,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACxB,+EAA+E;IAC/E,OAAO,EAAE,MAAM,CAAC;CACjB;AAED,MAAM,MAAM,iBAAiB;AAC3B,2EAA2E;AACzE,gBAAgB;AAClB,uCAAuC;GACrC,iBAAiB;AACnB,2CAA2C;GACzC,eAAe;AACjB,gFAAgF;GAC9E,kBAAkB;AACpB;;;;;;GAMG;GACD,yBAAyB;AAC3B,iDAAiD;GAC/C,WAAW,CAAC;AAEhB,MAAM,WAAW,eAAe;IAC9B,IAAI,EAAE,YAAY,CAAC;IACnB,KAAK,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACxB,OAAO,EAAE,MAAM,CAAC;IAChB,yDAAyD;IACzD,OAAO,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC1B;;;;;;;;OAQG;IACH,aAAa,EAAE,MAAM,CAAC;CACvB;AAED,MAAM,WAAW,cAAc;IAC7B,QAAQ,EAAE,eAAe,EAAE,CAAC;IAC5B,QAAQ,EAAE,KAAK,CAAC;QAAE,QAAQ,EAAE,gBAAgB,CAAC;QAAC,MAAM,EAAE,iBAAiB,CAAA;KAAE,CAAC,CAAC;CAC5E;AAED;;;;;;;;;;;;;;GAcG;AACH,eAAO,MAAM,2BAA2B,OAAO,CAAC;AAEhD,MAAM,WAAW,aAAa;IAC5B,YAAY,CAAC,EAAE,YAAY,CAAC;IAC5B,8DAA8D;IAC9D,GAAG,CAAC,EAAE,MAAM,CAAC;CACd;AAED,wBAAgB,uBAAuB,CACrC,MAAM,EAAE,MAAM,EACd,SAAS,EAAE,SAAS,gBAAgB,EAAE,EACtC,OAAO,GAAE,aAAkB,GAC1B,cAAc,CAuEhB;AAED;;;;;;;GAOG;AACH,wBAAgB,gBAAgB,CAC9B,MAAM,EAAE,MAAM,EACd,KAAK,EAAE;IAAE,YAAY,EAAE,MAAM,CAAC;IAAC,aAAa,EAAE,MAAM,CAAA;CAAE,EACtD,OAAO,GAAE;IAAE,YAAY,CAAC,EAAE,YAAY,CAAC;IAAC,oBAAoB,CAAC,EAAE,MAAM,CAAA;CAAO,GAC3E;IAAE,WAAW,EAAE,MAAM,CAAC;IAAC,YAAY,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,WAAW,CAAA;CAAE,CAWrF;AAED,eAAO,MAAM,sBAAsB,6uCAgB6B,CAAC"}

package/dist/semantic.js

@@ -0,0 +1,163 @@
+/**
+ * The findings the rules engine has deferred since 0.1.0, and the layer that
+ * throws most of them away.
+ *
+ * A dictionary cannot see meaning. Two few-shot examples teaching the same
+ * boundary in different words, an instruction restated four paragraphs later, a
+ * policy contradicted by a clarification — none of them are findable by
+ * pattern, and the near-copy detector deliberately does not flag them because
+ * flagging them would mean flagging everything.
+ *
+ * A model can see them. A model can also **invent** them, fluently, and a
+ * hallucinated finding is worse than a missed one: a missed finding costs
+ * somebody nothing, and an invented one costs them an afternoon and the next
+ * finding's credibility.
+ *
+ * ## The model proposes; this disposes
+ *
+ * The discipline `--suggest` has had since 1.6, applied to a harder claim. A
+ * rewrite suggestion is checkable by construction — the replacement is either
+ * shorter or it is not. A *semantic* finding is a claim about meaning, and the
+ * only part of it this layer can check is the **evidence**.
+ *
+ * So it checks the evidence, ruthlessly:
+ *
+ * 1. **Every quoted span must appear in the prompt character for character.**
+ *    The single strongest signal available. A model reporting on a prompt
+ *    while paraphrasing what it quotes has stopped reading and started
+ *    writing, and everything else it said in that response is suspect.
+ * 2. **The spans must be distinct and must not overlap.** A "pair" that is one
+ *    span quoted twice is not a finding about redundancy; it is a finding
+ *    about nothing.
+ * 3. **The near-copy detector must not already catch it.** A model paid to
+ *    re-report a finding the deterministic layer produces for free is a model
+ *    being paid for nothing, and the reader sees the same thing twice with two
+ *    different confidences attached.
+ * 4. **Nothing the model says about size is believed.** Tokens are counted
+ *    here, from the spans, with the same counter everything else uses.
+ *
+ * ## It never becomes a prerequisite
+ *
+ * The deterministic core keeps working with no key, no network and no model.
+ * This is a pass *on top*, and the rule from 0.1.0 stands unchanged — which is
+ * why the verification lives here, in the package that has no network, and the
+ * call lives in the CLI.
+ */
+import { normalizeForCompare, jaccard } from './similarity.js';
+import { estimateTokens } from './tokenizer.js';
+/**
+ * How similar two spans may be before the deterministic detector owns them.
+ *
+ * **0.92, read off `rules.ts` rather than chosen.** The duplicate-example rule
+ * drops a few-shot example when its Jaccard similarity to a kept one is at
+ * least 0.92, so that is exactly the line above which a model is being paid to
+ * re-report something the rules engine produces for free.
+ *
+ * The first version of this file said 0.8 and claimed in a comment that it
+ * matched the deterministic pass. It did not, and the error ran the dangerous
+ * way: everything between 0.8 and 0.92 is a pair the rules engine does **not**
+ * catch, and this layer was silently throwing those away — discarding exactly
+ * the findings the chapter exists to surface, while a comment asserted the
+ * opposite.
+ */
+export const ALREADY_DETECTED_SIMILARITY = 0.92;
+export function verifySemanticProposals(prompt, proposals, options = {}) {
+    const { tokenCounter = estimateTokens, max = 20 } = options;
+    const findings = [];
+    const rejected = [];
+    const claimed = [];
+    for (const proposal of proposals) {
+        const [first, second] = proposal.spans;
+        const a = prompt.indexOf(first);
+        const b = prompt.indexOf(second);
+        if (a === -1 || b === -1) {
+            // The strongest check there is. A model that paraphrases what it quotes
+            // has stopped reading the prompt and started writing about it.
+            rejected.push({ proposal, reason: 'span-not-found' });
+            continue;
+        }
+        if (first === second) {
+            rejected.push({ proposal, reason: 'spans-identical' });
+            continue;
+        }
+        const aEnd = a + first.length;
+        const bEnd = b + second.length;
+        if (a < bEnd && b < aEnd) {
+            rejected.push({ proposal, reason: 'spans-overlap' });
+            continue;
+        }
+        const similarity = jaccard(normalizeForCompare(first), normalizeForCompare(second));
+        if (proposal.kind === 'contradiction' && similarity >= ALREADY_DETECTED_SIMILARITY) {
+            rejected.push({ proposal, reason: 'contradiction-of-a-copy' });
+            continue;
+        }
+        if (proposal.kind !== 'contradiction' && similarity >= ALREADY_DETECTED_SIMILARITY) {
+            rejected.push({ proposal, reason: 'already-detected' });
+            continue;
+        }
+        /**
+         * A finding covering ground an accepted one already covers.
+         *
+         * Overlap against what has been *accepted*, not against every proposal —
+         * so a rejected finding never blocks a good one that touches the same
+         * paragraph.
+         */
+        const overlapsAccepted = claimed.some(([start, end]) => (a < end && start < aEnd) || (b < end && start < bEnd));
+        if (overlapsAccepted) {
+            rejected.push({ proposal, reason: 'duplicate' });
+            continue;
+        }
+        claimed.push([a, aEnd], [b, bEnd]);
+        findings.push({
+            kind: proposal.kind,
+            spans: proposal.spans,
+            because: proposal.because,
+            offsets: [a, b],
+            // Counted here, from the spans. Nothing the model said about size is
+            // believed, and a contradiction saves nothing by being resolved — the
+            // point of finding one is that the prompt is wrong, not that it is long.
+            ceilingTokens: proposal.kind === 'contradiction'
+                ? 0
+                : Math.min(tokenCounter(first), tokenCounter(second)),
+        });
+    }
+    findings.sort((x, y) => y.ceilingTokens - x.ceilingTokens);
+    return { findings: findings.slice(0, max), rejected };
+}
+/**
+ * What running the pass costs, computed before it runs.
+ *
+ * A tool that spends somebody's money to tell them how to spend less must be
+ * the first thing audited by its own arithmetic. The figure is an estimate of
+ * one call — the prompt in, a small structured answer out — and it says which
+ * half is which by having only one half.
+ */
+export function semanticPassCost(prompt, rates, options = {}) {
+    const { tokenCounter = estimateTokens, expectedOutputTokens = 800 } = options;
+    const inputTokens = tokenCounter(prompt) + tokenCounter(SEMANTIC_SYSTEM_PROMPT);
+    return {
+        inputTokens,
+        outputTokens: expectedOutputTokens,
+        usd: (inputTokens / 1_000_000) * rates.inputPerMTok +
+            (expectedOutputTokens / 1_000_000) * rates.outputPerMTok,
+        provenance: 'estimated',
+    };
+}
+export const SEMANTIC_SYSTEM_PROMPT = `You find places where a prompt says the same thing twice in different words, or contradicts itself.
+
+Return ONLY a JSON array. Each element is {"kind": "...", "spans": ["...", "..."], "because": "..."}.
+
+"kind" is one of:
+- "paraphrase-pair": two passages teaching the same rule or boundary in different words.
+- "restated-instruction": an instruction given once and then given again elsewhere.
+- "contradiction": two passages that cannot both be followed.
+
+Rules:
+- Both strings in "spans" MUST be copied character for character from the prompt. Do not paraphrase them, do not fix their punctuation, do not trim them differently. If you cannot copy a passage exactly, leave the finding out.
+- The two spans must be different passages in different places. Never quote the same passage twice.
+- Do not report passages that are near-identical wordings of each other — those are already found without you. Report only pairs whose WORDS differ while their MEANING is the same.
+- "because" is one sentence naming the relation, for a human to read.
+- Prefer a few certain findings to many possible ones. Return [] if there is nothing you are sure of.
+
+No explanation, no code fences, no commentary. The array alone.`;
+//# sourceMappingURL=semantic.js.map

package/dist/semantic.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"semantic.js","sourceRoot":"","sources":["../src/semantic.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4CG;AAEH,OAAO,EAAE,mBAAmB,EAAE,OAAO,EAAE,MAAM,iBAAiB,CAAC;AAC/D,OAAO,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAC;AA+DhD;;;;;;;;;;;;;;GAcG;AACH,MAAM,CAAC,MAAM,2BAA2B,GAAG,IAAI,CAAC;AAQhD,MAAM,UAAU,uBAAuB,CACrC,MAAc,EACd,SAAsC,EACtC,OAAO,GAAkB,EAAE;IAE3B,MAAM,EAAE,YAAY,GAAG,cAAc,EAAE,GAAG,GAAG,EAAE,EAAE,GAAG,OAAO,CAAC;IAC5D,MAAM,QAAQ,GAAsB,EAAE,CAAC;IACvC,MAAM,QAAQ,GAA+B,EAAE,CAAC;IAChD,MAAM,OAAO,GAA4B,EAAE,CAAC;IAE5C,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;QACjC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC;QAEvC,MAAM,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAChC,MAAM,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QACjC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;YACzB,wEAAwE;YACxE,+DAA+D;YAC/D,QAAQ,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,MAAM,EAAE,gBAAgB,EAAE,CAAC,CAAC;YACtD,SAAS;QACX,CAAC;QACD,IAAI,KAAK,KAAK,MAAM,EAAE,CAAC;YACrB,QAAQ,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,MAAM,EAAE,iBAAiB,EAAE,CAAC,CAAC;YACvD,SAAS;QACX,CAAC;QACD,MAAM,IAAI,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;QAC9B,MAAM,IAAI,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;QAC/B,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC;YACzB,QAAQ,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,MAAM,EAAE,eAAe,EAAE,CAAC,CAAC;YACrD,SAAS;QACX,CAAC;QAED,MAAM,UAAU,GAAG,OAAO,CAAC,mBAAmB,CAAC,KAAK,CAAC,EAAE,mBAAmB,CAAC,MAAM,CAAC,CAAC,CAAC;QACpF,IAAI,QAAQ,CAAC,IAAI,KAAK,eAAe,IAAI,UAAU,IAAI,2BAA2B,EAAE,CAAC;YACnF,QAAQ,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,MAAM,EAAE,yBAAyB,EAAE,CAAC,CAAC;YAC/D,SAAS;QACX,CAAC;QACD,IAAI,QAAQ,CAAC,IAAI,KAAK,eAAe,IAAI,UAAU,IAAI,2BAA2B,EAAE,CAAC;YACnF,QAAQ,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,MAAM,EAAE,kBAAkB,EAAE,CAAC,CAAC;YACxD,SAAS;QACX,CAAC;QAED;;;;;;WAMG;QACH,MAAM,gBAAgB,GAAG,OAAO,CAAC,IAAI,CACnC,CAAC,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,IAAI,KAAK,GAAG,IAAI,CAAC,CACzE,CAAC;QACF,IAAI,gBAAgB,EAAE,CAAC;YACrB,QAAQ,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC,CAAC;YACjD,SAAS;QACX,CAAC;QAED,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;QACnC,QAAQ,CAAC,IAAI,CAAC;YACZ,IAAI,EAAE,QAAQ,CAAC,IAAI;YACnB,KAAK,EAAE,QAAQ,CAAC,KAAK;YACrB,OAAO,EAAE,QAAQ,CAAC,OAAO;YACzB,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;YACf,qEAAqE;YACrE,sEAAsE;YACtE,yEAAyE;YACzE,aAAa,EACX,QAAQ,CAAC,IAAI,KAAK,eAAe;gBAC/B,CAAC,CAAC,CAAC;gBACH,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,YAAY,CAAC,MAAM,CAAC,CAAC;SAC1D,CAAC,CAAC;IACL,CAAC;IAED,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,GAAG,CAAC,CAAC,aAAa,CAAC,CAAC;IAC3D,OAAO,EAAE,QAAQ,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,QAAQ,EAAE,CAAC;AACxD,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,gBAAgB,CAC9B,MAAc,EACd,KAAsD,EACtD,OAAO,GAAmE,EAAE;IAE5E,MAAM,EAAE,YAAY,GAAG,cAAc,EAAE,oBAAoB,GAAG,GAAG,EAAE,GAAG,OAAO,CAAC;IAC9E,MAAM,WAAW,GAAG,YAAY,CAAC,MAAM,CAAC,GAAG,YAAY,CAAC,sBAAsB,CAAC,CAAC;IAChF,OAAO;QACL,WAAW;QACX,YAAY,EAAE,oBAAoB;QAClC,GAAG,EACD,CAAC,WAAW,GAAG,SAAS,CAAC,GAAG,KAAK,CAAC,YAAY;YAC9C,CAAC,oBAAoB,GAAG,SAAS,CAAC,GAAG,KAAK,CAAC,aAAa;QAC1D,UAAU,EAAE,WAAW;KACxB,CAAC;AACJ,CAAC;AAED,MAAM,CAAC,MAAM,sBAAsB,GAAG;;;;;;;;;;;;;;;;gEAgB0B,CAAC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@trazum/core",
-  "version": "1.50.7",
+  "version": "1.50.9",
   "description": "Trazum core: priced advisories for LLM prompts (caching, model tier, batching, schemas), plus deterministic trimming, token counting and pricing.",
   "license": "MIT",
   "author": "David Mu\u00f1oz Rey",

package/src/index.ts

@@ -50,7 +50,28 @@ export type { PlanAction, PlanActionKind, PlanAssumption, PlanDocument } from '.
 export { verifyPlan } from './verify.js';
 export { buildHistory, storedReportFrom, MIN_RUN } from './history.js';
 export { outcomeReport, judgeOutcome, OUTCOME_UNLOCKS } from './outcome.js';
+export {
+  verifySemanticProposals,
+  semanticPassCost,
+  SEMANTIC_SYSTEM_PROMPT,
+  ALREADY_DETECTED_SIMILARITY,
+} from './semantic.js';
+export type {
+  SemanticFinding,
+  SemanticKind,
+  SemanticProposal,
+  SemanticRejection,
+  SemanticResult,
+} from './semantic.js';
 export { runExperiment } from './experiment.js';
+export {
+  qualityGate,
+  MIN_OUTCOMES_EACH_SIDE,
+  MAX_MODEL_MIX_DRIFT,
+  MAX_VOLUME_RATIO,
+  MAX_COVERAGE_DRIFT,
+} from './quality-gate.js';
+export type { Confounder, GateSide, GateUnknown, GateVerdict, QualityGate } from './quality-gate.js';
 export type {
   ArmResult,
   ExperimentArm,

package/src/quality-gate.ts

@@ -0,0 +1,253 @@
+/**
+ * The failure that actually matters, and the four ways of getting it wrong.
+ *
+ * CI has been able to fail a build for tokens since 1.4 and for dollars since
+ * 1.21. A prompt edit that quietly made the product worse has never been
+ * gateable — which means every cost saving this tool has ever recommended went
+ * into a repository with its most important consequence unmeasured.
+ *
+ * ## This is a before-and-after, not an experiment
+ *
+ * Worth saying in the first paragraph, because the arithmetic is the same as
+ * `experiment`'s and the epistemics are not. An experiment splits traffic
+ * randomly, so the two arms differ only in the thing under test. A
+ * before-and-after splits it by **time**, and everything else that changed at
+ * the same time is in the difference too.
+ *
+ * So this module spends most of its code looking for reasons *not* to blame the
+ * prompt, and it reports `cannot-tell` far more readily than a randomised
+ * comparison would. That is not timidity. A gate that blames the prompt because
+ * the prompt is the thing it can see will be switched off within a month, and a
+ * switched-off gate catches nothing at all.
+ *
+ * ## The three confounders it can actually see
+ *
+ * **The model moved.** If the mix of models shifted across the boundary, the
+ * prompt is not the only variable, and the drop may be entirely somebody else's
+ * migration.
+ *
+ * **The volume moved.** A workload whose traffic tripled is usually a workload
+ * whose *population* changed — a new surface, a new customer, a marketing
+ * campaign — and the questions being asked are not the questions from before.
+ *
+ * **The coverage moved.** The subtle one, and the one nobody thinks of: if the
+ * share of calls recording an outcome changed, the two rates describe different
+ * populations. A team that started instrumenting its hard cases will see its
+ * measured rate fall without anything getting worse.
+ *
+ * Any of them present, and the verdict is `cannot-tell` with the confounder
+ * **named**. Not a hedge attached to a blame — a refusal to blame.
+ *
+ * ## What it cannot see, and says so
+ *
+ * Everything else deployed that day. This module has one label's numbers and no
+ * knowledge of the world, and it never pretends otherwise: a `dropped` verdict
+ * is a statement that the rate fell and the three things it can check did not
+ * move, which is a smaller claim than "the prompt did it" and is the largest
+ * claim the evidence supports.
+ */
+
+import { runExperiment } from './experiment.js';
+import type { ArmResult, ExperimentArm } from './experiment.js';
+import type { OutcomeVocabulary } from './outcome.js';
+
+/**
+ * Outcomes each side of the change needs before a verdict is offered.
+ *
+ * A hundred rather than the ten used for a rate elsewhere, because this one
+ * fails builds. The cost of a wrong `dropped` is somebody reverting a good
+ * change and losing the saving; the cost of a wrong `cannot-tell` is waiting a
+ * day. Those are not symmetric and the threshold is not either.
+ */
+export const MIN_OUTCOMES_EACH_SIDE = 100;
+
+/** How far the model mix may move before the comparison stops being about the prompt. */
+export const MAX_MODEL_MIX_DRIFT = 0.1;
+
+/**
+ * How far the call volume may move, as a ratio.
+ *
+ * Half again, either way. Ordinary week-to-week traffic moves less than that;
+ * a workload that doubled is usually a workload whose population changed.
+ */
+export const MAX_VOLUME_RATIO = 1.5;
+
+/** How far outcome coverage may move before the two rates describe different populations. */
+export const MAX_COVERAGE_DRIFT = 0.1;
+
+export type Confounder =
+  | { kind: 'model-mix-moved'; drift: number; model: string }
+  | { kind: 'volume-moved'; beforeCalls: number; afterCalls: number; ratio: number }
+  | { kind: 'coverage-moved'; before: number; after: number };
+
+export type GateVerdict = 'held' | 'dropped' | 'cannot-tell';
+
+export type GateUnknown =
+  | 'too-few-before'
+  | 'too-few-after'
+  | 'confounded'
+  | 'no-vocabulary'
+  | 'not-separable';
+
+/** One side of the boundary, as the caller measured it. */
+export interface GateSide {
+  arm: ExperimentArm;
+  /** Every call in the window, outcome or not — the coverage denominator. */
+  calls: number;
+  /** Spend per model, for the mix comparison. */
+  usdByModel: Array<{ model: string; usd: number }>;
+}
+
+export interface QualityGate {
+  verdict: GateVerdict;
+  /** Why, when the verdict is `cannot-tell`. A refusal never arrives bare. */
+  unknown: GateUnknown | null;
+  before: ArmResult;
+  after: ArmResult;
+  /** The 95% interval on (after − before), or null. */
+  difference: { point: number; low: number; high: number } | null;
+  /**
+   * Everything found that means the prompt is not the only variable.
+   *
+   * Non-empty forces `cannot-tell`. Reported even on a `held` verdict, because
+   * a rate that held while the model changed underneath is not evidence that
+   * the prompt is fine either.
+   */
+  confounders: Confounder[];
+  /**
+   * The cost half — measured, and kept beside the quality half rather than
+   * merged with it. The sentence teams argue about needs both.
+   */
+  cost: { beforeUsdPerCall: number; afterUsdPerCall: number; deltaUsdPerCall: number } | null;
+  /** Outcomes behind the comparison, so the claim carries its own sample size. */
+  outcomes: { before: number; after: number };
+}
+
+function mixDrift(
+  before: Array<{ model: string; usd: number }>,
+  after: Array<{ model: string; usd: number }>,
+): Confounder | null {
+  const share = (rows: Array<{ model: string; usd: number }>): Map<string, number> => {
+    const total = rows.reduce((sum, row) => sum + row.usd, 0);
+    const out = new Map<string, number>();
+    if (total <= 0) return out;
+    for (const row of rows) out.set(row.model, (out.get(row.model) ?? 0) + row.usd / total);
+    return out;
+  };
+  const a = share(before);
+  const b = share(after);
+  let worst: { model: string; drift: number } | null = null;
+  for (const model of new Set([...a.keys(), ...b.keys()])) {
+    const drift = Math.abs((b.get(model) ?? 0) - (a.get(model) ?? 0));
+    if (worst === null || drift > worst.drift) worst = { model, drift };
+  }
+  if (worst === null || worst.drift <= MAX_MODEL_MIX_DRIFT) return null;
+  return { kind: 'model-mix-moved', drift: worst.drift, model: worst.model };
+}
+
+export function qualityGate(
+  before: GateSide,
+  after: GateSide,
+  vocabulary: OutcomeVocabulary | null,
+): QualityGate {
+  /**
+   * The statistics are `experiment`'s, deliberately.
+   *
+   * One implementation of a two-proportion comparison, so a gate and a
+   * deliberate experiment can never disagree about the same two numbers — the
+   * failure mode where a team runs both and gets two answers, then trusts
+   * whichever one they liked.
+   */
+  const stats = runExperiment(
+    { arms: ['before', 'after'], minOutcomesPerArm: MIN_OUTCOMES_EACH_SIDE },
+    { a: { ...after.arm, name: 'after' }, b: { ...before.arm, name: 'before' } },
+    vocabulary,
+  );
+
+  const outcomes = { before: stats.b.recorded, after: stats.a.recorded };
+  const cost =
+    before.calls > 0 && after.calls > 0
+      ? {
+          beforeUsdPerCall: before.arm.totalUsd / before.calls,
+          afterUsdPerCall: after.arm.totalUsd / after.calls,
+          deltaUsdPerCall: after.arm.totalUsd / after.calls - before.arm.totalUsd / before.calls,
+        }
+      : null;
+
+  const confounders: Confounder[] = [];
+  const mix = mixDrift(before.usdByModel, after.usdByModel);
+  if (mix !== null) confounders.push(mix);
+
+  if (before.calls > 0 && after.calls > 0) {
+    const ratio = after.calls / before.calls;
+    if (ratio > MAX_VOLUME_RATIO || ratio < 1 / MAX_VOLUME_RATIO) {
+      confounders.push({
+        kind: 'volume-moved',
+        beforeCalls: before.calls,
+        afterCalls: after.calls,
+        ratio,
+      });
+    }
+    /**
+     * Coverage, the one nobody thinks of.
+     *
+     * A team that starts instrumenting its hard cases sees its measured rate
+     * fall without anything having got worse. Comparing two rates over
+     * differently-selected populations is the most convincing wrong answer
+     * this module could produce.
+     */
+    const coverageBefore = outcomes.before / before.calls;
+    const coverageAfter = outcomes.after / after.calls;
+    if (Math.abs(coverageAfter - coverageBefore) > MAX_COVERAGE_DRIFT) {
+      confounders.push({ kind: 'coverage-moved', before: coverageBefore, after: coverageAfter });
+    }
+  }
+
+  const shell = {
+    before: stats.b,
+    after: stats.a,
+    difference: stats.difference,
+    confounders,
+    cost,
+    outcomes,
+  };
+
+  if (vocabulary === null || vocabulary.success.length === 0) {
+    return { ...shell, verdict: 'cannot-tell', unknown: 'no-vocabulary' };
+  }
+  if (outcomes.before < MIN_OUTCOMES_EACH_SIDE) {
+    return { ...shell, verdict: 'cannot-tell', unknown: 'too-few-before' };
+  }
+  if (outcomes.after < MIN_OUTCOMES_EACH_SIDE) {
+    return { ...shell, verdict: 'cannot-tell', unknown: 'too-few-after' };
+  }
+  /**
+   * A confounder outranks the statistics.
+   *
+   * Checked after the sample sizes and before the verdict, so a build is never
+   * failed on a difference that something else could equally explain. A gate
+   * that blames the prompt because the prompt is the thing it can see gets
+   * switched off within a month, and a switched-off gate catches nothing.
+   */
+  if (confounders.length > 0) {
+    return { ...shell, verdict: 'cannot-tell', unknown: 'confounded' };
+  }
+  if (stats.separation === 'not-separable') {
+    /**
+     * Not separable is `cannot-tell`, never `held`.
+     *
+     * "The rate did not measurably fall" and "the rate held" are different
+     * claims, and a gate that spells them the same way passes a real
+     * regression it merely lacked the power to see. `verify` has held this
+     * line since 1.39 and it matters more here, because this one is wired to
+     * an exit code.
+     */
+    return { ...shell, verdict: 'cannot-tell', unknown: 'not-separable' };
+  }
+  // `a` is the *after* arm, so `a-wins` means the rate went up.
+  return {
+    ...shell,
+    verdict: stats.separation === 'a-wins' ? 'held' : 'dropped',
+    unknown: null,
+  };
+}

package/src/semantic.ts

@@ -0,0 +1,252 @@
+/**
+ * The findings the rules engine has deferred since 0.1.0, and the layer that
+ * throws most of them away.
+ *
+ * A dictionary cannot see meaning. Two few-shot examples teaching the same
+ * boundary in different words, an instruction restated four paragraphs later, a
+ * policy contradicted by a clarification — none of them are findable by
+ * pattern, and the near-copy detector deliberately does not flag them because
+ * flagging them would mean flagging everything.
+ *
+ * A model can see them. A model can also **invent** them, fluently, and a
+ * hallucinated finding is worse than a missed one: a missed finding costs
+ * somebody nothing, and an invented one costs them an afternoon and the next
+ * finding's credibility.
+ *
+ * ## The model proposes; this disposes
+ *
+ * The discipline `--suggest` has had since 1.6, applied to a harder claim. A
+ * rewrite suggestion is checkable by construction — the replacement is either
+ * shorter or it is not. A *semantic* finding is a claim about meaning, and the
+ * only part of it this layer can check is the **evidence**.
+ *
+ * So it checks the evidence, ruthlessly:
+ *
+ * 1. **Every quoted span must appear in the prompt character for character.**
+ *    The single strongest signal available. A model reporting on a prompt
+ *    while paraphrasing what it quotes has stopped reading and started
+ *    writing, and everything else it said in that response is suspect.
+ * 2. **The spans must be distinct and must not overlap.** A "pair" that is one
+ *    span quoted twice is not a finding about redundancy; it is a finding
+ *    about nothing.
+ * 3. **The near-copy detector must not already catch it.** A model paid to
+ *    re-report a finding the deterministic layer produces for free is a model
+ *    being paid for nothing, and the reader sees the same thing twice with two
+ *    different confidences attached.
+ * 4. **Nothing the model says about size is believed.** Tokens are counted
+ *    here, from the spans, with the same counter everything else uses.
+ *
+ * ## It never becomes a prerequisite
+ *
+ * The deterministic core keeps working with no key, no network and no model.
+ * This is a pass *on top*, and the rule from 0.1.0 stands unchanged — which is
+ * why the verification lives here, in the package that has no network, and the
+ * call lives in the CLI.
+ */
+
+import { normalizeForCompare, jaccard } from './similarity.js';
+import { estimateTokens } from './tokenizer.js';
+import type { TokenCounter } from './types.js';
+
+export type SemanticKind =
+  /** Two spans teaching the same boundary in different words. */
+  | 'paraphrase-pair'
+  /** An instruction repeated in a distant part of the prompt. */
+  | 'restated-instruction'
+  /** A policy and a later clarification that disagree. */
+  | 'contradiction';
+
+/** What the model returns, before anything has been checked. */
+export interface SemanticProposal {
+  kind: SemanticKind;
+  /** Two spans, quoted from the prompt. */
+  spans: [string, string];
+  /** One sentence saying what the relation is. Never used to decide anything. */
+  because: string;
+}
+
+export type SemanticRejection =
+  /** A span is not in the prompt. The model paraphrased its own evidence. */
+  | 'span-not-found'
+  /** The two spans are the same text. */
+  | 'spans-identical'
+  /** The two spans overlap in the prompt. */
+  | 'spans-overlap'
+  /** Near-identical: the deterministic detector already reports this for free. */
+  | 'already-detected'
+  /**
+   * A contradiction whose spans are near-identical.
+   *
+   * Two spans that say the same thing cannot contradict each other, and a
+   * model that labels a near-copy a contradiction has mislabelled it — which
+   * makes every other label in the same response worth less.
+   */
+  | 'contradiction-of-a-copy'
+  /** A duplicate of a finding already accepted. */
+  | 'duplicate';
+
+export interface SemanticFinding {
+  kind: SemanticKind;
+  spans: [string, string];
+  because: string;
+  /** Where each span sits, so a reader can go and look. */
+  offsets: [number, number];
+  /**
+   * Tokens the shorter span holds — a **ceiling** on what resolving this could
+   * save, and named as one.
+   *
+   * Not a saving. Resolving a paraphrase pair means rewriting both spans into
+   * one, and how much that recovers depends on what the merged version says,
+   * which nobody knows yet. The ceiling is the honest figure: it cannot save
+   * more than deleting the smaller half.
+   */
+  ceilingTokens: number;
+}
+
+export interface SemanticResult {
+  findings: SemanticFinding[];
+  rejected: Array<{ proposal: SemanticProposal; reason: SemanticRejection }>;
+}
+
+/**
+ * How similar two spans may be before the deterministic detector owns them.
+ *
+ * **0.92, read off `rules.ts` rather than chosen.** The duplicate-example rule
+ * drops a few-shot example when its Jaccard similarity to a kept one is at
+ * least 0.92, so that is exactly the line above which a model is being paid to
+ * re-report something the rules engine produces for free.
+ *
+ * The first version of this file said 0.8 and claimed in a comment that it
+ * matched the deterministic pass. It did not, and the error ran the dangerous
+ * way: everything between 0.8 and 0.92 is a pair the rules engine does **not**
+ * catch, and this layer was silently throwing those away — discarding exactly
+ * the findings the chapter exists to surface, while a comment asserted the
+ * opposite.
+ */
+export const ALREADY_DETECTED_SIMILARITY = 0.92;
+
+export interface VerifyOptions {
+  tokenCounter?: TokenCounter;
+  /** Cap on findings, largest ceiling first. Defaults to 20. */
+  max?: number;
+}
+
+export function verifySemanticProposals(
+  prompt: string,
+  proposals: readonly SemanticProposal[],
+  options: VerifyOptions = {},
+): SemanticResult {
+  const { tokenCounter = estimateTokens, max = 20 } = options;
+  const findings: SemanticFinding[] = [];
+  const rejected: SemanticResult['rejected'] = [];
+  const claimed: Array<[number, number]> = [];
+
+  for (const proposal of proposals) {
+    const [first, second] = proposal.spans;
+
+    const a = prompt.indexOf(first);
+    const b = prompt.indexOf(second);
+    if (a === -1 || b === -1) {
+      // The strongest check there is. A model that paraphrases what it quotes
+      // has stopped reading the prompt and started writing about it.
+      rejected.push({ proposal, reason: 'span-not-found' });
+      continue;
+    }
+    if (first === second) {
+      rejected.push({ proposal, reason: 'spans-identical' });
+      continue;
+    }
+    const aEnd = a + first.length;
+    const bEnd = b + second.length;
+    if (a < bEnd && b < aEnd) {
+      rejected.push({ proposal, reason: 'spans-overlap' });
+      continue;
+    }
+
+    const similarity = jaccard(normalizeForCompare(first), normalizeForCompare(second));
+    if (proposal.kind === 'contradiction' && similarity >= ALREADY_DETECTED_SIMILARITY) {
+      rejected.push({ proposal, reason: 'contradiction-of-a-copy' });
+      continue;
+    }
+    if (proposal.kind !== 'contradiction' && similarity >= ALREADY_DETECTED_SIMILARITY) {
+      rejected.push({ proposal, reason: 'already-detected' });
+      continue;
+    }
+
+    /**
+     * A finding covering ground an accepted one already covers.
+     *
+     * Overlap against what has been *accepted*, not against every proposal —
+     * so a rejected finding never blocks a good one that touches the same
+     * paragraph.
+     */
+    const overlapsAccepted = claimed.some(
+      ([start, end]) => (a < end && start < aEnd) || (b < end && start < bEnd),
+    );
+    if (overlapsAccepted) {
+      rejected.push({ proposal, reason: 'duplicate' });
+      continue;
+    }
+
+    claimed.push([a, aEnd], [b, bEnd]);
+    findings.push({
+      kind: proposal.kind,
+      spans: proposal.spans,
+      because: proposal.because,
+      offsets: [a, b],
+      // Counted here, from the spans. Nothing the model said about size is
+      // believed, and a contradiction saves nothing by being resolved — the
+      // point of finding one is that the prompt is wrong, not that it is long.
+      ceilingTokens:
+        proposal.kind === 'contradiction'
+          ? 0
+          : Math.min(tokenCounter(first), tokenCounter(second)),
+    });
+  }
+
+  findings.sort((x, y) => y.ceilingTokens - x.ceilingTokens);
+  return { findings: findings.slice(0, max), rejected };
+}
+
+/**
+ * What running the pass costs, computed before it runs.
+ *
+ * A tool that spends somebody's money to tell them how to spend less must be
+ * the first thing audited by its own arithmetic. The figure is an estimate of
+ * one call — the prompt in, a small structured answer out — and it says which
+ * half is which by having only one half.
+ */
+export function semanticPassCost(
+  prompt: string,
+  rates: { inputPerMTok: number; outputPerMTok: number },
+  options: { tokenCounter?: TokenCounter; expectedOutputTokens?: number } = {},
+): { inputTokens: number; outputTokens: number; usd: number; provenance: 'estimated' } {
+  const { tokenCounter = estimateTokens, expectedOutputTokens = 800 } = options;
+  const inputTokens = tokenCounter(prompt) + tokenCounter(SEMANTIC_SYSTEM_PROMPT);
+  return {
+    inputTokens,
+    outputTokens: expectedOutputTokens,
+    usd:
+      (inputTokens / 1_000_000) * rates.inputPerMTok +
+      (expectedOutputTokens / 1_000_000) * rates.outputPerMTok,
+    provenance: 'estimated',
+  };
+}
+
+export const SEMANTIC_SYSTEM_PROMPT = `You find places where a prompt says the same thing twice in different words, or contradicts itself.
+
+Return ONLY a JSON array. Each element is {"kind": "...", "spans": ["...", "..."], "because": "..."}.
+
+"kind" is one of:
+- "paraphrase-pair": two passages teaching the same rule or boundary in different words.
+- "restated-instruction": an instruction given once and then given again elsewhere.
+- "contradiction": two passages that cannot both be followed.
+
+Rules:
+- Both strings in "spans" MUST be copied character for character from the prompt. Do not paraphrase them, do not fix their punctuation, do not trim them differently. If you cannot copy a passage exactly, leave the finding out.
+- The two spans must be different passages in different places. Never quote the same passage twice.
+- Do not report passages that are near-identical wordings of each other — those are already found without you. Report only pairs whose WORDS differ while their MEANING is the same.
+- "because" is one sentence naming the relation, for a human to read.
+- Prefer a few certain findings to many possible ones. Return [] if there is nothing you are sure of.
+
+No explanation, no code fences, no commentary. The array alone.`;