<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns="http://purl.org/rss/1.0/" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel rdf:about="https://community.wolfram.com">
    <title>Community RSS Feed</title>
    <link>https://community.wolfram.com</link>
    <description>RSS Feed for Wolfram Community showing any discussions tagged with Wolfram Fundamental Physics Project sorted by active.</description>
    <items>
      <rdf:Seq>
        <rdf:li rdf:resource="https://community.wolfram.com/groups/-/m/t/3773775" />
        <rdf:li rdf:resource="https://community.wolfram.com/groups/-/m/t/3761646" />
        <rdf:li rdf:resource="https://community.wolfram.com/groups/-/m/t/3763367" />
        <rdf:li rdf:resource="https://community.wolfram.com/groups/-/m/t/3763652" />
        <rdf:li rdf:resource="https://community.wolfram.com/groups/-/m/t/3762980" />
        <rdf:li rdf:resource="https://community.wolfram.com/groups/-/m/t/3761847" />
        <rdf:li rdf:resource="https://community.wolfram.com/groups/-/m/t/3636637" />
        <rdf:li rdf:resource="https://community.wolfram.com/groups/-/m/t/3732396" />
        <rdf:li rdf:resource="https://community.wolfram.com/groups/-/m/t/3733334" />
        <rdf:li rdf:resource="https://community.wolfram.com/groups/-/m/t/2965206" />
        <rdf:li rdf:resource="https://community.wolfram.com/groups/-/m/t/3691199" />
        <rdf:li rdf:resource="https://community.wolfram.com/groups/-/m/t/3682254" />
        <rdf:li rdf:resource="https://community.wolfram.com/groups/-/m/t/3674343" />
        <rdf:li rdf:resource="https://community.wolfram.com/groups/-/m/t/2759491" />
        <rdf:li rdf:resource="https://community.wolfram.com/groups/-/m/t/3663446" />
        <rdf:li rdf:resource="https://community.wolfram.com/groups/-/m/t/3642808" />
        <rdf:li rdf:resource="https://community.wolfram.com/groups/-/m/t/3631121" />
        <rdf:li rdf:resource="https://community.wolfram.com/groups/-/m/t/3589391" />
        <rdf:li rdf:resource="https://community.wolfram.com/groups/-/m/t/3608412" />
        <rdf:li rdf:resource="https://community.wolfram.com/groups/-/m/t/3607969" />
      </rdf:Seq>
    </items>
  </channel>
  <item rdf:about="https://community.wolfram.com/groups/-/m/t/3773775">
    <title>The Ruliad as unlabelled NAND graphs &amp;amp; timeless loops</title>
    <link>https://community.wolfram.com/groups/-/m/t/3773775</link>
    <description>The Ruliad&amp;#x2014;the entangled limit of all computation&amp;#x2014;can be constructed with universal computation using nothing but **pure, unlabelled 2D graphs** and a single primitive: the **NAND gate**.&#xD;
&#xD;
### 1. Empty Vertices as Pure Relations&#xD;
&#xD;
Instead of labeled NAND input and output variables, the vertices are empty identifiers. Values are encoded purely as topological degree (leaf counts):&#xD;
&#xD;
* **Bit 0:** 1 attached leaf&#xD;
* **Bit 1:** 2 attached leaves&#xD;
&#xD;
For example, $1 \text{ NAND } 1 = 0$ is mapped directly to a simple directed graph:&#xD;
&#xD;
```text&#xD;
Graph[{1-&amp;gt;3, 2-&amp;gt;3, 3-&amp;gt;4, 1-&amp;gt;5, 1-&amp;gt;6, 2-&amp;gt;7, 2-&amp;gt;8, 4-&amp;gt;9}]&#xD;
&#xD;
```&#xD;
&#xD;
* **Inputs (1 &amp;amp; 2):** Each has 2 leaves attached $\to$ **Bit 1**&#xD;
* **Hub (3):** Processes incoming edges to output node (4)&#xD;
* **Output (4):** Has 1 leaf attached $\to$ **Bit 0**&#xD;
&#xD;
### 2. Timeless Computation &amp;amp; Infinite Unrolling&#xD;
&#xD;
In this framework, execution doesn&amp;#039;t happen &amp;#034;over time.&amp;#034; Iterative programs and infinite loops are **unrolled spatially** into infinite acyclic subgraphs:&#xD;
&#xD;
* Time becomes graph depth.&#xD;
* A loop isn&amp;#039;t a state repeating in time&amp;#x2014;it is an endless forward path through the net.&#xD;
* The entire execution history exists simultaneously as a static, geometric feature (a Block Universe).&#xD;
&#xD;
### 3. The Whole Ruliad&#xD;
&#xD;
Because NAND is functionally complete, a network of unlabelled NAND graphs can express any Turing machine or computational state. Unrolling all possible NAND configurations yields the complete Ruliad&amp;#x2014;achieving full computational universality on the simplest possible topological substrate.</description>
    <dc:creator>Anders Lindman</dc:creator>
    <dc:date>2026-08-05T12:53:04Z</dc:date>
  </item>
  <item rdf:about="https://community.wolfram.com/groups/-/m/t/3761646">
    <title>[WSRI26] Classifying Defects in Cellular Automata</title>
    <link>https://community.wolfram.com/groups/-/m/t/3761646</link>
    <description>![Classifying Defects in Cellular Automata][1]&#xD;
