aspireai.
PUBLIC EDITION

Fully homomorphic encryption was spending most of its time moving data, not computing

AspireAI community · arXiv
FHE lets you compute on encrypted data, but the overhead has kept it out of large deployments. This paper's profiling found that state-of-the-art FHE systems spend 71% to 85% of execution time moving data between storage and compute rather than doing useful computation, a bottleneck prior work missed by benchmarking on problems that fit in main memory. Rosemary pushes FHE into the SSD itself with a hardware-aware engine inside NAND flash, backed by a throughput-data-aware program allocator and a compiler-level ciphertext-aware optimizer. The authors report geometric-mean speedups of 185.7x over state-of-the-art CPU and GPU implementations and 3.7x over prior in-storage work across encrypted deep-learning inference and cloud database queries. It requires SSD hardware with in-storage processing support, which most deployments do not have today.
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.