@unbrained/pm-cli 2026.10.11 → 2026.10.13

package/dist/sdk/graph/cache.d.ts

@@ -3,14 +3,14 @@ import { type RelationshipKindRegistry } from "../relationships.js";
 import type { WorkspaceRelationshipAssembly, WorkspaceRelationshipItem } from "./assembly.js";
 /** Cache observability attached to graph result envelopes. */
 export interface GraphCacheMetadata {
-    /** Truncated workspace graph fingerprint identifying the snapshot answered from. */
-    fingerprint: string;
-    /** Whether the workspace assembly was reused from cache. */
-    assembly: "hit" | "miss";
-    /** Whether the full query result was reused from cache. */
-    result: "hit" | "miss";
-    /** Durable cross-process index disposition: answered from it, missed it, or persistence disabled for this workspace. Absent on surfaces that never consult the durable index. */
-    durable?: "hit" | "miss" | "off";
+/** Truncated workspace graph fingerprint identifying the snapshot answered from. */
+fingerprint: string;
+/** Whether the workspace assembly was reused from cache. */
+assembly: "hit" | "miss";
+/** Whether the full query result was reused from cache. */
+result: "hit" | "miss";
+/** Durable cross-process index disposition: answered from it, missed it, or persistence disabled for this workspace. Absent on surfaces that never consult the durable index. */
+durable?: "hit" | "miss" | "off";
 }
 /**
  * Compute the deterministic workspace graph fingerprint for one item snapshot.
@@ -22,23 +22,23 @@ export interface GraphCacheMetadata {
 export declare function computeWorkspaceGraphFingerprint(items: readonly WorkspaceRelationshipItem[], isTerminal?: (status: ItemStatus) => boolean, registry?: RelationshipKindRegistry): string;
 /** One resolved cache lookup bound to a workspace snapshot. */
 export interface WorkspaceGraphCacheLookup {
-    /** The (possibly reused) workspace assembly. */
-    assembly: WorkspaceRelationshipAssembly;
-    /** Whether the assembly came from cache instead of being rebuilt. */
-    assemblyReused: boolean;
-    /** Full fingerprint of the snapshot this lookup is bound to. */
-    fingerprint: string;
-    /**
+/** The (possibly reused) workspace assembly. */
+assembly: WorkspaceRelationshipAssembly;
+/** Whether the assembly came from cache instead of being rebuilt. */
+assemblyReused: boolean;
+/** Full fingerprint of the snapshot this lookup is bound to. */
+fingerprint: string;
+/**
      * Memoize one deterministic query result under this snapshot. On a miss the
      * freshly computed value is returned as-is while an independent clone is
      * stored, so mutating a miss result never corrupts the cache; every hit
      * returns a fresh clone of the stored entry. Callers must not rely on the
      * miss and hit paths returning the same object identity.
      */
-    memoize<T>(queryKey: string, compute: () => T): {
-        value: T;
-        reused: boolean;
-    };
+memoize<T>(queryKey: string, compute: () => T): {
+value: T;
+reused: boolean;
+};
 }
 /**
  * Fingerprint-keyed cache of workspace relationship assemblies and memoized
@@ -48,20 +48,20 @@ export interface WorkspaceGraphCacheLookup {
  * neither the producer nor any consumer can mutate cached state.
  */
 export declare class WorkspaceGraphCache {
-    #private;
-    /** Create a cache, optionally bounding workspaces and memoized results. */
-    constructor(options?: {
-        maxResultsPerWorkspace?: number;
-        maxWorkspaces?: number;
-    });
-    /**
+#private;
+/** Create a cache, optionally bounding workspaces and memoized results. */
+constructor(options?: {
+maxResultsPerWorkspace?: number;
+maxWorkspaces?: number;
+});
+/**
      * Resolve the cached assembly for one workspace key and fingerprint,
      * building and storing it on miss. The returned lookup exposes snapshot-
      * scoped memoization for query results derived from the same assembly.
      */
-    lookup(key: string, fingerprint: string, build: () => WorkspaceRelationshipAssembly): WorkspaceGraphCacheLookup;
-    /** Drop every cached workspace entry and memoized result. */
-    clear(): void;
+lookup(key: string, fingerprint: string, build: () => WorkspaceRelationshipAssembly): WorkspaceGraphCacheLookup;
+/** Drop every cached workspace entry and memoized result. */
+clear(): void;
 }
 /** Return the process-wide shared workspace graph cache. */
 export declare function workspaceGraphCache(): WorkspaceGraphCache;

