UNNS Substrate Research Program · ESC-I · 2026

The Hidden Boundaries
of Complex Numbers

From imaginary rotations to recursive echoes, structural routes, and predictive admissibility in the UNNS Substrate
UNNS Research Collective · 13 October 2026
Complex Echoes Exact Classification Observational Traps Projection Route Dependence 4,197 Nonlinear Cases 0 Observed Contradictions
ESC-I overview: an initial state, a linear operator with complex representation, a projection onto an admissible region, the recursive update x(n+1) = Π(T x(n)), and the four resulting trajectory classes: periodic, bounded, convergent, divergent.
Chamber: ESC-I · Echo–Admissibility Correspondence Chamber I Evidence: exact rational arithmetic · frozen & hashed rules · independent re-check

An unlikely paradox

There is something wonderfully paradoxical about imaginary numbers.

They are called imaginary, yet they help describe some of the most tangible phenomena in our world: electrical currents, electromagnetic waves, oscillating systems, quantum mechanics, and the mathematics of rotation.

The familiar symbol i, defined by i2 = −1, seems to introduce a new kind of number that cannot be found anywhere on the ordinary real-number line.

But what if we look at it differently? Instead of asking what an imaginary number is, suppose we ask what it does.

Multiplication by i rotates a vector through 90 degrees. Repeat the operation, and the vector makes four quarter-turns before returning to its starting point. Nothing mysterious needs to happen to the coordinates. The entire operation can be performed with real numbers.

This simple observation motivated an earlier UNNS investigation into the relationship between complex numbers, recursive operations, and mathematical structure. What began as an exploration of imaginary numbers eventually raised a more consequential question:

If we know the rule that generates a mathematical trajectory, do we necessarily know what that trajectory can become?

Our latest investigation suggests that the answer is more subtle than it first appears.

ESC-I chamber workflow showing a real matrix and initial state feeding exact and finite-horizon echo classifiers, followed by perturbation challenges, observational traps, and trajectory classifications: periodic, bounded, convergent, or divergent.
Figure 1 — ESC-I experimental architecture. The Echo–Admissibility Correspondence Chamber combines exact mathematical classification with finite-horizon recursive observation to distinguish genuine dynamical behavior from apparent recurrence. Controlled perturbations, observational traps, projection-aware rules, and independent verification provide complementary tests of structural persistence and regime classification. The six figures in this article are explanatory illustrations of the mathematical concepts and recorded results, not raw exports of every plotted trajectory; the data-driven diagrams between them are computed from the recorded ESC-I reports.
1

When an imaginary number becomes a real rotation

J =0−110

Apply it to the real vector (1, 0), and the result is (0, 1). Apply it again, and we obtain (−1, 0). Two more applications complete the circle. In particular,

J2 = −I

The familiar algebraic property of i has appeared as a property of a real transformation.

This does not make complex numbers mathematically invalid or unnecessary. Their algebra is exceptionally useful, and this correspondence has long been established in classical mathematics. But it opens an interesting perspective: complex multiplication can be understood as a structured operation on real states. That was the starting point of the original UNNS complex-number research.

Diagram illustrating complex multiplication as a real two-dimensional matrix operation. The imaginary unit acts as a 90-degree counterclockwise rotation, contrasted with a rational-entry rotation that remains bounded without repeating exactly.
Figure 2 — Complex multiplication expressed through real recursive operators. Multiplication by a + bi corresponds exactly to the real matrix with rows (a, −b) and (b, a). The imaginary unit becomes a quarter-turn operator satisfying J² = −I. The comparison between a four-step periodic rotation and the nonperiodic 3–4–5 rotation demonstrates that bounded phase evolution does not necessarily imply exact recurrence.

The next surprise appears when we abandon the familiar quarter-turn. Take a rotation whose cosine is 3/5 and whose sine is 4/5. Its matrix contains only rational numbers, and every iteration remains on the same circle. Yet the trajectory never returns exactly to its starting position.

