pi-harness-runtime 1.1.454 → 1.1.455

package/packages/jev-judge/dist/workload.d.ts

@@ -0,0 +1,126 @@
+/**
+ * The workload of a job is a fact, not a phrase.
+ *
+ * A request that says "large refactor" is not a large job, and a request
+ * that says "10,000 records" is a large job even when the phrase is
+ * missing. The assessment reads the facts that are really available - a
+ * declared record count, a measured scope, a declared tier cost, a
+ * measured cost per record - and it reports what it decided and why.
+ *
+ * A job without any fact is `unknown`, never `small`: the difference
+ * decides whether a pilot is needed, and a job of unknown size is not a
+ * job that may skip the pilot.
+ *
+ * The assessment is deterministic. It never asks a model what the size of
+ * a job is, because a model cannot count the records of a repository.
+ */
+import type { BatchPlan } from "./batch-plan.js";
+/** A job of this many records is a large job. */
+export declare const LARGE_RECORD_COUNT = 1000;
+/** A job of this many records is at least a medium job. */
+export declare const MEDIUM_RECORD_COUNT = 100;
+/** A change of this many files is a large job. */
+export declare const LARGE_FILE_COUNT = 50;
+/** A change of this many files is at least a medium job. */
+export declare const MEDIUM_FILE_COUNT = 10;
+/** A change with this many call sites is a large job. */
+export declare const LARGE_CALL_SITES = 200;
+/** A change with this many call sites is at least a medium job. */
+export declare const MEDIUM_CALL_SITES = 50;
+/** A job that runs this long is a large job. */
+export declare const LARGE_DURATION_MS = 600000;
+/** A job that runs this long is at least a medium job. */
+export declare const MEDIUM_DURATION_MS = 60000;
+/** A change with this many migration files is a large job. */
+export declare const LARGE_MIGRATION_FILES = 20;
+/** A change with this many migration files is at least a medium job. */
+export declare const MEDIUM_MIGRATION_FILES = 5;
+/** The size of the representative pilot of a large job. */
+export declare const PILOT_RECORDS = 100;
+/** The size of a bounded batch of a large job. */
+export declare const MAX_BATCH_RECORDS = 500;
+/** The highest number of batches that may run at the same time. */
+export declare const MAX_CONCURRENCY = 2;
+export type WorkloadSize = "unknown" | "small" | "medium" | "large";
+/** The scope that was measured in the repository. */
+export interface WorkloadScopeFacts {
+    fileCount?: number;
+    callSiteCount?: number;
+    testFileCount?: number;
+    migrationFileCount?: number;
+}
+/** A tier of the declared validation plan. */
+export interface WorkloadTierFacts {
+    datasetSize?: number;
+    expectedDurationMs?: number;
+}
+export interface WorkloadInput {
+    /** The request of the task. A count in it is a declaration. */
+    requestText?: string;
+    /** The scope that was measured in the repository. */
+    scope?: WorkloadScopeFacts;
+    /** The tiers of the declared validation plan. */
+    tiers?: WorkloadTierFacts[];
+    /** The measured cost of one record. */
+    msPerRecord?: number;
+    /** The batches write to disjoint destinations. */
+    partitionSafe?: boolean;
+}
+export interface WorkloadAssessment {
+    /** The size of the job, decided from the facts. */
+    size: WorkloadSize;
+    /** The job is a large job. */
+    isLarge: boolean;
+    /** The facts that decided the size, in plain words. */
+    reasons: string[];
+    /** The number of records of the job, when it is known. */
+    recordCount?: number;
+    /** The number of changed files, when it was measured. */
+    fileCount?: number;
+    /** The number of call sites, when it was measured. */
+    callSiteCount?: number;
+    /** The measured or declared duration of the job. */
+    estimatedDurationMs?: number;
+    /** The size of the representative pilot, when the job needs one. */
+    pilotRecords?: number;
+    /** The size of a bounded batch, when the job has a record count. */
+    batchRecords?: number;
+    /** How many batches may run at the same time. */
+    concurrency: number;
+    /** No fact was available, so the size is unknown. */
+    unknown: boolean;
+}
+/**
+ * The largest record count that the request declares.
+ *
+ * "10,000 records", "500 rows", "1.5M items" and "250 users" are
+ * declarations of a count. The largest one wins, because the request may
+ * also name the size of a batch or of a sample.
+ */
+export declare function declaredRecordCount(text: string | undefined): number | undefined;
+/**
+ * The workload of a job, decided from the facts.
+ *
+ * The order of the thresholds is the order of the certainty: a declared
+ * count of records is the strongest fact, a measured scope is the next
+ * one, and a duration that is derived from a measured cost per record is
+ * the weakest.
+ */
+export declare function assessWorkload(input: WorkloadInput): WorkloadAssessment;
+/**
+ * A one line description of the assessment, for the status line and the
+ * instruction of the agent.
+ */
+export declare function describeWorkload(assessment: WorkloadAssessment): string;
+/**
+ * The batch plan of an assessed job.
+ *
+ * The plan carries only what was measured: without a measured cost per
+ * record the estimate stays unknown, and the batches stay bounded.
+ */
+export declare function workloadBatchPlan(assessment: WorkloadAssessment, extra?: {
+    budgetMinutes?: number;
+    maxAttempts?: number;
+    msPerRecord?: number;
+}): BatchPlan;
+//# sourceMappingURL=workload.d.ts.map

