Program Map: Universal Collapse Theory as a Coherence-First Research Program

Universal Collapse Theory as a Coherence-First Research Program

Architecture, Claims, and Falsification

Program Map · read after Kernel First · Structural Reference

Jeremy C. Jones

HoldingLight LLC — ORCID 0009-0007-2515-3774 — universalcollapse.com

Version: v1.0 (2026-06) | License: CC BY 4.0

DOI: 10.17605/OSF.IO/CFASB

What this document is

This is the program map. It places every part of the Universal Collapse Theory (UCT) corpus, states what kind of claim each part makes, and shows how each could fail. It is a structural reference, not an argument: it does not defend the kernel-first reading and it does not develop any domain. Those jobs belong to other documents.

UCT offers three orientation surfaces, each answering a different question. Kernel First answers how to read the framework — the conceptual gateway explaining why UCT is kernel-first rather than primitive-first, and how its central term should not be reified. The Reading Roadmap (universalcollapse.com/roadmap) answers where to start — curated reading paths by audience. This document answers what the program is — its layers, its claim taxonomy, and its falsification structure. Read it after Kernel First, when orientation is in place and the question becomes one of structure.

This is not the best first document for a casual reader; it is the best first document for anyone asking whether UCT has a coherent program architecture — levels, standards, tests, mappings, audits, and failure modes — rather than a single undifferentiated claim.

1. The kernel, in brief

The minimal kernel is the tuple (Ω, K, C^Kₜ, xₜ*, Rₜ, Sₜ, T, U): a structured possibility space Ω, an active constraint set K, a constraint-conditioned collapse operator C^Kₜ, a realized resolution xₜ*, a record layer Rₜ, a residue term Sₜ, a record-time index T, and a constraint-update map U. The operator acts as

C^Kₜ : Ω → (xₜ*, Rₜ, Sₜ, Ωₜ₊₁)

with constraints evolving through Kₜ₊₁ = U(Kₜ, xₜ*, Rₜ, Sₜ). In plain language: what could occur, under what constraints, resolves into what actuality, leaves what records and residue, and changes what can occur next. Two conventions are load-bearing throughout the corpus. Collapse names the operation; resolution names its achieved result — reserved and never interchanged, which is what keeps collapse from being read as a substance. And the kernel is substrate-neutral: the same eight-place structure is specialized to each domain by restricting Ω, K, R, and the remaining terms, without privileging any one substrate as the base of the others. T denotes record depth, T = Σ Rᵢ — the count of accumulated record layers, not a numerical sum of their contents. The full postulates this notation compresses are fixed in WP01; the anti-reification reading is developed in Kernel First.

2. The claim hierarchy: law, method, and mapping

Not every part of UCT claims the same kind of thing, and conflating the kinds is the fastest route to misreading the program — dismissing a tool because a law is unproven, or crediting a law because a tool works. The corpus distinguishes three claim levels, and a reader should always know which level a statement occupies.

Law, method, mapping

Across those levels, three working categories tell a reader what to expect from a given artifact. A law-level claim is a candidate regularity held under test — the Law of Coherence (collapse under constraint tends toward coherence), stated and assessed in WP05, which is deliberately held for last and written with its own drift test open. It is a claim on trial, not a settled result. A method-level claim is a tool that stands on its own terms — the Standards layer, the audit protocols, the reporting standards — usable, and falsifiable, whether or not the law holds. These shed value sideways: a working audit is a working audit even if the surrounding program fails. A mapping is the application of the kernel to a domain, and the corpus treats a mapping as metaphor until it yields a discriminator. The discipline is explicit: declared elegance is not world-contact; a mapping earns law- or method-status only by producing something that could have come out otherwise.

3. The architecture: layers of the program

