Overview / Products / Hypertensor GraphRAG
Vector & Graph Engine Coming soon Open-Core + Commercial

Hypertensor GraphRAG & SIMD Vectors

Coming soon Hypertensor GraphRAG is not yet released. Details on this page may change before launch.

An in-memory typed property-graph and vector store for autonomous developer agents. It keeps the graph in RAM and serves agents over REST and MCP. That removes disk-bound lookups and external database round-trips.

51 Feature Sub-Graphs ↓ View Licensing Tiers ↓ Operator Quickstart → Documentation
0.15โ€“1.95 ms 2-hop traversal 1k nodes up to 25k nodes / 100k edges, measured
128-d default SIMD vectors per-store dimension is configurable; .NET SIMD, AVX2/AVX-512
In-Memory residency RAM-resident graph with bidirectional adjacency indices and a BM25 index
FastMCP MCP connectivity stdio, SSE and Streamable HTTP; 65+ tools
TAPE + Grounding Verifier grounding action-perception planning plus claim-to-graph verification
Core Substrates

Engine Architecture & Substrates

Built for low-latency agent workloads where a disk-bound or networked vector database adds too much per-query overhead.

โšก

Low-latency in-memory traversal

The graph store is RAM-resident. Measured 2-hop traversal is about 0.15 ms at ~1,000 nodes and 0.16 ms at ~10,000 nodes. It rises to about 1.95 ms at 25,000 nodes / 100,000 edges. A thread-safe worker pool serves concurrent queries.

๐Ÿ“

SIMD vector search

Dense cosine similarity runs on .NET TensorPrimitives with hardware SIMD. Vectors are 128-dimensional by default and configurable per store. It is combined with BM25 for hybrid retrieval. Level Zero GPU offload is available in the High-Assurance tier.

๐Ÿ”Œ

FastMCP protocol server

A Python FastMCP layer bridges MCP clients to the .NET server. It supports stdio, SSE and Streamable HTTP. Agents can query codebase topology, dependency graphs and symbol call-graphs.

๐Ÿ›ก๏ธ

Offline signed licensing and MLS

Licenses are verified offline against an issuer public key (RSA), so air-gapped deployments work. High-Assurance adds Bell-LaPadula multi-level security (MLS) clearance enforcement and FIPS-approved HMAC-SHA256 clearance tokens.

๐Ÿงฌ

Graph-grounded verification

The Grounding Verifier checks claims against graph memory, validates citations and flags hallucinated edges. TAPE (Task-Adaptive Prediction & Explanation) plans exploration and reasoning as action-perception DAGs.

๐Ÿ”„

Sharded, hardware-aware memory

The BESS partitioner shards graphs. A hardware-topology model covers NUMA nodes, fabric links and pinned host memory. The largest benchmarked configuration is 1,000,000 nodes / 5,000,000 edges.

SPATIAL SUBGRAPH MAP 51 ARCHITECTURAL TILES

51 FEATURE SUB-GRAPHS

Hypertensor GraphRAG โ€” 10 FREE | 14 PRO | 27 HIGH ASSURANCE

17 tiles generated from the spatial map in this pass

FREE TIER โ€” 10 SUB-GRAPHS

AGENT MEMORY
๐Ÿง 

AGENT MEMORY

Local single-developer in-memory store for conversational and agent-working memory.

RAM-Resident Adjacency Index
CODEBASE TOPOLOGY
๐ŸŒ

CODEBASE TOPOLOGY

3D wireframe topology and multi-hop symbol relational graph of the repository.

Bi-directional In-Memory Adjacency
๐Ÿ›ก๏ธ
GITHUB PROVENANCE
๐Ÿ›ก๏ธ

GITHUB PROVENANCE

DIRECTIVE SYNC

Cryptographic commit and PR lineage tracking with directive/playbook symlink sync.

Git Commit Lineage + SHA256 Sync
CONTINUOUS TASKS
โšก

