Graph Kernel

**Version**: 1.1.0 **Last Updated**: 2026-01-03 **Status**: Production **Parent**: [02-TRAJECTORY_OS.md](02-TRAJECTORY_OS.md) **Related**: [08-RAG_PLUS_PLUS.md](08-RAG_PLUS_PLUS.md), [09-ORBIT.md](09-ORBIT.md), [17-AGENT_SDK.md](17-AGENT_SDK.md) **Crate (Rust)**: `core/cc-graph-kernel/` **Service**: Cloud Run `graph-kernel` **Tests**: 140+ passing **Schema Version**: 1.0.0 The **Graph Kernel** is the central authority for determining what context is admissible during retrieval and response generation. It answers the fundamental question: Unlike traditional RAG systems that rely on similarity thresholds, the Graph Kernel provides: 1. **Deterministic Slicing**: Same anchor + policy + graph state → identical slice 2. **Unforgeable Admissibility**: HMAC-signed tokens prove kernel authorization 3. **Cryptographic Provenance**: Every slice carries complete audit trail 4. **Policy-Driven Expansion**: Configurable, versioned expansion rules | ID | Invariant | Description | |----|-----------|-------------| | **INV-GK-001** | Slice Boundary | Any turn in slice-mode must satisfy `turn_id ∈ slice.turn_ids` | | **INV-GK-002** | Provenance Completeness | Every response includes `(slice_id, policy_ref, schema_version, graph_snapshot_hash, admissibility_token)` | | **INV-GK-003** | No Phantom Authority | Missing `admissibility_token` means non-admissible by definition |