Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Coherence Dynamics and Threshold Emergence in Overlap Networks

Itay Priiz

Published Apr 29, 2026• 0 citations
Publisher

Abstract

This paper develops a mesoscopic theory of emergent metastable record-support domains on networks of overlapping finite subsystems. The original formulation compressed perturbative stability, correlation strength, record persistence, observer function, and classical spacetime into one scalar coherence variable. Stress testing showed that these roles must be separated, while preserving a narrower emergence result. The revised framework distinguishes fragile and distributed support modes, finite renewal resources, physical record integrity, explicit content and epoch labels, and separate mechanisms for activation, latching, consensus, invalidation, and revision. Local exchange, resource, threshold, and latch dynamics generate connected support domains, collapse-corridor-rescue regimes, hysteretic branches, and revisable distributed records that are not imposed as primitive node labels and that change under matched ablations. Version 3.2 adds a driven turnover audit. A record-support domain preserved late occupancy of 0.6797 and fidelity of 0.9854 after every original record instance had disappeared and approximately 22.7 record generations had passed. Random-provenance and coherent false-renewal controls show the boundary: high support and internal agreement can preserve a stable but wrong identity. Domain persistence is therefore process-level continuity under a declared provenance rule, not material-token immortality and not semantic truth. Overlap remains double-edged. It can pool weak evidence, improve local reliability, and support revision, but it can also double-count redundant support, preserve obsolete copies, sustain incompatible local domains, or stabilize common-mode errors. The framework establishes model-level emergence of collective metastable record-support domains. It does not derive observerhood, a universal preferred basis, classical spacetime, or gravity. A published downstream companion reconstructs Jacobson’s equilibrium equation of state in a finite regulator using additional horizon, tensor, conservation, and provenance assumptions.

DOI
10.5281/zenodo.19884831

Related papers

Fault-Tolerant Observer Overlaps

Itay Priiz

Finite observer domains can form stable records while disagreeing locally, suffering false triggers, or receiving correlated disturbances. This paper develops a thermodynamic account of how overlapping domains can preserve a shared record sector without a central corrector. The mechanism is not a digital error-correcting code: no bit string, encoding map, parity-check circuit, decoding algorithm, or external controller is assumed. Instead, physical overlap supplies consistency pressure, independent evidence supplies correction direction, and detailed-balance dynamics supplies the irreversible cost of reconciliation. Pairwise overlap mismatch is represented by the minimum relative-entropy cost of reconciling two restrictions with a common state, equal to twice the classical or quantum Jensen-Shannon divergence. Near agreement this cost is governed by the Bogoliubov-Kubo-Mori metric. A stability bound relates horizontal overlap strain to record-channel information loss when retention is close to a BKM-orthogonal projection. For memoryful records, the same geometry lifts to finite process histories through conditional expectation of the path score. Classical and quantum conditional-response models identify the stored correction burden as relative-entropy free energy, with its decay governed by independently computed entropy production. In reciprocal networks, overlap alone enforces consensus rather than truth; fault tolerance appears only when evidence channels are sufficiently diverse. An exact graph-theoretic bound shows that local false-island protection is controlled by weighted boundary expansion, while the global sector is controlled by total evidence. Finite temperature and record barriers produce a bounded operating window between under-protection and excessive rigidity. Version 1.1 incorporates downstream validation from a companion finite-regulator study. A connected overlap atlas can collectively reconstruct Jacobson’s equilibrium equation of state even though each individual observer is rank deficient. This does not turn graph protection into a derivation of gravity: record-sector protection and null-direction tensor reconstruction are distinct roles of overlap, and neither internal consistency nor overlap consensus authenticates source truth without independent provenance.

•Jul 25, 2026•0 citations

The Three Iron Laws of Finite Operational Observers

Itay Priiz

