Verifiable inference is the core constraint of onchain AI.
If a smart contract consumes model output,
the question is not intelligence.
It is integrity.
On
@OpenGradient, inference is treated as a verifiable computation process rather than a blind API call.
Execution occurs within a secured compute environment. The output is accompanied by attestation data. The contract consumes both the result and its proof.
Inference attestation begins at the execution layer. When a model runs inside a Trusted Execution Environment (TEE), the hardware enclave generates a cryptographic report.
This report binds:
- Model hash
- Input hash
- Execution environment measurement
- Output hash
The attestation proves that a specific model version executed on specific input inside a measured environment without external tampering.
@OpenGradient structures inference around this attested execution model.
TEE-based verification is hardware-rooted.
The trust assumption shifts to:
- CPU manufacturer security guarantees
- Remote attestation validity
- Enclave isolation integrity
This approach is computationally efficient
and suitable for large-scale inference workloads.
However, TEE verification is not mathematically trustless.
Zero-knowledge (zk) based verification models represent a different path. Instead of relying on hardware isolation, zk systems generate a proof that the computation followed a defined circuit.
For AI inference, this means:
Proving that matrix operations and activation flows
were executed correctly
without revealing sensitive data.
The constraint is cost.
General-purpose zk proofs for large neural networks remain computationally expensive.
@OpenGradient currently optimizes for practical scalability through TEE-backed attestation,
while the broader research direction explores zk-verifiable inference as a future evolution.
Deterministic vs probabilistic output validation introduces another layer. Blockchains expect deterministic computation. AI models are inherently probabilistic.
Two runs of the same model may produce different outputs depending on sampling parameters.
@OpenGradient addresses this by:
Fixing inference parameters
Hashing model weights
Hashing exact input payloads
The attestation then binds to a single execution instance.
The proof does not claim universal correctness.
It proves that a defined model version produced a specific output under controlled conditions.
This is execution integrity, not epistemic truth.
Trust minimization in AI execution is therefore layered.
At the lowest level:
Hardware attestation ensures isolation.
At the protocol level:
Model registries ensure version transparency.
At the contract level:
Only attested outputs are accepted as valid inputs.
On
@OpenGradient, inference becomes a composable primitive because proof travels with output. Contracts do not trust nodes. They verify execution evidence.
The result is a shift from opaque AI services
to auditable reasoning infrastructure.
In this architecture,
@OpenGradient does not claim that AI is infallible.
It ensures that whatever reasoning occurs
is provably the reasoning that was executed.