&#xD;
&amp;amp;[Wolfram Notebook][2]&#xD;
&#xD;
&#xD;
  [1]: https://community.wolfram.com//c/portal/getImageAttachment?filename=Presentation1.png&amp;amp;userId=20103&#xD;
  [2]: https://www.wolframcloud.com/obj/2c03701a-b59b-4418-bd06-47cbf267d6c9</description>
    <dc:creator>Myrto Terpsiadou</dc:creator>
    <dc:date>2026-07-16T15:00:13Z</dc:date>
  </item>
  <item rdf:about="https://community.wolfram.com/groups/-/m/t/3763367">
    <title>[WSRI26] HyperVacuum: A Dimension-Agnostic Hypergraph Lattice Model of the Quantum Vacuum</title>
    <link>https://community.wolfram.com/groups/-/m/t/3763367</link>
    <description>![HyperVacuum: A Dimension-Agnostic Hypergraph Lattice Model of the Quantum Vacuum][1]&#xD;
&#xD;
&amp;amp;[Wolfram Notebook][2]&#xD;
&#xD;
&#xD;
  [1]: https://community.wolfram.com//c/portal/getImageAttachment?filename=post.png&amp;amp;userId=3759777&#xD;
  [2]: https://www.wolframcloud.com/obj/8d235032-1a33-4170-b616-70cbad15f0aa</description>
    <dc:creator>Federico Selleri</dc:creator>
    <dc:date>2026-07-17T07:17:01Z</dc:date>
  </item>
  <item rdf:about="https://community.wolfram.com/groups/-/m/t/3763652">
    <title>[WSRI26] Structure-Adaptive Evolutionary Framework for Navigating the Rule-space of Hypergraphs</title>
    <link>https://community.wolfram.com/groups/-/m/t/3763652</link>
    <description>![Structure-Adaptive Evolutionary Framework for Navigating the Rule-space of Hypergraphs][1]&#xD;
&#xD;
&amp;amp;[Wolfram Notebook][2]&#xD;
&#xD;
&#xD;
  [1]: https://community.wolfram.com//c/portal/getImageAttachment?filename=poster_picture.png&amp;amp;userId=3760479&#xD;
  [2]: https://www.wolframcloud.com/obj/1804b84e-d758-47ed-ac93-51c89d7f4b4a</description>
    <dc:creator>Samuel Frerichs</dc:creator>
    <dc:date>2026-07-17T15:15:04Z</dc:date>
  </item>
  <item rdf:about="https://community.wolfram.com/groups/-/m/t/3762980">
    <title>[WSRI26] Self-Replication in Rewriting Systems</title>
    <link>https://community.wolfram.com/groups/-/m/t/3762980</link>
    <description>![Self-Replication in Rewriting Systems][1]&#xD;
&#xD;
&amp;amp;[Wolfram Notebook][2]&#xD;
&#xD;
&#xD;
  [1]: https://community.wolfram.com//c/portal/getImageAttachment?filename=SelfRepInRewritingSystems_Preview.png&amp;amp;userId=3607526&#xD;
  [2]: https://www.wolframcloud.com/obj/49160842-f976-4067-b604-48dcc01184ce</description>
    <dc:creator>Matheo Tripnaux</dc:creator>
    <dc:date>2026-07-16T23:33:35Z</dc:date>
  </item>
  <item rdf:about="https://community.wolfram.com/groups/-/m/t/3761847">
    <title>[WSRI26] Emergent Continuum Behavior in Reversible Multiway Systems</title>
    <link>https://community.wolfram.com/groups/-/m/t/3761847</link>
    <description>![Emergent Continuum Behavior in Reversible Multiway Systems][1]&#xD;
&#xD;
&amp;amp;[Wolfram Notebook][2]&#xD;
&#xD;
&#xD;
  [1]: https://community.wolfram.com//c/portal/getImageAttachment?filename=actual_multiway_entropy_hero_square.png&amp;amp;userId=3760080&#xD;
  [2]: https://www.wolframcloud.com/obj/69079318-d6cc-4b19-ae8e-6ced6ab28c53</description>
    <dc:creator>Muhammad Awal Tahiru</dc:creator>
    <dc:date>2026-07-16T18:24:10Z</dc:date>
  </item>
  <item rdf:about="https://community.wolfram.com/groups/-/m/t/3636637">
    <title>Gravity and Action from the Evolution of a Complex Manifold</title>
    <link>https://community.wolfram.com/groups/-/m/t/3636637</link>
    <description>&amp;amp;[Wolfram Notebook][1]&#xD;
&#xD;
&#xD;
  [1]: https://www.wolframcloud.com/obj/40f91cb1-021a-4e68-b55a-5249993c389c</description>
    <dc:creator>Donald Airey</dc:creator>
    <dc:date>2026-02-08T20:17:36Z</dc:date>
  </item>
  <item rdf:about="https://community.wolfram.com/groups/-/m/t/3732396">
    <title>Discrete differential geometry on meshes via the cotangent Laplacian</title>
    <link>https://community.wolfram.com/groups/-/m/t/3732396</link>
    <description>![Discrete differential geometry on meshes via the cotangent Laplacian][1]&#xD;
&#xD;
The whole notebook in one image. A triangle mesh has no curvature, no spectrum, no notion of distance &amp;#x2014; none of differential geometry &amp;#x2014; until you build it. The surprise is that a **single sparse matrix, the cotangent Laplacian**, manufactures all of it. Here is the same torus seen four ways through that one operator: its Gaussian **curvature**, its Laplace-Beltrami **vibration modes**, mean-curvature **flow**, and heat-method **geodesic distance**.&#xD;
&#xD;
&amp;amp;[Wolfram Notebook][2]&#xD;
&#xD;
&#xD;
  [1]: https://community.wolfram.com//c/portal/getImageAttachment?filename=Video-bf248396-73e0-42b0-994d-2814b8192166-ezgif.com-optimize.gif&amp;amp;userId=20103&#xD;
  [2]: https://www.wolframcloud.com/obj/200b007e-0739-4903-aea6-d66a604addac</description>
    <dc:creator>Marco Thiel</dc:creator>
    <dc:date>2026-06-12T12:46:06Z</dc:date>
  </item>
  <item rdf:about="https://community.wolfram.com/groups/-/m/t/3733334">
    <title>Colour-decorated hypergraph rewriting: growth to Q102 and the Standard-Model gauge sectors</title>
    <link>https://community.wolfram.com/groups/-/m/t/3733334</link>
    <description>![Q102 Growth][1]&#xD;
