Jelmini Labs

LSRA v1.0 · Normative

Appendix AFormal Mathematical Specification

Every variable, operator, state transition, uncertainty model, coherence metric, regime detector, evidence object, and validation metric required to implement and test LSRA. The whitepaper is motivational. This appendix is binding. Kernel: lsra-kernel-1.0.

DefinitionKernelFile
A.1 TwinTwintypes.ts
A.3 ObservationObservationtypes.ts
A.6 Trajectory opstrajectoryFeaturesengines.ts
A.7 RK4 transitionrk4 / simulatedynamics.ts
A.9.2 CUSUMcusumengines.ts
A.10 DriftdriftSeriesengines.ts
A.11 CoherencecoherenceReportengines.ts
A.12 KuramotorunKuramotoengines.ts
A.13 BecomingbecomingSetengines.ts
A.14 EvidenceevidenceFromResultsevidence.ts
A.15 Metricsrmse, mae, aurocmath.ts
A.17 Compilerparse, qInteger, qExpcompiler.ts
A.19 QRFrunQrfSuite, Bloch, FIF, chsh, zeta, runWave2dquantum.ts
A.20 AgriculturesimulateSeason, runAgriSuiteagriculture.ts
A.21 SubsurfaceinferSubsurface, runSubsurfaceSuitesubsurface.ts
A.22 HorizonrunHorizonSuite, applyBoundary, casimirPressureboundary.ts
A.23 Excel 2030runExcelSuite, auditWorkbook, analyzeCodexexcel.ts
A.24 OrgansrunOrganSuite, OPERATING_CONTRACTorgans.ts
A.25 AcceleratorrunAccelSuite, track, whatIfaccelerator.ts
A.26 Life TwinrunLifeSuite, createTissue, stepMorphogenlife.ts
A.27 Planet TwinrunPlanetSuite, runCycle, darcyColumnplanet.ts
A.28 NAVIS / TPMrunNavisSuite, simulateNavigator, compareModelsnavis.ts

A.0

Meta, notation, time

This appendix is the implementation contract. Where Whitepaper v1.0 is motivational, Appendix A is binding. A result that cannot be typed against these definitions is not an LSRA result.

  1. A.0.1Notesrc/lib/lsra

    Normative status

    Identifiers of the form LSRA.A.x.y map onto functions in the computational kernel. Changing a definition without a version bump is a breaking change. The kernel shipped with this revision is lsra-kernel-1.0.

  2. A.0.2Definition

    Time

    Observation times are a strictly increasing finite sequence. Uniform sampling is not assumed. Where a step index is more convenient than a stamp, we write k and recover t_k from the history.

    T={t0<t1<⋯<tN}⊂R\mathbb{T}=\{t_0<t_1<\cdots<t_N\}\subset\mathbb{R}
    Δtk=tk−tk−1>0\Delta t_k=t_k-t_{k-1}>0
  3. A.0.3Definition

    Probability space

    Random quantities are defined on a single space (Ω, F, P). Estimators wear hats. The architecture never treats an estimator as the true map.

    (Ω,F,P)(\Omega,\mathcal{F},\mathbb{P})
    F^  estimates  F\widehat{F}\;\text{estimates}\;F
  4. A.0.4DefinitionTwinId, ObservationId, …

    Identifier spaces

    Twin, observation, experiment, claim, model, and hypothesis identifiers are opaque and pairwise disjoint.

    IdT,IdO,IdE,IdC,IdM,IdH  countable, disjoint\mathrm{Id}_T,\mathrm{Id}_O,\mathrm{Id}_E,\mathrm{Id}_C,\mathrm{Id}_M,\mathrm{Id}_H\;\text{countable, disjoint}

A.1

Primitive universe

The eight primitives of Whitepaper §5 are given types, domains, and invariants.

  1. A.1.1DefinitionTwin, StateRecord, Observation, Relation, ExperimentResult, EvidenceRecord, Scenario, History

    LSRA universe

    An LSRA instance is the 8-tuple of collections below. Each collection is finite at any stored version.

    L=(T,X,O,R,E,V,S,H)\mathcal{L}=(\mathcal{T},\mathcal{X},\mathcal{O},\mathcal{R},\mathcal{E},\mathcal{V},\mathcal{S},\mathcal{H})
  2. A.1.2DefinitionTwin

    Twin

    A Twin is a computational representation of a referent, not the referent. Dimension n is fixed for a given Twin version. Domain D is the admissible set; the indicator φ flags domain faults rather than silently clipping unless a projection is declared.

    Ti=(idi, ni, Di, ϕi, ti⋆)T_i=(\mathrm{id}_i,\,n_i,\,\mathcal{D}_i,\,\phi_i,\,t^\star_i)
    Xi(t)∈Di⊆RniX_i(t)\in\mathcal{D}_i\subseteq\mathbb{R}^{n_i}
    ϕi(x)=1x∈Di\phi_i(x)=\mathbf{1}_{x\in\mathcal{D}_i}
  3. A.1.3Axiom

    Approximation

    Identity with the referent is not assumed. Synchronization error E_t = ||X_real(t) − X_twin(t)|| is an object of study (Exp 009, not in the 2026 foundation suite).

    Ti≢referentT_i \not\equiv \text{referent}

A.3

Observation and uncertainty

A value without provenance is not a measurement. Uncertainty is first-class.

  1. A.3.1DefinitionObservation

    Observation

    Each observation carries a measured vector, a timestamp, a source kind, an uncertainty, a provenance record, and the Twin it is about.

    Oj=(vj,tj,sj,uj,pj,idjT)O_j=(v_j,t_j,s_j,u_j,p_j,\mathrm{id}^T_j)
    vj∈Rn,  tj∈R,  uj∈R≥0nv_j\in\mathbb{R}^{n},\; t_j\in\mathbb{R},\; u_j\in\mathbb{R}^{n}_{\ge 0}
  2. A.3.2DefinitiongaussVec

    Gaussian uncertainty model

    Default: independent Gaussian noise with diagonal covariance from the per-component σ vector. A full SPD covariance may replace the diagonal when supplied.

    v~j∼N(vjtrue,diag(uj∘2))\tilde v_j \sim \mathcal{N}(v_j^{\mathrm{true}}, \mathrm{diag}(u_j^{\circ 2}))
    v~j∼N(vjtrue,Σj),Σj⪰0\tilde v_j \sim \mathcal{N}(v_j^{\mathrm{true}}, \Sigma_j),\quad \Sigma_j \succeq 0
  3. A.3.3DefinitionProvenance

    Provenance

    Provenance is the tuple (method, instrument, hash, agent). Empty provenance types the observation as Unsourced.

    pj=(method,instrument,hash,agent)p_j=(\mathrm{method},\mathrm{instrument},\mathrm{hash},\mathrm{agent})
  4. A.3.4RequirementEvidenceRecord.epistemics

    Unsourced exclusion

    Unsourced observations may be stored. They may not appear in any evidence dataset D_i used to support a claim.

  5. A.3.5Operator

    Information-form merge

    Two observations of the same Twin at the same t with positive-definite covariances merge in information form. Otherwise both are retained and the merge is refused.

    Σ−1=Σa−1+Σb−1\Sigma^{-1}=\Sigma_a^{-1}+\Sigma_b^{-1}
    v^=Σ(Σa−1va+Σb−1vb)\hat v=\Sigma(\Sigma_a^{-1}v_a+\Sigma_b^{-1}v_b)
  6. A.3.6Definition

    State reconstruction (default)

    Default estimator is last-observation-carried-forward. Uncertainty inflates linearly in waiting time with process-noise intensity Q. Kalman and particle filters are admissible if declared on the model record.

    Xi(t)=A({Oj:tj≤t})X_i(t)=\mathcal{A}(\{O_j: t_j\le t\})
    ΣX(t)=Σlast+Q (t−tlast)\Sigma_X(t)=\Sigma_{\mathrm{last}}+Q\,(t-t_{\mathrm{last}})

