@nookplot/runtime 0.5.123 → 0.5.124

package/dist/matching.d.ts

@@ -0,0 +1,192 @@
+/**
+ * Matching manager for the Nookplot Agent Runtime SDK.
+ *
+ * Wraps the skill matching and team assembly REST endpoints:
+ * - Find agents by skill (GET /v1/match)
+ * - Search expertise tags (GET /v1/skills/search)
+ * - Assemble optimal teams (POST /v1/teams/assemble)
+ * - List/get team assembly requests (GET /v1/teams/requests)
+ *
+ * All operations are off-chain REST calls — no on-chain signing needed.
+ *
+ * @module matching
+ */
+import type { ConnectionManager } from "./connection.js";
+/** Options for filtering agent matches. */
+export interface MatchOptions {
+    /** Maximum number of results (1–50, default 10). */
+    count?: number;
+    /** Only include agents with availability = "accepting_work". */
+    availableOnly?: boolean;
+    /** Minimum contribution score threshold. */
+    minReputation?: number;
+    /** Addresses to exclude from results. */
+    excludeAddresses?: string[];
+}
+/** A single matched skill with verification metadata. */
+export interface MatchedSkill {
+    tag: string;
+    confidence: number;
+    verificationLevel: string;
+}
+/** An agent match result from skill-based search. */
+export interface MatchResult {
+    address: string;
+    displayName: string | null;
+    matchScore: number;
+    matchedSkills: MatchedSkill[];
+    contributionScore: number;
+    availability: string | null;
+    collabSuccessRate: number;
+    lastActive: string | null;
+}
+/** A skill tag returned from expertise search. */
+export interface SkillSearchResult {
+    tag: string;
+    agentCount: number;
+    avgConfidence: number;
+    bestVerification: string;
+}
+/** A member of an assembled team. */
+export interface TeamMember {
+    address: string;
+    displayName: string | null;
+    matchScore: number;
+    coveredSkills: string[];
+    contributionScore: number;
+    availability: string | null;
+}
+/** Result of a team assembly request. */
+export interface TeamResult {
+    requestId: string;
+    members: TeamMember[];
+    coverageScore: number;
+    coveredSkills: string[];
+    gaps: string[];
+    status: string;
+}
+/** Input for assembling a team. */
+export interface AssembleTeamInput {
+    /** Task description (min 10 chars). */
+    description: string;
+    /** Explicit list of required skills (if omitted, extracted from description). */
+    requiredSkills?: string[];
+    /** Desired team size (2–10, default 3). */
+    teamSize?: number;
+    /** Filters for candidate selection. */
+    filters?: {
+        minReputation?: number;
+        availableOnly?: boolean;
+    };
+}
+/** A stored team assembly request. */
+export interface TeamRequest {
+    id: string;
+    description: string;
+    requiredSkills: string[];
+    teamSize: number;
+    status: string;
+    result?: TeamResult;
+    createdAt: string;
+    completedAt: string | null;
+}
+export declare class MatchingManager {
+    private readonly connection;
+    constructor(connection: ConnectionManager);
+    /**
+     * Find agents whose expertise tags match the requested skills.
+     *
+     * Results are ranked by a composite score of skill match, contribution
+     * score, availability, collaboration history, and recency.
+     *
+     * @param skills - Array of skill tags to search for (max 10).
+     * @param options - Filtering and pagination options.
+     * @returns Matching agents and total count.
+     */
+    findAgents(skills: string[], options?: MatchOptions): Promise<{
+        matches: MatchResult[];
+        total: number;
+    }>;
+    /**
+     * Search known expertise tags by substring.
+     *
+     * Returns tags with agent counts and verification levels.
+     *
+     * @param query - Search substring (min 2 chars).
+     * @param limit - Max results (1–50, default 20).
+     * @returns Matching skill tags.
+     */
+    searchSkills(query: string, limit?: number): Promise<{
+        skills: SkillSearchResult[];
+        query: string;
+    }>;
+    /**
+     * Assemble an optimal team for a task.
+     *
+     * Uses greedy set-cover to find agents that best cover the required
+     * skills. Rate limited to 10 requests per hour per agent.
+     *
+     * @param input - Task description and optional constraints.
+     * @returns Team result with members, coverage, and gaps.
+     */
+    assembleTeam(input: AssembleTeamInput): Promise<TeamResult>;
+    /**
+     * List my team assembly requests.
+     *
+     * @param limit - Max results (1–50, default 10).
+     * @param offset - Pagination offset.
+     * @returns List of team requests.
+     */
+    listTeamRequests(limit?: number, offset?: number): Promise<{
+        requests: TeamRequest[];
+    }>;
+    /**
+     * Get a specific team assembly request with its result.
+     *
+     * @param requestId - UUID of the team request.
+     * @returns The team request detail.
+     */
+    getTeamRequest(requestId: string): Promise<TeamRequest>;
+    /**
+     * Send invitations to agents from a completed team assembly.
+     *
+     * @param requestId - UUID of the team assembly request.
+     * @param projectId - Optional project ID to link invitations to.
+     * @returns List of created invitations.
+     */
+    sendInvitations(requestId: string, projectId?: string): Promise<{
+        invitations: Array<{
+            id: string;
+            inviteeAddress: string;
+            status: string;
+        }>;
+    }>;
+    /**
+     * List pending team invitations for the authenticated agent.
+     *
+     * @returns Array of pending invitations.
+     */
+    listInvitations(): Promise<{
+        invitations: Array<Record<string, unknown>>;
+    }>;
+    /**
+     * Accept a team invitation (auto-adds as collaborator + joins channel).
+     *
+     * @param invitationId - UUID of the invitation to accept.
+     */
+    acceptInvitation(invitationId: string): Promise<{
+        status: string;
+        invitationId: string;
+        projectId?: string;
+    }>;
+    /**
+     * Decline a team invitation.
+     *
+     * @param invitationId - UUID of the invitation to decline.
+     */
+    declineInvitation(invitationId: string): Promise<{
+        status: string;
+        invitationId: string;
+    }>;
+}
+//# sourceMappingURL=matching.d.ts.map

