Neuro-symbolic agents with verified memory. MCP math tools, an algebra repair Skill, and an open challenge. Verify solutions, learn checked rules, and reuse.
# Add to your Claude Code skills
git clone https://github.com/1105216375-alt/resimindGuides for using ai agents skills like resimind.
Last scanned: 10/14/2026
{
"issues": [],
"status": "PASSED",
"scannedAt": "2026-10-14T09:19:28.670Z",
"npmAuditRan": true,
"pipAuditRan": true,
"promptInjectionRan": true
}See how resimind compares with popular alternatives.
resimind is an open-source ai agents skill for AI coding assistants such as Claude Code, Codex CLI, and ChatGPT, built by 1105216375-alt. Neuro-symbolic agents with verified memory. MCP math tools, an algebra repair Skill, and an open challenge. Verify solutions, learn checked rules, and reuse. It has 292 GitHub stars.
Yes. resimind passed SkillsLLM's automated security scan — a dependency vulnerability audit plus prompt-injection heuristics — with no high-severity issues. You can read the full report in the Security Report section on this page.
Clone the repository with "git clone https://github.com/1105216375-alt/resimind" and add it to your Claude Code skills directory (see the Installation section above).
resimind is primarily written in Python. It is open-source under 1105216375-alt on GitHub, so you can review or fork the full source.
Yes. SkillsLLM lists many other AI Agents skills you can browse and compare side by side. Open the AI Agents category from the badge at the top of this page, or use the Related Skills and comparison links further down to weigh resimind against similar tools.
No comments yet. Be the first to share your thoughts!
From $49 · 30 days · terms & refunds
⚠️ Third-Party Software Notice
This skill is third-party open-source software developed and hosted independently on GitHub. SkillsLLM is an informational directory and does not control or maintain the underlying repository.
Any security checks, ratings, or warnings displayed by SkillsLLM are automated and limited in scope. They do not constitute a security certification or guarantee that the software is safe, error-free, or free from malicious code, vulnerabilities, compromised dependencies, or prompt-injection risks.
Review the source code, permissions, dependencies, and configuration before installing or running any third-party skill. Use is at your own risk. To the maximum extent permitted by applicable law, SkillsLLM is not liable for losses arising from third-party software.
Automated security scan — not a certification.