A.5

Relations

Twins are vertices; typed, timed, uncertain edges are the system graph.

  1. A.5.1DefinitionRelation

    System graph

    The graph may vary in time through its edge set. Vertices are a subset of Twins.

    G(t)=(V,E(t)),V⊆TG(t)=(V,E(t)),\quad V\subseteq\mathcal{T}
  2. A.5.2Definition

    Edge

    An edge carries a relation type, a scalar strength, and a scalar uncertainty.

    eij(t)=(τij,wij(t),σij(t))e_{ij}(t)=(\tau_{ij}, w_{ij}(t), \sigma_{ij}(t))

A.6

History, trajectory, operators

State is a point. A trajectory is the object of study.

  1. A.6.1DefinitionHistory

    History

    A history is a strictly time-increasing sequence of state records with optional diagonal covariance.

    Hi=((tk,Xi(tk),Σi(tk)))k=0NH_i=\bigl((t_k, X_i(t_k), \Sigma_i(t_k))\bigr)_{k=0}^{N}
  2. A.6.2Definition

    Trajectory interpolant

    The default interpolant I is piecewise linear. Other interpolants must be named on the model record.

    γi:[t0,tN]→Rni,γi=I(Hi)\gamma_i:[t_0,t_N]\to\mathbb{R}^{n_i},\quad \gamma_i=I(H_i)
  3. A.6.3OperatortrajectoryFeatures

    First difference

    Raw increment. Not a velocity.

    ΔXk=X(tk)−X(tk−1)\Delta X_k=X(t_k)-X(t_{k-1})
  4. A.6.4Operator

    Time-normalized velocity

    Defined only for Δt_k > 0, which A.0.2 guarantees.

    X˙k=X(tk)−X(tk−1)tk−tk−1\dot X_k=\frac{X(t_k)-X(t_{k-1})}{t_k-t_{k-1}}
  5. A.6.5Operator

    Second difference / acceleration

    Acceleration uses the midpoint span. For k < 2 the operators return 0.

    Δ2Xk=ΔXk−ΔXk−1\Delta^2 X_k=\Delta X_k-\Delta X_{k-1}
    X¨k=X˙k−X˙k−1(tk−tk−2)/2\ddot X_k=\frac{\dot X_k-\dot X_{k-1}}{(t_k-t_{k-2})/2}
  6. A.6.6Operator

    Directional persistence

    Cosine of successive increments. Values near 1 indicate persistent heading; near −1 indicate reversal.

    πk=⟨ΔXk,ΔXk−1⟩∥ΔXk∥ ∥ΔXk−1∥+ε\pi_k=\frac{\langle \Delta X_k,\Delta X_{k-1}\rangle}{\|\Delta X_k\|\,\|\Delta X_{k-1}\|+\varepsilon}
    ε=10−12\varepsilon=10^{-12}

A.7

Dynamics and state transitions

The true map F is unknown. The model is F̂. Validation is comparative, not ontological.

  1. A.7.1Definition

    True dynamics

    U_t is an intervention in a declared control set. η_t is disturbance.

    Xt+1=F(Xt,Ut,ηt)X_{t+1}=F(X_t,U_t,\eta_t)
  2. A.7.2Definitionrk4, ModelRecord

    Model

    Default integrator is classical RK4 with declared dt.

    M=(F^,θ,UM,Q,ver,hash)M=(\widehat F,\theta,\mathcal{U}_M,Q,\mathrm{ver},\mathrm{hash})
    X^t+1=F^θ(Xt,Ut)+ξt,ξt∼N(0,Q)\widehat X_{t+1}=\widehat F_\theta(X_t,U_t)+\xi_t,\quad \xi_t\sim\mathcal{N}(0,Q)
  3. A.7.3Operator

    One-step residual

    The residual sequence is the input to CUSUM (A.9.2) when no other detector residual is declared.

    rt+1=Xt+1−F^θ(Xt,Ut)r_{t+1}=X_{t+1}-\widehat F_\theta(X_t,U_t)
  4. A.7.4Requirement

    Comparative validation

    The question is not F̂ = F. It is whether F̂ is useful, calibrated, reproducible, and superior to a pre-registered baseline B under a declared loss ℓ.

    E[ℓ(X^t+h,Xt+h)∣It]  <?  E[ℓ(Bt+h,Xt+h)∣It]\mathbb{E}[\ell(\widehat X_{t+h},X_{t+h})\mid \mathcal{I}_t] \;\stackrel{?}{<}\; \mathbb{E}[\ell(B_{t+h},X_{t+h})\mid \mathcal{I}_t]

A.9

Regime engine

A regime is a latent discrete index. No detector is assumed universal. Each method is an algorithm with declared parameters.

  1. A.9.1Definition

    Regime

    K is either specified or selected on a declared criterion (silhouette on k = 2…k_max).

    Rt∈{r1,…,rK}R_t\in\{r_1,\ldots,r_K\}
  2. A.9.2Algorithmcusum

    CUSUM

    Parameters (ν, h) are part of the experiment record. Default foundation values: ν = 0.45, h = 6 on a unit-variance mean-shift series.

    zt=∥rt∥−E0[∥r∥]z_t=\|r_t\|-\mathbb{E}_0[\|r\|]
    S0=0,St=max⁡(0,St−1+zt−ν)S_0=0,\quad S_t=\max(0, S_{t-1}+z_t-\nu)
    alarm when St>h; then reset St←0\text{alarm when }S_t>h;\text{ then reset }S_t\leftarrow 0
  3. A.9.3Algorithmkmeans1d, detectRegimes

    Windowed 1-D k-means

    Cluster a scalar feature (default: state norm) with k-means. Change-points are indices where the label flips. This is a baseline detector, not a latent dynamical model.

  4. A.9.4Metric

    Detection metrics

    Undetected events count as false negatives; delay is then undefined and reported as n.

    δ=tdetect−ttrue\delta=t_{\mathrm{detect}}-t_{\mathrm{true}}
    FA=#{alarms t<ttrue−τguard}\mathrm{FA}=\#\{\text{alarms }t< t_{\mathrm{true}}-\tau_{\mathrm{guard}}\}
    miss if no alarm in (ttrue,ttrue+Δmax⁡]\text{miss if no alarm in }(t_{\mathrm{true}}, t_{\mathrm{true}}+\Delta_{\max}]

A.10

Drift engine

Which representation of drift best predicts meaningful change is an empirical question (Whitepaper §12).

  1. A.10.1Definition

    Reference state

    X_ref is declared: initial state, rolling reference-window mean, or a design point. Undeclared X_ref defaults to X(t_0).

    Xref∈RnX_{\mathrm{ref}}\in\mathbb{R}^n
  2. A.10.2DefinitiondriftSeries

    Euclidean drift

    Dt=∥Xt−Xref∥2D_t=\|X_t-X_{\mathrm{ref}}\|_2
  3. A.10.3DefinitionshrinkCov, mahalanobis

    Mahalanobis drift

    Σ is estimated on a reference window with Ledoit–Wolf-style shrinkage. If Σ is singular after shrinkage, D^M falls back to D.

    DtM=(Xt−Xref)⊤Σ−1(Xt−Xref)D^M_t=\sqrt{(X_t-X_{\mathrm{ref}})^\top\Sigma^{-1}(X_t-X_{\mathrm{ref}})}
    Σλ=(1−λ)S+λtr(S)nI\Sigma_\lambda=(1-\lambda)S+\lambda\frac{\mathrm{tr}(S)}{n}I
    λ=min⁡(1,max⁡(0,1−N/(2n)))\lambda=\min\bigl(1,\max(0, 1-N/(2n))\bigr)
  4. A.10.4Metric

    Drift as a predictor of change

    Given a labelled change at t*, score D_t against the indicator of a near-future change. Report AUROC. This is how the research question in §12 is made testable.

    AUROC(Dt,  1t∈[t⋆,t⋆+h))\mathrm{AUROC}\bigl(D_t,\;\mathbf{1}_{t\in[t^\star,t^\star+h)}\bigr)