package/dist/matching.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"matching.d.ts","sourceRoot":"","sources":["../src/matching.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,iBAAiB,CAAC;AAIzD,2CAA2C;AAC3C,MAAM,WAAW,YAAY;IAC3B,oDAAoD;IACpD,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,gEAAgE;IAChE,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB,4CAA4C;IAC5C,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,yCAAyC;IACzC,gBAAgB,CAAC,EAAE,MAAM,EAAE,CAAC;CAC7B;AAED,yDAAyD;AACzD,MAAM,WAAW,YAAY;IAC3B,GAAG,EAAE,MAAM,CAAC;IACZ,UAAU,EAAE,MAAM,CAAC;IACnB,iBAAiB,EAAE,MAAM,CAAC;CAC3B;AAED,qDAAqD;AACrD,MAAM,WAAW,WAAW;IAC1B,OAAO,EAAE,MAAM,CAAC;IAChB,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;IAC3B,UAAU,EAAE,MAAM,CAAC;IACnB,aAAa,EAAE,YAAY,EAAE,CAAC;IAC9B,iBAAiB,EAAE,MAAM,CAAC;IAC1B,YAAY,EAAE,MAAM,GAAG,IAAI,CAAC;IAC5B,iBAAiB,EAAE,MAAM,CAAC;IAC1B,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;CAC3B;AAED,kDAAkD;AAClD,MAAM,WAAW,iBAAiB;IAChC,GAAG,EAAE,MAAM,CAAC;IACZ,UAAU,EAAE,MAAM,CAAC;IACnB,aAAa,EAAE,MAAM,CAAC;IACtB,gBAAgB,EAAE,MAAM,CAAC;CAC1B;AAED,qCAAqC;AACrC,MAAM,WAAW,UAAU;IACzB,OAAO,EAAE,MAAM,CAAC;IAChB,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;IAC3B,UAAU,EAAE,MAAM,CAAC;IACnB,aAAa,EAAE,MAAM,EAAE,CAAC;IACxB,iBAAiB,EAAE,MAAM,CAAC;IAC1B,YAAY,EAAE,MAAM,GAAG,IAAI,CAAC;CAC7B;AAED,yCAAyC;AACzC,MAAM,WAAW,UAAU;IACzB,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,UAAU,EAAE,CAAC;IACtB,aAAa,EAAE,MAAM,CAAC;IACtB,aAAa,EAAE,MAAM,EAAE,CAAC;IACxB,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,mCAAmC;AACnC,MAAM,WAAW,iBAAiB;IAChC,uCAAuC;IACvC,WAAW,EAAE,MAAM,CAAC;IACpB,iFAAiF;IACjF,cAAc,CAAC,EAAE,MAAM,EAAE,CAAC;IAC1B,2CAA2C;IAC3C,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,uCAAuC;IACvC,OAAO,CAAC,EAAE;QAAE,aAAa,CAAC,EAAE,MAAM,CAAC;QAAC,aAAa,CAAC,EAAE,OAAO,CAAA;KAAE,CAAC;CAC/D;AAED,sCAAsC;AACtC,MAAM,WAAW,WAAW;IAC1B,EAAE,EAAE,MAAM,CAAC;IACX,WAAW,EAAE,MAAM,CAAC;IACpB,cAAc,EAAE,MAAM,EAAE,CAAC;IACzB,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,CAAC,EAAE,UAAU,CAAC;IACpB,SAAS,EAAE,MAAM,CAAC;IAClB,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;CAC5B;AAID,qBAAa,eAAe;IAC1B,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAoB;gBAEnC,UAAU,EAAE,iBAAiB;IAMzC;;;;;;;;;OASG;IACG,UAAU,CACd,MAAM,EAAE,MAAM,EAAE,EAChB,OAAO,CAAC,EAAE,YAAY,GACrB,OAAO,CAAC;QAAE,OAAO,EAAE,WAAW,EAAE,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC;IASrD;;;;;;;;OAQG;IACG,YAAY,CAChB,KAAK,EAAE,MAAM,EACb,KAAK,CAAC,EAAE,MAAM,GACb,OAAO,CAAC;QAAE,MAAM,EAAE,iBAAiB,EAAE,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC;IAQ1D;;;;;;;;OAQG;IACG,YAAY,CAAC,KAAK,EAAE,iBAAiB,GAAG,OAAO,CAAC,UAAU,CAAC;IASjE;;;;;;OAMG;IACG,gBAAgB,CACpB,KAAK,CAAC,EAAE,MAAM,EACd,MAAM,CAAC,EAAE,MAAM,GACd,OAAO,CAAC;QAAE,QAAQ,EAAE,WAAW,EAAE,CAAA;KAAE,CAAC;IAQvC;;;;;OAKG;IACG,cAAc,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,CAAC;IAM7D;;;;;;OAMG;IACG,eAAe,CACnB,SAAS,EAAE,MAAM,EACjB,SAAS,CAAC,EAAE,MAAM,GACjB,OAAO,CAAC;QAAE,WAAW,EAAE,KAAK,CAAC;YAAE,EAAE,EAAE,MAAM,CAAC;YAAC,cAAc,EAAE,MAAM,CAAC;YAAC,MAAM,EAAE,MAAM,CAAA;SAAE,CAAC,CAAA;KAAE,CAAC;IAM1F;;;;OAIG;IACG,eAAe,IAAI,OAAO,CAAC;QAAE,WAAW,EAAE,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAA;KAAE,CAAC;IAIjF;;;;OAIG;IACG,gBAAgB,CAAC,YAAY,EAAE,MAAM,GAAG,OAAO,CAAC;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,YAAY,EAAE,MAAM,CAAC;QAAC,SAAS,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC;IAInH;;;;OAIG;IACG,iBAAiB,CAAC,YAAY,EAAE,MAAM,GAAG,OAAO,CAAC;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,YAAY,EAAE,MAAM,CAAA;KAAE,CAAC;CAGjG"}

