Proof of Reasoning (PoR)
Proof of Reasoning (PoR)
Proof of Reasoning (PoR) is the central engine of Oracle 3.0. It transforms AI inference from a fleeting, opaque process into a persistent, cryptographic evidence chain orchestrated via a Role-Based Standard Operating Procedure (SOP).While other architectures reduce AI to a single "inference call," Cournot enforces a granular, multi-agent workflow spanning the full resolution lifecycle, from raw data ingestion to the final verdict.
The Reasoning Merkle Tree
Cournot eliminates the "Black Box" problem by structuring AI cognition into a Merkle-ized Reasoning Trace:
Leaf Nodes: Each atomic step in the SOP is encapsulated as a cryptographic leaf (e.g., Leaf 1: zkTLS Fetch; Leaf 2: Fact Audit; Leaf 3: Final Verdict).
The Root: These leaves are aggregated to form a unique Reasoning Merkle Root.
The Anchor: By storing only the Root on-chain, Cournot achieves unbounded cognitive complexity with constant gas costs, allowing for deep verification without network congestion.
PromptSpec: The Semantic Contract
Ambiguity is the root cause of oracle disputes. A question like "Did the product launch?" can depend on public availability, region coverage, version number, or a specific distribution channel. Small wording differences can flip the settlement outcome entirely.
PromptSpec is Cournot's solution: a canonical semantic contract that deterministically specifies what is being resolved. It encodes:
The specific question under evaluation
Interpretive scope boundaries (what counts, what doesn't)
Verdict schemas (the set of valid outcomes)
Logical constraints (rules governing edge cases and exceptions)
PromptSpec makes resolution semantics explicit, repeatable, and inspectable. It separates semantic definition from execution, allowing deterministic resolution logic without sacrificing flexibility in market design.All resolution processes are bound to the same semantic definition, ensuring consistency across executions and verifications. Terms are defined and aligned off-chain before cryptographic commitment on-chain.
The SOP Framework: Three-Stage Verification
Oracle failures frequently stem from data source drift: shifts in availability, interpretation, freshness, or trustworthiness of inputs. Rather than treating data requirements implicitly, Cournot formalizes them as protocol-level responsibilities:
Permitted authoritative sources
Verifiable retrieval methods with cryptographic receipts
Freshness windows for temporal bounds
Conflict resolution rules for inconsistent evidence
Resolution proceeds through three stages, each with its own accountability:
Stage 1: Proof of Authenticity (Collector Role)
The Collector Agent retrieves evidence per predefined data requirements, admitting only items that meet authoritative source criteria and freshness constraints. Each item includes a cryptographic receipt.
Technology: zkTLS (Zero-Knowledge Transport Layer Security) generates zero-knowledge proofs confirming data origin via secure TLS sessions.
Accountability: The Collector stakes the network token on Source Integrity, with slashing penalties for invalid proofs.
Stage 2: Proof of Logic (Auditor Role)
The Auditor Agent performs structured reasoning exclusively over the PromptSpec and verified evidence, generating a Merkle-ized Reasoning Trace. Only the Reasoning Merkle Root is anchored on-chain, enabling granular auditing without excessive on-chain costs.
Technology: DSPy-Optimized Chain-of-Thought ensures reasoning follows structured, inspectable patterns.
Accountability: The Auditor stakes the network token on Logical Coherence, facing penalties for reasoning fallacies.
Stage 3: Proof of Determinism (Judge Role)
The Judge Agent maps reasoning outcomes deterministically to predefined verdict schemas, ensuring outputs are predictable and machine-verifiable.
Technology: Neuro-Symbolic Constraints (Outlines/Logit Locking) enforce that outputs conform to the verdict schema.
Accountability: The Judge stakes on Schema Compliance, guaranteeing machine-readable settlement payloads.
Verifiable Reasoning
Cournot divides oracle resolution into two distinct trust problems:
Evidence Trust: validating that evidence was collected from authorized sources
Reasoning Trust: ensuring verdicts correctly follow from agreed evidence
Evidence Trust is addressed through PromptSpec, DataRequirements, and EvidenceBundles, with zkTLS providing cryptographic proof that each piece of evidence originated from an authorized source via a verified TLS session. Once evidence is frozen and authenticated, reasoning verification becomes a separate, bounded computation challenge.
Cournot freezes the inputs to the reasoning stage:
Semantic specification (PromptSpec)
Finalized evidence bundle (authenticated via zkTLS)
Verdict schema
Reasoning policy
Fixed model weights and execution environment
This creates a replayable reasoning target and this is where opML (Optimistic Machine Learning) becomes essential.
Last updated