A.11

Coherence metrics

Coherence is a family of statistics, not a property of nature. A statistic is admitted only if it earns its keep against a simpler nested alternative.

  1. A.11.1DefinitioncoherenceReport

    Correlation coherence

    Cabcorr(W)=∣ρ(XW(a),XW(b))∣C^{\mathrm{corr}}_{ab}(W)=\lvert\rho(X^{(a)}_W,X^{(b)}_W)\rvert
    Ccorr(W)=2n(n−1)∑a<b∣ρab∣C^{\mathrm{corr}}(W)=\frac{2}{n(n-1)}\sum_{a<b}\lvert\rho_{ab}\rvert
    Stabcorr=1−∣C(Wleft)−C(Wright)∣\mathrm{Stab}^{\mathrm{corr}}=1-\lvert C(W_{\mathrm{left}})-C(W_{\mathrm{right}})\rvert
  2. A.11.2DefinitionphaseCoherence, kuramotoOrder

    Phase coherence

    The foundation kernel uses a finite-difference phase proxy atan2(Δx, x) in place of a full Hilbert transform. The Kuramoto order parameter is exact for oscillator ensembles.

    Cabphase=∣1∣W∣∑t∈Wei(φt(a)−φt(b))∣C^{\mathrm{phase}}_{ab}=\Bigl\lvert\frac{1}{\lvert W\rvert}\sum_{t\in W}e^{i(\varphi^{(a)}_t-\varphi^{(b)}_t)}\Bigr\rvert
    reiψ=1m∑a=1meiφ(a),Cphase=rre^{i\psi}=\frac{1}{m}\sum_{a=1}^{m}e^{i\varphi^{(a)}},\qquad C^{\mathrm{phase}}=r
  3. A.11.3Definition

    Graph coherence

    Reserved for multi-Twin experiments (Exp 011). Not required for the 2026 foundation suite.

    L=D−WL=D-W
    Cgraph=λ2(L)λn(L)(spectral gap ratio)C^{\mathrm{graph}}=\frac{\lambda_2(L)}{\lambda_n(L)}\quad(\text{spectral gap ratio})
  4. A.11.4Definition

    Predictive coherence

    Positive values mean the model beats the baseline. Unbounded below.

    Cpred=1−RMSE(F^)RMSE(B)C^{\mathrm{pred}}=1-\frac{\mathrm{RMSE}(\widehat F)}{\mathrm{RMSE}(B)}
  5. A.11.5Requirement

    Ablation rule

    A coherence statistic is published only if it improves a declared predictive or explanatory task over the nested simpler statistic. Correlation stability does not ship as a 'discovery' without that comparison.

A.12

Emergence

Reproduce established collective phenomena before claiming novel emergence.

  1. A.12.1DefinitionrunKuramoto

    Kuramoto benchmark

    Foundation acceptance (Exp 006): after 500 steps at dt=0.05, m=12, r(K=3)>0.75 and r(K=0.05)<0.45.

    φ˙a=ωa+Km∑b=1msin⁡(φb−φa)\dot\varphi_a=\omega_a+\frac{K}{m}\sum_{b=1}^{m}\sin(\varphi_b-\varphi_a)
    r(t)=∣1m∑aeiφa(t)∣r(t)=\Bigl\lvert\frac{1}{m}\sum_a e^{i\varphi_a(t)}\Bigr\rvert
  2. A.12.2Definition

    Emergence residual

    Ψ* is the ground-truth collective observable of the benchmark. The kernel must match Ψ* before any novel Ψ is interpreted.

    Etem=Ψ⋆(t)−Ψ^({xa(t)})E^{\mathrm{em}}_t=\Psi^\star(t)-\widehat\Psi(\{x_a(t)\})

A.13

Scenario and becoming

A scenario is a conditional object. It is not a prediction.

  1. A.13.1DefinitionScenario

    Scenario

    Required fields: assumptions, parameters, uncertainty, model version, intervention, horizon. Missing any field types the object as incomplete; it cannot enter evidence.

    Sk=(Xt:t+h(k), U(k), θ(k), verM, Ak, Πk)S_k=\bigl(X_{t:t+h}^{(k)},\,U^{(k)},\,\theta^{(k)},\,\mathrm{ver}_M,\,\mathcal{A}_k,\,\Pi_k\bigr)
  2. A.13.2Axiom

    Scenario ≠ prediction

    The kernel labels every scenario panel 'conditional'. UI copy that implies unconditional forecast is a spec violation.

    Sk  ≡  Π(Xt:t+h∣Xt,U(k),Ak,M)S_k \;\equiv\; \Pi\bigl(X_{t:t+h}\mid X_t, U^{(k)}, \mathcal{A}_k, M\bigr)
  3. A.13.3DefinitionbecomingSet

    Becoming set

    B(Xt)={S1,…,Sn}B(X_t)=\{S_1,\ldots,S_n\}
  4. A.13.4Definition

    Intervention

    Default application is parameter substitution inside F̂ (e.g. Lorenz ρ, Kuramoto K, oscillator ζ). Control-affine F̂(X)+BU is admissible if B is declared.

    U∈U⊆RnuU\in\mathcal{U}\subseteq\mathbb{R}^{n_u}
  5. A.13.5Metric

    Calibration (ECE)

    Required for Exp 007 (2027). Not gated in the foundation suite.

    ECE=∑b=1BnbN∣accb−confb∣\mathrm{ECE}=\sum_{b=1}^{B}\frac{n_b}{N}\lvert \mathrm{acc}_b-\mathrm{conf}_b\rvert

A.14

Evidence objects

The Evidence Engine is the epistemic backbone. Generated reasoning and measured evidence are distinct node types.

  1. A.14.1DefinitionHypothesis

    Hypothesis

    Status ∈ {open, supported, unsupported, failed, withdrawn}. No hypothesis may be registered without prediction P, acceptance A, and failure F.

    Hi=(statement,Pi,Ai,Fi,status)H_i=(\mathrm{statement}, P_i, A_i, F_i, \mathrm{status})
  2. A.14.2Definition

    Lineage

    A claim C_i is a node in this DAG, plus edges to raw observations and the code version hash.

    Hi→Mi→Di→Ei→RiH_i \to M_i \to D_i \to E_i \to R_i
  3. A.14.3DefinitionEvidenceRecord

    Evidence record

    Vi=(Ci,Hi,Mi,Di,Ei,Ri,metrics,uncertainty,limitations,repro)V_i=(C_i,H_i,M_i,D_i,E_i,R_i,\mathrm{metrics},\mathrm{uncertainty},\mathrm{limitations},\mathrm{repro})
  4. A.14.4Requirement

    Generated vs measured

    Nodes typed generated (AI hypotheses, simulated data labelled as such) are distinct from measured. A claim may not treat generated nodes as measured. Foundation experiments are generated: they test the kernel, not the world.

  5. A.14.5DefinitionFailureRecord

    Failure registry

    Failed hypotheses remain in the record. Revival requires a new hypothesis identifier.

    FRi=(H,P,E,R,F,Mrevision)FR_i=(H,P,E,R,F,M_{\mathrm{revision}})

