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)
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)
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.
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→1 | 1→2 | |
|---|---|---|
| A | ||
| B | ||
| ρ | ||
| R |
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.
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)
The preprint’s six clearest cases: Kauffman’s edge of chaos, biomedical signals, neuroscience, machine learning, power grids, traffic.
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)
| Domain | Parameter | Common name | Meaning | Critical value | Category |
|---|
| Domain | Classification |
|---|---|
| Statistical Physics | Foundational 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 / Thermohaline | Independent derivation |
| Linguistics (Zipf) | Empirical precursor |
| Urban Scaling | Domain transfer |
| Sornette (2004) | Prior cross-domain synthesis |
★ one of the six clearest cases, each, in the preprint’s words, “with qualifications noted for each”.
“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
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)
| Operator | Formula | In words |
|---|---|---|
| Δ, A | x[s] − x[t], e = (s, t) | “Take the directed difference and nothing else.” Δ is A under a declared renaming. |
| B | g[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.” |
| R | g[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)
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)
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)
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.