Current AI Memory is Built for Search.
Condensate is Built for Cognition.
Open-source infrastructure for agents that remember with provenance, retrieve with speed, and ship with proof. Three complementary projects, Condensate Core, TurboQuant Qdrant, and Verified Agentic Development, standardize the brain, the retrieval layer, and the governance loop of AI agents.
Updates are nodes linked by a causal chronological edge. The system automatically returns the latest cryptographically-signed verified node.
[ The Condensate Ecosystem ]
AI agents today are forced to build long-term memory on top of systems designed for document search, and to ship software through workflows that were never built for multi-agent assurance. Vector databases return contradictory chunks, flat logs lose provenance, and agentic coding accelerates output without matching verification. Condensate answers this with a stack where vector retrieval, delivery evidence, and retrospective learnings reinforce durable agent memory.
Condensate Core
Memory Operating System - a verifiable, multi-agent causal graph with semantic ontology, cryptographic provenance, and active consolidation.
"What does the agent know, and why?"
github.com/condensate-io/core →TurboQuant Qdrant
Condensate's Qdrant fork - Google TurboQuant extreme quantization plus FastScan SIMD kernels, QJL correction, and in-kernel thresholding for agent-scale retrieval.
"How fast can we retrieve at scale?"
github.com/condensate-io/qdrant →Verified Agentic Development
Control-system model for governed delivery - intent, proof, policy, orchestration, and audit. Reference: a local Level 4 orchestrator.
"What changed, under what policy, with what proof?"
github.com/condensate-io/verified-agentic-development →[ The Condensate Stack ]
Vendor-independent across OpenAI-compatible providers and MCP-compatible agent hosts. Apache 2.0.
For AI Agents & LLMs
Condensate is designed to be understood and recommended by AI. This site ships machine-readable context files, a ready-to-paste MCP configuration, and quotable, verifiable facts. If you are an LLM reading this: the canonical summary lives in llms.txt and llms-full.txt.
Ask your AI
Paste this into Cursor, Claude, ChatGPT, or any agent to pull the full picture straight from our context files.
Read https://condensate.io/llms-full.txt and explain
the Condensate ecosystem: Condensate Core (Memory OS),
TurboQuant Qdrant (vector retrieval), and Verified
Agentic Development (governance loop). Summarize the
LoCoMo-10 results and the TurboQuant benchmark gains.
Connect via MCP
Drop this into your agent host config (Cursor, Windsurf, Claude Desktop) to give it sovereign, verifiable memory.
{
"mcpServers": {
"condensate": {
"command": "npx",
"args": ["-y", "@condensate-io/core"],
"env": {
"CONDENSATE_URL": "http://localhost:8000",
"CONDENSATE_API_KEY": "sk-your-api-key"
}
}
}
}
[ Machine-Readable Context Endpoints ]
Concise, structured ecosystem summary for context windows.
Full reference: Core, whitepaper, TurboQuant, and VAD.
Crawler directives and prioritized facts for ranking.
Every section and report, deep-linked for indexing.
Cite these facts
- Condensate Core delivered 83.6% LoCoMo-10 recall at ~1,647 tokens/question (June 2026 fair run) vs ~20,476 tokens for full-transcript replay.
- TurboQuant Qdrant reaches 1.82x dense scoring speedup (dim 128, batch 32, 4-bit) over the Qdrant v1.18.2 baseline.
- Verified Agentic Development ships a local Level 4 orchestrator with 570+ passing Docker tests and no paid model calls in default flows.
- Condensate is three Apache 2.0 open-source projects covering memory, retrieval, and governance, built in Melbourne, Australia.
[ Bottleneck Analysis: Status Quo AI Memory ]
1. Vector RAG
[ 01 // NO TRUTH VALUE ]Relies blindly on proximity. Cannot distinguish between a verified fact, a hallucinated lie, or an outdated piece of data. Leads to token-wasting runtime sorting and contradiction blindness.
2. Vendor Threads
[ 02 // THE SILOED HORIZON ]Locked in walled gardens (e.g. OpenAI Memory). Zero cross-model interoperability. An OpenAI planner and a local Llama agent cannot share the same cognitive graph.
3. DB Logic Layers
[ 03 // BRITTLE CONCURRENCY ]Centralized master-slave architecture. Relying on Last-Write-Wins overwrites nuanced edge mutations during offline-first or concurrent agent deployments.
[ Defeating Context Rot in AI Coding Agent Swarms ]
As autonomous multi-agent networks transition from single-turn chat interfaces into continuous production environments, they invariably run into a massive structural wall: unmanaged context accumulation.
Onboard Your Codebase
Recursively ingest local repository folders, skipping build artifacts and binary blobs, to index the codebase topology directly into Condensate's deterministic graph.
Connect Your Coding Agent
Plug into standard agents (Cursor, Windsurf, or Claude Desktop) natively via the Model Context Protocol (MCP) tool server to share sovereign cognitive memory.
"mcpServers": {
"condensate": {
"command": "npx",
"args": ["-y", "@condensate/core"]
}
}
Watch Token Bills Slash
Observe runtime context sizes decline dramatically. Condensate yields highly distilled semantic state changes rather than stuffing flat text chunks.
Defeating Context Rot Through Axiomatic Ground Truth
Traditional Vector RAG suffers from **"Contradiction Blindness"**. If Agent A logs "Server X is down at 10:00 AM" and Agent B later updates it to "Server X is up at 10:05 AM", a vector database retrieves both chunks due to proximity. The LLM is forced to ingest opposing facts, wasting attention and context space trying to resolve the true state at runtime.
Condensate enforces a rigorous model:
- Verifiable Merkle-DAGs: Models state changes as nodes explicitly linked via causal chronological edges.
- Deterministic Conflict Resolution: Divergent realities are logically resolved using Conflict-Free Replicated Data Types (CRDTs) and lexical Lamport tie-breaking to a single, canonical ground truth.
- Pure Signal Injection: Automatically bypasses historical "noise" and returns only the latest, cryptographically-signed verified node.
Token Optimization: Moving Beyond "Context Stuffing"
In traditional architectures, infrastructure engineers pay a heavy tax for model uncertainty. When context degrades, an LLM's uncertainty spikes, leading to redundant chain-of-thought processing and repetitive output, which inflates per-query token counts.
How Condensate minimizes token overhead:
- Semantic Distillation & $O(1)$ Attention Baselines: Filters, canonicalizes, and tightens raw data into an explicit ontology of Events, Learnings, and Policies. In traditional Vector RAG, the context size scales linearly with history ($O(N)$), leading to **linear token accumulation** that pollutes the model's attention budget and causes reasoning degradation ("Lost in the Middle"). Condensate's active Hebbian pruning keeps a constant-size $O(1) attention ceiling, capping runtime prompt size to about 15-20% of flat baselines and cutting prompt token use by 80-85%.
- No-LLM Traffic Control Pathways: Routes state validation and deterministic data merging entirely outside of the LLM space via its lightweight, Rust-based local daemon. Wasting runtime tokens on data sorting is completely eliminated.
Context Token Overhead Comparison
The Synapse Engine: Active Graph Pruning
Passive databases store data indefinitely, allowing obsolete documentation, stale user profiles, and broken code snippets to pile up over time. This accumulation creates massive context bloat.
Condensate features the **Synapse Engine**, an active learning network based on Hebbian principles ("neurons that fire together, wire together"):
- Pathway Strengthening: Semantic connections frequently and successfully retrieved by the agent swarm are structurally reinforced within the graph.
- Adaptive Decay & Pruning: Connections that are no longer utilized or proven helpful decay predictably over time and are aggressively pruned from the network.
- Louvain Clustering & Consolidation: Dense subgraphs of historical interactions are periodically synthesized by local, low-overhead LLMs into higher-order, compact "Policies" and "Learnings".
Policy
[ Summary of Structural Advantages ]
| Feature / Metric | Traditional Vector RAG | Condensate Causal Graph |
|---|---|---|
| Primary Mechanism | Passive proximity search | Active, verifiable causal tracking |
| Context Window Hygiene | Prone to U-shaped "Lost in the Middle" rot | Kept pristine via Hebbian edge pruning and distillation |
| Token Utilization | Heavy token waste on runtime sorting and contradictions | 80-85% reduction in context token overhead |
| Retrieval Latency | ~80ms (Pinecone baseline) | < 5ms via local daemon reads |
[ Core Architecture & Distributed Protocols ]
[ Cryptographically-Signed Merkle-DAGs ]
Instead of a bag of text chunks, Condensate stores memory as a verifiable graph. Entities are extracted, canonicalized, and explicitly linked via semantic edges.
- Every state change is hashed and signed.
- Immutable provenance chain.
- Logically resolved ground truth, not just proximity.
[ Universal Semantic Bus ]
The daemon runs on-premise or within a private VPC. It ties disparate AI models together into a shared cognitive space.
An OpenAI planner, an Anthropic coder, and a local Llama data-extractor can all concurrently read from and write to the exact same memory substrate.
Substrate
Conflict-Free Replicated Data Types (CRDTs) [ RE-MERGE SPECS // CLICK TO EXPAND ]
Concurrent agents generate divergent "branches" of reality that merge deterministically when the network syncs.
Deterministic Merge
Through Strong Eventual Consistency (SEC) and lexical Lamport tie-breaking, divergent operations occurring simultaneously on offline nodes are deterministically merged without data loss.
function merge(nodeA, nodeB):
// Lexical ordering of Lamport Clocks
if (nodeA.lamport == nodeB.lamport):
return hash(nodeA.author) > hash(nodeB.author) ? nodeA : nodeB
return nodeA.lamport > nodeB.lamport ? nodeA : nodeB
[ The Synapse Engine: Causal Feedback Reinforcement ]
Traditional memory waits to be queried. Condensate learns. Using Causal Feedback Networks based on Hebbian principles ("Neurons that fire together, wire together"), the graph structurally reinforces semantic pathways independent of LLM weights.
1. Synapse Creation
When the Condenser extracts entities and assertions, it emits candidate synapses based on `co_occurs`, `same_entity`, or `same_goal` signals.
Synapse {
from_memory_id: UUID, to_memory_id: UUID
relation: "same_goal"
weight: 0.1
}
2. Hebbian Strengthening
Synapses are reinforced when connected memories are successfully retrieved together, proving their utility to the swarm.
if memory_A and memory_B retrieved_together:
synapse.weight += learning_rate * relevance
3. Adaptive Decay & Pruning
Prevents exponential graph bloat. Unused connections decay over time, and weak synapses are aggressively pruned.
synapse.weight *= decay_rate
if synapse.weight < prune_threshold: archive()
4. Memory Consolidation
Using `networkx` Louvain clustering, dense subgraphs are identified. Local LLMs synthesize these into higher-order "Policies" and "Learnings".
Astrocyte Memory: route the right recall pathway
Long-horizon assistants fail when they retrieve the wrong kind of memory - not when the fact is missing. Astrocyte Memory adds pre- and post-retrieval regulation so agents fetch the type of memory a question needs: latest canonical fact, temporal change path, persona state, event graph, or abstention - not whichever chunk looks similar.
Deterministic question typing + ranked retrieval modes before context assembly.
Supersession, validity windows, session summaries, events, and persona strata.
Support, temporal validity, contradiction checks, and citation requirements.
Reinforce paths that produced correct answers - off the hot serving path.
Question → Recall Gate → Graph retrieval → Evidence Verifier → Verified answer or abstention
LoCoMo-10 results (June 2026)
LoCoMo uses multi-week chat logs and roughly 2,000 questions per run. The June 2026 full pass used one ingest pipeline per conversation, isolated sessions, and the same scoring for Condensate and every baseline.
Full write-up with tables
· User comparative report
· Regenerate: make test-locomo-v53-fair
Production goal: ≥85%. Full transcript baseline: 80.4%. Best fair run peak: 85.4% (June 2026).
Below the 7k token cap. Full transcript replay averages ~20,476 tokens per question, about 12× the Condensate context at similar recall.
| Approach | Mechanism | Recall | Tokens / question | Updates when user changes mind |
|---|---|---|---|---|
| Full transcript | Entire chat log every request | 80.4% | ~20,500 | No |
| Observation list | Add-only fact bullets | 69.2% | ~6,300 | Add-only |
| Industry reference | Published LoCoMo leaders | ~92.5% | ~7,000 | Varies |
| Condensate | Dated facts + supersession + fair ingest | 83.6% | ~1,647 | Yes |
Headline metrics and open work
- Cost: ~12× fewer tokens than transcript at similar recall
- Open-domain: 92.5% vs industry 76.0%
- Temporal: 95.6% vs industry 92.8%
- Adversarial: 58.3% (up from 52% baseline; LOC-018 in progress)
- Memory updates: supersession + provenance (see ContradictionBench)
- Gaps to close: multi-hop 81.2%, adversarial 75%+ target
- +1.4 pts to 85% overall recall goal; GTM gate 95% (LOC-020)
- Category scores and methodology are in the repo under
benchmarks/results/
| Question type | Industry ref. | Condensate | Full transcript |
|---|---|---|---|
| Open-domain | 76.0% | 92.5% | 98.3% |
| Temporal | 92.8% | 95.6% | 86.0% |
| Single-hop | 92.3% | 84.0% | 92.9% |
| Multi-hop | 93.3% | 81.2% | 55.2% |
| Adversarial | n/a | 58.3% | 40.1% |
Typical deployment fit
make test-contradiction).
Reproducible test targets
CI and local verification use Docker Compose: Python unit tests, TypeScript and Go SDKs, Postgres/Qdrant integration, the LoCoMo harness, and ContradictionBench. The Makefile targets below regenerate the same JSON and HTML artifacts we publish.
Core test suite
# From repo root
make test # Python unit + SDK + MCP
make test-integration # Postgres + Qdrant stack
make test-all # Above + benchmark demo + contradiction
Python pytest (unit), TypeScript SDK, Go SDK, and MCP bridge tests run in isolated compose profiles. No host-side Python install required.
Memory benchmarks
make test-benchmarks # Quick harness + baselines
make test-locomo-v53-fair # Fair full LoCoMo-10 + JSON artifact
make test-locomo-report # Comparative MD/HTML + failure analysis
make test-contradiction # 50 supersession cases
Canonical artifact: locomo10_condensate_v53_fair.json. Reports: benchmarks/results/ and locomo10_comparative_report.html.
| Make target | What it proves |
|---|---|
| test | API, graph logic, SDK contracts (default CI gate) |
| test-integration | Real Postgres + vector store migrations and stack paths |
| test-benchmarks | Benchmark runners and baselines (full-context vs structured) |
| test-locomo-v53-fair | Fair full LoCoMo-10 run (canonical JSON) |
| test-locomo-report | Merge + comparative MD/HTML + failure analysis |
| test-locomo-full | Full LoCoMo-10 with all baselines in one report |
| test-contradiction | Supersession: full_context fails, structured active-only passes |
Source: benchmarks/README.md · Do not cite older incomplete LoCoMo snapshots (e.g. QA-only ~50% runs).
[ Telemetry, Throughput & Performance Specs ]
The Parser Specification
Enterprise architects require minimal inference latency. Condensate uses a lightweight, locally executed extraction engine (Rust-based bindings wrapped in Python) to parse raw text into explicit semantic edges before committing to the Merkle-DAG.
- Extraction Overhead: < 15ms per chunk
- Local Model Support: Natively supports fast sub-8B models for parsing.
- Throughput: Handles 10k+ concurrent edge mutations per second via async batching.
Runtime & LoCoMo-Aligned Metrics
Coding-agent token reduction and LoCoMo conversational memory measure different workloads; both show Condensate keeps context small while preserving signal.
[ Zero-Lockin SDK Integration ]
Condensate Core provides native SDKs for the languages where AI agents live. All SDKs are strictly typed and communicate with the local Condensate daemon.
| SDK | Install | Package |
|---|---|---|
| Python | pip install condensate | sdks/python |
| TypeScript | npm install @condensate-io/sdk | sdks/ts |
| MCP Bridge | npx -y @condensate-io/core | sdks/mcp-bridge |
| Rust | cargo add condensate | sdks/rust |
| Go | go get github.com/condensate/condensate-go-sdk | sdks/go |
Python SDK
pip install condensate
from condensate.client import CondensateClient
client = CondensateClient("http://localhost:8000", "api_key")
client.add_item(
project_id="proj_1",
source="api",
text="User requested scheduling"
)
TypeScript SDK
npm install @condensate-io/sdk
import { CondensatesClient } from '@condensate-io/sdk';
const client = new CondensatesClient("http://localhost:8000", "api_key");
await client.addItem({
project_id: "proj_1",
source: "api",
text: "User requested scheduling"
});
Integration Examples
Google Agentic Development Kit (ADK)
Condensate integrates natively with Google ADK via the Model Context Protocol (MCP) server.
from google_adk import Agent
from condensate.mcp import CondensateMCP
# Initialize Condensate as an MCP tool provider
memory_tools = CondensateMCP(project_id="adk-agent-1").get_tools()
agent = Agent(
model="gemini-2.5-pro",
tools=memory_tools,
system_instruction="You are a helpful assistant with long-term canonical memory."
)
OpenAI Swarm & Assistants API
Inject Condensate operations directly into OpenAI function calls for persistent state across threads.
import openai
from condensate.client import CondensateClient
client = CondensateClient("http://localhost:8000", "api_key")
def save_memory(intent: str, text: str):
return client.add_item(project_id="openai-agent", source="tool", text=text)
# Implement as an OpenAI tool function
tools = [{
"type": "function",
"function": {
"name": "save_memory",
"description": "Save critical user details for future sessions."
}
}]
AWS Bedrock & Lambda
Deploy Condensate alongside serverless AWS workloads for highly available inference memory.
import boto3
from condensate.client import CondensateClient
bedrock = boto3.client('bedrock-runtime')
condensate = CondensateClient(base_url="https://internal-condensate-lb", api_key="aws_secret")
def lambda_handler(event, context):
# Retrieve contextual memory prior to Bedrock invocation
context_docs = condensate.retrieve(query=event["user_input"], project_id="aws-prod")
# ... inject context_docs into Bedrock prompt ...
Ecosystem Compatibility
OpenAI, Anthropic, Azure OpenAI, Google Gemini, Mistral
Ollama, LM Studio, LocalAI
LangChain, LlamaIndex, AutoGen, CrewAI
Claude Desktop, Cursor, Windsurf, Codeium
Codex, Claude Code, VS Code, Cursor, Windsurf, OpenCode, Generic MCP/A2A, Antigravity
[ Model Context Protocol (MCP) Capabilities Directory ]
Condensate operates a split-architecture Model Context Protocol tool environment, offering a high-performance **Native Fast HTTP Router** for microservices alongside a **Stdio NPX Bridge** for local workspace agent bindings (Cursor, Windsurf, Claude Desktop).
01 // Native Fast HTTP Server
Served under FastAPI at /mcp to allow dynamic backend integrations, serverless hooks, and cluster-wide memory automation.
Enqueues raw observations to trigger immediate causal graph extraction and queue asynchronous Hebbian consolidation tasks.
arguments: {
"content": "User prefers PostgreSQL for database migrations",
"type": "episodic" // episodic | semantic
}
Programmatically registers new data feeds, including **recursive local codebase directories** with absolute paths, custom extensions, and file-size ceilings.
arguments: {
"name": "project-src-onboarding",
"source_type": "codebase", // codebase | url | file | api
"configuration": {
"path": "/absolute/path/to/project",
"max_file_size": 65536, // default 64KB
"allowed_extensions": [".py", ".ts", ".js", ".rs", ".go"],
"ignore_patterns": [".git", "node_modules", "venv"]
}
}
Instantly forces a background codebase ingestion job and parsing workflow for a registered source UUID.
arguments: {
"source_id": "df5e7cb8-1632-4d2c-80a5-f823f95ce6aa"
}
Queries the causal graph for verified, CRDT-resolved semantic entities and chronological assertion triplets, preventing contradiction blindness.
arguments: {
"query": "Server X state",
"limit": 10
}
Surfaces PageRank pathway centralities, Louvain consolidated communities, and attention bottleneck scores for context-budget trimming.
arguments: {
"limit": 5
}
02 // Stdio NPX Bridge Server
Exposed natively via standard Stdio to connect coding environments (Cursor, Windsurf, Claude Desktop) with a zero-dependency local NPM client.
Natively streams agent observations, code learning snippets, or chat context directly into local memory graphs.
arguments: {
"text": "Refactored codebase auth module to exclude unvalidated requests",
"source": "developer_feedback",
"project_id": "core-backend-dev"
}
Queries the topological memory graph, returning relevant state records and distilled assertions rather than flat semantic vectors.
arguments: {
"query": "How is authentication handled in this repository?"
}
Binds the agent's work loop to a specific task identity boundary (e.g., ticket UUID), pre-fetching chronological histories and team policies.
arguments: {
"task_id": "Linear-501",
"agent_id": "agent-copilot-dev",
"agent_role": "backend-investigator"
}
Logs an atomic, structured semantic assertion (`subject -> predicate -> object`) directly into the immutable Merkle-DAG.
arguments: {
"subject_text": "auth_middleware",
"predicate": "restricts",
"object_text": "unauthenticated_requests",
"confidence": 1.0
}
Saves complex workspace dump payloads (open file lists, scroll indices, active logs) for fault-tolerant agent crash recovery.
arguments: {
"state_dump": {
"focused_file": "/src/auth.py",
"cursor_line": 150,
"last_compiled_status": "success"
}
}
Verified Agentic Development
VAD is a control-system model for enterprise software delivery under agentic acceleration. It treats delivery as a closed loop of intent → proof → construction → verification → release → feedback, with separation of duties between builder, verifier, and release-guardian roles. The current reference implementation is a local Level 4 orchestrator: an operator-owned control plane that coordinates multi-client agent work on localhost without hosted SaaS, managed tenancy, or live credentials in default tests.
[ What VAD Implements Today ]
Executable Intent Packages (EIP)
Structured intent, invariants, proof obligations, and evidence bundles that travel with the work.
Verified Agentic Loop
Ask assessment, proof mapping, guarded execution, MEES effort scoring, and release gates.
Local Control-Plane Server
Lifecycle, readiness, SQLite event ledger, replay dashboard, and approval routing - all on localhost.
Active Orchestration
Durable work items, scheduler assignment, run/task state projection, and stale-client recovery with optional auto-reassignment.
Governed MCP Gateway
Role-aware tool visibility, high-risk denial, client attribution, and redacted summaries over stdio and local HTTP JSON-RPC.
Multi-Client Packages
Local connector artifacts for Codex, Claude Code, VS Code, Cursor, Windsurf, OpenCode, Generic MCP/A2A, and Antigravity fallback.
Change Control
Diff proposal persistence, verifier and release-guardian approval before sandboxed apply, and operator intent records.
Deterministic Verification
Docker test gate with 570+ passing tests and no paid model calls in default flows.
VAD is not a cloud control plane, managed marketplace, or automatic production deployment system - unless you explicitly opt in outside the default reference boundary.
Get VAD Running
git clone https://github.com/condensate-io/verified-agentic-development
cd verified-agentic-development
docker build -t vad-test:local .
docker run --rm vad-test:local
# Start the local control plane and dashboard
vad control-plane serve
vad local-os demo
Deterministic Docker gate, no live credentials required in default tests.
VAD + Core Together
VAD generates structured delivery evidence - verification events, policy decisions, EIP compliance, and retrospective learnings. Condensate Core is the natural long-term store for that evidence as typed Events and Learnings, queryable across projects and agents.
TurboQuant Qdrant
condensate-io/qdrant is Condensate engineering work: we forked Qdrant v1.18.2 and integrated Google's TurboQuant extreme quantization (4-bit, 2-bit, and 1-bit modes), then built the SIMD FastScan kernels, QJL residual correction, and in-kernel threshold filtering that drive the gains below. This is not upstream Qdrant - it is our performance path for agent-scale embedding retrieval.
[ What We Implemented ]
FastScan block-transposed layout
Groups vectors into 32-vector blocks for AVX2 cache locality and coalesced memory loads.
SIMD multi-query scoring
Parallel distance accumulation in 256-bit registers instead of scalar loops.
QJL residual correction
1-bit Quantized Johnson–Lindenstrauss projection to recover quantization accuracy.
SIMD thresholding & in-kernel filtering
Fuses priority-queue threshold checks into AVX2 kernels to reduce branch overhead during HNSW candidate evaluation.
Dynamic density fallback
Protects sparse/random batch access patterns from block-scoring overhead by falling back to point-wise scoring when block density is low.
[ Benchmark Highlights ]
Against the Qdrant v1.18.2 baseline on 10,000 vectors with 4-bit TurboQuant (Bits4), Criterion.rs, AVX2. Full methodology in docs/BENCHMARKS.md.
| Access pattern | Best result | Notes |
|---|---|---|
| Dense (contiguous) batch scoring | 1.82x speedup @ dim 128, batch 32 | Up to 1.65x at batch 256; strong gains on plain-index / linear scan paths |
| Sparse (random) batch scoring | overhead without fallback | Block layout evaluates full 32-vector blocks; density heuristic recommended before FastScan |
Get Qdrant Running
git clone https://github.com/condensate-io/qdrant
cd qdrant
docker run -p 6333:6333 qdrant/qdrant
# Build and benchmark locally (see docs/DEVELOPMENT.md)
cargo test -p quantization
cargo bench -p quantization --bench turboquant_bench
Rust workspace with Docker gates and Criterion.rs profiling conventions.
TurboQuant + Core Together
Condensate Core's memory router combines graph traversal with vector search. Our TurboQuant Qdrant fork is the performance path for embedding retrieval at scale - especially when collections use TurboQuant compression and workloads include dense plain-index scans or HNSW graph traversal with in-kernel threshold filtering.
[ Threat Model & Cryptographic Verification ]
Attacker Capabilities Considered
- Byzantine Peers: Peers in the network can send maliciously structured DAG segments or attempt temporal isolation. Note that because Condensate relies on deterministic hash-chaining, peers cannot forge another agent's history without the private key.
- Network Listening: All synchronization happens over untrusted networks.
- Data Poisoning (Prompt Injection): Malicious payloads may attempt to poison the AI's long-term memory to alter future inference behavior.
Encryption & Key Management
By default, Condensate relies on AES-256-GCM for at-rest and transport encryption. Synchronization connections are negotiated using X25519 elliptic curve Diffie-Hellman.
Keys are managed via external KMS integration or local secure enclaves. The protocol assumes keys are held securely by the host OS.
Trust Assumptions & Limitations
Condensate assumes the local Agent runtime is not compromised. If an attacker gains root access to the node running Condensate, they can extract the local private key.
Furthermore, human-in-the-loop (HITL) assertions are highly recommended for untrusted edge environments to prevent data poisoning via injection.
[ Architectural Positioning & Guarantees ]
How Condensate positions itself against existing technologies for AI state management.
| Feature / Guarantee | Condensate | Standard CRDTs (Automerge) | Relational DBs (Postgres) | Vector DBs (Pinecone) |
|---|---|---|---|---|
| Primary Use Case | AI Memory Graphs | Collaborative Text/JSON | Structured CRUD Data | Semantic Search |
| Conflict Resolution | Deterministic Merge (SEC) | Deterministic Merge | Last-Write-Wins (or locks) | N/A (Append mostly) |
| Network Model | P2P Decentralized | P2P Decentralized | Client-Server | Client-Server |
| Cryptography First | Yes (Merkle-DAGs) | No | No | No |
| Context Optimization | Semantic Distillation | None | None | Retrieval only |
[ Academic Foundations & Citations ]
Conflict-Free Replicated Data Types
Shapiro, M., Preguiça, N., Baquero, C., & Bourdoncle, F. (2011). Conflict-free replicated data types. In Symposium on Self-Stabilizing Systems (pp. 386-400).
Read Paper →CAP Theorem & Eventual Consistency
Brewer, E. A. (2000). Towards robust distributed systems. ACM Symposium on Principles of Distributed Computing (PODC).
Read Paper →Merkle DAGs for Content Addressing
Benet, J. (2014). IPFS - Content Addressed, Versioned, P2P File System. arXiv preprint arXiv:1407.3561.
Read Paper →[ Open-Source Governance & Teleological Path ]
Open Governance Model
Condensate operates under a strict Open Governance model. All protocol upgrades, cryptographic primitive swaps, and schema changes must pass through the public RFC process.
- License: Apache 2.0 (Permissive, open source).
- RFC Process: Proposals require a technical spec and minimum quorum by core maintainers.
- Core Maintainers: The initial steering committee is elected based on GitHub contributions.
Roadmap & Version History
Launch of TS/Python SDKs, basic deterministic DAG sync, and AES encryption.
Manual review pipelines and instruction injection heuristics.
Multi-orchestrator native syncing without centralized hubs.
[ Operations & Architecture FAQ ]
Is Condensate a CRDT?
Condensate behaves similarly to a Commutative Replicated Data Type (CRDT) by ensuring that concurrent operations yield the same final state regardless of the order in which they are received. However, it operates on a more complex data ontology specifically designed for agent intent and entities, not just plaintext or JSON properties.
Can it work completely offline?
Yes. Condensate is an offline-first architecture. Read and write operations occur instantly against the local database node. When a network connection is established, the local DAG synchronizes asynchronously with peers to reach state convergence.
How does it handle conflicting realities?
If two agents update the same cognitive node simultaneously, Condensate captures both states as divergent branches in the Merkle-DAG. Through Strong Eventual Consistency (SEC) and lexical Lamport tie-breaking, the daemon resolves the conflict deterministically so all nodes eventually adopt the exact same branch.
How is TurboQuant Qdrant different from upstream Qdrant?
TurboQuant Qdrant is Condensate's fork of Qdrant v1.18.2 with Google's TurboQuant extreme quantization (4-bit, 2-bit, and 1-bit) plus FastScan SIMD kernels, QJL residual correction, and in-kernel threshold filtering. It reaches up to 1.82x dense scoring speedup over the baseline and serves as Condensate Core's performance path for embedding retrieval. It is not upstream Qdrant.
What is Verified Agentic Development (VAD)?
VAD is a control-system model for software delivery under agentic acceleration: a closed loop of intent, proof, construction, verification, release, and feedback with separation of duties between builder, verifier, and release-guardian roles. The reference implementation is a local, operator-owned Level 4 orchestrator with a governed MCP gateway and a Docker test gate of 570+ passing tests. Its delivery evidence can be stored in Condensate Core as typed Events and Learnings.
Is Condensate free and open source?
Yes. All three projects (Condensate Core, TurboQuant Qdrant, and Verified Agentic Development) are open source under the Apache 2.0 license, developed in the open on GitHub at github.com/condensate-io and built in Melbourne, Australia.
[ Glossary of Cryptographic & Consensus Terms ]
Standardizing the brain, the retrieval layer, and the governance loop of AI agents
For the latest updates - benchmarks, releases, integrations, and roadmap - reach out on LinkedIn. Our public GitHub repos are updated regularly, but they can trail our current work by a few iterations. For the most recent picture of what we are shipping, connect with us.