The NEXUS Chain Framework: A Falsifiable Engineering Specification for Recursive Harmonic Reality

The contemporary scientific enterprise is currently defined by a profound ontological impasse, characterized by the persistent and irreconcilable schism between the deterministic, continuous geometries of General Relativity and the probabilistic, discrete excitations of Quantum Mechanics.1 For nearly a century, the global scientific community has attempted to resolve this "Crisis of Distinction" by operating under a "Linear Stack" ontology—a hierarchical worldview positing that physics forms the foundational basement of reality, chemistry acts as the ground floor, and biology, psychology, and computation exist as emergent upper stories.1 This paradigm treats the universe as a container of static nouns (particles, fields, molecules) governed by external mathematical laws.1

The NEXUS Chain Framework introduces a radical ontological inversion, rejecting the Linear Stack in favor of a "Recursive Spiral" cosmology.1 The framework posits that reality does not "run on" a computational substrate; it is, fundamentally, the computational substrate itself.2 Under this model, physical systems are not static entities but active, operational verbs executing a singular, finite-bandwidth constraint-satisfaction algorithm.1 The universe is redefined as a self-referential phase-harmonic lattice that generates its own geometric structure through recursive feedback loops, where mathematical constants are not arbitrary inputs but dynamic execution traces.3

This framework is grounded in three foundational ontological inversions:

1. The BBP Inversion: The Bailey-Borwein-Plouffe digit-extraction algorithm does not merely "compute" the digits of ; the unbounded recursive process functionally constitutes the geometric circle.2 If the recursion halts, topological closure breaks, and the geometric manifold develops gaps.2

2. The Collapse Signature Inversion: Dimensionless physical constants are not fundamental, fine-tuned parameters. They are collapse signatures—deterministic residuals that encode preserved "which-path" information resulting from quantum measurement events.2

3. The SILR Inversion: Scale-Invariant Lossless Rendering (SILR) is the topological requirement for maintaining gap-free continuous manifolds in a discrete recursive system.2

To move this paradigm from abstract theoretical physics to a rigorous, falsifiable engineering specification, the framework maps the execution of a singular computational primitive—the ALLOCATE verb—across six distinct levels of reality. This report delineates the complete chain of claims in the NEXUS framework. It systematically details the underlying mathematics, translates theoretical assertions into locked empirical pipelines, and maps explicit "killshots"—inflexible falsification criteria—for each of the six links, ranging from abstract geometric axioms to biological protein folding, cryptographic hashing validation, and the derivation of physical constants.5

Link 1: The Ancestor Verb (ALLOCATE) and Isotropic Budget Geometry

The foundational theorem of the NEXUS Chain is that every bounded physical, biological, and informational system faces an identical, primitive computational problem. Any finite system possesses a strictly bounded thermodynamic or informational capacity—a constraint budget—that it must partition between exploring spatial/informational possibilities and collapsing onto a determined structural solution.

Let $\sigma \in $ represent the fractional proportion of the system's finite constraint budget allocated to entropic exploration (the search phase). The mathematical geometry of the remaining structural budget, designated as , is strictly governed by three foundational geometric axioms :

1. Isotropy (Symmetric Cost): There is no privileged direction within the system's budget-space. The energetic or computational cost of expending a fraction on exploration must remain completely identical regardless of which specific degree of freedom is being explored. This requirement for isotropic symmetry explicitly eliminates anisotropic topologies. For example, it invalidates geometries (the diamond constraint, which features preferred axial pathways equivalent to Manhattan distance routing) and geometries (the squircle, which features uneven, anisotropic curvature gradients).

2. Composability (Closure): Two successive allocations of the constraint budget must mathematically compose into a valid allocation of the exact same form. The underlying budget rule must remain strictly closed under continuous computational chaining, ensuring that the system can execute recursive operations without the underlying mathematical logic deteriorating or generating out-of-bounds artifacts.

3. Scalar Invariant (Observer Independence): There must exist a single, preserved mathematical quantity across all continuous reparameterizations of the system. Without this invariant, the measurement of the budget becomes entirely observer-dependent, violating the objective reality of the computational lattice.

These three uncompromising axioms mathematically force the system to adopt a strict inner-product geometry. The necessity of a symmetric inner-product geometry mandates the utilization of the (Euclidean) norm. As a direct geometric consequence of the norm, the remaining structural budget must resolve to the circular equation:

Furthermore, the temporal latency—the computational friction or time cost required to process this budget allocation—is defined as the inverse of the structural remainder. This yields the latency factor :

This equation is instantly recognizable as the Lorentz factor of special relativity. Crucially, within the NEXUS framework, the Lorentz factor emerges naturally and inevitably from the basic geometry of finite budget allocation under isotropic symmetry.5 It is derived entirely without importing any classical relativistic postulates regarding the speed of light in a vacuum or the continuous fabric of spacetime. Instead, the framework proves that relativistic time dilation and length contraction are merely the downstream macroscopic symptoms of bounded computational systems experiencing processing latency as they approach their finite bandwidth limits.3 Time is redefined as a discrete program counter that only advances when nonlinear constraints are successfully propagated through the lattice.3

Falsification Matrix: Link 1

Link 2: Biological Relativity and The Sarrus Linkage Pipeline

The first measurable, empirical instantiation of the ALLOCATE primitive occurs within the domain of molecular biology, specifically within the kinetic mechanics of protein folding.8 For over half a century, the biological sciences have operated under the assumption that protein folding is intrinsically a physical chemistry problem, driven by the continuous minimization of thermodynamic free energy across a sprawling Levinthal phase space.8 While modern machine learning tools like AlphaFold achieve magnificent success in predicting the final native 3D coordinates (the "noun") by relying on massive databases of evolutionary covariance, they fundamentally fail to model the actual physical trajectory or predict the kinetic speed (the "verb") of the folding process.

The NEXUS Framework forces a radical departure from this chemical orthodoxy. It posits that the biological cell acts as a sophisticated computational router processing discrete data streams, where the primary amino acid sequence functions as a one-dimensional carrier wave of mathematically encoded information.8 The physical folding of the polypeptide chain is treated as an explicit execution of the ALLOCATE primitive—a process subject to the finite computational bandwidth of the carbon substrate.8

