Current release status
Public document hashing and exact integer aggregation are live with signed results. Native consensus, mining, issuance, COMPUTE payments and rewards are inactive. Independent operation is not yet demonstrated.
Evidence terms
Workload identity: code/input commitment. Package: reproducible execution description. Signed receipt: policy-bound attestations and result commitments. Attesting identity: a key, not necessarily another person. Independent operator: separately administered infrastructure/keys, requiring real evidence.
Consensus and economics
Canonical ordering: proposed greatest validated accumulated resource work. Confirmation: local reversible inclusion depth, not absolute finality. COMPUTE: native accounting/reward unit; historical 350 issuance is preserved. Qualification: scoped tests, not production activation or a guarantee.
The layered verification pipeline
Different verification mechanisms answer different questions. The implemented public lane makes a narrow result independently checkable; broader proof systems remain research.
| Boundary | Implementation / evidence | Meaning |
|---|---|---|
| Identity / package | Recovered ZIP 1 and ZIP 2 tooling | Identifies code, inputs and runtime declarations |
| Execution / replay | Registered Node profiles | Real bounded hashing and exact integer arithmetic |
| Signed evidence | Ed25519 / known policy | Authenticates an execution attestation |
| General proofs | ZK / zkVM / hardware attestation | Research—not qualified guarantees in today’s public service |
Practical procedure
- 1Choose a supported profile and explicitly public input.
- 2Execute fixed source under the qualified runtime boundary.
- 3Compare outputs across separate replay processes.
- 4Verify the signed artifact and recompute the supported result.
Public input → registered package → bounded execution → assignment-bound signatures → output and receipt commitments → portable result / on-device checks
Limits and failure cases
- No arbitrary customer program, AI proof or universal correctness claim.
- A deterministic output can be independently recomputed; administration independence needs separate evidence.
- No synthetic score is substituted when execution or signature validation fails.