Establish what a “decision” is in Hexarch, and how evaluation becomes a durable record before cryptography enters the picture.
Open →PROOF
Proof
Most systems ask to be trusted. Hexarch is designed to be verified.
This section shows how decisions become evidence: how policy evaluation is recorded, how those records are bound together, and how proof can be inspected and validated without privileged access. Nothing here relies on dashboards or assertions. Each step is deterministic, read-only, and independently verifiable.
What follows is not a walkthrough of features. It is a demonstration of system properties.
Introduce causality: policies are not static, decisions are historically anchored, and downstream effects are traceable across time.
Open →Move from generation to observation: inspect decisions as evidence, not “logs”, and connect what you see to underlying structure.
Open →The pivot: verification is read-only and deterministic. Validate disclosed evidence without privileged access or server-side assertions.
Open →Show symmetry: ALLOW isn’t “success”, DENY isn’t “error”. Enforcement credibility is provable either way.
Open →Close with portability: proof is an artifact. Validate it independently—without Hexarch UI, dashboards, or trust.
Open →