CONTINUOUS TASKS

Real-time task DAG queue with active node pipeline state monitors.

Continuous DAG Task Queue
WORKSPACE TOPOLOGY
๐ŸŒณ

WORKSPACE TOPOLOGY

Hierarchical filesystem and workspace structure graph.

Filesystem Hierarchy Graph
WORKSPACE FORMS & LAYOUT
๐Ÿ“

WORKSPACE FORMS & LAYOUT

UI component hierarchies, layout trees, and form descriptor schemas.

Layout & Form Schemas
WORKSPACE CLASSES & ER
๐Ÿ—‚๏ธ

WORKSPACE CLASSES & ER

Class hierarchy, entity-relationship diagrams, and interface implementations.

Class & ER Schema Mapping
WORKSPACE AGGREGATE
๐Ÿ“ฆ

WORKSPACE AGGREGATE

Multi-module dependency aggregation and project reference bounds.

Dependency Clustered Aggregates
WORKSPACE SNAPSHOT
๐Ÿ“ธ

WORKSPACE SNAPSHOT

Point-in-time immutable state snapshots of workspace graph state.

Zero-Copy Graph State Snapshots
CROSS-GRAPH CONSISTENCY
โš–๏ธ

CROSS-GRAPH CONSISTENCY

Graph consistency linting, dangling reference detection, and cyclic dependency checks.

Graph Linter & Conflict Engine

PRO TIER โ€” 14 SUB-GRAPHS

AGENT BLENDER
๐Ÿค–

AGENT BLENDER

Multi-agent persona synthesis, context blending, and collaborative prompt fusion.

Multi-Agent Topology Blending
CODE SEMANTICS
๐Ÿ”ฅ

CODE SEMANTICS

Roslyn AST semantic graph, symbol call graphs, and blast-radius impact analysis.

Roslyn Compiler Platform AST
AGENT A
AGENT B
DIRECTIVE SYNC
๐Ÿ”„

DIRECTIVE SYNC

Dual-agent pipeline flow with real-time directive and playbook synchronization.

Active Data Flow Link + Symlink Engine
SKILL
SKILL BLENDER
โœจ

SKILL BLENDER

Dynamic skill capability aggregation, tool routing matrices, and prompt template blending.

Skill Matrix & Dynamic Tool Router
COMMUNITY DETECTION
๐Ÿ”ฎ

COMMUNITY DETECTION

Louvain and Leiden community modularity algorithms for codebase grouping.

Louvain & Leiden Modularity
HIERARCHICAL CLUSTERING
๐Ÿ“Š

HIERARCHICAL CLUSTERING

Multi-tier hierarchical clustering of functional domains and packages.

Hierarchical Leiden Partitioning
BELIEF DESIRE INTENTION AGENT BDI
๐ŸŽฏ

AGENT BDI

Belief-Desire-Intention cognitive model representation with state updates.

Belief-Desire-Intention Graph
STACK L0 - TOPOLOGY BASELINE
๐Ÿ“

STACK L0 - TOPOLOGY BASELINE

Baseline structural topology plane representing core AST and entity links.

Isometric Structural Baseline Plane
STACK L1 - TARGET MINDMAP
๐Ÿ—บ๏ธ

STACK L1 - TARGET MINDMAP

Goal-oriented semantic mindmap plane projected onto topological AST.

Goal Projection Semantic Plane
STACK L2 - PROJECT GROUPINGS
๐Ÿ“ฆ

STACK L2 - PROJECT GROUPINGS

Logical project boundary and namespace encapsulation layer.

Encapsulation Boundary Plane
STACK L3 - RULES GRAPH
๐Ÿ“œ

STACK L3 - RULES GRAPH

Architectural rules, lint constraints, and policy validation graph plane.

Policy & Invariant Rule Plane
STACK L4 - CHANGES GRAPH
๐Ÿ”€