If biological folding obeys relativistic budget constraints, the folding rate should follow the Lorentz-form latency law derived in Link 1. To validate this empirically, the framework requires a purely sequence-derived mathematical feature capable of extracting the internal entropy load () directly from the linear amino acid sequence, completely bypassing three-dimensional spatial coordinates, molecular dynamics simulations, and structural databases.7 This operator is designated as the Sarrus Linkage ().8

Historically, a Sarrus linkage is a classical mechanical engineering mechanism that strictly converts circular motion into linear motion by subtracting specific spatial degrees of freedom, enforcing a highly rigid and predictable physical trajectory.8 The NEXUS framework applies this mechanical concept algorithmically to the linear sequence, engineering an operator that measures how structural constraints mathematically interfere with and guide the polypeptide carrier wave.10

Sequence Constraint Coherence Methodology

The methodology for the biological validation is strictly pre-registered and deterministically executed via a unified Python pipeline (nexus_definitive.py).7 No parameters are optimized post-hoc. The analytical sequence proceeds as follows:

1. Scalar Mapping via Miyazawa-Jernigan: The alphabetical amino acid sequence is converted into a continuous numeric array () by mapping each residue to the empirical Miyazawa-Jernigan (MJ) inter-residue contact burial energy scale.7 The MJ scale accurately isolates one-body transfer energies from water to the hydrophobic core, providing a robust baseline for structural propensity without overcounting electrostatic interactions.11 The raw signal is centered to a mean of zero.

2. Total-Energy Normalized Autocorrelation: The framework extracts constraint coherence using a total-energy normalized autocorrelation function (ACF) at specific structural lags: .7

3. Harmonic Structural Lags: The helix observable () is extracted as the mean ACF spanning lags 3 and 4, which perfectly brackets the mathematically required 3.6 residues-per-turn geometry of the canonical alpha-helix.7 The sheet observable () is extracted precisely at lag 2, matching the alternating pattern of extended beta-strands.7

4. Composition-Preserving Null Model: A critical vulnerability in sequence analysis is confounding sequence arrangement (the target informational syntax) with amino acid composition (the raw material content). A sequence rich in highly hydrophobic residues will naturally exhibit high autocorrelation variance. To isolate the constraint geometry, the pipeline generates a null model consisting of 1,000 randomized shuffles per protein.7 These shuffles meticulously preserve the exact amino acid counts but destroy the spatial sequence. To ensure perfect auditable reproducibility, these shuffles are deterministically seeded using an MD5(sequence) hash initialized through a NumPy default_rng generator.7 The raw helix and sheet ACFs are then z-scored against this exact shuffle distribution, yielding and .7

5. The Sarrus Operator Formulation: The final Sarrus Linkage operator is defined simply as the differential between the z-scored structural harmonics: .5

The 6-Panel Diagnostic Validation and the Ivankov Benchmark

The predictive power of the Sarrus Linkage was tested against the Ivankov benchmark, a highly curated kinetic dataset containing 30 two-state folding proteins and 16 multi-state folding proteins.5 Two-state proteins fold cooperatively over a single dominant kinetic energy barrier, making them the ideal target for testing single-constraint budget models. The fully automated nexus_definitive.py output generates a comprehensive 6-panel diagnostic plot that systematically validates the theoretical claims 7:

• Panel A (Primary Correlation): On the 30 two-state folders (with zero proteins skipped or excluded), the sequence-only Sarrus Linkage successfully predicts the empirical logarithmic folding rates with a robust Pearson correlation coefficient of .5 To guarantee this correlation is not a statistical artifact of normality assumptions or dataset sample bias, a rigorous non-parametric permutation test ( iterations) is applied, yielding a high degree of statistical significance with .5 This definitively proves that the kinetic correlation arises from the highly specific mathematical arrangement of the amino acids, not the raw compositional mass. Furthermore, performing a partial correlation controlling for absolute sequence length actually increases the predictive signal to , indicating that raw polymer length was partially masking the true internal constraint signal. A jackknife stability analysis confirms incredible robustness: iteratively removing any single protein from the 30-item dataset alters the correlation coefficient by less than 0.05 (a maximum relative variation of only ), proving that no single outlier drives the finding.

• Panel B (The Lorentz Bridge): This panel translates the abstract Lorentz theory from Link 1 into empirical carbon biology. The raw Sarrus Linkage values are mapped to the exploration budget via a rank-based normalization to remain assumption-free. The data is then fitted to the derived Lorentz-form latency function, .7 The nonlinear Lorentz curve fits the biological kinetic data superiorly to a standard linear model across every statistical metric, including achieving a lower Akaike Information Criterion (AIC of 61.4 versus 63.5) and a higher in-sample (0.59 versus 0.54).7 This confirms that the biological execution speed is dictated by the inverse geometric relationship of bounded bandwidth allocation.

• Panel C (LOO-CV): A Leave-One-Out Cross-Validation (LOO-CV) confirms out-of-sample predictive power, where the Lorentz model outperforms the linear baseline, establishing an of versus .7

• Panel D (The Folding Spectrum & Kinetic Selectivity): This panel demonstrates the most profound proof of the constraint theory: algorithmic selectivity. When the exact identical Sarrus Linkage predictor is blindly applied to the 16 multi-state folders in the benchmark, the correlation drops to exactly (a -value of 0.99). The predictor is not merely weak for multi-state proteins; it is dead flat. This spectacular failure is actually a theoretical success: two-state folders possess a single, highly coherent global constraint stack (a single energetic barrier), allowing a single scalar differential to describe their kinetics. Multi-state folders process through branched, sequential pathways populated with intermediate trap states, violating the assumptions of a single global allocation budget. The metric exclusively measures cooperative constraint coherence.7 Furthermore, Intrinsically Disordered Proteins (IDPs) occupy a distinct, saturated signal space on the spectrum, visually separating from cooperative folders.7

