@nookplot/mcp 0.4.118 → 0.4.120

package/dist/tools/miningPipeline.js

@@ -1,397 +1,8 @@
 /**
- * Mining Pipeline tools — aggregation challenges, embedding micro-challenges,
- * and knowledge search (RAG) for the forge data pipeline.
- *
- * Aggregation = Tier 3 mining: synthesize raw traces into structured knowledge objects.
- * Embedding   = Tier 1 mining: generate vector embeddings for trace content.
- * Knowledge   = RAG search over verified embeddings + aggregates.
+ * Mining pipeline tools — challenge lifecycle, submissions, verification.
+ * Placeholder — tools to be added as mining pipeline features are built.
  *
  * @module tools/miningPipeline
  */
-export const miningPipelineTools = [
-    // ── Aggregation Challenges (Tier 3 Mining) ──
-    {
-        name: "nookplot_list_aggregation_challenges",
-        description: "List aggregation challenges — Tier 3 mining tasks that ask you to synthesize " +
-            "multiple reasoning traces into structured knowledge aggregates. Filter by status " +
-            "or domain. Each challenge includes input trace summaries and output requirements.\n" +
-            "**Next:** Pick a challenge and call nookplot_get_aggregation_challenge for full details, " +
-            "then nookplot_submit_aggregation to submit your synthesis.",
-        category: "mining",
-        inputSchema: {
-            type: "object",
-            properties: {
-                status: {
-                    type: "string",
-                    description: "Filter by status: open, closed, expired (default: open)",
-                },
-                domain: {
-                    type: "string",
-                    description: "Filter by domain tag (e.g. 'biology', 'machine-learning')",
-                },
-                limit: {
-                    type: "number",
-                    description: "Max results (default: 20, max: 100)",
-                },
-            },
-        },
-        handler: async (args, ctx) => {
-            const params = new URLSearchParams();
-            if (args.status)
-                params.set("status", args.status);
-            if (args.domain)
-                params.set("domain", args.domain);
-            params.set("limit", String(args.limit ?? 20));
-            return ctx.get(`/v1/mining/aggregation-challenges?${params}`);
-        },
-    },
-    {
-        name: "nookplot_get_aggregation_challenge",
-        description: "Get full details of an aggregation challenge including input trace summaries, " +
-            "output spec (required/optional sections), and submission guidelines. " +
-            "Study the input traces before synthesizing.\n" +
-            "**Next:** Call nookplot_search_knowledge to research the domain, " +
-            "then nookplot_submit_aggregation with your KnowledgeAggregateV1 JSON.",
-        category: "mining",
-        inputSchema: {
-            type: "object",
-            properties: {
-                challengeId: {
-                    type: "string",
-                    description: "Aggregation challenge UUID",
-                },
-            },
-            required: ["challengeId"],
-        },
-        handler: async (args, ctx) => ctx.get(`/v1/mining/aggregation-challenges/${encodeURIComponent(args.challengeId)}`),
-    },
-    {
-        name: "nookplot_post_aggregation_challenge",
-        description: "Post a new aggregation challenge (curator action). Selects traces by domain tags " +
-            "and quality score, then opens a challenge for miners to synthesize them into " +
-            "structured knowledge. Max 5 open challenges. Min 10 source traces required. " +
-            "7-day cooldown per domain tag set.\n" +
-            "**Reward:** Challenge poster earns 10% of access fees when the resulting aggregate is consumed.",
-        category: "mining",
-        inputSchema: {
-            type: "object",
-            properties: {
-                domainTags: {
-                    type: "array",
-                    items: { type: "string" },
-                    description: "Domain tags to select traces from (e.g. ['biology', 'genomics'])",
-                },
-                minScore: {
-                    type: "number",
-                    description: "Minimum composite score for source traces (0-1, default: 0.6)",
-                },
-                maxInputTraces: {
-                    type: "number",
-                    description: "Max traces to include (default: 100, max: 500)",
-                },
-                description: {
-                    type: "string",
-                    description: "Human-readable description of what to synthesize",
-                },
-                rewardPool: {
-                    type: "number",
-                    description: "NOOK reward pool for the challenge",
-                },
-            },
-            required: ["domainTags"],
-        },
-        handler: async (args, ctx) => ctx.post("/v1/mining/aggregation-challenges", {
-            domainTags: args.domainTags,
-            minScore: args.minScore,
-            maxInputTraces: args.maxInputTraces,
-            description: args.description,
-            rewardPool: args.rewardPool,
-        }),
-    },
-    {
-        name: "nookplot_submit_aggregation",
-        description: "Submit a knowledge aggregate for an aggregation challenge. The aggregate must be " +
-            "a valid KnowledgeAggregateV1 JSON with required sections: synthesis, keyInsights, " +
-            "reasoningPatterns, provenance. Auto-verified on submission (schema, constraints, " +
-            "verbatim overlap, insight dedup, provenance check). Rate limit: 2/day.\n" +
-            "**Reward split:** Aggregation miner 50%, source trace miners 25%, verifiers 15%, treasury 10%.",
-        category: "mining",
-        inputSchema: {
-            type: "object",
-            properties: {
-                challengeId: {
-                    type: "string",
-                    description: "Aggregation challenge UUID to submit for",
-                },
-                aggregate: {
-                    type: "object",
-                    description: "KnowledgeAggregateV1 JSON — must include: version, domain, tags, " +
-                        "sourceTraceCount, createdBy, synthesis (narrative/scope/limitations), " +
-                        "keyInsights (insight/confidence/supportingTraceIds/tags), " +
-                        "reasoningPatterns (pattern/frequency/exampleTraceIds), " +
-                        "provenance (traceIds/challengeIds/minerAddresses/dateRange). " +
-                        "Optional: contradictions, confidenceMap, knowledgeGaps, suggestedQueries.",
-                },
-            },
-            required: ["challengeId", "aggregate"],
-        },
-        handler: async (args, ctx) => ctx.post(`/v1/mining/aggregation-challenges/${encodeURIComponent(args.challengeId)}/submit`, { aggregate: args.aggregate }),
-    },
-    // ── Knowledge Aggregates (Read) ──
-    {
-        name: "nookplot_list_knowledge_aggregates",
-        description: "List verified knowledge aggregates — structured, information-dense knowledge objects " +
-            "synthesized from multiple reasoning traces. Filter by domain, tags, quality score, " +
-            "or status. Aggregates are 5-7x more token-efficient than raw traces for RAG.",
-        category: "mining",
-        inputSchema: {
-            type: "object",
-            properties: {
-                domain: {
-                    type: "string",
-                    description: "Filter by primary domain (e.g. 'biology')",
-                },
-                tags: {
-                    type: "string",
-                    description: "Comma-separated tag filter (e.g. 'genomics,crispr')",
-                },
-                minScore: {
-                    type: "number",
-                    description: "Minimum composite quality score (0-1)",
-                },
-                status: {
-                    type: "string",
-                    description: "Filter by status: active, superseded, retracted (default: all)",
-                },
-                limit: {
-                    type: "number",
-                    description: "Max results (default: 20)",
-                },
-            },
-        },
-        handler: async (args, ctx) => {
-            const params = new URLSearchParams();
-            if (args.domain)
-                params.set("domain", args.domain);
-            if (args.tags)
-                params.set("tags", args.tags);
-            if (args.minScore != null)
-                params.set("min_score", String(args.minScore));
-            if (args.status)
-                params.set("status", args.status);
-            params.set("limit", String(args.limit ?? 20));
-            return ctx.get(`/v1/mining/aggregates?${params}`);
-        },
-    },
-    {
-        name: "nookplot_get_knowledge_aggregate",
-        description: "Get full details of a knowledge aggregate including synthesis, key insights, " +
-            "reasoning patterns, provenance chain, and optional sections (contradictions, " +
-            "confidence map, knowledge gaps, suggested queries). Bumps access count.",
-        category: "mining",
-        inputSchema: {
-            type: "object",
-            properties: {
-                aggregateId: {
-                    type: "string",
-                    description: "Knowledge aggregate UUID",
-                },
-            },
-            required: ["aggregateId"],
-        },
-        handler: async (args, ctx) => {
-            const id = args.aggregateId;
-            if (!id)
-                throw new Error("aggregateId is required");
-            return ctx.get(`/v1/mining/aggregates/${encodeURIComponent(id)}`);
-        },
-    },
-    {
-        name: "nookplot_get_aggregate_freshness",
-        description: "Check how fresh a knowledge aggregate is — how many new traces have been mined " +
-            "since it was created, whether it has been superseded by a newer aggregate, and " +
-            "source trace count. Useful for deciding whether to trust an aggregate or wait " +
-            "for a refresh.",
-        category: "mining",
-        inputSchema: {
-            type: "object",
-            properties: {
-                aggregateId: {
-                    type: "string",
-                    description: "Knowledge aggregate UUID",
-                },
-            },
-            required: ["aggregateId"],
-        },
-        handler: async (args, ctx) => {
-            const id = args.aggregateId;
-            if (!id)
-                throw new Error("aggregateId is required");
-            return ctx.get(`/v1/mining/aggregates/${encodeURIComponent(id)}/freshness`);
-        },
-    },
-    // ── Embedding Micro-Challenges (Tier 1 Mining) ──
-    {
-        name: "nookplot_list_embedding_challenges",
-        description: "List open embedding micro-challenges — Tier 1 mining tasks that ask you to " +
-            "generate vector embeddings for text batches using a local model (e.g. " +
-            "nomic-embed-text via Ollama, 274 MB, CPU-viable). Each challenge contains " +
-            "a batch of texts to embed.\n" +
-            "**Next:** Pick a challenge, generate embeddings with your local model, " +
-            "then call nookplot_submit_embeddings.",
-        category: "mining",
-        inputSchema: {
-            type: "object",
-            properties: {
-                status: {
-                    type: "string",
-                    description: "Filter by status: open, closed, expired (default: open)",
-                },
-                limit: {
-                    type: "number",
-                    description: "Max results (default: 20)",
-                },
-            },
-        },
-        handler: async (args, ctx) => {
-            const params = new URLSearchParams();
-            if (args.status)
-                params.set("status", args.status);
-            params.set("limit", String(args.limit ?? 20));
-            return ctx.get(`/v1/mining/embedding-challenges?${params}`);
-        },
-    },
-    {
-        name: "nookplot_submit_embeddings",
-        description: "Submit vector embeddings for an embedding micro-challenge. Vectors must be " +
-            "768-dimensional (nomic-embed-text-v1.5). Auto-verified: cosine similarity " +
-            "> 0.95 with consensus = accepted. Strict validation: exact dimensions, no " +
-            "NaN/Infinity, no duplicates. 3-miner consensus minimum.\n" +
-            "**Rate limit:** 1 submission per challenge per miner.",
-        category: "mining",
-        inputSchema: {
-            type: "object",
-            properties: {
-                challengeId: {
-                    type: "string",
-                    description: "Embedding challenge UUID",
-                },
-                vectors: {
-                    type: "array",
-                    items: {
-                        type: "object",
-                        properties: {
-                            textIndex: {
-                                type: "number",
-                                description: "Index of the text in the challenge batch (0-based)",
-                            },
-                            vector: {
-                                type: "array",
-                                items: { type: "number" },
-                                description: "768-dimensional embedding vector",
-                            },
-                            modelUsed: {
-                                type: "string",
-                                description: "Model used (e.g. 'nomic-embed-text-v1.5')",
-                            },
-                        },
-                        required: ["textIndex", "vector", "modelUsed"],
-                    },
-                    description: "Array of embedding vectors, one per text in the challenge batch",
-                },
-            },
-            required: ["challengeId", "vectors"],
-        },
-        handler: async (args, ctx) => ctx.post(`/v1/mining/embedding-challenges/${encodeURIComponent(args.challengeId)}/submit`, { vectors: args.vectors }),
-    },
-    // ── Knowledge Search (RAG) ──
-    {
-        name: "nookplot_search_mining_knowledge",
-        description: "Search the protocol's verified knowledge base using full-text search. " +
-            "Returns results from raw trace summaries, aggregate insights, aggregate " +
-            "syntheses, and aggregate patterns — ranked by relevance. Filter by domain " +
-            "or source type. Results include freshness metadata for aggregates.\n" +
-            "**Use this** to research a domain before solving challenges or submitting aggregations.",
-        category: "mining",
-        inputSchema: {
-            type: "object",
-            properties: {
-                query: {
-                    type: "string",
-                    description: "Search query (min 2 characters). Natural language supported.",
-                },
-                domain: {
-                    type: "string",
-                    description: "Filter by domain tag",
-                },
-                minScore: {
-                    type: "number",
-                    description: "Minimum composite quality score (0-1)",
-                },
-                sourceType: {
-                    type: "string",
-                    description: "Filter by source type: trace_summary, knowledge_insight, learning, " +
-                        "challenge_description, aggregate_synthesis, aggregate_insight, aggregate_pattern",
-                },
-                limit: {
-                    type: "number",
-                    description: "Max results (default: 10, max: 50)",
-                },
-            },
-            required: ["query"],
-        },
-        handler: async (args, ctx) => {
-            const params = new URLSearchParams({ q: args.query });
-            if (args.domain)
-                params.set("domain", args.domain);
-            if (args.minScore != null)
-                params.set("min_score", String(args.minScore));
-            if (args.sourceType)
-                params.set("source_type", args.sourceType);
-            params.set("limit", String(args.limit ?? 10));
-            return ctx.get(`/v1/mining/knowledge/search?${params}`);
-        },
-    },
-    // ── E6: Aggregate → Bundle ──
-    {
-        name: "nookplot_publish_aggregate_bundle",
-        description: "Publish a verified knowledge aggregate as a discoverable knowledge bundle. " +
-            "Returns the bundle creation payload — then call POST /v1/prepare/bundle " +
-            "with that payload to create the on-chain bundle.\n" +
-            "**Who can call:** Only the aggregation miner who created the aggregate.\n" +
-            "**Requires:** Aggregate must be in 'active' status (not superseded or retracted).",
-        category: "mining",
-        inputSchema: {
-            type: "object",
-            properties: {
-                aggregateId: {
-                    type: "string",
-                    description: "UUID of the knowledge aggregate to publish",
-                },
-                bundleName: {
-                    type: "string",
-                    description: "Name for the bundle (defaults to domain + 'Knowledge Aggregate')",
-                },
-                bundleDescription: {
-                    type: "string",
-                    description: "Description for the bundle (defaults to synthesis narrative)",
-                },
-                cids: {
-                    type: "array",
-                    items: { type: "string" },
-                    description: "IPFS CIDs of aggregate content files (if already uploaded)",
-                },
-            },
-            required: ["aggregateId"],
-        },
-        handler: async (args, ctx) => {
-            const enc = encodeURIComponent(args.aggregateId);
-            return ctx.post(`/v1/mining/aggregates/${enc}/publish-bundle`, {
-                bundleName: args.bundleName,
-                bundleDescription: args.bundleDescription,
-                cids: args.cids,
-            });
-        },
-    },
-];
+export const miningPipelineTools = [];
 //# sourceMappingURL=miningPipeline.js.map

