A third-party benchmark assessment of Subquadratic's preview models, conducted by Appen across long-context retrieval, code generation, business-workflow automation, and graduate-level reasoning benchmarks.
Benchmarking Subquadratic’s latest model & SSA Kernel | Appen
56× faster than FlashAttention-2 at 1M tokens. Independent efficiency, retrieval, and SWE-Bench benchmark of sparse self-attention. Download the full report.
Performance Explorer — oMLX
Compare model performance across context lengths with community benchmark data.
ToolSandbox: A Stateful, Conversational, Interactive Evaluation Benchmark for LLM Tool Use Capabilities
Recent large language models (LLMs) advancements sparked a growing research interest in tool assisted LLMs solving real-world challenges…
Epoch Capabilities Index
The Epoch Capabilities Index combines many benchmarks into a single capability scale for comparing models over time.
SWE-Bench Pro: Can AI Agents Solve Long-Horizon Software Engineering Tasks?
Large Language Model (LLM) agents have been widely adopted in modern software development workflows. SWE-bench [13] and related works [23, 24, 22, 25, 15] establish the task of issue resolution as a de-facto standard for assessing their capability and usefulness. In this setting, an agent is given an entire codebase, a task description (e.g., a bug report or feature request) in natural language and is instructed to produce a code patch that resolves the issue and passes the repository’s test suite. These benchmarks have been instrumental in demonstrating both the substantial potential and the persistent limitations of current models as SWE agents.
SlopCodeBench: Benchmarking How Coding Agents Degrade Over Long-Horizon Iterative Tasks
Software development is iterative, yet agentic coding benchmarks hide design issues through their single-shot setup. Recent iterative benchmarks attempt to remedy this but heavily constrain an agent's design decision space, making it impossible to faithfully measure how their decisions shape future extensions. We introduce SlopCodeBench, a benchmark of 36 problems and 196 checkpoints where agents repeatedly extend their own solutions. Unlike prior iterative benchmarks, our evolving specifications demand architectural decisions but leave internal structure to the agent. We measure two forms of degradation: structural erosion (concentrated complexity) and verbosity (redundant code). Evaluating 15 coding agents across open and closed models, we find that no agent fully solves any problem end-to-end, and the best agent passes 14.8% of checkpoints. Quality degrades across checkpoints, with structural erosion rising in 77% of trajectories and verbosity in 75.5%. Compared to 473 open-source Python repositories, agent code is 2.3x more verbose and 2.0x more eroded, and the human repositories degrade less often and by smaller margins across their git histories. Explicit quality guidance reduces initial verbosity and erosion by up to a third, without affecting degradation rates. SlopCodeBench provides the first measurement of code degradation under iterative extension, revealing that agents pass checkpoints while producing code that erodes and bloats with each turn.
NeuralBench: A Unifying Framework to Benchmark NeuroAI Models | Hubert Banville
🧠 NeuralBench is now open source. Today we're releasing NeuralBench, a unified framework for benchmarking foundation models of brain activity, developed by the Brain & AI team at FAIR, Meta. 💻 Code: https://lnkd.in/dNJsgBgM 📄 White paper: https://lnkd.in/dvWMg7rx Brain foundation models are starting to show positive transfer to a range of downstream tasks, from brain-computer interfacing to clinical classification. But systematically evaluating them is hard: heterogeneous preprocessing pipelines, input structures, and adaptation methodologies make results difficult to compare. Most prior work also focuses on a narrow set of downstream tasks. NeuralBench addresses this by defining each task end-to-end with config files (data source, preprocessing, splits, optimiser, metrics, architecture) so all models can be evaluated on the same footing. What's in our first release, NeuralBench-EEG v1.0: ⚡ 36 EEG tasks across 94 public datasets, spanning motor imagery, clinical classification, cognitive decoding, and phenotype prediction. 🤖 Task-specific deep learning architectures (EEGNet, Deep4, EEGConformer, CTNet, ...) benchmarked side-by-side with recent EEG foundation models (BENDR, LaBraM, BIOT, CBraMod, LUNA, REVE). 🧩 Extensible to other neuroimaging modalities: the framework already runs MEG and fMRI tasks, leveraging our NeuralSet ecosystem for accessing brain imaging data and the broader neuroscientific software stack. 📜 Released under the MIT license. Help us make it better. Through our white paper, we invite the community to contribute new tasks, datasets, and models, especially for fMRI, MEG, and iEEG. The long-term goal is a fully unified benchmark across neuroimaging tasks and modalities. 🙏🙏🙏 This was a big team effort with Stéphane d'Ascoli, Simon Dahan, Jérémy RAPIN, Marlène Careil, Yohann Benchetrit, Jarod Lévy, Saarang P., Antoine Ratouchniak, Lucy (Mingfang) Zhang, Elisa Cascardi, Katie Begany, Teon Brooks, and Jean-Rémi King. Special thanks to Alexandre Gramfort, Thomas Moreau, Arnaud Delorme, Bruno A. and Pierre Guetschel for feedback and support. #Neuroscience #AI #NeuroAI #Python #OpenSource
SlopCodeBench: Benchmarking How Coding Agents Degrade Over Long-Horizon Iterative Tasks
Software development is iterative, yet agentic coding benchmarks overwhelmingly evaluate single-shot solutions against complete specifications. Code can pass the test suite but become progressively harder to extend. Recent iterative benchmarks attempt to close this gap, but constrain the agent’s design decisions too tightly to faithfully measure how code quality shapes future extensions. We introduce SlopCodeBench, a language-agnostic benchmark comprising 20 problems and 93 checkpoints, in which agents repeatedly extend their own prior solutions under evolving specifications that force architectural decisions without prescribing internal structure. We track two trajectory-level quality signals: verbosity, the fraction of redundant or duplicated code, and structural erosion, the share of complexity mass concentrated in high-complexity functions. No agent solves any problem end-to-end across 11 models; the highest checkpoint solve rate is 17.2%. Quality degrades steadily: erosion rises in 80% of trajectories and verbosity in 89.8%. Against 48 open-source Python repositories, agent code is 2.2x more verbose and markedly more eroded. Tracking 20 of those repositories over time shows that human code stays flat, while agent code deteriorates with each iteration. A prompt-intervention study shows that initial quality can be improved, but it does not halt degradation. These results demonstrate that pass-rate benchmarks systematically undermeasure extension robustness, and that current agents lack the design discipline iterative software development demands.
Artur Chakhvadze on Twitter / X
We are releasing our first quantized checkpoints for the Qwen3.5 series of models, co-designed jointly with our inference engine to achieve maximum possible performance on Apple hardwareStarting from 0.8B, 2B and 4B modelshttps://t.co/2R8BdhAfzv— Artur Chakhvadze (@norpadon) June 8, 2026
Cross-Model Evaluation: kaish collection syntax across 7 LLMs (DeepSeek, Gemini, Claude, Gemma, GLM, Qwen)
Cross-Model Evaluation: kaish collection syntax across 7 LLMs (DeepSeek, Gemini, Claude, Gemma, GLM, Qwen) · GitHub
Overview - GroqDocs
Fast LLM inference, OpenAI-compatible. Simple to integrate, easy to scale. Start building in minutes.
Recursive Language Models
We study allowing large language models (LLMs) to process arbitrarily long prompts through the lens of inference-time scaling. We propose Recursive Language Models (RLMs), a general inference paradigm that treats long prompts as part of an external environment and allows the LLM to programmatically examine, decompose, and recursively call itself over snippets of the prompt. We find that RLMs can successfully process inputs up to two orders of magnitude beyond model context windows and, even for shorter prompts, dramatically outperform the quality of vanilla frontier LLMs and common long-context and coding scaffolds (e.g., on GPT-5 by a median across the evaluated benchmarks of $26\%$ against compaction, $130\%$ against CodeAct with sub-calls, and $13\%$ against Claude Code) across four diverse long-context tasks while having comparable cost. At a small scale, we post-train the first model around the RLM. Our model, RLM-Qwen3-8B, outperforms the underlying Qwen3-8B model by $28.3\%$ on average and even approaches the quality of vanilla GPT-5 on three long-context tasks. Code is available at https://github.com/alexzhang13/rlm.
Announcing VibeBench: The AI benchmark that measures what matters — how models like Opus-4.7 actually feel to use in real-world work.
My coworkers and I have been long-time users of Claude Code and Codex and are getting a ton of exposure to other models due to our deep dives into…
