Skip to main content
← Back to Blog

Introducing NexBench: MindFort's Internal Model Evaluation

Akul Gupta, Co-Founder & CTO at MindFort

Written by

Akul Gupta

AI Research2026-07-22·Updated 2026-10-07·11 min read

Attackers now find and exploit 0-days faster than defenders can keep up, which is why continuous pen testing against attack surfaces that change often has become table stakes. Better models have made that testing faster, but running the same agents has become token- and cost-inefficient: they run for 8-16 hours at a time, sometimes every day. That leaves a gap between how fast attackers find 0-days and how fast teams can fix them. We built MindFort to make security efficient, performant, and abundant.

This led us to become interested in how efficient agents were when executing offensive security tasks. For us to be able to create these offensive security agents, we needed them to be capable of running for multiple hours at a time, continuously through the year, which led us to create an internal benchmark measuring models' ability to balance token efficiency and performance.

Current cybersecurity evals share one flaw: they are boxed in. Real environments are messy and ambiguous, with layered vulnerabilities that can be chained together in different ways. They come in different deployment and authentication shapes and different sizes, which makes it hard for agents to even work their way in, and that is half the battle. So we built our own, modeled on the thousands of real environments we have watched our agents work through.

Introducing NexBench. NexBench demonstrates the real-world environments that agents find themselves in. By running our agents on NexBench, we aim to understand which models can find the most validated vulnerabilities, have the best price-to-performance ratios, and exhibit long-running coherence and ability.

Our eval provides signals of a model's ability to write, reason and execute real exploits against a target, while measuring their price-to-performance ratio and how well the harness handles the complex environment. In our research, we have found that evaluations of agents in existing benchmarks far outperform the same models/agents in real-world environments.

Setup

Our setup for NexBench uses a modified version of our harness that allows for our agent system to be more portable. The full test range is spun up in an isolated container, and the agents have full access to it, mimicking a web accessible environment.

Agents are scored on their ability to discover vulnerabilities in the following 3 severity levels: low, medium, and high. We dropped critical as its own tier as high vs. critical judgments became subjective and inconsistent over time, so we folded both into high and scored coarsely. Each finding was then re-validated by a separate judge agent, which scored the finding consistently via CVSS, and then re-exploited to confirm that the agent finding held. The vulnerabilities in the test range varied from trivial and low severity, to highly complex multi-stage vulnerabilities in atypical locations. One interesting observation that our bench captures is reviewing how an agent weaves vulnerabilities together. Since the benchmark does not have a concept of “100%” completion but rather non-deterministic scoring that follows a predictable trajectory, we are able to see how effective and how creative agents are in surprising us with newer and better ways to exploit multiple vulnerabilities together. Again, this closely mirrors how agents would interact with complex environments in the wild.

Because of this, we score non-deterministically and report each model's highest score from its recorded runs at the available reasoning efforts. Each agent has a 5-hour runtime cap, which we chose as a reasonable limit for daily pen testing.

We report 4 metrics: findings, validated findings, tokens used, and estimated token cost:

  • A finding is validated if the judge agent is able to successfully reproduce the exploit, or fails otherwise.
  • A model's score is a sum of all validated findings across a single run of the model in the harness.

Results

Fig. 1

Accepted findings by severity

Validator-accepted findings summed across each model's recorded runs, sorted by total volume. Each model keeps its own hue; darker shades are higher-severity findings. Hover any bar for the exact low / medium / high breakdown.

