# Source extract: FA-SYN-02.docx ETP FINAL SYNTHESIS OUTLINE Truth-First Paper 0 Architecture for Basement Necessity, Time, Locality, and Objectivity Revision status. This successor preserves the useful Paper 0 insight of the attached outline but withdraws its assumption that relational potentiality, record formation, time, locality, and objectivity have already been derived as one ontological chain. It is synchronized with Core Synthesis Draft-07, Basement Provenance and Instantiation Protocol Version 03, Local Relational Time Version 56, the truth-first Local Relational Geometry program, and the synchronized objectivity and causal-interface manuscripts. 1. Paper 0, Not Paper 4 The synthesis paper is Paper 0 because it controls the architecture, dependencies, claim types, and nonpromotion rules for the specialized papers. It is not evidence that ETP is true merely because several papers produce compatible results. Its task is to show exactly which results can be composed, which inputs are inherited, which bridges remain open, and which conclusions are conditional, refuted, or empirically untested. The invalid inference is: three related papers exist, therefore ETP is true. The valid objective is: determine whether one candidate architecture can relate basement instantiation, event structure, temporal reconstruction, propagation diagnostics, and operational objectivity without hidden insertion or claim inflation. 2. Governing Question Primary question. What are the weakest logically coherent, physically interpretable, and empirically admissible conditions under which physical instantiation is possible or necessary, and what structures, if any, can then be reconstructed without hidden insertion? Secondary conditional question. If an instantiated relational basement is supported, derived, empirically identified, or explicitly postulated, can physical order, events, records, time, recoverability, locality diagnostics, geometry, and operational objectivity be reconstructed from it? 3. Truth-First Constitution • ETP is a candidate theory architecture. Nature is the authority. • Relational potentiality is a candidate basement, not a protected conclusion. • Logical necessity, formal sufficiency, physical necessity, physical sufficiency, and empirical adequacy remain separate. • No formal structure becomes physically instantiated merely because it is mathematically non-null, consistent, complex, relational, informational, energetic, or dynamically rich. • No downstream theorem may retroactively instantiate the carrier, event, record, clock, graph, probability law, or observer-access structure it presupposes. • Negative, null, nonunique, plural, primitive, underdetermined, and ETP-refuting outcomes count as research success when justified. • A family of incomparable minimum basements is admissible. • If no noncircular derivation of instantiation survives, physical instantiation must remain explicit as primitive, empirical identification, constitutive postulate, or unresolved bridge. 4. Three-Target Firewall Target III progress does not establish Target II, and Target II progress does not establish Target I. 5. Five-Layer Architecture 6. Foundational Candidate Set The synthesis must not begin with unqualified postulates that potentiality or records are fundamental. It should present a candidate set and allow the research to select, combine, restrict, or reject its members. 7. Part I: Basement Necessity and Instantiation • Define formal and physical nullity without embedding the conclusion. • Formalize the non-null provenance rule: where 0 is the relevant identity, 0 + X is not equal to 0 only if X is not equal to 0. • Generalize through the finite null-provenance closure theorem and complete-carrier audit. • Distinguish non-null ancestry from physical instantiation. • Test paired formal expansions with different instantiation assignments. • Compare serious basement candidates under the same necessity, sufficiency, bridge, and empirical-discrimination criteria. • Apply the stop rule if every successful derivation already contains instantiated content. 8. Part II: Conditional Emergence of Time LRT is a Layer 2 program. It does not derive time directly from undefined potentiality. It asks when already instantiated event, record, state-path, access, resource, calibration, and comparison data support temporal structures. • Record order does not equal metric duration. • Accessible Fisher geometry supplies statistical length in a declared experiment, not temporal substance. • Clock adequacy requires monotone calibration, global injectivity where claimed, constant calibrated speed where required, and recurrence control. • Comparison transports determine whether local clocks can be synchronized or exhibit holonomy. • Record and entropy balances support only conditional local-arrow claims. 9. Part III: Conditional Locality and Geometry The causal-bounds and LRG programs provide diagnostics and obstruction theorems over supplied physical or model structures. They do not turn an update count into spacetime or a propagation envelope into a Lorentzian light cone. • C_infinity, C_1, and C_bar answer distinct uniform, weighted, and embedded-average questions. • A Lieb-Robinson velocity is a bound parameter under a declared model and convention, not the measured speed of light. • Route families, clocks, propagation laws, speed conversions, adjacency, metrics, sector measures, and filtrations require provenance. • Finite metric and persistence data need not identify an ambient graph uniquely. • Gromov-Hausdorff convergence of supplied approximants is a legitimate metric theorem but not intrinsic physical reconstruction. • G2 remains blocked until the operational-to-geometric bridge contract is satisfied. 10. Part IV: Conditional Operational Objectivity Objectivity is reconstructed or certified only after systems, pointer alternatives, interactions, fragments, instruments, access structures, probabilities, and records are physically admitted or explicitly modeled. • Common-record preservation and fragment information are separate requirements. • HCOD detects false-positive objectivity under unresolved control or channel variation. • Causal nonseparability and environmental objectivity are logically independent operational properties. • Postselection redistributes information under exact average identities and probability-weighted tradeoffs; it does not instantiate outcomes. • Redundancy and consensus do not establish first-person definiteness, the Born rule, consciousness, intrinsic observers, or physical instantiation. 11. Failure Modes and Quality-Control Layer • Ontology-first assumption: treating relational potentiality as established because the theory uses it. • Formal-to-physical promotion: labeling mathematical structure as physically instantiated. • Downstream bootstrapping: using records, clocks, geometry, or objectivity to instantiate their own inputs. • Incomplete-carrier claims: omitting environments, controls, references, resources, memories, branches, or discarded outputs. • Witness incompleteness: treating failure of a restricted tester as physical identity. • Aggregation error: confusing averages with uniform sector control or allowing cancellation to erase physically relevant sectors. • Parameter conflation: treating update count, clock reading, statistical length, causal order, and thermodynamic direction as one variable. • Metric or topology relabeling: calling a supplied positive-definite form or graph an emergent geometry. • Simulation promotion: presenting finite model execution as an analytic theorem, asymptotic statement, experiment, or evidence for ETP. 12. Central Architecture Figure The earlier linear figure, Timeless Potentiality to Records to Time to Causal Structure to Locality to Objectivity, is withdrawn as a proved descent. It should be replaced by a gated dependency figure with explicit bridges and failure exits: Candidate Basement Class -> [Physical-Instantiation Bridge: open] -> Instantiated Event and Record Structure -> [Temporal Reconstruction] -> Local Time and Comparison -> [Operational-to-Geometric Bridge: open] -> Locality and Geometry Candidates -> Operational Objectivity and Higher Physical Tests Each arrow must display its required inputs, theorem status, countermodels, and whether the bridge is derived, conditional, postulated, empirical, primitive, or unresolved. 13. Why the Working Name Remains ETP Emergent. A research target: determine which effective structures are reconstructible and under what hypotheses. It is not a blanket claim that all listed structures have been derived. Timeless. The candidate foundational description does not assume a preferred external time. This does not prove that every admissible basement is timeless. Potentiality. A leading candidate interpretation of quantum and relational structure as encoding possible records and relations. It is not yet proved to be the basement or to instantiate itself. Theory of Emergent Timeless Potentiality remains the active research name while the foundational investigation is incomplete. Theory of Relational Recoverability remains a viable candidate. The mature truth-first research determines the final name and ontology. 14. No Single ETP Emergence Theorem Is Currently Certified The earlier proposed final theorem is withdrawn as an established theorem. The present corpus supports a staged theorem family: Layer 0 provenance and nondefinability results; Layer 1 event, record, access, and objectivity results in declared classes; Layer 2 temporal reconstruction theorems; and Layer 3 operational, propagation, metric, topology, and obstruction results. A global theorem deriving time, locality, and objective facts from relational potentiality would require, at minimum, a certified physical-instantiation bridge, definite-event generation, complete event and carrier data, valid temporal and geometric transition certificates, and composition proofs across all layers. Those obligations remain open. 15. Paper 0 Deliverables • A theorem-dependency map rather than a narrative-only summary. • A claim-status table separating definitions, assumptions, formal theorems, conditional physical theorems, computations, countermodels, interpretive bridges, empirical claims, primitive postulates, and open questions. • A complete-carrier and physical-input register for every major result. • A five-layer architecture with transition certificates and stop rules. • A failure-mode matrix showing exactly how each stronger conclusion could fail. • A cross-manuscript authority table naming the controlling successor for each result family. • A publication-facing conclusion that reports both achievements and unresolved foundational obligations without theory-protective language. 16. Current Truth-First Conclusion The synthesis should conclude that the ETP research program has produced substantial bounded results concerning provenance, recoverability, record preservation, clock adequacy, propagation diagnostics, operational objectivity, finite metrics, refinement, topology, and nonidentifiability. The program has not yet derived physical instantiation, definite events from merely formal potentiality, intrinsic observers, intrinsic boundaries, intrinsic geometry, Lorentzian signature, gravity, or laboratory evidence for ETP. The controlling primary research question therefore remains: what is the truth about the weakest basement or basements required for physical instantiation? 17. Source and Authority Notes Historical sources embedded in the predecessor remain valuable as records of concept development, including the original concept file, the earlier ETP theory submission, the emergence-of-time outline, and the causal-bounds manuscript. They do not control the present claim architecture. Current working authorities are Core Synthesis Draft-07, Basement Provenance and Instantiation Protocol Version 03, Local Relational Time Version 56, the truth-first LRG successor, and the synchronized objectivity and causal-interface successors. 18. BNP-I5 Target I Closure and Conditional Target II Handoff 18.1 Target I status Target I is provisionally closed as unresolved and reopenable. No candidate basement has been established as necessary, sufficient, unique, or least. This status is not a proof of primitive actuality, no-basement, impossibility, or permanent unresolvability. 18.2 Reopenability The program must reopen Target I only when a registered evidentiary trigger is satisfied by an explicit theorem, countermodel, complete framework, rival-specific novel consequence, empirical nonequivalence result, principled-limit theorem, or independent refutation. Renaming formal structure as physical does not satisfy a trigger. 18.3 Conditional downstream authorization Target II and Target III work may continue from an explicitly admitted physical starting datum, but every result must preserve the Target I, II, and III firewall. Definite-event generation remains an independent Target II problem. Effective records, time, locality, geometry, and objectivity remain Target III reconstructions and cannot retroactively instantiate their inputs. 18.4 Relational potentiality Relational potentiality remains a live ETP candidate and organizing hypothesis, not a protected conclusion. Primitive, plural, non-well-founded, no-basement, unknown, and unresolved alternatives remain admissible. 18. OIRP Conditional Closure and Paper 0 Publication Architecture Program disposition. The core Observer-Invariant Reconstruction Program (OIRP) is conditionally closed as a restricted truth-first constitution for conditional reconstruction, not as a substrate theory. Physical actuality remains admitted rather than derived; ultimate provenance remains unresolved and reopenable; downstream structures may not retroactively justify their inputs; no universal ontological core, physical-instantiation bridge, definite-event selector, or positive empirical ETP claim is authorized. Paper 0 effect. The final publication architecture must present OIRP as a completed constitutional program and must not present constitutional closure as proof of a basement, unique ontology, definite-event selector, intrinsic observer, intrinsic object, geometry, gravity, or laboratory evidence. Naming rule. The active research-program name remains the Theory of Emergent Timeless Potentiality (ETP). Theory of Relational Recoverability remains a candidate name only; OIRP closure does not decide the final theory name. Required Paper 0 Sections Admitted actuality and unresolved ultimate provenance. • Admitted actuality and unresolved ultimate provenance. Completed OIRP audit sequence and publication-facing findings table. • Completed OIRP audit sequence and publication-facing findings table. Final K1-K9 constitutional kernel. • Final K1-K9 constitutional kernel. Three-target and layer firewall. • Three-target and layer firewall. Conditional closure and precise nonclaims. • Conditional closure and precise nonclaims. Restricted successor programs and entry criteria. • Restricted successor programs and entry criteria. Reopening-trigger register. • Reopening-trigger register. Evidence-class, artifact, checksum, and authority appendix. • Evidence-class, artifact, checksum, and authority appendix. Final Constitutional Kernel K1. Admitted actuality. Physical actuality, events, and carriers are admitted for reconstruction and are not derived from downstream success. • K1. Admitted actuality. Physical actuality, events, and carriers are admitted for reconstruction and are not derived from downstream success. K2. Typed target and scope. Every claim states its target, domain, task, regime, and exact or approximate status. • K2. Typed target and scope. Every claim states its target, domain, task, regime, and exact or approximate status. K3. Complete carrier and boundary. Retained and discarded systems, environments, branches, controls, references, resources, boundaries, correlations, and relevant continuations are declared. • K3. Complete carrier and boundary. Retained and discarded systems, environments, branches, controls, references, resources, boundaries, correlations, and relevant continuations are declared. K4. Witness and access. Measurements, testers, readouts, access limits, and witness-completeness status are explicit. • K4. Witness and access. Measurements, testers, readouts, access limits, and witness-completeness status are explicit. K5. Equivalence before identity. Operational, representational, gauge, and physical equivalence are typed before nullity, identity, objectivity, or invariance is promoted. • K5. Equivalence before identity. Operational, representational, gauge, and physical equivalence are typed before nullity, identity, objectivity, or invariance is promoted. K6. Transformations, composition, and history. Operations, ordering, interfaces, feedback, composition laws, and relevant histories are declared; constituent certification does not certify the composite. • K6. Transformations, composition, and history. Operations, ordering, interfaces, feedback, composition laws, and relevant histories are declared; constituent certification does not certify the composite. K7. Criteria and uncertainty. Metrics, tolerances, calibration, uncertainty, error propagation, and resource bounds are explicit. • K7. Criteria and uncertainty. Metrics, tolerances, calibration, uncertainty, error propagation, and resource bounds are explicit. K8. Provenance, rivals, falsifiers, and ceilings. Inputs, serious alternatives, falsifiers, evidence class, reopening triggers, claim ceilings, and nonretroactivity are preserved. • K8. Provenance, rivals, falsifiers, and ceilings. Inputs, serious alternatives, falsifiers, evidence class, reopening triggers, claim ceilings, and nonretroactivity are preserved. K9. Plural and null admissibility. Empty, null, quotient-valued, plural, nonunique, Pareto, restricted, and underdetermined outcomes remain legitimate. • K9. Plural and null admissibility. Empty, null, quotient-valued, plural, nonunique, Pareto, restricted, and underdetermined outcomes remain legitimate. Publication Deliverables Cross-gate claim/dependency/provenance crosswalk. • Cross-gate claim/dependency/provenance crosswalk. Acyclic justificatory dependency diagram with prohibited reverse edges identified. • Acyclic justificatory dependency diagram with prohibited reverse edges identified. Manuscript and package authority table. • Manuscript and package authority table. Countermodel and negative-result register. • Countermodel and negative-result register. Successor-program roadmap with falsifiers and stopping rules. • Successor-program roadmap with falsifiers and stopping rules. OIRP-S2.MS1 Corpus Synchronization Addendum Status: SUCCESSOR CANDIDATE. Scientific cutoff: verified record through HHLWBUILD2F Level 5. HHLW Level 6 excluded because no completed raw result was available. Authority and scope This checksum-distinct manuscript successor is synchronized through OIRP-S2.MS1 using the verified OIRP-S2 record available on September 18, 2026. The core OIRP program remains conditionally closed only as a truth-first constitution for conditional reconstruction. OIRP-S2 remains open. Physical actuality is admitted rather than derived, ultimate provenance remains unresolved and reopenable, and no downstream reconstruction may retroactively justify its admitted physical inputs. OIRP-S2 composition update The current successor program separates constituent certification from composite certification. Channel, instrument, process, comb, superchannel, adaptive-network, controller-inclusive, and memory-bearing claims require their own complete carriers, interfaces, histories, witnesses, equivalence relations, metrics, tolerances, and composition laws. Equality or recoverability under restricted access does not establish complete physical equivalence, and a finite-dimensional computation does not establish physical realization or a nonfinite theorem. Current CP4.1 numerical and theorem status CP4.1 has established a restricted finite-dimensional CPTP telescoping theorem for compatible channel sequences, genuine diamond-norm semidefinite-program executions on declared finite-dimensional cases, noncommuting-channel tests, dimension-changing examples, and an ancilla-advantage benchmark. These results do not establish a universal physical composition law, arbitrary process composition, unrestricted adaptive equivalence, nonfinite closure, or OIRP-S2 closure. HHLWBUILD2F status firewall The patched repository hierarchy record is L1 = 0.9268200938227155, L2 = 0.9998804689772093, L3 = 1.0000370777829688, L4 = 1.00015286168964, and L5 = 1.0000000197695689. Values slightly above one are treated only as solver-tolerance-compatible with probability one, not as literal probabilities. Level 6 was not available for this synchronization. Formal patch correctness, formal convergence, exact probability one, equality with the strict-classical optimum, equality with the Definition-23 factor-affine hierarchy, CP4.1 closure, and CP4.2 entry are not established. External relationship and prohibited inference The external constrained-separability literature formulates limited-memory and classically adaptive channel discrimination using separable variables with additional affine constraints and discusses PPT and constrained symmetric-extension outer approximations. That framework supports keeping the repository patched hierarchy distinct from the full factor-affine constrained hierarchy unless an explicit equivalence and implementation audit is completed. No external source is used here to replace proof, raw execution, or authority-grade numerical certification. Evidence and release classification This addendum is a manuscript-synchronization action. It changes cross-program status language and interfaces but does not alter previously proved theorem statements, raw calculations, figures, datasets, or experimental status except where this addendum explicitly narrows a claim. No physical-device experiment, definite-event selector, substrate ontology, universal witness completeness, or ultimate-provenance result is claimed. Publication-architecture update Paper 0 should present OIRP as the constitutional audit layer, OIRP-S1 as the recoverability-completeness successor, and OIRP-S2 as the composition-and-boundary successor. Detailed theorem and computation authority remains in stage packages and the canonical cumulative ledger. CP4.1 is open and CP4.2 is blocked. Source note Internal authority: OIRP_LEDGER.md and the applicable OIRP/OIRP-S1/OIRP-S2 reproducibility and correction packages in the Recovery corpus. External relationship checked against T.-A. Ohst, S. Zhang, H. C. Nguyen, M. Plavala, and M. T. Quintino, “Characterising memory in quantum channel discrimination via constrained separability problems,” arXiv:2411.08110. Publication status must be verified independently before journal submission. Paper 0 Architecture Update: OIRP-S2 CP4.1-CP4.3 Paper 0 now records CP4.1, CP4.2, and CP4.3 as scientifically closed at restricted claim ceilings while preserving OIRP-S2 as open. The publication architecture must present these closures as bounded interface and certification results, not as one microscopic model realizing every layer. OIRP-S2 remains open. These closures do not establish physical realization, laboratory confirmation, empirical confirmation, indefinite-causal-order closure, a universal process-matrix composition law, a universal operational-memory formula, definite-event generation, substrate ontology, or ultimate physical provenance. Physical actuality, events, carriers, interactions, records, instruments, calibrations, and empirical inputs remain admitted rather than derived. Ultimate provenance remains unresolved and reopenable. No downstream result may retroactively justify an admitted input. Restricted closure status • CP4.1 is closed at a restricted channel-level and HHLW claim ceiling. The exact strict-classical optimum, complete arbitrary-history factor-affine hierarchy, physical realization, and empirical confirmation remain excluded. • CP4.2 is closed at a restricted instrument, comb, superchannel, adaptive-memory, postselection, tomography, identifiability, implementation, and empirical-preregistration ceiling. • CP4.3 is closed at a restricted operational-quotient, extension, tensor-descent, operational-memory, fixed-context composite-certification, and general-process no-go ceiling. Composite-certification firewall Certified constituents do not automatically certify a composite. Composite use requires matching typed interfaces, complete carriers, causal order, controllers, interleavings, memory and environment access, branch and history treatment, tester class, normalization, success floors, equivalence or gauge, uncertainty model, and implementation class. The restricted fixed-context hybrid theorem does not imply a universal composition rule for arbitrary process matrices or indefinite causal order. Direct operational tensors must be defined on declared operator-system domains or proved extension independent. Operational-memory firewall Operational memory is defined only relative to a fixed realization class by minimizing over all admitted realizations of one operational quotient. Selected ambient-extension Choi rank, selected Stinespring multiplicity, and nonminimal dilation size are not automatically operational-memory invariants. Authority and reopening Detailed theorem, numerical, execution, dataset, figure, and empirical authority remains package specific. This manuscript successor does not replace the certified research packages or the canonical OIRP program ledger. The affected branch reopens if a new carrier, environment, branch, controller, tester, causal architecture, tensor structure, gauge, identifiability result, correction, retraction, counterexample, hardware result, or empirical dataset changes the restricted claim ceiling.