Repository navigation
Expand file tree
/
Copy pathexecutable_observer_construction.tex
More file actions
4568 lines (4129 loc) · 245 KB
/
Copy pathexecutable_observer_construction.tex
File metadata and controls
4568 lines (4129 loc) · 245 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
\documentclass[11pt]{article}
\usepackage[T1]{fontenc}
\usepackage[utf8]{inputenc}
\usepackage{lmodern}
\usepackage[margin=1in]{geometry}
\usepackage{amsmath,amssymb,amsthm,mathtools}
\usepackage[shortlabels]{enumitem}
\usepackage{booktabs,array,longtable}
\usepackage{hyperref}
\usepackage{xurl}
\input{release_info.tex}
\hypersetup{colorlinks=true,linkcolor=blue,citecolor=blue,urlcolor=blue,
pdftitle={An Executable Observer for Observer Patch Holography: Specification, Executed Components and Ordered Joins},
pdfauthor={Bernhard Mueller; Mario Poneder; Jinwook Kim; Daniel Ari Friedman}}
\newtheorem{theorem}{Theorem}[section]
\newtheorem{proposition}[theorem]{Proposition}
\newtheorem{lemma}[theorem]{Lemma}
\newtheorem{corollary}[theorem]{Corollary}
\theoremstyle{definition}
\newtheorem{definition}[theorem]{Definition}
\theoremstyle{remark}
\newtheorem{remark}[theorem]{Remark}
\theoremstyle{plain}
\newcolumntype{L}[1]{>{\raggedright\arraybackslash}p{#1}}
\newcommand{\ket}[1]{\lvert #1\rangle}
\newcommand{\bra}[1]{\langle #1\rvert}
\newcommand{\proj}[1]{\lvert #1\rangle\langle #1\rvert}
\newcommand{\Tr}{\operatorname{Tr}}
\newcommand{\Ex}{\mathbb{E}}
\newcommand{\Cn}{\mathsf{C}}
\newcommand{\En}{\mathsf{E}}
\newcommand{\Czero}{\mathsf{C}_0}
\newcommand{\Tn}{\mathsf{T}}
\newcommand{\Eflux}{\mathcal{E}}
\newcommand{\TV}{\operatorname{TV}}
\newcommand{\dist}{\operatorname{dist}}
\newcommand{\diag}{\operatorname{diag}}
\newcommand{\rk}{\operatorname{rank}}
\newcommand{\C}{\mathbb{C}}
\newcommand{\Hil}{\mathcal{H}}
\usepackage{microtype}
\title{An Executable Observer for Observer Patch Holography:\\
Specification, Executed Components and Ordered Joins}
\author{Bernhard Mueller\textsuperscript{1,2,*}\qquad Mario Poneder\qquad
Jinwook Kim\textsuperscript{3}\qquad
Daniel Ari Friedman\textsuperscript{4,5}}
\date{\OPHPaperReleaseDate}
\setlength{\emergencystretch}{3em}
\input{tex_fragments/figures/FIGURE_STYLE.tex}
\begin{document}
\maketitle
\OPHPaperReleaseBanner
\begin{center}
\footnotesize
\textsuperscript{1}Pragma Research Inc.\quad
\textsuperscript{2}Information Physics Institute\quad
\textsuperscript{3}Oraclizer Labs\quad
\textsuperscript{4}Active Inference Institute\quad
\textsuperscript{5}FractiAI\\
\textsuperscript{*}Corresponding author:
\href{mailto:bernhard@floatingpragma.ai}{\nolinkurl{bernhard@floatingpragma.ai}}
\end{center}
\begin{abstract}
Observer Patch Holography (OPH) is made testable by its executable-model
hypothesis: a fully specified local repair and memory law on the proposed
carrier architecture admits continuing observers whose records have the
observed quantum-field and gravitational descriptions. This paper is the base
of that hypothesis. It specifies the twelve-port icosahedral carrier, the
native C/E seam repair with its exactly classified family of quantum record
laws, the finite observer algebra, the declared services and the scheduler,
and reports the finite components executed on that specification. Uniform
seam attempts have exact quantum gap $(5-\sqrt5)/60$; a record-steered
observer moves a final occupation from $1/6$ to $35/264$; nine
source-executed measurements identify every coordinate of the record-law
family. Overlapping observers read fields and event clocks from one
continuing history, and one register joins quantum electric flux, charged
fermions and a scalar with a feedback response certified nonzero at infinite
occupation. On the refining spherical source one repair history defines a
continuum operator of spectral dimension two governing Gaussian density
histories read by native incident clocks; a declared radial extension gives
a smooth $1+3$ free-scalar description of every fixed finite observer menu.
A specified coherent memory protects exchange-history sectors; complete
source factors further join fermionic propagation, Higgs-driven particle
creation, native repair and one calibrated clock. Their full outcome and
reference records are retained. Physical clock/energy validation, localized
particle identity, an interacting chiral $3+1$ limit and realized Einstein
premises are not established. Four negative controls remain: the native double-load defect decays with
survival $(5/6)^n$, the static radial product fails scalar null balance,
passive repair strictly attenuates coherence and has no wave sector, and the
tested mass laws miss the charged hierarchy.
\end{abstract}
\input{tex_fragments/EXECUTABLE_COMPLETION_HYPOTHESIS.tex}
\input{tex_fragments/FINITE_COMPLETION_CAMPAIGN.tex}
\section{This paper's hypothesis and place in the tower}
\label{sec:intro}
This paper is the executed part of layers two to four of the tower: the
carrier and its repair law, the executable observer, and the fields and
clocks read from one process. Its hypothesis is the executable-model
hypothesis stated above, taken at the level a finite execution can test.
The carrier, the native C/E repair law and its memory, the finite observer
algebra, the declared services and the scheduler are fixed before testing,
and the observers, records, local fields and event clocks of every result are
read from a process run under that one specification. Fields, particles and
geometry enter as descriptions of what observers record and jointly
interpret; no fundamental field or spacetime is reconstructed first
\cite{mCONSTRUCTION,mINTERP,basis}.
The paper proves finite theorems and certifies finite computations on the
declared objects: the seam rule from four requirements, the classification
of admissible quantum record laws, the exact gap, memory and recovery of the
native channels, record capacity, finite observers and field detectors with
every history retained, the common interacting source and its occupation
limits, overlapping-observer correspondence, local event clocks and matched
screens. For one repair history on the refining spherical source it proves
source limit theorems: a common continuum operator of spectral dimension
two, Gaussian density paths, incident-clock parametrizations and their
fluctuations. Conditional analytic theorems hold on supplied objects: a
declared radial product with a chosen wave action, and the supplied
interacting actions with their occupation limits.
None of these components is a physical clock, field theory, particle or
gravitational response. The five conjunctive obligations of the executable
hypothesis are open joins of this construction \cite{execHypothesis}:
observer algebras with faithful references, executed modular clocks and a
physical energy normalization; a nontrivial interacting chiral 3+1 field
theory with controlled refinement and detector maps; native defects
identified through charge, spin and statistics, propagation, interactions
and energy, with the measured spectrum; the Einstein reconstruction premises
realized on the same matter, state, modular flow, clocks and refining
geometry; and joint validation of complete observation and intervention
laws against independent measurements. Table~\ref{tab:obligations} separates
what this paper executes from what each obligation requires beyond it, and
Section~\ref{sec:joins} orders the joins with their acceptance conditions
and stopping tests.
A replayable failure of the specified law, state, access or readout contract
rejects that candidate and its tested interpretation. A proof covering every
realization of a frozen admissible class stops that class, and it rejects
OPH only if the excluded choice is proved necessary. Section~\ref{sec:joins}
records four such failures of the tested law: the native double-load defect
decays, the static radial product cannot balance a scalar excitation,
passive repair has no wave sector, and the tested mass laws miss the charged
hierarchy.
{
\footnotesize
\begin{longtable}{@{}L{0.17\linewidth}L{0.42\linewidth}L{0.35\linewidth}@{}}
\caption{The five obligations of the executable hypothesis
\cite{execHypothesis}, the components this paper executes toward each, and
the open join.}
\label{tab:obligations}\\
\toprule
\textbf{Obligation} & \textbf{Executed here} & \textbf{Open join}\\
\midrule
\endfirsthead
\multicolumn{3}{@{}l}{\footnotesize Table~\thetable\ continued}\\
\toprule
\textbf{Obligation} & \textbf{Executed here} & \textbf{Open join}\\
\midrule
\endhead
Clocks and energy normalization &
Finite modular flow of actual observation states and the fixed-reference
relation $t=-\beta s$ (Section~\ref{sec:readouts}); local, joint and active
event clocks (Sections~\ref{sec:local-tick}, \ref{sec:event-clocks});
native incident clocks with source limits and fluctuation predictions, and
faithful encoded-field states sharing one active clock
(Section~\ref{sec:native-history}). &
A reference selected by the process, regional compatibility, calibrated
duration and the energy normalization. Passive repair is no nontrivial
modular automorphism of an invariant observer algebra, and the uncapped
native-return reference tends to the trace.\\
\addlinespace
Interacting chiral 3+1 field theory &
Free-scalar refinement transfer and two-site occupation limits
(Section~\ref{sec:fields}); an interacting feedback signal at infinite
occupation (Section~\ref{sec:common}); the native continuum operator with
density, clock and admitted-wave limits, a declared radial product with
Lorentz-signature density, smoothing theorem and a quartic projection with
an occupation limit at fixed band (Section~\ref{sec:native-history}). &
The fields are free or two-mode; radial product, filters, preparations and
inverse temperature are declared; no interacting refining family and no
chiral matter. The native decay spectrum excludes a complete linear
identification with a compact free scalar.\\
\addlinespace
Native defects, identity and spectrum &
A charged realization with branch charge covariance
(Section~\ref{sec:p-detector}); a flux-dressed fermion code with operator
Gauss constraints (Section~\ref{sec:common-construction}); the collision
candidate tested (Section~\ref{sec:negative-controls}). &
No localized protected native sector, maintenance-energy law or spectrum.
The collision decays and the tested mass laws miss the charged hierarchy.\\
\addlinespace
Realized Einstein premises &
A rank-three response, native causal cones, the product's area and volume
dictionary, one characteristic cone for scalar, spinor and Maxwell symbols,
and a necessary spherical focusing equation
(Sections~\ref{sec:native-history},
\ref{sec:common-matter-metric-response}). &
Responsive geometry, conserved stress of the native process,
fixed-proper-volume generalized-entropy stationarity and a positive Newton
normalization. The static radial product fails null balance.\\
\addlinespace
Joint validation &
A prospectively fixed count protocol for the record-law coherence and its
sequential design; retrospective Bell and optical-clock replays; a
retrospective coupling audit (Section~\ref{sec:prediction}). &
One frozen physical dictionary compared with independent field, particle
and gravity data.\\
\bottomrule
\end{longtable}
}
The theorem library holds conditional theorems on consensus and repair
\cite{ophconsensus}, observers and records \cite{ophobservers}, gauge
structure \cite{ophgauge}, spacetime and Einstein dynamics
\cite{ophspacetime}, and screen microphysics \cite{ophmicro}; the flagship
synthesis gives the informal account \cite{flagship}. The labels A1, A2 and
A3 used there name theorem premises: A1 is the carrier, federation and
response layer of the specification, A2 the agreement condition with its
separately adopted response-endogeneity clause, and A3 the adopted
least-informative state-selection principle on its declared reference and
constraints. Neither selection nor connected-response endogeneity follows
from the closure equation alone. A theorem that uses them states an implication, and
Section~\ref{sec:premises} records, route by route, which antecedents the
construction supplies on its own finite objects.
The sections follow the tower. Section~\ref{sec:spec} states the
specification (layer two). Sections~\ref{sec:observer}
and~\ref{sec:native-process} give the executable observer on one carrier and
overlapping observers, event clocks and matched screens on one native process
(layer three). Sections~\ref{sec:fields} to~\ref{sec:native-history} give the
fields and clocks (layer four): field detectors on supplied actions, the
common interacting source, and the geometry, continuum operator, clocks and
fields of one repair history, followed by the common matter metric with its
gravitational control (the interface to layer six).
Section~\ref{sec:prediction} gives the prediction protocols,
Section~\ref{sec:premises} the premise map and Section~\ref{sec:joins} the
ordered joins. Every number is copied from a
retained receipt or a model document of the construction \cite{mREADME},
cited at a pinned revision of the public repository \cite{ophrepo}.
Results carry the claim classes of Table~\ref{tab:classes}. Actions,
preparations, couplings, instruments, services and schedules are inputs of
the specification, and apart from the retrospective replays of
Section~\ref{sec:public-records} no result is a comparison with independent
observations. Numbered theorems and propositions are finite theorems unless
they state a limit; items that quote a certified enclosure, table or
replayed count are certified finite computations; the occupation limits of
Section~\ref{sec:common} are conditional analytic theorems on their supplied
actions; the native continuum statements of
Section~\ref{sec:native-history} are source limit theorems with their
domain, normalization and order of limits; Sections~\ref{sec:public-records}
and~\ref{sec:endpoint} are diagnostics, and the count protocol of
Section~\ref{sec:ce-protocol} is a prospectively fixed conditional test.
\begin{table}[htbp]
\centering
\small
\caption{Claim classes used in this paper, from the flagship synthesis \cite{flagship}.}
\label{tab:classes}
\begin{tabular}{@{}L{0.30\linewidth}L{0.64\linewidth}@{}}
\toprule
\textbf{Class} & \textbf{Meaning}\\
\midrule
Finite theorem & A deductive result proved from displayed premises
on a stated finite domain. An exhaustive computation counts as part of the
proof only with a specified domain and a soundness argument.\\
Certified finite computation & An executable witness whose inputs,
controls, and output are fixed by a reproducible certificate; execution alone
does not promote its interpretation to a theorem.\\
Conditional analytic theorem & A theorem whose hypotheses include a supplied continuum action, state space or limit; its conclusion holds on that supplied object.\\
Source limit theorem & A theorem about the limit of a declared family of
finite source executions along a stated subsequence, with its
normalizations and order of limits displayed; the limit is derived, and its
physical identification is a separate claim.\\
Reconstruction implication & An exact implication whose antecedents
include displayed geometric or physical premises.\\
Unsupplied realization map & A required map from a finite object to a
physical event, current, field, clock, scale, or continuum structure for which
no construction is asserted.\\
Diagnostic & A certified computation compared against measured
values that it consumes; never counted as a prediction.\\
Prospectively fixed conditional test & A diagnostic with a custody-bound
target definition, kill band, precision floor, and decision rule fixed
before comparison.\\
\bottomrule
\end{tabular}
\end{table}
Seven claim records of the repository \cite{ophrepo} state the scope of the
executed components (Table~\ref{tab:registry}). Further model records own
the published-oscillator and anharmonic-transfer comparisons and the matter,
common-field and static-product witnesses; they are cited where those
results appear.
\begin{table}[htbp]
\centering
\footnotesize
\caption{Executed components and the repository's claim records that state
their scope.}
\label{tab:registry}
\begin{tabular}{@{}L{0.42\linewidth}L{0.14\linewidth}L{0.38\linewidth}@{}}
\toprule
\textbf{Component} & \textbf{Sections} & \textbf{Claim record}\\
\midrule
Two-event native observer, classification of record laws, quantum mixing of
the repair channels, recovery from complete records, phase protocol and its
source-executed implementation &
\ref{sec:record-laws}, \ref{sec:observer-algebra}, \ref{sec:native-observer}, \ref{sec:mixing},
\ref{sec:recovery}, \ref{sec:ce-protocol}, \ref{sec:ce-source} &
\texttt{OPH-MODEL-NATIVE-OBSERVER-EXECUTION}\\
Correctable record capacity and compact controller &
\ref{sec:capacity} & \texttt{OPH-MODEL-OBSERVER-RECORD-CAPACITY}\\
$P$-dependent binary detector and retrospective coupling audit &
\ref{sec:p-detector}, \ref{sec:endpoint} &
\texttt{OPH-MODEL-P-RESPONSE-EXECUTION}\\
Memory certificate at observer-local ticks for the reciprocal exchange law &
\ref{sec:local-tick} & \texttt{OPH-MODEL-N4-LOCAL-TICK-CERTIFICATE}\\
Scalar detector, two-read continuation and two-site source apparatus &
\ref{sec:scalar}, \ref{sec:two-read}, \ref{sec:two-site} &
\texttt{OPH-MODEL-SCALAR-RESPONSE-EXECUTION}\\
Common interacting source, occupation and readout certificates, smooth
continuation, compiled native attachment and encoded memory, observer
readouts, history repair, geometric and field readouts &
\ref{sec:common}, \ref{sec:history-geometry} &
\texttt{OPH-MODEL-COMMON-SOURCE-EXECUTION}\\
Overlapping observers, local and active event clocks, record-law
identification, federations and matched screens, the native continuum
operator and its limits, the sequential protocol and public-record replays &
\ref{sec:continuum}--\ref{sec:product-field}, \ref{sec:native-process},
\ref{sec:sequential}, \ref{sec:public-records} &
\texttt{OPH-MODEL-NATIVE-PROCESS-RECOVERY}\\
\bottomrule
\end{tabular}
\end{table}
\section{The specification}
\label{sec:spec}
The specification is layer two of the tower. The carrier, the repair law and
its record laws, the observer algebra, the services and the time parameters
below are fixed before any test, and every later result runs on them.
\subsection{The carrier and its load configurations}
\label{sec:carrier}
\begin{figure}[!htb]
\centering
\input{tex_fragments/figures/FIG_CARRIER_SEAM_RULE.tex}
\caption{The twelve-port carrier and its native repair. Left: the icosahedral incidence of the twelve ports, with thirty seams and twenty faces, in an orthographic view with back edges dashed; the filled ports carry a binary load of total two, and the drawn seam $(a,b)$ has $d=1$. Right: the seam rule for every mismatch the total-two carrier admits.}
\label{fig:carrier}
\end{figure}
The specification has one carrier with twelve primitive ports. Its incidence
is the oriented boundary of an icosahedron, with thirty seams and twenty
faces; five seams meet at every port, the neighbours of each port form a
five-cycle, and every seam lies on two oppositely oriented faces
\cite{ophmicro,flagship}. Write $A$ for the adjacency matrix of the seam
graph and $L=5I-A$ for its Laplacian. The spectrum of $L$ is $0$,
$5-\sqrt5$ with multiplicity three, $6$ with multiplicity five and
$5+\sqrt5$ with multiplicity three, so its characteristic polynomial is
$x(x-6)^5(x^2-10x+20)^3$ \cite{oQM,rQM,csSLOW}.
A load configuration assigns a nonnegative integer $x_p$ to each port $p$,
with total load $\sum_p x_p=2$. There are 78 configurations. The 66 with two
distinct occupied ports form the binary shell; the other twelve are
collisions $\ket{2u}$ with load two at one port $u$. We write $\Hil_{78}=\C^{78}$
for the quantum load space with basis $\ket{x}$, $\Hil_{66}$ for the span of
the binary shell, and $M_{78}$, $M_{66}$ for the corresponding full matrix
algebras. For a binary configuration occupied at ports $u$ and $w$ we also write $\ket{uw}$ or $\ket{\{u,w\}}$.
Ports are numbered $0$ to $11$ by the frame vectors $u_p$: $(-1,\varphi,0)$, $(1,\varphi,0)$, $(-1,-\varphi,0)$, $(1,-\varphi,0)$, $(0,-1,\varphi)$, $(0,1,\varphi)$, $(0,-1,-\varphi)$, $(0,1,-\varphi)$, $(\varphi,0,-1)$, $(\varphi,0,1)$, $(-\varphi,0,-1)$, $(-\varphi,0,1)$, with $\varphi=(1+\sqrt5)/2$. The thirty seams are the pairs with $\lvert u_a-u_b\rvert^2=4$, each written $(a,b)$ with $a<b$, and that order is the orientation used by the repair law below \cite{csSLOW,csCAUS}.
Premise A1 of the theorem library is the layer of carriers, their federation
through typed seams and coherent triple overlaps, the oriented spherical
support and the complete reversible port response \cite{axref}. The
construction realizes one carrier of that layer: its ports, seams and faces,
its load configurations and the repair events on its seams. Coherent quantum
operations run through a six-level processor whose twelve source generators,
one per port, exponentiate to every executed gate on two- and
four-dimensional proper codes through declared load and export services
\cite{csDERIV,ssREADME}. Spherical-screen executions join many carriers under
explicit access and refinement contracts \cite{nativeContinuum}; they
identify no physical current for the complete response algebra and do not
discharge the full A1 attachment.
\subsection{Native repair and its quantum record laws}
\label{sec:repair}
Fix an oriented seam $e=(a,b)$ and a fair placement coin $c\in\{0,1\}$. The
native repair law is
\begin{equation}
\label{eq:native}
d=x_a-x_b,\qquad
j=\tfrac12\bigl[d-(2c-1)(\lvert d\rvert \bmod 2)\bigr],\qquad
y=x+j\,(\mathbf e_b-\mathbf e_a),
\end{equation}
where $\mathbf e_p$ is the unit load vector of port $p$ and $y$ is the
repaired configuration. The two endpoint loads become the floor and the
ceiling of their mean; the coin assigns the ceiling to $a$ when $c=1$; all
other loads are unchanged.
\begin{proposition}[The classical seam rule]
\label{prop:classical-rule}
Let a stochastic rule on one seam (i) conserve $x_a+x_b$, (ii) end at a
configuration minimizing $x_a^2+x_b^2$, (iii) break any remaining tie by a
random choice independent of the loads, and (iv) be invariant under exchange
of the two endpoints. Then it is \eqref{eq:native} with a fair coin.
\end{proposition}
\begin{proof}
By (i) and (ii) the outputs are the floor and the ceiling of the mean. An odd
total leaves two outputs, and by (iii) endpoint $a$ receives the ceiling with
a constant probability $q$. Exchange of the endpoints maps $q$ to $1-q$, so
(iv) gives $q=\tfrac12$.
\end{proof}
Without (iii), the rule that leaves the extra unit with the endpoint holding
more satisfies the other three requirements. It fixes every binary
configuration, so the binary shell carries no motion and the records carry
no geometry. Requirement (iii) is an independent restriction on the
admitted tie-breaker: it excludes retaining a preference for the endpoint
holding more at the input. Internal realization alone does not impose that restriction.
The record is $r=(c,j)$, the coin and the signed
current. Compatibility on a seam is specified independently of the update;
it requires the two endpoint loads to differ by at most one. On the quantum load space the
record defines the current instrument $\Cn$ with Kraus operators and
record-discarded channel
\begin{equation}
\label{eq:kraus}
L^{e}_{(c,j)}=\frac{1}{\sqrt2}\sum_{x:\,j(x,c)=j}\ket{y(x,c)}\bra{x},
\qquad
\Cn_e(\rho)=\sum_{r}L^{e}_{r}\,\rho\,L^{e\dagger}_{r}.
\end{equation}
Both maps are written in Kraus form \cite{kraus1983}. The contrast-record
variant $\En$ keeps $r=(c,d)$ instead, with Kraus operators $M^{e}_{(c,d)}=2^{-1/2}\sum_{x:\,x_a-x_b=d}\ket{y(x,c)}\bra{x}$ and
record-discarded channel $\En_e$. Uniform independent seam attempts form the
baseline schedule; on diagonal binary states the repair is then the lazy symmetric exclusion process with two particles, with generator $\frac1{60}\sum_e(S_e-I)$ per attempt, $S_e$ exchanging the endpoint loads \cite{mCANDIDATES,oQM}.
\begin{proposition}[Native repair instrument]
\label{prop:native}
Let $e=(a,b)$ be an oriented seam of the twelve-port carrier, let the
placement coin be fair, and let $\Cn_e$ and $\En_e$ act on $\Hil_{78}$. Then:
\begin{enumerate}[(i)]
\item For every record value the branch map $x\mapsto y(x,c)$ is an injective
translation of its support. Consequently $\sum_rL^{e\dagger}_rL^e_r=I$, and
$\Cn_e$ is completely positive and trace preserving (CPTP), also when
tensored with an untouched reference system. The same holds for $\En_e$.
\item Every branch conserves the total load, leaves spectator ports
unchanged, never increases $\sum_px_p^2$, and maps the binary shell into
itself.
\item The current labels satisfy $c\in\{0,1\}$ and $j\in\{-1,0,1\}$; all six
labels occur on $\Hil_{78}$ and four occur on the binary shell.
\item $\Cn$ and $\En$ induce the same classical transition on every
configuration, and
\[
\En_e^2=\En_e,\qquad \En_e\Cn_e=\Cn_e\En_e=\En_e,\qquad
\Cn_e^n=\En_e+2^{1-n}(\Cn_e-\En_e)\quad(n\ge1).
\]
On the binary shell $\En_e$ is a trace-preserving conditional expectation.
\item With the seam-total parity $p=(x_a+x_b)\bmod 2$ one has
$d=2j+(2c-1)p$, and $\En$ equals $\Cn$ followed by a binary record of $p$
and this relabelling, as an identity of complete unnormalized branches.
\end{enumerate}
\end{proposition}
\begin{proof}[Proof sketch]
The inverse of a fixed-current branch adds $j$ at $a$ and subtracts it at
$b$; every basis vector has one branch for each coin, so each column of the
joint record/source isometry has two entries $2^{-1/2}$ with disjoint
supports \cite{oDERIV}. For fixed contrast, the unchanged spectators and the
endpoint sum reconstruct the input, which gives (i) for $\En$. Items (ii) and
(iv) are the single-seam relations of the candidate register
\cite{mCANDIDATES}. Item (v) follows from $j=\lceil d/2\rceil$ for $c=0$ and
$j=\lfloor d/2\rfloor$ for $c=1$; the parity-refined Kraus operator
$\Pi_pL_{(c,j)}$ has exactly the contrast group as support
\cite{sdDERIV}. The executable checks all 312 outputs of the observer's two
seams against an independent floor and ceiling rule \cite{oDERIV}.
\end{proof}
The current instrument is no classical coarse-graining of the contrast
instrument: grouping the labels of $\En$ sums density operators and cannot
restore the coherent Kraus sums of $\Cn$. Both belong to the family of quantum
record laws classified in Section~\ref{sec:record-laws}. One further law of the
candidate register, the reciprocal exchange N4 that couples the native
current to private six-level response factors, enters only the local-tick
certificate of Section~\ref{sec:local-tick} \cite{mCANDIDATES}.
\subsection{Admissible record laws}
\label{sec:record-laws}
The classical rule fixes the diagonal of a record law and leaves its
coherences free. For the seam $e=(a,b)$ write $\kappa(x)=(x_a,x_b)$ for the
seam key and $D=\mathbf e_b-\mathbf e_a$. A channel $\Phi$ on $\Hil_{78}$ is
an admissible record law for $e$ if it acts as the identity on the ten
spectator ports, reproduces the classical repair distribution on every
$\proj x$, commutes with $U_t=\exp(i\sum_pt_pN_p)$ for every $t\in\mathbb
R^{12}$, and is invariant under the carrier rotation that exchanges $a$ and
$b$ with the current reversed. The third condition makes every local load
phase a symmetry of the unread channel. It is a premise of the
classification, a local charge-superselection rule for the repair channel,
and it is what excludes a recorder of a pre-repair endpoint load. It guarantees that a
definite-current Kraus representation exists; it does not force every
recorded implementation of the channel to commit a definite current, since
a change of record basis before commitment mixes the current labels and
leaves the channel unchanged \cite{mINSTRUMENT}. The classification below
concerns unread channels, and statements about current histories use the
compatible definite-current instrument.
\begin{theorem}[Coherence tables]
\label{thm:record-laws}
A channel $\Phi$ is an admissible record law if and only if
\[
\Phi(\ket x\bra{x'})=\sum_j G_j\bigl(\kappa(x),\kappa(x')\bigr)\,
\ket{x+jD}\bra{x'+jD}
\]
for endpoint-symmetric positive semidefinite matrices $G_j$ on the seam keys
that can carry the current $j$, with $G_j(\kappa,\kappa)=\Pr(j\mid\kappa)$.
On $\Hil_{78}$ the free entries are five multipliers: $k$ between the empty
and the full seam, $g$ between the empty seam and a waiting single load, $h$
between the full seam and a waiting single load, a real $m$ between the two
waiting orientations, and $n$ between a moving single load and a moving
collision. Positivity gives $\lvert g\rvert,\lvert h\rvert,\lvert
n\rvert\le2^{-1/2}$ and $\lvert m\rvert\le\frac12$, and $k=1$ forces
$g=h$. Repairing one seam with $(k,g,h,m,n)$ and then with
$(k',g',h',m',n')$ gives $(kk',gg',hh',mm',n\bar h')$. Exactly two admissible
laws are idempotent, those with $g=h=m=n=0$ and $k\in\{0,1\}$, and every law
with $k=1$ converges under repetition to the idempotent law with $k=1$.
\end{theorem}
\begin{proof}[Proof sketch]
Covariance places $\Phi(\ket x\bra{x'})$ in the span of units $\ket
y\bra{y'}$ with $y-y'=x-x'$. Complete positivity confines nonzero Choi
entries to pairs with nonzero diagonal, which the classical law makes
$(x,x+jD)$, so both sides carry the same current and the Choi matrix is the
direct sum of the $G_j$. Trace preservation and the classical law fix the
diagonals, and spectator invariance makes each $G_j$ a function of the seam
keys. Under repetition every coherence keeps its seam key, so each multiplier
applies again; idempotence requires $k,g,h,m\in\{0,1\}$ and $n=n\bar h$, and
the bounds leave $g=h=m=n=0$. Exact arithmetic in $\mathbb Q(\sqrt2)(i)$
checks the composition law on every pair of seam keys for 64 ordered pairs
of tables and on all 6,084 matrix units for two pairs \cite{mRECORDLAWS}.
\end{proof}
\begin{figure}[!htb]
\centering
\input{tex_fragments/figures/FIG_RECORD_LAW_LADDER.tex}
\caption{The record-law ladder of Theorem~\ref{thm:record-laws} and Table~\ref{tab:record-laws}, and the one-event interference readout $\tfrac38+\tfrac12\operatorname{Re}g$ at phase zero that separates its members.}
\label{fig:record-law-ladder}
\end{figure}
Four members form a ladder (Table~\ref{tab:record-laws} and
Figure~\ref{fig:record-law-ladder}): $\Cn$ is $\Czero$ followed by a diagonal
readout of the coin, $\En$ is $\Cn$ followed by a readout of the seam parity
as in Proposition~\ref{prop:native}(v), and $\Tn$ is $\Cn$ followed by a
readout of the seam total. The completion of $\Cn$ in
Proposition~\ref{prop:native}(iv) is the case $g=h=n=\frac12$, $m=0$, and
$\En$ is the idempotent law with $k=1$. A recorder of an endpoint's pre-repair
load keeps the classical law and fails covariance, because one of its
branches carries two currents. $\Czero$ records only what conservation
requires, $\Cn$ records the tie-break as an event, $\En$ is the coarsest law
for which one repair completes the seam, and $\Tn$ records the full seam
occupation; none of these principles follows from the theorem premises. The
construction executes $\Cn$ as its convention and compares it with $\En$.
Under a common definite-current record interface all members assign the same
probabilities to every classical current observation;
Section~\ref{sec:prediction} reads $g$ in one coherent event, and
Section~\ref{sec:identification} identifies all nine real coordinates. Every admissible table, including complex phases and different
laws on different seams, has the uniform binary density as its unique
stationary source state and the same spectral gap $(5-\sqrt5)/60$, so
equilibrium selects none of the coordinates; a finite unread warm-up of
$221$ attempts on the binary shell, or $318$ on the full carrier, brings an
arbitrary initial density within $1/1000$ of that state, uniformly over
untouched references \cite{mRECORDLAWS}.
\begin{table}[htbp]
\centering
\small
\caption{Four distinguished admissible record laws \cite{mRECORDLAWS}.}
\label{tab:record-laws}
\begin{tabular}{@{}lL{0.36\linewidth}cccc@{}}
\toprule
Law & Each event records & Values per seam & $k$ & $g=h$ & Idempotent\\
\midrule
$\Czero$ & the current & 3 & 1 & $2^{-1/2}$ & no\\
$\Cn$ & coin and current & 6 & 1 & $1/2$ & no\\
$\En$ & coin and pre-repair contrast & 10 & 1 & 0 & yes\\
$\Tn$ & coin and both endpoint loads & 12 & 0 & 0 & yes\\
\bottomrule
\end{tabular}
\end{table}
\subsection{The finite observer algebra}
\label{sec:observer-algebra}
An observer of length $n$ on the carrier consists of a preparation on $\Hil_{78}$, a record tape $R^{\otimes n}$, seam policies $s_k$ that map committed records and classical randomness to seams or to supplied detector outcomes, the coherent writes $W_{s_k}$, optional supplied instruments whose committed bits may enter $s_k$, and a halting rule after $n$ writes; a policy reads only committed records. Definition~\ref{def:observer} is the instance $n=2$, and Sections~\ref{sec:p-detector}, \ref{sec:fields} and \ref{sec:common} add declared instruments to it.
\begin{definition}[Two-event native observer]
\label{def:observer}
Let $R=\C^6$ carry one basis vector per current label $(c,j)$. The observer
carrier is
\[
\Hil_{\rm cap}=\Hil_{78}\oplus(R\otimes\Hil_{78})\oplus(R\otimes R\otimes\Hil_{78}),
\]
with sectors of dimensions 78, 468 and 2808, total 3354; the sector index is
the phase, the number of filled record slots.
\begin{enumerate}[(a)]
\item \emph{Preparation.} The scored preparation is uniform on the 66 binary
configurations; the full input family uses all 78.
\item \emph{Measurement and record.} At phase zero the coherent write
$W_{e}=\sum_r\ket{r}\otimes L^{e}_r$ acts on the seam $e=(0,1)$.
\item \emph{Record-only feedback.} At phase one the seam is $s(r)=(0,5)$ if
the stored current is positive and $(0,1)$ otherwise, and
$V_1(\ket r\otimes\psi)=\ket r\otimes W_{s(r)}\psi$.
\item \emph{Forecast.} Before the second event the controller reads its
stored letter and issues a supplied forecast $q(r)$ of a positive second
current.
\item \emph{Halting.} At phase two the observer acts as the identity.
\end{enumerate}
The controller reads only the committed first record; it has no access to
source loads or future outcomes.
\end{definition}
\begin{proposition}[One CPTP map with classical-prefix preservation]
\label{prop:cptp}
Let $V_0=W_{(0,1)}$ and $V_1$ be extended by zero to the other sectors, giving
$A_0$ and $A_1$, and let $P_2$ project onto the full sector. Then:
\begin{enumerate}[(i)]
\item $V_0$ and $V_1$ are isometries on every nonfull sector, including
unreachable combinations of letters and loads, and
$T(\rho)=A_0\rho A_0^\dagger+A_1\rho A_1^\dagger+P_2\rho P_2$ is CPTP;
\item on the inhabited subspace $K=\Hil_1\oplus\Hil_2$ every first-record
projector $Q_r$ obeys $T^*(Q_r)=Q_r$, so a committed first record is reread
with probability one;
\item for the blank input with occupations $(1,1,0,\dots,0)$, the
first-record projector of the letter $(0,0)$, extended by zero to phase zero,
has expectation $0$ before the tick and $1/2$ after it, so writing a record is
a transition distinct from preserving it;
\item for the equal superposition of $\{0,2\}$ and $\{1,2\}$, the
reduced-density entry of the first-record pair $((0,1),(0,0))$ equals $1/4$
after the first write and $1/8$ after the second while the classical
diagonals are unchanged, so coherence between different record values need
not survive feedback.
\end{enumerate}
\end{proposition}
\begin{proof}[Proof sketch]
Orthogonal retained labels and $W_s^\dagger W_s=I$ give
$V_0^\dagger V_0=V_1^\dagger V_1=I$, hence $A_0^\dagger A_0+A_1^\dagger
A_1+P_2=I$. Every subsequent map intertwines $Q_r$ on $K$. In (iv) the
working state attached to the entry has occupations $\{1,2\}$, on which the
isometries of $(0,5)$ and $(0,1)$ overlap by $1/2$ \cite{oDERIV}. The
checkpoint adapter verifies all $78+468+2808$ columns and both the
preservation identity on the 3276-dimensional checkpoint space and the
blank-sector control \cite{csDERIV,rCS}.
\end{proof}
\begin{lemma}[Feedback requires classical record preservation]
\label{lem:multiplicative}
Let $\Lambda$ be a CPTP map from $R\otimes W$ to $R\otimes W'$ with
$\Lambda^*(B\otimes I)=B\otimes I$ for every $B$ in the full matrix algebra
of $R$. Then $\Lambda^*(I\otimes O)=I\otimes\Phi^*(O)$ for a unital
completely positive map $\Phi^*$, so changing only the record preparation of
a product input changes no output statistic on $W'$.
\end{lemma}
\begin{proof}[Proof sketch]
The operators $B\otimes I$ lie in the multiplicative domain of the unital
completely positive map $\Lambda^*$, because the Schwarz inequality is an
equality for them \cite{choi1974}. Then $\Lambda^*(I\otimes O)$ commutes with
every $B\otimes I$ and has the stated form \cite{oDERIV}.
\end{proof}
Lemma~\ref{lem:multiplicative} fixes the shape of the observer contract. A
record that steers the working state is preserved as a classical record,
with its projectors fixed, while coherence between different record values
may change.
\subsection{Declared services}
\label{sec:services}
Each component names the services it assumes; they belong to the
specification and enter the resource counts where a component counts
resources. The services are coherent proper-code load and export, with
complementary failure outcomes retained by a complete channel definition;
blank initialization, reset, storage and routing of quantum registers and
classical records; Born readout of pointers and fair coins; and analogue
precision of source pulses. Particular components add a calibrated external
flux and probe (Section~\ref{sec:p-detector}), incident-event recognition
and bare-occupation readout (Section~\ref{sec:local-tick}), coherent
phase preparation and readout (Section~\ref{sec:prediction}), and, for the
native process results, independent uniform seam scheduling, uniform
fixed-number preparation, full initial and current readback, coherent wave
processing, the return-length sampler and the response controller
(Sections~\ref{sec:native-history}, \ref{sec:native-process} and
\ref{sec:prediction}). The coherent
services are not products of the native grammar: committed C/E repair with
diagonal accessible inputs and fresh independent diagonal ancillas cannot
prepare the declared coherent reference to arbitrary accuracy, even with
adaptive heralding. This coherence floor of the native interface makes the
coherent services a necessary resource of the specification. The sharp joint
instrument of Section~\ref{sec:common-construction} uses native integer
repair as a declared primitive, and Section~\ref{sec:continued-native}
attaches the compiled 78-dimensional C/E channels, routing and encoded
recovery to the continuing work history. The processor algebra is $M_6$; its twelve generators are the exact source generators of the compiler, one per port \cite{ssREADME,csDERIV}; a proper code is a two- or four-dimensional subspace of $\C^6$ with its load and export channels and the complementary failure outcome; and the service error model is the compositional contract of Section~\ref{sec:ce-source}. Exact certificates exclude numerical execution error
and physical service error unless a component states otherwise.
\subsection{The closure inputs \texorpdfstring{$P$}{P} and \texorpdfstring{$N$}{N}}
\label{sec:closure-inputs}
The pixel ratio $P$ is the area of one screen cell in units of
$\ell_\star^2$, and $N$ is a record capacity in nats
\cite{ophobservers,pACCESS}. The construction accepts both as closure-derived
inputs and fits neither to an output. $P$ enters through a declared coupling map, the source-only structured-running branch of the fine-structure closure (one-loop running and matching conventions with the tree-level $m_Z$ closure), defined in the P-derivation code of the repository \cite{ophrepo} and consumed unchanged; the map is a declared selection, not a result of this construction. At the pinned closure value $P=1.630972095858897\ldots$, the midpoint of the pinned forward-closure interval, the map gives $\alpha^{-1}(P)\approx136.9948351774$ and $g(P)=\sqrt{4\pi\alpha(P)}\approx0.302867613117$ in Heaviside--Lorentz natural units, numerical evaluations of the executed map \cite{pREADME,rP}. $N$ enters only as a bound, and no component consumes its closure value. For a declared capacity carrier of dimension $D$, the record capacity $N_{\rm record}=\ln D$ bounds every correctable classical record code by $\ln M_0\le N_{\rm record}$ \cite{mCONSTRUCTION,oCAP}. The
cosmological relation $N=3\pi/(\Lambda\ell_\star^2)$ additionally requires a
physical identification of capacity with horizon area, which the
construction does not make.
\subsection{Time parameters}
\label{sec:time}
The construction keeps the time parameters of Table~\ref{tab:time} distinct
\cite{mINTERP}. Conversions between them need explicit maps. The
construction uses three: the fixed-reference relation $t=-\beta s$ of
Section~\ref{sec:readouts} between a model coordinate and a modular
parameter, the instrument-valued conversion between two local event clocks
of Section~\ref{sec:event-clocks}, which keeps their whole count law, and
the rescaling of native attempt count along the refining screens of
Section~\ref{sec:native-history}. A calibration of native calls against a
monotonic host counter is an engineered software correspondence. No
preferred universal physical clock is required.
\begin{table}[htbp]
\centering
\small
\caption{Time parameters and where they occur.}
\label{tab:time}
\begin{tabular}{@{}L{0.20\linewidth}L{0.38\linewidth}L{0.36\linewidth}@{}}
\toprule
\textbf{Parameter} & \textbf{Meaning} & \textbf{Occurrence}\\
\midrule
Host time & Runtime of a software execution; a resource cost & A software calibration of native calls; never a physical quantity\\
Solver counter & Position in a search or repair schedule; the attempt count of a declared schedule & History repair (Section~\ref{sec:history-repair}); attempt counts in the observer theorems\\
Causal order & Precedence of recorded events; counts of native operations & Observers, detectors, phase protocol, local ticks\\
Local event count & Attempted repairs incident to an observer region, or occupation changes at a port & Overlapping observers, local and active event clocks, matched screens (Section~\ref{sec:native-process})\\
Scaled attempt count & Native attempt count $n$ at level $l$ rescaled to $\tau=n/(1260\cdot16^l)$ on the refining screens & Native density limits and the controlled repair response (Sections~\ref{sec:density}, \ref{sec:prediction})\\
Coherent wave parameter & Parameter of the admitted coherent continuation $\cos(t\sqrt A)$ & Native waves and the return reference (Sections~\ref{sec:continuum}, \ref{sec:product-interacting})\\
Model coordinate & Parameter of a declared Hamiltonian or action & Scalar detectors, two-site apparatus, common source\\
Modular parameter & Parameter of the modular automorphisms of an algebra-state pair & Modular clock and fixed-reference relation (Section~\ref{sec:readouts})\\
Operational clock & Observer-accessible reading with calibrated duration & Supplied by no component\\
\bottomrule
\end{tabular}
\end{table}
\section{The finite observer}
\label{sec:observer}
This section is layer three on one carrier: an observer that prepares,
records, retains and acts on native records, with its capacity, memory and
recovery limits.
\subsection{The native observer}
\label{sec:native-observer}
The native observer executes Definition~\ref{def:observer} on the scored
preparation \cite{oREADME,oDERIV}. A trial is one fresh preparation followed
by two repair events and a halt; running many trials repeats the preparation
and does not extend one observer's memory. Event order is the time
parameter. The tape, prior, forecast table, seam selector and halting rule
are designed apparatus, and the forecast is a fixed table without learning.
\begin{proposition}[Statistics of the native observer]
\label{prop:native-observer}
Prepare the 66 binary configurations uniformly, use fair coins and the
controller of Definition~\ref{def:observer}, and let $Y$ indicate a positive
second current. Then:
\begin{enumerate}[(i)]
\item the 264 histories, two coins for each of the 66 configurations at each
of the two events, each have weight $1/264$;
\item the first record has masses $14/33$, $14/33$, $5/66$, $5/66$ for
$(c,j)=(0,0),(1,0),(0,1),(1,-1)$, the conditional probabilities
$q(r)=\Pr(Y=1\mid r)$ are $0$, $5/56$, $0$, $1/2$ in the same order, and
$\Pr(Y=1)=5/66$;
\item the Brier risk of forecasting $Y$ is $395/7392$ with $q(r)$,
$140/2013$ with the best forecast based on the chosen seam alone, and
$12875/150304$ when $q$ is evaluated on an independent record resampled
within the same seam;
\item the mean final load at port $0$ is $35/264$ under record feedback and
$1/6$ when the selector is disconnected or replaced by an independent
selector with the same seam frequencies; the feedback effect is $-3/88$.
\end{enumerate}
\end{proposition}
\begin{proof}[Proof sketch]
For (iii), $\Ex[(Y-q(R))^2]=\Ex[\operatorname{Var}(Y\mid R)]$. The chosen
seam $S$ is a function of $R$; the best $S$-only forecast has excess risk
$\Ex[\operatorname{Var}(q(R)\mid S)]$, and an independent resample within the
seam adds twice that amount. For (iv), a positive first current occurs on ten
binary inputs with coin zero, mass $5/66$. On that branch $x_0=0$, $x_1=1$
and $\Ex[x_5]=1/10$; a second repair on $(0,1)$ gives port-0 mean $1/2$ and
one on $(0,5)$ gives $1/20$. Hence the change is
$(5/66)(1/20-1/2)=-3/88$ and the mean is $1/6-3/88=35/264$. An independent
selector leaves the uniform shell uniform under either seam
\cite{oDERIV}.
\end{proof}
The other two current letters occur only on the full carrier, where the
forecast abstains. The exact receipt retains all 264 histories
\cite{rNATIVE}, and a seeded execution of 20,000 fresh trials matches every
trial against its exact path reference, with sample final port-0 loads
$0.1327$ with feedback, $0.16645$ disconnected and $0.1668$ with the
independent selector \cite{rRUN}. Since the selector is a design choice and
the forecast table is the exact conditional law, (iii) and (iv) are
consistency checks: the Bayes forecast beats coarser forecasts and the
record-wired selector moves the occupation.
\subsection{Continuing memory and the actual stationary reference}
\label{sec:finite-campaign}
The finite campaign~\cite{ophrepo} extends the
two-event observer with an explicitly declared memory law. It keeps the
same source and complete C/E instruments. A classical tag chooses C with
probability $\lambda$ and E otherwise; a repair occurs with probability $r$,
with an identity hold otherwise. A controller chooses a preferred seam from
its retained records. The actual seam distribution is
\[
p(e\mid m)=\frac{\epsilon}{30}+(1-\epsilon)\pi(e\mid m),
\qquad r,\epsilon\ge\frac1{16},\quad 0\le\lambda\le1.
\]
The rational parameter bound and permitted controller tables are part of the
campaign, not measured physical constants. The executed controller proposes
$(0,5)$ after a positive current and $(0,1)$ otherwise. It does not read the
hidden source load. A proposal intervention preserves the uniform exploration
floor. Holds are recorded with current zero.
For each classical memory input, every source branch is
$K_b=\sqrt{w_b}M_b$, with $M_b$ a native partial injection or identity and
$\sum_b K_b^*K_b=I_{78}$ exactly. Tensoring with the identity preserves an
arbitrary untouched reference. The tests independently reconstruct the branch
supports by endpoint floor/ceiling arithmetic, including their off-diagonal
action. Composition therefore defines every finite history with its
unnormalized quantum output and actual probability. Exact prefix replay
and retained six-attempt source/reference/last-record marginals verify C, E
and the delayed tagged mixture; the complete history tree remains implicit
in that channel kernel.
One to eight complete records occupy the declared buffer. Under the executed
one-slot export policy, $n$ attempts leave one record and export $n-1$ records
for $n\ge1$; expected repair and hold counts are $nr$ and $n(1-r)$.
Concatenating exports and the remaining buffer reconstructs the history.
The halt-on-full control instead preserves its source and records with an
explicit timeout outcome. These are different resource contracts. Bounded
working memory with growing exports is not closed finite-resource operation
for unlimited duration. No new native source-word implementation of the
supplied initialization, selection, write, export or delivery services is
claimed.
The stationary reference must include this controller. For $r=1$ and
$\epsilon=1/2$, a uniform binary source with blank memory becomes nonuniform
after two attempts: $30$ source probabilities change, with maximum deviation
$1/960$ from $1/66$. Exact rational solution of the actual source/current-sign
kernel instead gives one stationary law on a $129$-state recurrent subset of
the $132$ source/bit states. Applying the complete C/E observer instrument to
that law constructs the full-record reference. Its projection recovers the
bit law, and one further actual observer step preserves the entire full-record
density exactly. The resulting $128$ C or $192$ E record blocks have $4{,}218$
positive diagonal entries overall. Positivity establishes faithfulness only
on the explicitly compressed support of each block. The growing exported
tape is not a stationary object, and the delayed member's hold updates require
a separate stationary solve.
This reference also makes a clock obstruction precise. In an actual
nontracial block choose positive weights with ratio $q=p_i/p_j>1$ and the
dimensionless modular parameter $s_* = \pi/(2\log q)$. The state-dual modular
action takes the real pair probe $(|i\rangle+|j\rangle)/\sqrt2$ to a density
with off-diagonal entry $-i/2$. Every admitted history, with the declared real
joint ancillas and classical memory, preserves real density matrices.
A norm-one imaginary pair observable separates the target from every such
normalized output, giving trace-distance error at least $1/2$. This witness
is not a native detector, and the probe is an all-input map test, not an
asserted native preparation. On the accessible commutative record algebra
the modular action is trivial. Other algebras, encodings or coherent services
have different contracts; no general physical-clock exclusion follows.
The exact reference, implementation bound and full qualifications are
retained with the executable model~\cite{ophrepo}.
\subsection{Record capacity}
\label{sec:capacity}
The retained records are evaluated with the correctable-public-record
construction of the theorem library \cite{ophobservers,oCAP}. There $M_0$ is
the largest correctable set of reachable public records, the independence
number of the compound checkpoint confusability graph; the record capacity is
$N_{\rm record}=\ln M_0$ nats; and $M_0\le D$ for a declared carrier of
dimension $D$. The counts below describe the reachable record interface;
program, source, probe and service memory are additional.
\begin{proposition}[Record capacity of the native observer]
\label{prop:capacity}
Take halt and exact classical reread as the declared terminal continuations
of the observer of Definition~\ref{def:observer}. Then the compound graph
has no edges, and:
\begin{enumerate}[(i)]
\item $M_0=11$ on the binary preparation (four reachable first records, 264
histories) and $M_0=17$ on the full family of 78 inputs (six first records,
312 histories);
\item each terminal word projector has rank 78 in the 3354-dimensional
carrier, distinct projectors are orthogonal, and the eleven reachable ones
have total rank 858, so the bound is unsaturated with slack $\ln(3354/11)$;
\item the binary preparation reaches $1+4+11=16$ classical prefixes, so four
bits encode the complete controller history; a compact controller that reads
only this code reproduces the phase, action, forecast, source loads, record
and halt of all 264 histories; the full family reaches 24 prefixes and needs
five bits;
\item coarser retained readouts give correctable codes of size 4 for the
first letter alone, 4 for the second letter alone, 3 for the forecast alone,
2 for the chosen seam alone, 4 for forecast and seam, and 1 after complete
erasure.
\end{enumerate}
\end{proposition}
\begin{proof}[Proof sketch]
Halt and reread leave the tape unchanged, so the joint kernel is the
identity and the existing evaluator returns the number of reachable terminal
words. The terminal projector of word $w$ occupies the basis coordinates
$546+78w$ to $546+78w+77$ of the carrier \cite{oCAP,rCAP}.
\end{proof}
The terminal capacity is $\ln 11$ nats, about 3.459 bits, on the binary
preparation and $\ln 17$ nats on the full family; the Shannon entropy of the
benchmark record law, about 2.023 nats, is a different quantity. The
library's global proposal adds closure across the complete terminal fiber,
$N_\star=\ln M_0(U_{N_\star})$, and a de Sitter horizon identification giving
$\Lambda\ell_\star^2=3\pi/N_\star$ \cite{ophobservers,oCAP}; the native records
supply an actual finite input to that evaluator, and the two further steps
are not taken here.
\subsection{The \texorpdfstring{$P$}{P}-dependent detector}
\label{sec:p-detector}
The detector carries the closure input $P$ through the electromagnetic
coupling into a recorded binary observation that controls the next repair
\cite{pREADME,pDERIV}. The charge assignment, probe, calibrated flux, readout
and controller are specified apparatus (Section~\ref{sec:endpoint}).
Choose the charged realization $Q_v=g(P)N_v$ of the native occupation $N_v$.
A current record $j$ on the seam $(a,b)$ then transfers the charge
$\Delta Q=g(P)\,j\,(\mathbf e_b-\mathbf e_a)$, and total charge is conserved.
For port gauge parameters $\lambda_v$ and
$U_\lambda\ket{x}=e^{ig\sum_v\lambda_vx_v}\ket{x}$, every current-grouped
Kraus operator obeys
$U_\lambda L_{(c,j)}U_\lambda^\dagger=e^{igj(\lambda_b-\lambda_a)}L_{(c,j)}$.
The probe is a unit-charge path qubit prepared in $\ket{+X}$. The first
native current routes it around a calibrated external loop with signed
exposure $j\chi$, where $\chi=\oint A\cdot dx$ is prepared independently of
$g$, so the relative phase is $\varphi_j=g(P)\,j\,\chi$, the Aharonov-Bohm
phase \cite{aharonov1959}. A $Y$ measurement commits $y=\pm1$ with amplitudes
$m_y(j)=\frac12[e^{-i\varphi_j/2}-iy\,e^{i\varphi_j/2}]$ and effects
$E_y=\sum_r\frac12[1+y\sin\varphi_{j(r)}]\proj{r}$ on the old current
register. The actuator receives only $y$. It repairs $(0,5)$ for $y=+1$ and
$(0,1)$ for $y=-1$, keeps $y$ unchanged, and the protocol halts.
\begin{proposition}[$P$-dependent response]
\label{prop:p-response}
Prepare the 66 binary configurations uniformly, run the protocol above, and
put $s=\sin(g(P)\chi)$. Then:
\begin{enumerate}[(i)]
\item $\{E_y\}$ is a binary instrument on every input, including coherent
records; each $M_y=\sum_rm_y(j(r))\proj r$ commutes with the old record
projectors, and the composed experiment is one CPTP map that preserves the
committed bit;
\item $\Pr(y\mid j_1,P,\chi)=\frac12[1+y\sin(g(P)j_1\chi)]$;
\item at $\chi=1$ all 528 state, coin, detector and coin histories have
positive probability, and
\[
\Ex[y]=0,\quad \Ex[yj_1]=\tfrac{5}{33}s,\quad
\Ex[j_2]=\tfrac{5}{264}s,\quad \Ex[g(P)j_2]=\tfrac{5g(P)}{264}s;
\]
\item for weak exposure, $\Ex[g\,j_2]=\frac{5\pi}{66}\alpha(P)\chi+O(\chi^3)$;
\item disconnecting the probe, or replacing $y$ by an independent fair bit,
gives $\Ex[j_2]=0$ with the same detector and seam frequencies.
\end{enumerate}
\end{proposition}
\begin{proof}[Proof sketch]
The eigenvalues of $E_y$ lie in $[0,1]$ and sum to one, which gives (i). For
(iii), after the first repair let the source be $z$; averaging the second
coin gives $\Ex[j_2\mid z,j]=\frac14(2z_0-z_1-z_5)+\frac{sj}{4}(z_1-z_5)$.
The first term averages to zero because the first repair preserves the