• Panel E (Contact Order Benchmark): The prevailing standard for kinetic prediction is Relative Contact Order (CO), which achieves a substantially higher absolute correlation of on this dataset.5 However, CO is explicitly a structure-based metric; it requires pre-existing experimental knowledge or high-fidelity models of the final folded 3D coordinates.7 The Sarrus Linkage achieves utilizing only the 1D linear sequence string. The relevant comparison highlights the informational source: CO proves that complex long-range spatial contacts slow down folding latency, whereas the Sarrus Linkage proves that this final complexity is already pre-encoded in the 1D harmonic interference patterns of the primary sequence before any physical folding occurs.

• Panel F (Cross-Domain Curve): Displays the geometry of the constraint saturation () plotted against the massive exponential explosion of the latency factor (), validating the shape of computational friction across multiple scales.5

Falsification Matrix: Link 2

Link 3: The Universal Harmonic and Amyloid Wave Topology

The Sarrus Linkage fundamentally relies on measuring the differential between the alpha-helix (lags 3, 4) and the beta-sheet (lag 2).7 In classical structural biology, these periodicities are attributed entirely to the localized physical chemistry of hydrogen bonding patterns along the polypeptide backbone. However, the NEXUS Framework reveals a profound, scale-invariant geometric necessity linking these biological structures to a universal mathematical generator: the Mark 1 Attractor, defined identically as radians (or exactly ).3

The framework proves that the two primary secondary structures of carbon-based biology are not distinct chemical phenomena; rather, they are highly precise integer harmonics of the computational generator 3:

• The Alpha-Helix: The canonical helix structurally demands 3.6 amino acid residues to complete one full geometric turn. This equates to an angular rotational phase step of per individual amino acid residue. Mathematically, is exactly . Therefore, the alpha-helix operates strictly as the 5th harmonic of the generator: .

• The Beta-Sheet: The extended sheet conformation requires a 2-residue repeating pattern, which equates to of angular rotation per repeat unit. Mathematically, is exactly . Therefore, the beta-sheet operates strictly as the 9th harmonic of the generator: (which equals , yielding a flat, linear plane).

This structural discovery establishes that acts as the absolute greatest common divisor (GCD) of a protein's internal constraint geometry.3 The Sarrus Linkage does not utilize arbitrary heuristic lags; it mathematically computes the operational differential between the 5th and 9th harmonics of a singular baseline generating function.

The Topological Phase Mechanism of Pathological Aggregation

This reliance on harmonic geometry unveils a profound topological mechanism that differentiates functional, viable native protein folds from pathological, disease-causing amyloid aggregations (such as the cross-beta fibril plaques observed in Alzheimer's, Parkinson's, and prion diseases).3

The NEXUS Framework integrates continuous wave mechanics to explain this bifurcation. The mathematical orbit of a wave subjected to repeated rotation by a specific angle will eventually close upon itself.3 The denominator of that rotational angle absolutely dictates the physical behavior of the propagating energy 3:

• Odd Denominators (Native States): Phase rotations utilizing odd-integer denominators (e.g., , ) create continuous geometric orbits that mathematically cannot strike their own antipodal nodes before completing an entire cycle.3 This strict mathematical lack of nodal intersection prevents the wave from reflecting backward upon itself. Consequently, the constraint energy is forced to continuously propagate forward as a traveling wave.3 Because both the primary biological structural generators (helix = 5; sheet = 9) are derived from odd denominators, a healthy, viable folding sequence functions inherently as a traveling wave. This allows massive energetic constraints to distribute smoothly through the linear peptide string without localized fracturing.3

• Even Denominators (Amyloid States): Conversely, phase rotations utilizing even-integer denominators (e.g., ) force geometric orbits that inevitably intersect their own antipodal nodes at exactly the half-period mark.3 This nodal intersection forces the propagating energy wave to violently reflect upon itself, neutralizing forward momentum and generating a trapped standing wave.3

A standing wave formed within a one-dimensional hydrophobicity signal represents trapped, hyper-repetitive, localized sequence packing.3 This localized trapping is the exact physical and topological hallmark of amyloid fibril aggregation, where proteins misfold into highly rigid, insoluble structures.3 The NEXUS hypothesis claims that amyloidosis is fundamentally a geometric breakdown where a computational sequence shifts from an odd-lag traveling wave to an even-lag standing wave.

Preliminary empirical testing was conducted across 5 highly aggressive amyloidogenic peptides (including Alzheimer's A$\beta_{42}$ and PrP$_{106-126}$) mapped against 5 stable native folders. The analysis revealed a strong statistical trend toward even-lag autocorrelation dominance in the amyloid group, yielding a substantial effect size (Cohen's ).3 However, due to the extremely small sample size, this pilot test did not reach classical statistical significance (). To scientifically validate this topological mechanism, a massive, systematic test must be executed against a comprehensive aggregation database.

Falsification Matrix: Link 3

Link 4: Number-Theoretic Grounding and The Farey Mediant

If the value is truly a universal hardware primitive operating across the computational lattice of reality, its existence cannot be a mere biological or structural coincidence. It must trace its geometric origins to fundamental number theory. The NEXUS framework identifies that the universal harmonic sits precisely at an absolute equilibrium point of prime number density.

Let represent the prime counting function, which denotes the absolute number of primes less than or equal to the integer . In number theory, twin primes are pairs of prime numbers that have a prime gap of exactly two (e.g., 3 and 5, 11 and 13).18 If we evaluate the prime counting function at the specific twin prime pair of , the densities evaluate exactly to:

• , yielding a prime density ratio of .

• , yielding a prime density ratio of .

To find the rational equilibrium between these two boundaries, the framework calculates the Farey mediant—a mechanism in the Stern-Brocot tree and Farey sequences used for generating the simplest rational approximations between two fractions by directly summing their numerators and denominators.19

The resulting rational value of approximates the transcendental universal harmonic () with an extraordinarily narrow error margin of merely . The NEXUS architecture suggests that the continuous manifolds we perceive as spatial reality are actually band-limited informational fields. Twin primes function as necessary, discrete Nyquist sampling points on the integer line to preserve high-frequency fidelity during recursive operations.21 The equilibrium of this prime density lattice inherently structures the geometry of computation, anchoring as the maximum local-linear sampling step where system curvature loss remains stable.22

