Independent by design · no pay-to-rank placements  · How we evaluate tools →
Anclum Submit
A

arhancanli/quantavane-mcp

Independent directory — not the official site. Details below come from the project's public repository.

An MCP server for open problems with exact checkers.

Before you install: command ownership unverified - shown for reference only · license MIT

First step (reference only, ownership unverified): uvx --from git+https://github.com/arhancanli/quantavane-mcp quantavane-mcp selftest

updated 2026-11-11
View on GitHub ↗Direct link · no redirect page

We have no copy-paste install command and no public remote endpoint, so we do not print a config. The step above is reference only, not a command we can vouch for. A made-up one is worse than none. How each client wires MCP up →

Star count
0 ★ · arhancanli/quantavane-mcp · read from the GitHub search API · (checked 2026-11-19 20:00:48)
Source
collected from the punkpeye/awesome-mcp-servers list · type: MCP server
Harvest history
first seen 2026-11-18 · last seen 2026-11-20 · seen 3× · listed by 3 sources
Score
score 300 · 3 sources · mcp
FAQ (answers come from our records)
Who is it for?
We filed it under these tags: MCP servers. The tags come from the entry itself, not a taxonomy we imposed.
Who maintains it?
repository arhancanli/quantavane-mcp;first catalogued 2026-11-18;last seen 2026-11-20。There is no official certification or quality rating here — we record sources and dates only.
README excerpt (English, untranslated) · Read the full README on GitHub →

# quantavane-mcp

Excerpted from the repository README (abridged)

An MCP server for open problems with exact checkers. It gives an AI agent, or a person at a terminal, Quantavane's
Open Problems Benchmark v2.1: 149,372 open problems, each with
its best known value, the source and date of that value, and an exact checker. 395 are single problems (Tao's
optimization constants, Ramsey numbers, cages, kissing numbers, sorting networks, Hadamard matrices, matrix
multiplication and more); 148,977 are cells of six families read from their keepers' tables (covering designs,
spherical codes, linear codes, covering arrays, constant weight codes and project scheduling). Two collections of our
own come with them: Quantavane Prestige 100, one hundred famous open problems (R(5,5), the kissing numbers from
dimension 5 to 31, 3 x 3 matrix multiplication, the Moore graph of degree 57 and more) with their keepers' records, and
the Quantavane Originals, 39 new problems of ours, each with its own checker, a written novelty check and our
first value. A candidate is scored by the benchmark's own checker, in a sandbox, offline, and the answer is a verdict
and an exact value, never an estimate.
run_claim_checks runs Quantavane's claim pipeline on an object: two separately written checkers must agree on its
exact value, red controls (copies of it broken so that they must fail) must be refused, and the value must beat the
keeper's value on file. It also answers from Quantavane's verified results (the open dataset), our independent replays
of certificates in the optimization constants repository, and gives citations for all of it.
Exact. Values are integers or fractions, compared exactly. The checkers are byte for byte those of the public
benchmark, and every reference certificate gets the verdict the benchmark's own runner gives (tested).
Offline. The server never opens a network connection. Its data is a snapshot whose commits and dates it reports.
Honest. A check that hits a limit says "no verdict", not "invalid". A value is a record only when it is certified
and beats the best known value. Best known values credited to other people say so, with their source.
## Five-minute start
You need uv; it fetches Python 3.10 or later if your system
lacks it. The first command downloads the server from GitHub (about 15 seconds); the rest take a second or two each.
sh
# 1. Check the install: every bundled file against its SHA-256, then reference certificates through the checkers
uvx --from git+https://github.com/arhancanli/quantavane-mcp quantavane-mcp selftest
# 2. Check a covering design C(17,7,4,6) with 17 blocks (ours, listed by the Covering Repository)
curl -sSLO https://raw.githubusercontent.com/arhancanli/quantavane-benchmark/main/refs/ours_covering_17-7-4-6.txt
uvx --from git+https://github.com/arhancanli/quantavane-mcp quantavane-mcp check covering-17-7-4-6 ours_covering_17-7-4-6.txt
# "verdict": "certified", "value": "17", "standing": "equals the best known"
# 3. Remove one block and check again: refused, with the 6-subset that is no longer covered
sed 1d ours_covering_17-7-4-6.txt > broken.txt
uvx --from git+https://github.com/arhancanli/quantavane-mcp quantavane-mcp check covering-17-7-4-6 broken.txt || true
Listed badge (optional)
Copy this line into the README if you want the listing mark. Optional, and it does not affect being listed.
[![Listed on Anclum](https://anclum.com/badge/listed.svg)](https://anclum.com/en/s/arhancanli-quantavane-mcp/)
Source
awesome · https://github.com/arhancanli/quantavane-mcp
Browse by field
MCP servers
Listed by
3 independent sources
added
today

More MCP servers

All 6,555 →

Filed under

Every tag opens the full list for that filter. Counts are the live catalogue figures.

Browse all fields →

← Back to index