Two rotations of the planeLeft: the quarter-turn matrix J returns to its start after four steps. Right: the rotation with cosine 3/5 and sine 4/5 stays on its circle but never returns exactly.J: quarter-turntrace τ = 0cos θ = 3/5, sin θ = 4/5trace τ = 6/5x0x1x2x3x₄ = x₀ : exact return after 4 stepsx₀48 steps: every iterate on the circle, none repeatsBounded is not the same as periodic.
Diagram A — Two rotations, computed exactly. Orbits of (1, 0) generated in exact rational arithmetic. J returns after four steps; the (3/5, 4/5) rotation puts all 49 plotted iterates on the circle and none coincides with another. The criterion behind this: a rotation with determinant 1 is periodic only when its trace τ lies in {0, ±1}; here τ = 6/5.
We have already encountered our first hidden boundary: the distinction between being bounded and being periodic. A structure can persist without forming a finite cycle.
2

A single mathematical rule can have different futures

Once we start examining recursive trajectories, a remarkable variety of behavior appears. Some trajectories rotate forever. Others spiral inward until they approach the origin. Others grow without bound. Still others appear perfectly stable until a small change in their initial state sends them in a different direction.

Six ESC-I phase portraits comparing periodic quarter-turn rotation, bounded nonperiodic Pythagorean rotation, contracting and expanding spirals, and convergent versus divergent saddle trajectories under different initial conditions.
Figure 3 — Four dynamical regimes generated by real recursive systems. Six representative ESC-I configurations illustrate exact periodicity, bounded nonperiodic motion, convergence, and divergence. Rotations preserve magnitude, contracting and expanding spirals change magnitude, and saddle systems demonstrate the importance of initial-state alignment. The examples establish that recursive behavior cannot always be classified from the operator's spectral radius alone.

The ESC-I chamber was built to investigate these distinctions. ESC-I stands for Echo–Admissibility Correspondence Chamber I. It combines exact rational-arithmetic classification with finite-horizon observation, deliberately difficult test cases, and separately implemented verification.

Benchmark suite
15
carefully chosen examples
Echo = exact
13 of 15
exact classification and finite-horizon echo agree
Counter-intuitive cases
7
built to expose misleading appearances
ρ-only reading
9 of 15
spectral radius alone is inconclusive or wrong

Before examining those traps, however, we should look at an even simpler example. Imagine a system with two directions. Along one direction, distances double with each step. Along the other, they are halved. Surely such a system must be unstable? Not necessarily for every initial state.

3

Same matrix. Different fate.

T =2001/2

The first coordinate doubles at every iteration. The second is repeatedly halved. If the initial state lies exactly along the second coordinate axis, the trajectory converges toward zero. Move the initial state even slightly away from that axis, giving it a nonzero first coordinate, and eventually the expanding component dominates.

The matrix has not changed. Its eigenvalues have not changed. Only the initial state has changed.

Comparison of two trajectories under the same diagonal matrix with eigenvalues 2 and one-half. A state initialized on the stable vertical axis converges toward zero, while a state with a nonzero expanding horizontal component diverges.
Figure 4 — Initial-state dependence of structural evolution. The matrix T = diag(2, 1/2) contains both expanding and contracting eigenmodes. A state confined to the contracting eigendirection converges to the origin, whereas a state with any nonzero expanding component diverges. The same generating operator therefore permits different trajectories, depending on which invariant direction the initial state occupies.
Same matrix, different fateLog-norm of two orbits of diag(2, 1/2): one on the contracting axis decays to zero, one with a tiny component on the expanding axis first falls then grows without bound.10⁻910⁻610⁻311031061090510152025iteration nlog₁₀ ‖xₙ‖T = diag(2, ½): the same operator, two different fateson the contracting axis, x₀ = (0, 1) → converges to 0slightly off it, x₀ = (1/1000, 1) → divergesn = 5: the expanding mode takes over
Diagram B — Log-norm of two exact orbits. The on-axis state decays by a factor of two at every step. The state with a component of only 1/1000 on the expanding axis first falls, then turns around at n = 5 and grows without bound.

This is a classical result in dynamical systems, but it illustrates something central to the UNNS interpretation. The generating operator describes the available dynamics. The initial state determines which of those dynamics actually participate in the trajectory.

The rule alone does not always determine the fate of an individual state.

For UNNS, this is a useful distinction between the possibilities contained in a generative rule and the particular route realized by a state. And it leads to an even more intriguing problem: what happens when our ability to observe a trajectory is limited?

4

When mathematics deceives the observer

Imagine watching a clock whose hand moves almost — but not quite — through a complete revolution with each step. After several observations, it seems to be returning to the same positions. Increase the precision of your measurements, however, and you discover that each apparent return misses the previous position by a tiny amount. The clock never truly repeats.