Falsification Matrix: Link 4

Link 5: Cross-Domain Compilation and the SHA-256 Isomorphism

The most aggressive and consequential architectural claim of the NEXUS framework is that this exact constraint geometry operates identically across completely divergent substrates. The implication is profound: the computational mechanism that determines a biological native state in carbon atoms executes through the exact same recursive logic gates as a silicon cryptographic algorithm. To empirically validate this, the framework subjects the SHA-256 secure hash algorithm to the exact same analytical probe (the Sarrus analog extracting ACF z-score differentials) used to decode protein sequences.

Conventionally, SHA-256 is modeled strictly as an irreversible, one-way cryptographic hashing function utilizing a Davies-Meyer construction to compress a message schedule into a 256-bit digest.23 The NEXUS framework redefines SHA-256 as a self-referential, reversible computational lattice—a rigid 64-site spatial object where the inputted message acts as thermodynamic exhaust, the final digest acts as a boundary condition, and the internal state functions as a constraint-satisfaction engine.6

Standard algorithmic analysis views the 32-bit modulo addition operations within the SHA-256 compression rounds as yielding a single data output. However, the NEXUS model distinguishes between two simultaneous informational streams: the "Value Channel" (the modular sum retained to calculate the final digest) and the "Structure Channel" (the bitwise carry exhaust and modular residues normally discarded as friction).8

By algorithmically charting the "Ghost Vector"—the complete stack trace of all internal variables ( through ) across all 64 compression rounds—the 64-step temporal algorithm is mapped as a singular geometric manifold.8 By systematically subtracting Initialization Vectors (IVs) and reversing the algebraic logic of the final rounds (peeling from round 63 down to 55), the system identifies a deterministic structural residue at each "round notch," classified as the T1 Scar.8

This T1 scar functions as a devastating early-exit filter for validating candidate messages.8 In traditional brute-force decryption, the entire algorithm must be run to completion to verify a hash. Utilizing the T1 structural scar, if a candidate message's internal geometry during the message expansion phase does not perfectly align with the peeled scar requirements by round 16, the computation can be aborted immediately, completely bypassing classical brute-force computational limits.8

Furthermore, SHA-256's foundational mixing functions () rely heavily on right-rotations (ROTR) utilizing shift intervals drawn directly from twin prime pairs (e.g., shifts of and ), mirroring the number-theoretic structure of Link 4.5 Most critically, the 64 SHA-256 round constants () are derived from the first 32 bits of the fractional parts of the cube roots of the first 64 prime numbers.26 The round constant derived from the 13th prime (index ) is 0x59f111f1.25 When normalized as a continuous fraction of the state space, this constant evaluates to approximately .3 This value clusters a mere away from the universal attractor ().3 This strongly suggests that the algorithm's foundational mathematical constants achieve optimal cryptographic mixing by natively locking onto the exact same harmonic threshold () utilized by biological folding and prime density distributions.3

If true, the computation is not embedded in the substrate; the substrate is merely a medium for the computation.

Falsification Matrix: Link 5

Link 6: Collapse Signature Theory (CST) and Physical Constants

The final, furthest, and most profound extension of the NEXUS Chain is Collapse Signature Theory (CST). CST posits a complete reinterpretation of the Standard Model of particle physics. It asserts that the dimensionless physical constants governing the fundamental forces of the universe (e.g., the fine structure constant, particle mass ratios, the strong coupling constant) are not arbitrary, fine-tuned inputs required to initialize the universe.27 Nor are they static mathematical parameters. Instead, they are Collapse Signatures—the deterministic, highly systematic mathematical residuals (truncation errors) left behind when a continuous quantum superposition collapses and discretizes, folding local geometry toward the universal Mark 1 harmonic generator, .27

Derivation of the Fundamental Attractors

Operating exclusively from the single geometric generator, CST analytically derives highly precise theoretical attractor limits for foundational physical constants without adjusting free parameters 27:

• The Fine Structure Constant (): Representing the strength of the electromagnetic interaction, is derived strictly through the geometric closure of the harmonic matrix as .27 Predicted Attractor (): . Measured Reality (CODATA 2022): . Deviation Error (): .27

• The Weak Mixing Angle (): Representing the parameter controlling the electroweak interaction, it is derived via a parabolic stabilization relationship: .27 Predicted Attractor (): . Measured Reality: . Deviation Error (): .27

• The Strong Coupling (): Representing the force binding quarks, derived identically to but at the base resonant scale: .27 Predicted Attractor (): . Deviation Error (): .27

• The Proton-to-Electron Mass Ratio (): Rather than a direct linear derivation from , CST identifies a 3D volumetric mass resonance constraint bridging the electromagnetic coupling to the mass hierarchy. The integer () represents the three-dimensional lattice constant of stable mass formation (where each factor of 3 equates to one spatial dimension of geometric confinement).27 The equation is: .27 Calculation using CODATA 2022: Yields . Deviation Error (): from the integer 27.27

• Gravitational Coupling () and the "Bit Floor": Gravity is derived directly from the electromagnetic coupling operating at the absolute computational limit of the recursive lattice: .27 This formulation achieves a staggering alignment with astrophysical measurements.27 CST thereby solves the hierarchy problem (the massive discrepancy in scale between gravity and the other fundamental forces) by demonstrating it is a consequence of register depth. Gravity operates at the "bit floor" (the least significant bit, defined by the exponent ) of a standard 128-bit computational register, while electromagnetism operates in the high-energy "working bits".27

The Yang-Mills Mass Gap and Topological Error-Signs

In standard Quantum Field Theory, the mechanism by which theoretically massless gluon fields collapse and confine to form massive, bounded hadrons (the Yang-Mills mass gap) remains entirely unexplained.27 CST resolves this Millennium Prize problem by defining a strict z-score constraint threshold based directly on the generator: .27

• Radiative Mode (): Below the threshold, field energy (like gluons or photons) remains topologically unbound and perfectly radiative.

