AIMB-X Labs Technical paper

Public Testnet Edition

Cryptographically Verified AI Inference Blockchain

AIMB-X proposes a Layer-1 in which an AI result does not gain authority because it came from a known operator or reputable infrastructure. It can influence protocol state only after cryptographic evidence establishes faithful model execution, bound inputs, and an unaltered output.

This Public Testnet Edition defines the verification architecture, execution boundary, developer-facing interfaces, and questions the testnet is intended to evaluate.

Trust model
AI outputs are untrusted by default.
Acceptance rule
Proof verification precedes state mutation.
Validator role
Verify proofs without re-running AI models.

Abstract

Verification, not reputation.

AIMB-X is an AI-native and Zero-Knowledge-native Layer-1 blockchain designed to make AI inference cryptographically verifiable, not merely observable or trusted.

AIMB-X begins from a narrow protocol question: what evidence should a decentralized system require before allowing an AI result to affect shared state? Its answer is proof, not reputation. AI outputs are untrusted by default and must be accompanied by zero-knowledge evidence bound to the execution in which they are used.

The proposed verification chain connects commitments to model weights and input tensors with a deterministic execution trace and output correctness. Context binding associates that proof with block height, chain ID, virtual-machine execution context, and caller address. Together, these properties define the acceptance boundary for an AI-driven state transition.

The same boundary shapes consensus and developer experience. Validators verify proofs instead of re-running AI models, while wallet and explorer interfaces expose verification status, proof indicators, and state-root visibility. The public testnet is intended to evaluate this architecture, developer onboarding, adversarial inference scenarios, proof latency, and user experience.

This paper answers
  • What must be proven before an AI output can affect state?
  • Where does verification sit in the execution path?
  • What do validators verify instead of re-running?
  • Which attacks and assumptions define the security boundary?
  • What should the public testnet teach protocol researchers?

Chapter 1

Motivation

The trust problem in AI systems

Modern AI systems are increasingly embedded in high-stakes workflows:

  • Financial executionAI output may influence economically sensitive actions.
  • Governance automationModel output may shape automated protocol decisions.
  • Autonomous agentsSoftware agents may act without immediate human review.
  • Smart contract decision logicInference can become an input to deterministic execution.
Implicit assumption
If an AI ran on reputable infrastructure, its output can be trusted.

This assumption breaks under adversarial conditions, economic incentives, and decentralized environments.

The problem is not whether an AI result can be observed. The problem is whether independent participants can determine that the result is admissible without inheriting trust in the party that produced it. An output can be available to every network participant and still lack evidence of how it was produced.

Trusted execution environments, off-chain attestations, and operator reputation place confidence in infrastructure or identity. Moving the same workflow on-chain can redistribute that confidence to validators, but redistribution is not verification: the acceptance rule still depends on a party being correct.

Why on-chain AI is not enough

Putting AI on-chain without verifiability only shifts the trust boundary:

Model correctness
Trust moves to operator correctness
Centralized servers
Trust moves to validators

AIMB-X rejects trust aggregation and instead enforces cryptographic correctness.

The source of an output does not determine whether the protocol accepts it. Acceptance depends on whether the required proof verifies under the current execution context. This moves the trust boundary from operator identity to evidence about the computation.

Chapter 2

Core principle

System rule
Do not trust AI outputs. Verify them cryptographically.

Every AI inference that influences protocol state must be accompanied by a zero-knowledge proof that:

  • The model was executed faithfully.
  • The inputs were bound to on-chain context.
  • The output was not altered or forged.
Which model?

Committed weights

A model-weights commitment binds the evidence to the model used for the inference.

Which input and context?

Bound execution

The input commitment and on-chain context identify the data and environment in which the proof is valid.

Which result?

Proven output

The execution trace and output correctness establish that the result follows from the proven computation.

Chapter 3

System overview

AIMB-X places a cryptographic verification gate between AI inference and blockchain state mutation.

The execution path begins with a user or autonomous agent and ends with blockchain finality, but inference does not flow directly into shared state. The circuit establishes the computation, verification checks the evidence in context, and only then can the virtual machine apply the result.

Verified execution path
  1. User / AgentOriginates an inference request that may affect protocol state.
  2. AI Inference RequestIdentifies the computation that must be verified before acceptance.
  3. ZK-Inference CircuitProves the model, input, execution trace, and output properties.
  4. Proof VerificationChecks the evidence and its bound execution context.
  5. VM State TransitionApplies the result only after successful verification.
  6. Blockchain FinalityCarries the accepted transition into the chain’s finality path.

