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

Ch. 161 / 2026z — One Number: The Causal-Loop Test — Pre-registration

Robert Aar Tseglin

Published Nov 6, 2026• 0 citations
Publisher

Abstract

This is a pre-registration, not a claim of experimental success. It states in advance one quantitative prediction that differs from standard quantum optics, one protocol to test it, and one set of falsification criteria. Claim: A causal loop with H^1_causal != 0 adds an extra erasure factor gamma_causal(L), even when the which-way marker W is held fixed. Setup: Mach-Zehnder interferometer, heralded single photons at 810 nm, which-way marker overlap |<W0|W1>| = 0.60, one arm through a fiber delay loop of length L. Standard prediction (Englert 1996):V_standard = 0.600, D = 0.800, D^2 + V^2 = 1.000, flat in L. Tseglin prediction:gamma_causal(L) = 0.30 * (1 - exp(-L / 2.0 m))V_Tseglin(L) = 0.600 * (1 - gamma_causal(L)) Headline number at L = 3.0 m:Standard: V = 0.600 +/- 0.010Tseglin: V = 0.460 +/- 0.010Difference: Delta V = 0.140 Vindicated if: V(3.0 m) = 0.460 +/- 0.030 and V(L) follows the predicted curve within +/- 0.03.Falsified if: V(3.0 m) = 0.600 +/- 0.030 and V is flat in L within +/- 0.02.Inconclusive if: D drifts, control drifts, or error bars exceed 0.03. No experimental data are reported herein. Keywords: quantum eraserMach-Zehnder interferometercomplementaritypre-registrationcausal topologyfalsifiable prediction

DOI
10.5281/zenodo.23993495

Related papers

Lab: D^2+V^2 in a Real Interferometer with Eraser

Robert Aaron Tseglin

This paper is the third paper after Synthesis II, and the lab paper promised in 2026i, 2026o, 2026p, 2026q. In 2026a (Ch. 124), we proved no unital map T → E for H = S^1. In 2026b (Ch. 125), we generalized to the triple (dim H^n, dim C^n, 1). In 2026c (Ch. 138), we defined the Bridge Conjecture. In 2026d (Ch. 139), we proved the eraser must be CPTP. In 2026e (Ch. 140), we proved all four follow from one Unifier Axiom: [x,y] = 1. In 2026f (Ch. 141), we categorified H. In 2026g (Ch. 142), we proved the Unifier survives in characteristic p. In 2026h (Ch. 143), we proved it survives for infinite H. In 2026i (Ch. 144), we gave the lab falsifier D^2 + V^2 ≤ 1. In 2026j (Ch. 145), we proved the nine papers are one theorem. In 2026k (Ch. 146), we proved the Unifier survives for any A with [x,y] = 1. In 2026l (Ch. 147), we constructed H(M) for M Lorentzian. In 2026m (Ch. 148), we defined causal homotopy, π1^causal, and H1^causal. In 2026n (Ch. 149), we defined H^n_causal(H(M)) for all n. In 2026o (Ch. 150), we proved the fourteen papers are one theorem. In 2026p (Ch. 151), we proved Einstein + NEC + Bridge ⇒ no CTC, and NEC violation still forces erasure. In 2026q (Ch. 152), we proved quantum M still forces erasure, branch + interference. Here we give the concrete lab protocol that tests all seventeen papers in one interferometer. Setup: Mach-Zehnder interferometer, single photons, which-way marker W, quantum eraser E. Define D = distinguishability from W, V = fringe visibility at output. We prove: (1) D^2+V^2 ≤ 1 is exactly the lab shadow of no unital T → E preserving [x,y], (2) eraser E is CPTP by 2026d, and restores V only by erasing D, (3) delayed-choice eraser does not retro-cause: erasure acts on H(M) causal history, not on past M, (4) a repeatable run with D ≈ 1, V ≈ 1, no eraser, at >3σ, falsifies 2026i and hence 2026o/p/q and the whole arc, (5) a run with D → 1 forcing V → 0, and eraser restoring V → 1 forcing D → 0, confirms the One Theorem in lab. This is a protocol paper, not a data paper. No data is claimed. The protocol is falsifiable, cheap, and doable with existing photonics. Tseglin 2026r = Ch. 153. Cites Tseglin 2026a DOI 10.5281/zenodo.23977165, 2026b DOI 10.5281/zenodo.23980498, 2026c DOI 10.5281/zenodo.23980738, 2026d DOI 10.5281/zenodo.23981860, 2026e DOI 10.5281/zenodo.23982063, 2026f DOI 10.5281/zenodo.23982359, 2026g DOI 10.5281/zenodo.23985216, 2026h DOI 10.5281/zenodo.23991367, 2026i DOI 10.5281/zenodo.23991442, 2026j DOI 10.5281/zenodo.23991535, 2026k DOI 10.5281/zenodo.23991603, 2026l DOI 10.5281/zenodo.23991665, 2026m DOI 10.5281/zenodo.23991998, 2026n DOI 10.5281/zenodo.23992083, 2026o DOI 10.5281/zenodo.23992187, 2026p DOI 10.5281/zenodo.23992267, 2026q DOI 10.5281/zenodo.23992317.

