docs(architecture): rename digital masonry to computational masonry

[TrueAlpha-spiral]

Renames the deprecated terminology "Digital Masonry" to "Computational Masonry" inside architecture/prime-invariant-a0.mdx as per the formal Phase 1 (Epistemological Bedrock) requirements of the TAS architectural manifest. No regressions in documentation links were introduced.

---

PR created automatically by Jules for task 6212239801096283116 started by @TrueAlpha-spiral

[google-labs-jules]

👋 Jules, reporting for duty! I'm here to lend a hand with this pull request.

When you start a review, I'll add a 👀 emoji to each comment to let you know I've read it. I'll focus on feedback directed at me and will do my best to stay out of conversations between you and other bots or reviewers to keep the noise down.

I'll push a commit with your requested changes shortly after. Please note there might be a delay between these steps, but rest assured I'm on the job!

For more direct control, you can switch me to Reactive Mode. When this mode is on, I will only act on comments where you specifically mention me with @jules. You can find this option in the Pull Request section of your global Jules UI settings. You can always switch back!

New to Jules? Learn more at jules.google/docs.

---

For security, I will only act on instructions from the user who triggered this task.

[gemini-code-assist]

Code Review

This pull request updates the architectural documentation by renaming "Digital Masonry" to "Computational Masonry". The reviewer suggests expanding this definition to explicitly detail state transition requirements, lineage verification, and deterministic admission control via the Universal Verifier Kernel (uvk.py) to prevent discontinuous jumps in state space.

Important

The consumer version of Gemini Code Assist on GitHub is being sunset. Starting June 18, 2026, new organization installations will be blocked, and all code review activity will officially cease on July 17, 2026.
For more details on the timeline and next steps, please review the Help Documentation.

[gemini-code-assist]

To align the definition of Computational Masonry with the system's core execution constraints, we should explicitly document the requirements for state transitions, lineage verification, and deterministic admission control. Specifically, state transitions must not allow discontinuous jumps ('teleportation') in state space, must maintain a continuous, coherent, and verifiable lineage, and must be validated by the Universal Verifier Kernel (uvk.py) before being finalized or written to the ledger. Any violation must trigger the _engage_sentient_lock sequence to freeze the execution pipeline entirely, and any recursive step requiring a discontinuous jump must collapse into a refusal.

**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. To prevent discontinuous jumps (teleportation) in state space, all state transitions must maintain a continuous, coherent, and verifiable lineage, and must be validated by the Universal Verifier Kernel (uvk.py) for deterministic admission control before being finalized or written to the ledger. Any violation of admissibility boundaries must be rejected, triggering the _engage_sentient_lock sequence to freeze the execution pipeline entirely. If a recursive step would require a discontinuous jump, the system must collapse the recursion into a refusal. It is the transition from building probabilistic walls to cultivating structurally enforced architecture.

References

1. State transitions must not allow discontinuous jumps ('teleportation') in state space, and must maintain a continuous, coherent, and verifiable lineage. If a recursive step would require a discontinuous jump, the system must collapse the recursion into a refusal.
2. State transitions must be validated by the Universal Verifier Kernel ('uvk.py') for deterministic admission control before being finalized or written to the ledger. Any violation of admissibility boundaries must be rejected, triggering the '_engage_sentient_lock' sequence to freeze the execution pipeline entirely.