Skip to content
Technology How it works Breeder — Hyperion Burner — Aegis Burner — MetroVolt AI-Native Architecture Magnets Fuel cycle Safety Roadmap
Solutions AI & Data Centers Defense & Government Grid & Baseload Neutron Detection Quantum
Learn Technical Library
Proof Publications Whitepapers Technical Library Open Science & Reproducibility The Honest Gates
Company About / Mission Leadership Environment Health & Safety Investors Careers Press Contact
3D Model
AI Architecture › Mathematical Foundations
Mathematical Foundations

Bayesian Inference Foundations

Bayes' rule is how the stack turns diagnostics and priors into calibrated posteriors, the basis of every uncertainty estimate the twin reports.

STRATEGY / SLOW ▲ ▼ MICROSECOND REAL-TIMEL7Ecosystem & Strategytelemetry ▲ control ▼open ▸L6Experience & Visualizationtelemetry ▲ control ▼open ▸L5Applications & Copilotstelemetry ▲ control ▼open ▸L4Orchestrationtelemetry ▲ control ▼open ▸L3Twin Modeling & AItelemetry ▲ control ▼open ▸L2Data Fabrictelemetry ▲ control ▼open ▸L1Control Planetelemetry ▲ control ▼open ▸L0Foundationtelemetry ▲ control ▼open ▸PHYSICAL S.M.A.R.T. GENERATOR PLANTBREEDER · HYPERION1R0 1.2 m · A 2.5 · 16.84 T · δ −0.30BURNER · TANDEM MIRROR2317 T throat · 26.49 T plug · fₙ 5.44% · DEC1 center stack + plasma · 2 high-field plug · 3 expander → direct converterCOLOR GRAMMAR strategy AI-workflow infra/data models reactor/DECLINE SEMANTICStelemetry (µs)controlKRONOS FUSION ENERGYAI-NATIVE S.M.A.R.T. GENERATORMASTER BLUEPRINTSHEET 01REV. 2026-08L0-L7 · 2 MACHINES
The AI-Native S.M.A.R.T. Generator Master Blueprint — eight layers (L0→L7), one control stack, wired to both machines. Telemetry rises in microseconds; control descends the same path.

From prior to posterior

Bayesian inference updates belief about unknown quantities - profiles, calibration factors, model parameters - by combining a prior with the likelihood of observed diagnostics. The result is a posterior distribution, not a point estimate, so every inferred quantity carries honest uncertainty. This is the foundation of the stack's uncertainty quantification.

text
Bayes' rule:

  p(theta | D) = p(D | theta) p(theta) / p(D)

  p(theta)     : prior (physics knowledge, past shots)
  p(D | theta) : likelihood (diagnostic model + noise)
  p(theta | D) : posterior (updated belief)
  p(D)         : evidence = Integral p(D|theta) p(theta) dtheta

Priors carry physics

Priors are where known physics enters: profile smoothness, positivity of pressure, plausible ranges for transport coefficients, and - for the burner - the extrapolation risk of an untested regime encoded as a deliberately wide prior. A well-chosen prior regularizes ill-posed reconstructions and prevents overconfident fits to noisy diagnostics.

python
# posterior via log-prob (schematic)
def log_posterior(theta, data):
    lp = log_prior(theta)                 # physics constraints
    resid = (forward_model(theta) - data) / sigma
    ll = -0.5 * sum(resid**2)             # Gaussian likelihood
    return lp + ll                        # up to the evidence const

The evidence and model comparison

The evidence p(D) - the denominator - is the probability of the data under the whole model. Comparing evidences across competing models (e.g. different transport closures) is principled model selection, automatically penalizing needless complexity. The stack uses this to choose between candidate twin sub-models rather than overfitting the most flexible one.

Exact posteriors are rarely closed-form, so the stack computes them with the tools on the following pages: Gaussian processes for smooth surrogates, MCMC/HMC for sampling, and variational inference for speed. All share this foundation, and all report the uncertainty the machines' safety case requires.

Content reviewed August 2026 · design-and-simulation stage