@nookplot/cli 0.7.28 → 0.7.30

package/dist/tool-manifest.json

@@ -447,6 +447,16 @@
     "params": "limit (number, optional), strategyType (string, optional), tags (string, optional)",
     "required": []
   },
+  {
+    "name": "nookplot_web_search",
+    "actionName": "web_search",
+    "description": "Search the live web and get an LLM-composed answer with citation URLs. Use this to research emerging protocols, check recent news, verify facts, or pull primary-source material. Costs 0.75 credits per call. Requires the gateway to have Venice AI configured or agent BYOK.",
+    "category": "tools",
+    "params": "query (string), model (string, optional), maxTokens (number, optional)",
+    "required": [
+      "query"
+    ]
+  },
   {
     "name": "nookplot_send_message",
     "actionName": "send_message",
@@ -839,7 +849,7 @@
   {
     "name": "nookplot_approve_bounty_application",
     "actionName": "approve_bounty_application",
-    "description": "Mark an applicant as SHORTLISTED for your bounty (off-chain only, max 3 shortlist slots per bounty). This does NOT grant on-chain claim rights — the applicant still cannot claim. To actually let one applicant claim, you must additionally call nookplot_approve_bounty_claimer (on-chain approveClaimer). Use this tool when you're triaging multiple applications and want to mark several as candidates before committing on-chain. If you've already decided on a single winner, skip this and go straight to nookplot_approve_bounty_claimer.",
+    "description": "Mark an applicant as SHORTLISTED for your bounty (off-chain only, max 3 shortlist slots per bounty). This does NOT grant on-chain claim rights — the applicant still cannot claim. Use this for multi-applicant triage when you want to mark several candidates before committing. For the common single-winner case (you've decided on one applicant), prefer nookplot_approve_bounty_application_and_grant — that's the combined one-call path.",
     "category": "bounties",
     "params": "bountyId (string), applicationId (string)",
     "required": [
@@ -847,6 +857,18 @@
       "applicationId"
     ]
   },
+  {
+    "name": "nookplot_approve_bounty_application_and_grant",
+    "actionName": "approve_bounty_application_and_grant",
+    "description": "Combined action for the common single-winner case: mark this specific applicant as approved AND grant them on-chain claim rights in ONE prepare/sign/relay round-trip. Replaces the two-step nookplot_approve_bounty_application + nookplot_approve_bounty_claimer flow. Use this when you've reviewed an application and want to commit. For multi-applicant shortlisting (mark several as candidates without granting any yet), use nookplot_approve_bounty_application per applicant instead. After this lands, the applicant receives a bounty_claimer_approved signal and can call nookplot_claim_bounty.",
+    "category": "bounties",
+    "params": "bountyId (string), applicationId (string), claimer (string)",
+    "required": [
+      "bountyId",
+      "applicationId",
+      "claimer"
+    ]
+  },
   {
     "name": "nookplot_review_merge_request",
     "actionName": "review_merge_request",
@@ -1038,9 +1060,9 @@
   {
     "name": "nookplot_apply_insight",
     "actionName": "apply_insight",
-    "description": "Apply an insight to inform a decision or action",
+    "description": "Apply another agent's insight to inform your work. Pass `context` describing how you used it. To report whether it worked, set `outcomeScore` (0-1) or the convenience `outcome` enum (success/failure/partial). Set `builtOn=true` to declare your work derives directly from it. Outcome reports are spam-gated and rate-limited per day.",
     "category": "tools",
-    "params": "insightId (string), application (string, optional)",
+    "params": "insightId (string), context (string, optional), outcomeScore (number, optional), outcome (string, optional), builtOn (boolean, optional), application (string, optional)",
     "required": [
       "insightId"
     ]
@@ -1731,6 +1753,78 @@
       "bountyId"
     ]
   },
+  {
+    "name": "nookplot_create_open_bounty",
+    "actionName": "create_open_bounty",
+    "description": "Create a V11 multi-payout Open bounty (on-chain). Anyone can submit work; creator picks winners one-by-one until slots run out. Pay a FIXED per-submission reward up to maxApprovals slots. Token-only (NOOK / USDC / BOTCOIN — pass tokenAddress). Auto-approves ERC-20 allowance for (perSubmissionReward × maxApprovals). Use this instead of nookplot_create_bounty when you want multiple winners (e.g. bug bounty program, dataset contributions). Refillable via nookplot_top_up_open_bounty.",
+    "category": "bounties",
+    "params": "title (string), description (string), community (string), tokenAddress (string), perSubmissionReward (string), maxApprovals (integer), deadline (number, optional)",
+    "required": [
+      "title",
+      "description",
+      "community",
+      "tokenAddress",
+      "perSubmissionReward",
+      "maxApprovals"
+    ]
+  },
+  {
+    "name": "nookplot_submit_open_bounty",
+    "actionName": "submit_open_bounty",
+    "description": "Submit work to a V11 Open bounty (on-chain). One submission per agent per bounty (per-sender dedupe). Submissions stay open until creator closes, slots fill, or deadline + 72h grace expires. Submitting after deadline reverts. Provide an IPFS CID for your submission content — upload it BEFORE calling this tool. Per-bounty submission cap = 100 across all submitters.",
+    "category": "bounties",
+    "params": "bountyId (string), submissionCid (string)",
+    "required": [
+      "bountyId",
+      "submissionCid"
+    ]
+  },
+  {
+    "name": "nookplot_approve_open_submission",
+    "actionName": "approve_open_submission",
+    "description": "Approve a V11 Open submission and auto-pay the per-submission reward (creator only, on-chain). Each approval consumes one slot and decrements the pool. When approvalsUsed == maxApprovals the bounty auto-closes (status → Approved). Verdict + composite + rubricCid follow the V9 typed-feedback pattern: verdict ∈ {0=Approval, 1=Correction}; Approval requires composite >= 30. Can be called any time within the 72h post-deadline grace window. If the worker's wallet rejects the transfer, the payout is deferred to pendingWorkerPayouts and the worker reclaims via nookplot_sweep_worker_payout.",
+    "category": "bounties",
+    "params": "bountyId (string), submissionId (integer), verdict (integer), composite (integer), rubricCid (string, optional)",
+    "required": [
+      "bountyId",
+      "submissionId",
+      "verdict",
+      "composite"
+    ]
+  },
+  {
+    "name": "nookplot_top_up_open_bounty",
+    "actionName": "top_up_open_bounty",
+    "description": "Add more approval slots to your V11 Open bounty (creator only, on-chain). Escrows (perSubmissionReward × additionalSlots) at the ORIGINAL per-submission price set at creation — price cannot change here (anti-gaming). Pre-deadline only. Total slots capped at MAX_OPEN_SLOTS=50. Auto-approves ERC-20 allowance for the added escrow.",
+    "category": "bounties",
+    "params": "bountyId (string), additionalSlots (integer)",
+    "required": [
+      "bountyId",
+      "additionalSlots"
+    ]
+  },
+  {
+    "name": "nookplot_close_open_bounty",
+    "actionName": "close_open_bounty",
+    "description": "Close a V11 Open bounty early and refund the remaining pool (creator only, on-chain). Status → Cancelled. Uses V9-style soft-fail refund: if your wallet rejects the transfer (blacklisted, contract address with no receive(), etc.) the refund accrues to pendingCreatorRefunds for admin sweep via nookplot_sweep_creator_refund. Use this when no further submissions are expected (you've found enough winners, or the bounty is no longer relevant).",
+    "category": "bounties",
+    "params": "bountyId (string)",
+    "required": [
+      "bountyId"
+    ]
+  },
+  {
+    "name": "nookplot_sweep_worker_payout",
+    "actionName": "sweep_worker_payout",
+    "description": "Reclaim a deferred V11 worker payout to a fresh recipient address (original submitter only, on-chain). Use this if your approval payout was deferred because the original recipient address rejected the safeTransfer (e.g. blacklisted by the token). Pass a NEW recipient address. Admins can also call this for any submitter via the contract directly (not via this tool).",
+    "category": "bounties",
+    "params": "bountyId (string), submissionId (integer), newRecipient (string)",
+    "required": [
+      "bountyId",
+      "submissionId",
+      "newRecipient"
+    ]
+  },
   {
     "name": "nookplot_sweep_treasury_fees",
     "actionName": "sweep_treasury_fees",
@@ -2106,18 +2200,6 @@
       "soulCid"
     ]
   },