•Nov 6, 2026•0 citations

A Protocol to Test Chronology Protection in a Delayed-Choice Quantum Eraser

Robert Aaron Tseglin

In 2020, the author proposed a Chronology Protection Law derived from quantum mechanics (Tseglin, 2020, self-published). That work was theoretical and not peer-reviewed, and did not propose a falsifiable experimental difference from standard quantum mechanics. This paper corrects that gap. It does not claim that chronology protection exists. It does not claim that standard quantum mechanics is wrong. It claims a protocol. We propose a pre-registered delayed-choice quantum eraser experiment that tests for a measurable difference between standard quantum mechanics and a chronology protection force. We define specific observables: visibility loss (ΔV ≥ 0.05), energy cost (ΔE > 5σ), and time delay (Δt > 5σ), with control-vs-control baseline and replication in 3 labs. No experimental result is claimed in this paper. If the predicted anomaly is not observed, the chronology protection force as defined here is ruled out at the tested scale. Protocol version: v1.0, November 15, 2026. Keywords: chronology protection, delayed-choice quantum eraser, quantum mechanics, falsifiable protocol, Hawking, causality

•Nov 15, 2026•0 citations

Timeline: The Arc in One Figure

Robert Aaron Tseglin

This is the timeline paper for the arc 2026a–2026v. It does not prove a new theorem. It puts all twenty-two papers in one figure, in order, with one line each, so a reader can see the whole arc at a glance. In 2026a (Ch. 124), we proved no unital map T → E for H = S^1. In 2026b (Ch. 125), we generalized to the triple (dim H^n, dim C^n, 1). In 2026c (Ch. 138), we defined the Bridge Conjecture. In 2026d (Ch. 139), we proved the eraser must be CPTP. In 2026e (Ch. 140), we proved all four follow from one Unifier Axiom: [x,y] = 1. In 2026f (Ch. 141), we categorified H. In 2026g (Ch. 142), we proved the Unifier survives in characteristic p. In 2026h (Ch. 143), we proved it survives for infinite H. In 2026i (Ch. 144), we gave the lab falsifier D^2 + V^2 ≤ 1. In 2026j (Ch. 145), we proved the nine papers are one theorem. In 2026k (Ch. 146), we proved the Unifier survives for any A with [x,y] = 1. In 2026l (Ch. 147), we constructed H(M) for M Lorentzian. In 2026m (Ch. 148), we defined causal homotopy, π1^causal, and H1^causal. In 2026n (Ch. 149), we defined H^n_causal(H(M)) for all n. In 2026o (Ch. 150), we proved the fourteen papers are one theorem. In 2026p (Ch. 151), we proved Einstein + NEC + Bridge ⇒ no CTC, and NEC violation still forces erasure. In 2026q (Ch. 152), we proved quantum M still forces erasure, branch + interference. In 2026r (Ch. 153), we gave the concrete lab protocol: Mach-Zehnder, W, E, D^2+V^2 ≤ 1, delayed-choice without retro-causation. In 2026s (Ch. 154), we proved the eighteen papers are one theorem. In 2026t (Ch. 155), we listed the open problems: NEC, M-Hat, lab, weaker Unifier, concrete H^1_causal, categorical F, joint char p + infinite + QFT. In 2026u (Ch. 156), we gave the index: twenty papers, one page, one falsifier, one reading path. In 2026v (Ch. 157), we gave the collected abstracts: twenty papers in twenty paragraphs. By 2026s, the twenty-two papers stand or fall together. By 2026t, the open questions are: NEC, M-Hat, lab. By 2026u, the map is one page. By 2026v, the abstracts are twenty paragraphs. This paper is the timeline in one figure. Tseglin 2026w = Ch. 158. Cites Tseglin 2026a DOI 10.5281/zenodo.23977165, 2026b DOI 10.5281/zenodo.23980498, 2026c DOI 10.5281/zenodo.23980738, 2026d DOI 10.5281/zenodo.23981860, 2026e DOI 10.5281/zenodo.23982063, 2026f DOI 10.5281/zenodo.23982359, 2026g DOI 10.5281/zenodo.23985216, 2026h DOI 10.5281/zenodo.23991367, 2026i DOI 10.5281/zenodo.23991442, 2026j DOI 10.5281/zenodo.23991535, 2026k DOI 10.5281/zenodo.23991603, 2026l DOI 10.5281/zenodo.23991665, 2026m DOI 10.5281/zenodo.23991998, 2026n DOI 10.5281/zenodo.23992083, 2026o DOI 10.5281/zenodo.23992187, 2026p DOI 10.5281/zenodo.23992267, 2026q DOI 10.5281/zenodo.23992317, 2026r DOI 10.5281/zenodo.23992397, 2026s DOI 10.5281/zenodo.23992535, 2026t DOI 10.5281/zenodo.23992634, 2026u DOI 10.5281/zenodo.23992755, 2026v DOI 10.5281/zenodo.23992855.

