Verifies numeric and Lean claims, searches mathematical literature, identifies constants and sequences, and checks theorem applicability.
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 Mathlas.
identify_constantIdentify a real number's closed form, airtight: PSLQ + closed-form search, every candidate independently re-evaluated to 50+ digits, honest UNIDENTIFIED otherwise. Use when you have a numeric constant and want to know what it IS. Args: value (decimal string ā give MANY digits, >16), optional basis (constant names like ['pi','e']).
identify_sequenceMatch an integer sequence against a LOCAL OEIS copy by EXACT contiguous term-match (no fuzzy scoring; honest UNDETERMINED if the data files are absent). Use when you have >= 4 integer terms and want the named sequence. Args: terms (list of integers), max_results (default 5).
search_existing_mathFind existing theorems/results for a problem from the mathlas 3.68M-doc index (dense + BM25 + RRF, fused with any live web_added findings). Use FIRST for any 'does known math solve this?' question; follow up with applicability_checklist on promising candidates. Args: query (problem/result description), k (default 10), optional corpus_dir (dataset parquets; omit to serve the prebuilt index or seed corpus), optional source_filter / source_weights to down-weight or exclude corpus sources, e.g. exclude web-mined docs when looking for canonical theorem statements.
search_formal_mathFind mathlib DECLARATIONS (name + type) via the public Loogle (pattern/type queries like '?a * ?b = ?b * ?a') and LeanSearch (natural-language queries) services ā the ONE tool that itself calls the web; honest 'service unavailable' if down (though a <=7-day-old cached response for the same query is then served, clearly labeled 'cached' with its age). Use when you need the formal Lean name/type of a result, e.g. before writing a verify_formal snippet. Args: query, k (default 10), backend ('auto'|'loogle'|'leansearch').
verify_numericAirtight check that a closed-form expression equals a numeric value: independent sympy re-evaluation at higher precision, verified only on >= 20 agreeing digits. Use BEFORE asserting any numeric identity. Args: value (decimal string), closed_form (e.g. 'pi**2/6', 'zeta(3)').
verify_formalRun the REAL Lean 4 kernel (NO LLM). Two modes: (1) pass `lean` (a full snippet, e.g. 'example : 2 + 2 = 4 := rfl') to typecheck it as-is; (2) pass `proof` to PROOF-CHECK ā `statement` must then be the Lean 4 proposition and `proof` YOUR proof (term or 'by ...' tactic block); mathlas builds `theorem _mathlas_check : <statement> := <proof>` and the kernel returns proof_status VERIFIED_PROOF / REFUTED (kernel_error carries the kernel's exact complaint ā use it to repair the proof and re-call) / UNDETERMINED (no toolchain / timeout / unresolvable import ā honest, never fake). sorry/admit are REJECTED. mathlas never writes proofs, only checks them. Find declaration names first with search_formal_math. Args: statement, lean?, proof?.
Archerkattri/mathlas MCP server supplies MCP tools for checking and investigating mathematical claims without embedding an LLM in the server. It can search a 3.68M-document math index, identify constants with PSLQ and closed-form matching, match integer sequences against a local OEIS copy, and independently re-evaluate numerical identities at high precision.
The server also supports formal mathematics workflows. Agents can search public Loogle and LeanSearch services for mathlib declaration names and types, then submit Lean snippets or proofs to the real Lean 4 kernel. Separate tools break a candidate theorem into preconditions and conclusions or create a structured needs-versus-guarantees scaffold. These outputs support the agent's judgment; the server does not decide whether a theorem's assumptions actually hold in the user's problem.
Most operations return candidates, verdicts, checklists, or scaffolds for the calling agent to interpret. search_existing_math uses dense retrieval, BM25, and reciprocal-rank fusion over the supplied corpus, while add_finding can add a result found through the agent's own web search. search_directive produces a web-search plan but does not perform the search itself.
identify_constant expects a decimal string with many digits and checks proposed forms through independent high-precision evaluation. verify_numeric only accepts an identity after at least 20 agreeing digits. conjecture_relation can look for unproved relations using PSLQ, continued fractions, and recurrence searches; its results are explicitly conjectural.
verify_formal either typechecks a complete Lean snippet or checks a supplied proposition and proof. It rejects sorry and admit, and reports verified, refuted, kernel-error, or undetermined outcomes according to the available toolchain and result.
The Archerkattri/mathlas MCP server can run over stdio with uvx mathlas-mcp, or after installation with python -m mathlas.server. The documented Claude Code registration command is:
Optional package extras provide the official MCP SDK, retrieval support for reading index data, and embedding dependencies. The server can fall back to a dependency-free stdio JSON-RPC implementation if the official SDK is unavailable.
Some capabilities depend on local resources. Sequence identification needs a local OEIS copy, and formal verification needs a Lean toolchain. If those resources are missing, the relevant tools report that the data or toolchain is unavailable rather than fabricating a result. The retrieval tool can use its prebuilt index or a supplied corpus directory.
Archerkattri/mathlas MCP server is best suited to agent workflows where every claim needs a provenance-aware search result, a deterministic calculation, or a formal verification status.
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/archerkattri-mathlas)<a href="https://allmcps.com/mcp/archerkattri-mathlas"><img src="https://allmcps.com/api/badge/archerkattri-mathlas?style=directory" alt="Mathlas on AllMCPs" /></a>