@unbrained/pm-cli 2026.9.7 → 2026.9.9

package/dist/sdk/provenance.js

@@ -1,259 +1,2 @@
-
-!function(){try{var e="undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof globalThis?globalThis:"undefined"!=typeof self?self:{},n=(new e.Error).stack;n&&(e._sentryDebugIds=e._sentryDebugIds||{},e._sentryDebugIds[n]="6162845d-f4b4-5d1f-a210-ddef1a5c38f6")}catch(e){}}();
-import { AGENT_PROVENANCE_DIMENSIONS, BUILTIN_HARNESS_SIGNAL_DESCRIPTORS, } from "../core/shared/author.js";
-/** Resolve the declared or deterministic legacy identity for one history event. */
-export function resolveHistoryEpisodeGroupIdentity(entry) {
-    if (entry.agent_episode !== undefined) {
-        return { id: entry.agent_episode.id, source: "declared" };
-    }
-    return {
-        id: entry.agent_instance
-            ? `inferred:instance:${entry.agent_instance}`
-            : `inferred:author:${entry.author}:${entry.ts.slice(0, 13)}`,
-        source: "inferred",
-    };
-}
-function episodeParentIsAcyclic(group, parent, declaredGroups) {
-    let cursor = parent;
-    const seen = new Set([group.id]);
-    while (cursor !== undefined && !seen.has(cursor.id)) {
-        seen.add(cursor.id);
-        cursor = cursor.parent_id
-            ? declaredGroups.get(cursor.parent_id)
-            : undefined;
-    }
-    return cursor === undefined;
-}
-function sortAgentEpisodeForest(roots) {
-    const pending = [roots];
-    while (pending.length > 0) {
-        const values = pending.pop();
-        values.sort((left, right) => left.entries[0].ts.localeCompare(right.entries[0].ts) ||
-            left.id.localeCompare(right.id));
-        pending.push(...values.map((value) => value.children));
-    }
-}
-/**
- * Derive dimension coverage from descriptor data. Optional inputs make this a
- * usable negative-control gate instead of a hard-coded assertion.
- */
-export function analyzeAgentProvenanceDescriptorCoverage(descriptors = BUILTIN_HARNESS_SIGNAL_DESCRIPTORS, dimensions = AGENT_PROVENANCE_DIMENSIONS) {
-    return dimensions.map((dimension) => {
-        const harnesses = descriptors
-            .filter((descriptor) => {
-            const keys = dimension === "model"
-                ? descriptor.model_environment_keys
-                : descriptor.provenance_environment_keys?.[dimension];
-            return ((keys?.length ?? 0) > 0 ||
-                descriptor.provenance_resolvers?.[dimension] !== undefined);
-        })
-            .map((descriptor) => descriptor.harness)
-            .sort();
-        return {
-            dimension,
-            harnesses,
-            covered: harnesses.length > 0,
-        };
-    });
-}
-/**
- * Summarize explicit model availability without consulting telemetry or
- * mutable item state. Legacy omissions remain distinct from unavailable.
- */
-export function summarizeAgentModelProvenance(entries, minimumExplicitSample = 1) {
-    const byHarness = new Map();
-    for (const entry of entries) {
-        if (!entry.agent_harness)
-            continue;
-        const row = byHarness.get(entry.agent_harness) ?? {
-            harness: entry.agent_harness,
-            entries: 0,
-            observed: 0,
-            unavailable: 0,
-            legacy_missing: 0,
-        };
-        row.entries += 1;
-        if (entry.agent_model ||
-            (entry.agent_provenance?.model &&
-                entry.agent_provenance.model.value.length > 0)) {
-            row.observed += 1;
-        }
-        else if (entry.agent_provenance?.model === null) {
-            row.unavailable += 1;
-        }
-        else {
-            row.legacy_missing += 1;
-        }
-        byHarness.set(entry.agent_harness, row);
-    }
-    return [...byHarness.values()]
-        .map((row) => {
-        const explicit = row.observed + row.unavailable;
-        return {
-            ...row,
-            coverage: explicit === 0 ? null : row.observed / explicit,
-            inert: explicit >= minimumExplicitSample && row.observed === 0,
-        };
-    })
-        .sort((left, right) => left.harness.localeCompare(right.harness));
-}
-/**
- * Summarize observed, explicitly unavailable, and legacy-missing values for
- * every requested provenance dimension without consulting mutable state.
- */
-export function summarizeAgentProvenance(entries, dimensions = AGENT_PROVENANCE_DIMENSIONS, minimumExplicitSample = 1) {
-    const rows = new Map();
-    for (const entry of entries) {
-        if (!entry.agent_harness)
-            continue;
-        for (const dimension of dimensions) {
-            const key = `${entry.agent_harness}\0${dimension}`;
-            const row = rows.get(key) ?? {
-                harness: entry.agent_harness,
-                dimension,
-                entries: 0,
-                observed: 0,
-                unavailable: 0,
-                legacy_missing: 0,
-            };
-            row.entries += 1;
-            const observation = entry.agent_provenance?.[dimension];
-            if (observation !== undefined &&
-                observation !== null &&
-                observation.value.length > 0) {
-                row.observed += 1;
-            }
-            else if (observation === null) {
-                row.unavailable += 1;
-            }
-            else {
-                row.legacy_missing += 1;
-            }
-            rows.set(key, row);
-        }
-    }
-    return [...rows.values()]
-        .map((row) => {
-        const explicit = row.observed + row.unavailable;
-        return {
-            ...row,
-            coverage: explicit === 0 ? null : row.observed / explicit,
-            inert: explicit >= minimumExplicitSample && row.observed === 0,
-        };
-    })
-        .sort((left, right) => left.harness.localeCompare(right.harness) ||
-        left.dimension.localeCompare(right.dimension));
-}
-/**
- * Measure role/topic availability by harness and precedence source, then apply
- * an explicit ratchet. Empty or synthetic corpora therefore remain useful
- * negative controls instead of silently passing a production coverage gate.
- */
-export function evaluateSemanticAttributionCoverage(entries, options = {}) {
-    const minimumCoverage = options.minimumCoverage ?? 0.8;
-    const minimumEntries = options.minimumEntries ?? 5;
-    if (![
-        Number.isFinite(minimumCoverage),
-        minimumCoverage >= 0,
-        minimumCoverage <= 1,
-    ].every(Boolean)) {
-        throw new RangeError("Semantic attribution minimum coverage must be from 0 to 1.");
-    }
-    if (![Number.isSafeInteger(minimumEntries), minimumEntries >= 1].every(Boolean)) {
-        throw new RangeError("Semantic attribution minimum entries must be a positive integer.");
-    }
-    const rows = new Map();
-    for (const entry of entries) {
-        if (!entry.agent_harness)
-            continue;
-        for (const dimension of ["role", "topic"]) {
-            const key = `${entry.agent_harness}\0${dimension}`;
-            const row = rows.get(key) ?? {
-                harness: entry.agent_harness,
-                dimension,
-                entries: 0,
-                observed: 0,
-                by_source: {},
-                coverage: 0,
-            };
-            row.entries += 1;
-            const observation = entry.agent_provenance?.[dimension];
-            if (observation?.value) {
-                row.observed += 1;
-                row.by_source[observation.source] =
-                    (row.by_source[observation.source] ?? 0) + 1;
-            }
-            rows.set(key, row);
-        }
-    }
-    const ordered = [...rows.values()]
-        .map((row) => ({
-        ...row,
-        coverage: row.observed / row.entries,
-        by_source: Object.fromEntries(Object.entries(row.by_source).sort(([left], [right]) => left.localeCompare(right))),
-    }))
-        .sort((left, right) => left.harness.localeCompare(right.harness) ||
-        left.dimension.localeCompare(right.dimension));
-    const eligible = ordered.filter((row) => row.entries >= minimumEntries);
-    const failures = eligible
-        .filter((row) => row.coverage < minimumCoverage)
-        .map((row) => `${row.harness}:${row.dimension}`);
-    return {
-        passed: eligible.length > 0 && failures.length === 0,
-        minimum_coverage: minimumCoverage,
-        minimum_entries: minimumEntries,
-        rows: ordered,
-        failures,
-    };
-}
-/**
- * Group immutable history by declared episode keys. Legacy entries fall back
- * to their privacy-safe agent instance, or to a deterministic author cohort.
- */
-export function groupHistoryByEpisode(entries) {
-    const sorted = [...entries].sort((left, right) => left.ts.localeCompare(right.ts) ||
-        left.author.localeCompare(right.author) ||
-        left.op.localeCompare(right.op) ||
-        left.before_hash.localeCompare(right.before_hash) ||
-        left.after_hash.localeCompare(right.after_hash));
-    const groups = new Map();
-    const declaredGroups = new Map();
-    for (const entry of sorted) {
-        const episode = entry.agent_episode;
-        const identity = resolveHistoryEpisodeGroupIdentity(entry);
-        const groupKey = `${identity.source}:${identity.id}`;
-        const existing = groups.get(groupKey);
-        if (existing) {
-            existing.entries.push(entry);
-            continue;
-        }
-        const group = {
-            id: identity.id,
-            ...(episode?.label === undefined ? {} : { label: episode.label }),
-            ...(episode?.parent_id === undefined
-                ? {}
-                : { parent_id: episode.parent_id }),
-            source: identity.source,
-            entries: [entry],
-            children: [],
-        };
-        groups.set(groupKey, group);
-        if (episode !== undefined)
-            declaredGroups.set(identity.id, group);
-    }
-    const roots = [];
-    for (const group of groups.values()) {
-        const parent = group.parent_id
-            ? declaredGroups.get(group.parent_id)
-            : undefined;
-        if (parent && episodeParentIsAcyclic(group, parent, declaredGroups)) {
-            parent.children.push(group);
-        }
-        else
-            roots.push(group);
-    }
-    sortAgentEpisodeForest(roots);
-    return roots;
-}
+!(function(){try{var e="undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof globalThis?globalThis:"undefined"!=typeof self?self:{},n=new e.Error().stack;n&&(e._sentryDebugIds=e._sentryDebugIds||{},e._sentryDebugIds[n]="2e7a7f40-523d-590f-8aea-90b65535506e")}catch(e2){}})();import{AGENT_PROVENANCE_DIMENSIONS,BUILTIN_HARNESS_SIGNAL_DESCRIPTORS}from"../core/shared/author.js";function resolveHistoryEpisodeGroupIdentity(entry){if(entry.agent_episode!==void 0){return{id:entry.agent_episode.id,source:"declared"}}return{id:entry.agent_instance?`inferred:instance:${entry.agent_instance}`:`inferred:author:${entry.author}:${entry.ts.slice(0,13)}`,source:"inferred"}}function episodeParentIsAcyclic(group,parent,declaredGroups){let cursor=parent;const seen=new Set([group.id]);while(cursor!==void 0&&!seen.has(cursor.id)){seen.add(cursor.id);cursor=cursor.parent_id?declaredGroups.get(cursor.parent_id):void 0}return cursor===void 0}function sortAgentEpisodeForest(roots){const pending=[roots];while(pending.length>0){const values=pending.pop();values.sort((left,right)=>left.entries[0].ts.localeCompare(right.entries[0].ts)||left.id.localeCompare(right.id));pending.push(...values.map(value=>value.children))}}function analyzeAgentProvenanceDescriptorCoverage(descriptors=BUILTIN_HARNESS_SIGNAL_DESCRIPTORS,dimensions=AGENT_PROVENANCE_DIMENSIONS){return dimensions.map(dimension=>{const harnesses=descriptors.filter(descriptor=>{const keys=dimension==="model"?descriptor.model_environment_keys:descriptor.provenance_environment_keys?.[dimension];return(keys?.length??0)>0||descriptor.provenance_resolvers?.[dimension]!==void 0}).map(descriptor=>descriptor.harness).sort();return{dimension,harnesses,covered:harnesses.length>0}})}function summarizeAgentModelProvenance(entries,minimumExplicitSample=1){const byHarness=new Map;for(const entry of entries){if(!entry.agent_harness)continue;const row=byHarness.get(entry.agent_harness)??{harness:entry.agent_harness,entries:0,observed:0,unavailable:0,legacy_missing:0};row.entries+=1;if(entry.agent_model||entry.agent_provenance?.model&&entry.agent_provenance.model.value.length>0){row.observed+=1}else if(entry.agent_provenance?.model===null){row.unavailable+=1}else{row.legacy_missing+=1}byHarness.set(entry.agent_harness,row)}return[...byHarness.values()].map(row=>{const explicit=row.observed+row.unavailable;return{...row,coverage:explicit===0?null:row.observed/explicit,inert:explicit>=minimumExplicitSample&&row.observed===0}}).sort((left,right)=>left.harness.localeCompare(right.harness))}function summarizeAgentProvenance(entries,dimensions=AGENT_PROVENANCE_DIMENSIONS,minimumExplicitSample=1){const rows=new Map;for(const entry of entries){if(!entry.agent_harness)continue;for(const dimension of dimensions){const key=`${entry.agent_harness}\0${dimension}`;const row=rows.get(key)??{harness:entry.agent_harness,dimension,entries:0,observed:0,unavailable:0,legacy_missing:0};row.entries+=1;const observation=entry.agent_provenance?.[dimension];if(observation!==void 0&&observation!==null&&observation.value.length>0){row.observed+=1}else if(observation===null){row.unavailable+=1}else{row.legacy_missing+=1}rows.set(key,row)}}return[...rows.values()].map(row=>{const explicit=row.observed+row.unavailable;return{...row,coverage:explicit===0?null:row.observed/explicit,inert:explicit>=minimumExplicitSample&&row.observed===0}}).sort((left,right)=>left.harness.localeCompare(right.harness)||left.dimension.localeCompare(right.dimension))}function evaluateSemanticAttributionCoverage(entries,options={}){const minimumCoverage=options.minimumCoverage??.8;const minimumEntries=options.minimumEntries??5;if(![Number.isFinite(minimumCoverage),minimumCoverage>=0,minimumCoverage<=1].every(Boolean)){throw new RangeError("Semantic attribution minimum coverage must be from 0 to 1.")}if(![Number.isSafeInteger(minimumEntries),minimumEntries>=1].every(Boolean)){throw new RangeError("Semantic attribution minimum entries must be a positive integer.")}const rows=new Map;for(const entry of entries){if(!entry.agent_harness)continue;for(const dimension of["role","topic"]){const key=`${entry.agent_harness}\0${dimension}`;const row=rows.get(key)??{harness:entry.agent_harness,dimension,entries:0,observed:0,by_source:{},coverage:0};row.entries+=1;const observation=entry.agent_provenance?.[dimension];if(observation?.value){row.observed+=1;row.by_source[observation.source]=(row.by_source[observation.source]??0)+1}rows.set(key,row)}}const ordered=[...rows.values()].map(row=>({...row,coverage:row.observed/row.entries,by_source:Object.fromEntries(Object.entries(row.by_source).sort(([left],[right])=>left.localeCompare(right)))})).sort((left,right)=>left.harness.localeCompare(right.harness)||left.dimension.localeCompare(right.dimension));const eligible=ordered.filter(row=>row.entries>=minimumEntries);const failures=eligible.filter(row=>row.coverage<minimumCoverage).map(row=>`${row.harness}:${row.dimension}`);return{passed:eligible.length>0&&failures.length===0,minimum_coverage:minimumCoverage,minimum_entries:minimumEntries,rows:ordered,failures}}function groupHistoryByEpisode(entries){const sorted=[...entries].sort((left,right)=>left.ts.localeCompare(right.ts)||left.author.localeCompare(right.author)||left.op.localeCompare(right.op)||left.before_hash.localeCompare(right.before_hash)||left.after_hash.localeCompare(right.after_hash));const groups=new Map;const declaredGroups=new Map;for(const entry of sorted){const episode=entry.agent_episode;const identity=resolveHistoryEpisodeGroupIdentity(entry);const groupKey=`${identity.source}:${identity.id}`;const existing=groups.get(groupKey);if(existing){existing.entries.push(entry);continue}const group={id:identity.id,...episode?.label===void 0?{}:{label:episode.label},...episode?.parent_id===void 0?{}:{parent_id:episode.parent_id},source:identity.source,entries:[entry],children:[]};groups.set(groupKey,group);if(episode!==void 0)declaredGroups.set(identity.id,group)}const roots=[];for(const group of groups.values()){const parent=group.parent_id?declaredGroups.get(group.parent_id):void 0;if(parent&&episodeParentIsAcyclic(group,parent,declaredGroups)){parent.children.push(group)}else roots.push(group)}sortAgentEpisodeForest(roots);return roots}export{analyzeAgentProvenanceDescriptorCoverage,evaluateSemanticAttributionCoverage,groupHistoryByEpisode,resolveHistoryEpisodeGroupIdentity,summarizeAgentModelProvenance,summarizeAgentProvenance};
 //# sourceMappingURL=provenance.js.map
-//# debugId=6162845d-f4b4-5d1f-a210-ddef1a5c38f6