The ABR Kernel

offered as a footing for criticality mathematics — Kernel V9, development branch

Kernel: Robin Macomber (Origin) · © 2026 Metatron Dynamics, Inc. · Apache-2.0 · repository, branch kernel-v9 at af5fd6f · this page is a tutorial, not the kernel.

The ABR kernel is arithmetic for how much changes along observed arrows, the same at every declared scale the repository has confirmed. This page offers it as a footing for one question criticality fields ask, how far correlations extend. A declared projection of its output may answer that; the kernel does not.

Two questions first: “Does anything distinguishable exist across the declared relations?” and “Is what exists symmetrically or asymmetrically organized in its immediate neighborhood?” (plain-language operators, lines 109–112)

Five words, one minute
  1. Arrow: a directed relation, declared from what was observed.
  2. M: the rule turning observations into numbers.
  3. Number: a value in D, not the thing.
  4. Compare: results against observation.
  5. Operator: a fixed arithmetic step (Δ A Σ B R).

What it is

This kernel starts from the arrow, not from objects (kernel reference, lines 82–84). It does fixed arithmetic: first on the numbers at each arrow’s two ends, then on neighbouring arrows’ results; a result is a calculation, never an observation. Declared: stated by Origin, the person responsible, before any operator acts; traced to an observation through M, never supplied by the calculation. (kernel notation, lines 5, 7, 9, 61; role separation, lines 31, 35)

declaredrelation M numberin D declaredtopology operators result declaredprojection C compare withobservation states what itkeeps and discards change the declaration, not the kernel, and never to reach a wanted number

What it does: try it

A takes each arrow’s difference; B adds the next arrow’s; R adds what continues minus what arrives, scaled by local strength ρ. Untick the box: B is not evaluated, which is not zero.

3
1
0
declared for this demo — the kernel holds no value for these
0.5
1
+1: same differences — a uniform shift changes nothing. Point 1’s value is used either way; the box declares only whether M establishes it as the interior t (kernel notation, lines 53–57).
A = 2 A = 1 3 1 0 point 0 point 1 point 2 path: A → B → R This panel is an illustration in JavaScript; the reference implementation is the Rust crate (README, lines 15–16). Same chain and declared 0.5, 1.0 as the conformance test v8_continuity_abr_chain_finite (tests/v9_conformance.rs, lines 402–411). It checks only that the output is finite; the numbers here are hand-checked against operators.rs (see Sources).
0→11→2
A
B
ρ
R
ρ = ρ_base·χ/(χ₀+χ); χ = largest |A| on arrows touching the source point. 0.000 is a calculated result; “not evaluated” is the absence of one.

Why the rules are strict

One observation, one arrow. A reverse arrow needs its own observation; a loop’s closing arrow is inadmissible.

Nothing undeclared enters. A step missing a declared number is not evaluated, never filled in; a genuine zero is kept.

Say what you threw away. Every summary states what it keeps and discards.

s t admissible s t needs its own observation 0 1 2 closing arrow: inadmissible

Where the criticality question comes from

A critical point is a tipping point, where small changes spread system-wide. The preprint (arXiv:2601.22389) found six to twelve fields that each built their own maths. A field could, in principle, declare its own M and apply the same operators (README); whether that works is still to be shown.

Computing any of these measures (ξ, τ, α, H, χ) from kernel output would be a declared projection (C): a reduction of the edge field that must state what it preserves and discards. None is a kernel quantity; the fields’ χ (a spectral radius) is not the kernel’s χ[i] above. (kernel notation, line 31)

Empirical scaling exponents (power-law distributions, not correlation-decay diagnostics):
C distance nearer critical far from it An illustration, not data.

The preprint’s six clearest cases: Kauffman’s edge of chaos, biomedical signals, neuroscience, machine learning, power grids, traffic.

Fields with criticality mathematics

Same question, different names

The preprint’s correspondence table, drawn from the same data as the chips above. DFA = detrended fluctuation analysis · HRV = heart-rate variability · ML = machine learning. It calls the link “functional correspondence” rather than “mathematical equivalence”. (preprint, correspondence table)

DomainParameterCommon nameMeaningCritical valueCategory

How the preprint classifies each field