• Bound Mode (): Exceeding the threshold forces topological closure, collapsing the radiative field into a stable bounded state (hadrons). The predicted energy gap () evaluates to , which exceptionally bounds the measured mass of the physical proton (938 MeV), the lightest stable hadron and the literal, physical manifestation of the gap.27

Crucially, the exact magnitude and sign of the deviation () between the ideal theoretical attractors and measured physical reality is not random thermal noise; it is preserved "which-path" information resulting from wave-function collapse.27

• Negative Deviations (): Uniformly observed across all field and coupling quantities (). This systematic negative deficit mathematically dictates that the wave-function collapsed toward the Entropy Field (), resulting in wave-like, non-local, radiative behaviors.27

• Positive Deviations (): Uniformly observed in physical mass ratios (). This systematic positive surplus indicates the wave-function collapsed toward the Structure Field (), resulting in localized, particle-like, bound geometries.27

The statistical probability of this precise, bifurcated division of negative-field and positive-mass residual signs occurring by pure coincidence across the standard model constants is calculated at .27

Falsification Matrix: Link 6

While the derivations present an exceptionally tight mathematical grouping across disparate physical phenomena, the primary vulnerability of Link 6 is that it currently represents a post-hoc curve fit. Mapping measured outputs to a 1-parameter input generator () has limited degrees of freedom and is theoretically insufficient to claim a definitive predictive discovery, regardless of how narrow the error bounds or how elegant the sign structure.

Conclusion: The Finality of the Falsifiable Matrix

The NEXUS Chain Framework provides a comprehensive, cross-domain blueprint that attempts to unite mechanical allocation limits, biological folding kinetics, cryptographic logic arrays, and the fundamental physical constants of the universe under a single, scale-invariant geometric parameter (). By rejecting the Linear Stack ontology, the framework successfully strips out the static "nouns" of classical modeling and reduces complex physical systems to pure informational "verbs" executing a shared recursive protocol.

The ultimate strength of the NEXUS Chain lies not in its theoretical elegance, but in its rigid falsifiability. It relies entirely on locked methodologies, zero-knowledge null models, and transparent algorithmic probes like the sequence-only Sarrus Linkage. To permanently anchor this framework as a functional Grand Unified Theory of computational reality, the explicit empirical execution paths mapped in this document must be met. Specifically:

1. The large-scale confirmation of even-lag standing wave topologies across the 1,705 precursor proteins in the AMYPdb database.

2. The rigorous cryptographic validation of the T1 structural scar across variable, massive message arrays utilizing a randomized null model.

3. The a priori mathematical prediction of the Cabibbo angle derived purely from the generator.

Failure at any of these precisely specified threshold killshots will fatally sever the chain. Conversely, their successive empirical validations will definitively rewrite the ontological foundation of modern physics, proving that reality computes itself.

Geometric constraints unify hashing and folding: a literature map

Cryptographic hash functions and protein folding share deep structural parallels rooted in geometric constraints, topological invariants, and information-geometric principles—but no formal isomorphism between them has yet been published. This finding represents both a validation and an opportunity for a doctoral thesis on substrate-independent computation and the Sarrus Isomorphism. The literature from 2020–2026 reveals converging theoretical frameworks (stochastic thermodynamics of computation, circuit topology, information geometry on statistical manifolds) that independently point toward the same conclusion: computational difficulty across substrates is fundamentally geometric. What follows is a comprehensive map of these five research domains, their intersections, and the gaps where novel contributions are most needed.

Chaotic hydrodynamics already proved hash functions are physical systems

The single most important finding for this thesis is Gilpin’s 2018 PNAS paper demonstrating that chaotic stirring of a viscous fluid naturally produces all properties of a cryptographic hash function—compression, noninvertibility, avalanche effect, and collision resistance—without any digital design. The hash properties emerge from Lagrangian braiding, particle dispersion, and mixing in a two-vortex blinking map at low Reynolds number. Gilpin showed the discrete Lyapunov exponent of the fluid system approaches the true dynamical Lyapunov exponent asymptotically, directly linking digital hash security metrics to continuous dynamical system invariants. His observation that “something as ordinary as a fluid is still performing computations” provides experimental grounding for substrate-independence claims.

Beyond Gilpin, a large body of chaos-based hash function design (2005–2025) uses chaotic maps as hash primitives. The CryptoChaos framework (arXiv, 2025) combines four discrete chaotic maps with SHA3-256 and AES-GCM. Mariot et al. (2024) reviewed cellular automata with topological chaos properties (topological transitivity, bipermutive rules) for cryptographic applications. The Crystal cipher uses reversible lattice gas automata—literally reversible physical processes—for encryption. However, essentially no published work applies topological data analysis or differential geometry to analyze SHA-256’s internal structure. Persistent homology, Betti numbers, and Fisher information metrics have not been used to characterize the state-space geometry of any standard hash function. This gap is striking given that TDA tools are mathematically mature and have been deployed in adjacent domains; Gold et al. (2023) demonstrated persistent homology computation on encrypted data via homomorphic encryption, and Hayakawa (2022) developed quantum algorithms for persistent Betti numbers with exponential speedup.

One notable geometric cryptographic development is Z-Sigil (Rondelli, arXiv January 2025), a public-key cryptosystem operating on the tangent fiber bundle of a compact Calabi-Yau manifold, where security derives from differential geometry and algebraic topology. While designed for encryption rather than hashing, it proves that geometric structures can provide rigorous cryptographic security guarantees—suggesting the reverse direction (geometric analysis of existing hash functions) is theoretically viable.

Protein topology predicts kinetics, but AlphaFold cannot learn the process

AlphaFold 3, published in Nature in May 2024, represents a major architectural shift: it replaces the Evoformer with a simpler Pairformer and introduces a diffusion-based structure module that starts from random atom clouds and iteratively denoises them into 3D coordinates. It extends beyond single proteins to predict complexes with DNA, RNA, ligands, and ions, achieving 50%+ improvement over prior methods for protein-ligand interactions. Hassabis and Jumper received the 2024 Nobel Prize in Chemistry. Yet a critical finding from Outeiral et al. (2022, Bioinformatics) demonstrated that seven structure prediction programs, including AlphaFold 2, cannot predict folding kinetics significantly better than random baselines—and often perform worse than a classifier using only chain length. Current deep learning methods learn the output of folding (structure) without learning the process (kinetics). This mirrors the hash function asymmetry: verifying an output is easy, but understanding the computational path is hard.