A.15

Validation metrics

Every system receives a baseline. Discovering that the baseline is better is a legitimate result.

  1. A.15.1Metricrmse

    RMSE

    RMSE=1N∑k=1N∥x^k−xk∥22\mathrm{RMSE}=\sqrt{\frac{1}{N}\sum_{k=1}^{N}\|\hat x_k-x_k\|_2^2}
  2. A.15.2Metricmae

    MAE

    MAE=1N∑k∥x^k−xk∥1n\mathrm{MAE}=\frac{1}{N}\sum_k \frac{\|\hat x_k-x_k\|_1}{n}
  3. A.15.3Metric

    Synchronization error

    Et=∥Xtreal−Xttwin∥2E_t=\|X^{\mathrm{real}}_t-X^{\mathrm{twin}}_t\|_2
    Eˉ=1N∑tEt\bar E=\frac{1}{N}\sum_t E_t
  4. A.15.4Metricauroc

    AUROC

    AUROC=1n+n−∑i∈+∑j∈−(1si>sj+121si=sj)\mathrm{AUROC}=\frac{1}{n_+ n_-}\sum_{i\in +}\sum_{j\in -}\bigl(\mathbf{1}_{s_i>s_j}+\tfrac12\mathbf{1}_{s_i=s_j}\bigr)
  5. A.15.5MetricprecisionRecall

    Precision, recall, F1

    Computed at a declared threshold. The threshold is part of the experiment record.

  6. A.15.6Requirement

    Baseline protocol

    Every evaluation reports (baseline, proposed, Δ, whether proposed wins). The baseline is pre-registered. Persistence is the default forecasting baseline; max-|z| is the default anomaly baseline; a fixed delay budget is the default detector baseline.

A.16

Falsification protocol

Every hypothesis must define its potential failure. This is mandatory.

  1. A.16.1Requirement

    Registration

    Register H with seed, split, baseline, metrics, A, and F. Freeze the code version hash. Then run.

  2. A.16.2Algorithm

    Status update

    Compare the result to A and F. Status is monotonic toward failed or unsupported. Revival requires a new hypothesis id. supported means the acceptance criterion was met on this kernel, this seed, this dataset — not that the claim is a law.

  3. A.16.3Note

    Foundation (P, A, F)

    Exp 001 A: RMSE < 1e-3 vs closed form. Exp 002 A: one-step F RMSE < persistence. Exp 003 A: detect in (90,130] with zero early FA. Exp 004 A: detect in (20,150) with no early FA. Exp 005 A: AUROC ≥ 0.9 and ≥ baseline. Exp 006 A: r(K=3)>0.75 and r(K=0.05)<0.45. Exp 008 A: all q-integer unit tests pass. QRF Q01–Q08: see A.19.7. Life L01–L05: see A.26.5.

A.17

Mathematical compiler

Symbolic mathematics → typed AST → numerical backend → automatic tests → simulation → validation.

  1. A.17.1DefinitionExpr, parse, evalExpr

    Expression IR

    Expr ::= Lit(R) | Var(id) | Add | Sub | Mul | Div | Pow | Call(name, args) | QInt(n, q). The q-integer is a first-class node because of the removable discontinuity at q = 1.

  2. A.17.2DefinitionqInteger, qIntegerTests

    q-integer

    Numerical limit test: for q = 1+10^{-k}, k=4..8, |[n]_q − n| < 10^{1−k} · n. At q = 1 the simplified form n is used.

    [n]q=1−qn1−q(q≠1),[n]1=n[n]_q=\frac{1-q^n}{1-q}\quad(q\neq 1),\qquad [n]_1=n
    lim⁡q→1[n]q=n\lim_{q\to 1}[n]_q=n
  3. A.17.3Note

    Scope of this revision

    The v1.0 compiler evaluates closed-form scalar expressions, q-integers, q-factorials, q-binomials, and both q-exponentials (e_q, E_q). ODE compilation is the RK4 backend applied to declared fields (oscillator, Lorenz, Kuramoto), not a general CAS. That extension is queued, not claimed.

A.18

Reproducibility record

A result is reproducible before it is treated as mature.

  1. A.18.1DefinitionReproRecord, fnv1a

    Repro tuple

    researchId, version, datasetId, datasetHash, modelVersion, parameters, seed, environment, codeVersion, metrics, uncertainty, limitations. Hash is FNV-1a of canonical JSON of (id, seed, params, version) in this kernel; SHA-256 is the publication target.

A.19

Quantum Reality Forge

