aspireai.
PUBLIC EDITION

A first benchmark for broken access control found a minimal scaffold nearly doubles LLM repair success

AspireAI community · arXiv
Broken access control is among the most severe web-application vulnerability classes, but it is a logic bug whose repair needs an understanding of the applications access-control model and business semantics, which traditional automated-repair techniques handle poorly. BAC-Bench is the first benchmark for this problem: 46 real-world broken-access-control vulnerabilities from six widely used web applications in four programming languages, each with a sandboxed runtime, a proof-of-concept validation program and a functional test program. The authors also propose a repair-strategy framework characterizing any patch along Position, Coverage, Mechanism and Content. Across eight base LLMs and two commercial LLM agents, single-turn base models repair 37.68 percent of the vulnerabilities on average, while two minimal scaffolds, Apply-Feedback and Navigate-and-Locate, lift that to 66.03 percent, with the best base model at 75.36 percent against 78.99 percent for the best agent. Some generated patches beat the official patches, and one incidentally closed a zero-day that had lain dormant for three years.
Read the story and explore more from the AspireAI community.
Discover more stories
Stay curious.
THE BIG PICTURE
A FRESH PERSPECTIVE
Research
One distance function matched sparse-autoencoder features across layers and compressed feature circuits into supernodes
Two sparse-autoencoder analyses have resisted scaling: matching semantically similar features across layers, and compressing large feature circuits into interpretable supernodes. This paper argues both are the same underlying problem, estimating semantic distances between SAE features that sit on different activation manifolds. Its representation treats each feature not as a single decoder vector but as an activation-weighted distribution over the hidden states expressing it, projects those distributions into a shared reference space, and compares them with Wasserstein distance. The representation is proved invariant to activation rescaling and stable under perturbation, and recovers true matches under finite-sample margin conditions. Empirically it outperformed decoder-vector and LLM-based baselines and captured subtle functional distinctions between related features, and it compressed large feature circuits into interpretable supernodes automatically. The limitation is that this is interpretability tooling: the paper demonstrates better feature matching and circuit compression, not that downstream interpretability claims become more accurate.
Swipe into something new
01 / 1729
The conversation continues
Explore Builds — projects by Kiran Adimatyam ↗
A fresh perspective changes everything.
ASPIREAI — STAY CURIOUS.