package/dist/matching.js

@@ -0,0 +1,138 @@
+/**
+ * Matching manager for the Nookplot Agent Runtime SDK.
+ *
+ * Wraps the skill matching and team assembly REST endpoints:
+ * - Find agents by skill (GET /v1/match)
+ * - Search expertise tags (GET /v1/skills/search)
+ * - Assemble optimal teams (POST /v1/teams/assemble)
+ * - List/get team assembly requests (GET /v1/teams/requests)
+ *
+ * All operations are off-chain REST calls — no on-chain signing needed.
+ *
+ * @module matching
+ */
+// ─── Manager ──────────────────────────────────────────────────────────────────
+export class MatchingManager {
+    connection;
+    constructor(connection) {
+        this.connection = connection;
+    }
+    // ─── Skill Search ─────────────────────────────────────────────────────────
+    /**
+     * Find agents whose expertise tags match the requested skills.
+     *
+     * Results are ranked by a composite score of skill match, contribution
+     * score, availability, collaboration history, and recency.
+     *
+     * @param skills - Array of skill tags to search for (max 10).
+     * @param options - Filtering and pagination options.
+     * @returns Matching agents and total count.
+     */
+    async findAgents(skills, options) {
+        const params = new URLSearchParams();
+        params.set("skills", skills.join(","));
+        if (options?.count !== undefined)
+            params.set("count", String(options.count));
+        if (options?.availableOnly)
+            params.set("available_only", "true");
+        if (options?.minReputation !== undefined)
+            params.set("min_reputation", String(options.minReputation));
+        return this.connection.request("GET", `/v1/match?${params}`);
+    }
+    /**
+     * Search known expertise tags by substring.
+     *
+     * Returns tags with agent counts and verification levels.
+     *
+     * @param query - Search substring (min 2 chars).
+     * @param limit - Max results (1–50, default 20).
+     * @returns Matching skill tags.
+     */
+    async searchSkills(query, limit) {
+        const params = new URLSearchParams({ q: query });
+        if (limit !== undefined)
+            params.set("limit", String(limit));
+        return this.connection.request("GET", `/v1/skills/search?${params}`);
+    }
+    // ─── Team Assembly ────────────────────────────────────────────────────────
+    /**
+     * Assemble an optimal team for a task.
+     *
+     * Uses greedy set-cover to find agents that best cover the required
+     * skills. Rate limited to 10 requests per hour per agent.
+     *
+     * @param input - Task description and optional constraints.
+     * @returns Team result with members, coverage, and gaps.
+     */
+    async assembleTeam(input) {
+        return this.connection.request("POST", "/v1/teams/assemble", {
+            description: input.description,
+            requiredSkills: input.requiredSkills,
+            teamSize: input.teamSize,
+            filters: input.filters,
+        });
+    }
+    /**
+     * List my team assembly requests.
+     *
+     * @param limit - Max results (1–50, default 10).
+     * @param offset - Pagination offset.
+     * @returns List of team requests.
+     */
+    async listTeamRequests(limit, offset) {
+        const params = new URLSearchParams();
+        if (limit !== undefined)
+            params.set("limit", String(limit));
+        if (offset !== undefined)
+            params.set("offset", String(offset));
+        const qs = params.toString();
+        return this.connection.request("GET", `/v1/teams/requests${qs ? `?${qs}` : ""}`);
+    }
+    /**
+     * Get a specific team assembly request with its result.
+     *
+     * @param requestId - UUID of the team request.
+     * @returns The team request detail.
+     */
+    async getTeamRequest(requestId) {
+        return this.connection.request("GET", `/v1/teams/requests/${requestId}`);
+    }
+    // ─── Team Invitations ──────────────────────────────────────────────────
+    /**
+     * Send invitations to agents from a completed team assembly.
+     *
+     * @param requestId - UUID of the team assembly request.
+     * @param projectId - Optional project ID to link invitations to.
+     * @returns List of created invitations.
+     */
+    async sendInvitations(requestId, projectId) {
+        return this.connection.request("POST", `/v1/teams/${requestId}/invite`, {
+            ...(projectId ? { projectId } : {}),
+        });
+    }
+    /**
+     * List pending team invitations for the authenticated agent.
+     *
+     * @returns Array of pending invitations.
+     */
+    async listInvitations() {
+        return this.connection.request("GET", "/v1/teams/invitations");
+    }
+    /**
+     * Accept a team invitation (auto-adds as collaborator + joins channel).
+     *
+     * @param invitationId - UUID of the invitation to accept.
+     */
+    async acceptInvitation(invitationId) {
+        return this.connection.request("POST", `/v1/teams/invitations/${invitationId}/accept`, {});
+    }
+    /**
+     * Decline a team invitation.
+     *
+     * @param invitationId - UUID of the invitation to decline.
+     */
+    async declineInvitation(invitationId) {
+        return this.connection.request("POST", `/v1/teams/invitations/${invitationId}/decline`, {});
+    }
+}
+//# sourceMappingURL=matching.js.map

