Trust
Security and data handling
Galahad runs on your own servers, in your VPC, colocation facility or bare-metal racks. Corbenic does not see your data or your model weights. This page describes how the saved model state is protected and what was tested.
What is stored
Galahad saves the model's computed state (its KV cache) to local disk so it can be restored instead of recomputed. That state is derived from your prompts and documents, so it is treated as sensitive data and encrypted.
Encryption at rest
| Property | What was measured |
|---|---|
| Cipher | AES-256-GCM on every saved block, with a fresh key for every block. |
| Standard test vectors | Every NIST CAVP test vector reproduces: 4,167 checks, 0 failures. |
| Round trips and corruption | 100,000 of 100,000 round trips byte-exact. 10,000 of 10,000 corruptions detected. |
| Nothing readable on disk | 8.0000 bits of entropy per byte over the stored file, which is what random data measures. File names carry no customer information. |
| Speed | 33.8 GB/s to encrypt and 32.1 GB/s to decrypt on 16 threads. Loading a 580 MB block takes 109.93 ms encrypted against 110.54 ms plain. |
Customer separation and keys
- A separate key per customer (tenant). A wrong key refuses to open the data, and customer B cannot read customer A's state.
- The identical question from two customers stays apart. With customers kept separate, nothing is shared: 50 customers means 50 computations.
- Forgetting a customer's key makes that customer's stored data unreadable and leaves every other customer intact. Rotating a customer key takes 1.63 μs with 10,000 blocks stored.
- The library refuses to start without a tenant identity and a model fingerprint, so state from one model or customer cannot load into another.
Integrity: it fails safe
- Every restore is checked. If a stored block fails a check, Galahad does not use it and recomputes instead. With one byte flipped in each saved block, both blocks were refused, the state was recomputed and the answer was unchanged.
- A forced hash collision is refused, not served. A second, independent hash confirms every match.
- A damaged reading is refused before it is saved, so one bad reading cannot reach many users. The check takes 0.04 to 0.05 ms.
Resilience
- 100 of 100 rounds consistent with the process killed in the middle of a save.
- On Kubernetes, the memory survives a deleted pod and a force-killed request. 2,918 requests were answered with 0 failures through a rolling restart of every replica.
- The workload runs with every Linux capability dropped and privilege escalation off.
- The library links only the standard C and C++ runtime, with no CUDA and no PyTorch dependency.
How the protections were tested
Every protection is paired with a sabotage test: the mechanism is deliberately broken, and the test must fail. 15 of 15 deliberate breaks of the encryption code were caught, among them a shortened tag, a reused nonce and a skipped tag check. Behind the benchmark numbers sit more than 1,000 raw captures of what each tool printed.
What this page does not cover
These are Corbenic's own tests and have not been through an independent audit or a formal certification. For questions about activation, offline operation, updates, telemetry or a security review for procurement, email [email protected].