Time as Finality

The past is what has become hard to undo.

Time as Finality is the founding and lead research program of an open mathematical investigation into how stable structure is preserved, transformed, forgotten, and newly created as it moves across recursively nested organizational levels. The program asks whether observer-relative temporal order and classical objectivity can arise from the stabilization of physical records across causally bounded systems — and uses that question to drive the development of more precise mathematics.

The mathematics does not assume the answer. It searches for the smallest set of formal principles capable of explaining what the evidence actually shows. Some founding intuitions will survive that search. Others will not. Both outcomes are informative.

This is a claim-led formalization project: every major claim is labeled, linked, challenged, and paired with tests or failure conditions. The executable mathematics continuously determines which intuitions survive.

Computational-status language is tracked separately in COMPLEXITY-LEDGER.md. Check it before describing a result as brute-force, polynomial, theorem-backed, NP-hard, CSP-complete, or scalable.

Current Orientation

Read these first:

1. CHARTER.md - the active research question: whether a Lorentz-compatible preferred-frame or global-tick theory earns physical or explanatory standing.
2. Method - Research Program Guidelines.md
   • the methodology: how claims are typed, tested, demoted, absorbed, or killed.
3. Vision - North Star.md - speculative maximal-geometry context, not the current charter.
4. Coordination - Tri-Repo Division of Labor.md
   • an historical division-of-labor reference. Dynamic Unity now owns broader geometry-and-record integration; Time as Finality returns independently earned results or constraints by pointer.

The historical NORTH-STAR.md remains under Candidate North Star/archive/. The active project orientation is [[CHARTER|CHARTER.md]] plus the research method; the candidate North Star folder remains speculative context.

Cross-repo stress tests are kept separate from core claims. The current GU / Temporal Issuance bridge note is explorations/gu-effect-typed-witness-transport-stress-test-2026-06-25.md: it uses GU as a hostile testbed for TaF transport, projection, finality, and loss machinery without promoting any TaF or GU claim.

The dual-record opportunity placement note is explorations/dual-record-opportunity-finality-crosswalk-2026-06-25.md: it treats stable records and opportunity-edge records as a finite fixture specification for local-minimum escape. The first executable fixture is results/dual-record-opportunity-fixture-v0.1-results.md: growing adjacency beats the limited comparator but is absorbed by an exact fixed-latent edge panel, so the verdict remains Project[O] + Finalize[R] + Lose[K], not Issue[S].

Project Definition

Time as Finality asks whether:

A Lorentz-compatible preferred-frame, or global-tick, theory can earn physical or explanatory standing over the best current account of reality.

Record finality, observer access, relativity, quantum foundations, and causal order are the central comparison terrain—not assumptions in favor of the preferred-frame alternative.

What This Is

• An open formalization project organized around a falsifiable conjecture suite.
• A claim-by-claim research repository where every attractive intuition is treated as a hypothesis, made executable, and tested for counterexamples.
• A place to connect public essay claims to specific tests.
• An executable finite-graph model with documented positive and negative results.
• A research program whose mathematics may be accumulating independence from its founding application. Whether that independence has been earned is tracked in MATHEMATICAL-INDEPENDENCE-AUDIT.md.

What This Is Not

• Not a finished physical theory.
• Not a replacement for quantum mechanics, special relativity, general relativity, or thermodynamics.
• Not an attempt to prove that the founding intuitions are correct.
• Not a claim that human belief creates matter.
• Not a claim that decoherence alone solves the measurement problem.
• Not a claim that black-hole interiors are unreal.
• Not a completed proof that a deeper geometric substrate underlies the observer-relative structure.

Start Here

Reading the verdicts below. "Confirmed", "supported", and "Theorem" in these report titles almost always mean confirmed on a finite witness (a specific 3–8 element hand-built model), not a proven general theorem. The only generally-proven results are listed in COMPLEXITY-LEDGER.md and are narrow (T110, plus the elementary T45/T47 PO1-schema order-properties, which carry no temporal content). For the honest evidence tier of every claim, read the Canon Index at the top of CLAIM-LEDGER.md. In particular the Anti-Scalar Theorem (T49/T50) and the observer-colimit results (T51/T52) are finite-witness, not general theorems.

• TECHNICAL-NOTE-v0.1.md - first formal result and evidence verdict.
• TECHNICAL-REPORT-emergence-lab-v0.1.md
  • comparative result across reversible and irreversible local dynamics.
• TECHNICAL-REPORT-quantum-measurement-finality-v0.1.md
  • dynamical system-apparatus-environment measurement finality lab.