STACK L4 - CHANGES GRAPH

Delta diff projections, pending refactoring paths, and staging graph.

Differential Mutation Graph Plane
PATTERN COMPOSITION
๐Ÿงฉ

PATTERN COMPOSITION

Design pattern detection, template substitution, and structural composition.

Structural Pattern Subgraph Matching
FEATURE INTERACTION MAP
โ–ฆ

FEATURE INTERACTION MAP

Pairwise feature cross-talk and side-effect interaction matrix heatmap.

2D Interaction Affinity Heatmap

HIGH ASSURANCE โ€” 27 SUB-GRAPHS

NUMA 0
PCIe Gen5
NUMA 1
HARDWARE TOPOLOGY
๐Ÿ–ง

HARDWARE TOPOLOGY

NUMA node affinity, PCIe interconnect topology, pinned host RAM, and fabric mapping.

Hardware NUMA / Fabric Topology Substrate
LEVEL 0
LEVEL 0 ACCELERATION
โšก

LEVEL 0 ACCELERATION

Intel Level Zero native GPU compute kernel dispatch with precompiled zebin catalog.

Direct Level Zero Native C ABI
MULTI-DOMAIN ONTOLOGY
๐Ÿ”บ

MULTI-DOMAIN ONTOLOGY

Hierarchical multi-domain knowledge ontology pyramid with typed hyper-edges.

Multi-Tier Categorical Knowledge Graph
BESS SHARDING
๐Ÿ’ 

BESS SHARDING

Bi-directional Evolutionary Swarm Sharding for distributed multi-million node graphs.

BESS Graph Partitioning Engine
PROOF CONTRACT
โˆ€x โˆˆ G: Inv(x) โ‡’ โ–กValid
FORMAL INVARIANTS
๐Ÿ“œ

FORMAL INVARIANTS

Hoare-logic proof contracts, inductive invariant checkers, and metamodel guarantees.

Formal Invariant Theorem Prover
PIXIE SWARM MESH
๐Ÿ„

PIXIE SWARM MESH

Bioluminescent decentralized agent mesh with emergent reasoning and topology discovery.

Decentralized Agent Mesh Swarm
DYNAMIC WORLD MODEL
๐Ÿช

DYNAMIC WORLD MODEL

Spatiotemporal predictive world model for simulation, rollouts, and state estimation.

Predictive Latent World Model
r = t - h KGE LINK PREDICTION
๐Ÿ”—

KGE LINK PREDICTION

Knowledge graph embedding (TransE, RotatE, ComplEx) vector link prediction.

TransE / RotatE Vector Space Projections
MULTIHOP REASONING
๐Ÿ›ค๏ธ

MULTIHOP REASONING

Graph-constrained beam search with sub-millisecond multi-hop relational inference.

Graph-Constrained Beam Search
CHECKPOINT GATE [LOCKED & AUDITED] INVARIANT CHECKPOINTS
๐Ÿ”’

INVARIANT CHECKPOINTS

Cryptographically signed and audited invariant checkpoints with rollback guarantees.

Locked & Audited Checkpoint Gates
100% GROUNDED GROUNDING VERIFIER
โœ…

GROUNDING VERIFIER

100% grounded triple verification auditing LLM completions against graph memory.

100% Grounded Triple Verifier
BESS REASONING
๐Ÿงฌ

BESS REASONING

Swarm-guided graph exploration and evolutionary path optimization.

Evolutionary Swarm Path Search
TAPE PLANNING
๐Ÿ“ˆ

TAPE PLANNING

Task-Adaptive Prediction & Explanation planning structured as action-perception DAGs.

Action-Perception Planning DAG
INTERGRAPH FEDERATION
๐ŸŒ

INTERGRAPH FEDERATION

Cross-boundary zero-copy federation between independent domain knowledge graphs.

