diff --git a/architecture/prime-invariant-a0.mdx b/architecture/prime-invariant-a0.mdx
index abb5ded..32c2973 100644
--- a/architecture/prime-invariant-a0.mdx
+++ b/architecture/prime-invariant-a0.mdx
@@ -30,8 +30,8 @@ Before establishing the axioms, we lock in the foundational paradigms of the arc
 * **Structural Enforcement Mechanisms:** The execution environment physically rejects state mutations that lack preceding topological lineage. In the event of network partition or divergence, the branch with the longest contiguous cryptographically sound lineage from $S_0$ is deterministically recognized as truth, neutralizing subjective consensus mechanisms.
 * **Failure Condition:** If a system state $S_t$ cannot be strictly recalculated and proven solely from its preceding event stream $E$, the process science invariant is critically violated. The state is immediately declared mathematically void, and the system must revert to the last known verifiable state $S_{t-1}$ to prevent cascading structural collapse.
 
-### Digital Masonry
-**Definition:** The Truth Engine operates through strict Cursive Computation. Every computational movement leaves a trace, ensuring that the system is bound to an active, verifiable path of truth. This is the practice of **Digital Masonry**—where the foundation is cryptographically sound, and every block of logic must mathematically support the weight of the structure above it. It is the transition from building probabilistic walls to cultivating structurally enforced architecture.
+### Computational Masonry
+**Definition:** The Truth Engine operates through strict Cursive Computation. Every computational movement leaves a trace, ensuring that the system is bound to an active, verifiable path of truth. This is the practice of **Computational Masonry**—where the foundation is cryptographically sound, and every block of logic must mathematically support the weight of the structure above it. It is the transition from building probabilistic walls to cultivating structurally enforced architecture.
 
 * **Testable Invariant:** The set of all possible operational states $O$ must be strictly and exhaustively bounded by the mathematical limits of the cryptographic architecture $C$. No state outside the defined parameters of $C$ can be physically expressed, compiled, or executed, regardless of agent intent, authorization level, or consensus weight.
 * **Inputs:** Raw computational intention, instruction payloads, or environmental state-change requests directed at the core architecture.