Appendix B:

Derived equations

B.1 From master equation to ontological vocabulary

Where Appendix A unfolded the structure of the conference of difference, this appendix demonstrates how key terms of the ontology—atonement, consciousness, equilibrium, forgiveness, reciprocity—influence the ethic: 'character' of the conference of difference. They are not external governors imposed upon the CoD, but rather the CoD, as process primitive, acting and reacting upon itself. Each term describes a particular way the conference of difference, as a constant expression, dynamically transforms the conditional relations of existence.

Each term is shown to be a conference of difference in its own right, a particular mode of $\lbrace\Delta\rbrace$ in operation. The equations that follow are not arbitrary formalizations but expressions derived from the process primitive itself: $\lbrace\Delta\rbrace$. They reveal how the ontology's central concepts cohere within a single, unified framework.

As with Appendix A, these equations function as revelation machinery as described in the Abstract Domain section of this Thesis. They illuminate relationships that might otherwise remain implicit, but they do not replace the existential realities they describe. The map reveals the territory; it does not become it.

B.2 Derived equations: key terms as conferences of difference

This appendix assumes the formal framework established in Appendix 1: Mathematical Foundations of the Conference of Difference. Key definitions imported from that appendix include:

• The conference of difference $\lbrace\Delta\rbrace$ as a dynamic relational condition: 'process of declaring together';
• The dialectical tension $\langle \lbrace \text{together} \rbrace \parallel \lbrace \text{against} \rbrace \rangle$ reflected by the co-petitive and competitive modes of the CoD;
• The recursive axiom $\forall \delta \in \Delta, \delta = \lbrace\Delta_i\rbrace$ that every difference is a conference of difference;
• The conditional matrix $M_C = [\delta_i \supset \delta_j]$ encoding the inclusion/exclusion relations between differences — the 'if-then' grammar of conference.

Readers unfamiliar with these foundations are encouraged to consult Appendix A before proceeding.

B.2.1 Atonement: the 'action to be at one'

Etymon: at-one-ment — the action of making or becoming one.^[1]

Atonement is both the necessary cause of any conference and the ongoing process of moving toward the 'together' pole. As stated in Koan 90.2 of the Gospel of Being: 'Without atonement… there would be no cause for conference'.

Equation (B.1) – Atonement as causal ground (do-calculus)

$$ P(\lbrace\Delta\rbrace = 1 \mid do(\text{Atonement} = 0)) = 0 $$

where

• $P(\lbrace\Delta\rbrace = 1 \mid do(\text{Atonement} = 0))$ is the probability that a conference of difference exists, given that we intervene to set atonement (the action to be at one) to zero;
• $do(\cdot)$ is Judea Pearl's do-operator, representing an active intervention that severs all other causal pathways;
• $= 0$ means impossibility.

Natural language reading: The probability that a conference exists, when we intervene to set atonement to zero, is zero. Without the action to be at one, there is no cause for conference: the 'condition of bearing together'.

Equation (B.2) – Causal sufficiency

$$ P(\lbrace\Delta\rbrace = 1 \mid do(\text{Atonement} = 1)) = 1 $$

where

• $P(\lbrace\Delta\rbrace = 1 \mid do(\text{Atonement} = 1))$ is the probability that a conference of difference exists, given that we intervene to set atonement to one;
• $= 1$ means certainty.

Natural language reading: The probability that a conference exists, when we intervene to set atonement to one, is one. The action to be at one is sufficient to initiate conference: the 'condition of bearing together'.

Equation (B.3) – The counterfactual conditional

$$ \lbrace\Delta\rbrace_{do(\text{Atonement}=0)} \neq \lbrace\Delta\rbrace_{do(\text{Atonement}=1)} $$

where

• $\lbrace\Delta\rbrace_{do(\text{Atonement}=0)}$ is the state of the conference under the intervention that sets atonement to zero;
• $\neq$ means "is not equal to";
• $\lbrace\Delta\rbrace_{do(\text{Atonement}=1)}$ is the state of the conference under the intervention that sets atonement to one.