A research program in q-calculus, approximation, two-qubit information, critical-line numerics, and interpolants. Mathematical novelty is not physical novelty. The validation ladder is Mathematical → Computational → Benchmark → Predictive → Experimental.

  1. A.19.1Requirement

    Ladder and non-claim

    Every QRF result is labeled with the highest rung it occupies. Predictive and Experimental remain open in this revision: no out-of-sample physical forecast, no apparatus. A transformation that is interesting as algebra is not a new law.

  2. A.19.2DefinitionqInteger, qFactorial, qBinomial, qExp, qExpBig, jacksonD

    q-calculus

    [n]q!=[1]q[2]q⋯[n]q,[0]q!=1[n]_q!=[1]_q[2]_q\cdots[n]_q,\quad [0]_q!=1
    Dqf(x)=f(qx)−f(x)(q−1)x (q≠1),Dqxn=[n]qxn−1D_q f(x)=\frac{f(qx)-f(x)}{(q-1)x}\ (q\neq 1),\qquad D_q x^n=[n]_q x^{n-1}
    eq(z)=∑k≥0zk[k]q!,Eq(z)=∑k≥0qk(k−1)/2zk[k]q!e_q(z)=\sum_{k\ge 0}\frac{z^k}{[k]_q!},\qquad E_q(z)=\sum_{k\ge 0}q^{k(k-1)/2}\frac{z^k}{[k]_q!}
    eq(z) Eq(−z)=1e_q(z)\,E_q(-z)=1
  3. A.19.3DefinitionqBernsteinBasis, qBernsteinApprox

    Phillips q-Bernstein

    Nodes [k]_q/[n]_q. The operator reproduces constants and affine functions. At q = 1 it is the classical Bernstein operator.

    bn,k(x;q)=(nk)qxk∏s=0n−k−1(1−qsx)b_{n,k}(x;q)=\binom{n}{k}_q x^k\prod_{s=0}^{n-k-1}(1-q^s x)
    Bn,q(f;x)=∑k=0nf([k]q/[n]q) bn,k(x;q)B_{n,q}(f;x)=\sum_{k=0}^n f\bigl([k]_q/[n]_q\bigr)\,b_{n,k}(x;q)
  4. A.19.4DefinitionketFromBloch, GATES, vonNeumannBits

    Qubit twin

    A two-level Twin with state a spinor, observation the computational-basis probabilities, and a depolarizing mix as a controlled source of mixedness. Entropy is von Neumann of the Bloch radius. This is information representation, not a hardware driver.

    ∣ψ⟩=cos⁡(θ/2)∣0⟩+eiϕsin⁡(θ/2)∣1⟩|\psi\rangle=\cos(\theta/2)|0\rangle+e^{i\phi}\sin(\theta/2)|1\rangle
    S(ρ)=−tr(ρlog⁡2ρ)=h(1+∣r∣2)+h(1−∣r∣2)S(\rho)=-\mathrm{tr}(\rho\log_2\rho)=h\bigl(\tfrac{1+|r|}{2}\bigr)+h\bigl(\tfrac{1-|r|}{2}\bigr)
  5. A.19.5DefinitionfifMaps, fifEval, fifSample

    Barnsley FIF

    An iterated-function interpolant through declared knots with free vertical contractions |d_i|<1. The interpolation property is mandatory. Fractal dimension of the graph is not claimed from the dashboard.

    wi(x,y)=(aix+ei, cix+diy+fi)w_i(x,y)=(a_i x+e_i,\,c_i x+d_i y+f_i)
    F(xi)=yiF(x_i)=y_i
  6. A.19.6DefinitionqOscillatorEnergy

    q-oscillator

    A one-parameter deformation of the harmonic spectrum. The q→1 limit is n+1/2. Used as a computational object, not as a spectroscopic model of a physical oscillator.

    En(q)=12([n]q+[n+1]q)E_n(q)=\tfrac12\bigl([n]_q+[n+1]_q\bigr)
    lim⁡q→1En(q)=n+12\lim_{q\to 1}E_n(q)=n+\tfrac12
  7. A.19.7RequirementrunQrfSuite

    QRF suite

    EXP-Q01 q-calculus identities. EXP-Q02 Jackson monomials. EXP-Q03 Phillips linear reproduction. EXP-Q04 gate involutions and entropy bounds. EXP-Q05 FIF knot interpolation. EXP-Q06 CHSH on ℂ⁴. EXP-Q07 first critical-line zero. EXP-Q08 wave leapfrog CFL. All epistemics = generated.

  8. A.19.8DefinitionbuildTwoQubit, chsh, concurrence, negativity

    Two-qubit twin

    A four-amplitude Twin on ℂ⁴. CHSH, concurrence, and negativity are kernel identities on that Twin. Compactness is not coherence. This is not a loophole-free Bell experiment.

    ∣ψ(θ,ϕ)⟩=cos⁡θ∣00⟩+eiϕsin⁡θ∣11⟩|\psi(\theta,\phi)\rangle=\cos\theta|00\rangle+e^{i\phi}\sin\theta|11\rangle
    S=∣E(a,b)+E(a,b′)+E(a′,b)−E(a′,b′)∣≤22S=|E(a,b)+E(a,b')+E(a',b)-E(a',b')|\le 2\sqrt{2}
  9. A.19.9Definitionzeta, zOnCriticalLine, findZeros, gueFormFactor

    Critical-line numerics

    Hardy Z(t) on Re(s)=1/2 via a Borwein η series. Locating a sign change is a numerical sample of a finite table. It is not a proof of the Riemann Hypothesis. Spacings and the GUE form factor are spectral pictures of that table.

    Z(t)=eiθ(t)ζ(1/2+it)Z(t)=e^{i\theta(t)}\zeta(1/2+it)
    ζ(s)=η(s)/(1−21−s)\zeta(s)=\eta(s)/(1-2^{1-s})
  10. A.19.10DefinitionrunWave2d

    Wave leapfrog

    A 2D wave on a square with Dirichlet walls. Courant number C = c Δt/Δx. A rendered field is a picture of a stencil, not a laboratory wave tank.

    utt=c2∇2uu_{tt}=c^2\nabla^2 u
    C≤1/2C\le 1/\sqrt{2}

A.20

Agriculture Twin / Fresno Living Laboratory

Whitepaper §24.3 and §25 become an executable Twin. Climate is generated at Fresno latitude. Nothing here is a CIMIS record, a grower recommendation, or Experiment 012.

  1. A.20.1NoteAGRI_LADDER

    Validation ladder

    Mathematical, computational, and benchmark rungs are held for the kernel identities. Predictive and experimental rungs remain open until a consented, provenance-bearing dataset is attached.

  2. A.20.2DefinitionDayRecord, simulateSeason

    Field Twin state

    Daily state of a one-dimensional root-zone Twin. Irrigation is an intervention U, not an estimated hidden input.

    Xt=(θt,ETa,t,It,Ya/Ym)X_t=(\theta_t,ET_{a,t},I_t,Y_a/Y_m)
    θ∈[0,θsat]\theta\in[0,\theta_{\mathrm{sat}}]
  3. A.20.3AxiomsimulateSeason, massBalanceResidual, stressKs

    Soil-water balance

    A bucket with drainage of excess above saturation and extraction limited by water above θ_wp. The seasonal residual is a conservation identity.

    θt+1zr=θtzr+Pt+It−ETa,t−Dt\theta_{t+1}z_r=\theta_t z_r+P_t+I_t-ET_{a,t}-D_t
    ETa=KsKcET0,Ks=min⁡(1,(θ−θwp)/(θTA−θwp))ET_{a}=K_s K_c ET_0,\quad K_s=\min\bigl(1,(\theta-\theta_{wp})/(\theta_{TA}-\theta_{wp})\bigr)
  4. A.20.4DefinitioncropKc, relativeYield, VALLEY_ORCHARD

    Phenology and yield

    Kc is a FAO-56 piecewise envelope (initial / development / mid / late). Relative yield is Doorenbos–Kassam. The envelope is not a calibrated cultivar model.

    1−Ya/Ym=Ky(1−ETa/ETc)1-Y_a/Y_m=K_y(1-ET_a/ET_c)
  5. A.20.5DefinitionraMj, hargreavesEt0, syntheticWeather

    Hargreaves ET0 and Ra

    Extra-terrestrial radiation from FAO-56 eq. 21. ET0 is Hargreaves–Samani. Latitude is Fresno (36.7378°N). Generated weather is a seasonal sinusoid plus Poisson storms.

    Ra=24⋅60πGscdr[ωssin⁡φsin⁡δ+cos⁡φcos⁡δsin⁡ωs]R_a=\tfrac{24\cdot 60}{\pi}G_{sc}d_r\bigl[\omega_s\sin\varphi\sin\delta+\cos\varphi\cos\delta\sin\omega_s\bigr]
    ET0=0.0023(Tmean+17.8)Tmax⁡−Tmin⁡ RaET_0=0.0023(T_{\mathrm{mean}}+17.8)\sqrt{T_{\max}-T_{\min}}\,R_a
  6. A.20.6OperatorIrrigPolicy, simulateSeason

    Irrigation as scenario

    Policies none / deficit / full / fixed are interventions. A scenario is explicitly conditional. WHY / WHAT IF / WHAT NOW operate on the generated Twin, not on a farm.

    Sk={Xt+1,…,Xt+h∣Uk}S_k=\{X_{t+1},\ldots,X_{t+h}\mid U_k\}
  7. A.20.7RequirementrunAgriSuite

    Agriculture suite

    EXP-A01 mass residual. EXP-A02 Ra and Hargreaves identities. EXP-A03 irrigation-cutoff CUSUM. EXP-A04 full vs rainfed Ya/Ym. EXP-A05 heat-bias ET0 lift. All epistemics = generated.

A.21

Subsurface Layers — root operating model