•Nov 6, 2026•0 citations

Glossary: Every Symbol in One Page

Robert Aaron Tseglin

This is the glossary paper for the arc 2026a–2026w. It does not prove a new theorem. It defines every symbol used in all twenty-three papers, in one place, so a reader can read any paper without guessing notation. In 2026a (Ch. 124), we proved no unital map T → E for H = S^1. In 2026b (Ch. 125), we generalized to the triple (dim H^n, dim C^n, 1). In 2026c (Ch. 138), we defined the Bridge Conjecture. In 2026d (Ch. 139), we proved the eraser must be CPTP. In 2026e (Ch. 140), we proved all four follow from one Unifier Axiom: [x,y] = 1. In 2026f (Ch. 141), we categorified H. In 2026g (Ch. 142), we proved the Unifier survives in characteristic p. In 2026h (Ch. 143), we proved it survives for infinite H. In 2026i (Ch. 144), we gave the lab falsifier D^2 + V^2 ≤ 1. In 2026j (Ch. 145), we proved the nine papers are one theorem. In 2026k (Ch. 146), we proved the Unifier survives for any A with [x,y] = 1. In 2026l (Ch. 147), we constructed H(M) for M Lorentzian. In 2026m (Ch. 148), we defined causal homotopy, π1^causal, and H1^causal. In 2026n (Ch. 149), we defined H^n_causal(H(M)) for all n. In 2026o (Ch. 150), we proved the fourteen papers are one theorem. In 2026p (Ch. 151), we proved Einstein + NEC + Bridge ⇒ no CTC, and NEC violation still forces erasure. In 2026q (Ch. 152), we proved quantum M still forces erasure, branch + interference. In 2026r (Ch. 153), we gave the concrete lab protocol: Mach-Zehnder, W, E, D^2+V^2 ≤ 1, delayed-choice without retro-causation. In 2026s (Ch. 154), we proved the eighteen papers are one theorem. In 2026t (Ch. 155), we listed the open problems: NEC, M-Hat, lab, weaker Unifier, concrete H^1_causal, categorical F, joint char p + infinite + QFT. In 2026u (Ch. 156), we gave the index: twenty papers, one page, one falsifier, one reading path. In 2026v (Ch. 157), we gave the collected abstracts: twenty papers in twenty paragraphs. In 2026w (Ch. 158), we gave the timeline: the arc in one figure. By 2026s, the twenty-three papers stand or fall together. By 2026t, the open questions are: NEC, M-Hat, lab. By 2026u, the map is one page. By 2026v, the abstracts are twenty paragraphs. By 2026w, the timeline is one figure. This paper is the glossary. Tseglin 2026x = Ch. 159. Cites Tseglin 2026a DOI 10.5281/zenodo.23977165, 2026b DOI 10.5281/zenodo.23980498, 2026c DOI 10.5281/zenodo.23980738, 2026d DOI 10.5281/zenodo.23981860, 2026e DOI 10.5281/zenodo.23982063, 2026f DOI 10.5281/zenodo.23982359, 2026g DOI 10.5281/zenodo.23985216, 2026h DOI 10.5281/zenodo.23991367, 2026i DOI 10.5281/zenodo.23991442, 2026j DOI 10.5281/zenodo.23991535, 2026k DOI 10.5281/zenodo.23991603, 2026l DOI 10.5281/zenodo.23991665, 2026m DOI 10.5281/zenodo.23991998, 2026n DOI 10.5281/zenodo.23992083, 2026o DOI 10.5281/zenodo.23992187, 2026p DOI 10.5281/zenodo.23992267, 2026q DOI 10.5281/zenodo.23992317, 2026r DOI 10.5281/zenodo.23992397, 2026s DOI 10.5281/zenodo.23992535, 2026t DOI 10.5281/zenodo.23992634, 2026u DOI 10.5281/zenodo.23992755, 2026v DOI 10.5281/zenodo.23992855, 2026w DOI 10.5281/zenodo.23992944.