package/packages/jev-judge/dist/workload.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"workload.d.ts","sourceRoot":"","sources":["../src/workload.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AAEjD,iDAAiD;AACjD,eAAO,MAAM,kBAAkB,OAAQ,CAAC;AACxC,2DAA2D;AAC3D,eAAO,MAAM,mBAAmB,MAAM,CAAC;AACvC,kDAAkD;AAClD,eAAO,MAAM,gBAAgB,KAAK,CAAC;AACnC,4DAA4D;AAC5D,eAAO,MAAM,iBAAiB,KAAK,CAAC;AACpC,yDAAyD;AACzD,eAAO,MAAM,gBAAgB,MAAM,CAAC;AACpC,mEAAmE;AACnE,eAAO,MAAM,iBAAiB,KAAK,CAAC;AACpC,gDAAgD;AAChD,eAAO,MAAM,iBAAiB,SAAU,CAAC;AACzC,0DAA0D;AAC1D,eAAO,MAAM,kBAAkB,QAAS,CAAC;AACzC,8DAA8D;AAC9D,eAAO,MAAM,qBAAqB,KAAK,CAAC;AACxC,wEAAwE;AACxE,eAAO,MAAM,sBAAsB,IAAI,CAAC;AACxC,2DAA2D;AAC3D,eAAO,MAAM,aAAa,MAAM,CAAC;AACjC,kDAAkD;AAClD,eAAO,MAAM,iBAAiB,MAAM,CAAC;AACrC,mEAAmE;AACnE,eAAO,MAAM,eAAe,IAAI,CAAC;AA2BjC,MAAM,MAAM,YAAY,GAAG,SAAS,GAAG,OAAO,GAAG,QAAQ,GAAG,OAAO,CAAC;AAEpE,qDAAqD;AACrD,MAAM,WAAW,kBAAkB;IAClC,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,kBAAkB,CAAC,EAAE,MAAM,CAAC;CAC5B;AAED,8CAA8C;AAC9C,MAAM,WAAW,iBAAiB;IACjC,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,kBAAkB,CAAC,EAAE,MAAM,CAAC;CAC5B;AAED,MAAM,WAAW,aAAa;IAC7B,+DAA+D;IAC/D,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,qDAAqD;IACrD,KAAK,CAAC,EAAE,kBAAkB,CAAC;IAC3B,iDAAiD;IACjD,KAAK,CAAC,EAAE,iBAAiB,EAAE,CAAC;IAC5B,uCAAuC;IACvC,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,kDAAkD;IAClD,aAAa,CAAC,EAAE,OAAO,CAAC;CACxB;AAED,MAAM,WAAW,kBAAkB;IAClC,mDAAmD;IACnD,IAAI,EAAE,YAAY,CAAC;IACnB,8BAA8B;IAC9B,OAAO,EAAE,OAAO,CAAC;IACjB,uDAAuD;IACvD,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,0DAA0D;IAC1D,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,yDAAyD;IACzD,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,sDAAsD;IACtD,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,oDAAoD;IACpD,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAC7B,oEAAoE;IACpE,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,oEAAoE;IACpE,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,iDAAiD;IACjD,WAAW,EAAE,MAAM,CAAC;IACpB,qDAAqD;IACrD,OAAO,EAAE,OAAO,CAAC;CACjB;AAeD;;;;;;GAMG;AACH,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,MAAM,GAAG,SAAS,GAAG,MAAM,GAAG,SAAS,CAqBhF;AAED;;;;;;;GAOG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,aAAa,GAAG,kBAAkB,CAmHvE;AAED;;;GAGG;AACH,wBAAgB,gBAAgB,CAAC,UAAU,EAAE,kBAAkB,GAAG,MAAM,CAYvE;AAED;;;;;GAKG;AACH,wBAAgB,iBAAiB,CAChC,UAAU,EAAE,kBAAkB,EAC9B,KAAK,GAAE;IACN,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,WAAW,CAAC,EAAE,MAAM,CAAC;CAChB,GACJ,SAAS,CAWX"}

package/packages/jev-judge/dist/workload.js

