Core principle
Execution technology changes. Trust should not.Parmana separates execution from trust so organizations can verify execution regardless of the underlying execution engine — whether that’s enterprise software today, or AI agents, robotics, or distributed systems tomorrow.
Design goals
- Deterministic execution
- Immutable trust artifacts
- Cryptographic verification
- Replayable execution
- Independent auditability
- Technology-agnostic execution
- Long-term algorithm agility
Canonical trust model
Guiding principles
| Principle | What it means in practice |
|---|---|
| Immutable by default | No domain object supports an update operation. |
| Deterministic by design | Same policy + same inputs → same decision, always. |
| Verifiable by evidence | Every claim is backed by cryptographic evidence, not trust in the runtime. |
| Replayable by construction | Any past decision can be deterministically re-derived. |
| Storage agnostic | The Runtime doesn’t know or care which storage adapter is behind the repository interfaces. |
| Execution agnostic | Execution engines are swappable without changing the trust model. |
| Cryptographically verifiable | Hashing and signatures are core, not bolted on. |
| Future-ready through algorithm agility | Cryptographic algorithms are replaceable implementation details, not fixed domain concepts — e.g. a future move to post-quantum signatures wouldn’t require an architectural change. |
Next
Runtime Architecture
How the Runtime orchestrates execution without embedding business logic.
Package Architecture
How responsibilities are split across the eight monorepo packages.
Security Model
Immutability, append-only evidence, and cryptographic guarantees.
Repository Model
How storage is abstracted behind interfaces.