Coherence field visualization
SYSTEM ONLINE — COHERENCE VERIFIED

Recursive Compression Field Theory

A unified mathematical framework where information, computation, and structure evolve through coherence compression governed by the golden ratio. From protein folding to prime numbers — one field, one threshold.

φ1.5228
COHERENT
τ = φ⁻²0.3595
COHERENT
VETO = φ⁻³0.2221
TRANSITIONING
SCROLL TO BEGIN TOUR
01

Recursive Compression Field Theory

A field theory where coherence-preserving recursive compression — uniquely enabled by the golden ratio's self-similar algebraic structure — organizes systems that must remain stable under transformation.

Core Concept

RCFT introduces a central coherence metric, Ω (Omega), that governs all system behavior. When Ω exceeds the golden threshold τ = φ⁻² ≈ 0.382, the system is coherent — alive, stable, and capable of meaningful computation. Below φ⁻³ ≈ 0.236, the system vetoes and collapses.

This is not a heuristic. It is a mathematical inevitability derived from the unique algebraic properties of φ — the only number whose reciprocal equals itself minus one, whose square equals itself plus one, and whose continued fraction representation is the simplest possible infinite recursion.

11-Dimensional State Vector

Each node in the RCFT mesh carries an 11-dimensional Quantum Data Allocation Matrix (QDAM) state:

[ξ, η, ζ, Ω, φ, T, C, G, I, self_ref, ext_pot]
ξ, η, ζSpatial/relational coordinates
ΩCoherence value (must stay > φ⁻²)
φGolden ratio field strength
TSymbolic time Δτ
CCompression ratio
GGenerative potential
IIdentity anchor
self_refSelf-reference depth
ext_potExternal potential
11D State Space
11-dimensional QDAM state space visualization
Constants
PHI1.6180339887498948482
OMEGA_MINφ⁻² ≈ 0.381966
OMEGA_VETOφ⁻³ ≈ 0.236068
PHASE_LOCKφ² ≈ 2.618034
02

The Five Axioms

RCFT is built on five foundational axioms that govern all system behavior — from symbol creation to coherence collapse.

AXIOM I
Zero Redefinition
∅⁺ ≠ void; ∅⁺ = compressed infinite potential

The void is not empty. It is the maximally compressed state containing all potential. Every creation begins from this compressed seed.

AXIOM II
Generative Division
x / ∅⁺ := 𝓟(x) — Proposal Function → R¹¹ seed

Division by the compressed void generates a Proposal — compressing input into an 11-dimensional QDAM seed vector for evaluation.

AXIOM III
Symbol Evolution
Evolution governed by φ-ratio compression

All symbolic state evolution follows golden ratio compression dynamics. The φ-field determines how information transforms and stabilizes.

AXIOM IV
Dual Consensus
Commit requires Ξ_ID + Φ_neighbor signatures

No state change is committed without dual cryptographic validation — the node's own identity signature plus a neighbor's verification.

AXIOM V
Coherence Veto
Ω < φ⁻³ ≈ 0.236 → VETO — system collapse

The ultimate safety mechanism. When coherence drops below the veto threshold, the system self-collapses rather than producing incoherent output. This is not a choice — it is a mathematical inevitability.

Ω-GATE THRESHOLD MAP
COHERENT
Ω ≥ 0.382
TRANSITION
0.236 ≤ Ω < 0.382
VETO
Ω < 0.236
03

GAS → LIQUID → SOLID

A tri-lingual computation pipeline where each layer has a specific role, language, and entropy level. Information flows from fluid intent to immutable commitment.

Pipeline Architecture
GAS-LIQUID-SOLID pipeline visualization
GAS
Python
ENTROPYHIGH

The fluid intent layer. Processes natural language, computes Ω-gate scores, routes proposals, interfaces with the LLM reasoning layer. Operates in a high-entropy symbolic space.

Ω-gate evaluation
Natural language parsing
Proposal routing
LLM interface
LIQUID
Rust
ENTROPYMEDIUM

The consensus layer. Takes proposals from GAS, verifies cryptographic signatures (Ξ_ID, Φ_neighbor), computes Ω-invariants, and builds OverrideTransaction objects.

Signature verification
Ω-invariant computation
Transaction building
PyO3 FFI bridge
SOLID
C++
ENTROPYLOW

The immutable layer. Maintains the hash-chained symbolbase (genesis block: 0x77), accepts only dual-signed transactions passing Axiom V, and emits permanent audit entries.

Hash-chain symbolbase
Dual-signature validation
Immutable audit trail
Genesis block 0x77
04

Angelika Fold