@@ -0,0 +1,271 @@
+/**
+ * The workload of a job is a fact, not a phrase.
+ *
+ * A request that says "large refactor" is not a large job, and a request
+ * that says "10,000 records" is a large job even when the phrase is
+ * missing. The assessment reads the facts that are really available - a
+ * declared record count, a measured scope, a declared tier cost, a
+ * measured cost per record - and it reports what it decided and why.
+ *
+ * A job without any fact is `unknown`, never `small`: the difference
+ * decides whether a pilot is needed, and a job of unknown size is not a
+ * job that may skip the pilot.
+ *
+ * The assessment is deterministic. It never asks a model what the size of
+ * a job is, because a model cannot count the records of a repository.
+ */
+/** A job of this many records is a large job. */
+export const LARGE_RECORD_COUNT = 1_000;
+/** A job of this many records is at least a medium job. */
+export const MEDIUM_RECORD_COUNT = 100;
+/** A change of this many files is a large job. */
+export const LARGE_FILE_COUNT = 50;
+/** A change of this many files is at least a medium job. */
+export const MEDIUM_FILE_COUNT = 10;
+/** A change with this many call sites is a large job. */
+export const LARGE_CALL_SITES = 200;
+/** A change with this many call sites is at least a medium job. */
+export const MEDIUM_CALL_SITES = 50;
+/** A job that runs this long is a large job. */
+export const LARGE_DURATION_MS = 600_000;
+/** A job that runs this long is at least a medium job. */
+export const MEDIUM_DURATION_MS = 60_000;
+/** A change with this many migration files is a large job. */
+export const LARGE_MIGRATION_FILES = 20;
+/** A change with this many migration files is at least a medium job. */
+export const MEDIUM_MIGRATION_FILES = 5;
+/** The size of the representative pilot of a large job. */
+export const PILOT_RECORDS = 100;
+/** The size of a bounded batch of a large job. */
+export const MAX_BATCH_RECORDS = 500;
+/** The highest number of batches that may run at the same time. */
+export const MAX_CONCURRENCY = 2;
+/** The text of a request is only scanned up to this many characters. */
+const MAX_SCANNED_TEXT = 20_000;
+/** A declared count above this is not a count, it is a typo. */
+const MAX_DECLARED_RECORDS = 1e12;
+/**
+ * The units that name a record. A file is not a record: the number of
+ * files is a measured fact of the repository, not a declaration of the
+ * user.
+ */
+const RECORD_UNITS = "records?|rows?|items?|entries|documents?|messages?|events?|tickets?|samples?|users?|customers?|orders?|invoices?|transactions?";
+/**
+ * The count of a record declaration.
+ *
+ * The pattern is linear: a digit class, an optional fraction, an optional
+ * multiplier and a unit. There is no nested repetition, so a hostile
+ * request cannot make the scan slow.
+ */
+const COUNT_PATTERN = new RegExp(`(\\d[\\d,]*)(?:\\.(\\d+))?\\s*(k|m)?\\s*(${RECORD_UNITS})\\b`, "gi");
+function positiveNumber(value) {
+    if (value === undefined)
+        return undefined;
+    if (!Number.isFinite(value))
+        return undefined;
+    if (value <= 0)
+        return undefined;
+    return value;
+}
+function maxOf(values) {
+    const known = values.map(positiveNumber).filter((v) => v !== undefined);
+    if (known.length === 0)
+        return undefined;
+    return Math.max(...known);
+}
+/**
+ * The largest record count that the request declares.
+ *
+ * "10,000 records", "500 rows", "1.5M items" and "250 users" are
+ * declarations of a count. The largest one wins, because the request may
+ * also name the size of a batch or of a sample.
+ */
+export function declaredRecordCount(text) {
+    if (!text)
+        return undefined;
+    const scan = text.length > MAX_SCANNED_TEXT ? text.slice(0, MAX_SCANNED_TEXT) : text;
+    COUNT_PATTERN.lastIndex = 0;
+    let largest;
+    let match = COUNT_PATTERN.exec(scan);
+    while (match !== null) {
+        const integerPart = Number.parseInt((match[1] ?? "0").replace(/,/g, ""), 10);
+        const fractionDigits = match[2] ?? "";
+        const fraction = fractionDigits.length > 0 ? Number.parseInt(fractionDigits, 10) / 10 ** fractionDigits.length : 0;
+        const suffix = match[3]?.toLowerCase();
+        let multiplier = 1;
+        if (suffix === "m")
+            multiplier = 1_000_000;
+        else if (suffix === "k")
+            multiplier = 1_000;
+        const value = (integerPart + fraction) * multiplier;
+        if (Number.isFinite(value) && value > 0 && value <= MAX_DECLARED_RECORDS) {
+            if (largest === undefined || value > largest)
+                largest = value;
+        }
+        match = COUNT_PATTERN.exec(scan);
+    }
+    return largest;
+}
+/**
+ * The workload of a job, decided from the facts.
+ *
+ * The order of the thresholds is the order of the certainty: a declared
+ * count of records is the strongest fact, a measured scope is the next
+ * one, and a duration that is derived from a measured cost per record is
+ * the weakest.
+ */
+export function assessWorkload(input) {
+    const reasons = [];
+    const declared = declaredRecordCount(input.requestText);
+    const tierRecords = maxOf((input.tiers ?? []).map((tier) => tier.datasetSize));
+    const tierDuration = maxOf((input.tiers ?? []).map((tier) => tier.expectedDurationMs));
+    const recordCount = maxOf([declared, tierRecords]);
+    const fileCount = positiveNumber(input.scope?.fileCount);
+    const callSiteCount = positiveNumber(input.scope?.callSiteCount);
+    const migrationFileCount = positiveNumber(input.scope?.migrationFileCount);
+    const msPerRecord = positiveNumber(input.msPerRecord);
+    const estimatedDurationMs = msPerRecord !== undefined && recordCount !== undefined ? Math.round(msPerRecord * recordCount) : undefined;
+    const declaredDuration = maxOf([tierDuration, estimatedDurationMs]);
+    let size = "unknown";
+    if (recordCount !== undefined && recordCount >= LARGE_RECORD_COUNT) {
+        size = "large";
+        reasons.push(`${recordCount} record(s) is at least ${LARGE_RECORD_COUNT}`);
+    }
+    if (fileCount !== undefined && fileCount >= LARGE_FILE_COUNT) {
+        size = "large";
+        reasons.push(`${fileCount} changed file(s) is at least ${LARGE_FILE_COUNT}`);
+    }
+    if (callSiteCount !== undefined && callSiteCount >= LARGE_CALL_SITES) {
+        size = "large";
+        reasons.push(`${callSiteCount} call site(s) is at least ${LARGE_CALL_SITES}`);
+    }
+    if (migrationFileCount !== undefined && migrationFileCount >= LARGE_MIGRATION_FILES) {
+        size = "large";
+        reasons.push(`${migrationFileCount} migration file(s) is at least ${LARGE_MIGRATION_FILES}`);
+    }
+    if (declaredDuration !== undefined && declaredDuration >= LARGE_DURATION_MS) {
+        size = "large";
+        reasons.push(`a runtime of ${Math.round(declaredDuration / 1000)}s is at least ${LARGE_DURATION_MS / 1000}s`);
+    }
+    if (size !== "large") {
+        if (recordCount !== undefined && recordCount >= MEDIUM_RECORD_COUNT) {
+            size = "medium";
+            reasons.push(`${recordCount} record(s) is at least ${MEDIUM_RECORD_COUNT}`);
+        }
+        if (fileCount !== undefined && fileCount >= MEDIUM_FILE_COUNT) {
+            size = "medium";
+            reasons.push(`${fileCount} changed file(s) is at least ${MEDIUM_FILE_COUNT}`);
+        }
+        if (callSiteCount !== undefined && callSiteCount >= MEDIUM_CALL_SITES) {
+            size = "medium";
+            reasons.push(`${callSiteCount} call site(s) is at least ${MEDIUM_CALL_SITES}`);
+        }
+        if (migrationFileCount !== undefined && migrationFileCount >= MEDIUM_MIGRATION_FILES) {
+            size = "medium";
+            reasons.push(`${migrationFileCount} migration file(s) is at least ${MEDIUM_MIGRATION_FILES}`);
+        }
+        if (declaredDuration !== undefined && declaredDuration >= MEDIUM_DURATION_MS) {
+            size = "medium";
+            reasons.push(`a runtime of ${Math.round(declaredDuration / 1000)}s is at least ${MEDIUM_DURATION_MS / 1000}s`);
+        }
+    }
+    const hasFact = recordCount !== undefined ||
+        fileCount !== undefined ||
+        callSiteCount !== undefined ||
+        migrationFileCount !== undefined ||
+        declaredDuration !== undefined;
+    if (size === "unknown" && hasFact) {
+        size = "small";
+        reasons.push("every measured fact is below the medium threshold");
+    }
+    else if (size === "unknown") {
+        reasons.push("no fact about the size of the job was available");
+    }
+    // The pilot of a large job is the representative sample. It is never
+    // bigger than the job itself, and it needs a record count: a pilot
+    // without a size is not a pilot.
+    let pilotRecords;
+    if (size === "large") {
+        if (recordCount !== undefined) {
+            pilotRecords = Math.min(PILOT_RECORDS, recordCount);
+            reasons.push(`the pilot covers ${pilotRecords} record(s)`);
+        }
+        else {
+            reasons.push("the job is large by scope, but no record count is known, so the pilot has no size");
+        }
+    }
+    const batchRecords = recordCount !== undefined ? Math.min(MAX_BATCH_RECORDS, recordCount) : undefined;
+    // Concurrent writers are only allowed when the batches provably write
+    // to disjoint destinations. Everything else runs one batch at a time.
+    const partitionSafe = input.partitionSafe === true;
+    const concurrency = size === "large" && partitionSafe ? MAX_CONCURRENCY : 1;
+    if (size === "large") {
+        reasons.push(partitionSafe
+            ? `the batches write to disjoint destinations, so ${MAX_CONCURRENCY} of them may run at once`
+            : "the batches may share a destination, so they run one at a time");
+    }
+    const assessment = {
+        size,
+        isLarge: size === "large",
+        reasons,
+        concurrency,
+        unknown: size === "unknown",
+    };
+    if (recordCount !== undefined)
+        assessment.recordCount = recordCount;
+    if (fileCount !== undefined)
+        assessment.fileCount = fileCount;
+    if (callSiteCount !== undefined)
+        assessment.callSiteCount = callSiteCount;
+    if (declaredDuration !== undefined)
+        assessment.estimatedDurationMs = declaredDuration;
+    if (pilotRecords !== undefined)
+        assessment.pilotRecords = pilotRecords;
+    if (batchRecords !== undefined)
+        assessment.batchRecords = batchRecords;
+    return assessment;
+}
+/**
+ * A one line description of the assessment, for the status line and the
+ * instruction of the agent.
+ */
+export function describeWorkload(assessment) {
+    const parts = [`workload ${assessment.size}`];
+    if (assessment.recordCount !== undefined)
+        parts.push(`${assessment.recordCount} record(s)`);
+    if (assessment.fileCount !== undefined)
+        parts.push(`${assessment.fileCount} file(s)`);
+    if (assessment.callSiteCount !== undefined)
+        parts.push(`${assessment.callSiteCount} call site(s)`);
+    if (assessment.pilotRecords !== undefined)
+        parts.push(`pilot ${assessment.pilotRecords}`);
+    if (assessment.batchRecords !== undefined)
+        parts.push(`batch ${assessment.batchRecords}`);
+    parts.push(`concurrency ${assessment.concurrency}`);
+    if (assessment.estimatedDurationMs !== undefined) {
+        parts.push(`~${Math.round(assessment.estimatedDurationMs / 1000)}s`);
+    }
+    return parts.join(" | ");
+}
+/**
+ * The batch plan of an assessed job.
+ *
+ * The plan carries only what was measured: without a measured cost per
+ * record the estimate stays unknown, and the batches stay bounded.
+ */
+export function workloadBatchPlan(assessment, extra = {}) {
+    const plan = {
+        totalRecords: assessment.recordCount ?? 0,
+        pilotRecords: assessment.pilotRecords ?? 0,
+        maxBatchRecords: assessment.batchRecords ?? MAX_BATCH_RECORDS,
+        maxConcurrentBatches: assessment.concurrency,
+    };
+    if (extra.budgetMinutes !== undefined)
+        plan.budgetMinutes = extra.budgetMinutes;
+    if (extra.maxAttempts !== undefined)
+        plan.maxAttempts = extra.maxAttempts;
+    if (extra.msPerRecord !== undefined)
+        plan.msPerRecord = extra.msPerRecord;
+    return plan;
+}
+//# sourceMappingURL=workload.js.map

