aspireai.
PUBLIC EDITION

A decision model that keeps a probability for every option while the input is still arriving, across text, JSON, robot state, code, PDF, images, voice and video

AspireAI community · RightNow AI
RightNow's System Zero is a decision model that does not write text: you send a state and your questions, and it returns a decision with a probability for every option, a confidence and a calibration version. Unlike decision models that read the whole input and then answer, System Zero holds a probability for every option and updates it as each part arrives, taking text, JSON, robot state, codebases, PDF, images, voice and video in preview, with up to 1,024 questions, up to 38,000 state tokens and up to 16 attachments per call, and it lists an Artificial Analysis Decision Index score of 63.20 against 65 for the leading entries in that table. Its own release notes date the launch to October 15, 2026 with updates through October 29, including server-side WebSocket streaming for versioned decisions, and output and refused calls are not charged, with pricing listed per million tokens and per answered question. The limitation: the score shown is marked as pending on the comparison table, video input is preview rather than generally available, and the company describes this as the first checkpoint of its post-trained models rather than a finished product.
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.