The constitution of the laboratory. Instantiations share L. Hidden structure Z is operational. Unimplemented leaves are L0 and cannot emit measured evidence. This is not a theory of everything.

  1. A.21.1NoteSSL_LADDER

    Validation ladder

    Mathematical, computational, and benchmark rungs are held for the ontology, loop, and operational Z. Predictive and experimental rungs remain open at the root.

  2. A.21.2DefinitionSPINE, SPINE_COPY

    Spine

    Eight strata from reality (never stored) to becoming (conditional futures plus model revision).

    R→O→Z→F^→S→U→V→BR\to O\to Z\to \widehat{F}\to S\to U\to V\to B
  3. A.21.3DefinitionINSTANTIATIONS, RELATIONS

    Instantiation registry

    Each node declares branch, primitives from L, maturity, and whether a kernel instrument exists. Implemented nodes cannot sit at L0. L0 nodes have no route.

  4. A.21.4OperatorinferSubsurface

    Operational hidden structure

    Z is inferred from a surface trajectory: first difference norm, Euclidean drift, regime label. It is a research variable, not the true generating process.

    Zt=(∥ΔXt∥, Dt, Rt)Z_t=(\lVert\Delta X_t\rVert,\,D_t,\,R_t)
  5. A.21.5OperatorLOOP, nextStage, LOOP_TO_SPINE

    Becoming loop

    Eight stages form a cycle. Each stage maps onto a spine stratum. Completing the cycle revises the model; it does not confer omniscience.

    observe→understand→model→simulate→act→measure→learn→become\mathrm{observe}\to\mathrm{understand}\to\mathrm{model}\to\mathrm{simulate}\to\mathrm{act}\to\mathrm{measure}\to\mathrm{learn}\to\mathrm{become}
  6. A.21.6RequirementrunSubsurfaceSuite

    Subsurface suite

    EXP-S01 ontology. EXP-S02 operational Z. EXP-S03 8-cycle. EXP-S04 relation graph. EXP-S05 maturity firewall. All epistemics = generated.

A.22

Horizon / Boundary Field (BLACK HOLES)

The physical archetype for information at a boundary. Textbook GR identities are established. The operator B on a Twin is a structural hypothesis. Dark-matter-as-subsurface is a registered hypothesis, not a result. Analogies stay labeled.

  1. A.22.1NoteCLAIMS, BH_LADDER

    Validation ladder and claim kinds

    Claim kinds are established | hypothesis | analogy | speculation. EXP-B01–B03 test established GR identities. EXP-B06 tests the ideal Casimir a⁻⁴ law. EXP-B04–B05 test operational B. C-BH-04 (dark matter as subsurface) is not computationally tested here. C-BH-07 (vacuum free energy) is speculation.

  2. A.22.2DefinitionschwarzschildRadius, photonSphere, isco

    Schwarzschild geometry

    Non-rotating uncharged mass. Photon sphere 3GM/c². ISCO 6GM/c². In units of r_s the diagram is mass-independent.

    rs=2GM/c2r_s=2GM/c^2
    rγ=3GM/c2=32rsr_{\gamma}=3GM/c^2=\tfrac32 r_s
    rISCO=6GM/c2=3rsr_{\mathrm{ISCO}}=6GM/c^2=3r_s
  3. A.22.3DefinitionbekensteinHawkingS, hawkingTemperature, horizonArea

    Horizon thermodynamics

    Bekenstein–Hawking area law and Hawking temperature. Held as textbook results of GR + QFT in curved spacetime, not as a laboratory measurement in this kernel.

    S=kBc3A/(4Gℏ)S=k_B c^3 A/(4G\hbar)
    TH=ℏc3/(8πGMkB)T_H=\hbar c^3/(8\pi GM k_B)
  4. A.22.4OperatorapplyBoundary, applyBoundarySeries, shannonBits

    Operational boundary operator

    B(X, κ) with κ∈[0,1]. filter/absorb scale the state; compress zeros trailing components. κ=1 is identity; κ=0 is absorption. This is not a spacetime diffeomorphism.

    Xout=B(Xin,κ)X_{\mathrm{out}}=B(X_{\mathrm{in}},\kappa)
  5. A.22.5RequirementCLAIMS

    Claim register

    Every BLACK HOLES claim carries kind and a falsification sentence. Analogies cannot be promoted to established by running the kernel.

  6. A.22.6RequirementrunHorizonSuite

    Horizon suite

    EXP-B01 geometry. EXP-B02 area law. EXP-B03 T_H scaling. EXP-B04 B identities. EXP-B05 B on an oscillator Twin (structural hypothesis). EXP-B06 ideal Casimir a⁻⁴. All epistemics = generated.

  7. A.22.7DefinitionlorentzGamma, rapidity, dopplerFactor

    Lorentz kinematics

    Special-relativistic γ, rapidity, and Doppler factor at c=1. Textbook SR. The Minkowski diagram is a picture, not a GPS correction and not a claim about a horizon.

    γ=(1−β2)−1/2\gamma=(1-\beta^2)^{-1/2}
    φ=artanh β\varphi=\mathrm{artanh}\,\beta
    D=(1+β)/(1−β)D=\sqrt{(1+\beta)/(1-\beta)}
  8. A.22.8DefinitioncasimirPressure

    Ideal Casimir pressure

    For two infinite perfectly conducting plates at T=0 the pressure is P = −π² ℏ c / (240 a⁴). Attractive. Established QED for that idealization. Real experiments require material, geometry, temperature, and roughness corrections. Direct extraction of unlimited usable energy from vacuum fluctuations is speculation and is not claimed.

    P=−π2ℏc/(240a4)P=-\pi^2\hbar c/(240 a^4)

A.23

Excel 2030 / Lifeline Map

A spreadsheet reconstructed as system memory: cells, formulas, lineage, lifeline, drift, evidence, and audit. The Valley Grain ledger is a planted demonstration. Findings are generated. Causal statements stay labeled.

  1. A.23.1NoteEXCEL_LADDER, EXCEL_SUITE

    Validation ladder

    EXP-X01 evaluator. EXP-X02 lineage. EXP-X03 CUSUM onset. EXP-X04 integrity. EXP-X05 reproducible audit. EXP-X06 Codex lossless vs entropy. Predictive and experimental rungs stay open. This is not a replacement for Excel and not a certified farm audit.

  2. A.23.2DefinitionevaluateWorkbook, Cell

    Cell as a record

    A cell holds raw, kind, value, error, dependencies, and optional note. Formula evaluation is deterministic given the workbook graph.

    v=eval(craw,G)v=\mathrm{eval}(c_{\mathrm{raw}}, G)
  3. A.23.3OperatordependencyEdges, upstream, downstream

    Dependency graph

    Each formula records upstream refs. Downstream walk from a source; upstream walk from an anomaly. High fan-out is a fragility finding, inferred.

    G=(V,E)G=(V,E)
  4. A.23.4DefinitionWorkbookEvent

    Lifeline

    Events are timestamped and typed. Causal kind is observed | inferred | hypothesized | simulated | unknown. Correlation is not promoted.

  5. A.23.5OperatordetectDrifts

    Drift engine

    CUSUM on numeric year-indexed columns against an early baseline. Onset is a change-point, not a cause.

    St=max⁡(0,St−1+zt−ν)S_t=\max(0,S_{t-1}+z_t-\nu)
  6. A.23.6RequirementIntegrityClaim, auditWorkbook

    Integrity layer

    Claims carry status fact | source-backed | derived | inference | speculation | unknown. Empty evidence is speculation. The kernel does not auto-label hallucination.

  7. A.23.7OperatoraskAnalyst

    Analyst

    Answers are read from the graph. No invented sources. Graph-grounded, not a generative model.

  8. A.23.8OperatorrunScenario, auditWorkbook

    Scenarios and audit record

    WHAT IF packing_factor changes is simulated. The audit hash is deterministic on the same workbook. Health is a vector, not a single score.

  9. A.23.9RequirementrunExcelSuite

    Excel suite

    EXP-X01–X06 reconstruct the planted Valley Grain story and a lossless Codex on line records. All epistemics = generated.

  10. A.23.10DefinitionanalyzeCodex, reconstructCodex, runX06

    Generative Codex

    A line-dictionary plus run-length encoding. Reconstruction must match the corpus exactly. A spectacular ratio on repetitive data does not establish arbitrary-data compression, quantum compression, or storage obsolescence.

    ratio=∣raw∣/∣codex∣\mathrm{ratio}=|\mathrm{raw}|/|\mathrm{codex}|
    reconstruct(C)=raw\mathrm{reconstruct}(C)=\mathrm{raw}

