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.
Live verification
Supported jobs are document SHA-256 of up to 64 KiB of public UTF-8 text, or exact sums of up to 1,000 canonical integer strings, each up to 32 characters. Registered source and bounded inputs restrict execution; arbitrary uploaded code is not enabled.
Methods
Separate processes execute and sign policy-bound results. The initial workers share one administration. A user can independently recompute a bounded result and verify signatures; genuine independently administered network verification remains unqualified.
Research boundaries
ZIP1/ZIP2 identity/package tooling, replay and signed evidence are meaningful implemented components. General ZK/zkVM, universal correctness, hardware attestation, consensus finality and arbitrary AI verification are not available as qualified public guarantees.
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.