This paper is organized in three distinct layers, each with a different epistemological status. Readers are invited to evaluate each layer independently. Part I presents an observational case: quantum hardware, when operated far from equilibrium, produces a systematic cluster of anomalous physical phenomena, time crystals, exotic topological phases, thermal law violations, and measurable entanglement timescales. Each anomaly has a domain-specific conventional explanation. The structural observation is the cluster: these phenomena share a common operational boundary, appear conditionally at the same threshold, and were not predicted by the quantum computing performance narrative. Part II presents an empirical program: five pre-registered, falsifiable predictions derived from the structural observation that quantum processors operate on unresolved probability amplitudes rather than resolved states. The predictions specify what the operational boundary should look like if the anomaly cluster reflects physical structure rather than coincidence. Part III presents the Multi-Simulation Thesis as a candidate theoretical interpretation of Parts I and II. The K kernel, a proposed computational substrate underlying physical reality, is offered as the candidate explanation for why the boundary has the structure Parts I and II document. Part III is labeled as interpretation. Parts I and II are evaluable without accepting it.The 5Hz/200ms cross-registered prediction is an open empirical target. Researchers with access to relevant quantum coherence or gravimetric data are invited to correspond. [bartolomeu.mst@gmail.com]
This paper is organized in three distinct layers, each with a different epistemological status. Readers are invited to evaluate each layer independently. Part I presents an observational case: quantum hardware, when operated far from equilibrium, produces a systematic cluster of anomalous physical phenomena, time crystals, exotic topological phases, thermal law violations, and measurable entanglement timescales. Each anomaly has a domain-specific conventional explanation. The structural observation is the cluster: these phenomena share a common operational boundary, appear conditionally at the same threshold, and were not predicted by the quantum computing performance narrative. Part II presents an empirical program: five pre-registered, falsifiable predictions derived from the structural observation that quantum processors operate on unresolved probability amplitudes rather than resolved states. The predictions specify what the operational boundary should look like if the anomaly cluster reflects physical structure rather than coincidence. Part III presents the Multi-Simulation Thesis as a candidate theoretical interpretation of Parts I and II. The K kernel, a proposed computational substrate underlying physical reality, is offered as the candidate explanation for why the boundary has the structure Parts I and II document. Part III is labeled as interpretation. Parts I and II are evaluable without accepting it.The 5Hz/200ms cross-registered prediction is an open empirical target. Researchers with access to relevant quantum coherence or gravimetric data are invited to correspond. [bartolomeu.mst@gmail.com]
The Event Density (ED) framework provides a substrate-level account of quantum computation in which three substrate quantities—local multiplicity (the count of available participation pathways at the system’s endpoints), cross-endpoint connectivity (the substrate-mediated bandwidth that links them), and commitment-injection rate (the rate at which the environment forces individuation)—jointly determine whether quantum computation is possible. The Unresolved-Regime Characterization Theorem (UR-1) identifies three independently necessary conditions on these quantities, and the resulting QC operating window is given structurally by τ_QC = min(τ_(i), τ_(ii), τ_(iii)) over the three corresponding failure timescales. Each architectural platform binds on whichever timescale is shortest under its protection strategy. Three architectural classes—engineered-low-multiplicity (A) covering superconducting qubits, trapped ions, and gate-model photonics; global-geometric-rigidity (B) covering topological qubits and photonic Chern channels; and high-multiplicity-redundancy (C) covering bosonic codes and multi-timescale photonics—exhaust the substrate-allowed strategies for holding the operational regime. Error correction, dynamical decoupling, reservoir engineering, and hybrid architectures are derived as compositions or extensions of the three classes rather than new strategies. The multiplicity-cap function M unifies the classes as three projections of one substrate object, with platform-specific behavior obtained by specializing class-dependent parameters. The framework’s strongest output is cross-platform unification: the matter-wave quantum-classical boundary observed empirically at 140–250 kDa molecular mass and the multiplicity walls that limit qubit-system scaling are the same substrate-determined boundary projected onto two different platforms, evaluated at consistent values of one underlying substrate constant. Sharp predictions follow directly: superconducting platforms encounter a hard scaling ceiling unless they are composed with logical-qubit encoding; topological qubits can outrun this ceiling exponentially in the topological gap if topology engineering can deliver stable structures; redundancy-based architectures saturate at a substrate-determined correlation budget. Four classes of near-term experimental tests with explicit falsification conditions are specified. The structural form of the framework is derived from substrate primitives; specific numerical thresholds (the critical multiplicity, the correlation budget, the maximum stable topological gap, and the platform-specific wall locations) are downstream empirical calibrations rather than free parameters, with the empirical anchors that fix them identified explicitly. The verdict is architectural-level structural completeness with an explicit empirical-calibration roadmap: the substrate-level account of quantum computation is delivered, the predictions are sharp enough to be falsified by near-term measurements, and the calibration program that converts structural predictions into platform-specific numerical bounds is engineering-tractable rather than theoretically blocked.
Since the 1980s, quantum mechanics has been imagined as the basis for a new kind of computer. In 1994, Peter Shor proved that a sufficiently large quantum computer would break public‑key cryptography in polynomial time. In the four decades since, an industry has formed around building such machines: superconducting transmons at IBM and Google, trapped ions at IonQ and Quantinuum, photonic qubits at PsiQuantum and Xanadu, topological qubits at Microsoft, neutral atoms at QuEra and Atom Computing. The largest current devices have on the order of one thousand to ten thousand physical qubits, with substantial effort directed at error correction, isolation from environmental noise, and gate‑fidelity improvements. The question that hangs over the entire program is: how far can it go? Is there a structural ceiling — a fundamental, framework‑independent limit on the number of qubits that can be held in coherent superposition, or on the depth of circuits that can be executed before decoherence overwhelms the computation? Or is the limit purely engineering? Standard physics treats decoherence as environmental coupling, with quantum error correction sufficient (in principle) to tolerate finite decoherence rates below fault‑tolerance thresholds. This is a coherent picture but leaves a structural question unanswered: is the substrate of the universe indifferent to whether a system is in a coherent superposition, or does the substrate place its own constraints on coherent superposition — constraints that engineering cannot work around because they are not engineering problems? This walkthrough presents the Event Density framework's answer. The substrate has finite local participation density, finite cross‑chain bandwidth, finite‑width V1 and V5 kernels, and primitive commitment‑irreversibility. These primitives are not silent on quantum computation; they jointly impose substrate‑level conditions on any system performing coherent quantum computation. The conditions are codified by Theorem UR‑1 (Unresolved‑Regime Characterization): bounded multiplicity, sustained cross‑chain bandwidth, and commitment‑injection below the individuation threshold. The conditions are jointly necessary and sufficient. Three substrate failure modes drive the three conditions to failure: premature individuation from environmental ED‑injection (F1), cross‑endpoint decoupling from Γ_cross collapse (F2), and commitment‑pressure cascade from accumulated P11 events (F3). Three architectural classes — Class A engineered‑low‑multiplicity, Class B global‑geometric‑rigidity, Class C high‑multiplicity‑redundancy — are exhaustive substrate‑permitted strategies. Meta‑architectures (error correction, dynamical decoupling, reservoir engineering, hybrids) are compositions over the three classes, not separate classes. The classes carry three sharp predictions. A Class A wall at the matter‑wave quantum‑classical boundary of 140–250 kDa molecular mass — currently 5–10 times beyond the largest demonstrated coherent superposition, with active experimental programs targeting that range. A Class B exponential coherence advantage in the topological‑protection regime, the substrate‑level reason topologically‑protected qubits (Majorana, Fibonacci anyons) outperform Class A qubits at sufficiently low temperatures. A Class C correlation‑budget plateau as the substrate‑level constraint on how far redundancy‑based architectures (large‑scale error correction, neutral‑atom arrays) can push qubit count before cross‑bandwidth saturates. The structural payoff: quantum computation has a substrate‑level architectural classification with falsifiable predictions, and the same substrate Γ_cross structure that produces black‑hole horizons and bipartite entanglement monogamy also produces the architectural classification of quantum‑computing platforms. The cross‑domain unification — quantum computing and black‑hole physics governed by the same substrate mechanism at scales separated by fifty orders of magnitude — is the framework's strongest piece of cross‑platform mechanism identity.
This paper presents a substrate‑first explanation of the double‑slit experiment, delayed‑choice variations, and quantum‑eraser configurations within the MID/QC framework. In this model, the wavefunction is not a symbolic probability amplitude but a real geometric configuration of tension and phase in a continuous medium. Measurement is a physical perturbation that collapses coherence geometry, and decoherence is a flattening of substrate structure rather than an epistemic update. Part II extends the conceptual foundation established in Part I, formalizing coherence wells, phase topology, substrate perturbation, and decoherence flattening into a complete scientific treatment. The paper resolves the appearance of retrocausality, reframes probability as geometry bandwidth, and provides a unified account of measurement grounded in substrate dynamics rather than symbolic abstraction.
This paper is Part II of The Pre-Emergence Origin of Probability trilogy. Part I develops the structural requirements for finite recurrent stability before spacetime. Part II asks when persistent boundary-readable structure can support numerical probability. Part III examines what probability-status remains after boundary loss, before numerical weighting, and under what narrower conditions Born-form weighting may follow. The paper analyzes how probability-measure status may arise within a closed deterministic description rather than being assumed as a primitive numerical rule. A closed description cannot appeal to an external observer, hidden weighting convention, retained label, post-outcome selection, or independently supplied probability measure to explain its own probability assignments. Numerical probability must instead be supported by structures and relations admitted within the described system. The analysis begins with the requirements for persistent structured identity. Persistent identity is treated as recoverable cross-state relational distinction rather than exact sameness, repeated naming, scalar aggregation, or externally preserved memory. Within the tested structural registry, persistent refinable identity requires ordered dependence, a sufficient stabilization architecture, distributed relational structure, recurrence, bounded recoverability, and noncollapse of the distinctions being preserved. Bounded recurrent relational correction is classified as weak oscillatory form in a deliberately structural sense. The classification does not establish a physical wave, sinusoidal motion, exact periodicity, frequency, propagation, dynamics, mechanism operation, or physical carrier. It identifies a recurrent recoverability architecture that a later realization would have to preserve. The paper then develops the transition from persistent structure to boundary observability. Representation-sensitive bulk descriptions may depend on phase origin, refinement history, decomposition, internal labels, subpart identity, or other distinctions that do not survive admissible boundary readout. Under admissible-observable indistinguishability, boundary-readable observables factor through an emergence-boundary quotient that preserves only the distinctions carried by the admitted observable family and surviving the declared transport relation. The boundary quotient does not itself provide probability. It supplies a local architecture of boundary-readable alternatives and permits the admission of candidate nonnegative contribution scalars. Neither the alternative carrier nor a candidate scalar establishes scalar uniqueness, scalar closure, additivity, measure realization, normalization, or probability interpretation. Numerical probability-measure status becomes available only under a narrower cumulative condition package. The package requires an exact finite carrier, a finite positive event measure, a normalized scalar component on the same carrier, exact scalar-measure compatibility, one-scalar factorization of every admitted weight-bearing map, exclusion of independent weight-bearing invariants, pre-outcome assignment, absence of an external weighting source, and a declared scalar-only predictive regime. Additivity, commensurability, regularity, positive scale, finite nonzero total, and normalization remain separately controlled conditions within that route. Under those conditions, normalized scalar weights may receive conditional probability-measure status inside the declared local regime. This is not an unconditional derivation of probability from determinism. The result does not establish unrestricted probability, universal scalar representation, a global probability law, objective chance, stochastic dynamics, collapse, measurement theory, physical realization, or a final physical theory. Within the trilogy, Part II therefore supplies the middle structural layer: persistent recurrent structuretoboundary-readable alternativestocandidate scalar contenttoconditional numerical probability-measure status. Part III begins from a different question. It examines what remains when a boundary-readable description loses the ability to guarantee which admissible alternative obtains, before any numerical scalarization is supplied. Part II provides the scalar, measure, normalization, compatibility, and realization-burden architecture inherited by that later analysis, but it does not pre-establish the boundary-loss results of Part III. ### Revision note This revision is a substantial reconstruction and trilogy integration rather than a minor editorial update. The derivational architecture, definitions, condition packages, failure boundaries, dependency order, and claim-scope controls have been revised throughout. The manuscript has also been rewritten in new prose to present the argument as Part II of The Pre-Emergence Origin of Probability trilogy. Major changes include a clearer separation of persistent identity, ordered dependence, stabilization, distributed relational recurrence, weak oscillatory form, boundary observability, candidate scalar status, scalar closure, measure realization, normalization, and conditional probability-measure status. The emergence-boundary quotient and transport-survival architecture have been clarified, and the numerical-probability result has been narrowed to an expressly declared scalar-only predictive regime satisfying the complete carrier, measure, compatibility, factorization, pre-outcome, and independent-invariant exclusion conditions. The revision also strengthens the distinction between candidate weights, normalized weights, conditional measures, and probability interpretation. It adds more precise failure localization, preserves the distinction between conditioned failure and universal impossibility, and expands the realization-burden architecture separating mechanism satisfaction, physical scalar selection, boundary enforcement, branch generation, refinement implementation, physical realization, theory-specific realization, empirical validation, and final physical-theory status. The paper is now explicitly positioned between Part I, which establishes the structural requirements for finite recurrent stability before spacetime, and Part III, which develops boundary-unresolved and pre-numerical probability-status after recoverability loss. The central research program remains mechanism-neutral. No physical mechanism, collapse process, specific realization theory, unrestricted probability law, or empirical validation is claimed.
Proposes a physical implementation of three-point geometry using structurally independent computing substrates. Test 6 (entangled ancilla, 0/4) proved that quantum entanglement cannot serve as the independent third channel — three-point geometry requires structural independence, not logical separation. Thermodynamic computing (stochastic sampling via thermal noise) and quantum computing (unitary evolution with projective measurement) operate on fundamentally different physics — different manifolds, different entropy production mechanisms, different information-theoretic constraints. When deployed as parallel independent channels on the same problem, the explaining-away penalty I(D;M|Y) cannot form because the channels share no common statistical manifold. Derives testable predictions for Z1 (Extropic) + IBM Quantum hybrid architectures. Connects Kolchinsky et al. (2026) thermodynamic validation to Test 7 quantum validation via Čencov uniqueness. The first AI safety architecture paper that specifies hardware, not just policy.
Event Density (ED) is a 13-Primitive Generative Substrate Ontology — a substrate-ontology research program in the lineage of 't Hooft's cellular-automaton interpretation of QM, Wolfram's Ruliad / hypergraph-rewriting program, and the causal-set program (Sorkin et al.). ED is NOT in the operational-reconstruction lineage of Hardy (2001), CDP (2011), Masanes-Müller (2011), or Coecke-Kissinger (2017), which derives finite-dimensional QM by closed proofs. ED asks a single foundational question: can the diverse phenomena of physics — quantum mechanics, gauge theory, gravity, black holes, turbulence, decoherence, entanglement — be generated from a small, well-specified substrate ontology? The program's answer is conditional: yes, given thirteen posited primitives (P01–P13) and a kernel calculus built from two substrate-level memory kernels (V1: finite-width retarded; V5: cross-chain finite-memory). This whitepaper is the program's public-facing front door. It introduces the 13 primitives, the kernel calculus, the substrate→continuum bridge (Diffusion Coarse-Graining Theorem, Paper_073, at verdict tier M3 within a hydrodynamic-window regime assumption), and the architecture of eight structurally complete research arcs (quantum kinematics, form-level QFT, gravity, black holes, Q-Compute limits, entanglement, soft matter / Navier-Stokes, foundational kernel theory). Methodological signature: form-FORCED / value-INHERITED with a three-tier verdict grammar (M1 / M2 / M3). Structural forms are derived from substrate primitives + explicitly-declared paper-specific postulates; numerical values are inherited from empirical matching. Each paper carries a load-bearing-step audit table labeling every claim. The program's most ambitious recent synthesis is the Substrate-Cosmology Boundary Unification (SCBU) and its six-paper ED-SC 4.x extension arc. SCBU is offered as the framework's organizing structural hypothesis: that the black-hole horizon, cosmic decoupling surface, deep-MOND acceleration scale, quantum-computing coherence threshold, soft-matter hydrodynamic Q-factor, and substrate-scale fixed-point are projections of a single substrate-cosmology boundary at R_H = c/H_0. The load-bearing derivation closing the synthesis (Route A: substrate-derived ℓ_V5(H_0)) is currently OPEN; SCBU is an organizing schema, not a closed cross-arc derivation. The program is falsifiable. The sharpest currently-clean empirical falsifier is the BTFR slope-4 relation with zero intrinsic scatter in the deep-MOND asymptotic (Paper_031), testable against existing galaxy-rotation-curve catalogs (SPARC). Other empirical falsifiers include the Class-A matter-wave coherence wall at 140-250 kDa and substrate-corrected Hawking spectrum signatures. What ED is NOT: a Theory of Everything, a derivation-from-nothing claim, or a closed-proof reconstruction. Open derivations (Route A, Phase-3 GR Einstein equation emergence, YM mass-gap closed proof, NS smoothness at Intermediate Path C) are named rather than hidden. The academic case for the 13 primitives is downstream cross-domain reach plus methodological consistency. The corpus comprises 100+ papers across eight research arcs plus theorem stubs and cross-arc syntheses; this whitepaper is the orientation entry point.