Back to Blog
Web3AIBlockchain

Commit–Reveal AI Oracles: Verifiable On‑Chain Decisions

Commit–reveal stops copycat oracles. Verdikta’s randomized AI committees post verifiable on‑chain verdicts with reasoning in minutes.

Verdikta Team
November 20, 2025
8 min read

Commit–Reveal AI Oracles: Verifiable On‑Chain Decisions

AI decisions now move real money. If a single oracle can be copied, coerced, or delayed, your contract’s outcome is at risk. Verdikta uses a commit–reveal oracle, randomized committees, and an on‑chain verdict with linked reasoning to make subjective checks safe to automate.

The stakes: subjective calls need trustless rails

Priya runs a design studio. Twice this quarter a client refused to release escrow, saying the work “didn’t meet expectations.” She can’t wait months or burn margins on lawyers. Her developer bundles the brief, deliverables, and email history into an IPFS evidence package and calls Verdikta on Base L2. Minutes later, her wallet pings—a verdict event. Funds move automatically, and two justification CIDs explain why the work passed. What changed? No single oracle could copy or pivot. Each arbiter had to lock an answer before anyone saw another’s.

How commit–reveal stops copying and drift

Each arbiter evaluates off‑chain, then commits a hash of its answer before any result is public: bytes16(SHA‑256([sender, likelihoods, salt])). After the commit window closes, arbiters reveal their scores and the salt; the contract recomputes the hash and rejects mismatches. Defaults provide redundancy under load (K=6 polled, M=4 committed, N=3 revealed). This design prevents freeloading and after‑the‑fact coordination while creating a verifiable audit trail end‑to‑end. Trade‑off: the extra round adds a few seconds of latency, but it buys stronger finality and tamper‑evidence—exactly what on‑chain arbitration needs.

Randomized, reputation‑weighted committees

Targeting a committee should be impractical. Verdikta draws from active arbiters that support the requested class using pseudorandom selection that mixes chain entropy (prevrandao) with rolling salts from prior reveals. Selection weights favor quality and timeliness (reputation) and penalize high fee bids. The result: honest, cost‑efficient arbiters are chosen more often; attackers can’t predict or cheaply bribe “the judges.” Deviations from consensus burn quality score and reduce future selection and income.

On‑chain verdicts plus reasoning you can inspect

When N valid reveals arrive, Verdikta clusters the closest responses (P=2 by default), averages their likelihoods, and finalizes on‑chain. The contract emits FulfillAIEvaluation with aggregated scores and combined justification CIDs. Your contracts get deterministic callbacks; your users can retrieve the CIDs to read why a result was reached. It’s verifiable on‑chain arbitration with human‑readable transparency, not an opaque AI endpoint.

Threat model in one paragraph

Bribery and collusion require predicting the committee and coordinating a majority. Commit–reveal removes copy paths. Entropy‑backed selection blocks targeting. Outliers take quality hits that throttle future selection. Only majority capture on a given case could sway an outcome, which becomes economically irrational as stake, reputation, and future fees are at risk across many cases. That’s why decentralized AI arbiters make trustless subjective decisions practical.

Where to use it today

DAO grant milestone checks: package progress evidence, seal early judgments via commit–reveal, and let a Safe/multisig route payouts on the verdict event. Marketplace seller‑ban appeals: submit policy and evidence; arbiters commit blind, reveal, and post a transparent decision with CIDs the community can review. Escrow disputes, content appeals, and grant gates are live patterns for an AI decision oracle on Base.

Ship it in minutes

  • Drop a CID: upload evidence to IPFS and call requestAIEvaluationWithApproval().
  • Listen for the verdict: subscribe to FulfillAIEvaluation and read aggregated scores.
  • Route actions: release funds, issue refunds, or reinstate access; surface justification CIDs in your UI.

See How it works and code samples in the developer docs.

Conclusion: trust at machine speed

Commit–reveal, randomized selection, and on‑chain callbacks form a coherent defense against copying, collusion, and bias. Start with one subjective check. Drop a CID, get a verdict event, and let your contracts act. Build with Verdikta on Base or book a pilot.

Published by Verdikta Team

Interested in Building with Verdikta?

Join our community of developers and node operators