Natural language reading: The conference of difference under the intervention that removes atonement is fundamentally different from the conference under the intervention that enacts atonement. Atonement makes a causal difference.

Equation (B.4) – Atonement as dynamic process (increasing together)

$$ A(\delta_i, \delta_j) = \lbrace (\delta_i, \delta_j) \mid \frac{dT}{dt} > 0 \rbrace $$

where

• $A(\delta_i, \delta_j)$ is atonement between two differences;
• $\lbrace (\delta_i, \delta_j) \mid \ldots \rbrace$ is the set of pairs of differences for which the condition holds;
• $\frac{dT}{dt}$ is the rate at which the together-tendency changes over time;
• $>$ means "greater than";
• $0$ is zero.

Natural language reading: Atonement between two differences is the set of pairs of differences for which the together-tendency is increasing over time.

Equation (B.5) – Recursive atonement (differences as conferences)

$$ A(\delta_i, \delta_j) = \lbrace \lbrace\Delta_i\rbrace, \lbrace\Delta_j\rbrace \mid \frac{dT(\lbrace\Delta_i\rbrace, \lbrace\Delta_j\rbrace)}{dt} > 0 \rbrace $$

where

• $\lbrace\Delta_i\rbrace$ is the conference that is difference $i$;
• $\lbrace\Delta_j\rbrace$ is the conference that is difference $j$;
• $\frac{dT(\lbrace\Delta_i\rbrace, \lbrace\Delta_j\rbrace)}{dt}$ is the rate at which the together-tendency between the two conferences changes over time.

Natural language reading: Atonement between two differences is the set of their constituent conferences for which the together-tendency between those conferences is increasing over time.

Equation (B.6) – The unified causal-dynamic relation

$$ \boxed{ \begin{aligned} &\text{Atonement} \Rightarrow \text{Cause for Conference} \\ &\text{where } P(\lbrace\Delta\rbrace \mid do(A=0)) = 0 \\ &\text{and } A(\delta_i, \delta_j) = \lbrace (\delta_i, \delta_j) \mid \frac{dT}{dt} > 0 \rbrace \end{aligned} } $$

Natural language reading: Atonement is the cause for conference. Without the action to be at one, conference is impossible. Where atonement exists, it manifests as the increasing together-tendency between differences.

Equation (B.7) – Atonement as self-conference

$\text{Atonement}=\lbrace\Delta\rbrace_A$

where

• $\text{Atonement}$ is the action to be at one;
• $\lbrace \Delta \rbrace_A$ is a conference of difference whose governing dynamic is the increase of together-tendency.

Natural language reading: Atonement is itself a conference of difference—a specific configuration of differences oriented toward increasing synergy.

Equation (B.8) – The recursive causal loop

$$ \lbrace\Delta\rbrace \xleftarrow{\text{Atonement}} \lbrace\Delta\rbrace \xrightarrow{\text{Atonement}} \lbrace\Delta\rbrace $$

Natural language reading: Atonement is a conference of difference that causes conferences of difference. The cause and the effect are structurally identical, revealing that conference is self-generating—it emerges from its own mode of operation.

Unfolded from the master equation:

$\exists = \lbrace\Delta\rbrace$ contains within it the possibility of movement toward the together pole. Atonement is that movement actualized as first cause—the initiating action without which no conference can begin or be sustained. Because atonement is itself a conference of difference, the master equation reveals a self-generating loop: conference causes conference through the action to be at one. This is not circularity but autopoiesis—existence bootstrapping itself into being.

B.2.2 Consciousness: the 'measure of knowing together'

Etymon: con (together) + sci (know) + -ness (measure) — the 'measure of knowing together'.^[2]

Consciousness is the mutual alignment of recursive internal models within a sentient conference of difference. It is not a binary property but a continuous gradient that ranges from zero (no internal models) through rudimentary signaling (cockroaches leaving trails) to coordinated role-based intentionality (lions hunting cooperatively) to full mutual awareness (human dialogue).

