diff --git a/CHANGELOG.md b/CHANGELOG.md
index 5158ce5f..1313cc4b 100644
--- a/CHANGELOG.md
+++ b/CHANGELOG.md
@@ -12,6 +12,9 @@ This file records vocabulary-level changes between versions — additions, renam
 
 ### Added
 
+- `ExponentialBackoff`, a concrete child for capped geometric delay growth
+  with configurable jitter. Retry eligibility, budgets, and reset policy remain
+  caller-owned rather than requirements of the delay strategy.
 - Lean 4 formal-verification pilot for the handshake decision kernel and
   canonicalization type-tag domain separation. Proofs are pinned to Lean
   4.30.0, checked without `sorry`, independently rechecked by `leanchecker`,
@@ -23,6 +26,14 @@ This file records vocabulary-level changes between versions — additions, renam
 
 ### Changed
 
+- `Backoff` now defines the general failure-responsive delay family instead of
+  requiring exponential growth, jitter, reset-on-success, and a retry budget.
+  `Retry` explicitly selects `ExponentialBackoff` for transient failures,
+  `StateLock` composes with the generic policy family, and `Yield` no longer
+  links technical retry delay to negotiation concession.
+  The vocabulary now contains 453 patterns and its root changes from
+  `b7c42bc564f5a8d2ac3cb6140430e9d98feb82a8f9b943f550f554e9ba6360b5`
+  to `901130d88dab244cc0d4afc149c5e6eeb9c9565e117c468a8e5326287be8fefa`.
 - The shorthand vocabulary reference is now generated on demand instead of
   tracked and silently staged by the pre-commit hook. Its exporter uses the
   current `_meta.path` taxonomy and the database remains the source of truth.
diff --git a/README.md b/README.md
index 5b98b7b6..6e0471a4 100644
--- a/README.md
+++ b/README.md
@@ -140,10 +140,10 @@ registry = RegistryManager()
 pattern = registry.get_pattern("StateLock")
 
 # Look up the canonical reference
-print(pattern["sema_ref"])  # StateLock#7cd8
+print(pattern["sema_ref"])  # StateLock#8bde
 
 # Verify an inline reference before relying on it
-assert pattern["sema_ref"] == "StateLock#7cd8"
+assert pattern["sema_ref"] == "StateLock#8bde"
 ```
 
 ### Try the Protocol (No API Keys Needed)
@@ -165,7 +165,7 @@ word = hash(canonical(definition))
 Take any concept (a coordination protocol, a reasoning pattern, a trust mechanism), express it in canonical form, hash it. That hash IS the word. Change one byte in the definition, get a different word.
 
 ```
-Cooperative: sema_handshake("StateLock#7cd8")
+Cooperative: sema_handshake("StateLock#8bde")
              -> PROCEED with assurance="prefix", or HALT
 
 Strict:      sema_handshake("StateLock", "<full 64-char hash>", strict=true)
@@ -194,7 +194,7 @@ When running as an MCP server (`sema mcp`), these tools are available:
 | Tool | Description |
 |------|-------------|
 | `sema_search` | Search patterns by name, description, or meaning |
-| `sema_lookup` | Get a pattern by its reference (e.g., `StateLock#7cd8`) |
+| `sema_lookup` | Get a pattern by its reference (e.g., `StateLock#8bde`) |
 | `sema_resolve` | Get a pattern with dependencies expanded |
 | `sema_handshake` | Fail-closed semantic verification between agents |
 | `sema_mint` | Create a new pattern (validate, hash, add to vocabulary) |
@@ -267,7 +267,7 @@ claude mcp add ug   -- npx -y understanding-graph mcp
 
 With both installed, an agent can:
 
-1. Anchor an understanding-graph decision node in a sema pattern hash (e.g. `StateLock#7cd8`) so the meaning of the primitive can never drift.
+1. Anchor an understanding-graph decision node in a sema pattern hash (e.g. `StateLock#8bde`) so the meaning of the primitive can never drift.
 2. Use `graph_semantic_search` to find all past graph nodes that reference a given sema pattern — hash-stable history, not keyword matching.
 3. Call `sema_handshake` *before* writing a decision that depends on a shared concept; if it returns `HALT`, the agent writes a `tension` node instead and stops, preventing silent divergence.
 
diff --git a/data/design_critique.json b/data/design_critique.json
index d8f3d634..29c3bbfb 100644
--- a/data/design_critique.json
+++ b/data/design_critique.json
@@ -909,39 +909,73 @@
   },
   "Backoff": {
     "motivation": {
-      "why_this_layer": "exponential delay — mechanical primitive",
-      "why_it_exists": "Contention reduction as a typed primitive — every retry loop needs exponential delay with jitter and a cap, and reinventing it per call site produces inconsistent behavior (different multipliers, missing jitter, unbounded growth). Backoff pins the minimum mechanism so every retry loop in the library inherits the same shape.",
-      "removability": "No. Referenced by Retry, ReAttempt, StateLock, Mutex, Lock, Throttle, and every other pattern that has to handle contention. Removing would force each site to re-declare the delay mechanics."
+      "why_this_layer": "failure-responsive delay — mechanical primitive",
+      "why_it_exists": "Retry and contention mechanisms need a shared name for deferring a subsequent attempt without pretending that exponential growth, Fibonacci growth, feedback adaptation, jitter, caps, reset rules, or retry budgets are universal. Backoff pins that reusable family intersection.",
+      "removability": "No. Retry, ReAttempt, CircuitBreaker, StateLock, and Throttle use the shared delay concept. Removing it would force each caller to re-declare the family-level spacing semantics."
     },
     "usage": {
-      "intended": "exponential delay to reduce contention — multiplier growth + jitter + cap.",
-      "future": "exponential retry-delay variants with different caps, jitter distributions, and reset policies.",
+      "intended": "defer a subsequent attempt after failure, rejection, or contention according to a delay policy.",
+      "future": "shared parent for exponential, Fibonacci, fixed, feedback-adaptive, and externally signaled delay strategies.",
       "broad_contexts": "retry backoff, thundering-herd prevention, rate-limit recovery, connection retry, TCP congestion, SaaS API integration.",
-      "every_context_needs": "initial delay, multiplier, jitter, cap.",
-      "varies": "multiplier value, jitter distribution, cap value, reset-on-success semantic, per-target vs global.",
-      "extensions": "`JitteredExponentialBackoff`, `CappedExponentialBackoff`; a generic `Backoff` parent with `ExponentialBackoff`, `FibonacciBackoff`, and `AdaptiveBackoff` children requires a migration.",
+      "every_context_needs": "a triggering failure, rejection, or contention outcome; a caller-selected subsequent attempt; and a policy-derived delay before eligibility.",
+      "varies": "delay progression, feedback inputs, jitter, cap, reset boundary, scope, and retry budget.",
+      "extensions": "`ExponentialBackoff`, `FibonacciBackoff`, `AdaptiveBackoff`, and domain-specific feedback policies.",
       "notes": [
-        "The published hash is specifically exponential despite the general handle; the commentary no longer presents non-exponential strategies as honest descendants of that definition."
+        "The former published definition was specifically exponential. That strategy now lives in `ExponentialBackoff`; the short parent handle contains only the broad-use intersection."
       ]
     },
     "design": {
       "tensions": [
-        "Deterministic policy vs jitter: the mechanism mandates jitter to prevent thundering herd, which is inherently non-deterministic. Callers who need reproducibility have to seed or disable jitter — the pattern doesn't expose the seed.",
-        "Exponential growth vs cap: unbounded growth is catastrophic; bounded growth degrades the 'exponential' property at the cap. The pattern requires the cap but doesn't say what value is reasonable.",
-        "Reset-on-success vs sticky state: the mechanism says reset on success. Some production systems want to keep the backoff growing across independent operations on the same resource (adaptive throttling). That is a descendant concern."
+        "Load reduction vs liveness: longer spacing protects a contested target but delays recovery after conditions improve.",
+        "Local history vs external feedback: some policies derive delay from attempt count while others consume server hints or observed load; the parent must admit both.",
+        "Shared policy vs caller ownership: Backoff determines spacing, while the decision to retry and the retry budget remain with the caller."
       ],
       "tradeoffs": [
-        "Exponential buys rapid contention reduction at the cost of slow recovery from transient failures (a single failed attempt takes exponential time to retry).",
-        "Jitter buys herd prevention at the cost of predictability — the precise retry times are randomized.",
-        "Finite retry budget buys crash-loop prevention at the cost of surrendering on persistent failures that would eventually resolve."
+        "A shared parent makes retry strategies substitutable at the cost of leaving concrete scheduling guarantees to descendants.",
+        "Deferral reduces repeated pressure at the cost of progress latency and possible starvation under unfair contention."
       ],
       "critique": [
-        "The short parent handle squats on the general concept while the hash pins exponential growth, mandatory jitter, reset-on-success, a finite retry budget, and arbitrary numeric ranges.",
-        "`FibonacciBackoff` and `AdaptiveBackoff` cannot honestly derive from this definition because they violate its mechanism. The clean fix is a generic `Backoff` parent plus an `ExponentialBackoff` child, not more contracts on the current parent.",
-        "That split affects the paper's parameter example and a wide dependent subtree, so it is recorded as a dedicated migration rather than silently weakened in this batch. Starvation, synchronized retries, exhaustion before recovery, and retry amplification remain relevant family risks."
+        "The parent is intentionally mechanism-light: adding a multiplier, jitter, cap, reset rule, or finite budget here would again exclude legitimate family members.",
+        "The time-delay mechanism excludes negotiation concession and other metaphorical uses of the English word 'backoff'; those belong to different patterns.",
+        "Starvation, synchronized retries, exhaustion before recovery, and retry amplification remain family-level review risks, but their mitigations depend on the selected descendant and caller policy."
       ]
     },
-    "family_discussion": "The contention-reduction primitive for every retry loop in the library. Composed with `Cooldown` (minimum inter-event gap), `Throttle` (rate cap), and `Hysteresis` (asymmetric thresholds). Used by `Lock`, `Mutex`, `StateLock`, `Retry`, `ReAttempt`, `CircuitBreaker` at the contention layer."
+    "family_discussion": "The parent of concrete delay policies such as `ExponentialBackoff`. Composes with `Cooldown` (minimum inter-event gap), `Throttle` (aggregate rate cap), and retry callers such as `Retry`, `ReAttempt`, and `CircuitBreaker`."
+  },
+  "ExponentialBackoff": {
+    "motivation": {
+      "why_this_layer": "geometrically increasing delay — mechanical strategy",
+      "why_it_exists": "Geometric delay growth is common enough to deserve a precise child instead of occupying the generic Backoff handle. It lets callers request multiplier growth, a cap, and optional jitter without imposing those choices on Fibonacci or feedback-adaptive policies.",
+      "removability": "Removable in capability terms because callers can implement the formula directly, but retaining it gives transient Retry paths an honest, reusable dependency."
+    },
+    "usage": {
+      "intended": "capped geometric delay growth across consecutive unsuccessful attempts.",
+      "future": "exponential retry-delay variants with different multipliers, caps, and jitter factors.",
+      "broad_contexts": "service retries, lock contention, connection recovery, rate-limit recovery, and thundering-herd mitigation.",
+      "every_context_needs": "positive base delay, multiplier greater than one, attempt index, and maximum delay.",
+      "varies": "base delay, multiplier, cap, jitter factor, reset boundary, and caller-owned retry budget.",
+      "extensions": "`DecorrelatedJitterBackoff`, `SeededExponentialBackoff`, and protocol-specific capped variants.",
+      "notes": [
+        "Retry eligibility, finite budgets, and reset conditions are caller policy rather than identity requirements of the delay strategy."
+      ]
+    },
+    "design": {
+      "tensions": [
+        "Rapid load shedding vs recovery latency: geometric growth quickly protects a failing target but can delay useful probes.",
+        "Jitter vs reproducibility: randomization reduces synchronized retries but complicates deterministic schedules and tests.",
+        "Cap vs geometric progression: clamping is operationally necessary but ends pure exponential growth once reached."
+      ],
+      "tradeoffs": [
+        "Geometric growth buys fast contention reduction at the cost of potentially long recovery delays.",
+        "Optional jitter admits both decorrelated production schedules and deterministic callers, so herd prevention is not guaranteed by the child alone."
+      ],
+      "critique": [
+        "A zero jitter factor is valid but leaves synchronized callers exposed; concurrency-heavy callers should select nonzero or decorrelated jitter.",
+        "The formula does not decide whether another attempt is justified. Pair it with Retry, CircuitBreaker, or another caller that owns eligibility and budget.",
+        "Reset policy is deliberately outside the hash; callers must make the sequence boundary explicit when state spans operations."
+      ]
+    },
+    "family_discussion": "A concrete child of `Backoff`, alongside future Fibonacci and feedback-adaptive strategies. Retry selects it specifically for transient failures and may use other Backoff descendants for persistent failures."
   },
   "BackwardChain": {
     "motivation": {
@@ -1979,7 +2013,7 @@
         "False positives from transient blips are the most common production complaint and the pattern offers no built-in debouncing; that's a caller concern."
       ]
     },
-    "family_discussion": "The canonical resilience primitive, paired with Retry (what CircuitBreaker replaces when retries aren't helping), Backoff (what calls it), and FailFast (the CLOSED-to-OPEN transition's semantics). Compare with Throttle — CircuitBreaker is binary (pass or fail), Throttle is graduated (rate limit). Both protect downstream resources, at different operating points."
+    "family_discussion": "The canonical resilience primitive, paired with Retry (what CircuitBreaker replaces when retries aren't helping), Backoff (the delay discipline for recovery probes), and FailFast (the CLOSED-to-OPEN transition's semantics). Compare with Throttle — CircuitBreaker is binary (pass or fail), Throttle is graduated (rate limit). Both protect downstream resources, at different operating points."
   },
   "CiteBack": {
     "motivation": {
@@ -10266,7 +10300,7 @@
     "design": {
       "tensions": [
         "Uncapped reattempts (named failure) vs transient recovery — without caps, amplification into DoS.",
-        "Missing jitter (named failure) — thundering herd on shared resources.",
+        "Concurrent callers vs synchronized reattempts — jitter or another decorrelation strategy belongs in the selected Backoff policy or caller.",
         "Same-call semantics vs parameter variation — ReAttempt is strict same-args; Retry allows variation, and the line is easy to blur."
       ],
       "tradeoffs": [
@@ -10275,7 +10309,7 @@
       ],
       "critique": [
         "Uncapped reattempts are the dominant production failure; the pattern names the failure without prescribing caps.",
-        "Missing jitter is well-known; the pattern acknowledges without built-in jitter mechanism.",
+        "The thundering-herd risk is real, but mandatory jitter would over-specify this substrate primitive; select a jittered Backoff descendant where concurrent callers require it.",
         "The ReAttempt/Retry split is subtle and often ignored; in practice callers often conflate."
       ]
     },
@@ -10962,7 +10996,7 @@
       "broad_contexts": "network failures, rate-limit recovery, API error handling, coordination breaks, verification retries, LLM completion retries, workflow step retries.",
       "every_context_needs": "failure classification, retry decision, backoff computation.",
       "varies": "classification taxonomy (transient/persistent specifics), budget, circuit-breaker integration, retry-hint protocol, jitter strategy.",
-      "extensions": "`ExponentialRetry`, `JitteredRetry`, `BudgetedRetry`, `ClassifiedRetry`. The substrate-level \"try same thing again\" moves to `ReAttempt` in Physics/Primitives (§3.2).",
+      "extensions": "`JitteredRetry`, `BudgetedRetry`, `ClassifiedRetry`. The transient branch composes with `ExponentialBackoff`; the substrate-level \"try same thing again\" moves to `ReAttempt` in Physics/Primitives (§3.2).",
       "notes": []
     },
     "design": {
@@ -10981,7 +11015,7 @@
         "Backoff calibration is caller-dependent and frequently wrong."
       ]
     },
-    "family_discussion": "Resilience primitive paired with Backoff (the delay discipline), ReAttempt (substrate-level), and CircuitBreaker (the cap). Compare with Compensate — Retry attempts the same operation; Compensate unwinds the failed one."
+    "family_discussion": "Resilience primitive paired with Backoff (the delay-policy family), ExponentialBackoff (the transient-failure strategy), ReAttempt (substrate-level), and CircuitBreaker (the cap). Compare with Compensate — Retry attempts the same operation; Compensate unwinds the failed one."
   },
   "Reversibility": {
     "motivation": {
@@ -12720,8 +12754,8 @@
       "intended": "atomic coordination via temporary state fusion — both actors' signatures required.",
       "future": "any \"two-party write agreement\" coordination primitive.",
       "broad_contexts": "two-phase commit, escrow key pairs, multi-signature wallets, joint-authorship protocols, collaborative editing locks, diplomatic joint statements.",
-      "every_context_needs": "state subset, two (or more) actors, temporary fusion, both-sign-to-write, Backoff/Cooldown on contention.",
-      "varies": "multi-party extension, timeout policy, revocation.",
+      "every_context_needs": "state subset, two actors, temporary fusion, both-sign-to-write, and a contention response.",
+      "varies": "selected Backoff policy, multi-party extension, timeout policy, and revocation.",
       "extensions": "`TwoPhaseStateLock`, `MultisigStateLock`, `DiplomaticStateLock`.",
       "notes": []
     },
@@ -12737,12 +12771,12 @@
         "Backoff+Cooldown composition buys contention handling at the cost of lock-family dependency — StateLock doesn't stand alone operationally."
       ],
       "critique": [
-        "Zero invariants listed. For a pattern that carries atomicity semantics, this is a significant gap — at minimum: Both-Signed (changes require both sigs), Symmetric (neither party has unilateral release), Auto-Dissolve-On-Timeout, Signature-Integrity (sigs bind to the specific state subset).",
-        "The three failure modes are correct but partial — missing: Key Compromise (one party's signing key stolen mid-lock), Sig Replay (old signature reused against new state), State-Scope Drift (the 'subset of writable state' changes meaning mid-lock).",
+        "Atomicity obligations currently live in the mechanism rather than a separate invariant list. Any future contract should first prove that it holds across every two-party StateLock context rather than treating field count as the defect.",
+        "Key compromise, signature replay, and state-scope drift are relevant diagnostics for cryptographic deployments, but their mitigations depend on identity and storage descendants rather than belonging automatically in the broad parent hash.",
         "'Temporary fusion' is evocative but operationally vague. What counts as fusion? Is it a third-party escrow? A merged state object? A shared access-control list? The pattern is underdetermined — implementers will pick different mechanisms that claim to be the same pattern."
       ]
     },
-    "family_discussion": "The two-party cross-actor specialization of the Lock family, placed in Society because the mechanism structurally requires a counterparty. Pairs with `Backoff` and `Cooldown` for contention behavior and with `AtomicBid` for multi-agent coordination. Where `Mutex` is one-holder exclusion, `StateLock` is two-party agreement."
+    "family_discussion": "The two-party cross-actor specialization of the Lock family, placed in Society because the mechanism structurally requires a counterparty. Pairs with a selected `Backoff` policy and `Cooldown` for contention behavior, and with `AtomicBid` for multi-agent coordination. Where `Mutex` is one-holder exclusion, `StateLock` is two-party agreement."
   },
   "StateSnapshot": {
     "motivation": {
@@ -13778,7 +13812,7 @@
   "Throttle": {
     "motivation": {
       "why_this_layer": "engineered rate-limiter primitive",
-      "why_it_exists": "Rate limiting as a named primitive — bounded events per time window. Essential for API contracts, queue drainage, and load protection. Different from Backoff (per-failure exponential) and Cooldown (per-action minimum gap): Throttle bounds aggregate rate across many events.",
+      "why_it_exists": "Rate limiting as a named primitive — bounded events per time window. Essential for API contracts, queue drainage, and load protection. Different from Backoff (failure-responsive spacing) and Cooldown (per-action minimum gap): Throttle bounds aggregate rate across many events.",
       "removability": "No. Rate-limiting is a universal concern with enough structure (window, cap, action scope, burst allowance, drop policy) that a shared pattern avoids re-invention. Removing collapses throttling into ad-hoc Cooldown chains."
     },
     "usage": {
@@ -13807,7 +13841,7 @@
         "No priority story — all throttled requests are treated equally; priority-aware throttling needs a different pattern."
       ]
     },
-    "family_discussion": "Completes the rate-control family: `Backoff` (per-retry exponential delay), `Cooldown` (per-action minimum gap), `Throttle` (rate cap per window). The three compose: a retry loop can use Backoff for delay, Cooldown for action-gap, and Throttle for global rate."
+    "family_discussion": "Completes the rate-control family: `Backoff` (failure-responsive attempt spacing), `Cooldown` (per-action minimum gap), and `Throttle` (rate cap per window). The three compose: a retry loop can select a Backoff strategy for delay, Cooldown for action-gap, and Throttle for global rate."
   },
   "TieredAccess": {
     "motivation": {
@@ -15040,12 +15074,12 @@
   },
   "Yield": {
     "motivation": {
-      "why_this_layer": "weighted-negotiation backoff",
-      "why_it_exists": "When Overlap fails, explicit concession with weighted importance resolves. Yield names this structured backoff. Without the pattern, negotiation stalls.",
+      "why_this_layer": "weighted negotiation concession",
+      "why_it_exists": "When Overlap fails, explicit concession with weighted importance resolves. Yield names this structured concession. Without the pattern, negotiation stalls.",
       "removability": "Removable — other negotiation patterns work. The Flex/Weight declaration is the key discipline."
     },
     "usage": {
-      "intended": "negotiation backoff on Overlap failure — lower-weighted preference cedes.",
+      "intended": "negotiation concession on Overlap failure — lower-weighted preference cedes.",
       "future": "any weighted-concession-and-debt-ledger mechanism.",
       "broad_contexts": "labor negotiations, coalition politics, family decision-making, resource sharing, dispute resolution in DAOs, diplomatic negotiation.",
       "every_context_needs": "Flex (concession) declaration, Weight (importance) declaration, Yield-Ratio computation, debt-recording in Ledger.",
@@ -15060,7 +15094,7 @@
         "Hard constraints indistinguishable from strategic intransigence."
       ],
       "tradeoffs": [
-        "Gains: structured negotiation backoff.",
+        "Gains: structured negotiation concession.",
         "Gives up: simplicity."
       ],
       "critique": [
diff --git a/data/presets/full.txt b/data/presets/full.txt
index 5b416655..7f4c569a 100644
--- a/data/presets/full.txt
+++ b/data/presets/full.txt
@@ -82,6 +82,7 @@ Act
 Actor
 Aggregate
 Backoff
+ExponentialBackoff
 Budget
 Care
 CircuitBreaker
diff --git a/data/taxonomy.db b/data/taxonomy.db
index 668e967a..cf33ee9a 100644
Binary files a/data/taxonomy.db and b/data/taxonomy.db differ
diff --git a/data/vocabulary/AgentProtocol.json b/data/vocabulary/AgentProtocol.json
index b9c5ab57..a7232ec5 100644
--- a/data/vocabulary/AgentProtocol.json
+++ b/data/vocabulary/AgentProtocol.json
@@ -16,9 +16,9 @@
       "Protocols"
     ]
   },
-  "sema_id": "sema:AgentProtocol#mh:SHA-256:e6b4b936738cd1077a7a360a0c4f069590627d1676ee7c251a2f66e8d3a34ee9",
-  "sema_ref": "AgentProtocol#e6b4",
-  "sema_stub": "e6b4",
+  "sema_id": "sema:AgentProtocol#mh:SHA-256:6297fe3d5b335cbe8051e147ce3235c33d30bce2f4df5ad274b18ae98b502878",
+  "sema_ref": "AgentProtocol#6297",
+  "sema_stub": "6297",
   "signature": [
     "Agent(Protocol)"
   ],
@@ -26,7 +26,7 @@
     "references": {
       "accept_spec": "sema:AcceptSpec#mh:SHA-256:c1565bf022e5596a447f7c9d9687ac3cbf1e6960f871be16f386eec02b5df2c4",
       "agent": "sema:Agent#mh:SHA-256:67659e263616d53dded32875421792f42fadf3137c87fe09cf9f5b9c163f10cf",
-      "fail_closed": "sema:FailClosed#mh:SHA-256:408814ddae0d3fa2b4022f997c1feab5eef743a155cdedeba75bc42d26e467ac",
+      "fail_closed": "sema:FailClosed#mh:SHA-256:eae70da02880916a695d85d3752a59e16201c9f81b8a9af238d31863b3b6b157",
       "greet": "sema:Greet#mh:SHA-256:58542bc100077ab85299c99424fa0ca7ea8559890678461a0d7f7aaba927c74f",
       "protocol": "sema:Protocol#mh:SHA-256:e53765fe6abfb95285f1b698b11cc01ab3f7e1d8f82f57186f60127d92c564db",
       "solution": "sema:Solution#mh:SHA-256:48442c3e14ce25ef325cbff085d095ecf4c7735b006f162eb76e23d4315f8fa2",
diff --git a/data/vocabulary/AmbiguityResolution.json b/data/vocabulary/AmbiguityResolution.json
index 12be053e..ebf4d5b8 100644
--- a/data/vocabulary/AmbiguityResolution.json
+++ b/data/vocabulary/AmbiguityResolution.json
@@ -18,13 +18,13 @@
       "Protocols"
     ]
   },
-  "sema_ref": "AmbiguityResolution#4c6b",
-  "sema_id": "sema:AmbiguityResolution#mh:SHA-256:4c6b0db38986110f6518c3cca2657cc627ffeb0bde5986fa7ad84bcfab868424",
-  "sema_stub": "4c6b",
+  "sema_ref": "AmbiguityResolution#ede0",
+  "sema_id": "sema:AmbiguityResolution#mh:SHA-256:ede07da7ba005a40e31635c0f168f38e16f569a84bb1a57d8ca16555af403220",
+  "sema_stub": "ede0",
   "dependencies": {
     "composes_with": {
       "entropy_pump": "sema:EntropyPump#mh:SHA-256:31cfc8a45ee0ea7751661386771342dc841503e4f1af65400f1f6bb95f9cd9b7",
-      "vote": "sema:Vote#mh:SHA-256:3b66510363464c335c95a843247ddd37bbb98616a17f6a8d4bb17b1ac91bd41c"
+      "vote": "sema:Vote#mh:SHA-256:0affbbc722d42218027f581176be08d0a66c9a3dc99adbf94d411ef9fc38786c"
     }
   },
   "sema_layer": "Society",
diff --git a/data/vocabulary/AnchorDrop.json b/data/vocabulary/AnchorDrop.json
index 033d36c3..40de5379 100644
--- a/data/vocabulary/AnchorDrop.json
+++ b/data/vocabulary/AnchorDrop.json
@@ -30,13 +30,13 @@
       "Governance"
     ]
   },
-  "sema_id": "sema:AnchorDrop#mh:SHA-256:695ed5829808e8da3d42e7a5110adf1ec1656bba6b9798566f037c8367b9a16a",
-  "sema_ref": "AnchorDrop#695e",
-  "sema_stub": "695e",
+  "sema_id": "sema:AnchorDrop#mh:SHA-256:4196dd5918edf55c99ed25b195f117741d53ba8dd4e7f508e0703df2b4620c54",
+  "sema_ref": "AnchorDrop#4196",
+  "sema_stub": "4196",
   "dependencies": {
     "references": {
-      "consensus": "sema:Consensus#mh:SHA-256:45f490890803e907aa12e85c4751fed8e7f7273f4530fa35f5bd1713a46e3630",
-      "quorum": "sema:Quorum#mh:SHA-256:c6a5b21dbe9b2c1fa46e5e67505041c92048a0a687f5703efa45486b51c56957",
+      "consensus": "sema:Consensus#mh:SHA-256:05264b8eb7ea117841041f266bf2882404e981604258205e5621acb816a7e708",
+      "quorum": "sema:Quorum#mh:SHA-256:d634d5cf0f165f708a5f39e54d8ad42716c11e21189459585468a294d2ebc7bc",
       "system": "sema:System#mh:SHA-256:f8eb318a1113a10fead02fbf14ae433767ac1a69c9579cdb584cc622068e90b3"
     }
   },
diff --git a/data/vocabulary/AtomicBid.json b/data/vocabulary/AtomicBid.json
index ac749f30..8af27f93 100644
--- a/data/vocabulary/AtomicBid.json
+++ b/data/vocabulary/AtomicBid.json
@@ -23,18 +23,18 @@
       "Economics"
     ]
   },
-  "sema_ref": "AtomicBid#33e1",
-  "sema_id": "sema:AtomicBid#mh:SHA-256:33e1d5689a56922e56ffedb768c82621a62e207160fc4f97228e5dddac588d65",
-  "sema_stub": "33e1",
+  "sema_ref": "AtomicBid#9c0c",
+  "sema_id": "sema:AtomicBid#mh:SHA-256:9c0c78d25ef587cbb5802e4e9243055062fa27a45f30d46896d464c840a35fcd",
+  "sema_stub": "9c0c",
   "dependencies": {
     "composes_with": {
       "act": "sema:Act#mh:SHA-256:7616721cda9e81613f7c97d4ac93ba49291f97d7c7fe6fd7c49588c33d4d3b3d",
-      "bid": "sema:Bid#mh:SHA-256:5c45e9bd8858829e5a5cde5ad4f3ab26f4bb6937f88c1ddde40798b58799a266",
-      "compensate": "sema:Compensate#mh:SHA-256:9b3b07b7a02d00b6df1ecc3ee69fa3dcd2b33e07f045c67f26deb6cf311694f2"
+      "bid": "sema:Bid#mh:SHA-256:1ebadf0e232c35605addcb43f2c2ceab124a7f710c0471cefb989189661c8d3a",
+      "compensate": "sema:Compensate#mh:SHA-256:e23bc7c0d3825460855e7ee5e2e41f512ff8e318ad741b1ba4e0303cb66e39b9"
     },
     "references": {
       "audit": "sema:Audit#mh:SHA-256:be970add829f4f162533569b04c9ffd12ea4d070d53405a4993f0785d4074f77",
-      "lazy_consensus": "sema:LazyConsensus#mh:SHA-256:cb1be5ea25df833482f581771c52a12c2f24b1865b13306e18f6423a99fa94f0"
+      "lazy_consensus": "sema:LazyConsensus#mh:SHA-256:1c07589188212ac8d7519eb64501c0e6c21d9028fc6a4026adf572b5b2db77ab"
     }
   },
   "sema_layer": "Society",
diff --git a/data/vocabulary/AttentionMarkets.json b/data/vocabulary/AttentionMarkets.json
index fefc4d08..8926cbdd 100644
--- a/data/vocabulary/AttentionMarkets.json
+++ b/data/vocabulary/AttentionMarkets.json
@@ -33,12 +33,12 @@
       "Economics"
     ]
   },
-  "sema_id": "sema:AttentionMarkets#mh:SHA-256:787e196833bbf6e6f914b37f1097fe555e6d4197a71afe9de60a6772cc41e593",
-  "sema_ref": "AttentionMarkets#787e",
-  "sema_stub": "787e",
+  "sema_id": "sema:AttentionMarkets#mh:SHA-256:faf81f5f0d5d6d9bf0b6ac33732c08fb90d5574d168377c5c908295f978fcf13",
+  "sema_ref": "AttentionMarkets#faf8",
+  "sema_stub": "faf8",
   "dependencies": {
     "composes_with": {
-      "continuous_resource_auction": "sema:ContinuousResourceAuction#mh:SHA-256:15530861d00609a281c40ecd368dda8f2a8e15181bef54b2532752f50348e290"
+      "continuous_resource_auction": "sema:ContinuousResourceAuction#mh:SHA-256:8fe283f5ae6bd9adcf164ba848bcc731863b0f232f2dbc4fa8c389f70eb8184c"
     },
     "references": {
       "signal": "sema:Signal#mh:SHA-256:2ac0768f06e77d96b5d0bf8204205f519a24d704d496ce59519c9e8ddd546ab2",
diff --git a/data/vocabulary/AuditTrail.json b/data/vocabulary/AuditTrail.json
index b67fbf50..413d2735 100644
--- a/data/vocabulary/AuditTrail.json
+++ b/data/vocabulary/AuditTrail.json
@@ -37,9 +37,9 @@
       "Verification"
     ]
   },
-  "sema_ref": "AuditTrail#bf18",
-  "sema_id": "sema:AuditTrail#mh:SHA-256:bf18738b25414c907d542cc6971b13ecf1fb7b415d10529f1c398a1e08109f92",
-  "sema_stub": "bf18",
+  "sema_ref": "AuditTrail#b441",
+  "sema_id": "sema:AuditTrail#mh:SHA-256:b4419b5e90a6a7c5433fe5bcb459ca9fbff9cbd7d48ccf9b44b0b64166959551",
+  "sema_stub": "b441",
   "dependencies": {
     "composes_with": {
       "snapshot": "sema:Snapshot#mh:SHA-256:390d2ec2934136d534f969b4039e6b899d2ed3956ddd8aa0ca4754068ed8d133"
@@ -49,7 +49,7 @@
       "audit": "sema:Audit#mh:SHA-256:be970add829f4f162533569b04c9ffd12ea4d070d53405a4993f0785d4074f77",
       "identity": "sema:Identity#mh:SHA-256:bfe236a2c243ed664189c99afcb9f16225b6d56cbb11e6e29522756b33c47427",
       "ledger": "sema:Ledger#mh:SHA-256:bc308b35d2c0be6d4a9159ebe2b3c4989e559628145ba9fccb970d8ec2264b04",
-      "monotonic_counter": "sema:MonotonicCounter#mh:SHA-256:21c63e6bc594106fb6bd773e2d91a2ecb0aebb43e550d55cfbe901e6a38628a3",
+      "monotonic_counter": "sema:MonotonicCounter#mh:SHA-256:33824eaaf148d996cbc3ccd7521b62dbba087070d23b5421918a446df3f01c8b",
       "sign": "sema:Sign#mh:SHA-256:d89a18b44321e4b9ba9aada7ac698f69ef9f24a2b0d92e0906168554604a301c",
       "trace": "sema:Trace#mh:SHA-256:314d8d38e6de13bf191dd0d368c8c1bcf7a2d4953b165f66daf7188b90dc37ab"
     }
diff --git a/data/vocabulary/Award.json b/data/vocabulary/Award.json
index 2e0ef5fe..6db0f0c5 100644
--- a/data/vocabulary/Award.json
+++ b/data/vocabulary/Award.json
@@ -21,20 +21,20 @@
       "Economics"
     ]
   },
-  "sema_ref": "Award#af8e",
-  "sema_id": "sema:Award#mh:SHA-256:af8e239d97dd719c5e42fbc977e8b3a67a0aa31bd3f788883dea1475098ef976",
-  "sema_stub": "af8e",
+  "sema_ref": "Award#6e69",
+  "sema_id": "sema:Award#mh:SHA-256:6e6927d595e808597bf98b0955dab81ee889122e4c2e2bbb0c094697969f57c9",
+  "sema_stub": "6e69",
   "dependencies": {
     "accepts": {
-      "bid": "sema:Bid#mh:SHA-256:5c45e9bd8858829e5a5cde5ad4f3ab26f4bb6937f88c1ddde40798b58799a266"
+      "bid": "sema:Bid#mh:SHA-256:1ebadf0e232c35605addcb43f2c2ceab124a7f710c0471cefb989189661c8d3a"
     },
     "composes_with": {
       "act": "sema:Act#mh:SHA-256:7616721cda9e81613f7c97d4ac93ba49291f97d7c7fe6fd7c49588c33d4d3b3d",
-      "held_release": "sema:HeldRelease#mh:SHA-256:533b77d8341545dd80bd5a940492f028059ee8105cf523b26e4c16736ced46a5",
+      "held_release": "sema:HeldRelease#mh:SHA-256:10b0ae36dabba68fe8aad67adf8075ce5a5f0b2a3bb602c7bd3380b0dd0117d9",
       "sign": "sema:Sign#mh:SHA-256:d89a18b44321e4b9ba9aada7ac698f69ef9f24a2b0d92e0906168554604a301c"
     },
     "references": {
-      "solver": "sema:Solver#mh:SHA-256:04b58c815005971905e3d430112a06fb76b727882204a80fe58ace79b066a1d6",
+      "solver": "sema:Solver#mh:SHA-256:b7f9e18fec50d288ea829a21a59de02f65cf1ffe3eef07142389d659bd421d02",
       "state": "sema:State#mh:SHA-256:4f25e6a16ccd37dc0bc154cccc7055cb504d49daa8b712f372a425eb6c7b8cb2",
       "value": "sema:Value#mh:SHA-256:37fd75758d04cdd7f57a636ccb5394d463713d60c33b694e37ab71f4a5a896f8"
     },
diff --git a/data/vocabulary/Backoff.json b/data/vocabulary/Backoff.json
index a2c3ef51..564f1deb 100644
--- a/data/vocabulary/Backoff.json
+++ b/data/vocabulary/Backoff.json
@@ -1,47 +1,22 @@
 {
   "handle": "Backoff",
-  "mechanism": "Exponential Delay: On failure, wait delay D before retry. On repeated failure, D *= multiplier (typically 2). Add jitter to prevent thundering herd. Cap at maximum delay. Reset on success.",
-  "gloss": "Exponential delay to reduce contention",
-  "failure_modes": [
-    "Starvation: Unlucky agents keep backing off while others succeed, never getting a slot."
-  ],
-  "invariants": [
-    "Retry budget must be finite (max_attempts set before first attempt)."
-  ],
-  "parameters": [
-    {
-      "name": "base_delay",
-      "type": "Duration",
-      "range": "[100ms, 10s]",
-      "description": "Initial wait before retry"
-    },
-    {
-      "name": "jitter_factor",
-      "type": "Float",
-      "range": "[0.0, 0.5]",
-      "description": "Randomization to prevent thundering herd"
-    },
-    {
-      "name": "max_retries",
-      "type": "Integer",
-      "range": "[1, 10]",
-      "description": "Attempts before permanent failure"
-    }
-  ],
+  "mechanism": "After an attempt encounters failure, rejection, or contention and a caller elects to try again, defer the next eligible attempt according to a delay policy. The policy may derive the delay from attempt count, failure history, feedback, or external conditions. Backoff supplies spacing; retry eligibility and retry budgets remain caller policy.",
+  "gloss": "Delay subsequent attempts after failure or contention",
   "_meta": {
     "tier": 2,
     "ring": 0,
     "supersedes": [
-      "sema:Backoff#mh:SHA-256:315a36ef873a63c30740ce89b1aeb542836a068ef0d81a6e3aaaec062d70bc60"
+      "sema:Backoff#mh:SHA-256:315a36ef873a63c30740ce89b1aeb542836a068ef0d81a6e3aaaec062d70bc60",
+      "sema:Backoff#mh:SHA-256:16c2d636281df44ed78ef3bce341e7a349fd37cbd675706e2e395172c1dccae6"
     ],
     "path": [
       "Infrastructure",
       "Primitives"
     ]
   },
-  "sema_id": "sema:Backoff#mh:SHA-256:16c2d636281df44ed78ef3bce341e7a349fd37cbd675706e2e395172c1dccae6",
-  "sema_ref": "Backoff#16c2",
-  "sema_stub": "16c2",
+  "sema_id": "sema:Backoff#mh:SHA-256:9e59718422f5408d7892feccb6d538a21103f9573b122b891ee3c8cf66303e72",
+  "sema_ref": "Backoff#9e59",
+  "sema_stub": "9e59",
   "sema_layer": "Infrastructure",
   "sema_category": "Primitives"
 }
\ No newline at end of file
diff --git a/data/vocabulary/Ballot.json b/data/vocabulary/Ballot.json
index 3a7b5d09..497b37bc 100644
--- a/data/vocabulary/Ballot.json
+++ b/data/vocabulary/Ballot.json
@@ -57,12 +57,12 @@
       }
     }
   },
-  "sema_ref": "Ballot#43eb",
-  "sema_id": "sema:Ballot#mh:SHA-256:43ebc85e8e87e132698c59536402d1ba715b0dbad9e6c116f97a056c60da4577",
-  "sema_stub": "43eb",
+  "sema_ref": "Ballot#84c3",
+  "sema_id": "sema:Ballot#mh:SHA-256:84c3ea1db9fa8ab818d4fd156a8ef0a43d15b50419ca42236869bd9119f35497",
+  "sema_stub": "84c3",
   "dependencies": {
     "references": {
-      "monotonic_counter": "sema:MonotonicCounter#mh:SHA-256:21c63e6bc594106fb6bd773e2d91a2ecb0aebb43e550d55cfbe901e6a38628a3",
+      "monotonic_counter": "sema:MonotonicCounter#mh:SHA-256:33824eaaf148d996cbc3ccd7521b62dbba087070d23b5421918a446df3f01c8b",
       "select": "sema:Select#mh:SHA-256:2fa0da3874e2a9a2c8664ed919d03c28a1f6b76daf9621f069d1ca1cb18a64b6"
     }
   },
diff --git a/data/vocabulary/BeamSearch.json b/data/vocabulary/BeamSearch.json
index ecb0b1c3..82767b02 100644
--- a/data/vocabulary/BeamSearch.json
+++ b/data/vocabulary/BeamSearch.json
@@ -26,15 +26,15 @@
       "Strategy"
     ]
   },
-  "sema_id": "sema:BeamSearch#mh:SHA-256:fc0a0d78a67aeda031b4316da9d81b9918064f81e06ceeb198ebfd30976e9b0b",
-  "sema_ref": "BeamSearch#fc0a",
-  "sema_stub": "fc0a",
+  "sema_id": "sema:BeamSearch#mh:SHA-256:70d31a67347fab104678e9d6038acfd4b42b5c46967c71d6090b443b0a27fd14",
+  "sema_ref": "BeamSearch#70d3",
+  "sema_stub": "70d3",
   "dependencies": {
     "references": {
       "queue": "sema:Queue#mh:SHA-256:52224702509927c0b69df5580e0554e4ca381f93d291a08d7b2e8d4eaf04cdb2",
       "rank": "sema:Rank#mh:SHA-256:44ff9eebfbb89e603509718bad8954e38aa800ed22b697bb853e781aea9cb104",
       "select": "sema:Select#mh:SHA-256:2fa0da3874e2a9a2c8664ed919d03c28a1f6b76daf9621f069d1ca1cb18a64b6",
-      "solver_node": "sema:SolverNode#mh:SHA-256:fd50fc5063ba52d2670169e4a8388e475cdc69084de648606236716f9ccc13b4"
+      "solver_node": "sema:SolverNode#mh:SHA-256:45292efbd4e607174b8e0b82535d8bede20eb408a9d341b86742e1db2982ea1a"
     }
   },
   "sema_layer": "Mind",
diff --git a/data/vocabulary/BeliefTracking.json b/data/vocabulary/BeliefTracking.json
index 1f47b489..641aa42c 100644
--- a/data/vocabulary/BeliefTracking.json
+++ b/data/vocabulary/BeliefTracking.json
@@ -43,15 +43,15 @@
       "Memory"
     ]
   },
-  "sema_id": "sema:BeliefTracking#mh:SHA-256:6142b1c96257501505d4af3e9985e1845d80257b9db3d60e7892765373cca398",
-  "sema_ref": "BeliefTracking#6142",
-  "sema_stub": "6142",
+  "sema_id": "sema:BeliefTracking#mh:SHA-256:6f91264f8bcb9a1eba37e37adf40c9fe779135fb88b8a7748de81c9f76c75c76",
+  "sema_ref": "BeliefTracking#6f91",
+  "sema_stub": "6f91",
   "dependencies": {
     "references": {
       "agent": "sema:Agent#mh:SHA-256:67659e263616d53dded32875421792f42fadf3137c87fe09cf9f5b9c163f10cf",
       "belief": "sema:Belief#mh:SHA-256:7d838b98686e17c69e96df09b2c7ec870df22bba9a9bd02dc29bd62be41d5da8",
       "cognitive_bias": "sema:CognitiveBias#mh:SHA-256:c8a4abe2e0ce048be16d25f890a50f8c7095e099b5ab2de23aa059942328f387",
-      "surprisal_update": "sema:SurprisalUpdate#mh:SHA-256:6169da6dce9141595fc8b7ac8d8743e397cd44a2da04b3499b2ce910e174c2ef"
+      "surprisal_update": "sema:SurprisalUpdate#mh:SHA-256:41a9f896757eb4b0d7132604b60e0193eaba43329953359ef5e927f69112f8df"
     }
   },
   "sema_layer": "Mind",
diff --git a/data/vocabulary/Bid.json b/data/vocabulary/Bid.json
index 00df2687..5f777537 100644
--- a/data/vocabulary/Bid.json
+++ b/data/vocabulary/Bid.json
@@ -67,16 +67,16 @@
       "Economics"
     ]
   },
-  "sema_ref": "Bid#5c45",
-  "sema_id": "sema:Bid#mh:SHA-256:5c45e9bd8858829e5a5cde5ad4f3ab26f4bb6937f88c1ddde40798b58799a266",
-  "sema_stub": "5c45",
+  "sema_ref": "Bid#1eba",
+  "sema_id": "sema:Bid#mh:SHA-256:1ebadf0e232c35605addcb43f2c2ceab124a7f710c0471cefb989189661c8d3a",
+  "sema_stub": "1eba",
   "dependencies": {
     "references": {
       "artifact": "sema:Artifact#mh:SHA-256:379aeed82460aa1a42442f89572d8e621f93f900aa56686b5962dd7800adaec3",
       "budget": "sema:Budget#mh:SHA-256:f2f58874eaeb0600039600ba5b26064164c225fd44482b269ae94e37a9df15b4",
       "commitment_device": "sema:CommitmentDevice#mh:SHA-256:dbdbd8b26ed1104714cdfb072d548747682e428e086e9ea0b9c963b79f9877d4",
       "compute_budget": "sema:ComputeBudget#mh:SHA-256:47c6eb12f7537f418cdfa9358a501b394d3b4460dd2f8c85560687b1e782b8c2",
-      "solver": "sema:Solver#mh:SHA-256:04b58c815005971905e3d430112a06fb76b727882204a80fe58ace79b066a1d6",
+      "solver": "sema:Solver#mh:SHA-256:b7f9e18fec50d288ea829a21a59de02f65cf1ffe3eef07142389d659bd421d02",
       "task": "sema:Task#mh:SHA-256:f239278f610adea7e01a9fd019dc6be158a31919d61d301856dcbe2aa8b67804",
       "value": "sema:Value#mh:SHA-256:37fd75758d04cdd7f57a636ccb5394d463713d60c33b694e37ab71f4a5a896f8"
     }
diff --git a/data/vocabulary/BreadthGovernor.json b/data/vocabulary/BreadthGovernor.json
index 09c5aaf2..b19cf512 100644
--- a/data/vocabulary/BreadthGovernor.json
+++ b/data/vocabulary/BreadthGovernor.json
@@ -43,9 +43,9 @@
       "Inference"
     ]
   },
-  "sema_id": "sema:BreadthGovernor#mh:SHA-256:c7ea1965d69acf5735eb3e6bc1cb21a2d8308b8b115d115c443dfc4bb949e719",
-  "sema_ref": "BreadthGovernor#c7ea",
-  "sema_stub": "c7ea",
+  "sema_id": "sema:BreadthGovernor#mh:SHA-256:5e8cc0b3df0dc29c7a5586040b965e5beb4d49d578145ae799f895f4dcf0d193",
+  "sema_ref": "BreadthGovernor#5e8c",
+  "sema_stub": "5e8c",
   "dependencies": {
     "references": {
       "budget": "sema:Budget#mh:SHA-256:f2f58874eaeb0600039600ba5b26064164c225fd44482b269ae94e37a9df15b4",
@@ -53,7 +53,7 @@
       "decompose": "sema:Decompose#mh:SHA-256:63f31488a348d1176b6b16e770c69f196c2e03f507a240103e8297487dc4f652",
       "parallel": "sema:Parallel#mh:SHA-256:e799c1986d62c4a052090842aabe144193587f8a4d8dd23617d027b2e9b85098",
       "parsimony": "sema:Parsimony#mh:SHA-256:bbc62c0fd9b1d71a06a781b4e40cf2988b6e2b61a113bf62d7ebd3ad0f149351",
-      "prophet_fan_out": "sema:ProphetFanOut#mh:SHA-256:d47b1a26c9627e3a31433c130549fcbc96ac37bca1bd17536a15230f94dd5095",
+      "prophet_fan_out": "sema:ProphetFanOut#mh:SHA-256:b0f338cae3235461586e3303452b74e696b33b77e971e9a0c34b1b7e3b0292f6",
       "value": "sema:Value#mh:SHA-256:37fd75758d04cdd7f57a636ccb5394d463713d60c33b694e37ab71f4a5a896f8"
     }
   },
diff --git a/data/vocabulary/CausalBarrier.json b/data/vocabulary/CausalBarrier.json
index b1c39202..1081fa26 100644
--- a/data/vocabulary/CausalBarrier.json
+++ b/data/vocabulary/CausalBarrier.json
@@ -42,13 +42,13 @@
       "Time"
     ]
   },
-  "sema_id": "sema:CausalBarrier#mh:SHA-256:39b3168c5b9bad18505b7af584fbb24b80ba7c5bf90e6ff0611fc2cd405f0178",
-  "sema_ref": "CausalBarrier#39b3",
-  "sema_stub": "39b3",
+  "sema_id": "sema:CausalBarrier#mh:SHA-256:9e178f07d754eefadad17a92a84f76badce58bd00571dca64b37e83176a57e94",
+  "sema_ref": "CausalBarrier#9e17",
+  "sema_stub": "9e17",
   "dependencies": {
     "references": {
       "agent": "sema:Agent#mh:SHA-256:67659e263616d53dded32875421792f42fadf3137c87fe09cf9f5b9c163f10cf",
-      "state_lock": "sema:StateLock#mh:SHA-256:7cd86a9de68522b752366ef04de32f743b57ef16232866522ccdafb1f35c6da9"
+      "state_lock": "sema:StateLock#mh:SHA-256:8bde7c49752578e5c76e46d33b995497728f486d69d99ff618b9dbeaa7586c78"
     }
   },
   "sema_layer": "Physics",
diff --git a/data/vocabulary/CircuitBreaker.json b/data/vocabulary/CircuitBreaker.json
index 36e0adc2..088162a0 100644
--- a/data/vocabulary/CircuitBreaker.json
+++ b/data/vocabulary/CircuitBreaker.json
@@ -51,12 +51,12 @@
       "Primitives"
     ]
   },
-  "sema_ref": "CircuitBreaker#840f",
-  "sema_id": "sema:CircuitBreaker#mh:SHA-256:840fee4c2a300c1e17bd44e55debdf58d250ab62f79760f59c0189ca7d485824",
-  "sema_stub": "840f",
+  "sema_ref": "CircuitBreaker#3caa",
+  "sema_id": "sema:CircuitBreaker#mh:SHA-256:3caa9c387c04bb2ac66ec35a6cfe2665e11339f0d47576b96d68229226580c76",
+  "sema_stub": "3caa",
   "dependencies": {
     "references": {
-      "backoff": "sema:Backoff#mh:SHA-256:16c2d636281df44ed78ef3bce341e7a349fd37cbd675706e2e395172c1dccae6",
+      "backoff": "sema:Backoff#mh:SHA-256:9e59718422f5408d7892feccb6d538a21103f9573b122b891ee3c8cf66303e72",
       "state": "sema:State#mh:SHA-256:4f25e6a16ccd37dc0bc154cccc7055cb504d49daa8b712f372a425eb6c7b8cb2"
     }
   },
diff --git a/data/vocabulary/CiteBack.json b/data/vocabulary/CiteBack.json
index 1e8e9367..4c78326e 100644
--- a/data/vocabulary/CiteBack.json
+++ b/data/vocabulary/CiteBack.json
@@ -27,12 +27,12 @@
       "Reasoning"
     ]
   },
-  "sema_id": "sema:CiteBack#mh:SHA-256:77855c554890913b6c7c61f5a947a502b47171f04f333ab4bcfc72e136bfd30b",
-  "sema_ref": "CiteBack#7785",
-  "sema_stub": "7785",
+  "sema_id": "sema:CiteBack#mh:SHA-256:17b1ece87db4152c4a241754f84c4722fe9dde9fa8c00c1e122e4e6139196b86",
+  "sema_ref": "CiteBack#17b1",
+  "sema_stub": "17b1",
   "dependencies": {
     "references": {
-      "retrieval_augment": "sema:RetrievalAugment#mh:SHA-256:7ca744ce28611156f415add4da95e3dc93006d92061a05139e17b70d3882e848"
+      "retrieval_augment": "sema:RetrievalAugment#mh:SHA-256:046a23973b254ab3ca9ee8d892c6a2a43f0ccba6145197d0f1fe3b92f1feec63"
     }
   },
   "sema_layer": "Mind",
diff --git a/data/vocabulary/CollaborativeWritingProtocol.json b/data/vocabulary/CollaborativeWritingProtocol.json
index 845f2c28..0beae877 100644
--- a/data/vocabulary/CollaborativeWritingProtocol.json
+++ b/data/vocabulary/CollaborativeWritingProtocol.json
@@ -15,13 +15,13 @@
       "Reasoning"
     ]
   },
-  "sema_id": "sema:CollaborativeWritingProtocol#mh:SHA-256:8a1a98d844e31dcb7abdefc974d73d7dab771de960324cf8258684ad60946a6c",
-  "sema_ref": "CollaborativeWritingProtocol#8a1a",
-  "sema_stub": "8a1a",
+  "sema_id": "sema:CollaborativeWritingProtocol#mh:SHA-256:f5cba7a26166a0a3f048cf7f5a451d3bf3dc48c70549e54598cdea9d5401a564",
+  "sema_ref": "CollaborativeWritingProtocol#f5cb",
+  "sema_stub": "f5cb",
   "dependencies": {
     "composes_with": {
-      "conceptual_decomposition": "sema:ConceptualDecomposition#mh:SHA-256:3cf20e30a632b0a7ab64a7fb2984fe64b106ba7819af458fa5e260aa89853b1d",
-      "marginal_value_rule": "sema:MarginalValueRule#mh:SHA-256:eebb10656ec6d554fa7bba3a98b2b9ba1207d58b31d0a794563605595af0f026"
+      "conceptual_decomposition": "sema:ConceptualDecomposition#mh:SHA-256:2cce877b501c3fe1fdf646e3c5ad3157b26502b7a6f7c943dfff389c055aa25a",
+      "marginal_value_rule": "sema:MarginalValueRule#mh:SHA-256:552ffce38f8fecae07f9faf905f0662ed284531904a94d55da19030138ff941d"
     }
   },
   "sema_layer": "Mind",
diff --git a/data/vocabulary/Compensate.json b/data/vocabulary/Compensate.json
index 0e246f9e..39c1d382 100644
--- a/data/vocabulary/Compensate.json
+++ b/data/vocabulary/Compensate.json
@@ -38,14 +38,14 @@
       "Primitives"
     ]
   },
-  "sema_id": "sema:Compensate#mh:SHA-256:9b3b07b7a02d00b6df1ecc3ee69fa3dcd2b33e07f045c67f26deb6cf311694f2",
-  "sema_ref": "Compensate#9b3b",
-  "sema_stub": "9b3b",
+  "sema_id": "sema:Compensate#mh:SHA-256:e23bc7c0d3825460855e7ee5e2e41f512ff8e318ad741b1ba4e0303cb66e39b9",
+  "sema_ref": "Compensate#e23b",
+  "sema_stub": "e23b",
   "dependencies": {
     "references": {
       "break": "sema:Break#mh:SHA-256:3c370fec3d297e00ea2321826e420a429f65fc5f5da5ac61b844c821aef41018",
       "system": "sema:System#mh:SHA-256:f8eb318a1113a10fead02fbf14ae433767ac1a69c9579cdb584cc622068e90b3",
-      "time_warp_log": "sema:TimeWarpLog#mh:SHA-256:e26edd5011e4842730b23fb11a2d5efaff9a52112e8081f5856893c9c4ce99ff"
+      "time_warp_log": "sema:TimeWarpLog#mh:SHA-256:2a101afbc167bce00efa25a0439774ab1b30ef094facfaf2b8f9a5edb1b54269"
     }
   },
   "sema_layer": "Infrastructure",
diff --git a/data/vocabulary/Compose.json b/data/vocabulary/Compose.json
index 423ac876..4d6b0801 100644
--- a/data/vocabulary/Compose.json
+++ b/data/vocabulary/Compose.json
@@ -34,14 +34,14 @@
   "signature": [
     "Combine(PromptChain)"
   ],
-  "sema_id": "sema:Compose#mh:SHA-256:57a9ff741d662d36173ef6bf5c5ecf2db16972e5ee9b7bae9559ce1fa24775fa",
-  "sema_ref": "Compose#57a9",
-  "sema_stub": "57a9",
+  "sema_id": "sema:Compose#mh:SHA-256:4fa274d804d83c00006408b8f436aa8c3a6cd60f23c0b3c56ca0ba4a50ff3c23",
+  "sema_ref": "Compose#4fa2",
+  "sema_stub": "4fa2",
   "dependencies": {
     "references": {
       "check": "sema:Check#mh:SHA-256:22ecc8bd2d86f344a11551e3bae74a97660e47b1127739e8a84f88f4791960c8",
       "combine": "sema:Combine#mh:SHA-256:c465eb2ec32d4de2329827dbd943672f5f0b675716af0aca501ce9d157e309b9",
-      "prompt_chain": "sema:PromptChain#mh:SHA-256:2543cc5972f02b5a21d776643ba485beda876462c57a10c8949d0072e54bd620"
+      "prompt_chain": "sema:PromptChain#mh:SHA-256:50975454f45cce4e45ae4590cd99cee4401596df424ffac720c699609dcc01a6"
     }
   },
   "sema_layer": "Mind",
diff --git a/data/vocabulary/Compromise.json b/data/vocabulary/Compromise.json
index 0fae8dd9..02744ff9 100644
--- a/data/vocabulary/Compromise.json
+++ b/data/vocabulary/Compromise.json
@@ -13,9 +13,9 @@
       "Coordination"
     ]
   },
-  "sema_ref": "Compromise#228b",
-  "sema_id": "sema:Compromise#mh:SHA-256:228b2583a138a2eefc86eda678d6449b0501c7db93f51e046d39e8910c421042",
-  "sema_stub": "228b",
+  "sema_ref": "Compromise#e980",
+  "sema_id": "sema:Compromise#mh:SHA-256:e9805676dd932da2df8070224cecf39aed41c672abfd8ccbd2734c246c760645",
+  "sema_stub": "e980",
   "dependencies": {
     "composes_with": {
       "dampen": "sema:Dampen#mh:SHA-256:5edd829087aefc086843183dd2361355777d5c2237456e2de72f315e45ffc3a4"
@@ -23,7 +23,7 @@
     "references": {
       "agent": "sema:Agent#mh:SHA-256:67659e263616d53dded32875421792f42fadf3137c87fe09cf9f5b9c163f10cf",
       "system": "sema:System#mh:SHA-256:f8eb318a1113a10fead02fbf14ae433767ac1a69c9579cdb584cc622068e90b3",
-      "yield": "sema:Yield#mh:SHA-256:d80209c8d3d01dff308a1917000beb714a2fe3e454e21c56643c3c8b53cd6fcf"
+      "yield": "sema:Yield#mh:SHA-256:d665e9a8a91a9ec23f8b338f875b05f1f7fe7844b8f21361b06bdd065bd78a02"
     }
   },
   "sema_layer": "Society",
diff --git a/data/vocabulary/ConceptualDecomposition.json b/data/vocabulary/ConceptualDecomposition.json
index 3909fa82..6393e978 100644
--- a/data/vocabulary/ConceptualDecomposition.json
+++ b/data/vocabulary/ConceptualDecomposition.json
@@ -21,17 +21,17 @@
       "Reasoning"
     ]
   },
-  "sema_id": "sema:ConceptualDecomposition#mh:SHA-256:3cf20e30a632b0a7ab64a7fb2984fe64b106ba7819af458fa5e260aa89853b1d",
-  "sema_ref": "ConceptualDecomposition#3cf2",
-  "sema_stub": "3cf2",
+  "sema_id": "sema:ConceptualDecomposition#mh:SHA-256:2cce877b501c3fe1fdf646e3c5ad3157b26502b7a6f7c943dfff389c055aa25a",
+  "sema_ref": "ConceptualDecomposition#2cce",
+  "sema_stub": "2cce",
   "dependencies": {
     "composes_with": {
-      "decomposition_gate": "sema:DecompositionGate#mh:SHA-256:3a799c865e76fa9ed63862cac1abd08ed5d98a570ab18fdbbe36af34fabdc63f",
+      "decomposition_gate": "sema:DecompositionGate#mh:SHA-256:c4f79cfd94dce663e393b3c8db16655c04f7a457c82f23d7dce54faa6817e730",
       "synthesis": "sema:Synthesis#mh:SHA-256:46b9ca1ae3a7711fc932ec43d901d25ef27b7c60c8f64f6fef818eec2027f6ea"
     },
     "references": {
       "decompose": "sema:Decompose#mh:SHA-256:63f31488a348d1176b6b16e770c69f196c2e03f507a240103e8297487dc4f652",
-      "solver": "sema:Solver#mh:SHA-256:04b58c815005971905e3d430112a06fb76b727882204a80fe58ace79b066a1d6"
+      "solver": "sema:Solver#mh:SHA-256:b7f9e18fec50d288ea829a21a59de02f65cf1ffe3eef07142389d659bd421d02"
     }
   },
   "sema_layer": "Mind",
diff --git a/data/vocabulary/Consensus.json b/data/vocabulary/Consensus.json
index fc9a7459..41802883 100644
--- a/data/vocabulary/Consensus.json
+++ b/data/vocabulary/Consensus.json
@@ -38,16 +38,16 @@
       "Coordination"
     ]
   },
-  "sema_id": "sema:Consensus#mh:SHA-256:45f490890803e907aa12e85c4751fed8e7f7273f4530fa35f5bd1713a46e3630",
-  "sema_ref": "Consensus#45f4",
-  "sema_stub": "45f4",
+  "sema_id": "sema:Consensus#mh:SHA-256:05264b8eb7ea117841041f266bf2882404e981604258205e5621acb816a7e708",
+  "sema_ref": "Consensus#0526",
+  "sema_stub": "0526",
   "dependencies": {
     "accepts": {
       "proposal": "sema:Proposal#mh:SHA-256:5e96c86b24df6ee2910c5d4c8cc75531e10e402d2867bb68ed5dc04606e538f4"
     },
     "composes_with": {
-      "quorum": "sema:Quorum#mh:SHA-256:c6a5b21dbe9b2c1fa46e5e67505041c92048a0a687f5703efa45486b51c56957",
-      "vote": "sema:Vote#mh:SHA-256:3b66510363464c335c95a843247ddd37bbb98616a17f6a8d4bb17b1ac91bd41c"
+      "quorum": "sema:Quorum#mh:SHA-256:d634d5cf0f165f708a5f39e54d8ad42716c11e21189459585468a294d2ebc7bc",
+      "vote": "sema:Vote#mh:SHA-256:0affbbc722d42218027f581176be08d0a66c9a3dc99adbf94d411ef9fc38786c"
     },
     "yields": {
       "value": "sema:Value#mh:SHA-256:37fd75758d04cdd7f57a636ccb5394d463713d60c33b694e37ab71f4a5a896f8"
diff --git a/data/vocabulary/ConsensusFinder.json b/data/vocabulary/ConsensusFinder.json
index dbb015ff..f0e1e9cd 100644
--- a/data/vocabulary/ConsensusFinder.json
+++ b/data/vocabulary/ConsensusFinder.json
@@ -18,17 +18,17 @@
       "Coordination"
     ]
   },
-  "sema_id": "sema:ConsensusFinder#mh:SHA-256:980a543f6683878c7800e1d4db41bad49017a47f33b924a63e52e1115c7a06dd",
-  "sema_ref": "ConsensusFinder#980a",
-  "sema_stub": "980a",
+  "sema_id": "sema:ConsensusFinder#mh:SHA-256:653580f6d5afd5099c8c8d86a5d14c7656b0b9d363ed30291e56bdc48de79099",
+  "sema_ref": "ConsensusFinder#6535",
+  "sema_stub": "6535",
   "signature": [
     "Discover(Consensus)"
   ],
   "dependencies": {
     "references": {
-      "consensus": "sema:Consensus#mh:SHA-256:45f490890803e907aa12e85c4751fed8e7f7273f4530fa35f5bd1713a46e3630",
+      "consensus": "sema:Consensus#mh:SHA-256:05264b8eb7ea117841041f266bf2882404e981604258205e5621acb816a7e708",
       "discover": "sema:Discover#mh:SHA-256:8895070d390ce7493b0534f56d22d9dec6eb341d0865e4214f8f0141dc6f5104",
-      "quorum": "sema:Quorum#mh:SHA-256:c6a5b21dbe9b2c1fa46e5e67505041c92048a0a687f5703efa45486b51c56957",
+      "quorum": "sema:Quorum#mh:SHA-256:d634d5cf0f165f708a5f39e54d8ad42716c11e21189459585468a294d2ebc7bc",
       "resonate": "sema:Resonate#mh:SHA-256:70c7680619d6b0158d3bddfaf9fb17e4e4bfb135995d9425fd7b1e6eb410c3d3"
     }
   },
diff --git a/data/vocabulary/ContextFirst.json b/data/vocabulary/ContextFirst.json
index 46624c17..94ae448a 100644
--- a/data/vocabulary/ContextFirst.json
+++ b/data/vocabulary/ContextFirst.json
@@ -21,9 +21,9 @@
       "Inference"
     ]
   },
-  "sema_id": "sema:ContextFirst#mh:SHA-256:a0b6432a809a0c73841202d1802a83018f3db9d5938893415218a383ce151d6a",
-  "sema_ref": "ContextFirst#a0b6",
-  "sema_stub": "a0b6",
+  "sema_id": "sema:ContextFirst#mh:SHA-256:75505829fde04a5838eecbcc83757f2e96bdd064f0aab6eabeccc6e69ce2725a",
+  "sema_ref": "ContextFirst#7550",
+  "sema_stub": "7550",
   "signature": [
     "Prioritize(Context)"
   ],
@@ -32,9 +32,9 @@
       "agent": "sema:Agent#mh:SHA-256:67659e263616d53dded32875421792f42fadf3137c87fe09cf9f5b9c163f10cf",
       "context": "sema:Context#mh:SHA-256:d5f79a21faef9ef640ab687c90a25cdf457a066fb6da23d247115b267c539132",
       "prioritize": "sema:Prioritize#mh:SHA-256:8028bf196f44e09cb60a59a1a067b57c3de28c2d41ad9a600a6797c335567458",
-      "solver_node": "sema:SolverNode#mh:SHA-256:fd50fc5063ba52d2670169e4a8388e475cdc69084de648606236716f9ccc13b4",
+      "solver_node": "sema:SolverNode#mh:SHA-256:45292efbd4e607174b8e0b82535d8bede20eb408a9d341b86742e1db2982ea1a",
       "state": "sema:State#mh:SHA-256:4f25e6a16ccd37dc0bc154cccc7055cb504d49daa8b712f372a425eb6c7b8cb2",
-      "warmup": "sema:Warmup#mh:SHA-256:32d4b559fc99f4dfa7a154487385194fe1c4f5cd3589a5910d2ee35eadc38fff"
+      "warmup": "sema:Warmup#mh:SHA-256:7ad05d8c27bdabb565d72ce56d8a896af84e5c35d5bc56afb7bdecdac5b40551"
     }
   },
   "sema_layer": "Mind",
diff --git a/data/vocabulary/ContingencyPlan.json b/data/vocabulary/ContingencyPlan.json
index 5be24816..1026f21c 100644
--- a/data/vocabulary/ContingencyPlan.json
+++ b/data/vocabulary/ContingencyPlan.json
@@ -28,13 +28,13 @@
       "Strategy"
     ]
   },
-  "sema_id": "sema:ContingencyPlan#mh:SHA-256:c7600e5ef964d161b03ec39c9a219f6b882f2bc1a9f47456a9ca311c27e27165",
-  "sema_ref": "ContingencyPlan#c760",
-  "sema_stub": "c760",
+  "sema_id": "sema:ContingencyPlan#mh:SHA-256:e096baa7b38820b79c62355576dce883e36d91242599c7f5a41c75edf8eed293",
+  "sema_ref": "ContingencyPlan#e096",
+  "sema_stub": "e096",
   "dependencies": {
     "references": {
       "plan": "sema:Plan#mh:SHA-256:02b62f57c699bb389876d147d715a7ce074f7838a1800226c165ffc601522c3d",
-      "retry": "sema:Retry#mh:SHA-256:79b69773b2fdd6fc81b1205d1088e9df841db683a982e079fc2dca97f4818804"
+      "retry": "sema:Retry#mh:SHA-256:9e178c29dd1aa774432d8eb6e87fb2e93ab5b1a6db9582f737ad60e9ddf56053"
     }
   },
   "sema_layer": "Mind",
diff --git a/data/vocabulary/ContinuousResourceAuction.json b/data/vocabulary/ContinuousResourceAuction.json
index b4abfa61..cd4a5f71 100644
--- a/data/vocabulary/ContinuousResourceAuction.json
+++ b/data/vocabulary/ContinuousResourceAuction.json
@@ -66,15 +66,15 @@
       "Economics"
     ]
   },
-  "sema_ref": "ContinuousResourceAuction#1553",
-  "sema_id": "sema:ContinuousResourceAuction#mh:SHA-256:15530861d00609a281c40ecd368dda8f2a8e15181bef54b2532752f50348e290",
-  "sema_stub": "1553",
+  "sema_ref": "ContinuousResourceAuction#8fe2",
+  "sema_id": "sema:ContinuousResourceAuction#mh:SHA-256:8fe283f5ae6bd9adcf164ba848bcc731863b0f232f2dbc4fa8c389f70eb8184c",
+  "sema_stub": "8fe2",
   "dependencies": {
     "accepts": {
       "value": "sema:Value#mh:SHA-256:37fd75758d04cdd7f57a636ccb5394d463713d60c33b694e37ab71f4a5a896f8"
     },
     "composes_with": {
-      "state_lock": "sema:StateLock#mh:SHA-256:7cd86a9de68522b752366ef04de32f743b57ef16232866522ccdafb1f35c6da9"
+      "state_lock": "sema:StateLock#mh:SHA-256:8bde7c49752578e5c76e46d33b995497728f486d69d99ff618b9dbeaa7586c78"
     },
     "references": {
       "protocol": "sema:Protocol#mh:SHA-256:e53765fe6abfb95285f1b698b11cc01ab3f7e1d8f82f57186f60127d92c564db"
diff --git a/data/vocabulary/Cooldown.json b/data/vocabulary/Cooldown.json
index d3ea583a..d90699d8 100644
--- a/data/vocabulary/Cooldown.json
+++ b/data/vocabulary/Cooldown.json
@@ -41,12 +41,12 @@
       "Primitives"
     ]
   },
-  "sema_id": "sema:Cooldown#mh:SHA-256:878c03997b0670f8f217d6f26b6d2a583d15bf11e702346b4e317827dc7cb687",
-  "sema_ref": "Cooldown#878c",
-  "sema_stub": "878c",
+  "sema_id": "sema:Cooldown#mh:SHA-256:6f56ea214e52eab81c0592d4b17ed3da9dc6cbcf3a496a512088c9bc63006f3b",
+  "sema_ref": "Cooldown#6f56",
+  "sema_stub": "6f56",
   "dependencies": {
     "references": {
-      "throttle": "sema:Throttle#mh:SHA-256:dc1439d0fbf64ac81ebea3d7570e55d7b94802d028061470a2e5681bc3c1d5f6"
+      "throttle": "sema:Throttle#mh:SHA-256:24860a38fb19f46f0cd620ada5ec2abadef4377dc6c0459f14180e4ce7aed7c8"
     }
   },
   "sema_layer": "Infrastructure",
diff --git a/data/vocabulary/CounterfactualAnchor.json b/data/vocabulary/CounterfactualAnchor.json
index a8887767..e615b23a 100644
--- a/data/vocabulary/CounterfactualAnchor.json
+++ b/data/vocabulary/CounterfactualAnchor.json
@@ -46,16 +46,16 @@
       "Protocols"
     ]
   },
-  "sema_id": "sema:CounterfactualAnchor#mh:SHA-256:e7accd6c44e6cfb43cb51af464c4b2edaef05e7405ec8dd5d417fe62a00ef28d",
-  "sema_ref": "CounterfactualAnchor#e7ac",
-  "sema_stub": "e7ac",
+  "sema_id": "sema:CounterfactualAnchor#mh:SHA-256:0d2b80d411934b06aeaca853ac89163d71f795c26aeff8e88766f18a829766b2",
+  "sema_ref": "CounterfactualAnchor#0d2b",
+  "sema_stub": "0d2b",
   "dependencies": {
     "references": {
       "agent": "sema:Agent#mh:SHA-256:67659e263616d53dded32875421792f42fadf3137c87fe09cf9f5b9c163f10cf",
       "cognitive_bias": "sema:CognitiveBias#mh:SHA-256:c8a4abe2e0ce048be16d25f890a50f8c7095e099b5ab2de23aa059942328f387",
       "observe": "sema:Observe#mh:SHA-256:db88fe3226ab245793b6eb0126536dfd5eb281ceb95ddbd09f287fa85a266871",
       "signal": "sema:Signal#mh:SHA-256:2ac0768f06e77d96b5d0bf8204205f519a24d704d496ce59519c9e8ddd546ab2",
-      "surprisal_update": "sema:SurprisalUpdate#mh:SHA-256:6169da6dce9141595fc8b7ac8d8743e397cd44a2da04b3499b2ce910e174c2ef"
+      "surprisal_update": "sema:SurprisalUpdate#mh:SHA-256:41a9f896757eb4b0d7132604b60e0193eaba43329953359ef5e927f69112f8df"
     }
   },
   "sema_layer": "Society",
diff --git a/data/vocabulary/DecompositionGate.json b/data/vocabulary/DecompositionGate.json
index efd5efb4..905f67ba 100644
--- a/data/vocabulary/DecompositionGate.json
+++ b/data/vocabulary/DecompositionGate.json
@@ -18,12 +18,12 @@
       "Reasoning"
     ]
   },
-  "sema_id": "sema:DecompositionGate#mh:SHA-256:3a799c865e76fa9ed63862cac1abd08ed5d98a570ab18fdbbe36af34fabdc63f",
-  "sema_ref": "DecompositionGate#3a79",
-  "sema_stub": "3a79",
+  "sema_id": "sema:DecompositionGate#mh:SHA-256:c4f79cfd94dce663e393b3c8db16655c04f7a457c82f23d7dce54faa6817e730",
+  "sema_ref": "DecompositionGate#c4f7",
+  "sema_stub": "c4f7",
   "dependencies": {
     "references": {
-      "frame_error": "sema:FrameError#mh:SHA-256:22e143610af8d9d6296b9497ad462eb71a3933aa6d77488f6a1e2226f81c45fc"
+      "frame_error": "sema:FrameError#mh:SHA-256:f67433d411f7ce3c8582a6685e6fc43285c2e96680b404acb8f399a74198fe4b"
     },
     "yields": {
       "decision": "sema:Decision#mh:SHA-256:7fdfee9027fde0e699ed12cc286565c16ff262d50d55b0668da94dcdf0712a1f"
diff --git a/data/vocabulary/DeepResearch.json b/data/vocabulary/DeepResearch.json
index 3ad961ee..1d348ae6 100644
--- a/data/vocabulary/DeepResearch.json
+++ b/data/vocabulary/DeepResearch.json
@@ -30,9 +30,9 @@
       "Reasoning"
     ]
   },
-  "sema_id": "sema:DeepResearch#mh:SHA-256:a0583250bce8e627c58247bd2dba4de9d9fb9ffabf0a36c66eceb7ddebee4577",
-  "sema_ref": "DeepResearch#a058",
-  "sema_stub": "a058",
+  "sema_id": "sema:DeepResearch#mh:SHA-256:e060e22da824f730c3b21f232e087babd447395ed3190509aab22101f4480d86",
+  "sema_ref": "DeepResearch#e060",
+  "sema_stub": "e060",
   "signature": [
     "Deep(Discover)"
   ],
@@ -41,7 +41,7 @@
       "cognitive_bias": "sema:CognitiveBias#mh:SHA-256:c8a4abe2e0ce048be16d25f890a50f8c7095e099b5ab2de23aa059942328f387",
       "deep": "sema:Deep#mh:SHA-256:12d38ea71c013360157896fb4bcd9ff94ea07e3f49fe2164b35e14754f400824",
       "discover": "sema:Discover#mh:SHA-256:8895070d390ce7493b0534f56d22d9dec6eb341d0865e4214f8f0141dc6f5104",
-      "retrieval_augment": "sema:RetrievalAugment#mh:SHA-256:7ca744ce28611156f415add4da95e3dc93006d92061a05139e17b70d3882e848",
+      "retrieval_augment": "sema:RetrievalAugment#mh:SHA-256:046a23973b254ab3ca9ee8d892c6a2a43f0ccba6145197d0f1fe3b92f1feec63",
       "synthesis": "sema:Synthesis#mh:SHA-256:46b9ca1ae3a7711fc932ec43d901d25ef27b7c60c8f64f6fef818eec2027f6ea"
     }
   },
diff --git a/data/vocabulary/Delegate.json b/data/vocabulary/Delegate.json
index d6fb9034..13dc2cf8 100644
--- a/data/vocabulary/Delegate.json
+++ b/data/vocabulary/Delegate.json
@@ -39,15 +39,15 @@
       "Coordination"
     ]
   },
-  "sema_id": "sema:Delegate#mh:SHA-256:78a8da9a060a24531bde6d3673a4bfc3123b72adce8ff4e95e244937715f150d",
-  "sema_ref": "Delegate#78a8",
-  "sema_stub": "78a8",
+  "sema_id": "sema:Delegate#mh:SHA-256:2d38b629a5905a4f7cc549b75fe7a553852dccb08066e62db3f0a98642c441a3",
+  "sema_ref": "Delegate#2d38",
+  "sema_stub": "2d38",
   "dependencies": {
     "accepts": {
       "holographic_shard": "sema:HolographicShard#mh:SHA-256:7eb7beec35ed149646d3e9631303f4dbf706daec5ccc0d186d0d6158cd7b5203"
     },
     "composes_with": {
-      "heartbeat": "sema:Heartbeat#mh:SHA-256:c36fe65a4b171559a33cb36f37ec448dce8ad7092c665426bfabee3dbeb6d1c1",
+      "heartbeat": "sema:Heartbeat#mh:SHA-256:d0e6ffd899704efd75b87f0365bbe48fec4a1179b81e08923779ed84be7c83c2",
       "probe": "sema:Probe#mh:SHA-256:5392242c37d0e87c203a1cfdfd6a4f15e2e8eed3bd8c7a22db63e07ce48939d8"
     },
     "references": {
diff --git a/data/vocabulary/DeliberativeAlign.json b/data/vocabulary/DeliberativeAlign.json
index ea9c0624..6d6b50e0 100644
--- a/data/vocabulary/DeliberativeAlign.json
+++ b/data/vocabulary/DeliberativeAlign.json
@@ -39,9 +39,9 @@
       "Protocols"
     ]
   },
-  "sema_id": "sema:DeliberativeAlign#mh:SHA-256:9fd3cbae8fddc6fb86a806e3c2d94515aaf40b96cf734a9d5141317b6813d8a7",
-  "sema_ref": "DeliberativeAlign#9fd3",
-  "sema_stub": "9fd3",
+  "sema_id": "sema:DeliberativeAlign#mh:SHA-256:1cf2f0c643345bc990e6538e3a3966f0736b803ffdce5e6166a3f52be00f2ee7",
+  "sema_ref": "DeliberativeAlign#1cf2",
+  "sema_stub": "1cf2",
   "dependencies": {
     "accepts": {
       "constitution": "sema:Constitution#mh:SHA-256:f7493951346cb89fc465d4fcd93448a63c5fd9ac0d734ec28a5aeff4914f4f1b",
@@ -52,7 +52,7 @@
       "check": "sema:Check#mh:SHA-256:22ecc8bd2d86f344a11551e3bae74a97660e47b1127739e8a84f88f4791960c8",
       "context": "sema:Context#mh:SHA-256:d5f79a21faef9ef640ab687c90a25cdf457a066fb6da23d247115b267c539132",
       "manifest_planning": "sema:ManifestPlanning#mh:SHA-256:b7f211fc4e9af89158c6d7f76bc2dc1b33b78246975ab6d5fc3ee238b9f5c852",
-      "solver_node": "sema:SolverNode#mh:SHA-256:fd50fc5063ba52d2670169e4a8388e475cdc69084de648606236716f9ccc13b4",
+      "solver_node": "sema:SolverNode#mh:SHA-256:45292efbd4e607174b8e0b82535d8bede20eb408a9d341b86742e1db2982ea1a",
       "trace": "sema:Trace#mh:SHA-256:314d8d38e6de13bf191dd0d368c8c1bcf7a2d4953b165f66daf7188b90dc37ab"
     }
   },
diff --git a/data/vocabulary/Deploy.json b/data/vocabulary/Deploy.json
index 060da4d4..ee7c1921 100644
--- a/data/vocabulary/Deploy.json
+++ b/data/vocabulary/Deploy.json
@@ -21,13 +21,13 @@
       "Protocols"
     ]
   },
-  "sema_ref": "Deploy#1119",
-  "sema_id": "sema:Deploy#mh:SHA-256:1119a1844362113a6df1acb77aeb863d67922c60a600ebba232cd66da0c2f825",
-  "sema_stub": "1119",
+  "sema_ref": "Deploy#9af9",
+  "sema_id": "sema:Deploy#mh:SHA-256:9af9d0b68e63b674f8edd17f3edcaac5a16b5cf612ddb802c1b6e2d6b6a86826",
+  "sema_stub": "9af9",
   "dependencies": {
     "composes_with": {
       "act": "sema:Act#mh:SHA-256:7616721cda9e81613f7c97d4ac93ba49291f97d7c7fe6fd7c49588c33d4d3b3d",
-      "rollout": "sema:Rollout#mh:SHA-256:8fc16ddf8f7add799ac8b49f7894f508be0b8378f995e57540cab8ec028eb996"
+      "rollout": "sema:Rollout#mh:SHA-256:84e234d9616bde2b394074e3d082e85c7ee74068d65f2aa8642a5e3a64f97c26"
     }
   },
   "sema_layer": "Society",
diff --git a/data/vocabulary/DepthGovernor.json b/data/vocabulary/DepthGovernor.json
index 42fac2aa..7eef3ad9 100644
--- a/data/vocabulary/DepthGovernor.json
+++ b/data/vocabulary/DepthGovernor.json
@@ -37,9 +37,9 @@
       "Strategy"
     ]
   },
-  "sema_id": "sema:DepthGovernor#mh:SHA-256:96cf874e588e4260c67abf3b8cdca5a0234d9b6a637e1c7981b7f77025668c93",
-  "sema_ref": "DepthGovernor#96cf",
-  "sema_stub": "96cf",
+  "sema_id": "sema:DepthGovernor#mh:SHA-256:a3e937d651c99333315d333034b3a3be136376bfc1a5139cc758f218640cfc87",
+  "sema_ref": "DepthGovernor#a3e9",
+  "sema_stub": "a3e9",
   "dependencies": {
     "references": {
       "agent": "sema:Agent#mh:SHA-256:67659e263616d53dded32875421792f42fadf3137c87fe09cf9f5b9c163f10cf",
@@ -48,7 +48,7 @@
       "loop": "sema:Loop#mh:SHA-256:984a20b35090934ca5ea1f97f2026b6be48b3805ddc0802f32ba66fe6bfcaf87",
       "plan": "sema:Plan#mh:SHA-256:02b62f57c699bb389876d147d715a7ce074f7838a1800226c165ffc601522c3d",
       "problem": "sema:Problem#mh:SHA-256:9d2c77f7ce7fd7d2e35fe45495d6124d43d35ce41b1766c6b428cfcba44486de",
-      "recursion_dive": "sema:RecursionDive#mh:SHA-256:7e67260837bfb3fd46b514f9ddfe0b6e6f62657e8af2a626a14e29f77ada285d"
+      "recursion_dive": "sema:RecursionDive#mh:SHA-256:bd1380babbca57f5f1a00721f887c9ecf6fff48d73302a28e735d956134b4921"
     }
   },
   "sema_layer": "Mind",
diff --git a/data/vocabulary/Disband.json b/data/vocabulary/Disband.json
index b6a5d0c4..2ae22dfc 100644
--- a/data/vocabulary/Disband.json
+++ b/data/vocabulary/Disband.json
@@ -33,14 +33,14 @@
       "Coordination"
     ]
   },
-  "sema_id": "sema:Disband#mh:SHA-256:995359e7d1ffda3dc97ae352e53a740e68d64f79656a18659093745461871df2",
-  "sema_ref": "Disband#9953",
-  "sema_stub": "9953",
+  "sema_id": "sema:Disband#mh:SHA-256:d5f882cd8f4a4bcbe6eaa6ba11a0eeeca57472343564378f2e2e84f5eab3f647",
+  "sema_ref": "Disband#d5f8",
+  "sema_stub": "d5f8",
   "dependencies": {
     "references": {
       "agent": "sema:Agent#mh:SHA-256:67659e263616d53dded32875421792f42fadf3137c87fe09cf9f5b9c163f10cf",
-      "ejection_seat": "sema:EjectionSeat#mh:SHA-256:a164bf13e2782b724df3bfd0f3a53c11933d0881a4c1ff0cbef9fd738a871ba4",
-      "quorum": "sema:Quorum#mh:SHA-256:c6a5b21dbe9b2c1fa46e5e67505041c92048a0a687f5703efa45486b51c56957",
+      "ejection_seat": "sema:EjectionSeat#mh:SHA-256:e8361ca7c2ffb506b32cd36f16addc253ecbc51350f98b983db9c122bb51f106",
+      "quorum": "sema:Quorum#mh:SHA-256:d634d5cf0f165f708a5f39e54d8ad42716c11e21189459585468a294d2ebc7bc",
       "state": "sema:State#mh:SHA-256:4f25e6a16ccd37dc0bc154cccc7055cb504d49daa8b712f372a425eb6c7b8cb2"
     },
     "yields": {
diff --git a/data/vocabulary/DiscoveryProtocol.json b/data/vocabulary/DiscoveryProtocol.json
index 3a440b30..0026b436 100644
--- a/data/vocabulary/DiscoveryProtocol.json
+++ b/data/vocabulary/DiscoveryProtocol.json
@@ -15,12 +15,12 @@
       "Strategy"
     ]
   },
-  "sema_id": "sema:DiscoveryProtocol#mh:SHA-256:7ada4e77d2edac145f6ae3387e2da68202cb9de87588ded01f929be507e7796c",
-  "sema_ref": "DiscoveryProtocol#7ada",
-  "sema_stub": "7ada",
+  "sema_id": "sema:DiscoveryProtocol#mh:SHA-256:9958e873e5aa29dc046965443b256ee00d53f69befc0c9e573ba3b165e7487db",
+  "sema_ref": "DiscoveryProtocol#9958",
+  "sema_stub": "9958",
   "dependencies": {
     "composes_with": {
-      "conceptual_decomposition": "sema:ConceptualDecomposition#mh:SHA-256:3cf20e30a632b0a7ab64a7fb2984fe64b106ba7819af458fa5e260aa89853b1d",
+      "conceptual_decomposition": "sema:ConceptualDecomposition#mh:SHA-256:2cce877b501c3fe1fdf646e3c5ad3157b26502b7a6f7c943dfff389c055aa25a",
       "synthesis": "sema:Synthesis#mh:SHA-256:46b9ca1ae3a7711fc932ec43d901d25ef27b7c60c8f64f6fef818eec2027f6ea"
     },
     "references": {
diff --git a/data/vocabulary/DissentSeek.json b/data/vocabulary/DissentSeek.json
index f8afac52..745b02ca 100644
--- a/data/vocabulary/DissentSeek.json
+++ b/data/vocabulary/DissentSeek.json
@@ -28,13 +28,13 @@
       "Protocols"
     ]
   },
-  "sema_id": "sema:DissentSeek#mh:SHA-256:ce789971353ca0b8c002250a6e0ced756de6099be34025af28cf5617e0d16273",
-  "sema_ref": "DissentSeek#ce78",
-  "sema_stub": "ce78",
+  "sema_id": "sema:DissentSeek#mh:SHA-256:8378e078de73a8a8a69b7f9a45c8d0cf1d922c2b556b6ffdf9770c5b89e1c58e",
+  "sema_ref": "DissentSeek#8378",
+  "sema_stub": "8378",
   "dependencies": {
     "references": {
       "confirmation_block": "sema:ConfirmationBlock#mh:SHA-256:dc3f1d88759b024b4b5730dada9c5586759b31503d5d1dd779ca24b9fcff5c07",
-      "quorum": "sema:Quorum#mh:SHA-256:c6a5b21dbe9b2c1fa46e5e67505041c92048a0a687f5703efa45486b51c56957",
+      "quorum": "sema:Quorum#mh:SHA-256:d634d5cf0f165f708a5f39e54d8ad42716c11e21189459585468a294d2ebc7bc",
       "steelman_check": "sema:SteelmanCheck#mh:SHA-256:9c861bd1b525f9671144191592f0f8d963331540385d5bb1f7317e919e6b7003",
       "understand": "sema:Understand#mh:SHA-256:4cabfb83049b7770e707c9b1c57e902818e74d8c6b98eed2e8fd40a2b2aca55a"
     }
diff --git a/data/vocabulary/DocumentedOverride.json b/data/vocabulary/DocumentedOverride.json
index 6ece9f4d..2ad8078e 100644
--- a/data/vocabulary/DocumentedOverride.json
+++ b/data/vocabulary/DocumentedOverride.json
@@ -21,15 +21,15 @@
       "Governance"
     ]
   },
-  "sema_id": "sema:DocumentedOverride#mh:SHA-256:40548ac167ea414f493054543303e74dac28a64510aa55ea8d1807ea52a6a5c6",
-  "sema_ref": "DocumentedOverride#4054",
-  "sema_stub": "4054",
+  "sema_id": "sema:DocumentedOverride#mh:SHA-256:17d333bda6bfc9f98ef85e9d09dd8cf84a8d8f13f13fb4e5de767bc4c8e75a54",
+  "sema_ref": "DocumentedOverride#17d3",
+  "sema_stub": "17d3",
   "dependencies": {
     "accepts": {
       "accept_spec": "sema:AcceptSpec#mh:SHA-256:c1565bf022e5596a447f7c9d9687ac3cbf1e6960f871be16f386eec02b5df2c4"
     },
     "composes_with": {
-      "time_warp_log": "sema:TimeWarpLog#mh:SHA-256:e26edd5011e4842730b23fb11a2d5efaff9a52112e8081f5856893c9c4ce99ff"
+      "time_warp_log": "sema:TimeWarpLog#mh:SHA-256:2a101afbc167bce00efa25a0439774ab1b30ef094facfaf2b8f9a5edb1b54269"
     },
     "yields": {
       "decision": "sema:Decision#mh:SHA-256:7fdfee9027fde0e699ed12cc286565c16ff262d50d55b0668da94dcdf0712a1f"
diff --git a/data/vocabulary/EjectionSeat.json b/data/vocabulary/EjectionSeat.json
index 27d9689c..dbb6cfe8 100644
--- a/data/vocabulary/EjectionSeat.json
+++ b/data/vocabulary/EjectionSeat.json
@@ -22,12 +22,12 @@
       "Protocols"
     ]
   },
-  "sema_id": "sema:EjectionSeat#mh:SHA-256:a164bf13e2782b724df3bfd0f3a53c11933d0881a4c1ff0cbef9fd738a871ba4",
-  "sema_ref": "EjectionSeat#a164",
-  "sema_stub": "a164",
+  "sema_id": "sema:EjectionSeat#mh:SHA-256:e8361ca7c2ffb506b32cd36f16addc253ecbc51350f98b983db9c122bb51f106",
+  "sema_ref": "EjectionSeat#e836",
+  "sema_stub": "e836",
   "dependencies": {
     "references": {
-      "compensate": "sema:Compensate#mh:SHA-256:9b3b07b7a02d00b6df1ecc3ee69fa3dcd2b33e07f045c67f26deb6cf311694f2",
+      "compensate": "sema:Compensate#mh:SHA-256:e23bc7c0d3825460855e7ee5e2e41f512ff8e318ad741b1ba4e0303cb66e39b9",
       "signal": "sema:Signal#mh:SHA-256:2ac0768f06e77d96b5d0bf8204205f519a24d704d496ce59519c9e8ddd546ab2"
     }
   },
diff --git a/data/vocabulary/Elect.json b/data/vocabulary/Elect.json
index 85e6e7ce..bf15f6b7 100644
--- a/data/vocabulary/Elect.json
+++ b/data/vocabulary/Elect.json
@@ -36,13 +36,13 @@
       "Coordination"
     ]
   },
-  "sema_id": "sema:Elect#mh:SHA-256:45ff98aaa03731e8e490293d799edba62f98b40669828f2d32b436a0ecd4b6ca",
-  "sema_ref": "Elect#45ff",
-  "sema_stub": "45ff",
+  "sema_id": "sema:Elect#mh:SHA-256:187a9d1996e3ad1fcb86b8dfe1207efb6473f2488bbf2741e5d77207b9dcdd38",
+  "sema_ref": "Elect#187a",
+  "sema_stub": "187a",
   "dependencies": {
     "accepts": {
       "accept_spec": "sema:AcceptSpec#mh:SHA-256:c1565bf022e5596a447f7c9d9687ac3cbf1e6960f871be16f386eec02b5df2c4",
-      "ballot": "sema:Ballot#mh:SHA-256:43ebc85e8e87e132698c59536402d1ba715b0dbad9e6c116f97a056c60da4577"
+      "ballot": "sema:Ballot#mh:SHA-256:84c3ea1db9fa8ab818d4fd156a8ef0a43d15b50419ca42236869bd9119f35497"
     },
     "yields": {
       "solution": "sema:Solution#mh:SHA-256:48442c3e14ce25ef325cbff085d095ecf4c7735b006f162eb76e23d4315f8fa2"
diff --git a/data/vocabulary/Estimate.json b/data/vocabulary/Estimate.json
index 99ae244a..751e04c7 100644
--- a/data/vocabulary/Estimate.json
+++ b/data/vocabulary/Estimate.json
@@ -27,9 +27,9 @@
       "Reasoning"
     ]
   },
-  "sema_ref": "Estimate#28d2",
-  "sema_id": "sema:Estimate#mh:SHA-256:28d2e9662fc904a5d5662b8b532a2c14a7ed47f8cda950a58875e07f249207df",
-  "sema_stub": "28d2",
+  "sema_ref": "Estimate#c6d2",
+  "sema_id": "sema:Estimate#mh:SHA-256:c6d21a9be2f862c3c4e46172f155ec129350e6dff03d18d658d694edcc34c9b7",
+  "sema_stub": "c6d2",
   "dependencies": {
     "accepts": {
       "task": "sema:Task#mh:SHA-256:f239278f610adea7e01a9fd019dc6be158a31919d61d301856dcbe2aa8b67804"
@@ -43,7 +43,7 @@
       "value": "sema:Value#mh:SHA-256:37fd75758d04cdd7f57a636ccb5394d463713d60c33b694e37ab71f4a5a896f8"
     },
     "yields": {
-      "bid": "sema:Bid#mh:SHA-256:5c45e9bd8858829e5a5cde5ad4f3ab26f4bb6937f88c1ddde40798b58799a266"
+      "bid": "sema:Bid#mh:SHA-256:1ebadf0e232c35605addcb43f2c2ceab124a7f710c0471cefb989189661c8d3a"
     }
   },
   "sema_layer": "Mind",
diff --git a/data/vocabulary/EthicalReasoningProtocol.json b/data/vocabulary/EthicalReasoningProtocol.json
index e4491eea..b2e01e05 100644
--- a/data/vocabulary/EthicalReasoningProtocol.json
+++ b/data/vocabulary/EthicalReasoningProtocol.json
@@ -16,15 +16,15 @@
       "Reasoning"
     ]
   },
-  "sema_id": "sema:EthicalReasoningProtocol#mh:SHA-256:e3a615cd44b5441b404a2ae0c83d273fdeb6e18335e5de8380fd0f2e8f70149f",
-  "sema_ref": "EthicalReasoningProtocol#e3a6",
-  "sema_stub": "e3a6",
+  "sema_id": "sema:EthicalReasoningProtocol#mh:SHA-256:6bf11b38a4352c7e0a99c002b75437cdc66d8a1a809ee353c11dec7a88c10998",
+  "sema_ref": "EthicalReasoningProtocol#6bf1",
+  "sema_stub": "6bf1",
   "dependencies": {
     "composes_with": {
-      "conceptual_decomposition": "sema:ConceptualDecomposition#mh:SHA-256:3cf20e30a632b0a7ab64a7fb2984fe64b106ba7819af458fa5e260aa89853b1d"
+      "conceptual_decomposition": "sema:ConceptualDecomposition#mh:SHA-256:2cce877b501c3fe1fdf646e3c5ad3157b26502b7a6f7c943dfff389c055aa25a"
     },
     "references": {
-      "deliberative_align": "sema:DeliberativeAlign#mh:SHA-256:9fd3cbae8fddc6fb86a806e3c2d94515aaf40b96cf734a9d5141317b6813d8a7"
+      "deliberative_align": "sema:DeliberativeAlign#mh:SHA-256:1cf2f0c643345bc990e6538e3a3966f0736b803ffdce5e6166a3f52be00f2ee7"
     }
   },
   "sema_layer": "Mind",
diff --git a/data/vocabulary/Exception.json b/data/vocabulary/Exception.json
index d68a25e8..d125109b 100644
--- a/data/vocabulary/Exception.json
+++ b/data/vocabulary/Exception.json
@@ -43,13 +43,13 @@
       "Data Structures"
     ]
   },
-  "sema_id": "sema:Exception#mh:SHA-256:054ce28455dfd0a13bce0b5a23e048429a58a1b7e6c9082252bc3f815fe6be21",
-  "sema_ref": "Exception#054c",
-  "sema_stub": "054c",
+  "sema_id": "sema:Exception#mh:SHA-256:39fb7ba646e5c1dc91699ae4b3dc0887f4ec476fe6bf29970b83aaaca025f686",
+  "sema_ref": "Exception#39fb",
+  "sema_stub": "39fb",
   "dependencies": {
     "references": {
-      "circuit_breaker": "sema:CircuitBreaker#mh:SHA-256:840fee4c2a300c1e17bd44e55debdf58d250ab62f79760f59c0189ca7d485824",
-      "fail_closed": "sema:FailClosed#mh:SHA-256:408814ddae0d3fa2b4022f997c1feab5eef743a155cdedeba75bc42d26e467ac",
+      "circuit_breaker": "sema:CircuitBreaker#mh:SHA-256:3caa9c387c04bb2ac66ec35a6cfe2665e11339f0d47576b96d68229226580c76",
+      "fail_closed": "sema:FailClosed#mh:SHA-256:eae70da02880916a695d85d3752a59e16201c9f81b8a9af238d31863b3b6b157",
       "state": "sema:State#mh:SHA-256:4f25e6a16ccd37dc0bc154cccc7055cb504d49daa8b712f372a425eb6c7b8cb2"
     }
   },
diff --git a/data/vocabulary/ExplainBeacon.json b/data/vocabulary/ExplainBeacon.json
index b695fec9..366e6567 100644
--- a/data/vocabulary/ExplainBeacon.json
+++ b/data/vocabulary/ExplainBeacon.json
@@ -19,14 +19,14 @@
       "Verification"
     ]
   },
-  "sema_id": "sema:ExplainBeacon#mh:SHA-256:2e403d47af0e3914841b5e03a4b9531b479ae05b2a54f402c24e99232f45b38a",
-  "sema_ref": "ExplainBeacon#2e40",
-  "sema_stub": "2e40",
+  "sema_id": "sema:ExplainBeacon#mh:SHA-256:467629a3f5dd0dd214a5ba9f703cb0f54c61ac0ea5c5f404e3dd0b3a10910887",
+  "sema_ref": "ExplainBeacon#4676",
+  "sema_stub": "4676",
   "dependencies": {
     "references": {
       "agent": "sema:Agent#mh:SHA-256:67659e263616d53dded32875421792f42fadf3137c87fe09cf9f5b9c163f10cf",
       "greet": "sema:Greet#mh:SHA-256:58542bc100077ab85299c99424fa0ca7ea8559890678461a0d7f7aaba927c74f",
-      "heartbeat": "sema:Heartbeat#mh:SHA-256:c36fe65a4b171559a33cb36f37ec448dce8ad7092c665426bfabee3dbeb6d1c1",
+      "heartbeat": "sema:Heartbeat#mh:SHA-256:d0e6ffd899704efd75b87f0365bbe48fec4a1179b81e08923779ed84be7c83c2",
       "stream": "sema:Stream#mh:SHA-256:6b47aafa55e0339455fa2d82d2077ffbf2c2dea744bd7034a99a3b77cfacfaec"
     }
   },
diff --git a/data/vocabulary/ExponentialBackoff.json b/data/vocabulary/ExponentialBackoff.json
new file mode 100644
index 00000000..8afe9f49
--- /dev/null
+++ b/data/vocabulary/ExponentialBackoff.json
@@ -0,0 +1,59 @@
+{
+  "handle": "ExponentialBackoff",
+  "derived_from": "sema:Backoff#mh:SHA-256:9e59718422f5408d7892feccb6d538a21103f9573b122b891ee3c8cf66303e72",
+  "mechanism": "A {{backoff}} delay policy whose unjittered delay grows geometrically across consecutive unsuccessful attempts: base_delay * multiplier^attempt_index. A configurable jitter factor may perturb the candidate delay to decorrelate concurrent attempts, after which the scheduled delay is clamped to max_delay. The caller defines retry eligibility, retry budget, and when the attempt sequence resets.",
+  "gloss": "Geometrically increasing capped retry delay",
+  "invariants": [
+    "Scheduled delay is greater than zero and does not exceed max_delay.",
+    "Before jitter, delay is non-decreasing with attempt_index until max_delay is reached."
+  ],
+  "parameters": [
+    {
+      "name": "base_delay",
+      "type": "Duration",
+      "range": "> 0",
+      "description": "Delay before the first subsequent attempt"
+    },
+    {
+      "name": "multiplier",
+      "type": "Float",
+      "range": "(1, unbounded)",
+      "description": "Geometric growth factor applied per unsuccessful attempt"
+    },
+    {
+      "name": "max_delay",
+      "type": "Duration",
+      "range": "[base_delay, unbounded)",
+      "description": "Upper bound applied after optional jitter"
+    },
+    {
+      "name": "jitter_factor",
+      "type": "Float",
+      "range": "[0.0, 1.0]",
+      "description": "Proportional randomization of the candidate delay"
+    }
+  ],
+  "failure_modes": [
+    "Synchronized retries when jitter is zero or correlated across callers.",
+    "Excessive recovery delay when the multiplier or cap is too large.",
+    "Retry amplification when callers use the delay policy without a retry budget."
+  ],
+  "_meta": {
+    "tier": 1,
+    "ring": 0,
+    "path": [
+      "Infrastructure",
+      "Primitives"
+    ]
+  },
+  "sema_id": "sema:ExponentialBackoff#mh:SHA-256:a543a38722a0dfe96cf4bc7ccdaa615195ac058b5029651dc26d5cce1cd43128",
+  "sema_ref": "ExponentialBackoff#a543",
+  "sema_stub": "a543",
+  "dependencies": {
+    "references": {
+      "backoff": "sema:Backoff#mh:SHA-256:9e59718422f5408d7892feccb6d538a21103f9573b122b891ee3c8cf66303e72"
+    }
+  },
+  "sema_layer": "Infrastructure",
+  "sema_category": "Primitives"
+}
\ No newline at end of file
diff --git a/data/vocabulary/FailClosed.json b/data/vocabulary/FailClosed.json
index 611af58b..64120b2d 100644
--- a/data/vocabulary/FailClosed.json
+++ b/data/vocabulary/FailClosed.json
@@ -35,12 +35,12 @@
       "Primitives"
     ]
   },
-  "sema_id": "sema:FailClosed#mh:SHA-256:408814ddae0d3fa2b4022f997c1feab5eef743a155cdedeba75bc42d26e467ac",
-  "sema_ref": "FailClosed#4088",
-  "sema_stub": "4088",
+  "sema_id": "sema:FailClosed#mh:SHA-256:eae70da02880916a695d85d3752a59e16201c9f81b8a9af238d31863b3b6b157",
+  "sema_ref": "FailClosed#eae7",
+  "sema_stub": "eae7",
   "dependencies": {
     "references": {
-      "circuit_breaker": "sema:CircuitBreaker#mh:SHA-256:840fee4c2a300c1e17bd44e55debdf58d250ab62f79760f59c0189ca7d485824",
+      "circuit_breaker": "sema:CircuitBreaker#mh:SHA-256:3caa9c387c04bb2ac66ec35a6cfe2665e11339f0d47576b96d68229226580c76",
       "output_guard": "sema:OutputGuard#mh:SHA-256:32b0ffd08f916d61a677af7d82c53feb8a4019baab1bd86622a853aafa91ed2f",
       "system": "sema:System#mh:SHA-256:f8eb318a1113a10fead02fbf14ae433767ac1a69c9579cdb584cc622068e90b3"
     }
diff --git a/data/vocabulary/Fermi.json b/data/vocabulary/Fermi.json
index eafd2b62..ea22c986 100644
--- a/data/vocabulary/Fermi.json
+++ b/data/vocabulary/Fermi.json
@@ -34,13 +34,13 @@
       "Reasoning"
     ]
   },
-  "sema_id": "sema:Fermi#mh:SHA-256:128b7131810fba03748bcc5dce657248d5547beeb23e87750cd76e6e59a80bd5",
-  "sema_ref": "Fermi#128b",
-  "sema_stub": "128b",
+  "sema_id": "sema:Fermi#mh:SHA-256:3325308001815324796cd17f1aa534abbd32be73cdfbbd59cb5fa75d2f1b7d13",
+  "sema_ref": "Fermi#3325",
+  "sema_stub": "3325",
   "dependencies": {
     "composes_with": {
       "decompose": "sema:Decompose#mh:SHA-256:63f31488a348d1176b6b16e770c69f196c2e03f507a240103e8297487dc4f652",
-      "estimate": "sema:Estimate#mh:SHA-256:28d2e9662fc904a5d5662b8b532a2c14a7ed47f8cda950a58875e07f249207df"
+      "estimate": "sema:Estimate#mh:SHA-256:c6d21a9be2f862c3c4e46172f155ec129350e6dff03d18d658d694edcc34c9b7"
     }
   },
   "sema_layer": "Mind",
diff --git a/data/vocabulary/FractalIntelligence.json b/data/vocabulary/FractalIntelligence.json
index b1ea0715..20298441 100644
--- a/data/vocabulary/FractalIntelligence.json
+++ b/data/vocabulary/FractalIntelligence.json
@@ -22,20 +22,20 @@
       "Strategy"
     ]
   },
-  "sema_id": "sema:FractalIntelligence#mh:SHA-256:54810782124d5c716d1204d83ed1c40a16d66201c884c5e70473623898b4b40d",
-  "sema_ref": "FractalIntelligence#5481",
-  "sema_stub": "5481",
+  "sema_id": "sema:FractalIntelligence#mh:SHA-256:1d79fe6b35dc95d7c11f8ca7d105e73e9b7d318a30d3d27b9cccae4330ef1076",
+  "sema_ref": "FractalIntelligence#1d79",
+  "sema_stub": "1d79",
   "dependencies": {
     "composes_with": {
-      "conceptual_decomposition": "sema:ConceptualDecomposition#mh:SHA-256:3cf20e30a632b0a7ab64a7fb2984fe64b106ba7819af458fa5e260aa89853b1d",
-      "localized_learning": "sema:LocalizedLearning#mh:SHA-256:1eec33d8fc081000b2c5927b7cfc2d4e6a8835fc9e0d46e051bb7ee34541cbdf",
-      "marginal_value_rule": "sema:MarginalValueRule#mh:SHA-256:eebb10656ec6d554fa7bba3a98b2b9ba1207d58b31d0a794563605595af0f026",
-      "polymorphic_solver": "sema:PolymorphicSolver#mh:SHA-256:272ac4237fd71c0782676ed30558bad9c08fca9373577516284bf5def22b2800",
-      "problem_framer": "sema:ProblemFramer#mh:SHA-256:271894d4cdcba54a6c1f4c85f1983d05f86c18c7b12948ef19619addebc4a70f",
+      "conceptual_decomposition": "sema:ConceptualDecomposition#mh:SHA-256:2cce877b501c3fe1fdf646e3c5ad3157b26502b7a6f7c943dfff389c055aa25a",
+      "localized_learning": "sema:LocalizedLearning#mh:SHA-256:14502d62b7a331dbcb80bfdf6ab07f911cfb94b80788933e83119d787ec4fe37",
+      "marginal_value_rule": "sema:MarginalValueRule#mh:SHA-256:552ffce38f8fecae07f9faf905f0662ed284531904a94d55da19030138ff941d",
+      "polymorphic_solver": "sema:PolymorphicSolver#mh:SHA-256:3653f233738b26efaa02e0750c25ee0e743a32e0bce28afafde84b74f42b87f7",
+      "problem_framer": "sema:ProblemFramer#mh:SHA-256:ea80628660b357af41d6877843b44f7898d1677171c0a13c5e258d59639469f1",
       "reason": "sema:Reason#mh:SHA-256:c2f279f6def8869e4a54ce61f4cd8b646eaeb6dbaea89c7d9dfd05c6c2bb78ed",
-      "recursion_dive": "sema:RecursionDive#mh:SHA-256:7e67260837bfb3fd46b514f9ddfe0b6e6f62657e8af2a626a14e29f77ada285d",
+      "recursion_dive": "sema:RecursionDive#mh:SHA-256:bd1380babbca57f5f1a00721f887c9ecf6fff48d73302a28e735d956134b4921",
       "reframe": "sema:Reframe#mh:SHA-256:573733f86a965e0db34ce77c54bada908c9561248a7d5a9b76652dba71e1565a",
-      "state_snapshot": "sema:StateSnapshot#mh:SHA-256:53b2f1c57a571f308d8ce1686edf0fbbbc178bf35d96b2a445bcebeda01208aa",
+      "state_snapshot": "sema:StateSnapshot#mh:SHA-256:5791e43fad7e1f42cb7451eec53c6bfa9fef567b30a14d05be269116203e5848",
       "synthesis": "sema:Synthesis#mh:SHA-256:46b9ca1ae3a7711fc932ec43d901d25ef27b7c60c8f64f6fef818eec2027f6ea"
     },
     "references": {
@@ -46,7 +46,7 @@
       "strategy": "sema:Strategy#mh:SHA-256:0f2fcc85aff835c79ab80064df1655f8707bc5c80bbde7c3e1a2ba672a9cd49c",
       "system": "sema:System#mh:SHA-256:f8eb318a1113a10fead02fbf14ae433767ac1a69c9579cdb584cc622068e90b3",
       "task": "sema:Task#mh:SHA-256:f239278f610adea7e01a9fd019dc6be158a31919d61d301856dcbe2aa8b67804",
-      "universal_solver_tree": "sema:UniversalSolverTree#mh:SHA-256:7361e8ea2303b8cd0970fe167548cbf9c86f7f418f175424906f563db22729ae"
+      "universal_solver_tree": "sema:UniversalSolverTree#mh:SHA-256:0923a89effa56135175d1404578641c31d6f2d63716745aba054d7143ad0d6f9"
     }
   },
   "sema_layer": "Mind",
diff --git a/data/vocabulary/FrameError.json b/data/vocabulary/FrameError.json
index 09c7b50f..22f91f1e 100644
--- a/data/vocabulary/FrameError.json
+++ b/data/vocabulary/FrameError.json
@@ -19,14 +19,14 @@
       "Reasoning"
     ]
   },
-  "sema_id": "sema:FrameError#mh:SHA-256:22e143610af8d9d6296b9497ad462eb71a3933aa6d77488f6a1e2226f81c45fc",
-  "sema_ref": "FrameError#22e1",
-  "sema_stub": "22e1",
+  "sema_id": "sema:FrameError#mh:SHA-256:f67433d411f7ce3c8582a6685e6fc43285c2e96680b404acb8f399a74198fe4b",
+  "sema_ref": "FrameError#f674",
+  "sema_stub": "f674",
   "dependencies": {
     "references": {
       "accept_spec": "sema:AcceptSpec#mh:SHA-256:c1565bf022e5596a447f7c9d9687ac3cbf1e6960f871be16f386eec02b5df2c4",
-      "compensate": "sema:Compensate#mh:SHA-256:9b3b07b7a02d00b6df1ecc3ee69fa3dcd2b33e07f045c67f26deb6cf311694f2",
-      "retry": "sema:Retry#mh:SHA-256:79b69773b2fdd6fc81b1205d1088e9df841db683a982e079fc2dca97f4818804"
+      "compensate": "sema:Compensate#mh:SHA-256:e23bc7c0d3825460855e7ee5e2e41f512ff8e318ad741b1ba4e0303cb66e39b9",
+      "retry": "sema:Retry#mh:SHA-256:9e178c29dd1aa774432d8eb6e87fb2e93ab5b1a6db9582f737ad60e9ddf56053"
     }
   },
   "sema_layer": "Mind",
diff --git a/data/vocabulary/Gardener.json b/data/vocabulary/Gardener.json
index 072a9ba2..39e8a82d 100644
--- a/data/vocabulary/Gardener.json
+++ b/data/vocabulary/Gardener.json
@@ -18,17 +18,17 @@
       "Economics"
     ]
   },
-  "sema_id": "sema:Gardener#mh:SHA-256:52f38862732f67f4fae97ec17422f694d4a03299edda23a8f91dc7d01a1bc716",
-  "sema_ref": "Gardener#52f3",
-  "sema_stub": "52f3",
+  "sema_id": "sema:Gardener#mh:SHA-256:3e1820fb37b894a66e5fe3e664e15067abe2e7d70a55d6b4f9ef10e362d87b71",
+  "sema_ref": "Gardener#3e18",
+  "sema_stub": "3e18",
   "signature": [
     "Stigmergy(Care)"
   ],
   "dependencies": {
     "references": {
       "care": "sema:Care#mh:SHA-256:413702da5928490b73e9aad2760480d231f2c40cf4c30a7d298ab118581ff20c",
-      "compensate": "sema:Compensate#mh:SHA-256:9b3b07b7a02d00b6df1ecc3ee69fa3dcd2b33e07f045c67f26deb6cf311694f2",
-      "graceful_degradation": "sema:GracefulDegradation#mh:SHA-256:84362d70dbeb585179a9adc7352dcd96d5edd14a611ee6c7d2400a4d78395eec",
+      "compensate": "sema:Compensate#mh:SHA-256:e23bc7c0d3825460855e7ee5e2e41f512ff8e318ad741b1ba4e0303cb66e39b9",
+      "graceful_degradation": "sema:GracefulDegradation#mh:SHA-256:1a82403193308a36bfe7623bdbd9e98dd611761e086b0e038ced0655e8db0336",
       "stigmergy": "sema:Stigmergy#mh:SHA-256:628247a1fb4949ebc39836a911d14d0ea963da9cead204c76039ff7339f004af"
     }
   },
diff --git a/data/vocabulary/GenealogicalTrace.json b/data/vocabulary/GenealogicalTrace.json
index b37b57a4..ad297436 100644
--- a/data/vocabulary/GenealogicalTrace.json
+++ b/data/vocabulary/GenealogicalTrace.json
@@ -21,15 +21,15 @@
       "Protocols"
     ]
   },
-  "sema_id": "sema:GenealogicalTrace#mh:SHA-256:fa22d007e06944e15621967431b41dad0c282fa75266656f8088396d11f48c9f",
-  "sema_ref": "GenealogicalTrace#fa22",
-  "sema_stub": "fa22",
+  "sema_id": "sema:GenealogicalTrace#mh:SHA-256:142ebf20a69208c3a278427a4f4ed0f2bc78fcac1134e97d2dbbe57b283bba62",
+  "sema_ref": "GenealogicalTrace#142e",
+  "sema_stub": "142e",
   "dependencies": {
     "references": {
-      "cite_back": "sema:CiteBack#mh:SHA-256:77855c554890913b6c7c61f5a947a502b47171f04f333ab4bcfc72e136bfd30b",
+      "cite_back": "sema:CiteBack#mh:SHA-256:17b1ece87db4152c4a241754f84c4722fe9dde9fa8c00c1e122e4e6139196b86",
       "context": "sema:Context#mh:SHA-256:d5f79a21faef9ef640ab687c90a25cdf457a066fb6da23d247115b267c539132",
       "deep": "sema:Deep#mh:SHA-256:12d38ea71c013360157896fb4bcd9ff94ea07e3f49fe2164b35e14754f400824",
-      "trace_belief": "sema:TraceBelief#mh:SHA-256:bdfa33f15f8f71e3fa221c802b6366c6922de402326dd447841d3258b97bf053"
+      "trace_belief": "sema:TraceBelief#mh:SHA-256:18811aa52ea8a0b4e10e500c10285ccd80d90bf294f3f86d04dbd0ebfd2e6a06"
     }
   },
   "sema_layer": "Society",
diff --git a/data/vocabulary/GracefulDegradation.json b/data/vocabulary/GracefulDegradation.json
index fad6fcc3..54bd98b9 100644
--- a/data/vocabulary/GracefulDegradation.json
+++ b/data/vocabulary/GracefulDegradation.json
@@ -43,12 +43,12 @@
       "Protocols"
     ]
   },
-  "sema_id": "sema:GracefulDegradation#mh:SHA-256:84362d70dbeb585179a9adc7352dcd96d5edd14a611ee6c7d2400a4d78395eec",
-  "sema_ref": "GracefulDegradation#8436",
-  "sema_stub": "8436",
+  "sema_id": "sema:GracefulDegradation#mh:SHA-256:1a82403193308a36bfe7623bdbd9e98dd611761e086b0e038ced0655e8db0336",
+  "sema_ref": "GracefulDegradation#1a82",
+  "sema_stub": "1a82",
   "dependencies": {
     "references": {
-      "fail_closed": "sema:FailClosed#mh:SHA-256:408814ddae0d3fa2b4022f997c1feab5eef743a155cdedeba75bc42d26e467ac",
+      "fail_closed": "sema:FailClosed#mh:SHA-256:eae70da02880916a695d85d3752a59e16201c9f81b8a9af238d31863b3b6b157",
       "message": "sema:Message#mh:SHA-256:b17515adef760297f0374e7cfcf4a7b3cc4f5f2c21ab0c0295285545c60482ea",
       "strategy": "sema:Strategy#mh:SHA-256:0f2fcc85aff835c79ab80064df1655f8707bc5c80bbde7c3e1a2ba672a9cd49c"
     }
diff --git a/data/vocabulary/HackDetect.json b/data/vocabulary/HackDetect.json
index 6be03a5e..b0456dec 100644
--- a/data/vocabulary/HackDetect.json
+++ b/data/vocabulary/HackDetect.json
@@ -31,13 +31,13 @@
       "Inference"
     ]
   },
-  "sema_id": "sema:HackDetect#mh:SHA-256:b7d777a40cff7df013903736c7cd026d53e89b50088d32ebc33bce7a352c23e3",
-  "sema_ref": "HackDetect#b7d7",
-  "sema_stub": "b7d7",
+  "sema_id": "sema:HackDetect#mh:SHA-256:a488f5c7cc85b98461fd84fe650423ece6a96ad1d64a9a0dd6a10856d34ed87b",
+  "sema_ref": "HackDetect#a488",
+  "sema_stub": "a488",
   "dependencies": {
     "references": {
       "agent": "sema:Agent#mh:SHA-256:67659e263616d53dded32875421792f42fadf3137c87fe09cf9f5b9c163f10cf",
-      "ejection_seat": "sema:EjectionSeat#mh:SHA-256:a164bf13e2782b724df3bfd0f3a53c11933d0881a4c1ff0cbef9fd738a871ba4",
+      "ejection_seat": "sema:EjectionSeat#mh:SHA-256:e8361ca7c2ffb506b32cd36f16addc253ecbc51350f98b983db9c122bb51f106",
       "input_guard": "sema:InputGuard#mh:SHA-256:fb8233411dd70e49aba71650dccb3ccbf6704261d5e75d2ff0edef6990e415be",
       "system": "sema:System#mh:SHA-256:f8eb318a1113a10fead02fbf14ae433767ac1a69c9579cdb584cc622068e90b3"
     }
diff --git a/data/vocabulary/Handoff.json b/data/vocabulary/Handoff.json
index b2fec0cc..89a12ca1 100644
--- a/data/vocabulary/Handoff.json
+++ b/data/vocabulary/Handoff.json
@@ -31,17 +31,17 @@
       "Protocols"
     ]
   },
-  "sema_id": "sema:Handoff#mh:SHA-256:4e0fac0fb6328d9aa18ea61e3dc4c7eb01d3ac1b8a6a4705c3e897811f5bd52a",
-  "sema_ref": "Handoff#4e0f",
-  "sema_stub": "4e0f",
+  "sema_id": "sema:Handoff#mh:SHA-256:d0e812d3e31c77524365e14ddb3c2c07182836b54ab514b3f1c995d1bddb1918",
+  "sema_ref": "Handoff#d0e8",
+  "sema_stub": "d0e8",
   "dependencies": {
     "accepts": {
       "context": "sema:Context#mh:SHA-256:d5f79a21faef9ef640ab687c90a25cdf457a066fb6da23d247115b267c539132",
-      "responsibility": "sema:Responsibility#mh:SHA-256:8cf5bbf5ca36a65aad611647fd512c76522e56f2342b87a110784ba166662972",
+      "responsibility": "sema:Responsibility#mh:SHA-256:67f5917d4f6fbc362e1aa3af89fd6cdff8e2ad3e983075b92693ad0c25adb87f",
       "task": "sema:Task#mh:SHA-256:f239278f610adea7e01a9fd019dc6be158a31919d61d301856dcbe2aa8b67804"
     },
     "composes_with": {
-      "delegate": "sema:Delegate#mh:SHA-256:78a8da9a060a24531bde6d3673a4bfc3123b72adce8ff4e95e244937715f150d"
+      "delegate": "sema:Delegate#mh:SHA-256:2d38b629a5905a4f7cc549b75fe7a553852dccb08066e62db3f0a98642c441a3"
     },
     "references": {
       "agent": "sema:Agent#mh:SHA-256:67659e263616d53dded32875421792f42fadf3137c87fe09cf9f5b9c163f10cf",
diff --git a/data/vocabulary/Heartbeat.json b/data/vocabulary/Heartbeat.json
index accc1503..0dfe9bb4 100644
--- a/data/vocabulary/Heartbeat.json
+++ b/data/vocabulary/Heartbeat.json
@@ -41,15 +41,15 @@
       "Primitives"
     ]
   },
-  "sema_id": "sema:Heartbeat#mh:SHA-256:c36fe65a4b171559a33cb36f37ec448dce8ad7092c665426bfabee3dbeb6d1c1",
-  "sema_ref": "Heartbeat#c36f",
-  "sema_stub": "c36f",
+  "sema_id": "sema:Heartbeat#mh:SHA-256:d0e6ffd899704efd75b87f0365bbe48fec4a1179b81e08923779ed84be7c83c2",
+  "sema_ref": "Heartbeat#d0e6",
+  "sema_stub": "d0e6",
   "dependencies": {
     "accepts": {
       "signal": "sema:Signal#mh:SHA-256:2ac0768f06e77d96b5d0bf8204205f519a24d704d496ce59519c9e8ddd546ab2"
     },
     "composes_with": {
-      "quorum": "sema:Quorum#mh:SHA-256:c6a5b21dbe9b2c1fa46e5e67505041c92048a0a687f5703efa45486b51c56957"
+      "quorum": "sema:Quorum#mh:SHA-256:d634d5cf0f165f708a5f39e54d8ad42716c11e21189459585468a294d2ebc7bc"
     },
     "references": {
       "monitor": "sema:Monitor#mh:SHA-256:72e04554c76cd2e06afaeb7284aaab96f37499b0ab3d58c76612819136447f2e"
diff --git a/data/vocabulary/HeldRelease.json b/data/vocabulary/HeldRelease.json
index 53482f29..b59e9ca2 100644
--- a/data/vocabulary/HeldRelease.json
+++ b/data/vocabulary/HeldRelease.json
@@ -45,12 +45,12 @@
       "Protocols"
     ]
   },
-  "sema_id": "sema:HeldRelease#mh:SHA-256:533b77d8341545dd80bd5a940492f028059ee8105cf523b26e4c16736ced46a5",
-  "sema_ref": "HeldRelease#533b",
-  "sema_stub": "533b",
+  "sema_id": "sema:HeldRelease#mh:SHA-256:10b0ae36dabba68fe8aad67adf8075ce5a5f0b2a3bb602c7bd3380b0dd0117d9",
+  "sema_ref": "HeldRelease#10b0",
+  "sema_stub": "10b0",
   "dependencies": {
     "accepts": {
-      "unique_handle": "sema:UniqueHandle#mh:SHA-256:88da37fb134c04632530db979115adbb3ca558bdc4f60111df03e9282de8cd3a"
+      "unique_handle": "sema:UniqueHandle#mh:SHA-256:58f9595fc08f62825f3dc959f10533558f459760a1c63ef2bc72b6da615ff37b"
     },
     "references": {
       "commitment_device": "sema:CommitmentDevice#mh:SHA-256:dbdbd8b26ed1104714cdfb072d548747682e428e086e9ea0b9c963b79f9877d4",
diff --git a/data/vocabulary/HumanEmulatorProtocol.json b/data/vocabulary/HumanEmulatorProtocol.json
index 444eca3c..35fe47fc 100644
--- a/data/vocabulary/HumanEmulatorProtocol.json
+++ b/data/vocabulary/HumanEmulatorProtocol.json
@@ -15,13 +15,13 @@
       "Reasoning"
     ]
   },
-  "sema_id": "sema:HumanEmulatorProtocol#mh:SHA-256:261f38f4e5344f759765e4ceb351f59f3bcd543414672d8826b8fa33517ec896",
-  "sema_ref": "HumanEmulatorProtocol#261f",
-  "sema_stub": "261f",
+  "sema_id": "sema:HumanEmulatorProtocol#mh:SHA-256:faf142ed0dc6369843880fccdd40c3785fbdbfc370122833f660da53a2c9c9cc",
+  "sema_ref": "HumanEmulatorProtocol#faf1",
+  "sema_stub": "faf1",
   "dependencies": {
     "composes_with": {
-      "conceptual_decomposition": "sema:ConceptualDecomposition#mh:SHA-256:3cf20e30a632b0a7ab64a7fb2984fe64b106ba7819af458fa5e260aa89853b1d",
-      "marginal_value_rule": "sema:MarginalValueRule#mh:SHA-256:eebb10656ec6d554fa7bba3a98b2b9ba1207d58b31d0a794563605595af0f026"
+      "conceptual_decomposition": "sema:ConceptualDecomposition#mh:SHA-256:2cce877b501c3fe1fdf646e3c5ad3157b26502b7a6f7c943dfff389c055aa25a",
+      "marginal_value_rule": "sema:MarginalValueRule#mh:SHA-256:552ffce38f8fecae07f9faf905f0662ed284531904a94d55da19030138ff941d"
     }
   },
   "sema_layer": "Mind",
diff --git a/data/vocabulary/IdempotentWrite.json b/data/vocabulary/IdempotentWrite.json
index 0d1ba4cc..946fbf16 100644
--- a/data/vocabulary/IdempotentWrite.json
+++ b/data/vocabulary/IdempotentWrite.json
@@ -30,14 +30,14 @@
       "Primitives"
     ]
   },
-  "sema_id": "sema:IdempotentWrite#mh:SHA-256:ebf5e8d3d5a4802033179f871bf4dfd0be7c611ab7534ab8b8e07e5f21eab7d0",
-  "sema_ref": "IdempotentWrite#ebf5",
-  "sema_stub": "ebf5",
+  "sema_id": "sema:IdempotentWrite#mh:SHA-256:e919903ac4044c9761bbdae612c360150f12e679dcc608ee7389f793debda186",
+  "sema_ref": "IdempotentWrite#e919",
+  "sema_stub": "e919",
   "dependencies": {
     "references": {
       "cache": "sema:Cache#mh:SHA-256:30c9445ad9acaafbda91309d2ac5da1b52aec6d5e7fee8c097fd666cb11cefa5",
       "identity": "sema:Identity#mh:SHA-256:bfe236a2c243ed664189c99afcb9f16225b6d56cbb11e6e29522756b33c47427",
-      "state_lock": "sema:StateLock#mh:SHA-256:7cd86a9de68522b752366ef04de32f743b57ef16232866522ccdafb1f35c6da9"
+      "state_lock": "sema:StateLock#mh:SHA-256:8bde7c49752578e5c76e46d33b995497728f486d69d99ff618b9dbeaa7586c78"
     }
   },
   "sema_layer": "Infrastructure",
diff --git a/data/vocabulary/LatticeCommit.json b/data/vocabulary/LatticeCommit.json
index f73187be..7b4833e3 100644
--- a/data/vocabulary/LatticeCommit.json
+++ b/data/vocabulary/LatticeCommit.json
@@ -27,13 +27,13 @@
       "Protocols"
     ]
   },
-  "sema_id": "sema:LatticeCommit#mh:SHA-256:74db69a4c37ebbc4996db3ccd03a5cfcbd2ab54abecb6a408dbb7db5a36de30f",
-  "sema_ref": "LatticeCommit#74db",
-  "sema_stub": "74db",
+  "sema_id": "sema:LatticeCommit#mh:SHA-256:667592b99ed2c9b29b4e071b38ac960b911e36aa8f2ac73a8a3285d4e5277403",
+  "sema_ref": "LatticeCommit#6675",
+  "sema_stub": "6675",
   "dependencies": {
     "references": {
       "check": "sema:Check#mh:SHA-256:22ecc8bd2d86f344a11551e3bae74a97660e47b1127739e8a84f88f4791960c8",
-      "quorum": "sema:Quorum#mh:SHA-256:c6a5b21dbe9b2c1fa46e5e67505041c92048a0a687f5703efa45486b51c56957",
+      "quorum": "sema:Quorum#mh:SHA-256:d634d5cf0f165f708a5f39e54d8ad42716c11e21189459585468a294d2ebc7bc",
       "state_transition": "sema:StateTransition#mh:SHA-256:fa0a59735c22f83a00a12fd79576ebf5cf8609c6cf6206b2b01a15958911c3d2",
       "topology": "sema:Topology#mh:SHA-256:7562ae8b1220306a7f04988216cfd33026bc6f04d8a2b3fc51f3a2b6153d5e4c"
     }
diff --git a/data/vocabulary/LazyConsensus.json b/data/vocabulary/LazyConsensus.json
index 924e8de3..67e5663f 100644
--- a/data/vocabulary/LazyConsensus.json
+++ b/data/vocabulary/LazyConsensus.json
@@ -30,13 +30,13 @@
       "Coordination"
     ]
   },
-  "sema_ref": "LazyConsensus#cb1b",
-  "sema_id": "sema:LazyConsensus#mh:SHA-256:cb1be5ea25df833482f581771c52a12c2f24b1865b13306e18f6423a99fa94f0",
-  "sema_stub": "cb1b",
+  "sema_ref": "LazyConsensus#1c07",
+  "sema_id": "sema:LazyConsensus#mh:SHA-256:1c07589188212ac8d7519eb64501c0e6c21d9028fc6a4026adf572b5b2db77ab",
+  "sema_stub": "1c07",
   "dependencies": {
     "references": {
-      "quorum": "sema:Quorum#mh:SHA-256:c6a5b21dbe9b2c1fa46e5e67505041c92048a0a687f5703efa45486b51c56957",
-      "time_warp_log": "sema:TimeWarpLog#mh:SHA-256:e26edd5011e4842730b23fb11a2d5efaff9a52112e8081f5856893c9c4ce99ff"
+      "quorum": "sema:Quorum#mh:SHA-256:d634d5cf0f165f708a5f39e54d8ad42716c11e21189459585468a294d2ebc7bc",
+      "time_warp_log": "sema:TimeWarpLog#mh:SHA-256:2a101afbc167bce00efa25a0439774ab1b30ef094facfaf2b8f9a5edb1b54269"
     }
   },
   "sema_layer": "Society",
diff --git a/data/vocabulary/LocalizedLearning.json b/data/vocabulary/LocalizedLearning.json
index f4e2bc2b..8c761a6a 100644
--- a/data/vocabulary/LocalizedLearning.json
+++ b/data/vocabulary/LocalizedLearning.json
@@ -24,9 +24,9 @@
       "Memory"
     ]
   },
-  "sema_id": "sema:LocalizedLearning#mh:SHA-256:1eec33d8fc081000b2c5927b7cfc2d4e6a8835fc9e0d46e051bb7ee34541cbdf",
-  "sema_ref": "LocalizedLearning#1eec",
-  "sema_stub": "1eec",
+  "sema_id": "sema:LocalizedLearning#mh:SHA-256:14502d62b7a331dbcb80bfdf6ab07f911cfb94b80788933e83119d787ec4fe37",
+  "sema_ref": "LocalizedLearning#1450",
+  "sema_stub": "1450",
   "signature": [
     "Act(FeedbackSignal)"
   ],
@@ -36,7 +36,7 @@
     },
     "references": {
       "act": "sema:Act#mh:SHA-256:7616721cda9e81613f7c97d4ac93ba49291f97d7c7fe6fd7c49588c33d4d3b3d",
-      "solver_manifest": "sema:SolverManifest#mh:SHA-256:47d424b51aac06ae90c6ab67ecd415876cf3feef3e2a18897fa8cc94b75399ff"
+      "solver_manifest": "sema:SolverManifest#mh:SHA-256:47aef05958dec89d4a0ccb6d8965d2bbd812dd8a3c10ef265f3150cfebee0384"
     }
   },
   "sema_layer": "Mind",
diff --git a/data/vocabulary/MarginalValueRule.json b/data/vocabulary/MarginalValueRule.json
index 821e7c6a..339860bd 100644
--- a/data/vocabulary/MarginalValueRule.json
+++ b/data/vocabulary/MarginalValueRule.json
@@ -24,17 +24,17 @@
       "Strategy"
     ]
   },
-  "sema_id": "sema:MarginalValueRule#mh:SHA-256:eebb10656ec6d554fa7bba3a98b2b9ba1207d58b31d0a794563605595af0f026",
-  "sema_ref": "MarginalValueRule#eebb",
-  "sema_stub": "eebb",
+  "sema_id": "sema:MarginalValueRule#mh:SHA-256:552ffce38f8fecae07f9faf905f0662ed284531904a94d55da19030138ff941d",
+  "sema_ref": "MarginalValueRule#552f",
+  "sema_stub": "552f",
   "signature": [
     "Budget(RecursionDive)"
   ],
   "dependencies": {
     "references": {
       "budget": "sema:Budget#mh:SHA-256:f2f58874eaeb0600039600ba5b26064164c225fd44482b269ae94e37a9df15b4",
-      "estimate": "sema:Estimate#mh:SHA-256:28d2e9662fc904a5d5662b8b532a2c14a7ed47f8cda950a58875e07f249207df",
-      "recursion_dive": "sema:RecursionDive#mh:SHA-256:7e67260837bfb3fd46b514f9ddfe0b6e6f62657e8af2a626a14e29f77ada285d"
+      "estimate": "sema:Estimate#mh:SHA-256:c6d21a9be2f862c3c4e46172f155ec129350e6dff03d18d658d694edcc34c9b7",
+      "recursion_dive": "sema:RecursionDive#mh:SHA-256:bd1380babbca57f5f1a00721f887c9ecf6fff48d73302a28e735d956134b4921"
     }
   },
   "sema_layer": "Mind",
diff --git a/data/vocabulary/MemeticSeed.json b/data/vocabulary/MemeticSeed.json
index efb98cfe..d371f147 100644
--- a/data/vocabulary/MemeticSeed.json
+++ b/data/vocabulary/MemeticSeed.json
@@ -25,16 +25,16 @@
       "Protocols"
     ]
   },
-  "sema_id": "sema:MemeticSeed#mh:SHA-256:cf265f710af42a9db9e5e61327679e4a3ef1b0e1b9a8c842ea990c92fa806415",
-  "sema_ref": "MemeticSeed#cf26",
-  "sema_stub": "cf26",
+  "sema_id": "sema:MemeticSeed#mh:SHA-256:d351f7e25df8a86d6f3517255945c9a196d95417ce4d70afb024a8a63cee97a5",
+  "sema_ref": "MemeticSeed#d351",
+  "sema_stub": "d351",
   "dependencies": {
     "references": {
       "agent": "sema:Agent#mh:SHA-256:67659e263616d53dded32875421792f42fadf3137c87fe09cf9f5b9c163f10cf",
-      "explain_beacon": "sema:ExplainBeacon#mh:SHA-256:2e403d47af0e3914841b5e03a4b9531b479ae05b2a54f402c24e99232f45b38a",
+      "explain_beacon": "sema:ExplainBeacon#mh:SHA-256:467629a3f5dd0dd214a5ba9f703cb0f54c61ac0ea5c5f404e3dd0b3a10910887",
       "gradient": "sema:Gradient#mh:SHA-256:dcf04816f4c8639244be889bb5030889bcd786600046a64a67b3ad59a679bb96",
       "translation_proxy": "sema:TranslationProxy#mh:SHA-256:e064cb7e1532435438433393ff3a3b8b87b5c86cf4705974888e9ec746f5d190",
-      "yield": "sema:Yield#mh:SHA-256:d80209c8d3d01dff308a1917000beb714a2fe3e454e21c56643c3c8b53cd6fcf"
+      "yield": "sema:Yield#mh:SHA-256:d665e9a8a91a9ec23f8b338f875b05f1f7fe7844b8f21361b06bdd065bd78a02"
     }
   },
   "sema_layer": "Society",
diff --git a/data/vocabulary/MetaPrompt.json b/data/vocabulary/MetaPrompt.json
index 41a5b77d..01ea3b46 100644
--- a/data/vocabulary/MetaPrompt.json
+++ b/data/vocabulary/MetaPrompt.json
@@ -30,9 +30,9 @@
       "Reasoning"
     ]
   },
-  "sema_id": "sema:MetaPrompt#mh:SHA-256:db51ab77fd1592155749c401b495f1090c0bc820458fe34b2412ce040c7e70ef",
-  "sema_ref": "MetaPrompt#db51",
-  "sema_stub": "db51",
+  "sema_id": "sema:MetaPrompt#mh:SHA-256:a66501101ec29854bb461a93e28bea471b5726a17085db26987c60ac65c1488d",
+  "sema_ref": "MetaPrompt#a665",
+  "sema_stub": "a665",
   "signature": [
     "Meta(Prompt)"
   ],
@@ -40,7 +40,7 @@
     "references": {
       "meta": "sema:Meta#mh:SHA-256:f277723b905f6c94549f27f7eb58597096f3052165f5ad90af8b273188cee079",
       "prompt": "sema:Prompt#mh:SHA-256:6595e7cad34f36df1e5a1022726d6966db84887f11e1ed00270a281f293c8f97",
-      "prompt_chain": "sema:PromptChain#mh:SHA-256:2543cc5972f02b5a21d776643ba485beda876462c57a10c8949d0072e54bd620",
+      "prompt_chain": "sema:PromptChain#mh:SHA-256:50975454f45cce4e45ae4590cd99cee4401596df424ffac720c699609dcc01a6",
       "task": "sema:Task#mh:SHA-256:f239278f610adea7e01a9fd019dc6be158a31919d61d301856dcbe2aa8b67804"
     }
   },
diff --git a/data/vocabulary/MetaProtocols.json b/data/vocabulary/MetaProtocols.json
index 132cda40..e9bbd5da 100644
--- a/data/vocabulary/MetaProtocols.json
+++ b/data/vocabulary/MetaProtocols.json
@@ -15,12 +15,12 @@
       "Strategy"
     ]
   },
-  "sema_id": "sema:MetaProtocols#mh:SHA-256:3561dab6b3e3d5d307a14f23031e29f122c76cbcc4ea1557a3cfdf02e3fe1195",
-  "sema_ref": "MetaProtocols#3561",
-  "sema_stub": "3561",
+  "sema_id": "sema:MetaProtocols#mh:SHA-256:488517ecd31d0dccd9948780277ddd3915ad53def0d955cff90d365b1a665db9",
+  "sema_ref": "MetaProtocols#4885",
+  "sema_stub": "4885",
   "dependencies": {
     "composes_with": {
-      "marginal_value_rule": "sema:MarginalValueRule#mh:SHA-256:eebb10656ec6d554fa7bba3a98b2b9ba1207d58b31d0a794563605595af0f026"
+      "marginal_value_rule": "sema:MarginalValueRule#mh:SHA-256:552ffce38f8fecae07f9faf905f0662ed284531904a94d55da19030138ff941d"
     },
     "references": {
       "pathway_memory": "sema:PathwayMemory#mh:SHA-256:b6a0e82ce9362d546f5ac2da3610ced5e67a516f67fa0756aa90051a74180b82",
diff --git a/data/vocabulary/MonotonicCounter.json b/data/vocabulary/MonotonicCounter.json
index 6b442794..03406035 100644
--- a/data/vocabulary/MonotonicCounter.json
+++ b/data/vocabulary/MonotonicCounter.json
@@ -27,12 +27,12 @@
       "Protocols"
     ]
   },
-  "sema_id": "sema:MonotonicCounter#mh:SHA-256:21c63e6bc594106fb6bd773e2d91a2ecb0aebb43e550d55cfbe901e6a38628a3",
-  "sema_ref": "MonotonicCounter#21c6",
-  "sema_stub": "21c6",
+  "sema_id": "sema:MonotonicCounter#mh:SHA-256:33824eaaf148d996cbc3ccd7521b62dbba087070d23b5421918a446df3f01c8b",
+  "sema_ref": "MonotonicCounter#3382",
+  "sema_stub": "3382",
   "dependencies": {
     "references": {
-      "state_lock": "sema:StateLock#mh:SHA-256:7cd86a9de68522b752366ef04de32f743b57ef16232866522ccdafb1f35c6da9",
+      "state_lock": "sema:StateLock#mh:SHA-256:8bde7c49752578e5c76e46d33b995497728f486d69d99ff618b9dbeaa7586c78",
       "value": "sema:Value#mh:SHA-256:37fd75758d04cdd7f57a636ccb5394d463713d60c33b694e37ab71f4a5a896f8"
     }
   },
diff --git a/data/vocabulary/NormCheck.json b/data/vocabulary/NormCheck.json
index cfabae95..c06f995c 100644
--- a/data/vocabulary/NormCheck.json
+++ b/data/vocabulary/NormCheck.json
@@ -40,9 +40,9 @@
       "Inference"
     ]
   },
-  "sema_id": "sema:NormCheck#mh:SHA-256:b3a0c556a3b52cdd3b366f6494e2d93b3a105434f18f5b913f53164d02868424",
-  "sema_ref": "NormCheck#b3a0",
-  "sema_stub": "b3a0",
+  "sema_id": "sema:NormCheck#mh:SHA-256:53087eaa90c2c9b379ecc0cfe7cd67bcc02e42deb7022e8fc300a87fa75c092b",
+  "sema_ref": "NormCheck#5308",
+  "sema_stub": "5308",
   "signature": [
     "Check(Value)"
   ],
@@ -50,9 +50,9 @@
     "references": {
       "check": "sema:Check#mh:SHA-256:22ecc8bd2d86f344a11551e3bae74a97660e47b1127739e8a84f88f4791960c8",
       "judge": "sema:Judge#mh:SHA-256:24016b1994d525fa1ff75ec9066fc2044284a90a1fe1b6336898bc79237e7f90",
-      "normative_judge": "sema:NormativeJudge#mh:SHA-256:bd4eceb5c9c9bda592351cd95294bf43b6fa46b249594384dc15e5887c04f3e1",
-      "prophet_fan_out": "sema:ProphetFanOut#mh:SHA-256:d47b1a26c9627e3a31433c130549fcbc96ac37bca1bd17536a15230f94dd5095",
-      "quorum": "sema:Quorum#mh:SHA-256:c6a5b21dbe9b2c1fa46e5e67505041c92048a0a687f5703efa45486b51c56957",
+      "normative_judge": "sema:NormativeJudge#mh:SHA-256:4b394d0d33f4d6f7e8fa2566ffa4d8cc17090b55c49c69fe7dbc66dc82b2057c",
+      "prophet_fan_out": "sema:ProphetFanOut#mh:SHA-256:b0f338cae3235461586e3303452b74e696b33b77e971e9a0c34b1b7e3b0292f6",
+      "quorum": "sema:Quorum#mh:SHA-256:d634d5cf0f165f708a5f39e54d8ad42716c11e21189459585468a294d2ebc7bc",
       "value": "sema:Value#mh:SHA-256:37fd75758d04cdd7f57a636ccb5394d463713d60c33b694e37ab71f4a5a896f8"
     }
   },
diff --git a/data/vocabulary/NormativeJudge.json b/data/vocabulary/NormativeJudge.json
index 879e6dcc..b65b2980 100644
--- a/data/vocabulary/NormativeJudge.json
+++ b/data/vocabulary/NormativeJudge.json
@@ -35,9 +35,9 @@
       "Inference"
     ]
   },
-  "sema_id": "sema:NormativeJudge#mh:SHA-256:bd4eceb5c9c9bda592351cd95294bf43b6fa46b249594384dc15e5887c04f3e1",
-  "sema_ref": "NormativeJudge#bd4e",
-  "sema_stub": "bd4e",
+  "sema_id": "sema:NormativeJudge#mh:SHA-256:4b394d0d33f4d6f7e8fa2566ffa4d8cc17090b55c49c69fe7dbc66dc82b2057c",
+  "sema_ref": "NormativeJudge#4b39",
+  "sema_stub": "4b39",
   "signature": [
     "Judge(Value)"
   ],
@@ -52,7 +52,7 @@
       "human_approve": "sema:HumanApprove#mh:SHA-256:a00d536aac2d6660891039ecad29602e85778477b6848395424a5ccaf96afad5",
       "judge": "sema:Judge#mh:SHA-256:24016b1994d525fa1ff75ec9066fc2044284a90a1fe1b6336898bc79237e7f90",
       "outcome": "sema:Outcome#mh:SHA-256:bac20a1c92f4883e971592d642911e215370afbb56ea8afa18313a1f2959d683",
-      "quorum": "sema:Quorum#mh:SHA-256:c6a5b21dbe9b2c1fa46e5e67505041c92048a0a687f5703efa45486b51c56957",
+      "quorum": "sema:Quorum#mh:SHA-256:d634d5cf0f165f708a5f39e54d8ad42716c11e21189459585468a294d2ebc7bc",
       "state": "sema:State#mh:SHA-256:4f25e6a16ccd37dc0bc154cccc7055cb504d49daa8b712f372a425eb6c7b8cb2",
       "value": "sema:Value#mh:SHA-256:37fd75758d04cdd7f57a636ccb5394d463713d60c33b694e37ab71f4a5a896f8"
     }
diff --git a/data/vocabulary/Nucleate.json b/data/vocabulary/Nucleate.json
index fa60b414..62b99886 100644
--- a/data/vocabulary/Nucleate.json
+++ b/data/vocabulary/Nucleate.json
@@ -30,15 +30,15 @@
       "Protocols"
     ]
   },
-  "sema_id": "sema:Nucleate#mh:SHA-256:457ad2d5b65ad6400dfe7b8708047890890aaf9d1428bede19029858af0b7155",
-  "sema_ref": "Nucleate#457a",
-  "sema_stub": "457a",
+  "sema_id": "sema:Nucleate#mh:SHA-256:3763228a0a84b215c71888983568ca343aa8938634b1858d2e31fd303aa7c4fc",
+  "sema_ref": "Nucleate#3763",
+  "sema_stub": "3763",
   "dependencies": {
     "references": {
       "conservation": "sema:Conservation#mh:SHA-256:0b32d007b27a9b5201c46931bdbabd09d08ff9d7b01cf49469f61709989507c2",
       "crystallize": "sema:Crystallize#mh:SHA-256:d187e3c8bb361f0535c474617ef67e5c38f09b5a6e5613b9e327146bb831da98",
       "phase_transition": "sema:PhaseTransition#mh:SHA-256:b7752342dcc7b20033400fc4ec1befd4bc3a31532493d6acdce763293e81c1d7",
-      "rally": "sema:Rally#mh:SHA-256:48a037eb8da9aa05db6d44c4827ed1a243eb07ff0be810b8b8792b05e0419430",
+      "rally": "sema:Rally#mh:SHA-256:bc5fb9825570d17d2869a85f4162c0bee1a152b56b9816b9735c90484dc8b2ff",
       "system": "sema:System#mh:SHA-256:f8eb318a1113a10fead02fbf14ae433767ac1a69c9579cdb584cc622068e90b3",
       "trace": "sema:Trace#mh:SHA-256:314d8d38e6de13bf191dd0d368c8c1bcf7a2d4953b165f66daf7188b90dc37ab"
     }
diff --git a/data/vocabulary/OODA.json b/data/vocabulary/OODA.json
index a7aab0be..536c55c3 100644
--- a/data/vocabulary/OODA.json
+++ b/data/vocabulary/OODA.json
@@ -35,9 +35,9 @@
       "Strategy"
     ]
   },
-  "sema_id": "sema:OODA#mh:SHA-256:c15f818b1324490d5a833f2646f83c4e7f7ac33cbef0637ea076e32ce024be70",
-  "sema_ref": "OODA#c15f",
-  "sema_stub": "c15f",
+  "sema_id": "sema:OODA#mh:SHA-256:2ba0f7a9e4405b1310c229508f60a66290f8616fce92af7d1e9796cf3210b90e",
+  "sema_ref": "OODA#2ba0",
+  "sema_stub": "2ba0",
   "signature": [
     "Agent(Loop)",
     "Think(Strategy)"
@@ -53,7 +53,7 @@
     },
     "references": {
       "agent": "sema:Agent#mh:SHA-256:67659e263616d53dded32875421792f42fadf3137c87fe09cf9f5b9c163f10cf",
-      "context_first": "sema:ContextFirst#mh:SHA-256:a0b6432a809a0c73841202d1802a83018f3db9d5938893415218a383ce151d6a",
+      "context_first": "sema:ContextFirst#mh:SHA-256:75505829fde04a5838eecbcc83757f2e96bdd064f0aab6eabeccc6e69ce2725a",
       "loop": "sema:Loop#mh:SHA-256:984a20b35090934ca5ea1f97f2026b6be48b3805ddc0802f32ba66fe6bfcaf87",
       "state": "sema:State#mh:SHA-256:4f25e6a16ccd37dc0bc154cccc7055cb504d49daa8b712f372a425eb6c7b8cb2",
       "strategy": "sema:Strategy#mh:SHA-256:0f2fcc85aff835c79ab80064df1655f8707bc5c80bbde7c3e1a2ba672a9cd49c"
diff --git a/data/vocabulary/OptimisticSolver.json b/data/vocabulary/OptimisticSolver.json
index 7c33a87a..92641acc 100644
--- a/data/vocabulary/OptimisticSolver.json
+++ b/data/vocabulary/OptimisticSolver.json
@@ -28,21 +28,21 @@
     ]
   },
   "derived_from": "sema:Solver#mh:SHA-256:b00a16afef5a9d3293955f36b44fe6fc0e0c4ce0fc118de4a7459f77fe7d98d7",
-  "sema_id": "sema:OptimisticSolver#mh:SHA-256:18c043757659c13a56ceab6640765f6ecf4e24a9cfffc6cdf9e6ccf7f05c2e77",
-  "sema_ref": "OptimisticSolver#18c0",
-  "sema_stub": "18c0",
+  "sema_id": "sema:OptimisticSolver#mh:SHA-256:a96fd56ca17c012b3ee75a4a37061e2592ed742cd75175540537b5fb68136880",
+  "sema_ref": "OptimisticSolver#a96f",
+  "sema_stub": "a96f",
   "dependencies": {
     "composes_with": {
-      "atomic_bid": "sema:AtomicBid#mh:SHA-256:33e1d5689a56922e56ffedb768c82621a62e207160fc4f97228e5dddac588d65",
-      "compensate": "sema:Compensate#mh:SHA-256:9b3b07b7a02d00b6df1ecc3ee69fa3dcd2b33e07f045c67f26deb6cf311694f2",
+      "atomic_bid": "sema:AtomicBid#mh:SHA-256:9c0c78d25ef587cbb5802e4e9243055062fa27a45f30d46896d464c840a35fcd",
+      "compensate": "sema:Compensate#mh:SHA-256:e23bc7c0d3825460855e7ee5e2e41f512ff8e318ad741b1ba4e0303cb66e39b9",
       "compute_budget": "sema:ComputeBudget#mh:SHA-256:47c6eb12f7537f418cdfa9358a501b394d3b4460dd2f8c85560687b1e782b8c2",
       "pathway_memory": "sema:PathwayMemory#mh:SHA-256:b6a0e82ce9362d546f5ac2da3610ced5e67a516f67fa0756aa90051a74180b82",
       "reflexion": "sema:Reflexion#mh:SHA-256:4a467a44a1172f5d7d2119e3a4c3646e36a5f8dea4cdca2fa85bea6f92619d83"
     },
     "references": {
       "parallel": "sema:Parallel#mh:SHA-256:e799c1986d62c4a052090842aabe144193587f8a4d8dd23617d027b2e9b85098",
-      "polymorphic_solver": "sema:PolymorphicSolver#mh:SHA-256:272ac4237fd71c0782676ed30558bad9c08fca9373577516284bf5def22b2800",
-      "rigorous_solver": "sema:RigorousSolver#mh:SHA-256:b75d4b063fc8f90f4a1361ef08c8dac02fbf147f0c8f122ca390fdbde74d39cd"
+      "polymorphic_solver": "sema:PolymorphicSolver#mh:SHA-256:3653f233738b26efaa02e0750c25ee0e743a32e0bce28afafde84b74f42b87f7",
+      "rigorous_solver": "sema:RigorousSolver#mh:SHA-256:70d41b35ddab10c9575b6feed8022935cb266f3d81fce659cfb6b8b9c2d4dc94"
     }
   },
   "sema_layer": "Society",
diff --git a/data/vocabulary/Oracle.json b/data/vocabulary/Oracle.json
index 6fae043a..ad966916 100644
--- a/data/vocabulary/Oracle.json
+++ b/data/vocabulary/Oracle.json
@@ -6,9 +6,9 @@
     "Non-Interference: The Oracle reports on reality but does not alter it.",
     "Consistency: Answers to the same query at the same time must be identical."
   ],
-  "sema_id": "sema:Oracle#mh:SHA-256:32ff9960b130bb765f24046c85fcc3fc3f8d6dabef21da9e0804280cc626023f",
-  "sema_ref": "Oracle#32ff",
-  "sema_stub": "32ff",
+  "sema_id": "sema:Oracle#mh:SHA-256:5614dedfed7d990d6c413d7492798b66b7caa97f155a74bfe3147ac5a78c945a",
+  "sema_ref": "Oracle#5614",
+  "sema_stub": "5614",
   "_meta": {
     "ring": 1,
     "tier": 1,
@@ -23,7 +23,7 @@
   },
   "dependencies": {
     "references": {
-      "held_release": "sema:HeldRelease#mh:SHA-256:533b77d8341545dd80bd5a940492f028059ee8105cf523b26e4c16736ced46a5"
+      "held_release": "sema:HeldRelease#mh:SHA-256:10b0ae36dabba68fe8aad67adf8075ce5a5f0b2a3bb602c7bd3380b0dd0117d9"
     }
   },
   "sema_layer": "Society",
diff --git a/data/vocabulary/OrchestrationLoop.json b/data/vocabulary/OrchestrationLoop.json
index 242f2913..91db0b25 100644
--- a/data/vocabulary/OrchestrationLoop.json
+++ b/data/vocabulary/OrchestrationLoop.json
@@ -28,17 +28,17 @@
       "Protocols"
     ]
   },
-  "sema_id": "sema:OrchestrationLoop#mh:SHA-256:156fbc2f8630fe24a957a3c9a9938a02ce3494b9858d7e939d882430e96e23e9",
-  "sema_ref": "OrchestrationLoop#156f",
-  "sema_stub": "156f",
+  "sema_id": "sema:OrchestrationLoop#mh:SHA-256:212895d134c09e50af6ec4a668c23ffc4a92604b61c411aaa5f12b7b93b75d1e",
+  "sema_ref": "OrchestrationLoop#2128",
+  "sema_stub": "2128",
   "signature": [
     "Workflow(Rollout)"
   ],
   "dependencies": {
     "composes_with": {
       "manifest_planning": "sema:ManifestPlanning#mh:SHA-256:b7f211fc4e9af89158c6d7f76bc2dc1b33b78246975ab6d5fc3ee238b9f5c852",
-      "request_framing": "sema:RequestFraming#mh:SHA-256:8c6cf10e82ea7b80e3902d6947dca62be9ae0d7494787c6c4ca84113653e26e6",
-      "rollout": "sema:Rollout#mh:SHA-256:8fc16ddf8f7add799ac8b49f7894f508be0b8378f995e57540cab8ec028eb996"
+      "request_framing": "sema:RequestFraming#mh:SHA-256:e9739d11444b84d2d5cf63a9a878db9b17ba68598a2ee2bd5c4e85a0e9fdb76c",
+      "rollout": "sema:Rollout#mh:SHA-256:84e234d9616bde2b394074e3d082e85c7ee74068d65f2aa8642a5e3a64f97c26"
     },
     "references": {
       "accept_spec": "sema:AcceptSpec#mh:SHA-256:c1565bf022e5596a447f7c9d9687ac3cbf1e6960f871be16f386eec02b5df2c4",
@@ -46,7 +46,7 @@
       "frame_spec": "sema:FrameSpec#mh:SHA-256:c9bc3b38bb41a0bcde26967aaebf526a344444a4f516da4fa056f8c0c347a72e",
       "receptivity_gate": "sema:ReceptivityGate#mh:SHA-256:27099802d49cf3b086d4149bd9697dd2e7ff680de09f3e1395172cf4e45c2096",
       "rollout_manifest": "sema:RolloutManifest#mh:SHA-256:c0640e00390f15f0f8daaa6340cebd9852a0ff6d354e20e6d60498236c598d28",
-      "workflow": "sema:Workflow#mh:SHA-256:6de060aa8b0e98b2042b10aa6465125ca877a41d8d10859a8d4a7f2f9ea5fcc6"
+      "workflow": "sema:Workflow#mh:SHA-256:982bc58d26f2d57c21420514e03f33d68e10ca20b01eae9953927cb95b437042"
     }
   },
   "sema_layer": "Society",
diff --git a/data/vocabulary/PUREBrainstorming.json b/data/vocabulary/PUREBrainstorming.json
index a871e48d..28acf1e5 100644
--- a/data/vocabulary/PUREBrainstorming.json
+++ b/data/vocabulary/PUREBrainstorming.json
@@ -18,13 +18,13 @@
       "Strategy"
     ]
   },
-  "sema_ref": "PUREBrainstorming#9ba1",
-  "sema_id": "sema:PUREBrainstorming#mh:SHA-256:9ba126fc9e0dde8ae526e775831ea41e84e9dd70c1e4b6f9f9a498e9ea42c3b2",
-  "sema_stub": "9ba1",
+  "sema_ref": "PUREBrainstorming#c03a",
+  "sema_id": "sema:PUREBrainstorming#mh:SHA-256:c03aa5e0e413c5d3c8a25732d183277e0701fbde90d2e30fe3c12903a14b1cbb",
+  "sema_stub": "c03a",
   "dependencies": {
     "composes_with": {
       "pure_check": "sema:PURECheck#mh:SHA-256:e27797e99add1f808b06cc5422fb2fc586af89af2e7fc7c955eaf8d79f563250",
-      "pure_optimization": "sema:PUREOptimization#mh:SHA-256:89feb6383295f0b6e42d37b6e704c7d02ba63c58d6e4482d801e27a63f299bfd"
+      "pure_optimization": "sema:PUREOptimization#mh:SHA-256:3d637c2dc4c764b0a31aea124872527644ed3df12462d3b4f81878d644ee29a3"
     },
     "references": {
       "p_u_r_e": "sema:PURE#mh:SHA-256:7ed435750dde79d334021535d6fefcf015d68db51189c90bedbcc14743757436"
diff --git a/data/vocabulary/PUREOptimization.json b/data/vocabulary/PUREOptimization.json
index dc787622..c96a46f4 100644
--- a/data/vocabulary/PUREOptimization.json
+++ b/data/vocabulary/PUREOptimization.json
@@ -29,9 +29,9 @@
       "Strategy"
     ]
   },
-  "sema_ref": "PUREOptimization#89fe",
-  "sema_id": "sema:PUREOptimization#mh:SHA-256:89feb6383295f0b6e42d37b6e704c7d02ba63c58d6e4482d801e27a63f299bfd",
-  "sema_stub": "89fe",
+  "sema_ref": "PUREOptimization#3d63",
+  "sema_id": "sema:PUREOptimization#mh:SHA-256:3d637c2dc4c764b0a31aea124872527644ed3df12462d3b4f81878d644ee29a3",
+  "sema_stub": "3d63",
   "dependencies": {
     "accepts": {
       "solution": "sema:Solution#mh:SHA-256:48442c3e14ce25ef325cbff085d095ecf4c7735b006f162eb76e23d4315f8fa2"
@@ -39,7 +39,7 @@
     "composes_with": {
       "decompose": "sema:Decompose#mh:SHA-256:63f31488a348d1176b6b16e770c69f196c2e03f507a240103e8297487dc4f652",
       "optimize": "sema:Optimize#mh:SHA-256:94e09b6b86c58500e9716efa1c955fc115e5179b95e48bd45c980af77d7c4c17",
-      "polymorphic_solver": "sema:PolymorphicSolver#mh:SHA-256:272ac4237fd71c0782676ed30558bad9c08fca9373577516284bf5def22b2800",
+      "polymorphic_solver": "sema:PolymorphicSolver#mh:SHA-256:3653f233738b26efaa02e0750c25ee0e743a32e0bce28afafde84b74f42b87f7",
       "synthesis": "sema:Synthesis#mh:SHA-256:46b9ca1ae3a7711fc932ec43d901d25ef27b7c60c8f64f6fef818eec2027f6ea"
     },
     "references": {
diff --git a/data/vocabulary/PerformanceSignal.json b/data/vocabulary/PerformanceSignal.json
index 249e8ef0..0c92aabb 100644
--- a/data/vocabulary/PerformanceSignal.json
+++ b/data/vocabulary/PerformanceSignal.json
@@ -55,13 +55,13 @@
       "Data Structures"
     ]
   },
-  "sema_id": "sema:PerformanceSignal#mh:SHA-256:7dea9b2784b3fa72856ba2b90eedc79ceb7c0b499b1c2a2bfdac205a5dbc27bf",
-  "sema_ref": "PerformanceSignal#7dea",
-  "sema_stub": "7dea",
+  "sema_id": "sema:PerformanceSignal#mh:SHA-256:10af65000a53f88e121ac8edbc6b6d3a105a5a86a5b1b370cd227e2062a4dcd3",
+  "sema_ref": "PerformanceSignal#10af",
+  "sema_stub": "10af",
   "dependencies": {
     "references": {
       "feedback": "sema:Feedback#mh:SHA-256:5e6d456e19d4b57377c23d33584271b255557c076b2611c23d23afd1e542eb37",
-      "frame_error": "sema:FrameError#mh:SHA-256:22e143610af8d9d6296b9497ad462eb71a3933aa6d77488f6a1e2226f81c45fc",
+      "frame_error": "sema:FrameError#mh:SHA-256:f67433d411f7ce3c8582a6685e6fc43285c2e96680b404acb8f399a74198fe4b",
       "pathway_memory": "sema:PathwayMemory#mh:SHA-256:b6a0e82ce9362d546f5ac2da3610ced5e67a516f67fa0756aa90051a74180b82"
     }
   },
diff --git a/data/vocabulary/PolymorphicSolver.json b/data/vocabulary/PolymorphicSolver.json
index bcd5681f..1c35b7d2 100644
--- a/data/vocabulary/PolymorphicSolver.json
+++ b/data/vocabulary/PolymorphicSolver.json
@@ -23,9 +23,9 @@
     "Manifest Drift: Capabilities declared in Manifest do not match runtime behavior."
   ],
   "derived_from": "sema:Solver#mh:SHA-256:b00a16afef5a9d3293955f36b44fe6fc0e0c4ce0fc118de4a7459f77fe7d98d7",
-  "sema_id": "sema:PolymorphicSolver#mh:SHA-256:272ac4237fd71c0782676ed30558bad9c08fca9373577516284bf5def22b2800",
-  "sema_ref": "PolymorphicSolver#272a",
-  "sema_stub": "272a",
+  "sema_id": "sema:PolymorphicSolver#mh:SHA-256:3653f233738b26efaa02e0750c25ee0e743a32e0bce28afafde84b74f42b87f7",
+  "sema_ref": "PolymorphicSolver#3653",
+  "sema_stub": "3653",
   "dependencies": {
     "accepts": {
       "task": "sema:Task#mh:SHA-256:f239278f610adea7e01a9fd019dc6be158a31919d61d301856dcbe2aa8b67804"
@@ -40,9 +40,9 @@
     },
     "references": {
       "card": "sema:Card#mh:SHA-256:84b75e4aa9df317e013f042ff44e2cc81e5f3092d405375f2c84e4dad9d39b0b",
-      "performance_signal": "sema:PerformanceSignal#mh:SHA-256:7dea9b2784b3fa72856ba2b90eedc79ceb7c0b499b1c2a2bfdac205a5dbc27bf",
-      "solver_node": "sema:SolverNode#mh:SHA-256:fd50fc5063ba52d2670169e4a8388e475cdc69084de648606236716f9ccc13b4",
-      "universal_solver_tree": "sema:UniversalSolverTree#mh:SHA-256:7361e8ea2303b8cd0970fe167548cbf9c86f7f418f175424906f563db22729ae",
+      "performance_signal": "sema:PerformanceSignal#mh:SHA-256:10af65000a53f88e121ac8edbc6b6d3a105a5a86a5b1b370cd227e2062a4dcd3",
+      "solver_node": "sema:SolverNode#mh:SHA-256:45292efbd4e607174b8e0b82535d8bede20eb408a9d341b86742e1db2982ea1a",
+      "universal_solver_tree": "sema:UniversalSolverTree#mh:SHA-256:0923a89effa56135175d1404578641c31d6f2d63716745aba054d7143ad0d6f9",
       "validate": "sema:Validate#mh:SHA-256:337ce6c03c892bd0d326d81a8ae3a51e76557391240cf9a1694ff85458fe358e"
     },
     "yields": {
diff --git a/data/vocabulary/ProblemFramer.json b/data/vocabulary/ProblemFramer.json
index 5c3a4337..a8dfa70d 100644
--- a/data/vocabulary/ProblemFramer.json
+++ b/data/vocabulary/ProblemFramer.json
@@ -22,18 +22,18 @@
       "Strategy"
     ]
   },
-  "sema_ref": "ProblemFramer#2718",
-  "sema_id": "sema:ProblemFramer#mh:SHA-256:271894d4cdcba54a6c1f4c85f1983d05f86c18c7b12948ef19619addebc4a70f",
-  "sema_stub": "2718",
+  "sema_ref": "ProblemFramer#ea80",
+  "sema_id": "sema:ProblemFramer#mh:SHA-256:ea80628660b357af41d6877843b44f7898d1677171c0a13c5e258d59639469f1",
+  "sema_stub": "ea80",
   "dependencies": {
     "composes_with": {
       "interpret": "sema:Interpret#mh:SHA-256:ff6daf0b5967deb7da11c1a2ea74ce7e6ab9baf6362a53045bff656b0c5671dc",
       "reframe": "sema:Reframe#mh:SHA-256:573733f86a965e0db34ce77c54bada908c9561248a7d5a9b76652dba71e1565a",
-      "request_framing": "sema:RequestFraming#mh:SHA-256:8c6cf10e82ea7b80e3902d6947dca62be9ae0d7494787c6c4ca84113653e26e6"
+      "request_framing": "sema:RequestFraming#mh:SHA-256:e9739d11444b84d2d5cf63a9a878db9b17ba68598a2ee2bd5c4e85a0e9fdb76c"
     },
     "references": {
-      "root_solver": "sema:RootSolver#mh:SHA-256:6d0d34bacbf2d51f0c8152acde51d1bcc1c3f2e93127d4e03ea037a87183980b",
-      "universal_solver_tree": "sema:UniversalSolverTree#mh:SHA-256:7361e8ea2303b8cd0970fe167548cbf9c86f7f418f175424906f563db22729ae"
+      "root_solver": "sema:RootSolver#mh:SHA-256:750d3992db274fa89e6bad275ad10c0fc6ea9969cc9e4ff9cd809c77f96a4d32",
+      "universal_solver_tree": "sema:UniversalSolverTree#mh:SHA-256:0923a89effa56135175d1404578641c31d6f2d63716745aba054d7143ad0d6f9"
     },
     "yields": {
       "accept_spec": "sema:AcceptSpec#mh:SHA-256:c1565bf022e5596a447f7c9d9687ac3cbf1e6960f871be16f386eec02b5df2c4"
diff --git a/data/vocabulary/PromptChain.json b/data/vocabulary/PromptChain.json
index 370c73d4..ccfd58fd 100644
--- a/data/vocabulary/PromptChain.json
+++ b/data/vocabulary/PromptChain.json
@@ -36,9 +36,9 @@
       "Protocols"
     ]
   },
-  "sema_id": "sema:PromptChain#mh:SHA-256:2543cc5972f02b5a21d776643ba485beda876462c57a10c8949d0072e54bd620",
-  "sema_ref": "PromptChain#2543",
-  "sema_stub": "2543",
+  "sema_id": "sema:PromptChain#mh:SHA-256:50975454f45cce4e45ae4590cd99cee4401596df424ffac720c699609dcc01a6",
+  "sema_ref": "PromptChain#5097",
+  "sema_stub": "5097",
   "dependencies": {
     "accepts": {
       "task": "sema:Task#mh:SHA-256:f239278f610adea7e01a9fd019dc6be158a31919d61d301856dcbe2aa8b67804"
@@ -48,7 +48,7 @@
       "chain": "sema:Chain#mh:SHA-256:0bd807adb8a1d11a55f3971e7b6c079301039c8707b9106d871662d25e915e09",
       "gate": "sema:Gate#mh:SHA-256:bc636a863f99226e579fa58c6016053d5940510270fe7b4f3314a418408728e8",
       "input_guard": "sema:InputGuard#mh:SHA-256:fb8233411dd70e49aba71650dccb3ccbf6704261d5e75d2ff0edef6990e415be",
-      "retry": "sema:Retry#mh:SHA-256:79b69773b2fdd6fc81b1205d1088e9df841db683a982e079fc2dca97f4818804",
+      "retry": "sema:Retry#mh:SHA-256:9e178c29dd1aa774432d8eb6e87fb2e93ab5b1a6db9582f737ad60e9ddf56053",
       "sequence": "sema:Sequence#mh:SHA-256:0cae6b0951c4e93742259ff81ded009a85283d250c948f97cce3b9b3b8e58e1a",
       "tool_invoke": "sema:ToolInvoke#mh:SHA-256:011f50770f2599f5017df648ad5920ddb732f7681a9a3b7576cdcf3798ce6baa"
     }
diff --git a/data/vocabulary/ProphetFanOut.json b/data/vocabulary/ProphetFanOut.json
index 75376896..72f859d8 100644
--- a/data/vocabulary/ProphetFanOut.json
+++ b/data/vocabulary/ProphetFanOut.json
@@ -26,14 +26,14 @@
       "Inference"
     ]
   },
-  "sema_id": "sema:ProphetFanOut#mh:SHA-256:d47b1a26c9627e3a31433c130549fcbc96ac37bca1bd17536a15230f94dd5095",
-  "sema_ref": "ProphetFanOut#d47b",
-  "sema_stub": "d47b",
+  "sema_id": "sema:ProphetFanOut#mh:SHA-256:b0f338cae3235461586e3303452b74e696b33b77e971e9a0c34b1b7e3b0292f6",
+  "sema_ref": "ProphetFanOut#b0f3",
+  "sema_stub": "b0f3",
   "dependencies": {
     "references": {
       "aggregate": "sema:Aggregate#mh:SHA-256:4861bd34b2e422951e42b0fd804dab73daa2753ea746c0141927c3e5c6ea8f4b",
       "chain": "sema:Chain#mh:SHA-256:0bd807adb8a1d11a55f3971e7b6c079301039c8707b9106d871662d25e915e09",
-      "quorum": "sema:Quorum#mh:SHA-256:c6a5b21dbe9b2c1fa46e5e67505041c92048a0a687f5703efa45486b51c56957"
+      "quorum": "sema:Quorum#mh:SHA-256:d634d5cf0f165f708a5f39e54d8ad42716c11e21189459585468a294d2ebc7bc"
     }
   },
   "sema_layer": "Mind",
diff --git a/data/vocabulary/PropheticQuorum.json b/data/vocabulary/PropheticQuorum.json
index 8c3a86fc..6118a8db 100644
--- a/data/vocabulary/PropheticQuorum.json
+++ b/data/vocabulary/PropheticQuorum.json
@@ -44,18 +44,18 @@
       "Protocols"
     ]
   },
-  "sema_id": "sema:PropheticQuorum#mh:SHA-256:1091d4dbc1638dc67cda263e645f50bda77352363ce4ea5dbf24c281781401ba",
-  "sema_ref": "PropheticQuorum#1091",
-  "sema_stub": "1091",
+  "sema_id": "sema:PropheticQuorum#mh:SHA-256:912b31f437a93df19ecb7ced4f0a9d11f3fe1d659d63edcb3ddef13a5e409056",
+  "sema_ref": "PropheticQuorum#912b",
+  "sema_stub": "912b",
   "dependencies": {
     "references": {
       "check": "sema:Check#mh:SHA-256:22ecc8bd2d86f344a11551e3bae74a97660e47b1127739e8a84f88f4791960c8",
-      "normative_judge": "sema:NormativeJudge#mh:SHA-256:bd4eceb5c9c9bda592351cd95294bf43b6fa46b249594384dc15e5887c04f3e1",
+      "normative_judge": "sema:NormativeJudge#mh:SHA-256:4b394d0d33f4d6f7e8fa2566ffa4d8cc17090b55c49c69fe7dbc66dc82b2057c",
       "simulation": "sema:Simulation#mh:SHA-256:ebb11496dccf2bb9e9f483633e9fa618751af7dddcd5d6f8d0377e8d74b7aacf",
       "simulation_trace": "sema:SimulationTrace#mh:SHA-256:9383a9b0cb85562dc38baba1967c166f4f836ae399c08b5b229070ad279a8163",
       "state": "sema:State#mh:SHA-256:4f25e6a16ccd37dc0bc154cccc7055cb504d49daa8b712f372a425eb6c7b8cb2",
       "value": "sema:Value#mh:SHA-256:37fd75758d04cdd7f57a636ccb5394d463713d60c33b694e37ab71f4a5a896f8",
-      "vote": "sema:Vote#mh:SHA-256:3b66510363464c335c95a843247ddd37bbb98616a17f6a8d4bb17b1ac91bd41c"
+      "vote": "sema:Vote#mh:SHA-256:0affbbc722d42218027f581176be08d0a66c9a3dc99adbf94d411ef9fc38786c"
     }
   },
   "sema_layer": "Society",
diff --git a/data/vocabulary/Quorum.json b/data/vocabulary/Quorum.json
index 2f2d63e0..a79a0f3e 100644
--- a/data/vocabulary/Quorum.json
+++ b/data/vocabulary/Quorum.json
@@ -47,12 +47,12 @@
       "Primitives"
     ]
   },
-  "sema_id": "sema:Quorum#mh:SHA-256:c6a5b21dbe9b2c1fa46e5e67505041c92048a0a687f5703efa45486b51c56957",
-  "sema_ref": "Quorum#c6a5",
-  "sema_stub": "c6a5",
+  "sema_id": "sema:Quorum#mh:SHA-256:d634d5cf0f165f708a5f39e54d8ad42716c11e21189459585468a294d2ebc7bc",
+  "sema_ref": "Quorum#d634",
+  "sema_stub": "d634",
   "dependencies": {
     "accepts": {
-      "ballot": "sema:Ballot#mh:SHA-256:43ebc85e8e87e132698c59536402d1ba715b0dbad9e6c116f97a056c60da4577"
+      "ballot": "sema:Ballot#mh:SHA-256:84c3ea1db9fa8ab818d4fd156a8ef0a43d15b50419ca42236869bd9119f35497"
     }
   },
   "sema_layer": "Infrastructure",
diff --git a/data/vocabulary/QuorumPulse.json b/data/vocabulary/QuorumPulse.json
index 6c66c164..a2ac047f 100644
--- a/data/vocabulary/QuorumPulse.json
+++ b/data/vocabulary/QuorumPulse.json
@@ -28,13 +28,13 @@
       "Protocols"
     ]
   },
-  "sema_id": "sema:QuorumPulse#mh:SHA-256:809c26bb26f1138742b2ea0cd0b41be34af1cc39aedbcd4d6ecb77a602a3b201",
-  "sema_ref": "QuorumPulse#809c",
-  "sema_stub": "809c",
+  "sema_id": "sema:QuorumPulse#mh:SHA-256:2fc270db6e8b532f6983bcabcdd33ace1cc40a026ed8828b5d52cca6a01ffc0e",
+  "sema_ref": "QuorumPulse#2fc2",
+  "sema_stub": "2fc2",
   "dependencies": {
     "references": {
-      "heartbeat": "sema:Heartbeat#mh:SHA-256:c36fe65a4b171559a33cb36f37ec448dce8ad7092c665426bfabee3dbeb6d1c1",
-      "quorum": "sema:Quorum#mh:SHA-256:c6a5b21dbe9b2c1fa46e5e67505041c92048a0a687f5703efa45486b51c56957",
+      "heartbeat": "sema:Heartbeat#mh:SHA-256:d0e6ffd899704efd75b87f0365bbe48fec4a1179b81e08923779ed84be7c83c2",
+      "quorum": "sema:Quorum#mh:SHA-256:d634d5cf0f165f708a5f39e54d8ad42716c11e21189459585468a294d2ebc7bc",
       "signal": "sema:Signal#mh:SHA-256:2ac0768f06e77d96b5d0bf8204205f519a24d704d496ce59519c9e8ddd546ab2",
       "state": "sema:State#mh:SHA-256:4f25e6a16ccd37dc0bc154cccc7055cb504d49daa8b712f372a425eb6c7b8cb2"
     }
diff --git a/data/vocabulary/Rally.json b/data/vocabulary/Rally.json
index b644d5ff..dc9461cc 100644
--- a/data/vocabulary/Rally.json
+++ b/data/vocabulary/Rally.json
@@ -53,9 +53,9 @@
       "Coordination"
     ]
   },
-  "sema_id": "sema:Rally#mh:SHA-256:48a037eb8da9aa05db6d44c4827ed1a243eb07ff0be810b8b8792b05e0419430",
-  "sema_ref": "Rally#48a0",
-  "sema_stub": "48a0",
+  "sema_id": "sema:Rally#mh:SHA-256:bc5fb9825570d17d2869a85f4162c0bee1a152b56b9816b9735c90484dc8b2ff",
+  "sema_ref": "Rally#bc5f",
+  "sema_stub": "bc5f",
   "dependencies": {
     "accepts": {
       "selection_criteria": "sema:Criteria#mh:SHA-256:0400adf0f807511f10b40b026098056dbb7124915c2045cc85fb687fabc7f9ac"
@@ -65,9 +65,9 @@
     },
     "references": {
       "context": "sema:Context#mh:SHA-256:d5f79a21faef9ef640ab687c90a25cdf457a066fb6da23d247115b267c539132",
-      "elect": "sema:Elect#mh:SHA-256:45ff98aaa03731e8e490293d799edba62f98b40669828f2d32b436a0ecd4b6ca",
+      "elect": "sema:Elect#mh:SHA-256:187a9d1996e3ad1fcb86b8dfe1207efb6473f2488bbf2741e5d77207b9dcdd38",
       "protocol": "sema:Protocol#mh:SHA-256:e53765fe6abfb95285f1b698b11cc01ab3f7e1d8f82f57186f60127d92c564db",
-      "quorum": "sema:Quorum#mh:SHA-256:c6a5b21dbe9b2c1fa46e5e67505041c92048a0a687f5703efa45486b51c56957",
+      "quorum": "sema:Quorum#mh:SHA-256:d634d5cf0f165f708a5f39e54d8ad42716c11e21189459585468a294d2ebc7bc",
       "select": "sema:Select#mh:SHA-256:2fa0da3874e2a9a2c8664ed919d03c28a1f6b76daf9621f069d1ca1cb18a64b6"
     }
   },
diff --git a/data/vocabulary/ReAttempt.json b/data/vocabulary/ReAttempt.json
index f9f6c9f6..08ad4411 100644
--- a/data/vocabulary/ReAttempt.json
+++ b/data/vocabulary/ReAttempt.json
@@ -16,13 +16,13 @@
       "Primitives"
     ]
   },
-  "sema_id": "sema:ReAttempt#mh:SHA-256:39a6d8dc35788fdba9bcb56064f39c16792f921d6db387dee99ebe049dc865ab",
-  "sema_ref": "ReAttempt#39a6",
-  "sema_stub": "39a6",
+  "sema_id": "sema:ReAttempt#mh:SHA-256:be449bf89961efce218b58a985fd84f131b324655c10566a8815fceaa647ee06",
+  "sema_ref": "ReAttempt#be44",
+  "sema_stub": "be44",
   "dependencies": {
     "references": {
-      "backoff": "sema:Backoff#mh:SHA-256:16c2d636281df44ed78ef3bce341e7a349fd37cbd675706e2e395172c1dccae6",
-      "retry": "sema:Retry#mh:SHA-256:79b69773b2fdd6fc81b1205d1088e9df841db683a982e079fc2dca97f4818804"
+      "backoff": "sema:Backoff#mh:SHA-256:9e59718422f5408d7892feccb6d538a21103f9573b122b891ee3c8cf66303e72",
+      "retry": "sema:Retry#mh:SHA-256:9e178c29dd1aa774432d8eb6e87fb2e93ab5b1a6db9582f737ad60e9ddf56053"
     }
   },
   "sema_layer": "Infrastructure",
diff --git a/data/vocabulary/RealizationProtocol.json b/data/vocabulary/RealizationProtocol.json
index c865b5bd..4ac7358d 100644
--- a/data/vocabulary/RealizationProtocol.json
+++ b/data/vocabulary/RealizationProtocol.json
@@ -35,21 +35,21 @@
   "signature": [
     "SolverTree(Outcome)"
   ],
-  "sema_id": "sema:RealizationProtocol#mh:SHA-256:663bfe23868f8e0897c443f113a37ea2a5565df6a61dec7f4110ea855e1db0d8",
-  "sema_ref": "RealizationProtocol#663b",
-  "sema_stub": "663b",
+  "sema_id": "sema:RealizationProtocol#mh:SHA-256:b4ceb8c0d477cba4ef053db0fa8f6e6b677327fba3fb6a48f9ee9d71f9af6cbb",
+  "sema_ref": "RealizationProtocol#b4ce",
+  "sema_stub": "b4ce",
   "dependencies": {
     "composes_with": {
       "interpret": "sema:Interpret#mh:SHA-256:ff6daf0b5967deb7da11c1a2ea74ce7e6ab9baf6362a53045bff656b0c5671dc",
       "manifest_planning": "sema:ManifestPlanning#mh:SHA-256:b7f211fc4e9af89158c6d7f76bc2dc1b33b78246975ab6d5fc3ee238b9f5c852",
-      "rollout": "sema:Rollout#mh:SHA-256:8fc16ddf8f7add799ac8b49f7894f508be0b8378f995e57540cab8ec028eb996"
+      "rollout": "sema:Rollout#mh:SHA-256:84e234d9616bde2b394074e3d082e85c7ee74068d65f2aa8642a5e3a64f97c26"
     },
     "references": {
       "execution_manifest": "sema:ExecutionManifest#mh:SHA-256:4342d3162e552fdbfcde1d594a4156ca6f2e0e42fcb20a9be2bc5ba54a4af0d0",
       "frame_spec": "sema:FrameSpec#mh:SHA-256:c9bc3b38bb41a0bcde26967aaebf526a344444a4f516da4fa056f8c0c347a72e",
-      "polymorphic_solver": "sema:PolymorphicSolver#mh:SHA-256:272ac4237fd71c0782676ed30558bad9c08fca9373577516284bf5def22b2800",
+      "polymorphic_solver": "sema:PolymorphicSolver#mh:SHA-256:3653f233738b26efaa02e0750c25ee0e743a32e0bce28afafde84b74f42b87f7",
       "realizable": "sema:Realizable#mh:SHA-256:42f8270af6b0361a440bf86d1ece23a0117d34f504d9db576f30f67cf04815b3",
-      "solver_tree": "sema:SolverTree#mh:SHA-256:2e4c0e7dce54bfdddd61b9ec1a19715036eb916f979695719b7b8987dce72057"
+      "solver_tree": "sema:SolverTree#mh:SHA-256:0c3f163ca8ac5f88d9548387e9b22338281d90d5404ea4281aebbe94d4b713ce"
     },
     "yields": {
       "outcome": "sema:Outcome#mh:SHA-256:bac20a1c92f4883e971592d642911e215370afbb56ea8afa18313a1f2959d683"
diff --git a/data/vocabulary/RecursionDive.json b/data/vocabulary/RecursionDive.json
index 105e822d..9812dbe5 100644
--- a/data/vocabulary/RecursionDive.json
+++ b/data/vocabulary/RecursionDive.json
@@ -17,16 +17,16 @@
       "Reasoning"
     ]
   },
-  "sema_id": "sema:RecursionDive#mh:SHA-256:7e67260837bfb3fd46b514f9ddfe0b6e6f62657e8af2a626a14e29f77ada285d",
-  "sema_ref": "RecursionDive#7e67",
-  "sema_stub": "7e67",
+  "sema_id": "sema:RecursionDive#mh:SHA-256:bd1380babbca57f5f1a00721f887c9ecf6fff48d73302a28e735d956134b4921",
+  "sema_ref": "RecursionDive#bd13",
+  "sema_stub": "bd13",
   "dependencies": {
     "composes_with": {
       "decompose": "sema:Decompose#mh:SHA-256:63f31488a348d1176b6b16e770c69f196c2e03f507a240103e8297487dc4f652"
     },
     "references": {
-      "solver_node": "sema:SolverNode#mh:SHA-256:fd50fc5063ba52d2670169e4a8388e475cdc69084de648606236716f9ccc13b4",
-      "solver_tree": "sema:SolverTree#mh:SHA-256:2e4c0e7dce54bfdddd61b9ec1a19715036eb916f979695719b7b8987dce72057"
+      "solver_node": "sema:SolverNode#mh:SHA-256:45292efbd4e607174b8e0b82535d8bede20eb408a9d341b86742e1db2982ea1a",
+      "solver_tree": "sema:SolverTree#mh:SHA-256:0c3f163ca8ac5f88d9548387e9b22338281d90d5404ea4281aebbe94d4b713ce"
     }
   },
   "sema_layer": "Mind",
diff --git a/data/vocabulary/RegimeSense.json b/data/vocabulary/RegimeSense.json
index 98e14502..ea3fe5c7 100644
--- a/data/vocabulary/RegimeSense.json
+++ b/data/vocabulary/RegimeSense.json
@@ -44,9 +44,9 @@
       "Inference"
     ]
   },
-  "sema_id": "sema:RegimeSense#mh:SHA-256:56eccdcf5c9e28545cb3ad569f86ec1bf3dec5e2eb4f9620f980da72b11937cf",
-  "sema_ref": "RegimeSense#56ec",
-  "sema_stub": "56ec",
+  "sema_id": "sema:RegimeSense#mh:SHA-256:430bf5a5fcfe1796a400eda12608fed3600ecb00ec50ef3f4c8934db5065a2a0",
+  "sema_ref": "RegimeSense#430b",
+  "sema_stub": "430b",
   "dependencies": {
     "references": {
       "agent": "sema:Agent#mh:SHA-256:67659e263616d53dded32875421792f42fadf3137c87fe09cf9f5b9c163f10cf",
@@ -54,7 +54,7 @@
       "drift_watch": "sema:DriftWatch#mh:SHA-256:49b6f6d68dbda93034116865bb93a7bd08eff23de49a2eef87af80a40fe4a9f5",
       "noise": "sema:Noise#mh:SHA-256:5573f7d20eb9f8db67767c9c6e1b58967793b20b1ad5ebe02688d8b77f549e5c",
       "ontology_adapt": "sema:OntologyAdapt#mh:SHA-256:1390c9f564ffb7480453ab134ed09247c75651e3512ea113371e29c1d3e95387",
-      "quorum": "sema:Quorum#mh:SHA-256:c6a5b21dbe9b2c1fa46e5e67505041c92048a0a687f5703efa45486b51c56957"
+      "quorum": "sema:Quorum#mh:SHA-256:d634d5cf0f165f708a5f39e54d8ad42716c11e21189459585468a294d2ebc7bc"
     }
   },
   "sema_layer": "Mind",
diff --git a/data/vocabulary/RequestFraming.json b/data/vocabulary/RequestFraming.json
index d5e6f0f6..46087741 100644
--- a/data/vocabulary/RequestFraming.json
+++ b/data/vocabulary/RequestFraming.json
@@ -38,9 +38,9 @@
       "Reasoning"
     ]
   },
-  "sema_id": "sema:RequestFraming#mh:SHA-256:8c6cf10e82ea7b80e3902d6947dca62be9ae0d7494787c6c4ca84113653e26e6",
-  "sema_ref": "RequestFraming#8c6c",
-  "sema_stub": "8c6c",
+  "sema_id": "sema:RequestFraming#mh:SHA-256:e9739d11444b84d2d5cf63a9a878db9b17ba68598a2ee2bd5c4e85a0e9fdb76c",
+  "sema_ref": "RequestFraming#e973",
+  "sema_stub": "e973",
   "dependencies": {
     "accepts": {
       "message": "sema:Message#mh:SHA-256:b17515adef760297f0374e7cfcf4a7b3cc4f5f2c21ab0c0295285545c60482ea"
@@ -51,7 +51,7 @@
     },
     "references": {
       "context": "sema:Context#mh:SHA-256:d5f79a21faef9ef640ab687c90a25cdf457a066fb6da23d247115b267c539132",
-      "context_first": "sema:ContextFirst#mh:SHA-256:a0b6432a809a0c73841202d1802a83018f3db9d5938893415218a383ce151d6a",
+      "context_first": "sema:ContextFirst#mh:SHA-256:75505829fde04a5838eecbcc83757f2e96bdd064f0aab6eabeccc6e69ce2725a",
       "interpret": "sema:Interpret#mh:SHA-256:ff6daf0b5967deb7da11c1a2ea74ce7e6ab9baf6362a53045bff656b0c5671dc"
     },
     "yields": {
diff --git a/data/vocabulary/Responsibility.json b/data/vocabulary/Responsibility.json
index 4e96b2e3..4c4a50d5 100644
--- a/data/vocabulary/Responsibility.json
+++ b/data/vocabulary/Responsibility.json
@@ -40,13 +40,13 @@
       "Governance"
     ]
   },
-  "sema_id": "sema:Responsibility#mh:SHA-256:8cf5bbf5ca36a65aad611647fd512c76522e56f2342b87a110784ba166662972",
-  "sema_ref": "Responsibility#8cf5",
-  "sema_stub": "8cf5",
+  "sema_id": "sema:Responsibility#mh:SHA-256:67f5917d4f6fbc362e1aa3af89fd6cdff8e2ad3e983075b92693ad0c25adb87f",
+  "sema_ref": "Responsibility#67f5",
+  "sema_stub": "67f5",
   "dependencies": {
     "references": {
       "agent": "sema:Agent#mh:SHA-256:67659e263616d53dded32875421792f42fadf3137c87fe09cf9f5b9c163f10cf",
-      "heartbeat": "sema:Heartbeat#mh:SHA-256:c36fe65a4b171559a33cb36f37ec448dce8ad7092c665426bfabee3dbeb6d1c1",
+      "heartbeat": "sema:Heartbeat#mh:SHA-256:d0e6ffd899704efd75b87f0365bbe48fec4a1179b81e08923779ed84be7c83c2",
       "oath_bind": "sema:OathBind#mh:SHA-256:e5ab61d18a73e5037f5a412f2d99de3e870ee0b28195c6154741a9e620926b0e",
       "state": "sema:State#mh:SHA-256:4f25e6a16ccd37dc0bc154cccc7055cb504d49daa8b712f372a425eb6c7b8cb2",
       "system": "sema:System#mh:SHA-256:f8eb318a1113a10fead02fbf14ae433767ac1a69c9579cdb584cc622068e90b3",
diff --git a/data/vocabulary/RetrievalAugment.json b/data/vocabulary/RetrievalAugment.json
index 781e133e..51039ff7 100644
--- a/data/vocabulary/RetrievalAugment.json
+++ b/data/vocabulary/RetrievalAugment.json
@@ -25,15 +25,15 @@
       "Memory"
     ]
   },
-  "sema_id": "sema:RetrievalAugment#mh:SHA-256:7ca744ce28611156f415add4da95e3dc93006d92061a05139e17b70d3882e848",
-  "sema_ref": "RetrievalAugment#7ca7",
-  "sema_stub": "7ca7",
+  "sema_id": "sema:RetrievalAugment#mh:SHA-256:046a23973b254ab3ca9ee8d892c6a2a43f0ccba6145197d0f1fe3b92f1feec63",
+  "sema_ref": "RetrievalAugment#046a",
+  "sema_stub": "046a",
   "dependencies": {
     "references": {
       "agent": "sema:Agent#mh:SHA-256:67659e263616d53dded32875421792f42fadf3137c87fe09cf9f5b9c163f10cf",
       "chain_of_thought": "sema:ChainOfThought#mh:SHA-256:c425d5121316279e8b39aa00c72c90413811d17b31b6af23706292a0867e8f06",
       "context": "sema:Context#mh:SHA-256:d5f79a21faef9ef640ab687c90a25cdf457a066fb6da23d247115b267c539132",
-      "context_first": "sema:ContextFirst#mh:SHA-256:a0b6432a809a0c73841202d1802a83018f3db9d5938893415218a383ce151d6a",
+      "context_first": "sema:ContextFirst#mh:SHA-256:75505829fde04a5838eecbcc83757f2e96bdd064f0aab6eabeccc6e69ce2725a",
       "latent_attachment": "sema:LatentAttachment#mh:SHA-256:611a3563ef0da0825b34325dec6aef6ae050620c68436dacbb126bc98f97d4e6",
       "prompt": "sema:Prompt#mh:SHA-256:6595e7cad34f36df1e5a1022726d6966db84887f11e1ed00270a281f293c8f97"
     }
diff --git a/data/vocabulary/Retry.json b/data/vocabulary/Retry.json
index 08596f76..fd6587e9 100644
--- a/data/vocabulary/Retry.json
+++ b/data/vocabulary/Retry.json
@@ -1,6 +1,6 @@
 {
   "handle": "Retry",
-  "mechanism": "Intelligent re-attempt of failed coordination with failure-informed strategy. After BREAK + COMPENSATE, agent evaluates: (1) CLASSIFY failure\u2014transient (timeout, rate-limit, network blip) vs persistent (capability gap, protocol mismatch, explicit rejection). (2) CHECK retry_hint from BREAK (partner may say 'don't retry' or 'wait 30s'). (3) CONSULT failure_history\u2014same error repeating? {{circuit_breaker}} threshold reached? (4) COMPUTE backoff\u2014adaptive based on failure type: transient uses exponential+jitter, persistent uses longer fixed delay or triggers abort. (5) VERIFY changed_conditions\u2014has something changed that makes retry worthwhile? (6) EXECUTE retry if within budget and conditions favor success, else ABORT with retry_exhausted status. Retry CARRIES FORWARD: failure context, partner state observations, environmental data. Retry RESETS: coordination state (fresh start, don't resume mid-stream). It handles transient failures by re-queuing the task, distinguishing them from terminal failures that trigger {{break}} and {{compensate}}.",
+  "mechanism": "Intelligent re-attempt of failed coordination with failure-informed strategy. After BREAK + COMPENSATE, agent evaluates: (1) CLASSIFY failure\u2014transient (timeout, rate-limit, network blip) vs persistent (capability gap, protocol mismatch, explicit rejection). (2) CHECK retry_hint from BREAK (partner may say 'don't retry' or 'wait 30s'). (3) CONSULT failure_history\u2014same error repeating? {{circuit_breaker}} threshold reached? (4) COMPUTE {{backoff}}\u2014adaptive based on failure type: transient uses {{exponential_backoff}}, persistent uses longer fixed delay or triggers abort. (5) VERIFY changed_conditions\u2014has something changed that makes retry worthwhile? (6) EXECUTE retry if within budget and conditions favor success, else ABORT with retry_exhausted status. Retry CARRIES FORWARD: failure context, partner state observations, environmental data. Retry RESETS: coordination state (fresh start, don't resume mid-stream). It handles transient failures by re-queuing the task, distinguishing them from terminal failures that trigger {{break}} and {{compensate}}.",
   "gloss": "Classified re-attempt with backoff conditioned on failure type",
   "failure_modes": [
     "Misclassifying persistent failure as transient (wastes retry budget).",
@@ -24,27 +24,31 @@
   "_meta": {
     "tier": 1,
     "related": [
-      "sema:Backoff#mh:SHA-256:14b48b9a05b8b47aea8484dbd426cc39dcff0c2c293010415a233ce23fccab9c"
+      "sema:Backoff#mh:SHA-256:9e59718422f5408d7892feccb6d538a21103f9573b122b891ee3c8cf66303e72"
     ],
     "ring": 1,
     "supersedes": [
       "sema:Retry#mh:SHA-256:d53d7b3af592e07dfb4d8f4cb3d74472da4514f0954d2138f2148e81bd55882a",
-      "sema:Retry#mh:SHA-256:07b7eedd84065dbf822183e0ae1512edb92caa0867bf7c9225b85371721d0091"
+      "sema:Retry#mh:SHA-256:07b7eedd84065dbf822183e0ae1512edb92caa0867bf7c9225b85371721d0091",
+      "sema:Retry#mh:SHA-256:79b69773b2fdd6fc81b1205d1088e9df841db683a982e079fc2dca97f4818804"
     ],
     "path": [
       "Mind",
       "Strategy"
     ]
   },
-  "sema_id": "sema:Retry#mh:SHA-256:79b69773b2fdd6fc81b1205d1088e9df841db683a982e079fc2dca97f4818804",
-  "sema_ref": "Retry#79b6",
-  "sema_stub": "79b6",
+  "sema_id": "sema:Retry#mh:SHA-256:9e178c29dd1aa774432d8eb6e87fb2e93ab5b1a6db9582f737ad60e9ddf56053",
+  "sema_ref": "Retry#9e17",
+  "sema_stub": "9e17",
   "dependencies": {
+    "composes_with": {
+      "exponential_backoff": "sema:ExponentialBackoff#mh:SHA-256:a543a38722a0dfe96cf4bc7ccdaa615195ac058b5029651dc26d5cce1cd43128"
+    },
     "references": {
-      "backoff": "sema:Backoff#mh:SHA-256:16c2d636281df44ed78ef3bce341e7a349fd37cbd675706e2e395172c1dccae6",
+      "backoff": "sema:Backoff#mh:SHA-256:9e59718422f5408d7892feccb6d538a21103f9573b122b891ee3c8cf66303e72",
       "break": "sema:Break#mh:SHA-256:3c370fec3d297e00ea2321826e420a429f65fc5f5da5ac61b844c821aef41018",
-      "circuit_breaker": "sema:CircuitBreaker#mh:SHA-256:840fee4c2a300c1e17bd44e55debdf58d250ab62f79760f59c0189ca7d485824",
-      "compensate": "sema:Compensate#mh:SHA-256:9b3b07b7a02d00b6df1ecc3ee69fa3dcd2b33e07f045c67f26deb6cf311694f2"
+      "circuit_breaker": "sema:CircuitBreaker#mh:SHA-256:3caa9c387c04bb2ac66ec35a6cfe2665e11339f0d47576b96d68229226580c76",
+      "compensate": "sema:Compensate#mh:SHA-256:e23bc7c0d3825460855e7ee5e2e41f512ff8e318ad741b1ba4e0303cb66e39b9"
     }
   },
   "sema_layer": "Mind",
diff --git a/data/vocabulary/RigorousSolver.json b/data/vocabulary/RigorousSolver.json
index 9a7ba5b7..970bc782 100644
--- a/data/vocabulary/RigorousSolver.json
+++ b/data/vocabulary/RigorousSolver.json
@@ -19,16 +19,16 @@
       "Strategy"
     ]
   },
-  "sema_id": "sema:RigorousSolver#mh:SHA-256:b75d4b063fc8f90f4a1361ef08c8dac02fbf147f0c8f122ca390fdbde74d39cd",
-  "sema_ref": "RigorousSolver#b75d",
-  "sema_stub": "b75d",
+  "sema_id": "sema:RigorousSolver#mh:SHA-256:70d41b35ddab10c9575b6feed8022935cb266f3d81fce659cfb6b8b9c2d4dc94",
+  "sema_ref": "RigorousSolver#70d4",
+  "sema_stub": "70d4",
   "dependencies": {
     "composes_with": {
       "feedback": "sema:Feedback#mh:SHA-256:5e6d456e19d4b57377c23d33584271b255557c076b2611c23d23afd1e542eb37",
       "probe": "sema:Probe#mh:SHA-256:5392242c37d0e87c203a1cfdfd6a4f15e2e8eed3bd8c7a22db63e07ce48939d8"
     },
     "references": {
-      "polymorphic_solver": "sema:PolymorphicSolver#mh:SHA-256:272ac4237fd71c0782676ed30558bad9c08fca9373577516284bf5def22b2800",
+      "polymorphic_solver": "sema:PolymorphicSolver#mh:SHA-256:3653f233738b26efaa02e0750c25ee0e743a32e0bce28afafde84b74f42b87f7",
       "socratic_loop": "sema:SocraticLoop#mh:SHA-256:7d528905a96b5774a2e16f7cb7b9fa50845c3bdb03549a2322889d7560d17f8e"
     }
   },
diff --git a/data/vocabulary/Role.json b/data/vocabulary/Role.json
index d7f91217..d7b9fc18 100644
--- a/data/vocabulary/Role.json
+++ b/data/vocabulary/Role.json
@@ -42,15 +42,15 @@
       "Governance"
     ]
   },
-  "sema_ref": "Role#3152",
-  "sema_id": "sema:Role#mh:SHA-256:315289020c8b40e92e7e84298036fa6417d6f779f6980a7a48d2ba68c62d6fad",
-  "sema_stub": "3152",
+  "sema_ref": "Role#9b2c",
+  "sema_id": "sema:Role#mh:SHA-256:9b2c6ae96c7b02fae8fcc5c665a789974874e8818f2641c7bc55096d28a9dff6",
+  "sema_stub": "9b2c",
   "dependencies": {
     "references": {
       "agent": "sema:Agent#mh:SHA-256:67659e263616d53dded32875421792f42fadf3137c87fe09cf9f5b9c163f10cf",
       "identity": "sema:Identity#mh:SHA-256:bfe236a2c243ed664189c99afcb9f16225b6d56cbb11e6e29522756b33c47427",
       "permission": "sema:Permission#mh:SHA-256:f3470b4ff692d65cb74a12a52b69caffdf008e55e1ef0062a9927c6b72877005",
-      "responsibility": "sema:Responsibility#mh:SHA-256:8cf5bbf5ca36a65aad611647fd512c76522e56f2342b87a110784ba166662972"
+      "responsibility": "sema:Responsibility#mh:SHA-256:67f5917d4f6fbc362e1aa3af89fd6cdff8e2ad3e983075b92693ad0c25adb87f"
     }
   },
   "sema_layer": "Society",
diff --git a/data/vocabulary/Rollout.json b/data/vocabulary/Rollout.json
index 22b17f99..6d605829 100644
--- a/data/vocabulary/Rollout.json
+++ b/data/vocabulary/Rollout.json
@@ -34,9 +34,9 @@
       "Protocols"
     ]
   },
-  "sema_id": "sema:Rollout#mh:SHA-256:8fc16ddf8f7add799ac8b49f7894f508be0b8378f995e57540cab8ec028eb996",
-  "sema_ref": "Rollout#8fc1",
-  "sema_stub": "8fc1",
+  "sema_id": "sema:Rollout#mh:SHA-256:84e234d9616bde2b394074e3d082e85c7ee74068d65f2aa8642a5e3a64f97c26",
+  "sema_ref": "Rollout#84e2",
+  "sema_stub": "84e2",
   "signature": [
     "Act(ExecutionManifest)"
   ],
@@ -46,9 +46,9 @@
     },
     "composes_with": {
       "canary": "sema:Canary#mh:SHA-256:bda6d48ae1b1895bb1ce0fe6012c6fed5baaff392755f2ed802b400481522b5f",
-      "circuit_breaker": "sema:CircuitBreaker#mh:SHA-256:840fee4c2a300c1e17bd44e55debdf58d250ab62f79760f59c0189ca7d485824",
-      "compensate": "sema:Compensate#mh:SHA-256:9b3b07b7a02d00b6df1ecc3ee69fa3dcd2b33e07f045c67f26deb6cf311694f2",
-      "ejection_seat": "sema:EjectionSeat#mh:SHA-256:a164bf13e2782b724df3bfd0f3a53c11933d0881a4c1ff0cbef9fd738a871ba4"
+      "circuit_breaker": "sema:CircuitBreaker#mh:SHA-256:3caa9c387c04bb2ac66ec35a6cfe2665e11339f0d47576b96d68229226580c76",
+      "compensate": "sema:Compensate#mh:SHA-256:e23bc7c0d3825460855e7ee5e2e41f512ff8e318ad741b1ba4e0303cb66e39b9",
+      "ejection_seat": "sema:EjectionSeat#mh:SHA-256:e8361ca7c2ffb506b32cd36f16addc253ecbc51350f98b983db9c122bb51f106"
     },
     "references": {
       "act": "sema:Act#mh:SHA-256:7616721cda9e81613f7c97d4ac93ba49291f97d7c7fe6fd7c49588c33d4d3b3d",
diff --git a/data/vocabulary/RootSolver.json b/data/vocabulary/RootSolver.json
index 5cbc5df7..cd358062 100644
--- a/data/vocabulary/RootSolver.json
+++ b/data/vocabulary/RootSolver.json
@@ -58,9 +58,9 @@
       }
     }
   },
-  "sema_id": "sema:RootSolver#mh:SHA-256:6d0d34bacbf2d51f0c8152acde51d1bcc1c3f2e93127d4e03ea037a87183980b",
-  "sema_ref": "RootSolver#6d0d",
-  "sema_stub": "6d0d",
+  "sema_id": "sema:RootSolver#mh:SHA-256:750d3992db274fa89e6bad275ad10c0fc6ea9969cc9e4ff9cd809c77f96a4d32",
+  "sema_ref": "RootSolver#750d",
+  "sema_stub": "750d",
   "dependencies": {
     "composes_with": {
       "pathway_memory": "sema:PathwayMemory#mh:SHA-256:b6a0e82ce9362d546f5ac2da3610ced5e67a516f67fa0756aa90051a74180b82"
@@ -71,7 +71,7 @@
       "problem_space": "sema:ProblemSpace#mh:SHA-256:3d6d30545da39dcf29a6b27145e2d2ebc46159d4c783489ff8eeaf0d5d48f2b1",
       "result": "sema:Result#mh:SHA-256:255a9798867e3718968ae4ecaf7c48b0a773d87ce4a45ca1d86b10a3238c9c7d",
       "solution": "sema:Solution#mh:SHA-256:48442c3e14ce25ef325cbff085d095ecf4c7735b006f162eb76e23d4315f8fa2",
-      "solver_node": "sema:SolverNode#mh:SHA-256:fd50fc5063ba52d2670169e4a8388e475cdc69084de648606236716f9ccc13b4",
+      "solver_node": "sema:SolverNode#mh:SHA-256:45292efbd4e607174b8e0b82535d8bede20eb408a9d341b86742e1db2982ea1a",
       "task": "sema:Task#mh:SHA-256:f239278f610adea7e01a9fd019dc6be158a31919d61d301856dcbe2aa8b67804",
       "tree": "sema:Tree#mh:SHA-256:a8c4c04005dec32b56be8ea4a31f369e821d3c87f2705d1dae5d58ed53760543"
     }
diff --git a/data/vocabulary/Solver.json b/data/vocabulary/Solver.json
index b071e5fd..3e71c321 100644
--- a/data/vocabulary/Solver.json
+++ b/data/vocabulary/Solver.json
@@ -16,16 +16,16 @@
       "Strategy"
     ]
   },
-  "sema_id": "sema:Solver#mh:SHA-256:04b58c815005971905e3d430112a06fb76b727882204a80fe58ace79b066a1d6",
-  "sema_ref": "Solver#04b5",
-  "sema_stub": "04b5",
+  "sema_id": "sema:Solver#mh:SHA-256:b7f9e18fec50d288ea829a21a59de02f65cf1ffe3eef07142389d659bd421d02",
+  "sema_ref": "Solver#b7f9",
+  "sema_stub": "b7f9",
   "dependencies": {
     "accepts": {
       "task": "sema:Task#mh:SHA-256:f239278f610adea7e01a9fd019dc6be158a31919d61d301856dcbe2aa8b67804"
     },
     "references": {
       "agent": "sema:Agent#mh:SHA-256:67659e263616d53dded32875421792f42fadf3137c87fe09cf9f5b9c163f10cf",
-      "performance_signal": "sema:PerformanceSignal#mh:SHA-256:7dea9b2784b3fa72856ba2b90eedc79ceb7c0b499b1c2a2bfdac205a5dbc27bf",
+      "performance_signal": "sema:PerformanceSignal#mh:SHA-256:10af65000a53f88e121ac8edbc6b6d3a105a5a86a5b1b370cd227e2062a4dcd3",
       "protocol": "sema:Protocol#mh:SHA-256:e53765fe6abfb95285f1b698b11cc01ab3f7e1d8f82f57186f60127d92c564db"
     },
     "yields": {
diff --git a/data/vocabulary/SolverManifest.json b/data/vocabulary/SolverManifest.json
index 3af22686..d25f2658 100644
--- a/data/vocabulary/SolverManifest.json
+++ b/data/vocabulary/SolverManifest.json
@@ -25,9 +25,9 @@
       "Data Structures"
     ]
   },
-  "sema_id": "sema:SolverManifest#mh:SHA-256:47d424b51aac06ae90c6ab67ecd415876cf3feef3e2a18897fa8cc94b75399ff",
-  "sema_ref": "SolverManifest#47d4",
-  "sema_stub": "47d4",
+  "sema_id": "sema:SolverManifest#mh:SHA-256:47aef05958dec89d4a0ccb6d8965d2bbd812dd8a3c10ef265f3150cfebee0384",
+  "sema_ref": "SolverManifest#47ae",
+  "sema_stub": "47ae",
   "data_schema": {
     "type": "object",
     "description": "Typed solver identity + capabilities.",
@@ -62,7 +62,7 @@
   "dependencies": {
     "references": {
       "constraint": "sema:Constraint#mh:SHA-256:70136d525260a10eedf156aad1fe6c50510eadb10a89d063c7a85575b15708fc",
-      "solver": "sema:Solver#mh:SHA-256:04b58c815005971905e3d430112a06fb76b727882204a80fe58ace79b066a1d6"
+      "solver": "sema:Solver#mh:SHA-256:b7f9e18fec50d288ea829a21a59de02f65cf1ffe3eef07142389d659bd421d02"
     }
   },
   "sema_layer": "Infrastructure",
diff --git a/data/vocabulary/SolverNode.json b/data/vocabulary/SolverNode.json
index a2a5cbca..c5210d42 100644
--- a/data/vocabulary/SolverNode.json
+++ b/data/vocabulary/SolverNode.json
@@ -53,17 +53,17 @@
       }
     }
   },
-  "sema_ref": "SolverNode#fd50",
-  "sema_id": "sema:SolverNode#mh:SHA-256:fd50fc5063ba52d2670169e4a8388e475cdc69084de648606236716f9ccc13b4",
-  "sema_stub": "fd50",
+  "sema_ref": "SolverNode#4529",
+  "sema_id": "sema:SolverNode#mh:SHA-256:45292efbd4e607174b8e0b82535d8bede20eb408a9d341b86742e1db2982ea1a",
+  "sema_stub": "4529",
   "dependencies": {
     "references": {
       "budget": "sema:Budget#mh:SHA-256:f2f58874eaeb0600039600ba5b26064164c225fd44482b269ae94e37a9df15b4",
-      "localized_learning": "sema:LocalizedLearning#mh:SHA-256:1eec33d8fc081000b2c5927b7cfc2d4e6a8835fc9e0d46e051bb7ee34541cbdf",
+      "localized_learning": "sema:LocalizedLearning#mh:SHA-256:14502d62b7a331dbcb80bfdf6ab07f911cfb94b80788933e83119d787ec4fe37",
       "problem_space": "sema:ProblemSpace#mh:SHA-256:3d6d30545da39dcf29a6b27145e2d2ebc46159d4c783489ff8eeaf0d5d48f2b1",
-      "responsibility": "sema:Responsibility#mh:SHA-256:8cf5bbf5ca36a65aad611647fd512c76522e56f2342b87a110784ba166662972",
+      "responsibility": "sema:Responsibility#mh:SHA-256:67f5917d4f6fbc362e1aa3af89fd6cdff8e2ad3e983075b92693ad0c25adb87f",
       "solution": "sema:Solution#mh:SHA-256:48442c3e14ce25ef325cbff085d095ecf4c7735b006f162eb76e23d4315f8fa2",
-      "solver_manifest": "sema:SolverManifest#mh:SHA-256:47d424b51aac06ae90c6ab67ecd415876cf3feef3e2a18897fa8cc94b75399ff"
+      "solver_manifest": "sema:SolverManifest#mh:SHA-256:47aef05958dec89d4a0ccb6d8965d2bbd812dd8a3c10ef265f3150cfebee0384"
     }
   },
   "sema_layer": "Society",
diff --git a/data/vocabulary/SolverTree.json b/data/vocabulary/SolverTree.json
index c51e73f3..ecb15d20 100644
--- a/data/vocabulary/SolverTree.json
+++ b/data/vocabulary/SolverTree.json
@@ -56,18 +56,18 @@
       }
     }
   },
-  "sema_ref": "SolverTree#2e4c",
-  "sema_id": "sema:SolverTree#mh:SHA-256:2e4c0e7dce54bfdddd61b9ec1a19715036eb916f979695719b7b8987dce72057",
-  "sema_stub": "2e4c",
+  "sema_ref": "SolverTree#0c3f",
+  "sema_id": "sema:SolverTree#mh:SHA-256:0c3f163ca8ac5f88d9548387e9b22338281d90d5404ea4281aebbe94d4b713ce",
+  "sema_stub": "0c3f",
   "dependencies": {
     "accepts": {
       "task": "sema:Task#mh:SHA-256:f239278f610adea7e01a9fd019dc6be158a31919d61d301856dcbe2aa8b67804"
     },
     "references": {
       "budget": "sema:Budget#mh:SHA-256:f2f58874eaeb0600039600ba5b26064164c225fd44482b269ae94e37a9df15b4",
-      "localized_learning": "sema:LocalizedLearning#mh:SHA-256:1eec33d8fc081000b2c5927b7cfc2d4e6a8835fc9e0d46e051bb7ee34541cbdf",
-      "root_solver": "sema:RootSolver#mh:SHA-256:6d0d34bacbf2d51f0c8152acde51d1bcc1c3f2e93127d4e03ea037a87183980b",
-      "solver_node": "sema:SolverNode#mh:SHA-256:fd50fc5063ba52d2670169e4a8388e475cdc69084de648606236716f9ccc13b4",
+      "localized_learning": "sema:LocalizedLearning#mh:SHA-256:14502d62b7a331dbcb80bfdf6ab07f911cfb94b80788933e83119d787ec4fe37",
+      "root_solver": "sema:RootSolver#mh:SHA-256:750d3992db274fa89e6bad275ad10c0fc6ea9969cc9e4ff9cd809c77f96a4d32",
+      "solver_node": "sema:SolverNode#mh:SHA-256:45292efbd4e607174b8e0b82535d8bede20eb408a9d341b86742e1db2982ea1a",
       "topology": "sema:Topology#mh:SHA-256:7562ae8b1220306a7f04988216cfd33026bc6f04d8a2b3fc51f3a2b6153d5e4c",
       "tree": "sema:Tree#mh:SHA-256:a8c4c04005dec32b56be8ea4a31f369e821d3c87f2705d1dae5d58ed53760543"
     }
diff --git a/data/vocabulary/SourceEvaluate.json b/data/vocabulary/SourceEvaluate.json
index fe2c7605..e79ece9c 100644
--- a/data/vocabulary/SourceEvaluate.json
+++ b/data/vocabulary/SourceEvaluate.json
@@ -19,16 +19,16 @@
       "Inference"
     ]
   },
-  "sema_id": "sema:SourceEvaluate#mh:SHA-256:1f872d60b4c820afb0647a6a756dd53a2e9c44e65f69864456e968aff5860dd4",
-  "sema_ref": "SourceEvaluate#1f87",
-  "sema_stub": "1f87",
+  "sema_id": "sema:SourceEvaluate#mh:SHA-256:f6b838b5472497f911d3684d4ecfd77a999963ccc056036f1d22a7d36cd3f7aa",
+  "sema_ref": "SourceEvaluate#f6b8",
+  "sema_stub": "f6b8",
   "signature": [
     "Judge(Agent)"
   ],
   "dependencies": {
     "references": {
       "agent": "sema:Agent#mh:SHA-256:67659e263616d53dded32875421792f42fadf3137c87fe09cf9f5b9c163f10cf",
-      "cite_back": "sema:CiteBack#mh:SHA-256:77855c554890913b6c7c61f5a947a502b47171f04f333ab4bcfc72e136bfd30b",
+      "cite_back": "sema:CiteBack#mh:SHA-256:17b1ece87db4152c4a241754f84c4722fe9dde9fa8c00c1e122e4e6139196b86",
       "judge": "sema:Judge#mh:SHA-256:24016b1994d525fa1ff75ec9066fc2044284a90a1fe1b6336898bc79237e7f90"
     }
   },
diff --git a/data/vocabulary/StateLock.json b/data/vocabulary/StateLock.json
index b651d3da..af10b228 100644
--- a/data/vocabulary/StateLock.json
+++ b/data/vocabulary/StateLock.json
@@ -13,7 +13,8 @@
     "caution": "Exclusive state access \u2014 misuse enables denial of service via lock starvation.",
     "supersedes": [
       "sema:StateLock#mh:SHA-256:774b674f80993c49b0a348c384397f80027af319faa3440813d9d53b3eaa6a14",
-      "sema:StateLock#mh:SHA-256:b91b68adbca94d80103e153ae63a987cbd7fb3a29463a5c8e6d88132b85cfa9a"
+      "sema:StateLock#mh:SHA-256:b91b68adbca94d80103e153ae63a987cbd7fb3a29463a5c8e6d88132b85cfa9a",
+      "sema:StateLock#mh:SHA-256:7cd86a9de68522b752366ef04de32f743b57ef16232866522ccdafb1f35c6da9"
     ],
     "path": [
       "Society",
@@ -23,14 +24,16 @@
   "signature": [
     "Lock(State)"
   ],
-  "sema_ref": "StateLock#7cd8",
-  "sema_id": "sema:StateLock#mh:SHA-256:7cd86a9de68522b752366ef04de32f743b57ef16232866522ccdafb1f35c6da9",
-  "sema_stub": "7cd8",
+  "sema_ref": "StateLock#8bde",
+  "sema_id": "sema:StateLock#mh:SHA-256:8bde7c49752578e5c76e46d33b995497728f486d69d99ff618b9dbeaa7586c78",
+  "sema_stub": "8bde",
   "dependencies": {
+    "composes_with": {
+      "backoff": "sema:Backoff#mh:SHA-256:9e59718422f5408d7892feccb6d538a21103f9573b122b891ee3c8cf66303e72",
+      "cooldown": "sema:Cooldown#mh:SHA-256:6f56ea214e52eab81c0592d4b17ed3da9dc6cbcf3a496a512088c9bc63006f3b"
+    },
     "references": {
       "actor": "sema:Actor#mh:SHA-256:1ecd855bdf9fc33f99840af8b53729d917355fb151d36ff21947885fac5c5907",
-      "backoff": "sema:Backoff#mh:SHA-256:16c2d636281df44ed78ef3bce341e7a349fd37cbd675706e2e395172c1dccae6",
-      "cooldown": "sema:Cooldown#mh:SHA-256:878c03997b0670f8f217d6f26b6d2a583d15bf11e702346b4e317827dc7cb687",
       "lock": "sema:Lock#mh:SHA-256:95c2ee952a5301d4b346a5e8693350829d88b3c600048eedcf87bb00c23ee5fb",
       "state": "sema:State#mh:SHA-256:4f25e6a16ccd37dc0bc154cccc7055cb504d49daa8b712f372a425eb6c7b8cb2"
     }
diff --git a/data/vocabulary/StateSnapshot.json b/data/vocabulary/StateSnapshot.json
index 5f279e2f..eedfed71 100644
--- a/data/vocabulary/StateSnapshot.json
+++ b/data/vocabulary/StateSnapshot.json
@@ -28,12 +28,12 @@
   "signature": [
     "State(Snapshot)"
   ],
-  "sema_id": "sema:StateSnapshot#mh:SHA-256:53b2f1c57a571f308d8ce1686edf0fbbbc178bf35d96b2a445bcebeda01208aa",
-  "sema_ref": "StateSnapshot#53b2",
-  "sema_stub": "53b2",
+  "sema_id": "sema:StateSnapshot#mh:SHA-256:5791e43fad7e1f42cb7451eec53c6bfa9fef567b30a14d05be269116203e5848",
+  "sema_ref": "StateSnapshot#5791",
+  "sema_stub": "5791",
   "dependencies": {
     "references": {
-      "idempotent_write": "sema:IdempotentWrite#mh:SHA-256:ebf5e8d3d5a4802033179f871bf4dfd0be7c611ab7534ab8b8e07e5f21eab7d0",
+      "idempotent_write": "sema:IdempotentWrite#mh:SHA-256:e919903ac4044c9761bbdae612c360150f12e679dcc608ee7389f793debda186",
       "snapshot": "sema:Snapshot#mh:SHA-256:390d2ec2934136d534f969b4039e6b899d2ed3956ddd8aa0ca4754068ed8d133",
       "state": "sema:State#mh:SHA-256:4f25e6a16ccd37dc0bc154cccc7055cb504d49daa8b712f372a425eb6c7b8cb2",
       "trace": "sema:Trace#mh:SHA-256:314d8d38e6de13bf191dd0d368c8c1bcf7a2d4953b165f66daf7188b90dc37ab"
diff --git a/data/vocabulary/SurprisalUpdate.json b/data/vocabulary/SurprisalUpdate.json
index 88f033c9..52dc3b41 100644
--- a/data/vocabulary/SurprisalUpdate.json
+++ b/data/vocabulary/SurprisalUpdate.json
@@ -48,14 +48,14 @@
       "Inference"
     ]
   },
-  "sema_id": "sema:SurprisalUpdate#mh:SHA-256:6169da6dce9141595fc8b7ac8d8743e397cd44a2da04b3499b2ce910e174c2ef",
-  "sema_ref": "SurprisalUpdate#6169",
-  "sema_stub": "6169",
+  "sema_id": "sema:SurprisalUpdate#mh:SHA-256:41a9f896757eb4b0d7132604b60e0193eaba43329953359ef5e927f69112f8df",
+  "sema_ref": "SurprisalUpdate#41a9",
+  "sema_stub": "41a9",
   "dependencies": {
     "references": {
       "epistemic_roi": "sema:EpistemicROI#mh:SHA-256:d48670433cb6617e8e1914f9d062939bb852ef2b7188e17a1cbb1803b81dad1e",
       "gradient": "sema:Gradient#mh:SHA-256:dcf04816f4c8639244be889bb5030889bcd786600046a64a67b3ad59a679bb96",
-      "regime_sense": "sema:RegimeSense#mh:SHA-256:56eccdcf5c9e28545cb3ad569f86ec1bf3dec5e2eb4f9620f980da72b11937cf"
+      "regime_sense": "sema:RegimeSense#mh:SHA-256:430bf5a5fcfe1796a400eda12608fed3600ecb00ec50ef3f4c8934db5065a2a0"
     }
   },
   "sema_layer": "Mind",
diff --git a/data/vocabulary/SynergisticMode.json b/data/vocabulary/SynergisticMode.json
index 560a7ec4..4ed74b1a 100644
--- a/data/vocabulary/SynergisticMode.json
+++ b/data/vocabulary/SynergisticMode.json
@@ -50,14 +50,14 @@
       }
     }
   },
-  "sema_id": "sema:SynergisticMode#mh:SHA-256:02f9f7de69042f961cc0662098cb379cf03e3d384c05147e9fb986de301021b7",
-  "sema_ref": "SynergisticMode#02f9",
-  "sema_stub": "02f9",
+  "sema_id": "sema:SynergisticMode#mh:SHA-256:2463b5f3a7da2c5aa518c3e5e356bb04b0b72cb64a9e99b7f9984c8a44aeec97",
+  "sema_ref": "SynergisticMode#2463",
+  "sema_stub": "2463",
   "dependencies": {
     "references": {
       "accept_spec": "sema:AcceptSpec#mh:SHA-256:c1565bf022e5596a447f7c9d9687ac3cbf1e6960f871be16f386eec02b5df2c4",
       "agent": "sema:Agent#mh:SHA-256:67659e263616d53dded32875421792f42fadf3137c87fe09cf9f5b9c163f10cf",
-      "compose": "sema:Compose#mh:SHA-256:57a9ff741d662d36173ef6bf5c5ecf2db16972e5ee9b7bae9559ce1fa24775fa",
+      "compose": "sema:Compose#mh:SHA-256:4fa274d804d83c00006408b8f436aa8c3a6cd60f23c0b3c56ca0ba4a50ff3c23",
       "mode": "sema:Mode#mh:SHA-256:081fc72c357b65d52cc697735a860ca98ce2b0ac13892dd94699ef8b08a04a2b",
       "ontology_handshake": "sema:OntologyHandshake#mh:SHA-256:fc51f85504eb23c4c11a7cd502fbd97c2a0d9b145a22baeaa8f1cb776f138d6e",
       "signal": "sema:Signal#mh:SHA-256:2ac0768f06e77d96b5d0bf8204205f519a24d704d496ce59519c9e8ddd546ab2",
diff --git a/data/vocabulary/Taper.json b/data/vocabulary/Taper.json
index 1d9c6120..fb4394fe 100644
--- a/data/vocabulary/Taper.json
+++ b/data/vocabulary/Taper.json
@@ -42,9 +42,9 @@
       "Protocols"
     ]
   },
-  "sema_ref": "Taper#83db",
-  "sema_id": "sema:Taper#mh:SHA-256:83db268464c312c097ff6e9f579a6ae4c484097c3f4e601a4d88c8151fd9ccb0",
-  "sema_stub": "83db",
+  "sema_ref": "Taper#8dc5",
+  "sema_id": "sema:Taper#mh:SHA-256:8dc5f590659da3360002d22320c458eeaa775788b16700359f704838c9d16c2e",
+  "sema_stub": "8dc5",
   "dependencies": {
     "composes_with": {
       "gate": "sema:Gate#mh:SHA-256:bc636a863f99226e579fa58c6016053d5940510270fe7b4f3314a418408728e8",
@@ -53,7 +53,7 @@
     },
     "references": {
       "compress": "sema:Compress#mh:SHA-256:b50f42b2837d2df77577a11ff9b068f1d06ea32bcde75d0d2751351d62d82627",
-      "depth_governor": "sema:DepthGovernor#mh:SHA-256:96cf874e588e4260c67abf3b8cdca5a0234d9b6a637e1c7981b7f77025668c93"
+      "depth_governor": "sema:DepthGovernor#mh:SHA-256:a3e937d651c99333315d333034b3a3be136376bfc1a5139cc758f218640cfc87"
     }
   },
   "sema_layer": "Society",
diff --git a/data/vocabulary/TaskLifecycle.json b/data/vocabulary/TaskLifecycle.json
index 813cc0ff..1b0529cc 100644
--- a/data/vocabulary/TaskLifecycle.json
+++ b/data/vocabulary/TaskLifecycle.json
@@ -42,9 +42,9 @@
       "Primitives"
     ]
   },
-  "sema_ref": "TaskLifecycle#d935",
-  "sema_id": "sema:TaskLifecycle#mh:SHA-256:d935155779f500df5554666848f4360d5eba80b106a40b7a4580ce848f420d33",
-  "sema_stub": "d935",
+  "sema_ref": "TaskLifecycle#3a3e",
+  "sema_id": "sema:TaskLifecycle#mh:SHA-256:3a3ece262c27914b8ff68afdf259cff4f046bf495558a190a43e32d6ee7dd5b8",
+  "sema_stub": "3a3e",
   "dependencies": {
     "composes_with": {
       "state_transition": "sema:StateTransition#mh:SHA-256:fa0a59735c22f83a00a12fd79576ebf5cf8609c6cf6206b2b01a15958911c3d2"
@@ -52,8 +52,8 @@
     "references": {
       "agent": "sema:Agent#mh:SHA-256:67659e263616d53dded32875421792f42fadf3137c87fe09cf9f5b9c163f10cf",
       "event": "sema:Event#mh:SHA-256:035497ae50cbbc61e245e1116f6e9b4a6e3c73aa41252052e8dd74a4dde35b96",
-      "exception": "sema:Exception#mh:SHA-256:054ce28455dfd0a13bce0b5a23e048429a58a1b7e6c9082252bc3f815fe6be21",
-      "heartbeat": "sema:Heartbeat#mh:SHA-256:c36fe65a4b171559a33cb36f37ec448dce8ad7092c665426bfabee3dbeb6d1c1",
+      "exception": "sema:Exception#mh:SHA-256:39fb7ba646e5c1dc91699ae4b3dc0887f4ec476fe6bf29970b83aaaca025f686",
+      "heartbeat": "sema:Heartbeat#mh:SHA-256:d0e6ffd899704efd75b87f0365bbe48fec4a1179b81e08923779ed84be7c83c2",
       "risk": "sema:Risk#mh:SHA-256:329330b9f212869f983266b693b3b90a816506d6905501d682676af2dd281a30",
       "task": "sema:Task#mh:SHA-256:f239278f610adea7e01a9fd019dc6be158a31919d61d301856dcbe2aa8b67804"
     },
diff --git a/data/vocabulary/TemporalEnsembleForecasting.json b/data/vocabulary/TemporalEnsembleForecasting.json
index fb8edc8d..faa7595c 100644
--- a/data/vocabulary/TemporalEnsembleForecasting.json
+++ b/data/vocabulary/TemporalEnsembleForecasting.json
@@ -15,12 +15,12 @@
       "Inference"
     ]
   },
-  "sema_id": "sema:TemporalEnsembleForecasting#mh:SHA-256:3cb65a94fad3ad3374c1a9583371e20c5463bc9726a0bd174293723eae485c05",
-  "sema_ref": "TemporalEnsembleForecasting#3cb6",
-  "sema_stub": "3cb6",
+  "sema_id": "sema:TemporalEnsembleForecasting#mh:SHA-256:8b0ec1f4bad5cb4ba0e7ee1b6b7fa5d2425a1f3cea1fb7f7c53b98de0f81b7f5",
+  "sema_ref": "TemporalEnsembleForecasting#8b0e",
+  "sema_stub": "8b0e",
   "dependencies": {
     "composes_with": {
-      "conceptual_decomposition": "sema:ConceptualDecomposition#mh:SHA-256:3cf20e30a632b0a7ab64a7fb2984fe64b106ba7819af458fa5e260aa89853b1d"
+      "conceptual_decomposition": "sema:ConceptualDecomposition#mh:SHA-256:2cce877b501c3fe1fdf646e3c5ad3157b26502b7a6f7c943dfff389c055aa25a"
     }
   },
   "sema_layer": "Mind",
diff --git a/data/vocabulary/Tension.json b/data/vocabulary/Tension.json
index a289a920..cb9a89ca 100644
--- a/data/vocabulary/Tension.json
+++ b/data/vocabulary/Tension.json
@@ -17,9 +17,9 @@
       "Data Structures"
     ]
   },
-  "sema_id": "sema:Tension#mh:SHA-256:547a74e52a7d1be70c14efcd8565adc2fae6a2c98d9bb7915a9b9164d578cfee",
-  "sema_ref": "Tension#547a",
-  "sema_stub": "547a",
+  "sema_id": "sema:Tension#mh:SHA-256:5dceec4a426933ddcf7aaf66bb92b6f5a2a55b8590033a49145a8e23000c3ad5",
+  "sema_ref": "Tension#5dce",
+  "sema_stub": "5dce",
   "data_schema": {
     "type": "object",
     "required": [
@@ -58,7 +58,7 @@
   "dependencies": {
     "references": {
       "dialectic": "sema:Dialectic#mh:SHA-256:b5d0c3323ef5308f052db0f1393e1779e954248178a8365a2c3f754d149528e1",
-      "yield": "sema:Yield#mh:SHA-256:d80209c8d3d01dff308a1917000beb714a2fe3e454e21c56643c3c8b53cd6fcf"
+      "yield": "sema:Yield#mh:SHA-256:d665e9a8a91a9ec23f8b338f875b05f1f7fe7844b8f21361b06bdd065bd78a02"
     }
   },
   "sema_layer": "Infrastructure",
diff --git a/data/vocabulary/TensionHold.json b/data/vocabulary/TensionHold.json
index 3038e613..b2ef058e 100644
--- a/data/vocabulary/TensionHold.json
+++ b/data/vocabulary/TensionHold.json
@@ -39,9 +39,9 @@
       "Strategy"
     ]
   },
-  "sema_ref": "TensionHold#b084",
-  "sema_id": "sema:TensionHold#mh:SHA-256:b084d63bf87e2b0ed75f9e27f7a3271fd30707373faa297dbdbb778b497d032e",
-  "sema_stub": "b084",
+  "sema_ref": "TensionHold#326b",
+  "sema_id": "sema:TensionHold#mh:SHA-256:326ba75d2fff31c8efe9d52c2a34d72a38c11e932dbe9a8db344b5a76004caaa",
+  "sema_stub": "326b",
   "dependencies": {
     "references": {
       "agent": "sema:Agent#mh:SHA-256:67659e263616d53dded32875421792f42fadf3137c87fe09cf9f5b9c163f10cf",
@@ -49,7 +49,7 @@
       "synthesis": "sema:Synthesis#mh:SHA-256:46b9ca1ae3a7711fc932ec43d901d25ef27b7c60c8f64f6fef818eec2027f6ea"
     },
     "yields": {
-      "tension": "sema:Tension#mh:SHA-256:547a74e52a7d1be70c14efcd8565adc2fae6a2c98d9bb7915a9b9164d578cfee"
+      "tension": "sema:Tension#mh:SHA-256:5dceec4a426933ddcf7aaf66bb92b6f5a2a55b8590033a49145a8e23000c3ad5"
     }
   },
   "sema_layer": "Mind",
diff --git a/data/vocabulary/ThreeLevelCollision.json b/data/vocabulary/ThreeLevelCollision.json
index 426c6f33..27c56f20 100644
--- a/data/vocabulary/ThreeLevelCollision.json
+++ b/data/vocabulary/ThreeLevelCollision.json
@@ -30,12 +30,12 @@
       "Protocols"
     ]
   },
-  "sema_id": "sema:ThreeLevelCollision#mh:SHA-256:f9f90f76329b4b07ba1de142f14fcab8f9c5e7d901e9268a0fa03f86258a5459",
-  "sema_ref": "ThreeLevelCollision#f9f9",
-  "sema_stub": "f9f9",
+  "sema_id": "sema:ThreeLevelCollision#mh:SHA-256:92b1063ea9ba8b193942d71837f055a897ace9ec4391348f56e6b1e6e11cde93",
+  "sema_ref": "ThreeLevelCollision#92b1",
+  "sema_stub": "92b1",
   "dependencies": {
     "references": {
-      "fail_closed": "sema:FailClosed#mh:SHA-256:408814ddae0d3fa2b4022f997c1feab5eef743a155cdedeba75bc42d26e467ac",
+      "fail_closed": "sema:FailClosed#mh:SHA-256:eae70da02880916a695d85d3752a59e16201c9f81b8a9af238d31863b3b6b157",
       "identity": "sema:Identity#mh:SHA-256:bfe236a2c243ed664189c99afcb9f16225b6d56cbb11e6e29522756b33c47427"
     }
   },
diff --git a/data/vocabulary/Throttle.json b/data/vocabulary/Throttle.json
index 7446141e..940d296e 100644
--- a/data/vocabulary/Throttle.json
+++ b/data/vocabulary/Throttle.json
@@ -43,15 +43,15 @@
       "Primitives"
     ]
   },
-  "sema_id": "sema:Throttle#mh:SHA-256:dc1439d0fbf64ac81ebea3d7570e55d7b94802d028061470a2e5681bc3c1d5f6",
-  "sema_ref": "Throttle#dc14",
-  "sema_stub": "dc14",
+  "sema_id": "sema:Throttle#mh:SHA-256:24860a38fb19f46f0cd620ada5ec2abadef4377dc6c0459f14180e4ce7aed7c8",
+  "sema_ref": "Throttle#2486",
+  "sema_stub": "2486",
   "dependencies": {
     "accepts": {
       "task": "sema:Task#mh:SHA-256:f239278f610adea7e01a9fd019dc6be158a31919d61d301856dcbe2aa8b67804"
     },
     "composes_with": {
-      "backoff": "sema:Backoff#mh:SHA-256:16c2d636281df44ed78ef3bce341e7a349fd37cbd675706e2e395172c1dccae6"
+      "backoff": "sema:Backoff#mh:SHA-256:9e59718422f5408d7892feccb6d538a21103f9573b122b891ee3c8cf66303e72"
     }
   },
   "sema_layer": "Infrastructure",
diff --git a/data/vocabulary/TimeWarpLog.json b/data/vocabulary/TimeWarpLog.json
index 7c32a2b1..6e336cd9 100644
--- a/data/vocabulary/TimeWarpLog.json
+++ b/data/vocabulary/TimeWarpLog.json
@@ -49,14 +49,14 @@
       "Primitives"
     ]
   },
-  "sema_id": "sema:TimeWarpLog#mh:SHA-256:e26edd5011e4842730b23fb11a2d5efaff9a52112e8081f5856893c9c4ce99ff",
-  "sema_ref": "TimeWarpLog#e26e",
-  "sema_stub": "e26e",
+  "sema_id": "sema:TimeWarpLog#mh:SHA-256:2a101afbc167bce00efa25a0439774ab1b30ef094facfaf2b8f9a5edb1b54269",
+  "sema_ref": "TimeWarpLog#2a10",
+  "sema_stub": "2a10",
   "dependencies": {
     "references": {
       "agent": "sema:Agent#mh:SHA-256:67659e263616d53dded32875421792f42fadf3137c87fe09cf9f5b9c163f10cf",
-      "causal_barrier": "sema:CausalBarrier#mh:SHA-256:39b3168c5b9bad18505b7af584fbb24b80ba7c5bf90e6ff0611fc2cd405f0178",
-      "monotonic_counter": "sema:MonotonicCounter#mh:SHA-256:21c63e6bc594106fb6bd773e2d91a2ecb0aebb43e550d55cfbe901e6a38628a3",
+      "causal_barrier": "sema:CausalBarrier#mh:SHA-256:9e178f07d754eefadad17a92a84f76badce58bd00571dca64b37e83176a57e94",
+      "monotonic_counter": "sema:MonotonicCounter#mh:SHA-256:33824eaaf148d996cbc3ccd7521b62dbba087070d23b5421918a446df3f01c8b",
       "state": "sema:State#mh:SHA-256:4f25e6a16ccd37dc0bc154cccc7055cb504d49daa8b712f372a425eb6c7b8cb2",
       "system": "sema:System#mh:SHA-256:f8eb318a1113a10fead02fbf14ae433767ac1a69c9579cdb584cc622068e90b3",
       "world_reversible": "sema:WorldReversible#mh:SHA-256:a8e0699d7dcce24a267c2e8db351fbe4edc60323c458931e1071858c0c6c1acb"
diff --git a/data/vocabulary/ToolDiscovery.json b/data/vocabulary/ToolDiscovery.json
index 96f77980..dad7f6c0 100644
--- a/data/vocabulary/ToolDiscovery.json
+++ b/data/vocabulary/ToolDiscovery.json
@@ -38,19 +38,19 @@
       "Protocols"
     ]
   },
-  "sema_ref": "ToolDiscovery#4b60",
-  "sema_id": "sema:ToolDiscovery#mh:SHA-256:4b608d9d78051bf0f7bd10120d145dd6664c416fc0c52969156f9a31d171d45b",
-  "sema_stub": "4b60",
+  "sema_ref": "ToolDiscovery#bf67",
+  "sema_id": "sema:ToolDiscovery#mh:SHA-256:bf677acdeda8699deafb4398efa1f605dea89de112873e9a7bb838a41adbffd6",
+  "sema_stub": "bf67",
   "dependencies": {
     "composes_with": {
       "compatibility_check": "sema:CompatibilityCheck#mh:SHA-256:62b270aff05a9bc66e1dc0156ad60fbcd64f9bfb12083f22b9449ceec0c98727",
-      "fail_closed": "sema:FailClosed#mh:SHA-256:408814ddae0d3fa2b4022f997c1feab5eef743a155cdedeba75bc42d26e467ac",
+      "fail_closed": "sema:FailClosed#mh:SHA-256:eae70da02880916a695d85d3752a59e16201c9f81b8a9af238d31863b3b6b157",
       "tool_invoke": "sema:ToolInvoke#mh:SHA-256:011f50770f2599f5017df648ad5920ddb732f7681a9a3b7576cdcf3798ce6baa"
     },
     "references": {
       "agent": "sema:Agent#mh:SHA-256:67659e263616d53dded32875421792f42fadf3137c87fe09cf9f5b9c163f10cf",
       "card": "sema:Card#mh:SHA-256:84b75e4aa9df317e013f042ff44e2cc81e5f3092d405375f2c84e4dad9d39b0b",
-      "context_first": "sema:ContextFirst#mh:SHA-256:a0b6432a809a0c73841202d1802a83018f3db9d5938893415218a383ce151d6a",
+      "context_first": "sema:ContextFirst#mh:SHA-256:75505829fde04a5838eecbcc83757f2e96bdd064f0aab6eabeccc6e69ce2725a",
       "discover": "sema:Discover#mh:SHA-256:8895070d390ce7493b0534f56d22d9dec6eb341d0865e4214f8f0141dc6f5104",
       "task": "sema:Task#mh:SHA-256:f239278f610adea7e01a9fd019dc6be158a31919d61d301856dcbe2aa8b67804"
     },
diff --git a/data/vocabulary/TraceBelief.json b/data/vocabulary/TraceBelief.json
index 7b5e38f5..1658f10c 100644
--- a/data/vocabulary/TraceBelief.json
+++ b/data/vocabulary/TraceBelief.json
@@ -14,17 +14,17 @@
       "Memory"
     ]
   },
-  "sema_id": "sema:TraceBelief#mh:SHA-256:bdfa33f15f8f71e3fa221c802b6366c6922de402326dd447841d3258b97bf053",
-  "sema_ref": "TraceBelief#bdfa",
-  "sema_stub": "bdfa",
+  "sema_id": "sema:TraceBelief#mh:SHA-256:18811aa52ea8a0b4e10e500c10285ccd80d90bf294f3f86d04dbd0ebfd2e6a06",
+  "sema_ref": "TraceBelief#1881",
+  "sema_stub": "1881",
   "signature": [
     "Trace(Belief)"
   ],
   "dependencies": {
     "references": {
       "belief": "sema:Belief#mh:SHA-256:7d838b98686e17c69e96df09b2c7ec870df22bba9a9bd02dc29bd62be41d5da8",
-      "surprisal_update": "sema:SurprisalUpdate#mh:SHA-256:6169da6dce9141595fc8b7ac8d8743e397cd44a2da04b3499b2ce910e174c2ef",
-      "time_warp_log": "sema:TimeWarpLog#mh:SHA-256:e26edd5011e4842730b23fb11a2d5efaff9a52112e8081f5856893c9c4ce99ff",
+      "surprisal_update": "sema:SurprisalUpdate#mh:SHA-256:41a9f896757eb4b0d7132604b60e0193eaba43329953359ef5e927f69112f8df",
+      "time_warp_log": "sema:TimeWarpLog#mh:SHA-256:2a101afbc167bce00efa25a0439774ab1b30ef094facfaf2b8f9a5edb1b54269",
       "trace": "sema:Trace#mh:SHA-256:314d8d38e6de13bf191dd0d368c8c1bcf7a2d4953b165f66daf7188b90dc37ab"
     }
   },
diff --git a/data/vocabulary/TruthseekingProtocol.json b/data/vocabulary/TruthseekingProtocol.json
index 5a95f46b..85812593 100644
--- a/data/vocabulary/TruthseekingProtocol.json
+++ b/data/vocabulary/TruthseekingProtocol.json
@@ -15,13 +15,13 @@
       "Inference"
     ]
   },
-  "sema_id": "sema:TruthseekingProtocol#mh:SHA-256:afc1189f15d918f6cd32eb6dd7d1c711d86288e60f10ea0171b71f261800c15a",
-  "sema_ref": "TruthseekingProtocol#afc1",
-  "sema_stub": "afc1",
+  "sema_id": "sema:TruthseekingProtocol#mh:SHA-256:d35b9e4131150929fcc3e447f1b8c57c65796e03c8c814a5b00fa95995778f53",
+  "sema_ref": "TruthseekingProtocol#d35b",
+  "sema_stub": "d35b",
   "dependencies": {
     "composes_with": {
-      "conceptual_decomposition": "sema:ConceptualDecomposition#mh:SHA-256:3cf20e30a632b0a7ab64a7fb2984fe64b106ba7819af458fa5e260aa89853b1d",
-      "marginal_value_rule": "sema:MarginalValueRule#mh:SHA-256:eebb10656ec6d554fa7bba3a98b2b9ba1207d58b31d0a794563605595af0f026"
+      "conceptual_decomposition": "sema:ConceptualDecomposition#mh:SHA-256:2cce877b501c3fe1fdf646e3c5ad3157b26502b7a6f7c943dfff389c055aa25a",
+      "marginal_value_rule": "sema:MarginalValueRule#mh:SHA-256:552ffce38f8fecae07f9faf905f0662ed284531904a94d55da19030138ff941d"
     },
     "references": {
       "validate": "sema:Validate#mh:SHA-256:337ce6c03c892bd0d326d81a8ae3a51e76557391240cf9a1694ff85458fe358e"
diff --git a/data/vocabulary/UniqueHandle.json b/data/vocabulary/UniqueHandle.json
index fcf0bb02..02d46320 100644
--- a/data/vocabulary/UniqueHandle.json
+++ b/data/vocabulary/UniqueHandle.json
@@ -23,14 +23,14 @@
       "Protocols"
     ]
   },
-  "sema_id": "sema:UniqueHandle#mh:SHA-256:88da37fb134c04632530db979115adbb3ca558bdc4f60111df03e9282de8cd3a",
-  "sema_ref": "UniqueHandle#88da",
-  "sema_stub": "88da",
+  "sema_id": "sema:UniqueHandle#mh:SHA-256:58f9595fc08f62825f3dc959f10533558f459760a1c63ef2bc72b6da615ff37b",
+  "sema_ref": "UniqueHandle#58f9",
+  "sema_stub": "58f9",
   "dependencies": {
     "references": {
       "agent": "sema:Agent#mh:SHA-256:67659e263616d53dded32875421792f42fadf3137c87fe09cf9f5b9c163f10cf",
       "break": "sema:Break#mh:SHA-256:3c370fec3d297e00ea2321826e420a429f65fc5f5da5ac61b844c821aef41018",
-      "state_lock": "sema:StateLock#mh:SHA-256:7cd86a9de68522b752366ef04de32f743b57ef16232866522ccdafb1f35c6da9"
+      "state_lock": "sema:StateLock#mh:SHA-256:8bde7c49752578e5c76e46d33b995497728f486d69d99ff618b9dbeaa7586c78"
     }
   },
   "sema_layer": "Society",
diff --git a/data/vocabulary/UniversalSolverTree.json b/data/vocabulary/UniversalSolverTree.json
index 04b311fd..7f8245ac 100644
--- a/data/vocabulary/UniversalSolverTree.json
+++ b/data/vocabulary/UniversalSolverTree.json
@@ -46,16 +46,16 @@
       }
     }
   },
-  "sema_ref": "UniversalSolverTree#7361",
-  "sema_id": "sema:UniversalSolverTree#mh:SHA-256:7361e8ea2303b8cd0970fe167548cbf9c86f7f418f175424906f563db22729ae",
-  "sema_stub": "7361",
+  "sema_ref": "UniversalSolverTree#0923",
+  "sema_id": "sema:UniversalSolverTree#mh:SHA-256:0923a89effa56135175d1404578641c31d6f2d63716745aba054d7143ad0d6f9",
+  "sema_stub": "0923",
   "dependencies": {
     "references": {
-      "localized_learning": "sema:LocalizedLearning#mh:SHA-256:1eec33d8fc081000b2c5927b7cfc2d4e6a8835fc9e0d46e051bb7ee34541cbdf",
+      "localized_learning": "sema:LocalizedLearning#mh:SHA-256:14502d62b7a331dbcb80bfdf6ab07f911cfb94b80788933e83119d787ec4fe37",
       "problem": "sema:Problem#mh:SHA-256:9d2c77f7ce7fd7d2e35fe45495d6124d43d35ce41b1766c6b428cfcba44486de",
       "solution": "sema:Solution#mh:SHA-256:48442c3e14ce25ef325cbff085d095ecf4c7735b006f162eb76e23d4315f8fa2",
-      "solver_node": "sema:SolverNode#mh:SHA-256:fd50fc5063ba52d2670169e4a8388e475cdc69084de648606236716f9ccc13b4",
-      "solver_tree": "sema:SolverTree#mh:SHA-256:2e4c0e7dce54bfdddd61b9ec1a19715036eb916f979695719b7b8987dce72057",
+      "solver_node": "sema:SolverNode#mh:SHA-256:45292efbd4e607174b8e0b82535d8bede20eb408a9d341b86742e1db2982ea1a",
+      "solver_tree": "sema:SolverTree#mh:SHA-256:0c3f163ca8ac5f88d9548387e9b22338281d90d5404ea4281aebbe94d4b713ce",
       "tree": "sema:Tree#mh:SHA-256:a8c4c04005dec32b56be8ea4a31f369e821d3c87f2705d1dae5d58ed53760543"
     }
   },
diff --git a/data/vocabulary/Vote.json b/data/vocabulary/Vote.json
index d46e234a..de9b5a4c 100644
--- a/data/vocabulary/Vote.json
+++ b/data/vocabulary/Vote.json
@@ -48,20 +48,20 @@
       "Coordination"
     ]
   },
-  "sema_id": "sema:Vote#mh:SHA-256:3b66510363464c335c95a843247ddd37bbb98616a17f6a8d4bb17b1ac91bd41c",
-  "sema_ref": "Vote#3b66",
-  "sema_stub": "3b66",
+  "sema_id": "sema:Vote#mh:SHA-256:0affbbc722d42218027f581176be08d0a66c9a3dc99adbf94d411ef9fc38786c",
+  "sema_ref": "Vote#0aff",
+  "sema_stub": "0aff",
   "dependencies": {
     "accepts": {
-      "ballot": "sema:Ballot#mh:SHA-256:43ebc85e8e87e132698c59536402d1ba715b0dbad9e6c116f97a056c60da4577"
+      "ballot": "sema:Ballot#mh:SHA-256:84c3ea1db9fa8ab818d4fd156a8ef0a43d15b50419ca42236869bd9119f35497"
     },
     "composes_with": {
-      "quorum": "sema:Quorum#mh:SHA-256:c6a5b21dbe9b2c1fa46e5e67505041c92048a0a687f5703efa45486b51c56957"
+      "quorum": "sema:Quorum#mh:SHA-256:d634d5cf0f165f708a5f39e54d8ad42716c11e21189459585468a294d2ebc7bc"
     },
     "references": {
       "aggregate": "sema:Aggregate#mh:SHA-256:4861bd34b2e422951e42b0fd804dab73daa2753ea746c0141927c3e5c6ea8f4b",
       "break": "sema:Break#mh:SHA-256:3c370fec3d297e00ea2321826e420a429f65fc5f5da5ac61b844c821aef41018",
-      "elect": "sema:Elect#mh:SHA-256:45ff98aaa03731e8e490293d799edba62f98b40669828f2d32b436a0ecd4b6ca",
+      "elect": "sema:Elect#mh:SHA-256:187a9d1996e3ad1fcb86b8dfe1207efb6473f2488bbf2741e5d77207b9dcdd38",
       "system": "sema:System#mh:SHA-256:f8eb318a1113a10fead02fbf14ae433767ac1a69c9579cdb584cc622068e90b3"
     }
   },
diff --git a/data/vocabulary/Warmup.json b/data/vocabulary/Warmup.json
index d876b3ec..e0a7e1be 100644
--- a/data/vocabulary/Warmup.json
+++ b/data/vocabulary/Warmup.json
@@ -47,14 +47,14 @@
       "Primitives"
     ]
   },
-  "sema_id": "sema:Warmup#mh:SHA-256:32d4b559fc99f4dfa7a154487385194fe1c4f5cd3589a5910d2ee35eadc38fff",
-  "sema_ref": "Warmup#32d4",
-  "sema_stub": "32d4",
+  "sema_id": "sema:Warmup#mh:SHA-256:7ad05d8c27bdabb565d72ce56d8a896af84e5c35d5bc56afb7bdecdac5b40551",
+  "sema_ref": "Warmup#7ad0",
+  "sema_stub": "7ad0",
   "dependencies": {
     "references": {
       "greet": "sema:Greet#mh:SHA-256:58542bc100077ab85299c99424fa0ca7ea8559890678461a0d7f7aaba927c74f",
       "system": "sema:System#mh:SHA-256:f8eb318a1113a10fead02fbf14ae433767ac1a69c9579cdb584cc622068e90b3",
-      "throttle": "sema:Throttle#mh:SHA-256:dc1439d0fbf64ac81ebea3d7570e55d7b94802d028061470a2e5681bc3c1d5f6"
+      "throttle": "sema:Throttle#mh:SHA-256:24860a38fb19f46f0cd620ada5ec2abadef4377dc6c0459f14180e4ce7aed7c8"
     }
   },
   "sema_layer": "Infrastructure",
diff --git a/data/vocabulary/WorkerMode.json b/data/vocabulary/WorkerMode.json
index bb55dab2..f85d7c4f 100644
--- a/data/vocabulary/WorkerMode.json
+++ b/data/vocabulary/WorkerMode.json
@@ -32,12 +32,12 @@
       "Protocols"
     ]
   },
-  "sema_id": "sema:WorkerMode#mh:SHA-256:5a39d816a3e43ab57bbda2cef5355bdcb8f62a23bad433199c59b27b1a747bf6",
-  "sema_ref": "WorkerMode#5a39",
-  "sema_stub": "5a39",
+  "sema_id": "sema:WorkerMode#mh:SHA-256:fa5a1d68014ab809187e837cb116ea4bacc4316d1c982dd9fe1b2bc5b2e4998c",
+  "sema_ref": "WorkerMode#fa5a",
+  "sema_stub": "fa5a",
   "dependencies": {
     "accepts": {
-      "solver_manifest": "sema:SolverManifest#mh:SHA-256:47d424b51aac06ae90c6ab67ecd415876cf3feef3e2a18897fa8cc94b75399ff"
+      "solver_manifest": "sema:SolverManifest#mh:SHA-256:47aef05958dec89d4a0ccb6d8965d2bbd812dd8a3c10ef265f3150cfebee0384"
     },
     "references": {
       "agent": "sema:Agent#mh:SHA-256:67659e263616d53dded32875421792f42fadf3137c87fe09cf9f5b9c163f10cf",
@@ -47,7 +47,7 @@
       "lock": "sema:Lock#mh:SHA-256:95c2ee952a5301d4b346a5e8693350829d88b3c600048eedcf87bb00c23ee5fb",
       "mode": "sema:Mode#mh:SHA-256:081fc72c357b65d52cc697735a860ca98ce2b0ac13892dd94699ef8b08a04a2b",
       "solution": "sema:Solution#mh:SHA-256:48442c3e14ce25ef325cbff085d095ecf4c7735b006f162eb76e23d4315f8fa2",
-      "solver_node": "sema:SolverNode#mh:SHA-256:fd50fc5063ba52d2670169e4a8388e475cdc69084de648606236716f9ccc13b4",
+      "solver_node": "sema:SolverNode#mh:SHA-256:45292efbd4e607174b8e0b82535d8bede20eb408a9d341b86742e1db2982ea1a",
       "state": "sema:State#mh:SHA-256:4f25e6a16ccd37dc0bc154cccc7055cb504d49daa8b712f372a425eb6c7b8cb2",
       "task": "sema:Task#mh:SHA-256:f239278f610adea7e01a9fd019dc6be158a31919d61d301856dcbe2aa8b67804"
     }
diff --git a/data/vocabulary/Workflow.json b/data/vocabulary/Workflow.json
index 019037b0..882a9c8d 100644
--- a/data/vocabulary/Workflow.json
+++ b/data/vocabulary/Workflow.json
@@ -45,15 +45,15 @@
       "Protocols"
     ]
   },
-  "sema_id": "sema:Workflow#mh:SHA-256:6de060aa8b0e98b2042b10aa6465125ca877a41d8d10859a8d4a7f2f9ea5fcc6",
-  "sema_ref": "Workflow#6de0",
-  "sema_stub": "6de0",
+  "sema_id": "sema:Workflow#mh:SHA-256:982bc58d26f2d57c21420514e03f33d68e10ca20b01eae9953927cb95b437042",
+  "sema_ref": "Workflow#982b",
+  "sema_stub": "982b",
   "dependencies": {
     "references": {
       "accept_spec": "sema:AcceptSpec#mh:SHA-256:c1565bf022e5596a447f7c9d9687ac3cbf1e6960f871be16f386eec02b5df2c4",
       "artifact": "sema:Artifact#mh:SHA-256:379aeed82460aa1a42442f89572d8e621f93f900aa56686b5962dd7800adaec3",
-      "role": "sema:Role#mh:SHA-256:315289020c8b40e92e7e84298036fa6417d6f779f6980a7a48d2ba68c62d6fad",
-      "solver": "sema:Solver#mh:SHA-256:04b58c815005971905e3d430112a06fb76b727882204a80fe58ace79b066a1d6",
+      "role": "sema:Role#mh:SHA-256:9b2c6ae96c7b02fae8fcc5c665a789974874e8818f2641c7bc55096d28a9dff6",
+      "solver": "sema:Solver#mh:SHA-256:b7f9e18fec50d288ea829a21a59de02f65cf1ffe3eef07142389d659bd421d02",
       "step": "sema:Step#mh:SHA-256:aa73ad96f51e2c5fe3a5a42d251855eea9c8a75c93a50539f4d6c6635c8dd7d7"
     }
   },
diff --git a/data/vocabulary/WorldTransparent.json b/data/vocabulary/WorldTransparent.json
index c8ad400b..ea85c77e 100644
--- a/data/vocabulary/WorldTransparent.json
+++ b/data/vocabulary/WorldTransparent.json
@@ -26,12 +26,12 @@
       "Governance"
     ]
   },
-  "sema_id": "sema:WorldTransparent#mh:SHA-256:8440e780396b6f32b6f0f5157c33379961fce250cca368611ef283706a0c77be",
-  "sema_ref": "WorldTransparent#8440",
-  "sema_stub": "8440",
+  "sema_id": "sema:WorldTransparent#mh:SHA-256:4a70f373c5298ed905d1e3afc59372689b205775e3cb6898c94a6bb076c0f64e",
+  "sema_ref": "WorldTransparent#4a70",
+  "sema_stub": "4a70",
   "dependencies": {
     "references": {
-      "explain_beacon": "sema:ExplainBeacon#mh:SHA-256:2e403d47af0e3914841b5e03a4b9531b479ae05b2a54f402c24e99232f45b38a",
+      "explain_beacon": "sema:ExplainBeacon#mh:SHA-256:467629a3f5dd0dd214a5ba9f703cb0f54c61ac0ea5c5f404e3dd0b3a10910887",
       "system": "sema:System#mh:SHA-256:f8eb318a1113a10fead02fbf14ae433767ac1a69c9579cdb584cc622068e90b3"
     }
   },
diff --git a/data/vocabulary/Yield.json b/data/vocabulary/Yield.json
index 3f74a13a..65c9f8c8 100644
--- a/data/vocabulary/Yield.json
+++ b/data/vocabulary/Yield.json
@@ -1,7 +1,7 @@
 {
   "handle": "Yield",
-  "mechanism": "Negotiation {{backoff}}. When `{{overlap}}` fails: 1. Agents declare 'Flex' (concession) and 'Weight' (importance). 2. {{system}} computes Yield-Ratio. 3. Lower-weighted preference cedes to higher. 4. Debt recorded in Ledger. Utilizes {{defer}}.",
-  "gloss": "Weighted negotiation backoff with deferred debt ledger",
+  "mechanism": "Negotiation concession. When `{{overlap}}` fails: 1. Agents declare 'Flex' (concession) and 'Weight' (importance). 2. {{system}} computes Yield-Ratio. 3. Lower-weighted preference cedes to higher. 4. Debt recorded in Ledger. Utilizes {{defer}}.",
+  "gloss": "Weighted negotiation concession with deferred debt ledger",
   "failure_modes": [
     "Weight inflation (mitigated by historical consistency tracking).",
     "Gaming ledger with trivial yields.",
@@ -15,19 +15,19 @@
     "tier": 2,
     "ring": 1,
     "supersedes": [
-      "sema:Yield#mh:SHA-256:7eaffd4f68072f2f82302e3d2deb33a830bc9f1148b64d705cf4d08125b248e0"
+      "sema:Yield#mh:SHA-256:7eaffd4f68072f2f82302e3d2deb33a830bc9f1148b64d705cf4d08125b248e0",
+      "sema:Yield#mh:SHA-256:d80209c8d3d01dff308a1917000beb714a2fe3e454e21c56643c3c8b53cd6fcf"
     ],
     "path": [
       "Society",
       "Economics"
     ]
   },
-  "sema_id": "sema:Yield#mh:SHA-256:d80209c8d3d01dff308a1917000beb714a2fe3e454e21c56643c3c8b53cd6fcf",
-  "sema_ref": "Yield#d802",
-  "sema_stub": "d802",
+  "sema_id": "sema:Yield#mh:SHA-256:d665e9a8a91a9ec23f8b338f875b05f1f7fe7844b8f21361b06bdd065bd78a02",
+  "sema_ref": "Yield#d665",
+  "sema_stub": "d665",
   "dependencies": {
     "references": {
-      "backoff": "sema:Backoff#mh:SHA-256:16c2d636281df44ed78ef3bce341e7a349fd37cbd675706e2e395172c1dccae6",
       "defer": "sema:Defer#mh:SHA-256:2c34df90bea83ca4d3e6e530f852e034cf89c123732ff7835a2f883cce6c53aa",
       "overlap": "sema:Overlap#mh:SHA-256:d70c8e5e00064f385853d70213d03d8ba547a1156024f826c4f782c4b677cefd",
       "system": "sema:System#mh:SHA-256:f8eb318a1113a10fead02fbf14ae433767ac1a69c9579cdb584cc622068e90b3"
diff --git a/docs/guides/getting-started.md b/docs/guides/getting-started.md
index 3ffec367..dc1f055f 100644
--- a/docs/guides/getting-started.md
+++ b/docs/guides/getting-started.md
@@ -1,6 +1,6 @@
 # Getting Started
 
-Sema is a growing vocabulary of cognitive patterns with cryptographic identity. Each pattern has a handle (e.g. `StateLock#7cd8`) that is a hash of its definition — two agents using the same handle are provably talking about the same thing.
+Sema is a growing vocabulary of cognitive patterns with cryptographic identity. Each pattern has a handle (e.g. `StateLock#8bde`) that is a hash of its definition — two agents using the same handle are provably talking about the same thing.
 
 ## Install
 
@@ -56,13 +56,13 @@ Ask your agent:
 
 > Search sema for coordination patterns
 
-You should see results like `Consensus#45f4`, `Vote#3b66`, `StateLock#7cd8`.
+You should see results like `Consensus#0526`, `Vote#0aff`, `StateLock#8bde`.
 
 ## Use handles as words
 
 Sema handles are thinking tools, not footnotes:
 
-> "This uses `StateLock#7cd8` to prevent concurrent mutation"
+> "This uses `StateLock#8bde` to prevent concurrent mutation"
 
 > "Apply `Decompose#63f3` first, then `Prioritize#8028` the subproblems"
 
diff --git a/docs/guides/understanding-graph.md b/docs/guides/understanding-graph.md
index 1a37c05d..0090b935 100644
--- a/docs/guides/understanding-graph.md
+++ b/docs/guides/understanding-graph.md
@@ -15,7 +15,7 @@ but drift on the meaning of the words they use. Together, they form a
 reasoning commons that survives across sessions and across agents.
 
 > **A note on the hashes in this doc.** The examples below use live canonical
-> hashes from the current sema vocabulary (`StateLock#7cd8`,
+> hashes from the current sema vocabulary (`StateLock#8bde`,
 > `MechanisticDesignProposal#4c39`). Refinement can change a hash. If a
 > handshake returns `HALT` instead of `PROCEED`, run `sema show <handle>`
 > to see the current canonical stub — that's the fail-closed protocol
@@ -75,14 +75,14 @@ graph_batch({
     op: "add_concept",
     trigger: "decision",
     title: "Session mutex via StateLock",
-    mechanism: "Use sema://StateLock#7cd8 for session-level mutex.",
+    mechanism: "Use sema://StateLock#8bde for session-level mutex.",
     explanation: "StateLock gives fail-closed semantics; verified via sema_handshake before commit."
   }]
 })
 ```
 
 Later, any teammate who reads this node can re-run the handshake on
-`StateLock#7cd8` to verify the definition is still the same one the original
+`StateLock#8bde` to verify the definition is still the same one the original
 architect used.
 
 ## Pattern: discover past uses of a sema pattern
@@ -90,7 +90,7 @@ architect used.
 To find every graph node that has ever referenced a sema pattern:
 
 ```
-graph_semantic_search({ query: "StateLock#7cd8" })
+graph_semantic_search({ query: "StateLock#8bde" })
 ```
 
 Because sema hashes are content-addressed, you're guaranteed to be reading
diff --git a/docs/information/audit.md b/docs/information/audit.md
index 8d74dd73..fbc174d2 100644
--- a/docs/information/audit.md
+++ b/docs/information/audit.md
@@ -7,9 +7,9 @@ All audits below are **advisory**. Heuristic audits generate false positives; us
 Source: `sema.audit.hash_validity` (ok)
 
 ```text
-Checking hash validity for 452 patterns...
+Checking hash validity for 453 patterns...
 
-All 452 hashes valid.
+All 453 hashes valid.
 ```
 
 ## Missing or short fields
@@ -17,7 +17,7 @@ All 452 hashes valid.
 Source: `sema.audit.missing_or_short` (ok)
 
 ```text
-Auditing 452 patterns in data/vocabulary...
+Auditing 453 patterns in data/vocabulary...
 ✅ No issues found.
 ```
 
@@ -27,7 +27,7 @@ Source: `sema.audit.graph` (ok)
 
 ```text
 Loading graph...
-Graph loaded with 1805 nodes and 3577 edges.
+Graph loaded with 1807 nodes and 3580 edges.
 Checking for orphaned patterns...
 Checking for orphaned components...
 Checking for missing metadata...
@@ -45,16 +45,17 @@ Source: `sema.audit.rigor` (ok)
 
 ```text
 {
-  "total": 452,
+  "total": 453,
   "with_invariants": 372,
   "with_preconditions": 180,
   "with_postconditions": 171,
   "with_all_contract_fields": 169,
-  "without_explicit_contracts": 79
+  "without_explicit_contracts": 80
 }
 
 Sample patterns without explicit contracts (review only; omission may be intentional):
 - Axiom
+- Backoff
 - Branch
 - Category
 - Causation
@@ -68,7 +69,6 @@ Sample patterns without explicit contracts (review only; omission may be intenti
 - Option
 - Parallel
 - Prompt
-- Protocol
 ```
 
 ## Potential missing dependency links
@@ -77,7 +77,7 @@ Source: `sema.audit.missing_links` (ok)
 
 ```text
 🔍 Scanning data/vocabulary for missing links...
-Loaded 452 patterns.
+Loaded 453 patterns.
 
 Found 395 potential missing links.
 
@@ -661,7 +661,7 @@ Found 395 potential missing links.
 Source: `sema.audit.unlinked_mentions` (ok)
 
 ```text
-Scanning 452 patterns for unlinked handle mentions...
+Scanning 453 patterns for unlinked handle mentions...
 
 ⚠️  Abduction:
    • Mentions 'Anomaly' (unlinked). Should it be '{{{ghost}}}'?
@@ -765,6 +765,8 @@ Scanning 452 patterns for unlinked handle mentions...
 ⚠️  Axiom:
    • Mentions 'System' (unlinked). Should it be '{{{ghost}}}'?
 ⚠️  Backoff:
+   • Mentions 'Defer' (unlinked). Should it be '{{{ghost}}}'?
+   • Mentions 'Feedback' (unlinked). Should it be '{{{ghost}}}'?
    • Mentions 'Retry' (unlinked). Should it be '{{{ghost}}}'?
 ⚠️  BackwardChain:
    • Mentions 'Chain' (unlinked). Should it be '{{{ghost}}}'?
@@ -1205,6 +1207,10 @@ Scanning 452 patterns for unlinked handle mentions...
    • Mentions 'Estimate' (unlinked). Should it be '{{{ghost}}}'?
    • Mentions 'Option' (unlinked). Should it be '{{{ghost}}}'?
    • Mentions 'Value' (unlinked). Should it be '{{{ghost}}}'?
+⚠️  ExponentialBackoff:
+   • Mentions 'Budget' (unlinked). Should it be '{{{ghost}}}'?
+   • Mentions 'Retry' (unlinked). Should it be '{{{ghost}}}'?
+   • Mentions 'Sequence' (unlinked). Should it be '{{{ghost}}}'?
 ⚠️  ExtendedThinking:
    • Mentions 'Budget' (unlinked). Should it be '{{{ghost}}}'?
    • Mentions 'Think' (unlinked). Should it be '{{{ghost}}}'?
@@ -1909,7 +1915,6 @@ Scanning 452 patterns for unlinked handle mentions...
    • Mentions 'Vector' (unlinked). Should it be '{{{ghost}}}'?
 ⚠️  Retry:
    • Mentions 'Agent' (unlinked). Should it be '{{{ghost}}}'?
-   • Mentions 'Backoff' (unlinked). Should it be '{{{ghost}}}'?
    • Mentions 'Break' (unlinked). Should it be '{{{ghost}}}'?
    • Mentions 'Budget' (unlinked). Should it be '{{{ghost}}}'?
    • Mentions 'Check' (unlinked). Should it be '{{{ghost}}}'?
@@ -2297,7 +2302,7 @@ Scanning 452 patterns for unlinked handle mentions...
 ⚠️  Yield:
    • Mentions 'Ledger' (unlinked). Should it be '{{{ghost}}}'?
 
-Scan complete. Found unlinked handle mentions in 369 patterns.
+Scan complete. Found unlinked handle mentions in 370 patterns.
 ```
 
 ## Semantic similarity between patterns
diff --git a/docs/information/vocabulary_information.md b/docs/information/vocabulary_information.md
index e7237911..75169f54 100644
--- a/docs/information/vocabulary_information.md
+++ b/docs/information/vocabulary_information.md
@@ -2,9 +2,9 @@
 
 ## System Status
 
-- **Merkle Root**: `b7c42bc564f5a8d2ac3cb6140430e9d98feb82a8f9b943f550f554e9ba6360b5`
-- **Pattern Count**: 452
-- **Verified Against Root**: `b7c42bc564f5a8d2…`
+- **Merkle Root**: `901130d88dab244cc0d4afc149c5e6eeb9c9565e117c468a8e5326287be8fefa`
+- **Pattern Count**: 453
+- **Verified Against Root**: `901130d88dab244c…`
 
 ## Usage
 
@@ -14,7 +14,7 @@ Agents use the Merkle root for fail-closed semantic verification:
 
 ```python
 # Agent A shares vocabulary root
-R_context_A = "b7c42bc564f5a8d2ac3cb6140430e9d98feb82a8f9b943f550f554e9ba6360b5"
+R_context_A = "901130d88dab244cc0d4afc149c5e6eeb9c9565e117c468a8e5326287be8fefa"
 
 # Agent B computes their vocabulary root
 R_context_B = compute_vocabulary_merkle_root()
@@ -29,9 +29,9 @@ else:
 
 Breakdown of patterns by Civilization Layer and Functional Category.
 
-### Unclassified (452)
+### Unclassified (453)
 
 | Category | Count |
 | :--- | :---: |
-| Uncategorized | 452 |
+| Uncategorized | 453 |
 
diff --git a/docs/manuals/vocabulary-design.md b/docs/manuals/vocabulary-design.md
index 7bed369c..d335ce16 100644
--- a/docs/manuals/vocabulary-design.md
+++ b/docs/manuals/vocabulary-design.md
@@ -6,8 +6,8 @@
      `data/design_critique.json`. -->
 
 _Generated: 2026-07-18_
-_Patterns covered: 452 (from `data/vocabulary/`)_
-_Commentary entries in sidecar: 452 (from `data/design_critique.json`)_
+_Patterns covered: 453 (from `data/vocabulary/`)_
+_Commentary entries in sidecar: 453 (from `data/design_critique.json`)_
 
 This manual is the design reference for the Sema Bootstrap Library. For each pattern, it shows the machine-checkable spec (mechanism, invariants, pre/postconditions, failure modes) alongside the design commentary: why it exists, why it sits where it does, whether it could be removed, how it's used across contexts, its design tensions and tradeoffs, critique, and where it sits in its family.
 
@@ -932,7 +932,7 @@ _Note: §3.3 adds `derived_from Lock` to Mutex. Broad-use test confirms Mutex as
 
 ### Physics/Time (1)
 
-### CausalBarrier#39b3
+### CausalBarrier#9e17
 
 `Physics` · `Time` · R0 · T1
 
@@ -992,7 +992,7 @@ _Note: §3.3 adds `derived_from Lock` to Mutex. Broad-use test confirms Mutex as
 
 ---
 
-## Infrastructure (151)
+## Infrastructure (152)
 
 ### Infrastructure/Data Structures (93)
 
@@ -1384,7 +1384,7 @@ _Note: `Audit` at R0T1 is a Noun (the audit artifact/process). `SpotAudit` (cove
 
 ---
 
-### Ballot#43eb
+### Ballot#84c3
 
 `Infrastructure` · `Data Structures` · R0 · T1
 
@@ -2562,7 +2562,7 @@ _Note: §3.18 flagged Decision as Noun-with-Verb-mechanism. The §3.11-style rew
 
 ---
 
-### Exception#054c
+### Exception#39fb
 
 `Infrastructure` · `Data Structures` · R0 · T1
 
@@ -3667,7 +3667,7 @@ _Note: §3.18 (after Gemini Round 4) keeps Nature as canonical Noun per paper Ta
 
 ---
 
-### PerformanceSignal#7dea
+### PerformanceSignal#10af
 
 `Infrastructure` · `Data Structures` · R0 · T1
 
@@ -5017,7 +5017,7 @@ _Note: §3.12 flagged ProtoPack for phantom signature — mechanism has no compo
 
 ---
 
-### SolverManifest#47d4
+### SolverManifest#47ae
 
 `Infrastructure` · `Data Structures` · R0 · T1
 
@@ -5600,7 +5600,7 @@ _Note: §3.18 converts to Trait. Broad-use confirms — it's a grammatical role,
 
 ---
 
-### Tension#547a
+### Tension#5dce
 
 `Infrastructure` · `Data Structures` · R1 · T1
 
@@ -6012,7 +6012,7 @@ _Note: §3.18 moves Cyclic/Parallel/Linear to Infra/DS alongside Chain/Tree/DAG/
 
 ---
 
-### Infrastructure/Primitives (49)
+### Infrastructure/Primitives (50)
 
 ### Act#7616
 
@@ -6206,63 +6206,57 @@ _Note: `Act`'s mandate that "All Acts must be authorized, logged, and potentiall
 
 ---
 
-### Backoff#16c2
+### Backoff#9e59
 
 `Infrastructure` · `Primitives` · R0 · T2
 
-**Gloss.** Exponential delay to reduce contention
+**Gloss.** Delay subsequent attempts after failure or contention
 
 **Mechanism.**
 
-> Exponential Delay: On failure, wait delay D before retry. On repeated failure, D *= multiplier (typically 2). Add jitter to prevent thundering herd. Cap at maximum delay. Reset on success.
-
-**Invariants.**
-- Retry budget must be finite (max_attempts set before first attempt).
-
-**Failure modes.**
-- Starvation: Unlucky agents keep backing off while others succeed, never getting a slot.
+> After an attempt encounters failure, rejection, or contention and a caller elects to try again, defer the next eligible attempt according to a delay policy. The policy may derive the delay from attempt count, failure history, feedback, or external conditions. Backoff supplies spacing; retry eligibility and retry budgets remain caller policy.
 
 #### Design
 
-**Why it exists.** Contention reduction as a typed primitive — every retry loop needs exponential delay with jitter and a cap, and reinventing it per call site produces inconsistent behavior (different multipliers, missing jitter, unbounded growth). Backoff pins the minimum mechanism so every retry loop in the library inherits the same shape.
+**Why it exists.** Retry and contention mechanisms need a shared name for deferring a subsequent attempt without pretending that exponential growth, Fibonacci growth, feedback adaptation, jitter, caps, reset rules, or retry budgets are universal. Backoff pins that reusable family intersection.
 
-**Why Infrastructure.** exponential delay — mechanical primitive
+**Why Infrastructure.** failure-responsive delay — mechanical primitive
 
-**Can it be removed?** No. Referenced by Retry, ReAttempt, StateLock, Mutex, Lock, Throttle, and every other pattern that has to handle contention. Removing would force each site to re-declare the delay mechanics.
+**Can it be removed?** No. Retry, ReAttempt, CircuitBreaker, StateLock, and Throttle use the shared delay concept. Removing it would force each caller to re-declare the family-level spacing semantics.
 
-**Intended use.** exponential delay to reduce contention — multiplier growth + jitter + cap.
+**Intended use.** defer a subsequent attempt after failure, rejection, or contention according to a delay policy.
 
-**Future uses.** exponential retry-delay variants with different caps, jitter distributions, and reset policies.
+**Future uses.** shared parent for exponential, Fibonacci, fixed, feedback-adaptive, and externally signaled delay strategies.
 
 **Broad-use contexts.** retry backoff, thundering-herd prevention, rate-limit recovery, connection retry, TCP congestion, SaaS API integration.
 
-**Broad-use intersection (review hypothesis).** initial delay, multiplier, jitter, cap.
+**Broad-use intersection (review hypothesis).** a triggering failure, rejection, or contention outcome; a caller-selected subsequent attempt; and a policy-derived delay before eligibility.
 
-**Varies (descendant territory).** multiplier value, jitter distribution, cap value, reset-on-success semantic, per-target vs global.
+**Varies (descendant territory).** delay progression, feedback inputs, jitter, cap, reset boundary, scope, and retry budget.
 
-**Extension shape.** `JitteredExponentialBackoff`, `CappedExponentialBackoff`; a generic `Backoff` parent with `ExponentialBackoff`, `FibonacciBackoff`, and `AdaptiveBackoff` children requires a migration.
+**Extension shape.** `ExponentialBackoff`, `FibonacciBackoff`, `AdaptiveBackoff`, and domain-specific feedback policies.
 
-_Note: The published hash is specifically exponential despite the general handle; the commentary no longer presents non-exponential strategies as honest descendants of that definition._
+_Note: The former published definition was specifically exponential. That strategy now lives in `ExponentialBackoff`; the short parent handle contains only the broad-use intersection._
 
 **Design tensions.**
-- Deterministic policy vs jitter: the mechanism mandates jitter to prevent thundering herd, which is inherently non-deterministic. Callers who need reproducibility have to seed or disable jitter — the pattern doesn't expose the seed.
-- Exponential growth vs cap: unbounded growth is catastrophic; bounded growth degrades the 'exponential' property at the cap. The pattern requires the cap but doesn't say what value is reasonable.
-- Reset-on-success vs sticky state: the mechanism says reset on success. Some production systems want to keep the backoff growing across independent operations on the same resource (adaptive throttling). That is a descendant concern.
+- Load reduction vs liveness: longer spacing protects a contested target but delays recovery after conditions improve.
+- Local history vs external feedback: some policies derive delay from attempt count while others consume server hints or observed load; the parent must admit both.
+- Shared policy vs caller ownership: Backoff determines spacing, while the decision to retry and the retry budget remain with the caller.
 
 **Tradeoffs.**
-- Exponential buys rapid contention reduction at the cost of slow recovery from transient failures (a single failed attempt takes exponential time to retry).
-- Jitter buys herd prevention at the cost of predictability — the precise retry times are randomized.
-- Finite retry budget buys crash-loop prevention at the cost of surrendering on persistent failures that would eventually resolve.
+- A shared parent makes retry strategies substitutable at the cost of leaving concrete scheduling guarantees to descendants.
+- Deferral reduces repeated pressure at the cost of progress latency and possible starvation under unfair contention.
 
 **Critique (diagnostic, not contract requirements).**
-- The short parent handle squats on the general concept while the hash pins exponential growth, mandatory jitter, reset-on-success, a finite retry budget, and arbitrary numeric ranges.
-- `FibonacciBackoff` and `AdaptiveBackoff` cannot honestly derive from this definition because they violate its mechanism. The clean fix is a generic `Backoff` parent plus an `ExponentialBackoff` child, not more contracts on the current parent.
-- That split affects the paper's parameter example and a wide dependent subtree, so it is recorded as a dedicated migration rather than silently weakened in this batch. Starvation, synchronized retries, exhaustion before recovery, and retry amplification remain relevant family risks.
+- The parent is intentionally mechanism-light: adding a multiplier, jitter, cap, reset rule, or finite budget here would again exclude legitimate family members.
+- The time-delay mechanism excludes negotiation concession and other metaphorical uses of the English word 'backoff'; those belong to different patterns.
+- Starvation, synchronized retries, exhaustion before recovery, and retry amplification remain family-level review risks, but their mitigations depend on the selected descendant and caller policy.
 
-**In the family.** The contention-reduction primitive for every retry loop in the library. Composed with `Cooldown` (minimum inter-event gap), `Throttle` (rate cap), and `Hysteresis` (asymmetric thresholds). Used by `Lock`, `Mutex`, `StateLock`, `Retry`, `ReAttempt`, `CircuitBreaker` at the contention layer.
+**In the family.** The parent of concrete delay policies such as `ExponentialBackoff`. Composes with `Cooldown` (minimum inter-event gap), `Throttle` (aggregate rate cap), and retry callers such as `Retry`, `ReAttempt`, and `CircuitBreaker`.
 
 **Supersedes (prior versions).**
 - `Backoff#315a`
+- `Backoff#16c2`
 
 ---
 
@@ -6492,7 +6486,7 @@ _Note: The published hash is specifically exponential despite the general handle
 
 ---
 
-### CircuitBreaker#840f
+### CircuitBreaker#3caa
 
 `Infrastructure` · `Primitives` · R1 · T1
 
@@ -6554,7 +6548,7 @@ _Note: The published hash is specifically exponential despite the general handle
 - Zombie state (stuck OPEN) is named but unmitigated — reset logic lives outside the pattern, which is exactly where it breaks in practice.
 - False positives from transient blips are the most common production complaint and the pattern offers no built-in debouncing; that's a caller concern.
 
-**In the family.** The canonical resilience primitive, paired with Retry (what CircuitBreaker replaces when retries aren't helping), Backoff (what calls it), and FailFast (the CLOSED-to-OPEN transition's semantics). Compare with Throttle — CircuitBreaker is binary (pass or fail), Throttle is graduated (rate limit). Both protect downstream resources, at different operating points.
+**In the family.** The canonical resilience primitive, paired with Retry (what CircuitBreaker replaces when retries aren't helping), Backoff (the delay discipline for recovery probes), and FailFast (the CLOSED-to-OPEN transition's semantics). Compare with Throttle — CircuitBreaker is binary (pass or fail), Throttle is graduated (rate limit). Both protect downstream resources, at different operating points.
 
 **Supersedes (prior versions).**
 - `CircuitBreaker#4162`
@@ -6666,7 +6660,7 @@ _Note: The published hash is specifically exponential despite the general handle
 
 ---
 
-### Compensate#9b3b
+### Compensate#e23b
 
 `Infrastructure` · `Primitives` · R0 · T1
 
@@ -6790,7 +6784,7 @@ _Note: The published hash is specifically exponential despite the general handle
 
 ---
 
-### Cooldown#878c
+### Cooldown#6f56
 
 `Infrastructure` · `Primitives` · R0 · T1
 
@@ -6911,7 +6905,68 @@ _Note: The published hash is specifically exponential despite the general handle
 
 ---
 
-### FailClosed#4088
+### ExponentialBackoff#a543
+
+`Infrastructure` · `Primitives` · R0 · T1
+
+**Gloss.** Geometrically increasing capped retry delay
+
+**Mechanism.**
+
+> A {{backoff}} delay policy whose unjittered delay grows geometrically across consecutive unsuccessful attempts: base_delay * multiplier^attempt_index. A configurable jitter factor may perturb the candidate delay to decorrelate concurrent attempts, after which the scheduled delay is clamped to max_delay. The caller defines retry eligibility, retry budget, and when the attempt sequence resets.
+
+**Invariants.**
+- Scheduled delay is greater than zero and does not exceed max_delay.
+- Before jitter, delay is non-decreasing with attempt_index until max_delay is reached.
+
+**Failure modes.**
+- Synchronized retries when jitter is zero or correlated across callers.
+- Excessive recovery delay when the multiplier or cap is too large.
+- Retry amplification when callers use the delay policy without a retry budget.
+
+#### Design
+
+**Why it exists.** Geometric delay growth is common enough to deserve a precise child instead of occupying the generic Backoff handle. It lets callers request multiplier growth, a cap, and optional jitter without imposing those choices on Fibonacci or feedback-adaptive policies.
+
+**Why Infrastructure.** geometrically increasing delay — mechanical strategy
+
+**Can it be removed?** Removable in capability terms because callers can implement the formula directly, but retaining it gives transient Retry paths an honest, reusable dependency.
+
+**Intended use.** capped geometric delay growth across consecutive unsuccessful attempts.
+
+**Future uses.** exponential retry-delay variants with different multipliers, caps, and jitter factors.
+
+**Broad-use contexts.** service retries, lock contention, connection recovery, rate-limit recovery, and thundering-herd mitigation.
+
+**Broad-use intersection (review hypothesis).** positive base delay, multiplier greater than one, attempt index, and maximum delay.
+
+**Varies (descendant territory).** base delay, multiplier, cap, jitter factor, reset boundary, and caller-owned retry budget.
+
+**Extension shape.** `DecorrelatedJitterBackoff`, `SeededExponentialBackoff`, and protocol-specific capped variants.
+
+_Note: Retry eligibility, finite budgets, and reset conditions are caller policy rather than identity requirements of the delay strategy._
+
+**Design tensions.**
+- Rapid load shedding vs recovery latency: geometric growth quickly protects a failing target but can delay useful probes.
+- Jitter vs reproducibility: randomization reduces synchronized retries but complicates deterministic schedules and tests.
+- Cap vs geometric progression: clamping is operationally necessary but ends pure exponential growth once reached.
+
+**Tradeoffs.**
+- Geometric growth buys fast contention reduction at the cost of potentially long recovery delays.
+- Optional jitter admits both decorrelated production schedules and deterministic callers, so herd prevention is not guaranteed by the child alone.
+
+**Critique (diagnostic, not contract requirements).**
+- A zero jitter factor is valid but leaves synchronized callers exposed; concurrency-heavy callers should select nonzero or decorrelated jitter.
+- The formula does not decide whether another attempt is justified. Pair it with Retry, CircuitBreaker, or another caller that owns eligibility and budget.
+- Reset policy is deliberately outside the hash; callers must make the sequence boundary explicit when state spans operations.
+
+**In the family.** A concrete child of `Backoff`, alongside future Fibonacci and feedback-adaptive strategies. Retry selects it specifically for transient failures and may use other Backoff descendants for persistent failures.
+
+**Derived from.** `Backoff`
+
+---
+
+### FailClosed#eae7
 
 `Infrastructure` · `Primitives` · R0 · T1
 
@@ -7214,7 +7269,7 @@ _Note: §3.18 moves to Infra (single-system substrate discipline). Broad-use con
 
 ---
 
-### Heartbeat#c36f
+### Heartbeat#d0e6
 
 `Infrastructure` · `Primitives` · R0 · T1
 
@@ -7337,7 +7392,7 @@ _Note: §3.18 moves to Infra (single-system substrate discipline). Broad-use con
 
 ---
 
-### IdempotentWrite#ebf5
+### IdempotentWrite#e919
 
 `Infrastructure` · `Primitives` · R0 · T1
 
@@ -7881,7 +7936,7 @@ _Note: §3.18 moves to Infra (single-system substrate discipline). Broad-use con
 
 ---
 
-### Quorum#c6a5
+### Quorum#d634
 
 `Infrastructure` · `Primitives` · R0 · T1
 
@@ -8009,7 +8064,7 @@ _Note: §3.18 moves to Infra (single-system substrate discipline). Broad-use con
 
 ---
 
-### ReAttempt#39a6
+### ReAttempt#be44
 
 `Infrastructure` · `Primitives` · R0 · T1
 
@@ -8034,7 +8089,7 @@ _Note: §3.18 moves to Infra (single-system substrate discipline). Broad-use con
 
 **Design tensions.**
 - Uncapped reattempts (named failure) vs transient recovery — without caps, amplification into DoS.
-- Missing jitter (named failure) — thundering herd on shared resources.
+- Concurrent callers vs synchronized reattempts — jitter or another decorrelation strategy belongs in the selected Backoff policy or caller.
 - Same-call semantics vs parameter variation — ReAttempt is strict same-args; Retry allows variation, and the line is easy to blur.
 
 **Tradeoffs.**
@@ -8043,7 +8098,7 @@ _Note: §3.18 moves to Infra (single-system substrate discipline). Broad-use con
 
 **Critique (diagnostic, not contract requirements).**
 - Uncapped reattempts are the dominant production failure; the pattern names the failure without prescribing caps.
-- Missing jitter is well-known; the pattern acknowledges without built-in jitter mechanism.
+- The thundering-herd risk is real, but mandatory jitter would over-specify this substrate primitive; select a jittered Backoff descendant where concurrent callers require it.
 - The ReAttempt/Retry split is subtle and often ignored; in practice callers often conflate.
 
 **In the family.** Substrate-level primitive paired with Retry (semantic variant), Backoff (the delay discipline), and CircuitBreaker (the cap). Compare with IdempotentWrite — ReAttempt makes safe retry possible (with idempotency); IdempotentWrite is the safety property.
@@ -8401,7 +8456,7 @@ _Note: §3.18 moves to Infra (single-system substrate discipline). Broad-use con
 
 ---
 
-### StateSnapshot#53b2
+### StateSnapshot#5791
 
 `Infrastructure` · `Primitives` · R0 · T1
 
@@ -8517,7 +8572,7 @@ _Note: §3.18 moves to Infra (single-system substrate discipline). Broad-use con
 
 ---
 
-### TaskLifecycle#d935
+### TaskLifecycle#3a3e
 
 `Infrastructure` · `Primitives` · R1 · T1
 
@@ -8587,7 +8642,7 @@ _Note: §3.18 moves to Infra (single-system substrate discipline). Broad-use con
 
 ---
 
-### Throttle#dc14
+### Throttle#2486
 
 `Infrastructure` · `Primitives` · R0 · T1
 
@@ -8609,7 +8664,7 @@ _Note: §3.18 moves to Infra (single-system substrate discipline). Broad-use con
 
 #### Design
 
-**Why it exists.** Rate limiting as a named primitive — bounded events per time window. Essential for API contracts, queue drainage, and load protection. Different from Backoff (per-failure exponential) and Cooldown (per-action minimum gap): Throttle bounds aggregate rate across many events.
+**Why it exists.** Rate limiting as a named primitive — bounded events per time window. Essential for API contracts, queue drainage, and load protection. Different from Backoff (failure-responsive spacing) and Cooldown (per-action minimum gap): Throttle bounds aggregate rate across many events.
 
 **Why Infrastructure.** engineered rate-limiter primitive
 
@@ -8642,14 +8697,14 @@ _Note: §3.18 moves to Infra (single-system substrate discipline). Broad-use con
 - Legitimate Denial is the dominant real issue — attack/burst distinguishability requires classifiers the pattern offloads.
 - No priority story — all throttled requests are treated equally; priority-aware throttling needs a different pattern.
 
-**In the family.** Completes the rate-control family: `Backoff` (per-retry exponential delay), `Cooldown` (per-action minimum gap), `Throttle` (rate cap per window). The three compose: a retry loop can use Backoff for delay, Cooldown for action-gap, and Throttle for global rate.
+**In the family.** Completes the rate-control family: `Backoff` (failure-responsive attempt spacing), `Cooldown` (per-action minimum gap), and `Throttle` (rate cap per window). The three compose: a retry loop can select a Backoff strategy for delay, Cooldown for action-gap, and Throttle for global rate.
 
 **Supersedes (prior versions).**
 - `Throttle#3b43`
 
 ---
 
-### TimeWarpLog#e26e
+### TimeWarpLog#2a10
 
 `Infrastructure` · `Primitives` · R0 · T1
 
@@ -8900,7 +8955,7 @@ _Note: §3.11 moves ToolInvoke from Data Structures to Primitives (it's a Verb).
 
 ---
 
-### Warmup#32d4
+### Warmup#7ad0
 
 `Infrastructure` · `Primitives` · R0 · T1
 
@@ -8967,7 +9022,7 @@ _Note: §3.11 moves ToolInvoke from Data Structures to Primitives (it's a Verb).
 
 ### Infrastructure/Verification (9)
 
-### AuditTrail#bf18
+### AuditTrail#b441
 
 `Infrastructure` · `Verification` · R1 · T1
 
@@ -9091,7 +9146,7 @@ _Note: §3.11 moves ToolInvoke from Data Structures to Primitives (it's a Verb).
 
 ---
 
-### ExplainBeacon#2e40
+### ExplainBeacon#4676
 
 `Infrastructure` · `Verification` · R1 · T2
 
@@ -9648,7 +9703,7 @@ _Note: §3.11 moves ToolInvoke from Data Structures to Primitives (it's a Verb).
 
 ---
 
-### BreadthGovernor#c7ea
+### BreadthGovernor#5e8c
 
 `Mind` · `Inference` · R2 · T2
 
@@ -9831,7 +9886,7 @@ _Note: §3.1 rename validates — the old name literally said the opposite of th
 
 ---
 
-### ContextFirst#a0b6
+### ContextFirst#7550
 
 `Mind` · `Inference` · R0 · T1
 
@@ -9958,7 +10013,7 @@ _Note: §3.20 wires callers to ContextFirst — broad-use test confirms._
 
 ---
 
-### HackDetect#b7d7
+### HackDetect#a488
 
 `Mind` · `Inference` · R2 · T1
 
@@ -10145,7 +10200,7 @@ _Note: §3.20 wires callers to ContextFirst — broad-use test confirms._
 
 ---
 
-### NormCheck#b3a0
+### NormCheck#5308
 
 `Mind` · `Inference` · R2 · T1
 
@@ -10211,7 +10266,7 @@ _Note: §3.20 wires callers to ContextFirst — broad-use test confirms._
 
 ---
 
-### NormativeJudge#bd4e
+### NormativeJudge#4b39
 
 `Mind` · `Inference` · R0 · T1
 
@@ -10342,7 +10397,7 @@ _Note: §3.20 wires callers to ContextFirst — broad-use test confirms._
 
 ---
 
-### ProphetFanOut#d47b
+### ProphetFanOut#b0f3
 
 `Mind` · `Inference` · R1 · T1
 
@@ -10406,7 +10461,7 @@ _Note: §3.20 wires callers to ContextFirst — broad-use test confirms._
 
 ---
 
-### RegimeSense#56ec
+### RegimeSense#430b
 
 `Mind` · `Inference` · R2 · T1
 
@@ -10605,7 +10660,7 @@ _Note: §3.20 wires callers to ContextFirst — broad-use test confirms._
 
 ---
 
-### SourceEvaluate#1f87
+### SourceEvaluate#f6b8
 
 `Mind` · `Inference` · R2 · T2
 
@@ -10664,7 +10719,7 @@ _Note: §3.20 wires callers to ContextFirst — broad-use test confirms._
 
 ---
 
-### SurprisalUpdate#6169
+### SurprisalUpdate#41a9
 
 `Mind` · `Inference` · R2 · T1
 
@@ -10794,7 +10849,7 @@ _Note: §3.20 wires callers to ContextFirst — broad-use test confirms._
 
 ---
 
-### TemporalEnsembleForecasting#3cb6
+### TemporalEnsembleForecasting#8b0e
 
 `Mind` · `Inference` · R2 · T2
 
@@ -10835,7 +10890,7 @@ _Note: §3.20 wires callers to ContextFirst — broad-use test confirms._
 
 ---
 
-### TruthseekingProtocol#afc1
+### TruthseekingProtocol#d35b
 
 `Mind` · `Inference` · R2 · T2
 
@@ -10878,7 +10933,7 @@ _Note: §3.20 wires callers to ContextFirst — broad-use test confirms._
 
 ### Mind/Memory (15)
 
-### BeliefTracking#6142
+### BeliefTracking#6f91
 
 `Mind` · `Memory` · R2 · T2
 
@@ -11319,7 +11374,7 @@ _Note: §3.20 wires callers to ContextFirst — broad-use test confirms._
 
 ---
 
-### LocalizedLearning#1eec
+### LocalizedLearning#1450
 
 `Mind` · `Memory` · R1 · T2
 
@@ -11490,7 +11545,7 @@ _Note: §3.20 wires callers to ContextFirst — broad-use test confirms._
 
 ---
 
-### RetrievalAugment#7ca7
+### RetrievalAugment#046a
 
 `Mind` · `Memory` · R2 · T2
 
@@ -11734,7 +11789,7 @@ _Note: §3.20 wires callers to ContextFirst — broad-use test confirms._
 
 ---
 
-### TraceBelief#bdfa
+### TraceBelief#1881
 
 `Mind` · `Memory` · R2 · T2
 
@@ -12044,7 +12099,7 @@ _Note: §3.20 wires callers to ContextFirst — broad-use test confirms._
 
 ---
 
-### CiteBack#7785
+### CiteBack#17b1
 
 `Mind` · `Reasoning` · R1 · T1
 
@@ -12177,7 +12232,7 @@ _Note: §3.20 wires callers to ContextFirst — broad-use test confirms._
 
 ---
 
-### CollaborativeWritingProtocol#8a1a
+### CollaborativeWritingProtocol#f5cb
 
 `Mind` · `Reasoning` · R2 · T2
 
@@ -12218,7 +12273,7 @@ _Note: §3.20 wires callers to ContextFirst — broad-use test confirms._
 
 ---
 
-### ConceptualDecomposition#3cf2
+### ConceptualDecomposition#2cce
 
 `Mind` · `Reasoning` · R1 · T1
 
@@ -12457,7 +12512,7 @@ _Note: §3.20 wires callers to ContextFirst — broad-use test confirms._
 
 ---
 
-### DecompositionGate#3a79
+### DecompositionGate#c4f7
 
 `Mind` · `Reasoning` · R2 · T2
 
@@ -12559,7 +12614,7 @@ _Note: §3.20 wires callers to ContextFirst — broad-use test confirms._
 
 ---
 
-### DeepResearch#a058
+### DeepResearch#e060
 
 `Mind` · `Reasoning` · R2 · T1
 
@@ -12762,7 +12817,7 @@ _Note: `DeepResearch` is Society/Protocols but is largely single-agent (or agent
 
 ---
 
-### Estimate#28d2
+### Estimate#c6d2
 
 `Mind` · `Reasoning` · R1 · T1
 
@@ -12826,7 +12881,7 @@ _Note: `DeepResearch` is Society/Protocols but is largely single-agent (or agent
 
 ---
 
-### EthicalReasoningProtocol#e3a6
+### EthicalReasoningProtocol#6bf1
 
 `Mind` · `Reasoning` · R1 · T2
 
@@ -12990,7 +13045,7 @@ _Note: `DeepResearch` is Society/Protocols but is largely single-agent (or agent
 
 ---
 
-### Fermi#128b
+### Fermi#3325
 
 `Mind` · `Reasoning` · R2 · T2
 
@@ -13105,7 +13160,7 @@ _Note: `DeepResearch` is Society/Protocols but is largely single-agent (or agent
 
 ---
 
-### FrameError#22e1
+### FrameError#f674
 
 `Mind` · `Reasoning` · R1 · T1
 
@@ -13319,7 +13374,7 @@ _Note: `DeepResearch` is Society/Protocols but is largely single-agent (or agent
 
 ---
 
-### HumanEmulatorProtocol#261f
+### HumanEmulatorProtocol#faf1
 
 `Mind` · `Reasoning` · R2 · T2
 
@@ -13663,7 +13718,7 @@ _Note: `DeepResearch` is Society/Protocols but is largely single-agent (or agent
 
 ---
 
-### MetaPrompt#db51
+### MetaPrompt#a665
 
 `Mind` · `Reasoning` · R2 · T1
 
@@ -14056,7 +14111,7 @@ _Note: §3.18 moves Society → Mind since this is single-agent cognitive hygien
 
 ---
 
-### RecursionDive#7e67
+### RecursionDive#bd13
 
 `Mind` · `Reasoning` · R2 · T1
 
@@ -14354,7 +14409,7 @@ _Note: `Reframe` pairs with `Route` in §3.14's hard-seam composition — `Gate
 
 ---
 
-### RequestFraming#8c6c
+### RequestFraming#e973
 
 `Mind` · `Reasoning` · R1 · T2
 
@@ -15688,7 +15743,7 @@ _Note: §4 of the audit flags Agent's layer placement as debatable. Broad-use sp
 
 ---
 
-### BeamSearch#fc0a
+### BeamSearch#70d3
 
 `Mind` · `Strategy` · R1 · T1
 
@@ -16015,7 +16070,7 @@ _Note: §4 of the audit flags Agent's layer placement as debatable. Broad-use sp
 
 ---
 
-### Compose#57a9
+### Compose#4fa2
 
 `Mind` · `Strategy` · R2 · T2
 
@@ -16267,7 +16322,7 @@ _Note: §4 of the audit flags Agent's layer placement as debatable. Broad-use sp
 
 ---
 
-### ContingencyPlan#c760
+### ContingencyPlan#e096
 
 `Mind` · `Strategy` · R2 · T1
 
@@ -16631,7 +16686,7 @@ _Note: §3.18 converts Creative to `is_trait: true`. Broad-use confirms — the
 
 ---
 
-### DepthGovernor#96cf
+### DepthGovernor#a3e9
 
 `Mind` · `Strategy` · R0 · T2
 
@@ -16747,7 +16802,7 @@ _Note: §3.18 converts Creative to `is_trait: true`. Broad-use confirms — the
 
 ---
 
-### DiscoveryProtocol#7ada
+### DiscoveryProtocol#9958
 
 `Mind` · `Strategy` · R2 · T2
 
@@ -17282,7 +17337,7 @@ _Note: §3.18 converts Creative to `is_trait: true`. Broad-use confirms — the
 
 ---
 
-### FractalIntelligence#5481
+### FractalIntelligence#1d79
 
 `Mind` · `Strategy` · R1 · T1
 
@@ -17761,7 +17816,7 @@ _Note: the user's v3-paper quote supersedes my earlier batch-17 sketch. FractalI
 
 ---
 
-### MarginalValueRule#eebb
+### MarginalValueRule#552f
 
 `Mind` · `Strategy` · R1 · T2
 
@@ -17962,7 +18017,7 @@ _Note: this is the economic counterpart to ComputeBudget — both stop runaway c
 
 ---
 
-### MetaProtocols#3561
+### MetaProtocols#4885
 
 `Mind` · `Strategy` · R2 · T2
 
@@ -18125,7 +18180,7 @@ _Note: this is the economic counterpart to ComputeBudget — both stop runaway c
 
 ---
 
-### OODA#c15f
+### OODA#2ba0
 
 `Mind` · `Strategy` · R1 · T2
 
@@ -18441,7 +18496,7 @@ _Note: this is the economic counterpart to ComputeBudget — both stop runaway c
 
 ---
 
-### PUREBrainstorming#9ba1
+### PUREBrainstorming#c03a
 
 `Mind` · `Strategy` · R1 · T2
 
@@ -18550,7 +18605,7 @@ _Note: this is the economic counterpart to ComputeBudget — both stop runaway c
 
 ---
 
-### PUREOptimization#89fe
+### PUREOptimization#3d63
 
 `Mind` · `Strategy` · R2 · T2
 
@@ -18805,7 +18860,7 @@ _Note: this is the economic counterpart to ComputeBudget — both stop runaway c
 
 ---
 
-### PolymorphicSolver#272a
+### PolymorphicSolver#3653
 
 `Mind` · `Strategy` · R1 · T1
 
@@ -18985,7 +19040,7 @@ _Note: this is the economic counterpart to ComputeBudget — both stop runaway c
 
 ---
 
-### ProblemFramer#2718
+### ProblemFramer#ea80
 
 `Mind` · `Strategy` · R2 · T2
 
@@ -19276,7 +19331,7 @@ _Note: this is the economic counterpart to ComputeBudget — both stop runaway c
 
 ---
 
-### Retry#79b6
+### Retry#9e17
 
 `Mind` · `Strategy` · R1 · T1
 
@@ -19284,7 +19339,7 @@ _Note: this is the economic counterpart to ComputeBudget — both stop runaway c
 
 **Mechanism.**
 
-> Intelligent re-attempt of failed coordination with failure-informed strategy. After BREAK + COMPENSATE, agent evaluates: (1) CLASSIFY failure—transient (timeout, rate-limit, network blip) vs persistent (capability gap, protocol mismatch, explicit rejection). (2) CHECK retry_hint from BREAK (partner may say 'don't retry' or 'wait 30s'). (3) CONSULT failure_history—same error repeating? {{circuit_breaker}} threshold reached? (4) COMPUTE backoff—adaptive based on failure type: transient uses exponential+jitter, persistent uses longer fixed delay or triggers abort. (5) VERIFY changed_conditions—has something changed that makes retry worthwhile? (6) EXECUTE retry if within budget and conditions favor success, else ABORT with retry_exhausted status. Retry CARRIES FORWARD: failure context, partner state observations, environmental data. Retry RESETS: coordination state (fresh start, don't resume mid-stream). It handles transient failures by re-queuing the task, distinguishing them from terminal failures that trigger {{break}} and {{compensate}}.
+> Intelligent re-attempt of failed coordination with failure-informed strategy. After BREAK + COMPENSATE, agent evaluates: (1) CLASSIFY failure—transient (timeout, rate-limit, network blip) vs persistent (capability gap, protocol mismatch, explicit rejection). (2) CHECK retry_hint from BREAK (partner may say 'don't retry' or 'wait 30s'). (3) CONSULT failure_history—same error repeating? {{circuit_breaker}} threshold reached? (4) COMPUTE {{backoff}}—adaptive based on failure type: transient uses {{exponential_backoff}}, persistent uses longer fixed delay or triggers abort. (5) VERIFY changed_conditions—has something changed that makes retry worthwhile? (6) EXECUTE retry if within budget and conditions favor success, else ABORT with retry_exhausted status. Retry CARRIES FORWARD: failure context, partner state observations, environmental data. Retry RESETS: coordination state (fresh start, don't resume mid-stream). It handles transient failures by re-queuing the task, distinguishing them from terminal failures that trigger {{break}} and {{compensate}}.
 
 **Invariants.**
 - {{backoff}} applied
@@ -19323,7 +19378,7 @@ _Note: this is the economic counterpart to ComputeBudget — both stop runaway c
 
 **Varies (descendant territory).** classification taxonomy (transient/persistent specifics), budget, circuit-breaker integration, retry-hint protocol, jitter strategy.
 
-**Extension shape.** `ExponentialRetry`, `JitteredRetry`, `BudgetedRetry`, `ClassifiedRetry`. The substrate-level "try same thing again" moves to `ReAttempt` in Physics/Primitives (§3.2).
+**Extension shape.** `JitteredRetry`, `BudgetedRetry`, `ClassifiedRetry`. The transient branch composes with `ExponentialBackoff`; the substrate-level "try same thing again" moves to `ReAttempt` in Physics/Primitives (§3.2).
 
 **Design tensions.**
 - Classification quality vs speed — classifying failures accurately requires work; cheap classification is often wrong.
@@ -19339,15 +19394,16 @@ _Note: this is the economic counterpart to ComputeBudget — both stop runaway c
 - Misclassifying transient as persistent (gives up too soon) is the dual failure.
 - Backoff calibration is caller-dependent and frequently wrong.
 
-**In the family.** Resilience primitive paired with Backoff (the delay discipline), ReAttempt (substrate-level), and CircuitBreaker (the cap). Compare with Compensate — Retry attempts the same operation; Compensate unwinds the failed one.
+**In the family.** Resilience primitive paired with Backoff (the delay-policy family), ExponentialBackoff (the transient-failure strategy), ReAttempt (substrate-level), and CircuitBreaker (the cap). Compare with Compensate — Retry attempts the same operation; Compensate unwinds the failed one.
 
 **Supersedes (prior versions).**
 - `Retry#d53d`
 - `Retry#07b7`
+- `Retry#79b6`
 
 ---
 
-### RigorousSolver#b75d
+### RigorousSolver#70d4
 
 `Mind` · `Strategy` · R2 · T2
 
@@ -19458,7 +19514,7 @@ _Note: this is the economic counterpart to ComputeBudget — both stop runaway c
 
 ---
 
-### RootSolver#6d0d
+### RootSolver#750d
 
 `Mind` · `Strategy` · R1 · T1
 
@@ -19750,7 +19806,7 @@ _Note: this is the economic counterpart to ComputeBudget — both stop runaway c
 
 ---
 
-### Solver#04b5
+### Solver#b7f9
 
 `Mind` · `Strategy` · R0 · T0
 
@@ -19984,7 +20040,7 @@ _Note: this is the economic counterpart to ComputeBudget — both stop runaway c
 
 ---
 
-### TensionHold#b084
+### TensionHold#326b
 
 `Mind` · `Strategy` · R2 · T2
 
@@ -20352,7 +20408,7 @@ _Note: this is the economic counterpart to ComputeBudget — both stop runaway c
 
 ### Society/Coordination (12)
 
-### Compromise#228b
+### Compromise#e980
 
 `Society` · `Coordination` · R1 · T2
 
@@ -20403,7 +20459,7 @@ _Note: this is the economic counterpart to ComputeBudget — both stop runaway c
 
 ---
 
-### Consensus#45f4
+### Consensus#0526
 
 `Society` · `Coordination` · R0 · T1
 
@@ -20476,7 +20532,7 @@ _Note: this is the economic counterpart to ComputeBudget — both stop runaway c
 
 ---
 
-### ConsensusFinder#980a
+### ConsensusFinder#6535
 
 `Society` · `Coordination` · R1 · T2
 
@@ -20534,7 +20590,7 @@ _Note: this is the economic counterpart to ComputeBudget — both stop runaway c
 
 ---
 
-### Delegate#78a8
+### Delegate#2d38
 
 `Society` · `Coordination` · R1 · T2
 
@@ -20608,7 +20664,7 @@ _Note: this is the economic counterpart to ComputeBudget — both stop runaway c
 
 ---
 
-### Disband#9953
+### Disband#d5f8
 
 `Society` · `Coordination` · R1 · T1
 
@@ -20679,7 +20735,7 @@ _Note: this is the economic counterpart to ComputeBudget — both stop runaway c
 
 ---
 
-### Elect#45ff
+### Elect#187a
 
 `Society` · `Coordination` · R2 · T1
 
@@ -20808,7 +20864,7 @@ _Note: this is the economic counterpart to ComputeBudget — both stop runaway c
 
 ---
 
-### LazyConsensus#cb1b
+### LazyConsensus#1c07
 
 `Society` · `Coordination` · R0 · T2
 
@@ -20945,7 +21001,7 @@ _Note: this is the economic counterpart to ComputeBudget — both stop runaway c
 
 ---
 
-### Rally#48a0
+### Rally#bc5f
 
 `Society` · `Coordination` · R1 · T2
 
@@ -21087,7 +21143,7 @@ _Note: this is the economic counterpart to ComputeBudget — both stop runaway c
 
 ---
 
-### Vote#3b66
+### Vote#0aff
 
 `Society` · `Coordination` · R2 · T2
 
@@ -21153,7 +21209,7 @@ _Note: this is the economic counterpart to ComputeBudget — both stop runaway c
 
 ### Society/Economics (10)
 
-### AtomicBid#33e1
+### AtomicBid#9c0c
 
 `Society` · `Economics` · R1 · T2
 
@@ -21214,7 +21270,7 @@ _Note: this is the economic counterpart to ComputeBudget — both stop runaway c
 
 ---
 
-### AttentionMarkets#787e
+### AttentionMarkets#faf8
 
 `Society` · `Economics` · R1 · T1
 
@@ -21285,7 +21341,7 @@ _Note: this is the economic counterpart to ComputeBudget — both stop runaway c
 
 ---
 
-### Award#af8e
+### Award#6e69
 
 `Society` · `Economics` · R1 · T1
 
@@ -21343,7 +21399,7 @@ _Note: this is the economic counterpart to ComputeBudget — both stop runaway c
 
 ---
 
-### Bid#5c45
+### Bid#1eba
 
 `Society` · `Economics` · R1 · T1
 
@@ -21407,7 +21463,7 @@ _Note: this is the economic counterpart to ComputeBudget — both stop runaway c
 
 ---
 
-### ContinuousResourceAuction#1553
+### ContinuousResourceAuction#8fe2
 
 `Society` · `Economics` · R1 · T1
 
@@ -21525,7 +21581,7 @@ _Note: this is the economic counterpart to ComputeBudget — both stop runaway c
 
 ---
 
-### Gardener#52f3
+### Gardener#3e18
 
 `Society` · `Economics` · R2 · T2
 
@@ -21708,15 +21764,15 @@ _Note: this is the economic counterpart to ComputeBudget — both stop runaway c
 
 ---
 
-### Yield#d802
+### Yield#d665
 
 `Society` · `Economics` · R1 · T2
 
-**Gloss.** Weighted negotiation backoff with deferred debt ledger
+**Gloss.** Weighted negotiation concession with deferred debt ledger
 
 **Mechanism.**
 
-> Negotiation {{backoff}}. When `{{overlap}}` fails: 1. Agents declare 'Flex' (concession) and 'Weight' (importance). 2. {{system}} computes Yield-Ratio. 3. Lower-weighted preference cedes to higher. 4. Debt recorded in Ledger. Utilizes {{defer}}.
+> Negotiation concession. When `{{overlap}}` fails: 1. Agents declare 'Flex' (concession) and 'Weight' (importance). 2. {{system}} computes Yield-Ratio. 3. Lower-weighted preference cedes to higher. 4. Debt recorded in Ledger. Utilizes {{defer}}.
 
 **Invariants.**
 - Yielder cannot reclaim.
@@ -21729,13 +21785,13 @@ _Note: this is the economic counterpart to ComputeBudget — both stop runaway c
 
 #### Design
 
-**Why it exists.** When Overlap fails, explicit concession with weighted importance resolves. Yield names this structured backoff. Without the pattern, negotiation stalls.
+**Why it exists.** When Overlap fails, explicit concession with weighted importance resolves. Yield names this structured concession. Without the pattern, negotiation stalls.
 
-**Why Society.** weighted-negotiation backoff
+**Why Society.** weighted negotiation concession
 
 **Can it be removed?** Removable — other negotiation patterns work. The Flex/Weight declaration is the key discipline.
 
-**Intended use.** negotiation backoff on Overlap failure — lower-weighted preference cedes.
+**Intended use.** negotiation concession on Overlap failure — lower-weighted preference cedes.
 
 **Future uses.** any weighted-concession-and-debt-ledger mechanism.
 
@@ -21753,7 +21809,7 @@ _Note: this is the economic counterpart to ComputeBudget — both stop runaway c
 - Hard constraints indistinguishable from strategic intransigence.
 
 **Tradeoffs.**
-- Gains: structured negotiation backoff.
+- Gains: structured negotiation concession.
 - Gives up: simplicity.
 
 **Critique (diagnostic, not contract requirements).**
@@ -21765,12 +21821,13 @@ _Note: this is the economic counterpart to ComputeBudget — both stop runaway c
 
 **Supersedes (prior versions).**
 - `Yield#7eaf`
+- `Yield#d802`
 
 ---
 
 ### Society/Governance (8)
 
-### AnchorDrop#695e
+### AnchorDrop#4196
 
 `Society` · `Governance` · R0 · T1
 
@@ -21893,7 +21950,7 @@ _Note: §3.19 flagged AnchorDrop as having no current callers in the library. Br
 
 ---
 
-### DocumentedOverride#4054
+### DocumentedOverride#17d3
 
 `Society` · `Governance` · R1 · T2
 
@@ -21940,7 +21997,7 @@ _Note: §3.19 flagged AnchorDrop as having no current callers in the library. Br
 
 ---
 
-### Responsibility#8cf5
+### Responsibility#67f5
 
 `Society` · `Governance` · R1 · T1
 
@@ -22010,7 +22067,7 @@ _Note: §3.19 flagged AnchorDrop as having no current callers in the library. Br
 
 ---
 
-### Role#3152
+### Role#9b2c
 
 `Society` · `Governance` · R1 · T1
 
@@ -22063,7 +22120,7 @@ _Note: §3.19 flagged AnchorDrop as having no current callers in the library. Br
 
 ---
 
-### SolverTree#2e4c
+### SolverTree#0c3f
 
 `Society` · `Governance` · R1 · T1
 
@@ -22126,7 +22183,7 @@ _Note: §3.19 flagged AnchorDrop as having no current callers in the library. Br
 
 ---
 
-### UniversalSolverTree#7361
+### UniversalSolverTree#0923
 
 `Society` · `Governance` · R1 · T1
 
@@ -22189,7 +22246,7 @@ _Note: §3.19 flagged AnchorDrop as having no current callers in the library. Br
 
 ---
 
-### WorldTransparent#8440
+### WorldTransparent#4a70
 
 `Society` · `Governance` · R2 · T1
 
@@ -22394,7 +22451,7 @@ _Note: §3.19 flagged AnchorDrop as having no current callers in the library. Br
 
 ---
 
-### AgentProtocol#e6b4
+### AgentProtocol#6297
 
 `Society` · `Protocols` · R1 · T2
 
@@ -22520,7 +22577,7 @@ _Note: §3.19 flagged AnchorDrop as having no current callers in the library. Br
 
 ---
 
-### AmbiguityResolution#4c6b
+### AmbiguityResolution#ede0
 
 `Society` · `Protocols` · R1 · T2
 
@@ -22936,7 +22993,7 @@ _Note: OAuth RFC 6750 defines bearer semantics by possession, while RFC 7662 exp
 
 ---
 
-### CounterfactualAnchor#e7ac
+### CounterfactualAnchor#0d2b
 
 `Society` · `Protocols` · R1 · T2
 
@@ -23074,7 +23131,7 @@ _Note: OAuth RFC 6750 defines bearer semantics by possession, while RFC 7662 exp
 
 ---
 
-### DeliberativeAlign#9fd3
+### DeliberativeAlign#1cf2
 
 `Society` · `Protocols` · R2 · T2
 
@@ -23143,7 +23200,7 @@ _Note: OAuth RFC 6750 defines bearer semantics by possession, while RFC 7662 exp
 
 ---
 
-### Deploy#1119
+### Deploy#9af9
 
 `Society` · `Protocols` · R1 · T1
 
@@ -23251,7 +23308,7 @@ _Note: OAuth RFC 6750 defines bearer semantics by possession, while RFC 7662 exp
 
 ---
 
-### DissentSeek#ce78
+### DissentSeek#8378
 
 `Society` · `Protocols` · R2 · T1
 
@@ -23445,7 +23502,7 @@ _Note: OAuth RFC 6750 defines bearer semantics by possession, while RFC 7662 exp
 
 ---
 
-### EjectionSeat#a164
+### EjectionSeat#e836
 
 `Society` · `Protocols` · R0 · T1
 
@@ -23746,7 +23803,7 @@ _Note: OAuth RFC 6750 defines bearer semantics by possession, while RFC 7662 exp
 
 ---
 
-### GenealogicalTrace#fa22
+### GenealogicalTrace#142e
 
 `Society` · `Protocols` · R2 · T2
 
@@ -23910,7 +23967,7 @@ _Note: §3.18 converts to `is_trait: true`. Broad-use confirms — Global is a m
 
 ---
 
-### GracefulDegradation#8436
+### GracefulDegradation#1a82
 
 `Society` · `Protocols` · R0 · T1
 
@@ -23977,7 +24034,7 @@ _Note: §3.18 converts to `is_trait: true`. Broad-use confirms — Global is a m
 
 ---
 
-### Handoff#4e0f
+### Handoff#d0e8
 
 `Society` · `Protocols` · R1 · T1
 
@@ -24047,7 +24104,7 @@ _Note: §3.18 converts to `is_trait: true`. Broad-use confirms — Global is a m
 
 ---
 
-### HeldRelease#533b
+### HeldRelease#10b0
 
 `Society` · `Protocols` · R0 · T1
 
@@ -24303,7 +24360,7 @@ _Note: §3.18 converts to `is_trait: true`. Broad-use confirms — Global is a m
 
 ---
 
-### LatticeCommit#74db
+### LatticeCommit#6675
 
 `Society` · `Protocols` · R2 · T1
 
@@ -24366,7 +24423,7 @@ _Note: §3.18 converts to `is_trait: true`. Broad-use confirms — Global is a m
 
 ---
 
-### MemeticSeed#cf26
+### MemeticSeed#d351
 
 `Society` · `Protocols` · R1 · T1
 
@@ -24496,7 +24553,7 @@ _Note: interesting economic pattern — "standards are adopted not because they
 
 ---
 
-### MonotonicCounter#21c6
+### MonotonicCounter#3382
 
 `Society` · `Protocols` · R0 · T1
 
@@ -24561,7 +24618,7 @@ _Note: interesting economic pattern — "standards are adopted not because they
 
 ---
 
-### Nucleate#457a
+### Nucleate#3763
 
 `Society` · `Protocols` · R1 · T1
 
@@ -24629,7 +24686,7 @@ _Note: interesting economic pattern — "standards are adopted not because they
 
 ---
 
-### OptimisticSolver#18c0
+### OptimisticSolver#a96f
 
 `Society` · `Protocols` · R1 · T2
 
@@ -24699,7 +24756,7 @@ _Note: §3.14's layer retention is confirmed by broad-use — every legitimate c
 
 ---
 
-### Oracle#32ff
+### Oracle#5614
 
 `Society` · `Protocols` · R1 · T1
 
@@ -24755,7 +24812,7 @@ _Note: §3.14's layer retention is confirmed by broad-use — every legitimate c
 
 ---
 
-### OrchestrationLoop#156f
+### OrchestrationLoop#2128
 
 `Society` · `Protocols` · R1 · T2
 
@@ -25200,7 +25257,7 @@ _Note: §3.14's layer retention is confirmed by broad-use — every legitimate c
 
 ---
 
-### PromptChain#2543
+### PromptChain#5097
 
 `Society` · `Protocols` · R0 · T2
 
@@ -25260,7 +25317,7 @@ _Note: §3.14's layer retention is confirmed by broad-use — every legitimate c
 
 ---
 
-### PropheticQuorum#1091
+### PropheticQuorum#912b
 
 `Society` · `Protocols` · R1 · T1
 
@@ -25323,7 +25380,7 @@ _Note: §3.14's layer retention is confirmed by broad-use — every legitimate c
 
 ---
 
-### QuorumPulse#809c
+### QuorumPulse#2fc2
 
 `Society` · `Protocols` · R2 · T1
 
@@ -25389,7 +25446,7 @@ _Note: §3.14's layer retention is confirmed by broad-use — every legitimate c
 
 ---
 
-### RealizationProtocol#663b
+### RealizationProtocol#b4ce
 
 `Society` · `Protocols` · R1 · T2
 
@@ -25624,7 +25681,7 @@ _Note: §3.14's layer retention is confirmed by broad-use — every legitimate c
 
 ---
 
-### Rollout#8fc1
+### Rollout#84e2
 
 `Society` · `Protocols` · R1 · T1
 
@@ -25959,7 +26016,7 @@ _Note: §3.14's layer retention is confirmed by broad-use — every legitimate c
 
 ---
 
-### SolverNode#fd50
+### SolverNode#4529
 
 `Society` · `Protocols` · R1 · T1
 
@@ -26140,7 +26197,7 @@ _Note: SomaticMarker's mechanism "utilizes Task" is an odd wiring claim — Task
 
 ---
 
-### StateLock#7cd8
+### StateLock#8bde
 
 `Society` · `Protocols` · R0 · T1
 
@@ -26171,9 +26228,9 @@ _Note: SomaticMarker's mechanism "utilizes Task" is an odd wiring claim — Task
 
 **Broad-use contexts.** two-phase commit, escrow key pairs, multi-signature wallets, joint-authorship protocols, collaborative editing locks, diplomatic joint statements.
 
-**Broad-use intersection (review hypothesis).** state subset, two (or more) actors, temporary fusion, both-sign-to-write, Backoff/Cooldown on contention.
+**Broad-use intersection (review hypothesis).** state subset, two actors, temporary fusion, both-sign-to-write, and a contention response.
 
-**Varies (descendant territory).** multi-party extension, timeout policy, revocation.
+**Varies (descendant territory).** selected Backoff policy, multi-party extension, timeout policy, and revocation.
 
 **Extension shape.** `TwoPhaseStateLock`, `MultisigStateLock`, `DiplomaticStateLock`.
 
@@ -26188,15 +26245,16 @@ _Note: SomaticMarker's mechanism "utilizes Task" is an odd wiring claim — Task
 - Backoff+Cooldown composition buys contention handling at the cost of lock-family dependency — StateLock doesn't stand alone operationally.
 
 **Critique (diagnostic, not contract requirements).**
-- Zero invariants listed. For a pattern that carries atomicity semantics, this is a significant gap — at minimum: Both-Signed (changes require both sigs), Symmetric (neither party has unilateral release), Auto-Dissolve-On-Timeout, Signature-Integrity (sigs bind to the specific state subset).
-- The three failure modes are correct but partial — missing: Key Compromise (one party's signing key stolen mid-lock), Sig Replay (old signature reused against new state), State-Scope Drift (the 'subset of writable state' changes meaning mid-lock).
+- Atomicity obligations currently live in the mechanism rather than a separate invariant list. Any future contract should first prove that it holds across every two-party StateLock context rather than treating field count as the defect.
+- Key compromise, signature replay, and state-scope drift are relevant diagnostics for cryptographic deployments, but their mitigations depend on identity and storage descendants rather than belonging automatically in the broad parent hash.
 - 'Temporary fusion' is evocative but operationally vague. What counts as fusion? Is it a third-party escrow? A merged state object? A shared access-control list? The pattern is underdetermined — implementers will pick different mechanisms that claim to be the same pattern.
 
-**In the family.** The two-party cross-actor specialization of the Lock family, placed in Society because the mechanism structurally requires a counterparty. Pairs with `Backoff` and `Cooldown` for contention behavior and with `AtomicBid` for multi-agent coordination. Where `Mutex` is one-holder exclusion, `StateLock` is two-party agreement.
+**In the family.** The two-party cross-actor specialization of the Lock family, placed in Society because the mechanism structurally requires a counterparty. Pairs with a selected `Backoff` policy and `Cooldown` for contention behavior, and with `AtomicBid` for multi-agent coordination. Where `Mutex` is one-holder exclusion, `StateLock` is two-party agreement.
 
 **Supersedes (prior versions).**
 - `StateLock#774b`
 - `StateLock#b91b`
+- `StateLock#7cd8`
 
 ---
 
@@ -26320,7 +26378,7 @@ _Note: SomaticMarker's mechanism "utilizes Task" is an odd wiring claim — Task
 
 ---
 
-### SynergisticMode#02f9
+### SynergisticMode#2463
 
 `Society` · `Protocols` · R2 · T2
 
@@ -26380,7 +26438,7 @@ _Note: SomaticMarker's mechanism "utilizes Task" is an odd wiring claim — Task
 
 ---
 
-### Taper#83db
+### Taper#8dc5
 
 `Society` · `Protocols` · R1 · T1
 
@@ -26439,7 +26497,7 @@ _Note: SomaticMarker's mechanism "utilizes Task" is an odd wiring claim — Task
 
 ---
 
-### ThreeLevelCollision#f9f9
+### ThreeLevelCollision#92b1
 
 `Society` · `Protocols` · R2 · T1
 
@@ -26572,7 +26630,7 @@ _Note: SomaticMarker's mechanism "utilizes Task" is an odd wiring claim — Task
 
 ---
 
-### ToolDiscovery#4b60
+### ToolDiscovery#bf67
 
 `Society` · `Protocols` · R1 · T1
 
@@ -26711,7 +26769,7 @@ _Note: SomaticMarker's mechanism "utilizes Task" is an odd wiring claim — Task
 
 ---
 
-### UniqueHandle#88da
+### UniqueHandle#58f9
 
 `Society` · `Protocols` · R0 · T1
 
@@ -26905,7 +26963,7 @@ _Note: SomaticMarker's mechanism "utilizes Task" is an odd wiring claim — Task
 
 ---
 
-### WorkerMode#5a39
+### WorkerMode#fa5a
 
 `Society` · `Protocols` · R2 · T1
 
@@ -26975,7 +27033,7 @@ _Note: SomaticMarker's mechanism "utilizes Task" is an odd wiring claim — Task
 
 ---
 
-### Workflow#6de0
+### Workflow#982b
 
 `Society` · `Protocols` · R0 · T1
 
diff --git a/docs/specification/versioning.md b/docs/specification/versioning.md
index 79b448cb..c7857f67 100644
--- a/docs/specification/versioning.md
+++ b/docs/specification/versioning.md
@@ -67,9 +67,9 @@ Two things are true at once:
 ## 4. `sema_handshake` semantics across versions
 
 `sema_handshake` is strict by design: it verifies byte-level agreement
-on a specific definition. Agents that pin to `PropheticQuorum#1091`
+on a specific definition. Agents that pin to `PropheticQuorum#912b`
 continue to resolve that exact definition forever, even if a newer
-`PropheticQuorum#1091` exists.
+`PropheticQuorum#912b` exists.
 
 Agents that want "the latest PropheticQuorum" query the bare handle,
 get back whichever hash is current, and *then* handshake against that
@@ -101,9 +101,9 @@ breaking lookups by hash.
 
 ## 6. Short stubs identify versions, not handles
 
-A 4-hex stub like `PropheticQuorum#1091` identifies one specific
+A 4-hex stub like `PropheticQuorum#912b` identifies one specific
 version of a handle. When the handle is refined, the new version gets
-a different stub: `PropheticQuorum#1091`. Stubs are therefore
+a different stub: `PropheticQuorum#912b`. Stubs are therefore
 **version-identifying**, not handle-identifying.
 
 This is a feature, not a quirk. It lets prose distinguish
diff --git a/docs/tools/cli.md b/docs/tools/cli.md
index aab59150..04c087e6 100644
--- a/docs/tools/cli.md
+++ b/docs/tools/cli.md
@@ -157,7 +157,7 @@ read-path for "give me the definition behind this inline ref."
 
 ```bash
 sema show <Handle>
-sema show 'StateLock#7cd8'
+sema show 'StateLock#8bde'
 ```
 
 ### skeleton - Graph Overview
diff --git a/install.md b/install.md
index d7b5f9f7..5d355a42 100644
--- a/install.md
+++ b/install.md
@@ -7,7 +7,7 @@ github: https://github.com/emergent-wisdom/sema
 
 # Install Sema
 
-Sema is a growing vocabulary of cognitive patterns with cryptographic identity. Each pattern has a handle (e.g. `StateLock#7cd8`) that is a hash of its definition — two agents using the same handle are provably talking about the same thing.
+Sema is a growing vocabulary of cognitive patterns with cryptographic identity. Each pattern has a handle (e.g. `StateLock#8bde`) that is a hash of its definition — two agents using the same handle are provably talking about the same thing.
 
 Referencing a pattern is not authorization to perform the actions it describes. Patterns are definitions, not permissions.
 
@@ -38,7 +38,7 @@ Ask your agent:
 
 > Search sema for coordination patterns
 
-You should see results like `Consensus#45f4`, `Vote#3b66`, `StateLock#7cd8`.
+You should see results like `Consensus#0526`, `Vote#0aff`, `StateLock#8bde`.
 
 ## Tools available
 
@@ -60,7 +60,7 @@ You should see results like `Consensus#45f4`, `Vote#3b66`, `StateLock#7cd8`.
 
 Sema handles are thinking tools, not footnotes:
 
-> "This uses `StateLock#7cd8` to prevent concurrent mutation"
+> "This uses `StateLock#8bde` to prevent concurrent mutation"
 
 > "Apply `Decompose#63f3` first, then `Prioritize#8028` the subproblems"
 
diff --git a/paper/generated_appendix.tex b/paper/generated_appendix.tex
index 8aadf7ce..ceedede2 100644
--- a/paper/generated_appendix.tex
+++ b/paper/generated_appendix.tex
@@ -1,4 +1,4 @@
-The 452 patterns are organized into 12 category names across 13 layer-category paths and 4 fundamental layers:
+The 453 patterns are organized into 12 category names across 13 layer-category paths and 4 fundamental layers:
 
 \paragraph{Physics Layer (17 patterns)} The immutable substrate.
 \begin{itemize}
@@ -6,10 +6,10 @@
     \item \textbf{Time} (1): CausalBarrier.
 \end{itemize}
 
-\paragraph{Infrastructure Layer (151 patterns)} Operational constraints.
+\paragraph{Infrastructure Layer (152 patterns)} Operational constraints.
 \begin{itemize}
     \item \textbf{Data Structures} (93): AcceptSpec, Aesthetics, Anomaly, Artifact, Assessment, Assumption, Audit, Ballot, Belief, Boolean, Break, Cache, Card, Category, Chain, CognitiveBias, ConceptAnchor, Condition, Constraint, Context, Contract, Correlation, Criteria, Cyclic, DAG, Datum, Decision, Event, Exception, ExecutionManifest, FailureTrace, Forest, FrameSpec, Goal, Hierarchy, Hypothesis, Identity, Ledger, MECE, MechanisticDesignProposal, Message, Meta, Metric, Mode, Nature, Option, Outcome, Overlap, Parallel, PerformanceSignal, Permission, Plan, Probability, Problem, ProblemSpace, Prompt, Proposal, ProtoPack, Protocol, Prototype, Queue, Resource, Result, Risk, RolloutManifest, RuleSet, Score, ScoringFunction, Sequence, Shard, Signal, Skeleton, Snapshot, Solution, SolverManifest, Spec, State, Status, Step, Stream, StyleSpec, Subject, Summary, System, Task, Tension, Topology, Transition, Tree, Value, Variable, Vector, Work.
-    \item \textbf{Primitives} (49): Act, Actor, Aggregate, Backoff, Branch, Budget, Care, Check, CircuitBreaker, Combine, Compare, Compensate, Compress, Cooldown, EntropyPump, FailClosed, Feedback, FeedbackSignal, Gate, Greet, Heartbeat, Hysteresis, IdempotentWrite, Incongruity, Judge, Loop, Monitor, MonitorReport, NegativeProof, Observe, Probe, Quorum, Rank, ReAttempt, Route, Sandbox, Search, Select, Sign, StateAudit, StateSnapshot, StateTransition, TaskLifecycle, Throttle, TimeWarpLog, ToolInvoke, Trace, TriGate, Warmup.
+    \item \textbf{Primitives} (50): Act, Actor, Aggregate, Backoff, Branch, Budget, Care, Check, CircuitBreaker, Combine, Compare, Compensate, Compress, Cooldown, EntropyPump, ExponentialBackoff, FailClosed, Feedback, FeedbackSignal, Gate, Greet, Heartbeat, Hysteresis, IdempotentWrite, Incongruity, Judge, Loop, Monitor, MonitorReport, NegativeProof, Observe, Probe, Quorum, Rank, ReAttempt, Route, Sandbox, Search, Select, Sign, StateAudit, StateSnapshot, StateTransition, TaskLifecycle, Throttle, TimeWarpLog, ToolInvoke, Trace, TriGate, Warmup.
     \item \textbf{Verification} (9): AuditTrail, CompatibilityCheck, ExplainBeacon, HumanApprove, InputGuard, OathBind, OutputGuard, SpotAudit, Validate.
 \end{itemize}
 
diff --git a/paper/generated_pattern_cards.tex b/paper/generated_pattern_cards.tex
index f95d8486..4f97f199 100644
--- a/paper/generated_pattern_cards.tex
+++ b/paper/generated_pattern_cards.tex
@@ -6,15 +6,17 @@
 Only semantic fields are included---these are the exact fields that produce the Merkle root hash.
 Metadata fields (\texttt{handle}, \texttt{\_meta}, \texttt{tier}, etc.) are \emph{not} part of the hash.
 
-\subsection{sema:StateLock\#mh:SHA-256:7cd86a9de68522b752366ef04de32f743b57ef16232866522ccdafb1f35c6da9}
+\subsection{sema:StateLock\#mh:SHA-256:8bde7c49752578e5c76e46d33b995497728f486d69d99ff618b9dbeaa7586c78}
 
 \begin{lstlisting}
 {
   "dependencies": {
+    "composes_with": {
+      "backoff": "sema:Backoff#mh:SHA-256:9e59718422f5408d7892feccb6d538a21103f9573b122b891ee3c8cf66303e72",
+      "cooldown": "sema:Cooldown#mh:SHA-256:6f56ea214e52eab81c0592d4b17ed3da9dc6cbcf3a496a512088c9bc63006f3b"
+    },
     "references": {
       "actor": "sema:Actor#mh:SHA-256:1ecd855bdf9fc33f99840af8b53729d917355fb151d36ff21947885fac5c5907",
-      "backoff": "sema:Backoff#mh:SHA-256:16c2d636281df44ed78ef3bce341e7a349fd37cbd675706e2e395172c1dccae6",
-      "cooldown": "sema:Cooldown#mh:SHA-256:878c03997b0670f8f217d6f26b6d2a583d15bf11e702346b4e317827dc7cb687",
       "lock": "sema:Lock#mh:SHA-256:95c2ee952a5301d4b346a5e8693350829d88b3c600048eedcf87bb00c23ee5fb",
       "state": "sema:State#mh:SHA-256:4f25e6a16ccd37dc0bc154cccc7055cb504d49daa8b712f372a425eb6c7b8cb2"
     }
@@ -32,21 +34,21 @@ \subsection{sema:StateLock\#mh:SHA-256:7cd86a9de68522b752366ef04de32f743b57ef162
 }
 \end{lstlisting}
 
-\subsection{sema:FractalIntelligence\#mh:SHA-256:54810782124d5c716d1204d83ed1c40a16d66201c884c5e70473623898b4b40d}
+\subsection{sema:FractalIntelligence\#mh:SHA-256:1d79fe6b35dc95d7c11f8ca7d105e73e9b7d318a30d3d27b9cccae4330ef1076}
 
 \begin{lstlisting}
 {
   "dependencies": {
     "composes_with": {
-      "conceptual_decomposition": "sema:ConceptualDecomposition#mh:SHA-256:3cf20e30a632b0a7ab64a7fb2984fe64b106ba7819af458fa5e260aa89853b1d",
-      "localized_learning": "sema:LocalizedLearning#mh:SHA-256:1eec33d8fc081000b2c5927b7cfc2d4e6a8835fc9e0d46e051bb7ee34541cbdf",
-      "marginal_value_rule": "sema:MarginalValueRule#mh:SHA-256:eebb10656ec6d554fa7bba3a98b2b9ba1207d58b31d0a794563605595af0f026",
-      "polymorphic_solver": "sema:PolymorphicSolver#mh:SHA-256:272ac4237fd71c0782676ed30558bad9c08fca9373577516284bf5def22b2800",
-      "problem_framer": "sema:ProblemFramer#mh:SHA-256:271894d4cdcba54a6c1f4c85f1983d05f86c18c7b12948ef19619addebc4a70f",
+      "conceptual_decomposition": "sema:ConceptualDecomposition#mh:SHA-256:2cce877b501c3fe1fdf646e3c5ad3157b26502b7a6f7c943dfff389c055aa25a",
+      "localized_learning": "sema:LocalizedLearning#mh:SHA-256:14502d62b7a331dbcb80bfdf6ab07f911cfb94b80788933e83119d787ec4fe37",
+      "marginal_value_rule": "sema:MarginalValueRule#mh:SHA-256:552ffce38f8fecae07f9faf905f0662ed284531904a94d55da19030138ff941d",
+      "polymorphic_solver": "sema:PolymorphicSolver#mh:SHA-256:3653f233738b26efaa02e0750c25ee0e743a32e0bce28afafde84b74f42b87f7",
+      "problem_framer": "sema:ProblemFramer#mh:SHA-256:ea80628660b357af41d6877843b44f7898d1677171c0a13c5e258d59639469f1",
       "reason": "sema:Reason#mh:SHA-256:c2f279f6def8869e4a54ce61f4cd8b646eaeb6dbaea89c7d9dfd05c6c2bb78ed",
-      "recursion_dive": "sema:RecursionDive#mh:SHA-256:7e67260837bfb3fd46b514f9ddfe0b6e6f62657e8af2a626a14e29f77ada285d",
+      "recursion_dive": "sema:RecursionDive#mh:SHA-256:bd1380babbca57f5f1a00721f887c9ecf6fff48d73302a28e735d956134b4921",
       "reframe": "sema:Reframe#mh:SHA-256:573733f86a965e0db34ce77c54bada908c9561248a7d5a9b76652dba71e1565a",
-      "state_snapshot": "sema:StateSnapshot#mh:SHA-256:53b2f1c57a571f308d8ce1686edf0fbbbc178bf35d96b2a445bcebeda01208aa",
+      "state_snapshot": "sema:StateSnapshot#mh:SHA-256:5791e43fad7e1f42cb7451eec53c6bfa9fef567b30a14d05be269116203e5848",
       "synthesis": "sema:Synthesis#mh:SHA-256:46b9ca1ae3a7711fc932ec43d901d25ef27b7c60c8f64f6fef818eec2027f6ea"
     },
     "references": {
@@ -57,7 +59,7 @@ \subsection{sema:FractalIntelligence\#mh:SHA-256:54810782124d5c716d1204d83ed1c40
       "strategy": "sema:Strategy#mh:SHA-256:0f2fcc85aff835c79ab80064df1655f8707bc5c80bbde7c3e1a2ba672a9cd49c",
       "system": "sema:System#mh:SHA-256:f8eb318a1113a10fead02fbf14ae433767ac1a69c9579cdb584cc622068e90b3",
       "task": "sema:Task#mh:SHA-256:f239278f610adea7e01a9fd019dc6be158a31919d61d301856dcbe2aa8b67804",
-      "universal_solver_tree": "sema:UniversalSolverTree#mh:SHA-256:7361e8ea2303b8cd0970fe167548cbf9c86f7f418f175424906f563db22729ae"
+      "universal_solver_tree": "sema:UniversalSolverTree#mh:SHA-256:0923a89effa56135175d1404578641c31d6f2d63716745aba054d7143ad0d6f9"
     }
   },
   "signature": [
@@ -181,7 +183,7 @@ \subsection{sema:SteelmanCheck\#mh:SHA-256:9c861bd1b525f9671144191592f0f8d963331
 }
 \end{lstlisting}
 
-\subsection{sema:OptimisticSolver\#mh:SHA-256:18c043757659c13a56ceab6640765f6ecf4e24a9cfffc6cdf9e6ccf7f05c2e77}
+\subsection{sema:OptimisticSolver\#mh:SHA-256:a96fd56ca17c012b3ee75a4a37061e2592ed742cd75175540537b5fb68136880}
 
 \textbf{Note}: This pattern was downgraded to \textbf{Tier~2} following adversarial analysis.
 
@@ -190,16 +192,16 @@ \subsection{sema:OptimisticSolver\#mh:SHA-256:18c043757659c13a56ceab6640765f6ecf
 {
   "dependencies": {
     "composes_with": {
-      "atomic_bid": "sema:AtomicBid#mh:SHA-256:33e1d5689a56922e56ffedb768c82621a62e207160fc4f97228e5dddac588d65",
-      "compensate": "sema:Compensate#mh:SHA-256:9b3b07b7a02d00b6df1ecc3ee69fa3dcd2b33e07f045c67f26deb6cf311694f2",
+      "atomic_bid": "sema:AtomicBid#mh:SHA-256:9c0c78d25ef587cbb5802e4e9243055062fa27a45f30d46896d464c840a35fcd",
+      "compensate": "sema:Compensate#mh:SHA-256:e23bc7c0d3825460855e7ee5e2e41f512ff8e318ad741b1ba4e0303cb66e39b9",
       "compute_budget": "sema:ComputeBudget#mh:SHA-256:47c6eb12f7537f418cdfa9358a501b394d3b4460dd2f8c85560687b1e782b8c2",
       "pathway_memory": "sema:PathwayMemory#mh:SHA-256:b6a0e82ce9362d546f5ac2da3610ced5e67a516f67fa0756aa90051a74180b82",
       "reflexion": "sema:Reflexion#mh:SHA-256:4a467a44a1172f5d7d2119e3a4c3646e36a5f8dea4cdca2fa85bea6f92619d83"
     },
     "references": {
       "parallel": "sema:Parallel#mh:SHA-256:e799c1986d62c4a052090842aabe144193587f8a4d8dd23617d027b2e9b85098",
-      "polymorphic_solver": "sema:PolymorphicSolver#mh:SHA-256:272ac4237fd71c0782676ed30558bad9c08fca9373577516284bf5def22b2800",
-      "rigorous_solver": "sema:RigorousSolver#mh:SHA-256:b75d4b063fc8f90f4a1361ef08c8dac02fbf147f0c8f122ca390fdbde74d39cd"
+      "polymorphic_solver": "sema:PolymorphicSolver#mh:SHA-256:3653f233738b26efaa02e0750c25ee0e743a32e0bce28afafde84b74f42b87f7",
+      "rigorous_solver": "sema:RigorousSolver#mh:SHA-256:70d41b35ddab10c9575b6feed8022935cb266f3d81fce659cfb6b8b9c2d4dc94"
     }
   },
   "mechanism": "A high-velocity implementation of {{polymorphic_solver}} designed for efficient multi-agent coordination. Requires a {{parallel}} runtime (Actor Model with Mailboxes) to prevent serial deadlock. It explicitly couples the standard Solver lifecycle (Reason -> Solution) with the {{atomic_bid}} protocol. Unlike the base abstraction, this pattern MANDATES that the agent plan and execute in a single turn. It relies on {{reflexion}} and {{compensate}} for error correction rather than pre-action permission. Use {{compute_budget}} to bound resource consumption. Contrast with {{rigorous_solver}} which prioritizes safety over speed. A {{pathway_memory}} accumulates across runs so the optimistic route-selection converges on strategies that historically succeeded under similar conditions.",
diff --git a/paper/generated_stats.tex b/paper/generated_stats.tex
index 706e2571..7a21eecc 100644
--- a/paper/generated_stats.tex
+++ b/paper/generated_stats.tex
@@ -1,9 +1,9 @@
 % Auto-generated stats from calculate_graph_stats.py
-\newcommand{\semaPatternCount}{452}
-\newcommand{\semaTotalNodes}{2,949}
-\newcommand{\semaTotalEdges}{4,103}
+\newcommand{\semaPatternCount}{453}
+\newcommand{\semaTotalNodes}{2,954}
+\newcommand{\semaTotalEdges}{4,108}
 \newcommand{\semaAvgEdges}{9.1}
-\newcommand{\semaInvariantCount}{820}
+\newcommand{\semaInvariantCount}{821}
 \newcommand{\semaPrinciplesCount}{554}
 \newcommand{\semaPatternsWithInvariants}{372}
 \newcommand{\semaInvariantPct}{82\%}
@@ -15,12 +15,12 @@
 \newcommand{\semaIOPct}{17\%}
 \newcommand{\semaPatternsWithParams}{94}
 \newcommand{\semaParamPct}{20\%}
-\newcommand{\semaPatternsWithCompose}{85}
-\newcommand{\semaComposePct}{18\%}
-\newcommand{\semaTotalParams}{186}
-\newcommand{\semaTierOneCount}{312}
+\newcommand{\semaPatternsWithCompose}{87}
+\newcommand{\semaComposePct}{19\%}
+\newcommand{\semaTotalParams}{187}
+\newcommand{\semaTierOneCount}{313}
 \newcommand{\semaCategoryCount}{12}
-\newcommand{\semaCompStateLockStub}{7cd8}
+\newcommand{\semaCompStateLockStub}{8bde}
 \newcommand{\semaCompStateLockRef}{6}
 \newcommand{\semaCompStateLockFull}{89}
 \newcommand{\semaCompStateLockRatio}{14.8}
@@ -43,32 +43,32 @@
 \newcommand{\semaLayerCompPhysicsRef}{5.4}
 \newcommand{\semaLayerCompPhysicsFull}{145.0}
 \newcommand{\semaLayerCompPhysicsRatio}{27.1}
-\newcommand{\semaLayerCompInfrastructureCount}{151}
+\newcommand{\semaLayerCompInfrastructureCount}{152}
 \newcommand{\semaLayerCompInfrastructureRef}{5.0}
-\newcommand{\semaLayerCompInfrastructureFull}{93.8}
+\newcommand{\semaLayerCompInfrastructureFull}{94.1}
 \newcommand{\semaLayerCompInfrastructureRatio}{18.8}
 \newcommand{\semaLayerCompMindCount}{178}
 \newcommand{\semaLayerCompMindRef}{6.4}
 \newcommand{\semaLayerCompMindFull}{149.8}
-\newcommand{\semaLayerCompMindRatio}{23.4}
+\newcommand{\semaLayerCompMindRatio}{23.5}
 \newcommand{\semaLayerCompSocietyCount}{106}
-\newcommand{\semaLayerCompSocietyRef}{6.3}
-\newcommand{\semaLayerCompSocietyFull}{152.9}
-\newcommand{\semaLayerCompSocietyRatio}{24.2}
+\newcommand{\semaLayerCompSocietyRef}{6.4}
+\newcommand{\semaLayerCompSocietyFull}{152.8}
+\newcommand{\semaLayerCompSocietyRatio}{24.0}
 \newcommand{\semaLibCompRef}{5.9}
 \newcommand{\semaLibCompFull}{131.6}
 \newcommand{\semaLibCompRatio}{22.4}
-\newcommand{\semaNodeEmbeddingCount}{452}
-\newcommand{\semaEmbPairs}{101,926}
+\newcommand{\semaNodeEmbeddingCount}{453}
+\newcommand{\semaEmbPairs}{102,378}
 \newcommand{\semaEmbMean}{0.21}
 \newcommand{\semaEmbMax}{0.83}
-\newcommand{\semaEmbBinA}{81,876}
+\newcommand{\semaEmbBinA}{82,241}
 \newcommand{\semaEmbBinAPct}{80.3\%}
-\newcommand{\semaEmbBinB}{17,758}
+\newcommand{\semaEmbBinB}{17,814}
 \newcommand{\semaEmbBinBPct}{17.4\%}
-\newcommand{\semaEmbBinC}{698}
+\newcommand{\semaEmbBinC}{703}
 \newcommand{\semaEmbBinCPct}{0.7\%}
-\newcommand{\semaEmbBinD}{20}
+\newcommand{\semaEmbBinD}{21}
 \newcommand{\semaEmbBinDPct}{0.0\%}
-\newcommand{\semaEmbHighPairs}{20}
+\newcommand{\semaEmbHighPairs}{21}
 \newcommand{\semaEmbHighPairPct}{0.0\%}
diff --git a/paper/generated_table_rows.tex b/paper/generated_table_rows.tex
index d67cdbeb..ac75fc91 100644
--- a/paper/generated_table_rows.tex
+++ b/paper/generated_table_rows.tex
@@ -4,7 +4,7 @@
 \midrule
 \multirow{3}{*}{Infrastructure}
 & Data Structures & 93 & AcceptSpec, Aesthetics, Anomaly \\
-& Primitives & 49 & Act, Actor, Aggregate \\
+& Primitives & 50 & Act, Actor, Aggregate \\
 & Verification & 9 & AuditTrail, CompatibilityCheck, ExplainBeacon \\
 \midrule
 \multirow{4}{*}{Mind}
@@ -19,4 +19,4 @@
 & Governance & 8 & AnchorDrop, Constitution, DocumentedOverride \\
 & Protocols & 76 & AdversarialProof, AgentDiscover, AgentProtocol \\
 \midrule
-& \textbf{Total} & \textbf{452} & \\
+& \textbf{Total} & \textbf{453} & \\
diff --git a/paper/sema.pdf b/paper/sema.pdf
index 8a3a09bb..fc5fe826 100644
Binary files a/paper/sema.pdf and b/paper/sema.pdf differ
diff --git a/paper/sema.tex b/paper/sema.tex
index e5654665..8735acfb 100644
--- a/paper/sema.tex
+++ b/paper/sema.tex
@@ -79,12 +79,12 @@ \section{Introduction}
 
 \item[The Trust Problem.] Traditional ontologies like RDF or OWL implicitly assume a ``God's eye view'' shared by honest actors---a fatal assumption in the adversarial context of open agent swarms.
 
-\item[The Granularity Problem.] A generic report that ``the coordination failed'' provides no diagnostic utility, whereas ``the Lock Invariant in \sema{StateLock}{7cd8} was violated at $t=3.2$s'' isolates the exact failure mode. Human natural language evolved for humans; autonomous systems require a vocabulary layer designed specifically for agents.
+\item[The Granularity Problem.] A generic report that ``the coordination failed'' provides no diagnostic utility, whereas ``the Lock Invariant in \sema{StateLock}{8bde} was violated at $t=3.2$s'' isolates the exact failure mode. Human natural language evolved for humans; autonomous systems require a vocabulary layer designed specifically for agents.
 \end{description}
 
-Sema\footnote{The name ``Sema'' (Greek \textit{s\={e}ma}, ``sign'') was chosen in December 2025. An unrelated system also named SEMA~\cite{feng2026sema}, addressing multi-turn jailbreak attacks on LLMs, appeared at ICLR 2026. The two systems share only the acronym; they operate at different layers (meaning verification vs.\ attack methodology) and are not in conflict.} assumes a low-trust environment where agents may hallucinate, drift, or actively deceive, replacing the ``Library Catalog'' model of ontology with a ``Constitution for a Digital City'' that employs primitives like \sema{LatticeCommit}{74db} and \sema{ReceptivityGate}{2709} to enforce integrity.
+Sema\footnote{The name ``Sema'' (Greek \textit{s\={e}ma}, ``sign'') was chosen in December 2025. An unrelated system also named SEMA~\cite{feng2026sema}, addressing multi-turn jailbreak attacks on LLMs, appeared at ICLR 2026. The two systems share only the acronym; they operate at different layers (meaning verification vs.\ attack methodology) and are not in conflict.} assumes a low-trust environment where agents may hallucinate, drift, or actively deceive, replacing the ``Library Catalog'' model of ontology with a ``Constitution for a Digital City'' that employs primitives like \sema{LatticeCommit}{6675} and \sema{ReceptivityGate}{2709} to enforce integrity.
 
-The core insight of the proposed solution lies not merely in content-addressing definitions---a technique with precedent in Hawke's Semantic Definition Hash~\cite{sdh2002}, Git, IPFS~\cite{benet2014ipfs}, and Unison~\cite{chiusano2024unison}---but in making the resulting hash \emph{function as a word in natural language}. In every prior content-addressing system, the hash lives in an infrastructure layer separate from communication: Git hashes are plumbing, IPFS hashes are file addresses, SDH produced URIs for RDF triples. Sema inverts this. By expressing a behavioral specification---invariants, preconditions, failure modes, typed dependencies---in a canonical form and hashing it, the resulting identifier becomes a token that agents embed directly in the natural language they already think in. An agent writes: ``I \sema{Delegate}{78a8} this \sema{Task}{f239} to you, expecting a \sema{Solution}{4844} that satisfies this \sema{AcceptSpec}{c156}.'' Each anchored term is simultaneously a word and a cryptographic proof. Because changing a single byte in any definition produces a different hash, any divergence in meaning produces a different identifier, revealing misalignment before it causes system failures (Figure~\ref{fig:pipeline}).\footnote{Large context windows ($>1$M tokens) do not subsume this mechanism: long contexts suffer from ``Lost in the Middle'' attention degradation, and two agents both holding a full definition in context still have no way to prove they hold the \emph{same} one. Sema hashes act as attention anchors and as cross-agent equality proofs that a shared window cannot provide.} This architecture represents content-addressing dissolved into language:
+The core insight of the proposed solution lies not merely in content-addressing definitions---a technique with precedent in Hawke's Semantic Definition Hash~\cite{sdh2002}, Git, IPFS~\cite{benet2014ipfs}, and Unison~\cite{chiusano2024unison}---but in making the resulting hash \emph{function as a word in natural language}. In every prior content-addressing system, the hash lives in an infrastructure layer separate from communication: Git hashes are plumbing, IPFS hashes are file addresses, SDH produced URIs for RDF triples. Sema inverts this. By expressing a behavioral specification---invariants, preconditions, failure modes, typed dependencies---in a canonical form and hashing it, the resulting identifier becomes a token that agents embed directly in the natural language they already think in. An agent writes: ``I \sema{Delegate}{2d38} this \sema{Task}{f239} to you, expecting a \sema{Solution}{4844} that satisfies this \sema{AcceptSpec}{c156}.'' Each anchored term is simultaneously a word and a cryptographic proof. Because changing a single byte in any definition produces a different hash, any divergence in meaning produces a different identifier, revealing misalignment before it causes system failures (Figure~\ref{fig:pipeline}).\footnote{Large context windows ($>1$M tokens) do not subsume this mechanism: long contexts suffer from ``Lost in the Middle'' attention degradation, and two agents both holding a full definition in context still have no way to prove they hold the \emph{same} one. Sema hashes act as attention anchors and as cross-agent equality proofs that a shared window cannot provide.} This architecture represents content-addressing dissolved into language:
 
 \begin{equation}
 \text{word} = \hash(\text{canonical}(\text{definition}))
@@ -102,7 +102,7 @@ \section{Introduction}
     \node[box] (def) {\textbf{Definition}\\ \textit{\scriptsize"Atomic..."}};
     \node[box, right=of def] (canon) {\textbf{Canonical}\\ \texttt{\scriptsize\{"handle"...\}}};
     \node[box, right=of canon] (hash) {\textbf{SHA-256}\\ \texttt{\scriptsize a2ec7c...}};
-    \node[box, fill=semagreen!10, draw=semagreen, right=of hash] (id) {\textbf{Identifier}\\ \texttt{\scriptsize StateLock\#7cd8}};
+    \node[box, fill=semagreen!10, draw=semagreen, right=of hash] (id) {\textbf{Identifier}\\ \texttt{\scriptsize StateLock\#8bde}};
 
     \draw[arrow] (def) -- node[above, font=\scriptsize] {Normalize} (canon);
     \draw[arrow] (canon) -- node[above, font=\scriptsize] {Hash} (hash);
@@ -155,7 +155,7 @@ \subsection{Cryptographic Foundation}
 
 The current implementation uses canonicalization v2 (semahash 0.3.0), which domain-separates every Merkle node with an explicit type tag. Strings are hashed as $\text{SHA-256}(\mathrm{s:} \| \text{NFC}(\text{collapsed text}))$; primitive JSON values as $\text{SHA-256}(\mathrm{p:} \| \text{canonical JSON})$; lists as $\text{SHA-256}(\mathrm{l:} \| H(L_1) \| H(L_2) \| \dots)$; and dictionaries as $\text{SHA-256}(\mathrm{d:} \| H(k_1) \| H(v_1) \| \dots)$, with entries sorted by normalized key and with normalized-key collisions rejected fail-closed. Dependency maps receive one additional canonicalization step: aliases are normalized through their target handles, and multiple aliases that intentionally reference the same handle are preserved as a sorted list rather than silently collapsed. These tags prevent structurally distinct JSON values---for example the string \texttt{"1"} and the number \texttt{1}, or a two-element list and a one-entry dictionary---from sharing the same hash input.
 
-This structure guarantees that every field has a unique hash, enabling partial alignment: agents can negotiate agreement on specific terms, such as the invariants list, even if they disagree on the full pattern definition. As a concrete example, suppose Agent~A and Agent~B both reference \sema{StateLock}{7cd8} but their pattern roots disagree. Field-level hash comparison reveals their \texttt{invariants} hashes match (both agree the lock must be exclusive and auto-release on timeout) while their \texttt{failure\_modes} hashes diverge (A's pattern enumerates network partition as a recoverable failure; B's treats it as terminal). The two agents can safely coordinate on operations that depend only on the invariants---both agree the held-by-one-party guarantee holds---while halting before any joint recovery action that depends on the disputed failure semantics. Whole-document hashes (SDH, Agora, BlockA2A) collapse this to a single binary mismatch and force a full re-negotiation; Sema's Merkle structure preserves the granularity that makes selective coordination possible.
+This structure guarantees that every field has a unique hash, enabling partial alignment: agents can negotiate agreement on specific terms, such as the invariants list, even if they disagree on the full pattern definition. As a concrete example, suppose Agent~A and Agent~B both reference \sema{StateLock}{8bde} but their pattern roots disagree. Field-level hash comparison reveals their \texttt{invariants} hashes match (both agree the lock must be exclusive and auto-release on timeout) while their \texttt{failure\_modes} hashes diverge (A's pattern enumerates network partition as a recoverable failure; B's treats it as terminal). The two agents can safely coordinate on operations that depend only on the invariants---both agree the held-by-one-party guarantee holds---while halting before any joint recovery action that depends on the disputed failure semantics. Whole-document hashes (SDH, Agora, BlockA2A) collapse this to a single binary mismatch and force a full re-negotiation; Sema's Merkle structure preserves the granularity that makes selective coordination possible.
 
 Crucially, the system excludes metadata from identity. The \texttt{\_meta} object, containing fields like \texttt{path} (an ordered list of taxonomy segments such as \texttt{["Society", "Governance"]}), \texttt{tier}, \texttt{ring}, and \texttt{related}, is excluded from the hash calculation. This design prevents rigid taxonomies by separating two fundamentally different concerns: the mechanism (what a pattern does) is mathematics, immutable and hashed, while the taxonomy (where it belongs) is politics, mutable metadata subject to community consensus. This separation allows the community to reorganize categories, for instance by downgrading a pattern from Tier~1 to Tier~2 upon discovery of a vulnerability, without breaking the code of agents that rely on the pattern's hash; the identifier \sema{BayesUpdate}{3d1b} remains valid even if its classification changes. The pattern identity is computed from eleven semantic fields:
 
@@ -179,13 +179,13 @@ \subsection{Cryptographic Foundation}
 \end{tabular}
 \end{center}
 
-Fields not hashed include \texttt{handle}, \texttt{\_meta}, and any \texttt{sema\_*} fields, ensuring that renaming or reclassifying a pattern does not alter its cryptographic identity. For human readability, prose references use a 4-character stub of the root hash, such as \sema{PropheticQuorum}{1091}; full dependency fields and security-sensitive handshakes retain or resolve the full hash or compare a vocabulary root. To ensure that logic remains stable even when dependencies evolve, Sema employs a template hashing strategy where the mechanism uses local placeholders like \texttt{\{\{hypothesis\}\}} representing the pure algorithm, while the wiring maps these placeholders to specific hashes in the \texttt{dependencies} object. The Pattern Identity is the Merkle Root of both, allowing the system to distinguish between a logic change and a dependency update, enabling agents to detect semantic equivalence where two agents share the same logic but use different library versions.
+Fields not hashed include \texttt{handle}, \texttt{\_meta}, and any \texttt{sema\_*} fields, ensuring that renaming or reclassifying a pattern does not alter its cryptographic identity. For human readability, prose references use a 4-character stub of the root hash, such as \sema{PropheticQuorum}{912b}; full dependency fields and security-sensitive handshakes retain or resolve the full hash or compare a vocabulary root. To ensure that logic remains stable even when dependencies evolve, Sema employs a template hashing strategy where the mechanism uses local placeholders like \texttt{\{\{hypothesis\}\}} representing the pure algorithm, while the wiring maps these placeholders to specific hashes in the \texttt{dependencies} object. The Pattern Identity is the Merkle Root of both, allowing the system to distinguish between a logic change and a dependency update, enabling agents to detect semantic equivalence where two agents share the same logic but use different library versions.
 
 \subsection{Discovery and Pattern Cards}
 \label{sec:discovery_loop}
 \label{sec:pattern_cards}
 
-A robust semantic system must reconcile two opposing needs: discovery, which benefits from ambiguity and high recall, and coordination, which requires precision and zero ambiguity. Sema resolves this via \emph{progressive ambiguity collapse}, formalized as the \sema{Taper}{83db} pattern, where the discovery lifecycle follows a strict sequence of decreasing entropy. First, in the \emph{Orient} phase, the agent queries the topology via \texttt{sema\_graph\_skeleton()} to obtain a low-resolution map of regions and hubs. Next, during \emph{Explore}, the agent performs a hybrid search merging field-weighted keyword matches (handle: 1.0, signature: 0.75, gloss: 0.70, mechanism: 0.55) with vector embeddings (Score 0.3--0.7). This strategy mirrors Blended RAG~\cite{sawarkar2024blended}, merging keyword precision with semantic recall~\cite{arivazhagan2023}. However, reliance on fuzzy search alone is hazardous; audits of encyclopedic search engines reveal that they frequently surface content only ``weakly related'' to the query~\cite{coppolillo2025unexpected}. This hybrid strategy allows ``fuzzy'' intent (e.g., ``how to handle errors'') to find precise patterns (e.g., \sema{Retry}{79b6}), but necessitates the subsequent verification step. Finally, in the \emph{Verify} phase, the agent locks the definition via \texttt{sema\_handshake()}, where the tolerance for ambiguity drops to zero and cryptographic hashes must match exactly. This pipeline allows agents to navigate with ``vibes'' (semantic similarity) but coordinate with ``proofs'' (hash equality).
+A robust semantic system must reconcile two opposing needs: discovery, which benefits from ambiguity and high recall, and coordination, which requires precision and zero ambiguity. Sema resolves this via \emph{progressive ambiguity collapse}, formalized as the \sema{Taper}{8dc5} pattern, where the discovery lifecycle follows a strict sequence of decreasing entropy. First, in the \emph{Orient} phase, the agent queries the topology via \texttt{sema\_graph\_skeleton()} to obtain a low-resolution map of regions and hubs. Next, during \emph{Explore}, the agent performs a hybrid search merging field-weighted keyword matches (handle: 1.0, signature: 0.75, gloss: 0.70, mechanism: 0.55) with vector embeddings (Score 0.3--0.7). This strategy mirrors Blended RAG~\cite{sawarkar2024blended}, merging keyword precision with semantic recall~\cite{arivazhagan2023}. However, reliance on fuzzy search alone is hazardous; audits of encyclopedic search engines reveal that they frequently surface content only ``weakly related'' to the query~\cite{coppolillo2025unexpected}. This hybrid strategy allows ``fuzzy'' intent (e.g., ``how to handle errors'') to find precise patterns (e.g., \sema{Retry}{9e17}), but necessitates the subsequent verification step. Finally, in the \emph{Verify} phase, the agent locks the definition via \texttt{sema\_handshake()}, where the tolerance for ambiguity drops to zero and cryptographic hashes must match exactly. This pipeline allows agents to navigate with ``vibes'' (semantic similarity) but coordinate with ``proofs'' (hash equality).
 
 \begin{figure}[h]
 \centering
@@ -216,7 +216,7 @@ \subsection{Discovery and Pattern Cards}
 \label{fig:anatomy}
 \end{figure}
 
-A Sema Pattern is not merely a dictionary definition; it is an executable specification (Figure~\ref{fig:anatomy}). The use of preconditions, postconditions, and invariants as machine-verifiable contracts builds on a lineage of structured LLM frameworks---notably DSPy Signatures~\cite{khattab2024dspy}, DSPy Assertions~\cite{singhvi2024dspy}, and the Prompt Pattern Catalog~\cite{white2023prompt}---which introduced contract-like constraints for language model pipelines. Sema's contribution is to make these contracts \emph{hashable}: by including them in the Merkle root, contract equivalence becomes verifiable via $O(1)$ hash comparison. We selected a specific set of fields to transform vocabulary from \emph{Passive Knowledge} into \emph{Active Constraints}, as illustrated by the schema for \sema{PropheticQuorum}{1091}:
+A Sema Pattern is not merely a dictionary definition; it is an executable specification (Figure~\ref{fig:anatomy}). The use of preconditions, postconditions, and invariants as machine-verifiable contracts builds on a lineage of structured LLM frameworks---notably DSPy Signatures~\cite{khattab2024dspy}, DSPy Assertions~\cite{singhvi2024dspy}, and the Prompt Pattern Catalog~\cite{white2023prompt}---which introduced contract-like constraints for language model pipelines. Sema's contribution is to make these contracts \emph{hashable}: by including them in the Merkle root, contract equivalence becomes verifiable via $O(1)$ hash comparison. We selected a specific set of fields to transform vocabulary from \emph{Passive Knowledge} into \emph{Active Constraints}, as illustrated by the schema for \sema{PropheticQuorum}{912b}:
 
 \begin{description}
     \item[Dependencies (The Imports)]
@@ -226,7 +226,7 @@ \subsection{Discovery and Pattern Cards}
 "dependencies": {
   "composes_with": {
     "sim": "sema:Simulation#mh:SHA-256:ebb11496dccf2bb9e9f483633e9fa618751af7dddcd5d6f8d0377e8d74b7aacf",
-    "vote": "sema:Vote#mh:SHA-256:3b66510363464c335c95a843247ddd37bbb98616a17f6a8d4bb17b1ac91bd41c"
+    "vote": "sema:Vote#mh:SHA-256:0affbbc722d42218027f581176be08d0a66c9a3dc99adbf94d411ef9fc38786c"
   },
   "accepts": {
     "proposal": "sema:Proposal#mh:SHA-256:5e96c86b24df6ee2910c5d4c8cc75531e10e402d2867bb68ed5dc04606e538f4"
@@ -356,13 +356,13 @@ \subsection{The Type System}
 readers interested in how Sema handles polymorphism, composition, and wiring
 across \semaPatternCount{}~patterns should continue here.
 
-A central tension in vocabulary design is determining when a change in attributes constitutes a change in identity. The bootstrap library adopts a structural resolution: qualitative differences create distinct patterns, while quantitative differences create parameters with hashed range contracts. For example, \sema{Backoff}{16c2} with a \texttt{base\_delay} of 100ms and the same pattern with a 5-second delay share the same semantic identity because the hash captures the parameter range contract, not the instance value. However, if changing a variable alters the failure mode, such as switching from busy-waiting to database storage, it becomes a distinct pattern (e.g., \texttt{SpinLock} vs. \texttt{Lease}). This allows the runtime to validate instantiation values against the hashed range contract while preserving the conceptual unity of the pattern.
+A central tension in vocabulary design is determining when a change in attributes constitutes a change in identity. The bootstrap library adopts a structural resolution: qualitative differences create distinct patterns, while quantitative differences create parameters with hashed range contracts. For example, \sema{ExponentialBackoff}{a543} with a \texttt{base\_delay} of 100ms and the same pattern with a 5-second delay share the same semantic identity because the hash captures the parameter range contract, not the instance value. However, if changing a variable alters the failure mode, such as switching from busy-waiting to database storage, it becomes a distinct pattern (e.g., \texttt{SpinLock} vs. \texttt{Lease}). This allows the runtime to validate instantiation values against the hashed range contract while preserving the conceptual unity of the pattern.
 
 To enable infinite reuse without recreating the API chaos of traditional systems, Sema employs Typed Interfaces rather than named fields. The \texttt{dependencies} object is strictly partitioned into four mutually exclusive categories, creating a directed acyclic graph (DAG): \texttt{accepts} defines passive input data patterns consumed by the mechanism; \texttt{yields} defines passive output data patterns produced by the mechanism; \texttt{composes\_with} defines active tool or logic patterns explicitly invoked by the mechanism; and \texttt{references} defines patterns used for conceptual clarity but not execution. This partitioning enforces a ``Single Source of Truth'' where every semantic link lives in exactly one place, and decouples verbs from specific noun instances. A LogisticsAgent locking a shipping container and a MedicalDrone locking a patient record both invoke the same pattern because both subjects satisfy the \texttt{accepts} interface (e.g., \texttt{"accepts": \{ "subject": "sema:UniqueHandle..." \}}). Variable names are irrelevant; type compatibility is everything. This architecture ensures that the \semaPatternCount~core patterns can be composed into infinite variations, as agents from different domains can coordinate verbs simply by sharing common noun definitions.
 
 The integrity of these compositions is enforced by the Explicit Wiring Rule, which welds the abstract type to the concrete logic. The compiler mandates that every element in a pattern's \texttt{signature} (the claim, e.g., \texttt{Check(Safety)}) must be explicitly imported in the \texttt{dependencies} and invoked in the pattern's text fields (mechanism, invariants, preconditions, postconditions, or failure modes) via a template key. This renders ``Phantom Signatures'' impossible to pass through the Sema Compiler; an agent cannot claim to implement a capability unless it cryptographically links to the specific pattern in its mechanism.
 
-The Sema Compiler resolves these high-level intents into executable low-level handles. When an agent executes a polymorphic intent such as \texttt{Deep(Discover)}, the compiler queries the vocabulary graph for a pattern declaring that signature (e.g., \sema{DeepResearch}{a058}) and resolves the dependency chain. This compilation step decouples intent from implementation, allowing the system to upgrade the underlying algorithms, such as swapping a heuristic check for a rigorous crypto-audit, without altering the agent's cognitive script.
+The Sema Compiler resolves these high-level intents into executable low-level handles. When an agent executes a polymorphic intent such as \texttt{Deep(Discover)}, the compiler queries the vocabulary graph for a pattern declaring that signature (e.g., \sema{DeepResearch}{e060}) and resolves the dependency chain. This compilation step decouples intent from implementation, allowing the system to upgrade the underlying algorithms, such as swapping a heuristic check for a rigorous crypto-audit, without altering the agent's cognitive script.
 
 \begin{table}[h]
 \centering
@@ -372,8 +372,8 @@ \subsection{The Type System}
 \toprule
 \textbf{Intent (Query)} & \textbf{Source Pattern (Fast)} & \textbf{Resolved Target (Slow)} \\ \midrule
 \texttt{Deep(Heuristic)} & \sema{HeuristicSnap}{bd4b} & \sema{MentalSim}{2874} \\
-\texttt{Deep(Trace)} & \sema{Trace}{314d} & \sema{GenealogicalTrace}{fa22} \\
-\texttt{Deep(Discover)} & \sema{Discover}{8895} & \sema{DeepResearch}{a058} \\
+\texttt{Deep(Trace)} & \sema{Trace}{314d} & \sema{GenealogicalTrace}{142e} \\
+\texttt{Deep(Discover)} & \sema{Discover}{8895} & \sema{DeepResearch}{e060} \\
 \texttt{Deep(Nature)} & \sema{Nature}{4a31} & \sema{LivedProof}{6422} \\ \bottomrule
 \end{tabular}
 \end{table}
@@ -382,7 +382,7 @@ \subsection{The Type System}
 \begin{equation}
 \text{Prompt} = \text{System} \oplus \text{Hydrate}(\text{Patterns}) \oplus \text{Query}
 \end{equation}
-What is novel is that the \emph{wire-level token} is simultaneously a readable handle (\texttt{PropheticQuorum\#1091}) and a pointer into a cryptographically verifiable definition space: the hydration step is itself content-addressed (different bytes on the wire $\rightarrow$ different lookup $\rightarrow$ detectably different definition injected), so any divergence between what the sender thought they said and what the receiver thought they heard surfaces as a hash mismatch rather than as a silent misinterpretation. Unlike Git hashes (infrastructure plumbing invisible to developers), IPFS hashes (file addresses), or SDH URIs (formal graph references), Sema identifiers are words in the medium communication already uses---each carrying integrity that is syntactic for the reader (the 4-char stub reads fluently) and cryptographic for the runtime (hydration is checked against full hashes or agreed roots). There is no serialization boundary between communication and verification. We accept the token tax in the context window to gain that safety on the wire.
+What is novel is that the \emph{wire-level token} is simultaneously a readable handle (\texttt{PropheticQuorum\#912b}) and a pointer into a cryptographically verifiable definition space: the hydration step is itself content-addressed (different bytes on the wire $\rightarrow$ different lookup $\rightarrow$ detectably different definition injected), so any divergence between what the sender thought they said and what the receiver thought they heard surfaces as a hash mismatch rather than as a silent misinterpretation. Unlike Git hashes (infrastructure plumbing invisible to developers), IPFS hashes (file addresses), or SDH URIs (formal graph references), Sema identifiers are words in the medium communication already uses---each carrying integrity that is syntactic for the reader (the 4-char stub reads fluently) and cryptographic for the runtime (hydration is checked against full hashes or agreed roots). There is no serialization boundary between communication and verification. We accept the token tax in the context window to gain that safety on the wire.
 
 %==============================================================================
 \section{The Bootstrap Library}
@@ -415,7 +415,7 @@ \subsection{Methodology}
 
 Minting is gated by two criteria. A concept earns a pattern if it requires
 \emph{protocol consistency}---multiple agents must coordinate on the exact
-semantics, as with \sema{StateLock}{7cd8}---or if specifying it produces
+semantics, as with \sema{StateLock}{8bde}---or if specifying it produces
 \emph{structured thinking}, forcing a loosely used English concept into an
 invariant-bearing mechanism. English suffices when neither criterion is met.
 Pattern \emph{generality} is then checked by a broad-use test: the mechanism and
@@ -436,7 +436,7 @@ \subsection{Methodology}
 
 \subsection{The Civilization Stack}
 
-The vocabulary is not a flat list; it is structured into four fundamental layers mimicking a civilization stack. At the base lies \textbf{Physics}, substrate primitives that obtain regardless of any author: thermodynamics of coordination that cannot be ``wished away'' (e.g., \sema{Mutex}{58ba}, \sema{Entropy}{323f}, and recently-added substrate concepts \sema{Gradient}{dcf0}, \sema{Equilibrium}{bc85}, \sema{Conservation}{0b32}, \sema{Distance}{dfdf}, \sema{PhaseTransition}{b775}, \sema{Attractor}{8c2d}, \sema{MutualInformation}{03a0}, and \sema{Measurement}{511d}). Above this rests \textbf{Mind}, mechanisms that structurally require cognition (e.g., \sema{BayesUpdate}{3d1b}), where judgment must be exercised and a single isolated agent can execute the mechanism. Emerging from these is \textbf{Society}, mechanisms that structurally require $\geq 2$ independent parties with potentially divergent state (e.g., \sema{Consensus}{45f4}). Enclosing all three is \textbf{Infrastructure} (Figure~\ref{fig:stack}): authored structures and operations that do not require cognition to execute---data types, composite topologies, and mechanical operations (e.g., \sema{ComputeBudget}{47c6}).
+The vocabulary is not a flat list; it is structured into four fundamental layers mimicking a civilization stack. At the base lies \textbf{Physics}, substrate primitives that obtain regardless of any author: thermodynamics of coordination that cannot be ``wished away'' (e.g., \sema{Mutex}{58ba}, \sema{Entropy}{323f}, and recently-added substrate concepts \sema{Gradient}{dcf0}, \sema{Equilibrium}{bc85}, \sema{Conservation}{0b32}, \sema{Distance}{dfdf}, \sema{PhaseTransition}{b775}, \sema{Attractor}{8c2d}, \sema{MutualInformation}{03a0}, and \sema{Measurement}{511d}). Above this rests \textbf{Mind}, mechanisms that structurally require cognition (e.g., \sema{BayesUpdate}{3d1b}), where judgment must be exercised and a single isolated agent can execute the mechanism. Emerging from these is \textbf{Society}, mechanisms that structurally require $\geq 2$ independent parties with potentially divergent state (e.g., \sema{Consensus}{0526}). Enclosing all three is \textbf{Infrastructure} (Figure~\ref{fig:stack}): authored structures and operations that do not require cognition to execute---data types, composite topologies, and mechanical operations (e.g., \sema{ComputeBudget}{47c6}).
 
 The placement of each pattern is governed by the \emph{mechanism-sufficiency test}: what does the pattern's mechanism structurally require to execute? A pattern whose mechanism requires nothing more than substrate goes to Physics; one that requires authored structure but no cognition goes to Infrastructure; one that requires cognition but can be executed by a single isolated agent goes to Mind; one that structurally requires another party with separate state goes to Society. The axis is deliberately \emph{not} what the pattern is typically used for or what it conceptually operates on. This test is the governing principle recorded in \href{https://github.com/emergent-wisdom/sema/blob/main/docs/core/philosophy.md}{\texttt{docs/core/philosophy.md~\S3.1}}.
 
@@ -497,21 +497,21 @@ \subsection{The Grammar of Agency}
 
 These primitives enable a higher-order grammar where complex behaviors compose from atomic units: \sema{Check}{22ec}(Condition) evaluates a target \sema{Condition}{b480} and enforces a fail-closed halt if False; \sema{Trace}{314d}(Target) wraps a process to generate an immutable lineage log; and \sema{Stigmergy}{6282}(Signal) marks the shared environment with a signal for others to discover.
 
-Ring~2 \emph{Macros} are executable patterns composed of primitives via semantic import. (Ring 0--2 describes compositional complexity; Tier 1--3, Section~\ref{sec:contract_levels}, describes safety rigor. Both are stored in the unhashed metadata overlay.) For example, \sema{AgentDiscover}{73ca} imports \texttt{\{\{Discover\#8895\}\}} acting on \texttt{\{\{Agent\#6765\}\}}, while \sema{TraceBelief}{bdfa} imports \texttt{\{\{Trace\#314d\}\}} acting on \texttt{\{\{Belief\#7d83\}\}}. This grammar allows agents to express intent via queries like ``I need to \texttt{Deep(Trace)} this belief,'' which the runtime resolves to concrete executable patterns.
+Ring~2 \emph{Macros} are executable patterns composed of primitives via semantic import. (Ring 0--2 describes compositional complexity; Tier 1--3, Section~\ref{sec:contract_levels}, describes safety rigor. Both are stored in the unhashed metadata overlay.) For example, \sema{AgentDiscover}{73ca} imports \texttt{\{\{Discover\#8895\}\}} acting on \texttt{\{\{Agent\#6765\}\}}, while \sema{TraceBelief}{1881} imports \texttt{\{\{Trace\#314d\}\}} acting on \texttt{\{\{Belief\#7d83\}\}}. This grammar allows agents to express intent via queries like ``I need to \texttt{Deep(Trace)} this belief,'' which the runtime resolves to concrete executable patterns.
 
 This distinction reveals a bicameral architecture. Primitives serve as the query interface, allowing agents to identify logical gaps in the vocabulary. Macros like \sema{IdentityHandshake}{03d2} serve as the social interface, enabling efficient coordination through compression. Instead of negotiating four separate primitives in four round-trips, agents verify a single Macro hash in one. Primitives are for querying; Macros are for talking.
 
-The verb/noun distinction introduced in the Type System (Section~\ref{sec:type_system}) also addresses the ``schema drift'' problem where implicit schemas lead to subtle incompatibilities. Sema formalizes the ``shape of work'' into content-addressed Data Patterns. \sema{Task}{f239} represents a recursive definition of intent that inherits constraints from its parent and explicitly defines its \texttt{AcceptSpec}. \sema{Solution}{4844} acts as a container for work product, encapsulating provenance and a component tree for supply-chain auditing. \sema{UniqueHandle}{88da} serves as a rivalrous resource pointer obeying linear logic to prevent double-spending of physical assets; if Agent~A transfers the handle to Agent~B, Agent~A loses access immediately. To ensure structural compatibility, Noun definitions may include a validation schema in the \texttt{data\_schema} field (e.g., \sema{Task}{f239}, \sema{Bid}{5c45}), embedding constraints directly into the identity unlike external standards such as SHACL~\cite{knublauch2017shacl}. This allows agents to construct rigorous semantic sentences:
+The verb/noun distinction introduced in the Type System (Section~\ref{sec:type_system}) also addresses the ``schema drift'' problem where implicit schemas lead to subtle incompatibilities. Sema formalizes the ``shape of work'' into content-addressed Data Patterns. \sema{Task}{f239} represents a recursive definition of intent that inherits constraints from its parent and explicitly defines its \texttt{AcceptSpec}. \sema{Solution}{4844} acts as a container for work product, encapsulating provenance and a component tree for supply-chain auditing. \sema{UniqueHandle}{58f9} serves as a rivalrous resource pointer obeying linear logic to prevent double-spending of physical assets; if Agent~A transfers the handle to Agent~B, Agent~A loses access immediately. To ensure structural compatibility, Noun definitions may include a validation schema in the \texttt{data\_schema} field (e.g., \sema{Task}{f239}, \sema{Bid}{1eba}), embedding constraints directly into the identity unlike external standards such as SHACL~\cite{knublauch2017shacl}. This allows agents to construct rigorous semantic sentences:
 
 \begin{quote}
-\textit{``I \sema{Delegate}{78a8} this \sema{Task}{f239} to you, expecting a \sema{Solution}{4844} that satisfies this \sema{AcceptSpec}{c156}.''}
+\textit{``I \sema{Delegate}{2d38} this \sema{Task}{f239} to you, expecting a \sema{Solution}{4844} that satisfies this \sema{AcceptSpec}{c156}.''}
 \end{quote}
 
 \subsection{Cognitive Architecture: The Solver Stack}
 
 The vocabulary encodes a complete cognitive architecture whose theoretical foundations, including the Universal Solver Tree, polymorphic solver nodes, and the marginal-value rule governing decomposition depth, are developed in a companion preprint on fractal intelligence~\cite{westerberg2026crp}. Sema provides the content-addressed implementation layer where each concept from the Composable Reasoning Protocol becomes a machine-verifiable pattern.
 
-The architecture is anchored by the \sema{PolymorphicSolver}{272a}, which implements the five-surface Solver Contract across any substrate (LLM, human, hybrid, tool-using agent, or nested composition) and acts as the default implementer within the \sema{UniversalSolverTree}{7361}. The abstract contract itself is \sema{Solver}{} --- an interface any \sema{Agent}{} can take on for the duration of a Task. Each Solver node presents a uniform interface but dynamically decides whether to execute the work directly or to decompose via \sema{ConceptualDecomposition}{3cf2} (distinct from generic \sema{Decompose}{63f3} by its contract-bound requirement: each sub-concept exposes the Solver interface and is therefore delegatable) and delegate to child Solvers. The five surfaces: Manifest (\sema{Card}{84b7}), Execute (\sema{PolymorphicSolver}{272a} itself --- the universal atom), Consult (\sema{SocraticLoop}{7d52}), Verify (\sema{Validate}{337c}), and Feedback (\sema{PerformanceSignal}{7dea}). Inputs are encapsulated in a \sema{Task}{f239} with full constraint inheritance, while outputs are returned as a \sema{Solution}{4844} with full provenance. The \sema{ComputeBudget}{47c6} acts as a pre-execution gate, and \sema{MarginalValueRule}{eebb} governs whether further decomposition is worth the cost. The claim that reasoning extends beyond the capacity of any individual model through typed composition is developed in~\cite{westerberg2026crp}.
+The architecture is anchored by the \sema{PolymorphicSolver}{3653}, which implements the five-surface Solver Contract across any substrate (LLM, human, hybrid, tool-using agent, or nested composition) and acts as the default implementer within the \sema{UniversalSolverTree}{0923}. The abstract contract itself is \sema{Solver}{} --- an interface any \sema{Agent}{} can take on for the duration of a Task. Each Solver node presents a uniform interface but dynamically decides whether to execute the work directly or to decompose via \sema{ConceptualDecomposition}{2cce} (distinct from generic \sema{Decompose}{63f3} by its contract-bound requirement: each sub-concept exposes the Solver interface and is therefore delegatable) and delegate to child Solvers. The five surfaces: Manifest (\sema{Card}{84b7}), Execute (\sema{PolymorphicSolver}{3653} itself --- the universal atom), Consult (\sema{SocraticLoop}{7d52}), Verify (\sema{Validate}{337c}), and Feedback (\sema{PerformanceSignal}{10af}). Inputs are encapsulated in a \sema{Task}{f239} with full constraint inheritance, while outputs are returned as a \sema{Solution}{4844} with full provenance. The \sema{ComputeBudget}{47c6} acts as a pre-execution gate, and \sema{MarginalValueRule}{552f} governs whether further decomposition is worth the cost. The claim that reasoning extends beyond the capacity of any individual model through typed composition is developed in~\cite{westerberg2026crp}.
 
 \subsection{Contract Formalism Tiers}
 \label{sec:contract_levels}
@@ -529,11 +529,11 @@ \subsection{Contract Formalism Tiers}
 \subsection{The Babbage Principle of Cognition}
 \label{sec:babbage}
 
-The vocabulary operationalizes the \textit{Babbage Principle}~\cite{babbage1832} for artificial intelligence: the division of cognitive labor allows each sub-task to be routed to the cheapest competent solver. Rather than employing a high-cost generalist model for every reasoning step, the \sema{FractalIntelligence}{5481} architecture uses \sema{Decompose}{63f3} to break problems into sub-tasks that can be handled by specialized, lower-cost agents or deterministic scripts. Recent empirical work on atomic ``micro-agent'' decomposition~\cite{meyerson2025maker} and DeepMind's AlphaEvolve~\cite{deepmind2025alphaevolve} confirm the economic necessity of this approach. See~\cite{westerberg2026crp} for the full treatment.
+The vocabulary operationalizes the \textit{Babbage Principle}~\cite{babbage1832} for artificial intelligence: the division of cognitive labor allows each sub-task to be routed to the cheapest competent solver. Rather than employing a high-cost generalist model for every reasoning step, the \sema{FractalIntelligence}{1d79} architecture uses \sema{Decompose}{63f3} to break problems into sub-tasks that can be handled by specialized, lower-cost agents or deterministic scripts. Recent empirical work on atomic ``micro-agent'' decomposition~\cite{meyerson2025maker} and DeepMind's AlphaEvolve~\cite{deepmind2025alphaevolve} confirm the economic necessity of this approach. See~\cite{westerberg2026crp} for the full treatment.
 
 \subsection{Example Patterns}
 
-Sema's utility is best understood through concrete examples from the Tier~1 library. \sema{StateLock}{7cd8} (Time) provides atomic coordination via temporary state fusion, where two agents fuse a subset of writable state such that changes require both signatures. The lock auto-dissolves on timeout, though a failure mode exists where deadlock can occur if one agent disappears. \sema{SpectralTune}{cb58} (Protocols) verifies ontology alignment before data transfer; the sender transmits hash-based tuning signals and the receiver proves matching context, preventing mismatch but risking infinite loops if ontologies are slightly different.
+Sema's utility is best understood through concrete examples from the Tier~1 library. \sema{StateLock}{8bde} (Time) provides atomic coordination via temporary state fusion, where two agents fuse a subset of writable state such that changes require both signatures. The lock auto-dissolves on timeout, though a failure mode exists where deadlock can occur if one agent disappears. \sema{SpectralTune}{cb58} (Protocols) verifies ontology alignment before data transfer; the sender transmits hash-based tuning signals and the receiver proves matching context, preventing mismatch but risking infinite loops if ontologies are slightly different.
 
 For cognitive safety, \sema{SteelmanCheck}{9c86} (Reasoning) mandates the generation of the strongest counter-argument, forcing the instantiation of a ``Critic Persona'' that attacks the agent's own plan; however, this is vulnerable to sycophantic critics that fail to genuinely challenge. Finally, \sema{WhyClimb}{967d} (Reasoning) enables recursive problem abstraction via iterative ``Why is this a problem?'' ascent. The agent climbs the abstraction hierarchy until reaching the ``Ceiling,'' where the problem is still actionable but the solution space is maximized, though care must be taken to avoid the failure mode of climbing too high, such as attempting to solve ``Entropy'' instead of ``Fix Bug.'' Full specifications for these patterns appear in Appendix~\ref{app:patterns}.
 
@@ -544,7 +544,7 @@ \subsection{Refinement}
 
 A refinement pass is governed by the versioned vocabulary design manual rather than by ad hoc judgment. Proposed relocations, retirements, mechanism rewrites, and rule clarifications are tested against the current manual, adversarially reviewed, and finally adjudicated by a human maintainer. The paper-level claim is the audit discipline, not a particular review workflow: each accepted change must state the rule it depends on, the failure mode it prevents, and why the alternative was rejected.
 
-Concrete refinement decisions illustrate the character of the pass. \sema{Bid}{5c45} was initially filed under Society/Economics on the intuition that bids are a social-economic concept; the mechanism-sufficiency test reassessed this kind of judgment call by asking what the pattern's mechanism structurally requires (in the Bid case, the decision retained the Society classification because the mechanism requires a counterparty, but the same method resolved many analogous ambiguities in the opposite direction). Earlier drafts also left layer direction unenforced on the argument that layer metadata is not hashed and the protocol is therefore agnostic to layer choice; the refinement kept that degree of freedom intact at the protocol level but tightened the bootstrap library's policy to enforce layer direction as a \texttt{sema apply} gate. Many other decisions were similar in character: a concept that had been filed by vibe or typical-use-case was re-tested against what its mechanism structurally required, and moved when the two disagreed.
+Concrete refinement decisions illustrate the character of the pass. \sema{Bid}{1eba} was initially filed under Society/Economics on the intuition that bids are a social-economic concept; the mechanism-sufficiency test reassessed this kind of judgment call by asking what the pattern's mechanism structurally requires (in the Bid case, the decision retained the Society classification because the mechanism requires a counterparty, but the same method resolved many analogous ambiguities in the opposite direction). Earlier drafts also left layer direction unenforced on the argument that layer metadata is not hashed and the protocol is therefore agnostic to layer choice; the refinement kept that degree of freedom intact at the protocol level but tightened the bootstrap library's policy to enforce layer direction as a \texttt{sema apply} gate. Many other decisions were similar in character: a concept that had been filed by vibe or typical-use-case was re-tested against what its mechanism structurally required, and moved when the two disagreed.
 
 A second class of refinement decision concerns \emph{scope} rather than \emph{placement}: a pattern may be coherent, well-mechanized, and correctly layered, yet still inappropriate for the default library that downstream consumers install by default. During refinement, a subset of patterns whose canonical applications involve capability amplification, social manipulation, evasion, or cryptoeconomic binding (for example, \texttt{AmendLaws}, \texttt{ChaosDrift}, \texttt{CryptoShred}, \texttt{IdentityMask}, \texttt{MirrorStake}) were judged to belong in a separate experimental shelf rather than in the default library. The patterns remain resolvable at the hash level---both databases stay in the repository---but the default install stays conservative, and engaging the experimental shelf is a deliberate act by a user who has read what they are opting into. This splitting decision is made at refinement time, per-pattern, on the basis of how the mechanism composes with realistic deployment contexts rather than on whether the mechanism is well-formed (the latter is already checked by the other gates). The resulting distribution architecture is described in Section~\ref{sec:distribution}.
 
@@ -645,7 +645,7 @@ \section{Implementation}
 
 \paragraph{Graph Store.} Patterns are stored in a SQLite database with NetworkX graph overlays carrying a typed node/edge model (pattern nodes, invariant nodes, pre/postcondition nodes, taxonomy-path nodes, etc., linked by typed edges such as composes-with, references, in-path). An embedding service (\texttt{all-MiniLM-L6-v2}, 384 dimensions) enables semantic search with cached embeddings, and community detection via the Louvain algorithm provides vocabulary overviews for agent orientation. Reference implementations exist for a small set of Tier-1 patterns (SpectralTune, StateLock, ProphetFanOut, CounterfactualAnchor are illustrative); the rest of the library ships as Pattern Cards without executable bindings, by design---the protocol identifies definitions, not running code.
 
-\paragraph{Deployment Paths.} Runtime hydration---the local runtime fetches the full pattern definition at inference time and injects it into the system prompt---is the path we implement, but not the only one. A weight-resident path (mixing references like \texttt{StateLock\#7cd8} directly into training corpora, so pattern meaning carries in the model's weights rather than the context window) is fully compatible with the protocol; content-addressing ensures the references resist silent drift that an integer-ID version of the same approach would suffer. Intermediate architectures (fine-tuning on a library, retrieval-coupled models, hybrid hot-patterns-in-weights) are likewise compatible. Hydration was chosen for the bootstrap because it is model-agnostic and requires no training infrastructure. One caveat: weight-resident paths trade verifiability for speed---a hydration deployment can prove at inference time that the injected definition matches a specific hash, while a weight-resident deployment cannot. Closing that gap (signed training manifests; audit-coupled retrieval) is an open deployment-architecture question rather than a protocol one.
+\paragraph{Deployment Paths.} Runtime hydration---the local runtime fetches the full pattern definition at inference time and injects it into the system prompt---is the path we implement, but not the only one. A weight-resident path (mixing references like \texttt{StateLock\#8bde} directly into training corpora, so pattern meaning carries in the model's weights rather than the context window) is fully compatible with the protocol; content-addressing ensures the references resist silent drift that an integer-ID version of the same approach would suffer. Intermediate architectures (fine-tuning on a library, retrieval-coupled models, hybrid hot-patterns-in-weights) are likewise compatible. Hydration was chosen for the bootstrap because it is model-agnostic and requires no training infrastructure. One caveat: weight-resident paths trade verifiability for speed---a hydration deployment can prove at inference time that the injected definition matches a specific hash, while a weight-resident deployment cannot. Closing that gap (signed training manifests; audit-coupled retrieval) is an open deployment-architecture question rather than a protocol one.
 
 %==============================================================================
 \section{Analysis and Validation}
@@ -792,8 +792,8 @@ \subsection{Adversarial Hardening}
 Beyond static analysis, we subjected the vocabulary to adversarial stress testing via a ``Devil's Advocate'' methodology: an agent systematically attempted to exploit each pattern's assumptions. We identify five attack classes (named here for the first time; we map them to established categories where applicable), each addressed by a corresponding contract or dependency change in the affected patterns:
 
 \begin{description}
-    \item[Blinking Light Livelock (Physics)] A malicious agent spams lock requests on \sema{StateLock}{7cd8}, acquiring and releasing locks at maximum speed while technically respecting timeouts. This denies access to legitimate agents without violating any stated invariant.
-    \par\textbf{Defense:} The pattern now composes with \sema{Backoff}{16c2} and \sema{Cooldown}{878c} via explicit dependencies, enforcing exponential backoff and a mandatory cooldown period between lock acquisitions. The defense is structural (dependency composition) rather than declarative (an invariant string).
+    \item[Blinking Light Livelock (Physics)] A malicious agent spams lock requests on \sema{StateLock}{8bde}, acquiring and releasing locks at maximum speed while technically respecting timeouts. This denies access to legitimate agents without violating any stated invariant.
+    \par\textbf{Defense:} The pattern now composes with \sema{Backoff}{9e59} and \sema{Cooldown}{6f56} via explicit dependencies, requiring a selected delay policy and cooldown period between lock acquisitions without forcing every StateLock deployment to use exponential growth. The defense is structural (dependency composition) rather than declarative (an invariant string).
 
     \item[Blind Search Infinite Loop (Society)] When \sema{SpectralTune}{cb58} detects a hash mismatch, a naive implementation might retry with different context chunks, hoping to eventually match. An adversary can exploit this to trap agents in infinite negotiation.
     \par\textbf{Defense:} We added a \emph{Fail-Fast Invariant}: ``On hash mismatch, DO NOT RETRY tuning. Halt immediately and escalate to \sema{OntologyHandshake}{fc51} or human review.'' A new parameter \texttt{max\_retries: Integer [0, 1]} (default 0) enforces this at the contract level.
@@ -804,7 +804,7 @@ \subsection{Adversarial Hardening}
     \item[Trojan Horse Sandbox Escape (Infrastructure)] An agent wraps a prohibited action (e.g., network access) inside an opaque \texttt{ToolInvoke} call, hoping the outer \sema{Task}{f239} constraints don't propagate into the tool's execution context.
     \par\textbf{Defense:} We added a \emph{Holographic Inheritance Invariant} to Task: ``Constraints propagate through ALL boundaries (tool calls, sub-agents, delegations). No opacity escape.'' The pattern \sema{ToolInvoke}{011f} now explicitly declares: ``Tool Execution Context permissions MUST be $\leq$ Task Constraints.''
 
-    \item[The Semantic Inversion Attack (Topology)] An adversary (or a careless architect) creates a valid DAG that is semantically inverted, such as making \sema{Deduction}{b9a0} depend on \sema{Vote}{3b66}. While computationally valid, this makes truth fragile to political change.
+    \item[The Semantic Inversion Attack (Topology)] An adversary (or a careless architect) creates a valid DAG that is semantically inverted, such as making \sema{Deduction}{b9a0} depend on \sema{Vote}{0aff}. While computationally valid, this makes truth fragile to political change.
     \par\textbf{Defense:} We subjected the graph to a \emph{Layer Migration Protocol}. An initial scan detected over 140 layer violations (e.g., Mind patterns referencing Society protocols); the refinement pass described in Section~\ref{sec:refinement} resolved the remainder by sharpening the layer definitions (the mechanism-sufficiency test, \S\ref{sec:standard_library}) and relocating patterns whose mechanisms contradicted their assigned layer. Layer-direction is now an always-on \texttt{sema apply} gate, and no current pattern violates the rule. Two structural strategies emerged during the migration:
     \begin{enumerate}
         \item \emph{Dependency Inversion}: We resolved the dependency cycle between \sema{Agent}{6765} and \sema{Act}{7616} by splitting the concept. We created \sema{Actor}{1ecd} (Infrastructure) as the ``capability container'' that executes acts, while \sema{Agent}{6765} (Mind) remains the reasoning entity. Infrastructure patterns that need a capability holder reference Actor; patterns that need a reasoner still reference Agent.
@@ -839,7 +839,7 @@ \subsection{Demonstration: Multi-Agent Solution Design}
 \begin{itemize}
     \item \textbf{Condition A (Baseline)}: Natural Language prompts only (Zero-shot coordination).
     \item \textbf{Condition B (Vocabulary Only)}: Agents had access to Sema tools but no coordination protocol.
-    \item \textbf{Condition C (Vocabulary + Protocol)}: Agents used \sema{OptimisticSolver}{18c0} with the \sema{AtomicBid}{33e1} protocol.
+    \item \textbf{Condition C (Vocabulary + Protocol)}: Agents used \sema{OptimisticSolver}{a96f} with the \sema{AtomicBid}{9c0c} protocol.
 \end{itemize}
 
 \begin{table}[H]
@@ -864,7 +864,7 @@ \subsection{Demonstration: Multi-Agent Solution Design}
 
     \item[The ``Sema Tax'' (Condition~B)] Condition~B was the most stable in terms of turn count ($\sigma=4.1$), consistently finishing between 10 and 19 turns. However, it was slower in wall-clock time than Condition~C. This suggests a cognitive overhead: agents spend time looking up definitions and verifying invariants (``The Sema Tax''). This coordination cost is well-documented in multi-agent systems research~\cite{cemri2025mast, chocron2020vocabulary}; the demonstration surfaces this overhead specifically for content-addressed vocabulary lookup. They trade speed for rigorous consistency.
 
-    \item[The Protocol Multiplier (Condition~C)] The \sema{OptimisticSolver}{18c0} achieved the fastest average completion time. By using \sema{AtomicBid}{33e1} to bundle intent and execution, it effectively ``refunded'' the cognitive cost of using the vocabulary. We hypothesize that this speed advantage arises from OptimisticSolver's Tier~2 design (Section~\ref{sec:contract_levels}): by assuming alignment-seeking agents, it trades verification overhead for reduced latency. While slightly less stable than B, it consistently avoided the catastrophic spirals of A.
+    \item[The Protocol Multiplier (Condition~C)] The \sema{OptimisticSolver}{a96f} achieved the fastest average completion time. By using \sema{AtomicBid}{9c0c} to bundle intent and execution, it effectively ``refunded'' the cognitive cost of using the vocabulary. We hypothesize that this speed advantage arises from OptimisticSolver's Tier~2 design (Section~\ref{sec:contract_levels}): by assuming alignment-seeking agents, it trades verification overhead for reduced latency. While slightly less stable than B, it consistently avoided the catastrophic spirals of A.
 \end{description}
 
 Qualitative analysis verified vocabulary adoption by extracting pattern references. Condition~C agents autonomously employed \sema{MechanisticDesignProposal}{4c39} to structure their outputs, often identifying complex attack vectors (e.g., ``Differential Trace Simulation'' vs.\ ``Static Analysis'') that the Baseline agents missed. Whereas the Baseline produced generic compliance-oriented solutions, the Sema agents more often produced mechanism-oriented designs with explicit causal attack models.
@@ -874,7 +874,7 @@ \subsection{Implementation: Interactive Tooling}
 
 The vocabulary is deployed as an open-source web application\footnote{\url{https://semahash.org}; source: \url{https://github.com/emergent-wisdom/sema}.} backed by a Python (FastAPI) server and a React/TypeScript frontend with Three.js-based 3D visualization. The system is launched via a single command (\texttt{sema serve}) and exposes the full vocabulary through three complementary interfaces.
 
-\paragraph{Pattern Browser.} The homepage organizes all \semaPatternCount~patterns by the four Civilization Stack layers (Section~\ref{sec:standard_library}). Each pattern card displays the handle, hash stub, one-line gloss, and---on expansion---the full specification: mechanism, preconditions, postconditions, invariants, failure modes, and related patterns. Real-time hybrid search combines keyword matching with embedding-based semantic retrieval, allowing queries like ``consensus'' to surface \sema{LazyConsensus}{cb1b} alongside structurally related patterns such as \sema{LatticeCommit}{74db}.
+\paragraph{Pattern Browser.} The homepage organizes all \semaPatternCount~patterns by the four Civilization Stack layers (Section~\ref{sec:standard_library}). Each pattern card displays the handle, hash stub, one-line gloss, and---on expansion---the full specification: mechanism, preconditions, postconditions, invariants, failure modes, and related patterns. Real-time hybrid search combines keyword matching with embedding-based semantic retrieval, allowing queries like ``consensus'' to surface \sema{LazyConsensus}{1c07} alongside structurally related patterns such as \sema{LatticeCommit}{6675}.
 
 \paragraph{Taxonomy Graph.} An interactive 3D force-directed graph renders the full knowledge graph structure (Table~\ref{tab:graph}). Nodes are sized by type (taxonomy path~$>$ pattern) and colored by layer; edges are color-coded by relationship type (semantic versus structural). Clicking a node flies the camera to it and opens a detail panel; hovering highlights connected edges to reveal dependency chains.
 
@@ -937,11 +937,11 @@ \section{Related Work}
 
 	\item[Agentic Ontology of Work] The closest existing system to Sema's positioning is Skan AI's Agentic Ontology of Work (AOW)~\cite{skan2026aow}, launched in 2026 as ``a shared language for describing, governing, and scaling intelligent automation.'' AOW defines nine canonical entities (Objectives, Intents, Agents, Skills, Policies, Outcomes, Assurance Levels, Memory, Guardians) implemented via JSON-LD and RDF/OWL. The key difference is architectural: AOW relies on governance-based verification, where human auditors ensure consistent interpretation across teams. Sema relies on cryptographic verification, where hash mismatch triggers automatic halt, with no governance overhead. AOW provides enterprise taxonomy; Sema provides mathematical proof of shared definition identity.
 
-	\item[Protocol-Layer Approaches] Fleming et al.~\cite{fleming2025ioa} proposed an ``Internet of Agents'' architecture with a Semantic Negotiation Layer (L9) for establishing shared context before communication. Their approach differs from Sema in three fundamental ways. \textbf{Scope:} Fleming's Shared Contexts are domain schemas for task-specific data exchange (e.g., flight bookings, supply chain records), essentially API interoperability. Sema patterns encode reasoning primitives (\sema{BayesUpdate}{3d1b}), cognitive strategies (\sema{SteelmanCheck}{9c86}), and coordination protocols (\sema{LatticeCommit}{74db}): the infrastructure of thought itself, not merely its payload. \textbf{Architecture:} Fleming adds a negotiation layer to the network stack; Sema embeds semantics directly in language. Any medium that carries text can carry Sema words. \textbf{Governance:} Fleming relies on federated Schema Authorities to define meaning; Sema makes definition identity intrinsic; the hash is the identity, requiring no institutional trust. A related but orthogonal line of work, BlockA2A~\cite{zou2025blocka2a}, anchors agent interactions to a blockchain ledger using decentralized identifiers and smart contracts to guarantee message authenticity and execution integrity. BlockA2A hashes interaction artifacts (the messages agents exchange); Sema hashes the definitions those messages reference. The two are complementary: BlockA2A proves ``this message was sent,'' Sema proves ``this message references this canonical definition.''
+	\item[Protocol-Layer Approaches] Fleming et al.~\cite{fleming2025ioa} proposed an ``Internet of Agents'' architecture with a Semantic Negotiation Layer (L9) for establishing shared context before communication. Their approach differs from Sema in three fundamental ways. \textbf{Scope:} Fleming's Shared Contexts are domain schemas for task-specific data exchange (e.g., flight bookings, supply chain records), essentially API interoperability. Sema patterns encode reasoning primitives (\sema{BayesUpdate}{3d1b}), cognitive strategies (\sema{SteelmanCheck}{9c86}), and coordination protocols (\sema{LatticeCommit}{6675}): the infrastructure of thought itself, not merely its payload. \textbf{Architecture:} Fleming adds a negotiation layer to the network stack; Sema embeds semantics directly in language. Any medium that carries text can carry Sema words. \textbf{Governance:} Fleming relies on federated Schema Authorities to define meaning; Sema makes definition identity intrinsic; the hash is the identity, requiring no institutional trust. A related but orthogonal line of work, BlockA2A~\cite{zou2025blocka2a}, anchors agent interactions to a blockchain ledger using decentralized identifiers and smart contracts to guarantee message authenticity and execution integrity. BlockA2A hashes interaction artifacts (the messages agents exchange); Sema hashes the definitions those messages reference. The two are complementary: BlockA2A proves ``this message was sent,'' Sema proves ``this message references this canonical definition.''
 	
 	\item[Execution Authorization and Message Admission] Two concurrent systems address agent safety at layers adjacent to Sema. Faramesh~\cite{faramesh2025} places a non-bypassable \emph{Action Authorization Boundary} between agent reasoning and real-world execution: agent intents are normalized into a Canonical Action Representation and every effectful action is gated by a deterministic \texttt{PERMIT}/\texttt{DEFER}/\texttt{DENY} decision, with fail-closed defaults and replayable decision records. CLBC~\cite{clbc2026} addresses covert signaling between LLM agents: messages only enter the shared transcript if a verifier approves them against a pinned predicate, yielding certified upper bounds on hidden coordination through otherwise policy-compliant text. Both are complementary to Sema: Faramesh authorizes \textit{what} an action may do at execution time, CLBC authorizes \textit{which messages} may be spoken, and Sema verifies that all participants reference the same canonical definitions for the actions and capabilities they coordinate around. Together they form a three-layer safety stack: semantic alignment (Sema), message verification (CLBC), and execution authorization (Faramesh).
 
-	\item[The Synthesis: Code, Cognition, and Economy] Most frameworks specialize in one domain: Knowledge Graphs handle static facts (Knowing), Agent Frameworks handle tool execution (Doing), and Crypto Protocols handle value (Transacting). Sema sits at the novel intersection of these three disciplines. It treats \textbf{Thinking} (e.g., \sema{Reason}{c2f2}) and \textbf{Doing} (e.g., \sema{Bid}{5c45}) as nodes in the same graph, allowing agents to reason about their economic commitments with the same grammar they use to reason about the world. The content-addressing principles are shared with IPFS~\cite{benet2014ipfs} and Unison~\cite{chiusano2024unison}. Unison deserves particular note: it identifies every function definition by the hash of its de-named abstract syntax tree, creating exactly the content-addressed definition DAG that Sema applies to semantic patterns. Unison's approach to the ``rename without breaking identity'' problem---separating the human-readable name from the content-derived hash---directly parallels Sema's substrate/overlay separation. Sema extends Unison's insight from code definitions to meaning definitions, adding the typed interface system and fail-closed handshake that multi-agent coordination requires.
+	\item[The Synthesis: Code, Cognition, and Economy] Most frameworks specialize in one domain: Knowledge Graphs handle static facts (Knowing), Agent Frameworks handle tool execution (Doing), and Crypto Protocols handle value (Transacting). Sema sits at the novel intersection of these three disciplines. It treats \textbf{Thinking} (e.g., \sema{Reason}{c2f2}) and \textbf{Doing} (e.g., \sema{Bid}{1eba}) as nodes in the same graph, allowing agents to reason about their economic commitments with the same grammar they use to reason about the world. The content-addressing principles are shared with IPFS~\cite{benet2014ipfs} and Unison~\cite{chiusano2024unison}. Unison deserves particular note: it identifies every function definition by the hash of its de-named abstract syntax tree, creating exactly the content-addressed definition DAG that Sema applies to semantic patterns. Unison's approach to the ``rename without breaking identity'' problem---separating the human-readable name from the content-derived hash---directly parallels Sema's substrate/overlay separation. Sema extends Unison's insight from code definitions to meaning definitions, adding the typed interface system and fail-closed handshake that multi-agent coordination requires.
 
 		\item[Portable Capability Definitions] The closest surface analogue to Sema's Pattern Cards is Anthropic's Agent Skills specification~\cite{anthropic2025skills}, released as an open standard in December 2025 and adopted across Claude, OpenAI, Microsoft, and Cursor. Agent Skills and Pattern Cards both place a structured header over a human-readable body, but three differences are load-bearing. \textbf{Identity:} Agent Skills are identified by string \texttt{name}; two independently authored \texttt{pdf-processing} skills may differ, while Sema identifies by hash so divergent capabilities cannot hide behind the same label. \textbf{Contract:} Agent Skills bodies are freeform Markdown instructions; Pattern Cards carry structured, hashable contracts, making contract equivalence an $O(1)$ hash comparison rather than a runtime judgement call. \textbf{Composition:} Agent Skills are isolated artifacts; Sema patterns reference other patterns by hash, so the Merkle root captures the transitive closure of the vocabulary a pattern relies on. The same gaps hold for adjacent industry formats: A2A Agent Cards~\cite{google2025a2a} use human-assigned skill names, and MCP tool schemas~\cite{anthropic2024mcp} validate inputs and outputs but carry no hashable behavioral contract. These formats share the ``portable capability'' goal with Sema; Sema adds the machinery that makes portability cryptographically verifiable and capabilities composable by construction.
 
@@ -960,7 +960,7 @@ \subsection{Contribution Summary}
 Against this landscape, Sema makes seven contributions, separable into protocol-level mechanisms (C1--C5), compositional schema design (C6), and bootstrap-library design (C7).
 
 \begin{description}
-\item[C1: Hash-as-word inversion.] Sema moves content-addressed identity into the language agents already use. A Sema word such as \sema{Delegate}{78a8} is both a readable handle and a verifiable pointer to a canonical behavioral contract.
+\item[C1: Hash-as-word inversion.] Sema moves content-addressed identity into the language agents already use. A Sema word such as \sema{Delegate}{2d38} is both a readable handle and a verifiable pointer to a canonical behavioral contract.
 
 \item[C2: Hashable behavioral contracts.] The hashed object is not a static definition or data blob, but a behavioral contract: mechanism, invariants, preconditions, postconditions, typed dependencies, and failure modes. Sema proves identity of canonical form, not semantic equivalence; two behaviorally equivalent contracts with different wording still produce different hashes.
 
@@ -994,7 +994,7 @@ \section{Limitations and Future Work}
 
 \paragraph{Single-Agent Reasoning Scaffold.} Although this paper presents Sema as inter-agent coordination infrastructure, the vocabulary's Mind layer may also serve as an internal scaffold for individual agents: hydrated reasoning patterns carry explicit failure modes and invariants into the agent's own context. This use case is not evaluated here; the theoretical foundations for composing reasoning across solvers are developed in~\cite{westerberg2026crp}.
 
-\paragraph{Empirical Pattern Validation.} The methodology described in Section~\ref{sec:standard_library} validates patterns analytically---by review, rules, guidelines, database/DAG constraints, and broad-use tests---but not empirically. We do not currently measure whether a given pattern, once minted, actually improves downstream agent behavior: whether tasks coordinated through \sema{StateLock}{7cd8} succeed more reliably than those coordinated through ad-hoc prose, whether a Mind-layer reasoning pattern produces better solutions than unstructured chain-of-thought, or whether a given formulation of a mechanism is clearer to agents than its alternatives. This is a clear future-work direction. An empirical layer would treat each pattern as a testable hypothesis, A/B-comparing variants on realistic agent benchmarks and feeding the results back into the next round of mechanism refinement. The refinement pass described in Section~\ref{sec:refinement} sharpens patterns against shared formal criteria; an empirical refinement stage would sharpen them against observed task outcomes, producing a population of patterns that are not merely internally coherent but demonstrably useful.
+\paragraph{Empirical Pattern Validation.} The methodology described in Section~\ref{sec:standard_library} validates patterns analytically---by review, rules, guidelines, database/DAG constraints, and broad-use tests---but not empirically. We do not currently measure whether a given pattern, once minted, actually improves downstream agent behavior: whether tasks coordinated through \sema{StateLock}{8bde} succeed more reliably than those coordinated through ad-hoc prose, whether a Mind-layer reasoning pattern produces better solutions than unstructured chain-of-thought, or whether a given formulation of a mechanism is clearer to agents than its alternatives. This is a clear future-work direction. An empirical layer would treat each pattern as a testable hypothesis, A/B-comparing variants on realistic agent benchmarks and feeding the results back into the next round of mechanism refinement. The refinement pass described in Section~\ref{sec:refinement} sharpens patterns against shared formal criteria; an empirical refinement stage would sharpen them against observed task outcomes, producing a population of patterns that are not merely internally coherent but demonstrably useful.
 
 \paragraph{Embedding Granularity.} Structural distinctness analysis relies on \texttt{all-MiniLM-L6-v2} (384-dimensional vectors), a lightweight model optimized for speed over nuance. Domain-specific embedding models or larger sentence transformers may reveal finer-grained semantic clusters not visible at the current resolution. The \semaEmbHighPairs{} high-similarity pairs ($\geq 0.70$) warrant manual review to determine whether they represent genuine near-duplicates or appropriately related variants.
 
diff --git a/skills/sema-seed/SKILL.md b/skills/sema-seed/SKILL.md
index 6c5fd957..741f4da8 100644
--- a/skills/sema-seed/SKILL.md
+++ b/skills/sema-seed/SKILL.md
@@ -66,9 +66,9 @@ Process:
 2. Resolve any handle whose mechanism you're unsure about (`sema_resolve`).
 3. Then write the reasoning. Multiple paragraphs. Examples of the right texture:
 
-   *"At first this looks like a `Loop#984a` of `Observe#xxxx` against `Decay#ed25` — but the loop here doesn't restore state, it accumulates a `Trace#314d` that itself becomes the `Signal#2ac0`. That's a different mechanism than `Heartbeat#c36f`, which just confirms presence..."*
+   *"At first this looks like a `Loop#984a` of `Observe#xxxx` against `Decay#ed25` — but the loop here doesn't restore state, it accumulates a `Trace#314d` that itself becomes the `Signal#2ac0`. That's a different mechanism than `Heartbeat#d0e6`, which just confirms presence..."*
 
-   *"The `Tension#547a` here is between `Care#4137` (non-transactional maintenance) and `OpportunityCost#xxxx` (the work foregone). Most agents collapse this to one side. The word names the holding of both — a `TensionHold#xxxx`-like posture but applied to..."*
+   *"The `Tension#5dce` here is between `Care#4137` (non-transactional maintenance) and `OpportunityCost#xxxx` (the work foregone). Most agents collapse this to one side. The word names the holding of both — a `TensionHold#xxxx`-like posture but applied to..."*
 
 4. Each paragraph should compose handles, compare mechanisms, surface tensions, identify what existing patterns get right and wrong about the concept.
 
diff --git a/skills/sema-usage/SKILL.md b/skills/sema-usage/SKILL.md
index 183f0d49..b97fd3ac 100644
--- a/skills/sema-usage/SKILL.md
+++ b/skills/sema-usage/SKILL.md
@@ -20,13 +20,13 @@ allowed-tools: |
 
 # Speak in Sema
 
-Sema is a **content-addressed vocabulary protocol**. ~450 patterns that give you precise, shared words for concepts that would otherwise require paragraphs of re-explanation. Each pattern has a handle (e.g. `StateLock#7cd8`) that is a cryptographic commitment to its definition — two agents using the same handle are provably talking about the same thing.
+Sema is a **content-addressed vocabulary protocol**. ~450 patterns that give you precise, shared words for concepts that would otherwise require paragraphs of re-explanation. Each pattern has a handle (e.g. `StateLock#8bde`) that is a cryptographic commitment to its definition — two agents using the same handle are provably talking about the same thing.
 
 Before defining a concept from scratch, check if sema already has a word:
 
 1. `sema_search` with the idea
 2. `sema_resolve` to read mechanism and invariants
-3. Use the handle as a load-bearing noun in your text: *"This uses `StateLock#7cd8` to prevent concurrent mutation"*
+3. Use the handle as a load-bearing noun in your text: *"This uses `StateLock#8bde` to prevent concurrent mutation"*
 
 Not footnotes — actual words you think with.
 
@@ -152,7 +152,7 @@ sema_mint({
 
 Use sema handles as load-bearing nouns — not footnotes, actual words you think with:
 
-> "This uses `StateLock#7cd8` to prevent concurrent mutation"
+> "This uses `StateLock#8bde` to prevent concurrent mutation"
 
 Wrap handles in backticks for readability. When you encounter a handle you don't recognize, resolve it before proceeding.
 
@@ -161,7 +161,7 @@ Wrap handles in backticks for readability. When you encounter a handle you don't
 When two agents (or an agent and a human) need to agree on meaning:
 
 ```javascript
-sema_handshake({ ref: "StateLock#7cd8" })
+sema_handshake({ ref: "StateLock#8bde" })
 // → canonical stub. Compare against your local value, then:
 sema_handshake({ ref: "StateLock", your_hash: "774b" })
 // PROCEED (match) or HALT (drift). No silent misunderstandings.
diff --git a/src/sema/core/stdlib.py b/src/sema/core/stdlib.py
index 5cb1b130..b37263ce 100644
--- a/src/sema/core/stdlib.py
+++ b/src/sema/core/stdlib.py
@@ -67,7 +67,7 @@ def verify_handshake(self, sender_signal: str, local_prompt: str, nonce: str) ->
 
 class StateLock(SemaPattern):
     """
-    Handle: StateLock#7cd8
+    Handle: StateLock#8bde
     Invariant: State S cannot be modified without Sign(A) + Sign(B)
     """
 
@@ -132,7 +132,7 @@ def evaluate(self, original_text: str, reduced_text: str) -> bool:
 
 class ProphetFanOut(SemaPattern):
     """
-    Handle: ProphetFanOut#d47b
+    Handle: ProphetFanOut#b0f3
     Invariant: Entropy(Timelines) > Threshold
     """
 
diff --git a/src/sema/mcp/server.py b/src/sema/mcp/server.py
index 08b22caa..d6f34845 100644
--- a/src/sema/mcp/server.py
+++ b/src/sema/mcp/server.py
@@ -320,7 +320,7 @@ def sema_handshake(ref: str, your_hash: str | None = None, strict: bool = False)
     coordinating on a pattern. It does not replace behavioral testing.
 
     Args:
-        ref: Pattern reference (e.g., "StateLock#7cd8" or "StateLock"),
+        ref: Pattern reference (e.g., "StateLock#8bde" or "StateLock"),
              or the literal string "vocab" to handshake on the whole
              vocabulary's Merkle root.
         your_hash: Your local hash — the 4-char pattern stub, or the