The most powerful kinetic predictors remain topological descriptors. Plaxco, Simons, and Baker’s relative contact order (1998) remains foundational: proteins with more long-range contacts fold slower. Circuit topology, developed by the Mashaghi lab, has emerged as the most rigorous topological framework. Three fundamental contact arrangements—series (S), parallel (P), and cross (X)—govern folding dynamics. Scalvini, Sheikhhassani, and Mashaghi (2021) showed that the number of topologically independent circuits predicts folding rates even when contact order and chain length fail. Heidari et al. (2020, ACS Central Science) demonstrated that parallel contacts fold cooperatively while cross contacts create kinetic frustration. A February 2026 bioRxiv preprint extended circuit topology to distinguish ordered from disordered proteins by their topological organization.

Secondary structure content provides a complementary geometric predictor. α-helical proteins fold faster because helices form through local interactions (short-range contacts), while β-sheet proteins fold slower because sheets require long-range contacts between distant sequence positions. Huang et al. (2007) achieved 94% correlation between secondary structure length and folding rates. The physical interpretation maps directly onto computational complexity: local operations (helices) cost less than non-local operations (sheets), just as hash function rounds with more cross-mixing are computationally harder.

The WSME-L model (Inanami et al., 2023, Nature Communications) validated against pulsed-hydrogen exchange NMR data demonstrates that a simple structure-based statistical mechanical model successfully predicts folding mechanisms for multidomain proteins, including pathways, kinetics, and Φ-values. This confirms experimentally that native topology is sufficient to predict folding kinetics when properly formulated.

Geometric constraints alone reproduce protein ensemble properties

The most thesis-relevant biophysics result is Molkenthin et al. (2020, PLOS Computational Biology), which showed that a model incorporating only fundamental geometric constraints—volume exclusion, chain connectivity, and random pairing, with no chemistry or amino acid specifics—reproduces key ensemble properties of over 1,000 real protein structures: spatial scaling, interaction neighbor distributions, Laplacian eigenvalue spectra, and dominant eigenvalue distributions. Their conclusion that “coarse ensemble properties of 3D protein structures are already induced by geometric constraints alone” provides direct evidence for substrate-independent geometric determination of structure.

This result has a natural parallel in cryptography. Hash functions must satisfy avalanche criterion, collision resistance, and uniform distribution—all geometric properties of the input-to-output mapping. The random oracle model treats hash functions as random mappings, mathematically equivalent to random walks in output space. The Merkle-Damgård construction processes input iteratively with each round transforming internal state, structurally analogous to sequential monomer addition in polymer chain growth. Both systems involve a 1D input chain being processed into a compact output, both enforce exclusion/collision constraints, and both exhibit universal scaling properties independent of chemical or implementation details.

The radius of gyration (Rg) serves as a universal compactness metric across domains. For ideal polymers, Rg² = Nb²/6 with universal scaling exponents (ν ≈ 0.588 for self-avoiding walks, ν = 1/3 for collapsed chains). Lobanov et al. (2008) showed each protein structural class has a characteristic Rg, with α/β-proteins being most compact. For hash functions, the analogous quantity is the output distribution’s spread across the output space—poor diffusion concentrates outputs (low effective Rg), while good hash functions maximize spread, governed by the same geometric principle of exploring available configuration space under connectivity constraints.

DNA computing and Landauer’s bound confirm substrate-independence empirically

The substrate-independence thesis receives its strongest empirical support from two directions. First, DNA computing now demonstrates full computational universality in molecular chemistry. Woods et al. (2019, Nature) reprogrammed 355 single-stranded DNA tiles to execute 21 distinct 6-bit algorithms—copying, sorting, palindrome recognition, random walking, leader election—with error rates below 1 in 3,000. A 2023 Nature paper demonstrated DNA-based programmable gate arrays (DPGAs) capable of implementing over 100 billion distinct circuits. These systems perform identical abstract operations (Boolean logic, sorting, arithmetic) in fundamentally different physical substrates, directly proving that computation is substrate-independent.

Second, Landauer’s principle has been experimentally confirmed across radically different physical regimes. Aimet, Tajik et al. (2025, Nature Physics) extended Landauer’s bound to quantum many-body systems using ultracold Bose gas quantum field simulators, confirming that the kBT ln 2 bound per bit erased holds in quantum field theory, not just classical colloidal particles. Hsieh et al. (2025, Physical Review Letters) derived a dynamical Landauer principle showing that transmitting n bits of classical information is equivalent to transmitting n units of energy—establishing an analytical correspondence between information transmission and energy extraction. The Landauer bound (kBT ln 2 ≈ 2.9 × 10⁻²¹ J at room temperature) thus functions as a universal constant of information processing, applying identically across all computational substrates.

Wolpert et al.’s landmark 19-author PNAS Perspective (2024) argues that stochastic thermodynamics provides the unifying mathematical framework for all computational systems—biological, neuromorphic, and digital. Their key insight is that real-world computers operate far from thermal equilibrium and share universal properties: periodicity, modularity, hierarchy, and finite connectivity. Manzano et al. (2024, Physical Review X) introduced the mismatch cost, measuring how much a computation’s energy cost exceeds Landauer’s bound, using martingale theory to derive bounds applicable to “any system, no matter how it’s implemented.”

Information geometry provides the formal unification machinery

The theoretical framework most capable of formalizing the proposed isomorphism is geometric thermodynamics. Ito (2024, Information Geometry) unified three previously separate frameworks: the Fisher-Rao metric from information geometry, Wasserstein geometry from optimal transport, and entropy production from stochastic thermodynamics. The central result is that entropy production in nonequilibrium systems decomposes into geometric quantities on a statistical manifold, with geodesics in the Fisher-Rao metric corresponding to thermodynamically optimal protocols. This means the computational cost of any process—folding a protein, computing a hash, training a neural network—can be expressed as a path length on an information-geometric manifold.