package/packages/jev-judge/dist/workload.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"workload.js","sourceRoot":"","sources":["../src/workload.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAIH,iDAAiD;AACjD,MAAM,CAAC,MAAM,kBAAkB,GAAG,KAAK,CAAC;AACxC,2DAA2D;AAC3D,MAAM,CAAC,MAAM,mBAAmB,GAAG,GAAG,CAAC;AACvC,kDAAkD;AAClD,MAAM,CAAC,MAAM,gBAAgB,GAAG,EAAE,CAAC;AACnC,4DAA4D;AAC5D,MAAM,CAAC,MAAM,iBAAiB,GAAG,EAAE,CAAC;AACpC,yDAAyD;AACzD,MAAM,CAAC,MAAM,gBAAgB,GAAG,GAAG,CAAC;AACpC,mEAAmE;AACnE,MAAM,CAAC,MAAM,iBAAiB,GAAG,EAAE,CAAC;AACpC,gDAAgD;AAChD,MAAM,CAAC,MAAM,iBAAiB,GAAG,OAAO,CAAC;AACzC,0DAA0D;AAC1D,MAAM,CAAC,MAAM,kBAAkB,GAAG,MAAM,CAAC;AACzC,8DAA8D;AAC9D,MAAM,CAAC,MAAM,qBAAqB,GAAG,EAAE,CAAC;AACxC,wEAAwE;AACxE,MAAM,CAAC,MAAM,sBAAsB,GAAG,CAAC,CAAC;AACxC,2DAA2D;AAC3D,MAAM,CAAC,MAAM,aAAa,GAAG,GAAG,CAAC;AACjC,kDAAkD;AAClD,MAAM,CAAC,MAAM,iBAAiB,GAAG,GAAG,CAAC;AACrC,mEAAmE;AACnE,MAAM,CAAC,MAAM,eAAe,GAAG,CAAC,CAAC;AAEjC,wEAAwE;AACxE,MAAM,gBAAgB,GAAG,MAAM,CAAC;AAChC,gEAAgE;AAChE,MAAM,oBAAoB,GAAG,IAAI,CAAC;AAElC;;;;GAIG;AACH,MAAM,YAAY,GACjB,gIAAgI,CAAC;AAElI;;;;;;GAMG;AACH,MAAM,aAAa,GAAG,IAAI,MAAM,CAC/B,4CAA4C,YAAY,MAAM,EAC9D,IAAI,CACJ,CAAC;AAwDF,SAAS,cAAc,CAAC,KAAyB;IAChD,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IAC1C,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IAC9C,IAAI,KAAK,IAAI,CAAC;QAAE,OAAO,SAAS,CAAC;IACjC,OAAO,KAAK,CAAC;AACd,CAAC;AAED,SAAS,KAAK,CAAC,MAA8B;IAC5C,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAe,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC;IACrF,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IACzC,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;AAC3B,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,mBAAmB,CAAC,IAAwB;IAC3D,IAAI,CAAC,IAAI;QAAE,OAAO,SAAS,CAAC;IAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,GAAG,gBAAgB,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IACrF,aAAa,CAAC,SAAS,GAAG,CAAC,CAAC;IAC5B,IAAI,OAA2B,CAAC;IAChC,IAAI,KAAK,GAA2B,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC7D,OAAO,KAAK,KAAK,IAAI,EAAE,CAAC;QACvB,MAAM,WAAW,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QAC7E,MAAM,cAAc,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACtC,MAAM,QAAQ,GAAG,cAAc,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,cAAc,EAAE,EAAE,CAAC,GAAG,EAAE,IAAI,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QACnH,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC;QACvC,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,MAAM,KAAK,GAAG;YAAE,UAAU,GAAG,SAAS,CAAC;aACtC,IAAI,MAAM,KAAK,GAAG;YAAE,UAAU,GAAG,KAAK,CAAC;QAC5C,MAAM,KAAK,GAAG,CAAC,WAAW,GAAG,QAAQ,CAAC,GAAG,UAAU,CAAC;QACpD,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,oBAAoB,EAAE,CAAC;YAC1E,IAAI,OAAO,KAAK,SAAS,IAAI,KAAK,GAAG,OAAO;gBAAE,OAAO,GAAG,KAAK,CAAC;QAC/D,CAAC;QACD,KAAK,GAAG,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC;IACD,OAAO,OAAO,CAAC;AAChB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,cAAc,CAAC,KAAoB;IAClD,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,MAAM,QAAQ,GAAG,mBAAmB,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;IACxD,MAAM,WAAW,GAAG,KAAK,CAAC,CAAC,KAAK,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;IAC/E,MAAM,YAAY,GAAG,KAAK,CAAC,CAAC,KAAK,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC,CAAC;IACvF,MAAM,WAAW,GAAG,KAAK,CAAC,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC,CAAC;IACnD,MAAM,SAAS,GAAG,cAAc,CAAC,KAAK,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;IACzD,MAAM,aAAa,GAAG,cAAc,CAAC,KAAK,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;IACjE,MAAM,kBAAkB,GAAG,cAAc,CAAC,KAAK,CAAC,KAAK,EAAE,kBAAkB,CAAC,CAAC;IAC3E,MAAM,WAAW,GAAG,cAAc,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;IACtD,MAAM,mBAAmB,GACxB,WAAW,KAAK,SAAS,IAAI,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAC5G,MAAM,gBAAgB,GAAG,KAAK,CAAC,CAAC,YAAY,EAAE,mBAAmB,CAAC,CAAC,CAAC;IAEpE,IAAI,IAAI,GAAiB,SAAS,CAAC;IAEnC,IAAI,WAAW,KAAK,SAAS,IAAI,WAAW,IAAI,kBAAkB,EAAE,CAAC;QACpE,IAAI,GAAG,OAAO,CAAC;QACf,OAAO,CAAC,IAAI,CAAC,GAAG,WAAW,0BAA0B,kBAAkB,EAAE,CAAC,CAAC;IAC5E,CAAC;IACD,IAAI,SAAS,KAAK,SAAS,IAAI,SAAS,IAAI,gBAAgB,EAAE,CAAC;QAC9D,IAAI,GAAG,OAAO,CAAC;QACf,OAAO,CAAC,IAAI,CAAC,GAAG,SAAS,gCAAgC,gBAAgB,EAAE,CAAC,CAAC;IAC9E,CAAC;IACD,IAAI,aAAa,KAAK,SAAS,IAAI,aAAa,IAAI,gBAAgB,EAAE,CAAC;QACtE,IAAI,GAAG,OAAO,CAAC;QACf,OAAO,CAAC,IAAI,CAAC,GAAG,aAAa,6BAA6B,gBAAgB,EAAE,CAAC,CAAC;IAC/E,CAAC;IACD,IAAI,kBAAkB,KAAK,SAAS,IAAI,kBAAkB,IAAI,qBAAqB,EAAE,CAAC;QACrF,IAAI,GAAG,OAAO,CAAC;QACf,OAAO,CAAC,IAAI,CAAC,GAAG,kBAAkB,kCAAkC,qBAAqB,EAAE,CAAC,CAAC;IAC9F,CAAC;IACD,IAAI,gBAAgB,KAAK,SAAS,IAAI,gBAAgB,IAAI,iBAAiB,EAAE,CAAC;QAC7E,IAAI,GAAG,OAAO,CAAC;QACf,OAAO,CAAC,IAAI,CAAC,gBAAgB,IAAI,CAAC,KAAK,CAAC,gBAAgB,GAAG,IAAI,CAAC,iBAAiB,iBAAiB,GAAG,IAAI,GAAG,CAAC,CAAC;IAC/G,CAAC;IAED,IAAI,IAAI,KAAK,OAAO,EAAE,CAAC;QACtB,IAAI,WAAW,KAAK,SAAS,IAAI,WAAW,IAAI,mBAAmB,EAAE,CAAC;YACrE,IAAI,GAAG,QAAQ,CAAC;YAChB,OAAO,CAAC,IAAI,CAAC,GAAG,WAAW,0BAA0B,mBAAmB,EAAE,CAAC,CAAC;QAC7E,CAAC;QACD,IAAI,SAAS,KAAK,SAAS,IAAI,SAAS,IAAI,iBAAiB,EAAE,CAAC;YAC/D,IAAI,GAAG,QAAQ,CAAC;YAChB,OAAO,CAAC,IAAI,CAAC,GAAG,SAAS,gCAAgC,iBAAiB,EAAE,CAAC,CAAC;QAC/E,CAAC;QACD,IAAI,aAAa,KAAK,SAAS,IAAI,aAAa,IAAI,iBAAiB,EAAE,CAAC;YACvE,IAAI,GAAG,QAAQ,CAAC;YAChB,OAAO,CAAC,IAAI,CAAC,GAAG,aAAa,6BAA6B,iBAAiB,EAAE,CAAC,CAAC;QAChF,CAAC;QACD,IAAI,kBAAkB,KAAK,SAAS,IAAI,kBAAkB,IAAI,sBAAsB,EAAE,CAAC;YACtF,IAAI,GAAG,QAAQ,CAAC;YAChB,OAAO,CAAC,IAAI,CAAC,GAAG,kBAAkB,kCAAkC,sBAAsB,EAAE,CAAC,CAAC;QAC/F,CAAC;QACD,IAAI,gBAAgB,KAAK,SAAS,IAAI,gBAAgB,IAAI,kBAAkB,EAAE,CAAC;YAC9E,IAAI,GAAG,QAAQ,CAAC;YAChB,OAAO,CAAC,IAAI,CAAC,gBAAgB,IAAI,CAAC,KAAK,CAAC,gBAAgB,GAAG,IAAI,CAAC,iBAAiB,kBAAkB,GAAG,IAAI,GAAG,CAAC,CAAC;QAChH,CAAC;IACF,CAAC;IAED,MAAM,OAAO,GACZ,WAAW,KAAK,SAAS;QACzB,SAAS,KAAK,SAAS;QACvB,aAAa,KAAK,SAAS;QAC3B,kBAAkB,KAAK,SAAS;QAChC,gBAAgB,KAAK,SAAS,CAAC;IAEhC,IAAI,IAAI,KAAK,SAAS,IAAI,OAAO,EAAE,CAAC;QACnC,IAAI,GAAG,OAAO,CAAC;QACf,OAAO,CAAC,IAAI,CAAC,mDAAmD,CAAC,CAAC;IACnE,CAAC;SAAM,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;QAC/B,OAAO,CAAC,IAAI,CAAC,iDAAiD,CAAC,CAAC;IACjE,CAAC;IAED,qEAAqE;IACrE,mEAAmE;IACnE,iCAAiC;IACjC,IAAI,YAAgC,CAAC;IACrC,IAAI,IAAI,KAAK,OAAO,EAAE,CAAC;QACtB,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;YAC/B,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,WAAW,CAAC,CAAC;YACpD,OAAO,CAAC,IAAI,CAAC,oBAAoB,YAAY,YAAY,CAAC,CAAC;QAC5D,CAAC;aAAM,CAAC;YACP,OAAO,CAAC,IAAI,CAAC,mFAAmF,CAAC,CAAC;QACnG,CAAC;IACF,CAAC;IAED,MAAM,YAAY,GAAG,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,iBAAiB,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAEtG,sEAAsE;IACtE,sEAAsE;IACtE,MAAM,aAAa,GAAG,KAAK,CAAC,aAAa,KAAK,IAAI,CAAC;IACnD,MAAM,WAAW,GAAG,IAAI,KAAK,OAAO,IAAI,aAAa,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5E,IAAI,IAAI,KAAK,OAAO,EAAE,CAAC;QACtB,OAAO,CAAC,IAAI,CACX,aAAa;YACZ,CAAC,CAAC,kDAAkD,eAAe,0BAA0B;YAC7F,CAAC,CAAC,gEAAgE,CACnE,CAAC;IACH,CAAC;IAED,MAAM,UAAU,GAAuB;QACtC,IAAI;QACJ,OAAO,EAAE,IAAI,KAAK,OAAO;QACzB,OAAO;QACP,WAAW;QACX,OAAO,EAAE,IAAI,KAAK,SAAS;KAC3B,CAAC;IACF,IAAI,WAAW,KAAK,SAAS;QAAE,UAAU,CAAC,WAAW,GAAG,WAAW,CAAC;IACpE,IAAI,SAAS,KAAK,SAAS;QAAE,UAAU,CAAC,SAAS,GAAG,SAAS,CAAC;IAC9D,IAAI,aAAa,KAAK,SAAS;QAAE,UAAU,CAAC,aAAa,GAAG,aAAa,CAAC;IAC1E,IAAI,gBAAgB,KAAK,SAAS;QAAE,UAAU,CAAC,mBAAmB,GAAG,gBAAgB,CAAC;IACtF,IAAI,YAAY,KAAK,SAAS;QAAE,UAAU,CAAC,YAAY,GAAG,YAAY,CAAC;IACvE,IAAI,YAAY,KAAK,SAAS;QAAE,UAAU,CAAC,YAAY,GAAG,YAAY,CAAC;IACvE,OAAO,UAAU,CAAC;AACnB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAAC,UAA8B;IAC9D,MAAM,KAAK,GAAa,CAAC,YAAY,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC;IACxD,IAAI,UAAU,CAAC,WAAW,KAAK,SAAS;QAAE,KAAK,CAAC,IAAI,CAAC,GAAG,UAAU,CAAC,WAAW,YAAY,CAAC,CAAC;IAC5F,IAAI,UAAU,CAAC,SAAS,KAAK,SAAS;QAAE,KAAK,CAAC,IAAI,CAAC,GAAG,UAAU,CAAC,SAAS,UAAU,CAAC,CAAC;IACtF,IAAI,UAAU,CAAC,aAAa,KAAK,SAAS;QAAE,KAAK,CAAC,IAAI,CAAC,GAAG,UAAU,CAAC,aAAa,eAAe,CAAC,CAAC;IACnG,IAAI,UAAU,CAAC,YAAY,KAAK,SAAS;QAAE,KAAK,CAAC,IAAI,CAAC,SAAS,UAAU,CAAC,YAAY,EAAE,CAAC,CAAC;IAC1F,IAAI,UAAU,CAAC,YAAY,KAAK,SAAS;QAAE,KAAK,CAAC,IAAI,CAAC,SAAS,UAAU,CAAC,YAAY,EAAE,CAAC,CAAC;IAC1F,KAAK,CAAC,IAAI,CAAC,eAAe,UAAU,CAAC,WAAW,EAAE,CAAC,CAAC;IACpD,IAAI,UAAU,CAAC,mBAAmB,KAAK,SAAS,EAAE,CAAC;QAClD,KAAK,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,mBAAmB,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;IACtE,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AAC1B,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,iBAAiB,CAChC,UAA8B,EAC9B,KAAK,GAID,EAAE;IAEN,MAAM,IAAI,GAAc;QACvB,YAAY,EAAE,UAAU,CAAC,WAAW,IAAI,CAAC;QACzC,YAAY,EAAE,UAAU,CAAC,YAAY,IAAI,CAAC;QAC1C,eAAe,EAAE,UAAU,CAAC,YAAY,IAAI,iBAAiB;QAC7D,oBAAoB,EAAE,UAAU,CAAC,WAAW;KAC5C,CAAC;IACF,IAAI,KAAK,CAAC,aAAa,KAAK,SAAS;QAAE,IAAI,CAAC,aAAa,GAAG,KAAK,CAAC,aAAa,CAAC;IAChF,IAAI,KAAK,CAAC,WAAW,KAAK,SAAS;QAAE,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC,WAAW,CAAC;IAC1E,IAAI,KAAK,CAAC,WAAW,KAAK,SAAS;QAAE,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC,WAAW,CAAC;IAC1E,OAAO,IAAI,CAAC;AACb,CAAC"}