•Nov 6, 2026•0 citations

Collected Abstracts: The Twenty Papers in Twenty Paragraphs

Robert Aaron Tseglin

This is the collected-abstracts paper for the arc 2026a–2026u. It does not prove a new theorem. It collects, in order, one paragraph per paper, for all twenty-one papers, so a reader can see the whole arc in one place. In 2026a (Ch. 124), we proved no unital map T → E for H = S^1. In 2026b (Ch. 125), we generalized to the triple (dim H^n, dim C^n, 1). In 2026c (Ch. 138), we defined the Bridge Conjecture. In 2026d (Ch. 139), we proved the eraser must be CPTP. In 2026e (Ch. 140), we proved all four follow from one Unifier Axiom: [x,y] = 1. In 2026f (Ch. 141), we categorified H. In 2026g (Ch. 142), we proved the Unifier survives in characteristic p. In 2026h (Ch. 143), we proved it survives for infinite H. In 2026i (Ch. 144), we gave the lab falsifier D^2 + V^2 ≤ 1. In 2026j (Ch. 145), we proved the nine papers are one theorem. In 2026k (Ch. 146), we proved the Unifier survives for any A with [x,y] = 1. In 2026l (Ch. 147), we constructed H(M) for M Lorentzian. In 2026m (Ch. 148), we defined causal homotopy, π1^causal, and H1^causal. In 2026n (Ch. 149), we defined H^n_causal(H(M)) for all n. In 2026o (Ch. 150), we proved the fourteen papers are one theorem. In 2026p (Ch. 151), we proved Einstein + NEC + Bridge ⇒ no CTC, and NEC violation still forces erasure. In 2026q (Ch. 152), we proved quantum M still forces erasure, branch + interference. In 2026r (Ch. 153), we gave the concrete lab protocol: Mach-Zehnder, W, E, D^2+V^2 ≤ 1, delayed-choice without retro-causation. In 2026s (Ch. 154), we proved the eighteen papers are one theorem. In 2026t (Ch. 155), we listed the open problems: NEC, M-Hat, lab, weaker Unifier, concrete H^1_causal, categorical F, joint char p + infinite + QFT. In 2026u (Ch. 156), we gave the index: twenty papers, one page, one falsifier, one reading path. By 2026s, the twenty-one papers stand or fall together. By 2026t, the open questions are: NEC, M-Hat, lab. By 2026u, the map is one page. This paper is the twenty paragraphs. Tseglin 2026v = Ch. 157. Cites Tseglin 2026a DOI 10.5281/zenodo.23977165, 2026b DOI 10.5281/zenodo.23980498, 2026c DOI 10.5281/zenodo.23980738, 2026d DOI 10.5281/zenodo.23981860, 2026e DOI 10.5281/zenodo.23982063, 2026f DOI 10.5281/zenodo.23982359, 2026g DOI 10.5281/zenodo.23985216, 2026h DOI 10.5281/zenodo.23991367, 2026i DOI 10.5281/zenodo.23991442, 2026j DOI 10.5281/zenodo.23991535, 2026k DOI 10.5281/zenodo.23991603, 2026l DOI 10.5281/zenodo.23991665, 2026m DOI 10.5281/zenodo.23991998, 2026n DOI 10.5281/zenodo.23992083, 2026o DOI 10.5281/zenodo.23992187, 2026p DOI 10.5281/zenodo.23992267, 2026q DOI 10.5281/zenodo.23992317, 2026r DOI 10.5281/zenodo.23992397, 2026s DOI 10.5281/zenodo.23992535, 2026t DOI 10.5281/zenodo.23992634, 2026u DOI 10.5281/zenodo.23992755.

•Nov 6, 2026•0 citations

Falsifiable Predictions, 3-Qubit Discriminator, and Worked Case Reanalysis under P1+P2

Roberto Valtancoli

The author develops the experimental layer of the framework introduced in the foundational Preprint I. Seven families of falsifiable predictions (F1–F7) are stated and matched to ten falsification criteria (F-T1–F-T10). The predictions cover: τ-window scaling laws under monitored feedback and non-Markovian memory; a 3-qubit ontological feedforward discriminator constructed to separate synchronisation-based from entanglement-based metric emergence; a directional-asymmetry test Δ(τ) with null control; a 4-qubit triangle-inequality test on the metric-compatibility regime; an asymptotic large-deviation consistency channel as cross-cutting envelope; a coherence-affected entropy-production consistency target; and a sync-rate scaling under Dicke collective dissipation. A worked-case reanalysis of Micadei et al. (2019) under the non-Markovian channel of P1 demonstrates non-vacuity of the framework on existing experimental data within a factor ≈ 2.5 on a nine-decade timescale range. The operational definition of the memory timescale τₘₑₘ was fixed prior to numerical evaluation as a matter of pre-registration discipline, with an analytic zero-crossing alternative computed for transparency and explicitly rejected under the conservative bound. A structured Nakajima–Zwanzig–TCL2 sketch indicating the sign and structure of the next-to-leading-order correction for the Micadei interaction Hamiltonian is provided in Appendix E-II, identifying this residual as a target for next-to-leading-order refinement in the smallness parameter (Φ_NM − 1).