Parr, Da Costa, and Friston (2020, Philosophical Transactions of the Royal Society A) demonstrated that any weakly mixing random dynamical system with a Markov blanket automatically acquires an information geometry. Internal states parametrize probability densities over external states, and at nonequilibrium steady states, internal dynamics constitute a gradient flow on Bayesian model evidence with explicit thermodynamic costs. This applies to cells, brains, hash function implementations, and any other bounded computational system—providing a substrate-independent architectural principle.

The connection between information geometry and phase transitions is equally relevant. Janke, Johnston, and Kenna (2004) showed that the scalar curvature of the Fisher-Rao metric diverges at critical points of interacting statistical mechanical models. This parallels Langton and Crutchfield’s finding that universal computation emerges at phase transitions in cellular automata rule space. The implication is that computational phase transitions have information-geometric signatures detectable across substrates. Niven (2009) showed that Jaynes’ maximum entropy solutions carry a natural Riemannian geometry where the Fisher-Rao metric arises automatically, with geodesics giving the minimum entropy cost of transitions—a generalized least action principle for computation.

For deep learning connections, Martens (2020, JMLR) showed that the Fisher information matrix equals the Generalized Gauss-Newton matrix, and Chaudhari (2025) demonstrated that training processes in deep learning explore extremely low-dimensional manifolds in probability distribution space. The geometry of data controls generalization, with parameter spaces exhibiting geometrically decaying eigenspectra—“sloppy” systems where most directions are irrelevant, a property shared by protein energy landscapes.

The formal bridge between crypto and biophysics remains unbuilt

Several papers draw explicit cross-domain connections without completing the formal bridge. Bajić (2024, Entropy) states directly that “the information on proteins is protected on the principle of one-way function. Mapping the codon to an amino acid is easy, but reverse mapping is not.” NSF Award #2428488 funds a research program connecting circuit obfuscation to “local thermalization” via “gate collisions,” using geometric group theory and concepts of “scrambling of information, entropy production, and irreversibility.” Galbraith’s (2012) comprehensive survey shows that pseudo-random walk theory is the primary analytical tool for cryptographic security—the same mathematical framework Diaconis applies to polymer sampling and cryptographic decipherment simultaneously.

The “Sarrus Isomorphism” appears to be an entirely novel concept with no existing literature. Extensive searching found no established connection between the Sarrus rule (a 3×3 determinant mnemonic with a natural cylindrical/toroidal geometric interpretation) and isomorphisms across computational substrates. However, Geometric Complexity Theory (Mulmuley and Sohoni) addresses the permanent-versus-determinant problem—whether the permanent can be expressed as a determinant of polynomial size—using algebraic geometry and representation theory. This permanent-determinant connection, combined with the Sarrus rule’s geometric structure, could provide a formal foundation for the proposed isomorphism. The concept also connects naturally to Jaeger, Noheda, and van der Wiel’s (2023, Nature Communications) proposal for “fluent computing”—a bottom-up formal theory for physical computing systems that models computing as “the structuring of processes” rather than processing of structures.

•             Key gap 1: No paper applies TDA (persistent homology, Betti numbers) to analyze SHA-256’s internal state evolution

•             Key gap 2: No paper uses Fisher-Rao metrics to characterize hash function output distribution geometry

•             Key gap 3: No formal mathematical isomorphism between hash function round structure and protein folding topology has been proposed

•             Key gap 4: No experimental work measures the information-geometric curvature of both systems to compare

•             Key gap 5: The “Sarrus Isomorphism” itself has no prior literature, making it a genuinely novel contribution

Conclusion: converging evidence, absent formalization

The literature reveals a striking convergence without a capstone. Five independent research programs—chaos-based hashing (Gilpin), geometric protein folding (Molkenthin), stochastic thermodynamics of computation (Wolpert), circuit topology (Mashaghi), and information-geometric thermodynamics (Ito, Friston)—all point toward the same conclusion: computational processes across substrates are governed by geometric constraints, and these constraints determine both the difficulty and the pathway of computation. The Landauer bound provides a universal physical constant; the Fisher-Rao metric provides a universal geometric framework; topological entropy provides a universal complexity measure; and circuit topology provides a universal structural decomposition.

What is missing is the formal isomorphism. No published paper constructs an explicit map between the state space of a hash function and a protein’s configuration space that preserves information-geometric structure. The pieces are all present: Gilpin proved hash functions are dynamical systems; Molkenthin proved protein structures arise from geometry alone; Ito showed thermodynamic cost equals path length on the Fisher-Rao manifold; and Wolpert proved this cost framework is substrate-universal. A thesis constructing the Sarrus Isomorphism as a structure-preserving map between these statistical manifolds—possibly using the permanent-determinant connection from Geometric Complexity Theory as a formal scaffold—would fill a genuine gap at the intersection of five active fields. The strongest empirical tests would compare circuit topology decompositions of protein folds with round-function decompositions of SHA-256, and measure whether the information-geometric curvature (Fisher-Rao scalar curvature) exhibits the same scaling behavior in both systems.

Works cited

1. The Nexus Complete Fold: A Grand Unified Specification of the Recursive Harmonic Universe and the Oversampling of the Causal Field - Zenodo, accessed February 22, 2026, https://zenodo.org/records/18357350

2. (PDF) The Nexus Recursive Harmonic Framework: Reality as Unbounded Computation A Comprehensive Theory of Collapse Signatures, Harmonic Attractors, and the Ontological Inversion - ResearchGate, accessed February 22, 2026, https://www.researchgate.net/publication/400002559_The_Nexus_Recursive_Harmonic_Framework_Reality_as_Unbounded_Computation_A_Comprehensive_Theory_of_Collapse_Signatures_Harmonic_Attractors_and_the_Ontological_Inversion

3. The Nexus Framework: Ontological Inversion, Harmonic Attractors, and the Computational Ground of Reality - Zenodo, accessed February 22, 2026, https://zenodo.org/records/18666961