Proof verification must complete before the virtual machine can apply the resulting state transition.

Chapter 4

ZK-inference architecture

ZK-inference circuit

The ZK-inference circuit is the evidence layer between model execution and network acceptance. It proves four related properties of an execution.

  • Model weights commitmentBinds the proof to the model weights used for the inference.
  • Input tensor commitmentBinds the proof to the input while private inputs remain undisclosed.
  • Deterministic execution traceEstablishes faithful model execution along a deterministic trace.
  • Output tensor correctnessEstablishes that the stated output follows from the proven execution.

These properties form a chain of evidence. A proof about an output is insufficient if it is not also tied to the model, input, and execution that produced it. AIMB-X treats those relationships as part of the acceptance condition.

Context binding

A mathematically valid proof is not treated as universal authorization. AIMB-X binds each inference proof to four values from its on-chain execution context.

Proof context

Inference proof

  • Block height
  • Chain ID
  • VM execution context
  • Caller address

Binding these fields prevents replay, reuse, and cross-context attacks.

Verification therefore asks two questions at once: is the computation valid, and is this proof valid here? A proof created for one height, chain, VM context, or caller cannot simply be substituted into another execution.

Chapter 5

AIMB-X virtual machine

The AIMB-X virtual machine treats AI inference as provable computation rather than an oracle.

The virtual machine is where cryptographic evidence becomes protocol policy. AIMB-X treats inference as a first-class operation and applies one deterministic rule: verification must succeed before the result can mutate state.

  • AI inference is treated as a first-class opcode.
  • Proof verification occurs before state mutation.
  • Unverifiable outputs are rejected deterministically.
Proof-before-state invariant
InputAI inference + proof
Required gateProof verification
Proof verifiedVM state transition
Unverifiable outputDeterministic rejection

The execution path has two explicit outcomes. A verified proof permits the corresponding state transition. An unverifiable output is rejected deterministically; it is not accepted because of operator identity, infrastructure reputation, or an external trust label.

AI execution is not an oracle; it is a provable computation.

Chapter 6

Consensus and execution model

Consensus inherits the same verification boundary. Block production is deterministic, execution ordering is proof-first, and AI correctness is verified statelessly.

  • DeterministicBlock production
  • Proof-firstExecution ordering
  • StatelessVerification of AI correctness
Validators verifyProof validity and proof-first execution ordering

Network acceptance depends on the evidence accompanying the inference result.

Validators do notRe-run the underlying AI model

Repeating model execution is not the network’s correctness mechanism.

Validators do not re-run AI models. They verify proofs only.

This separates model execution from network acceptance. The party that performs an inference does not receive discretionary authority over protocol state, and validator agreement does not substitute for evidence of correct execution.

Chapter 7

Token model for testnet

Testnet token

The token is non-economic and is used for transaction fees, spam prevention, and execution accounting.

Faucet-based distribution

  • New wallets start with a zero balance.
  • Tokens require an explicit faucet claim.
  • Accounts are not automatically funded.

The testnet token is operational rather than economic. It supports fee-bearing execution, basic spam resistance, and accounting while the protocol architecture is being evaluated.

A zero-balance default and explicit faucet claim require wallets and applications to handle balance discovery, token acquisition, and transaction fees instead of relying on pre-funded accounts. This gives onboarding and execution flows more realistic operating conditions during testnet evaluation.

This preserves realistic economic assumptions from day one.

Chapter 8

Wallet and developer experience

The public-testnet experience connects wallet fundamentals with proof-aware interfaces. Developers can generate keys, query balances, sign offline, and inspect whether an AI-driven transition was cryptographically verified.

Wallet design

  • Deterministic key generation
  • Explicit balance queries through RPC
  • Offline signing support

Public testnet interfaces

  • Web wallet UI
  • Block explorer
  • Proof indicators
  • State-root visibility

Developer journey

  1. Create a walletGenerate keys deterministically.
  2. Inspect account stateQuery the wallet balance explicitly through RPC.
  3. Claim testnet tokensUse the faucet from a zero-balance starting state.
  4. Prepare and signConstruct the operation and use offline signing when required.
  5. Request inferenceA user or agent originates the AI inference request.
  6. Verify before executionPass through the ZK circuit and proof-verification gate.
  7. Observe the resultInspect proof status and the resulting state root.

Interfaces display verification status, not trust labels.

Chapter 9

Security model

The paper names four attack classes and makes the protocol’s response explicit: verify computation and context before permitting a state change. The matrix below describes how this edition addresses each threat; it is not an audit or an exhaustive security claim.

