Understanding UOR

Core Concepts

Deep-dive explanations connecting formal ontology definitions to the intuitions behind the framework:

• kernel Addressing — **Content addressing** in UOR maps ring elements to Braille-encoded strings via a bijective encoding. Each Element represents a content-addressable identifier where each byte encodes a chunk of the element value.
• kernel Algebraic Laws — The UOR Foundation ontology formalizes **7 core algebras** (with additional identity families from Amendments 23–53) that govern computation over the ring R_n = Z/(2^n)Z. Each algebra is encoded as a set of named Identity individuals in the `op/` namespace, with `lhs`, `rhs`, and `forAll` properties specifying the algebraic equation and its quantifier domain.
• kernel Analytical Completeness — **Analytical completeness** means that the UOR ontology provides a complete topological and spectral characterization of the resolution process. Three structures make this possible: the Cech nerve, Betti numbers, and the index theorem.
• kernel Canonical Form — A **canonical form** is the unique representative of an equivalence class of terms under the rewrite rules of the UOR framework. The CanonicalFormResolver computes canonical forms by applying the critical identity and normalization rules until no further rewrites are possible.
• bridge Certification and Verification — The final stage of the PRISM pipeline is **Certify**: every resolution result must be attested with a machine-verifiable certificate before it leaves the pipeline. The cert namespace encodes this attestation layer.
• kernel The `Certify<I>` Trait — --- title: Certify Trait category: concepts ---
• kernel Cohomology — **Cohomology** is the algebraic dual of homology. Where chain groups map downward via boundary operators, **cochain groups** map upward via coboundary operators. The CochainGroup C^k is the dual of the chain group C_k, consisting of linear functionals on k-chains.
• kernel Composition — **Composition** is the categorical backbone of the UOR transform system. It turns the collection of transforms into a category with identity morphisms and associative composition. The class Composition represents a transform formed by sequentially applying two or more transforms.
• kernel Constraint Algebra — The **constraint algebra** provides composable predicates that refine types by pinning site indices. A Constraint is a predicate that, when applied to a type, determines the value of one or more sites in the iterated Z/2Z fibration.
• kernel Content Addressing — Content addressing is the foundational principle of UOR: an object is identified by *what it is*, not *where it is*. The u namespace formalizes this with the Element class and the ContentAddressed interface.
• kernel Critical Identity — The critical identity is the foundational theorem of the UOR ring substrate:
• kernel Differential Calculus — The **discrete differential calculus** of UOR defines two derivative operators on functions f : R_n → R_n:
• kernel Evaluation — **Evaluation** is the process of computing concrete results from canonical forms. The EvaluationResolver implements this process: it takes a resolved type and evaluates it by applying operations to enumerate and classify ring elements.
• kernel Factorization — **Factorization** is the process of decomposing ring elements under the action of the dihedral group D_{2^n}. The DihedralFactorizationResolver implements this process, producing a Partition that classifies every element as irreducible, reducible, a unit, or exterior.
• kernel Free Rank — The **free rank** formalizes the completeness criterion for type resolution in the UOR framework. The ring R_n = Z/(2^n)Z admits an iterated Z/2Z fibration with exactly n binary sites. Each constraint applied during resolution **pins** one or more of these sites. When all n sites are pinned, the type is fully resolved and the partition is complete.
• kernel `Grounded<T>` — Compile-Time Ground-State Guarantee — --- title: Grounded Wrapper category: concepts ---
• bridge Homological Analysis — The homology and cohomology namespaces add an algebraic topology layer to UOR. When constraints interact in complex ways, topological invariants diagnose whether Resolution will converge or stall.
• kernel Homotopy Nerve — The **homotopy nerve** is the full homotopy-theoretic refinement of the constraint nerve. While the basic [Homology](homology.html) pipeline extracts chain-level invariants (Betti numbers), the homotopy nerve promotes the nerve to a KanComplex carrying the complete homotopy type — including higher homotopy groups, Postnikov truncations, and k-invariants.
• kernel Inhabitance Verdict — --- title: Inhabitance Verdict category: concepts ---
• kernel Iterative Resolution — **Iterative resolution** extends the resolution process into a learning loop. Rather than computing a partition in a single pass, the resolver proceeds iteratively: each iteration applies a constraint, pins sites, and checks whether the budget is closed. The process converges when all sites are pinned.
• kernel Moduli Space — The **moduli space** M_n is the space of all CompleteType instances over R_n at a given Witt level. Its geometry is governed by the DeformationComplex at each point, and its stratification is indexed by holonomy classes from [Monodromy](monodromy.html).
• kernel Monodromy — **Monodromy** in the UOR Framework describes how constraint types transform under parallel transport around closed loops in the constraint nerve. For a ConstrainedType over the ring R_n, the monodromy group is a subgroup of the dihedral group D\_{2^n}.
• user Morphisms and Transformations — The morphism namespace defines the maps between UOR objects. Where the kernel namespaces declare *what* objects are, and bridge namespaces compute *how* to resolve them, morphisms specify *how objects relate to each other* through structure-preserving transformations.
• bridge Observables & Measurement — The observable namespace defines what can be measured during resolution. Observables are bridge-space objects that quantify geometric, topological, and algebraic properties of ring elements and their types.
• bridge The Partition Decomposition — The partition namespace decomposes the address space into disjoint subsets. Every ring element is classified as irreducible, reducible, a unit, or exterior. This four-way decomposition is the structural backbone of the Resolve stage in the [PRISM](../pipeline/) pipeline.
• bridge Proofs, Derivations & Traces — The proof, derivation, and trace namespaces implement the certification pathway of the [PRISM](../pipeline/) pipeline. Every algebraic identity must be *proved*, every proof must be *derived* from axioms, and every derivation must be *traced* for reproducibility.
• kernel Witt Spectral Sequence — The **Witt level spectral sequence** is an algebraic machinery for deciding whether a CompleteType at Witt level W_n can be lifted to W_{n+1} without losing completeness. A WittLift record represents the candidate lift: it carries a liftBase (the W_n CompleteType), a liftTargetLevel (the target WittLevel), and a liftObstruction link.
• kernel Witt Universality — **Witt universality** is the property of an algebraic identity that holds for all Witt levels n ≥ 1, not just at a specific W8 ring. An identity is universally valid when it is provable symbolically from ring axioms rather than verified exhaustively at one ring size.
• bridge Resolution & Queries — Resolution is the core operation of the [PRISM](../pipeline/) pipeline's Resolve stage. A Query specifies what to resolve; a Resolver computes the answer by factorizing the input under the dihedral group D_{2^n}.
• kernel The Ring Substrate — Every UOR computation operates over a ring — specifically the modular integer ring Z/(2^n)Z, where n is determined by the Witt level. This document explains the ring structure, its physical motivation, and how it grounds the entire ontology.
• kernel Session Resolution — **Session resolution** is the multi-turn inference protocol in which a sequence of RelationQuery evaluations shares a common Context. Each resolved query appends a Binding to a BindingAccumulator, monotonically reducing the aggregate free site space for subsequent queries.
• kernel Sheaf Semantics — **Sheaf semantics** interprets the resolution pipeline through the lens of sheaf cohomology. The constraint topology — where open sets correspond to compatible subsets of constraints — carries a natural Sheaf of resolution data. This viewpoint unifies local constraint satisfaction with global resolution.
• bridge Site Bundle Semantics — UOR organizes typed data using the mathematical structure of a site bundle. Understanding site bundles explains why types in UOR behave the way they do, and why the Partition exists as a structural separator between kernel and user concerns.
• user State, Sessions, and Accumulation — The state namespace models the mutable side of the UOR framework. While the kernel is immutable and the bridge is purely computed, state captures what happens when a resolver accumulates bindings across a sequence of queries.
• kernel State Model — The UOR state model captures evaluation context — the bindings, frames, and transitions that comprise a computation. The `state/` namespace provides four mutually disjoint classes.
• kernel Type Completeness — **Type completeness** is the formal property of a ConstrainedType that guarantees resolution always terminates in O(1) time. A type is complete when its constraint nerve satisfies the completeness criterion IT\_7d: the Euler characteristic of the Cech nerve equals the Witt level _n_ and all Betti numbers β\_k are zero.
• kernel Type Synthesis — **Type synthesis** is the process of running the ψ-pipeline in inverse mode: given a target topological signature (Euler characteristic χ* and Betti profile β\*), the TypeSynthesisResolver searches the space of constraint combinations and produces a SynthesizedType that achieves the target.
• kernel Type System — The UOR type system provides a structured way to classify objects in the ring. The base class is TypeDefinition.
• kernel Witt Levels — Witt levels W8--W32 are the four scaling tiers of the UOR Ring substrate. Every computation, identity, and proof in UOR is valid at one or more Witt levels. Understanding Witt levels is essential for reading the algebraic identities and their associated proofs.

View all concepts →