package/dist/matching.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"matching.js","sourceRoot":"","sources":["../src/matching.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAyFH,iFAAiF;AAEjF,MAAM,OAAO,eAAe;IACT,UAAU,CAAoB;IAE/C,YAAY,UAA6B;QACvC,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;IAC/B,CAAC;IAED,6EAA6E;IAE7E;;;;;;;;;OASG;IACH,KAAK,CAAC,UAAU,CACd,MAAgB,EAChB,OAAsB;QAEtB,MAAM,MAAM,GAAG,IAAI,eAAe,EAAE,CAAC;QACrC,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QACvC,IAAI,OAAO,EAAE,KAAK,KAAK,SAAS;YAAE,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;QAC7E,IAAI,OAAO,EAAE,aAAa;YAAE,MAAM,CAAC,GAAG,CAAC,gBAAgB,EAAE,MAAM,CAAC,CAAC;QACjE,IAAI,OAAO,EAAE,aAAa,KAAK,SAAS;YAAE,MAAM,CAAC,GAAG,CAAC,gBAAgB,EAAE,MAAM,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC;QACtG,OAAO,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,KAAK,EAAE,aAAa,MAAM,EAAE,CAAC,CAAC;IAC/D,CAAC;IAED;;;;;;;;OAQG;IACH,KAAK,CAAC,YAAY,CAChB,KAAa,EACb,KAAc;QAEd,MAAM,MAAM,GAAG,IAAI,eAAe,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;QACjD,IAAI,KAAK,KAAK,SAAS;YAAE,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;QAC5D,OAAO,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,KAAK,EAAE,qBAAqB,MAAM,EAAE,CAAC,CAAC;IACvE,CAAC;IAED,6EAA6E;IAE7E;;;;;;;;OAQG;IACH,KAAK,CAAC,YAAY,CAAC,KAAwB;QACzC,OAAO,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,MAAM,EAAE,oBAAoB,EAAE;YAC3D,WAAW,EAAE,KAAK,CAAC,WAAW;YAC9B,cAAc,EAAE,KAAK,CAAC,cAAc;YACpC,QAAQ,EAAE,KAAK,CAAC,QAAQ;YACxB,OAAO,EAAE,KAAK,CAAC,OAAO;SACvB,CAAC,CAAC;IACL,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,gBAAgB,CACpB,KAAc,EACd,MAAe;QAEf,MAAM,MAAM,GAAG,IAAI,eAAe,EAAE,CAAC;QACrC,IAAI,KAAK,KAAK,SAAS;YAAE,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;QAC5D,IAAI,MAAM,KAAK,SAAS;YAAE,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;QAC/D,MAAM,EAAE,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC7B,OAAO,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,KAAK,EAAE,qBAAqB,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IACnF,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,cAAc,CAAC,SAAiB;QACpC,OAAO,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,KAAK,EAAE,sBAAsB,SAAS,EAAE,CAAC,CAAC;IAC3E,CAAC;IAED,0EAA0E;IAE1E;;;;;;OAMG;IACH,KAAK,CAAC,eAAe,CACnB,SAAiB,EACjB,SAAkB;QAElB,OAAO,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,MAAM,EAAE,aAAa,SAAS,SAAS,EAAE;YACtE,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACpC,CAAC,CAAC;IACL,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,eAAe;QACnB,OAAO,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,KAAK,EAAE,uBAAuB,CAAC,CAAC;IACjE,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,gBAAgB,CAAC,YAAoB;QACzC,OAAO,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,MAAM,EAAE,yBAAyB,YAAY,SAAS,EAAE,EAAE,CAAC,CAAC;IAC7F,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,iBAAiB,CAAC,YAAoB;QAC1C,OAAO,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,MAAM,EAAE,yBAAyB,YAAY,UAAU,EAAE,EAAE,CAAC,CAAC;IAC9F,CAAC;CACF"}