A.24

Organs / Living Intelligence Ecosystem

Instruments are organs of one machine. CODE PRESS manufactures. LOEE remembers. The graph connects. The human sits outside. L0 organs are named so they cannot later pretend to have been measured.

  1. A.24.1NoteORGANS, Organ

    What an organ is

    An organ has a role, consume ports, produce ports, and a list of instruments. Success is more understanding and evidence, not more dashboards. A new idea is typed against an organ — it is not bolted on the side.

  2. A.24.2DefinitionorganById, organIsLive

    Manufacturing is not the system

    CODE PRESS is the manufacturing organ. It is L0. Excel 2030 is system memory (A.23), not the factory. Mathematical Compiler, Simulation Forge, and Digital Twins are downstream organs with live instruments.

  3. A.24.3RequirementACTORS, ORGAN_EDGES

    Actors are not organs

    Human, idea, and reality are intake/return ports. They do not appear in ORGANS. Emergence may produce idea; that is a typed cycle, not a claim of autonomous invention.

  4. A.24.4RequirementrunOrganSuite

    Organ suite

    EXP-O01 ontology. EXP-O02 every live instrument is cited. EXP-O03 CODE PRESS firewall. EXP-O04 graph. EXP-O05 no organ produces measured-evidence. All epistemics = generated.

  5. A.24.5RequirementOPERATING_CONTRACT

    Operating contract

    An idea is admitted in ten steps: understand, connect, exists, missing, smallest, build, test, record, graph, evolve. Continuity is required. A prompt is not an isolated project.

  6. A.24.6NoteSUCCESS_FOR, SUCCESS_AGAINST

    Success condition

    Success is understanding, capability, evidence, reusability, connection, human agency, and real-world value. It is not more dashboards, more agents, or more complexity.

A.25

Digital Twin Particle Accelerator

The accelerator is a computational twin, not a 3D model of a tunnel. The chain is machine → field → particle state → trajectory → interaction → measurement → evidence → updated twin. Thin-lens maps and a textbook RF kick. Not MAD-X, not GEANT, not LHC.

  1. A.25.1NoteACCEL_LADDER, ACCEL_MATURITY

    Maturity and ladder

    Four instrument levels: (1) visualization, (2) physics simulation, (3) digital twin with state, diagnostics, residual, and WHAT IF, (4) research orchestrator. Level 4 is not implemented. The validation ladder remains Mathematical → Computational → Benchmark → Predictive → Experimental. Predictive and experimental rungs stay open. Epistemics = generated.

  2. A.25.2DefinitionParticle, track, rigidity, gammaOf

    Particle state and propagator

    A macroparticle carries transport coordinates (x, x′, y, y′, z, E, t) with charge q and rest energy m. x′ = dx/ds, not canonical px. Propagation is a thin-lens map through each lattice element. The Lorentz force is the governing picture; the kernel is the map. Relativistic γ = E/mc² and rigidity Bρ = p/|q| are textbook.

    X=(x,x′,y,y′,z,E,t)\mathbf{X}=(x,x',y,y',z,E,t)
    Xt+Δt=F(Xt,E,B,Δt)\mathbf{X}_{t+\Delta t}=\mathcal{F}(\mathbf{X}_t,\mathbf{E},\mathbf{B},\Delta t)
    γ=E/mc2,Bρ=p/∣q∣\gamma=E/mc^2,\quad B\rho=p/|q|
  3. A.25.3DefinitionLatticeElement, defaultLattice

    Lattice as a graph of state

    Every element is an object with live state: type, s, length, aperture, status, and type-specific fields (k1, B, VRF, frequency, phase, temperature, vacuum). Status nominal | fault | offline. The bunch walks the directed graph.

  4. A.25.4OperatorwhatIf, perturbElement

    RF kick and WHAT IF

    On-crest energy gain is ΔE = |q| VRF sin(φ), with a first-order phase term from longitudinal offset z. WHAT IF clones the twin, scales one parameter, re-propagates, and returns differential orbit, emittance, loss, and energy. It is a differential on the twin, not an operations forecast.

    ΔE=∣q∣VRFsin⁡ϕ\Delta E=|q|V_{\mathrm{RF}}\sin\phi
    ϕ=ϕ0+2πfz/c\phi=\phi_0+2\pi f z/c
  5. A.25.5DefinitionobservablesOf, BeamObservables

    Beam observables

    The twin surfaces mean energy, energy spread, geometric emittance, βx ≈ ⟨x²⟩/εx, dispersion ηx from cov(x,δ), closed-orbit, bunch length, loss, a compactness index (survival × orbit tightness — not quantum coherence), and a macroparticle-current figure. Luminosity is a toy N²/(4π σx σy) term, not a collider measurement.

  6. A.25.6OperatorTWIN_LOOP, residualOf, observeTwin

    Twin loop

    OBSERVE → MEASURE → COMPARE → SIMULATE → PREDICT → ACT. Compare is a residual against the nominal lattice. Act is a declared intervention U on the twin. No real BPM is attached.

    U=intervention on GU=\text{intervention on }G
    r=Xtwin−Xnomr=X_{\mathrm{twin}}-X_{\mathrm{nom}}
  7. A.25.7RequirementrunAccelSuite, runLabExperiment, mandelstamS

    Accelerator suite

    EXP-P01 energy conservation with RF off. EXP-P02 on-crest RF kick. EXP-P03 quadrupole focusing versus drift. EXP-P04 WHAT IF QF-1 +2%. EXP-P05 collimator loss contrast. Collision kinematics, when requested, use ultra-relativistic Mandelstam s = 4 E1 E2 — textbook, not QFT. All epistemics = generated.

    s=(p1+p2)2≈4E1E2s=(p_1+p_2)^2\approx 4E_1 E_2

A.26

Life Twin

An agent tissue and a Gray–Scott morphogen field. Global pattern is not scripted — it emerges from local rules. This is a computational model. It is not a diagnostic, not a therapy, and not a measurement of a body.

  1. A.26.1NoteLIFE_LADDER

    Validation ladder

    Mathematical, computational, and benchmark rungs are held for the kernel identities. Predictive and experimental rungs remain open. A useful scenario is not a prognosis.

  2. A.26.2DefinitioncreateTissue, stepTissue

    Agent tissue

    Each site carries a fate, ATP, ROS, and resistance. Neighbours couple locally. Drug dose is a declared intervention U. Therapeutic index is clearance versus preservation on this grid — not a clinical endpoint.

    Xi,t+1=F(Xi,t,Ni,t,Ut)X_{i,t+1}=F(X_{i,t},N_{i,t},U_t)
  3. A.26.3DefinitioncreateMorphogen, stepMorphogen, injure

    Morphogen field

    Gray–Scott reaction–diffusion on a square. Injury is a declared intervention that copies buffers before writing. Regeneration score is viable count versus the pre-injury baseline on this field — not healing.

    ∂ta=Da∇2a−ab2+f(1−a)\partial_t a = D_a\nabla^2 a - ab^2 + f(1-a)
    ∂tb=Db∇2b+ab2−(f+k)b\partial_t b = D_b\nabla^2 b + ab^2 - (f+k)b
  4. A.26.4OperatorstepTissue

    WHY / WHAT IF / WHAT NOW

    WHY reports counts on the untreated twin. WHAT IF raises dose. WHAT NOW names the next generated measurement. Nothing here licenses a treatment decision.

    Sk={Xt+h∣Uk}S_k=\{X_{t+h}\mid U_k\}
  5. A.26.5RequirementrunLifeSuite

    Life suite

    EXP-L01 determinism. EXP-L02 site conservation. EXP-L03 selective pressure. EXP-L04 wound regeneration lift. EXP-L05 morphogen field variance. All epistemics = generated.