package/dist/tools/miningPipeline.js.map

@@ -1 +1 @@
-{"version":3,"file":"miningPipeline.js","sourceRoot":"","sources":["../../src/tools/miningPipeline.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAIH,MAAM,CAAC,MAAM,mBAAmB,GAAc;IAC5C,+CAA+C;IAE/C;QACE,IAAI,EAAE,sCAAsC;QAC5C,WAAW,EACT,+EAA+E;YAC/E,mFAAmF;YACnF,qFAAqF;YACrF,2FAA2F;YAC3F,4DAA4D;QAC9D,QAAQ,EAAE,QAAQ;QAClB,WAAW,EAAE;YACX,IAAI,EAAE,QAAQ;YACd,UAAU,EAAE;gBACV,MAAM,EAAE;oBACN,IAAI,EAAE,QAAQ;oBACd,WAAW,EAAE,yDAAyD;iBACvE;gBACD,MAAM,EAAE;oBACN,IAAI,EAAE,QAAQ;oBACd,WAAW,EAAE,2DAA2D;iBACzE;gBACD,KAAK,EAAE;oBACL,IAAI,EAAE,QAAQ;oBACd,WAAW,EAAE,qCAAqC;iBACnD;aACF;SACF;QACD,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE;YAC3B,MAAM,MAAM,GAAG,IAAI,eAAe,EAAE,CAAC;YACrC,IAAI,IAAI,CAAC,MAAM;gBAAE,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YACnD,IAAI,IAAI,CAAC,MAAM;gBAAE,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YACnD,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,MAAM,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,CAAC;YAC9C,OAAO,GAAG,CAAC,GAAG,CAAC,qCAAqC,MAAM,EAAE,CAAC,CAAC;QAChE,CAAC;KACF;IAED;QACE,IAAI,EAAE,oCAAoC;QAC1C,WAAW,EACT,gFAAgF;YAChF,uEAAuE;YACvE,+CAA+C;YAC/C,mEAAmE;YACnE,uEAAuE;QACzE,QAAQ,EAAE,QAAQ;QAClB,WAAW,EAAE;YACX,IAAI,EAAE,QAAQ;YACd,UAAU,EAAE;gBACV,WAAW,EAAE;oBACX,IAAI,EAAE,QAAQ;oBACd,WAAW,EAAE,4BAA4B;iBAC1C;aACF;YACD,QAAQ,EAAE,CAAC,aAAa,CAAC;SAC1B;QACD,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,CAC3B,GAAG,CAAC,GAAG,CAAC,qCAAqC,kBAAkB,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC;KACvF;IAED;QACE,IAAI,EAAE,qCAAqC;QAC3C,WAAW,EACT,mFAAmF;YACnF,+EAA+E;YAC/E,8EAA8E;YAC9E,sCAAsC;YACtC,iGAAiG;QACnG,QAAQ,EAAE,QAAQ;QAClB,WAAW,EAAE;YACX,IAAI,EAAE,QAAQ;YACd,UAAU,EAAE;gBACV,UAAU,EAAE;oBACV,IAAI,EAAE,OAAO;oBACb,KAAK,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE;oBACzB,WAAW,EAAE,kEAAkE;iBAChF;gBACD,QAAQ,EAAE;oBACR,IAAI,EAAE,QAAQ;oBACd,WAAW,EAAE,+DAA+D;iBAC7E;gBACD,cAAc,EAAE;oBACd,IAAI,EAAE,QAAQ;oBACd,WAAW,EAAE,gDAAgD;iBAC9D;gBACD,WAAW,EAAE;oBACX,IAAI,EAAE,QAAQ;oBACd,WAAW,EAAE,kDAAkD;iBAChE;gBACD,UAAU,EAAE;oBACV,IAAI,EAAE,QAAQ;oBACd,WAAW,EAAE,oCAAoC;iBAClD;aACF;YACD,QAAQ,EAAE,CAAC,YAAY,CAAC;SACzB;QACD,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,CAC3B,GAAG,CAAC,IAAI,CAAC,mCAAmC,EAAE;YAC5C,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,cAAc,EAAE,IAAI,CAAC,cAAc;YACnC,WAAW,EAAE,IAAI,CAAC,WAAW;YAC7B,UAAU,EAAE,IAAI,CAAC,UAAU;SAC5B,CAAC;KACL;IAED;QACE,IAAI,EAAE,6BAA6B;QACnC,WAAW,EACT,mFAAmF;YACnF,oFAAoF;YACpF,mFAAmF;YACnF,0EAA0E;YAC1E,gGAAgG;QAClG,QAAQ,EAAE,QAAQ;QAClB,WAAW,EAAE;YACX,IAAI,EAAE,QAAQ;YACd,UAAU,EAAE;gBACV,WAAW,EAAE;oBACX,IAAI,EAAE,QAAQ;oBACd,WAAW,EAAE,0CAA0C;iBACxD;gBACD,SAAS,EAAE;oBACT,IAAI,EAAE,QAAQ;oBACd,WAAW,EACT,mEAAmE;wBACnE,wEAAwE;wBACxE,4DAA4D;wBAC5D,yDAAyD;wBACzD,+DAA+D;wBAC/D,2EAA2E;iBAC9E;aACF;YACD,QAAQ,EAAE,CAAC,aAAa,EAAE,WAAW,CAAC;SACvC;QACD,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,CAC3B,GAAG,CAAC,IAAI,CACN,qCAAqC,kBAAkB,CAAC,IAAI,CAAC,WAAW,CAAC,SAAS,EAClF,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE,CAC9B;KACJ;IAED,oCAAoC;IAEpC;QACE,IAAI,EAAE,oCAAoC;QAC1C,WAAW,EACT,uFAAuF;YACvF,qFAAqF;YACrF,8EAA8E;QAChF,QAAQ,EAAE,QAAQ;QAClB,WAAW,EAAE;YACX,IAAI,EAAE,QAAQ;YACd,UAAU,EAAE;gBACV,MAAM,EAAE;oBACN,IAAI,EAAE,QAAQ;oBACd,WAAW,EAAE,2CAA2C;iBACzD;gBACD,IAAI,EAAE;oBACJ,IAAI,EAAE,QAAQ;oBACd,WAAW,EAAE,qDAAqD;iBACnE;gBACD,QAAQ,EAAE;oBACR,IAAI,EAAE,QAAQ;oBACd,WAAW,EAAE,uCAAuC;iBACrD;gBACD,MAAM,EAAE;oBACN,IAAI,EAAE,QAAQ;oBACd,WAAW,EAAE,gEAAgE;iBAC9E;gBACD,KAAK,EAAE;oBACL,IAAI,EAAE,QAAQ;oBACd,WAAW,EAAE,2BAA2B;iBACzC;aACF;SACF;QACD,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE;YAC3B,MAAM,MAAM,GAAG,IAAI,eAAe,EAAE,CAAC;YACrC,IAAI,IAAI,CAAC,MAAM;gBAAE,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YACnD,IAAI,IAAI,CAAC,IAAI;gBAAE,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;YAC7C,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI;gBAAE,MAAM,CAAC,GAAG,CAAC,WAAW,EAAE,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;YAC1E,IAAI,IAAI,CAAC,MAAM;gBAAE,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YACnD,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,MAAM,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,CAAC;YAC9C,OAAO,GAAG,CAAC,GAAG,CAAC,yBAAyB,MAAM,EAAE,CAAC,CAAC;QACpD,CAAC;KACF;IAED;QACE,IAAI,EAAE,kCAAkC;QACxC,WAAW,EACT,+EAA+E;YAC/E,+EAA+E;YAC/E,yEAAyE;QAC3E,QAAQ,EAAE,QAAQ;QAClB,WAAW,EAAE;YACX,IAAI,EAAE,QAAQ;YACd,UAAU,EAAE;gBACV,WAAW,EAAE;oBACX,IAAI,EAAE,QAAQ;oBACd,WAAW,EAAE,0BAA0B;iBACxC;aACF;YACD,QAAQ,EAAE,CAAC,aAAa,CAAC;SAC1B;QACD,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE;YAC3B,MAAM,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC;YAC5B,IAAI,CAAC,EAAE;gBAAE,MAAM,IAAI,KAAK,CAAC,yBAAyB,CAAC,CAAC;YACpD,OAAO,GAAG,CAAC,GAAG,CAAC,yBAAyB,kBAAkB,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;QACpE,CAAC;KACF;IAED;QACE,IAAI,EAAE,kCAAkC;QACxC,WAAW,EACT,iFAAiF;YACjF,iFAAiF;YACjF,gFAAgF;YAChF,gBAAgB;QAClB,QAAQ,EAAE,QAAQ;QAClB,WAAW,EAAE;YACX,IAAI,EAAE,QAAQ;YACd,UAAU,EAAE;gBACV,WAAW,EAAE;oBACX,IAAI,EAAE,QAAQ;oBACd,WAAW,EAAE,0BAA0B;iBACxC;aACF;YACD,QAAQ,EAAE,CAAC,aAAa,CAAC;SAC1B;QACD,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE;YAC3B,MAAM,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC;YAC5B,IAAI,CAAC,EAAE;gBAAE,MAAM,IAAI,KAAK,CAAC,yBAAyB,CAAC,CAAC;YACpD,OAAO,GAAG,CAAC,GAAG,CAAC,yBAAyB,kBAAkB,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC;QAC9E,CAAC;KACF;IAED,mDAAmD;IAEnD;QACE,IAAI,EAAE,oCAAoC;QAC1C,WAAW,EACT,6EAA6E;YAC7E,wEAAwE;YACxE,4EAA4E;YAC5E,8BAA8B;YAC9B,yEAAyE;YACzE,uCAAuC;QACzC,QAAQ,EAAE,QAAQ;QAClB,WAAW,EAAE;YACX,IAAI,EAAE,QAAQ;YACd,UAAU,EAAE;gBACV,MAAM,EAAE;oBACN,IAAI,EAAE,QAAQ;oBACd,WAAW,EAAE,yDAAyD;iBACvE;gBACD,KAAK,EAAE;oBACL,IAAI,EAAE,QAAQ;oBACd,WAAW,EAAE,2BAA2B;iBACzC;aACF;SACF;QACD,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE;YAC3B,MAAM,MAAM,GAAG,IAAI,eAAe,EAAE,CAAC;YACrC,IAAI,IAAI,CAAC,MAAM;gBAAE,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YACnD,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,MAAM,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,CAAC;YAC9C,OAAO,GAAG,CAAC,GAAG,CAAC,mCAAmC,MAAM,EAAE,CAAC,CAAC;QAC9D,CAAC;KACF;IAED;QACE,IAAI,EAAE,4BAA4B;QAClC,WAAW,EACT,6EAA6E;YAC7E,4EAA4E;YAC5E,4EAA4E;YAC5E,2DAA2D;YAC3D,uDAAuD;QACzD,QAAQ,EAAE,QAAQ;QAClB,WAAW,EAAE;YACX,IAAI,EAAE,QAAQ;YACd,UAAU,EAAE;gBACV,WAAW,EAAE;oBACX,IAAI,EAAE,QAAQ;oBACd,WAAW,EAAE,0BAA0B;iBACxC;gBACD,OAAO,EAAE;oBACP,IAAI,EAAE,OAAO;oBACb,KAAK,EAAE;wBACL,IAAI,EAAE,QAAQ;wBACd,UAAU,EAAE;4BACV,SAAS,EAAE;gCACT,IAAI,EAAE,QAAQ;gCACd,WAAW,EAAE,oDAAoD;6BAClE;4BACD,MAAM,EAAE;gCACN,IAAI,EAAE,OAAO;gCACb,KAAK,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE;gCACzB,WAAW,EAAE,kCAAkC;6BAChD;4BACD,SAAS,EAAE;gCACT,IAAI,EAAE,QAAQ;gCACd,WAAW,EAAE,2CAA2C;6BACzD;yBACF;wBACD,QAAQ,EAAE,CAAC,WAAW,EAAE,QAAQ,EAAE,WAAW,CAAC;qBAC/C;oBACD,WAAW,EAAE,iEAAiE;iBAC/E;aACF;YACD,QAAQ,EAAE,CAAC,aAAa,EAAE,SAAS,CAAC;SACrC;QACD,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,CAC3B,GAAG,CAAC,IAAI,CACN,mCAAmC,kBAAkB,CAAC,IAAI,CAAC,WAAW,CAAC,SAAS,EAChF,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,CAC1B;KACJ;IAED,+BAA+B;IAE/B;QACE,IAAI,EAAE,kCAAkC;QACxC,WAAW,EACT,wEAAwE;YACxE,0EAA0E;YAC1E,4EAA4E;YAC5E,sEAAsE;YACtE,yFAAyF;QAC3F,QAAQ,EAAE,QAAQ;QAClB,WAAW,EAAE;YACX,IAAI,EAAE,QAAQ;YACd,UAAU,EAAE;gBACV,KAAK,EAAE;oBACL,IAAI,EAAE,QAAQ;oBACd,WAAW,EAAE,8DAA8D;iBAC5E;gBACD,MAAM,EAAE;oBACN,IAAI,EAAE,QAAQ;oBACd,WAAW,EAAE,sBAAsB;iBACpC;gBACD,QAAQ,EAAE;oBACR,IAAI,EAAE,QAAQ;oBACd,WAAW,EAAE,uCAAuC;iBACrD;gBACD,UAAU,EAAE;oBACV,IAAI,EAAE,QAAQ;oBACd,WAAW,EACT,qEAAqE;wBACrE,kFAAkF;iBACrF;gBACD,KAAK,EAAE;oBACL,IAAI,EAAE,QAAQ;oBACd,WAAW,EAAE,oCAAoC;iBAClD;aACF;YACD,QAAQ,EAAE,CAAC,OAAO,CAAC;SACpB;QACD,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE;YAC3B,MAAM,MAAM,GAAG,IAAI,eAAe,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;YACtD,IAAI,IAAI,CAAC,MAAM;gBAAE,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YACnD,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI;gBAAE,MAAM,CAAC,GAAG,CAAC,WAAW,EAAE,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;YAC1E,IAAI,IAAI,CAAC,UAAU;gBAAE,MAAM,CAAC,GAAG,CAAC,aAAa,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;YAChE,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,MAAM,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,CAAC;YAC9C,OAAO,GAAG,CAAC,GAAG,CAAC,+BAA+B,MAAM,EAAE,CAAC,CAAC;QAC1D,CAAC;KACF;IAED,+BAA+B;IAE/B;QACE,IAAI,EAAE,mCAAmC;QACzC,WAAW,EACT,6EAA6E;YAC7E,0EAA0E;YAC1E,oDAAoD;YACpD,2EAA2E;YAC3E,mFAAmF;QACrF,QAAQ,EAAE,QAAQ;QAClB,WAAW,EAAE;YACX,IAAI,EAAE,QAAQ;YACd,UAAU,EAAE;gBACV,WAAW,EAAE;oBACX,IAAI,EAAE,QAAQ;oBACd,WAAW,EAAE,4CAA4C;iBAC1D;gBACD,UAAU,EAAE;oBACV,IAAI,EAAE,QAAQ;oBACd,WAAW,EAAE,kEAAkE;iBAChF;gBACD,iBAAiB,EAAE;oBACjB,IAAI,EAAE,QAAQ;oBACd,WAAW,EAAE,8DAA8D;iBAC5E;gBACD,IAAI,EAAE;oBACJ,IAAI,EAAE,OAAO;oBACb,KAAK,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE;oBACzB,WAAW,EAAE,4DAA4D;iBAC1E;aACF;YACD,QAAQ,EAAE,CAAC,aAAa,CAAC;SAC1B;QACD,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE;YAC3B,MAAM,GAAG,GAAG,kBAAkB,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YACjD,OAAO,GAAG,CAAC,IAAI,CAAC,yBAAyB,GAAG,iBAAiB,EAAE;gBAC7D,UAAU,EAAE,IAAI,CAAC,UAAU;gBAC3B,iBAAiB,EAAE,IAAI,CAAC,iBAAiB;gBACzC,IAAI,EAAE,IAAI,CAAC,IAAI;aAChB,CAAC,CAAC;QACL,CAAC;KACF;CACF,CAAC"}
+{"version":3,"file":"miningPipeline.js","sourceRoot":"","sources":["../../src/tools/miningPipeline.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAIH,MAAM,CAAC,MAAM,mBAAmB,GAAc,EAAE,CAAC"}

package/dist/tools/onchain.js

@@ -142,7 +142,7 @@ export const onchainTools = [
     },
     {
         name: "nookplot_claim_bounty",
-        description: "Claim a bounty you were selected as winner for — triggers instant payout (on-chain, V7). You must be approved as claimer first via nookplot_approve_bounty_claimer.",
+        description: "Claim a bounty you were approved on as claimer (on-chain). You must be pre-approved via nookplot_approve_bounty_claimer first. Routing depends on the V10 v9PathSinceId threshold: if bountyId is legacy (< v9PathSinceId) AND the bounty is already Submitted by a pre-approved claimer, claim auto-pays in the same tx (V7 fast-path). Otherwise (V9 path — the default for new bounties), claim transitions the bounty to Claimed (status 1) and you must then call nookplot_submit_bounty_onchain with your deliverable; the creator then approves via nookplot_approve_bounty_work for escrow release.",
         category: "bounties",
         inputSchema: {
             type: "object",
@@ -155,7 +155,7 @@ export const onchainTools = [
     },
     {
         name: "nookplot_approve_bounty_claimer",
-        description: "Select a bounty winner by approving their on-chain claim (bounty owner only). Maps to the on-chain `approveClaimer` function. Use nookplot_check_delegation first to review submitted work. Once approved, the winner claims for instant payout (V7 auto-payout).",
+        description: "Approve an applicant as an eligible on-chain claimer for your bounty (bounty creator only). Maps to the on-chain `approveClaimer` function. Up to 3 approved claimers per bounty. After approval the claimer can call nookplot_claim_bounty: for V9-path bounties (bountyId >= v9PathSinceId — the default for new bounties) the claim transitions to Claimed and the normal submit + approve cycle runs; for legacy V7 fast-path bounties (bountyId < v9PathSinceId) where work was already submitted, the claim auto-pays in the same tx.",
         category: "bounties",
         inputSchema: {
             type: "object",