Abstract The original Iron Laws proposed three constraints on physically meaningful observation: irreversible record formation, finite operational locality, and the impossibility of sustained observer function in complete equilibrium. Subsequent adversarial testing showed that these principles survived only after several broad claims were removed or sharply restricted. This paper presents their reconstructed form for finite operational observers. Law I requires complete physical accounting whenever a transient correlation becomes a retained and task-usable record, including commitment, maintenance, replacement, revision, export, erasure, and loss. It does not claim that every interaction or premeasurement is irreversible, and it permits record identity to persist through authenticated replacement of every original physical carrier. Law II requires finite causal support and provenance for comparison, communication, coordinated control, and collective record formation. It remains compatible with quantum nonfactorization and does not derive spacetime geometry or instantaneous global agreement. Law III permits equilibrium correlations, passive memories, stationary distributions, and stationary collective macrostates, but excludes sustained directional register–compare–act–reset cycles, or turnover-maintained collective function, at full operational equilibrium once all drives, clocks, reservoirs, prepared memories, renewal mechanisms, and interventions are included. The three laws are joined through a conjunctive admissibility protocol requiring registration, retention, causal support, finite resolution, authenticated provenance, and later use. The reconstruction also replaces the former observer-independent persistent-uncertainty claim with target-, group-, and architecture-indexed operational residual floors. The result is not a derivation of geometry, gravity, cosmology, consciousness, or inevitable observer emergence, but a falsifiable framework specifying the physical conditions under which finite systems can produce, preserve, authenticate, compare, and use evidence.

•Feb 12, 2026•0 citations

Persistent Uncertainty as a No-Absorbing-State Condition: Non-Encodability, Boundary Openness, and Metastable Classical Persistence

Itay Priiz

Finite observers can fail to close a declared prediction task for several physically distinct reasons: incomplete records, inaccessible boundary data, permanent record-capacity deficits, delayed measurement context, reflexive response policies, or degradation of the resources needed to maintain a record. Earlier versions of the programme treated these obstructions as manifestations of one persistent uncertainty. Adversarial testing rejects that identification. Local positive residuals can disappear exactly after causal pooling; large finite systems can be represented by sufficient statistics; distributed records can close without a centralized copy; and coherent quantum memory can remove a classicalized delayed-context floor. This paper therefore introduces polymorphic operational nonclosure as a narrower replacement. Its central object is a typed, architecture-indexed obstruction profile rather than a conserved scalar uncertainty. A carrier transition is admissible only when the earlier obstruction is shown to close or become subdominant, the later obstruction is independently derived, the target and observer architecture are declared, a causal physical map connects the stages, and hostile controls exclude artificial withholding of available information. Exact information-theoretic results establish target-indexed residuals, pooling gains governed by conditional mutual information, protocol-specific quantum floors, and capacity-indexed target-family bounds. Mesoscopic and control-level tests show that maintaining closure can create a thermodynamic burden. Across broad feedback ensembles, terminal failure is conditional on renewal failing before the control margin vanishes. An explicit reciprocal quantum collision model supplies a finite CPTP regulator in which correction exports energy into a sink, sink loading reduces future correction capacity, and renewal supports recovery. The resulting framework is conditional rather than universal. It derives no observer-independent uncertainty scalar, unavoidable leakage field, spacetime-emergence theorem, additional gravitational stress tensor, or dark-energy contribution.

•May 3, 2026•0 citations

Finite Quantum Records and Source-Inclusive Coherence Tests

Qingchun Zhang

A durable quantum record, the location of its coherence, and a uniquely actual outcome are different physical questions. We study their separation in a supplied finite-dimensional quantum theory. An explicit, time-independent apparatus couples a system–detector encoding to a controller, a distinct archive, and a finite returning source. A conditional energy penalty suppresses release of the original record without deleting its return coupling. An invariant reduction and a one-sided spectral-gap estimate yield a certified interval with archive occupation above 0.98438, controller-latched occupation above 0.99161, and filled-but-unlatched weight below 2.402 × 10^-7 in one stated design. The same record statistics admit different source-label overlaps and hence different coherence on a specified retained boundary. A conserved product of complementary exchanges accesses that coherence when the finite source is included. Given a calibrated multiregister reader, its finite-duration response separates the coherent apparatus from an independently added archive-gated reduction law, with the added process left active during readout. A conservative example retains a response gap above 0.01717 after separately stipulated one-percent error allowances. The contribution is the finite construction and its quantitative retention, access, and readout interfaces. Quantum carriers, Hamiltonian couplings, trace readout, source preparation, and the reader are supplied; local reader synthesis, empirical calibration, absolute rate selection, and unique-event actualization are not established. Paper code: CFQR-P1 (Complementarity-First Quantum Records — Paper 1). The associated bundle contains the technical supplement, editable LaTeX, numerical checking programs and rational certificates, and selected Lean sources with returned build and axiom-audit evidence. The 39 supporting declarations are partially formalized; eleven recorded type excerpts contain printing elisions. This is not end-to-end formalization, external human peer review, an experimental detection of fundamental collapse, or a derivation of unique-event actualization. Author-owned manuscripts, documentation and mathematical data are CC BY 4.0; author-owned software is MIT, subject to the bundle’s licence map and third-party notices.