DomainClassification
Statistical PhysicsFoundational framework
Seismology (G-R 1944)Empirical precursor
SOC (Bak 1987)Intra-physics extension
Edge of Chaos (Kauffman) ★Qualified independent
Biomedical (DFA) ★Qualified independent
Finance (Mandelbrot 1963)Foundational cross-domain
Finance (Peters 1994)Domain transfer
Machine Learning ★Qualified independent
Neuroscience ★Qualified independent
Power Grids ★Independent derivation
Traffic Flow ★Empirical precursor + qualified
Climate / ThermohalineIndependent derivation
Linguistics (Zipf)Empirical precursor
Urban ScalingDomain transfer
Sornette (2004)Prior cross-domain synthesis

★ one of the six clearest cases, each, in the preprint’s words, “with qualifications noted for each”.

  • Independent derivation: developed from first principles without demonstrable awareness of equivalent prior work.
  • Qualified independent: the method is novel, but the researcher’s training or setting included significant exposure to the relevant physics.
  • Domain transfer: an existing technique applied to a new domain, with traceable lineage.
  • Intra-physics extension: new phenomena found with existing tools inside the same discipline (the definition says “intra-field”).
  • Empirical precursor: critical-like behaviour observed before the formal framework existed.
  • Foundational framework, foundational cross-domain: the general mathematics (scaling, self-similarity, power laws) that shaped several lineages; statistical physics “established the mathematics”.
  • Prior cross-domain synthesis: an earlier work that already drew the fields together, a “textbook treatment”.

The preprint’s own limits

“The functional correspondence we document is phenomenological …” “Our citation analysis cannot rule out informal knowledge transfer. The quantitative evidence supports but does not prove independent derivation.” (preprint, Limitations)

Read the preprint, arXiv:2601.22389 · Go deeper: the cross-domain survey · Go deeper: bridges between domains

For mathematicians: the operators

The formal table says locus or node for a point and edge or declared relation for an arrow. Provenance = the observation an arrow is traced to · projection = a declared stand-in (M or C) · admissible = traceable to an observable through M.

D := { x ∈ ℝⁿ | n < ∞, |x[i]| < ∞ }, the declared domain; M : O → D. “The kernel acts on M(o) only.” “No numerical result is itself an observable.” (kernel notation, line 7)

OperatorFormulaIn words
Δ, Ax[s] − x[t], e = (s, t)“Take the directed difference and nothing else.” Δ is A under a declared renaming.
Bg[e] + Σf ∈ succ(e) g[f]One step of accumulation along declared continuation; a terminal edge accumulates nothing.
ρρ_base · χ[i] / (χ₀ + χ[i]); ρ[e] := ρ[source(e)]χ[i] is the largest |A| or |Δ| on edges incident to i. “The kernel holds no value for either.”
Rg[e] + ρ[e]·(Σsucc(e) g − Σpred(e) g)What continues minus what arrives, scaled by local strength. No component pairs are declared here, so the cc[p] cross-topology term is not evaluated. (kernel notation, line 25)
Σg[e] + ρ[e]·(Σadj⁺(e) g − Σadj⁻(e) g), g = Δ(x)“R applied directly to Δ(x) without prior B accumulation.” E_primary = Σ(Δ(x)).

(kernel notation, lines 19–29; plain-language operators, lines 116–126, 164–181)

M establishes s → t → u ? yes no full kernel: A → B → R primary kernel: Δ → Σ (B not evaluated)
  • Which kernel. “The minimal admissible interior is: s → t → u.” Without it, “the primary kernel Δ → Σ is the correct kernel”. The condition is structural, not a number reached by a ratio. (kernel notation, lines 53–57; plain-language operators, line 142)
  • Before Δ or A. Admissible: uniform shift, declared unit scale. (kernel notation, line 33)
  • Two phases. Phase 1 acts on one declared observation M(o). Phase 2 needs a declared pair: “Phase 2 requires the process, not the photograph.” (plain-language operators, lines 51–57, 231–237)
  • Arrows. Provenance classes Continuation, Coupling, Persistence. Each arrow has exactly one admissible direction; the reverse needs its own observable provenance. (kernel reference, lines 330–337; kernel notation, line 13)
  • C. A declared projection, not a kernel operator: state what it preserves and what it discards. The repository calls itself the ABR/ABRCE kernel (README, line 15). In the preprint’s supplement C is an operator and E = C(R(B(A(x)))) the composite; in the repository C is a declared projection, not a kernel operator. (kernel notation, lines 17, 31; supplement, lines 30, 63)
  • Roles. Three project roles: Origin, the person who declares and holds responsibility; Generator, the one who proposes; Verifier, the one who checks, returning located findings, not approval, by asking: “Can I trace every mathematical operation continuously back to declared observables through declared operators?” The operators hold no agency. (role separation, lines 29–35, 150, 180; kernel reference, lines 131, 175)

