What the variant adds
The notes give 80 parameter rows across seven groups: device, network/I/O, website/render, storage, calculation, environment/pattern and internal mathematics. A shared cost template uses the maximum of U,V,dK. They explicitly list missing domain operators, state-change functions, coupling constants and integration bounds; the parameter table is not evidence of 80 working autonomous minds.
Relationship to the combined model
The raw notes later combine these seven forms into R* and an extended Rhiannon object. They are retained as distinguishable source variants because tensor composition, additive physics notation, routing choices and compression shorthand are not mathematically interchangeable.
Equations in this build
21 linked mathematical records. Each opens its notation, interpretation and source.
Maximum structural requirement
Takes the largest of the source’s U, V and dK structural parameters. This maximum becomes the dimension-like requirement used in the proposed neuron-cost expression.
2. Cost function · C_i
This relation contains a squared-state or squared-error term. Squaring makes that contribution nonnegative and increases the penalty for larger magnitudes; the surrounding…
Cost-based neuron coupling
Forms a coupling weight from a weighted combination of the two neuron costs; some historical versions also add a coherence-driver contribution. These variants are retained…
Minimum-cost neuron selector
Sets the selector for neuron i to one when its cost equals the minimum available cost. If several neurons tie, this indicator can select several at once; a single-winner…
1. Compute rmin (neuron’s minimum viable radius / load) · C_i
This relation contains a squared-state or squared-error term. Squaring makes that contribution nonnegative and increases the penalty for larger magnitudes; the surrounding…
2. Compute cost C_i (neuron’s “activation complexity”) · Φ_i
The relation accumulates its integrand over the stated interval or closed loop. The result depends on the integrand, integration variable, limits and trajectory. In the archived…
Cost-based neuron coupling
Forms a coupling weight from a weighted combination of the two neuron costs; some historical versions also add a coherence-driver contribution. These variants are retained…
Maximum structural requirement
Takes the largest of the source’s U, V and dK structural parameters. This maximum becomes the dimension-like requirement used in the proposed neuron-cost expression.
Cost-based neuron coupling
Forms a coupling weight from a weighted combination of the two neuron costs; some historical versions also add a coherence-driver contribution. These variants are retained…
Maximum-score routing rule
Selects the neuron or family attaining the largest displayed score. In the Rhiannon C_i−dx variant, subtracting the same dx from every candidate does not change the winner. This…
2.2. True network of tool-neurons (W, ρ, Cᵢ, Φᵢ) · C_i
The relation accumulates its integrand over the stated interval or closed loop. The result depends on the integrand, integration variable, limits and trajectory. In the archived…
Maximum-score routing rule
Selects the neuron or family attaining the largest displayed score. In the Rhiannon C_i−dx variant, subtracting the same dx from every candidate does not change the winner. This…
Maximum structural requirement
Takes the largest of the source’s U, V and dK structural parameters. This maximum becomes the dimension-like requirement used in the proposed neuron-cost expression.
Maximum structural requirement
Takes the largest of the source’s U, V and dK structural parameters. This maximum becomes the dimension-like requirement used in the proposed neuron-cost expression.
4. Neuroscience-Style Neuron Version (U/V/dK) · \text{R}_3
The notes combine the named components with tensor-product or direct-sum-style notation. The expression records the proposed organization of the model. Concrete dimensions,…
5. Hand-Written Compressed “Fits on Screen” Version · R
The notes combine the named components with tensor-product or direct-sum-style notation. The expression records the proposed organization of the model. Concrete dimensions,…
5. Hand-Written Compressed “Fits on Screen” Version · \Phi
The relation accumulates its integrand over the stated interval or closed loop. The result depends on the integrand, integration variable, limits and trajectory. In the archived…
1. Unified Combined Equation (All Versions Compressed Into One) · C_i
This relation contains a squared-state or squared-error term. Squaring makes that contribution nonnegative and increases the penalty for larger magnitudes; the surrounding…
Cosine coherence between knowledge vectors
Computes the normalized dot product of two knowledge vectors. It compares vector direction and is undefined if either vector has zero norm; a practical implementation needs a…
Decay-and-coupling federation dynamics
Combines a decay term −λS_i with a weighted sum of other agents’ tanh-transformed signals. Coherence weighting changes the effective coupling. Stability depends on the decay rate,…
Hop-by-hop federation activation propagation
Adds neighboring activation contributions to an agent’s previous-hop activation, weighted by graph edges and coherence. Repeated hops can amplify signals unless the network…