โก Spanda ($R_{sc}$ )
Zero-Cost Epistemic Uncertainty Quantification for Large Language Models
Detect LLM hallucinations and quantify uncertainty in microseconds without secondary NLI cross-encoders.
๐ Overview
Traditional epistemic uncertainty estimation in LLMs relies on Semantic Entropy (SE) (Kuhn et al., 2023; Farquhar et al., Nature 2024). While effective, Semantic Entropy requires clustering
This introduces two severe production bottlenecks:
-
Quadratic Cost:
$\binom{K}{2}$ forward passes per query (45 neural evaluations for$K=10$ ). - Serving Latency: Adds $\sim$90 ms of GPU overhead per inference call, making it unusable for high-throughput production serving.
Spanda introduces Exact-Match Normalized Entropy (
Across empirical evaluations spanning two orders of magnitude (1.5B to 120B parameters), Spanda matches or exceeds neural Semantic Entropy on structured reasoning while operating ~90,000$\times$ faster (
๐ฌ Key Empirical Discoveries
1. The Coherence Scaling Law
As model capacity increases from 1.5B to 27B parameters, internal reasoning coherence causes correct predictions to naturally converge to identical lexical sequences. On mathematical reasoning (GSM8K), exact-match AUROC scales monotonically:
At 7B+ parameters, Spanda achieves the exact same discriminative power as heavy DeBERTa-v3 NLI cross-encoders, rendering the neural clustering step redundant for reasoning.
2. Confident Mode Collapse (Safety Warning)
At the 120B frontier scale on ungrounded factual recall (TriviaQA), the model exhibits Confident Mode Collapse: its parametric memory and RLHF tuning cause it to hallucinate the exact same incorrect answer identically across all
โ ๏ธ Critical Safety Implication: Any system using self-consistency or agreement as a proxy for truth will be systematically deceived by frontier models on ungrounded factual recall. External grounding (RAG) is mandatory in this regime.
๐ Benchmark Results
| Model Scale | Benchmark | Accuracy | Spanda ( |
Neural SE AUROC | Latency | GPU Req. |
|---|---|---|---|---|---|---|
| Qwen-1.5B | GSM8K | 11.4% | 0.577 | 0.584 | None | |
| Qwen-1.5B | TriviaQA | 32.0% | 0.797 | 0.801 | None | |
| Mistral-7B | GSM8K | 8.2% | 0.706 | 0.705 | None | |
| Mistral-7B | TriviaQA | 45.0% | 0.698 | 0.755 | None | |
| Qwen-27B | GSM8K | 61.2% | 0.889 | --- | None | |
| DeBERTa Baseline | N/A | --- | --- | --- | $\sim$92.4 ms | Required |
System Performance & Production Gateway Benchmarks
Empirical audit conducted across 50,000 evaluation iterations and 300 concurrent live HTTP reverse-proxy round-trips:
| Metric / Dimension | โก Spanda Rust Gateway (spnda) |
๐ข LiteLLM Python (litellm) |
Neural Semantic Entropy (DeBERTa) |
|---|---|---|---|
| Mathematical Kernel Latency | 652.1 nanoseconds (0.65 ยตs) | ~15,000 ยตs (with neural judge) | 92,400 ยตs (92.4 ms) |
| Kernel Throughput (Single Core) | 1,533,500 evals/sec | ~200,000 evals/sec (no-op hook) | ~10 evals/sec |
| Cold Startup Time | 3.69 ms | 1,177.08 ms (1.17 s) | N/A |
| Memory Footprint (Idle RSS) | 2.98 MB | 229.61 MB | ~1.8 GB GPU VRAM |
| Proxy Net Latency Overhead | 0.076 ms (76.3 ยตs) | 12.0 โ 28.0 ms (FastAPI/Uvicorn) | N/A |
| Hardware Requirement | Pure CPU (Zero GPU) | Pure CPU (plumbing) / GPU (judge) | Dedicated Nvidia GPU |
๐ Mathematical Formulation
Given
The Normalized Shannon Entropy is: $$H_{\text{norm}} = \begin{cases} 0 & \text{if } n = 1 \ \displaystyle\frac{-\sum_{i=1}^n w_i \ln w_i}{\ln K} & \text{if } n > 1 \end{cases}$$
The combined Spanda Risk Score (
-
$R_{sc} = 0$ : Complete consensus (model is confident). -
$R_{sc} \to 1$ : Maximum epistemic divergence (model is guessing / hallucinating).
โก Installation
Spanda is lightweight and requires zero third-party dependencies (pure Python standard library).
(Package name on PyPI is spnda; module is imported in Python as import spanda)
Or install from source:
git clone https://github.com/Adarshent/Spnda.git cd Spnda pip install -e .
๐ก Engine Options:
- Pure Python (
pip install spnda): Zero-dependency standard library engine running$R_{sc}$ in ~8โ15 microseconds on CPU.- Native Rust Engine (
crates/spanda-core): Sub-microsecond engine running in 652โ767 nanoseconds with an OpenAI-compatible reverse proxy. Compile viacd crates/spanda-core && cargo build --release.
๐ Quick Start
1. The 1-Line Client Wrapper (spanda.wrap)
Wrap any standard OpenAI, Groq, Ollama, or OpenAI-compatible client with transparent multi-path epistemic uncertainty quantification (
import spanda from openai import OpenAI # 1-line drop-in wrapper (samples K=3 paths transparently) client = spanda.wrap(OpenAI(), k=3, threshold=0.35, block=False) response = client.chat.completions.create( model="gpt-4o-mini", messages=[{"role": "user", "content": "What is 17 * 19?"}] ) # Under the hood: runs in ~10 ยตs (pure Python) or 0.7 ยตs (native Rust engine) print(response.spanda.rsc) # 0.0000 (Unanimous consensus) print(response.spanda.is_safe) # True print(response.spanda.decision) # 'FAST_PASS_CONSISTENT' print(response.spanda.latency_us) # ~10-15 ยตs (Python) / 0.7 ยตs (Rust) print(response.choices[0].message.content) # Dominant consensus answer
If block=True is passed and the model hallucinates or diverges, spanda.wrap raises a SpandaUncertaintyError before invalid data reaches your users.
2. Standalone Rust Gateway & CLI Benchmarks (spnda)
Micro-benchmark the mathematical kernel:
# 1. Pure Python engine (ships out-of-the-box with pip install): spnda bench --iterations 50000 # โ Pure Python Engine: ~8-15 ยตs / eval (~100,000 evals/sec, zero dependencies) # 2. Native compiled Rust engine (crates/spanda-core): # cargo build --release -p spanda-core ./crates/spanda-core/target/release/spnda bench --iterations 200000 # โ Native Rust Engine: 767.9 nanoseconds / eval (1,302,312 evals/sec on single core!)
Launch the high-throughput OpenAI-compatible proxy gateway: For production microservices and non-Python languages (TypeScript, Go, Rust, Ruby, curl), run the proxy gateway:
# Launch proxy forwarding to any upstream LLM (Ollama, vLLM, OpenAI, Groq) spnda serve --upstream http://localhost:11434/v1 --port 8080 --block --k 3 # Test candidate completions via CLI spnda eval "42" "42.0" "42"
Any application in any language can simply point base_url="http://localhost:8080/v1" to receive automatic sub-microsecond epistemic verification, Prometheus /metrics, and headers:
X-Spanda-Rsc: 0.0000X-Spanda-State: CONSISTENTX-Spanda-Decision: FAST_PASS_CONSISTENTX-Spanda-Latency-Us: 0.7X-Spanda-Attractor: false
3. Core Epistemic Uncertainty & Hallucination API
from spanda import compute_rsc, detect_hallucination, batch_compute_rsc # 1. Basic Uncertainty Quantification samples = ["Paris", "paris.", "Paris", "Paris", "Paris"] res = compute_rsc(samples) print(f"R_sc Score: {res['rsc']}") # 0.0 (High confidence) print(f"Dominant Answer: {res['dominant_answer']}") # 'Paris' # 2. Production Hallucination Guardrail guard = detect_hallucination(["42", "42", "24", "17", "99"], threshold=0.35) if guard["is_uncertain"]: print(f"๐จ Hallucination Warning (R_sc = {guard['rsc']}). Routing to RAG / Review.") else: print(f"โ Safe output: {guard['dominant_answer']}") # 3. High-Throughput Batch Processing batch = [ ["Answer A", "Answer A", "Answer A"], ["Choice 1", "Choice 2", "Choice 3"] ] for r in batch_compute_rsc(batch): print(r["rsc"], r["dominant_answer"])
4. Enterprise Cascaded Guardrail (RAG & Autonomous Agents)
For mission-critical production pipelines, Spanda provides a 2-Tier Cascaded Guardrail that combines sub-millisecond consensus filtering with context grounding and tool-call safety:
from spanda import CascadedGuardrail guard = CascadedGuardrail( uncertainty_threshold=0.3, grounding_threshold=0.15 ) # 1. RAG Query with Mode Collapse Protection rag_context = "Documentation: The production cluster runs in us-east-1." unanimous_hallucination = ["eu-west-3 Paris", "eu-west-3 Paris", "eu-west-3 Paris"] receipt = guard.evaluate(unanimous_hallucination, context=rag_context) print(receipt.decision) # 'MODE_COLLAPSE_RISK' print(receipt.is_safe) # False (Unanimous agreement, but 0% grounded in source!) print(receipt.tier_executed) # Tier 2 print(receipt.latency_ms) # < 0.05 ms # 2. Agent Tool Call Argument Verification (e.g. preventing bad 'rm') tool_calls = [ {"command": "rm -rf /var/cache"}, {"command": "rm -rf /var/log"}, # Conflict detected across parallel paths! ] agent_receipt = guard.evaluate_tool_calls(tool_calls) print(agent_receipt.decision) # 'TOOL_ARG_MISMATCH' (Execution blocked!) # 3. Export SOC2 Audit Receipt import json print(json.dumps(receipt.to_dict(), indent=2))
5. Ecosystem Integrations (LangChain, LlamaIndex, LiteLLM)
Spanda connects into modern enterprise LLM pipelines with zero external dependencies:
# 1. LangChain String Evaluator from spanda.integrations.langchain import SpandaStringEvaluator evaluator = SpandaStringEvaluator(uncertainty_threshold=0.35) result = evaluator.evaluate_strings( prediction=["Paris", "Paris", "Paris", "Paris"], context="Paris is the capital of France." ) print(result["value"]) # 'PASS' (Score: 0.0) # 2. LlamaIndex Response Guardrail from spanda.integrations.llamaindex import SpandaRAGGuardrail guard = SpandaRAGGuardrail() receipt = guard.validate_response( samples=["Result A", "Result A", "Result A"], context_str="Retrieved node knowledge..." ) print(receipt.is_safe) # True # 3. LiteLLM Proxy / SDK Callback Hook import litellm from spanda.integrations.litellm import SpandaLiteLLMGuardrail litellm.callbacks = [SpandaLiteLLMGuardrail(threshold=0.35, block_mode=False)]
6. Production Deployment & Observability
Run the standalone compiled Rust gateway in Docker or Kubernetes:
docker run -d -p 8080:8080 \ -e SPANDA_UPSTREAM=https://api.openai.com/v1 \ -e SPANDA_THRESHOLD=0.35 \ spanda/spnda-gateway
Observability Endpoints:
GET /metrics: Standard Prometheus format for Grafana (spanda_requests_total,spanda_evaluations_total,spanda_mode_collapses_total,spanda_eval_latency_avg_us).GET /healthz: Kubernetes liveness probe.GET /readyz: Kubernetes readiness probe.- Structured JSON logging: Every transaction emits a machine-parseable log line to stdout for Datadog / CloudWatch / Splunk.
โ ๏ธ Operational Scope: Spanda is engineered for structured reasoning, math, code, agent tool-call arguments, SQL, and canonical factual RAG extraction where 90ms GPU cross-encoders are an unacceptable bottleneck. It is not designed for open-ended, free-form creative prose (e.g., essays or poetry), where synonymous phrasing is naturally diverse and requires heavy neural NLI.
๐ก๏ธ Operational Envelope
| Use Case / Architecture | Recommendation | Rationale |
|---|---|---|
| Math, Code & Structured QA (7Bโ70B) | โ Recommended | Coherence Scaling Law ensures exact-match matches neural SE at 0 cost. |
| High-Throughput Production APIs | โ Recommended | 90,000x latency reduction without GPU requirements. |
| Free-form Paraphrase QA (<7B) | Small models produce inconsistent surface phrasing. | |
| Ungrounded Facts on Frontier Models (>100B) | โ Do Not Use Alone | Subject to Confident Mode Collapse; must combine with retrieval (RAG). |
๐งช Testing
Run the test suite:
python3 -m unittest discover tests
๐ Citation
If you use Spanda in your research or production systems, please cite:
@article{nayak2026spanda, title={Spanda: Zero-Cost Lexical Entropy Matches Neural Semantic Uncertainty---Until Frontier Models Break It}, author={Nayak, Bhupen}, journal={arXiv preprint}, year={2026}, doi={10.5281/zenodo.22233648}, url={https://doi.org/10.5281/zenodo.22233648} }
๐ License & Governance
Spanda adopts a developer-friendly dual-licensing model:
- Python SDK & Integrations (
spanda): Permissive MIT License. Free for all developers, commercial and open-source applications, with zero dependency friction. - Compiled Rust Core Engine & Gateway (
spnda): Business Source License 1.1 (BSL 1.1). Free for developers, research, and internal production infrastructure. Prohibits offering Spanda as a competing commercial third-party managed service without an enterprise license from Spanda Research. Automatically converts to Apache 2.0 on January 1, 2030.