The corpus is organized into structural layers, each doing a distinct job and each cross-referencing the others. They divide into two groups. The core research architecture carries the program’s evidentiary weight — the kernel, its domain plays, the hygiene layer, the standards that protect its integrity, and the formal–audit–empirical stack. The access and translation architecture carries the program outward to readers and into application — bridges, externalized-cognition work, the commercial wing, and entry points. The distinction matters: only the first group counts toward the research ledger. A thin program-level layer sits above both: the Tier 0 orientation gateway, and the architecture-and-governance documents — this map among them — that describe and hold the corpus accountable rather than adding to it. Section 7 gives the complete inventory with status and identifiers.

Core research architecture

Access and translation architecture

These layers carry no evidentiary weight on their own. Applied and commercial artifacts translate coherence-audit methods into deployed settings; they are not evidence for the law-level program unless separately audited, versioned, and entered into the public empirical ledger under the same standards as the T16 demonstrations. Bridges and entry points are reader-facing translations of formal claims, and are judged by whether they clarify those claims faithfully, not by what they appear to assert on their own. The principle is uniform: only public, auditable, versioned research artifacts count toward the ledger.

How each layer can fail

The map states not only what each layer does but how each could fail — the per-layer companion to the claim-level and program-level falsification developed in Section 5. A layer in good standing is one whose characteristic failure has been looked for and not found.

4. The signature stack: the worked spine

The program’s empirical core is a single repeated structure. Each of the three portable signatures is realized as a vertical column — a formal bound proved under stated assumptions (Technical Note), an audit protocol that translates the bound into a field test with a sharp falsifier (Methods paper), and at least one empirical run on real data (T16). The same three signatures are then exercised across three substrates — biology, cognition, and artificial systems — giving a worked matrix rather than a single demonstration. This is the structure a reader should follow top to bottom to see the framework do its work.

Where each signature breaks

A worked spine has to show not only that each signature exists but where it would fail. The bounds above hold only under stated assumptions, and each carries a sharp falsifier — a specific observation that would count against it. The companion table records both, at map level; the load-bearing detail is in the Technical Notes and Methods papers.

5. Claims and falsification

A coherence-first program that says “look for structure” must be unusually explicit about where it can fail, or it reads as unfalsifiable. UCT distributes its falsification across three levels: the individual claim, the integrity architecture that disciplines the whole, and the program as a Lakatosian research program.

5.1 Per-claim falsification

Falsification is written into the artifacts, not deferred to a separate promise. Every Technical Note states an acceptance criterion and a rejection criterion. Every Methods paper is built around a sharp model-conditional falsifier — the comparison of an observed curve against the scaling law an independently specified model predicts. Every T16 paper carries pre-specified falsifier conditions and classifies each result as observed, partial, absent, inconclusive, or inaccessible, with no obligation for any result to come out positive. The Structuralization of Empiricism adds five Level-3 divergence claims with explicit local failure conditions and a global portability challenge. A reader who wants to know how a given claim could be wrong can read its falsifier directly off the paper that makes it.

5.2 The integrity architecture

The Standards layer is the machinery that keeps the framework corrigible. Its four documents do four distinct jobs, and the roadmap places them separately rather than as a single block.

The UIS Empirical Ledger is load-bearing for what follows. It is the standing instrument by which audit outcomes — wins and failures — are recorded per domain, which is precisely what the program-level evaluation below depends on.

5.3 Program-level evaluation

The program as a whole is not falsified by any single result, and it does not carry a stated threshold whose breach ends it. That would be a category error — a research “programme” in Lakatos’s sense (his term) is not refuted by a failed prediction but is judged, over time, as progressive or degenerating: progressive when it keeps making new domains structurally legible and yielding fresh discriminators; degenerating when it survives only by relabeling what it cannot predict and bolting on exceptions to save its core. That verdict is empirical and longitudinal, read off an accumulating track record — not a philosophical proof, and not a condition statable in advance.

This places a real obligation on the program, and it is the one obligation that can be discharged now: honest bookkeeping of every audit outcome, so the eventual verdict is read off a complete ledger rather than a curated subset. Selectively remembering successes — reporting the favorable results and quietly dropping the null and failed ones — would make “progressive” a curated success narrative rather than a finding. The guard is the standing commitment to record the failures with the wins: the COGITATE B-failure and the S3-RAG-01 null are published as first-class outcomes, and the UIS Empirical Ledger is the instrument that keeps the full account. The willingness to record what came out against the framework is what makes the surviving results mean anything.

