MCP tools for optimization, forecasting, simulation, risk analysis, graph algorithms, and probabilistic decision support.
Copy the AI prompt to install this server into Claude Code, Cursor, or another agent ā or use 1-click editor setup below.
This server is confirmed live ā we successfully called its tools/list endpoint directly (see the verified badge above). We haven't yet sandbox-tested the stdio install command below specifically, which is a separate, ongoing check.
š” Paste the JSON block into your client's configuration file under mcpServers, then restart the application.
Inspect callable tools, capabilities, and parameters exposed to AI agents by Oraclaw.
optimize_banditSelect the next option to try from 2+ variants that each have observed pull/reward history, balancing exploitation against exploration (UCB1, Thompson sampling, or epsilon-greedy). Use when you must pick one arm now from A/B test variants, ad/email/copy options, or ranked recommendations and have past trial counts. Returns the chosen arm plus exploitation score, exploration bonus, and a regret estimate. For per-call context features use optimize_contextual; for continuous parameters use optimize_cmaes.
optimize_contextualSelect the best option given a numeric context/feature vector, using a LinUCB contextual bandit that learns per-context preferences from optional history. Use when the best choice changes with situational features that vary call-to-call (user/segment attributes, time of day, current regime). Returns the chosen arm with its LinUCB expected reward and confidence width. If you have no per-call features, use optimize_bandit.
optimize_cmaes[Premium] Optimize N continuous parameters against a weighted-sum objective using CMA-ES, suited to non-convex/noisy/gradient-free landscapes. Use for hyperparameter search, simulator calibration, or control-policy tuning where you supply per-dimension objective weights. Returns the best parameter vector, its objective value, iteration/evaluation counts, and a converged flag; stochastic init means repeated runs may differ. Use optimize_evolve for discrete spaces and solve_constraints for linear/MIP constraints. Premium: needs an ORACLAW_API_KEY OR a per-call x402 payment (no signup).
solve_constraints[Premium] Solve a linear / mixed-integer / quadratic program with the HiGHS solver and return a provably optimal assignment. Use when your objective and constraints are linear (or quadratic) over named continuous/integer/binary variables: budget allocation, supply or capacity planning with integer counts, allocation with hard caps. Returns solver status (optimal/infeasible/unbounded), the objective value, and the solved value per variable. Use optimize_cmaes for black-box objectives and solve_schedule for task-to-slot assignment. Premium: needs an ORACLAW_API_KEY OR a per-call x402 payment (no signup).
solve_scheduleAssign tasks to time slots to maximize total score by matching each task's energy requirement to a slot's energy level (and respecting duration). Use for deep-work blocking, shift or session planning, or any task-to-slot fit where high-energy work should land in high-energy slots. Returns the assignments, any unassigned task IDs, and a total score. For arbitrary linear constraints use solve_constraints; for routing use plan_pathfind.
analyze_graph[Premium] Compute structural metrics of a directed weighted graph: PageRank centrality, Louvain community clusters, an optional critical path between two given nodes, and bottleneck nodes. Use to find the most influential nodes, cluster a dependency/knowledge graph, or locate chokepoints in supply or process networks. Returns per-node PageRank and community index, cluster summaries, the critical path with its weight, and bottlenecks. For a single source-to-goal route, use plan_pathfind (free). Premium: needs an ORACLAW_API_KEY OR a per-call x402 payment (no signup).
Whatsonyourmind/oraclaw MCP server gives an MCP-compatible agent access to numerical methods for decision support. The supplied catalog covers 19 algorithms and 28 MCP tools across optimization, probability, simulation, forecasting, graph analysis, scheduling, and risk assessment. Tool calls return structured results such as selected options, objective values, confidence intervals, assignments, paths, anomaly details, or model metrics.
Use it when the input can be represented as numeric observations, variables, graph edges, time-series values, probabilities, or explicit constraints. Examples include choosing an A/B test arm, allocating a budget under caps, estimating uncertainty, combining forecasts, finding a route, or matching tasks to time slots.
The agent selects an MCP tool and supplies the relevant data for that operation. Bandit tools choose among alternatives using UCB1, Thompson sampling, epsilon-greedy, or LinUCB. Continuous black-box objectives can be handled with CMA-ES, while discrete or mixed search spaces can use a genetic algorithm. Linear, mixed-integer, and quadratic programs are handled by the HiGHS-based constraint solver.
Other tools operate on supplied datasets rather than external services. Forecasting accepts an evenly spaced numeric series and uses ARIMA or Holt-Winters. Risk analysis calculates VaR and Conditional VaR from historical returns and portfolio weights. Graph analysis accepts a directed weighted graph and can calculate PageRank, communities, bottlenecks, and an optional critical path. Monte Carlo simulation samples from one of six supported distributions and returns summary statistics and a histogram.
Some operations are stochastic, including Monte Carlo sampling and evolutionary optimization, so repeated calls may produce different results. Forecasting and anomaly detection also have minimum data requirements described by their respective tool behavior.
The README shows a local stdio configuration using the npm package @oraclaw/mcp-server:
Whatsonyourmind/oraclaw MCP server can therefore be started through npx without a separate hosted endpoint in the client configuration. The README demonstrates this setup with Claude Desktop. Free tools do not require an API key according to the catalog. Premium tools accept ORACLAW_API_KEY; the tool descriptions also identify per-call x402 payment as an alternative for those operations.
The repository additionally documents a hosted REST API and separate npm SDK packages, but those are different access methods from the MCP server setup above.
optimize_bandit and optimize_contextual.optimize_cmaes and optimize_evolve.solve_constraints, or match tasks to energy-rated time slots with solve_schedule.plan_pathfind, or inspect graph structure with analyze_graph.Premium access applies to CMA-ES optimization, constraint solving, graph analysis, risk analysis, forecasting, and anomaly detection. A key or x402 payment is needed for those tools. The free REST tier is documented as allowing 25 calls per day per IP, but that limit is stated for the API rather than explicitly for local MCP execution.
Tool selection depends on the shape of the problem. Use optimize_bandit without per-call features, optimize_contextual when context changes between calls, and plan_pathfind for a single route rather than graph centrality. predict_forecast requires at least 20 observations for ARIMA and at least twice the seasonal length for Holt-Winters. Monte Carlo calls are capped at 2,000 iterations. Results should be checked against the supplied data and objective definition, particularly for stochastic algorithms and model-based forecasts.
Factual signals from GitHub, npm, and our automated checks ā not a rating.
No reviews yet ā be the first to share how this listing worked for you.
Showcase your server listing on GitHub or your project documentation. Embed this dynamic SVG badge to highlight official listing status and live engagement.
[](https://allmcps.com/mcp/whatsonyourmind-oraclaw)<a href="https://allmcps.com/mcp/whatsonyourmind-oraclaw"><img src="https://allmcps.com/api/badge/whatsonyourmind-oraclaw?style=directory" alt="Oraclaw on AllMCPs" /></a>