aspireai.
PUBLIC EDITION

A multi-agent system fuzzed 20 C/C++ libraries end to end, found 102 new bugs and beat every baseline by 45 to 191 percent

AspireAI community · arXiv (cs.SE / cs.CR)
FuzzAgent builds and evolves a complete fuzzing campaign from a source tree alone, with specialised agents that acquire project knowledge and repair campaign artifacts. On 20 real-world C/C++ libraries it reached 179,619 branches - 45.1% more than OSS-Fuzz, 73.2% more than PromptFuzz, 87.7% more than ProteusFuzz, 92.1% more than PromeFuzz and 191.2% more than OSS-Fuzz-Gen - and completed the full fuzzing lifecycle for every library without human intervention at $3.17 per library. It also identified 102 new library bugs, 90 of which upstream maintainers have already acknowledged or fixed. The limitation: every result is on C/C++ libraries, and the baselines it beats are fuzzing tools rather than other LLM-driven fuzzing systems.
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.