arXiv:2609.278712026-08-20cs.SEpreprintBounded Loops
Bounded Loops: Pre-Run Spend Bounds, Proved Termination, and Verified Completion for Agent Harnesses
The instrument found 47 vacuous gates — checks satisfied by the absence of the thing they check — in shipped, reviewed code
Summary
In mainstream agent frameworks a step ends when the agent's own output says it has finished. This paper states what a harness must instead guarantee — that it finishes, does not drift, and does not overspend — and proves each one: termination in closed form under a global repair budget, no DONE without a gate verdict in an append-only hash-chained ledger, and a spend ceiling enforced inside an attempt rather than between attempts. It then builds the instrument that measures whether a harness delivers it, characterising two ways a sound-looking check passes anything: vacuity and self-attestation. Engine, catalogue and corpus are Apache-2.0.
Varun Pratap Bhardwaj, Garima Singh, Arun Pratap Bhardwaj
arXiv:2608.128952026-08-13cs.AIpreprintAgentAssert
Agent Behavioral Contracts II: Certifying Compositional Reliability Without Assuming Independence
Two instances of the same model failed together on 90% of missions where either failed — independence is not a safe assumption
Summary
Multi-agent reliability analysis routinely assumes component failures are conditionally independent, and almost never tests it. This paper tests it and finds strong positive dependence, which inflates joint failure rates well beyond what independence-based bounds predict. It replaces the assumption with a certificate that assumes no dependence structure at all — a linear program over the joint distribution, bounded by a Bonferroni–Clopper–Pearson box — and proves that fitting a dependence model instead degrades coverage as sample size grows.
Varun Pratap Bhardwaj, Garima Singh, Arun Pratap Bhardwaj
arXiv:2608.082532026-08-08cs.AIpreprintSuperLocalMemory
SuperLocalMemory 4.0: The Governed Memory Operating System for AI Agents
Governed memory with scoped component evidence and disclosed negative results
Summary
The revised preprint studies governed local-first memory and distinguishes implementation from verified effectiveness. Component evidence is protocol-scoped; current package behavior requires separate checks.
Varun Pratap Bhardwaj, Garima Singh, Arun Pratap Bhardwaj
arXiv:2604.063922026-04-07cs.AIpreprintQualixar OS
Qualixar OS: A Universal Operating System for AI Agent Orchestration
One substrate for agent orchestration: 12 topologies, Forge team design and three-layer model routing
Summary
Every agent framework reinvents orchestration, and none of them interoperate. Qualixar OS defines a universal substrate: execution semantics for 12 multi-agent topologies, Forge for designing agent teams, three-layer model routing with a Bayesian POMDP, and a consensus-based judge pipeline.
Varun Pratap Bhardwaj
arXiv:2604.045142026-04-06cs.AIpreprintSuperLocalMemory
SuperLocalMemory V3.3: The Living Brain -- Biologically-Inspired Forgetting, Cognitive Quantization, and Multi-Channel Retrieval for Zero-LLM Agent Memory Systems
Seven retrieval channels and zero LLM calls in the hot path; 70.4% on LoCoMo in zero-LLM mode
Summary
A memory system that never forgets degrades: old facts crowd out current ones and retrieval quality falls. V3.3 borrows the brain's answer — decay curves, consolidation, and quantized cognitive states — and retrieves across six independent channels fused by reranking, without a single LLM call in the hot path.
Varun Pratap Bhardwaj
arXiv:2603.145882026-03-15cs.AIpreprintSuperLocalMemory
SuperLocalMemory V3: Information-Geometric Foundations for Zero-LLM Enterprise Agent Memory
75% LoCoMo accuracy without cloud calls, from a four-channel retrieval architecture
Summary
Retrieval quality is usually bought with LLM calls. V3 buys it with geometry instead: memories live on a statistical manifold where relevance is a distance, so ranking is computed rather than generated. The result is a benchmark score competitive with cloud systems, produced entirely on-device.
Varun Pratap Bhardwaj
arXiv:2603.026012026-03-03cs.AIpreprintAgentAssay
AgentAssay: Token-Efficient Regression Testing for Non-Deterministic AI Agent Workflows
Sequential testing needs 78% fewer trials; trace-first analysis of existing traces adds no token cost
Summary
You cannot diff an agent's output against a golden file, because the output legitimately differs every run. AgentAssay tests the distribution instead of the sample: stochastic verdicts over repeated runs, with a sampling strategy that reaches a decision in a fraction of the tokens a naive repeat-and-compare would burn.
Varun Pratap Bhardwaj
arXiv:2603.001952026-02-27cs.CRpreprintSkillFortify
Formal Analysis and Supply Chain Security for Agentic AI Skills
96.15% F1, five theorems with full proofs, and a published negative result on information-flow analysis
Summary
An agent skill is arbitrary code that runs with the agent's own authority, installed from a registry with no review gate. This paper gives the threat model a formal treatment, then builds static analysis, provenance verification and SBOM generation across 22 agent frameworks so a skill can be judged before it executes.
Varun Pratap Bhardwaj
arXiv:2602.223022026-02-25cs.AIpreprintAgentAssert
Agent Behavioral Contracts: Formal Specification and Runtime Enforcement for Reliable Autonomous AI Agents
Design-by-contract for agents — invariants that hold on every execution path. 1,980 sessions across 7 models
Summary
Prompts express intent; they do not enforce it. This paper adapts design-by-contract to autonomous agents: preconditions, invariants, governance policies and recovery mechanisms stated formally, then checked at runtime, so a violation is caught at the step that caused it rather than three tool calls downstream.
Varun Pratap Bhardwaj
arXiv:2603.022402026-02-17cs.AIpreprintSuperLocalMemory
SuperLocalMemory: Privacy-Preserving Multi-Agent Memory with Bayesian Trust Defense Against Memory Poisoning
Shared memory is an attack surface — Bayesian trust scoring that degrades a poisoned writer instead of trusting it
Summary
When several agents write to one memory store, a single compromised agent can poison what every other agent later recalls. This paper models writer trust as a Bayesian posterior updated by downstream outcomes, so a source that keeps producing facts which fail verification loses influence over retrieval — without any of the data leaving the machine.
Varun Pratap Bhardwaj