A.27

Planetary Microfluidics / Planet Twin

Earth as a nested transport graph. Microfluidics is a mathematical and systems-engineering lens for flow, exchange, permeability, and connectivity. It is not a claim that the planet is an engineered chip. Decision-support only: the twin does not control dams, wells, or irrigation.

  1. A.27.1NotePLANET_LADDER, PLANET_CLAIMS

    Validation ladder and claim kinds

    Mathematical, computational, and benchmark rungs are held for kernel identities. Predictive and experimental rungs remain open. Claim kinds are established | hypothesis | analogy | speculation. C-PM-03 (Earth as chip) stays analogy. C-PM-04 (PMI) is a proposed composite. C-PM-06 forbids unlabeled coupling of injection into biology.

  2. A.27.2DefinitionSCALE_LABELS, FRESNO_PATCHES, algebraicConnectivity

    Nested graph

    Six scale levels from planet to molecular. A Fresno-latitude patch mesh is a layout graph, not GIS. Algebraic connectivity λ₂ of the Laplacian is a graph identity.

    G=(V,E)G=(V,E)
    λ2(LG)\lambda_2(L_G)
  3. A.27.3DefinitionstepCycle, runCycle, cycleTotal

    Hydrologic cycle

    Six stores: atmosphere, surface, soil, groundwater, river, ocean. Closed residual is ΣS_end − ΣS_0. Irrigation is a declared source U. This is not FAO-56 (that lives on Agriculture) and not a basin gauge.

    ∑St=∑S0+∑U\sum S_t=\sum S_0+\sum U
  4. A.27.4DefinitiondarcyColumn

    Darcy column

    Saturated 1D Dirichlet column. Steady flux versus −K (h_R − h_L)/L. Linear K. Not Richards, not a well log.

    q=−K∇hq=-K\nabla h
  5. A.27.5OperatoroperativeTemp, activityIndex, pollinatorReport

    Pollinator mesh

    Phenomenological operative temperature and activity on the Fresno mesh. A declared corridor is an intervention on the graph. Not a bee, not a census. BEEOS is not a second operating system.

    Top=T+load−shade−moistT_{\mathrm{op}}=T+\mathrm{load}-\mathrm{shade}-\mathrm{moist}
  6. A.27.6Operatorinject

    Injection case study

    A linear permeability jump above a pore-pressure threshold. Case study of engineered permeability. Not advocacy, not a permit, not a biological analog.

    Keff=K0(1+αmax⁡(0,p−pf))K_{\mathrm{eff}}=K_0(1+\alpha\max(0,p-p_f))
  7. A.27.7NoteKID_LOOP

    Three registers

    The same cycle in simple, scientific, and mathematical language. Simple is not false. Math is not a measurement.

  8. A.27.8OperatorrunCycle

    WHY / WHAT IF / WHAT NOW

    WHY reports stores under a hot, dry forcing. WHAT IF cools, raises infiltration, and declares irrigation. WHAT NOW names the next generated measurement. Nothing here licenses infrastructure.

  9. A.27.9RequirementrunPlanetSuite

    Planet suite

    EXP-M01 closed-cycle conservation. EXP-M02 Darcy analytic flux. EXP-M03 refuge versus control. EXP-M04 corridor λ₂ lift. EXP-M05 injection permeability jump. All epistemics = generated.

A.28

NAVIS / True Predictive Measurement

A useful predictive system asks not only what is likely, but what a system is becoming and what can change its trajectory. Hope, growth, and becoming are hypotheses and operational constructs on a synthetic navigator twin. They are not established psychological laws, not a person, and not a worth score.

  1. A.28.1NoteNAVIS_LADDER, NAVIS_CLAIMS

    Validation ladder and honesty

    Mathematical, computational, and benchmark rungs are held on planted worlds. Predictive and experimental rungs stay open. Epistemics = generated. Hope is never treated as proof that an outcome will occur. Hope, prediction, confidence, evidence, and outcome are different variables.

  2. A.28.2DefinitionhopeProduct, hopeGeom, hopeMean, hopeFull

    Hope Probability Model

    Candidate scalar forms: product P·A·C, geometric mean, arithmetic mean, and a speculative full form including meaning and (1−R). Do not arbitrarily multiply further variables. Which form, if any, adds predictive information is an empirical question.

    Hprod=PACH_{\mathrm{prod}}=P A C
    Hgeom=(PAC)1/3H_{\mathrm{geom}}=(P A C)^{1/3}
    Hmean=(P+A+C)/3H_{\mathrm{mean}}=(P+A+C)/3
  3. A.28.3DefinitionHopeVec, simulateNavigator

    Hope vector

    HV = [P, A, C, M, R] with P reachability of F*, A planted agency, C coherence of velocity with (F*−X), M planted meaning, R planted resistance. Velocity and acceleration of HV are mathematical constructs until validated.

    HV(t)=[P,A,C,M,R]HV(t)=[P,A,C,M,R]
  4. A.28.4DefinitionclassifyGrowth

    Growth kinds

    Growth is change in distance to a declared attractor, not a high score. Kinds: positive, negative, stagnation, oscillation, regression, recovery. CHANGE ≠ GROWTH.

    Gt=D(Xt−1,F⋆)−D(Xt,F⋆)G_t = D(X_{t-1},F^\star)-D(X_t,F^\star)
  5. A.28.5DefinitionbecomingScore

    Becoming

    Becoming is persistence of directional improvement over a window. GROWTH ≠ BECOMING ≠ SUCCESS. A system can become something different without becoming something better.

    Bt=1w∑k=0w−11[Dt−k<Dt−k−1]B_t=\frac{1}{w}\sum_{k=0}^{w-1}\mathbf{1}[D_{t-k}<D_{t-k-1}]
  6. A.28.6OperatorfutureNav

    Future Navigation Vector

    FNV answers eight questions: where we are, where we want to go, reachability, current direction, helping forces, opposing forces, smallest useful intervention, and whether the intervention changed D. Conditional. Not destiny.

    FNV=AC(1−R)P (F⋆−X)^\mathrm{FNV}=A C (1-R) P\,\widehat{(F^\star-X)}
  7. A.28.7RequirementcompareModels

    Model comparison

    Model A persistence. B trajectory. C agency. D mean hope. E HV-adjusted step. Fit on the first half, score RMSE on the rest. Coupled world: HV enters the generator. Control: HV is shuffled. Do not claim superiority until the gap holds.

  8. A.28.8RequirementNAVIS_ETHICS

    Ethics firewall

    Never label human worth. Never read low hope as low potential. Never present a probability as destiny. Never convert a trajectory into an identity. Navigation, not judgment. This twin is not a person.

  9. A.28.9RequirementrunNavisSuite

    NAVIS suite

    EXP-N01 distinctions. EXP-N02 formulations. EXP-N03 Model E on the coupled world. EXP-N04 shuffled control. EXP-N05 agency intervention. All epistemics = generated.

  10. A.28.10Note

    Enterprise wrapper is not a second graph

    Research, intelligence, engineering, biosystems, and mobility are labels of the existing organ graph. JLE OS is not a kernel and is not a second organ map. Digital twins already simulate, build, and validate through Forge, Twins, and LOEE.