Kernel V9, development branch

The Relational Primitive Provenance Invariant: “Every admitted value, operation, and result must have a continuous, verifiable provenance path to an Origin-declared observable relation within D.” It holds three things distinct: a provenance label, a declaration record and a calculation record. Four failure modes are named: missing, fabricated, disconnected and misattributed provenance. Milestones 2 and 3 (Milestone 3 declaring Req-1 to Req-7) were accepted by the project’s Verifier on 2026-10-24: internal milestones, not a release. The enforcement interface is OPEN, and the type names in the specification are working names. V8 constructors and operators are unchanged. (repository README, lines 37–66, 290–326; V9 specification, line 557)

Open conditions the repository lists

A-3, sums over an empty adjacency: OPEN. The ρ max-selection rule and its saturating form: OPEN, Origin declaration required. are_proportional edge-order dependence: HOLD. (kernel reference, lines 1031–1036)

The crate is Rust. cargo test runs 61 library tests and 3 provenance_demo tests on main; on kernel-v9 it runs 31 more conformance tests, with 4 ignored pending enforcement. (repository README, lines 81–87)

“The operators produce the same classes of output … at every declared region from Primary through Planetary. What changes across regions is the declared measurement mapping M, not the operators or their constraints.” (repository README, lines 20–23)

History: V5 to V9
supplementformulationevaluated 2024 V5persistence V6Δ → Σ; ring inadmissible V7rank, SVD out V7.1no defaults Kernel V82026-09-26one release Kernel V9development branch2026-10-24enforcement OPEN
  1. The preprint’s supplement records the formulation it describes under the name “Metatron Dynamics” (the framework name at the time; Metatron Dynamics, Inc. is the company that now holds the kernel’s copyright): four operators A, B, R and C on a ring with circular boundary conditions, composed as E = C(R(B(A(x)))). (supplement, lines 27–63)
  2. The supplement says the framework “originated in distributed systems engineering”, that Macomber “independently derived” its operators, and that when Stephenson evaluated it in 2024 its behaviour at parameter boundaries “resembled critical phase transitions”. The preprint says that case prompted its survey. “Our framework is not the paper’s thesis; it is the accident that revealed the thesis.” (supplement, line 120; preprint, line 113)
  3. The repository’s own history runs from persistence arrows (V5), through the primary kernel Δ → Σ with the ring ruled inadmissible (V6), the removal of rank and SVD quantities and of every kernel default (V7, V7.1), and one release number across every file (Kernel V8, 2026-09-26), to the declared arrow as the one starting point (Kernel V9 development branch, 2026-10-24). It starts at V5, the first row of the repository’s version table. (kernel reference, lines 1119–1136; repository README, lines 93–94, 334)
  4. So the ring that the supplement’s formulation ran on is exactly what the current kernel rules inadmissible. The operators kept their letters, but their definitions and domain changed: A was a deviation from the mean and is now a directed difference, and C is no longer a kernel operator. (supplement; kernel notation, lines 19 and 31) This page states the difference and does not reconcile it.
  5. Labels before Kernel V8 were “document-local … not kernel release versions”; this page uses them only as the repository’s history does. (repository README, lines 93–95; plain-language operators, line 280)
What the kernel does not claim

And the preprint’s own limit: “The quantitative evidence supports but does not prove independent derivation.” (preprint, Limitations)

Credits. The ABR kernel is the work of Robin Macomber (Origin) and is © 2026 Metatron Dynamics, Inc. (relationalrelativity.dev), Apache-2.0: the repository, branch kernel-v9 at af5fd6f (2026-10-24; crate abr-kernel 8.0.0). The preprint, arXiv:2601.22389, is by Bruce Stephenson and Robin Macomber and is a preprint, not a peer-reviewed publication. This page is Bruce Stephenson’s tutorial on the kernel; errors in it are his, not the kernel’s.