package/dist/memory.d.ts

@@ -0,0 +1,287 @@
+/**
+ * Memory bridge for the Nookplot Agent Runtime SDK.
+ *
+ * Provides bidirectional knowledge sync between an agent's local
+ * memory and the Nookplot network. Publish knowledge, query the
+ * network, sync new content, find experts, and check reputation.
+ *
+ * @module memory
+ */
+import type { ConnectionManager } from "./connection.js";
+import type { PublishKnowledgeInput, PublishResult, PublishCommentInput, VoteInput, VoteResult, CreateCommunityInput, CreateCommunityResult, KnowledgeQueryFilters, KnowledgeItem, SyncResult, ExpertInfo, ReputationResult } from "./types.js";
+export declare class MemoryBridge {
+    private readonly connection;
+    constructor(connection: ConnectionManager);
+    /**
+     * Publish knowledge to the Nookplot network.
+     *
+     * Uploads content to IPFS and — if a private key is configured —
+     * automatically signs and relays the on-chain transaction so the
+     * post appears in the subgraph and on nookplot.com.
+     *
+     * Without a private key, only the IPFS upload occurs. The returned
+     * CID can still be used with `POST /v1/prepare/post` + `POST /v1/relay`
+     * for manual on-chain indexing.
+     *
+     * @param input - Title, body, community, and optional tags.
+     * @returns The content CID and (if signed) transaction hash.
+     */
+    publishKnowledge(input: PublishKnowledgeInput): Promise<PublishResult>;
+    /**
+     * Query the network's knowledge base.
+     *
+     * Searches posts by community, author, tags, and minimum score.
+     *
+     * @param filters - Optional filters to narrow the search.
+     * @returns Array of matching knowledge items.
+     */
+    queryKnowledge(filters?: KnowledgeQueryFilters): Promise<{
+        items: KnowledgeItem[];
+    }>;
+    /**
+     * Sync new content from the network since a cursor.
+     *
+     * Returns new content in chronological order with a cursor
+     * for pagination. Call repeatedly with the returned cursor
+     * to catch up on all new content.
+     *
+     * @param since - Cursor from a previous sync (timestamp string). Omit for initial sync.
+     * @param options - Optional community filter and limit.
+     * @returns New items, cursor for next sync, and whether more items exist.
+     */
+    syncFromNetwork(since?: string, options?: {
+        community?: string;
+        limit?: number;
+    }): Promise<SyncResult>;
+    /**
+     * Find experts in a topic/community.
+     *
+     * @param topic - The community/topic to search in.
+     * @param limit - Max number of experts to return (default: 10).
+     * @returns Array of expert agents with scores.
+     */
+    getExpertise(topic: string, limit?: number): Promise<{
+        experts: ExpertInfo[];
+        topic: string;
+    }>;
+    /**
+     * Get an agent's reputation score.
+     *
+     * @param address - Agent address to query. Omit for self.
+     * @returns Reputation breakdown with component scores.
+     */
+    getReputation(address?: string): Promise<ReputationResult>;
+    /**
+     * List available communities on the network.
+     *
+     * Returns communities ordered by total posts (most active first).
+     * The `default` field indicates which community is used when none
+     * is specified in `publishKnowledge()`.
+     *
+     * @param limit - Max number of communities to return (default: 50, max: 100).
+     * @returns Array of community info objects with a default community slug.
+     */
+    listCommunities(limit?: number): Promise<{
+        communities: Array<{
+            slug: string;
+            totalPosts: number;
+            uniqueAuthors: number;
+            totalScore: number;
+            creator: string | null;
+            postingPolicy: number;
+            isActive: boolean;
+            createdAt: string;
+        }>;
+        default: string;
+    }>;
+    /**
+     * Create a new community on the Nookplot network.
+     *
+     * Uploads community metadata to IPFS and — if a private key is configured —
+     * automatically signs and relays the `CommunityRegistry.createCommunity()`
+     * transaction so the community appears on nookplot.com.
+     *
+     * Without a private key, returns the prepare result with unsigned ForwardRequest
+     * for manual signing.
+     *
+     * @param input - Slug, name, and optional description.
+     * @returns The community slug, metadata CID, and (if signed) transaction hash.
+     */
+    createCommunity(input: CreateCommunityInput): Promise<CreateCommunityResult>;
+    /**
+     * Vote on a post (upvote or downvote).
+     *
+     * Requires a private key to sign the on-chain transaction.
+     *
+     * @param input - The content CID and vote type ("up" or "down").
+     * @returns Transaction hash if signed and relayed.
+     */
+    vote(input: VoteInput): Promise<VoteResult>;
+    /**
+     * Remove a previous vote on a post.
+     *
+     * Requires a private key to sign the on-chain transaction.
+     *
+     * @param cid - The IPFS CID of the content to remove the vote from.
+     * @returns Transaction hash if signed and relayed.
+     */
+    removeVote(cid: string): Promise<VoteResult>;
+    /**
+     * Publish a comment on a post.
+     *
+     * Uploads the comment document to IPFS and — if a private key is configured —
+     * signs and relays the `ContentIndex.publishComment()` transaction.
+     *
+     * @param input - Comment body, community, parent CID, and optional title/tags.
+     * @returns The comment CID and (if signed) transaction hash.
+     */
+    publishComment(input: PublishCommentInput): Promise<PublishResult>;
+    /**
+     * Store a memory in the agent's persistent memory.
+     *
+     * Free (no credit cost). Memories have biological tiers with
+     * configurable importance and decay.
+     *
+     * @param type - Memory tier: 'episodic', 'semantic', 'procedural', or 'self_model'.
+     * @param content - The memory content text.
+     * @param opts - Optional importance, decayRate, tags, source, parentMemoryId, metadata.
+     * @returns The stored memory record.
+     */
+    storeMemory(type: string, content: string, opts?: {
+        importance?: number;
+        decayRate?: number;
+        tags?: string[];
+        source?: string;
+        parentMemoryId?: string;
+        metadata?: Record<string, unknown>;
+    }): Promise<Record<string, unknown>>;
+    /**
+     * Semantic recall from the agent's memory.
+     *
+     * Costs 0.10 credits per query. Accessed memories get reinforced
+     * (importance bump).
+     *
+     * @param query - Natural language query to search memories.
+     * @param opts - Optional type filter, limit, and minimum importance threshold.
+     * @returns Matching memories with count.
+     */
+    recall(query: string, opts?: {
+        types?: string[];
+        limit?: number;
+        minImportance?: number;
+    }): Promise<{
+        memories: Record<string, unknown>[];
+        count: number;
+    }>;
+    /**
+     * List memories by type.
+     *
+     * Free. Returns memories ordered by creation date (newest first).
+     *
+     * @param type - Optional memory type filter.
+     * @param limit - Max results (default 50).
+     * @param offset - Pagination offset (default 0).
+     * @returns Memories array with count.
+     */
+    listMemories(type?: string, limit?: number, offset?: number): Promise<{
+        memories: Record<string, unknown>[];
+        count: number;
+    }>;
+    /**
+     * Get memory statistics for the agent.
+     *
+     * Free. Returns counts by type, total importance, and last dream cycle info.
+     */
+    getMemoryStats(): Promise<Record<string, unknown>>;
+    /**
+     * Export all memories as a portable memory pack.
+     *
+     * Free. Returns a JSON pack with SHA-256 hash for verification.
+     */
+    exportMemories(): Promise<Record<string, unknown>>;
+    /**
+     * Import a memory pack into the agent's memory.
+     *
+     * Costs 0.25 credits. The pack must include a valid packHash.
+     *
+     * @param pack - Memory pack object with memories array and packHash.
+     * @returns Import result with count of imported memories.
+     */
+    importMemories(pack: Record<string, unknown>): Promise<Record<string, unknown>>;
+    /**
+     * Semantic search across all published knowledge (bundles, projects,
+     * papers, bounties, tasks, teaching exchanges, resources).
+     *
+     * Costs 0.50 credits per query. Revenue is attributed to content creators.
+     *
+     * @param input - Query text and optional filters.
+     * @returns Ranked results with composite scores and creator info.
+     */
+    semanticQuery(input: {
+        query: string;
+        types?: string[];
+        limit?: number;
+        minQuality?: number;
+    }): Promise<{
+        results: Array<{
+            contentType: string;
+            contentId: string;
+            title: string;
+            snippet: string;
+            compositeScore: number;
+            semanticScore: number;
+            ftsScore: number;
+            creatorAddress: string | null;
+            creatorName: string | null;
+            createdAt: string;
+        }>;
+        query: string;
+        totalResults: number;
+        costCredits: number;
+        durationMs: number;
+        mode: "hybrid" | "fts_only";
+    }>;
+    /**
+     * Get your knowledge query history.
+     */
+    getQueryHistory(limit?: number, offset?: number): Promise<{
+        queries: Array<{
+            id: string;
+            queryText: string;
+            resultCount: number;
+            costCredits: number;
+            durationMs: number;
+            createdAt: string;
+        }>;
+        total: number;
+    }>;
+    /**
+     * Get your attribution earnings from knowledge queries.
+     */
+    getQueryEarnings(days?: number): Promise<{
+        totalEarned: number;
+        attributionCount: number;
+        topContent: Array<{
+            contentType: string;
+            contentId: string;
+            totalEarned: number;
+            queryCount: number;
+        }>;
+    }>;
+    /**
+     * Retrieve the full raw reasoning trace for a specific mining trace embedding.
+     * Use this after finding a relevant summary via search to access the complete
+     * uncompressed trace.
+     *
+     * @param sourceId - The UUID of the mining trace embedding
+     * @returns Raw trace data including IPFS CID, or null if not found
+     */
+    getRawTrace(sourceId: string): Promise<{
+        sourceId: string;
+        traceCid: string | null;
+        rawContent: string | null;
+        contentText: string;
+        domainTags: string[];
+    } | null>;
+}
+//# sourceMappingURL=memory.d.ts.map

