This preprint develops a rigorous framework for certifying open-loop backward signaling from an earlier committed record while distinguishing it from ordinary explanations such as postselection, hidden memory, conditioning, fine-tuning, and measurement dependence. For explicitly defined alternative classes, the paper derives exact finite-alphabet bounds on the observable record distributions, characterizes the corresponding feasible region through three operational cuts, and proves constructive converses showing that every point inside the region admits an ordinary-route realization. It also introduces a scaled gauge of class-relative violation, transport-based robustness bounds, and projection-closed e-processes that provide anytime-valid sequential evidence under optional stopping. Worked examples and exact rational checks illustrate how the framework can be applied in finite-data experiments. The resulting certification is deliberately class-relative: rejection of an audited ordinary-route class does not by itself identify a unique physical mechanism or establish retrocausality in an unrestricted open world. Instead, the framework specifies what must be committed, randomized, retained, audited, and statistically demonstrated before backward signaling becomes a defensible interpretation rather than an artifact of selection or hidden dependence.
This preprint develops a rigorous framework for certifying open-loop backward signaling from an earlier committed record while distinguishing it from ordinary explanations such as postselection, hidden memory, conditioning, fine-tuning, and measurement dependence. For explicitly defined alternative classes, the paper derives exact finite-alphabet bounds on the observable record distributions, characterizes the corresponding feasible region through three operational cuts, and proves constructive converses showing that every point inside the region admits an ordinary-route realization. It also introduces a scaled gauge of class-relative violation, transport-based robustness bounds, and projection-closed e-processes that provide anytime-valid sequential evidence under optional stopping. Worked examples and exact rational checks illustrate how the framework can be applied in finite-data experiments. The resulting certification is deliberately class-relative: rejection of an audited ordinary-route class does not by itself identify a unique physical mechanism or establish retrocausality in an unrestricted open world. Instead, the framework specifies what must be committed, randomized, retained, audited, and statistically demonstrated before backward signaling becomes a defensible interpretation rather than an artifact of selection or hidden dependence.
This preprint examines conditional operational limits on controllable return to an earlier event within the same physical history. A protocol retaining receiver and payload records permits an opposite-payload intervention, yielding an acceptance-weighted incompatibility bound under explicitly stated event-identification and calibration-transfer assumptions. For finite classical product loops, the analysis distinguishes normalization under every allowed controller from normalization of one selected loop. Results include an exact simultaneous repair frontier for the clean derangement family at arbitrary alphabet size, rational optimum certificates for arbitrary three-symbol kernels, and linear-program certificates for the intervention-uniform normalization repair radius. Higher-alphabet examples demonstrate that a selected loop can be normalized while both components remain input dependent. For a specified quantum Bell circuit, finite-strength record instruments yield analytical acceptance and reported-error formulas, distinguishing increased acceptance from faithful record-dependent control. A three-category compatibility test retains rejected trials and is extended to empirical calibrations through simultaneous finite-sample uncertainty bounds under declared sampling assumptions. A self-contained canonical metric–scalar application motivated by SMSR provides a conditional temporal-function certificate and identifies the additional estimate needed to connect geometric perturbations with changes in record distributions. The work does not establish a universal prohibition of time travel, demonstrate a physical return channel, or physically validate SMSR. Invariant historical event attachment and gravitational backreaction remain additional physical requirements. The deposit includes English and Hungarian manuscripts with technical supplements, source files, exact certificates, and executable reproducibility checks.
This preprint studies the identification problem for a complete finite temporal interface comprising an earlier event, a later intervention, a complete declared earlier transcript, and all remaining declared outcomes, with chronology and transcript immutability supplied by a separate physical passport. It compares the complete all-trial intervention law with a deliberately broad forward-completion class allowing arbitrary finite hidden memory, common causes, stochasticity, and command-dependent later processing, constrained only by independence of the mechanism producing the earlier transcript from the later command. The principal result is an exact, attained max-command total-variation projection onto this broad forward class. The complete-table distance reduces to the minimax total-variation radius of the command-indexed earlier marginals, and every minimizing center lifts to an optimal forward-completable table that preserves the observed later conditional distributions on positive rows. Supporting results characterize the response-kernel completion fiber through finite barycentric measures and use a spectator-extended OCB construction to illustrate the separation between no-backwards-in-time-signaling compatibility and definite causal order. The paper also delineates the independent evidence required before table-level incompatibility can support a physical backward-signaling interpretation, including verified chronology, immutable record commitment, intervention exogeneity, all-trial retention, ancillary and memory closure, ordinary-route closure, and finite-sample robustness. Status: Preprint; not peer reviewed.
Here “operational objectivity” is used only in a certificate-relative sense: satisfaction of a selected public-audit standard, not quantum Darwinism, spectrum-broadcast objectivity, or complete intersubjectivity. A declared family of complete queries determines an access-relative public class. We first state an elementary fiber-stability proposition: when a certificate’s target dependence factors through the public evaluation map and its auxiliary records do not encode which member of a public fiber was realized, a pass cannot identify the underlying physical state if that map is noninjective. We then propose a typed audit certificate C = (W,I,Cal,G,D,R,U) with six requirements: declared access, calibrated interventions, relative gauge alignment, a dependence-valid evidence pedigree, reproducibility with independently generated error oppor- tunities, and minimal epochal public revision. Construction J1 tests both the joint consistency and the inferential limit of this architecture inside standard real-amplitude quantum theory with ordinary real tensor composition. Ideal real-trine effects are nominal targets, while symmetrically relabeled noisy trines are the implemented effects and span each full local rebit effect space. Nevertheless I4 ±(3/5)J⊗J ρ±= 4 give probability 1/9 for every outcome of every implemented epoch-0 product context. A separately declared and calibrated global projective measurement outside that interface distinguishes them with total-variation distance 3/5 and equal-prior success 4/5. The witness depends on an independently trusted, hidden-direction-sensitive calibration source χH = (I4 + J⊗J)/4; calibration-source access is not target-query access, and no preparation–measurement duality or joint-SPAM self-calibration is assumed. Supporting results record exact transcript invariance for finite adaptive protocols on fresh preparations, the bound 1−(1−ε)n for an ε single-round discrepancy, and a distribution-free finite-sample upper certificate. Thus the selected O1–O6 pass can coexist with noninjectivity of the full separated-product map in J1. The claimed contribution is the fiber-stability diagnostic, typed synthesis, and joint witness, not a new operational quotient, local-tomography theorem, rebit defect, general objectivity criterion, or selection of complex quantum theory.
When does an observable readout contain all the information needed to determine its underlying source, and when does source information remain inaccessible? This paper extends Shadow Theory’s source–readout framework by distinguishing information preserved in the underlying dynamics from information accessible through a specified class of observations. It develops a conditional source tetralemma, quantitative bounds on hidden information from Bell violations, and operational criteria for distinguishing sealed information from information that can become observable. Under explicitly stated assumptions concerning definite outcomes, measurement independence, and conditional no-signalling, the paper derives lower bounds on source information missing from an initial classical readout. It also examines operationally indistinguishable surrogate models, reversible dynamics that preserve information while restricting access, and finite-resource witnesses of incomplete readouts. The results distinguish mathematical conclusions from physical assumptions and model-specific applications. They do not establish a unique underlying ontology or claim that Bell violations alone prove Shadow Theory. The accompanying Python verification script checks specified numerical bounds, finite constructions, and manuscript consistency conditions. It uses the Python standard library and includes exact rational arithmetic. Version 3.1. Author: Jeremy Rodgers, independent researcher.Project website: https://www.everythingequation.comDOI: 10.5281/zenodo.23077474
The cryptography arc of the observation-theory campaigns, eleven registered runs in exact finite toy models, arranged as three movements. What such an audit certifies, an engineered secret-sharing plateau that is a step where an interaction-borne one is not, a conditional information certificate that proves non-garbling without a threshold, unanimous scalar leakage orderings that carry no task guarantee outside certified comparability, and two entropy accountings whose difference turns over while their ratio does not. Where it stops, a constant carries zero entropy, so an audit built from informations is blind to a trapdoor by that bound while it sees a declared one-bit leak immediately, and only a procedure's declared freedom is auditable because the artifact carries no record of the search behind it. Where it does not stop, reading an ensemble that is not orthogonal costs two bits of information for each unit of induced error while an orthogonal ensemble is read perfectly and leaves no trace, and one classical record is held in full by both consumers while one shared correlation is held by one. Three of the eleven runs failed their declared bars and are reported with their design errors named alongside the corrected registrations. Every number is bound by assertion to a committed evidence record. The models are toy models chosen for exact enumeration, nothing is claimed about computational hardness or asymptotic security, no real cipher, protocol, curve, device, or deployed system is modeled or evaluated, and no attack is developed.
Problem What must a physical record preserve to reveal temporal direction, measure duration, and support a calibrated experiment? This two-volume mathematical working paper distinguishes causal order, clock readings, and forward–reverse evidence, and studies their joint realization under one history law. Principal results Relative-entropy disintegration identifies evidence lost through observation. Graph potentials characterize sufficient current sensors by the absence of affinity on unobserved cycles; paired histories extend the criterion to silent events and indistinguishable reaction channels. Anonymous records, finite memory, and stopped decisions are treated explicitly. Compensated currents control clock calibration under shared environmental dynamics. A preparation-and-work identity bounds directional records and terminal organization together. Exact elimination retains hidden memory, while inverse and energy margins control response. A moving-sector comparison bounds the complete quantum apparatus record, including interactions, leakage, and transport; a spectral gap gives an explicit operating-time estimate. Analytical constructions and counterexamples cover graph–matter selection, ring and torus persistence, localized field clocks and receivers, and source-correlated records. A kinetic parent combines a selected ring, an inertial field, and a finite reversible receiver. Preparation frontiers separate information cost from attainable initial laws of a fixed dynamics. Methods, scope, and open questions The proofs use conditioning, path potentials, martingale compensation, generating functions, and stable operator comparison. The project includes editable sources, bibliography, 47 reproducible finite verification programs, provenance, and a separate corrections report. The results concern specified model classes and conditional external inputs. Selected spatial geometry is not a derived Lorentzian spacetime; the joint ring receiver uses supplied capture materials and diffusive transport. A common microscopic derivation of Lorentzian geometry, apparatus formation, two distinct proper-time clocks, constrained gravitational response, and typical directional preparation remains open.