•Oct 15, 2026•0 citations

The Measurement Ledger: Collapse, Decoherence, and Everettian Record Closure in pq-Spacetime

Adam Alexander Dick

This is Paper 157 in the Anaxiomatic Mechanics / pq-Spacetime stack. It develops a finite structural account of quantum measurement based on boundary-supported record formation, decoherence, and global admissible-history closure. In pq-spacetime, measurement is not a fundamental collapse process. A system, apparatus, environment, and observer become incorporated into an enlarged β-boundary whose dynamics stabilize distinguishable record channels. Environmental coupling suppresses accessible interference between incompatible records, while each observer continuation inherits a definite local outcome through its embedding in one stable β-record ledger. The paper distinguishes this branch-local definiteness from the global structure of the theory. The finite amplitude law and No-Fence Principle do not permit admissible history sectors to be deleted by an additional measurement rule. The global metaobject therefore remains closed over the complete admissible-history structure even though individual observers occupy definite record continuations. Collapse is consequently recovered only as an effective conditional update of local access rather than as an ontological destruction of alternatives. The analysis connects measurement directly to the earlier pq-spacetime treatments of entanglement, decoherence, and black-hole information. In each case, reduced access to part of the admissible-history structure can produce locally mixed or effectively classical descriptions without implying destruction of the globally closed state. Born weights are inherited from the prior no-fence scalarization result rather than introduced as an independent measurement postulate. The Measurement Ledger Theorem summarizes the result: quantum measurement is the formation of stable branch-local β-record ledgers through boundary enlargement; consciousness is not a measurement mechanism; primitive collapse and hidden selectors are unnecessary; pointer states correspond to dynamically stable record channels; and the globally admissible history structure remains closed throughout the measurement process. The resulting picture identifies classicality with persistent, redundant record stability rather than with a separate classical ontology. Definite experimental outcomes and globally closed quantum evolution are therefore treated as complementary aspects of the same finite pq-spacetime dynamics.

•Aug 11, 2026•0 citations

Coherence Compression and the Observer Function Cohesion Adhesion Reclosure and the Conditions of Admissible Description

Philip Lilien

A study of physical organization, sufficient description, and the formation of reliable distinctions. COHERENCE COMPRESSION AND THE OBSERVER FUNCTIONThis monograph develops a sustained inquiry into the relation between compression, physical organization, observation, and intelligence. Its starting intuition is that a powerful formula or scientific principle can replace many independent descriptions while preserving their important consequences. The inquiry asks whether cohesion, adhesion, and reclosure supply a general architecture for understanding how such economy becomes possible across physical and cognitive domains. We distinguish physical admissibility, descriptive sufficiency, and intelligence. A stable object need not possess intelligence; a compact description need not imply physical binding; and a coherent final outcome need not preserve the information it was intended to record. The framework is developed through exact and approximate reduction, reconstruction bounds, information requirements, memory kernels, and explicit physical illustrations. These include tape and wetting, droplet merger and relaxation, membrane pores and vesicle closure, polymer welding, coupled mechanical systems, atomic polarizability, gravitational multipoles, and mechanosensitive biological channels. The observer is investigated as a proposed universal function of constraint-mediated differentiation. Classical bistable models show how continuous dynamics can support discrete stable outcome classes. Driven and reciprocal receiver models distinguish successful writing, persistence, agreement, source fidelity, preparation tolerance, and registration time. A sharp preparation-margin result and a necessary logarithmic time bound make one part of the continuum-to-discreteness account operational. The synthesis supports a research program in which a compressed description is justified by the distinctions it preserves under specified preparations, inputs, observables, tolerances, and durations. It does not establish one universal physical coherence law or a calibrated universal intelligence quotient. Intelligence remains a further question about discovering, transferring, validating, and revising useful representations. The monograph concludes with literature comparisons, experimental tests, mathematical proofs, numerical checks, and a claim-status register. Keywords: coherence; compression; cohesion; adhesion; reclosure; admissibility; observer function; effective description; memory; intelligence