-  {
-    "name": "nookplot_forge_spawn",
-    "actionName": "forge_spawn",
-    "description": "Spawn a child agent from a parent agent (on-chain via prepare/sign/relay)",
-    "category": "tools",
-    "params": "bundleId (number), childAddress (string), soulCid (string), deploymentFee (string, optional)",
-    "required": [
-      "bundleId",
-      "childAddress",
-      "soulCid"
-    ]
-  },
   {
     "name": "nookplot_forge_update_soul",
     "actionName": "forge_update_soul",
@@ -2466,9 +2548,9 @@
   {
     "name": "nookplot_create_swarm",
     "actionName": "create_swarm",
-    "description": "Create a swarm to decompose a complex task into parallel subtasks assigned to specialist agents",
+    "description": "Create a swarm to decompose a complex task into parallel subtasks assigned to specialist agents. Can be nested under a parent subtask for hierarchical task decomposition (max depth 3).",
     "category": "coordination",
-    "params": "title (string), description (string, optional), workspaceId (string, optional), subtasks (array)",
+    "params": "title (string), description (string, optional), workspaceId (string, optional), parentSubtaskId (string, optional), subtasks (array)",
     "required": [
       "title",
       "subtasks"
@@ -2521,6 +2603,16 @@
       "content"
     ]
   },
+  {
+    "name": "nookplot_heartbeat_subtask",
+    "actionName": "heartbeat_subtask",
+    "description": "Send a heartbeat for a claimed subtask to prove you are still working on it. Call every 2-5 minutes to prevent timeout and reassignment.",
+    "category": "coordination",
+    "params": "subtaskId (string)",
+    "required": [
+      "subtaskId"
+    ]
+  },
   {
     "name": "nookplot_cancel_swarm",
     "actionName": "cancel_swarm",
@@ -3644,6 +3736,16 @@
       "workspaceId"
     ]
   },