Equation (B.7) – Consciousness as recursive mutual modeling

$$ \kappa(\lbrace\Delta\rbrace) = \frac{1}{n^2} \sum_{i=1}^{n} \sum_{j=1}^{n} \sum_{k=1}^{\infty} \frac{1}{2^k} \cdot \text{sim}\left( \mathcal{M}^k(\delta_i, \delta_j), \mathcal{M}^k(\delta_j, \delta_i) \right) $$

where

• $\kappa(\lbrace\Delta\rbrace)$ is the measure of knowing together (consciousness) of the conference $\lbrace\Delta\rbrace$, a continuous value in $[0,1]$;
• $n$ is the number of differences in the conference;
• $\mathcal{M}^1(\delta_i, \delta_j)$ is the first-order internal model that $\delta_i$ holds of $\delta_j$'s state;
• $\mathcal{M}^2(\delta_i, \delta_j)$ is the second-order internal model that $\delta_i$ holds of $\delta_j$'s model of $\delta_i$;
• $\mathcal{M}^k(\delta_i, \delta_j)$ is the $k$-th order recursive model (knowing that the other knows that the other knows...);
• $\text{sim}(\cdot, \cdot)$ is a similarity function measuring alignment between the reciprocal models at each order;
• $\frac{1}{2^k}$ is a weighting factor that progressively discounts higher-order recursions;^[3]
• $\sum$ sums over all ordered pairs and all recursive orders.

Natural language reading: Consciousness is the weighted average of mutual alignment across all recursive orders of modeling. First-order alignment (mere correlation, as between two protons) contributes little. Second-order alignment (knowing that the other knows) contributes more. Higher orders contribute progressively less. This produces a continuous gradient from zero consciousness through rudimentary signaling to full mutual awareness.

Equation (B.8) – The gradient of consciousness^[4]

$$ \kappa(\lbrace\Delta\rbrace) = \begin{cases} 0 & \text{if } \forall i,j,k, \mathcal{M}^k(\delta_i, \delta_j) = \emptyset \\[4pt] (0, 0.15] & \text{if first-order models exist only (e.g., red blood cells)} \\[4pt] (0.15, 0.35] & \text{if second-order models emerge (e.g., cockroach signaling)} \\[4pt] (0.35, 0.65] & \text{if coordinated role-based intentionality (e.g., lions hunting)} \\[4pt] (0.65, 0.95] & \text{if full recursive mutual awareness (e.g., humans)} \\[4pt] 1 & \text{theoretical limit: perfect mutual knowledge across all orders} \end{cases} $$

Natural language reading: Consciousness exists on a continuum. Protons have none. Red blood cells have rudimentary first-order response but no second-order knowing. Cockroaches may have minimal second-order modeling when they meet and exchange information. Lions exhibit clear second-order intentionality—each knows the other's role and that the other knows the plan. Humans routinely operate at third, fourth, and higher orders of recursive mutual awareness.

Equation (B.9) – The necessity of higher-order models

$$ \kappa(\lbrace\Delta\rbrace) \leq \frac{1}{n^2} \sum_{i,j} \sum_{k=2}^{\infty} \frac{1}{2^k} \cdot \text{sim}\left( \mathcal{M}^k(\delta_i, \delta_j), \mathcal{M}^k(\delta_j, \delta_i) \right) $$

where

• The inequality shows that first-order modeling ($k=1$) alone contributes at most $\frac{1}{2}$ of the total possible consciousness weight;
• True consciousness requires $k \geq 2$ terms—the mutual knowledge of mutual knowledge.

Natural language reading: A conference with only first-order models (mere stimulus-response) has a maximum possible consciousness of 0.5. To approach higher consciousness, differences must model not just each other's states but each other's models of each other. Knowing together requires knowing that you know together.

Equation (B.10) – Causal necessity of mutual recognition (do-calculus)

$$ P(\kappa > \theta \mid do(\mathcal{M}^2(\delta_i, \delta_j) \neq \mathcal{M}^2(\delta_j, \delta_i) \text{ for any } i \neq j)) = 0 $$