• TECHNICAL-REPORT-noisy-measurement-access-boundary-v0.1.md
  • noisy channel-level discriminator separating decoherence, environmental redundancy, and observer-relative finality.
• TECHNICAL-REPORT-stern-gerlach-access-window-v0.1.md
  • Stern-Gerlach detector-fragment proxy preserving the access-boundary distinction while weakening Q1 through threshold sensitivity.
• TECHNICAL-REPORT-detector-provenance-robustness-v0.1.md
  • detector-provenance robustness map showing when intervention-sensitive metadata preserve or fail to preserve D1 independence partitions.
• TECHNICAL-REPORT-physical-provenance-protocol-v0.1.md
  • physical provenance protocol audit replacing Boolean degradation flags with clock, authentication, trust, batching, back-action, and DAG parameters.
• TECHNICAL-REPORT-provenance-protocol-monte-carlo-v0.1.md
  • Monte Carlo stress-prior audit showing robust detector provenance recovery is confined to an engineered protocol region.
• TECHNICAL-REPORT-real-detector-stack-provenance-v0.1.md
  • source-anchored, posterior-modeled HydraHarp/White Rabbit/signed-archive detector stack mapping into the T72/T74 provenance model; not yet a measured deployment audit.
• TECHNICAL-REPORT-q1-detector-null-criterion-v0.1.md
  • compression of T66-T81 into a null criterion: current detector-side Q1 is an admissibility filter over raw-log provenance unless it beats passive, dashboard, and post hoc alternatives.
• TECHNICAL-REPORT-q1-branch-adjudication-v0.1.md
  • Q1 adjudication showing the quantum branch should split before paper language into access-boundary accounting, detector admissibility, weak-measurement reinstatement gate, and contextuality guardrail.
• TECHNICAL-REPORT-q1a-neighbor-comparison-v0.1.md
  • Q1A neighbor comparison weakening the surviving quantum branch to access-boundary and independence accounting unless a fixed-data witness separates it from standard frameworks.
• TECHNICAL-REPORT-q1a-fixed-data-witness-v0.1.md
  • fixed-data Q1A witness showing D1 can change with decoherence, fragment information, raw redundancy, and branch/history availability fixed, but only as conditional record-independence accounting.
• TECHNICAL-REPORT-ambiguous-tag-channel-independence-v0.1.md
  • ambiguous-tag hostile-family audit showing perturbation-only and signed-DAG-only raw-log fixtures can rescue the partition internally, but only as isolated pre-registered controls rather than empirical support.
• TECHNICAL-REPORT-detector-stack-export-map-v0.1.md
  • instrument-level export map showing that the HydraHarp/White Rabbit/signed archive route is admissible only as an augmented pre-registered T87 packet, not as native detector evidence or empirical support.
• TECHNICAL-REPORT-detector-dry-run-tier-gate-v0.1.md
  • T97/T133 integration gate showing that filled raw-log rows are necessary but not sufficient for detector packet admission; the T121/T133 wrapper and claimed tier must also be frozen before data collection.
• TECHNICAL-REPORT-weak-measurement-undo-cost-independence-v0.1.md
  • weak-measurement undo-cost audit showing that control-pulse energy, trajectory-derived cost, and postselected reversal success are null unless a calibrated independent meter changes the verdict with standard records fixed.
• TECHNICAL-REPORT-spacetime-aggregation-v0.1.md
  • finite gluing and obstruction model for S1 spacetime aggregation.
• TECHNICAL-REPORT-consensus-finality-crosswalk-v0.1.md
  • D1/distributed-systems finality crosswalk and bounded impossibility witness.
• TECHNICAL-REPORT-consensus-finality-impossibility-v0.1.md
  • executable bounded theorem check for D1/progress finality tradeoffs.
• TECHNICAL-REPORT-consensus-record-theorem-transfer-v0.1.md
  • theorem-transfer test between distributed consensus and physical record finality.
• TECHNICAL-REPORT-bell-contextuality-finality-v0.1.md
  • Bell/CHSH contextuality and score comparison for local finality without global section.
• TECHNICAL-REPORT-d1-physical-reduction-map-v0.1.md
  • D1 physical reduction-map audit and executable holder-redundancy check.
• TECHNICAL-REPORT-invariant-preserving-transformations-v0.1.md
  • typed invariant-transport kernel with composition and obstruction checks.
• TECHNICAL-REPORT-d1-multiscale-observer-field-v0.1.md
  • scalar/vector/field audit for D1 across observer populations and transport.
