ORC: Opoch Reality Compiler
A Compiler for Derivational Intelligence
The complete mathematical derivation, formal proofs, and detailed technical specifications are proprietary intellectual property of Opoch. This public document provides a conceptual overview only. For licensing inquiries or research collaboration, contact hello@opoch.com.
Abstract
ORC is a compiler architecture that outputs decision objects rather than plausible text. Built from a single admissibility principle — witnessability — ORC exposes a universal interface: for any compiled query, it returns either a UNIQUE theorem package (answer, witness, verifier, receipt) or an Ω frontier package (surviving alternatives, minimal separator test, resource gap, receipt).
The Problem
Modern generative models optimize plausibility under a token distribution. This produces useful language, but it does not define a decision contract. In settings where correctness matters, a system must return a certified decision state, not merely an answer.
The ORC Interface
ORC formalizes a different interface:
- If a question is decidable under admissible tests and budget, return a unique answer with a witness and verifier
- If not decidable, return an explicit frontier of surviving alternatives and the minimal separating test that would decide, or the exact resource gap
This interface turns uncertainty into an executable object. It also makes the system robust to phrasing, because truth is defined by tests and receipts, not by surface form.
Core Principles
Witnessability
A distinction is admissible only if a finite witness and a halting verifier can separate it. Untestable distinctions are forbidden.
Finite Descriptions
All objects must be representable as finite descriptions. This is forced by the witnessability requirement.
Order-Free Evidence
The ledger records test outcomes. Order is irrelevant unless explicitly recorded. Truth depends on the set of constraints, not their sequence.
Gauge Independence
If renaming tests or recoding representations changes the output, the difference is untestable slack and must be removed.
ORC Output Contract
ORC returns exactly one of:
UNIQUE Package
| Field | Description |
|---|---|
| Answer | The unique decided value |
| Witness | Evidence supporting the answer |
| Verifier | Procedure that confirms the witness |
| Status | PASS |
| Receipt | Canonical hash for replay verification |
Ω Package
| Field | Description |
|---|---|
| Surviving family | Alternatives still consistent with evidence |
| Separator | Minimal test that would decide, or resource gap |
| Receipt | Canonical hash for replay verification |
System Architecture
ORC separates proposing from committing.
Proposer
Compiles unstructured input into a finite problem object. The proposer may be statistical. Its output is not trusted as truth — it is treated as a compilation candidate.
Commit Gate
A deterministic commit gate enforces:
- Binding discipline
- Evidence addressing (span IDs, table-cell IDs, artifact hashes)
- Recomputation of arithmetic and transformations
- Contradiction witnesses when failing
Only committed objects enter the ledger.
Ledger and Closure Engine
Maintains the evidence ledger, computes survivors, truth objects, frontier objects, and optimal next separators.
Structural Reality Substrate
ORC becomes a system once it can persist structure across time.
Ledger-First Storage
- Artifacts with provenance
- Claims with verifier contracts
- Evidence objects grounded to artifacts
- Records and receipts
- Identity classes for merges
- Frontier objects for unresolved boundaries
Graph indices accelerate retrieval, but truth is ledger-induced.
Mainland vs Tissue
Claims can exist as candidates. Promotion to "mainland" requires passing separator tests with independent receipts. Internally consistent but unsupported clusters remain as frontiers or low-support tissue.
Memory and Execution
Representations
Use efficient vector representations for activation and routing, not for truth. Retrieval uses normalized alignment with occupancy control.
Energy-Based Activation
Memory is an energy field over the structural substrate:
- Resonance activates relevant nodes
- Conductivity spreads activation along causal edges
- Cooling decays unused structure
- Active-set constraint bounds working context
Execution Layer
Frontier packages include actionable tasks. Execution can be routed to compute, agents, or laboratories. Verified results append to the ledger, shrinking frontiers and caching truth for future verification.
Evaluation
Evaluate decision integrity, not fluency:
| Metric | Description |
|---|---|
| Replay rate | Receipts that verify on replay |
| Frontier reduction | Shrink per unit cost of separator |
| Paraphrase stability | Same decision under rephrasing |
| Merge precision | Identity accuracy under certification |
| Provenance completeness | Evidence chain coverage |
Limitations
ORC can decide only what admissible tests can decide under budget. Frontier domains will often return Ω until new tests or measurements enter the ledger.
This is not a weakness; it is the correct behavior under witnessability.
Conclusion
ORC defines derivational intelligence as a forced decision contract derived from witnessability. It replaces probabilistic guessing with closure under tests and explicit frontiers.
The system:
- Compiles questions into verifiable objects
- Commits only what can be replayed
- Turns unresolved uncertainty into minimal executable tests
This architecture supports a persistent structural reality substrate and a path to a theorem generator for all witnessable questions.
For the complete specification: Contact Opoch for licensing and collaboration opportunities.
Email: hello@opoch.com
Related: Gauge-Invariant Truth Machine (GITM) — The operational implementation
Related: Energy-Based Causal Memory — The memory substrate
OPOCH - www.opoch.com