&#xD;
Start with a *bare* hypergraph rewriting system in the spirit of the Wolfram Physics Project: featureless atoms, ternary edges, one local rewrite. Now add a single demand: that the system be **closed to efficient causation** in Robert Rosen&amp;#039;s sense, so every producer in the system is itself produced by the system. That one demand is not free. It forces a chain of structure, and what grows out of it is the object in the animation above: a 6-vertex seed that grows, collapses to a 51-class gauge quotient, and doubles under charge conjugation to a 102-vertex object that carries the sign data of a real spectral triple of **KO-dimension 6**.&#xD;
&#xD;
Everything here is exact - Gaussian integers, no floating point, **no random seed** - so the headline count is reproducibly **102**. The full notebook is attached.&#xD;
&#xD;
## What is Rosen closure?&#xD;
&#xD;
Robert Rosen was a theoretical biologist who asked what *minimally* separates an organism from a machine. His answer: a machine is built and maintained from the outside (its blueprint, its factory, its repairman are all external) whereas a living system is **closed to efficient causation**. &amp;#034;Efficient cause,&amp;#034; in Aristotle&amp;#039;s sense, is *the thing that brings something about*; closure means every process that produces or maintains a part of the system is itself produced by some part of the system. The system makes its own makers, and nothing in its organization is entailed from outside. Rosen formalized this as an **(M,R) system** (a metabolism together with repair-and-replication maps that the system must generate itself) and the consequence that matters here is that closure forces a **self-referential fixed point**: the system has to be able to produce its own production rules. That self-reference is the entire engine. A Wolfram model&amp;#039;s rewrite rule is imposed from outside; demanding closure instead turns the rule into something the decorated hypergraph must reproduce *internally* and that single requirement (next section) is what forces three functional roles, ternary edges, and a continuous ℂ³ colour, with essentially no freedom left.&#xD;
&#xD;
This is *deliberately not* a stock `WolframModel`, and that distinction is the whole point. So, let me start there.&#xD;
&#xD;
## Why it isn&amp;#039;t a stock Wolfram model&#xD;
&#xD;
A `WolframModel` rewrites **bare** hypergraphs: atoms are featureless, and rules are pure connectivity patterns. The moment you impose Rosen closure, the bare atoms are *obstructed* out of every featureless option and **forced** to carry a continuous colour. The forcing chain (each link the unique survivor of an obstruction):&#xD;
&#xD;
- closure needs exactly three functional roles → edges are **ternary** (arity 3);&#xD;
- **no discrete labelling** can satisfy closure → every finite decoration is exhaustively obstructed (all 256 binary rules fail; ℤ₂, ℤ₃, …, ℤ₈ all fail);&#xD;
- the only continuous composition that closes is a **cross product on a 3-vector** (Hurwitz);&#xD;
- and the field must be **ℂ, not ℝ** → the self-referential edge needs an isotropic unit vector (`v·v = 0`), which ℝ³ has none of and ℂ³ does, e.g. `(1, i, 0)/√2`.&#xD;
&#xD;
So the colour isn&amp;#039;t an attribute bolted onto a Wolfram model, it&amp;#039;s **what closure does to one**. Each vertex carries a colour `ψ ∈ ℂ³`, and the composition rule is forced to be:&#xD;
&#xD;
    compose[a_, b_] := Conjugate[Cross[a, b]]   (* conj(a × b), exact, unnormalised *)&#xD;