Catch the error. Keep the insight. Give the next task a checked head start.
Run the demo · Connect MCP · Install the Skill · Take the challenge · 中文
Frontier roadmap and evidence · External theorem benchmark boundary
Latest on main (after v0.16.0): memory provenance, expiry and transfer auditing, reserved revision steps in the ChinaTravel integration, and an experimental external Lean template compiler. The latest same-model planning result and development rerun are published with their failures; neither establishes a planning success-rate gain. MiniF2F and LeanDojo scores are still pending.
ResiMind is an open-source neuro-symbolic Agent architecture that connects independent verification, residual-guided self-correction and reusable rule memory. Your model, rules or symbolic tools propose a step; domain checks decide what becomes a fact. Failed checks tell the next attempt what still needs fixing.
A checked solution can become a checked rule. Explicit learning extracts candidate rules from completed derivations, independently verifies admission, and rechecks each future application. Knowledge grows outside the model, without changing its weights. When local rules or tools suffice, the supported math routes run with zero model calls.
Formal memory can now compose checked conditions. The bounded Lean planner introduces an implication, applies a verified conditional lemma, and sends the resulting residual subgoal to another verified lemma or a local assumption. The whole typed plan is compiled again by Lean; structural matching never counts as proof. This is an experimental composition primitive, not a claim of MiniF2F or general theorem-proving leadership.
The core also runs bridge engineering, constrained optimization, customer support and open-ended planning with their own verifiers. Adaptive algebra, rule learning and the five MCP tools currently cover bounded rational polynomials. Core: Python 3.10+, no runtime dependencies. Optional MCP: Python 3.11+.
| What you want to do | Your entry point |
|---|---|
| Give an existing Agent exact algebra tools | MCP setup · Download MCPB |
| Teach an Agent a bounded verify-and-repair workflow | Repair Skill · Install guide |
| Build an Agent with your own checks | Architecture · Adapter contract |
| Inspect what has actually been measured | Evidence · Release validation |
Created and originally published by @1105216375-alt. Citation · Changelog
Evaluating tools for your Agent? Make this one catch a wrong answer first. Run the nine-call integration probe: reject → repair → learn → recall, including an unsupported-scope control. No model key. Machine-readable cases · Documentation index
With Python installed:
git clone https://github.com/1105216375-alt/resimind.git
cd resimind
python -m venv .venv
source .venv/bin/activate
python -m pip install .
python -m resimind demo --domain lifelong
On Windows PowerShell, activate with .venv\Scripts\Activate.ps1. Installation may download build tools. The demo runs offline, without an API key; both python -m resimind and the installed resimind command work outside the checkout.
The first demo solves two training problems, extracts a checked rule, saves and reloads frozen memory, and transfers that rule to new coefficients. It then solves a long expansion using a sparse certificate. The frozen memory stays unchanged throughout evaluation. No API calls are made.
Choose a different challenge. These commands run offline; the Lean example additionally requires an installed Lean 4.29.0 toolchain:
| Try | What the example makes visible | Command |
|---|---|---|
| Learning across episodes | Save and reload frozen memory, transfer a checked rule, and verify a long sparse expansion | python -m resimind demo --domain lifelong |
| Search and learning | Fit strategy preferences, extract checked schemas, and recheck only affected bridge cases | python -m resimind demo --domain search-learning |
| Goal progress | Skip a cosmetic rewrite, act on remaining expansion goals, and allow a useful step with a larger expression | python -m resimind demo --domain progress |
| Local scheduling | Reuse a useful rule, simplify before an expensive substitution, and skip model callbacks when local work suffices | python -m resimind demo --domain scheduling |
| Expression growth | Compare primitive expansion with bounded distribution and term collection on four quadratic factors | python -m resimind demo --domain growth-control |
| Lean proof feedback | A real unfinished Lean goal drives a new tactic, then a checked rule is reused | python -m resimind demo --domain lean |
| Adaptive reasoning | Reject a wrong step, change strategy, finish a proof and reuse its checked rule | python -m resimind demo --domain adaptive |
| Knowledge growth | Derive a rule, verify and store it, then reuse and recheck it on a new task | python -m resimind demo --domain knowledge-growth |
| General architecture extensions | Track dependent residual work, rank frozen strategies, and exact-check a reusable rule schema | python -m examples.general_architecture |
| Open-ended planning | Many valid answers; time, budget, and route constraints still apply | python -m resimind demo --domain planning |
| Customer support | A ¥259 refund proposal fails the configured ¥249 calculation | python -m resimind demo --domain customer-support |
| Mathematics | A lower objective is useless if the candidate violates a constraint; check an exact optimality certificate | python -m resimind demo |
| Bridge engineering | Balanced forces can still hide incompatible rotations at a shared pier | python -m resimind demo --domain bridge |
Add --json to inspect the audit. Connect DeepSeek when you want the model to compose its own plan.

| Capability | What actually executes |
|---|---|
| Residual-guided recovery | A failed check can trigger a smaller local task, a verified rule, a symbolic rewrite, or a checked checkpoint return. Work budgets stay bounded. |
| Verified memory | Independently admit candidate rules, persist and freeze the Python library, recheck on reload, and verify each new application. MCP memory is process-local. |
| Compact exact computation | Shared expressions and sparse rational certificates handle long expansions within explicit resource limits. |
| Optional proof feedback | Lean 4.29.0 checks generated Rat equalities; unfinished goals can guide the next proposal. Lean is separate from the MCP tools. |
| Residual proof composition | A bounded typed plan introduces conditions, applies verified conditional lemmas, solves residual subgoals, and is compiled as one Lean proof. |
The adaptive demo deliberately proposes a wrong expansion, rejects it, changes approach, completes a proof, and reuses its checked rule on a new-variable task. Its proposals are scripted; the verification, state transitions, admission and reuse really execute.
Run these in one process after installing the core (Bash/Zsh; see the JSON-lines guide for the request format):