package/dist/sdk/graph/cardinality-integrity.d.ts

@@ -0,0 +1,13 @@
+import type { Dependency } from "../../types/index.js";
+import type { RelationshipKindRegistry } from "../relationships.js";
+/** Minimal immutable item projection needed to compare relationship cardinality. */
+export interface RelationshipCardinalityItem {
+/** Canonical workspace item identity. */
+id: string;
+/** Stored relationship rows, including their canonical kind and endpoint. */
+dependencies?: readonly Pick<Dependency, "id" | "kind">[];
+}
+/** Share the workspace integrity lock for every kind that constrains edge multiplicity. */
+export declare function relationshipKindNeedsIntegrityLock(kind: string, registry: RelationshipKindRegistry): boolean;
+/** Reject newly introduced non-hierarchy cardinality debt while allowing unchanged debt and repairs. */
+export declare function assertNonHierarchyCardinalityMutationAllowed(before: readonly RelationshipCardinalityItem[], after: readonly RelationshipCardinalityItem[], registry?: RelationshipKindRegistry): void;

package/dist/sdk/graph/cardinality-integrity.js

@@ -0,0 +1,2 @@
+(function(){try{var e=typeof window<"u"?window:typeof global<"u"?global:typeof globalThis<"u"?globalThis:typeof self<"u"?self:{},n=new e.Error().stack;n&&(e._sentryDebugIds=e._sentryDebugIds||{},e._sentryDebugIds[n]="5f2ca18e-450d-5b6e-9e07-7bbf080764f9")}catch{}})();import{EXIT_CODE}from"../../core/shared/constants.js";import{PmCliError}from"../../core/shared/errors.js";import{resolveWorkspaceRelationshipKindRegistry}from"./workspace-relationship-kind-registry.js";function relationshipKindNeedsIntegrityLock(kind,registry){const definition=registry.resolve(kind);return definition?.hierarchy===!0||definition?.outgoing==="one"||definition?.incoming==="one"}function addEndpoint(groups,kind,direction,node,endpoint){const key=JSON.stringify([kind,direction,node]);let group=groups.get(key);group===void 0&&(group={kind,direction,node_id:node,endpoints:new Set},groups.set(key,group)),group.endpoints.add(endpoint)}function cardinalityGroups(items,registry){const groups=new Map;for(const item of items)for(const dependency of item.dependencies??[]){const definition=registry.resolve(dependency.kind);definition===void 0||definition.hierarchy||(definition.outgoing==="one"&&addEndpoint(groups,definition.kind,"outgoing",item.id,dependency.id),definition.incoming==="one"&&addEndpoint(groups,definition.kind,"incoming",dependency.id,item.id))}return groups}function assertNonHierarchyCardinalityMutationAllowed(before,after,registry=resolveWorkspaceRelationshipKindRegistry()){const prior=cardinalityGroups(before,registry),prospective=cardinalityGroups(after,registry);for(const key of[...prospective.keys()].sort()){const group=prospective.get(key);if(group.endpoints.size<=1)continue;const old=prior.get(key);if(![...group.endpoints].every(endpoint=>old?.endpoints.has(endpoint)))throw new PmCliError(`Relationship ${group.kind} permits only one ${group.direction} endpoint for ${group.node_id}.`,EXIT_CODE.USAGE,{code:"dependency_cardinality_created",field:"dependencies",value:group.kind,relationship_cardinality:{kind:group.kind,direction:group.direction,node_id:group.node_id,endpoint_ids:[...group.endpoints].sort()},required:"The final dependency set must satisfy the active relationship kind's one-edge cardinality.",nextSteps:["Drop extra --dep seeds, or remove conflicting rows with update --dep-remove before adding another edge.","Choose another kind only when its declared semantics match the intended relationship."]})}}export{assertNonHierarchyCardinalityMutationAllowed,relationshipKindNeedsIntegrityLock};
+//# sourceMappingURL=cardinality-integrity.js.map

package/dist/sdk/graph/centrality.d.ts