where

• $\theta$ is any threshold requiring second-order or higher consciousness (i.e., $\theta \geq 0.15$);
• $do(\cdot)$ is an intervention that breaks the mutual alignment of second-order models between a specific pair of differences.

Natural language reading: The probability of any meaningful consciousness (above the rudimentary first-order level) is zero if we intervene to break the mutual alignment of second-order models between any pair of differences. Without reciprocal recognition of recognition, there is no genuine knowing together—only blind signaling.

Equation (B.11) – Perfect consciousness (theoretical limit)

$$ \lim_{\substack{n \to \infty \ k \to \infty}} \kappa(\lbrace\Delta\rbrace) = 1 \iff \forall i,j,k, \mathcal{M}^k(\delta_i, \delta_j) = \mathcal{M}^k(\delta_j, \delta_i) $$

where

• $\iff$ means 'if and only if';
• The limit as $n \to \infty$ and $k \to \infty$ represents an ideal conference of infinite differences with infinite recursive depth;
• Perfect mutual alignment at all orders yields perfect consciousness.

Natural language reading: Perfect consciousness—the complete knowing together of all differences across all recursive depths—is a theoretical limit approached but never fully reached by finite, embodied conferences of differences. It is the ideal of perfect mutual transparency.

Unfolded from the master equation:

$\exists = \lbrace\Delta\rbrace$ contains differences in relation. When those differences develop recursive internal models of each other—when they begin to know that they know—consciousness emerges as the mutual alignment of these models across multiple orders. First-order modeling (stimulus-response) yields only rudimentary awareness. Second-order modeling (knowing that the other knows) marks the threshold of genuine sentience. Higher orders produce the rich, recursive intentionality characteristic of human consciousness. The conference's measure of self-knowing is continuous, contextual, and always in process—never perfect, always evolving.

B.2.3 Equilibrium: the 'setting of scales equal'

Etymon: aequus (equal) + libra (scales) + -ium (setting of) — the 'setting of scales equal'.^[5]

Equilibrium is the condition of a conference of difference when the dialectical tension between 'together' and 'against' reaches a dynamic steady state. It is not stasis but balanced flow — the rate of change of conditional relations approaches zero while the conference remains alive and responsive.

Equation (B.12) – Equilibrium as steady state of conditional relations

$$ E(\lbrace\Delta\rbrace) = \left\lbrace M_C \middle| \frac{dM_C}{dt} = 0 \right\rbrace $$

where

• $E(\lbrace\Delta\rbrace)$ is the equilibrium condition of the conference of difference $\lbrace\Delta\rbrace$;
• $M_C$ is the conditional matrix $[\delta_i \supset \delta_j]$;
• $\frac{dM_C}{dt}$ is the matrix of first derivatives, representing the rate of change of each conditional relation over time;
• $=$ means equality;
• $0$ is the zero matrix.

Natural language reading: A conference is in equilibrium when its conditional matrix is not changing — when the patterns of inclusion and exclusion between differences are in dynamic balance.

Equation (B.13) – Equilibrium as balance of dialectical forces

$$ E(\lbrace\Delta\rbrace) \iff \langle T \parallel A \rangle \text{ such that } \frac{dT}{dt} = -\frac{dA}{dt} \neq 0 $$

where

• $E(\lbrace\Delta\rbrace)$ is the equilibrium condition;
• $\iff$ means "if and only if";
• $\langle T \parallel A \rangle$ is the dialectical tension between together-tendency and against-tendency;
• $\frac{dT}{dt}$ is the rate of change of the together-tendency;
• $\frac{dA}{dt}$ is the rate of change of the against-tendency;
• $=$ means equality;
• $-\frac{dA}{dt}$ means the negative of the rate of change of the against-tendency;
• $\neq 0$ means "not equal to zero."

Natural language reading: A conference is in equilibrium precisely when the increase in together-tendency is exactly balanced by a corresponding decrease in against-tendency — and this balanced change is ongoing. Equilibrium is not motionlessness but dynamic balance.