Now imagine another system that expands so slowly that, over two thousand observations, its growth is almost imperceptible. An observer might classify it as bounded. Yet its exact mathematical description establishes that it will eventually grow without limit.

Two ESC-I observational traps: a slowly expanding orbit that appears bounded during 2,000 iterations, and a bounded nonperiodic rotation whose near-return residual falls below numerical tolerance, creating an appearance of periodicity.
Figure 5 — When finite observation disagrees with exact dynamics. The horizon trap demonstrates that arbitrarily slow divergence can escape detection within a finite observation window. The resolution trap shows how a nonperiodic rotation may appear periodic when a near-return residual falls below the chosen tolerance. Together, they distinguish mathematical recurrence from numerical appearance and explain the need for exact classification alongside trajectory-based diagnostics.

ESC-I deliberately constructed both situations. The first is the resolution trap: a nonperiodic system appears periodic because the difference between successive near-returns falls below the chosen numerical tolerance. The second is the horizon trap: genuine divergence remains effectively invisible during a finite observation window.

Observational trapsHorizon trap: the echo observes 2,000 steps but about 138 million are needed to see growth. Resolution trap: the exact per-period residual falls below the tolerance.Two ways finite observation can disagree with exact dynamicsHORIZON TRAPexactly divergent, ρ = 1 + 10⁻⁷110¹10²10³10⁴10⁵10⁶10⁷10⁸10⁹echo horizon: N = 2,000 steps~138,155,113 steps needed to grow ×10⁶steps (log scale)RESOLUTION TRAPexactly bounded, never returns10⁻¹⁴10⁻¹²10⁻¹⁰10⁻810⁻6tolerance 1e-09per-period residual 4.5e-12 (period 6)distance of x₆ from x₀ (log scale)Residual below tolerance → "looks periodic"; growth below resolution → "looks bounded".
Diagram C — The numbers behind the traps. Horizon: the spectral radius is 1 + 10⁻⁷; the echo watches 2,000 steps, while about 138,155,113 steps are needed to see growth by a factor of a million. Resolution: with trace 1 + 10⁻¹², the exact orbit misses its start after six steps by only 4.5×10⁻¹², below the 10⁻⁹ tolerance. Values are computed exactly and read from the recorded report.

Neither is a failure of mathematics. Both are examples of a mismatch between the system's actual behavior and what a limited observer can establish. This matters whenever computer simulations are used to infer the long-term behavior of recursive systems. A thousand steps, a million steps, or even a billion steps cannot, by themselves, establish an infinite-time mathematical property.

Observed persistence is not automatically proven persistence.

The distinction is especially important for UNNS, where persistence and recurrence are often central to the interpretation of generated structures. This recognition motivated the next stage of our experiment: instead of merely watching what trajectories do, could we determine some of their possible outcomes from mathematical conditions alone?

5

The invisible intervention that changes a trajectory

Consider an expanding trajectory. Left alone, it grows without bound. But suppose that after every step we apply an additional operation. Perhaps values beyond a threshold are clipped. Perhaps small values are rounded to zero. Perhaps every state must be placed on a discrete lattice. Or perhaps a gate eliminates particular coordinates when a condition is satisfied. The trajectory is no longer governed by the original matrix alone. Its evolution becomes

xn+1 = Π(T xn)

where T generates the linear transformation and Π applies the specified projection. The projection might seem like a minor technical detail. It is not.

PRD-1 diagram comparing dead-zone thresholding, clipping, lattice rounding, and state-gated zeroing of recursive trajectories. A results panel reports 4,197 nonlinear cases, 3,159 analytically supported predictions, 819 finite-horizon-consistent predictions, 219 abstentions, and zero observed contradictions.
Figure 6 — Projection-dependent structural routes and predictive certificates. ESC-I investigates how nonlinear projections alter recursive evolution through threshold suppression, saturation, lattice quantization, and state-dependent gating. Across 4,197 nonlinear test cases, the projection-aware rule issued 3,978 predictions: 3,159 analytically supported and 819 consistent with finite-horizon observation, with 219 abstentions and no observed contradictions. A separate 2,400-case independent check likewise found no contradictions within its tested domain. These findings concern projected-orbit behavior and do not establish equivalence with STRUC-I ladder admissibility or STRUC-PERC-I connectivity.