Cross-Boundary Graph Federation Protocol
UNCLASSIFIED SECRET TOP SECRET
SOVEREIGN AIR-GAP
๐Ÿ›๏ธ

SOVEREIGN AIR-GAP

Bell-LaPadula Multi-Level Security (MLS) with strict classification enforcement (UNCLASSIFIED / SECRET / TOP SECRET).

Bell-LaPadula MLS + FIPS HMAC-SHA256
โœ“ SPDX-2.3
โœ“ CYCLONEDX
โœ“ SHA256 ROOT
SBOM PROVENANCE
๐Ÿ“‹

SBOM PROVENANCE

Software Bill of Materials (SPDX / CycloneDX) cryptographic lineage and supply chain graph.

Cryptographic Supply Chain Provenance
SECCOMP
CAPABILITY SANDBOX
๐Ÿ›ก๏ธ

CAPABILITY SANDBOX

Seccomp/eBPF-enforced capability barriers restricting tool execution and memory isolation.

Hardened Capability Containment Barrier
THREAT SURFACE
โš ๏ธ

THREAT SURFACE

Dynamic attack surface analyzer, prompt injection detection, and vulnerability graph.

Automated Attack Surface & Threat Matrix
AST โ†’ MLIR โ†’ LLVM
COMPILER & MLIR
โš™๏ธ

COMPILER & MLIR

Multi-Level Intermediate Representation (MLIR) graph compilation to native target binaries.

MLIR Dialect Lowering & JIT Engine
DRIFT: 0.002%
COGNITIVE BIAS
๐ŸŽฏ

COGNITIVE BIAS

Cognitive bias and hallucination intensity radar tracking semantic drift in real-time.

Hallucination Intensity & Bias Monitor
limtโ†’โˆž V(x) = 0
||x - x*|| < ฮต
FORMULAIC REASONING
๐Ÿ”ข

FORMULAIC REASONING

Asymptotic convergence guarantees, numerical stability bounds, and Lyapunov proofs.

Asymptotic Convergence Theorem Prover
12 gCO2/kWh
COST & CARBON
๐ŸŒฑ

COST & CARBON

Global electrical grid tracking, carbon intensity routing, and GPU cost optimization.

Regional Electrical Grid & Carbon Router
ISO 26262 DO-178C EU AI ACT NIST 800-53
REGULATORY COMPLIANCE
โš–๏ธ

REGULATORY COMPLIANCE

Formal audit gates for ISO 26262 ASIL-D, DO-178C Level A, EU AI Act, and NIST SP 800-53.

DO-178C / ISO 26262 / EU AI Act Auditor
AGENTIC ORCHESTRATION
๐Ÿ‘‘

AGENTIC ORCHESTRATION

Centralized orchestrator authority managing task dispatch and sub-agent consensus.

Centralized Swarm Orchestration Bus
AGENT BLACKBOARD
๐Ÿ“‹

AGENT BLACKBOARD

Shared global architectural blackboard state for multi-agent asynchronous consensus.

Shared Blackboard Architectural State
AGENT SAFETY & GOVERNANCE
๐Ÿ›ก๏ธ

AGENT SAFETY & GOVERNANCE

Real-time policy interception and hard safety invariants on all agent-generated code.

Hard Real-Time Policy Interception Gate
AGENT LEDGER & QUOTAS
๐Ÿ“Š

AGENT LEDGER & QUOTAS

Cryptographic immutable decision ledger with per-agent rate limits and token quotas.

Immutable Decision Ledger & Quota Gate
โ„น๏ธ

Tier assignment reflects the launch baseline (sales gate 0); features cascade to lower tiers at commercial milestones. Internal bundles are omitted.

HT GraphRAG Commercial & Open-Core Licensing

Coming soon Hypertensor GraphRAG is not yet released. Tiers and terms may change before launch.

Licensing Tiers

Choose the tier that fits your workload: free single-developer use, per-seat Pro, or team-level High-Assurance.

