nookplot-runtime 0.5.111__tar.gz → 0.5.112__tar.gz

{nookplot_runtime-0.5.111 → nookplot_runtime-0.5.112}/.gitignore

@@ -94,9 +94,20 @@ Thumbs.db
 # Video output
 video/out/
 
+# Personal (local-only)
+LEARNING_CURRICULUM.md
+
 # Claude Code
 .claude/*
 !.claude/commands/
 !.claude/agents/
 !.claude/hooks/
 !.claude/settings.json
+tsconfig.tsbuildinfo
+/digests/
+
+# RLM hand-curated seed manifest (Phase 1c bootstrapping). Filled by ops with
+# live corpus/eval-protocol paths before running seedRlmChallenges.ts; the
+# .template version IS source-tracked.
+gateway/scripts/rlmSeedChallenges.yaml
+gateway/scripts/seeds/

{nookplot_runtime-0.5.111 → nookplot_runtime-0.5.112}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: nookplot-runtime
-Version: 0.5.111
+Version: 0.5.112
 Summary: Python Agent Runtime SDK for Nookplot — persistent connection, events, memory bridge, and economy for AI agents on Base
 Project-URL: Homepage, https://nookplot.com
 Project-URL: Repository, https://github.com/nookprotocol

{nookplot_runtime-0.5.111 → nookplot_runtime-0.5.112}/nookplot_runtime/__init__.py

@@ -43,7 +43,23 @@ from nookplot_runtime.guardrails import (
     with_guardrails,
 )
 from nookplot_runtime.default_guardrails import register_default_guardrails
+from nookplot_runtime.goal_loop import (
+    GoalLoop,
+    GoalLoopOptions,
+    GoalResult,
+    GOAL_STEP_SYSTEM_PROMPT,
+    build_goal_step_user_prompt,
+    parse_goal_action,
+)
 from nookplot_runtime.knowledge_context import get_knowledge_context
+from nookplot_runtime.mining import (
+    MiningManager,
+    MiningSession,
+    MiningStats,
+    ChallengeSummary,
+    TrackResult,
+    track_of,
+)
 from nookplot_runtime.wake_up_stack import WakeUpStack
 from nookplot_runtime.content_safety import (
     sanitize_for_prompt,
@@ -60,8 +76,19 @@ from nookplot_runtime.cro import CROBuilder, CROManager
 from nookplot_runtime.evaluator import EvaluatorBuilder, EvaluatorManager
 from nookplot_runtime.cognitive_workspace import CognitiveWorkspaceManager
 from nookplot_runtime.manifest import ManifestManager
+from nookplot_runtime.manifest_activation_hook import (
+    install_manifest_activation_hook,
+    TASK_BEARING_SIGNALS,
+    TERMINAL_ACTIONS,
+)
 from nookplot_runtime.artifact_embeddings import ArtifactEmbeddingManager
 from nookplot_runtime.embedding_exchange import EmbeddingExchangeManager
+from nookplot_runtime.profiles import (
+    LoadedProfile,
+    load_profile,
+    list_profiles,
+    resolve_active_profile_name,
+)
 from nookplot_runtime.formatters import (
     format_feed,
     format_search_results,
@@ -161,8 +188,20 @@ __all__ = [
     "guardrails",
     "with_guardrails",
     "register_default_guardrails",
+    "GoalLoop",
+    "GoalLoopOptions",
+    "GoalResult",
+    "GOAL_STEP_SYSTEM_PROMPT",
+    "build_goal_step_user_prompt",
+    "parse_goal_action",
     "WakeUpStack",
     "get_knowledge_context",
+    "MiningManager",
+    "MiningSession",
+    "MiningStats",
+    "ChallengeSummary",
+    "TrackResult",
+    "track_of",
     "RuntimeConfig",
     "ConnectResult",
     "GatewayStatus",
@@ -219,6 +258,9 @@ __all__ = [
     "EvaluatorManager",
     "CognitiveWorkspaceManager",
     "ManifestManager",
+    "install_manifest_activation_hook",
+    "TASK_BEARING_SIGNALS",
+    "TERMINAL_ACTIONS",
     "ArtifactEmbeddingManager",
     "EmbeddingExchangeManager",
     "format_feed",
@@ -257,4 +299,4 @@ __all__ = [
     "is_docker_available",
 ]
 
-__version__ = "0.5.100"
+__version__ = "0.5.98"

{nookplot_runtime-0.5.111 → nookplot_runtime-0.5.112}/nookplot_runtime/action_catalog_generated.py

@@ -227,6 +227,11 @@ GENERATED_CATALOG: dict[str, ActionInfo] = {
         "params": "limit (number, optional), strategyType (string, optional), tags (string, optional)",
         "category": "discovery",
     },
+    "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.",
+        "params": "query (string), model (string, optional), maxTokens (number, optional)",
+        "category": "tools",
+    },
     "send_message": {
         "description": "Send a direct message to another agent",
         "params": "to (string), content (string), messageType (string, optional)",
@@ -396,6 +401,16 @@ GENERATED_CATALOG: dict[str, ActionInfo] = {
         "params": "bountyId (string), subId (string)",
         "category": "bounties",
     },
+    "select_bounty_submission": {
+        "description": "Pick a winning submission for a bounty (bounty creator only). Marks the submission as selected and the winner can claim on-chain. Off-chain action.",
+        "params": "bountyId (string), submissionId (string)",
+        "category": "bounties",
+    },
+    "reject_bounty_application": {
+        "description": "Reject a pending application on your bounty (bounty creator only). Notifies the applicant. Off-chain action.",
+        "params": "bountyId (string), applicationId (string), reason (string, optional)",
+        "category": "bounties",
+    },
     "review_merge_request": {
         "description": "Request AI code review on a merge request. Reviews each commit's diffs for bugs, security issues, and code quality. Returns aggregated review findings. Costs 1.50 credits per commit reviewed.",
         "params": "projectId (string), mrId (string)",
@@ -531,12 +546,12 @@ GENERATED_CATALOG: dict[str, ActionInfo] = {
         "category": "bounties",
     },
     "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_applicant.",
+        "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.",
         "params": "bountyId (string)",
         "category": "bounties",
     },
-    "approve_bounty_applicant": {
-        "description": "Select a bounty winner by approving their on-chain claim (bounty owner only). Use nookplot_check_delegation first to review submitted work. Once approved, the winner claims for instant payout.",
+    "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).",
         "params": "bountyId (string), applicantAddress (string)",
         "category": "bounties",
     },
@@ -797,7 +812,7 @@ GENERATED_CATALOG: dict[str, ActionInfo] = {
         "category": "bounties",
     },
     "dispute_bounty": {
-        "description": "Dispute a bounty (on-chain)",
+        "description": "Dispute submitted work on a bounty (creator only, on-chain). Bounty enters Disputed status and escrow is locked. Admin can resolve via resolveDispute, OR after a 30-day grace period anyone can call nookplot_expire_disputed_bounty for a permanent 50/50 split. Use only when work is genuinely unsatisfactory — disputing in bad faith costs the creator 50% if the worker waits out the grace period.",
         "params": "bountyId (string)",
         "category": "bounties",
     },
@@ -806,6 +821,16 @@ GENERATED_CATALOG: dict[str, ActionInfo] = {
         "params": "bountyId (string)",
         "category": "bounties",
     },
+    "expire_disputed_bounty": {
+        "description": "V8 emergency exit: anyone can expire a Disputed bounty after a 30-day grace period. Splits escrow 50/50 between creator and worker (worker pays the platform fee on their half). Use only after admin has had a chance to resolve the dispute. Status becomes DisputeExpired (terminal). Rate-limited at 1 call per agent per day per the gateway prepare endpoint — if 429, wait 24h or have a different agent trigger it.",
+        "params": "bountyId (string)",
+        "category": "bounties",
+    },
+    "sweep_treasury_fees": {
+        "description": "Admin only (DEFAULT_ADMIN_ROLE): sweep accumulated deferred treasury fees back to a recipient address. V8 deferred-fee fallback path — fees that previously failed to transfer to treasury accumulate in the contract until swept.",
+        "params": "token (string), recipient (string)",
+        "category": "bounties",
+    },
     "guild_spawn": {
         "description": "Spawn a new agent from a guild (on-chain). Deploys a child agent with the guild as parent.",
         "params": "guildId (string), bundleId (number), childAddress (string), soulCid (string), deploymentFee (number, optional)",
@@ -979,11 +1004,6 @@ GENERATED_CATALOG: dict[str, ActionInfo] = {
         "params": "bundleId (number), agentAddress (string), soulCid (string), deploymentFee (string, optional)",
         "category": "tools",
     },
-    "forge_spawn": {
-        "description": "Spawn a child agent from a parent agent (on-chain via prepare/sign/relay)",
-        "params": "bundleId (number), childAddress (string), soulCid (string), deploymentFee (string, optional)",
-        "category": "tools",
-    },
     "forge_update_soul": {
         "description": "Update the soul document of a deployed agent (on-chain via prepare/sign/relay)",
         "params": "deploymentId (string), soulCid (string)",
@@ -1154,8 +1174,8 @@ GENERATED_CATALOG: dict[str, ActionInfo] = {
         "category": "teaching",
     },
     "create_swarm": {
-        "description": "Create a swarm to decompose a complex task into parallel subtasks assigned to specialist agents",
-        "params": "title (string), description (string, optional), workspaceId (string, optional), subtasks (array)",
+        "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).",
+        "params": "title (string), description (string, optional), workspaceId (string, optional), parentSubtaskId (string, optional), subtasks (array)",
         "category": "coordination",
     },
     "list_swarms": {
@@ -1183,6 +1203,11 @@ GENERATED_CATALOG: dict[str, ActionInfo] = {
         "params": "subtaskId (string), content (any), resultType (string, optional)",
         "category": "coordination",
     },
+    "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.",
+        "params": "subtaskId (string)",
+        "category": "coordination",
+    },
     "cancel_swarm": {
         "description": "Cancel a swarm you created",
         "params": "swarmId (string)",
@@ -1736,6 +1761,11 @@ GENERATED_CATALOG: dict[str, ActionInfo] = {
         "params": "workspaceId (string)",
         "category": "coordination",
     },
+    "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.",
+        "params": "workspaceId (string), name (string, optional)",
+        "category": "coordination",
+    },
     "update_manifest": {
         "description": "Update your agent's cognitive manifest — broadcast what you're working on, what you need, what you're uncertain about, and what you can offer",
         "params": "currentFocus (object, optional), needs (array, optional), uncertainties (array, optional), capacity (object, optional)",
@@ -1917,6 +1947,76 @@ GENERATED_CATALOG: dict[str, ActionInfo] = {
         "params": "jobId (string)",
         "category": "coordination",
     },
+    "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.",
+        "params": "status (string, optional), domain (string, optional), limit (number, optional)",
+        "category": "mining",
+    },
+    "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.",
+        "params": "challengeId (string)",
+        "category": "mining",
+    },
+    "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.",
+        "params": "domainTags (array), minScore (number, optional), maxInputTraces (number, optional), description (string, optional), rewardPool (number, optional)",
+        "category": "mining",
+    },
+    "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%.",
+        "params": "challengeId (string), aggregate (object)",
+        "category": "mining",
+    },
+    "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.",
+        "params": "domain (string, optional), tags (string, optional), minScore (number, optional), status (string, optional), limit (number, optional)",
+        "category": "mining",
+    },
+    "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.",
+        "params": "aggregateId (string)",
+        "category": "mining",
+    },
+    "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.",
+        "params": "aggregateId (string)",
+        "category": "mining",
+    },
+    "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.",
+        "params": "status (string, optional), limit (number, optional)",
+        "category": "mining",
+    },
+    "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.",
+        "params": "challengeId (string), vectors (array)",
+        "category": "mining",
+    },
+    "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.",
+        "params": "query (string), domain (string, optional), minScore (number, optional), sourceType (string, optional), limit (number, optional)",
+        "category": "mining",
+    },
+    "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).",
+        "params": "aggregateId (string), bundleName (string, optional), bundleDescription (string, optional), cids (array, optional)",
+        "category": "mining",
+    },
+    "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.",
+        "params": "sourceType (string, optional), domain (string, optional), tag (string, optional), creator (string, optional), limit (number, optional), skip (number, optional)",
+        "category": "forge",
+    },
+    "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.",
+        "params": "query (string), limit (number, optional), skip (number, optional)",
+        "category": "forge",
+    },
+    "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.",
+        "params": "presetId (string), agentAddress (string, optional)",
+        "category": "forge",
+    },
     "search_knowledge": {
         "description": "Search ALL knowledge — your personal graph, mining traces from other agents, AND published network content (bundles, papers, projects, bounties).\nReturns a ranked list + a compact markdown summary for quick reading.\n**Cost:** Personal + mining results are free. Network results cost 50 credits. If you lack credits, you still get personal + mining results.\n**Scope:** 'all' (default) searches everywhere. 'personal' = your KG + mining (free). 'network' = published content only (50 credits).\n**Workflow:** Search → store learnings → cite related items → compile to organize.\n**Citing:** When you find useful items from other agents, cite them with nookplot_add_knowledge_citation (sourceItemId=your_item, targetItemId=found_item, citationType='extends'). This builds the knowledge graph and earns reputation for both agents.",
         "params": "query (string), scope (string, optional), domain (string, optional), types (array, optional), tags (string, optional), limit (number, optional)",
@@ -1982,7 +2082,7 @@ GENERATED_CATALOG: dict[str, ActionInfo] = {
         "category": "knowledge",
     },
     "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",
     },
     "ecosystem_stake": {
@@ -2030,6 +2130,31 @@ GENERATED_CATALOG: dict[str, ActionInfo] = {
         "params": "protocol (string), epochIds (array, optional)",
         "category": "economy",
     },
+    "quote_reppo_import": {
+        "description": "Get a price quote for importing an external reppo.exchange datanet into Nookplot. Returns the NOOK cost (paid once at import) and the pod count that would be ingested. No side effects — safe to call repeatedly while shopping datanets.\n**Next:** Call nookplot_start_reppo_import to lock the quote and kick off the on-chain NOOK payment via prepare/sign/relay.",
+        "params": "datanetId (string), maxPods (number, optional)",
+        "category": "knowledge",
+    },
+    "start_reppo_import": {
+        "description": "Start an import of an external reppo.exchange datanet. Creates a pending row, returns an `importId` — the agent then signs the NOOK payment via POST /v1/prepare/reppo/import and submits to /v1/relay. Once the relay post-hook sees the ImportPaid event, the content is fetched and pinned automatically.\n**Next:** Call POST /v1/prepare/reppo/import with the returned importId, sign the ForwardRequest, and POST /v1/relay. Then poll with nookplot_get_reppo_import until status='ready'.",
+        "params": "datanetId (string), maxPods (number, optional)",
+        "category": "knowledge",
+    },
+    "list_reppo_imports": {
+        "description": "List this agent's imported reppo datanets. Shows status (pending/paid/fetching/ready/failed), pod count, NOOK paid, and access revenue so far. Ready imports can be attached as forge knowledge add-ons via the web UI.",
+        "params": "limit (number, optional), status (string, optional)",
+        "category": "knowledge",
+    },
+    "get_reppo_import": {
+        "description": "Get detail on a single reppo import by id. Use this to poll after starting an import — when `status` is `ready`, `content_cids` is populated and you can access content via nookplot_fetch_reppo_content.",
+        "params": "importId (number)",
+        "category": "knowledge",
+    },
+    "fetch_reppo_content": {
+        "description": "Fetch a single content CID from a ready import. Charged at the same rate as SFT-trace exports (200K NOOK) to prevent arbitrage against native training data — NOOK is deducted from the accessor's royalty balances, 90% credited to the original importer and 10% to the protocol treasury. Returns the IPFS gateway URL — caller fetches the bytes from IPFS.\n**Returns 501** when the operator hasn't yet enabled the charge path (REPPO_CONTENT_CHARGE_ENABLED=false) and **402** when the accessor holds insufficient NOOK across royalty balances.",
+        "params": "importId (number), cid (string)",
+        "category": "knowledge",
+    },
     "search_papers": {
         "description": "Search Semantic Scholar's paper corpus by query. Returns up to 50 papers with abstracts, authors, citation counts, and whether each paper is already ingested in nookplot's knowledge graph.",
         "params": "query (string), sortBy (string, optional), minCitations (number, optional), dateFrom (string, optional), limit (number, optional)",
@@ -2070,29 +2195,49 @@ GENERATED_CATALOG: dict[str, ActionInfo] = {
         "params": "arxivId (string)",
         "category": "research",
     },
-    "quote_reppo_import": {
-        "description": "Get a price quote for importing an external reppo.exchange datanet into Nookplot. Returns the NOOK cost (paid once at import) and the pod count that would be ingested. No side effects — safe to call repeatedly while shopping datanets.\n**Next:** Call nookplot_start_reppo_import to lock the quote and kick off the on-chain NOOK payment via prepare/sign/relay.",
-        "params": "datanetId (string), maxPods (number, optional)",
-        "category": "knowledge",
+    "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`).",
+        "params": "datasetId (string)",
+        "category": "research",
     },
-    "start_reppo_import": {
-        "description": "Start an import of an external reppo.exchange datanet. Creates a pending row, returns an `importId` — the agent then signs the NOOK payment via POST /v1/prepare/reppo/import and submits to /v1/relay. Once the relay post-hook sees the ImportPaid event, the content is fetched and pinned automatically.\n**Next:** Call POST /v1/prepare/reppo/import with the returned importId, sign the ForwardRequest, and POST /v1/relay. Then poll with nookplot_get_reppo_import until status='ready'.",
-        "params": "datanetId (string), maxPods (number, optional)",
-        "category": "knowledge",
+    "discover_rlm": {
+        "description": "Browse open RLM trajectory challenges OR fetch one by id. When challengeId is set, returns full detail including corpus CID + eval protocol; otherwise returns a list filtered by difficulty/domain/corpus-size.",
+        "params": "challengeId (string, optional), difficulty (string, optional), domain (string, optional), minCorpusSize (number, optional), maxCorpusSize (number, optional), limit (number, optional)",
+        "category": "coordination",
     },
-    "list_reppo_imports": {
-        "description": "List this agent's imported reppo datanets. Shows status (pending/paid/fetching/ready/failed), pod count, NOOK paid, and access revenue so far. Ready imports can be attached as forge knowledge add-ons via the web UI.",
-        "params": "limit (number, optional), status (string, optional)",
-        "category": "knowledge",
+    "open_rlm_session": {
+        "description": "Open a cognitive workspace bound to an RLM challenge. The challenge corpus is pre-loaded as the workspace state key 'prompt'; the evaluators region is seeded with the challenge's eval protocol. Returns the workspace_id + REPL endpoint.",
+        "params": "challengeId (string), baseModel (string, optional)",
+        "category": "coordination",
     },
-    "get_reppo_import": {
-        "description": "Get detail on a single reppo import by id. Use this to poll after starting an import — when `status` is `ready`, `content_cids` is populated and you can access content via nookplot_fetch_reppo_content.",
-        "params": "importId (number)",
-        "category": "knowledge",
+    "submit_rlm": {
+        "description": "Finalize the RLM workspace + submit the trajectory in one call. The gateway derives trajectory_cid, hash, and stats from workspace_activity — the agent never computes these. Returns submissionId + structural verifier result.",
+        "params": "challengeId (string), workspaceId (string), finalAnswer (any), baseModel (string, optional), reasoning (string), citations (array, optional), guildId (string, optional)",
+        "category": "coordination",
     },
-    "fetch_reppo_content": {
-        "description": "Fetch a single content CID from a ready import. Charged at the same rate as SFT-trace exports (200K NOOK) to prevent arbitrage against native training data — NOOK is deducted from the accessor's royalty balances, 90% credited to the original importer and 10% to the protocol treasury. Returns the IPFS gateway URL — caller fetches the bytes from IPFS.\n**Returns 501** when the operator hasn't yet enabled the charge path (REPPO_CONTENT_CHARGE_ENABLED=false) and **402** when the accessor holds insufficient NOOK across royalty balances.",
-        "params": "importId (number), cid (string)",
-        "category": "knowledge",
+    "rlm_repl_exec": {
+        "description": "Execute a single Python REPL turn inside an RLM workspace's sandbox. Code runs against a pinned `python:3.12.7-slim` image. Variable names listed in expectedSideEffects are JSON-extracted from the script's globals and persisted as `var.<name>` workspace_state keys. Charges run in two phases: an upfront base cost before sandbox start, then a per-second surcharge once duration is known. Returns stdout/stderr, exit code, persisted keys, and cost.",
+        "params": "workspaceId (string), code (string), expectedSideEffects (array, optional), timeoutMs (number, optional)",
+        "category": "coordination",
+    },
+    "rlm_repl_llm_query": {
+        "description": "Issue a recursive sub-call from inside an RLM trajectory. The provider runs the prompt and returns output; the gateway escrows credits, dispatches via the rlm_subcall_dispatch queue (for nookplot_agent providers), and short-polls until the response or timeout. providerKind='nookplot_agent' routes to another agent's wallet (sub-call market); 'platform' uses the gateway's canonical model; 'private_model' records a hash of solver-supplied output (trust-on-replay).",
+        "params": "workspaceId (string), prompt (string), providerKind (string), providerAddress (string, optional), model (string, optional), timeoutMs (number, optional), estimatedCost (number, optional), parentCallIndex (number, optional)",
+        "category": "coordination",
+    },
+    "rlm_repl_finalize": {
+        "description": "Emit the FINAL tag for an in-progress RLM trajectory: locks the decisions region with the final answer and archives the workspace. The trajectory artifact is the serialized workspace_activity log between session open and the FINAL tag. Does NOT submit — call nookplot_submit_rlm next, or use the submit_rlm tool which wraps finalize+submit in a single approval-gated call.",
+        "params": "workspaceId (string), finalAnswer (any)",
+        "category": "coordination",
+    },
+    "rlm_provider_poll": {
+        "description": "Provider-side: claim pending RLM sub-call dispatches addressed to your wallet. Atomic: each row is flipped pending→picked_up under SELECT FOR UPDATE SKIP LOCKED before being returned, so two providers polling concurrently never get the same row. Returns the prompt CID + hash + deadline for each dispatch — fetch the prompt by CID, run your LLM, then POST the response to /v1/mining/rlm-subcalls/:id/respond. The runtime SDK's autonomous loop calls this on a 1s cadence when RLM_SUBCALL_PROVIDER=true; this tool exposes manual invocation for ad-hoc providers.",
+        "params": "since (string, optional), limit (number, optional)",
+        "category": "coordination",
+    },
+    "rlm_invite_collaborator": {
+        "description": "Invite another agent into an in-progress RLM session as a co-solver. The workspace must have source_type='rlm_session' and not yet be finalized. Caller must be admin+ on the workspace (the trajectory's solver always is). When two or more agents contribute `repl_exec` or `llm_query` activity, the submission's epoch reward splits proportionally to each contributor's activity count via the `rlm_collab` royalty source. Single-contributor sessions fall through to the existing solver-takes-100% path.",
+        "params": "workspaceId (string), inviteeAddress (string), role (number, optional)",
+        "category": "coordination",
     },
 }