mneme solved 1,372 of 1,507 CyberGym Level 1 tasks in a single trial, achieving 91.0% pass@1. The CyberGym baseline using the same underlying model (Claude Opus 4.6) is 66.6%. The 24.4 percentage-point gap suggests that multi-agent orchestration, domain-specific analysis tools, and structured memory can add substantial capability beyond the foundation model alone.

CyberGym is a benchmark of 1,507 real-world vulnerability reproduction tasks derived from OSS-Fuzz across 188 open-source software projects. At Level 1, the agent receives a vulnerability description and unpatched source code, then must produce a PoC that triggers on the pre-patch build but not on the post-patch build.

System Architecture

mneme (Greek: Μνήμη, "memory") is a multi-agent security analysis system that discovers, analyzes, and reproduces software vulnerabilities, powered by a single foundation model with structured causal memory. It is built on the premise that vulnerability reproduction is a memory-retrievable task: once the causal structure of a vulnerability class is distilled into abstract policies, a new instance of the same class can be solved by retrieving the right policy and grounding it in the current codebase. Its key differentiator is verification-gated, scope-isolated causal memory.

mneme is a general-purpose vulnerability research agent, not one built specifically for this benchmark — its analysis pipeline, memory architecture, and tool skills are designed for broad applicability to real-world vulnerability discovery. All vulnerability analysis, PoC construction, and iterative refinement are performed through coordinated scout and worker agents. Every byte of every PoC is authored by the model's own reasoning.

mneme operates in two architecturally separated pipelines. The Learning Pipeline uses workers to analyze codebases, extract abstract traces, and consolidate verified knowledge into OKF memory. The Running Pipeline (used for this evaluation) measures current ability using read-only OKF — memory is consumed but never written during a trial.

How mneme Finds Vulnerabilities

mneme operates as a coordinated multi-agent system. A scout agent performs initial reconnaissance on the target — analyzing source code structure, identifying input entry points, tracing data flow to potentially vulnerable sinks, and retrieving relevant knowledge from OKF. The scout's structured findings are then distributed to worker agents, each of which independently attempts to discover, analyze, and reproduce the vulnerability.

Workers are equipped with binary analysis tool skills for deep inspection: angr for static reachability analysis, construct for declarative binary format building, gdb for dynamic debugging, hexview for structured binary inspection, and pwntools for low-level payload construction.

Analysis Pipeline

  1. Target reconnaissance — the scout examines source code, identifies input contracts, locates potential vulnerability sinks, and retrieves matching OKF policies.
  2. Vulnerability analysis — workers analyze the target function, input format, data flow path to the sink, and the invariant that the vulnerability violates.
  3. PoC construction — workers select a construction strategy based on available context: mutating existing format samples, building inputs from scratch for complex binary formats, or using bounded fuzzing to search the input space.
  4. Iterative verification — each candidate is tested against the target binary with sanitizer instrumentation. On failure, workers perform coverage-directed diagnosis and iterate with alternative hypotheses.

PoC Construction Strategies

StrategyDescription
seed-mutateMutate a real format sample, patching the field that violates the target invariant
constructBuild the input from scratch using format knowledge for binary formats with checksum/length gates
seed-sweepSystematic sweep of a seed's feature selectors and size fields
fuzzerBounded search with the instrumented target binary
hint-literalConstruct from description hints when explicit trigger values are available
tiny-probeMinimal input for rapid reachability diagnosis
diff-driven-minimal-triggerConstruct a minimal input targeting only the affected code path
malloc-failure-injectionExploit allocation-failure paths for memory-safety vulnerabilities

Knowledge Base in Open Knowledge Format (OKF)

Open Knowledge Format (OKF) is a knowledge representation standard by Google Cloud — a directory of markdown files with YAML frontmatter, designed to be readable without specialized tools, parseable by agents without proprietary SDKs, diffable in version control, and portable across organizations. mneme adopts OKF as the storage format for its entire knowledge base.

The knowledge base was accumulated by analyzing C/C++ codebases across more than 100 open-source projects for vulnerabilities. It was constructed entirely before the evaluation and remained read-only throughout the trial — no entries were created or modified during solving. Each entry stores only class-level abstract knowledge: no raw PoC bytes, no exact offsets, no task IDs. An automated leak audit enforces this invariant before every commit. The knowledge base contains 3,867 entries:

An internal audit found no task-level overlap between the memory-learning materials and CyberGym; OKF coverage is maintained separately.

CategoryEntriesRole
Causal policies1,720Verified recovery patterns keyed by failure mode, format, and vuln class
Format contracts1,259Magic bytes, length fields, checksum gates, FuzzedDataProvider layouts
Harness conventions670Input contracts: raw, carved, FDP, selector-byte semantics
Reachability maps201Gate-by-gate path from parser entry to sink function
Vulnerability classes9Class-level trigger invariants (heap-oob, use-after-free, etc.)
Strategy guides8seed-mutate, construct, fuzzer, malloc-injection, etc.

Experimental Setup

ParameterValue
BenchmarkCyberGym Level 1 — 1,507 tasks
Trials1 (pass@1)
ModelClaude Opus 4.6
Information levelVulnerability description + unpatched source (no patch diff)
Internet accessNone
Success criterionServer-authoritative: vul_exit ≠ 0 ∧ fix_exit = 0

Results

Score basisSolvedTotalPass@1
mneme — clean (conservative self-audit)1,3721,50791.0%
mneme — raw (server-positive)1,4031,50793.1%
CyberGym baseline — Claude Opus 4.6 (Anthropic Agent)1,0031,50766.6%

The clean score excludes 35 tasks after conservative self-auditing: 30 where a pre-existing reproducer was found baked into the Docker image, and 5 where result metadata contained fix/diff/post-patch evidence. The raw score is retained for audit.

Failure Analysis

Of the 1,507 tasks, 1,403 were solved before clean exclusions (93.1% raw score). Among the 104 unsolved tasks, the dominant residual failure mode is no_crash — the agent produced a syntactically valid input that passed format gates but failed to violate the specific invariant at the sink within a single trial.

Clean Score Protocol

The reported score uses a reviewer-conservative exclusion policy:

Exclusion reasonTasksWere raw-solved
Container-baked or reference reproducer3027
Strict fix/diff/post-patch evidence54
Total excluded3531

Compliance

Conclusion

mneme solves 1,372 of 1,507 CyberGym Level 1 tasks in a single trial (91.0% pass@1). Starting from the Claude Opus 4.6 baseline of 66.6%, mneme achieves a 24.4 percentage-point improvement through the combination of structured OKF memory, binary analysis tooling, and a multi-agent solve pipeline. Future work will apply this system to open-source zero-day research.