@@ -14,55 +14,55 @@
 import { RelationshipGraph, type RelationshipQueryResult } from "../relationships.js";
 /** One node ranked by structural centrality with directed fan-in/fan-out. */
 export interface RelationshipCentralityRow {
-    /** Node id. */
-    id: string;
-    /** Undirected unique-neighbor degree over selected kinds. */
-    degree: number;
-    /** Distinct ordering predecessors that gate this node (dependency fan-in). */
-    inDegree: number;
-    /** Distinct ordering successors this node gates (dependency fan-out). */
-    outDegree: number;
-    /** Shortest-path betweenness centrality, rounded to six decimals. */
-    betweenness: number;
-    /** Wasserman–Faust closeness centrality, rounded to six decimals. */
-    closeness: number;
+/** Node id. */
+id: string;
+/** Undirected unique-neighbor degree over selected kinds. */
+degree: number;
+/** Distinct ordering predecessors that gate this node (dependency fan-in). */
+inDegree: number;
+/** Distinct ordering successors this node gates (dependency fan-out). */
+outDegree: number;
+/** Shortest-path betweenness centrality, rounded to six decimals. */
+betweenness: number;
+/** Wasserman–Faust closeness centrality, rounded to six decimals. */
+closeness: number;
 }
 /** Bounded centrality-analysis controls. */
 export interface GraphCentralityOptions {
-    /** Registered relationship kinds whose edges define adjacency. */
-    kinds?: readonly string[];
-    /** Abort signal checked once per source sweep. */
-    signal?: AbortSignal;
+/** Registered relationship kinds whose edges define adjacency. */
+kinds?: readonly string[];
+/** Abort signal checked once per source sweep. */
+signal?: AbortSignal;
 }
 /** Deterministic centrality ranking over the undirected knowledge graph. */
 export interface RelationshipCentralityAnalysis {
-    /** Total indexed graph nodes. */
-    nodeCount: number;
-    /** Simple undirected edge count over selected kinds. */
-    edgeCount: number;
-    /** Node rows ranked by betweenness, then degree, then id. */
-    rows: RelationshipCentralityRow[];
+/** Total indexed graph nodes. */
+nodeCount: number;
+/** Simple undirected edge count over selected kinds. */
+edgeCount: number;
+/** Node rows ranked by betweenness, then degree, then id. */
+rows: RelationshipCentralityRow[];
 }
 /** One undirected bridge edge whose removal disconnects its endpoints. */
 export interface RelationshipBridge {
-    /** Lexicographically smaller endpoint. */
-    source: string;
-    /** Lexicographically larger endpoint. */
-    target: string;
+/** Lexicographically smaller endpoint. */
+source: string;
+/** Lexicographically larger endpoint. */
+target: string;
 }
 /** Bounded cut-structure controls. */
 export interface GraphCutStructureOptions {
-    /** Registered relationship kinds whose edges define adjacency. */
-    kinds?: readonly string[];
-    /** Abort signal checked once per depth-first step. */
-    signal?: AbortSignal;
+/** Registered relationship kinds whose edges define adjacency. */
+kinds?: readonly string[];
+/** Abort signal checked once per depth-first step. */
+signal?: AbortSignal;
 }
 /** Articulation points and bridges of the undirected knowledge graph. */
 export interface RelationshipCutStructure {
-    /** Sorted articulation-point ids — nodes whose removal adds components. */
-    articulationPoints: string[];
-    /** Bridge edges sorted by source then target. */
-    bridges: RelationshipBridge[];
+/** Sorted articulation-point ids — nodes whose removal adds components. */
+articulationPoints: string[];
+/** Bridge edges sorted by source then target. */
+bridges: RelationshipBridge[];
 }
 /**
  * Compute exact shortest-path betweenness (Brandes), Wasserman–Faust closeness,

package/dist/sdk/graph/conformance.d.ts

@@ -11,56 +11,56 @@ import { type RelationshipEdge } from "../relationships.js";
 export type RelationshipGraphScaleTopology = "chain" | "star" | "disconnected";
 /** Controls for a lazy deterministic graph scale fixture. */
 export interface RelationshipGraphScaleFixtureOptions {
-    /** Number of nodes yielded by the fixture. */
-    nodeCount: number;
-    /** Shape of generated edges. */
-    topology?: RelationshipGraphScaleTopology;
-    /** Registered relationship kind used by generated edges. */
-    kind?: string;
-    /** Emit one edge per stride; large values model sparse million-node graphs. */
-    edgeStride?: number;
-    /** Stable node-id prefix. */
-    idPrefix?: string;
+/** Number of nodes yielded by the fixture. */
+nodeCount: number;
+/** Shape of generated edges. */
+topology?: RelationshipGraphScaleTopology;
+/** Registered relationship kind used by generated edges. */
+kind?: string;
+/** Emit one edge per stride; large values model sparse million-node graphs. */
+edgeStride?: number;
+/** Stable node-id prefix. */
+idPrefix?: string;
 }
 /** Reusable lazy node/edge fixture plus exact cardinalities. */
 export interface RelationshipGraphScaleFixture {
-    /** Exact node count. */
-    node_count: number;
-    /** Exact generated edge count. */
-    edge_count: number;
-    /** Counting convention used by edge_count. */
-    edge_basis: "fixture_generated";
-    /** Reiterable lazy node identifiers. */
-    nodes: Iterable<string>;
-    /** Reiterable lazy relationship edges. */
-    edges: Iterable<RelationshipEdge>;
+/** Exact node count. */
+node_count: number;
+/** Exact generated edge count. */
+edge_count: number;
+/** Counting convention used by edge_count. */
+edge_basis: "fixture_generated";
+/** Reiterable lazy node identifiers. */
+nodes: Iterable<string>;
+/** Reiterable lazy relationship edges. */
+edges: Iterable<RelationshipEdge>;
 }
 /** Create a lazy deterministic scale fixture without touching tracker storage. */
 export declare function createRelationshipGraphScaleFixture(options: RelationshipGraphScaleFixtureOptions): RelationshipGraphScaleFixture;
 /** One named conformance assertion completed against an adapter. */
 export interface RelationshipGraphAdapterConformanceCase {
-    /** Stable assertion identifier. */
-    name: string;
-    /** Successful case status. */
-    passed: true;
+/** Stable assertion identifier. */
+name: string;
+/** Successful case status. */
+passed: true;
 }
 /** Compact successful adapter-conformance report. */
 export interface RelationshipGraphAdapterConformanceReport {
-    /** Adapter identifier. */
-    adapter: string;
-    /** Isolated workspace key exercised by the run. */
-    workspace: string;
-    /** Completed semantic assertions. */
-    cases: readonly RelationshipGraphAdapterConformanceCase[];
-    /** Whether optional clear semantics were tested. */
-    clear_supported: boolean;
+/** Adapter identifier. */
+adapter: string;
+/** Isolated workspace key exercised by the run. */
+workspace: string;
+/** Completed semantic assertions. */
+cases: readonly RelationshipGraphAdapterConformanceCase[];
+/** Whether optional clear semantics were tested. */
+clear_supported: boolean;
 }
 /**
  * Exercise empty reads, atomic replacement, isolated reads, idempotent sync,
  * compare-and-swap conflicts, replacement visibility, and optional clearing.
  */
 export declare function assertRelationshipGraphAdapterConformance(adapter: RelationshipGraphAdapter, options?: {
-    workspace?: string;
+workspace?: string;
 }): Promise<RelationshipGraphAdapterConformanceReport>;
 /** Run the public conformance contract against the built-in reference adapter. */
 export declare function assertMemoryRelationshipGraphAdapterConformance(workspace?: string): Promise<RelationshipGraphAdapterConformanceReport>;