To keep that judgment from staying vague, the ledger is reviewed at release milestones — each review recording new discriminators, confirmations, nulls, failures, assumption changes, and any ad hoc repairs made to preserve a claim. The program reads as progressive when new discriminators and successful cross-domain transfers accumulate without a rising exception load, and as degenerating when negative outcomes are absorbed only by narrowing assumptions, relabeling results, or removing tests from view. This is a commitment to visible accounting, not a single-failure threshold: it makes the longitudinal verdict legible without pretending it can be triggered by any one result.

6. How to read the corpus

The library is not linear, and no reader needs to traverse all of it. Three doors serve three different needs, and a reader should enter through the one that matches the question they are bringing.

• To learn how to read UCT without misreading its central term — start with Kernel First. It is the orientation gateway: what UCT claims, what it does not, and why it is kernel-first rather than primitive-first.

• To find a path suited to a particular field — use the Reading Roadmap at universalcollapse.com/roadmap, which gives curated sequences for the general reader, physicist, biologist, cognitive scientist, philosopher, and methodology audiences.

• To see the program’s structure — its layers, claim taxonomy, and falsification architecture — use this document. It is the map, not the argument.

For the fastest single demonstration of what the framework does, the Schrödinger paper (We Are Never Having a Mathematical Experience) takes a problem everyone recognizes and dissolves it by separating a property of the model from a property of the world — no formalism, no prior exposure required. For the empirical spine, follow the signature stack in Section 4 down any one column. For the conceptual front gate, read any one of the Primes against your own priors; none requires accepting UCT to evaluate.

7. Complete corpus inventory

The current state of the corpus, by layer. Status and identifiers follow the canonical DOI registry; OSF DOIs are the persistent identifiers of record, with PhilArchive serving reading and OSF serving reproducibility depth. Where a DOI is not yet shown, the work is drafted or awaiting deposit. This inventory supersedes the layer tables of the internal System Map.

Status legend

Orientation (Tier 0)

The reader’s door — how UCT should be read before the domain papers develop the kernel. Further orientation pieces (e.g. The Tether) are in progress.

White papers (the spine)

Standards layer (integrity architecture)

Signature stack — formal bounds and audit protocols

Empirical demonstrations (T16)

Ground-clearing — Primes (T30)

The five Primes are live, minted as a set; each carries its own DOI and stands alone — cite the individual paper.

Bridges, mind/CIM, and entry points

Architecture & Governance (program-level)

Documents about the program as a whole — its architecture, its failure conditions, and its stacks in action. They describe and govern the corpus rather than developing or applying the kernel, and do not themselves count toward the research ledger; they deposit as a set.

Document status and use

This is a living reference and the canonical successor to the internal System Map. It is versioned independently of the papers it indexes: housekeeping updates increment the minor version; a structural reorganization increments the major version. Individual papers move on their own cadence and may have advanced beyond the versions shown here; this map is a point-in-time snapshot of the corpus, not a live index of it. The authoritative source for identifiers and deposit status remains the UCT Canonical DOI Registry; where this map and the registry diverge, the registry wins. A condensed, public-facing version of this map is mirrored at the roadmap address below.

UCT Library

This document is part of the Universal Collapse Theory library maintained by Jeremy C. Jones and HoldingLight LLC. Roadmap: universalcollapse.com/roadmap

AI Disclosure

AI tools were used to assist with manuscript preparation, drafting, organization, and editorial refinement. The underlying theory, structural decisions, analysis, and conclusions are the author’s own.

Suggested Citation

Jones, J. C. (2026). Universal Collapse Theory as a Coherence-First Research Program: Architecture, Claims, and Falsification (v1.0). HoldingLight LLC. https://doi.org/10.17605/OSF.IO/CFASB

© 2026 Jeremy C. Jones — HoldingLight LLC · CC BY 4.0