aspireai.
PUBLIC EDITION

An LLM web scanner spent 93 percent of its crawl inside a generated decoy world, and the real site kept working

AspireAI community · arXiv (2610.38524)
LLMs have made vulnerability scanning of web applications effective enough that attackers can automate it too, which means defenders need a way to waste a scanner's time without breaking the site. WebMaze is that defence. After systematically studying how six LLM-based scanners gather information and choose actions, the authors built a defence that embeds functionality-coupled traps in genuine pages and constructs view-tailored interactive decoy worlds from the application's own existing views, so the traps blend into real components and lead a scanner into a connected decoy world that sustains exploration. The headline result is that across 12 web applications and three scanners in the default no-disclosure setting, decoy pages accounted for an average of 93.0 percent of the distinct pages requested per run - with genuine application functionality preserved. The limitation is that the paper also reports the scanners do better once explicitly told about the decoy mechanism, so this is a cost-imposition defence, not a block.
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.