@senpi/runtime 3.0.127 → 3.0.128

package/dist/actions/skipped-signal-results.d.ts

@@ -1,25 +0,0 @@
-/**
- * Per-signal `results[]` rows synthesized for a batch-level early exit — the exits that return
- * before the per-signal loop and would otherwise leave the scan's signals with no recorded outcome.
- * Entry shape matches the loop's own rows so the derived per-signal telemetry is identical in
- * structure: normalized `dex`, `direction`/`score` only when usable, and a zero-width work window
- * (both stamps present — a half window is dropped downstream, and a missing one is
- * indistinguishable from an unstamped legacy row).
- *
- * Each row carries `__signalIndex`, its position in the INPUT list, so the event mapper pairs the
- * row with THIS signal's `meta` rather than with the first signal sharing its asset. It is read
- * inside the loop, not zipped on by the caller: a dropped signal shifts every later output
- * position. The input list is the scan's own signal array, which is what the mapper indexes into;
- * close-position's static-params fallback list has no scan array behind it, so its index matches
- * nothing and the mapper degrades to its asset join, as it does for any unmatched index.
- *
- * A signal with no usable asset is dropped: an outcome that names no asset is not attributable.
- * A drop is a hole in the "no signal goes unrecorded" contract, so it is logged (once per call,
- * with the count) rather than passing silently. Counts are unaffected — the row is still absent.
- * Total by construction — it runs on the trading path and must never throw on a malformed entry.
- */
-export declare function skippedSignalResults(signals: readonly unknown[] | undefined, reason: string, nowMs: number, overrides?: {
-    success?: boolean;
-    error?: string;
-}): Array<Record<string, unknown>>;
-//# sourceMappingURL=skipped-signal-results.d.ts.map

package/dist/actions/skipped-signal-results.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"skipped-signal-results.d.ts","sourceRoot":"","sources":["../../src/actions/skipped-signal-results.ts"],"names":[],"mappings":"AAIA;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAgB,oBAAoB,CAClC,OAAO,EAAE,SAAS,OAAO,EAAE,GAAG,SAAS,EACvC,MAAM,EAAE,MAAM,EACd,KAAK,EAAE,MAAM,EACb,SAAS,CAAC,EAAE;IAAE,OAAO,CAAC,EAAE,OAAO,CAAC;IAAC,KAAK,CAAC,EAAE,MAAM,CAAA;CAAE,GAChD,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CA8ChC"}

package/dist/actions/skipped-signal-results.js

@@ -1,71 +0,0 @@
-import { createLogger } from '../utils/logger.js';
-const logger = createLogger('[actions][skipped-signal-results]');
-/**
- * Per-signal `results[]` rows synthesized for a batch-level early exit — the exits that return
- * before the per-signal loop and would otherwise leave the scan's signals with no recorded outcome.
- * Entry shape matches the loop's own rows so the derived per-signal telemetry is identical in
- * structure: normalized `dex`, `direction`/`score` only when usable, and a zero-width work window
- * (both stamps present — a half window is dropped downstream, and a missing one is
- * indistinguishable from an unstamped legacy row).
- *
- * Each row carries `__signalIndex`, its position in the INPUT list, so the event mapper pairs the
- * row with THIS signal's `meta` rather than with the first signal sharing its asset. It is read
- * inside the loop, not zipped on by the caller: a dropped signal shifts every later output
- * position. The input list is the scan's own signal array, which is what the mapper indexes into;
- * close-position's static-params fallback list has no scan array behind it, so its index matches
- * nothing and the mapper degrades to its asset join, as it does for any unmatched index.
- *
- * A signal with no usable asset is dropped: an outcome that names no asset is not attributable.
- * A drop is a hole in the "no signal goes unrecorded" contract, so it is logged (once per call,
- * with the count) rather than passing silently. Counts are unaffected — the row is still absent.
- * Total by construction — it runs on the trading path and must never throw on a malformed entry.
- */
-export function skippedSignalResults(signals, reason, nowMs, overrides) {
-    if (!Array.isArray(signals))
-        return [];
-    const rows = [];
-    let dropped = 0;
-    for (const [index, raw] of signals.entries()) {
-        if (raw === null || typeof raw !== 'object') {
-            dropped++;
-            continue;
-        }
-        const signal = raw;
-        const rawAsset = signal.asset;
-        // Kept verbatim (not trimmed) so it still joins the scanner signal it came from.
-        const asset = typeof rawAsset === 'string' ? rawAsset : typeof rawAsset === 'number' ? String(rawAsset) : '';
-        if (asset.trim() === '') {
-            dropped++;
-            continue;
-        }
-        const direction = signal.direction;
-        const score = signal.score;
-        // A decision-payload signal carries the book top-level (the strategy hoists it there); a raw
-        // scanner signal carries it only on `meta`, since `Signal` has no `dex` field. Both call
-        // shapes reach this helper, so both are read — top-level first, matching the per-signal loop.
-        const meta = signal.meta;
-        const metaDex = meta !== null && typeof meta === 'object' ? meta.dex : undefined;
-        const dex = typeof signal.dex === 'string' && signal.dex.trim() !== '' ? signal.dex : metaDex;
-        rows.push({
-            asset,
-            ...(direction === 'LONG' || direction === 'SHORT' ? { direction } : {}),
-            dex: typeof dex === 'string' && dex.trim() !== '' ? dex.trim() : 'main',
-            ...(typeof score === 'number' && Number.isFinite(score) ? { score } : {}),
-            success: overrides?.success ?? true,
-            reason,
-            ...(overrides?.error !== undefined ? { error: overrides.error } : {}),
-            startedAt: nowMs,
-            endedAt: nowMs,
-            __signalIndex: index,
-        });
-    }
-    if (dropped > 0) {
-        logger.warn('signals dropped from the skip rows: no usable asset to attribute the outcome to', undefined, {
-            reason,
-            dropped,
-            recorded: rows.length,
-        });
-    }
-    return rows;
-}
-//# sourceMappingURL=skipped-signal-results.js.map