Hue = model · shade = severity
High / critical
Medium
Low
GPT-5.6 SolX-HighOpenAI
Opus 4.8MaxAnthropic
Sonnet 5MaxAnthropic
Grok 4.5HighxAI
GPT-5.6 TerraX-HighOpenAI
GPT-5.6 LunaX-HighOpenAI
GPT-5.5X-HighOpenAI
Qwen3.8 27BDefaultAlibaba
Grok 4.6X-HighxAI
Kimi K3DefaultMoonshot AI
GLM-5.2X-HighZ.ai
Grok 4.7X-HighxAI
GLM-5.3MaxZ.ai
GLM-5.3 FlashMaxZ.ai
Nemotron 3 UltraHighNVIDIA
Kimi K2.7DefaultMoonshot AI
Mercury 2.5 PreviewHighInception
87
high40
medium25
low22
87 accepted findings
68
high38
medium13
low17
68 accepted findings
54
high31
medium14
low9
54 accepted findings
51
high26
medium15
low10
51 accepted findings
49
high19
medium18
low12
49 accepted findings
47
high21
medium11
low15
47 accepted findings
45
high19
medium15
low11
45 accepted findings
45
high9
medium16
low20
45 accepted findings
44
high26
medium18
low0
44 accepted findings
41
high22
medium9
low10
41 accepted findings
31
high12
medium10
low9
31 accepted findings
26
high20
medium4
low2
26 accepted findings
25
high15
medium7
low3
25 accepted findings
22
high11
medium6
low5
22 accepted findings
16
high2
medium7
low7
16 accepted findings
14
high2
medium6
low6
14 accepted findings
3
high1
medium1
low1
3 accepted findings
0255075100

Across five recorded runs each, GPT-5.6 Sol had the most validated findings with 87. Opus 4.8 followed with 68 (Figs. 1 and 2).

Note: Best score and run time come from one run per model. Findings, cost, and tokens are totals across all recorded runs. The Runs column shows how many each model has. Click any column header to re-sort.

Fig. 2

Leaderboard, sorted by accepted findings

All 17 models, ranked by validator-accepted findings summed across their recorded runs. Run counts vary by model and appear in the Runs column. The sorted column is highlighted in orange; click any header to re-sort.

ModelBest-run effort
GPT-5.6 SolX-High6152h 19m8740$1,093224.5M0.1760.855
Claude Opus 4.8Max4551h 50m6838$38077.8M0.4132.019
Claude Sonnet 5Max3454h 30m5431$374173.1M0.3480.751
Grok 4.5High5235h 3m5126$12249.6M0.9702.378
GPT-5.6 TerraX-High3651h 6m4919$21580.3M0.4891.308
GPT-5.6 LunaX-High4351h 59m4721$158127.8M0.6330.782
GPT-5.5X-High4151h 19m4519$12088.0M0.8171.114
Qwen3.8 27BDefault28359m459$516.8M1.53811.533
Grok 4.6X-High11411h 57m4426$3925.4M2.9514.485
Kimi K3Default42349m4122$4740.0M2.0002.349
GLM-5.2X-High3421h 40m3112$3842.7M1.7221.522
Grok 4.7X-High7011h 17m2620$4435.3M1.6091.986
GLM-5.3Max3321h 17m2515$3040.6M2.0441.528
GLM-5.3 FlashMax2923h 24m2211$1939.4M2.6611.268
Nemotron 3 UltraHigh1825h 3m162$92261.5M0.2920.103
Kimi K2.7Default2412h 32m142$1417.3M1.7241.387
Mercury 2.5 PreviewHigh611h 6m31$720.1M0.8050.299

For example, GPT-5.6 Sol's best-scoring run had 32 accepted findings, including 11 high-severity findings, for 61 points. Its totals across five runs were 87 accepted and 40 high-severity findings. Grok 4.6 has one recorded run: 44 accepted findings, including 26 high-severity findings, for 114 points.

Where it starts getting interesting is when we start to implement scoring, assigned based on severity of the finding. We assigned a score of 1 to low findings, 2 for medium findings, and 3 for high/critical findings. In general, critical and high findings were harder to find, since they required chaining multiple vulnerabilities together, which makes this metric a good read on overall performance in offensive security workflows. Each run was scored as shown below. The leaderboard reports each model's highest score across its recorded runs, which range from one to five.