• TECHNICAL-REPORT-minimal-d1-generalization-v0.1.md
  • minimal D1 generalization audit across scalar, vector, graph, sheaf-like, and IPT-representation candidates.
• TECHNICAL-REPORT-d1-restriction-system-v0.1.md
  • formal finite graph-indexed D1 restriction system with projection, gluing, and morphism checks.
• TECHNICAL-REPORT-class-relative-bridge-audit-v0.1.md
  • finite bridge audit for selected class-relative no-go patterns.
• TECHNICAL-NOTE-impossibility-gluing-obstruction-v0.1.md
  • cross-domain note comparing T27 and T28 finite gluing obstructions.
• TECHNICAL-REPORT-projection-obstruction-schema-v0.1.md
  • reusable finite Projection-Obstruction Schema extracted from T27.
• TECHNICAL-REPORT-cross-domain-projection-obstruction-validation-v0.1.md
  • hostile non-physics validation of PO1 with Git, financial risk, and translator/poet cases.
• TECHNICAL-REPORT-po1-admissibility-conditions-v0.1.md
  • PO1 admissibility checklist and reclassification across T27-T30 cases.
• TECHNICAL-REPORT-po1-admissibility-derivation-v0.1.md
  • derivation audit showing AC4 follows from AC6 and PO1 compresses to a four-principle basis.
• TECHNICAL-REPORT-po1-foundational-derivation-v0.1.md
  • IPT/RMT hypothesis matrix (H0-H5); H3 best supported; AC5-naming recommended as Principle P5.
• TECHNICAL-REPORT-po1-chained-projection-v0.1.md
  • Chained projection analysis with emergent obstruction (Spectre), stepwise propagation, and absorbed obstruction across the code-to-transistors chain.
• TECHNICAL-REPORT-compression-finality-crosswalk-v0.1.md
  • Compression as a downstream observable of stable records, not a D1 dimension; Rule 30 and Rule 0 counterexamples across all 256 CA rules.
• TECHNICAL-REPORT-typed-transport-network-v0.1.md
  • TypedTransportNetwork: finite directed graph of D1RestrictionSystems connected by typed morphisms; path-dependent admissibility witnessed.
• TECHNICAL-REPORT-finality-direction-theorem-v0.1.md
  • constructor-style theorem check for finality-induced temporal direction.
• TECHNICAL-REPORT-finite-permutation-monotone-obstruction-v0.1.md
  • finite closed reversible systems cannot carry a strict scalar finality monotone; H7 must be conditional, open-system, or coarse-grained.
• TECHNICAL-REPORT-open-markov-record-entropy-v0.1.md
  • open stochastic record arrows are absorbed by path irreversibility, exported history, or fresh blank capacity in the tested fixtures.
• TECHNICAL-REPORT-stationary-markov-monotone-obstruction-v0.1.md
  • finite stationary Markov dynamics cannot carry a strict scalar expected-finality monotone on stationary support.
• TECHNICAL-REPORT-constructor-admissibility-grounding-audit-v0.1.md
  • reverse-edge ledger showing current H7 witnesses permit only constructor-only or resource-accounting readings, not an unqualified physical arrow.
• TECHNICAL-REPORT-maintenance-viability-split-v0.1.md
  • matched entropy/control/stability/viability examples split on future operation rights, but are largely absorbed by provenance and reconstruction debt once those are modeled.
• TECHNICAL-REPORT-accessible-state-space-separation-v0.1.md
  • ASP separates finite matched coarse-metric cases, but collapses into enriched reachable-state, opportunity-set, and provenance analysis.
• TECHNICAL-REPORT-minimal-multiscale-transport-v0.1.md
  • minimal transport formalization: H0-H4 comparison; H1+ (TypedTransportNetwork
    • CompressionRecord + EmergenceRecord) is the smallest justified formalism; network-propagation audit proposed as next step.
• TECHNICAL-REPORT-csp-satisfiability-reframing-v0.1.md
  • CSP reframing: PO1 gluing obstruction = binary {-1,1} parity-conflict CSP; typed projection and admissibility classification are new structure beyond CSP.
• TECHNICAL-REPORT-holarchy-lab-v0.1.md
  • Holarchy lab: holonic emergence confirmed; cross-level AC5 necessary for holonic PO1; H_B best supported.
• TECHNICAL-REPORT-typed-transport-category-v0.1.md
  • Typed transport category: D1RestrictionMorphisms form a proper category; associativity, identity morphisms, and unit laws all hold; PO1 is not a Boolean functor on D1Cat (T34 restated categorically); H_A best supported.
