@solidnumber/cli 1.16.2 → 1.19.5

package/dist/lib/graph-walker.js

@@ -0,0 +1,387 @@
+"use strict";
+/**
+ * Graph walker for JSON-LD tenant context.
+ *
+ * Consumes the output of `GET /api/v1/cli/context?format=jsonld` —
+ * a Schema.org + solid:* typed graph — and offers the primitives the
+ * `solid graph` CLI command (and anything else that wants to navigate
+ * the tenant context) needs: a normalised adjacency map, BFS up to N
+ * hops from a root IRI, filters by @type, and a short-form expander
+ * (``kb/42`` → full IRI).
+ *
+ * The walker is intentionally schema-light: it treats any string-valued
+ * field whose value is an `@id` found in the graph as an outbound edge,
+ * plus anything declared ``@type: @id`` in the document's @context. This
+ * means the moment a new relationship predicate is added to
+ * `services/ai_context_jsonld.py` it is walkable without changing this
+ * file.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.buildAdjacency = buildAdjacency;
+exports.bfs = bfs;
+exports.bfsOut = bfsOut;
+exports.nodesOfType = nodesOfType;
+exports.listTypes = listTypes;
+exports.resolveIri = resolveIri;
+exports.subgraph = subgraph;
+exports.validate = validate;
+/**
+ * Edge discovery — which predicates in a node are links to other nodes.
+ *
+ * Approach: any string value that matches an ``@id`` already in the
+ * graph is considered an outbound edge; any array of strings whose
+ * entries match IDs is a bag of outbound edges. That covers every
+ * edge declared in the current @context (``provider``, ``company``,
+ * ``withinTier``, ``inIndustry``, ``shelfOf``, ``clonedFromTemplate``,
+ * ``handles``, ``operatesOn``, ``offers``, ``supersededBy``, ...) plus
+ * any future ones, without having to enumerate them here.
+ */
+function collectEdges(node, knownIds) {
+    const out = [];
+    for (const [key, value] of Object.entries(node)) {
+        if (key.startsWith('@'))
+            continue;
+        if (typeof value === 'string' && knownIds.has(value) && value !== node['@id']) {
+            out.push({ predicate: key, target: value });
+        }
+        else if (Array.isArray(value)) {
+            for (const item of value) {
+                if (typeof item === 'string' && knownIds.has(item) && item !== node['@id']) {
+                    out.push({ predicate: key, target: item });
+                }
+                else if (item && typeof item === 'object' && '@id' in item) {
+                    const embeddedId = item['@id'];
+                    if (typeof embeddedId === 'string' && knownIds.has(embeddedId) && embeddedId !== node['@id']) {
+                        out.push({ predicate: key, target: embeddedId });
+                    }
+                }
+            }
+        }
+        else if (value && typeof value === 'object' && '@id' in value) {
+            // Embedded node reference (e.g. nested schema:Offer) — treat its
+            // @id as an outbound edge when it resolves inside the graph.
+            const embeddedId = value['@id'];
+            if (typeof embeddedId === 'string' && knownIds.has(embeddedId) && embeddedId !== node['@id']) {
+                out.push({ predicate: key, target: embeddedId });
+            }
+        }
+    }
+    return out;
+}
+/**
+ * Build an adjacency map keyed by @id. Every node's outbound and
+ * inbound edges are precomputed so BFS + reverse lookup are O(1).
+ */
+function buildAdjacency(doc) {
+    const graph = doc.graph ?? [];
+    const map = new Map();
+    const knownIds = new Set(graph.map((n) => n['@id']));
+    for (const node of graph) {
+        map.set(node['@id'], { node, outEdges: [], inEdges: [] });
+    }
+    for (const node of graph) {
+        const edges = collectEdges(node, knownIds);
+        const entry = map.get(node['@id']);
+        if (!entry)
+            continue;
+        entry.outEdges = edges;
+        for (const e of edges) {
+            const targetEntry = map.get(e.target);
+            if (targetEntry) {
+                targetEntry.inEdges.push({ predicate: e.predicate, source: node['@id'] });
+            }
+        }
+    }
+    return map;
+}
+/**
+ * BFS outward from a root IRI. Returns the set of visited IDs; depth
+ * limit is the maximum number of edges traversed from the root.
+ * ``hops = 0`` returns just the root; ``hops = 1`` returns root + all
+ * direct neighbors; etc.
+ */
+function bfs(adj, root, hops) {
+    if (!adj.has(root))
+        return new Set();
+    const visited = new Set([root]);
+    if (hops <= 0)
+        return visited;
+    let frontier = [root];
+    for (let depth = 0; depth < hops; depth++) {
+        const next = [];
+        for (const id of frontier) {
+            const entry = adj.get(id);
+            if (!entry)
+                continue;
+            for (const e of entry.outEdges) {
+                if (!visited.has(e.target)) {
+                    visited.add(e.target);
+                    next.push(e.target);
+                }
+            }
+            // Inbound edges too — a "relationships around X" view should show
+            // the things that point AT X, not just the things X points at.
+            // The user can drop this via --directed.
+            for (const e of entry.inEdges) {
+                if (!visited.has(e.source)) {
+                    visited.add(e.source);
+                    next.push(e.source);
+                }
+            }
+        }
+        frontier = next;
+        if (!frontier.length)
+            break;
+    }
+    return visited;
+}
+/** Directed variant — only outbound edges. */
+function bfsOut(adj, root, hops) {
+    if (!adj.has(root))
+        return new Set();
+    const visited = new Set([root]);
+    if (hops <= 0)
+        return visited;
+    let frontier = [root];
+    for (let depth = 0; depth < hops; depth++) {
+        const next = [];
+        for (const id of frontier) {
+            const entry = adj.get(id);
+            if (!entry)
+                continue;
+            for (const e of entry.outEdges) {
+                if (!visited.has(e.target)) {
+                    visited.add(e.target);
+                    next.push(e.target);
+                }
+            }
+        }
+        frontier = next;
+        if (!frontier.length)
+            break;
+    }
+    return visited;
+}
+/**
+ * Return every node whose @type array contains ``targetType``. Handles
+ * both string and array shapes. ``targetType`` may be a bare Schema.org
+ * fragment (``"Service"``), a Solid# vocab term (``"solid:Agent"``), or
+ * a full IRI; we match suffix-wise so casual inputs work.
+ */
+function nodesOfType(doc, targetType) {
+    const graph = doc.graph ?? [];
+    const needle = targetType.toLowerCase();
+    return graph.filter((n) => {
+        const t = n['@type'];
+        if (!t)
+            return false;
+        const arr = Array.isArray(t) ? t : [t];
+        return arr.some((ty) => {
+            const s = String(ty).toLowerCase();
+            return s === needle || s.endsWith(':' + needle) || s.endsWith('/' + needle);
+        });
+    });
+}
+/** Enumerate every distinct @type value in the graph, sorted. */
+function listTypes(doc) {
+    const graph = doc.graph ?? [];
+    const seen = new Set();
+    for (const n of graph) {
+        const t = n['@type'];
+        if (!t)
+            continue;
+        const arr = Array.isArray(t) ? t : [t];
+        for (const ty of arr)
+            seen.add(String(ty));
+    }
+    return [...seen].sort();
+}
+/**
+ * Short-form expander. Accepts the bare argument the user typed on the
+ * CLI and returns the full IRI when it can be resolved:
+ *
+ *   "kb/42"                                    →  docRoot + "/kb/42"
+ *   "co/61/service/3"                          →  SOLID + "/co/61/service/3"
+ *   "https://solidnumber.com/co/61/kb/42"      →  unchanged (already full)
+ *   "tier/builder"                             →  SOLID + "/vocab/tier/builder"
+ *
+ * ``docRoot`` should be the graph document's own ``@id`` (the tenant
+ * Organization) so relative paths resolve against the caller's tenant.
+ */
+function resolveIri(input, docRoot) {
+    const trimmed = input.trim();
+    if (trimmed.startsWith('http://') || trimmed.startsWith('https://'))
+        return trimmed;
+    // "vocab/<type>/<slug>" or "tier/<slug>" — platform-wide.
+    const platformPrefixes = ['tier/', 'industry/', 'shelf/', 'agent-default/', 'cli-tool/', 'kb-template/'];
+    if (platformPrefixes.some((p) => trimmed.startsWith(p))) {
+        return `https://solidnumber.com/vocab/${trimmed}`;
+    }
+    if (trimmed.startsWith('vocab/')) {
+        return `https://solidnumber.com/${trimmed}`;
+    }
+    // "co/<id>/<type>/<entity>" — full company-scoped path sans scheme.
+    if (trimmed.startsWith('co/')) {
+        return `https://solidnumber.com/${trimmed}`;
+    }
+    // Relative to this tenant's doc root, e.g. "kb/42" → "<doc>/kb/42".
+    if (docRoot)
+        return `${docRoot.replace(/\/$/, '')}/${trimmed}`;
+    return trimmed;
+}
+/** Extract a subgraph (a fresh JsonLdDocument) containing only the
+ *  nodes in ``ids`` — useful for ``solid graph --json`` output. */
+function subgraph(doc, ids) {
+    const graph = (doc.graph ?? []).filter((n) => ids.has(n['@id']));
+    return {
+        '@context': doc['@context'],
+        '@id': doc['@id'],
+        '@type': doc['@type'],
+        graph,
+    };
+}
+/**
+ * Per-type required-field registry. Matched against the @type array
+ * using the same suffix rules as ``nodesOfType``. Each required field
+ * is either a predicate that must be present and non-empty, or an
+ * edge that must resolve inside @graph.
+ *
+ * Missing required fields are ERROR by default; edge targets that
+ * exist but don't resolve in-document are ERROR. Structural issues
+ * (like a duplicate @id) are ERROR too.
+ *
+ * The registry is permissive: unknown types don't produce issues.
+ * New types are validated the moment they're added to this map.
+ */
+const REQUIRED_FIELDS = [
+    { matchType: 'Organization', fields: ['name'] },
+    { matchType: 'solid:Company', fields: ['name', 'identifier'] },
+    { matchType: 'Service', fields: ['name', 'provider'] },
+    { matchType: 'Product', fields: ['name', 'provider'] },
+    { matchType: 'solid:KnowledgeBaseEntry', fields: ['name', 'company'] },
+    { matchType: 'solid:Agent', fields: ['name'] },
+    { matchType: 'solid:WebsitePage', fields: ['name', 'company'] },
+    { matchType: 'solid:Site', fields: ['name', 'company'] },
+    { matchType: 'solid:AgentChain', fields: ['name', 'company'] },
+    { matchType: 'solid:InboundWebhook', fields: ['solid:eventKey', 'company'] },
+    { matchType: 'solid:CustomDomain', fields: ['name', 'company'] },
+    { matchType: 'solid:Tier', fields: ['name'] },
+    { matchType: 'solid:Industry', fields: ['name'] },
+];
+function nodeTypeMatches(node, target) {
+    const t = node['@type'];
+    if (!t)
+        return false;
+    const arr = Array.isArray(t) ? t : [t];
+    const needle = target.toLowerCase();
+    return arr.some((ty) => {
+        const s = String(ty).toLowerCase();
+        return s === needle || s.endsWith(':' + needle) || s.endsWith('/' + needle);
+    });
+}
+function hasNonEmptyField(node, field) {
+    const v = node[field];
+    if (v === undefined || v === null || v === '')
+        return false;
+    if (Array.isArray(v) && v.length === 0)
+        return false;
+    if (typeof v === 'object' && !Array.isArray(v) && Object.keys(v).length === 0)
+        return false;
+    return true;
+}
+function validate(doc) {
+    const issues = [];
+    const graph = doc.graph ?? [];
+    const ids = new Set();
+    let edgeCount = 0;
+    // Pass 1: duplicate @id detection + build the id set.
+    for (const node of graph) {
+        const id = node['@id'];
+        if (!id) {
+            issues.push({
+                severity: 'error',
+                code: 'missing_id',
+                nodeId: '(unnamed)',
+                message: `node lacks @id — graph cannot reference it`,
+            });
+            continue;
+        }
+        if (ids.has(id)) {
+            issues.push({
+                severity: 'error',
+                code: 'duplicate_id',
+                nodeId: id,
+                message: `@id appears more than once in @graph`,
+            });
+        }
+        ids.add(id);
+    }
+    // Pass 2: per-node edge + required-field checks.
+    for (const node of graph) {
+        const id = node['@id'];
+        if (!id)
+            continue;
+        // Required fields per type.
+        for (const rule of REQUIRED_FIELDS) {
+            if (!nodeTypeMatches(node, rule.matchType))
+                continue;
+            for (const field of rule.fields) {
+                if (!hasNonEmptyField(node, field)) {
+                    issues.push({
+                        severity: 'error',
+                        code: 'missing_required',
+                        nodeId: id,
+                        message: `@type ${rule.matchType} requires field "${field}" — missing or empty`,
+                    });
+                }
+            }
+        }
+        // Edge targets — any string value resolving to an IRI-shaped id
+        // should exist in @graph. This is the same edge-discovery logic
+        // the walker uses; dangling edges = bad graph.
+        for (const [key, value] of Object.entries(node)) {
+            if (key.startsWith('@'))
+                continue;
+            const targets = [];
+            if (typeof value === 'string' && /^https?:\/\//.test(value)) {
+                targets.push(value);
+            }
+            else if (Array.isArray(value)) {
+                for (const item of value) {
+                    if (typeof item === 'string' && /^https?:\/\//.test(item))
+                        targets.push(item);
+                }
+            }
+            else if (value && typeof value === 'object' && '@id' in value) {
+                const inner = value['@id'];
+                if (typeof inner === 'string' && /^https?:\/\//.test(inner))
+                    targets.push(inner);
+            }
+            for (const target of targets) {
+                edgeCount++;
+                // External IRIs (outside solidnumber.com) aren't expected to
+                // resolve inside @graph — e.g. schema:image might point at a
+                // CDN URL. We only enforce resolution for solidnumber.com IDs.
+                if (!target.startsWith('https://solidnumber.com'))
+                    continue;
+                if (target === id)
+                    continue; // self-ref is benign
+                if (!ids.has(target)) {
+                    issues.push({
+                        severity: 'error',
+                        code: 'dangling_edge',
+                        nodeId: id,
+                        message: `"${key}" → ${target} — target not in @graph`,
+                    });
+                }
+            }
+        }
+    }
+    return {
+        ok: issues.filter((i) => i.severity === 'error').length === 0,
+        issues,
+        nodeCount: graph.length,
+        edgeCount,
+    };
+}
+//# sourceMappingURL=graph-walker.js.map

package/dist/lib/graph-walker.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-walker.js","sourceRoot":"","sources":["../../src/lib/graph-walker.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;GAgBG;;AAmEH,wCAqBC;AAQD,kBA+BC;AAGD,wBAsBC;AAQD,kCAYC;AAGD,8BAUC;AAcD,gCAqBC;AAID,4BAQC;AAoED,4BA2FC;AAhXD;;;;;;;;;;GAUG;AACH,SAAS,YAAY,CAAC,IAAgB,EAAE,QAAqB;IAC3D,MAAM,GAAG,GAAiD,EAAE,CAAC;IAC7D,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;QAChD,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC;YAAE,SAAS;QAClC,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YAC9E,GAAG,CAAC,IAAI,CAAC,EAAE,SAAS,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC;QAC9C,CAAC;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;YAChC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;oBAC3E,GAAG,CAAC,IAAI,CAAC,EAAE,SAAS,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC;gBAC7C,CAAC;qBAAM,IAAI,IAAI,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,KAAK,IAAK,IAAe,EAAE,CAAC;oBACzE,MAAM,UAAU,GAAI,IAA4B,CAAC,KAAK,CAAC,CAAC;oBACxD,IAAI,OAAO,UAAU,KAAK,QAAQ,IAAI,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,UAAU,KAAK,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;wBAC7F,GAAG,CAAC,IAAI,CAAC,EAAE,SAAS,EAAE,GAAG,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC,CAAC;oBACnD,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;aAAM,IAAI,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,IAAK,KAAgB,EAAE,CAAC;YAC5E,iEAAiE;YACjE,6DAA6D;YAC7D,MAAM,UAAU,GAAI,KAA6B,CAAC,KAAK,CAAC,CAAC;YACzD,IAAI,OAAO,UAAU,KAAK,QAAQ,IAAI,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,UAAU,KAAK,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC7F,GAAG,CAAC,IAAI,CAAC,EAAE,SAAS,EAAE,GAAG,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC,CAAC;YACnD,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;GAGG;AACH,SAAgB,cAAc,CAAC,GAAmB;IAChD,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,IAAI,EAAE,CAAC;IAC9B,MAAM,GAAG,GAAiB,IAAI,GAAG,EAAE,CAAC;IACpC,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAS,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAE7D,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC;IAC5D,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;QAC3C,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;QACnC,IAAI,CAAC,KAAK;YAAE,SAAS;QACrB,KAAK,CAAC,QAAQ,GAAG,KAAK,CAAC;QACvB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,MAAM,WAAW,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YACtC,IAAI,WAAW,EAAE,CAAC;gBAChB,WAAW,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,SAAS,EAAE,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YAC5E,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;GAKG;AACH,SAAgB,GAAG,CAAC,GAAiB,EAAE,IAAY,EAAE,IAAY;IAC/D,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,GAAG,EAAE,CAAC;IACrC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,IAAI,CAAC,CAAC,CAAC;IACxC,IAAI,IAAI,IAAI,CAAC;QAAE,OAAO,OAAO,CAAC;IAE9B,IAAI,QAAQ,GAAa,CAAC,IAAI,CAAC,CAAC;IAChC,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;QAC1C,MAAM,IAAI,GAAa,EAAE,CAAC;QAC1B,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;YAC1B,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC1B,IAAI,CAAC,KAAK;gBAAE,SAAS;YACrB,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;gBAC/B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;oBAC3B,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;oBACtB,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;gBACtB,CAAC;YACH,CAAC;YACD,kEAAkE;YAClE,+DAA+D;YAC/D,yCAAyC;YACzC,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;gBAC9B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;oBAC3B,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;oBACtB,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;gBACtB,CAAC;YACH,CAAC;QACH,CAAC;QACD,QAAQ,GAAG,IAAI,CAAC;QAChB,IAAI,CAAC,QAAQ,CAAC,MAAM;YAAE,MAAM;IAC9B,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,8CAA8C;AAC9C,SAAgB,MAAM,CAAC,GAAiB,EAAE,IAAY,EAAE,IAAY;IAClE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,GAAG,EAAE,CAAC;IACrC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,IAAI,CAAC,CAAC,CAAC;IACxC,IAAI,IAAI,IAAI,CAAC;QAAE,OAAO,OAAO,CAAC;IAE9B,IAAI,QAAQ,GAAa,CAAC,IAAI,CAAC,CAAC;IAChC,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;QAC1C,MAAM,IAAI,GAAa,EAAE,CAAC;QAC1B,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;YAC1B,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC1B,IAAI,CAAC,KAAK;gBAAE,SAAS;YACrB,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;gBAC/B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;oBAC3B,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;oBACtB,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;gBACtB,CAAC;YACH,CAAC;QACH,CAAC;QACD,QAAQ,GAAG,IAAI,CAAC;QAChB,IAAI,CAAC,QAAQ,CAAC,MAAM;YAAE,MAAM;IAC9B,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;GAKG;AACH,SAAgB,WAAW,CAAC,GAAmB,EAAE,UAAkB;IACjE,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,IAAI,EAAE,CAAC;IAC9B,MAAM,MAAM,GAAG,UAAU,CAAC,WAAW,EAAE,CAAC;IACxC,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;QACxB,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC;QACrB,IAAI,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;QACrB,MAAM,GAAG,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACvC,OAAO,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE;YACrB,MAAM,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;YACnC,OAAO,CAAC,KAAK,MAAM,IAAI,CAAC,CAAC,QAAQ,CAAC,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,GAAG,GAAG,MAAM,CAAC,CAAC;QAC9E,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC;AAED,iEAAiE;AACjE,SAAgB,SAAS,CAAC,GAAmB;IAC3C,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,IAAI,EAAE,CAAC;IAC9B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC;QACrB,IAAI,CAAC,CAAC;YAAE,SAAS;QACjB,MAAM,GAAG,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACvC,KAAK,MAAM,EAAE,IAAI,GAAG;YAAE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7C,CAAC;IACD,OAAO,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;AAC1B,CAAC;AAED;;;;;;;;;;;GAWG;AACH,SAAgB,UAAU,CAAC,KAAa,EAAE,OAA2B;IACnE,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;IAC7B,IAAI,OAAO,CAAC,UAAU,CAAC,SAAS,CAAC,IAAI,OAAO,CAAC,UAAU,CAAC,UAAU,CAAC;QAAE,OAAO,OAAO,CAAC;IAEpF,0DAA0D;IAC1D,MAAM,gBAAgB,GAAG,CAAC,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,gBAAgB,EAAE,WAAW,EAAE,cAAc,CAAC,CAAC;IACzG,IAAI,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACxD,OAAO,iCAAiC,OAAO,EAAE,CAAC;IACpD,CAAC;IACD,IAAI,OAAO,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;QACjC,OAAO,2BAA2B,OAAO,EAAE,CAAC;IAC9C,CAAC;IAED,oEAAoE;IACpE,IAAI,OAAO,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC;QAC9B,OAAO,2BAA2B,OAAO,EAAE,CAAC;IAC9C,CAAC;IAED,oEAAoE;IACpE,IAAI,OAAO;QAAE,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,OAAO,EAAE,CAAC;IAC/D,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;mEACmE;AACnE,SAAgB,QAAQ,CAAC,GAAmB,EAAE,GAAgB;IAC5D,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACjE,OAAO;QACL,UAAU,EAAE,GAAG,CAAC,UAAU,CAAC;QAC3B,KAAK,EAAE,GAAG,CAAC,KAAK,CAAC;QACjB,OAAO,EAAE,GAAG,CAAC,OAAO,CAAC;QACrB,KAAK;KACN,CAAC;AACJ,CAAC;AAoBD;;;;;;;;;;;;GAYG;AACH,MAAM,eAAe,GAAmD;IACtE,EAAE,SAAS,EAAE,cAAc,EAAU,MAAM,EAAE,CAAC,MAAM,CAAC,EAAE;IACvD,EAAE,SAAS,EAAE,eAAe,EAAS,MAAM,EAAE,CAAC,MAAM,EAAE,YAAY,CAAC,EAAE;IACrE,EAAE,SAAS,EAAE,SAAS,EAAe,MAAM,EAAE,CAAC,MAAM,EAAE,UAAU,CAAC,EAAE;IACnE,EAAE,SAAS,EAAE,SAAS,EAAe,MAAM,EAAE,CAAC,MAAM,EAAE,UAAU,CAAC,EAAE;IACnE,EAAE,SAAS,EAAE,0BAA0B,EAAE,MAAM,EAAE,CAAC,MAAM,EAAE,SAAS,CAAC,EAAE;IACtE,EAAE,SAAS,EAAE,aAAa,EAAW,MAAM,EAAE,CAAC,MAAM,CAAC,EAAE;IACvD,EAAE,SAAS,EAAE,mBAAmB,EAAK,MAAM,EAAE,CAAC,MAAM,EAAE,SAAS,CAAC,EAAE;IAClE,EAAE,SAAS,EAAE,YAAY,EAAY,MAAM,EAAE,CAAC,MAAM,EAAE,SAAS,CAAC,EAAE;IAClE,EAAE,SAAS,EAAE,kBAAkB,EAAM,MAAM,EAAE,CAAC,MAAM,EAAE,SAAS,CAAC,EAAE;IAClE,EAAE,SAAS,EAAE,sBAAsB,EAAE,MAAM,EAAE,CAAC,gBAAgB,EAAE,SAAS,CAAC,EAAE;IAC5E,EAAE,SAAS,EAAE,oBAAoB,EAAI,MAAM,EAAE,CAAC,MAAM,EAAE,SAAS,CAAC,EAAE;IAClE,EAAE,SAAS,EAAE,YAAY,EAAY,MAAM,EAAE,CAAC,MAAM,CAAC,EAAE;IACvD,EAAE,SAAS,EAAE,gBAAgB,EAAQ,MAAM,EAAE,CAAC,MAAM,CAAC,EAAE;CACxD,CAAC;AAEF,SAAS,eAAe,CAAC,IAAgB,EAAE,MAAc;IACvD,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC;IACxB,IAAI,CAAC,CAAC;QAAE,OAAO,KAAK,CAAC;IACrB,MAAM,GAAG,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvC,MAAM,MAAM,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;IACpC,OAAO,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE;QACrB,MAAM,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;QACnC,OAAO,CAAC,KAAK,MAAM,IAAI,CAAC,CAAC,QAAQ,CAAC,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,GAAG,GAAG,MAAM,CAAC,CAAC;IAC9E,CAAC,CAAC,CAAC;AACL,CAAC;AAED,SAAS,gBAAgB,CAAC,IAAgB,EAAE,KAAa;IACvD,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;IACtB,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,EAAE;QAAE,OAAO,KAAK,CAAC;IAC5D,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IACrD,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IAC5F,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAgB,QAAQ,CAAC,GAAmB;IAC1C,MAAM,MAAM,GAAsB,EAAE,CAAC;IACrC,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,IAAI,EAAE,CAAC;IAC9B,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,IAAI,SAAS,GAAG,CAAC,CAAC;IAElB,sDAAsD;IACtD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;QACvB,IAAI,CAAC,EAAE,EAAE,CAAC;YACR,MAAM,CAAC,IAAI,CAAC;gBACV,QAAQ,EAAE,OAAO;gBACjB,IAAI,EAAE,YAAY;gBAClB,MAAM,EAAE,WAAW;gBACnB,OAAO,EAAE,4CAA4C;aACtD,CAAC,CAAC;YACH,SAAS;QACX,CAAC;QACD,IAAI,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YAChB,MAAM,CAAC,IAAI,CAAC;gBACV,QAAQ,EAAE,OAAO;gBACjB,IAAI,EAAE,cAAc;gBACpB,MAAM,EAAE,EAAE;gBACV,OAAO,EAAE,sCAAsC;aAChD,CAAC,CAAC;QACL,CAAC;QACD,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACd,CAAC;IAED,iDAAiD;IACjD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;QACvB,IAAI,CAAC,EAAE;YAAE,SAAS;QAElB,4BAA4B;QAC5B,KAAK,MAAM,IAAI,IAAI,eAAe,EAAE,CAAC;YACnC,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC;gBAAE,SAAS;YACrD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;gBAChC,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;oBACnC,MAAM,CAAC,IAAI,CAAC;wBACV,QAAQ,EAAE,OAAO;wBACjB,IAAI,EAAE,kBAAkB;wBACxB,MAAM,EAAE,EAAE;wBACV,OAAO,EAAE,SAAS,IAAI,CAAC,SAAS,oBAAoB,KAAK,sBAAsB;qBAChF,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;QAED,gEAAgE;QAChE,gEAAgE;QAChE,+CAA+C;QAC/C,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YAChD,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC;gBAAE,SAAS;YAClC,MAAM,OAAO,GAAa,EAAE,CAAC;YAC7B,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC5D,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACtB,CAAC;iBAAM,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;gBAChC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;oBACzB,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC;wBAAE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAChF,CAAC;YACH,CAAC;iBAAM,IAAI,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,IAAK,KAAgB,EAAE,CAAC;gBAC5E,MAAM,KAAK,GAAI,KAA6B,CAAC,KAAK,CAAC,CAAC;gBACpD,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC;oBAAE,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACnF,CAAC;YAED,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;gBAC7B,SAAS,EAAE,CAAC;gBACZ,6DAA6D;gBAC7D,6DAA6D;gBAC7D,+DAA+D;gBAC/D,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,yBAAyB,CAAC;oBAAE,SAAS;gBAC5D,IAAI,MAAM,KAAK,EAAE;oBAAE,SAAS,CAAE,qBAAqB;gBACnD,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;oBACrB,MAAM,CAAC,IAAI,CAAC;wBACV,QAAQ,EAAE,OAAO;wBACjB,IAAI,EAAE,eAAe;wBACrB,MAAM,EAAE,EAAE;wBACV,OAAO,EAAE,IAAI,GAAG,OAAO,MAAM,yBAAyB;qBACvD,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO;QACL,EAAE,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,OAAO,CAAC,CAAC,MAAM,KAAK,CAAC;QAC7D,MAAM;QACN,SAAS,EAAE,KAAK,CAAC,MAAM;QACvB,SAAS;KACV,CAAC;AACJ,CAAC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@solidnumber/cli",
-  "version": "1.16.2",
+  "version": "1.19.5",
   "description": "AI business infrastructure from the terminal — CRM, payments, voice AI, 116 agents, 52 industry templates. solid clone plumber → instant business. Also: programmatic TS SDK via @solidnumber/cli/sdk.",
   "main": "dist/index.js",
   "bin": {
@@ -32,8 +32,9 @@
     "test:security": "jest --testPathPattern=company-isolation --forceExit",
     "verify:schemas": "ts-node scripts/verify-schemas.ts",
     "audit": "npm audit --audit-level=high",
+    "audit:prod": "npm audit --omit=dev --audit-level=high",
     "prepublish:check": "bash scripts/prepublish.sh",
-    "prepublishOnly": "npm run build && npm test && npm run test:security"
+    "prepublishOnly": "npm run build && npm test && npm run test:security && npm run audit:prod"
   },
   "keywords": [
     "cli",