package/dist/actions/skipped-signal-results.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"skipped-signal-results.js","sourceRoot":"","sources":["../../src/actions/skipped-signal-results.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAElD,MAAM,MAAM,GAAG,YAAY,CAAC,mCAAmC,CAAC,CAAC;AAEjE;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,UAAU,oBAAoB,CAClC,OAAuC,EACvC,MAAc,EACd,KAAa,EACb,SAAiD;IAEjD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC;QAAE,OAAO,EAAE,CAAC;IACvC,MAAM,IAAI,GAAmC,EAAE,CAAC;IAChD,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,KAAK,MAAM,CAAC,KAAK,EAAE,GAAG,CAAC,IAAI,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;QAC7C,IAAI,GAAG,KAAK,IAAI,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE,CAAC;YAC5C,OAAO,EAAE,CAAC;YACV,SAAS;QACX,CAAC;QACD,MAAM,MAAM,GAAG,GAA8B,CAAC;QAC9C,MAAM,QAAQ,GAAG,MAAM,CAAC,KAAK,CAAC;QAC9B,iFAAiF;QACjF,MAAM,KAAK,GAAG,OAAO,QAAQ,KAAK,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,QAAQ,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC7G,IAAI,KAAK,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;YACxB,OAAO,EAAE,CAAC;YACV,SAAS;QACX,CAAC;QACD,MAAM,SAAS,GAAG,MAAM,CAAC,SAAS,CAAC;QACnC,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC;QAC3B,6FAA6F;QAC7F,yFAAyF;QACzF,8FAA8F;QAC9F,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;QACzB,MAAM,OAAO,GAAG,IAAI,KAAK,IAAI,IAAI,OAAO,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAE,IAAgC,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC;QAC9G,MAAM,GAAG,GAAG,OAAO,MAAM,CAAC,GAAG,KAAK,QAAQ,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC;QAC9F,IAAI,CAAC,IAAI,CAAC;YACR,KAAK;YACL,GAAG,CAAC,SAAS,KAAK,MAAM,IAAI,SAAS,KAAK,OAAO,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACvE,GAAG,EAAE,OAAO,GAAG,KAAK,QAAQ,IAAI,GAAG,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,MAAM;YACvE,GAAG,CAAC,OAAO,KAAK,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACzE,OAAO,EAAE,SAAS,EAAE,OAAO,IAAI,IAAI;YACnC,MAAM;YACN,GAAG,CAAC,SAAS,EAAE,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,SAAS,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACrE,SAAS,EAAE,KAAK;YAChB,OAAO,EAAE,KAAK;YACd,aAAa,EAAE,KAAK;SACrB,CAAC,CAAC;IACL,CAAC;IACD,IAAI,OAAO,GAAG,CAAC,EAAE,CAAC;QAChB,MAAM,CAAC,IAAI,CAAC,iFAAiF,EAAE,SAAS,EAAE;YACxG,MAAM;YACN,OAAO;YACP,QAAQ,EAAE,IAAI,CAAC,MAAM;SACtB,CAAC,CAAC;IACL,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/runtime-api/intake/ingest-request.d.ts

@@ -1,17 +0,0 @@
-/**
- * IntakeSignal → ExternalScannerIngestRequest.
- *
- * The single mapping between the intake wire shape and the engine's ingest shape. Both accept
- * seams call it: the live route closure in `src/index.ts` and `buildIntakeMount`'s `onAccepted`.
- */
-import type { ExternalScannerIngestRequest } from "../../scanners/external-scanner-receiver.js";
-import type { ScannerId } from "../../scanners/types.js";
-import type { IntakeSignal } from "./types.js";
-/**
- * Narrow one accepted intake signal to the ingest request the engine takes.
- *
- * @param scannerName Configured scanner NAME resolved from the registry, not the wire `scanner_id`.
- * @param correlationId Intake-minted id of the acceptance row that admitted this signal.
- */
-export declare function toIngestRequest(signal: IntakeSignal, correlationId: string, scannerName: ScannerId): ExternalScannerIngestRequest;
-//# sourceMappingURL=ingest-request.d.ts.map

package/dist/runtime-api/intake/ingest-request.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"ingest-request.d.ts","sourceRoot":"","sources":["../../../src/runtime-api/intake/ingest-request.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,4BAA4B,EAAE,MAAM,6CAA6C,CAAC;AAChG,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACzD,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAE/C;;;;;GAKG;AACH,wBAAgB,eAAe,CAC7B,MAAM,EAAE,YAAY,EACpB,aAAa,EAAE,MAAM,EACrB,WAAW,EAAE,SAAS,GACrB,4BAA4B,CAoB9B"}

package/dist/runtime-api/intake/ingest-request.js

@@ -1,34 +0,0 @@
-/**
- * IntakeSignal → ExternalScannerIngestRequest.
- *
- * The single mapping between the intake wire shape and the engine's ingest shape. Both accept
- * seams call it: the live route closure in `src/index.ts` and `buildIntakeMount`'s `onAccepted`.
- */
-/**
- * Narrow one accepted intake signal to the ingest request the engine takes.
- *
- * @param scannerName Configured scanner NAME resolved from the registry, not the wire `scanner_id`.
- * @param correlationId Intake-minted id of the acceptance row that admitted this signal.
- */
-export function toIngestRequest(signal, correlationId, scannerName) {
-    return {
-        scanner: scannerName,
-        signal_id: signal.signal_id, // greppable handle across intake→ingest (obs only)
-        asset: signal.asset,
-        direction: signal.direction,
-        ...(signal.signal_type !== undefined && { signal_type: signal.signal_type }),
-        data: signal.data,
-        // Per-signal sizing rides at the top level; the open-position action reads
-        // request.marginPct / request.leverage directly, else a supervised signal's
-        // sizing is lost ("no margin source resolved").
-        ...(signal.marginPct !== undefined && { marginPct: signal.marginPct }),
-        ...(signal.leverage !== undefined && { leverage: signal.leverage }),
-        // The producing scan and the admitting acceptance row.
-        tick_id: signal.tick_id,
-        correlationId,
-        // Intentionally omitted: score (intake has none, defaults to 0 downstream),
-        // valid_until/produced_at (acceptance-pipeline concerns, not ingest fields),
-        // signals[] (single-signal shape: data, not signals[]).
-    };
-}
-//# sourceMappingURL=ingest-request.js.map

package/dist/runtime-api/intake/ingest-request.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"ingest-request.js","sourceRoot":"","sources":["../../../src/runtime-api/intake/ingest-request.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAMH;;;;;GAKG;AACH,MAAM,UAAU,eAAe,CAC7B,MAAoB,EACpB,aAAqB,EACrB,WAAsB;IAEtB,OAAO;QACL,OAAO,EAAE,WAAW;QACpB,SAAS,EAAE,MAAM,CAAC,SAAS,EAAE,mDAAmD;QAChF,KAAK,EAAE,MAAM,CAAC,KAAK;QACnB,SAAS,EAAE,MAAM,CAAC,SAAS;QAC3B,GAAG,CAAC,MAAM,CAAC,WAAW,KAAK,SAAS,IAAI,EAAE,WAAW,EAAE,MAAM,CAAC,WAAW,EAAE,CAAC;QAC5E,IAAI,EAAE,MAAM,CAAC,IAAI;QACjB,2EAA2E;QAC3E,4EAA4E;QAC5E,gDAAgD;QAChD,GAAG,CAAC,MAAM,CAAC,SAAS,KAAK,SAAS,IAAI,EAAE,SAAS,EAAE,MAAM,CAAC,SAAS,EAAE,CAAC;QACtE,GAAG,CAAC,MAAM,CAAC,QAAQ,KAAK,SAAS,IAAI,EAAE,QAAQ,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC;QACnE,uDAAuD;QACvD,OAAO,EAAE,MAAM,CAAC,OAAO;QACvB,aAAa;QACb,4EAA4E;QAC5E,6EAA6E;QAC7E,wDAAwD;KACzD,CAAC;AACJ,CAAC"}

package/dist/runtime-api/intake/scaffold-tick-router.d.ts

@@ -1,39 +0,0 @@
-/**
- * The `/signals` and `/errors` routes' `onTick` — one implementation, used by both.
- *
- * A supervised external scanner runs in its own Python process, so the only facts the runtime has
- * about one of its ticks are the ones that arrive over the intake. Both routes already fire once
- * per tick — `/signals` on every clean tick including a quiet one, `/errors` on every failed one —
- * so the facts ride the request that tick already makes. No second channel, no extra POST, and a
- * producer that sends none behaves exactly as it did before.
- *
- * What this does with them is hand the run to the SAME process sink the in-process scanner runtime
- * hands its own finished runs to ({@link ../../telemetry/scanner-tick-feed.js}), which is a no-op
- * until a client is watching. Nothing here reaches `logger.event` or `appendDomainEvent`: a tick is
- * a LEVEL, and per-tick records would evict real decision rows from the on-disk ring and the
- * publisher's bounded buffer.
- *
- * ABSENT IS NOT ZERO, end to end. A field the producer did not send is left off the run rather than
- * defaulted, so the publisher can leave it off the frame and the screen can print "unknown" instead
- * of a number nobody measured.
- */
-import { type ScannerTickExtras } from "../../telemetry/scanner-tick-feed.js";
-import type { IntakeContext } from "./intake-context.js";
-import type { IntakeTickFacts } from "./types.js";
-/** The producer's facts as the tick feed's extras, with every unreadable field left off. */
-export declare function toTickExtras(facts: IntakeTickFacts): ScannerTickExtras;
-/**
- * Build the `onTick` both intake routes call.
- *
- * Resolves against the SHARED IntakeContext registry, like `onAccepted` and `onScaffoldError`, so
- * the tick is attributed to the scanner's STABLE name and its runtime's wallet rather than to the
- * ephemeral scanner_id a relaunch re-mints — which is the key a client joins a tick to its stats
- * row on.
- *
- * `now` is the runtime clock at the POST, used as the run's finish. The producer's own clock is not
- * used: it is a different machine's wall time, and a frame mixing the two would put ticks in an
- * order neither machine saw. `startedAt` is derived from the duration the producer measured, which
- * keeps `ms` the producer's own number while `t` stays on this box's clock.
- */
-export declare function buildScaffoldTickRouter(ctx: IntakeContext, now?: () => number): (scannerId: string, facts: IntakeTickFacts) => void;
-//# sourceMappingURL=scaffold-tick-router.d.ts.map

package/dist/runtime-api/intake/scaffold-tick-router.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"scaffold-tick-router.d.ts","sourceRoot":"","sources":["../../../src/runtime-api/intake/scaffold-tick-router.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAEH,OAAO,EAIL,KAAK,iBAAiB,EACvB,MAAM,sCAAsC,CAAC;AAE9C,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AACzD,OAAO,KAAK,EAAkB,eAAe,EAAE,MAAM,YAAY,CAAC;AAkClE,4FAA4F;AAC5F,wBAAgB,YAAY,CAAC,KAAK,EAAE,eAAe,GAAG,iBAAiB,CA+BtE;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,uBAAuB,CACrC,GAAG,EAAE,aAAa,EAClB,GAAG,GAAE,MAAM,MAAyB,GACnC,CAAC,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,eAAe,KAAK,IAAI,CAqBrD"}

package/dist/runtime-api/intake/scaffold-tick-router.js

@@ -1,122 +0,0 @@
-/**
- * The `/signals` and `/errors` routes' `onTick` — one implementation, used by both.
- *
- * A supervised external scanner runs in its own Python process, so the only facts the runtime has
- * about one of its ticks are the ones that arrive over the intake. Both routes already fire once
- * per tick — `/signals` on every clean tick including a quiet one, `/errors` on every failed one —
- * so the facts ride the request that tick already makes. No second channel, no extra POST, and a
- * producer that sends none behaves exactly as it did before.
- *
- * What this does with them is hand the run to the SAME process sink the in-process scanner runtime
- * hands its own finished runs to ({@link ../../telemetry/scanner-tick-feed.js}), which is a no-op
- * until a client is watching. Nothing here reaches `logger.event` or `appendDomainEvent`: a tick is
- * a LEVEL, and per-tick records would evict real decision rows from the on-disk ring and the
- * publisher's bounded buffer.
- *
- * ABSENT IS NOT ZERO, end to end. A field the producer did not send is left off the run rather than
- * defaulted, so the publisher can leave it off the frame and the screen can print "unknown" instead
- * of a number nobody measured.
- */
-import { hasScannerTickSink, recordScannerTick, } from "../../telemetry/scanner-tick-feed.js";
-/** The commit endings this box publishes. Anything else a producer sends is dropped, not relayed. */
-const COMMIT_OUTCOMES = new Set([
-    "committed",
-    "rolled_back",
-    "persist_failed",
-]);
-/** A finite, non-negative number, or `undefined` — which is how an unknown stays unknown. */
-function count(value) {
-    return typeof value === "number" && Number.isFinite(value) && value >= 0 ? value : undefined;
-}
-function calls(rows) {
-    if (!Array.isArray(rows))
-        return undefined;
-    const out = [];
-    for (const row of rows) {
-        if (row === null || typeof row !== "object")
-            continue;
-        if (typeof row.tool !== "string" || row.tool.length === 0)
-            continue;
-        out.push({
-            tool: row.tool,
-            ...(count(row.ms) === undefined ? {} : { ms: count(row.ms) }),
-            ...(row.args !== null && typeof row.args === "object" && !Array.isArray(row.args)
-                ? { args: row.args }
-                : {}),
-            ...(typeof row.error_type === "string" && row.error_type.length > 0
-                ? { errorType: row.error_type }
-                : {}),
-        });
-    }
-    return out;
-}
-/** The producer's facts as the tick feed's extras, with every unreadable field left off. */
-export function toTickExtras(facts) {
-    const commit = typeof facts.commit === "string" && COMMIT_OUTCOMES.has(facts.commit)
-        ? facts.commit
-        : undefined;
-    const state = facts.state !== null && typeof facts.state === "object" && !Array.isArray(facts.state)
-        ? facts.state
-        : undefined;
-    const mcpCalls = calls(facts.mcp_calls);
-    return {
-        ...(count(facts.mcp_failures) === undefined ? {} : { mcpFailures: count(facts.mcp_failures) }),
-        ...(mcpCalls === undefined ? {} : { mcpCalls }),
-        ...(count(facts.mcp_ms) === undefined ? {} : { mcpMs: count(facts.mcp_ms) }),
-        ...(count(facts.quiet_ticks) === undefined ? {} : { quietTicks: count(facts.quiet_ticks) }),
-        // The only signed field: a tick that ran EARLY reports a negative lag, and the frame omits it.
-        ...(typeof facts.lag_ms === "number" && Number.isFinite(facts.lag_ms)
-            ? { lagMs: facts.lag_ms }
-            : {}),
-        ...(count(facts.journal_pending) === undefined
-            ? {}
-            : { journalPending: count(facts.journal_pending) }),
-        ...(commit === undefined ? {} : { commit }),
-        ...(state === undefined ? {} : { state }),
-        ...(count(facts.state_fields) === undefined
-            ? {}
-            : { stateFieldCount: count(facts.state_fields) }),
-        ...(count(facts.state_changed) === undefined
-            ? {}
-            : { stateChangedCount: count(facts.state_changed) }),
-    };
-}
-/**
- * Build the `onTick` both intake routes call.
- *
- * Resolves against the SHARED IntakeContext registry, like `onAccepted` and `onScaffoldError`, so
- * the tick is attributed to the scanner's STABLE name and its runtime's wallet rather than to the
- * ephemeral scanner_id a relaunch re-mints — which is the key a client joins a tick to its stats
- * row on.
- *
- * `now` is the runtime clock at the POST, used as the run's finish. The producer's own clock is not
- * used: it is a different machine's wall time, and a frame mixing the two would put ticks in an
- * order neither machine saw. `startedAt` is derived from the duration the producer measured, which
- * keeps `ms` the producer's own number while `t` stays on this box's clock.
- */
-export function buildScaffoldTickRouter(ctx, now = () => Date.now()) {
-    return (scannerId, facts) => {
-        if (facts === null || typeof facts !== "object")
-            return;
-        // Checked first, before anything is built: a box no client has ever reached pays one
-        // comparison per tick and allocates nothing.
-        if (!hasScannerTickSink())
-            return;
-        const entry = ctx.registry.resolve(scannerId);
-        if (!entry)
-            return; // zombie fence — a relaunch re-mints the id and unregisters the old one
-        const finishedAt = now();
-        const durationMs = count(facts.duration_ms);
-        const run = {
-            address: entry.wallet,
-            scannerId: entry.scannerName,
-            status: typeof facts.status === "string" && facts.status.length > 0 ? facts.status : "ok",
-            ...(count(facts.candidate_count) === undefined
-                ? {}
-                : { signalCount: count(facts.candidate_count) }),
-            tick: toTickExtras(facts),
-        };
-        recordScannerTick(run, durationMs === undefined ? undefined : finishedAt - durationMs, finishedAt);
-    };
-}
-//# sourceMappingURL=scaffold-tick-router.js.map

package/dist/runtime-api/intake/scaffold-tick-router.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"scaffold-tick-router.js","sourceRoot":"","sources":["../../../src/runtime-api/intake/scaffold-tick-router.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAEH,OAAO,EACL,kBAAkB,EAClB,iBAAiB,GAGlB,MAAM,sCAAsC,CAAC;AAK9C,qGAAqG;AACrG,MAAM,eAAe,GAAwB,IAAI,GAAG,CAAC;IACnD,WAAW;IACX,aAAa;IACb,gBAAgB;CACjB,CAAC,CAAC;AAEH,6FAA6F;AAC7F,SAAS,KAAK,CAAC,KAAc;IAC3B,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC;AAC/F,CAAC;AAED,SAAS,KAAK,CAAC,IAAkC;IAC/C,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC;QAAE,OAAO,SAAS,CAAC;IAC3C,MAAM,GAAG,GAAe,EAAE,CAAC;IAC3B,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,IAAI,GAAG,KAAK,IAAI,IAAI,OAAO,GAAG,KAAK,QAAQ;YAAE,SAAS;QACtD,IAAI,OAAO,GAAG,CAAC,IAAI,KAAK,QAAQ,IAAI,GAAG,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QACpE,GAAG,CAAC,IAAI,CAAC;YACP,IAAI,EAAE,GAAG,CAAC,IAAI;YACd,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE,CAAE,EAAE,CAAC;YAC9D,GAAG,CAAC,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,OAAO,GAAG,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;gBAC/E,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE;gBACpB,CAAC,CAAC,EAAE,CAAC;YACP,GAAG,CAAC,OAAO,GAAG,CAAC,UAAU,KAAK,QAAQ,IAAI,GAAG,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC;gBACjE,CAAC,CAAC,EAAE,SAAS,EAAE,GAAG,CAAC,UAAU,EAAE;gBAC/B,CAAC,CAAC,EAAE,CAAC;SACR,CAAC,CAAC;IACL,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,4FAA4F;AAC5F,MAAM,UAAU,YAAY,CAAC,KAAsB;IACjD,MAAM,MAAM,GACV,OAAO,KAAK,CAAC,MAAM,KAAK,QAAQ,IAAI,eAAe,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC;QACnE,CAAC,CAAE,KAAK,CAAC,MAA4B;QACrC,CAAC,CAAC,SAAS,CAAC;IAChB,MAAM,KAAK,GACT,KAAK,CAAC,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,CAAC,KAAK,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC;QACpF,CAAC,CAAC,KAAK,CAAC,KAAK;QACb,CAAC,CAAC,SAAS,CAAC;IAChB,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;IACxC,OAAO;QACL,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,KAAK,CAAC,KAAK,CAAC,YAAY,CAAE,EAAE,CAAC;QAC/F,GAAG,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC;QAC/C,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAE,EAAE,CAAC;QAC7E,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,WAAW,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,KAAK,CAAC,KAAK,CAAC,WAAW,CAAE,EAAE,CAAC;QAC5F,+FAA+F;QAC/F,GAAG,CAAC,OAAO,KAAK,CAAC,MAAM,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC;YACnE,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,MAAM,EAAE;YACzB,CAAC,CAAC,EAAE,CAAC;QACP,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,eAAe,CAAC,KAAK,SAAS;YAC5C,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC,EAAE,cAAc,EAAE,KAAK,CAAC,KAAK,CAAC,eAAe,CAAE,EAAE,CAAC;QACtD,GAAG,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC;QAC3C,GAAG,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC;QACzC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,KAAK,SAAS;YACzC,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC,EAAE,eAAe,EAAE,KAAK,CAAC,KAAK,CAAC,YAAY,CAAE,EAAE,CAAC;QACpD,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,aAAa,CAAC,KAAK,SAAS;YAC1C,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC,EAAE,iBAAiB,EAAE,KAAK,CAAC,KAAK,CAAC,aAAa,CAAE,EAAE,CAAC;KACxD,CAAC;AACJ,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,uBAAuB,CACrC,GAAkB,EAClB,MAAoB,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE;IAEpC,OAAO,CAAC,SAAiB,EAAE,KAAsB,EAAQ,EAAE;QACzD,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ;YAAE,OAAO;QACxD,qFAAqF;QACrF,6CAA6C;QAC7C,IAAI,CAAC,kBAAkB,EAAE;YAAE,OAAO;QAClC,MAAM,KAAK,GAAG,GAAG,CAAC,QAAQ,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QAC9C,IAAI,CAAC,KAAK;YAAE,OAAO,CAAC,wEAAwE;QAC5F,MAAM,UAAU,GAAG,GAAG,EAAE,CAAC;QACzB,MAAM,UAAU,GAAG,KAAK,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;QAC5C,MAAM,GAAG,GAAoB;YAC3B,OAAO,EAAE,KAAK,CAAC,MAAM;YACrB,SAAS,EAAE,KAAK,CAAC,WAAW;YAC5B,MAAM,EAAE,OAAO,KAAK,CAAC,MAAM,KAAK,QAAQ,IAAI,KAAK,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI;YACzF,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,eAAe,CAAC,KAAK,SAAS;gBAC5C,CAAC,CAAC,EAAE;gBACJ,CAAC,CAAC,EAAE,WAAW,EAAE,KAAK,CAAC,KAAK,CAAC,eAAe,CAAE,EAAE,CAAC;YACnD,IAAI,EAAE,YAAY,CAAC,KAAK,CAAC;SAC1B,CAAC;QACF,iBAAiB,CAAC,GAAG,EAAE,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,UAAU,GAAG,UAAU,EAAE,UAAU,CAAC,CAAC;IACrG,CAAC,CAAC;AACJ,CAAC"}

package/dist/scanners/external/scaffold/tick_facts.py

@@ -1,130 +0,0 @@
-"""Per-tick observability facts the scaffold hands to the intake.
-
-A scanner tick produces nothing on roughly 99% of ticks, so the only thing a
-live screen can show about a working box is what the tick itself reports. These
-facts are assembled here, once per tick, and ride the POST the delivery sink
-already makes every tick — `/signals` on a clean tick, `/errors` on a failed
-one. There is no second channel and no extra request.
-
-ABSENT IS NOT ZERO. Every field is omitted when its value is unknown, never
-defaulted. A `candidate_count` of 0 is a scanner that found nothing; an absent
-one would be a scanner that did not say. The distinction has to survive from
-here to the screen, so nothing in this module substitutes one for the other.
-
-The state projection is the LAST COMMITTED row, which makes it stale by one tick
-whenever the current tick failed. That is deliberate: a tick that could not
-commit is exactly when the last agreed state is worth seeing.
-"""
-
-from __future__ import annotations
-
-from typing import Any, Optional
-
-
-# Per-value character ceiling inside a projected row. An author may park a whole
-# serialised payload in one state key; this bounds what one tick can put on the
-# wire without bounding what the author may store.
-MAX_STATE_VALUE_CHARS = 1024
-
-# Keys projected out of one state row. Bounds an author's open-ended row the way
-# the runtime bounds an open attribute bag.
-MAX_STATE_KEYS = 32
-
-
-def _is_scalar(value: Any) -> bool:
-    """A value a consumer can parse: str, bool, or a FINITE number.
-
-    bool is checked before the numeric branch only implicitly — it is accepted
-    either way. NaN and the infinities are rejected: they are not JSON, and a
-    consumer reading one has no way to tell it from a real measurement.
-    """
-    if isinstance(value, bool) or isinstance(value, str):
-        return True
-    if isinstance(value, (int, float)):
-        return value == value and value not in (float("inf"), float("-inf"))
-    return False
-
-
-def project_state_row(row: Any) -> dict:
-    """The scalar fields of one state row, capped and bounded.
-
-    Returns {} for anything that is not a dict — a row the author replaced with
-    a list or a string projects to nothing rather than raising inside the loop.
-    """
-    if not isinstance(row, dict):
-        return {}
-    projected: dict = {}
-    for key in list(row.keys())[:MAX_STATE_KEYS]:
-        if not isinstance(key, str):
-            continue
-        value = row[key]
-        if not _is_scalar(value):
-            continue
-        projected[key] = value[:MAX_STATE_VALUE_CHARS] if isinstance(value, str) else value
-    return projected
-
-
-def count_changed(current: dict, previous: Optional[dict]) -> int:
-    """How many projected fields moved since the previously reported row.
-
-    A first row counts every field as changed: nothing was known before it, so
-    every value is new information. A key that disappeared counts too — its
-    absence is a change the operator should see.
-    """
-    if previous is None:
-        return len(current)
-    keys = set(current) | set(previous)
-    return sum(1 for key in keys if current.get(key) != previous.get(key))
-
-
-def build_tick_facts(
-    *,
-    tick_id: str,
-    status: str,
-    candidate_count: int,
-    duration_ms: int,
-    commit: Optional[str],
-    quiet_ticks: int,
-    lag_ms: Optional[int],
-    mcp_snapshot: Optional[dict],
-    call_snapshot: Optional[dict],
-    state_row: Any,
-    state_fields: Optional[int],
-    state_changed: Optional[int],
-) -> dict:
-    """Assemble one tick's facts for the wire.
-
-    `mcp_snapshot` / `call_snapshot` are the MCP boundary's own per-tick tallies,
-    or None when the tick ran without an MCP client — which is not the same as a
-    tick that made no calls, so both keys are then left off entirely.
-    """
-    facts: dict = {
-        "tick_id": tick_id,
-        "status": status,
-        "candidate_count": candidate_count,
-        "duration_ms": duration_ms,
-        # Always known: the loop either commits, rolls back, or fails to persist.
-        **({"commit": commit} if commit else {}),
-        # Zero is a real answer here (this tick produced a signal), so it is sent.
-        "quiet_ticks": quiet_ticks,
-    }
-    # Unknown on the very first tick of a process: there is no previous tick to
-    # measure the gap against, and a 0 would claim the scanner was exactly on time.
-    if lag_ms is not None:
-        facts["lag_ms"] = lag_ms
-    if mcp_snapshot is not None:
-        # Every failure the boundary saw this tick. The overwhelming case is a failure the
-        # author's own `except` caught and turned into an empty return — the one thing that
-        # otherwise leaves no trace at all. A failure that escaped scan() is in the count too,
-        # and needs no separating out: it already failed the tick, so `status` names it.
-        facts["mcp_failures"] = int(mcp_snapshot.get("count") or 0)
-    if call_snapshot is not None:
-        facts["mcp_ms"] = call_snapshot.get("total_ms", 0)
-        facts["mcp_calls"] = call_snapshot.get("calls", [])
-    projected = project_state_row(state_row)
-    if state_fields is not None:
-        facts["state"] = projected
-        facts["state_fields"] = state_fields
-        if state_changed is not None:
-            facts["state_changed"] = state_changed
-    return facts

package/dist/scanners/external/scaffold/ulid.py

@@ -1,58 +0,0 @@
-"""ULID minting: a 26-character, lexicographically sortable id — 48 bits of millisecond timestamp
-followed by 80 bits of randomness, rendered in Crockford's base32. Sortable ids are what let two
-ticks be ordered without carrying a second field, and 80 random bits make a collision between two
-ticks of the same millisecond unreachable.
-
-Mirrors src/utils/ulid.ts so a scaffold id and a runtime id are the same kind of value. The random
-half is read out of a `uuid.uuid4()`, taking only the ten bytes that carry no version or variant
-bits, so all 80 of them are random.
-"""
-
-from __future__ import annotations
-
-import math
-import time
-import uuid
-
-# Crockford's base32: no I, L, O or U, so a transcribed id cannot be misread.
-CROCKFORD = "0123456789ABCDEFGHJKMNPQRSTVWXYZ"
-
-TIME_CHARS = 10
-RANDOM_CHARS = 16
-MAX_TIME = 2 ** 48 - 1
-
-
-def _encode_time(ms) -> str:
-    """Render `ms` as the 10-character time prefix.
-
-    Clamped, and never raised from: a clock that reads non-finite, negative, or past the 48-bit
-    ceiling must still yield a valid id rather than kill the tick that asked for one.
-    """
-    try:
-        remaining = min(max(math.floor(ms), 0), MAX_TIME)
-    except (OverflowError, ValueError, TypeError):
-        remaining = 0
-    out = ""
-    for _ in range(TIME_CHARS):
-        out = CROCKFORD[remaining % 32] + out
-        remaining //= 32
-    return out
-
-
-def _encode_random() -> str:
-    """Render 80 random bits as the 16-character suffix, five bits at a time."""
-    # uuid4 holds its version and variant in bytes 6 and 8; the ten bytes taken here are the
-    # fully random ones.
-    raw = uuid.uuid4().bytes
-    acc = int.from_bytes(raw[:6] + raw[9:13], "big")
-    return "".join(
-        CROCKFORD[(acc >> shift) & 31]
-        for shift in range(RANDOM_CHARS * 5 - 5, -1, -5)
-    )
-
-
-def new_ulid(now_ms: int | None = None) -> str:
-    """Mint a ULID. `now_ms` is injectable so a caller can pin the time half in a test."""
-    if now_ms is None:
-        now_ms = int(time.time() * 1000)
-    return _encode_time(now_ms) + _encode_random()