A
arhancanli/quantavane-mcp
An MCP server for open problems with exact checkers.
更新 2026-11-11
在 GitHub 查看 ↗直链 · 无中转页
我们没有可直接复制的安装命令,也没有公开的远端端点,所以不出配置。上面那条命令仅供参考,不是我们能担保的可复制命令——编一条出来比不给更糟。 各客户端的接法 →
- ★ 数取值
- 0 ★ · arhancanli/quantavane-mcp · 取自 GitHub 搜索 API · (2026-11-19 20:00:48 核对)
- 来源明细
- 收录自 punkpeye/awesome-mcp-servers 榜单(我们从中收集的条目之一) · 条目类型:MCP 服务
- 收录与活跃
- 收录于 2026-11-18 · 最近见到 2026-11-20 · 共见到 3 次 · 被 3 个来源列出
- 评分构成
- 综合分 300 · 3 个来源 · mcp
常见问题(答案都来自我们的记录)
它适合谁 / 用来做什么?
我们把它归在这些标签下: MCP 服务。标签来自条目自身,不是我们强加的分类。
谁维护它、还在更新吗?
仓库
arhancanli/quantavane-mcp;我们收录于 2026-11-18;最近见到 2026-11-20。这里没有"官方认证"或"质量评级"——我们只记录来源与时间。README 原文(英文,未翻译) · 在 GitHub 读完整 README →
# quantavane-mcp
以下摘录自该仓库的 README(片段)
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
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
收录徽章(可选)
想把收录标记放进 README 就复制这行,可选,不影响收录。
[](https://anclum.com/zh/s/arhancanli-quantavane-mcp/)
- 来源
- awesome · https://github.com/arhancanli/quantavane-mcp
- 按领域浏览
- MCP 服务
- 收录来源
- 3 个独立来源
- 收录于
- 今天
更多 MCP 服务器
所属领域与标签
每个标签都能点进去看同类的全部条目。数字是当前库里的真实条数。