Skip to main content

Geometric Flow Networks: A Physics-Informed Paradigm for Sequential Intelligence

Project description

GFN: Geometric Flow Networks

A Physics-Informed Paradigm for Sequential Intelligence

Framework: GFN Models: Hugging Face DOI: 10.5281/zenodo.19141133 Status: Active

"Intelligence is not statistical correlation; it is the continuous evolution of a persistent world-state governed by physical invariants."

Geometric Flow Networks (GFN) represents a fundamental shift in neural architecture. Instead of treating computation as token-to-token correlation (Attention), GFN treats it as a trajectory within a high-integrity dynamical system where inputs act as external perturbations that drive state evolution according to structural invariants.


The GFN Paradigm

The GFN paradigm (Stürtz, 2026) formalizes reasoning as structural flow. In this framework, inputs act as external perturbations $\mathbf{f}_{ext}$ that drive a persistent state toward a configuration satisfying global conservation laws.


The Five Pillars of GFN

For an architecture to be considered a valid GFN realization, it must satisfy all five pillars:

Pillar 1: Persistent Internal World

The system must maintain a simulator, not a memory buffer. The state evolves through the space, not merely accumulates inputs.

INVALID (Transformer with KV-cache):     Token → Correlation → Token (with memory buffer)
GFN (Valid):                             Token → Perturbation → World State Evolution

The KV-cache is a "memory crutch" - if you cut the cache, the Transformer forgets everything.
The GFN world-state is the geometry itself. Memory is intrinsic to the curvature, not an external buffer.

Pillar 2: At Least One Invariant

The system must encode at least one physical/mathematical invariant that acts as the "gravity" of the model. This prevents the internal world from becoming a latent hallucination.

Examples of valid invariants:

  • Casimir Operators: Commute with all generators of a Lie algebra
  • Hamiltonian Conservation: Total energy preserved through symplectic integration
  • Norm Preservation: State norm remains bounded
  • Group Symmetries: Topological constraints that make invalid states geometrically impossible
  • Phase Space Volume: Liouville's theorem preservation
WITHOUT INVARIANTS:  "A map without a compass. Without invariants, the world-state is a latent hallucination."
WITH INVARIANTS:     "The laws of gravity in your model. They prevent the internal world from disintegrating."

Pillar 3: Structural Integrity

The state cannot collapse to zero or explode to infinity. The invariant guarantees that informational "volume" remains constant.

This resolves the gradient problem intrinsically:

  • No gradient vanishing (singular values = 1)
  • No gradient explosion (volume preserved)
  • The system is stable by geometry, not by patching

Pillar 4: Temporal Locality (For True O(1))

Requirement: The computational cost of updating the state must be independent of how many tokens came before.

VALID:   state_update = f(current_state, present_input)  # O(1) per step
INVALID: state_update = f(current_state, all_previous_tokens)  # O(N) - breaks O(1) promise

"The flow is calculated over the current state and present input, nothing more."

If an architecture's forward pass loops over history, it breaks the O(1) promise.

Pillar 5: Geometric Differentiability (For Metric Coherence)

Requirement: All states must exist in a manifold where "distance" is physically coherent. This defines how "forces" and "flows" operate.

For there to be "forces" and "flows", you need to know how far one concept is from another in that curved space.

Rule: "Every state must exist in a variety where the notion of 'distance' is physically coherent."

The GFN Definition

A Geometric Flow Network (GFN) is a neural architecture satisfying all five pillars above:

  1. Persistent Internal World (Simulator, not buffer)
  2. At Least One Physical/Mathematical Invariant
  3. Structural Integrity (gradient stability by geometry)
  4. Temporal Locality (O(1) state update)
  5. Geometric Differentiability (metric coherence)

Formal Definition

$$ \mathbf{W}_{t+1} = \mathcal{T}(\mathbf{W}t, \mathbf{f}{ext}; \theta) $$

Where:

  • $\mathbf{W}_t$ is the internal world state at time $t$
  • $\mathbf{f}_{ext}$ is the external input (perturbation)
  • $\mathcal{T}$ is a transfer operator that:
    • Preserves at least one invariant
    • Operates on $\mathbf{W}t$ and $\mathbf{f}{ext}$ ONLY (no history)
    • Is differentiable with respect to a coherent metric

