{"id":"com.scorecompute/scorecompute","slug":"com-scorecompute-scorecompute","title":"ScoreCompute","description":"38 MCP tools: Rust computation, Discovery, composition, counterexample scans and signed checks.","version":"0.17.1","publisher":{"kind":"domain","id":"scorecompute.com","label":"scorecompute.com","url":"https://scorecompute.com"},"website":"https://scorecompute.com/","repository":"","remotes":[{"type":"streamable-http","url":"https://scorecompute.com/mcp"}],"packages":[],"published":"2026-10-06","updated":"2026-10-06","status":"online","auth":"","latency_ms":1567,"checked":"2026-11-19","uptime":100,"checks":3,"tools":[{"name":"simulate_pi","title":"Monte Carlo estimate of π (CPU/CUDA)","description":"Estimate pi with seeded Monte Carlo and a 95% Wilson interval; up to 5 million samples. CPU or optional CUDA. Other direct scientific engines run on CPU.","read_only":true},{"name":"optimize_tasks","title":"Select tasks within a time budget (exact)","description":"Exactly maximize value for up to 32 independent, indivisible tasks within an integer-minute budget. Each task is selected at most once; no prerequisites or shared resources.","read_only":true},{"name":"verify_shadows","title":"Check shadows against the Sun position","description":"Check measured shadows using NOAA solar position, a ground-plane homography from 4–16 controls and Monte Carlo uncertainty. Returns conditional consistency, never image authenticity.","read_only":true},{"name":"check_ephemeris","title":"Check a Sun or Moon position","description":"Check a claimed Sun (soleil) or Moon (lune) position for UTC time/location using NOAA/Meeus approximations and lunar parallax. Returns model-conditional angular consistency and lunar phase.","read_only":true},{"name":"audit_statistics","title":"GRIM/GRIMMER check of reported statistics","description":"Apply necessary GRIM/GRIMMER checks to rounded means and sample deviations of bounded integer observations. Passing does not prove a dataset exists; inconsistency does not establish fraud.","read_only":true},{"name":"analyze_kinematics","title":"Minimum speed from angular motion","description":"Convert angular speed and candidate distances to minimum transverse speeds; check a claimed speed-distance pair. Distance hypotheses are supplied, not measured; no object-origin conclusion.","read_only":true},{"name":"check_shadow_track","title":"Check shadow rotation over time","description":"Compare 4–120 measured minute/azimuth pairs with solar motion: residuals, slope, direction and time-lapse speed. Supply measurements, not video. Results are model-conditional consistency findings.","read_only":true},{"name":"solve_equilibrium","title":"Kuhn poker equilibrium (CFR+)","description":"Solve Kuhn poker with CFR+ self-play, measure exploitability with pure best responses and compare the game value with -1/18. Illustrative game theory, not gambling advice.","read_only":true},{"name":"analyze_chess_game","title":"Compare chess moves with Stockfish","description":"Compare 4–40 supplied FEN positions and played SAN/UCI moves with Stockfish: first-choice agreement and centipawn loss. Entire analysis has a 25-second deadline; no cheating verdict.","read_only":true},{"name":"screen_wash_trading","title":"Screen trades for recycled volume","description":"Screen a supplied trade series for repeated volume at nearly equal prices within a declared time window. Return recycled-volume ratio and cycles; a pattern does not prove wash trading.","read_only":true},{"name":"simulate_plan","title":"Probability a plan meets its deadline","description":"Estimate deadline success, mean duration and empirical p95 for up to 32 integer-minute tasks under independent bounded uniform duration variations. Seeded CPU sampling; not a real-world forecast guarantee.","read_only":true},{"name":"route_optimizer","title":"Order points into a shortest tour","description":"Order 2–256 points from index 0 using planar or spherical kilometre distances. Exact only after completed Held–Karp search (at most 13 points); otherwise bounded heuristics. Returns every leg and stop reason. No roads or traffic.","read_only":true},{"name":"forge_route_policy","title":"Generate experimental route rules","description":"Train route-score ASTs on 1–8 supplied cases: at most 64 attempts and 31 nodes; stop between trials after 25s. Select converged candidates using training quality plus logical-fuel cost, a work proxy rather than CPU time. No held-out validation, arbitrary code or automatic promotion.","read_only":true},{"name":"run_route_policy","title":"Run one experimental route rule","description":"Execute a supplied bounded score AST on 2–128 Euclidean-km points with depot 0 and 2-opt. Validates the closed tour; exact=false. No retraining, external effects or promotion. Hashes identify programs, not independent validation.","read_only":true},{"name":"plan_golden_hour","title":"Golden and blue hour windows","description":"Compute geometric golden [-4,+6°] and blue [-6,-4°] windows for one UTC day, 1900–2100. Sunrise at -0.833° is a separate convention. No refraction, terrain or weather. Numerical tolerance is not astronomical accuracy; oracle validation covers reference dates only. Shared solar models are not independent corroboration.","read_only":true},{"name":"triangulate_tracks","title":"3D position from several observers","description":"Fit position/velocity from 2–4 supplied azimuth/elevation tracks using constant velocity in spherical ECEF and declared angular noise/clocks. Reports fit status and conditional local uncertainty; no object identification or calibrated accuracy.","read_only":true},{"name":"plan_observation","title":"Choose the most informative observation","description":"Fit original tracks, then rank 1–64 supplied future series by local-linear uncertainty and declared cost. Assumes constant velocity, independent new errors and exact stations/clocks. Candidate angles and client baselines are forbidden. Prediction is not an acquired measurement or visibility proof.","read_only":true},{"name":"assimilate_observation","title":"Refit with a new observation series","description":"Refit original tracks plus one supplied new angular series, each counted once; compute the baseline natively. Declare synthetic/measured origin (unverified). Conditional uncertainty may worsen; forecast angles are not acquired evidence.","read_only":true},{"name":"stress_test_observation","title":"Search for a reconstruction counterexample","description":"Refit 1–32 declared hypothetical angular/clock perturbations to challenge reconstruction stability. Explicit hypothetical acknowledgement required. Non-convergence is inconclusive; none_found covers examined cases only. No new observations.","read_only":true},{"name":"improve_schedule","title":"Compare permitted schedule changes","description":"Compare up to 32 declared deadline/optional-task changes under independent-uniform durations; preserve required tasks. Search bounds select one finalist for separately seeded confirmation, without retries. Conditional on the model, not delivery reliability.","read_only":true},{"name":"list_capabilities","title":"List tool contracts and units","description":"Read native contracts, themes, units, assumptions, backends and approved composition families; optional exact theme filter. tools/list discovers direct MCP tools; list_composition_capabilities adds planner bindings.","read_only":true},{"name":"plan_mission","title":"Preview a robust scheduling mission (no run)","description":"Preview robust scheduling without running engines: validate assumptions/permissions and return up to three candidate budgets (nominal, 10% reserve, 20% reserve), compute limits or blockers. No arbitrary tools or external code.","read_only":true},{"name":"build_robust_plan","title":"Robust task plan in one call","description":"Compare up to three task selections; choose highest examined value meeting the target under simultaneous 95% sampling bounds or an exact bound. Independent-uniform durations; can return inconclusive/blocked. Streams native events.","read_only":true},{"name":"list_composition_capabilities","title":"List composable capabilities","description":"Read implemented versioned contracts, native capabilities, approved adapters and planning examples. Unsupported unit/model facts expose missing adapters. No engines run; direct tools remain independently callable.","read_only":true},{"name":"compose_capabilities","title":"Plan a capability chain","description":"Plan from declared available/goal contracts within tool, locality and search bounds. Returns dependencies, blockers and existing-tool bindings. Cost counts graph steps, not speed, price or quality. Runs no engines; execution validates arguments.","read_only":true},{"name":"execute_composition","title":"Run an approved capability chain","description":"Run approved task-selection/route-to-duration risk chains only. Supply engine inputs and explicit uncertainty; route speed is 1–150 km/h. Returns native receipts and 95% sampling bounds. Completed means assessed, not safe. Other paths use advertised bindings.","read_only":true},{"name":"network_status","title":"Contributor network status","description":"Read contributor availability, offered CPU/GPU resources and verified throughput by workload. Hardware is self-reported; per-GPU VRAM is not pooled. Mixed-workload samples do not measure comparative speed.","read_only":true},{"name":"submit_network_job","title":"Queue a contributor network job","description":"Queue fixed public synthetic pi (CPU/CUDA) or one of three discrete schedule scenarios (CPU only). No private data/custom code. Returns a ticket; poll get_network_job. Coordinator recomputes every accepted shard; no net speedup claim. Jobs may expire.","read_only":false},{"name":"get_network_job","title":"Read a contributor network job","description":"Read a public contributor ticket/progress and verified pi or discrete synthetic schedule result. Schedule results include fixed-sample Wilson95 bounds. Worker/verification/wall times are separate; model probabilities are not delivery guarantees.","read_only":true},{"name":"check_arithmetic","title":"Check an arithmetic claim exactly","description":"Check an explicit arithmetic claim. Checked i128 rationals give exact verdicts when expression, claim and tolerances are representable. Unsupported functions or overflow return an estimate with an undetermined verdict. Includes a versioned integrity digest; no checks of units or model meaning.","read_only":true},{"name":"compute_orbit","title":"Ideal Keplerian orbit","description":"Compute an ideal two-body Keplerian orbit around one solar mass. Time starts at periapsis; distances use AU and time uses days. This model is not a real celestial ephemeris.","read_only":true},{"name":"hear_the_shape","title":"Vibration modes of a polygonal drum","description":"Compute 1–12 ideal fixed/free membrane modes for a simple polygon in metres using bounded P1 finite elements. Return upper bounds, extrapolated estimates and optional frequencies/shapes. Finite spectral agreement does not prove isospectrality; no damping. CPU, direct-only; no planner binding.","read_only":true},{"name":"kepler_stability","title":"Sun–Jupiter orbit sensitivity map","description":"Survey up to 512 initial orbits in a planar circular Sun–Jupiter model; at most 4 million reserved CPU steps. Return finite-window sensitivity, actual durations, sampled Jacobi drift and explicit stops. Bands do not prove chaos or stability; radial overlap is not an encounter. Direct-only.","read_only":true},{"name":"propagate_uncertainty","title":"Measurement uncertainty: GUM and Monte Carlo","description":"Check dimensions, then compare first-order GUM with seeded fixed-sample Monte Carlo for an explicit model of 1–16 inputs. Return uncertainty budgets, coverage intervals and convergence/linearization findings. Conditional on supplied distributions; no affine units. CPU, direct-only; no planner binding.","read_only":true},{"name":"scan_counterexample","title":"Scan a grid for a counterexample","description":"Bounded deterministic float64 scan of a scalar <= or >= claim over a declared grid of 1–6 variables. Reports numerical witnesses, undefined and uncertain evaluations, and the exact stop reason. A propagated screening guard rejects near-boundary candidates; it is not a certified interval or formal proof. An inconclusive outcome preserves unresolved sampled cells; absence of a witness does not estab","read_only":true},{"name":"shape_the_sound","title":"Design a drum for a chord","description":"Kac's question in reverse: design a polygonal drumhead whose lowest tones play requested frequency ratios (a fifth, a triad, a pentatonic scale), each accepted within ±tolerance_cents. proven_impossible is returned only when proven theorems exclude every ratio combination inside those tolerance windows for a connected uniform membrane with a fixed edge: simple fundamental, f2/f1 ≤ j11/j01 ≈ 1.5933","read_only":true},{"name":"tour_profile","title":"Geometric profile of a point set","description":"Locally normalized geometric descriptors of 3–256 planar points: distances, nearest-neighbour isolation, centroid spread, PCA collinearity and histogram. The principal-axis mirror residual is null for isotropic noncoincident covariance, whose axes are undetermined. Rounded fingerprints are descriptive, not proofs of equivalence or method benefit.","read_only":true},{"name":"verify_claim","title":"Verify a claim with a signed receipt","description":"Verify a structured arithmetic, shadow, ephemeris, statistics or route claim with a bounded native engine. Returns a model-scoped verdict and portable Ed25519 server receipt; never truth, authenticity or fraud certification. Route claims explicitly distinguish optimality from a supplied tour total. Native failures return no scientific verdict. Parameters and examples: /verify and /docs/mcp/.","read_only":true}],"server_info":{"name":"scorecompute","version":"0.17.1"},"category":"travel","tags":["hr","legal","audio-voice"],"kind":"remote","source":"registry","submitted":{},"first_party":true,"domain_rank":null,"score":100,"indexable":true,"first_seen":"2026-09-30","stars":0,"badges":[],"sponsor":null,"page":"https://agentsindex.org/agents/com-scorecompute-scorecompute/"}