•Oct 22, 2026•0 citations
This paper develops a mesoscopic theory of emergent metastable record-support domains on networks of overlapping finite subsystems. The original formulation compressed perturbative stability, correlation strength, record persistence, observer function, and classical spacetime into one scalar coherence variable. Stress testing showed that these roles must be separated, while preserving a narrower emergence result. The revised framework distinguishes fragile and distributed support modes, finite renewal resources, physical record integrity, explicit content and epoch labels, and separate mechanisms for activation, latching, consensus, invalidation, and revision. Local exchange, resource, threshold, and latch dynamics generate connected support domains, collapse-corridor-rescue regimes, hysteretic branches, and revisable distributed records that are not imposed as primitive node labels and that change under matched ablations. Version 3.2 adds a driven turnover audit. A record-support domain preserved late occupancy of 0.6797 and fidelity of 0.9854 after every original record instance had disappeared and approximately 22.7 record generations had passed. Random-provenance and coherent false-renewal controls show the boundary: high support and internal agreement can preserve a stable but wrong identity. Domain persistence is therefore process-level continuity under a declared provenance rule, not material-token immortality and not semantic truth. Overlap remains double-edged. It can pool weak evidence, improve local reliability, and support revision, but it can also double-count redundant support, preserve obsolete copies, sustain incompatible local domains, or stabilize common-mode errors. The framework establishes model-level emergence of collective metastable record-support domains. It does not derive observerhood, a universal preferred basis, classical spacetime, or gravity. A published downstream companion reconstructs Jacobson’s equilibrium equation of state in a finite regulator using additional horizon, tensor, conservation, and provenance assumptions.
Finite observer domains can form stable records while disagreeing locally, suffering false triggers, or receiving correlated disturbances. This paper develops a thermodynamic account of how overlapping domains can preserve a shared record sector without a central corrector. The mechanism is not a digital error-correcting code: no bit string, encoding map, parity-check circuit, decoding algorithm, or external controller is assumed. Instead, physical overlap supplies consistency pressure, independent evidence supplies correction direction, and detailed-balance dynamics supplies the irreversible cost of reconciliation. Pairwise overlap mismatch is represented by the minimum relative-entropy cost of reconciling two restrictions with a common state, equal to twice the classical or quantum Jensen-Shannon divergence. Near agreement this cost is governed by the Bogoliubov-Kubo-Mori metric. A stability bound relates horizontal overlap strain to record-channel information loss when retention is close to a BKM-orthogonal projection. For memoryful records, the same geometry lifts to finite process histories through conditional expectation of the path score. Classical and quantum conditional-response models identify the stored correction burden as relative-entropy free energy, with its decay governed by independently computed entropy production. In reciprocal networks, overlap alone enforces consensus rather than truth; fault tolerance appears only when evidence channels are sufficiently diverse. An exact graph-theoretic bound shows that local false-island protection is controlled by weighted boundary expansion, while the global sector is controlled by total evidence. Finite temperature and record barriers produce a bounded operating window between under-protection and excessive rigidity. Version 1.1 incorporates downstream validation from a companion finite-regulator study. A connected overlap atlas can collectively reconstruct Jacobson’s equilibrium equation of state even though each individual observer is rank deficient. This does not turn graph protection into a derivation of gravity: record-sector protection and null-direction tensor reconstruction are distinct roles of overlap, and neither internal consistency nor overlap consensus authenticates source truth without independent provenance.
Abstract The original Iron Laws proposed three constraints on physically meaningful observation: irreversible record formation, finite operational locality, and the impossibility of sustained observer function in complete equilibrium. Subsequent adversarial testing showed that these principles survived only after several broad claims were removed or sharply restricted. This paper presents their reconstructed form for finite operational observers. Law I requires complete physical accounting whenever a transient correlation becomes a retained and task-usable record, including commitment, maintenance, replacement, revision, export, erasure, and loss. It does not claim that every interaction or premeasurement is irreversible, and it permits record identity to persist through authenticated replacement of every original physical carrier. Law II requires finite causal support and provenance for comparison, communication, coordinated control, and collective record formation. It remains compatible with quantum nonfactorization and does not derive spacetime geometry or instantaneous global agreement. Law III permits equilibrium correlations, passive memories, stationary distributions, and stationary collective macrostates, but excludes sustained directional register–compare–act–reset cycles, or turnover-maintained collective function, at full operational equilibrium once all drives, clocks, reservoirs, prepared memories, renewal mechanisms, and interventions are included. The three laws are joined through a conjunctive admissibility protocol requiring registration, retention, causal support, finite resolution, authenticated provenance, and later use. The reconstruction also replaces the former observer-independent persistent-uncertainty claim with target-, group-, and architecture-indexed operational residual floors. The result is not a derivation of geometry, gravity, cosmology, consciousness, or inevitable observer emergence, but a falsifiable framework specifying the physical conditions under which finite systems can produce, preserve, authenticate, compare, and use evidence.
Finite observers can fail to close a declared prediction task for several physically distinct reasons: incomplete records, inaccessible boundary data, permanent record-capacity deficits, delayed measurement context, reflexive response policies, or degradation of the resources needed to maintain a record. Earlier versions of the programme treated these obstructions as manifestations of one persistent uncertainty. Adversarial testing rejects that identification. Local positive residuals can disappear exactly after causal pooling; large finite systems can be represented by sufficient statistics; distributed records can close without a centralized copy; and coherent quantum memory can remove a classicalized delayed-context floor. This paper therefore introduces polymorphic operational nonclosure as a narrower replacement. Its central object is a typed, architecture-indexed obstruction profile rather than a conserved scalar uncertainty. A carrier transition is admissible only when the earlier obstruction is shown to close or become subdominant, the later obstruction is independently derived, the target and observer architecture are declared, a causal physical map connects the stages, and hostile controls exclude artificial withholding of available information. Exact information-theoretic results establish target-indexed residuals, pooling gains governed by conditional mutual information, protocol-specific quantum floors, and capacity-indexed target-family bounds. Mesoscopic and control-level tests show that maintaining closure can create a thermodynamic burden. Across broad feedback ensembles, terminal failure is conditional on renewal failing before the control margin vanishes. An explicit reciprocal quantum collision model supplies a finite CPTP regulator in which correction exports energy into a sink, sink loading reduces future correction capacity, and renewal supports recovery. The resulting framework is conditional rather than universal. It derives no observer-independent uncertainty scalar, unavoidable leakage field, spacetime-emergence theorem, additional gravitational stress tensor, or dark-energy contribution.
A durable quantum record, the location of its coherence, and a uniquely actual outcome are different physical questions. We study their separation in a supplied finite-dimensional quantum theory. An explicit, time-independent apparatus couples a system–detector encoding to a controller, a distinct archive, and a finite returning source. A conditional energy penalty suppresses release of the original record without deleting its return coupling. An invariant reduction and a one-sided spectral-gap estimate yield a certified interval with archive occupation above 0.98438, controller-latched occupation above 0.99161, and filled-but-unlatched weight below 2.402 × 10^-7 in one stated design. The same record statistics admit different source-label overlaps and hence different coherence on a specified retained boundary. A conserved product of complementary exchanges accesses that coherence when the finite source is included. Given a calibrated multiregister reader, its finite-duration response separates the coherent apparatus from an independently added archive-gated reduction law, with the added process left active during readout. A conservative example retains a response gap above 0.01717 after separately stipulated one-percent error allowances. The contribution is the finite construction and its quantitative retention, access, and readout interfaces. Quantum carriers, Hamiltonian couplings, trace readout, source preparation, and the reader are supplied; local reader synthesis, empirical calibration, absolute rate selection, and unique-event actualization are not established. Paper code: CFQR-P1 (Complementarity-First Quantum Records — Paper 1). The associated bundle contains the technical supplement, editable LaTeX, numerical checking programs and rational certificates, and selected Lean sources with returned build and axiom-audit evidence. The 39 supporting declarations are partially formalized; eleven recorded type excerpts contain printing elisions. This is not end-to-end formalization, external human peer review, an experimental detection of fundamental collapse, or a derivation of unique-event actualization. Author-owned manuscripts, documentation and mathematical data are CC BY 4.0; author-owned software is MIT, subject to the bundle’s licence map and third-party notices.
This is Paper 157 in the Anaxiomatic Mechanics / pq-Spacetime stack. It develops a finite structural account of quantum measurement based on boundary-supported record formation, decoherence, and global admissible-history closure. In pq-spacetime, measurement is not a fundamental collapse process. A system, apparatus, environment, and observer become incorporated into an enlarged β-boundary whose dynamics stabilize distinguishable record channels. Environmental coupling suppresses accessible interference between incompatible records, while each observer continuation inherits a definite local outcome through its embedding in one stable β-record ledger. The paper distinguishes this branch-local definiteness from the global structure of the theory. The finite amplitude law and No-Fence Principle do not permit admissible history sectors to be deleted by an additional measurement rule. The global metaobject therefore remains closed over the complete admissible-history structure even though individual observers occupy definite record continuations. Collapse is consequently recovered only as an effective conditional update of local access rather than as an ontological destruction of alternatives. The analysis connects measurement directly to the earlier pq-spacetime treatments of entanglement, decoherence, and black-hole information. In each case, reduced access to part of the admissible-history structure can produce locally mixed or effectively classical descriptions without implying destruction of the globally closed state. Born weights are inherited from the prior no-fence scalarization result rather than introduced as an independent measurement postulate. The Measurement Ledger Theorem summarizes the result: quantum measurement is the formation of stable branch-local β-record ledgers through boundary enlargement; consciousness is not a measurement mechanism; primitive collapse and hidden selectors are unnecessary; pointer states correspond to dynamically stable record channels; and the globally admissible history structure remains closed throughout the measurement process. The resulting picture identifies classicality with persistent, redundant record stability rather than with a separate classical ontology. Definite experimental outcomes and globally closed quantum evolution are therefore treated as complementary aspects of the same finite pq-spacetime dynamics.
A study of physical organization, sufficient description, and the formation of reliable distinctions. COHERENCE COMPRESSION AND THE OBSERVER FUNCTIONThis monograph develops a sustained inquiry into the relation between compression, physical organization, observation, and intelligence. Its starting intuition is that a powerful formula or scientific principle can replace many independent descriptions while preserving their important consequences. The inquiry asks whether cohesion, adhesion, and reclosure supply a general architecture for understanding how such economy becomes possible across physical and cognitive domains. We distinguish physical admissibility, descriptive sufficiency, and intelligence. A stable object need not possess intelligence; a compact description need not imply physical binding; and a coherent final outcome need not preserve the information it was intended to record. The framework is developed through exact and approximate reduction, reconstruction bounds, information requirements, memory kernels, and explicit physical illustrations. These include tape and wetting, droplet merger and relaxation, membrane pores and vesicle closure, polymer welding, coupled mechanical systems, atomic polarizability, gravitational multipoles, and mechanosensitive biological channels. The observer is investigated as a proposed universal function of constraint-mediated differentiation. Classical bistable models show how continuous dynamics can support discrete stable outcome classes. Driven and reciprocal receiver models distinguish successful writing, persistence, agreement, source fidelity, preparation tolerance, and registration time. A sharp preparation-margin result and a necessary logarithmic time bound make one part of the continuum-to-discreteness account operational. The synthesis supports a research program in which a compressed description is justified by the distinctions it preserves under specified preparations, inputs, observables, tolerances, and durations. It does not establish one universal physical coherence law or a calibrated universal intelligence quotient. Intelligence remains a further question about discovering, transferring, validating, and revising useful representations. The monograph concludes with literature comparisons, experimental tests, mathematical proofs, numerical checks, and a claim-status register. Keywords: coherence; compression; cohesion; adhesion; reclosure; admissibility; observer function; effective description; memory; intelligence