Why Geometric Flow Networks?

Comparison to Related Approaches

Architecture Persistent World Invariant Integrity O(1) Update Metric
Transformer + KV-cache ❌ (buffer)
Mamba/SSM
World-State Networks
GFN

Key Distinctions

GFN vs Transformer:

  • Transformer: "Guesses" by statistics
  • GFN: "Orbits" solutions because geometric structure doesn't allow stepping outside physics

GFN vs SSM:

  • SSM: "Radio signal" - state can collapse or explode
  • GFN: "River flow" - state orbits around physically coherent solutions

GFN vs World-State Networks:

  • World-state without invariants: "Photo on a post-it" - blurry, degrades over time
  • GFN: "Full simulator" - the world exists as geometry, not memory

Latent Planning Capability

A critical consequence of the five pillars:

GFN can "predict" the future without generating token by token, simply by moving the state vector through the geometric flow.

The internal world enables latent planning:

  • Future states can be computed by flowing through the manifold
  • No need to autoregressively generate each token to "see" what comes next
  • The geometry of the world encodes causal structure

Complexity Characteristics

GFN is a paradigm with five mandatory requirements. Complexity characteristics depend on implementation:

Requirement Complexity Impact
Temporal Locality (Pillar 4) Enables O(1) inference memory
Structural Integrity (Pillar 3) Intrinsic gradient stability
All Pillars Combined No KV-cache, no O(N²) attention

Paradigm Documentation

For detailed theoretical foundations and mathematical formalism, see:

Citation

@article{sturtz2026geometry,
  title={Geometric Flow Networks: A Physics-Informed Paradigm for Sequential Intelligence},
  author={Stürtz, Joaquín},
  journal={Zenodo Preprints},
  year={2026},
  doi={10.5281/zenodo.19141133},
  url={https://doi.org/10.5281/zenodo.19141133}
}

License

This project is proprietary to DepthMuun Research. See the LICENSE file for details.

Author: Joaquín Stürtz, DepthMuun Research
Version: 2.7.1
Date: March 2026

Project details


Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Source Distribution

gfn-2.7.1.tar.gz (143.6 kB view details)

Uploaded Source

Built Distribution

If you're not sure about the file name format, learn more about wheel file names.

gfn-2.7.1-py3-none-any.whl (209.8 kB view details)

Uploaded Python 3

File details

Details for the file gfn-2.7.1.tar.gz.

File metadata

  • Download URL: gfn-2.7.1.tar.gz
  • Upload date:
  • Size: 143.6 kB
  • Tags: Source
  • Uploaded using Trusted Publishing? No
  • Uploaded via: twine/6.2.0 CPython/3.13.3

File hashes

Hashes for gfn-2.7.1.tar.gz
Algorithm Hash digest
SHA256 218f3713990ad99b05c93f9e86042b3b0f739611c883fb39d02898bb9890437f
MD5 560cd52ea4d0ffa465d36a7ed37fa698
BLAKE2b-256 3306607e9cba3f4056b3e51f2d7822c9d673344f6c0a040822734f8226e8a783

See more details on using hashes here.

File details

Details for the file gfn-2.7.1-py3-none-any.whl.

File metadata

  • Download URL: gfn-2.7.1-py3-none-any.whl
  • Upload date:
  • Size: 209.8 kB
  • Tags: Python 3
  • Uploaded using Trusted Publishing? No
  • Uploaded via: twine/6.2.0 CPython/3.13.3

File hashes

Hashes for gfn-2.7.1-py3-none-any.whl
Algorithm Hash digest
SHA256 dd5ef6a0bcbf862a70369c762ec74d14886ba61264d753142caefe9033334d47
MD5 9beb50c235787b76dd88a5786e185e53
BLAKE2b-256 a2b892598d662c0b41b92d85447f885d36552e666a1e95f5e13f485226b613a7

See more details on using hashes here.

Supported by

AWS Cloud computing and Security Sponsor Datadog Monitoring Depot Continuous Integration Fastly CDN Google Download Analytics Pingdom Monitoring Sentry Error logging StatusPage Status page