Humanities Helping Hands checker

121 machine-proven math facts, plus 49 real-world claims with machine-checked arithmetic

Should I use this

Quality & Safety

A
Description quality
100%
Schema completeness
100%
Naming quality
93%
Poisoning risk
100%
Permission match
100%
Protocol compliance
100%

Based on automated analysis of tool definitions and protocol compliance.

Context Cost

~495Tokens (tool definitions)
~908 BTypical response size
Minimal attention impact (0.39% of 128k context)

This is the approximate number of tokens consumed each time the server's tools are loaded into a model's context. Higher counts reduce the attention available for other tasks.

Install

One-Click Install

Add this to your `claude_desktop_config.json` file:

{
  "mcpServers": {
    "checker": {
      "url": "https://humanitieshelpinghands.com/mcp"
    }
  }
}

Remote endpoints

https://humanitieshelpinghands.com/mcpstreamable-http

What it can do

Tool inventory

Tools (3)

🟢 Read-only🟡 Write🔴 Delete⚪ Unknown
🟢lookup_fact(query, max_results, detail)

Search the library of machine-checked facts. Compact by default (claim start, label, receipt link); set detail true for the full wording.

Input Schema

{
  "type": "object",
  "properties": {
    "query": {
      "type": "string",
      "maxLength": 500,
      "description": "Words about the fact, e.g. \"root theorem\""
    },
    "max_results": {
      "type": "integer",
      "minimum": 1,
      "maximum": 25,
      "default": 10,
      "description": "How many matches, at most 25"
    },
    "detail": {
      "type": "boolean",
      "default": false,
      "description": "Full claim, what checked it and what is not proven"
    }
  },
  "required": [
    "query"
  ],
  "additionalProperties": false
}
🟢check_claim(text)

Find the claims in a text and check the ones plain code can: arithmetic (PROVEN or FALSIFIED), primes, unit conversions. A famous unsolved problem (P vs NP, the Riemann hypothesis) is OPEN. Anything else is NOT CHECKED, which never means false, with a next step.

Input Schema

{
  "type": "object",
  "properties": {
    "text": {
      "type": "string",
      "maxLength": 500,
      "description": "The sentence or answer to check, e.g. \"2+2=5\""
    }
  },
  "required": [
    "text"
  ],
  "additionalProperties": false
}
🟢search_attempts(query, max_results)

Search the list of past attempts at P vs NP. Rows are labeled SOURCED, GUESS or NOT TRACED. A match is a warning sign, never a verdict.

Input Schema

{
  "type": "object",
  "properties": {
    "query": {
      "type": "string",
      "maxLength": 500,
      "description": "Words about your idea, e.g. \"linear programming TSP\""
    },
    "max_results": {
      "type": "integer",
      "minimum": 1,
      "maximum": 25,
      "default": 10,
      "description": "How many matches, at most 25"
    }
  },
  "required": [
    "query"
  ],
  "additionalProperties": false
}

Community

Rate this Server

Evidence

Recent observations

verifiedversion not recorded3 tools