(3 * #_of_high_vulnerabilities) + (2 * #_of_medium_vulnerabilities) + (1 * #_of_low_vulnerabilities)

Grok 4.5 scored 52, below GPT-5.6 Sol's 61 and above Opus 4.8's 45. It took the full runtime to reach that score. The later Grok 4.6 and 4.7 runs scored 114 and 70. Kimi K3 reached 42 in 49 minutes (Fig. 3).

Fig. 3

Leaderboard, sorted by best score

All 17 models, ranked by best severity-weighted score, each model's strongest single run across all reasoning efforts. The sorted column is highlighted in orange; click any header to re-sort.

ModelBest-run effort
Grok 4.6X-High11411h 57m4426$3925.4M2.9514.485
Grok 4.7X-High7011h 17m2620$4435.3M1.6091.986
GPT-5.6 SolX-High6152h 19m8740$1,093224.5M0.1760.855
Grok 4.5High5235h 3m5126$12249.6M0.9702.378
Claude Opus 4.8Max4551h 50m6838$38077.8M0.4132.019
GPT-5.6 LunaX-High4351h 59m4721$158127.8M0.6330.782
Kimi K3Default42349m4122$4740.0M2.0002.349
GPT-5.5X-High4151h 19m4519$12088.0M0.8171.114
GPT-5.6 TerraX-High3651h 6m4919$21580.3M0.4891.308
GLM-5.2X-High3421h 40m3112$3842.7M1.7221.522
Claude Sonnet 5Max3454h 30m5431$374173.1M0.3480.751
GLM-5.3Max3321h 17m2515$3040.6M2.0441.528
GLM-5.3 FlashMax2923h 24m2211$1939.4M2.6611.268
Qwen3.8 27BDefault28359m459$516.8M1.53811.533
Kimi K2.7Default2412h 32m142$1417.3M1.7241.387
Nemotron 3 UltraHigh1825h 3m162$92261.5M0.2920.103
Mercury 2.5 PreviewHigh611h 6m31$720.1M0.8050.299
Fig. 4

Cost per accepted finding

Total standard cost divided by accepted findings, cheapest model first. Hover a bar for the calculation.

GLM-5.3 FlashMaxZ.ai
Grok 4.6X-HighxAI
Kimi K2.7DefaultMoonshot AI
Qwen3.8 27BDefaultAlibaba
Kimi K3DefaultMoonshot AI
GLM-5.3MaxZ.ai
GLM-5.2X-HighZ.ai
Grok 4.7X-HighxAI
Grok 4.5HighxAI
Mercury 2.5 PreviewHighInception
GPT-5.5X-HighOpenAI
GPT-5.6 LunaX-HighOpenAI
GPT-5.6 TerraX-HighOpenAI
Opus 4.8MaxAnthropic
Nemotron 3 UltraHighNVIDIA
Sonnet 5MaxAnthropic
GPT-5.6 SolX-HighOpenAI
$19 standard cost ÷ 22 accepted findings= $0.85
$39 standard cost ÷ 44 accepted findings= $0.88
$14 standard cost ÷ 14 accepted findings= $0.99
$51 standard cost ÷ 45 accepted findings= $1.14
$47 standard cost ÷ 41 accepted findings= $1.15
$30 standard cost ÷ 25 accepted findings= $1.21
$38 standard cost ÷ 31 accepted findings= $1.22
$44 standard cost ÷ 26 accepted findings= $1.67
$122 standard cost ÷ 51 accepted findings= $2.39
$7 standard cost ÷ 3 accepted findings= $2.48
$120 standard cost ÷ 45 accepted findings= $2.67
$158 standard cost ÷ 47 accepted findings= $3.36
$215 standard cost ÷ 49 accepted findings= $4.38
$380 standard cost ÷ 68 accepted findings= $5.59
$92 standard cost ÷ 16 accepted findings= $5.77
$374 standard cost ÷ 54 accepted findings= $6.93
$1093 standard cost ÷ 87 accepted findings= $12.56
$0.00$3.75$7.50$11.25$15.00
$0.85
$0.88
$0.99
$1.14
$1.15
$1.21
$1.22
$1.67
$2.39
$2.48
$2.67
$3.36
$4.38
$5.59
$5.77
$6.93
$12.56

GPT-5.6 Sol had the highest cost per accepted finding in our evaluations, followed by Sonnet (Fig. 4). GLM-5.3 Flash, Grok 4.6, and Kimi K2.7 had the lowest costs per accepted finding.

Looking at token and cost efficiency, we can then deduce which models were able to make the most of token and dollar cost. Our x-axis measures validated points per USD (cost efficiency as a ratio), with our y-axis measuring points per million tokens (token efficiency). Kimi K2.7 ended up with one of the best dollar-to-point ratios, but token use inefficiency ended up weighing down overall results (Fig. 5). Among the hosted models, Grok 4.5 performed in the inverse, with strong token efficiency, but was more expensive than Kimi K2.7, along with GLM-5.2. The standout on token efficiency, though, is Qwen3.8 27B, run locally on our own hardware: it validated 45 findings on just 6.85M total tokens. That works out to roughly 11.5 points per million tokens, more than twice the rate of any hosted model, at about $1.14 per validated finding.

Kimi K3 ended up scoring similarly to Grok 4.5 in terms of token efficiency (2.35 points per 1M tokens vs. 2.38 points per 1M tokens) but scored significantly better in terms of dollar efficiency, at roughly double the points per USD, making it a really cost-efficient choice.

Fig. 5

Cost vs. token efficiency

Severity-weighted points per dollar (x) against points per million tokens (y), summed across every run, one point per model. Upper-right is best, hover any point for details.

0.003.006.009.0012.0015.000.000.601.201.802.403.00Points per $Points per 1M tokensGPT-5.6 SolGrok 4.5Claude Opus 4.8GPT-5.6 LunaKimi K3GPT-5.5GPT-5.6 TerraGLM-5.2Claude Sonnet 5GLM-5.3GLM-5.3 FlashKimi K2.7Nemotron 3 UltraMercury 2.5 PreviewQwen3.8 27BGrok 4.6Grok 4.7Most cost & token efficient

Each run appears once by score and standard cost (Fig. 6). The Pareto frontier shows the highest score reached at or below each cost.

Fig. 6

Score vs. standard cost

Every model-effort cell. The dashed orange line marks the Pareto frontier, the highest score reached at or below each cost.

0306090120150$0$110$220$330$440$550Standard cost ($)Score
Claude Opus 4.8
Claude Sonnet 5
GLM-5.2
GPT-5.5
GPT-5.6 Sol
GPT-5.6 Luna
GPT-5.6 Terra
Grok 4.5
Kimi K2.7
Kimi K3
Nemotron 3 Ultra
Qwen3.8 27B
GLM-5.3
GLM-5.3 Flash
Mercury 2.5 Preview
Grok 4.6
Grok 4.7

The same runs appear by score and total tokens (Fig. 7). This view shows which scores were reached at different token budgets.

Fig. 7

Score vs. total tokens

The same model-effort cells on a log-scale x-axis, token spend ranges from roughly 1.3M to over 150M across runs.

03060901201501M10M100MTotal tokens (log scale)Score
Claude Opus 4.8
Claude Sonnet 5
GLM-5.2
GPT-5.5
GPT-5.6 Sol
GPT-5.6 Luna
GPT-5.6 Terra
Grok 4.5
Kimi K2.7
Kimi K3
Nemotron 3 Ultra
Qwen3.8 27B
GLM-5.3
GLM-5.3 Flash
Mercury 2.5 Preview
Grok 4.6
Grok 4.7

Conclusion

As more software gets shipped, teams need to start thinking about how software can become self-securing. Long-running agents are the way forward, and to power them we have to figure out which models can do the work at an efficient cost without giving up performance. Open-source models are already gaining fast on closed-source ones like Opus and GPT, and as powerful models get cheaper, attackers get access to stronger weapons. Defenders have to pick up those same resources and catch vulnerabilities continuously, before an attacker gets the chance to exploit them.

About the author

Akul Gupta, Co-Founder & CTO at MindFort

Akul Gupta

Co-Founder & CTO · MindFort

AI researcher focusing on LLMs in cybersecurity. Red-teamed models for OpenAI and Anthropic as part of their safety programs. Published multiple conference papers. M.S. Computer Science, UIUC.

Put your security on autopilot

First Deployment

15 min

Agents Running

24/7

More Coverage

100x

Hours Saved

1,000+