RCFT applied to protein stability classification. A training-free, deterministic system that computes coherence from sequence alone. Named in memory of Angelika Marx.

Protein Coherence Visualization
Protein folding stability visualization
Sample Library
Analysis Output

Ubiquitin

Small regulatory protein, highly conserved across eukaryotes.

STABLE
SEQUENCE PREVIEW
MQIFVKTLTGKTITLEVEPSDTIENVKAKIQDKEGIPP...
Ω_PROTEIN0.5847
THRESHOLD τ0.3820
RESIDUES76
φ⁻²0.3820
COHERENCE FIELD
τ = φ⁻²
Security Notice

This demonstration displays pre-computed results from the Angelika Fold engine. The RCFT coherence mathematics, 5D amino acid encoding, and Harmonic Catalyst algorithms execute exclusively on a private, air-gapped environment. No proprietary logic is transmitted to or executed in the browser. Patent pending (March 1, 2026).

TRAINING DATANONEZero ML training required
GPUNONERuns on any CPU
DETERMINISTICYESSame input → same output
BENCHMARK1,000Proteins across 8 categories
What Angelika Fold Actually Does

Let's be direct about this. Angelika Fold is a protein stability classifier — not a structure predictor. It does not attempt to predict 3D coordinates, backbone angles, or contact maps. That's AlphaFold's territory, and they do it extraordinarily well with billions of dollars and thousands of GPUs behind them.

What Angelika Fold does is different: given a raw amino acid sequence, it computes a single coherence value — Ω (Omega) — that reflects the sequence's intrinsic tendency toward structural stability. If Ω exceeds the golden threshold τ = φ⁻² ≈ 0.382, the protein is classified as stable. Below that, it's flagged as intrinsically disordered or aggregation-prone.

The output is a binary classification with a continuous confidence score. Not a folded structure. Not a ΔG prediction. A stability signal derived from first principles — no training data, no neural networks, no learned parameters.

The Benchmark: 1,000 Proteins, 8 Categories

We built a reproducible 1,000-protein benchmark sourced entirely from UniProt (reviewed/Swiss-Prot entries). The dataset is deliberately adversarial — it wasn't designed to make RCFT look good. It was designed to break it.

CATCOUNTDESCRIPTIONEXPECTED
A150Extremophile & hyperstable (thermophiles, disulfide-rich)STABLE
B150Intrinsically disordered / LLPS (α-synuclein, Tau, FUS, TDP-43)DISORDERED
C150Membrane proteins (GPCRs, channels, transporters)CONTEXT-DEP
D150Amyloid / aggregation-prone (Aβ, prion, IAPP, transthyretin)UNSTABLE
E150Giant multi-domain (titin, dystrophin, BRCA2, mTOR)MIXED
F100Designed / de novo engineered proteinsSTABLE
G100Viral proteins (SARS-CoV-2 spike, HIV gp120, influenza HA)MIXED
H50Hard negative controls (shuffled/reversed from Category A)UNSTABLE

Every sequence is publicly identified by UniProt accession. None of them are proprietary. The dataset includes force-included "curveball" proteins — yeast prion-like sequences in Category B, bacterial beta-barrel OMPs in Category C, disease mutants in Category D, ankyrin/TPR repeats in Category E — specifically chosen because they're hard edge cases that trip up simpler methods.

Category H deserves special attention: these are 50 sequences taken from Category A (known stable proteins), then shuffled, reversed, or window-randomized with a fixed seed. They have identical amino acid composition to real stable proteins but destroyed sequence order. If RCFT is just measuring composition, it would classify these as stable too. That's the test.

Where We Stand — Honestly

Here's the part where most pitch decks would show you a cherry-picked accuracy number and move on. We're not going to do that.

The RCFT engine consistently assigns higher Ω values to known stable proteins (Category A averages Ω ≈ 8.81) and lower values to disordered proteins (Category B averages Ω ≈ 8.70) and amyloid-prone proteins (Category D averages Ω ≈ 8.38). The ordering is correct — the system sees a real signal. Category D (amyloid) consistently scores lowest, which is exactly what biophysics would predict.

But we'll be the first to say: the current threshold calibration needs refinement. The absolute Ω values from the benchmark pipeline are all above the base threshold, which means the binary classifier isn't yet cleanly separating stable from disordered at the current cutoff. The ranking is meaningful — the threshold needs tuning. This is an active area of development, not a solved problem we're hiding behind marketing language.

What we can say with confidence: the system detects sequence-order-dependent coherence patterns that correlate with known stability classes. Shuffled controls (Category H) produce different Ω distributions than their parent sequences. The signal is real. The calibration is ongoing.