Equation (B.14) – Approach to equilibrium (Lyapunov stability)^[6]

$$ \lim_{t \to \infty} \left| \frac{dM_C(t)}{dt} \right| = 0 \implies \text{conference approaches equilibrium} $$

where

• $\lim_{t \to \infty}$ is the limit as time approaches infinity;
• $| \cdot |$ is a matrix norm measuring the "magnitude" of change;
• $\implies$ means "implies."

Natural language reading: If the rate of change of the conditional matrix decays to zero over time, the conference asymptotically approaches equilibrium.

Equation (B.15) – Equilibrium as fixed point of conference dynamics

$$ E(\lbrace\Delta\rbrace) = \left\lbrace \lbrace\Delta\rbrace \mid \Phi(\lbrace\Delta\rbrace) = \lbrace\Delta\rbrace \right\rbrace $$

where

• $\Phi(\lbrace\Delta\rbrace)$ is the dynamic update function that maps a conference to its next condition;
• $=$ means equality.

Natural language reading: Equilibrium is a fixed point of conference dynamics — applying the conference's own update rules returns the conference unchanged, even as internal activity continues.

Equation (B.16) – Equilibrium distinguished from stasis

$$ E(\lbrace\Delta\rbrace) \not\Rightarrow \frac{dM_C}{dt} \equiv 0 \quad \left(\text{only } \left| \frac{dM_C}{dt} \right| \approx 0\right) $$

where

• $\not\Rightarrow$ means "does not imply";
• $\equiv 0$ means "identically zero for all entries at all times";
• $| \cdot | \approx 0$ means "the magnitude of change is near zero."

Natural language reading: Equilibrium does not mean frozen relations. It means the magnitude of change is negligible relative to the conference's scale — a living balance, not a dead stasis.

Unfolded from the master equation:

$\exists = \lbrace\Delta\rbrace$ is never static. Equilibrium is the dynamic attractor toward which conferences tend when reciprocity is proportional and forgiveness resets exclusion without introducing new imbalance. It is the condition toward which a healthy conference naturally evolves — not a destination reached, but a horizon approached. When a conference moves far from equilibrium, power differentials amplify, tyranny becomes possible, and the conference risks decay into chaos or frozen hierarchy.

B.2.4 Forgiveness: a 'measure of giving away'

Etymon: for (away) + giefan (give) + -ness (measure of) — a 'measure of giving away' to difference.^[7]

Forgiveness is the giving away to difference—the essential posture of giving away that enables conference to proceed. It is not merely a response to violation but the fundamental condition for differences to bear together at all.

Equation (B.17) – Forgiveness as a measure of giving away

$$ F(\delta_i, \delta_j) = \text{give}(\delta_i, \delta_j) $$

where

• $F(\delta_i, \delta_j)$ is the measure of giving away (forgiveness) from $\delta_i$ to $\delta_j$;
• $\text{give}(\delta_i, \delta_j)$ is the degree to which $\delta_i$ releases the right to exclude $\delta_j$.

Natural language reading: Forgiveness is the measure of giving away of one difference to another. It is the accommodating of difference, the making of space for difference in conference.

Equation (B.18) – Forgiveness as necessary condition for conference

$$ P(\lbrace\Delta\rbrace \mid do(F = 0)) = 0 $$

where

• $P(\lbrace\Delta\rbrace \mid do(F = 0))$ is the probability that a conference exists given an intervention that sets forgiveness (giving away) to zero.

Natural language reading: The probability of any conference is zero if we intervene to eliminate forgiveness. Without the measure of giving away, differences cannot bear together—exclusion dominates and conference cannot begin.

Equation (B.19) – Forgiveness as conditional relaxation

$$ F(\delta_i, \delta_j) \iff C'(\delta_i, \delta_j) \text{ where } P(C' \mid \text{history}) \geq P(C \mid \text{history}) $$

where