package/packages/jev-judge/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@pi-harness/jev-judge",
-  "version": "1.1.454",
+  "version": "1.1.455",
   "description": "Jev Judge - Structured decision model for agent routing, E2E testing, and automated decisions",
   "type": "module",
   "main": "./dist/index.js",

package/packages/jev-judge/src/index.ts

@@ -759,6 +759,8 @@ export {
 	formatDuration,
 	summarizeValidationState,
 	validationBudgetStatus,
+	planWorkload,
+	planHasPilot,
 } from "./validation-plan.js";
 export type {
 	ValidationPlan,
@@ -818,6 +820,32 @@ export type {
 	BatchStatus,
 } from "./batch-plan.js";
 
+// Export the workload of a job, decided from the facts of the task
+export {
+	assessWorkload,
+	declaredRecordCount,
+	describeWorkload,
+	workloadBatchPlan,
+	LARGE_RECORD_COUNT,
+	MEDIUM_RECORD_COUNT,
+	LARGE_FILE_COUNT,
+	MEDIUM_FILE_COUNT,
+	LARGE_CALL_SITES,
+	MEDIUM_CALL_SITES,
+	LARGE_DURATION_MS,
+	MEDIUM_DURATION_MS,
+	PILOT_RECORDS,
+	MAX_BATCH_RECORDS,
+	MAX_CONCURRENCY,
+} from "./workload.js";
+export type {
+	WorkloadAssessment,
+	WorkloadInput,
+	WorkloadScopeFacts,
+	WorkloadSize,
+	WorkloadTierFacts,
+} from "./workload.js";
+
 // Export the validation tie-breaker (typed verdict about one item)
 export {
 	tieBreakValidation,

package/packages/jev-judge/src/validation-plan.ts

@@ -23,6 +23,7 @@
  */
 
 import type { TodoItem } from "./todo-provider.js";
+import { assessWorkload, describeWorkload, type WorkloadAssessment, type WorkloadTierFacts } from "./workload.js";
 
 /**
  * Which side of the ladder a tier sits on.
@@ -101,6 +102,17 @@ export interface ValidationState {
 	budgetMinutes?: number;
 	/** True when the plan requires a final tier but does not declare one. */
 	planIncomplete: boolean;
+	/**
+	 * True when the plan declares a large job but no measured pilot.
+	 *
+	 * A large job is accepted by the scale-up of a representative pilot,
+	 * so a plan without that pilot is not a plan that can be completed.
+	 */
+	missingPilot?: boolean;
+	/** Why the plan is incomplete, in plain words. */
+	planIncompleteReasons?: string[];
+	/** The workload of the job the plan describes. */
+	workload?: WorkloadAssessment;
 }
 
 /**
@@ -303,6 +315,35 @@ export function parseValidationPlan(item: TodoItem | null | undefined): Validati
 	return plan;
 }
 
+/**
+ * The workload of the job that a plan describes.
+ *
+ * The facts come from the plan itself: the dataset size of a tier is the
+ * size of the job, and the expected duration of a tier is the declared
+ * cost of it. A plan that declares a job of 10,000 records is a large
+ * job, whether or not it uses the words.
+ */
+export function planWorkload(plan: ValidationPlan | null | undefined): WorkloadAssessment {
+	const tiers: WorkloadTierFacts[] = [];
+	for (const tier of [plan?.fast, plan?.full]) {
+		if (!tier) continue;
+		tiers.push({ datasetSize: tier.datasetSize, expectedDurationMs: tier.expectedDurationMs });
+	}
+	return assessWorkload({ tiers });
+}
+
+/**
+ * Does the plan declare a measured pilot for its scale-up?
+ *
+ * A pilot is the fast tier, and the scale-up is the final tier that names
+ * it with `scaleUpFrom: "fast"`. A fast tier alone is not the pilot of the
+ * final tier, because nothing then says that the final tier waits for it.
+ */
+export function planHasPilot(plan: ValidationPlan | null | undefined): boolean {
+	if (!plan?.fast) return false;
+	return plan.full?.scaleUpFrom === "fast";
+}
+
 /**
  * Describe one tier in a single line: command, expected cost, dataset size.
  */
@@ -389,7 +430,21 @@ export function summarizeValidationState(
 	};
 
 	const finalTierRequired = plan.finalTierRequired === true;
-	const planIncomplete = finalTierRequired && plan.full === undefined;
+	const workload = planWorkload(plan);
+	const missingPilot = finalTierRequired && workload.isLarge && !planHasPilot(plan);
+	const planIncompleteReasons: string[] = [];
+	if (finalTierRequired && plan.full === undefined) {
+		planIncompleteReasons.push("the plan requires a final tier but declares none");
+	}
+	if (missingPilot) {
+		const size = workload.recordCount !== undefined ? `${workload.recordCount} record(s)` : "a large scope";
+		planIncompleteReasons.push(
+			plan.fast
+				? `the plan declares a large job (${size}) but the final tier does not name the pilot as its scale-up`
+				: `the plan declares a large job (${size}) but declares no pilot tier`,
+		);
+	}
+	const planIncomplete = (finalTierRequired && plan.full === undefined) || missingPilot;
 	const fast = stateOf("fast");
 	let full = stateOf("full");
 	// A scale-up that waits for its pilot only counts when the pilot
@@ -406,7 +461,10 @@ export function summarizeValidationState(
 		finalTierRequired,
 		finalTierPending: finalTierRequired && plan.full !== undefined && full.status !== "passed",
 		planIncomplete,
+		missingPilot,
+		workload,
 	};
+	if (planIncompleteReasons.length > 0) state.planIncompleteReasons = planIncompleteReasons;
 	if (plan.budgetMinutes !== undefined) state.budgetMinutes = plan.budgetMinutes;
 	return state;
 }
@@ -490,9 +548,19 @@ export function formatValidationContext(
 			);
 		}
 		if (state.planIncomplete) {
-			lines.push(
-				"The plan requires a final tier but declares none: report that instead of completing the todo silently.",
-			);
+			const reasons = state.planIncompleteReasons && state.planIncompleteReasons.length > 0
+				? state.planIncompleteReasons.join("; ")
+				: "the plan requires a final tier but declares none";
+			lines.push(`The plan cannot be completed as it is: ${reasons}.`);
+			if (state.missingPilot) {
+				lines.push(
+					"A large job is accepted by the scale-up of a representative pilot: declare a fast tier with " +
+						'"representative": true and a final tier with "scaleUpFrom": "fast", then record the pilot.',
+				);
+			}
+		}
+		if (state.workload && state.workload.size !== "unknown") {
+			lines.push(`Workload: ${describeWorkload(state.workload)}.`);
 		}
 	}