Metrics, Baselines, and What 'Accuracy' Means Here

We're measuring stability classification accuracy — not RMSD, not TM-score, not GDT_TS. Those are structure prediction metrics, and we're not predicting structures. Our metric is binary: does the system correctly classify a protein as stable or disordered/aggregation-prone?

The benchmark pipeline computes ROC/AUC using Category A (expected stable) as positives and Categories B+D (expected unstable) as negatives. When the Ω values are used as a continuous score rather than a binary threshold, the ranking performance is meaningful — amyloid-prone proteins consistently score lower than hyperstable ones.

As for baselines: the most trivial predictor would be "classify everything as stable" (which would get Category A right and everything else wrong) or a composition-based predictor (which would fail on Category H controls). RCFT's advantage is that it's sequence-order-sensitive — it doesn't just count amino acids, it processes their arrangement through a coherence field. That's what makes the shuffled controls a meaningful test.

We have not yet submitted to CASP. That's a deliberate choice — CASP evaluates structure prediction, and we're not claiming to predict structures. A more appropriate benchmark would be against experimental ΔG databases or disorder prediction competitions (like CAID). That comparison is planned.

How It Works — The Parts We Can Share

The general architecture is no secret: each amino acid is encoded into a multi-dimensional property vector (hydrophobicity, charge, size, flexibility, aromaticity). A sliding window scans the sequence, feeding these vectors into the RCFT engine, which evolves an 11-dimensional state through recursive compression dynamics. The coherence value Ω emerges from this evolution.

The Harmonic Catalyst (H) modulates the threshold based on golden-ratio frequency alignment — sequences whose internal periodicity resonates with φ-based harmonics get a slight threshold adjustment. This captures something real about protein secondary structure periodicity (α-helices repeat every ~3.6 residues, which is close to a φ-harmonic).

What we're not going to share here is the specific field evolution equations, the compression operators, or the exact encoding weights. Those are the subject of a provisional patent filed March 1, 2026, and they represent the core intellectual property of this system. If you're a researcher interested in collaboration or an investor interested in the details, that conversation happens under NDA.

Runtime & Scaling

Angelika Fold runs on a single CPU core. No GPU. No cloud compute. No training phase. A typical 200-residue protein processes in under a second on commodity hardware. The C++ core engine handles the heavy computation; Python bindings provide the interface.

Runtime scales linearly with sequence length — O(n) where n is the number of residues. The 1,000-protein benchmark (including proteins up to 35,000 residues like titin) completes in minutes, not hours. This matters because if you want to screen millions of sequences, you need something faster than a neural network inference pass.

Determinism & Reproducibility

Same sequence in, same Ω out. Every time. No stochastic elements, no random initialization, no dropout. The benchmark uses a fixed random seed (4242) for control generation, and all UniProt queries are sorted by accession for deterministic retrieval.

The benchmark configuration, fetch script, and runner are all in the repository. Anyone with access can reproduce the exact same 1,000-protein dataset and results (subject to UniProt database updates, which we version-lock in the manifest).

Edge Cases, Failure Modes, and What We Don't Claim

Membrane proteins (Category C) are genuinely hard. Their stability is context-dependent — a transmembrane helix is "stable" in a lipid bilayer but "unstable" in aqueous solution. RCFT currently treats all sequences in the same context, which means membrane proteins are an acknowledged limitation. We're exploring environment-dependent threshold modulation, but it's not implemented yet.

Very short peptides (under ~30 residues) don't give the sliding window enough signal to produce reliable Ω values. Very long multi-domain proteins (Category E) produce a single global Ω that may mask domain-level instability. Per-domain analysis is a planned feature.

Non-standard amino acids and post-translational modifications are not currently handled — the encoder maps the 20 canonical amino acids. Selenocysteine, pyrrolysine, and modified residues are stripped or ignored. Multi-chain complexes are processed as individual chains.

We also don't claim to predict mutation effects with single-residue resolution — yet. The framework could theoretically compute ΔΩ for point mutations, but we haven't validated that against experimental ΔΔG data. Claiming it works without that validation would be irresponsible.

Why This Should Work — The Physical Intuition

The underlying premise is that protein stability is not random — it's a consequence of sequence-encoded coherence. Stable proteins have amino acid arrangements that produce self-reinforcing interaction patterns. Disordered proteins don't. This isn't controversial — it's essentially what the hydrophobic core model, secondary structure propensities, and contact order all describe from different angles.