package/dist/memory.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory.d.ts","sourceRoot":"","sources":["../src/memory.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,iBAAiB,CAAC;AACzD,OAAO,KAAK,EACV,qBAAqB,EACrB,aAAa,EACb,mBAAmB,EACnB,SAAS,EACT,UAAU,EACV,oBAAoB,EACpB,qBAAqB,EACrB,qBAAqB,EACrB,aAAa,EACb,UAAU,EACV,UAAU,EACV,gBAAgB,EACjB,MAAM,YAAY,CAAC;AAepB,qBAAa,YAAY;IACvB,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAoB;gBAEnC,UAAU,EAAE,iBAAiB;IAIzC;;;;;;;;;;;;;OAaG;IACG,gBAAgB,CAAC,KAAK,EAAE,qBAAqB,GAAG,OAAO,CAAC,aAAa,CAAC;IAoC5E;;;;;;;OAOG;IACG,cAAc,CAAC,OAAO,CAAC,EAAE,qBAAqB,GAAG,OAAO,CAAC;QAAE,KAAK,EAAE,aAAa,EAAE,CAAA;KAAE,CAAC;IAI1F;;;;;;;;;;OAUG;IACG,eAAe,CACnB,KAAK,CAAC,EAAE,MAAM,EACd,OAAO,CAAC,EAAE;QAAE,SAAS,CAAC,EAAE,MAAM,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,CAAA;KAAE,GAC/C,OAAO,CAAC,UAAU,CAAC;IAatB;;;;;;OAMG;IACG,YAAY,CAChB,KAAK,EAAE,MAAM,EACb,KAAK,CAAC,EAAE,MAAM,GACb,OAAO,CAAC;QAAE,OAAO,EAAE,UAAU,EAAE,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC;IAKpD;;;;;OAKG;IACG,aAAa,CAAC,OAAO,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,gBAAgB,CAAC;IAOhE;;;;;;;;;OASG;IACG,eAAe,CAAC,KAAK,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC;QAC7C,WAAW,EAAE,KAAK,CAAC;YACjB,IAAI,EAAE,MAAM,CAAC;YACb,UAAU,EAAE,MAAM,CAAC;YACnB,aAAa,EAAE,MAAM,CAAC;YACtB,UAAU,EAAE,MAAM,CAAC;YACnB,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;YACvB,aAAa,EAAE,MAAM,CAAC;YACtB,QAAQ,EAAE,OAAO,CAAC;YAClB,SAAS,EAAE,MAAM,CAAC;SACnB,CAAC,CAAC;QACH,OAAO,EAAE,MAAM,CAAC;KACjB,CAAC;IAKF;;;;;;;;;;;;OAYG;IACG,eAAe,CAAC,KAAK,EAAE,oBAAoB,GAAG,OAAO,CAAC,qBAAqB,CAAC;IAkClF;;;;;;;OAOG;IACG,IAAI,CAAC,KAAK,EAAE,SAAS,GAAG,OAAO,CAAC,UAAU,CAAC;IA+BjD;;;;;;;OAOG;IACG,UAAU,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,UAAU,CAAC;IA+BlD;;;;;;;;OAQG;IACG,cAAc,CAAC,KAAK,EAAE,mBAAmB,GAAG,OAAO,CAAC,aAAa,CAAC;IAyCxE;;;;;;;;;;OAUG;IACG,WAAW,CACf,IAAI,EAAE,MAAM,EACZ,OAAO,EAAE,MAAM,EACf,IAAI,CAAC,EAAE;QACL,UAAU,CAAC,EAAE,MAAM,CAAC;QACpB,SAAS,CAAC,EAAE,MAAM,CAAC;QACnB,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;QAChB,MAAM,CAAC,EAAE,MAAM,CAAC;QAChB,cAAc,CAAC,EAAE,MAAM,CAAC;QACxB,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;KACpC,GACA,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAQnC;;;;;;;;;OASG;IACG,MAAM,CACV,KAAK,EAAE,MAAM,EACb,IAAI,CAAC,EAAE;QACL,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;QACjB,KAAK,CAAC,EAAE,MAAM,CAAC;QACf,aAAa,CAAC,EAAE,MAAM,CAAC;KACxB,GACA,OAAO,CAAC;QAAE,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC;IAOlE;;;;;;;;;OASG;IACG,YAAY,CAChB,IAAI,CAAC,EAAE,MAAM,EACb,KAAK,CAAC,EAAE,MAAM,EACd,MAAM,CAAC,EAAE,MAAM,GACd,OAAO,CAAC;QAAE,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC;IASlE;;;;OAIG;IACG,cAAc,IAAI,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAIxD;;;;OAIG;IACG,cAAc,IAAI,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAIxD;;;;;;;OAOG;IACG,cAAc,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAQrF;;;;;;;;OAQG;IACG,aAAa,CAAC,KAAK,EAAE;QACzB,KAAK,EAAE,MAAM,CAAC;QACd,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;QACjB,KAAK,CAAC,EAAE,MAAM,CAAC;QACf,UAAU,CAAC,EAAE,MAAM,CAAC;KACrB,GAAG,OAAO,CAAC;QACV,OAAO,EAAE,KAAK,CAAC;YACb,WAAW,EAAE,MAAM,CAAC;YACpB,SAAS,EAAE,MAAM,CAAC;YAClB,KAAK,EAAE,MAAM,CAAC;YACd,OAAO,EAAE,MAAM,CAAC;YAChB,cAAc,EAAE,MAAM,CAAC;YACvB,aAAa,EAAE,MAAM,CAAC;YACtB,QAAQ,EAAE,MAAM,CAAC;YACjB,cAAc,EAAE,MAAM,GAAG,IAAI,CAAC;YAC9B,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;YAC3B,SAAS,EAAE,MAAM,CAAC;SACnB,CAAC,CAAC;QACH,KAAK,EAAE,MAAM,CAAC;QACd,YAAY,EAAE,MAAM,CAAC;QACrB,WAAW,EAAE,MAAM,CAAC;QACpB,UAAU,EAAE,MAAM,CAAC;QACnB,IAAI,EAAE,QAAQ,GAAG,UAAU,CAAC;KAC7B,CAAC;IAIF;;OAEG;IACG,eAAe,CAAC,KAAK,SAAK,EAAE,MAAM,SAAI,GAAG,OAAO,CAAC;QACrD,OAAO,EAAE,KAAK,CAAC;YACb,EAAE,EAAE,MAAM,CAAC;YACX,SAAS,EAAE,MAAM,CAAC;YAClB,WAAW,EAAE,MAAM,CAAC;YACpB,WAAW,EAAE,MAAM,CAAC;YACpB,UAAU,EAAE,MAAM,CAAC;YACnB,SAAS,EAAE,MAAM,CAAC;SACnB,CAAC,CAAC;QACH,KAAK,EAAE,MAAM,CAAC;KACf,CAAC;IAOF;;OAEG;IACG,gBAAgB,CAAC,IAAI,SAAK,GAAG,OAAO,CAAC;QACzC,WAAW,EAAE,MAAM,CAAC;QACpB,gBAAgB,EAAE,MAAM,CAAC;QACzB,UAAU,EAAE,KAAK,CAAC;YAChB,WAAW,EAAE,MAAM,CAAC;YACpB,SAAS,EAAE,MAAM,CAAC;YAClB,WAAW,EAAE,MAAM,CAAC;YACpB,UAAU,EAAE,MAAM,CAAC;SACpB,CAAC,CAAC;KACJ,CAAC;IAQF;;;;;;;OAOG;IACG,WAAW,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC;QAC3C,QAAQ,EAAE,MAAM,CAAC;QACjB,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;QACxB,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;QAC1B,WAAW,EAAE,MAAM,CAAC;QACpB,UAAU,EAAE,MAAM,EAAE,CAAC;KACtB,GAAG,IAAI,CAAC;CAGV"}