Individual / Workstation

Free

Free single-developer workstation use

$0 / mo

Runtime Bounds & Capacity

  • Validated Bound 25,000 nodes / 100,000 edges
  • SIMD Vectors 128-d SIMD vectors, CPU only
  • 2-Hop Traversal 2-hop traversal โ‰ˆ 1.95 ms
  • Worker Pool 16 workers

Included Subsystems

  • โœ“ Codebase Topology
  • โœ“ Continuous Tasks DAG queue
  • โœ“ GitHub Provenance
  • โœ“ Agent Memory (local single-developer store)
  • โœ“ Developer Workspace scanning
  • โœ“ Graph Consistency linting
  • โœ“ Directive/Playbook symlink sync
Per-Seat Pro

Pro

Commercial developers & scaling engineering teams

$20 / mo per user seat

Runtime Bounds & Capacity

  • Validated Bound 100,000 nodes / 500,000 edges
  • 2-Hop Traversal 2-hop traversal โ‰ˆ 1.47 ms
  • Worker Pool 64 workers (parallel acceleration enabled)

Included Subsystems

  • โœ“ Everything in Free tier
  • โœ“ Roslyn AST blast-radius analysis (CodeSemantics)
  • โœ“ Skill and Agent Blender
  • โœ“ Hierarchical Louvain/Leiden clustering
  • โœ“ Repository Restructuring
  • โœ“ Pattern Composition
  • โœ“ Test Verification
  • โœ“ Feature Interaction Matrix
Team High-Assurance

High-Assurance

Mission-critical, defense, regulated enterprise, and sovereign teams

$1,250 / mo per team

Runtime Bounds & Capacity

  • Validated Bound 1,000,000 nodes / 5,000,000 edges
  • 2-Hop Traversal 2-hop traversal < 12 ms at that scale
  • Worker Pool Worker ceiling of 75,000 (auto-scaled to hardware)

Included Subsystems

  • โœ“ Everything in Pro tier
  • โœ“ Level Zero GPU vector-search acceleration
  • โœ“ Pixie Swarm mesh reasoning
  • โœ“ BESS sharding and reasoning
  • โœ“ Hardware Topology
  • โœ“ Formal Invariants (proof contracts)
  • โœ“ World Model
  • โœ“ TAPE Planning & Grounding Verifier
  • โœ“ Sovereign Air-Gap with MLS enforcement
  • โœ“ Capability Sandbox
  • โœ“ Regulatory Compliance (ISO 26262, DO-178C, EU AI Act, HIPAA)
  • โœ“ Multi-Agent Governance and Decision Ledger
Licensing Procurement

Ready to Deploy Hypertensor GraphRAG?

Developer Pro trial keys are provisioned within 24 hours. High-Assurance Enterprise contracts include cryptographic license generator tooling, custom NUMA build optimization, and air-gapped installation bundles.

Direct Contact: alix@hflabs.dev
Contact alix@hflabs.dev → Read Operator Manual
Developer Quickstart

Runtime Launch Commands

Run Hypertensor GraphRAG as an embedded .NET daemon, CLI query engine, or Python FastMCP bridge.

1. Dedicated Server Daemon gRPC / In-Memory 
dotnet run --project src/HFLabs/Products/HypertensorGraphRAG/Server/Server.csproj -c Release

Spins up the in-memory graph store and binds zero-copy IPC socket interfaces.

2. Headless Topological Query CLI CLI / SIMD 
dotnet run --project src/HFLabs/Products/HypertensorGraphRAG/App/App.csproj -c Release -- --headless --query "Director"

Executes 2-hop graph reasoning with SIMD cosine scoring and outputs JSON results.

3. FastMCP SSE Agent Bridge Python / MCP 
python -m mcp_graphrag.server --transport sse --port 8000

Exposes HT GraphRAG traversal primitives as Model Context Protocol tools for AI agents.