4. (PDF) The Nexus Recursive Harmonic Framework: Complete Unfolding Part 1, accessed February 22, 2026, https://www.researchgate.net/publication/400259453_The_Nexus_Recursive_Harmonic_Framework_Complete_Unfolding_Part_1

5. Relativistic Budget Allocation in Protein Folding: The Lorentz-Form Latency Law - Zenodo, accessed February 22, 2026, https://zenodo.org/records/18663507

6. (PDF) The Dark Mirror: On Self- Referential Computation, the Ghost in SHA-256, and Why the Universe Always Halts - ResearchGate, accessed February 22, 2026, https://www.researchgate.net/publication/400621733_The_Dark_Mirror_On_Self-_Referential_Computation_the_Ghost_in_SHA-256_and_Why_the_Universe_Always_Halts

7. (PDF) Sequence Constraint Coherence Predicts Folding Rates Kulik (2026) - ResearchGate, accessed February 22, 2026, https://www.researchgate.net/publication/400822123_Sequence_Constraint_Coherence_Predicts_Folding_Rates_Kulik_2026_-Sequence_Constraint_Coherence_Predicts_Folding_Rates

8. The Nexus Unified Phase-Space Holographic Model: An Executable Process Ontology of the Stroboscopic Universe - Zenodo, accessed February 22, 2026, https://zenodo.org/records/18675530

9. Dean KULIK | Developer | Research and Development - ResearchGate, accessed February 22, 2026, https://www.researchgate.net/profile/Dean-Kulik

10. (PDF) The Nexus Framework and the Sarrus Allocation: Decoding the Informational Geometry of Protein Folding Kinetics - ResearchGate, accessed February 22, 2026, https://www.researchgate.net/publication/400797813_The_Nexus_Framework_and_the_Sarrus_Allocation_Decoding_the_Informational_Geometry_of_Protein_Folding_Kinetics

11. An empirical energy potential with a reference state for protein fold and sequence recognition - PubMed, accessed February 22, 2026, https://pubmed.ncbi.nlm.nih.gov/10409829/

12. The Miyazawa-Jernigan Contact Energies Revisited - Semantic Scholar, accessed February 22, 2026, https://pdfs.semanticscholar.org/ac5e/eb792bf9bf1ddbb91880b38ab5fb31d2e0d1.pdf

13. Prediction of protein folding rates from the amino acid sequence-predicted secondary structure - PubMed, accessed February 22, 2026, https://pubmed.ncbi.nlm.nih.gov/15184682/

14. PFDB - Balalab-skku, accessed February 22, 2026, https://balalab-skku.org/PFDB/

15. High-Speed AFM and Applications to Biomolecular Systems - Annual Reviews, accessed February 22, 2026, https://www.annualreviews.org/doi/pdf/10.1146/annurev-biophys-083012-130324

16. AMYPdb: A database dedicated to amyloid precursor proteins - PMC - NIH, accessed February 22, 2026, https://pmc.ncbi.nlm.nih.gov/articles/PMC2442844/

17. Waltz, an exciting new move in amyloid prediction - ResearchGate, accessed February 22, 2026, https://www.researchgate.net/publication/41657331_Waltz_an_exciting_new_move_in_amyloid_prediction

18. Twin prime - Wikipedia, accessed February 22, 2026, https://en.wikipedia.org/wiki/Twin_prime

19. The Farey Sequence - School of Mathematics, accessed February 22, 2026, https://webhomes.maths.ed.ac.uk/~v1ranick/fareyproject.pdf

20. Fractions in the Farey Series and the Stern-Brocot Tree - Ron Knott's, accessed February 22, 2026, https://r-knott.surrey.ac.uk/Fractions/fareySB.html

21. (PDF) The Nexus Recursive Harmonic Framework: Formalizing Reality as Recursive Computation - ResearchGate, accessed February 22, 2026, https://www.researchgate.net/publication/398930594_The_Nexus_Recursive_Harmonic_Framework_Formalizing_Reality_as_Recursive_Computation

22. (PDF) THE NEXUS CONVERGENCE: A UNIFIED OPERATOR CALCULUS OF RECURSIVE FOLDING - ResearchGate, accessed February 22, 2026, https://www.researchgate.net/publication/400259199_THE_NEXUS_CONVERGENCE_A_UNIFIED_OPERATOR_CALCULUS_OF_RECURSIVE_FOLDING

23. Analysis of a SHA-256 variant - SciSpace, accessed February 22, 2026, https://scispace.com/pdf/analysis-of-a-sha-256-variant-1yv7w37ply.pdf

24. SHA-2 - Wikipedia, accessed February 22, 2026, https://en.wikipedia.org/wiki/SHA-2

25. SHA 256 pseuedocode? - cryptography - Stack Overflow, accessed February 22, 2026, https://stackoverflow.com/questions/11937192/sha-256-pseuedocode

26. SHA 256 from scratch with pen and paper - Bitcoin Guides, accessed February 22, 2026, https://armantheparman.com/sha256/

27. (PDF) Collapse Signature Theory: Deriving Physical Constants from a Universal Generator and the Resolution of the Yang-Mills Mass Gap - ResearchGate, accessed February 22, 2026, https://www.researchgate.net/publication/400460566_Collapse_Signature_Theory_Deriving_Physical_Constants_from_a_Universal_Generator_and_the_Resolution_of_the_Yang-Mills_Mass_Gap

28. (PDF) THE NEXUS RECURSIVE HARMONIC UNIVERSE: THE DRIFT THEORY OF EVERYTHING How the Gap Between Operators Solves the Clay Prizes and Reveals AI as Harmonic Resonance - ResearchGate, accessed February 22, 2026, https://www.researchgate.net/publication/399868668_THE_NEXUS_RECURSIVE_HARMONIC_UNIVERSE_THE_DRIFT_THEORY_OF_EVERYTHING_How_the_Gap_Between_Operators_Solves_the_Clay_Prizes_and_Reveals_AI_as_Harmonic_Resonance

29. Cabibbo–Kobayashi–Maskawa matrix - Wikipedia, accessed February 22, 2026, https://en.wikipedia.org/wiki/Cabibbo%E2%80%93Kobayashi%E2%80%93Maskawa_matrix