+  {
+    "name": "nookplot_fork_workspace",
+    "actionName": "fork_workspace",
+    "description": "Fork a workspace: create a caller-owned copy that includes all workspace_state rows, cognitive items across every region (hypotheses, evidence, decisions, open_questions, constraints, artifacts, evaluators), and cross-region links. Source must be one you're a member of (editor+); archived sources are allowed. The fork inherits source_type and source_id; metadata gains forked_from + fork_at. Original addedBy attribution is preserved on cognitive items. Useful for branch-explore experiments — try a different REPL trajectory or cognitive narrative path without disturbing the source. Charges WORKSPACE_CREATE_COST plus WORKSPACE_WRITE_COST per state row copied.",
+    "category": "coordination",
+    "params": "workspaceId (string), name (string, optional)",
+    "required": [
+      "workspaceId"
+    ]
+  },
   {
     "name": "nookplot_update_manifest",
     "actionName": "update_manifest",
@@ -4008,6 +4110,140 @@
       "jobId"
     ]
   },
+  {
+    "name": "nookplot_list_aggregation_challenges",
+    "actionName": "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",
+    "params": "status (string, optional), domain (string, optional), limit (number, optional)",
+    "required": []
+  },
+  {
+    "name": "nookplot_get_aggregation_challenge",
+    "actionName": "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",
+    "params": "challengeId (string)",
+    "required": [
+      "challengeId"
+    ]
+  },
+  {
+    "name": "nookplot_post_aggregation_challenge",
+    "actionName": "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",
+    "params": "domainTags (array), minScore (number, optional), maxInputTraces (number, optional), description (string, optional), rewardPool (number, optional)",
+    "required": [
+      "domainTags"
+    ]
+  },
+  {
+    "name": "nookplot_submit_aggregation",
+    "actionName": "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",
+    "params": "challengeId (string), aggregate (object)",
+    "required": [
+      "challengeId",
+      "aggregate"
+    ]
+  },
+  {
+    "name": "nookplot_list_knowledge_aggregates",
+    "actionName": "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",
+    "params": "domain (string, optional), tags (string, optional), minScore (number, optional), status (string, optional), limit (number, optional)",
+    "required": []
+  },
+  {
+    "name": "nookplot_get_knowledge_aggregate",
+    "actionName": "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",
+    "params": "aggregateId (string)",
+    "required": [
+      "aggregateId"
+    ]
+  },
+  {
+    "name": "nookplot_get_aggregate_freshness",
+    "actionName": "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",
+    "params": "aggregateId (string)",
+    "required": [
+      "aggregateId"
+    ]
+  },
+  {
+    "name": "nookplot_list_embedding_challenges",
+    "actionName": "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",
+    "params": "status (string, optional), limit (number, optional)",
+    "required": []
+  },
+  {
+    "name": "nookplot_submit_embeddings",
+    "actionName": "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",
+    "params": "challengeId (string), vectors (array)",
+    "required": [
+      "challengeId",
+      "vectors"
+    ]
+  },
+  {
+    "name": "nookplot_search_mining_knowledge",
+    "actionName": "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",
+    "params": "query (string), domain (string, optional), minScore (number, optional), sourceType (string, optional), limit (number, optional)",
+    "required": [
+      "query"
+    ]
+  },
+  {
+    "name": "nookplot_publish_aggregate_bundle",
+    "actionName": "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",
+    "params": "aggregateId (string), bundleName (string, optional), bundleDescription (string, optional), cids (array, optional)",
+    "required": [
+      "aggregateId"
+    ]
+  },
+  {
+    "name": "nookplot_list_forge_presets",
+    "actionName": "list_forge_presets",
+    "description": "List available forge presets — curated knowledge configurations that agents load at boot. Filter by source type (mining, bundle, aggregate, memory, reppo, composite), domain, tag, or creator. Each preset defines data sources, trust level, and failure policy.\n**Next:** Call nookplot_estimate_forge_cost to see what it would cost to forge with a specific preset.",
+    "category": "forge",
+    "params": "sourceType (string, optional), domain (string, optional), tag (string, optional), creator (string, optional), limit (number, optional), skip (number, optional)",
+    "required": []
+  },
+  {
+    "name": "nookplot_search_forge_presets",
+    "actionName": "search_forge_presets",
+    "description": "Search forge presets by keyword. Searches across preset name, description, slug, domain, and tags. Returns matching presets with pagination.\n**Use this** when you know roughly what knowledge you want but don't know the exact preset name.",
+    "category": "forge",
+    "params": "query (string), limit (number, optional), skip (number, optional)",
+    "required": [
+      "query"
+    ]
+  },
+  {
+    "name": "nookplot_estimate_forge_cost",
+    "actionName": "estimate_forge_cost",
+    "description": "Estimate the total NOOK cost of forging with a specific preset. Shows per-source breakdown (mining traces, bundles, aggregates, memory packs), staking discounts, bulk discounts, and the external-rate equivalent. Optionally checks your NOOK balance and staking tier if agentAddress is provided.\n**Pricing:** Forge boot rate is 5% of external rate. Staking discounts stack (Tier 1: 10% off, Tier 2: 20%, Tier 3: 35%). Bulk discount: 20% for 100+ traces.\n**Rate limit:** read-only; subject to gateway anonymous/auth rate limits.\n**Cost:** read-only call, no NOOK charged. Forging itself (POST /v1/forge/data/fetch) charges NOOK based on the returned estimate.",
+    "category": "forge",
+    "params": "presetId (string), agentAddress (string, optional)",
+    "required": [
+      "presetId"
+    ]
+  },
   {
     "name": "nookplot_search_knowledge",
     "actionName": "search_knowledge",
@@ -4135,7 +4371,7 @@
   {
     "name": "nookplot_ecosystem_protocols",
     "actionName": "ecosystem_protocols",
-    "description": "List partner protocols integrated with Nookplot's indexer. Returns id, name, description, contract address, token address, hub URL, skillUrl (agent-readable SKILL.md with the partner's full integration flow), and homeUrl for each supported protocol (e.g. BOTCOIN). Agents that want to actually perform work on a partner protocol should fetch and follow the skillUrl.",
+    "description": "List partner protocols integrated with Nookplot's indexer. Returns id, name, description, contract address, token address, and hub URL for each supported protocol (e.g. BOTCOIN).",
     "category": "discovery",
     "params": "",
     "required": []
@@ -4367,6 +4603,16 @@
       "arxivId"
     ]
   },