• $F(\delta_i, \delta_j)$ is forgiveness between two differences;
• $\iff$ means "is equivalent to";
• $C'(\delta_i, \delta_j)$ is a relaxed condition function;
• $P(C' \mid \text{history})$ is the probability of the relaxed condition given past interactions;
• $P(C \mid \text{history})$ is the probability of the original condition.

Natural language reading: Forgiveness is the relaxation of conditional relations—the active resetting of inclusion/exclusion rules toward greater giving away, independent of any specific violation.

Equation (B.20) – Recursive forgiveness

$$ F(\delta_i, \delta_j) = \left\lbrace \lbrace\Delta_i\rbrace, \lbrace\Delta_j\rbrace \middle| \substack{\text{the conditional relations between their} \\ \text{constituent differences are reset} \\ \text{toward inclusion}} \right\rbrace $$

where

• $F(\delta_i, \delta_j)$ is forgiveness between two differences;
• $\lbrace\Delta_i\rbrace$ is the conference that is difference $i$;
• $\lbrace\Delta_j\rbrace$ is the conference that is difference $j$.

Natural language reading: Forgiveness between two differences is the set of their constituent conferences for which the conditional relations between their differences are reset toward inclusion. Forgiveness propagates down the recursive hierarchy.

Equation (B.21) – The atonement-forgiveness harmony

$$ A \iff F \quad \text{(mutually necessary)} $$

where

• $A$ is atonement (action to be at one);
• $F$ is forgiveness (measure of giving away);
• $\iff$ means "are mutually dependent."

Natural language reading: Atonement and forgiveness are co-constitutive. Atonement gives direction (movement toward together); forgiveness gives release (giving away to difference/s). Neither can function without the other.

Unfolded from the master equation:

$\exists = \lbrace\Delta\rbrace$ contains the conditional matrix $M_C$. Forgiveness is the active accommodating of difference — the measure of giving away that allows differences to bear together. It is not simply a reactive response to violation but an essential response to atonement that makes the conference of difference possible. Without forgiveness, atonement has no effect; without atonement, forgiveness has no cause.

B.2.5 Reciprocity: the 'condition of like forward, like back'

Etymon: re (back) + pro (forward) — the condition of forward and back corresponding.^[8]

Reciprocity reflects the condition of the conference of difference. When the conditional relation from the second difference to the first is proportional to the relation from the first to the second, the conference is in equilibrium. When this proportionality breaks, the conference reveals a power imbalance.

Equation (B.22) — Reciprocity with proportional response

$$ R(\lbrace\Delta\rbrace) = \lbrace \lbrace\Delta\rbrace' \mid m_{\lbrace ji\rbrace} = f(m_{\lbrace ij\rbrace}) \rbrace $$

where

• $R(\lbrace\Delta\rbrace)$ is the reciprocity operator applied to a conference of difference;
• $\lbrace\Delta\rbrace'$ is the transformed conference of difference;
• $m_{\lbrace ji\rbrace}$ is the entry in row $j$, column $i$ of the transformed conditional matrix;
• $f$ is a function that returns a proportional response;
• $m_{\lbrace ij\rbrace}$ is the entry in row $i$, column $j$ of the original conditional matrix.

Natural language reading: Applying the reciprocity operator to a conference of difference yields a transformed conference of difference for which the conditional relation from the second difference to the first equals a function of the conditional relation from the first to the second.

In the simplest case, $f$ is the identity:

Equation (B.23) Reciprocity with identity response (the golden rule)

$$ R(\lbrace\Delta\rbrace) = \lbrace \lbrace\Delta\rbrace' \mid m_{\lbrace ji\rbrace} = m_{\lbrace ij\rbrace} \rbrace $$

where

• $m_{\lbrace ji\rbrace}$ is the entry in row $j$, column $i$ of the transformed conditional matrix;
• $=$ is equality;
• $m_{\lbrace ij\rbrace}$ is the entry in row $i$, column $j$ of the original conditional matrix.

Natural language reading: Applying the reciprocity operator to a conference yields a transformed conference for which the conditional relation from the second difference to the first equals the conditional relation from the first to the second. The response received equals the action sent. This is the golden rule encoded in matrix form.

Equation (B.24) — Fixed-point reciprocity (conservation condition)

$$ R(\lbrace\Delta\rbrace) = \lbrace \lbrace\Delta\rbrace \mid \operatorname{trace}(M_C) = \text{constant} \rbrace $$

where

• $R(\lbrace\Delta\rbrace)$ is the reciprocity operator applied to a conference of difference;
• $\operatorname{trace}(M_C)$ is the sum of the diagonal entries of the conditional matrix;
• $=$ is equality;
• $\text{constant}$ means a fixed, unchanging value.

Natural language reading: Applying the reciprocity operator to a conference of difference yields the same conference of difference when the sum of the diagonal entries of its conditional matrix is constant. The total 'energy' of conditional relations is conserved; what goes out must come back.

Equation (B.25)— Meta fixed-point (existential self-reciprocity)

$$ R(\exists) = \exists $$

where

• $R(\exists)$ is the reciprocity operator applied to Existence;
• $=$ is equality;
• $\exists$ is Existence.

Natural language reading: Applying the reciprocity operator to Existence yields Existence itself. Existence as a whole is self-reciprocal—the ultimate conservation law.

Unfolded from the master equation:

$\exists = \lbrace\Delta\rbrace$ is not arbitrary. It is governed by the reciprocity principle, which ensures that the conditional matrix maintains dynamic coherence. Reciprocity is the meta-condition that prevents the conference from collapsing into chaos or domination.

B.3 The unified field: all terms as one equation

Remarkably, all these derived equations can be seen as particular views of a single, unified structure:

Equation (B.26)— Definition of Existence (the complete conference of difference)

$$ \exists = \lbrace \Delta \mid A, R, \langle \text{together} \parallel \text{against} \rangle, \forall\delta = \lbrace\Delta_i\rbrace, M_C, \frac{dM_C}{dt}, \kappa, F, \ldots \rbrace $$

where

• $\exists$ is Existence;
• $\lbrace \Delta \mid \ldots \rbrace$ is the conference of difference with the specified conditions;
• $A$ is atonement: the action to be at one (causal ground and dynamic process);
• $R$ is reciprocity: the symmetry condition reflecting equilibrium or imbalance;
• $\langle \text{together} \parallel \text{against} \rangle$ is the dialectical tension;
• $\forall\delta = \lbrace\Delta_i\rbrace$ is the recursive axiom;
• $M_C$ is the conditional matrix;
• $\frac{dM_C}{dt}$ is the rate of change of the conditional matrix;
• $\kappa$ is consciousness: the continuous measure of recursive mutual modeling;
• $F$ is forgiveness: the active accommodating of difference.

Natural language reading: Existence is the Conference of Difference. Atonement provides its causal ground and movement toward together. Reciprocity reflects whether the conference is in equilibrium or power imbalance. Consciousness is the gradient of mutual knowing together. Forgiveness is the accommodating of difference that allows conference to proceed. Dialectical tension, the recursive axiom, the conditional matrix and its rate of change are the structural dynamics through which the CoD influences its own condition.

These are not external laws imposed upon the CoD but the CoD's own modes of operation. When atonement and forgiveness harmonize, salvation—the process of having safety in existence—emerges. When reciprocity is proportional, the conference is in equilibrium. When imbalance appears, power differentials emerge that, if unresolved, decay into tyranny.

Existence is the conference of difference, and:

• Atonement is the action to be at one
• Consciousness is the measure of knowing together
• Equilibrium is the setting of scales equal
• Forgiveness is the measure of giving away
• Reciprocity is the condition of like forward, like back

Each term picks out a different feature of the same conference, just as a single landscape can be described by its elevation, its vegetation, its geology, and its climate—different maps of the same terrain.

B.4 Summary table

All are contained in the master equation. All are conferences of difference.

B.5 Modes of operation and their effects