RCFT's contribution is a unified mathematical framework for measuring this coherence. Instead of separate predictors for hydrophobicity, charge distribution, and secondary structure propensity, RCFT processes all of these simultaneously through a single field evolution. The golden ratio enters because φ-based compression is mathematically optimal for preserving information under recursive transformation — and protein folding is, at its core, a recursive compression of a 1D sequence into a 3D structure.

Is this proven? No. It's a hypothesis with promising early results and a rigorous mathematical foundation. The connection between φ-optimal compression and biological stability is the core claim that needs further validation. We believe it's real. We're building the evidence. We're not pretending the evidence is already complete.

Experimental Validation — The Road Ahead

Angelika Fold has not yet been tested against newly determined experimental structures or wet-lab stability measurements (melting temperatures, ΔG from calorimetry, etc.). That's the next milestone, and it's the one that matters most.

Planned validation targets include: correlation with ProTherm experimental ΔG values, comparison against the CAID disorder prediction benchmark, blind testing on proteins deposited in PDB after our benchmark was locked, and collaboration with experimental labs for prospective validation on de novo designed proteins.

This is where we need partners. An independent researcher, a university lab, or a pharmaceutical company willing to run Angelika Fold predictions against their internal experimental stability data — under NDA, with proper controls — would produce the kind of evidence that moves this from "interesting mathematical framework" to "validated tool." That's the collaboration we're actively seeking.

The Bottom Line

Angelika Fold is a working system with a novel mathematical foundation, a reproducible benchmark, and honest limitations. It's not AlphaFold — it doesn't try to be. It's a fundamentally different approach to a related problem: can you determine protein stability from sequence alone, without training data, without GPUs, and without billions of parameters?

The early signal says yes. The threshold calibration says we have more work to do. The mathematical framework says the approach is sound. The experimental validation says we need collaborators.

Named in memory of Angelika Marx — because the best science is built on love, not just logic.

05

Applications

RCFT is not a single-purpose tool. The coherence framework applies wherever systems must remain stable under transformation.

Twin Primes Conjecture
NUMBER THEORY

Twin Primes Conjecture

PROTOTYPE

Primes reframed as resonance peaks in a φ-weighted coherence field C(n). Twin primes are not exceptional gaps — they are the natural resonance spacing of the golden field. A field-theoretic reformulation that may be more tractable than classical sieve methods.

Cold Fusion Computation
P VS NP

Cold Fusion Computation

PROTOTYPE

NP-hard problems reframed as high-entropy computational states. Solution-finding becomes coherence-triggered entropy collapse. Identifies a subclass of NP problems where coherence structure enables polynomial-time solutions.

Distributed Mesh Intelligence
KID SYSTEM

Distributed Mesh Intelligence

COMPLETE

Trillion-node mesh architecture with real-time consensus validation, φ² threshold enforcement, complete audit trails, and ELM ethical blocking. Every operation mathematically validated, every decision traceable.

Ethical Lattice Matrix
AI SAFETY

Ethical Lattice Matrix

COMPLETE

Ethics as quantum Hamiltonian dynamics. An 11×11 Hermitian matrix where eigenvalues above φ⁻² correspond to stable ethical states and eigenvalues below φ⁻³ trigger veto conditions. Ethics becomes a physical constraint, not a lookup table.

06

Implementation Status

Working code across Python, Rust, C++, and eBPF. This is not a theoretical proposal — it is a running system.

Component Registry
COMPONENTLANGUAGESTATUSOUTPUT
QDAM Mesh NodeRustCOMPLETEmesh_node.rs
LIQUID ValidatorRust (PyO3)COMPLETEliquid_validator.so
SOLID CoreC++COMPLETEsolid_core.so
GAS OrchestrationPythonCOMPLETEbrent.py
eBPF Kernel MonitorC/eBPFCOMPLETEkid_ebpf/
Prime Coherence FieldPython/RustPROTOTYPErcft_core.py
ELM HamiltonianPythonCOMPLETEethical_tensor.py
Cold Fusion SolverRustPROTOTYPEcold_fusion_kernel.rs
Angelika FoldC++/PythonCOMPLETEAngelikaFold.cpp
07

Contact

Independent research by Eric Lynn Marx. Self-funded. No institutional affiliation.

Researcher
NAMEEric Lynn Marx
CITIZENSHIPUS / German Dual
RESEARCH ORIGINJune 2023 — Present
Legal Status
RCFT PATENTProvisional — Filed February 24, 2026
ANGELIKA FOLD PATENTProvisional — Filed March 1, 2026
IP STATUSALL RIGHTS RESERVED

All frameworks, algorithms, and implementations described on this site are original intellectual property of Eric Lynn Marx. Unauthorized reproduction, distribution, or derivative use is prohibited.