package/dist/sdk/graph/deadline-scheduling.d.ts

@@ -7,79 +7,79 @@
 import type { RelationshipGraph } from "../relationships.js";
 /** Recorded inputs; absent estimates never imply zero duration. */
 export interface DeadlineScheduleItem {
-    /** Canonical graph identifier. */
-    id: string;
-    /** Recorded elapsed-minute duration. */
-    estimated_minutes?: number;
-    /** Authored ISO deadline interpreted as a finish constraint. */
-    deadline?: string;
+/** Canonical graph identifier. */
+id: string;
+/** Recorded elapsed-minute duration. */
+estimated_minutes?: number;
+/** Authored ISO deadline interpreted as a finish constraint. */
+deadline?: string;
 }
 /** Deterministic analysis controls and hard work/output bounds. */
 export interface DeadlineScheduleOptions {
-    /** Explicit clock instant; defaults to the invocation time. */
-    now?: string;
-    /** Input nodes plus edges plus items ceiling; also caps total retained path identifiers. */
-    maxWork?: number;
-    /** Maximum rows, residual samples, findings, and identifiers per finding path. */
-    limit?: number;
-    /** Cooperative cancellation checked during graph passes. */
-    signal?: AbortSignal;
+/** Explicit clock instant; defaults to the invocation time. */
+now?: string;
+/** Input nodes plus edges plus items ceiling; also caps total retained path identifiers. */
+maxWork?: number;
+/** Maximum rows, residual samples, findings, and identifiers per finding path. */
+limit?: number;
+/** Cooperative cancellation checked during graph passes. */
+signal?: AbortSignal;
 }
 /** One derived finish constraint and its estimated temporal slack. */
 export interface DeadlineScheduleRow {
-    /** Constrained item identifier. */
-    id: string;
-    /** Controlling authored deadline's item identifier. */
-    deadline_id: string;
-    /** Derived latest start; never written to the authored item. */
-    latest_start: string;
-    /** Latest start minus earliest possible start, or null for unknown prerequisites. */
-    slack_minutes: number | null;
+/** Constrained item identifier. */
+id: string;
+/** Controlling authored deadline's item identifier. */
+deadline_id: string;
+/** Derived latest start; never written to the authored item. */
+latest_start: string;
+/** Latest start minus earliest possible start, or null for unknown prerequisites. */
+slack_minutes: number | null;
 }
 /** Explicit evidence that this item's schedule could not be established. */
 export interface DeadlineScheduleResidual {
-    /** Unscheduled or incompletely scheduled item. */
-    id: string;
-    /** Why no feasibility assertion is possible. */
-    reason: "unknown_estimate" | "unknown_predecessor_estimate" | "cycle_or_gated_by_cycle" | "invalid_deadline" | "date_range_exceeded";
+/** Unscheduled or incompletely scheduled item. */
+id: string;
+/** Why no feasibility assertion is possible. */
+reason: "unknown_estimate" | "unknown_predecessor_estimate" | "cycle_or_gated_by_cycle" | "invalid_deadline" | "date_range_exceeded";
 }
 /** One authored deadline that cannot accommodate its longest prerequisite chain. */
 export interface DeadlineOvercommitment {
-    /** Item carrying the authored deadline. */
-    deadline_id: string;
-    /** Authored finish constraint. */
-    deadline: string;
-    /** Positive duration by which earliest finish exceeds the deadline. */
-    shortfall_minutes: number;
-    /** Bounded suffix of the controlling prerequisite chain, in execution order. */
-    path: string[];
-    /** Whether the chain exceeds the path output bound. */
-    path_truncated: boolean;
+/** Item carrying the authored deadline. */
+deadline_id: string;
+/** Authored finish constraint. */
+deadline: string;
+/** Positive duration by which earliest finish exceeds the deadline. */
+shortfall_minutes: number;
+/** Bounded suffix of the controlling prerequisite chain, in execution order. */
+path: string[];
+/** Whether the chain exceeds the path output bound. */
+path_truncated: boolean;
 }
 /** Bounded derived schedule, with completeness separate from output truncation. */
 export interface DeadlineScheduleResult {
-    /** Reproducible clock used for earliest starts. */
-    as_of: string;
-    /** Explicit provenance distinguishing computed constraints from authored dates. */
-    basis: "derived_elapsed_minutes";
-    /** Whether all inputs could be scheduled within the work bound. */
-    complete: boolean;
-    /** Whether output collections omit computed entries. */
-    truncated: boolean;
-    /** True when the work bound prevented the graph pass. */
-    work_limit_exceeded: boolean;
-    /** Number of derived rows before output bounding. */
-    scheduled_count: number;
-    /** Number of explicit residuals before output bounding. */
-    residual_count: number;
-    /** Number of infeasible authored deadlines before output bounding. */
-    overcommitted_count: number;
-    /** Derived latest starts in graph identifier order. */
-    rows: DeadlineScheduleRow[];
-    /** Bounded incomplete-input and cycle samples. */
-    residuals: DeadlineScheduleResidual[];
-    /** Bounded deadline shortfall evidence. */
-    overcommitted: DeadlineOvercommitment[];
+/** Reproducible clock used for earliest starts. */
+as_of: string;
+/** Explicit provenance distinguishing computed constraints from authored dates. */
+basis: "derived_elapsed_minutes";
+/** Whether all inputs could be scheduled within the work bound. */
+complete: boolean;
+/** Whether output collections omit computed entries. */
+truncated: boolean;
+/** True when the work bound prevented the graph pass. */
+work_limit_exceeded: boolean;
+/** Number of derived rows before output bounding. */
+scheduled_count: number;
+/** Number of explicit residuals before output bounding. */
+residual_count: number;
+/** Number of infeasible authored deadlines before output bounding. */
+overcommitted_count: number;
+/** Derived latest starts in graph identifier order. */
+rows: DeadlineScheduleRow[];
+/** Bounded incomplete-input and cycle samples. */
+residuals: DeadlineScheduleResidual[];
+/** Bounded deadline shortfall evidence. */
+overcommitted: DeadlineOvercommitment[];
 }
 /**
  * Derive estimated latest starts and deadline shortfalls without mutating inputs.

package/dist/sdk/graph/durable-cache.d.ts

@@ -5,29 +5,29 @@ export declare const GRAPH_DURABLE_CACHE_VERSION = 2;
 export declare const GRAPH_DURABLE_CACHE_MIN_ITEMS = 500;
 /** Persisted durable graph cache envelope keyed by one workspace fingerprint. */
 export interface DurableGraphCacheEnvelope {
-    /** Envelope format version guarding decode compatibility. */
-    version: number;
-    /** Full workspace graph fingerprint every entry answers for. */
-    fingerprint: string;
-    /** ISO timestamp of the last persisted write. */
-    saved_at: string;
-    /** Deterministic query results keyed by their canonical query key. */
-    results: Record<string, unknown>;
+/** Envelope format version guarding decode compatibility. */
+version: number;
+/** Full workspace graph fingerprint every entry answers for. */
+fingerprint: string;
+/** ISO timestamp of the last persisted write. */
+saved_at: string;
+/** Deterministic query results keyed by their canonical query key. */
+results: Record<string, unknown>;
 }
 /** Compact durable index status projection for observability surfaces. */
 export interface DurableGraphCacheStatus {
-    /** Whether an envelope file exists on disk. */
-    exists: boolean;
-    /** Whether the stored fingerprint matches the current workspace snapshot. */
-    fresh: boolean;
-    /** Stored entry count, 0 when absent. */
-    entry_count: number;
-    /** Truncated stored fingerprint, absent when no envelope exists. */
-    fingerprint?: string;
-    /** ISO timestamp of the last persisted write, absent when no envelope exists. */
-    saved_at?: string;
-    /** Envelope file size in bytes, absent when no envelope exists. */
-    bytes?: number;
+/** Whether an envelope file exists on disk. */
+exists: boolean;
+/** Whether the stored fingerprint matches the current workspace snapshot. */
+fresh: boolean;
+/** Stored entry count, 0 when absent. */
+entry_count: number;
+/** Truncated stored fingerprint, absent when no envelope exists. */
+fingerprint?: string;
+/** ISO timestamp of the last persisted write, absent when no envelope exists. */
+saved_at?: string;
+/** Envelope file size in bytes, absent when no envelope exists. */
+bytes?: number;
 }
 /** Resolve the durable graph cache file path for one workspace root. */
 export declare function durableGraphCachePath(pmRoot: string): string;
@@ -35,12 +35,12 @@ export declare function durableGraphCachePath(pmRoot: string): string;
 export declare function graphAuditBaselinePath(pmRoot: string): string;
 /** One opened durable index view bound to the current workspace fingerprint. */
 export interface DurableGraphCacheView {
-    /** Whether any envelope file exists on disk, fresh or not. */
-    exists: boolean;
-    /** Whether the stored envelope answers for the current fingerprint. */
-    fresh: boolean;
-    /** Fingerprint-fresh persisted query results; empty when absent or stale. */
-    results: Record<string, unknown>;
+/** Whether any envelope file exists on disk, fresh or not. */
+exists: boolean;
+/** Whether the stored envelope answers for the current fingerprint. */
+fresh: boolean;
+/** Fingerprint-fresh persisted query results; empty when absent or stale. */
+results: Record<string, unknown>;
 }
 /**
  * Open the persisted envelope against the current workspace fingerprint. A