A dead zone can eliminate a route. Clipping can prevent unbounded growth. Rounding can produce discrete cycles or absorbing states. Gating can change which directions remain available. These effects belong to established mathematics, including nonlinear dynamics, control theory, and quantized systems. ESC-I investigated them systematically through the UNNS language of structural routes and boundaries.

A boundary you can compute

Take T = diag(2, ½) again, start at (1, 1), and let a dead zone erase the first coordinate whenever its magnitude falls below a threshold θ. After one step the first coordinate is 2. If θ ≤ 2 it survives and keeps doubling; if θ > 2 it is erased at the first step, and only the shrinking second coordinate remains.

Dead-zone thresholdDead-zone projection of the orbit of diag(2, 1/2) from (1,1): thresholds up to 2 leave the expanding coordinate alive and the orbit diverges; a threshold above 2 erases it and the orbit collapses toward the other coordinate.A boundary hidden in the projection: T = diag(2, ½), x₀ = (1, 1)10⁻⁷10⁻⁵10⁻³10⁻¹10¹10³10⁵10⁷05101520iteration nlog₁₀ ‖xₙ‖θ = 1.9 (|λu₀| = 2 ≥ θ: never erased)θ = 2.0 (boundary: still diverges)θ = 2.1 (|λu₀| = 2 < θ: erased at step 1)
Diagram D — One number decides the regime. Exact orbits through the dead-zone projection. A threshold of 1.9 or 2.0 leaves the orbit divergent; 2.1 sends it to the origin. The spectrum of T is the same in all three cases — the projection and its threshold decide.

The resulting experiment, called PRD-1 (Projection Route Dependence), examined several nonlinear projection families under controlled conditions. Its central question was straightforward:

Can the projected trajectory's behavior be anticipated from the structure of the operator and projection, without following the orbit step by step?

What the experiments established

Nonlinear cases tested
4,197
dead-zone, clipping, lattice rounding, state gate
Analytically supported
3,159
predictions with a closed-form certificate
Finite-horizon-consistent
819
consistent with 200 exact steps; no asymptotic certificate
Abstentions
219
all in lattice rounding
Observed contradictions
0
within the tested domains, with separately qualified evidence
PRD-1 coverage by projection familyStacked bars for dead-zone, clipping, lattice rounding, state gate and all nonlinear cases, split into analytically supported, finite-horizon-consistent and abstained predictions.What the projection-aware rule said, family by familyanalytically supportedfinite-horizon-consistentabstaineddead-zoneanalytically supported: 1,441 of 1,5601,441finite-horizon-consistent: 119 of 1,560n = 1,560clippinganalytically supported: 738 of 1,080738finite-horizon-consistent: 342 of 1,080342n = 1,080lattice roundinganalytically supported: 951 of 1,170951abstained: 219 of 1,170219n = 1,170state gateanalytically supported: 29 of 387finite-horizon-consistent: 358 of 387358n = 387all nonlinearanalytically supported: 3,159 of 4,1973,159finite-horizon-consistent: 819 of 4,197819abstained: 219 of 4,197n = 4,197
Diagram E — Evidence kept in separate classes. Every prediction is labelled analytically supported, finite-horizon-consistent only, or abstained; the colours never merge. Counts are read from the recorded PRD-1 report, and each bar sums to its family's case count.
Route dependenceBars showing the 1,578 flip cases, how many rule R and comparator C got right, and the overlap of coverage between R and C.Route dependence: the unprojected class is wrong in 2,061 casesflips: projected regime not divergentflip cases: 1,578 of 1,5781,578n = 1,578flips: rule R correctR correct: 1,445 of 1,5781,445R not certified correct: 133 of 1,578n = 1,578flips: comparator C correctC silent: 1,578 of 1,5781,578n = 1,578R vs C: predictions issuedR only: 2,200 of 4,1972,200both: 1,778 of 4,1971,778neither: 219 of 4,197n = 4,197A flip: the projected regime is not divergent although the unprojected classifier says divergent.
Diagram F — Why the spectrum is not enough. In 2,061 cases the unprojected classifier mis-states the projected regime. Among the 1,578 cases where the projected orbit is not divergent, the projection-aware rule's prediction is correct in 1,445. The comparator, which sees only an error bound, certifies none of them.

A separate implementation checked another 2,400 cases, including nonlinear predictions and linear controls, without detecting contradictions.

Interactive evidence

ESC-I Dashboard