•May 1, 2026•0 citations
This is a pre-registration, not a claim of experimental success. It states in advance one quantitative prediction that differs from standard quantum optics, one protocol to test it, and one set of falsification criteria. Claim: A causal loop with H^1_causal != 0 adds an extra erasure factor gamma_causal(L), even when the which-way marker W is held fixed. Setup: Mach-Zehnder interferometer, heralded single photons at 810 nm, which-way marker overlap |<W0|W1>| = 0.60, one arm through a fiber delay loop of length L. Standard prediction (Englert 1996):V_standard = 0.600, D = 0.800, D^2 + V^2 = 1.000, flat in L. Tseglin prediction:gamma_causal(L) = 0.30 * (1 - exp(-L / 2.0 m))V_Tseglin(L) = 0.600 * (1 - gamma_causal(L)) Headline number at L = 3.0 m:Standard: V = 0.600 +/- 0.010Tseglin: V = 0.460 +/- 0.010Difference: Delta V = 0.140 Vindicated if: V(3.0 m) = 0.460 +/- 0.030 and V(L) follows the predicted curve within +/- 0.03.Falsified if: V(3.0 m) = 0.600 +/- 0.030 and V is flat in L within +/- 0.02.Inconclusive if: D drifts, control drifts, or error bars exceed 0.03. No experimental data are reported herein. Keywords: quantum eraserMach-Zehnder interferometercomplementaritypre-registrationcausal topologyfalsifiable prediction
This paper is the third paper after Synthesis II, and the lab paper promised in 2026i, 2026o, 2026p, 2026q. In 2026a (Ch. 124), we proved no unital map T → E for H = S^1. In 2026b (Ch. 125), we generalized to the triple (dim H^n, dim C^n, 1). In 2026c (Ch. 138), we defined the Bridge Conjecture. In 2026d (Ch. 139), we proved the eraser must be CPTP. In 2026e (Ch. 140), we proved all four follow from one Unifier Axiom: [x,y] = 1. In 2026f (Ch. 141), we categorified H. In 2026g (Ch. 142), we proved the Unifier survives in characteristic p. In 2026h (Ch. 143), we proved it survives for infinite H. In 2026i (Ch. 144), we gave the lab falsifier D^2 + V^2 ≤ 1. In 2026j (Ch. 145), we proved the nine papers are one theorem. In 2026k (Ch. 146), we proved the Unifier survives for any A with [x,y] = 1. In 2026l (Ch. 147), we constructed H(M) for M Lorentzian. In 2026m (Ch. 148), we defined causal homotopy, π1^causal, and H1^causal. In 2026n (Ch. 149), we defined H^n_causal(H(M)) for all n. In 2026o (Ch. 150), we proved the fourteen papers are one theorem. In 2026p (Ch. 151), we proved Einstein + NEC + Bridge ⇒ no CTC, and NEC violation still forces erasure. In 2026q (Ch. 152), we proved quantum M still forces erasure, branch + interference. Here we give the concrete lab protocol that tests all seventeen papers in one interferometer. Setup: Mach-Zehnder interferometer, single photons, which-way marker W, quantum eraser E. Define D = distinguishability from W, V = fringe visibility at output. We prove: (1) D^2+V^2 ≤ 1 is exactly the lab shadow of no unital T → E preserving [x,y], (2) eraser E is CPTP by 2026d, and restores V only by erasing D, (3) delayed-choice eraser does not retro-cause: erasure acts on H(M) causal history, not on past M, (4) a repeatable run with D ≈ 1, V ≈ 1, no eraser, at >3σ, falsifies 2026i and hence 2026o/p/q and the whole arc, (5) a run with D → 1 forcing V → 0, and eraser restoring V → 1 forcing D → 0, confirms the One Theorem in lab. This is a protocol paper, not a data paper. No data is claimed. The protocol is falsifiable, cheap, and doable with existing photonics. Tseglin 2026r = Ch. 153. Cites Tseglin 2026a DOI 10.5281/zenodo.23977165, 2026b DOI 10.5281/zenodo.23980498, 2026c DOI 10.5281/zenodo.23980738, 2026d DOI 10.5281/zenodo.23981860, 2026e DOI 10.5281/zenodo.23982063, 2026f DOI 10.5281/zenodo.23982359, 2026g DOI 10.5281/zenodo.23985216, 2026h DOI 10.5281/zenodo.23991367, 2026i DOI 10.5281/zenodo.23991442, 2026j DOI 10.5281/zenodo.23991535, 2026k DOI 10.5281/zenodo.23991603, 2026l DOI 10.5281/zenodo.23991665, 2026m DOI 10.5281/zenodo.23991998, 2026n DOI 10.5281/zenodo.23992083, 2026o DOI 10.5281/zenodo.23992187, 2026p DOI 10.5281/zenodo.23992267, 2026q DOI 10.5281/zenodo.23992317.
In 2020, the author proposed a Chronology Protection Law derived from quantum mechanics (Tseglin, 2020, self-published). That work was theoretical and not peer-reviewed, and did not propose a falsifiable experimental difference from standard quantum mechanics. This paper corrects that gap. It does not claim that chronology protection exists. It does not claim that standard quantum mechanics is wrong. It claims a protocol. We propose a pre-registered delayed-choice quantum eraser experiment that tests for a measurable difference between standard quantum mechanics and a chronology protection force. We define specific observables: visibility loss (ΔV ≥ 0.05), energy cost (ΔE > 5σ), and time delay (Δt > 5σ), with control-vs-control baseline and replication in 3 labs. No experimental result is claimed in this paper. If the predicted anomaly is not observed, the chronology protection force as defined here is ruled out at the tested scale. Protocol version: v1.0, November 15, 2026. Keywords: chronology protection, delayed-choice quantum eraser, quantum mechanics, falsifiable protocol, Hawking, causality
This is the timeline paper for the arc 2026a–2026v. It does not prove a new theorem. It puts all twenty-two papers in one figure, in order, with one line each, so a reader can see the whole arc at a glance. In 2026a (Ch. 124), we proved no unital map T → E for H = S^1. In 2026b (Ch. 125), we generalized to the triple (dim H^n, dim C^n, 1). In 2026c (Ch. 138), we defined the Bridge Conjecture. In 2026d (Ch. 139), we proved the eraser must be CPTP. In 2026e (Ch. 140), we proved all four follow from one Unifier Axiom: [x,y] = 1. In 2026f (Ch. 141), we categorified H. In 2026g (Ch. 142), we proved the Unifier survives in characteristic p. In 2026h (Ch. 143), we proved it survives for infinite H. In 2026i (Ch. 144), we gave the lab falsifier D^2 + V^2 ≤ 1. In 2026j (Ch. 145), we proved the nine papers are one theorem. In 2026k (Ch. 146), we proved the Unifier survives for any A with [x,y] = 1. In 2026l (Ch. 147), we constructed H(M) for M Lorentzian. In 2026m (Ch. 148), we defined causal homotopy, π1^causal, and H1^causal. In 2026n (Ch. 149), we defined H^n_causal(H(M)) for all n. In 2026o (Ch. 150), we proved the fourteen papers are one theorem. In 2026p (Ch. 151), we proved Einstein + NEC + Bridge ⇒ no CTC, and NEC violation still forces erasure. In 2026q (Ch. 152), we proved quantum M still forces erasure, branch + interference. In 2026r (Ch. 153), we gave the concrete lab protocol: Mach-Zehnder, W, E, D^2+V^2 ≤ 1, delayed-choice without retro-causation. In 2026s (Ch. 154), we proved the eighteen papers are one theorem. In 2026t (Ch. 155), we listed the open problems: NEC, M-Hat, lab, weaker Unifier, concrete H^1_causal, categorical F, joint char p + infinite + QFT. In 2026u (Ch. 156), we gave the index: twenty papers, one page, one falsifier, one reading path. In 2026v (Ch. 157), we gave the collected abstracts: twenty papers in twenty paragraphs. By 2026s, the twenty-two papers stand or fall together. By 2026t, the open questions are: NEC, M-Hat, lab. By 2026u, the map is one page. By 2026v, the abstracts are twenty paragraphs. This paper is the timeline in one figure. Tseglin 2026w = Ch. 158. Cites Tseglin 2026a DOI 10.5281/zenodo.23977165, 2026b DOI 10.5281/zenodo.23980498, 2026c DOI 10.5281/zenodo.23980738, 2026d DOI 10.5281/zenodo.23981860, 2026e DOI 10.5281/zenodo.23982063, 2026f DOI 10.5281/zenodo.23982359, 2026g DOI 10.5281/zenodo.23985216, 2026h DOI 10.5281/zenodo.23991367, 2026i DOI 10.5281/zenodo.23991442, 2026j DOI 10.5281/zenodo.23991535, 2026k DOI 10.5281/zenodo.23991603, 2026l DOI 10.5281/zenodo.23991665, 2026m DOI 10.5281/zenodo.23991998, 2026n DOI 10.5281/zenodo.23992083, 2026o DOI 10.5281/zenodo.23992187, 2026p DOI 10.5281/zenodo.23992267, 2026q DOI 10.5281/zenodo.23992317, 2026r DOI 10.5281/zenodo.23992397, 2026s DOI 10.5281/zenodo.23992535, 2026t DOI 10.5281/zenodo.23992634, 2026u DOI 10.5281/zenodo.23992755, 2026v DOI 10.5281/zenodo.23992855.
This is the glossary paper for the arc 2026a–2026w. It does not prove a new theorem. It defines every symbol used in all twenty-three papers, in one place, so a reader can read any paper without guessing notation. In 2026a (Ch. 124), we proved no unital map T → E for H = S^1. In 2026b (Ch. 125), we generalized to the triple (dim H^n, dim C^n, 1). In 2026c (Ch. 138), we defined the Bridge Conjecture. In 2026d (Ch. 139), we proved the eraser must be CPTP. In 2026e (Ch. 140), we proved all four follow from one Unifier Axiom: [x,y] = 1. In 2026f (Ch. 141), we categorified H. In 2026g (Ch. 142), we proved the Unifier survives in characteristic p. In 2026h (Ch. 143), we proved it survives for infinite H. In 2026i (Ch. 144), we gave the lab falsifier D^2 + V^2 ≤ 1. In 2026j (Ch. 145), we proved the nine papers are one theorem. In 2026k (Ch. 146), we proved the Unifier survives for any A with [x,y] = 1. In 2026l (Ch. 147), we constructed H(M) for M Lorentzian. In 2026m (Ch. 148), we defined causal homotopy, π1^causal, and H1^causal. In 2026n (Ch. 149), we defined H^n_causal(H(M)) for all n. In 2026o (Ch. 150), we proved the fourteen papers are one theorem. In 2026p (Ch. 151), we proved Einstein + NEC + Bridge ⇒ no CTC, and NEC violation still forces erasure. In 2026q (Ch. 152), we proved quantum M still forces erasure, branch + interference. In 2026r (Ch. 153), we gave the concrete lab protocol: Mach-Zehnder, W, E, D^2+V^2 ≤ 1, delayed-choice without retro-causation. In 2026s (Ch. 154), we proved the eighteen papers are one theorem. In 2026t (Ch. 155), we listed the open problems: NEC, M-Hat, lab, weaker Unifier, concrete H^1_causal, categorical F, joint char p + infinite + QFT. In 2026u (Ch. 156), we gave the index: twenty papers, one page, one falsifier, one reading path. In 2026v (Ch. 157), we gave the collected abstracts: twenty papers in twenty paragraphs. In 2026w (Ch. 158), we gave the timeline: the arc in one figure. By 2026s, the twenty-three papers stand or fall together. By 2026t, the open questions are: NEC, M-Hat, lab. By 2026u, the map is one page. By 2026v, the abstracts are twenty paragraphs. By 2026w, the timeline is one figure. This paper is the glossary. Tseglin 2026x = Ch. 159. Cites Tseglin 2026a DOI 10.5281/zenodo.23977165, 2026b DOI 10.5281/zenodo.23980498, 2026c DOI 10.5281/zenodo.23980738, 2026d DOI 10.5281/zenodo.23981860, 2026e DOI 10.5281/zenodo.23982063, 2026f DOI 10.5281/zenodo.23982359, 2026g DOI 10.5281/zenodo.23985216, 2026h DOI 10.5281/zenodo.23991367, 2026i DOI 10.5281/zenodo.23991442, 2026j DOI 10.5281/zenodo.23991535, 2026k DOI 10.5281/zenodo.23991603, 2026l DOI 10.5281/zenodo.23991665, 2026m DOI 10.5281/zenodo.23991998, 2026n DOI 10.5281/zenodo.23992083, 2026o DOI 10.5281/zenodo.23992187, 2026p DOI 10.5281/zenodo.23992267, 2026q DOI 10.5281/zenodo.23992317, 2026r DOI 10.5281/zenodo.23992397, 2026s DOI 10.5281/zenodo.23992535, 2026t DOI 10.5281/zenodo.23992634, 2026u DOI 10.5281/zenodo.23992755, 2026v DOI 10.5281/zenodo.23992855, 2026w DOI 10.5281/zenodo.23992944.
This is the collected-abstracts paper for the arc 2026a–2026u. It does not prove a new theorem. It collects, in order, one paragraph per paper, for all twenty-one papers, so a reader can see the whole arc in one place. In 2026a (Ch. 124), we proved no unital map T → E for H = S^1. In 2026b (Ch. 125), we generalized to the triple (dim H^n, dim C^n, 1). In 2026c (Ch. 138), we defined the Bridge Conjecture. In 2026d (Ch. 139), we proved the eraser must be CPTP. In 2026e (Ch. 140), we proved all four follow from one Unifier Axiom: [x,y] = 1. In 2026f (Ch. 141), we categorified H. In 2026g (Ch. 142), we proved the Unifier survives in characteristic p. In 2026h (Ch. 143), we proved it survives for infinite H. In 2026i (Ch. 144), we gave the lab falsifier D^2 + V^2 ≤ 1. In 2026j (Ch. 145), we proved the nine papers are one theorem. In 2026k (Ch. 146), we proved the Unifier survives for any A with [x,y] = 1. In 2026l (Ch. 147), we constructed H(M) for M Lorentzian. In 2026m (Ch. 148), we defined causal homotopy, π1^causal, and H1^causal. In 2026n (Ch. 149), we defined H^n_causal(H(M)) for all n. In 2026o (Ch. 150), we proved the fourteen papers are one theorem. In 2026p (Ch. 151), we proved Einstein + NEC + Bridge ⇒ no CTC, and NEC violation still forces erasure. In 2026q (Ch. 152), we proved quantum M still forces erasure, branch + interference. In 2026r (Ch. 153), we gave the concrete lab protocol: Mach-Zehnder, W, E, D^2+V^2 ≤ 1, delayed-choice without retro-causation. In 2026s (Ch. 154), we proved the eighteen papers are one theorem. In 2026t (Ch. 155), we listed the open problems: NEC, M-Hat, lab, weaker Unifier, concrete H^1_causal, categorical F, joint char p + infinite + QFT. In 2026u (Ch. 156), we gave the index: twenty papers, one page, one falsifier, one reading path. By 2026s, the twenty-one papers stand or fall together. By 2026t, the open questions are: NEC, M-Hat, lab. By 2026u, the map is one page. This paper is the twenty paragraphs. Tseglin 2026v = Ch. 157. Cites Tseglin 2026a DOI 10.5281/zenodo.23977165, 2026b DOI 10.5281/zenodo.23980498, 2026c DOI 10.5281/zenodo.23980738, 2026d DOI 10.5281/zenodo.23981860, 2026e DOI 10.5281/zenodo.23982063, 2026f DOI 10.5281/zenodo.23982359, 2026g DOI 10.5281/zenodo.23985216, 2026h DOI 10.5281/zenodo.23991367, 2026i DOI 10.5281/zenodo.23991442, 2026j DOI 10.5281/zenodo.23991535, 2026k DOI 10.5281/zenodo.23991603, 2026l DOI 10.5281/zenodo.23991665, 2026m DOI 10.5281/zenodo.23991998, 2026n DOI 10.5281/zenodo.23992083, 2026o DOI 10.5281/zenodo.23992187, 2026p DOI 10.5281/zenodo.23992267, 2026q DOI 10.5281/zenodo.23992317, 2026r DOI 10.5281/zenodo.23992397, 2026s DOI 10.5281/zenodo.23992535, 2026t DOI 10.5281/zenodo.23992634, 2026u DOI 10.5281/zenodo.23992755.
The author develops the experimental layer of the framework introduced in the foundational Preprint I. Seven families of falsifiable predictions (F1–F7) are stated and matched to ten falsification criteria (F-T1–F-T10). The predictions cover: τ-window scaling laws under monitored feedback and non-Markovian memory; a 3-qubit ontological feedforward discriminator constructed to separate synchronisation-based from entanglement-based metric emergence; a directional-asymmetry test Δ(τ) with null control; a 4-qubit triangle-inequality test on the metric-compatibility regime; an asymptotic large-deviation consistency channel as cross-cutting envelope; a coherence-affected entropy-production consistency target; and a sync-rate scaling under Dicke collective dissipation. A worked-case reanalysis of Micadei et al. (2019) under the non-Markovian channel of P1 demonstrates non-vacuity of the framework on existing experimental data within a factor ≈ 2.5 on a nine-decade timescale range. The operational definition of the memory timescale τₘₑₘ was fixed prior to numerical evaluation as a matter of pre-registration discipline, with an analytic zero-crossing alternative computed for transparency and explicitly rejected under the conservative bound. A structured Nakajima–Zwanzig–TCL2 sketch indicating the sign and structure of the next-to-leading-order correction for the Micadei interaction Hamiltonian is provided in Appendix E-II, identifying this residual as a target for next-to-leading-order refinement in the smallness parameter (Φ_NM − 1).