&#xD;
(the conjugation is what keeps it SU(3)-equivariant). The gauge quotient identifies vertices whose colour vectors are linearly dependent over ℂ exactly, with no threshold:&#xD;
&#xD;
    rayEquivQ[a_, b_] := AllTrue[Cross[a, b], # == 0 &amp;amp;]   (* a ~ b  ⇔  a × b = 0 *)&#xD;
&#xD;
Putting a colour on the atoms makes this a *decorated* (attributed) hypergraph rewriting system (close in spirit to **@Ray Aschheim**&amp;#039;s color spin networks, but here the colour, the dimension 3, the cross product, and the conjugation are all *forced*, not posited).&#xD;
&#xD;
## Exactness matters: 98 vs 102&#xD;
&#xD;
Because the quotient is by exact ray-equivalence over ℤ[i], the construction is fully deterministic and reproducible. This is not a cosmetic choice: a Float64 fidelity-threshold version of the same construction **merges four genuinely-distinct rays** and reports 98 instead of 102. Exact Gaussian-integer arithmetic gives 102 every time. (For the related question of detecting equivalence on hypergraphs *approximately*, cf. **@Regen Petu-Stiles**&amp;#039;s work on approximate isomorphism. The contrast between exact and thresholded equivalence is exactly where the 98-vs-102 discrepancy lives).&#xD;
&#xD;
Six canonical Gaussian-integer rays seed the system, on the complete ternary topology K₆³ (all 120 ordered triples of distinct vertices):&#xD;
&#xD;
    icsBase = {{2+I, 1, 3-I}, {1, 2+I, 1-2 I}, {1-I, 3, 2+I},&#xD;
               {3, 1-I, 1+2 I}, {1+2 I, 2-I, 1}, {2, 1+I, 3}};&#xD;
&#xD;
## Growth to Q102&#xD;
&#xD;
The multiway grows; the colour quotient closes almost immediately. Distinct colour-classes per generation: **6 → 21 → 51 → 51 → 51** &amp;#x2014; a fixed point at generation 2.&#xD;
&#xD;
![Distinct Colour-classes vs Generation][2]&#xD;
&#xD;
Side by side: the raw multiway (left, coloured by generation) explodes to 456 vertices, while its exact gauge quotient (right, tier A/B/C) closes at 51.&#xD;
&#xD;
![Frame 2][3]&#xD;
&#xD;
The charge-conjugation closure then doubles it. Growing the conjugate multiway from the conjugated initial colours and re-quotienting together gives **Q102 = Q51 ∪ C(Q51) = 102 vertices = 51 orig + 51 conj** (zero self-conjugate):&#xD;
&#xD;
![Closure][4]&#xD;
&#xD;
## KO-dimension 6&#xD;
&#xD;
The involution `J` that swaps the two halves is a fixed-point-free permutation with `J² = +I`, and it **anticommutes** with the orig/conj grading `γ` (so `{J, γ} = 0`). Those are exactly the sign data of a real spectral triple of **KO-dimension 6**. Thi is the same KO-dimension the Standard Model&amp;#039;s internal space carries in Connes&amp;#039; noncommutative geometry. The notebook checks it directly:&#xD;
&#xD;
![KO][5]&#xD;
&#xD;
## The multiway as a derivation graph&#xD;
&#xD;
Every non-seed vertex is produced by composing two parents, so each edge runs from an earlier generation to a later one. Drawn as concentric rings (one per generation), the multiway becomes a derivation graph: 6 seeds at the centre generating a ring of 15, then a ring of 30 and closing at 51.&#xD;
&#xD;
![DAG Class][6]&#xD;
&#xD;
The full raw multiway (all 456 vertices over five generations) as a derivation mandala (vertices coloured by generation):&#xD;
&#xD;
![Raw Multiway][7]&#xD;
&#xD;
## All the gauge sectors on one hypergraph&#xD;
&#xD;
The colour sector gives SU(3). But the full gauge group `[SU(3) × SU(2) × U(1)_Y] × SU(3)_gen` is the **automorphism group of the decoration functor** &amp;#x2014; derived from closure on the possibilistic layer, not from the NCG bridge (the spectral triple handles anomaly cancellation, not the group). The other sectors ride on the *same* hypergraph as extra fibres; the colour quotient is unchanged:&#xD;
&#xD;
- **SU(2)_weak** &amp;#x2014; a doublet `w ∈ ℂ²` rotated by an SU(2) element built from the colour cross-product. The weak sector is literally *driven by* colour (it&amp;#039;s the stabilizer of the colour output direction). This is the one float layer.&#xD;
- **U(1)_Y** &amp;#x2014; the residual phase of the weak doublet; not a separate layer.&#xD;
- **SU(3)_gen** &amp;#x2014; a generation amplitude `g ∈ ℤ[i]³` composing exactly like colour, so its own ray-quotient is a *second, independent* Q51: a decoupled family symmetry.&#xD;
- **ℤ₂ spinor** &amp;#x2014; a sign `ε` per vertex, the product of its three source signs (the chirality double-cover).&#xD;
&#xD;
![Sectors][8]&#xD;
&#xD;
Three sectors as fibres on the identical colour-quotient Q51, plus generation as its own parallel quotient. (Unlike exceptional-group &amp;#034;theory of everything&amp;#034; embeddings [cf. **@J Gregory Moxness**&amp;#039;s H₄/E₈ work] here the gauge group is *derived by obstruction*, not embedded in a larger group.)&#xD;
&#xD;
&#xD;
##A few things to keep straight:&#xD;
&#xD;
- This is an **independent research program** (&amp;#034;Closure Forces Structure&amp;#034;), adjacent to the official Wolfram Physics Project. The shared substrate is hypergraph rewriting; the extra ingredient is Rosen closure.&#xD;
- The notebook **reproducibly verifies the structural facts** (51, 102, the KO-dimension-6 signs, the four gauge-sector decorations). The *forcing arguments* (discrete obstruction, Hurwitz, isotropy, the gauge-group derivation) are theorems in the accompanying paper, not claims the notebook proves by itself.&#xD;
- One layer, the weak doublet, is **float** (an SU(2) rotation with `cos θ`, `sin θ` from `θ = Arg⟨ψ₁|ψ₂⟩`); everything else is exact Gaussian-integer arithmetic.&#xD;
- The object is studied by **observation** (slicing and characterizing the static multiway and its quotients) not by instantiating it as a running dynamical system.&#xD;
&#xD;
## Run it yourself&#xD;
&#xD;
The attached notebook is self-contained and evaluates top to bottom (≈ a minute; the 456-vertex layout is the slow step). It prints a verification table you can check against the numbers above, then draws every figure in this post including an interactive generation slider:&#xD;
&#xD;
    Manipulate[frameAt[G], {{G, 4, &amp;#034;generation&amp;#034;}, 0, 4, 1}]&#xD;
&#xD;
To export the animation:&#xD;
&#xD;
    Export[&amp;#034;q102_growth.gif&amp;#034;, Append[growthFrames, closurePanel], &amp;#034;DisplayDurations&amp;#034; -&amp;gt; 1.2]&#xD;
&#xD;
Comments, criticism, and especially attempts to break it are welcome.&#xD;
&#xD;
&amp;amp;[CFS Notebook][9]&#xD;
&#xD;
---&#xD;
&#xD;
##References / related Community posts:*&#xD;
- *Original Reference: Aaron Green (2026). Closure Forces Structure: Rosen Closure and the Standard-Model Algebra. Researchers.One. [https://researchers.one/articles/26.02.00001v7][10]*&#xD;
- *@Ray Aschheim &amp;#x2014; [WSS21] Color spin networks &amp;#x2014; https://community.wolfram.com/groups/-/m/t/2311732*&#xD;
- *@Regen Petu-Stiles &amp;#x2014; [WSS22] Identifying homogeneity in hypergraphs via approximate isomorphism &amp;#x2014; https://community.wolfram.com/groups/-/m/t/2445699*&#xD;
- *@J Gregory Moxness &amp;#x2014; The Isomorphism of H₄ and E₈ &amp;#x2014; https://community.wolfram.com/groups/-/m/t/3073391*&#xD;
&#xD;
##AI Usage&#xD;
Claude Opus 4.8 (Anthropic) assisted in the drafting of Wolfram code and generation of figures and text used in this post.&#xD;
&#xD;
  [1]: https://community.wolfram.com//c/portal/getImageAttachment?filename=q102_growth.gif&amp;amp;userId=3733286&#xD;
  [2]: https://community.wolfram.com//c/portal/getImageAttachment?filename=fig_curve.png&amp;amp;userId=3733286&#xD;
  [3]: https://community.wolfram.com//c/portal/getImageAttachment?filename=fig_frame2.png&amp;amp;userId=3733286&#xD;
  [4]: https://community.wolfram.com//c/portal/getImageAttachment?filename=fig_closure.png&amp;amp;userId=3733286&#xD;
  [5]: https://community.wolfram.com//c/portal/getImageAttachment?filename=fig_ko.png&amp;amp;userId=3733286&#xD;
  [6]: https://community.wolfram.com//c/portal/getImageAttachment?filename=fig_dag_class.png&amp;amp;userId=3733286&#xD;
  [7]: https://community.wolfram.com//c/portal/getImageAttachment?filename=fig_dag_raw.png&amp;amp;userId=3733286&#xD;
  [8]: https://community.wolfram.com//c/portal/getImageAttachment?filename=fig_sectors.png&amp;amp;userId=3733286&#xD;
  [9]: https://www.wolframcloud.com/obj/11f014a0-6090-45bb-994d-68402d1aa461&#xD;
  [10]: https://researchers.one/articles/26.02.00001v7</description>
    <dc:creator>Aaron Green</dc:creator>
    <dc:date>2026-06-14T07:06:23Z</dc:date>
  </item>
  <item rdf:about="https://community.wolfram.com/groups/-/m/t/2965206">
    <title>[WSRP23] On the mergers of numerical multiway systems</title>
    <link>https://community.wolfram.com/groups/-/m/t/2965206</link>
    <description>![Multiway graph][1]&#xD;
&#xD;
&amp;amp;[Wolfram Notebook][2]&#xD;
&#xD;
&#xD;
  [1]: https://community.wolfram.com//c/portal/getImageAttachment?filename=Untitled.png&amp;amp;userId=2964459&#xD;
  [2]: https://www.wolframcloud.com/obj/b6ad5a15-e8d2-4359-ae89-b72d3e3d06d4</description>
    <dc:creator>Eric Archerman</dc:creator>
    <dc:date>2023-07-13T23:11:59Z</dc:date>
  </item>
  <item rdf:about="https://community.wolfram.com/groups/-/m/t/3691199">
    <title>New graph-first working paper: Compact Gauge Defects + Local Causal Shells</title>
    <link>https://community.wolfram.com/groups/-/m/t/3691199</link>
    <description>Hi everyone in the Wolfram Physics / Fundamental Physics Project community,&#xD;
I’ve just finished a 29-page cumulative working document that takes a strictly graph-first approach to electromagnetism, charge, chirality, and family replication. The core is built on a finite oriented graph with compact U(1) links  &amp;#x2014; very much in the spirit of causal graphs and hypergraph models.&#xD;
Quick summary of what’s in the paper:&#xD;
&#xD;
Charge is literally an integer-valued flux-divergence defect on the graph. Exact regional Gauss law, topological quantization from link compactness, exact lattice continuity, Coulomb law from graph-Laplacian minimization, and full Maxwell dynamics emerging in the aligned deconfined phase &amp;#x2014; all proved cleanly.&#xD;
A common topological language (cellular gauge data + relative current classes + twisted Spinc index theory) unifies charge, chirality, and three-family replication.&#xD;
Explicit finite toy model: product graph $  G = \Lambda_4 \times I_s \times T^2_F  $ with domain-wall/overlap fermions and internal flux index 3 gives minimal charge + chirality + three replicated families from one parent generation.&#xD;
Preferred strong ontology (the part I’m most excited about): charged particles are reinterpreted as self-bound local causal shells. A charged lepton is a trapped spinor core coupled to a bosonic shell-deformation sector on a closed 2D simplicial surface. The minimal regular shell is naturally tetrahedral; the leading deformation multiplet is a geometric triplet whose microscopic anisotropy + holonomy collapse to a single-vector operator that automatically produces the exact cosine spectrum used in Koide-type charged-lepton relations. Strong coefficient locking and a codimension-one dynamical balance surface emerge from identical-link tetrahedral geometry and radial-wall tension.&#xD;
&#xD;
The paper is deliberately layered: theorems vs. constructions vs. strong-but-incomplete branches vs. ruled-out ideas. It overlaps structurally with tetrahedral A₄ flavor models but supplies a concrete geometric engine inside the shell rather than abstract flavons.&#xD;
Full PDF (master_working_document_v8.pdf) is attached.&#xD;
Transparency note: I used Grok (xAI) heavily to help me refine the writing, tighten the LaTeX, organize the sections, and make the ideas as clear as possible. The core physics ideas, and ontology are my own &amp;#x2014; but the AI was instrumental for making this possible.&#xD;
I’d love honest feedback from this community, especially on:&#xD;
&#xD;
how the compact-graph U(1) core and causal-shell picture might connect to hypergraph / causal-graph dynamics,&#xD;
any overlaps or tensions with the Wolfram Physics framework,&#xD;
suggestions for next steps or things I should stress/test.&#xD;
&#xD;
Happy to discuss any part of it. Thanks in advance!</description>
    <dc:creator>Aiden Smith</dc:creator>
    <dc:date>2026-04-17T01:09:09Z</dc:date>
  </item>
  <item rdf:about="https://community.wolfram.com/groups/-/m/t/3682254">
    <title>Quantum field theory and the Wolfram model- theoretical framework and introduction</title>
    <link>https://community.wolfram.com/groups/-/m/t/3682254</link>
    <description>![enter image description here][1]&#xD;
&#xD;
&#xD;
&amp;amp;[Wolfram Notebook][2]&#xD;
&#xD;
&#xD;
  [1]: https://community.wolfram.com//c/portal/getImageAttachment?filename=8239hero.png&amp;amp;userId=20103&#xD;
  [2]: https://www.wolframcloud.com/obj/27b9cbf2-47f5-4888-81b8-aa014c78b0c6</description>
    <dc:creator>Myrto Terpsiadou</dc:creator>
    <dc:date>2026-04-11T13:27:03Z</dc:date>
  </item>
  <item rdf:about="https://community.wolfram.com/groups/-/m/t/3674343">
    <title>Unexpected behavior of &amp;#034;CausalGraphInstances&amp;#034; option of the MultiwaySystem function (V12.0.0)?</title>
    <link>https://community.wolfram.com/groups/-/m/t/3674343</link>
    <description>The rule &amp;#034;BA&amp;#034; -&amp;gt; &amp;#034;AB&amp;#034; is presented in Section 5.9 of the Physics Project book (&amp;#034;The Significance of Causal Invariance&amp;#034;) as being causal invariant. The instances of its causal graph shown therein for 5 time steps and initial condition &amp;#034;BBBAA&amp;#034; is given as example, showing that all 5 instances are isomorphic to each other. &#xD;
&#xD;
I&amp;#039;ve run the example with the MultiwaySystem function  (ResourceFunction[&amp;#034;MultiwaySystem&amp;#034;][{&amp;#034;BA&amp;#034; -&amp;gt; &amp;#034;AB&amp;#034;}, &amp;#034;BBBAA&amp;#034;, 5, &amp;#034;CausalGraphInstances&amp;#034;]) and the function output matched the book content.&#xD;
&#xD;
However:&#xD;
&#xD;
1) Running the system for only 4 time steps, not all instances are isomorphic to each other, since in this case there 2 types of graphs (among the 5 instances) which are clearly not isomorphic to each other.&#xD;
&#xD;
2) In the subsequent example in the section -- that changes the initial condition to &amp;#034;BBBBAAAA&amp;#034; -- the MultiwaySystem function couldn&amp;#039;t generate the instance causal graph shown in the book, regardless of the number of time steps I tried (from 4 to 10). Actually, for all these time steps different graph types are generated which precludes the existence of isomorphism among them all.</description>
    <dc:creator>Pedro Paulo Balbi</dc:creator>
    <dc:date>2026-04-04T20:45:37Z</dc:date>
  </item>
  <item rdf:about="https://community.wolfram.com/groups/-/m/t/2759491">
    <title>More than one ruliad in Wolfram Physics Project?</title>
    <link>https://community.wolfram.com/groups/-/m/t/2759491</link>
    <description>Wolfram&amp;#039;s Physics Project is a very interesting one and its recent evolution fascinates me. I think that the recent discovery of the ruliad is a good progress in the project. However, there is something I don&amp;#039;t understand:&#xD;
&#xD;
According to Wolfram&amp;#039;s writing about the ruliad (https://writings.stephenwolfram.com/2021/11/the-concept-of-the-ruliad/), there is only one ruliad which contains all possible formal systems. I understand why there should be only one ruliad as it would contain all possible computational rules by definition. However, I can imagine a formal system or abstract situation where somehow there could be multiple rulial spaces or &amp;#034;ruliads&amp;#034;. So, at the end, wouldn&amp;#039;t it be possible that there could be other ruliads (for computational systems, I&amp;#039;m not talking about other possible &amp;#034;ruliads&amp;#034; containing hypercomputation)?</description>
    <dc:creator>Nodu Agga</dc:creator>
    <dc:date>2023-01-04T15:08:10Z</dc:date>
  </item>
  <item rdf:about="https://community.wolfram.com/groups/-/m/t/3663446">
    <title>The Ruliad concept: some ideas and observations</title>
    <link>https://community.wolfram.com/groups/-/m/t/3663446</link>
    <description>![The Ruliad concept: some ideas and observations][1]&#xD;
&#xD;
&amp;amp;[Wolfram Notebook][2]&#xD;
&#xD;
&#xD;
  [1]: https://community.wolfram.com//c/portal/getImageAttachment?filename=TheRuliadconceptsomeideasandexamples.png&amp;amp;userId=20103&#xD;
  [2]: https://www.wolframcloud.com/obj/db1cd65f-d494-49cb-8414-bcaed8b4ffef</description>
    <dc:creator>Denis Ivanov</dc:creator>
    <dc:date>2026-03-17T04:57:25Z</dc:date>
  </item>
  <item rdf:about="https://community.wolfram.com/groups/-/m/t/3642808">
    <title>Exploring a finite multiway system: exact computability in the &amp;#034;S21&amp;#034; discrete quantum gravity model</title>
    <link>https://community.wolfram.com/groups/-/m/t/3642808</link>
    <description>**Title: Exploring a Finite Multiway System: Exact Computability in the &amp;#034;S21&amp;#034; Discrete Quantum Gravity Model**&#xD;
&#xD;
Hello everyone, &#xD;
&#xD;
I’ve been reviewing a recent theoretical framework called &amp;#034;S21 Theory,&amp;#034; and it shares significant conceptual DNA with the Wolfram Physics Project&amp;#x2014;specifically regarding multiway systems and the emergence of continuous physics from discrete graphs [1, 2]. I thought it would be an interesting model to discuss here, particularly because of how it approaches the problem of infinite state spaces and exact computability.&#xD;
&#xD;
Here is a breakdown of how the S21 model aligns with (and diverges from) the Wolfram approach:&#xD;
&#xD;
**1. The Foundation: A 6-Bit Postulate Instead of Arbitrary Rules**  &#xD;
While the Wolfram approach often searches empirically for generative rewriting rules across an infinite space of possible strings [2, 3], S21 derives its structure from a single discrete postulate: spacetime at the Planck scale admits exactly six binary degrees of freedom (bits) per cell [4].   &#xD;
* This 6-bit postulate creates a finite 64-state configuration space (the $Q_6$ hypercube) [5].   &#xD;
* Applying topological consistency and action minimization filters this down to exactly 21 stable configurations [6].  &#xD;
* 20 of these states form a connected visible-sector vacuum manifold ($M_{20}$), while 1 isolated state becomes a Dark Matter candidate ($\sigma$) [6].  &#xD;
&#xD;
**2. Multiway Evolution and Exact Solvability**  &#xD;
S21 explicitly utilizes the multiway evolution paradigm [1]. Dynamics in the S21 vacuum occur as a multiway directed acyclic graph (DAG) where the system simultaneously explores all allowed paths on a 20-node physical transition graph ($G_E$) [7].  &#xD;
* **The &amp;#034;Wolfram Difference&amp;#034;:** The S21 author explicitly compares the two models, noting that because S21 is restricted to a finite 20-state manifold rather than an infinite state space, its multiway evolution is *exactly solvable* [2, 3].   &#xD;
* The discrete Feynman path integral (summing over all paths in the multiway graph) is evaluated exactly, matching matrix-inverted Green&amp;#039;s functions to machine precision ($10^{-14}$) [8]. This provides a convergent, explicit sum without the need for Monte Carlo approximations or dealing with divergent infinities [9].&#xD;
&#xD;
**3. Emergent Curvature (Ollivier-Ricci)**  &#xD;
Just as Wolfram models look for continuum limits of discrete hypergraphs, S21 proves that continuous relativistic geometry emerges from the discrete graph $G_E$. By computing the Ollivier-Ricci curvature using optimal transport (Wasserstein-1 distance) between the neighborhoods of adjacent vertices, the theory proves the graph has a uniform negative curvature ($\kappa = -1/3$) [10, 11]. This establishes the vacuum as a constant-curvature homogeneous space satisfying the discrete Einstein equations [12].&#xD;
&#xD;
**4. Topological Origin of the Standard Model**  &#xD;
Instead of treating particle physics as an add-on, S21 claims the Standard Model is structurally inevitable from the graph topology:  &#xD;
* **Fermion Generations:** The topological skeleton of the 20-state manifold has a first Betti number of $b_1 = 3$, which exactly matches the 3 generations of fermions [13].  &#xD;
* **Particle Spectrum:** The 43 &amp;#034;forbidden&amp;#034; states ($F_{43}$) outside the vacuum manifold act as an encoding space for the particle spectrum. The boundary membrane between the forbidden sector and the vacuum yields exactly 39 observable states (1 Higgs + 12 gauge bosons + 16 quarks + 10 leptons), which perfectly divides into 13 particles across 3 generations [14, 15].  &#xD;
* **Cosmology:** The framework tracks the minimal CP-odd closed walk on the graph, finding a length of $l_{min} = 7$ [16]. This single integer invariant is used to derive both the baryon asymmetry ($\sim 10^{-10}$) and the cosmological constant ($\sim 10^{-119}$) [17, 18].&#xD;
&#xD;
**Discussion Prompt for the Forum:**  &#xD;
The S21 framework suggests that by restricting a multiway system to a highly constrained, finite topological manifold ($M_{20}$), we can bypass the computational intractability of infinite state spaces and extract exact, quantitative cosmological parameters [2, 3]. &#xD;
&#xD;
Has anyone here experimented with similarly constrained, finite multiway systems? I’d be very interested in hearing the community&amp;#039;s thoughts on using a strictly finite 6-bit partition to solve the path integral convergence problem in discrete quantum gravity.</description>
    <dc:creator>Suhail Bachani</dc:creator>
    <dc:date>2026-02-21T00:32:44Z</dc:date>
  </item>
  <item rdf:about="https://community.wolfram.com/groups/-/m/t/3631121">
    <title>Implementing a &amp;#034;Chiral Twist&amp;#034; (selection bias) in multiway systems for causal graph stabilization</title>
    <link>https://community.wolfram.com/groups/-/m/t/3631121</link>
    <description>I am working on a model that requires a specific type of &amp;#034;Selection Bias&amp;#034; in the rule evolution, and I am looking for guidance on how to represent this using WolframModel or MultiwaySystem.&#xD;
&#xD;
The Theoretical Goal: I am trying to simulate a &amp;#034;stabilization&amp;#034; phase where the system transitions from a high-entropy state (random fluctuations) to a structured state (durable causal loops). I hypothesize that this requires a Parity-Breaking Bias (which I call &amp;#034;The Twist&amp;#034;) that weights the path integral.&#xD;
&#xD;
The Mechanism I Want to Model: Instead of all branches in the Multiway System having equal weight, I want to penalize branches that are &amp;#034;topologically symmetric&amp;#034; and reward branches that exhibit a specific &amp;#034;Chiral Asymmetry&amp;#034; (Twist).&#xD;
&#xD;
&amp;gt;Hypothesis: This bias should force the Causal Graph to &amp;#034;lock&amp;#034; into durable subgraphs (particles/structures) rather than exploring the full infinite Ruliad.&#xD;
&#xD;
The Question: Is there a standard way in WolframModel to apply a &amp;#034;Selection Function&amp;#034; or &amp;#034;Path Weight&amp;#034; that prunes the Multiway Graph based on the topological properties of the hypergraph at that step?&#xD;
&#xD;
Context: This is part of a larger framework (&amp;#034;Universal Compression&amp;#034;) linking causal graph dynamics to observer constraints.&#xD;
&#xD;
&amp;gt;System Architecture (Preprint): https://doi.org/10.5281/zenodo.18421925&#xD;
&#xD;
&amp;gt;Specific Cosmological Derivation: https://doi.org/10.5281/zenodo.18421691&#xD;
&#xD;
Any pointers on how to implement a &amp;#034;Selection Bias&amp;#034; function in the evolution step would be appreciated.</description>
    <dc:creator>Matt Prager</dc:creator>
    <dc:date>2026-01-30T11:29:43Z</dc:date>
  </item>
  <item rdf:about="https://community.wolfram.com/groups/-/m/t/3589391">
    <title>A Minimal model for causal invariance: path merging via DP-like optimization</title>
    <link>https://community.wolfram.com/groups/-/m/t/3589391</link>
    <description>The Rule：{{x, y}, {y, z}} -&amp;gt; {{x, z}, {x, w}, {w, z}}  &#xD;
This model investigates the emergence of causal geometry from a minimal graph-rewriting rule.&#xD;
&#xD;
Unlike standard branching trees, this rule facilitates state merging (interference), mimicking a Dynamic Programming optimization process within the causal graph.&#xD;
&#xD;
The evolution demonstrates Markovian properties where the spatial structure (&amp;#039;ripple&amp;#039;) expands purely based on local connectivity, creating a discrete spacetime fabric that exhibits Causal Invariance. This serves as a computational candidate for interpreting the &amp;#039;Many-Worlds&amp;#039; path integral as a deterministic graph optimization problem.  &#xD;
Proposed Model Description (Short Explanation)&#xD;
&#xD;
Nodes represent discrete universe slices (microstates of spacetime).  &#xD;
Each node encodes a complete instantaneous configuration of the universe.&#xD;
&#xD;
Directed edges represent causal relations between slices.  &#xD;
An edge from node A to node B indicates that B is a possible successor state generated from A.&#xD;
&#xD;
The network is constructed through a recursive update process combining  &#xD;
(1) a Markov-style probabilistic transition rule, and  &#xD;
(2) a deterministic local causal rule.  &#xD;
Together, these govern how new spacetime slices branch and evolve.&#xD;
&#xD;
A path from the root to any node corresponds to a possible history of the universe.  &#xD;
Compressing such a path yields the emergent notions of time and macroscopic causality.&#xD;
&#xD;
The diagrams shown depict the evolving causal structure and the resulting spatial slice (wavefront) produced by these rules.![Causal Graph showing state merging and loop structures][1]![Final Spatial Slice exhibiting wavefront expansion][2]![20-times recursive version][3]&#xD;
&#xD;
&#xD;
&#xD;
  [1]: https://community.wolfram.com//c/portal/getImageAttachment?filename=yuz1.png&amp;amp;userId=3589356&#xD;
  [2]: https://community.wolfram.com//c/portal/getImageAttachment?filename=yuz2.png&amp;amp;userId=3589356&#xD;
  [3]: https://community.wolfram.com//c/portal/getImageAttachment?filename=222222.png&amp;amp;userId=3589356</description>
    <dc:creator>Xin Wang</dc:creator>
    <dc:date>2025-12-11T13:21:31Z</dc:date>
  </item>
  <item rdf:about="https://community.wolfram.com/groups/-/m/t/3608412">
    <title>[WWS26] Holographic duality between causal and branchial graphs</title>
    <link>https://community.wolfram.com/groups/-/m/t/3608412</link>
    <description>![Holographic duality between causal and branchial graphs][1]&#xD;
&#xD;
&amp;amp;[Wolfram Notebook][2]&#xD;
&#xD;
&#xD;
  [1]: https://community.wolfram.com//c/portal/getImageAttachment?filename=adsss.png&amp;amp;userId=20103&#xD;
  [2]: https://www.wolframcloud.com/obj/5caba86f-013f-4f65-8d61-2d8d78f91365</description>
    <dc:creator>Narmin Nasibova</dc:creator>
    <dc:date>2026-01-16T11:46:00Z</dc:date>
  </item>
  <item rdf:about="https://community.wolfram.com/groups/-/m/t/3607969">
    <title>[WWS26] Noncommutative geometry and graph rewriting systems</title>
    <link>https://community.wolfram.com/groups/-/m/t/3607969</link>
    <description>![Wolfram Physics Project Noncommutative Geometry Bridge][1]&#xD;
&#xD;
&amp;amp;[Wolfram Notebook][2]&#xD;
&#xD;
&#xD;
  [1]: https://community.wolfram.com//c/portal/getImageAttachment?filename=WPP-NCG-Bridge.png&amp;amp;userId=3607945&#xD;
  [2]: https://www.wolframcloud.com/obj/57ceecb3-2977-4fe1-9bc5-6e40e46dfd99</description>
    <dc:creator>Jorge Plazas</dc:creator>
    <dc:date>2026-01-15T23:41:53Z</dc:date>
  </item>
</rdf:RDF>