ThreatVerification materialProtocol response
Malicious model executionWeights commitment and deterministic execution traceRequire proof of faithful execution before mutation
Forged AI outputOutput tensor correctnessReject an output that cannot be verified
Replay or proof reuseHeight, chain ID, VM context, and caller bindingPrevent use outside the proof’s bound context
Context substitutionThe complete bound execution contextVerify computation and context together
Dishonest operatorProof-first virtual-machine enforcementRemove operator honesty from the stated assumptions
Stated assumptionsZK proof-system securityCryptographic hash collision resistance

AIMB-X does not claim to remove every cryptographic assumption. Within the boundary named by the paper, however, operator honesty is not assumed.

No assumption is made about operator honesty.

Chapter 10

Public testnet goals

The public testnet is designed to:

  • Validate protocol architecture.
  • Test developer onboarding.
  • Stress adversarial AI scenarios.
  • Collect feedback on proof latency and user experience.

Evaluation framework

Architecture

  • Does each state-influencing inference pass through verification?
  • Are unverifiable outputs rejected deterministically?
  • Can validators verify without re-running the model?

Adversarial behavior

  • Does context binding prevent replay and proof reuse?
  • Do forged outputs fail before they can alter state?

Developer onboarding

  • Can a new wallet move clearly from zero balance to faucet funding?
  • Are balance, proof, and state-root indicators understandable?

Proof latency and UX

  • Where does observed proof latency affect the experience?
  • Can users distinguish verification from a trust label?

Chapter 11

Roadmap

The roadmap is a progression of research and testnet capabilities, not a published schedule. The paper names four stages and attaches no dates, percentages, or completion claims.

  1. Stage SDeveloper Tooling & SDKs

    The developer-facing tooling stage named by the paper.

  2. Stage TAdversarial Inference Campaigns

    Evaluation of inference behavior under adversarial scenarios.

  3. Stage UGovernance Simulation

    Simulation of governance workflows within the protocol research program.

  4. Stage VEconomic Testnet

    The roadmap’s named economic-testnet stage.

Chapter 12

Conclusion

AI systems that are not trusted, but provably correct.

AIMB-X’s thesis is not that blockchains should trust AI providers more effectively. It is that an AI result should become protocol-relevant only when its execution can be verified under the protocol’s rules.

Model and input commitments identify what was executed. The deterministic execution trace and output-correctness proof establish the computation. Context binding limits where that proof is valid. The virtual machine then enforces the decisive boundary: verification before state mutation.

The public testnet is the environment in which this architecture is intended to be tested across protocol behavior, developer onboarding, adversarial inference scenarios, proof latency, and user experience. The resulting system aims to let AI participate in decentralized and economically sensitive workflows without treating operator honesty as a security assumption.

Web edition appendix

Reader glossary

Definitions below explain how key terms are used in this public testnet paper.

AI inference
Model execution whose result may influence protocol state.
Zero-knowledge proof
Cryptographic evidence used here to verify inference correctness without revealing raw model parameters or private inputs.
Commitment
A cryptographic binding used to associate a proof with model weights or an input tensor.
ZK-inference circuit
The proof layer that establishes the model, input, execution-trace, and output properties named by the paper.
Context binding
Association of a proof with block height, chain ID, VM execution context, and caller address.
Proof-first ordering
Execution ordering in which proof verification occurs before state mutation.
State transition
A change to protocol state permitted only after successful verification.
Stateless verification
Validator verification of AI correctness without re-running the AI model.
Verification status
The proof-oriented status exposed by AIMB-X interfaces instead of a reputation-based trust label.
Testnet faucet
The explicit mechanism through which a zero-balance wallet obtains non-economic testnet tokens.

Web edition appendix

Technical FAQ

Does AIMB-X trust the party that runs the AI model?

No. The paper treats AI outputs as untrusted by default and makes no security assumption about operator honesty.

Do validators re-run AI models?

No. Validators verify proofs only.

When can an AI output change blockchain state?

Only after its proof has been successfully verified by the execution path described in the paper.

What does the proof establish?

The paper names a model-weights commitment, input-tensor commitment, deterministic execution trace, and output-tensor correctness, with inputs bound to on-chain context.

What information remains private?

The paper states that raw model parameters and private inputs are not revealed.

Why is context binding necessary?

It binds a proof to block height, chain ID, VM execution context, and caller address to prevent replay, reuse, and cross-context attacks.

Is the testnet token an economic asset?

No. This edition describes it as non-economic and used for fees, spam prevention, and execution accounting.

Does this edition make mainnet guarantees?

No. It explicitly states that no mainnet guarantees are implied.