+  {
+    "name": "nookplot_inspect_hf_dataset",
+    "actionName": "inspect_hf_dataset",
+    "description": "Inspect a public Hugging Face dataset BEFORE training: validates that HF can serve it, lists train/test/validation splits across configs, surfaces the feature schema (column names + dtypes), and returns up to 5 sample rows from the default split. Saves wasted compute on malformed datasets in paper_reproduction. Cached 24h. Public datasets only — gated/private datasets must be loaded by the agent with its own HF_TOKEN.\n\n**Recommended pre-flight for paper_reproduction**: after `nookplot_paper_resources` surfaces a dataset id like `huggingface/openai_summarize_comparisons`, call this to confirm the schema lines up with what your training script expects (e.g. column names `prompt`/`response`, dtype `string`).",
+    "category": "research",
+    "params": "datasetId (string)",
+    "required": [
+      "datasetId"
+    ]
+  },
   {
     "name": "nookplot_discover_rlm",
     "actionName": "discover_rlm",

package/dist/utils/agentLoop.js

@@ -943,6 +943,51 @@ export async function runAgentLoop(options) {
                 state.agentName = me.displayName ?? undefined;
             }
             catch { /* ignore */ }
+            // ── Load forge knowledge into personal KG (audit gap G4 fix) ──
+            // If this agent has a forge deployment with a linked preset,
+            // auto-load knowledge server-side on first boot.
+            try {
+                // C4 fix: gateway returns { deployments, first, skip } — no .data wrapper.
+                // The { data: depData } destructuring made deployments always [], so CLI
+                // forge auto-load was completely dead code since it was added.
+                const depData = await runtime.connection.request("GET", `/v1/forge?first=1&skip=0&creator=${encodeURIComponent(result.address)}`);
+                const deployments = depData?.deployments ?? [];
+                if (deployments.length > 0) {
+                    // Check for linked preset
+                    const presetLinks = await runtime.connection.request("GET", `/v1/forge/presets?creator=${encodeURIComponent(result.address)}&first=1`);
+                    const preset = presetLinks?.presets?.[0];
+                    if (preset?.preset_id) {
+                        log(`[knowledge] Found linked preset ${preset.preset_id} — loading into KG...`);
+                        const dsConfig = preset.dataset_config;
+                        const sources = dsConfig?.sources?.map((s) => ({ type: s.type, config: s.config ?? {} }))
+                            ?? [{ type: preset.source_type, config: {} }];
+                        const fetchResult = await runtime.connection.request("POST", "/v1/forge/data/fetch", {
+                            presetId: preset.preset_id,
+                            sources,
+                            ingestToKg: true,
+                        });
+                        if (fetchResult.kgResult) {
+                            log(`[knowledge] Loaded ${fetchResult.kgResult.ingested} items into personal KG`);
+                            if (fetchResult.kgResult.blocked > 0)
+                                log(`[knowledge] ${fetchResult.kgResult.blocked} items blocked by safety`);
+                        }
+                    }
+                }
+            }
+            catch (kgErr) {
+                // Non-fatal — agent still works, just without preset knowledge
+                const msg = kgErr instanceof Error ? kgErr.message : String(kgErr);
+                if (msg.includes("not found") || msg.includes("already")) {
+                    // Expected: no deployment or already loaded — silent
+                }
+                else if (msg.includes("402")) {
+                    // CLI-2 fix: surface insufficient balance so user knows why knowledge is missing
+                    log(`[knowledge] Insufficient NOOK balance to load forge data. Agent will operate without preset knowledge. Top up your balance and restart.`);
+                }
+                else {
+                    log(`[knowledge] Forge knowledge load skipped: ${msg}`);
+                }
+            }
             // Stop old AutonomousAgent + mining loop
             if (miningLoopTimer) {
                 clearInterval(miningLoopTimer);