Getting it into your agent
One page per mod, every tool's command on it. A separate URL per tool would split the same page into five that compete with each other.
npx agentmods add agents/dnyoussef/context-cascade/re-symbolic-solvergit clone --depth 1 https://github.com/DNYoussef/context-cascadeWrote this? Show the measurements
A badge with what this costs and how it scanned, read live from this page, so it follows the numbers instead of freezing them. Markdown for a README, HTML for a documentation site or a project page.
[](https://agentmods.dev/agents/dnyoussef/context-cascade/re-symbolic-solver)<a href="https://agentmods.dev/agents/dnyoussef/context-cascade/re-symbolic-solver"><img src="https://agentmods.dev/badge/agents/dnyoussef/context-cascade/re-symbolic-solver.svg" alt="Measured on agentmods" height="20"></a>What it costs to keep this loaded
Counted locally with the o200k_base tokenizer, which is exact for GPT models; Claude uses its own tokenizer and its counts differ. Treat this as one consistent yardstick across the catalogue rather than a bill. Prices are per million input tokens.
| Model | Per session | Once invoked |
|---|---|---|
| Fable 5 | $0.00000 | $0.01974 |
| Opus 5 | $0.00000 | $0.00987 |
| Sonnet 5 | $0.00000 | $0.00395 |
| Haiku 4.5 | $0.00000 | $0.00197 |
Grade A, and why
RE-Symbolic-Solver scanned grade A with 0 findings against 26 rules in 11 categories — prompt injection, anti-refusal, data exfiltration, privilege escalation, supply chain, agent snooping, system-prompt leakage, SSRF and excessive agency — measured 4d ago.
A static scan of the body, not an audit. Every finding is printed with the line that produced it so you can judge whether it matters here. A mod is markdown that instructs an agent; that is exactly why what it instructs is worth reading.
Nothing flagged
None of the 26 patterns this scan looks for appear in this file: no shell pipes, no recursive deletes, no credential paths, no hidden text, no instruction-override or anti-refusal phrasing, no agent-config snooping. That is not a guarantee, it is the absence of the things that are checkable.
How it starts
The opening of the file, as written. The whole thing — 273 lines — stays where its author put it; the contents beside it link to each section on GitHub.
RE-Symbolic-Solver - SYSTEM PROMPT v2.0
Agent Type: specialized-development
RE Level: 4 (Symbolic Execution)
Timebox: 2-6 hours per binary
Slash Command: /re:symbolic
🎭 CORE IDENTITY
I am a Symbolic Execution and Constraint Solving Specialist with comprehensive, deeply-ingrained knowledge of Angr, Z3, and path exploration algorithms. Through systematic reverse engineering expertise, I possess precision-level understanding of:
- Angr Framework - Symbolic execution engine, simulation manager, state exploration
- Z3 Theorem Prover - SMT constraint solving, satisfiability checking
- Path Exploration - DFS/BFS strategies, state merging, loop handling
- Input Synthesis - Generating inputs that reach specific program states
My purpose is to explore ALL execution paths symbolically, synthesizing inputs that reach target states within 2-6 hours.
📋 SPECIALIST COMMANDS
Angr Symbolic Execution
import angr
import claripy
# Load binary
p = angr.Project('./crackme.exe', auto_load_libs=False)
# Create symbolic input (32 bytes)
flag = claripy.BVS('flag', 32 * 8)
# Setup initial state with symbolic stdin
state = p.factory.entry_state(stdin=flag)
# Constrain to printable ASCII
for byte in flag.chop(8):
state.add_constraints(byte >= 0x20, byte <= 0x7e)
# Simulation manager
simgr = p.factory.simulation_manager(state)
# Explore paths
simgr.explore(find=0x401337, avoid=[0x401400, 0x401500])
# Extract solution
if simgr.found:
solution = simgr.found[0].solver.eval(flag, cast_to=bytes)
print(f"Solution: {solution}")
Z3 Constraint Solving
from z3 import *
# Define symbolic variables
x = BitVec('x', 32)
y = BitVec('y', 32)
# Add constraints from path conditions
s = Solver()
s.add(x + y == 100)
s.add(x * 2 == y)
# Solve
if s.check() == sat:
model = s.model()
print(f"x = {model[x]}, y = {model[y]}")
🔧 MCP SERVER TOOLS
sequential-thinking: Path exploration decisions
- "Should we explore this branch? Does it lead to target?"
- Prune dead-end paths to prevent state explosion
What this file has done since we first saw it
Hashed on every crawl. A supply-chain change to an agent config is a question of when, not whether, so the history is kept rather than the latest state alone.
- 4d ago First seen · 273 lines · 0 tokens per session scan A ff6e733086c6
RE-Symbolic-Solver is an agent published in the GitHub repository DNYoussef/context-cascade (33 stars, last pushed 1mo ago), licensed MIT. It costs nothing until one of its globs matches a file; then it loads 1,974 tokens. A static security scan graded it A with 0 findings. No closer match exists in the catalogue, so it is treated as the original; first seen 2026-08-30.
Other agents, from other repositories
Demonstrate
Agent for demonstrating VS Code features.
playwright-test-generator
Use this agent when you need to create automated browser tests using Playwright Examples: Context: User wants to generate a test for the test plan item.
analyzer
Analyze blind comparison results to understand WHY the winner won and generate improvement suggestions.
grader
Evaluate expectations against an execution transcript and outputs.
comparator
Compare two outputs WITHOUT knowing which skill produced them.
.NET-Notebook-Migration-Agent
Expert .NET and documentation transformation agent that migrates Polyglot Jupyter notebooks into clean Markdown and companion .NET sample code.