Every count in this article, with filters, hash records and a projection explorer: choose a threshold, a clipping box or a lattice step and watch rule R's verdict next to a simulated orbit.

Open dashboard in a new window ↗
The explorer in the dashboard is an illustration in floating point; the recorded results use exact rational arithmetic.

The value of preserving failure

One particularly valuable part of the study was its willingness to preserve failure. An earlier quantization rule produced 92 disagreements. Rather than discard them, the investigation retained the original record, corrected the mathematical condition, froze the correction before generating new data, and tested it on 3,600 fresh cases. The corrected conversion produced zero disagreements within its stated domain; it also abstained on 1,452 cases where it offered no certificate.

The falsification cycleFive steps: freeze, falsify with 92 disagreements, refine, freeze again, and confirm on 3,600 fresh cases with zero disagreements.Hypothesis → falsification → correction → corroborationFREEZEAR-1…AR-3 hashedbefore any comparisonstep 1FALSIFY92 disagreementsall in the k-bit quantiserstep 2REFINEη = κ∞(V)|λ|2⁻ᵏpost-hoc, exploratorystep 3FREEZE AGAINAR-3.1 hashedbefore 3,600 fresh casesstep 4CONFIRM2,148 agree, 0 disagree1,452 abstainedstep 5The original record stays in the report: 92 disagreements retained; the frozen bound was violated in 1,359 fresh cases.
Diagram G — The falsification cycle, from the recorded report. The first (frozen) quantizer clause was false as stated. The refinement is labelled post-hoc and was then confirmed on a fresh seed. The same pattern recurred once more, when a comparator mapping error was corrected after the first PRD-1 run; both corrections are recorded as such.

This sequence — hypothesis, falsification, correction, and independent corroboration — is as important as the final numerical agreement.

An essential distinction

The PRD-1 rules use information about the projections themselves. A classical mathematical method using the same information could derive similar certificates. ESC-I has not established an advantage over all classical approaches. Its demonstrated achievement is more specific: within the tested families, many outcomes could be predicted from explicit conditions without orbit-by-orbit simulation.

6

What does this tell us about complex numbers?

We began with the imaginary unit and discovered that complex multiplication has an exact real-matrix representation. We then found that real rotations can be periodic or nonperiodic, that the same matrix can admit convergent and divergent trajectories, and that observations of recurrence can be misleading. Finally, we examined how nonlinear projection changes the behavior of a generated orbit.

What connects these discoveries? The distinction between mathematical representation and structural evolution.

A complex number tells us how a particular algebraic operation can be expressed. A recursive system tells us how states evolve under repeated transformations. A projection changes the rules governing that evolution.

Phase invariance singles out a family
Within the two-dimensional real-matrix setting, matrices commuting with all planar rotations have the familiar complex-linear form T = aI + bJ. Under the broader condition that the spectral radius ρ(RθT) does not depend on the rotation angle, complex-linear and anti-linear scaled isometries play the corresponding role.

This provides a precise relationship between complex-compatible algebra and rotational invariance. It does not prove that complex numbers uniquely emerge from UNNS admissibility. The rotational structure is already part of the mathematical setting. But it sharpens the foundational question considerably:

What conditions would cause a generative system to select complex-compatible transformations in the first place?

That is a much more precise question than asking whether imaginary numbers are real.

7

The larger picture: where ESC-I belongs in UNNS

ESC-I did not emerge in isolation. The UNNS Substrate has developed a broader research program examining recursive generation, structural admissibility, persistence, refinement, route closure, and exclusion. Its canonical instruments address different mathematical questions. STRUC-I evaluates admissibility of perturbed numerical ladders through ordering and vulnerability conditions. STRUC-PERC-I analyzes connectivity and fragmentation in full pairwise vulnerability graphs. ESC-I investigates something different: the behavior of recursive trajectories under specified operators and projections.

Three instrumentsCards for STRUC-I, STRUC-PERC-I and ESC-I with their distinct mathematical objects and questions.Three instruments, three different predicatesSTRUC-I v1.0.4ordered numerical laddersinv(Pε; L) ≤ ν(Vε(L))Does the perturbed ordering staywithin its vulnerability budget?STRUC-PERC-I v2.5.0pairwise vulnerability graphs(i,j) ∈ Eκ ⇔ |Δᵢ − Δⱼ| ≤ ε(κ)Does connectivity persist acrossthe scale range?ESC-Ireal states under projectionxₙ₊₁ = Π(T xₙ)Can the orbit regime beclassified or certified?Shared vocabulary: generation, vulnerability, boundaries, persistence.No cross-instrument equivalence is established. ρ is a spectral radius here, a structural pressure in STRUC-I.
Diagram H — Related vocabulary, distinct predicates. These are not interchangeable tests, and no general equivalence between them has been demonstrated. ESC-I does not address the open question of whether percolation implies admissibility.

