> For the complete documentation index, see [llms.txt](https://docs.cournot.ai/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://docs.cournot.ai/architecture/why-cournot-is-different.md).
# Why Cournot is Different
### 1. Semantic Scalability
**Traditional oracle architecture:**
*New requirement → New feed → New integration*
**Cournot Oracle architecture:**
***Trusted data → Semantic query → Deterministic computation***
The same underlying infrastructure can support dramatically more use cases. Instead of scaling by adding feeds, Cournot scales by adding queries and skills over a resilient data layer.
### 2. Resilience by Design
Cournot does not depend on one oracle or one data provider. Multiple independent sources can be combined, compared, and scored before producing the final output. This reduces single-source failure risk while creating a stronger foundation for application-specific queries.
### 3. AI Without Replacing Determinism
Cournot does not use large AI models unnecessarily. For structured use cases such as crypto, equities, weather, or sports:
**Natural Language → AI Interpretation → SQL / Deterministic Code → Verified Result**
AI interprets the requirement; deterministic computation produces the answer. For harder real-world events, Cournot progressively adds evidence retrieval, reasoning, verification, and human escalation; each layer applied only when the previous one is insufficient.
### 4. Verifiable AI: The zkTLS + opML Foundation
Cournot's goal is not to ask applications to trust an AI model. It is to make AI inference provable so that any participant can verify the result without re-running the computation themselves.
This is achieved through two complementary technologies:
1. **zkTLS: Proving the Inputs**\
Zero Knowledge Transport Layer Security proves that evidence originated from a specific source via a verified TLS session, without revealing the raw data. This solves the evidence trust problem: you don't need to trust the Collector, because the proof is cryptographically self-verifying.
2. **opML Proving the Reasoning**\
Optimistic Machine Learning proves that AI inference was computed correctly over the verified inputs. Rather than requiring multiple nodes to re-execute the same expensive inference, opML allows any single honest node to submit a compact fraud proof via bisection if the result is wrong.
Together, they create a one-honest-node verification model:
The trust stack becomes:
This is fundamentally different from architectures where N nodes must independently run the same model to reach consensus. In those systems, inference cost scales as O(model\_cost × N). In Cournot, inference runs once; verification cost is O(1) per challenge. The security guarantee comes not from redundant computation, but from the economic certainty that any fraud will be caught and punished by a single honest Sentinel.
***