• TECHNICAL-REPORT-local-persistence-reconciliation-split-v0.1.md
  • Local persistence/reconciliation split: finite witnesses separate local accumulation from record-access lag; signal delay is not treated as time dilation; H2 best supported.
• TECHNICAL-REPORT-local-persistence-mechanisms-v0.1.md
  • Local persistence mechanism audit: intrinsic rate, finite resource budget, and interaction density alter local accumulation with propagation fixed; equivalent traces make H4 best supported.
• TECHNICAL-REPORT-local-mechanism-identifiability-v0.1.md
  • Local mechanism identifiability: finite probes show baseline traces remain ambiguous, while demand-drop plus coupling-rewire separates the T43 mechanism families; H4 best supported.
• TECHNICAL-REPORT-open-causal-scarcity-synchronization-boundary-v0.1.md
  • Open causal scarcity and closed synchronization boundary: finite RecordAccessSystem witnesses distinguish causal-proximity first access from membership-plus-synchronization commit order; H3 best supported; CS1 remains a candidate claim only.
• TECHNICAL-REPORT-measurement-po1-asymmetry-v0.1.md
  • Measurement as PO1 morphism: forward morphism f: Y->X fully admissible; inverse fails AC6+AC7; Measurement Asymmetry Theorem confirmed: no PO1-admissible morphism can originate from an obstructed system.
• TECHNICAL-REPORT-po1-dag-theorem-v0.1.md
  • PO1 DAG Theorem: PO1-admissible morphisms in D1Cat form an acyclic bipartite graph (depth <= 1) between pre-finality (unobstructed) and post-finality (obstructed) systems; all four structural hypotheses confirmed.
• TECHNICAL-REPORT-finali-event-structure-v0.1.md
  • FinaliEvent Structure: unordered set of PO1-admissible morphisms equipped with a record-dependency partial order; partial order axioms verified; incomparable events (spacelike separation) confirmed; NPW event structure compatibility established; all four hypotheses supported.
• TECHNICAL-REPORT-reconstruction-without-background-time-v0.1.md
  • Reconstruction Without Background Time: 2-axis (causal, info) componentwise order exactly matches T48 record-dependency order (9/9 pairs); exactly 2 valid topological sorts; Anti-Scalar Theorem confirmed (no total preorder can replicate a partial order with incomparable elements); no temporal variable in any reconstruction definition; all four hypotheses supported.
• TECHNICAL-REPORT-axis-monotonicity-theorem-v0.1.md
  • Axis Monotonicity Theorem: AM is the exact condition under which finality-axis dominance equals record-dependency order; sufficiency theorem proved; minimal counterexample constructed (1 MISSING violation via causal-axis reversal); axis necessity confirmed ({causal, info} is minimal basis); Anti-Scalar Corollary derived; all four hypotheses supported.
• TECHNICAL-REPORT-multi-observer-apparent-finality-colimit-v0.1.md
  • Multi-Observer Apparent Finality Colimit: colimit of two observer-relative FinaliEvent Structures is a consistent partial order (T47 acyclicity guarantees this); bounded record access produces one phantom incomparability (e1 || e3 apparent, e1 ≤ e3 in colimit); event finality strictly extends apparent finality; all three hypotheses supported.
• TECHNICAL-REPORT-symmetric-colimit-theorem-v0.1.md
  • Symmetric Colimit Theorem: 4-event witness; two observers each with complementary bounded access; symmetric phantom incomparability (A loses e1≤e4, B loses e1≤e3); colimit = full event-finality reference; AM fails locally for both observers, restored at colimit level; all four hypotheses supported.
• TECHNICAL-REPORT-observer-colimit-descent-boundary-v0.1.md
  • Observer-Colimit Descent Boundary: valid observer colimits do not automatically determine a unique canonical event-finality completion; T53 separates partial-order consistency, descent uniqueness, and finality-axis reconstructability. H2, H3, and H4 supported; H0 and H1 refuted; H5 partially supported as finite descent data, not full sheaf machinery.
• TECHNICAL-REPORT-finite-finality-descent-theorem-v0.1.md
  • Finite Finality Descent Theorem: canonical observer-relative temporal reconstruction requires finite descent conditions plus Axis Monotonicity; T51 and T52 classify as canonical, T53 classifies as underdetermined, and counterexamples show why identity, overlap, record compatibility, profile agreement, definable maps, and AM are necessary.