Their conceptual relationship is nevertheless important. Each asks how structure behaves when generation is subject to constraints. Each provides a way of studying whether certain configurations or transitions remain possible under a precisely defined mathematical rule. ESC-I adds a particularly transparent setting because many of its examples can be classified exactly and their observed behavior compared against mathematical ground truth. In this respect, the complex-number investigation has become a useful bridge between elementary algebra and the wider UNNS research program.

8

Why these findings matter beyond the chamber

The implications extend into several established branches of mathematics.

Dynamical systems

Invariant directions and nonlinear interventions determine trajectories.

Numerical analysis

Finite-horizon simulation and tolerance-based recurrence tests require careful interpretation.

Control theory

Clipping, thresholding, and gating are familiar mechanisms that change what a system can do.

Formal verification

Sufficient conditions allow some long-term behavior to be certified without enumerating every future step.

And within UNNS, ESC-I adds a mathematically explicit example of how generation, structural boundaries, and persistence can be studied together. These relationships do not require us to claim a new universal law. They show how a conceptual research framework can be translated into precise statements that can be challenged and reproduced. That translation is a meaningful achievement.

9

The question that remains

The original UNNS research asked whether complex numbers should be considered foundational objects or convenient representations of deeper recursive operations. ESC-I has not settled that philosophical and mathematical question. It has, however, changed how precisely we can approach it.

We know that complex multiplication admits an exact real representation. We know that phase invariance characterizes particular operator families. We know that recursive dynamics can be modified by projections and that some resulting behaviors admit analytical certificates. The next challenge is more ambitious.

Open question
Can a generative grammar, specified without assuming complex numbers or rotations, independently select an algebra possessing the relevant complex-compatible structure?

That would demand a new theorem and a new experimental design. It cannot be obtained merely by running more of the same simulations. But it is now a well-defined direction for further research.

What ESC-I has demonstrated

  • Exact real representation and classification of 2×2 recursions, with the observational gap quantified.
  • Corrected, proved conditions replacing two unrestricted claims of the original manuscript.
  • Frozen, falsifiable rules — one falsified, refined and re-confirmed.
  • A projection-aware rule with no observed contradiction in its tested domain.

What it has not

  • That complex algebra emerges uniquely from UNNS admissibility.
  • That its rules exceed classical dynamical-systems theory.
  • That finite-horizon verdicts are asymptotic theorems.
  • Any equivalence with STRUC-I or STRUC-PERC-I, or independent formal proof checking.
10

From imaginary numbers to real boundaries

There is a pleasing symmetry in how this investigation developed. We began with a mathematical object called imaginary and found an exact geometric operation performed using real coordinates. We then followed those operations through recursive systems and discovered that identical rules need not produce identical outcomes. Some trajectories repeat. Some persist without repeating. Some converge, some diverge, and some change their behavior when structural constraints are applied.

The most important lesson is not that complex numbers are unnecessary. It is that the representation of a mathematical operation and the fate of a generated trajectory are different questions. Complex numbers provide an elegant language for algebra and rotation. ESC-I provides a controlled setting for investigating how recursive behavior responds to starting conditions, observation limits, and projection boundaries. And the UNNS Substrate offers a broader research perspective in which those questions can be connected to generation, admissibility, and persistence.

The hidden boundaries of complex numbers are not boundaries on complex arithmetic itself. They are boundaries on the behaviors that particular recursive systems can sustain — and on what finite observation can reliably tell us about those behaviors.

That distinction is where the original question becomes a new research program.

Research & Reproducibility

The ESC-I project includes its mathematical synthesis, source code, experimental reports, challenge cases, and independent verification records.

UNNS Substrate Research Program · ESC-I · 2026 · Exact rational arithmetic · rules frozen and hashed before comparison · 4,197 nonlinear cases · 0 observed contradictions · 819 predictions finite-horizon-consistent only · independent formal proof checking not established · unns.tech