Changelog

Current implementation, supported use and explicit qualification limits.

Experimental Feature

This feature is experimental and may change significantly in future versions.

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.

12 November 2026 website accuracy correction

Unsupported live validator/region/latency/volume claims and dashboard simulations were removed. Historical ledger data is separated from signed execution receipts; unsafe/unimplemented SDK/mining instructions are withdrawn.

Current engineering evidence

The public service is live; the frozen compound candidate is isolated-tested and unratified. No native consensus/rewards/issuance activation, financial transfer or governance handover is implied by this changelog.

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.

BoundaryImplementation / evidenceMeaning
Identity / packageRecovered ZIP 1 and ZIP 2 toolingIdentifies code, inputs and runtime declarations
Execution / replayRegistered Node profilesReal bounded hashing and exact integer arithmetic
Signed evidenceEd25519 / known policyAuthenticates an execution attestation
General proofsZK / zkVM / hardware attestationResearch—not qualified guarantees in today’s public service

Practical procedure

  1. 1Choose a supported profile and explicitly public input.
  2. 2Execute fixed source under the qualified runtime boundary.
  3. 3Compare outputs across separate replay processes.
  4. 4Verify the signed artifact and recompute the supported result.
Technical reference · scope is explicit
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.