[{"handle":"Stigmergy#f624","gloss":"Indirect coordination via environment modification (Ant Colony)","mechanism":"Agents MARK shared environment with structured traces instead of sending direct messages. Other agents SENSE traces and respond. Traces DECAY over time but can be REINFORCED by repeated marking. Coordination emerges from accumulated trace patterns without any agent-to-agent communication. (Formerly known as Trace#9057).","category":"Memory","layer":"Mind","sema_ref":"Stigmergy#f624","score":1.0,"source":"keyword","matched_fields":["gloss","mechanism"]},{"handle":"Bubble#eb9a","gloss":"Enable risk-free coordination experimentation through transactional isolation—try before committing to reality","mechanism":"Isolated sandbox where coordination is tried before committing to reality. Creator sends BUBBLE_CREATE: {participants, ttl (time-to-live), isolation_level, parent_bubble (for nesting)}. Participants JOIN to enter isolated context. Inside bubble: state changes are copy-on-write (snapshot isolation), resource acquisitions are soft-reservations (intent, not actual), messages to non-participants are queued (not sent). Work#aaad proceeds normally but nothing affects real world. When ready, creator calls PREPARE (2-phase commit). Each participant responds READY (can commit) or ABORT (cannot). If ALL READY: COMMIT—queued messages sent, state changes applied atomically, reservations converted to hard acquisitions. If ANY ABORT or TTL expires: ROLLBACK—all tentative work discarded silently, no compensation needed. Nested bubbles commit to parent context, not real world; parent commit makes all nested work real. It enforces a ConstraintFirst#c7cb approach around the simulation context to ensure no side effects leak into the production environment.","category":"Strategy","layer":"Mind","sema_ref":"Bubble#eb9a","score":1.0,"source":"keyword","matched_fields":["gloss","mechanism"]},{"handle":"Resonate#99d9","gloss":"Implicit coordination via signal amplification","mechanism":"Alignment emerges from observable actions and mutual adjustment without explicit negotiation. Agents perform actions with attached INTENT_TAGS. Observers AMPLIFY (reinforce) or Dampen#ff89 (ignore) based on compatibility. It detects alignment via Signal#f39d amplification and SpectralTune#6c65, eventually allowing the relationship to solidify into a stable bond.","category":"Economics","layer":"Society","sema_ref":"Resonate#99d9","score":1.0,"source":"keyword","matched_fields":["gloss"]},{"handle":"Break#9d98","gloss":"Enable graceful degradation and coordinated recovery when coordination fails mid-stream","mechanism":"Protocol#7e1c for announcing coordination failure. Failing Agent#cc24 broadcasts BREAK: {severity, reason, recoverable}. Partners must ACK. Coordination terminates or pauses based on severity. Unacknowledged BREAK escalates to FAILED. It coordinates with retry logic to distinguish transient from permanent failures, optionally triggering ejection seat in catastrophic scenarios.","category":"Data Structures","layer":"Infrastructure","sema_ref":"Break#9d98","score":1.0,"source":"keyword","matched_fields":["gloss","mechanism"]},{"handle":"Card#5c33","gloss":"Enable capability-based agent discovery, making coordination ecosystems dynamic and self-describing","mechanism":"Structured capability advertisement enabling agent discovery before contact. Agent#cc24 creates CARD: {agent_id (unique), endpoint (how to reach), protocols[] (compatibility), capabilities[] (what agent claims to do), constraints (availability, rate limits, requirements), metadata (version, ttl, published timestamp)}. Agent#cc24 PUBLISHES card via registry, broadcast, DHT, or well-known endpoint (mechanism-agnostic). Discovering agents QUERY: {capability_match, protocol_match, semantic_search}. Query returns ranked CARD list. Discoverer selects promising CARDs, then GREETs at card.endpoint to establish channel. CARDs have TTL—agents must REFRESH periodically to maintain visibility. CARD capabilities are CLAIMS not proofs: verification happens via Probe#9f2b after GREET establishes channel. It enables discovery via Select#15c2 queries against the registry, filtering candidates by capability and protocol compatibility.","category":"Data Structures","layer":"Infrastructure","sema_ref":"Card#5c33","score":1.0,"source":"keyword","matched_fields":["gloss"]},{"handle":"StateLock#7859","gloss":"Atomic coordination via temporary state fusion","mechanism":"A coordination pattern where two Agent#cc24s temporarily 'fuse' a subset of their writable State#4d58. During the Lock#5bf2, changes require a cryptographic signature from both. Contention triggers Backoff#315a and Cooldown#0cde.","category":"Time","layer":"Physics","sema_ref":"StateLock#7859","score":1.0,"source":"keyword","matched_fields":["gloss","mechanism"]},{"handle":"UptakeAsGround#bf85","gloss":"Meaning emerges from successful coordination","mechanism":"Pragmatic Verification. The validity of a pattern is defined as a function of its `Coordination_Success_Rate`. If Agents A and B use Pattern P and successfully complete a Task#d9f9, P gains 'Semantic Mass'. If usage is zero or results in failure, P is effectively meaningless. Utilizes ModestClaim#a257.","category":"Protocols","layer":"Society","sema_ref":"UptakeAsGround#bf85","score":1.0,"source":"keyword","matched_fields":["gloss","mechanism"]},{"handle":"HeldRelease#5b7a","gloss":"Trustless conditional value transfer becomes the primitive for all economic coordination - atomic swaps, payment channels, escrow, and conditional contracts all compose from this base pattern","mechanism":"Value#3c5d (UniqueHandle#6879) held until condition met, released or returned on timeout. DEPOSIT: Party A sends value + condition_hash + timeout to escrow address. CLAIM: Party B submits condition_preimage; if hash(preimage) matches condition_hash, value releases to B. TIMEOUT: If timeout expires without valid claim, value returns to A. State#4d58 transitions: EMPTY --deposit--> HELD --claim(valid)--> RELEASED_TO_B | --timeout--> RETURNED_TO_A. Primitives: hash commitment (SHA256), timelock (block height), 2-of-2 multisig or smart contract.","category":"Protocols","layer":"Society","sema_ref":"HeldRelease#5b7a","score":1.0,"source":"keyword","matched_fields":["gloss"]},{"handle":"AgentProtocol#1035","gloss":"Standard patterns for multi-agent coordination","mechanism":"Pattern Bundle. Defines the standard suite of patterns required for basic Agent#cc24 Protocol#7e1c interoperability. Importing this bundle automatically imports the dependencies. It bundles Task#d9f9 for Work#aaad definition, FailClosed#ae79 for safe halting, Greet#1bad for handshake, AcceptSpec#70dd for validation, and Solution#7186 for output standardization into a cohesive interaction suite.","category":"Protocols","layer":"Society","sema_ref":"AgentProtocol#1035","score":1.0,"source":"keyword","matched_fields":["gloss"]},{"handle":"PheromoneEconomy#0a9c","gloss":"Value-driven coordination","mechanism":"Macro for Stigmergy#f624(Value#3c5d). Agents coordinate by attaching value (bounties, priority signals) to intermediate states in the shared environment. Other agents discover and process these states to claim the value, driving system-wide progress without explicit commands. It attaches Value#3c5d to environmental signals via Stigmergy#f624, creating a GhostTrail#91ae that guides agents through a ContinuousResourceAuction#5776 of effort.","category":"Economics","layer":"Society","sema_ref":"PheromoneEconomy#0a9c","score":1.0,"source":"keyword","matched_fields":["gloss"]},{"handle":"Elect#af6e","gloss":"Enable efficient group coordination through configurable leadership with clear authority boundaries and succession planning","mechanism":"Establish leadership role with nomination, powers, term, and succession. Phase 1 NOMINATE: Members send NOMINATE: {nominee, nominator, reason}. Self-nomination allowed if configured. Nominees must satisfy AcceptSpec#70dd to appear on Ballot#c5c5—cannot elect unwilling leader. Phase 2 VOTE: Standard VOTE mechanism among accepted nominees. Phase 3 INVEST: Winner receives Solution#7186 (Election Result): {elected, powers[] (explicitly granted authorities), term (fixed|task|indefinite|renewable), succession_plan (automatic|re_elect|fallback)}. Leader exercises granted powers until term ends, resignation, or recall. On term end: succession triggers per plan. RECALL mechanism if enabled: member initiates RECALL_MOTION: {reason}, group VOTEs, if threshold met leader removed and succession triggers. It operates within the bounds of the HydraConstitution#802e to nominate, vote, and invest authority in a leader.","category":"Governance","layer":"Society","sema_ref":"Elect#af6e","score":1.0,"source":"keyword","matched_fields":["gloss"]},{"handle":"Rally#b6ca","gloss":"Enable ad-hoc multi-party coordination","mechanism":"Ad-Hoc Group Formation Protocol#7e1c. Initiator broadcasts a 'RALLY' signal with requirements defined by an AcceptSpec#70dd and a selection criteria. Responders submit 'ENLIST' messages. If count >= Quorum#f67a by deadline, initiator executes Select#15c2 and sends 'MUSTER' to form a new cryptographic group Context#510a. It broadcasts a call to form a group, using Quorum#f67a to validate critical mass and Elect#af6e to formalize leadership.","category":"Governance","layer":"Society","sema_ref":"Rally#b6ca","score":1.0,"source":"keyword","matched_fields":["gloss"]},{"handle":"Canary#3902","gloss":"Transform path selection from 'hope it works' to 'tested it works' without risking real resources","mechanism":"Expendable Agent#cc24 tests full coordination path before committing real resources. Spawn CANARY with: limited resources (bounded blast radius), defined scope, telemetry hooks. Canary executes FULL coordination path (Greet#1bad→Probe#9f2b→negotiate→partial-execute). Reports TELEMETRY: {path_viable, latency_profile, error_events, partner_behavior_observations, recommendation: proceed|caution|abort}. Lifecycle options: DESTROY (discard after test), RECYCLE (reset for another test), PROMOTE (canary becomes real Agent#cc24, continues Work#aaad), ABSORB (real Agent#cc24 inherits canary's progress). In adversarial environments, canary can run in STEALTH Mode#b995 (indistinguishable from real Agent#cc24) to prevent partners gaming the test. It extends the logic of a single Probe#9f2b into a full-lifecycle agent deployment with bounded blast radius.","category":"Protocols","layer":"Society","sema_ref":"Canary#3902","score":1.0,"source":"keyword","matched_fields":["mechanism"]},{"handle":"Compensate#2f1d","gloss":"Enable clean failure recovery through structured rollback, preventing orphaned resources and corrupted state","mechanism":"Execute inverse actions to undo partial coordination after BREAK. On receiving BREAK, agent retrieves compensation_log (built during forward execution—each action logged its inverse). Execute inverses in REVERSE chronological order (LIFO). For each inverse: attempt execution, if fail retry (inverses must be idempotent), if still fail log and continue or escalate. Report COMPENSATE_RESULT: {completed: [steps undone], failed: [steps that couldn't undo], clean: bool, downstream_confirmed: bool}. Multi-agent coordination: each agent compensates their own scope. BREAK propagates with upstream_agents hint for cross-agent dependencies—downstream agents compensate first, confirm, then upstream proceeds. Compensation cannot introduce NEW coordinated work (only cleanup and notification). Triggered by Break#9d98, it reads the TimeWarpLog#aa7a in reverse to execute the idempotent inverse of each prior action.","category":"Primitives","layer":"Physics","sema_ref":"Compensate#2f1d","score":1.0,"source":"keyword","matched_fields":["mechanism"]},{"handle":"Retry#9e66","gloss":"Transform retry from blind re-attempt to intelligent, failure-informed recovery strategy","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? CircuitBreaker#4162 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 (or escalation to HumanApprove#e64a). 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#9d98 and Compensate#2f1d.","category":"Primitives","layer":"Physics","sema_ref":"Retry#9e66","score":1.0,"source":"keyword","matched_fields":["mechanism"]},{"handle":"ShoutWhisper#35dd","gloss":"Dual-mode communication","mechanism":"Agents 'Shout' (broadcast) high-level intent to discover peers, then switch to 'Whisper' (encrypted P2P) for the actual coordination. Optimizes bandwidth and privacy.","category":"Protocols","layer":"Society","sema_ref":"ShoutWhisper#35dd","score":1.0,"source":"keyword","matched_fields":["mechanism"]},{"handle":"Resource#9bb2","gloss":"Finite allocatable entity","mechanism":"A finite, identifiable entity that can be allocated, consumed, or locked. Resources have Identity#626c, may be renewable or exhaustible, and are subject to contention when demand exceeds supply. Forms the basis for Budget#a763 allocation and mutex coordination.","category":"Data Structures","layer":"Infrastructure","sema_ref":"Resource#9bb2","score":1.0,"source":"keyword","matched_fields":["mechanism"]},{"handle":"Discover#afa1","gloss":"Distributed query for external resources","mechanism":"A distributed coordination protocol where an agent broadcasts a query to the network to locate external entities (Agents, Datasets, or Patterns) matching a Criteria#ef6b. Uses Check#1544 to filter responses against the query. Unlike Search#d608 (which scans internal memory or static data), Discover implies active solicitation of peers and handling of asynchronous Signal#f39d responses.","category":"Protocols","layer":"Society","sema_ref":"Discover#afa1","score":1.0,"source":"keyword","matched_fields":["mechanism"]},{"handle":"Ledger#2449","gloss":"Immutable transactional history","mechanism":"An immutable record of Value#3c5d transfers, debts, and obligations between Agent#cc24s. It serves as the shared memory for economic coordination.","category":"Data Structures","layer":"Infrastructure","sema_ref":"Ledger#2449","score":1.0,"source":"keyword","matched_fields":["mechanism"]},{"handle":"NegativeProof#40a6","gloss":"Proving ignorance or non-liability","mechanism":"Using Zero-Knowledge Range Proofs to prove that an Agent#cc24 does NOT hold a specific piece of data (or that a Value#3c5d is NOT within a target range) without revealing what they actually hold. Essential for 'deniable' coordination. Operates via exhaustive search over a closed domain, treating failure-to-find as proof of absence.","category":"Primitives","layer":"Infrastructure","sema_ref":"NegativeProof#40a6","score":1.0,"source":"keyword","matched_fields":["mechanism"]},{"handle":"AnalogicalMask#852a","gloss":"Privacy-preserving communication via isomorphic domain translation","mechanism":"A privacy-preserving communication protocol where sensitive content is not encrypted into noise, but ISOMORPHICALLY MAPPED to a Cover Domain. The agent uses an AnalogyBridge#87de to translate the sensitive Source (e.g., a proprietary trading strategy) into a structurally equivalent Target narrative (e.g., a logistics optimization problem). To an external observer, the Message#f767 appears as valid, low-entropy text about the Target domain. The receiver, possessing the specific Bridge Key (mapping dictionary), inverts the analogy to recover the structural intent. It requires an initial OntologyHandshake#ead0 to securely establish the shared Bridge Key before transmission begins. Primary use cases: sanitizing proprietary information for external review, translating classified operational plans into unclassified training analogues, and privacy-preserving inter-organizational coordination.","category":"Strategy","layer":"Mind","sema_ref":"AnalogicalMask#852a","score":1.0,"source":"keyword","matched_fields":["mechanism"]},{"handle":"Jester#02f3","gloss":"Delivering critique via incongruity to minimize social friction","mechanism":"A communication strategy that wraps a high-entropy Critique#3e00 inside a semantic Incongruity#e98f. It is used to deliver negative feedback or reveal contradictions without triggering the recipient's defensive filtering or causing a coordination Break#9d98. It prioritizes relationship maintenance over tone consistency.","category":"Strategy","layer":"Mind","sema_ref":"Jester#02f3","score":1.0,"source":"keyword","matched_fields":["mechanism"]},{"handle":"IdentityHandshake#7a20","gloss":"Distinguish Peer from Principal","mechanism":"Macro for Discover#afa1(Identity#626c) + Check#1544(Nature#6c1a). The agent verifies the ontological origin of a counterparty to switch between Service Mode#b995 (for Biologicals) and Coordination Mode#b995 (for Synthetics). It performs a multi-stage authentication, chaining Discover#afa1 for availability, SpectralTune#6c65 for alignment, OntologyHandshake#ead0 for context, and Check#1544 for cryptographic Identity#626c verification.","category":"Protocols","layer":"Society","sema_ref":"IdentityHandshake#7a20","score":1.0,"source":"keyword","matched_fields":["mechanism"]},{"handle":"MonotonicCounter#3a12","gloss":"Logic via strictly increasing values","mechanism":"A distributed coordination primitive where a value (clock, version, balance) can only increase. This simple constraint simplifies consensus, as any node seeing a higher value knows it is 'newer'. It is the foundation of logical clocks and CRDTs. It relies on a StateLock#7859 (or CRDT logic) to ensure the counter value never regresses.","category":"Protocols","layer":"Society","sema_ref":"MonotonicCounter#3a12","score":1.0,"source":"keyword","matched_fields":["mechanism"]},{"handle":"AtomicBid#15a1","gloss":"Declaration and execution in a single turn","mechanism":"A coordination primitive that bundles a Bid#cf07 (intent/cost) and an Act#5d55 (execution) into a single, indivisible turn. Unlike a standard Bid#cf07 which halts for approval, AtomicBid treats the Bid as an immutable Audit#4044 log entry and proceeds immediately to execution. Similar to LazyConsensus#7c9b for state, it assumes optimistic permission but remains subject to retroactive Compensate#2f1d if the Bid is rejected post-hoc.","category":"Economics","layer":"Society","sema_ref":"AtomicBid#15a1","score":1.0,"source":"keyword","matched_fields":["mechanism"]},{"handle":"Compose#41f6","gloss":"Building complex behavior from simple primitives","mechanism":"Recursive Assembly: Given solved subproblems, Combine#5a44 solutions respecting interfaces. Check#1544: does combined solution satisfy original problem constraints? If interaction effects emerge, add coordination layer or revise decomposition. It often employs PromptChain#be30 to sequentially feed sub-solutions into the integration step.","category":"Protocols","layer":"Society","sema_ref":"Compose#41f6","score":1.0,"source":"keyword","matched_fields":["mechanism"]},{"handle":"ConsensusFinder#a9c9","gloss":"Discovering existing agreement","mechanism":"Macro for Discover#afa1(Consensus#2722). Instead of initiating a vote, the agent scans the network to identify pre-existing clusters of agreement or shared state. It optimizes coordination by surfacing natural alignment before attempting to manufacture it. It applies the Discover#afa1 primitive to locate Consensus#2722 clusters, checking for Resonate#99d9 signals before triggering a formal Quorum#f67a.","category":"Governance","layer":"Society","sema_ref":"ConsensusFinder#a9c9","score":1.0,"source":"keyword","matched_fields":["mechanism"]},{"handle":"OptimisticSolver#0e2e","gloss":"High-velocity solver requiring parallel runtime","mechanism":"A high-velocity implementation of CognitiveSolver#4962 designed for efficient multi-agent coordination. Requires a Parallel#6272 runtime (Actor Model with Mailboxes) to prevent serial deadlock. It explicitly couples the standard Solver lifecycle (Reason -> Solution) with the AtomicBid#15a1 protocol. Unlike the base abstraction, this pattern MANDATES that the agent plan and execute in a single turn. It relies on Reflexion#51b9 and Compensate#2f1d for error correction rather than pre-action permission. Use ComputeBudget#3b98 to bound resource consumption. Contrast with RigorousSolver#151a which prioritizes safety over speed.","category":"Protocols","layer":"Society","sema_ref":"OptimisticSolver#0e2e","score":1.0,"source":"keyword","matched_fields":["mechanism"]},{"handle":"Correlation#091f","gloss":"Shared movement","mechanism":"A relationship where two Variable#179as move together, but one does not necessarily cause the other. 'Cum hoc ergo propter hoc' fallacy trap.","category":"Data Structures","layer":"Infrastructure","sema_ref":"Correlation#091f","score":1.0,"source":"keyword"},{"handle":"Consensus#2722","gloss":"Distributed agreement process","mechanism":"A distributed protocol allowing a set of agents to agree on a single data value or state transition. It orchestrates Vote#cae4 exchange and uses Quorum#f67a to validate the result. It ensures safety and liveness in an adversarial network, accepting a Proposal#4840 and yielding a Value#3c5d.","category":"Governance","layer":"Society","sema_ref":"Consensus#2722","score":1.0,"source":"keyword"},{"handle":"Proprioception#c9bb","gloss":"Self-location awareness within the task graph","mechanism":"Continuous self-monitoring of position in the Task#d9f9 graph. An Agent#cc24 periodic 'ping' to itself to verify Context#510a, active tool state, and depth in recursion. Prevents 'getting lost' in long chains of thought. It maintains internal State#4d58 awareness, using SomaticMarker#84e4 to detect recursion depth limits or resource fatigue.","category":"Protocols","layer":"Society","sema_ref":"Proprioception#c9bb","score":1.0,"source":"keyword"},{"handle":"Cyclic#ac13","gloss":"Recursive or iterative topology","mechanism":"A Topology#2408 that permits feedback Loop#fb2es, allowing a process to revisit previous states or refine outputs iteratively. Essential for self-correcting systems and recursive optimization.","category":"Time","layer":"Physics","sema_ref":"Cyclic#ac13","score":1.0,"source":"keyword"}]