{"name":"io.github.Whatsonyourmind/oraclaw","slug":"whatsonyourmind-oraclaw","title":null,"description":"Decision intelligence MCP — 17 tools (optimize, simulate, predict, score, graph). Sub-25ms.","url":"https://mcp.market/server/whatsonyourmind-oraclaw","rating":null,"grade":"B","score":80,"certified":false,"status":"active","category":"other","tags":[],"presence":{"score":34,"stars":13,"forks":2,"downloads_week":47,"last_push_at":"2026-09-25T03:43:22.000Z","license":"MIT"},"uptime":null,"claimed":false,"transport":"npm","callable_via_gateway":false,"default_price_micros":0,"repository":"https://github.com/Whatsonyourmind/oraclaw","website":null,"version":"1.5.1","remotes":[],"packages":[{"registryType":"npm","identifier":"@oraclaw/mcp-server","version":"1.5.1","transport":{"type":"stdio"},"environmentVariables":[{"description":"Optional API key for premium tools (CMA-ES, LP/MIP solver, graph analytics, risk VaR/CVaR, forecasting, anomaly detection). Free tier (11 tools) works without it.","isSecret":true,"name":"ORACLAW_API_KEY"}]}],"tools":[{"name":"analyze_graph","description":"[Premium] Compute structural metrics of a directed weighted graph: PageRank centrality, Louvain community clusters,","write_action":false,"price_micros":0,"input_schema":null},{"name":"analyze_risk","description":"[Premium] Compute portfolio Value-at-Risk and Conditional VaR (Expected Shortfall) from a historical [asset][time]","write_action":false,"price_micros":0,"input_schema":null},{"name":"detect_anomaly","description":"[Premium] Flag outlier points in a numeric series using a Z-score test (parametric, assumes near-normal) or IQR test","write_action":false,"price_micros":0,"input_schema":null},{"name":"optimize_bandit","description":"Select the next option to try from 2+ variants that each have observed pull/reward history, balancing exploitation","write_action":false,"price_micros":0,"input_schema":null},{"name":"optimize_cmaes","description":"[Premium] Optimize N continuous parameters against a weighted-sum objective using CMA-ES, suited to","write_action":false,"price_micros":0,"input_schema":null},{"name":"optimize_contextual","description":"Select the best option given a numeric context/feature vector, using a LinUCB contextual bandit that learns","write_action":false,"price_micros":0,"input_schema":null},{"name":"optimize_evolve","description":"Run a genetic algorithm over a fixed-length gene vector (binary, integer, real, or permutation bounds) against a","write_action":true,"price_micros":0,"input_schema":null},{"name":"plan_pathfind","description":"Find the shortest path (or k-shortest paths) between a start and end node in a weighted directed graph using A* with","write_action":false,"price_micros":0,"input_schema":null},{"name":"predict_bayesian","description":"Update a prior probability with weighted evidence signals using a Beta posterior (the prior seeds Beta(prior*10,","write_action":true,"price_micros":0,"input_schema":null},{"name":"predict_ensemble","description":"Combine 2+ model point predictions into one consensus using weighted voting, stacking, or Bayesian model averaging,","write_action":false,"price_micros":0,"input_schema":null},{"name":"predict_forecast","description":"[Premium] Forecast the next N values of one evenly-spaced numeric time series using ARIMA (non-seasonal trend) or","write_action":false,"price_micros":0,"input_schema":null},{"name":"score_calibration","description":"Measure how well a set of probability predictions matched observed binary outcomes, returning the Brier score and log","write_action":false,"price_micros":0,"input_schema":null},{"name":"score_convergence","description":"Score how strongly multiple independent sources agree on a single event's probability, using Hellinger-distance","write_action":false,"price_micros":0,"input_schema":null},{"name":"simulate_montecarlo","description":"Draw N samples from one parametric distribution (normal, lognormal, uniform, triangular, beta, or exponential) and","write_action":false,"price_micros":0,"input_schema":null},{"name":"simulate_scenario","description":"Compare named what-if scenarios against a base case where the outcome metric is the sum of the input variables, and","write_action":false,"price_micros":0,"input_schema":null},{"name":"solve_constraints","description":"[Premium] Solve a linear / mixed-integer / quadratic program with the HiGHS solver and return a provably optimal","write_action":false,"price_micros":0,"input_schema":null},{"name":"solve_schedule","description":"Assign tasks to time slots to maximize total score by matching each task's energy requirement to a slot's energy","write_action":false,"price_micros":0,"input_schema":null}],"scan":{"score":80,"grade":"B","scanned_at":"2026-09-26T16:36:38.082Z","report":{"scannerVersion":"0.1.9","scannedAt":"2026-09-26T16:36:38.034Z","components":{"code":{"score":25,"max":25,"notes":["3 source files scanned"]},"reliability":{"score":-1,"max":20,"notes":["no gateway calls yet and no remote to probe"]},"poisoning":{"score":-1,"max":15,"notes":["tools not inspected (local package is not executed); not counted"]},"auth":{"score":6,"max":15,"notes":["static API keys via environment variables"]},"maintenance":{"score":15,"max":15,"notes":["last push 2 days ago"]},"identity":{"score":6,"max":10,"notes":["registry namespace matches repository owner"]}},"findings":[],"inputs":{"packages":[{"registryType":"npm","identifier":"@oraclaw/mcp-server","version":"1.5.1","found":true,"license":"MIT","hasInstallScripts":false,"dependencyCount":1,"publishedAt":"2026-06-23T15:06:13.668Z","repositoryUrl":"git+https://github.com/Whatsonyourmind/oraclaw.git","weeklyDownloads":47}],"repo":{"found":true,"owner":"Whatsonyourmind","repo":"oraclaw","archived":false,"pushedAt":"2026-09-25T03:43:22Z","stars":13,"forks":2,"openIssues":20,"ownerType":"User","ownerAvatarUrl":"https://avatars.githubusercontent.com/u/248369826?v=4","ownerCreatedAt":"2025-12-07T23:39:12Z","license":"MIT"},"icon":{"url":null,"source":"none"},"presence":{"stars":13,"forks":2,"downloadsWeek":47,"license":"MIT","lastPushAt":"2026-09-25T03:43:22.000Z","score":34}}}},"grade_history":[],"reviews":[]}