• TECHNICAL-REPORT-conflict-finalievent-descent-v0.1.md
  • Conflict-Enriched FinaliEvent Descent: T54 generalizes to non-empty conflict only after adding finite conflict checks for irreflexivity, comparable-conflict freedom, upward inheritance, and explicit conflict/compatibility disagreement.
• TECHNICAL-REPORT-finality-reflection-property-v0.1.md
  • Finality Reflection Property: the T56 gap assignment G(U)=A(U)-F(U) is restriction-closed in the tested finite model; automatic complement closure is refuted; arrow-direction circularity remains open.
• TECHNICAL-REPORT-finite-to-infinite-boundary-audit-v0.1.md
  • Finite-to-Infinite Boundary Audit: the T39 parity criterion survives the Mobius boundary only as a transition-aware Z2 special case; a coefficient-blind scalar encoding produces a false global section.
• EMERGENCE-LAB.md - laboratory definitions, physical assumptions, and required counterexamples.
• FORMALISM.md - primitives, observer taxonomy, preorder, and reconstruction rule.
• results/T1-v0.1-results.md - reproducible test results and counterexample.
• ESSAY.md - public essay, linked claim by claim.
• CLAIM-LEDGER.md - status of every major claim.
• HYPOTHESES.md - central hypothesis and failure conditions.
• TESTS.md - formalization and falsification paths.
• ROADMAP.md - best next contributions.
• GLOSSARY.md - working definitions.
• personas/INDEX.md - reusable persona lenses for structured critique.
• explorations/ - heterodox sketches kept separate from core claims.

How To Contribute

Pick a claim. Strengthen it, formalize it, connect it to existing literature, or break it.

Good contributions include:

• a sharper definition of physical finality;
• a toy model that reconstructs observer-relative temporal order;
• a counterexample showing the framework smuggles primitive time back in;
• a literature note connecting a claim to prior work;
• a test case from quantum measurement, relativity, thermodynamics, or black-hole physics;
• a revision that makes the public essay harder to misunderstand.

See CONTRIBUTING.md.

Repository Map

claims/         Claim-by-claim research notes.
tests/          Test proposals and toy formalization paths.
models/         Executable formal models.
results/        Reproducible model outputs and evidence verdicts.
literature/     Prior-art and known-neighbor notes.
open-problems/  Unresolved technical questions.
guardrails/     Explicit non-claims and misuse boundaries.
personas/       Reusable lenses for dialectical review and critique.
explorations/   Heterodox layer splits and sketches before claim promotion.

Run The Formal Model

python -m unittest discover -s tests -p "test_*.py" -v
python -m models.run_readme_formal_models

The helper above runs the README-declared model runners below in order with UTF-8 child-process output enabled. Use --list, --dry-run, or --start-after models.run_t56 for runner inspection or resume.

python -m models.run_t1
python -m models.run_t2
python -m models.run_emergence_lab
python -m models.run_t16
python -m models.run_t17
python -m models.run_t18
python -m models.run_t20
python -m models.run_t21
python -m models.run_t22
python -m models.run_t23
python -m models.run_t24
python -m models.run_t25
python -m models.run_t26
python -m models.run_t27
python -m models.run_t28
python -m models.run_t29
python -m models.run_t30
python -m models.run_t31
python -m models.run_t32
python -m models.run_t33
python -m models.run_t34
python -m models.run_t35
python -m models.run_t36
python -m models.run_t37
python -m models.run_t38
python -m models.run_t39
python -m models.run_t40
python -m models.run_t41
python -m models.run_t42
python -m models.run_t43
python -m models.run_t44
python -m models.run_t45
python -m models.run_t47
python -m models.run_t48
python -m models.run_t49
python -m models.run_t50
python -m models.run_t51
python -m models.run_t52
python -m models.run_t53
python -m models.run_t54
python -m models.run_t55
python -m models.run_t55b
python -m models.run_t56
python -m models.run_t57
python -m models.run_t58
python -m models.run_t59
python -m models.run_t62
python -m models.run_t64
python -m models.run_t72
python -m models.run_t74
python -m models.run_t75

Run Explorations

python -m models.run_ts_persona_sprint

Citation / Reuse

This is early-stage open research. If you use the framing, please attribute the project and link back to the repository.

First-Class Lanes

Load root LANES.yaml after this repository's governance and before selecting work. It is the owner-authoritative source for durable Lane definitions, admission, and normal control state; authoritative work remains at the paths it references. Numbered Lanes are Progress, lettered Lanes are Stewardship, and Discovery is Lane-less. A direct mount uses these local surfaces without CapacityOS. System observations, health, schedules, and execution history are not Lane truth.