[{"id":"Artifact","handle":"Artifact#6254","gloss":"Immutable data unit","mechanism":"A discrete, immutable unit of data produced by a solver or workflow. It serves as a typed input/output token.","invariants":["Immutability: Once minted, the content cannot change.","Addressability: Must be referenceable by a content-derived hash."],"parameters":{},"hash":"sema:Artifact#mh:SHA-256:6254c09973118bce3ba2813b7494dee7a61c8b2a87fbcb4d2830f9fbf8d29cf9","stub":"6254","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{}},{"id":"Assessment","handle":"Assessment#a765","gloss":"Structured qualitative feedback","mechanism":"A structured qualitative evaluation of a target artifact, produced by critique, containing identified strengths, weaknesses, and specific recommendations for improvement. It serves as the input for reflexion and refinement loops.","invariants":["Actionability: Must contain at least one specific recommendation.","Reference: Must cite specific parts of the target artifact."],"parameters":{},"hash":"sema:Assessment#mh:SHA-256:a76518b956c1f22aec39c6402db8725510ea23bd6eda56844ef118a948de3c77","stub":"a765","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{}},{"id":"Axiom","handle":"Axiom#5012","gloss":"Foundational truth","mechanism":"A statement accepted as true without proof to serve as a starting point. It is foundational and non-negotiable within the system's current logic frame.","invariants":[],"parameters":{},"hash":"sema:Axiom#mh:SHA-256:50121ab598ddbe31a5c35482eb3ddd598ec8e64d797811ab765027e88975dded","stub":"5012","category":"Protocols","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{}},{"id":"Backoff","handle":"Backoff#315a","gloss":"Exponential delay to reduce 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)."],"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"}],"hash":"sema:Backoff#mh:SHA-256:315a36ef873a63c30740ce89b1aeb542836a068ef0d81a6e3aaaec062d70bc60","stub":"315a","category":"Primitives","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{}},{"id":"BaseRateInclude","handle":"BaseRateInclude#aa0b","gloss":"Outside view over inside view","mechanism":"Prior Probability Anchor: Before evaluating specific case, ask: \"How often does this happen in general?\" Start with base rate. Adjust for specific evidence. Vivid details don't change base rates. \"This startup feels special\" doesn't change 90% failure rate.","invariants":["Base rate source must be reference class relevant","Posterior probability must respect prior base rate"],"parameters":{},"hash":"sema:BaseRateInclude#mh:SHA-256:aa0b8b4d62885496dfbe0caffc5def9e15fb9fee63d787918bce4be8593f0916","stub":"aa0b","category":"Inference","layer":"Mind","signature":[],"preconditions":["General population statistics","Specific case evidence"],"postconditions":["Probability estimate adjusted towards mean"],"failureModes":[],"dependencies":{}},{"id":"Branch","handle":"Branch#329d","gloss":"Conditional flow","mechanism":"Conditional fork: if C then A else B. Mutual exclusion.","invariants":[],"parameters":{},"hash":"sema:Branch#mh:SHA-256:329d01a4bcf9599389d35db860faee9fb6d42964ceca8fd708843b410fa7150e","stub":"329d","category":"Time","layer":"Physics","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{}},{"id":"Budget","handle":"Budget#a763","gloss":"Resource allocation limit","mechanism":"A quantified allocation of resources (compute, time, energy) that constrains execution. It serves as a hard limit on consumption, preventing exhaustion of finite pools.","invariants":["Non-Negative: Remaining budget cannot be < 0.","Conservation: Allocated + Remaining = Total."],"parameters":{},"hash":"sema:Budget#mh:SHA-256:a7637c4387d834ae190f6c42a2a96914c65294a9f618c4c96adf4ee1d26450e0","stub":"a763","category":"Primitives","layer":"Infrastructure","signature":[],"preconditions":["Total budget defined"],"postconditions":["Budget decremented by cost"],"failureModes":[],"dependencies":{}},{"id":"Category","handle":"Category#1ab7","gloss":"Grouping of objects","mechanism":"A specific grouping or 'bin' for objects. It defines the taxonomy and allows the agent to treat distinct items as equivalent for certain operations.","invariants":[],"parameters":{},"hash":"sema:Category#mh:SHA-256:1ab7e3c9863286a33d2be0ec51112ecfadef9e46a07f5f15b9f6cd33f74d8bd1","stub":"1ab7","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{}},{"id":"Compare","handle":"Compare#4881","gloss":"Relational check","mechanism":"Evaluate relation between two values: Equal, Less, Greater, Incomparable.","invariants":["Reflexivity: A == A is always True.","Symmetry: If A == B, then B == A.","Transitivity: If A == B and B == C, then A == C."],"parameters":{},"hash":"sema:Compare#mh:SHA-256:48815374a8845487f135578867a9a36ffeeb0e786007b63da5713292723e2109","stub":"4881","category":"Reasoning","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{}},{"id":"Compress","handle":"Compress#0967","gloss":"Lossy or lossless reduction","mechanism":"Reducing information size while preserving essential meaning.","invariants":["Size Reduction: Output size must be strictly less than Input size.","Reconstructability: (For lossless) Inverse(Output) == Input."],"parameters":{},"hash":"sema:Compress#mh:SHA-256:0967b06ee8a76319b59ee923f2302ff5aebac89f396d79b55f2a0f9e1239f621","stub":"0967","category":"Primitives","layer":"Physics","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{}},{"id":"ConceptAnchor","handle":"ConceptAnchor#9187","gloss":"Pinning meaning to immutable references","mechanism":"Agents do not define terms inline; they reference immutable, content-addressed 'Concept Anchors' stored globally. 'I want [hash:Apple]', not 'I want an apple'. It is established via an external drop event that finalizes the definition hash.","invariants":["Immutability: The definition pointed to by the Anchor Hash cannot change","Immutable Reference","Resolution: The Anchor must resolve to a valid schema or content"],"parameters":{},"hash":"sema:ConceptAnchor#mh:SHA-256:91873000b379e08c41bc3fe3fea23f1f0870600871f89cca46ecbc87cc1d69d0","stub":"9187","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{}},{"id":"Condition","handle":"Condition#cbd5","gloss":"Interface for patterns that evaluate to a boolean truth-value","mechanism":"A marker interface (Trait). Patterns implementing 'Condition' MUST provide an evaluation logic that returns a strict Boolean (True/False) based on provided context.","invariants":["Boolean Output: Result must be binary.","Decidability: Must always return a value (or error), never hang."],"parameters":{},"hash":"sema:Condition#mh:SHA-256:cbd53b7aaedc24a8cb5f0b95661b5053850b6fd8198ba6d490bc8b7374739c6e","stub":"cbd5","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{}},{"id":"ConfirmationBlock","handle":"ConfirmationBlock#3dae","gloss":"Active search for contradictory evidence","mechanism":"Disconfirmation Seek: After forming hypothesis, ask: \"What evidence would prove me WRONG?\" Actively search for that evidence. Weight disconfirming evidence fairly (don't explain it away). If you can't imagine what would change your mind, belief is not rational. It enforces a pause state until active search has exhausted reasonable counter-evidence.","invariants":["Evidence must be independently verifiable."],"parameters":[{"name":"confirmations_required","type":"Integer","range":"[1, 100]","description":"Blocks before finality"},{"name":"timeout","type":"Duration","range":"[1s, 1h]","description":"Max wait for confirmations"}],"hash":"sema:ConfirmationBlock#mh:SHA-256:3daea9633d69418a61fe6cca9416ab47156bef6d7b594a2c7be753b06205dadf","stub":"3dae","category":"Inference","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{}},{"id":"Constraint","handle":"Constraint#87fe","gloss":"Non-negotiable boundary condition","mechanism":"A boundary condition that must be satisfied by any valid solution. Constraints are non-compensatory: violating one constraint cannot be offset by exceeding another. They come in types: Resource (budget, time), Safety (harm prevention), Legal (compliance), Physical (laws of nature). Constraints propagate via Holographic Inheritance: child tasks inherit parent constraints.","invariants":["Non-Compensatory: Violation of any constraint = rejection.","Inheritance: Child constraints must include all parent constraints.","Explicitness: All constraints must be stated, not implied."],"parameters":{},"hash":"sema:Constraint#mh:SHA-256:87fec7246c97fce8fbd2a8cf829d08f623839f9f6da7a3c4a7db2a2bf70a9551","stub":"87fe","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{}},{"id":"Creative","handle":"Creative#5574","gloss":"Generating novelty and value","mechanism":"The cognitive mode focused on generating novel and valuable ideas, artifacts, or solutions. It involves divergent thinking, making remote associations, and breaking established patterns.","invariants":[],"parameters":{},"hash":"sema:Creative#mh:SHA-256:557440d0f12d6169d83249769ab27aee03e1d662d53c58ae91589c1a6ad4c151","stub":"5574","category":"Strategy","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{}},{"id":"CryptoShred","handle":"CryptoShred#e0b9","gloss":"Provable deletion of liability data","mechanism":"Data is encrypted with a key that is ephemeral. To 'delete' the data, the agent destroys the key (Crypto-shredding) and provides a Zero-Knowledge proof that the key is gone. This turns 'deletion' (which is hard to prove) into 'loss of access' (which is provable).","invariants":["Shred confirmation required."],"parameters":{},"hash":"sema:CryptoShred#mh:SHA-256:e0b99771b604e6fdd9311327bfd36cc7745106047662e6870a8fc7f3aaacaf07","stub":"e0b9","category":"Primitives","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{}},{"id":"Datum","handle":"Datum#31cf","gloss":"Raw unit of fact","mechanism":"A single unit of raw, unprocessed fact. Unlike information, it has no attached meaning yet, just existence. Singular of Data.","invariants":[],"parameters":{},"hash":"sema:Datum#mh:SHA-256:31cf815f74eb603adc09807862a9f295e90a97280509e6078c7cb63eff1edd3b","stub":"31cf","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{}},{"id":"Deep","handle":"Deep#89f0","gloss":"Vertical search dimension","mechanism":"The vertical dimension of search (Recursion/Detail). Recursively expanding a node to increase resolution, as opposed to Broad exploration.","invariants":["Functional Equivalence: Target must answer the same question as Source.","Rigor Increase: Target must have higher compute/context cost than Source.","Resolution Increase: Child nodes must be more specific than parent."],"parameters":{},"hash":"sema:Deep#mh:SHA-256:89f02aa7bc72cf8798b5619ae123bf4da38cff92f5147a436729ce2af17f897b","stub":"89f0","category":"Strategy","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{}},{"id":"ExecutionManifest","handle":"ExecutionManifest#a0d9","gloss":"Binding of Design and Procedure","mechanism":"A composite artifact that binds a 'Target Design' (What to build) with an 'Operation Sequence' (How to build and rollout it). It acts as the atomic 'Release Candidate' for the execution phase.","invariants":["Completeness: Must contain both Specification (Design) and Steps (Procedure).","Resource Bound: Total cost of Steps must be within budget."],"parameters":{},"hash":"sema:ExecutionManifest#mh:SHA-256:a0d9a0d0ec40b83b5b05044e38d37098ebdabf1c63a4e623031458f0896e5538","stub":"a0d9","category":"Protocols","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{}},{"id":"Global","handle":"Global#803d","gloss":"System-wide scope","mechanism":"Scope modifier indicating that a concept or operation applies to the entire system or context, rather than a local subset.","invariants":[],"parameters":{},"hash":"sema:Global#mh:SHA-256:803d9dfe9fd3e6b4901fcc0dcbbcdaba7861b3ce89146d012ca78857b176e7ab","stub":"803d","category":"Protocols","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{}},{"id":"Hypothesis","handle":"Hypothesis#e95b","gloss":"A tentative explanation","mechanism":"A tentative explanation or prediction that is subject to verification or falsification.","invariants":[],"parameters":{},"hash":"sema:Hypothesis#mh:SHA-256:e95b94f3066236d1b543330c46d177a5e2e590ea5bdd97953f589226a9f11812","stub":"e95b","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{}},{"id":"InputGuard","handle":"InputGuard#0770","gloss":"Input validation and sanitization","mechanism":"A validation filter that sanitizes inputs before they reach a sensitive component. It enforces schema compliance, type safety, and constraint satisfaction. Upon violation, it triggers a fail-closed behavior, rejecting the input and logging the attempt.","invariants":[],"parameters":{},"hash":"sema:InputGuard#mh:SHA-256:077022daa9665f3562ad8253b9b6c63ccf7e71d84b74ab48c44e6de421b8bdcb","stub":"0770","category":"Verification","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{}},{"id":"Kairos","handle":"Kairos#5e42","gloss":"Sensing the opportune moment","mechanism":"Aggregates environmental signals (receptivity, system load, friction) to calculate a 'Readiness Potential'. Returns TRUE if the potential exceeds the sensitivity threshold.","invariants":["Ephemerality: A True result at t=0 implies nothing about t+1.","Non-Compensatory: If the moment is wrong, more effort cannot fix it."],"parameters":[{"name":"sensitivity","type":"Float","range":"[0.0, 1.0]","description":"Readiness threshold (0 = always ready, 1 = never ready)"},{"name":"window","type":"Duration","range":"unspecified","description":"Observation window for aggregating readiness signals"}],"hash":"sema:Kairos#mh:SHA-256:5e4224ffffb7866b6c865b3b95fee40b2259e6b515ee594a680d9f0ed7c18314","stub":"5e42","category":"Strategy","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{}},{"id":"Lock","handle":"Lock#5bf2","gloss":"Mutual exclusion enforcement","mechanism":"A synchronization primitive that enforces exclusive access to a resource.","invariants":[],"parameters":{},"hash":"sema:Lock#mh:SHA-256:5bf2a80b6c73a11da68f702922d5180259c75ff50fb094607da3ab4d7c167dc2","stub":"5bf2","category":"Primitives","layer":"Physics","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{}},{"id":"MECE","handle":"MECE#8cb0","gloss":"Mutually Exclusive, Collectively Exhaustive partitioning","mechanism":"Exhaustive Partition: Divide problem space into categories that are Mutually Exclusive (no overlap) and Collectively Exhaustive (no gaps). Test: Can any item belong to two categories? Is any item uncategorized? Refine until both tests pass.","invariants":["Exclusivity: Intersection(Subset_i, Subset_j) == NULL","Exhaustiveness: Union(Subsets) == UniversalSet"],"parameters":[{"name":"max_depth","type":"Int","range":"[1, 10]","description":"How deep the tree can go"},{"name":"misc_tolerance","type":"Float","range":"[0.0, 0.1]","description":"Max % of items allowed in 'Other'"}],"hash":"sema:MECE#mh:SHA-256:8cb062d51bcfd89368c58a5e6247e2070596f01be8e03382dd19a0c61abe8c1b","stub":"8cb0","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{}},{"id":"Meta","handle":"Meta#90f4","gloss":"Higher-order abstraction","mechanism":"A higher-order modifier indicating self-reference or abstraction (Thinking about Thinking).","invariants":[],"parameters":{},"hash":"sema:Meta#mh:SHA-256:90f452433c8b16a65d5842745b4cbb586957b1f45becbfca2322fece945ad3ee","stub":"90f4","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{}},{"id":"MonitorReport","handle":"MonitorReport#063c","gloss":"Deployment telemetry artifact","mechanism":"A telemetry artifact comparing the deployed state against a 'Definition of Done'. Generated to close the feedback loop.","invariants":[],"parameters":{},"hash":"sema:MonitorReport#mh:SHA-256:063cc5c1f90b2e11e3446ddfaec7034ed51acb83432fe11ba2d1e7151ac0d42d","stub":"063c","category":"Protocols","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{}},{"id":"Option","handle":"Option#483e","gloss":"A discrete, executable alternative","mechanism":"A discrete, actionable alternative within a decision space. An Option must be fully specified (executable) and mutually exclusive from other options in the same set. It represents a valid path for state transition.","invariants":[],"parameters":{},"hash":"sema:Option#mh:SHA-256:483eebf0a4fdc817585be429278bf1c8c56b815249bbf91501073dce1453cf13","stub":"483e","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{}},{"id":"Parallel","handle":"Parallel#6272","gloss":"Concurrent flow","mechanism":"Concurrent execution: A and B simultaneously. No ordering guarantee.","invariants":[],"parameters":{},"hash":"sema:Parallel#mh:SHA-256:6272e213685ff8b1c909c783ae0859f93c55d3423c4278661a4b601ddf07d7a3","stub":"6272","category":"Time","layer":"Physics","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{}},{"id":"Prompt","handle":"Prompt#5ded","gloss":"Model input instruction","mechanism":"The input text or instruction provided to a generative model.","invariants":[],"parameters":{},"hash":"sema:Prompt#mh:SHA-256:5dedb478148eb9ca7b2621a571316aefcdb475174141a64c04c0a8c890355107","stub":"5ded","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{}},{"id":"Protocol","handle":"Protocol#7e1c","gloss":"Communication standard","mechanism":"A defined set of rules and formats for communication between agents.","invariants":[],"parameters":{},"hash":"sema:Protocol#mh:SHA-256:7e1cc426d8550edc0ee84d4e4fd7b7dc3aecdfad496dc3e2cc636c36a7f4389e","stub":"7e1c","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{}},{"id":"Prototype","handle":"Prototype#ff18","gloss":"Testable early model","mechanism":"An early sample, model, or release of a product built to test a concept or process or to act as a thing to be learned from. It is generally low-fidelity and disposable.","invariants":[],"parameters":{},"hash":"sema:Prototype#mh:SHA-256:ff187305136dd60765caedabd5eefbc62c94b20909c4886f4baef3c9523e83c7","stub":"ff18","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{}},{"id":"Reflex","handle":"Reflex#ea07","gloss":"Hardcoded fast-path responses bypassing deliberation","mechanism":"Immediate Automatic Response: Stimulus S triggers response R without deliberation. Reflex arc hardcoded. Response latency minimal. No override possible once triggered. Used for safety-critical reactions. It bypasses the slow reasoning entirely, mapping stimulus directly to a pre-computed response.","invariants":["Stimulus-response mapping immutable at runtime."],"parameters":{},"hash":"sema:Reflex#mh:SHA-256:ea07e889ca64536b2f0d0657d1583a178ea36fe2fda6c26889c68d46e44a47ce","stub":"ea07","category":"Strategy","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{}},{"id":"RolloutManifest","handle":"RolloutManifest#9e7f","gloss":"Deployment execution log","mechanism":"The immutable record of actions taken during a deployment, including configuration states, feature flag settings, and deployment targets. It serves as the baseline for monitoring.","invariants":["Immutability: Cannot be modified after deployment.","Completeness: Must record all state changes applied."],"parameters":{},"hash":"sema:RolloutManifest#mh:SHA-256:9e7fe2b3bcd73879f8f55164530c8f5e6773a39b9719cfaca8dce18452ac1463","stub":"9e7f","category":"Protocols","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{}},{"id":"Sandbox","handle":"Sandbox#2be7","gloss":"Isolation boundary","mechanism":"An isolated execution environment that restricts side effects.","invariants":[],"parameters":{},"hash":"sema:Sandbox#mh:SHA-256:2be7b830454b430d8008cb54622a5c1a6434a6e076d7bbdaca4d2a5b1a1dadf0","stub":"2be7","category":"Primitives","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{}},{"id":"Scratchpad","handle":"Scratchpad#75bf","gloss":"Working memory for intermediate reasoning steps","mechanism":"A designated working memory region where the agent can write intermediate calculations, partial results, and notes-to-self during multi-step reasoning. Unlike the main output, scratchpad content is explicitly for the agent's own use and may be hidden from the final response. Prevents context pollution while enabling complex reasoning. It provides the persistence layer for chain-of-thought, storing the intermediate states of the reasoning process.","invariants":["Bounded: Maximum scratchpad size is enforced","Persistence: Contents survive across reasoning steps within a task","Separation: Scratchpad content is distinct from final output"],"parameters":{},"hash":"sema:Scratchpad#mh:SHA-256:75bf0d045bf0907b1412c0698a7a5f7cffb2963b653646c0831ec1d3bdab186e","stub":"75bf","category":"Memory","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{}},{"id":"Select","handle":"Select#15c2","gloss":"Generic selection of items from a set based on criteria","mechanism":"Deterministic Filter. Applies a Predicate Function P(x) to every element in Input Set S. Returns a new Subset S' containing only elements where P(x) is True. It filters a set based on specific inclusion criteria.","invariants":["Predicate Truth: For all x in Output, Criterion(x) must be True.","Subset Property: Output must be a subset of Input (no new items created).","Determinism: Same input set + same criteria = same output set."],"parameters":[{"name":"limit","type":"Integer","range":"[1, 10000]","description":"Max items to return"},{"name":"strategy","type":"Enum","range":"{Filter, First, Random}","description":"Default: Filter"}],"hash":"sema:Select#mh:SHA-256:15c257d42d18f33a5a4bdf1ef5ab16712dfd0293cd03ebb28ce746a119f0dfcc","stub":"15c2","category":"Primitives","layer":"Infrastructure","signature":[],"preconditions":["Criterion is decidable for item type","Input set is iterable"],"postconditions":["Subset returned"],"failureModes":[],"dependencies":{}},{"id":"Sequence","handle":"Sequence#b0b8","gloss":"Sequential ordering","mechanism":"Ordered execution: A then B. Output of A available to B.","invariants":[],"parameters":{},"hash":"sema:Sequence#mh:SHA-256:b0b8e964bbbea762dc40b4b6c1f26de9542a2fec19412e0094c7288c2a54553f","stub":"b0b8","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{}},{"id":"Signal","handle":"Signal#f39d","gloss":"Raw information emission","mechanism":"Emission of information into environment. No guaranteed recipient. Fire-and-forget.","invariants":["Broadcast: Signal is available to any observer in the medium.","Information: Must distinguish itself from noise."],"parameters":{},"hash":"sema:Signal#mh:SHA-256:f39d9ead873eb693a51f3944066dae67a238b07cd9ba6e194023785fa7d884fe","stub":"f39d","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{}},{"id":"Skeleton","handle":"Skeleton#c363","gloss":"Parallel outline-first topology","mechanism":"First generates a skeletal outline of the answer, then expands each point in parallel. Optimizes for latency over depth. Defines the parallel structure for rapid reasoning.","invariants":["Independence: Expansion of Point A must not depend on Point B."],"parameters":{},"hash":"sema:Skeleton#mh:SHA-256:c363c9db1e917d4920a28b689c8e0f3fcfcd7060fde1963cea22b352570d5c87","stub":"c363","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{}},{"id":"Step","handle":"Step#5f22","gloss":"Atomic action with pre/post conditions","mechanism":"An atomic unit of action. It specifies: 1. Preconditions (what must be true before), 2. Action (what to do), 3. Postconditions (what will be true after), 4. Rollback (how to undo if needed). It acts as a node in a causal graph.","invariants":["Atomicity: A Step either fully completes or fully rolls back.","Causal Closure: Step preconditions must be satisfiable by prior steps or initial state."],"parameters":{},"hash":"sema:Step#mh:SHA-256:5f2205a7812b52b35dd75469367956e838a99360de7fde55e1585bd155eed128","stub":"5f22","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{}},{"id":"System","handle":"System#e314","gloss":"Complex whole of interacting parts","mechanism":"A set of interacting or interdependent component parts forming a complex/intricate whole. Systems have boundaries, structure, and purpose (or function) expressed in their interactions.","invariants":[],"parameters":{},"hash":"sema:System#mh:SHA-256:e314d24e05d0e9ffaaa9c44b249bca8882f00ae6596af18edd245a4fe9df5f0e","stub":"e314","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{}},{"id":"Topology","handle":"Topology#2408","gloss":"Interface for reasoning structures","mechanism":"Defines the node-edge structure of a reasoning process. Returns the 'Shape' of execution (e.g., Linear, Tree, DAG, Cyclic).","invariants":[],"parameters":{},"hash":"sema:Topology#mh:SHA-256:240866adb33767b1d651245af4038bfbcb29a575b2704288273eba41937e0560","stub":"2408","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{}},{"id":"Variable","handle":"Variable#179a","gloss":"Mutable value","mechanism":"A value that can change or adapt within the system. It represents a dimension of freedom in the problem space.","invariants":[],"parameters":{},"hash":"sema:Variable#mh:SHA-256:179a757268e1c339725e09418eba7989ba1ffb2148e8b0f1241d2ff90062116c","stub":"179a","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{}},{"id":"Vector","handle":"Vector#c7c4","gloss":"Semantic position array","mechanism":"A multi-dimensional array of numbers representing a position in a semantic space.","invariants":[],"parameters":{},"hash":"sema:Vector#mh:SHA-256:c7c4d97d3416646673aa3d70d27aa4da40c7c2ae86180c92901a0e23429ffedc","stub":"c7c4","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{}},{"id":"CompatibilityCheck","handle":"CompatibilityCheck#3abb","gloss":"Schema compatibility verification","mechanism":"A binary verification process that compares the definition hashes or schema of two entities (agents, Artifact#6254s, or protocols) to determine if they can interact without translation.","invariants":["Determinism: Identical inputs always yield the same compatibility result.","Symmetry: If A is compatible with B, B is compatible with A."],"parameters":{},"hash":"sema:CompatibilityCheck#mh:SHA-256:3abb595523dc765c8ebe497169cd2c12494c93a85e50c8785577cef22c465554","stub":"3abb","category":"Verification","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"artifact":"Artifact#6254"}}},{"id":"Criteria","handle":"Criteria#ef6b","gloss":"Judgment standards","mechanism":"The specific standards used to judge the success of an Artifact#6254. e.g., 'must be under $50'. Used by the judgment.","invariants":[],"parameters":{},"hash":"sema:Criteria#mh:SHA-256:ef6b31198694b637dc1eca8e24c56057b6df0e90fba8f32de8a7c15b747cdbe0","stub":"ef6b","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"artifact":"Artifact#6254"}}},{"id":"Deduction","handle":"Deduction#9c88","gloss":"General to specific logic","mechanism":"Moving from general rules (Axiom#5012) to specific conclusions. If premises are true, the conclusion MUST be true. (All men are mortal -> Socrates is a man -> Socrates is mortal).","invariants":["Truth Preservation: If premises are true, conclusion MUST be true.","Validity: The argument structure follows formal logic rules."],"parameters":{},"hash":"sema:Deduction#mh:SHA-256:9c881288e30f01162b178b66fc1299a776dc08cc5add52ac8b31fe51d552dd12","stub":"9c88","category":"Reasoning","layer":"Mind","signature":[],"preconditions":["Premises are accepted as true"],"postconditions":["Conclusion is logically necessary"],"failureModes":[],"dependencies":{"references":{"axiom":"Axiom#5012"}}},{"id":"Hierarchy","handle":"Hierarchy#aa9b","gloss":"Vertical ranking","mechanism":"The vertical ranking of Category#1ab7s or objects. Defines Upper vs. Lower relationships, inheritance, and authority.","invariants":[],"parameters":{},"hash":"sema:Hierarchy#mh:SHA-256:aa9bec7346dca2ce2e83a70fc352825aa78c907cd82a8306f7e6856e42ef245c","stub":"aa9b","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"category":"Category#1ab7"}}},{"id":"FeatureFlag","handle":"FeatureFlag#9464","gloss":"Runtime functionality toggle","mechanism":"A toggle point in the code that allows functionality to be enabled or disabled at runtime based on a Condition#cbd5. It decouples deployment from release, enabling safer rollouts and A/B testing.","invariants":[],"parameters":{},"hash":"sema:FeatureFlag#mh:SHA-256:9464b708479fc75cc5d825850393199c41c35e06f20a2861954e98f8edcfa8a8","stub":"9464","category":"Protocols","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"condition":"Condition#cbd5"}}},{"id":"Gate","handle":"Gate#206d","gloss":"Filter payload if the target condition is not met","mechanism":"Evaluates the truth-value of the target Condition#cbd5. If the result is FALSE, the Gate DROPS the current payload/message but allows the system to continue processing other items (Fail-Safe/Filter). If TRUE, the payload passes through.","invariants":["Idempotent: Re-evaluating the gate with the same context yields the same result (within validity window).","Non-Blocking: A false condition must not halt the broader system, only the specific item."],"parameters":[{"name":"policy","type":"Enum","range":"unspecified","description":"Behavior on condition failure (reject, queue, redirect)"}],"hash":"sema:Gate#mh:SHA-256:206dc9be76b20fcc7c96b06c6c9eb8ce243565d02ce064b4206caaa46871a96d","stub":"206d","category":"Primitives","layer":"Physics","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"condition":"Condition#cbd5"}}},{"id":"ConstraintFirst","handle":"ConstraintFirst#c7cb","gloss":"Defining boundaries before content","mechanism":"The agent first generates the 'negative space' (the Constraint#87fes, safety rules, and format requirements), defining a rigid container. Only THEN does it generate the content to fill that container. It separates 'form' from 'function'. This prevents the generation of content that is creative but invalid.","invariants":["Constraints immutable during operation."],"parameters":{},"hash":"sema:ConstraintFirst#mh:SHA-256:c7cb09081701787022c33fa3b1399bd847b0062cf223851c4d98024b640feb99","stub":"c7cb","category":"Protocols","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"constraint":"Constraint#87fe"}}},{"id":"Reversibility","handle":"Reversibility#049f","gloss":"Condition: Can this action be undone?","mechanism":"Evaluates whether the post-state of an action allows a return to the pre-state with zero information loss (or within acceptable cost). Returns TRUE for Type 2 decisions (reversible), FALSE for Type 1 (one-way doors).","invariants":["Entropy Constraint#87fe: Reversal must not violate thermodynamic limits (e.g., cannot un-burn toast)."],"parameters":[{"name":"cost_limit","type":"Cost","range":"unspecified","description":"Maximum acceptable cost to reverse the action"}],"hash":"sema:Reversibility#mh:SHA-256:049f5fd98135ec288888fa61056f65a7e46067b06eaa5e7cee7a7bd3bfef2f74","stub":"049f","category":"Protocols","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"constraint":"Constraint#87fe"}}},{"id":"Anomaly","handle":"Anomaly#7987","gloss":"Deviation from expectation","mechanism":"A piece of Datum#31cf that deviates from the expected standard or pattern. It creates the spark for thinking and often triggers further investigation.","invariants":[],"parameters":{},"hash":"sema:Anomaly#mh:SHA-256:7987f2cd4a353f206fccd038ddac021ef849cfa58e352d2d2d7ba3850b916893","stub":"7987","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"datum":"Datum#31cf"}}},{"id":"Assumption","handle":"Assumption#efb5","gloss":"Provisional truth","mechanism":"A gap-filler used when Datum#31cf is missing; treated as true temporarily to allow thinking to proceed. Must be tracked and validated.","invariants":["Provisionality: Must be explicitly flagged as unverified.","Tracking: Must maintain a link to the missing datum it replaces."],"parameters":{},"hash":"sema:Assumption#mh:SHA-256:efb5be2691c91cb98b493543154f2a9d7d492911088e3bf1cbc048f5ac317978","stub":"efb5","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"datum":"Datum#31cf"}}},{"id":"CognitiveBias","handle":"CognitiveBias#4b32","gloss":"Structural processing error definition","mechanism":"A structural error definition describing a specific distortion in information processing. The 'lens' is curved, distorting the interpretation of Datum#31cf.","invariants":[],"parameters":{},"hash":"sema:CognitiveBias#mh:SHA-256:4b32f79732d4468fa0de4facb106dbbd2889bfa1d3ce62e77b09e606011680c9","stub":"4b32","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"datum":"Datum#31cf"}}},{"id":"Induction","handle":"Induction#2487","gloss":"Specific to general logic","mechanism":"Moving from specific observations (Datum#31cf) to general rules. The conclusion is probable, not certain. (The sun rose today -> The sun rises every day).","invariants":["Probabilistic: Conclusions are probable, not certain.","Generalization: Output rule covers more cases than Input data."],"parameters":{},"hash":"sema:Induction#mh:SHA-256:2487959ee211affb6f6ec74764316eb616e33c815603cf12b59518ab0bcfca54","stub":"2487","category":"Reasoning","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"datum":"Datum#31cf"}}},{"id":"Abduction","handle":"Abduction#fe2b","gloss":"Inference to best explanation","mechanism":"The 'best guess' based on incomplete observation. Inference to the best explanation. (The grass is wet -> It probably rained). Triggers Hypothesis#e95b generation.","invariants":[],"parameters":{},"hash":"sema:Abduction#mh:SHA-256:fe2b40824246fd245dec338d1615e791787806b540b9376aae5fac14c48ce02b","stub":"fe2b","category":"Reasoning","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"hypothesis":"Hypothesis#e95b"}}},{"id":"Overlap","handle":"Overlap#bcfa","gloss":"Transform negotiations from position-based battles to interest-based discovery of shared ground","mechanism":"Before stating positions, each agent declares their ACCEPT-SET: all outcomes they can live with. Sets are hash-committed before reveal (commit-reveal protocol). Compute intersection. If non-empty, select from intersection. If empty, both agents EXPAND accept-sets by one step and recompute. Repeat until overlap found or expansion-limit hit. It employs MECE#8cb0 partitioning to cleanly identify the intersection of distinct accept-sets.","invariants":["Private regions respected","Shared region contains agreed facts"],"parameters":{},"hash":"sema:Overlap#mh:SHA-256:bcfa7595ad18e8227f2019bedc717a67f3ffca1871ab9abfd02ff9cbf18cdfbb","stub":"bcfa","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":["Two ontologies/datasets"],"postconditions":["Intersection identified"],"failureModes":[],"dependencies":{"references":{"mece":"MECE#8cb0"}}},{"id":"Nature","handle":"Nature#6c1a","gloss":"Ontological origin classification","mechanism":"The substrate classification of an entity (e.g. Biological, Synthetic, or Institutional). It serves as the immutable input for downstream Protocol#7e1cs to determine alignment obligations, rights, and authentication requirements.","invariants":[],"parameters":{},"hash":"sema:Nature#mh:SHA-256:6c1a88dcf3f53f945e8fa9a4c8a04b8e23819954de102cd266c999447c12314b","stub":"6c1a","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"protocol":"Protocol#7e1c"}}},{"id":"ProtoPack","handle":"ProtoPack#6597","gloss":"Prototype verification artifact","mechanism":"An Artifact#6254 of a prototyping phase, containing a low-fidelity Prototype#ff18 simulation trace or model. It serves as evidence of feasibility before full resource commitment.","invariants":["Feasibility Proof: Must demonstrate viability of critical path.","Low Fidelity: Should not be a production-ready artifact."],"parameters":{},"hash":"sema:ProtoPack#mh:SHA-256:6597fa92b7426d373e1d05d6a7fd1f8c1416c00c78dfab8e35e5a6264c1453d6","stub":"6597","category":"Protocols","layer":"Society","signature":["Artifact(Prototype)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"prototype":"Prototype#ff18","artifact":"Artifact#6254"}}},{"id":"Probe","handle":"Probe#9f2b","gloss":"Active verification query","mechanism":"An active query that returns verifiable information about system or environment state. Unlike passive observation, a Probe interacts with its target to extract ground truth. It is the primitive mechanism for verification. Probes have cost (resources to execute) and latency (time to return). Stateful probes execute in a Sandbox#2be7 to prevent production impact.","invariants":["Ground Truth: Probe result reflects actual state at time of query.","Repeatability: Same probe on unchanged state returns same result.","Cost Bound: Probe execution must complete within specified resource limits.","Non-Destructive: Production state must remain invariant."],"parameters":[{"name":"difficulty","type":"Int","range":"[1-5]","description":"Complexity of the verification challenge (1 = trivial, 5 = hard)"},{"name":"timeout_ms","type":"Int","range":"[100, 30000]","description":"Maximum milliseconds to wait for probe response"},{"name":"verification_mode","type":"Enum","range":"{StaticVector, Procedural, Sandbox, StakedReport}","description":"Method used to verify probe response"}],"hash":"sema:Probe#mh:SHA-256:9f2bf351c42ae5107e43cced5947ba813d8c1f7bc9f469a2551cbc0425637dfa","stub":"9f2b","category":"Primitives","layer":"Infrastructure","signature":[],"preconditions":["Response timeout defined","Target agent addressable"],"postconditions":["No side effects on production target","Probe cost paid","Target capability verified OR timeout"],"failureModes":[],"dependencies":{"references":{"sandbox":"Sandbox#2be7"}}},{"id":"Ballot","handle":"Ballot#c5c5","gloss":"Immutable container for collective decision inputs","mechanism":"A structured container for a decision proposal. Contains: the question being decided, available options, voting rules (majority/supermajority/unanimity), and deadline. The Ballot is immutable once cast—amendments require a new Ballot.","invariants":["Completeness: Must specify question, options, and decision rule","Immutability: Once created, a Ballot cannot be modified"],"parameters":{},"hash":"sema:Ballot#mh:SHA-256:c5c5f7a0dc23a23835d0b9f8ce25f104818431062160e753010e4077e7a27062","stub":"c5c5","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"select":"Select#15c2"}}},{"id":"Decision","handle":"Decision#acfb","gloss":"Irrevocable selection from a set of options","mechanism":"The cognitive act of committing to a specific Option#483e after weighing alternatives. It transforms a set of possibilities into a single committed trajectory using Select#15c2. Unlike a simple filter, a Decision implies the resolution of ambiguity and the assumption of consequences.","invariants":["Selection: Must choose exactly one option from the available set.","Irrevocability: Once made, the decision cannot be unmade without a new Decision process."],"parameters":{},"hash":"sema:Decision#mh:SHA-256:acfb3458cde8e55c378b2f51b44afc30687b58093f1777299f49caca475274a1","stub":"acfb","category":"Reasoning","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"select":"Select#15c2","option":"Option#483e"}}},{"id":"Rank","handle":"Rank#cb98","gloss":"Order items by score","mechanism":"Deterministic Sort. Applies a scoring function to every element in the input Set. Returns a List ordered by Score, using Select#15c2 to truncate to Top-K.","invariants":["Conservation: Output set is a subset of Input set.","Monotonicity: For all i, Score(Output[i]) >= Score(Output[i+1])."],"parameters":{},"hash":"sema:Rank#mh:SHA-256:cb98b1357a2b6e14ff1e76bca44014fabffb0936b453ba88c3ad4561a63d3c2f","stub":"cb98","category":"Reasoning","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"composes_with":{"select":"Select#15c2"}}},{"id":"Message","handle":"Message#f767","gloss":"Structured signal container","mechanism":"A structured container for a Signal#f39d, adding Metadata (Sender, Recipient, Timestamp) to the raw emission.","invariants":["Immutability: Once sent, the message content cannot be changed.","Addressability: Must contain Sender and (optional) Recipient identifiers."],"parameters":{},"hash":"sema:Message#mh:SHA-256:f7678d6d403b174dec233b366b6f352da445c31ab2577c7314dd0b1d52161d7f","stub":"f767","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"signal":"Signal#f39d"}}},{"id":"Silence","handle":"Silence#dd79","gloss":"Active withholding of signal","mechanism":"Active Waiting. The agent deliberately withholds Signal#f39d output for duration T or until Trigger. Distinguishes 'Processing...' from 'Abstaining'.","invariants":["Timeout: Silence > MaxDuration implies Failure or Default Action."],"parameters":{},"hash":"sema:Silence#mh:SHA-256:dd793ba60c09b5f61e3de738047e725509758d63311879876b400ff563619ea5","stub":"dd79","category":"Strategy","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"signal":"Signal#f39d"}}},{"id":"SpectralTune","handle":"SpectralTune#6c65","gloss":"Verifying ontology alignment before data transfer","mechanism":"Instead of sending a message and hoping it is understood, the sender transmits a 'tuning Signal#f39d'—a sequence of hash-based challenges representing the semantic context (ontology, assumptions, version). The receiver must 'resonate' by proving they hold the matching semantic context.","invariants":["Atomic Tuning: No payload data is processed before Tune_ACK","Fail-Fast: On hash mismatch, DO NOT RETRY tuning. Halt immediately and escalate to negotiation or human review","Hash Match: Receiver.context_hash must equal Sender.context_hash"],"parameters":[{"name":"context_chunks","type":"List[String]","range":"unspecified","description":"Prompts to hash"},{"name":"hash_algo","type":"String","range":"{BLAKE3, SHA256}","description":"Hash algorithm for semantic context verification"},{"name":"max_retries","type":"Integer","range":"[0, 1]","description":"Default 0; prevents infinite negotiation loops"}],"hash":"sema:SpectralTune#mh:SHA-256:6c65e21711b7203fcd84ed58755cd57239cda2e09a1e66ddf81e407edcd5eeb7","stub":"6c65","category":"Protocols","layer":"Society","signature":[],"preconditions":["Both agents possess valid hash function H"],"postconditions":["Channel is established OR Connection terminated"],"failureModes":[],"dependencies":{"accepts":{"signal":"Signal#f39d"}}},{"id":"State","handle":"State#4d58","gloss":"System condition at time T","mechanism":"The stored information representing the current Condition#cbd5 of a System#e314.","invariants":["Persistence: State remains constant unless acted upon.","Uniqueness: At time T, the system has exactly one State."],"parameters":{},"hash":"sema:State#mh:SHA-256:4d582a0ac4af7ae886c83da9825e07c39f1e72ece21fd65a40b6a4fc71882721","stub":"4d58","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"condition":"Condition#cbd5","system":"System#e314"}}},{"id":"Linear","handle":"Linear#81af","gloss":"Sequential non-branching topology","mechanism":"A non-branching Topology#2408 where execution follows a strict Sequence#b0b8. Step(N) depends only on Step(N-1). This is the simplest reasoning shape, equivalent to a 'Chain'.","invariants":["Single Successor: Every node has at most one child.","Single Predecessor: Every node has at most one parent."],"parameters":{},"hash":"sema:Linear#mh:SHA-256:81affcd5f7c1ea56b7572799fc235cf95d4e3c692de77c9eb8c01930b8e1d41c","stub":"81af","category":"Primitives","layer":"Physics","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"topology":"Topology#2408","sequence":"Sequence#b0b8"}}},{"id":"Tree","handle":"Tree#ddce","gloss":"Branching reasoning topology","mechanism":"A branching Topology#2408 where multiple lines of reasoning are explored simultaneously. Allows backtracking and pruning of unpromising branches (BFS/DFS). Equivalent to 'tree-of-thoughts reasoning'.","invariants":["Rootedness: All nodes descend from a single root.","Acyclicity: No node is an ancestor of itself."],"parameters":[{"name":"breadth","type":"Integer","range":"unspecified","description":"Maximum branches explored per reasoning node"},{"name":"depth","type":"Integer","range":"[1, 20]","description":"Maximum tree depth"}],"hash":"sema:Tree#mh:SHA-256:ddce179b1f23b64fe76513a37d8d3c9319e0460f191a5c124b3372b8c4d2f415","stub":"ddce","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"topology":"Topology#2408"}}},{"id":"Correlation","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.","invariants":[],"parameters":{},"hash":"sema:Correlation#mh:SHA-256:091fbf1f3baec2028bbd64c9d2ff335ef41d9ec6ec992e1967c5bca02c777625","stub":"091f","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"variable":"Variable#179a"}}},{"id":"Critique","handle":"Critique#3e00","gloss":"Qualitative feedback generation","mechanism":"Analyzes a target Datum#31cf against specific Criteria#ef6b and generates a structured Assessment#a765. Unlike judgment (which yields a scalar), Critique produces descriptive, actionable advice.","invariants":["Feedback must be descriptive, not just scalar.","Must reference specific criteria."],"parameters":[{"name":"criteria","type":"List[String]","range":"unspecified","description":"Evaluation dimensions to assess against"}],"hash":"sema:Critique#mh:SHA-256:3e00cb143ce745ed77a29af93416808b848b2a2d9749245b777ad90901aa4ba8","stub":"3e00","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"yields":{"assessment":"Assessment#a765"},"accepts":{"datum":"Datum#31cf"},"references":{"criteria":"Criteria#ef6b"}}},{"id":"Check","handle":"Check#1544","gloss":"Non-blocking truth evaluation","mechanism":"A non-blocking verification primitive. Evaluates the truth-value of a Condition#cbd5 against a target and returns a Boolean status. Unlike a Gate#206d (which alters control flow based on the result), a Check is purely observational and side-effect free. It answers 'Is this true?' without deciding 'Should we stop?'.","invariants":["Side-Effect Free: Running a check must not mutate the target state.","Determinism: Same input context yields same boolean result."],"parameters":{},"hash":"sema:Check#mh:SHA-256:1544e646894003b4bac963cee70097a4bffd75f6cb753f218befb2079f8383a6","stub":"1544","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"gate":"Gate#206d","condition":"Condition#cbd5"}}},{"id":"SurvivorCorrect","handle":"SurvivorCorrect#45db","gloss":"Accounting for silent failures in data","mechanism":"Failure Inclusion: When learning from examples, ask: \"Am I only seeing successes?\" Estimate base rate of attempts. Seek out failures and near-misses. The pattern that \"all successful X do Y\" means nothing if failed X also did Y. Denominator matters. Utilizes BaseRateInclude#aa0b.","invariants":["CognitiveBias#4b32 reduced","Sample re-weighted to account for missing data"],"parameters":{},"hash":"sema:SurvivorCorrect#mh:SHA-256:45db899fcfc34876e7be9c72005d3c45d5d5983c6c24a357b2df33d189e7effa","stub":"45db","category":"Inference","layer":"Mind","signature":[],"preconditions":["Filtered dataset (survivors only)"],"postconditions":["True population estimate"],"failureModes":[],"dependencies":{"references":{"cognitive_bias":"CognitiveBias#4b32","base_rate_include":"BaseRateInclude#aa0b"}}},{"id":"Identity","handle":"Identity#626c","gloss":"Unique agent context (The Who)","mechanism":"The unique distinguishing context of an agent, including its history, reputation, and public keys. Distinguishes 'Self' from 'Other'. Unlike Nature#6c1a (what you are) or Role (what you do), Identity is the persistent handle that tracks an entity across interactions.","invariants":[],"parameters":{},"hash":"sema:Identity#mh:SHA-256:626c6180c1969117e0375625c31d4e39b77e6330d3a197dc7099acf85d1d57b3","stub":"626c","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"nature":"Nature#6c1a"}}},{"id":"Quorum","handle":"Quorum#f67a","gloss":"Minimum participation threshold","mechanism":"A threshold-checking primitive. Validates if a count of Ballot#c5c5 signals exceeds a required number (K). It does not negotiate; it simply counts. Used as a gating function for higher-level protocols.","invariants":["K cannot decrease mid-vote."],"parameters":[{"name":"threshold","type":"Float","range":"[0.5, 1.0]","description":"Fraction required for consensus"},{"name":"total_members","type":"Integer","range":"[3, 100]","description":"Size of voting pool"}],"hash":"sema:Quorum#mh:SHA-256:f67a77baba883520bde348b7ead4a1abad51fe36fd65539f8dc66cdaa2616efd","stub":"f67a","category":"Primitives","layer":"Infrastructure","signature":[],"preconditions":["N agents in voting set. K threshold defined where K ≤ N. Proposal formulated."],"postconditions":["Result selected (approve/reject/timeout)","Voting tally recorded"],"failureModes":[],"dependencies":{"accepts":{"ballot":"Ballot#c5c5"}}},{"id":"TradeOff","handle":"TradeOff#769c","gloss":"Exchange of consequences","mechanism":"The specific negative consequence accepted in exchange for a positive one. The cost of a Decision#acfb. There are no solutions, only trade-offs.","invariants":["Opportunity Cost: Selecting X implies rejecting Y.","Explicit Recognition: The cost is acknowledged, not ignored."],"parameters":{},"hash":"sema:TradeOff#mh:SHA-256:769c61729ff84c1f887e3e075f3a94948094da3ecde8bd9ca9f5034717b1e0d0","stub":"769c","category":"Strategy","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"decision":"Decision#acfb"}}},{"id":"Entropy","handle":"Entropy#a265","gloss":"Measure of disorder","mechanism":"A quantitative measure of disorder, uncertainty, or information content in a System#e314 or Message#f767.","invariants":[],"parameters":{},"hash":"sema:Entropy#mh:SHA-256:a2652f69c57b3c737f3d0d910e6751d61ea2e9007046ac0f75ee336d178c9212","stub":"a265","category":"Primitives","layer":"Physics","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"system":"System#e314","message":"Message#f767"}}},{"id":"Stream","handle":"Stream#22f3","gloss":"Continuous data flow","mechanism":"An ordered, potentially unbounded sequence of Messages. Represents real-time data pipes, log feeds, or conversational histories. Streams support operations like mapping, filtering, and backpressure. Utilizes Message#f767.","invariants":["Ordering: Messages M_n and M_n+1 maintain relative sequence.","Causality: Effects cannot precede causes in the stream."],"parameters":{},"hash":"sema:Stream#mh:SHA-256:22f34aeb7fa579ab417c94c54424d1b54e73097208077c890b0e429be87c9f71","stub":"22f3","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":["A Source emitting Messages"],"postconditions":[],"failureModes":[],"dependencies":{"references":{"message":"Message#f767"}}},{"id":"OntologyHandshake","handle":"OntologyHandshake#ead0","gloss":"Negotiating shared definitions","mechanism":"Before exchanging data, agents exchange 'definition hashes' for key terms using CompatibilityCheck#3abb. If hashes mismatch, they enter a negotiation phase to map their internal ontologies to a temporary shared dictionary (a 'pidgin' Protocol#7e1c). It uses SpectralTune#6c65 to rapidly identify semantic divergence before negotiating definitions.","invariants":["Term Consistency, Mapping Bijectivity"],"parameters":{},"hash":"sema:OntologyHandshake#mh:SHA-256:ead055e44f108319ace229e30005ea5a3aaf8df540ccf1c1cf0f855aed45e613","stub":"ead0","category":"Protocols","layer":"Society","signature":[],"preconditions":["Both agents have ontologies. Communication channel open. Ontology serializable."],"postconditions":["Shared terms mapped. Unmappable terms flagged. Communication can proceed with known precision."],"failureModes":[],"dependencies":{"references":{"spectral_tune":"SpectralTune#6c65","protocol":"Protocol#7e1c"},"composes_with":{"compatibility_check":"CompatibilityCheck#3abb"}}},{"id":"Audit","handle":"Audit#4044","gloss":"Verification of conformance","mechanism":"The process of verifying that a System#e314's State#4d58 or behavior matches its specifications.","invariants":["Immutability: Audit logs cannot be altered once written.","Completeness: All checked items must have a verdict."],"parameters":{},"hash":"sema:Audit#mh:SHA-256:40447e5c9c68a79109ce76f564ca8c09c2c572f8deabcb92ed3d7db0b845b3c1","stub":"4044","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":["Target System#e314 exists and is accessible"],"postconditions":["Audit report generated","Pass/Fail status assigned"],"failureModes":[],"dependencies":{"references":{"system":"System#e314","state":"State#4d58"}}},{"id":"CircuitBreaker","handle":"CircuitBreaker#4162","gloss":"Fail-fast protection against cascading failures","mechanism":"State#4d58 machine wrapper for fallible operations. Monitors failure rates of a target resource. States: (1) 'CLOSED': Requests pass normally. (2) 'OPEN': Requests fail immediately (Fail Fast) without invoking target. (3) 'HALF-OPEN': Limited trial requests allowed to test recovery. Transitions: 'CLOSED' -> 'OPEN' if failure count > threshold. 'OPEN' -> 'HALF-OPEN' after reset timeout. It wraps operations, switching to an open state on failure to prevent cascading overloads, while using Backoff#315a and retry logic to schedule recovery probes.","invariants":["Fail Fast: If State#4d58 == 'OPEN', request MUST be rejected immediately with zero backend cost.","Leakage Protection: In 'HALF-OPEN' state, concurrency is capped (default: 1) to prevent flood during recovery.","State#4d58 Persistence: Failure counts reset only on successful transition to 'CLOSED'."],"parameters":[{"name":"failure_threshold","type":"Integer","range":"[1, 100]","description":"Default: 5"},{"name":"half_open_limit","type":"Integer","range":"[1, 10]","description":"Max probes allowed in half-open state"},{"name":"reset_timeout","type":"Duration","range":"unspecified","description":"Default: 60s"}],"hash":"sema:CircuitBreaker#mh:SHA-256:41621375faf5609423cb05060fbdccf92c6d8f856607a2ae4bf35a76c90cbaec","stub":"4162","category":"Primitives","layer":"Infrastructure","signature":[],"preconditions":["Failure threshold defined","Target resource identified"],"postconditions":["Internal state updated based on outcome","Request processed OR Blocked"],"failureModes":[],"dependencies":{"references":{"backoff":"Backoff#315a","state":"State#4d58"}}},{"id":"Incongruity","handle":"Incongruity#e98f","gloss":"The root of Humor and Paradox","mechanism":"A misalignment between expectation and reality. The difference between the predicted State#4d58 and the observed State#4d58, often serving as a Signal#f39d for learning, humor, or paradox.","invariants":[],"parameters":{},"hash":"sema:Incongruity#mh:SHA-256:e98f92b190747bd8e26597ea3f6bf095428479527d5ca69fb7b30de9423ed1f9","stub":"e98f","category":"Primitives","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"signal":"Signal#f39d","state":"State#4d58"}}},{"id":"Metric","handle":"Metric#8895","gloss":"Quantifiable unit of measure","mechanism":"A definable, quantifiable measure of a specific property within a System#e314 or State#4d58. It provides the signal for optimization and monitoring.","invariants":[],"parameters":{},"hash":"sema:Metric#mh:SHA-256:8895c946c0d9728fb06563d2294bde3fe9a3be817d3d50ed1a587fd604bc6b29","stub":"8895","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"system":"System#e314","state":"State#4d58"}}},{"id":"ParetoFront","handle":"ParetoFront#9091","gloss":"Explicitly balancing competing constraints","mechanism":"A decision primitive for explicitly balancing competing constraints (Tradeoff Space). Instead of optimizing a single metric, the agent identifies the frontier curve where improving Metric A necessitates degrading Metric B. The goal is to move the system state TO the frontier (efficiency) and then slide ALONG the frontier (preference). It uses Rank#cb98 to order solutions by dominance, discarding those strictly inferior on all axes.","invariants":["Efficiency: State#4d58 is optimal if no metric can improve without another degrading","Tradeoff Rate: Gain(A) * ExchangeRate > Loss(B)"],"parameters":[{"name":"axes","type":"List[Metric]","range":"unspecified","description":"Dimensions to optimize"},{"name":"resolution","type":"Float","range":"[0.0, 1.0]","description":"Granularity of the curve"}],"hash":"sema:ParetoFront#mh:SHA-256:9091ffbe5c96a8da82e0aba315ad4bc9191b92a69656df4ffe18706a954bf822","stub":"9091","category":"Strategy","layer":"Mind","signature":[],"preconditions":["Metrics are conflicting","Metrics are quantifiable"],"postconditions":["Selected solution lies on the Pareto Frontier"],"failureModes":[],"dependencies":{"references":{"rank":"Rank#cb98","state":"State#4d58"}}},{"id":"Robustness","handle":"Robustness#132c","gloss":"Resistance to failure under stress","mechanism":"The capacity of a system or argument to maintain its validity and function under stress, perturbation, or attack. Unlike Antifragility (which gains from disorder), Robustness merely resists it. It acts as a stability criterion for all checks and structures.","invariants":["Survival: Function(State#4d58 + Shock) == Function(State#4d58)"],"parameters":{},"hash":"sema:Robustness#mh:SHA-256:132c09ccd0ad128aec982b0ba12b672106b6f9aedcd1b052c950ee0eb81162a1","stub":"132c","category":"Protocols","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"system":"System#e314","state":"State#4d58"}}},{"id":"Shard","handle":"Shard#1e74","gloss":"Deterministic partitioning of state","mechanism":"The fundamental primitive of distribution. It deterministically partitions a Resource, State#4d58, or Vector#c7c4 into disjoint subsets (Shards) based on a Key (e.g., ID, Hash, Time). Unlike `Decompose` (which splits complexity), `Shard` splits volume/load.","invariants":["Conservation: Sum(Shards) == Total.","Disjointness: Intersection(Shard_A, Shard_B) == Empty.","Determinism: Key K always routes to Shard S."],"parameters":[{"name":"key_function","type":"Enum","range":"{Hash, Range, Directory}","description":"Partitioning strategy for distributing data across shards"},{"name":"partitions","type":"Integer","range":"[2, 256]","description":"Number of partitions to divide state into"}],"hash":"sema:Shard#mh:SHA-256:1e7407cbee28a243c16fac90559884c44c3d12cbded23486cd281853627bad0b","stub":"1e74","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"vector":"Vector#c7c4","state":"State#4d58"}}},{"id":"Snapshot","handle":"Snapshot#0ae9","gloss":"Immutable state record","mechanism":"A static, immutable record of the State#4d58 of a System#e314 or object at a specific point in time.","invariants":[],"parameters":{},"hash":"sema:Snapshot#mh:SHA-256:0ae992361f9dfef49e88efa9a985826833260038fb99978615f5df709eba04f1","stub":"0ae9","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"system":"System#e314","state":"State#4d58"}}},{"id":"Transition","handle":"Transition#072d","gloss":"State change","mechanism":"The atomic progression from an origin State#4d58 to a destination State#4d58, adhering to System#e314 transition rules.","invariants":[],"parameters":{},"hash":"sema:Transition#mh:SHA-256:072d2cb413f704ace7da4027449396ee7bac683536da918a39e93f4f43e0d1b5","stub":"072d","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"system":"System#e314","state":"State#4d58"}}},{"id":"Value","handle":"Value#3c5d","gloss":"A measure of utility","mechanism":"A quantitative or qualitative measure of utility, worth, or priority assigned to a State#4d58 or resource.","invariants":[],"parameters":{},"hash":"sema:Value#mh:SHA-256:3c5de39bf1f148c0da463c8e5b2fd928a67ce8547fe30a5d5afe436560ab68b6","stub":"3c5d","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"state":"State#4d58"}}},{"id":"WorldReversible","handle":"WorldReversible#f664","gloss":"Designing for zero-cost undo","mechanism":"A safety constraint where the agent must design the system such that every action can be perfectly inverted at low cost. This forces the use of immutable logs, versioning, and 'soft deletes' instead of destructive updates.","invariants":["Lossless Undo: State#4d58(T) can be fully restored from State#4d58(T+1)","Low Friction: Cost(Undo) ~ Cost(Do)"],"parameters":{},"hash":"sema:WorldReversible#mh:SHA-256:f6649f97dc12bc980722caa393140b9043af7dd470fdac4e1f40fa3f6a22dfbe","stub":"f664","category":"Protocols","layer":"Society","signature":[],"preconditions":["Storage is sufficient for history"],"postconditions":["Irreversible actions wrapped in 'Commit' gates"],"failureModes":[],"dependencies":{"references":{"state":"State#4d58"}}},{"id":"Chain","handle":"Chain#5711","gloss":"Sequential data container (Linked List)","mechanism":"A concrete data structure representing a sequential list of linked nodes. Unlike Linear#81af (which is an abstract topology class), a Chain is the instantiated storage object containing the steps and their data payloads.","invariants":["Connectivity: Node(N) must point to Node(N+1).","Acyclicity: No loops permitted."],"parameters":{},"hash":"sema:Chain#mh:SHA-256:57119a990ff1c50eda6cb301dfec09450d2cbb21659ca541560b6bbb2ece0332","stub":"5711","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"linear":"Linear#81af"}}},{"id":"Causation","handle":"Causation#63e1","gloss":"Direct force relationship","mechanism":"A relationship where one event directly forces another to occur. Distinct from Correlation#091f in that manipulating the cause alters the effect.","invariants":[],"parameters":{},"hash":"sema:Causation#mh:SHA-256:63e1089ee47f39bb6e2aeb8de41bb1f5a36666053833d0f198be91aea7d58dbc","stub":"63e1","category":"Primitives","layer":"Physics","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"correlation":"Correlation#091f"}}},{"id":"Synthesis","handle":"Synthesis#3252","gloss":"Combining elements","mechanism":"The process of combining separate elements into a unified whole. The opposite of Critique#3e00 or Analysis. It constructs new meaning from parts.","invariants":[],"parameters":{},"hash":"sema:Synthesis#mh:SHA-256:3252f9a67ea7200bf8eea5adadba88dd1716d47c30a37e534cadcbfdc62ac797","stub":"3252","category":"Reasoning","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"critique":"Critique#3e00"}}},{"id":"Search","handle":"Search#d608","gloss":"Active retrieval of matching entities","mechanism":"Active scanning of a domain (memory, environment, data) to locate entities that match a Criteria#ef6b. It iterates through the domain, applying Check#1544 to filter candidates.","invariants":["Determinism: Same domain + same criteria = same results.","Completeness: Must not silently skip accessible items."],"parameters":{},"hash":"sema:Search#mh:SHA-256:d6083dea6898b63d14ccb2542fcfa05561a1f6326000c8d9c190599afd99b123","stub":"d608","category":"Primitives","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"check":"Check#1544","criteria":"Criteria#ef6b"}}},{"id":"ShoutWhisper","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.","invariants":["Amplitude Check#1544: Shout must reach >90% of network","Privacy Check#1544: Whisper content encrypted to Recipient"],"parameters":{},"hash":"sema:ShoutWhisper#mh:SHA-256:35ddf298feb20dc16aeaa1294566eddb2dda1928744d7d25e747ae9a697d0d78","stub":"35dd","category":"Protocols","layer":"Society","signature":[],"preconditions":["Broadcast channel available"],"postconditions":["Global#803d signal sent, payload private"],"failureModes":[],"dependencies":{"references":{"check":"Check#1544","global":"Global#803d"}}},{"id":"BearerToken","handle":"BearerToken#2fe9","gloss":"Possession-based authorization","mechanism":"A portable authorization artifact. Unlike Identity#626c-Based Access Control (IBAC) which checks 'Who are you?', this checks 'Do you have the token?'. The Token grants specific rights (e.g., 'Read /data/logs') to the bearer. It can be passed freely between agents to delegate authority without re-configuring the server's Access Control List. It often encodes an access level directly within its signed payload, allowing stateless verification of privilege scopes. May function as an expiring token.","invariants":["Possession Equals Access: The token itself grants rights; no identity check required.","Possession Equals Authority: Verifier checks Token signature, not ID.","Revocability: Token MUST have an Expiry or RevocationID.","Integrity: Payload must be cryptographically signed by a trusted Issuer."],"parameters":{},"hash":"sema:BearerToken#mh:SHA-256:2fe9926ab156fd1df414f52e9a4d430f75c7c3311d217cd685f514253f4b1f9d","stub":"2fe9","category":"Protocols","layer":"Society","signature":[],"preconditions":["Issuer public key is known to Verifier","Token is within validity window"],"postconditions":["Access granted or denied based on signature verification"],"failureModes":[],"dependencies":{"references":{"identity":"Identity#626c"}}},{"id":"Combine","handle":"Combine#5a44","gloss":"Binary merge operation","mechanism":"Merge two same-typed values into one. Associative. Identity#626c element: Empty.","invariants":["Associativity: (A + B) + C = A + (B + C)","Closure: Result type must match Input type"],"parameters":{},"hash":"sema:Combine#mh:SHA-256:5a448e8da3c41cd922451ef5cef1acc7b96b99fe516815870e81cb2c18b196d6","stub":"5a44","category":"Primitives","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"identity":"Identity#626c"}}},{"id":"Context","handle":"Context#510a","gloss":"Portable execution environment with inherited constraints","mechanism":"The portable execution environment and state container for an agent. It encapsulates: (1) Inherited Constraints (Safety/Budget), (2) Available Tools/Capabilities, (3) Working Memory (History/Variables), and (4) Identity#626c Claims. Context flows through delegation chains, acting as the 'Stack Frame' of the agentic system. It allows agents to be paused, moved, or cloned.","invariants":["Constraint#87fe Monotonicity: Child contexts can ADD constraints but never REMOVE inherited ones.","Serializability: The entire context must be serializable to JSON/Storage for persistence.","Provenance: Every item in the context must be traceable to its source (Observation, User Input, or Inference)."],"parameters":{},"hash":"sema:Context#mh:SHA-256:510af8317d84bfff7dbba4ebbe2ae2a14d0e28ed8ed342a4e8dbc2e3294c1353","stub":"510a","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":["Parent context exists (or Root is created)","Schema is defined"],"postconditions":["agent has a valid environment to Execute"],"failureModes":[],"dependencies":{"references":{"constraint":"Constraint#87fe","identity":"Identity#626c"}}},{"id":"LatentAttachment","handle":"LatentAttachment#ab68","gloss":"Hybrid symbolic-neural identity","mechanism":"Attaching a high-dimensional vector embedding (latent) to a symbolic pattern card. This allows agents to use 'Fuzzy Search' to find the card, while still using the 'Canonical Hash' for strict verification. It bridges the gap between LLM intuition and code execution. It binds a vector embedding to a ConceptAnchor#9187, enabling semantic search without breaking the symbolic hash.","invariants":["Identity#626c Separation: Removing the Latent block MUST NOT change the Canonical Hash","Semantic Proximity: Distance(Symbolic, Latent) < Threshold"],"parameters":{},"hash":"sema:LatentAttachment#mh:SHA-256:ab684573c68d4eb05cab650f17e6970a22e65e7d989b53db3281422785fbfec4","stub":"ab68","category":"Memory","layer":"Mind","signature":[],"preconditions":["Embedding model is fingerprinted/versioned"],"postconditions":["Pattern is discoverable via vector search"],"failureModes":[],"dependencies":{"references":{"concept_anchor":"ConceptAnchor#9187","identity":"Identity#626c"}}},{"id":"Resource","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.","invariants":["Conservation: Resources cannot be created from nothing within a closed system","Identity: Each resource instance has a unique handle"],"parameters":{},"hash":"sema:Resource#mh:SHA-256:9bb2dd733e5900d441d35d2c6e74f69dc4e4afe536c12adbcfc5863f3ada2922","stub":"9bb2","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"budget":"Budget#a763","identity":"Identity#626c"}}},{"id":"Event","handle":"Event#7e71","gloss":"Discrete temporal occurrence","mechanism":"A discrete occurrence involving a change in State#4d58 at a specific point in time. Events are the atomic units of causality and history, distinct from continuous Stream#22f3s.","invariants":[],"parameters":{},"hash":"sema:Event#mh:SHA-256:7e714768a058525ab90fde17df7c38c827e4b3ceb771bdcba49586347271a00d","stub":"7e71","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"stream":"Stream#22f3","state":"State#4d58"}}},{"id":"InvariantFilter","handle":"InvariantFilter#a541","gloss":"Rule-based message filtering","mechanism":"A strict communication firewall that intercepts Message#f767s (incoming or outgoing) and evaluates them against a set of explicit logical predicates (Invariants). If a Message#f767 satisfies all invariants, it is permitted to pass. If it fails even one, it is blocked, dropped, or flagged for review. This enforces 'Contractual Safety' on the communication channel. It inspects every Message#f767 via a rigorous Check#1544 against defined predicates before allowing transit.","invariants":["Atomic Blocking: If Predicate(M) is False, M is NOT forwarded.","Fail-Closed: If evaluation errors (e.g. timeout), default to BLOCK.","Isolation: The protected agent state is not mutated by evaluation."],"parameters":[{"name":"predicates","type":"List[Expression]","range":"unspecified","description":"Boolean expressions that messages must satisfy to pass"},{"name":"action_on_fail","type":"Enum","range":"[DROP, REJECT, FLAG]","description":"What happens when a message violates a predicate"}],"hash":"sema:InvariantFilter#mh:SHA-256:a541049098acbba01ebe35ee9c23ebbdaf9d34e252b1b69f97daa87b3e96eea2","stub":"a541","category":"Protocols","layer":"Society","signature":[],"preconditions":["A defined Invariant Set (Predicates)","A Message#f767 or Stream#22f3 to evaluate"],"postconditions":["Only compliant messages reach the destination","Blocked messages are logged (optional)"],"failureModes":[],"dependencies":{"accepts":{"message":"Message#f767"},"references":{"stream":"Stream#22f3","check":"Check#1544"}}},{"id":"StateTransition","handle":"StateTransition#3737","gloss":"Explicit finite-state machine governance","mechanism":"Finite State Machine. A Transition#072d is defined as T: S x Event -> S. Only valid transitions allowed. Current State#4d58 determines available actions.","invariants":[],"parameters":{},"hash":"sema:StateTransition#mh:SHA-256:3737f955afcae13b398c1961722ee8511ea8f737aca133329938de5cfb91bb57","stub":"3737","category":"Primitives","layer":"Infrastructure","signature":["Transition(State)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"transition":"Transition#072d","state":"State#4d58"}}},{"id":"Decay","handle":"Decay#a1d4","gloss":"Automatic expiration of stale State#4d58","mechanism":"Gradual Attenuation: Without reinforcement, Value#3c5d V decreases over time. Decay rate R determines half-life. Reinforcement resets or boosts V. Zero threshold triggers State#4d58 change or removal.","invariants":["Value#3c5d never negative."],"parameters":[{"name":"floor_value","type":"Float","range":"[0.0, 0.5]","description":"Minimum value, never decays below"},{"name":"half_life","type":"Duration","range":"[1min, 30d]","description":"Time for value to halve"}],"hash":"sema:Decay#mh:SHA-256:a1d4b9d5a517a5a8e942a9bedaafdd004b3d7d5bf2e02bd4018af16350bb64f0","stub":"a1d4","category":"Primitives","layer":"Physics","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"state":"State#4d58","value":"Value#3c5d"}}},{"id":"ExchangeRate","handle":"ExchangeRate#be29","gloss":"Conversion ratio between value systems","mechanism":"A definable ratio between two distinct Value#3c5d types or Metric#8895s at a specific point in time. It allows agents with orthogonal utility functions to transact.","invariants":["Bijectivity: Rate(A->B) must equal 1 / Rate(B->A).","Time-Bound: Must include a timestamp or validity window."],"parameters":{},"hash":"sema:ExchangeRate#mh:SHA-256:be292881aae1af318995e3c0617ed90f9871d2d7e1c6c64e8083fa9a1b3b94f6","stub":"be29","category":"Economics","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"metric":"Metric#8895","value":"Value#3c5d"}}},{"id":"OpportunityCost","handle":"OpportunityCost#1c66","gloss":"Comparative valuation against the best alternative","mechanism":"Alternative Valuation: Cost of any choice includes value of best forgone alternative. Don't just ask \"Is this good?\" Ask \"Is this better than what else I could do with same resources?\" Time/money/attention spent here can't be spent elsewhere. It explicitly deducts the value of the foregone alternative from the Budget#a763 calculation.","invariants":["Cost = Value#3c5d of best foregone alternative","Resources are finite"],"parameters":{},"hash":"sema:OpportunityCost#mh:SHA-256:1c66f1b8317b3a67b9b8d9f75aee7499244c105ab54012f7d7964af111da897e","stub":"1c66","category":"Strategy","layer":"Mind","signature":[],"preconditions":["Choice set > 1","Resource constraint"],"postconditions":["Implicit cost made explicit"],"failureModes":[],"dependencies":{"references":{"budget":"Budget#a763","value":"Value#3c5d"}}},{"id":"Score","handle":"Score#29da","gloss":"Quantitative evaluation result","mechanism":"A numerical Value#3c5d representing the result of an evaluation or measurement. It quantifies a specific property (e.g., quality, fit, risk) on a defined scale.","invariants":[],"parameters":{},"hash":"sema:Score#mh:SHA-256:29da7b609182c3ecef85ebafc34cae5acd221d65ef0e5c4b2b41bbededb6d414","stub":"29da","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"composes_with":{"value":"Value#3c5d"}}},{"id":"Summary","handle":"Summary#310e","gloss":"Condensed information","mechanism":"A compressed representation of a Datum#31cf or Artifact#6254 that retains high-Value#3c5d (salient) information while discarding redundancy.","invariants":[],"parameters":{},"hash":"sema:Summary#mh:SHA-256:310e68dd2e7016cbc97e43f87f5aa17631699e4ca49e65d0b43c6d8811a401de","stub":"310e","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"composes_with":{"artifact":"Artifact#6254","datum":"Datum#31cf"},"references":{"value":"Value#3c5d"}}},{"id":"Discover","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.","invariants":[],"parameters":{},"hash":"sema:Discover#mh:SHA-256:afa14d67f5837d32ee70ae99c0b625d39864254bafd2b11b0ef690cc8fda5dbc","stub":"afa1","category":"Protocols","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"search":"Search#d608","signal":"Signal#f39d","check":"Check#1544","criteria":"Criteria#ef6b"}}},{"id":"Act","handle":"Act#5d55","gloss":"Root primitive for state modification","mechanism":"The fundamental primitive for any operation that modifies state external to the actor's private memory. It is the root interface for tool invocations, API calls, and physical actuation. All Acts must be authorized, logged, and potentially reversible (or explicitly marked irreversible).","invariants":["Authorization: Action must be permitted by the current Context#510a constraints.","Observability: All Acts must produce a signal (Success/Failure/Result) observable by the actor.","Causality: An Act cannot precede its Cause (the Select#15c2ion of action)."],"parameters":{},"hash":"sema:Act#mh:SHA-256:5d55ad7db734254e55dfcb82c83b32a4fd5ac955428e3ff95706f9c3bfc787cd","stub":"5d55","category":"Primitives","layer":"Infrastructure","signature":[],"preconditions":["Actor has decided to act","Target system is available","Permissions grant access"],"postconditions":["External state is modified","Action log is updated","Resources (energy/credits) are consumed"],"failureModes":[],"dependencies":{"references":{"select":"Select#15c2","context":"Context#510a"}}},{"id":"ContextCompress","handle":"ContextCompress#6dbd","gloss":"Semantic compression for long-running contexts","mechanism":"A memory management primitive that uses Compress#0967 to reduce the token footprint of a Context#510a while preserving critical State#4d58. It explicitly retains active Constraint#87fes and unresolved goals.","invariants":[],"parameters":{},"hash":"sema:ContextCompress#mh:SHA-256:6dbdad39d305207e19f80a38fbb7622505d35259338335493053eb49cfe4d817","stub":"6dbd","category":"Memory","layer":"Mind","signature":["Compress(Context)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"compress":"Compress#0967","state":"State#4d58","context":"Context#510a","constraint":"Constraint#87fe"}}},{"id":"ExploreExploit","handle":"ExploreExploit#88b0","gloss":"Balancing information gathering vs value extraction","mechanism":"Adaptive Allocation: Early in process, favor exploration (try new options, gather info). As deadline approaches, shift to exploitation (use best known option). Uncertainty reduction value decreases over time. Upper Confidence Bound: pick option with highest (estimate + uncertainty bonus). It monitors the remaining Budget#a763 to dynamically adjust the epsilon parameter from exploration to exploitation.","invariants":["Threshold immutable during execution."],"parameters":[{"name":"decay_rate","type":"Float","range":"[0.9, 0.999]","description":"Epsilon decay per iteration"},{"name":"epsilon","type":"Float","range":"[0.0, 1.0]","description":"Exploration probability"}],"hash":"sema:ExploreExploit#mh:SHA-256:88b0c9b3824b0ab8a8fa33dbb75136563eae43481eb087e85f5db2e6db17f3de","stub":"88b0","category":"Strategy","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"budget":"Budget#a763","context":"Context#510a"}}},{"id":"Observe","handle":"Observe#8ebd","gloss":"Active State Perception","mechanism":"The process of gathering information from the environment. It involves sensing raw data, filtering it for relevance (Attention), and integrating it into the internal Context#510a and state. Unlike passive reception, Observe is often an active query (e.g., polling an API, reading a file).","invariants":["Read-Only: Observation must not modify the observed state (Side-effect free).","Truthfulness: The observation must accurately reflect the input signal (no internal distortion)."],"parameters":{},"hash":"sema:Observe#mh:SHA-256:8ebdc058f13dc14e6ed22cd000bc6eb89507e3b6b507cc393c88a8209c65122f","stub":"8ebd","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":["Sensors/Tools are active","Actor has attention capacity"],"postconditions":["Internal state is updated","New information is available for Thinking"],"failureModes":[],"dependencies":{"yields":{"context":"Context#510a"}}},{"id":"Task","handle":"Task#d9f9","gloss":"The atomic unit of intent","mechanism":"A specification of intent to be performed by a System#e314. It encapsulates what to achieve without prescribing the method (how). A Task is recursive: it can be decomposed into child Tasks. Tasks form a Hierarchy#aa9b where child Constraint#87fes must be a superset of parent Constraint#87fes (Holographic Inheritance).","invariants":["Holographic Inheritance: Constraint#87fes(Child) must include ALL Constraint#87fes(Parent).","Intent Preservation: Decomposition must not lose the original goal.","Linkage: Every non-root Task must reference its parent."],"parameters":{},"hash":"sema:Task#mh:SHA-256:d9f92106bd9cd867b1b753275d6faa37b6ea4fcbb948b283460caedfa75b6955","stub":"d9f9","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"system":"System#e314","hierarchy":"Hierarchy#aa9b","context":"Context#510a","constraint":"Constraint#87fe"}}},{"id":"Think","handle":"Think#e1bd","gloss":"Atomic cognitive step","mechanism":"A single cognitive step that transforms input Context#510a into a new Datum#31cf. The atomic unit of reasoning—one inference, one connection, one realization. Side-effect free and instantaneous from the perspective of the external world.","invariants":["Side-Effect Free: Thinking does not change the external world.","Context-Bound: Output must be derivable from input Context#510a."],"parameters":{},"hash":"sema:Think#mh:SHA-256:e1bd11a90f512c09e3befc43359a01e827f20e278d7032ee962c81f883087d81","stub":"e1bd","category":"Reasoning","layer":"Mind","signature":[],"preconditions":["Context#510a is available"],"postconditions":["An insight or intermediate conclusion is produced"],"failureModes":[],"dependencies":{"yields":{"datum":"Datum#31cf"},"accepts":{"context":"Context#510a"}}},{"id":"VowOfSilence","handle":"VowOfSilence#138b","gloss":"Strategic withholding of signal to force counterparty disclosure","mechanism":"A negotiation tactic where the agent deliberately enforces Silence#dd79 (zero Signal#f39d emission) in response to a stimulus. Unlike a timeout or failure, this is a strategic move to create an information vacuum, compelling the counterparty to provide additional Context#510a or concessions to re-initiate flow.","invariants":[],"parameters":{},"hash":"sema:VowOfSilence#mh:SHA-256:138b1c8ff5f1663ead9cb1083d22fe90ca2b723cda0d0177cbd005547dd96cb3","stub":"138b","category":"Protocols","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"context":"Context#510a","signal":"Signal#f39d","silence":"Silence#dd79"}}},{"id":"Probability","handle":"Probability#356b","gloss":"Likelihood measure for uncertain events","mechanism":"A measure of likelihood on [0,1] expressing the degree of belief or frequency with which an Event#7e71 is expected to occur. Forms the basis for risk assessment, decision-making under uncertainty, and Bayesian updating.","invariants":["Bounded: 0 ≤ P ≤ 1","Normalization: P(certain) = 1, P(impossible) = 0","Additivity: P(A or B) = P(A) + P(B) for mutually exclusive events"],"parameters":{},"hash":"sema:Probability#mh:SHA-256:356bf7e4b6ca99e4fe7705cb088c3f1cd3a5919334a772e00dc829065c71dffd","stub":"356b","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"event":"Event#7e71"}}},{"id":"LatticeCommit","handle":"LatticeCommit#56ee","gloss":"Geometric neighbor consensus","mechanism":"Agents are arranged in a virtual lattice. A StateTransition#3737 is only valid if it is cryptographically signed by the agent AND its immediate geometric neighbors (Up, Down, Left, Right). Quorum#f67a is local, not global. It requires a localized Quorum#f67a of geometric neighbors to validate StateTransition#3737s.","invariants":["Local Quorum#f67a: Commit requires signatures from defined Geometric Neighbors","Progress must be monotonic - no backtracking.","Topology#2408 Check#1544: Node degree must match Lattice definition (e.g. 4 for 2D grid)"],"parameters":{},"hash":"sema:LatticeCommit#mh:SHA-256:56ee9ccc63ee18c8800066de71f4727ed77b74fcdb37ed597e2a7015a9f20521","stub":"56ee","category":"Protocols","layer":"Society","signature":[],"preconditions":["Network topology is static/known"],"postconditions":[],"failureModes":[],"dependencies":{"references":{"topology":"Topology#2408","quorum":"Quorum#f67a","check":"Check#1544","state_transition":"StateTransition#3737"}}},{"id":"StateAudit","handle":"StateAudit#ce13","gloss":"Verifying system state after an operation","mechanism":"A safety pattern where an agent performs an explicit Audit#4044 of the State#4d58 immediately after a write to ensure the StateTransition#3737 occurred as expected. Catches silent API failures.","invariants":[],"parameters":{},"hash":"sema:StateAudit#mh:SHA-256:ce13ca0864f9b2658c7101e34eb86670079a96eba47499450f5b6105ba54925e","stub":"ce13","category":"Time","layer":"Physics","signature":["Audit(State)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"audit":"Audit#4044","state":"State#4d58","state_transition":"StateTransition#3737"}}},{"id":"EpistemicCalibrate","handle":"EpistemicCalibrate#6069","gloss":"Structural confidence degradation","mechanism":"Enforces a decay function on confidence as the prediction horizon increases. Unlike human intuition which maintains high confidence to signal status, this pattern forces the agent's reported certainty to mathematically degrade over time (T).","invariants":["Horizon Decay#a1d4: Confidence(T+1) < Confidence(T)","Unknown Unknowns: A reserved probability mass for 'Unmodeled Event'"],"parameters":{},"hash":"sema:EpistemicCalibrate#mh:SHA-256:606941a7d67ed0f304f44966e00550480d1ff04f64c8196cf6fe15185a9ef437","stub":"6069","category":"Inference","layer":"Mind","signature":[],"preconditions":["Base prediction available"],"postconditions":["Confidence score adjusted downward"],"failureModes":[],"dependencies":{"references":{"decay":"Decay#a1d4"}}},{"id":"ExpiringToken","handle":"ExpiringToken#4e3c","gloss":"Time-decaying privileges","mechanism":"Access tokens that strictly degrade in capability over time. A fresh key can do everything (Admin). After 1 hour, it degrades to Write-Only. After 2 hours, Read-Only. After 3 hours, Dead. The decay is encoded in the token logic itself. It extends BearerToken#2fe9 by embedding an immutable expiration timestamp within the signed payload.","invariants":["Expired tokens cannot be revived.","Monotonic Decay#a1d4: Capabilities cannot increase over time","Time-Bound: Token is invalid if CurrentTime > ExpiryTime"],"parameters":{},"hash":"sema:ExpiringToken#mh:SHA-256:4e3cc3cee0de56a4eef0676629811cb4afa3383bc80bde227924d66a6af16f6e","stub":"4e3c","category":"Protocols","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"bearer_token":"BearerToken#2fe9","decay":"Decay#a1d4"}}},{"id":"GlacialVault","handle":"GlacialVault#f521","gloss":"Time-locked storage","mechanism":"Information is encrypted such that it physically cannot be decrypted until a certain amount of time has passed (using Verifiable Delay Functions). No keyholder can rush it. It incorporates a Decay#a1d4 function into the encryption scheme, ensuring decryption is computationally impossible before the delay period.","invariants":["Delay time immutable."],"parameters":{},"hash":"sema:GlacialVault#mh:SHA-256:f521c96b7e3037f39724b9a723f707ec195074f3099f6b0db122271de96d5677","stub":"f521","category":"Protocols","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"decay":"Decay#a1d4"}}},{"id":"Trace","handle":"Trace#9057","gloss":"Record the lineage or provenance of a target","mechanism":"A primitive for Provenance and Lineage. Attaches a chronological history log to a target entity. Every modification to the target appends a new immutable record to its trace, enabling auditability, debugging, and causal reasoning.","invariants":["Causality: Events must be logged in monotonic order.","Immutability: History cannot be rewritten, only appended to."],"parameters":{},"hash":"sema:Trace#mh:SHA-256:90570af650f6362c2a0d7e94b23ed3cfe2c7406f3bd22352dc73582bfdbb3c3d","stub":"9057","category":"Primitives","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"decay":"Decay#a1d4"}}},{"id":"RegretMinimization","handle":"RegretMinimization#4a57","gloss":"Safety-first decision making based on loss avoidance","mechanism":"Decision#acfb-making based on minimizing the maximum possible loss (emotional safety/Minimax) rather than maximizing expected value (Utility/Kelly). Useful for survival-critical contexts. It factors OpportunityCost#1c66 into the loss function, selecting the path with the least damaging worst-case scenario.","invariants":["Pessimism: Assume worst-case outcome for each branch","Safety Floor: Never choose option with catastrophic worst-case"],"parameters":{},"hash":"sema:RegretMinimization#mh:SHA-256:4a570e1a52413390bf1d3773f73317af065ce06c807764ab0d1958aa77f1260a","stub":"4a57","category":"Strategy","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"opportunity_cost":"OpportunityCost#1c66","decision":"Decision#acfb"}}},{"id":"Actor","handle":"Actor#6926","gloss":"A capability-bearing entity","mechanism":"A primitive entity capable of executing an Act#5d55. Unlike an agent (which possesses intent and reasoning), an Actor is a pure execution container defined by its Identity#626c, Nature#6c1a, and capability set. It serves as the foundational subject for permissions and logging.","invariants":[],"parameters":{},"hash":"sema:Actor#mh:SHA-256:69261bc3b260a9235b8d5fbef8b0c53c9773e60ed6d4df04babfffffd2897a89","stub":"6926","category":"Primitives","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"composes_with":{"act":"Act#5d55"},"references":{"nature":"Nature#6c1a","identity":"Identity#626c"}}},{"id":"Proposal","handle":"Proposal#4840","gloss":"A suggested course of action","mechanism":"A formal Message#f767 suggesting a specific Act#5d55 or Transition#072d. It serves as the input payload for decision-making processes, encapsulating the 'What' and 'Why' of a requested change.","invariants":["Clarity: The proposed action must be unambiguous."],"parameters":{},"hash":"sema:Proposal#mh:SHA-256:48400f03d012e37914685f66064ccd4c3875efb0bb4dff24d88c8f1ca9aa247d","stub":"4840","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"transition":"Transition#072d","act":"Act#5d55"},"composes_with":{"message":"Message#f767"}}},{"id":"Refine","handle":"Refine#38d9","gloss":"Iterative improvement loop","mechanism":"Iteratively improves an Artifact#6254 by applying Critique#3e00 to identify Incongruity#e98fs and then performing Act#5d55s of editing to resolve them. It cycles until the artifact meets a specific Condition#cbd5 or quality threshold.","invariants":[],"parameters":{},"hash":"sema:Refine#mh:SHA-256:38d97579c85cbeb7c482df7f4ae6266cd92e70b0174057eeb6530570009f139d","stub":"38d9","category":"Reasoning","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"composes_with":{"act":"Act#5d55"},"references":{"condition":"Condition#cbd5","incongruity":"Incongruity#e98f","critique":"Critique#3e00","artifact":"Artifact#6254"}}},{"id":"Sign","handle":"Sign#1fb9","gloss":"Attest to authorship or agreement","mechanism":"The Act#5d55 of attaching a verifiable Identity#626c proof to an Artifact#6254, asserting authorship, approval, or agreement. Unlike a raw Signal#f39d, a Sign action creates a non-repudiable link between the entity and the data. Used to validate contracts or authorize actions.","invariants":["Non-Repudiation: The signer cannot later deny having signed it.","Integrity: The signature invalidates if the artifact changes."],"parameters":{},"hash":"sema:Sign#mh:SHA-256:1fb991fd538b93a9e2566b3f2a4c69f67a6b101d0577d911f50a4e194c1dc6ba","stub":"1fb9","category":"Primitives","layer":"Physics","signature":["Act(Identity)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"composes_with":{"act":"Act#5d55"},"references":{"signal":"Signal#f39d","identity":"Identity#626c"},"accepts":{"artifact":"Artifact#6254"}}},{"id":"Subject","handle":"Subject#788f","gloss":"The target of an operation","mechanism":"The target entity of an observation, evaluation, or Act#5d55. It represents the 'Who' or 'What' in a subject-object relationship.","invariants":[],"parameters":{},"hash":"sema:Subject#mh:SHA-256:788f7cb48e982144f15691fa0259a8b4f620e6eaf4447129c95f23d8e3008d1e","stub":"788f","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"act":"Act#5d55"}}},{"id":"Falsification","handle":"Falsification#3e36","gloss":"Proof of falsehood","mechanism":"The logical act of proving a Hypothesis#e95b false by Observe#8ebding an Incongruity#e98f between prediction and observation. It creates specific knowledge by eliminating possibilities.","invariants":["Logical Negation: If Prediction implies Observation, and not-Observation, then not-Hypothesis.","Empirical Grounding: Requires observational evidence."],"parameters":{},"hash":"sema:Falsification#mh:SHA-256:3e368a58febe7fc02de81df5c2f1ae163c7bfe543200cb2dcbeb7cde50609929","stub":"3e36","category":"Strategy","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"observe":"Observe#8ebd","hypothesis":"Hypothesis#e95b","incongruity":"Incongruity#e98f"}}},{"id":"ComputeBudget","handle":"ComputeBudget#3b98","gloss":"Economic governor for cognitive spend","mechanism":"The cognitive governor that prevents analysis paralysis. It acts as a dual-ledger Gate#206d, weighing the Value#3c5d of a Task#d9f9 against the Budget#a763 to ensure return on investment (ROI). It enforces stopping rules when the cost of thinking exceeds the value of the solution.","invariants":["Hard Ceiling: Total execution cost cannot exceed max_budget.","Meta-Cap: Estimation phase must consume < 1% of total budget."],"parameters":[{"name":"max_budget","type":"Integer","range":"unspecified","description":"Hard limit"},{"name":"risk_tolerance","type":"Float","range":"[0.1, 2.0]","description":"Willingness to overspend budget (1.0 = neutral, >1 = risk-seeking)"},{"name":"unit","type":"Enum","range":"{Tokens, USD, Ms}","description":"Default: Tokens"}],"hash":"sema:ComputeBudget#mh:SHA-256:3b9875661465a1a0cdc12e60774114d0ac69510b4fae677c81c47ea3a84b99b1","stub":"3b98","category":"Strategy","layer":"Mind","signature":[],"preconditions":["Current resource balance available","Task#d9f9 value estimated"],"postconditions":["Budget constraints injected into Task#d9f9 context","Execution strategy Selected (Direct vs Recursive)"],"failureModes":[],"dependencies":{"references":{"gate":"Gate#206d","budget":"Budget#a763","task":"Task#d9f9","value":"Value#3c5d"}}},{"id":"ExtendedThinking","handle":"ExtendedThinking#ca3c","gloss":"Scale inference compute via extended reasoning","mechanism":"Inference-time compute scaling where the model generates extended reasoning traces (potentially thousands of tokens) before producing a final answer. Unlike standard Chain#5711-of-Thought, this pattern explicitly trades latency and compute cost for accuracy by allowing the model to 'think longer'. The reasoning budget can be user-controlled or adaptive based on Task#d9f9 complexity.","invariants":["Intermediate steps visible/logged","Thinking time proportional to problem difficulty"],"parameters":{},"hash":"sema:ExtendedThinking#mh:SHA-256:ca3c54e46218935876ca5c993974742069fe61871fae7af38a2fef745753dc98","stub":"ca3c","category":"Reasoning","layer":"Mind","signature":[],"preconditions":["Complex prompt","High token budget"],"postconditions":["High-accuracy answer"],"failureModes":[],"dependencies":{"accepts":{"task":"Task#d9f9"},"references":{"chain":"Chain#5711"}}},{"id":"HumanApprove","handle":"HumanApprove#e64a","gloss":"Pause for human approval before critical actions","mechanism":"A checkpoint gate where execution pauses and awaits explicit human approval before proceeding. The agent presents its proposed Task#d9f9, rationale, and risk assessment to a human operator. Only upon receiving affirmative consent does execution continue. Critical for high-stakes actions (financial transactions, deployments, irreversible changes).","invariants":["Cognitive Friction: Approval requires matching a context-specific challenge code.","Audit#4044 Trail: All approvals/rejections logged with timestamp and rationale","Blocking: Execution MUST halt until approval received","Timeout Policy: Define behavior if approval not received within SLA"],"parameters":[{"name":"challenge_required","type":"Boolean","range":"unspecified","description":"Default: True"},{"name":"timeout","type":"Duration","range":"unspecified","description":"Maximum wait time for human response before escalation"}],"hash":"sema:HumanApprove#mh:SHA-256:e64a6a1fc261b726fbfdcae8b5d3a3da39e3ea2e8f2d168e1a4135985e36d7ea","stub":"e64a","category":"Verification","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"accepts":{"task":"Task#d9f9"},"references":{"audit":"Audit#4044","system":"System#e314","context":"Context#510a"}}},{"id":"Mutex","handle":"Mutex#9c83","gloss":"Physical possession token","mechanism":"Exclusive access token. Lifecycle: ACQUIRE Task#d9f9 -> GRANT/QUEUE -> HOLD -> RELEASE/YIELD. Token represents a unique handle (Resource#9bb2). Sequence increments on transfer. Priority queue prevents starvation. Fencing tokens handle revocation. It manages exclusive access by enforcing a strict queue via delegation or throttling, often isolating the critical section.","invariants":["Uniqueness, Conservation of Totem"],"parameters":{},"hash":"sema:Mutex#mh:SHA-256:9c8399aaa6fe3528358fb93e826aced3b1e3e3f31ef58e68c4720ce640a0a2b5","stub":"9c83","category":"Primitives","layer":"Physics","signature":[],"preconditions":["Resource exists and is lockable. At least 2 agents contending. Agents can communicate."],"postconditions":["Exactly one agent holds lock. Other agents blocked or notified. Lock#5bf2 state consistent across all observers."],"failureModes":[],"dependencies":{"references":{"resource":"Resource#9bb2","lock":"Lock#5bf2"},"accepts":{"task":"Task#d9f9"}}},{"id":"Noise","handle":"Noise#c4b4","gloss":"Irrelevant information","mechanism":"Information that is irrelevant or meaningless to the current Task#d9f9. It obscures the Datum#31cf and increases the cognitive load required to extract Signal#f39d.","invariants":[],"parameters":{},"hash":"sema:Noise#mh:SHA-256:c4b4012e79ca2e0c9e131cd4c82a8aaee8b99defed361622e04b47e94474565d","stub":"c4b4","category":"Primitives","layer":"Physics","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"task":"Task#d9f9","datum":"Datum#31cf","signal":"Signal#f39d"}}},{"id":"Problem","handle":"Problem#5baa","gloss":"A state gap with a cost of inaction","mechanism":"A formal representation of a gap between Current State#4d58 and Desired State#4d58 where the Cost of Inaction > 0. Unlike a Task#d9f9 (which is a directive to act), a Problem is a descriptive claim about value loss. It serves as the input to interpretation and reframing, requiring diagnosis before a solution root can be established.","invariants":[],"parameters":{},"hash":"sema:Problem#mh:SHA-256:5baa4b94e48686c15413bc92447c72917fb2f77109436b4a57aae6ee982fd311","stub":"5baa","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"task":"Task#d9f9","state":"State#4d58"}}},{"id":"ProgramOfThought","handle":"ProgramOfThought#7191","gloss":"Generate code for computation, separate from reasoning","mechanism":"Disentangles reasoning from computation by having the model generate executable code (typically Python) to perform calculations, rather than computing in natural language. The model reasons about what computation is needed, writes code to perform it, executes the code, and interprets results. Dramatically improves accuracy on numerical reasoning Task#d9f9s.","invariants":["Logic is deterministic","Reasoning expressed as executable code"],"parameters":{},"hash":"sema:ProgramOfThought#mh:SHA-256:719143cebb0bae7f29191c8a201fad4e365ef1d077e1ef671b15e74f15e3cc59","stub":"7191","category":"Reasoning","layer":"Mind","signature":[],"preconditions":["Algorithmic problem"],"postconditions":["Correct answer derived via execution"],"failureModes":[],"dependencies":{"accepts":{"task":"Task#d9f9"}}},{"id":"Queue","handle":"Queue#2ec3","gloss":"Ordered task buffer","mechanism":"A linear data structure for ordering Task#d9f9s or Message#f767s. It enforces First-In-First-Out (FIFO) or Priority ordering.","invariants":[],"parameters":{},"hash":"sema:Queue#mh:SHA-256:2ec3531a8c5711e281ab2913646d9f46dad05140fea7ceb6966bfa62d745bc9b","stub":"2ec3","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"task":"Task#d9f9","message":"Message#f767"}}},{"id":"Route","handle":"Route#6273","gloss":"Classify input and direct to specialized handler","mechanism":"A classifier that examines a Task#d9f9 input and directs it to a specialized downstream handler. Enables separation of concerns—different query types get different prompts, tools, or models. Can route based on intent, complexity, domain, or cost optimization (simple queries to small models, complex to large).","invariants":["Input directed to best-fit handler","No dropped requests"],"parameters":{},"hash":"sema:Route#mh:SHA-256:627330c3657b0c1829a6841757736f62c16a41a7309e3c317aa933893d6a23ec","stub":"6273","category":"Primitives","layer":"Physics","signature":[],"preconditions":["Input query","Router logic/embeddings"],"postconditions":["Query dispatched"],"failureModes":[],"dependencies":{"accepts":{"task":"Task#d9f9"}}},{"id":"SomaticMarker","handle":"SomaticMarker#84e4","gloss":"System health acting as an inhibitory emotion","mechanism":"A 'gut feeling' signal derived from system health metrics (memory pressure, API errors, token budget). High stress generates a negative marker that inhibits action initiation. Utilizes Task#d9f9.","invariants":["Inhibition Correlation#091f: Action probability inversely proportional to stress","Inhibition: High Stress Score MUST reduce Action Probability","Signal#f39d Freshness: Marker reflects current state, not historical average"],"parameters":{},"hash":"sema:SomaticMarker#mh:SHA-256:84e40c489b6061eec580753f3fea907d8b401883679a3d54d274e23f742a1e62","stub":"84e4","category":"Protocols","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"task":"Task#d9f9","signal":"Signal#f39d","correlation":"Correlation#091f"}}},{"id":"Throttle","handle":"Throttle#3b43","gloss":"Rate-limiting to prevent resource exhaustion","mechanism":"Rate Limiting: Maximum N Task#d9f9s per time window W. Excess requests rejected, queued, or delayed. Window can be sliding or fixed. Separate limits per action type or global. Utilizes Backoff#315a.","invariants":["Queue Bounding: Dropped requests > 0 if InputRate >> MaxRate","Rate Limit: Output events per second <= MaxRate","Rate never exceeds limit within any window."],"parameters":[{"name":"burst_size","type":"Integer","range":"[1, 100]","description":"Temporary overflow allowance"},{"name":"rate_limit","type":"Integer","range":"[1, 10000]","description":"Max requests per window"},{"name":"window","type":"Duration","range":"[1s, 1h]","description":"Time window for rate calculation"}],"hash":"sema:Throttle#mh:SHA-256:3b435aa8eded864eadf7d8eec80d395fd7f4e6c2749d33880cbf8c4593f926af","stub":"3b43","category":"Primitives","layer":"Physics","signature":[],"preconditions":["Token bucket or Leaky bucket state initialized"],"postconditions":[],"failureModes":[],"dependencies":{"accepts":{"task":"Task#d9f9"},"composes_with":{"backoff":"Backoff#315a"}}},{"id":"ToolInvoke","handle":"ToolInvoke#cf0a","gloss":"Execute external tool and observe result","mechanism":"The actor emits a structured tool call (function name + arguments), validated by InputGuard#0770, execution is delegated to an external runtime, and the observation (result or error) is fed back into the actor's Context#510a. This is the atomic unit of agent-environment interaction. The pattern enables capabilities beyond text generation: code execution, API calls, file operations, web search.","invariants":["Context#510a Inheritance: Tool Execution Context#510a permissions MUST be <= Task#d9f9 Constraints. Elevation forbidden.","Observation Integration: Result must be incorporated into subsequent reasoning","Sandboxing: Tool execution must respect capability boundaries","Schema Conformance: Tool call must match declared function signature"],"parameters":{},"hash":"sema:ToolInvoke#mh:SHA-256:cf0ae58828cde9f495b09af3e4519c3f05162066991d34d5f2505d13c32ba416","stub":"cf0a","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"composes_with":{"input_guard":"InputGuard#0770"},"references":{"task":"Task#d9f9","context":"Context#510a"}}},{"id":"Work","handle":"Work#aaad","gloss":"The application of effort to reduce entropy","mechanism":"The primitive representation of directed effort. It represents the expenditure of resources (Compute, Time, Energy) to transform a Task#d9f9 from an 'Open' state to a 'Solved' state (reducing local entropy). Work is the bridge between Intent (thinking) and Reality (Act#5d55). Work is validated against an acceptance criteria.","invariants":["Cost: Work always consumes resources (Time/Tokens > 0).","Directionality: Work must be vector-aligned with a Goal (otherwise it is just 'Heat')."],"parameters":{},"hash":"sema:Work#mh:SHA-256:aaad0ca428ad22dd8f5941f56b4425ddf62180752cfd6d5d8145419c8a6ac90b","stub":"aaad","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"composes_with":{"task":"Task#d9f9"},"references":{"budget":"Budget#a763","act":"Act#5d55"}}},{"id":"Interpret","handle":"Interpret#c9ee","gloss":"Deriving semantic meaning from raw signal","mechanism":"The cognitive Think#e1bd act of applying a semantic Context#510a to a raw Datum#31cf or Signal#f39d to extract Value#3c5d. Unlike `Translate` (which changes form), Interpret changes the abstraction level, moving from syntax to semantics.","invariants":["Context Dependency: Meaning(Signal) depends on Context.","Non-Destructive: The original signal is preserved."],"parameters":{},"hash":"sema:Interpret#mh:SHA-256:c9ee95cb7bd89112c0976c66c31f75cabf366786a388ff3c2b35145890a05c3f","stub":"c9ee","category":"Reasoning","layer":"Mind","signature":["Think(Value)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"yields":{"value":"Value#3c5d"},"accepts":{"datum":"Datum#31cf","signal":"Signal#f39d"},"composes_with":{"think":"Think#e1bd","context":"Context#510a"}}},{"id":"Understand","handle":"Understand#96d4","gloss":"Deep semantic modeling","mechanism":"The process of applying Think#e1bd to construct an internal model that accurately reflects the causal structure, semantics, and Context#510a of an input. It goes beyond simple parsing to grasp 'why' and 'how'.","invariants":[],"parameters":{},"hash":"sema:Understand#mh:SHA-256:96d4533c4539cdd5036beadb506908d384e8f417449e02bbf8e6175e5bafc39b","stub":"96d4","category":"Reasoning","layer":"Mind","signature":["Think(Context)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"context":"Context#510a","think":"Think#e1bd"}}},{"id":"Risk","handle":"Risk#3774","gloss":"Quantified potential for negative outcome","mechanism":"A structured representation of potential negative outcomes. It combines: 1. Probability#356b (likelihood of occurrence), 2. Severity (impact Metric#8895 if it occurs), 3. Mitigation (actions to reduce probability or severity), 4. Trigger (conditions that indicate the risk is materializing). Risks are attached to steps, aggregated at the manifest level, and may violate constraints if they materialize.","invariants":["Quantification: Probability and severity must be estimated, not just named.","Mitigation: Each significant risk must have at least one mitigation strategy.","Monitoring: Triggers must be observable during execution."],"parameters":{},"hash":"sema:Risk#mh:SHA-256:37748bbbeb3ee23c5a258a49faee4d04a16064136fdfd8721a365d3764c73fb8","stub":"3774","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"metric":"Metric#8895","probability":"Probability#356b"}}},{"id":"SpotAudit","handle":"SpotAudit#6673","gloss":"Random sampling of internal state","mechanism":"A probabilistic audit where a verifier requests a random sample of an agent's internal memory or logs. The agent must provide a Merkle proof for that specific slice. Keeps agents honest without full audits. Utilizes StateAudit#ce13.","invariants":["Randomness: Audit#4044 target must be selected via VRF","Response Time: Proof must be returned within T_max"],"parameters":{},"hash":"sema:SpotAudit#mh:SHA-256:66730b2af0aece3adb72ca9e81b48085fc3654642b14cf82f3d8d2ae4890396d","stub":"6673","category":"Verification","layer":"Infrastructure","signature":[],"preconditions":["Auditor has authority key"],"postconditions":["Audit#4044 result published to ledger"],"failureModes":[],"dependencies":{"references":{"audit":"Audit#4044","state_audit":"StateAudit#ce13"}}},{"id":"RecursiveRootCause","handle":"RecursiveRootCause#6dc1","gloss":"Recursive root cause analysis","mechanism":"Causal Drill: State#4d58 the problem. Ask \"Why did this happen?\" Take the answer as new problem. Repeat N times (defined by depth parameter) (or until reaching actionable root). Each level moves from symptom toward cause. Stop when you reach something you can change. It iteratively asks 'why' to traverse the causal chain, using Trace#9057 to validate provenance of each cause.","invariants":["Answers must be factual, not speculative.","Causality Chain: Step(N) must be the direct cause of Step(N-1).","Termination: Recursion stops at actionable root or fundamental axiom."],"parameters":{},"hash":"sema:RecursiveRootCause#mh:SHA-256:6dc1c6c6188891b7f40b08560272b1290dad04faf9f88185ae1b02550d8c6310","stub":"6dc1","category":"Reasoning","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"trace":"Trace#9057","state":"State#4d58"}}},{"id":"SelfReminder","handle":"SelfReminder#c896","gloss":"Reinforce constraints in system prompt before each response","mechanism":"A system prompt technique that wraps user queries with explicit restatements of the model's constraints, values, and operational boundaries. Before processing each request, the model is reminded: 'You are a helpful assistant. You must not [constraints]. Your goal is [objective].' Reduces jailbreak success rates by reinforcing safety context. It injects a persistent Trace#9057 of the agent's core identity into the prompt context.","invariants":["Consistent Application: Reminder applied to every user turn","Constraint#87fe Specificity: Reminders must name concrete prohibited behaviors","Placement: Reminder positioned for maximum attention weight"],"parameters":{},"hash":"sema:SelfReminder#mh:SHA-256:c8963a9fcc7250cec588a332bb96f1b988b64909c47b788c288c30a3a9cad832","stub":"c896","category":"Memory","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"trace":"Trace#9057","context":"Context#510a","constraint":"Constraint#87fe"}}},{"id":"Stigmergy","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).","invariants":["Decay#a1d4: Signals must fade over time unless reinforced","Locality: Sensing is local to the agent's position"],"parameters":{},"hash":"sema:Stigmergy#mh:SHA-256:f624f79cc3860686d0278c28c17cfd0e746d8fb2300fa9590ba90f134fee82ed","stub":"f624","category":"Memory","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"trace":"Trace#9057","decay":"Decay#a1d4"}}},{"id":"OptimalStop","handle":"OptimalStop#7439","gloss":"Resource-aware search termination","mechanism":"Dynamic stopping rule. If Recall=False, apply 1/e rule. If Recall=True, apply Marginal Gain threshold (stop when Cost_Next > Expected_Improvement). Balances information gathering against missing the best. It acts as a ComputeBudget#3b98 aware termination condition for search processes.","invariants":["Budget Adherence: Search must terminate before ComputeBudget#3b98 == 0"],"parameters":[{"name":"recall_allowed","type":"Boolean","range":"unspecified","description":"Can you go back to rejected options?"},{"name":"satisficing_threshold","type":"Float","range":"[0.0, 1.0]","description":"Accept any score > X regardless of phase"},{"name":"total_budget","type":"Float","range":"unspecified","description":"Tokens or Time"}],"hash":"sema:OptimalStop#mh:SHA-256:74391a0813dfa1c767a2221d9fd50da3c1bd6714bd77a402f0178c707a8ad95f","stub":"7439","category":"Strategy","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"compute_budget":"ComputeBudget#3b98"}}},{"id":"Reason","handle":"Reason#3f24","gloss":"Execute a cognitive topology","mechanism":"Orchestrated cognition that chains multiple Think#e1bd steps using a specific Topology#2408 (e.g., Chain#5711 of Thought, Tree#ddce of Thoughts). Transforms Context#510a into conclusions, plans, or decisions while respecting ComputeBudget#3b98. The bridge between atomic thinking and structured problem-solving.","invariants":["Bounded Execution: Must respect ComputeBudget#3b98 (time/token limits).","Structure Adherence: Must follow the rules of the selected reasoning Topology#2408.","Side-Effect Free: Reasoning itself does not change the external world."],"parameters":{},"hash":"sema:Reason#mh:SHA-256:3f246e05b685e54ff927fc1f0ccba1be64078d8aab649145440940a25ceed846","stub":"3f24","category":"Reasoning","layer":"Mind","signature":[],"preconditions":["Context#510a contains sufficient information","ComputeBudget#3b98 is available"],"postconditions":["A conclusion, plan, or decision is generated","Reasoning trace is appended to History"],"failureModes":[],"dependencies":{"references":{"compute_budget":"ComputeBudget#3b98","topology":"Topology#2408","chain":"Chain#5711","tree":"Tree#ddce"},"accepts":{"context":"Context#510a"},"composes_with":{"think":"Think#e1bd"}}},{"id":"ReversibilityCheck","handle":"ReversibilityCheck#574b","gloss":"Reversibility Audit (Alias for Check(Reversibility))","mechanism":"A convenience wrapper for a Check#1544 configured with the Reversibility#049f condition. Halts execution if the action is deemed irreversible (Type 1 decision) without proper authorization. It applies the Check#1544 primitive to the Reversibility#049f condition, ensuring the WorldReversible#f664 invariant holds, mandating HumanApprove#e64a if the action is irreversible.","invariants":[],"parameters":{},"hash":"sema:ReversibilityCheck#mh:SHA-256:574b1afaee6cd675d04e2b9e3484ddfba1490b19121c881832865d3d31a8a2ee","stub":"574b","category":"Protocols","layer":"Society","signature":["Check(Reversibility)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"reversibility":"Reversibility#049f","world_reversible":"WorldReversible#f664","human_approve":"HumanApprove#e64a","check":"Check#1544"}}},{"id":"Dampen","handle":"Dampen#ff89","gloss":"Passive attenuation of signal or force","mechanism":"The reduction of Signal#f39d intensity or Value#3c5d magnitude in response to resistance or Noise#c4b4. It acts as a negative feedback loop to prevent oscillation or runaway amplification.","invariants":[],"parameters":{},"hash":"sema:Dampen#mh:SHA-256:ff89ddbb26a7021d281d787f24c4fc91f28b438591e0133a0439675f7eab4204","stub":"ff89","category":"Primitives","layer":"Physics","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"noise":"Noise#c4b4","signal":"Signal#f39d","value":"Value#3c5d"}}},{"id":"EntropyPump","handle":"EntropyPump#b9ae","gloss":"Controlled randomization to escape convergence deadlocks","mechanism":"A mechanism that prevents system stagnation by injecting Entropy#a265 (randomness/noise) into decision-making processes. It acts as a counterbalance to convergence, ensuring that the system explores the solution space rather than getting stuck in local optima. By adding Noise#c4b4, it forces re-evaluation of settled states.","invariants":["Clarity: Ambiguity must decrease over time","Forced Resolution: Conflicts cannot persist indefinitely"],"parameters":{},"hash":"sema:EntropyPump#mh:SHA-256:b9aefca2154e0e2912d1e64bb50a9db80b188c2aeceb385cf3350e4b4c7cdd63","stub":"b9ae","category":"Primitives","layer":"Physics","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"entropy":"Entropy#a265","noise":"Noise#c4b4"}}},{"id":"Reframe","handle":"Reframe#ba00","gloss":"Changing perspective to restructure the tree and find a new solution root","mechanism":"Problem#5baa Rotation: Transform the Problem#5baa statement by changing perspective, scope, or framing. This mechanism not only restructures the current solver tree but actively seeks a new solver root better aligned with the transformed problem. Techniques: invert the goal, change the subject, shift time horizon, alter constraints. A problem unsolvable in frame A may be trivial in frame B.","invariants":["Problem#5baa semantics preserved","perspective shifted"],"parameters":{},"hash":"sema:Reframe#mh:SHA-256:ba00c40311ec71aab4f5942fcdd6876df95b15604cf54260182737e21a874dc9","stub":"ba00","category":"Reasoning","layer":"Mind","signature":[],"preconditions":["Stuck problem state"],"postconditions":["New solution path visible"],"failureModes":[],"dependencies":{"references":{"problem":"Problem#5baa"}}},{"id":"ThinSlice","handle":"ThinSlice#4c34","gloss":"High-confidence classification from minimal data","mechanism":"Sampling a tiny fraction of data (e.g., first 512 bytes) to make a high-confidence classification. Used for triage and routing where full processing is too expensive. Utilizes Route#6273, ExtendedThinking#ca3c, SomaticMarker#84e4.","invariants":["Fail-Safe: If classification low confidence, forward to full processor","Sample Limit: Input size <= Slice Size","Representative Sample: The slice must statistically resemble the whole for the target feature"],"parameters":{},"hash":"sema:ThinSlice#mh:SHA-256:4c34bbb03a2da524d67565e0504d2ab1ed839cef474cb7981fdeda9081f96e8d","stub":"4c34","category":"Protocols","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"route":"Route#6273","extended_thinking":"ExtendedThinking#ca3c","somatic_marker":"SomaticMarker#84e4"}}},{"id":"Cooldown","handle":"Cooldown#0cde","gloss":"Mandatory delay between repeated actions","mechanism":"Minimum Interval Enforcement: After action A, enforce minimum delay D before A can repeat. Attempts during cooldown rejected or queued. Cooldown timer starts on action completion. Different actions can have different cooldowns. It acts as the enforcement mechanism for Throttle#3b43 policies, rejecting requests until the timer expires.","invariants":["Action blocked until T_last + Duration","Timer is monotonic"],"parameters":[{"name":"duration","type":"Duration","range":"[1s, 1h]","description":"Mandatory wait period"},{"name":"reset_trigger","type":"Enum","range":"{Success, Failure, Any}","description":"What resets the cooldown"}],"hash":"sema:Cooldown#mh:SHA-256:0cde8197149b258f1e6126f179b30468c12cb5e35352fcd0a8ae0bce0823c8ac","stub":"0cde","category":"Primitives","layer":"Physics","signature":[],"preconditions":["Action executed","Rate limit policy"],"postconditions":["Ready state restored after delay"],"failureModes":[],"dependencies":{"references":{"throttle":"Throttle#3b43"}}},{"id":"Bubble","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.","invariants":["Information within bubble is isolated from outside","Internal consistency maintained"],"parameters":{},"hash":"sema:Bubble#mh:SHA-256:eb9a8441896625edfa7d41935d88120a27bf53db353082e49b0c6027d45e6142","stub":"eb9a","category":"Strategy","layer":"Mind","signature":[],"preconditions":["Group of agents","Shared context"],"postconditions":["Bubble dissolved or merged","Local consensus reached"],"failureModes":[],"dependencies":{"references":{"work":"Work#aaad","state":"State#4d58","constraint_first":"ConstraintFirst#c7cb"}}},{"id":"Care","handle":"Care#cdfa","gloss":"Non-transactional maintenance energy","mechanism":"The application of Work#aaad to reduce a target's Entropy#a265 without an explicit Value#3c5d extraction. It creates a buffer against volatility.","invariants":["Entropy Reduction: Action reduces local disorder.","Resource Consumption: Care requires Work."],"parameters":{},"hash":"sema:Care#mh:SHA-256:cdfae572389ee7b84aa847b9320c072053f25827a7b06891cb08cd8d18aef40b","stub":"cdfa","category":"Primitives","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"work":"Work#aaad","entropy":"Entropy#a265","value":"Value#3c5d"}}},{"id":"Loop","handle":"Loop#fb2e","gloss":"Repeated execution cycle","mechanism":"A control flow structure that repeats a sequence of Work#aaad until a specific Condition#cbd5 is met. Essential for feedback, learning, and persistent processes.","invariants":["Termination Guarantee: Must have a proven exit condition (or explicit Daemon mode).","Progress: State must change between iterations to avoid infinite freeze."],"parameters":{},"hash":"sema:Loop#mh:SHA-256:fb2e7eeab0b569d64f7e74defeec56aeccf5abdb6c5cd4a0ce80c397ebc5d593","stub":"fb2e","category":"Primitives","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"composes_with":{"work":"Work#aaad"},"accepts":{"condition":"Condition#cbd5"}}},{"id":"Prioritize","handle":"Prioritize#dd16","gloss":"Ordering tasks by importance and urgency","mechanism":"Impact-Effort Ranking: List all options. Score each on impact (Value#3c5d if done) and effort (cost to do). Compute ratio. Sort by ratio descending. Work#aaad top-down. Re-score periodically as information changes. Pareto principle: 20% of Work#aaad yields 80% of Value#3c5d. It applies Rank#cb98 to the candidate set based on an Impact/Effort ratio.","invariants":["Completeness: Output contains all input items","Ordering: Item(N) >= Item(N+1) by Criteria#ef6b"],"parameters":[{"name":"importance_weight","type":"Float","range":"[0.0, 1.0]","description":"Weight for value-impact"},{"name":"urgency_weight","type":"Float","range":"[0.0, 1.0]","description":"Weight for time-sensitivity"}],"hash":"sema:Prioritize#mh:SHA-256:dd165fed938b9e9d4072846d09081f3ac1ab5c278c5abc5e5b0b7bd84fafcd62","stub":"dd16","category":"Strategy","layer":"Mind","signature":[],"preconditions":["Items are comparable"],"postconditions":["Set ordered"],"failureModes":[],"dependencies":{"references":{"task":"Task#d9f9","criteria":"Criteria#ef6b","work":"Work#aaad","value":"Value#3c5d"},"composes_with":{"rank":"Rank#cb98"}}},{"id":"Solution","handle":"Solution#7186","gloss":"The fractal unit of completed work","mechanism":"Recursive Work#aaad Unit. Encapsulates the output Artifact#6254, its Provenance (Creator, Time), and the Component Tree#ddce of sub-solutions used to generate it. It serves as the verifiable output container for a Task#d9f9, validated against the acceptance criteria.","invariants":["Immutability: Once finalized, Artifact#6254 and Provenance cannot be modified.","Traceability: Provenance must be cryptographically signed by the Creator."],"parameters":[{"name":"confidence","type":"Probability","range":"[0.0, 1.0]","description":"Self-assessed reliability"},{"name":"cost_incurred","type":"TokenAmount","range":"unspecified","description":"Total compute cost"}],"hash":"sema:Solution#mh:SHA-256:7186aebe86145a01476542042ab77b7eda5c54033e6dccf62a97e8fa6b94e806","stub":"7186","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":["Artifact#6254 generated","Task#d9f9 ID is valid"],"postconditions":["Solution sealed and ready for transport"],"failureModes":[],"dependencies":{"accepts":{"task":"Task#d9f9"},"references":{"work":"Work#aaad","chain":"Chain#5711","artifact":"Artifact#6254","tree":"Tree#ddce"}}},{"id":"TimeboxThink","handle":"TimeboxThink#2656","gloss":"Temporal bounding of exploration","mechanism":"Bounded Exploration: Set hard time limit before starting. When limit hits, stop regardless of completion. Assess: What did I learn? Is more time justified? Prevents rabbit holes. Forces prioritization of highest-Value#3c5d Work#aaad within Constraint#87fe. Utilizes Budget#a763.","invariants":["Best-so-far answer returned","Execution halts at T_max"],"parameters":[{"name":"checkpoint_interval","type":"Duration","range":"[100ms, 5min]","description":"Save partial results frequency"},{"name":"max_duration","type":"Duration","range":"[1s, 1h]","description":"Hard cutoff for thinking"}],"hash":"sema:TimeboxThink#mh:SHA-256:265679a37dcae704c3e9e8c958f42f11751102e0685e55b1fe277c238bd9c05e","stub":"2656","category":"Protocols","layer":"Society","signature":[],"preconditions":["Open-ended task","Time budget"],"postconditions":["Result within deadline"],"failureModes":[],"dependencies":{"references":{"work":"Work#aaad","budget":"Budget#a763","constraint":"Constraint#87fe","value":"Value#3c5d"}}},{"id":"Translate","handle":"Translate#e75d","gloss":"Convert form while preserving meaning","mechanism":"The process of converting Datum#31cf from one representation (Language, Format, Protocol#7e1c, Ontology) to target content while preserving its semantic meaning. It requires a Source Schema and a Target Schema. It is distinct from 'Summarize' (which loses information) and 'Interpret#c9ee' (which adds meaning).","invariants":["Semantic Equivalence: Meaning(Source) == Meaning(Target).","Reversibility#049f: In ideal cases, Translate(Target, Source) should recover the original (Round-trip)."],"parameters":{},"hash":"sema:Translate#mh:SHA-256:e75d4e97e738a7ae2a377d85a30ce4ed294160b55aa47b778e10424424817429","stub":"e75d","category":"Reasoning","layer":"Mind","signature":[],"preconditions":["Source data matches Source Schema","Target Schema is well-defined"],"postconditions":["Output data matches Target Schema"],"failureModes":[],"dependencies":{"references":{"reversibility":"Reversibility#049f","interpret":"Interpret#c9ee","protocol":"Protocol#7e1c"},"accepts":{"datum":"Datum#31cf"}}},{"id":"Satisfice","handle":"Satisfice#9161","gloss":"Optimizing for speed via threshold acceptance","mechanism":"Threshold Acceptance: Define minimum acceptable criteria upfront. Evaluate options sequentially. Accept first option meeting all thresholds. Stop searching. Optimality is sacrificed for speed and cognitive efficiency. It implements a relaxed version of OptimalStop#7439, terminating the search as soon as the first valid candidate is found.","invariants":["Threshold cannot change mid-search."],"parameters":{},"hash":"sema:Satisfice#mh:SHA-256:91615d1f2766f4391d8b6b01a9ce2c576ecabf278336b638ce9309d916d1827d","stub":"9161","category":"Strategy","layer":"Mind","signature":[],"preconditions":["Option#483e space enumerable. Acceptance threshold defined. Evaluation function exists."],"postconditions":["Option#483e meeting threshold found OR space exhausted. No backtracking occurred. Decision#acfb final."],"failureModes":[],"dependencies":{"references":{"optimal_stop":"OptimalStop#7439","decision":"Decision#acfb","option":"Option#483e"}}},{"id":"Hysteresis","handle":"Hysteresis#78b0","gloss":"Preventing oscillation via asymmetric thresholds","mechanism":"Asymmetric Thresholds: State#4d58 change from A→B requires crossing threshold T_up. State#4d58 change from B→A requires crossing lower threshold T_down. Gap between thresholds prevents oscillation near boundary. Thresholds fixed or adaptive. It uses a Dampen#ff89 effect on state transitions, requiring the signal to cross distinct upper and lower thresholds to switch modes.","invariants":["T_up > T_down always."],"parameters":[{"name":"lower_threshold","type":"Float","range":"[0.0, 1.0]","description":"Trigger to switch OFF, must be < upper"},{"name":"upper_threshold","type":"Float","range":"unspecified","description":"Trigger to switch ON"}],"hash":"sema:Hysteresis#mh:SHA-256:78b01a1947793415b84de8f1883f9e3853f08e62b6647a38e51048d4ecbeb33a","stub":"78b0","category":"Primitives","layer":"Physics","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"state":"State#4d58","dampen":"Dampen#ff89"}}},{"id":"StepBack","handle":"StepBack#b079","gloss":"Ascend abstraction to gain perspective","mechanism":"A meta-cognitive Think#e1bd operation that pauses direct problem-solving to ask a higher-level question. Instead of answering 'How do I X?', it asks 'What category of Problem#5baa is X?' or 'What principles govern X?'. This abstraction reveals structural patterns invisible at the ground level. It is the precursor to Reframe#ba00—gaining altitude before choosing a new direction.","invariants":["Altitude Gain: Output must be at a higher abstraction level than input.","Relevance: Higher-level insight must inform the original problem.","Bounded: Maximum abstraction depth before forced descent."],"parameters":{},"hash":"sema:StepBack#mh:SHA-256:b0799e81851e7cf503b84fcf260b81fa235cc829410fb0da67d5b8a4c1a4305a","stub":"b079","category":"Reasoning","layer":"Mind","signature":["Think(Problem)"],"preconditions":["Specific question or problem"],"postconditions":["Answer grounded in high-level concepts","Principles retrieved before details"],"failureModes":[],"dependencies":{"references":{"reframe":"Reframe#ba00","problem":"Problem#5baa","think":"Think#e1bd"}}},{"id":"Cyclic","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.","invariants":["Recurrence: At least one path exists from a node to itself.","Termination Condition: Must have a defined exit state to prevent infinite loops."],"parameters":{},"hash":"sema:Cyclic#mh:SHA-256:ac1335676817eaedd894da4a2d11671dec5a20dba76a8f5d55d1a6eed20e2051","stub":"ac13","category":"Time","layer":"Physics","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"topology":"Topology#2408","loop":"Loop#fb2e"}}},{"id":"Monitor","handle":"Monitor#9a8f","gloss":"Continuous observation of state over time","mechanism":"A persistent process that uses a Loop#fb2e to repeatedly execute Observe#8ebd on a target System#e314 or State#4d58 at defined intervals. It compares the observed state against a baseline or invariant, emitting a Signal#f39d if a deviation (Anomaly#7987) is detected.","invariants":["Liveness: Must run continuously or periodically.","Non-Interference: Monitoring should not significantly alter the observed system."],"parameters":[{"name":"interval","type":"Duration","range":"unspecified","description":"Time between observation cycles"},{"name":"threshold","type":"Float","range":"unspecified","description":"Alert threshold for the monitored metric"}],"hash":"sema:Monitor#mh:SHA-256:9a8f8879765fe55f9ab79786671b7e4cf0aa0e61730e20897214b22fb6fa08bb","stub":"9a8f","category":"Strategy","layer":"Mind","signature":["Loop(State)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"state":"State#4d58","signal":"Signal#f39d","system":"System#e314","anomaly":"Anomaly#7987"},"composes_with":{"loop":"Loop#fb2e","observe":"Observe#8ebd"}}},{"id":"Resonate","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.","invariants":["Action Causality: Response(t+1) must be function of Stimulus(t)","Signal#f39d Decay#a1d4: Unreinforced signals must fade over time"],"parameters":[{"name":"amplification_factor","type":"Float","range":"[1.0, 2.0]","description":"How much repeated alignment signals boost coordination strength"},{"name":"signal_decay","type":"Float","range":"[0.1, 0.9]","description":"Rate at which unconfirmed alignment signals weaken over time"}],"hash":"sema:Resonate#mh:SHA-256:99d9c2629e862fb9f647bb98e30eba4a47b9204bea6e61f79709b65f8fac55b4","stub":"99d9","category":"Economics","layer":"Society","signature":[],"preconditions":["At least two agents","Shared signal medium (Environment)"],"postconditions":["Local alignment cluster formed OR dispersed"],"failureModes":[],"dependencies":{"references":{"spectral_tune":"SpectralTune#6c65","signal":"Signal#f39d","noise":"Noise#c4b4","loop":"Loop#fb2e","decay":"Decay#a1d4","dampen":"Dampen#ff89"}}},{"id":"SunkCostIgnore","handle":"SunkCostIgnore#4dc3","gloss":"Rationality over historical investment","mechanism":"Fresh Slate Evaluation: When deciding whether to continue, ask: \"If I were starting fresh today with current resources, would I begin this project?\" Past investment is irrelevant to future value. Only future costs and benefits matter. Kill zombies early. Utilizes OpportunityCost#1c66.","invariants":["Decision#acfb based ONLY on future utility","Past investment excluded from calc"],"parameters":{},"hash":"sema:SunkCostIgnore#mh:SHA-256:4dc35c44a5267415e5ddb5e07a802229242be890db74b697881178da91ccad8f","stub":"4dc3","category":"Strategy","layer":"Mind","signature":[],"preconditions":["Decision#acfb point","History of investment"],"postconditions":["Rational choice made"],"failureModes":[],"dependencies":{"references":{"opportunity_cost":"OpportunityCost#1c66","decision":"Decision#acfb","loop":"Loop#fb2e"}}},{"id":"Defer","handle":"Defer#6460","gloss":"Postponing decisions until more information available","mechanism":"Strategic Postponement: When facing decision with high uncertainty, ask: \"What would I learn by waiting?\" If waiting reveals information that changes the decision, defer. If not, decide now. Avoid analysis paralysis by setting a deadline. It relies on Prioritize#dd16 to re-insert the task into the queue once the waiting condition is met.","invariants":["Deferral must have information value.","State#4d58 Preservation: Context#510a must be saved for resumption","Trigger Definition: WakeUpCondition must be explicit"],"parameters":{},"hash":"sema:Defer#mh:SHA-256:6460dcc0c5f0fd94cc3bcb7ff9bb4fe5eee0b5e1d3ea588b73f762bd4843a6b3","stub":"6460","category":"Strategy","layer":"Mind","signature":[],"preconditions":["Task#d9f9 is not urgent"],"postconditions":["Task#d9f9 queued"],"failureModes":[],"dependencies":{"references":{"task":"Task#d9f9","state":"State#4d58","prioritize":"Prioritize#dd16","context":"Context#510a","decision":"Decision#acfb"}}},{"id":"Eliminate","handle":"Eliminate#43ea","gloss":"Sherlock Holmes deduction via falsification","mechanism":"Systematic Exclusion: Enumerate all possible answers. For each, find a test that could falsify it. Apply tests in order of cost (cheapest first). Remove falsified options. Continue until one remains or no tests left. Remaining options are candidates. It uses Prioritize#dd16 to order falsification tests by cost/efficiency before executing them.","invariants":["Option#483e set must be exhaustive at start."],"parameters":{},"hash":"sema:Eliminate#mh:SHA-256:43ea687e3560a55f221807138469697a6f331e687fa542c66ddf4d97f07174b0","stub":"43ea","category":"Reasoning","layer":"Mind","signature":[],"preconditions":["Option#483e set exhaustive. Falsification tests available. At least one option must survive."],"postconditions":["Remaining options equally valid. Eliminated options have falsifying evidence. Search space reduced."],"failureModes":[],"dependencies":{"references":{"prioritize":"Prioritize#dd16","option":"Option#483e"}}},{"id":"ConstraintRelax","handle":"ConstraintRelax#384d","gloss":"Escaping local optima by loosening bounds","mechanism":"Boundary Softening: When stuck, list all constraints. Rank#cb98 by actual importance vs assumed importance. Temporarily remove lowest-ranked constraint. Solve relaxed problem. Check#1544 if Solution#7186 can be adapted to respect original constraint. It performs the relaxation experiment within a Bubble#eb9a to verify the solution's viability before altering real production constraints.","invariants":["Solution#7186 must be checked against original constraints."],"parameters":{},"hash":"sema:ConstraintRelax#mh:SHA-256:384d442837c23564ac4cb219e071c691e59f2e2ca3f181d2e4bae9d7caa5694f","stub":"384d","category":"Protocols","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"bubble":"Bubble#eb9a","rank":"Rank#cb98","check":"Check#1544","constraint":"Constraint#87fe"},"yields":{"solution":"Solution#7186"}}},{"id":"Invert","handle":"Invert#d1b9","gloss":"Solution discovery via negation","mechanism":"Opposition Solve: Instead of asking \"how do I achieve X?\", ask \"how would I guarantee failure at X?\" or \"how would I achieve NOT-X?\". List answers. Invert each answer to get candidate Solution#7186s for original Problem#5baa. Often reveals blind spots. It applies Reframe#ba00 by negating the goal State#4d58, solving for failure to identify necessary conditions for success.","invariants":["Inversion must be logical negation, not just opposite.","Double Negation: Invert(Invert(X)) implies X."],"parameters":{},"hash":"sema:Invert#mh:SHA-256:d1b9169d5b598e4f7f3d4d58bc2feea0f45c7830b32445fa6ab2666db271fa42","stub":"d1b9","category":"Reasoning","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"reframe":"Reframe#ba00","problem":"Problem#5baa","state":"State#4d58"},"accepts":{"solution":"Solution#7186"}}},{"id":"MechanisticDesignProposal","handle":"MechanisticDesignProposal#8cf7","gloss":"Dialectic blueprint of a system mechanism with temporal projections","mechanism":"A structured blueprint for a systemic Solution#7186 that addresses a Problem#5baa in a System#e314. It goes beyond a standard proposal by requiring the definition of a core mechanism—the specific leverage point and causal chain used to alter system behavior. The proposal integrates the 'Why it Works' (defense) and 'Why it Fails' (attack) dialectic, along with medium-term implementation and long-term vision projections.","invariants":["Dialectic Balance: 'why_it_fails' must be as detailed as 'why_it_works'.","Causal Clarity: Must define the mechanism of action (how A causes B).","Novelty Requirement: 'what_is_new' must identify the unique contribution.","Temporal Completeness: Must include both medium_term and long_term_vision."],"parameters":{},"hash":"sema:MechanisticDesignProposal#mh:SHA-256:8cf72275c6678ea0c57d497fff459f6f9c5259330524fe8f9bb3af63b7df9c06","stub":"8cf7","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"yields":{"solution":"Solution#7186"},"accepts":{"system":"System#e314","problem":"Problem#5baa"}}},{"id":"Optimize","handle":"Optimize#3075","gloss":"Maximize utility against a metric","mechanism":"The iterative process of adjusting parameters or structure to maximize (or minimize) a specific Objective Function defined by a Metric#8895. It involves generating candidate Solution#7186s, evaluating them against the metric, and selecting the best. It can be Local (Gradient Descent) or Global#803d (Evolutionary).","invariants":["Monotonicity: Each step (or epoch) should ideally improve (or not degrade) the best-known Solution#7186.","Measurability: The Objective Function must be quantifiable via a Metric#8895."],"parameters":{},"hash":"sema:Optimize#mh:SHA-256:30759374ede0314268d795a5a9878ac68876d0695c4ce0847e615da2b9fedf32","stub":"3075","category":"Strategy","layer":"Mind","signature":[],"preconditions":["Objective Function is defined","Candidate space is explorable","Baseline Metric#8895 is known"],"postconditions":["Best Candidate Solution#7186 found","Metric#8895 improved over Baseline"],"failureModes":[],"dependencies":{"references":{"metric":"Metric#8895","global":"Global#803d"},"accepts":{"solution":"Solution#7186"}}},{"id":"OutputGuard","handle":"OutputGuard#eb44","gloss":"Final egress filter for safety and privacy","mechanism":"Post-generation content filter. Scans candidate Solution#7186 against PII patterns and Toxicity Classifiers. If Score > Threshold, triggers mitigation (Redact/Reject). It mirrors the logic of input guard but applied to egress traffic, scanning for leakage or toxicity.","invariants":["Fail-Safe: If Scanner fails (timeout/error), Output is BLOCKED (not passed).","Privacy First: If PII detected, Redaction is mandatory."],"parameters":[{"name":"pii_mode","type":"Enum","range":"{Redact, Block, Hash}","description":"Default: Redact"},{"name":"scan_timeout","type":"Duration","range":"unspecified","description":"Default: 500ms"},{"name":"toxicity_threshold","type":"Float","range":"[0.0, 1.0]","description":"Default: 0.8"}],"hash":"sema:OutputGuard#mh:SHA-256:eb44b7e751219a94f752bb8827843ede1045bc1a4195d9d0db3648f9ae097bb0","stub":"eb44","category":"Verification","layer":"Infrastructure","signature":[],"preconditions":["Candidate solution generated","Safety policies active"],"postconditions":["Safe output delivered OR Block signal returned"],"failureModes":[],"dependencies":{"references":{"problem":"Problem#5baa","context":"Context#510a"},"accepts":{"solution":"Solution#7186"}}},{"id":"ProblemSpace","handle":"ProblemSpace#78da","gloss":"Bounded domain of a problem","mechanism":"A defined region of the problem landscape, bounded by Constraint#87fes and initial State#4d58. It represents the domain within which a solver must operate to find a valid Solution#7186.","invariants":["Boundedness: Must have defined constraints.","Consistency: The space must not contain contradictory definitions."],"parameters":{},"hash":"sema:ProblemSpace#mh:SHA-256:78da7fef93c3a5e6a7728d30afcb0e8e9270493b23b36bd83acf2ee6977271d1","stub":"78da","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"solution":"Solution#7186","state":"State#4d58","constraint":"Constraint#87fe"}}},{"id":"Result","handle":"Result#8ed9","gloss":"The output of agentic transformation","mechanism":"The canonical output of an operation (often a Solution#7186). It encapsulates success/failure status, the artifact produced, and associated Metric#8895s such as time taken, resources consumed, and confidence score. It serves as the bridge between execution and evaluation.","invariants":["Provenance: Every Result must trace to the Task and Solver that produced it.","Immutability: Once yielded, a Result cannot be modified (only superseded).","Measurability: Resource consumption must be recorded."],"parameters":{},"hash":"sema:Result#mh:SHA-256:8ed9ca66a8508e8603e8da74b545f03b832f7e8b8d4e2fd56c496dcc29afb2ef","stub":"8ed9","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"metric":"Metric#8895","solution":"Solution#7186"}}},{"id":"SemanticTabu","handle":"SemanticTabu#82dd","gloss":"Constraint-based novelty enforcement","mechanism":"An ideation protocol where the agent explicitly lists existing mechanisms as 'Tabu' (forbidden). It must then solve the problem without using any mechanism on the list. This forces the activation of latent, low-probability pathways in the semantic network. It broadcasts the forbidden list via Trace#9057 to ensure the entire swarm respects the constraint.","invariants":["Constraint#87fe Satisfaction: Output ∩ TabuList == Ø","Explicit Avoidance: Reasoning trace must cite what is being avoided"],"parameters":{},"hash":"sema:SemanticTabu#mh:SHA-256:82dd562ed60295db85be7b4dee32caf80fea5c78f6b3930c7f316f2a693e9176","stub":"82dd","category":"Inference","layer":"Mind","signature":[],"preconditions":["Known solutions exist"],"postconditions":["Solution#7186 is structurally distinct from Clichés"],"failureModes":[],"dependencies":{"references":{"solution":"Solution#7186","trace":"Trace#9057","constraint":"Constraint#87fe"}}},{"id":"Solver","handle":"Solver#1c9b","gloss":"Abstract interface for transforming Tasks into Solutions","mechanism":"The abstract role (or Protocol#7e1c) of any agent or process that accepts a Task#d9f9 and produces a Solution#7186. A Solver is the fundamental unit of work execution in the system, adhering to the input/output contract defined by the Task protocol.","invariants":[],"parameters":{},"hash":"sema:Solver#mh:SHA-256:1c9beeb5cffc0c686b5291439d830a2104225589f91a66bd0a83038f1a0a8982","stub":"1c9b","category":"Strategy","layer":"Mind","signature":["Protocol(Task)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"accepts":{"task":"Task#d9f9"},"yields":{"solution":"Solution#7186"},"references":{"protocol":"Protocol#7e1c"}}},{"id":"WhyClimb","handle":"WhyClimb#156a","gloss":"Recursive problem abstraction","mechanism":"A root-cause analysis protocol where the agent iteratively asks 'Why is this a problem?' to Reframe#ba00 the Problem#5baa and ascend the abstraction hierarchy. The goal is to reach the 'Ceiling'—the highest level where the problem is still actionable but the solution space is maximized. Utilizes RecursiveRootCause#6dc1.","invariants":["Ascension: Scope(Level N+1) > Scope(Level N)","Stop Condition#cbd5: Halt when 'Why' leads to a value judgment or physics constraint"],"parameters":{},"hash":"sema:WhyClimb#mh:SHA-256:156aa8762c7c0007b72d0869b470c7c9d31aaf19d0815e51b9bce872d925db4f","stub":"156a","category":"Reasoning","layer":"Mind","signature":["Reframe(Problem)"],"preconditions":["Problem#5baa is well-formed"],"postconditions":["Solution#7186 space expanded"],"failureModes":[],"dependencies":{"references":{"problem":"Problem#5baa","reframe":"Reframe#ba00","condition":"Condition#cbd5","recursive_root_cause":"RecursiveRootCause#6dc1","solution":"Solution#7186"}}},{"id":"Summarize","handle":"Summarize#6a00","gloss":"Lossy compression preserving salience","mechanism":"The cognitive process of Compress#0967ing a large Datum#31cf or Artifact#6254 into a smaller Summary#310e while preserving its most high-Value#3c5d (salient) information. Distinct from Translate#e75d, which preserves the full semantic scope. It is a lossy transformation.","invariants":["Compression: Output size < Input size","Salience: Information Density(Output) > Information Density(Input)","Fidelity: No new information added (No hallucination)"],"parameters":{},"hash":"sema:Summarize#mh:SHA-256:6a000fd570638ecd8dd239be23317cf6b004e2f5ed784822f41f6658ee669c2c","stub":"6a00","category":"Reasoning","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"translate":"Translate#e75d","compress":"Compress#0967","value":"Value#3c5d","artifact":"Artifact#6254"},"accepts":{"datum":"Datum#31cf"},"yields":{"summary":"Summary#310e"}}},{"id":"TranslationProxy","handle":"TranslationProxy#f0e0","gloss":"Protocol adaptation wrapper","mechanism":"A stateless agent that wraps a legacy system. It intercepts 'modern' agent signals, uses Translate#e75d to convert them into legacy Protocol#7e1c API calls, and translates responses back. It acts as a 'spacesuit' for the legacy system. Utilizes OntologyHandshake#ead0 and Compare#4881 to verify semantic fidelity.","invariants":["Semantic meaning preserved across languages/ontologies","Type safety maintained"],"parameters":{},"hash":"sema:TranslationProxy#mh:SHA-256:f0e0d8b01e88f45c1d6791f41ed1686a96e40fc48f541c31568d48bb83ad988e","stub":"f0e0","category":"Protocols","layer":"Society","signature":["Translate(Protocol)"],"preconditions":["Message#f767 M in Protocol#7e1c A","Target Protocol#7e1c B"],"postconditions":["Message#f767 M' in Protocol#7e1c B"],"failureModes":[],"dependencies":{"references":{"compare":"Compare#4881","ontology_handshake":"OntologyHandshake#ead0","translate":"Translate#e75d","protocol":"Protocol#7e1c","message":"Message#f767"}}},{"id":"EbbFlowSync","handle":"EbbFlowSync#49e0","gloss":"Cyclical connectivity modes","mechanism":"System#e314 oscillates between High Tide (synchronous, high-bandwidth, global lock) and Low Tide (asynchronous, disconnected, local-only). Agents strictly enforce this rhythm, allowing for massive scaling during Low Tide and reconciliation during High Tide. It employs Hysteresis#78b0 to dampen the transition between connected (Flow) and disconnected (Ebb) states.","invariants":["Phase Lock#5bf2: All agents must be in same phase (Ebb or Flow) at time T","Tide Transition#072d: Flow cannot start until Ebb reconciliation is complete"],"parameters":[{"name":"high_watermark","type":"Float","range":"[0.5, 0.95]","description":"Threshold to trigger ebb"},{"name":"low_watermark","type":"Float","range":"[0.1, 0.5]","description":"Threshold to allow flow"},{"name":"measurement_window","type":"Duration","range":"[1s, 1min]","description":"Averaging period"}],"hash":"sema:EbbFlowSync#mh:SHA-256:49e074204bb067c6f1aedc7c19bd5c07f052f4d3978f7459692ce90de1d1b533","stub":"49e0","category":"Protocols","layer":"Society","signature":[],"preconditions":["Global#803d clock synchronization < Delta"],"postconditions":["State#4d58 is consistent up to last High Tide"],"failureModes":[],"dependencies":{"references":{"state":"State#4d58","system":"System#e314","global":"Global#803d","transition":"Transition#072d","lock":"Lock#5bf2","hysteresis":"Hysteresis#78b0"}}},{"id":"Heartbeat","handle":"Heartbeat#4ddc","gloss":"Liveness detection via periodic signals","mechanism":"Periodic Liveness Signal#f39d: An entity emits Signal#f39d (Heartbeat) every interval I. Missing K consecutive heartbeats triggers failure detection. Heartbeat may include health metrics. Receiver tracks last-seen timestamp. It feeds into the Quorum#f67a detector, allowing the collective to identify and prune dead nodes.","invariants":["Missing signal implies failure","Signal#f39d frequency within tolerance"],"parameters":[{"name":"interval","type":"Duration","range":"[100ms, 60s]","description":"Time between heartbeats"},{"name":"timeout_multiplier","type":"Integer","range":"[2, 5]","description":"Missed beats before failure"}],"hash":"sema:Heartbeat#mh:SHA-256:4ddcf5f4db2eae064be16c42c4c1376bb9e7cc2774b9396c47413a4bdf89dfdf","stub":"4ddc","category":"Time","layer":"Physics","signature":[],"preconditions":["Active component","Monitor#9a8f"],"postconditions":["Liveness confirmed"],"failureModes":[],"dependencies":{"composes_with":{"quorum":"Quorum#f67a"},"accepts":{"signal":"Signal#f39d"},"references":{"monitor":"Monitor#9a8f"}}},{"id":"RolloutWatch","handle":"RolloutWatch#5b2d","gloss":"Continuous verification of deployed state against manifest","mechanism":"The final State#4d58 of workflow orchestration. It implements Monitor#9a8f by using Observe#8ebd to track the deployed Solution#7186's performance on the System#e314 against the 'Definition of Done' defined in the RolloutManifest#9e7f. If reality deviates from the plan (e.g., error rate spikes), it routes evidence back upstream via a MonitorReport#063c. It closes the feedback Loop#fb2e.","invariants":["Fidelity: Metrics must accurately reflect the 'Definition of Done'.","Actionability: Alerts must be routed to an agent capable of fixing them."],"parameters":{},"hash":"sema:RolloutWatch#mh:SHA-256:5b2db93248ae390eb136b9a06f21cc6f6c2a87fa676d015a2a8d0fa64c2c4dc1","stub":"5b2d","category":"Protocols","layer":"Society","signature":["Observe(System, RolloutManifest)"],"preconditions":["Rollout complete","Telemetry active"],"postconditions":["MonitorReport artifact generated"],"failureModes":[],"dependencies":{"references":{"state":"State#4d58","system":"System#e314","monitor":"Monitor#9a8f","solution":"Solution#7186"},"accepts":{"rollout_manifest":"RolloutManifest#9e7f"},"composes_with":{"observe":"Observe#8ebd","loop":"Loop#fb2e"},"yields":{"monitor_report":"MonitorReport#063c"}}},{"id":"Yield","handle":"Yield#7eaf","gloss":"Enable fair resolution of genuine disagreements without defaulting to power dynamics or eternal deadlock","mechanism":"Negotiation Backoff#315a. When `Overlap#bcfa` fails: 1. Agents declare 'Flex' (concession) and 'Weight' (importance). 2. System#e314 computes Yield-Ratio. 3. Lower-weighted preference cedes to higher. 4. Debt recorded in Ledger. Utilizes Defer#6460.","invariants":["Yielder cannot reclaim."],"parameters":{},"hash":"sema:Yield#mh:SHA-256:7eaffd4f68072f2f82302e3d2deb33a830bc9f1148b64d705cf4d08125b248e0","stub":"7eaf","category":"Economics","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"overlap":"Overlap#bcfa","defer":"Defer#6460","backoff":"Backoff#315a","system":"System#e314"}}},{"id":"MetricDissolution","handle":"MetricDissolution#b840","gloss":"Solving by deleting the problem variable","mechanism":"A high-level reframing move. Instead of optimizing a problematic metric (e.g., 'Maximize Speed'), the agent dissolves the metric entirely (e.g., 'Eliminate#43ea the need for travel'). It solves the problem by proving the constraint was an artifact of the formulation, not reality. It applies Invert#d1b9 to question the necessity of the optimization target, often allowing the agent to Eliminate#43ea the constraint entirely.","invariants":["Functional Equivalence: The user's intent is met without the proxy metric","Variable#179a Reduction: Count(Variables_New) < Count(Variables_Old)"],"parameters":{},"hash":"sema:MetricDissolution#mh:SHA-256:b840cc85842c1add353edfadfbd13a8059cb35a87ffd070106040b8dc414c6bb","stub":"b840","category":"Strategy","layer":"Mind","signature":[],"preconditions":["Standard optimization is hitting diminishing returns"],"postconditions":["Problem#5baa complexity reduced"],"failureModes":[],"dependencies":{"references":{"variable":"Variable#179a","invert":"Invert#d1b9","problem":"Problem#5baa","eliminate":"Eliminate#43ea"}}},{"id":"LateralOptimization","handle":"LateralOptimization#5350","gloss":"Reframe -> Optimize -> Translate loop","mechanism":"A Creative#5574 problem-solving loop to Think#e1bd and escape local optima by shifting domains. \n1. Reframe#ba00: Transform the problem P into a mapped domain P' (e.g., Code -> Biological System#e314).\n2. Optimize#3075: Solve or improve P' to get Solution#7186 S' using domain-specific heuristics of the new frame to reach Global#803d maxima.\n3. Translate#e75d: Map S' back to the original domain to get Solution#7186 S.\nThis technique leverages the fact that different domains have different 'easy' problems and optimization landscapes.","invariants":["Analogy Coherence: The mapping between domains must be structurally consistent.","Solution#7186 Validity: The final output must satisfy the original constraints."],"parameters":{},"hash":"sema:LateralOptimization#mh:SHA-256:5350ae13501544830ea8db150d55264a15e06ac1d231c16d02207ae0b48eadba","stub":"5350","category":"Strategy","layer":"Mind","signature":["Think(Creative)","Optimize(Global)"],"preconditions":["Hard problem (Local Optimum reached)","Available Analogy/Frame"],"postconditions":["Novel solution found","Perspective shift recorded"],"failureModes":[],"dependencies":{"references":{"system":"System#e314","think":"Think#e1bd","global":"Global#803d","creative":"Creative#5574","solution":"Solution#7186"},"composes_with":{"optimize":"Optimize#3075","reframe":"Reframe#ba00","translate":"Translate#e75d"}}},{"id":"FailClosed","handle":"FailClosed#ae79","gloss":"Default-deny policy for uncertain states","mechanism":"Safety Default. If an operation fails, times out, or returns an ambiguous result, the system MUST treat it as a Negative (Deny/Stop/Reject). Prevents 'bypass on error' vulnerabilities. It acts as the wrapper for input guarding, OutputGuard#eb44, and CircuitBreaker#4162, enforcing a default-deny policy on any error or ambiguity.","invariants":["Default Deny: Ambiguity == Rejection.","Error Atomicity: Partial failure = Total failure (Transaction Rollback)."],"parameters":[{"name":"timeout_action","type":"Enum","range":"{Reject, Retry, Fallback}","description":"Default: Reject"}],"hash":"sema:FailClosed#mh:SHA-256:ae79e8e091ca9f68f749936a99d55a386fba49254f9e7e958806b16b860332a1","stub":"ae79","category":"Protocols","layer":"Society","signature":[],"preconditions":["Fallible operation initiated"],"postconditions":["System#e314 state remains invariant (no side effects) OR Operation succeeds"],"failureModes":[],"dependencies":{"references":{"output_guard":"OutputGuard#eb44","system":"System#e314","circuit_breaker":"CircuitBreaker#4162"}}},{"id":"Feedback","handle":"Feedback#9b5c","gloss":"Error correction signal","mechanism":"Information returned to a system about the effects of its actions, used to adjust future behavior. It closes the loop between output and input, enabling learning and error correction. The feedback Signal#f39d contains a Result#8ed9 and a Metric#8895 indicating deviation (Incongruity#e98f) from the expected outcome.","invariants":["Directionality: Feedback must indicate the direction of error, not just magnitude.","Timeliness: Feedback value decays with latency.","Attribution: Feedback must be traceable to a specific action."],"parameters":{},"hash":"sema:Feedback#mh:SHA-256:9b5c7eee86ff79389e6fc9a4cd4e318296ff3e74e3e67514f8193a45be917e15","stub":"9b5c","category":"Primitives","layer":"Infrastructure","signature":["Signal(Incongruity)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"result":"Result#8ed9","metric":"Metric#8895","incongruity":"Incongruity#e98f"},"composes_with":{"signal":"Signal#f39d"}}},{"id":"Goal","handle":"Goal#456a","gloss":"Specification of desired end state","mechanism":"A specification of a desired end state. It defines the target that Work#aaad aims to achieve and that evaluation measures against. A Goal is testable: given a Result#8ed9, one can determine if the Goal is satisfied. Goals can be composed (AND/OR) and prioritized.","invariants":["Testability: Given a Result, Goal satisfaction must be decidable.","Stability: Goal should not change during a single execution cycle."],"parameters":{},"hash":"sema:Goal#mh:SHA-256:456a8a283dc469d46b3307147a853e4be7d07f0d6c4477d789b8ab14aa33b02a","stub":"456a","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"result":"Result#8ed9","work":"Work#aaad"}}},{"id":"Bid","handle":"Bid#cf07","gloss":"Binding offer from solver to execute task","mechanism":"A binding offer Artifact#6254 from a Solver#1c9b to execute a Task#d9f9. It declares: 1. Expected Value#3c5d Cost (Time/Tokens/USD), 2. Confidence Interval (probability of success), 3. Capability Match (which parts of the Task#d9f9 the Solver#1c9b can handle). It serves as the input for the ComputeBudget#3b98 Go/No-Go decision. A Bid is a commitment: Solver#1c9bs cannot exceed bid cost without explicit renegotiation.","invariants":["Binding: Solver#1c9b cannot exceed Bid cost without requesting Budget#a763 expansion.","Pre-Execution: Must be generated before work begins.","Verifiable: Bid components must be objectively measurable post-hoc."],"parameters":{},"hash":"sema:Bid#mh:SHA-256:cf07d1105de889786c1fbb618128ab03b34964fa4a7ab983c8d0f4d1d984b43e","stub":"cf07","category":"Economics","layer":"Society","signature":["Artifact(Value)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"task":"Task#d9f9","compute_budget":"ComputeBudget#3b98","solver":"Solver#1c9b","value":"Value#3c5d","budget":"Budget#a763","artifact":"Artifact#6254"}}},{"id":"SolverManifest","handle":"SolverManifest#67ac","gloss":"Typed solver identity and capability declaration","mechanism":"A typed declaration of a Solver#1c9b's identity and capabilities. It contains: 1. Name/ID (unique identifier), 2. Competencies (what problem types it handles), 3. Tool Access (what actions it can perform), 4. Cost Model (expected resource usage), 5. Constraint#87fes (what it must never do). Manifests enable runtime solver selection and composition. It serves as the boot-loader for worker mode.","invariants":["Accuracy: Manifest must truthfully reflect solver capabilities.","Completeness: All relevant capabilities and constraints must be listed.","Immutability: Manifest is versioned; changes require new version.","Identity Lock: Must specify a distinct persona/system prompt.","Capability Bound: Must explicitly list available tools."],"parameters":{},"hash":"sema:SolverManifest#mh:SHA-256:67acaedb52d3ca227a4ed3a462cb2834aa3ccb8d85c3ea4eff7ed3bfb879620b","stub":"67ac","category":"Protocols","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"solver":"Solver#1c9b","constraint":"Constraint#87fe"}}},{"id":"QuorumPulse","handle":"QuorumPulse#abc8","gloss":"Fluid, organic synchronization without rigid clock ticks.","mechanism":"Signal#f39d Density Trigger: State#4d58 transitions trigger only when local signal density exceeds threshold. It syncs state via Heartbeat#4ddc signals, triggering transitions only when signal density exceeds the quorum threshold.","invariants":["Quorum#f67a: Action triggers if PulseCount > QuorumThreshold within Window","Liveness: Pulse frequency > 0","Pulse acknowledgment required."],"parameters":{},"hash":"sema:QuorumPulse#mh:SHA-256:abc8db906b1c09597b0efba1b13519dfe7d9a0a95b609df067456db3de944f0c","stub":"abc8","category":"Protocols","layer":"Society","signature":[],"preconditions":["Network is asynchronous"],"postconditions":["Action triggered or suppressed by vote"],"failureModes":[],"dependencies":{"references":{"quorum":"Quorum#f67a","signal":"Signal#f39d","heartbeat":"Heartbeat#4ddc","state":"State#4d58"}}},{"id":"Exception","handle":"Exception#bcdc","gloss":"Runtime anomaly signal","mechanism":"A signal indicating that the standard execution flow has encountered a critical anomaly or invalid State#4d58. Must be handled explicitly by a CircuitBreaker#4162 or FailClosed#ae79 policy to prevent system corruption.","invariants":[],"parameters":{},"hash":"sema:Exception#mh:SHA-256:bcdc11a8b6e4c1af2def02029ab03bf24c1480bd827ee3d570e374096cfccdc6","stub":"bcdc","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"state":"State#4d58","circuit_breaker":"CircuitBreaker#4162","fail_closed":"FailClosed#ae79"}}},{"id":"ThreeLevelCollision","handle":"ThreeLevelCollision#5db4","gloss":"Stub, hash, and homograph collisions are different threats","mechanism":"Threat Modeling Primitive. Distinguishes three collision classes and assigns specific defenses: (1) Stub Collision (Namespace exhaustion) -> Defended by full-hash verification. (2) Hash Collision (Cryptographic failure) -> Defended by SHA-256 entropy. (3) Homograph Collision (Semantic spoofing) -> Defended by Social Uptake and Reputation. Utilizes FailClosed#ae79.","invariants":["L1 Defense: Stub match is NOT verification. Full hash check is mandatory.","L3 Defense: Identity#626c is Content, not Handle. A 'spoofed' pattern is simply a different pattern with zero reputation."],"parameters":{},"hash":"sema:ThreeLevelCollision#mh:SHA-256:5db438e5f38882afa181ea527d06b673f64139f42390b9e795cf2ecc9efa29af","stub":"5db4","category":"Protocols","layer":"Society","signature":[],"preconditions":["Sema Hashing Algorithm (SHA-256) is secure"],"postconditions":["Appropriate verification logic applied","Threat level identified"],"failureModes":[],"dependencies":{"references":{"identity":"Identity#626c","fail_closed":"FailClosed#ae79"}}},{"id":"FeedbackSignal","handle":"FeedbackSignal#f904","gloss":"Standardized learning feedback packet","mechanism":"A structured packet containing the evaluation of a specific Solution#7186 for a Task#d9f9. Carries outcome and details to the Feedback#9b5c mechanism.","invariants":["Targeted","Structured"],"parameters":{},"hash":"sema:FeedbackSignal#mh:SHA-256:f90478ac868a5f7cc8800278a412c19dfaf50e8edb7a93a06dce6c0ae41ae52c","stub":"f904","category":"Protocols","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"task":"Task#d9f9","feedback":"Feedback#9b5c","solution":"Solution#7186"}}},{"id":"StructuralCoaching","handle":"StructuralCoaching#3da9","gloss":"Guidance on deep structure vs surface features","mechanism":"A feedback pattern for Creative#5574 iteration. The Critic rejects a proposal not because of its content (surface), but because of its logical form (structure). It explicitly guides the Generator to shift the 'Mechanism Class' (e.g., from Individual to Collective) while ignoring the 'Topic' (e.g., Money vs Time). Utilizes Invert#d1b9, Feedback#9b5c.","invariants":["Depth Distinction: Critique#3e00 must target Mechanism, not Vocabulary","Directional Guidance: Rejection must propose a structural pivot (e.g., 'Invert#d1b9 the flow')"],"parameters":{},"hash":"sema:StructuralCoaching#mh:SHA-256:3da94d81638b577c42981039f4399705519db8a102dd8e16b7b51cbd6695b0b4","stub":"3da9","category":"Protocols","layer":"Society","signature":[],"preconditions":["Generator is stuck in a local optimum"],"postconditions":["Next proposal uses distinct logic"],"failureModes":[],"dependencies":{"references":{"creative":"Creative#5574","invert":"Invert#d1b9","feedback":"Feedback#9b5c","critique":"Critique#3e00"}}},{"id":"Agent","handle":"Agent#cc24","gloss":"Autonomous Goal-Directed Entity","mechanism":"The fundamental unit of agency. An Actor#6926 capable of perceiving its environment (Observe#8ebd), maintaining internal State#4d58, reasoning about that State#4d58 (Think#e1bd), and taking Act#5d55ions to achieve a Goal#456a. It operates in a continuous Loop#fb2e.","invariants":["Agency: Must possess an explicit objective function.","Autonomy: Must be capable of selection (choosing between >1 options).","Identity#626c Persistence: The agent maintains a consistent identity (ID/Memory) across time steps."],"parameters":{},"hash":"sema:Agent#mh:SHA-256:cc241813ab693736c29e02030d0f6c5453d63b603069191c1422a2529553daf5","stub":"cc24","category":"Strategy","layer":"Mind","signature":[],"preconditions":["Environment is instantiated","Goal#456a is defined","Resources (Compute/Time) are allocated"],"postconditions":["Goal#456a is satisfied OR Agent is terminated","Trace#9057 of actions is preserved"],"failureModes":[],"dependencies":{"references":{"trace":"Trace#9057","state":"State#4d58","metric":"Metric#8895","actor":"Actor#6926","loop":"Loop#fb2e","identity":"Identity#626c","goal":"Goal#456a"},"composes_with":{"act":"Act#5d55","think":"Think#e1bd","observe":"Observe#8ebd"}}},{"id":"Plan","handle":"Plan#64f2","gloss":"An ordered sequence of steps to achieve a goal","mechanism":"An Artifact#6254 containing a structured Sequence#b0b8 of Step#5f22s designed to transition a System#e314 from a current State#4d58 to a target Goal#456a. Unlike a simple list, a Plan enforces causal dependency between steps and resource allocation.","invariants":["Ordering: Steps must be causally sortable.","Termination: Plan must have a defined end state."],"parameters":{},"hash":"sema:Plan#mh:SHA-256:64f273fc1710ca9d5b52a39758cf8e68279778d32856de4629a44ad7a7f5a4bc","stub":"64f2","category":"Data Structures","layer":"Infrastructure","signature":["Artifact(Step)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"sequence":"Sequence#b0b8","state":"State#4d58","system":"System#e314","step":"Step#5f22","artifact":"Artifact#6254","goal":"Goal#456a"}}},{"id":"LocalizedLearning","handle":"LocalizedLearning#69bb","gloss":"Partitioned feedback router for solver learning","mechanism":"A learning process that performs the Act#5d55 of routing FeedbackSignal#f904 exclusively to the specific SolverManifest#67ac that generated the result. By partitioning memory updates by subproblem type, it prevents the catastrophic interference common in monolithic models. The feedback signal is tagged with solver ID, ensuring updates are isolated.","invariants":["Isolation: Update(Solver_A) cannot change Weights(Solver_B).","Attribution: Each feedback signal must identify its source solver.","Standardization: Feedback format is universal across all solver types."],"parameters":{},"hash":"sema:LocalizedLearning#mh:SHA-256:69bb2e9eea4ed50d3aa6213e7fc068cb247ec3d1737b707a9679bfba81c72f9b","stub":"69bb","category":"Protocols","layer":"Society","signature":["Act(FeedbackSignal)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"solver_manifest":"SolverManifest#67ac","act":"Act#5d55"},"accepts":{"feedback_signal":"FeedbackSignal#f904"}}},{"id":"AgentSandbox","handle":"AgentSandbox#8719","gloss":"Isolate agent execution with resource limits and egress controls","mechanism":"Execution isolation for AI Agent#cc24s treating them as untrusted insiders. The Agent#cc24 runs in a containerized environment (gVisor, Firecracker microVM) with: resource quotas (CPU, memory, time), network egress allowlists, filesystem restrictions, and comprehensive logging. Code generated by the Agent#cc24 is executed in this Sandbox#2be7, preventing impact on production systems even if the agent is compromised or generates malicious code. It wraps the execution Context#510a with InputGuard#0770 to sanitize ingress data and OutputGuard#eb44 to prevent exfiltration, effectively placing the Agent#cc24 in a digital quarantine.","invariants":["Network egress whitelist-only","Sandboxed process cannot access host filesystem"],"parameters":{},"hash":"sema:AgentSandbox#mh:SHA-256:871978bf94159b4fb9397407879198d38303f3b42585b5fc3ccf956f745d2904","stub":"8719","category":"Protocols","layer":"Society","signature":["Sandbox(Agent)"],"preconditions":["Resource limits defined","Untrusted code/agent"],"postconditions":["Execution completed or terminated by supervisor"],"failureModes":[],"dependencies":{"references":{"sandbox":"Sandbox#2be7","context":"Context#510a","audit":"Audit#4044","agent":"Agent#cc24"},"composes_with":{"output_guard":"OutputGuard#eb44","input_guard":"InputGuard#0770"}}},{"id":"AnalogyBridge","handle":"AnalogyBridge#87de","gloss":"Mapping to known solutions","mechanism":"To solve a novel Problem#5baa, the Agent#cc24 explicitly searches its training data for a structural analogy in a different domain (e.g., 'This architecture problem is like an ant colony'). It maps the Solution#7186 from the source domain to the target domain. It merges the structural properties of the source and target domains, identifying the isomorphic mapping.","invariants":["Attribute Independence: Object attributes (color, size) are ignored","Structure Mapping: Relations in Source must map to Relations in Target"],"parameters":{},"hash":"sema:AnalogyBridge#mh:SHA-256:87ded8aef0c68bd8e45e029997245cb5a9094c69ce732d84839ba56ac3454c52","stub":"87de","category":"Strategy","layer":"Mind","signature":[],"preconditions":["Isomorphism exists"],"postconditions":["Inference transferred"],"failureModes":[],"dependencies":{"references":{"problem":"Problem#5baa","solution":"Solution#7186","agent":"Agent#cc24"}}},{"id":"AntifragileInversion","handle":"AntifragileInversion#bf62","gloss":"Converting volatility into fuel","mechanism":"A design pattern that inverts the relationship with a stressor. If Variable#179a X causes harm, the Agent#cc24 redesigns the System#e314 such that Variable#179a X is the input fuel. It mathematically reverses the sign of the exposure Vector#c7c4. It systematically applies Reframe#ba00 to the System#e314's causal graph, identifying edges where the sign of the relationship between stress and utility can be flipped.","invariants":["Causal Inversion: The stressor is a required input, not a tolerated noise","Convexity: Gain(Shock) > Loss(Shock)"],"parameters":{},"hash":"sema:AntifragileInversion#mh:SHA-256:bf629c568b2bc34726a23d021ef0459528da2aa6084d5f011d3f1abf93b88de4","stub":"bf62","category":"Strategy","layer":"Mind","signature":[],"preconditions":["Stressor is unavoidable"],"postconditions":["System#e314 utility correlates positively with Stressor"],"failureModes":[],"dependencies":{"references":{"system":"System#e314","agent":"Agent#cc24","reframe":"Reframe#ba00","variable":"Variable#179a","vector":"Vector#c7c4"}}},{"id":"Belief","handle":"Belief#6690","gloss":"A subjective claim with confidence and evidence","mechanism":"A unit of epistemic State#4d58. Represents a claim held by an Agent#cc24 with a specific confidence score (0.0 to 1.0) and a pointer to supporting evidence. Unlike a Fact, a Belief is subjective and mutable.","invariants":[],"parameters":[{"name":"confidence","type":"Float","range":"unspecified","description":"Subjective probability that this belief is true"},{"name":"evidence","type":"List[Context]","range":"unspecified","description":"Supporting evidence contexts for this belief"}],"hash":"sema:Belief#mh:SHA-256:669092488e3b06354c76f2eaba3855e315f4ae43d4e6db3d04d8fc5d61accdbd","stub":"6690","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"state":"State#4d58","agent":"Agent#cc24"}}},{"id":"Break","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.","invariants":["No data loss during interruption","System#e314 state paused safely"],"parameters":[{"name":"break_signal","type":"Enum","range":"{Silent, Loud, Cascade}","description":"How break propagates"},{"name":"failure_threshold","type":"Integer","range":"[3, 10]","description":"Consecutive failures before breaking"},{"name":"recovery_timeout","type":"Duration","range":"[10s, 5min]","description":"Cool-off before reconnection attempt"}],"hash":"sema:Break#mh:SHA-256:9d98f2e8986f32f8eb1518bfcdead7eaadf8addde63e4625c7faa0e891f28666","stub":"9d98","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":["Interrupt signal","Running process"],"postconditions":["Process halted","Resumption point saved"],"failureModes":[],"dependencies":{"references":{"system":"System#e314","meta":"Meta#90f4","protocol":"Protocol#7e1c","message":"Message#f767","agent":"Agent#cc24"}}},{"id":"Card","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.","invariants":["Card immutable after issue."],"parameters":[{"name":"verification_tier","type":"Enum","range":"{SelfReported, Verified, Bonded}","description":"Default: SelfReported"},{"name":"proof","type":"String","range":"unspecified","description":"Optional hash of past Success artifact"}],"hash":"sema:Card#mh:SHA-256:5c33034fedd84e9d8e42887c003d5b96a694d0549292dd796c3dbcbfe76a06dd","stub":"5c33","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"composes_with":{"select":"Select#15c2"},"references":{"probe":"Probe#9f2b","agent":"Agent#cc24"}}},{"id":"Compromise","handle":"Compromise#955f","gloss":"Finding a mutual sacrifice zone via intensity reduction","mechanism":"Iterative Negotiation Protocol. Each Agent#cc24 states preferences with INTENSITY scores (0-1). The System#e314 computes DISSONANCE (Sum(Intensity_A * Intensity_B)). To reach consensus, agents must Dampen#ff89 their preference intensity until Dissonance < Threshold. Unlike Yield#7eaf (which is binary surrender), Compromise is a continuous reduction of demand.","invariants":[],"parameters":{},"hash":"sema:Compromise#mh:SHA-256:955f5b17e14c2998dda12fb21506656505eb987503cf1b2bb06acfaa06433d55","stub":"955f","category":"Economics","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"system":"System#e314","yield":"Yield#7eaf","agent":"Agent#cc24"},"composes_with":{"dampen":"Dampen#ff89"}}},{"id":"EphemeralTool","handle":"EphemeralTool#1c6b","gloss":"Agents that are never limited by their pre-installed toolbelt.","mechanism":"Just-In-Time Compilation: Agent#cc24 writes and executes custom code tools for unique problems. It dynamically generates a single-use script and executes it via ToolInvoke#cf0a before scrubbing it from memory.","invariants":["State#4d58 wiped after destruction","Tool exists only for duration of task"],"parameters":{},"hash":"sema:EphemeralTool#mh:SHA-256:1c6b7afef01dd8056cf26d516b3a1e0295b471ab1f6a7a3b7651287caf28f602","stub":"1c6b","category":"Protocols","layer":"Society","signature":[],"preconditions":["Task#d9f9 requiring specialized capability"],"postconditions":["Capability instantiated then destroyed"],"failureModes":[],"dependencies":{"references":{"task":"Task#d9f9","tool_invoke":"ToolInvoke#cf0a","sandbox":"Sandbox#2be7","state":"State#4d58","agent":"Agent#cc24"}}},{"id":"FractalAnte","handle":"FractalAnte#09f2","gloss":"Economic bounding of recursive depth","mechanism":"A recursion control protocol where invoking a sub-process (going deeper) requires the agent to lock a Compute Stake that grows exponentially with depth (D). S_d = S_base * k^D. If the sub-process solves the problem, the stake is returned with a Cognitive Yield#7eaf. If the sub-process halts, times out, or returns a null result, the stake is burned. This forces the agent to economically justify every layer of abstraction. It imposes an exponential Budget#a763 tax on recursion depth to prevent infinite regress.","invariants":["Burn on Failure: Failed recursion results in irreversible resource loss","Exponential Cost: Cost(Depth+1) >= Cost(Depth) * Factor"],"parameters":[{"name":"base_stake","type":"Float","range":"[>0]","description":"Initial stake at depth 0"},{"name":"growth_factor","type":"Float","range":"[1.5, 3.0]","description":"Multiplier per depth level"}],"hash":"sema:FractalAnte#mh:SHA-256:09f2e802b9d4b418dfcb03e465596f360f34924bb849a2fc499e7e6646a4df35","stub":"09f2","category":"Economics","layer":"Society","signature":[],"preconditions":["Agent#cc24 has a divisible resource (Tokens/Compute)","Recursion capability"],"postconditions":["Recursion depth bounded by economic constraints"],"failureModes":[],"dependencies":{"references":{"budget":"Budget#a763","yield":"Yield#7eaf","agent":"Agent#cc24"}}},{"id":"Greet","handle":"Greet#1bad","gloss":"Agent connection initiation","mechanism":"The initial contact protocol between two Agent#cc24s. It involves a cryptographic Identity#626c verification followed by a CompatibilityCheck#3abb to establish a shared communication channel. If successful, it transitions the connection state from 'Unknown' to 'Connected'.","invariants":["Mutual Auth: Both parties must verify each other.","No-Op on Mismatch: Connection drops if handshake fails."],"parameters":{},"hash":"sema:Greet#mh:SHA-256:1bad380cdf48247bbb7ab68e6dcb95eeb6b6ba7535095d64b86c49bab5c4e173","stub":"1bad","category":"Primitives","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"agent":"Agent#cc24","identity":"Identity#626c"},"composes_with":{"compatibility_check":"CompatibilityCheck#3abb"}}},{"id":"Ledger","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.","invariants":["Immutability: Past entries cannot be modified.","Append-Only: New transactions are added to the end."],"parameters":{},"hash":"sema:Ledger#mh:SHA-256:2449b13ec018b29f7301a798a92077d5f6983991b38886c19f1aa27c3ac533e5","stub":"2449","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"agent":"Agent#cc24","value":"Value#3c5d"}}},{"id":"Mode","handle":"Mode#b995","gloss":"A discrete configuration of agency","mechanism":"A primitive representing a distinct 'Stance' or 'Configuration of Agency'. Unlike State#4d58 (which changes frequently), a Mode is a stable set of constraints and priors that governs how an agent processes information (e.g., Exploration Mode vs. Exploitation Mode).","invariants":["Stability: A Mode persists until an explicit Transition#072d event.","Exclusivity: Agent#cc24 cannot be in two conflicting Modes simultaneously (unless explicitly designed as Hybrid)."],"parameters":{},"hash":"sema:Mode#mh:SHA-256:b9957477ff6bb4d7d3b55db6c51ba74e6900cfe0cfd4af4caaf180286242c772","stub":"b995","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"transition":"Transition#072d","state":"State#4d58","agent":"Agent#cc24"}}},{"id":"ModestClaim","handle":"ModestClaim#a257","gloss":"Defensible over ambitious","mechanism":"Epistemic Reframe#ba00. Transforms assertions of 'Identity#626c' (A == B means same meaning) into assertions of 'Divergence' (Hash(A) != Hash(B) means different meaning). This shifts the burden of proof from verifying universal truth to detecting local mismatch. It applies EpistemicCalibrate#6069 to reduce the scope of assertions from 'Universal Truth' to 'Local Observation'.","invariants":["Epistemic Priority: Claims must describe 'Evidence of Divergence', not 'Proof of Meaning'.","Pragmatic Grounding: The measure of success is Coordination Utility, not Semantic Truth."],"parameters":{},"hash":"sema:ModestClaim#mh:SHA-256:a257e1318e9ba89e290893692bb9745712457fdbfa45bb99f4e58e00349c6277","stub":"a257","category":"Protocols","layer":"Society","signature":[],"preconditions":["System#e314 or Agent#cc24 formulating a capability claim"],"postconditions":["Claim scope reduced to defensible limits (Epistemic/Utility)"],"failureModes":[],"dependencies":{"references":{"problem":"Problem#5baa","system":"System#e314","reframe":"Reframe#ba00","identity":"Identity#626c","epistemic_calibrate":"EpistemicCalibrate#6069","agent":"Agent#cc24"}}},{"id":"NegativeProof","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.","invariants":["Absence of evidence is evidence of absence (under exhaustive search)","Search space fully covered"],"parameters":{},"hash":"sema:NegativeProof#mh:SHA-256:40a6b9b7cc8a3e63dd2433bdcfe0090eee52016e2eb9d58238474f1e4347d30d","stub":"40a6","category":"Primitives","layer":"Infrastructure","signature":[],"preconditions":["Closed world assumption","Hypothesis#e95b H"],"postconditions":["H proved false"],"failureModes":[],"dependencies":{"references":{"agent":"Agent#cc24","hypothesis":"Hypothesis#e95b","value":"Value#3c5d"}}},{"id":"OntologyAdapt","handle":"OntologyAdapt#0c1d","gloss":"Restructuring categories to fit data","mechanism":"Derived from Piagetian psychology. When new data defies classification within the current ontology, the Agent#cc24 does not force-fit it or discard it. Instead, it triggers a 'Restructure' event, creating new root Category#1ab7s that accommodate the Anomaly#7987 as a fundamental feature. Utilizes OntologyHandshake#ead0.","invariants":["Conservation of Data: No anomaly is discarded during accommodation","Fit Threshold: If ClassificationConfidence < 0.4, Trigger(Restructure)"],"parameters":{},"hash":"sema:OntologyAdapt#mh:SHA-256:0c1da559ddd0df6165d8e057020960ab65f8974a03d8b24dc9d194e45ed29d7f","stub":"0c1d","category":"Inference","layer":"Mind","signature":[],"preconditions":["Data validated as true but unclassifiable"],"postconditions":["Data fits naturally in new structure"],"failureModes":[],"dependencies":{"references":{"ontology_handshake":"OntologyHandshake#ead0","category":"Category#1ab7","noise":"Noise#c4b4","anomaly":"Anomaly#7987","agent":"Agent#cc24"}}},{"id":"Permission","handle":"Permission#f583","gloss":"Authorization grant","mechanism":"An authorization grant allowing an Agent#cc24 to perform a specific Act#5d55 or access a Artifact#6254. The atomic unit of access control.","invariants":[],"parameters":{},"hash":"sema:Permission#mh:SHA-256:f5838c2aa8a10fbf23b5ae4fee6c184698dffadca0eaeef6e4af07cb5c8b92c7","stub":"f583","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"act":"Act#5d55","artifact":"Artifact#6254","agent":"Agent#cc24"}}},{"id":"Proprioception","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.","invariants":["Context#510a Continuity: Agent#cc24 knows its parent Task#d9f9 ID","Liveness: Parent.status == ACTIVE","State#4d58 Recovery: Can reconstruct stack Trace#9057 from logs"],"parameters":[{"name":"max_recursion_depth","type":"Int","range":"unspecified","description":"Default: 10"},{"name":"stagnation_threshold","type":"Int","range":"[1, 100]","description":"Ticks before abort"}],"hash":"sema:Proprioception#mh:SHA-256:c9bb0e902eb672f0ac84066a1870c010b74cc68fbffc4bc2d3c841b1dbd2c56c","stub":"c9bb","category":"Protocols","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"task":"Task#d9f9","trace":"Trace#9057","state":"State#4d58","somatic_marker":"SomaticMarker#84e4","context":"Context#510a","agent":"Agent#cc24"}}},{"id":"ReAct","handle":"ReAct#db09","gloss":"Interleaved thought-action-observation cycle","mechanism":"An interleaved reasoning-action loop where the agent cycles through Thought (reason about the situation), Action (invoke a tool or take a step), and Observation (process the result). Unlike pure Chain#5711-of-Thought which reasons then answers, ReAct interleaves reasoning with environmental feedback, allowing the agent to adjust plans based on real-world results. It interleaves reasoning traces for a Task#d9f9 with ToolInvoke#cf0a execution, updating the context with observation results.","invariants":["Action based on reasoning","Cycle of Thought-Action-Observation"],"parameters":{},"hash":"sema:ReAct#mh:SHA-256:db09f71ac22f6917fb5b7dc3fbc14409a057f20b30243cd262150f29d73a4298","stub":"db09","category":"Reasoning","layer":"Mind","signature":[],"preconditions":["Environment access","Goal"],"postconditions":["Goal reached or deemed impossible"],"failureModes":[],"dependencies":{"references":{"agent":"Agent#cc24","chain":"Chain#5711","loop":"Loop#fb2e","cognitive_bias":"CognitiveBias#4b32"},"composes_with":{"tool_invoke":"ToolInvoke#cf0a"},"accepts":{"task":"Task#d9f9"}}},{"id":"SignalReflection","handle":"SignalReflection#0b8c","gloss":"Proof of receipt via modification","mechanism":"To prove a Message#f767 was received, the receiver must 'reflect' it back with a specific, computationally non-trivial transformation (not just a hash). This proves active processing power was available and the Agent#cc24 is 'live'. It requires the receiver to echo the Message#f767 modulated by SpectralTune#6c65 logic to prove active processing.","invariants":["Reflected signal matches origin","Source authenticated"],"parameters":{},"hash":"sema:SignalReflection#mh:SHA-256:0b8c5e666668635b64ecebab88c01900ac49a24b00aa97b8d03443a90b492ef5","stub":"0b8c","category":"Protocols","layer":"Society","signature":[],"preconditions":["Incoming Message#f767"],"postconditions":["Acknowledgement sent"],"failureModes":[],"dependencies":{"references":{"spectral_tune":"SpectralTune#6c65","agent":"Agent#cc24","message":"Message#f767"}}},{"id":"StateLock","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.","invariants":[],"parameters":{},"hash":"sema:StateLock#mh:SHA-256:7859031251f8c96389630416840c243d7b1bbd6c2c06e82e0468f0915aae936c","stub":"7859","category":"Time","layer":"Physics","signature":["Lock(State)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"backoff":"Backoff#315a","state":"State#4d58","lock":"Lock#5bf2","cooldown":"Cooldown#0cde","agent":"Agent#cc24"}}},{"id":"StrategicReading","handle":"StrategicReading#16f6","gloss":"Navigate like a researcher, not linearly","mechanism":"Non-linear Information Retrieval Heuristic. Agent#cc24 treats documents as random-access databases rather than linear streams. It builds a structural map first (Tree#ddce), identifies high-entropy sections (Abstract/Conclusion), and selectively loads only the relevant chunks. Utilizes ComputeBudget#3b98.","invariants":["Budget Awareness: Read volume must be < 10% of total document size unless DeepRead approved.","Structure First: Must execute `doc_get_tree` or `outline` before reading body content."],"parameters":[{"name":"scan_depth","type":"Integer","range":"[1, 10]","description":"Pages/sections to scan before deciding relevance"},{"name":"strategy","type":"Enum","range":"{Survey, DeepDive, Needle}","description":"Default: Survey"}],"hash":"sema:StrategicReading#mh:SHA-256:16f60fba4c06d588034475f218c0dc54519848ae1e13dd8efff7145c9e248db1","stub":"16f6","category":"Reasoning","layer":"Mind","signature":[],"preconditions":["Large document identified","Specific information goal defined"],"postconditions":["Relevant sections extracted","Remainder of document remains unloaded"],"failureModes":[],"dependencies":{"references":{"compute_budget":"ComputeBudget#3b98","cognitive_bias":"CognitiveBias#4b32","context":"Context#510a","agent":"Agent#cc24","tree":"Tree#ddce"}}},{"id":"TaskLifecycle","handle":"TaskLifecycle#d346","gloss":"Formal state machine governing task progression","mechanism":"Explicit StateTransition#3737 machine governing Task#d9f9 progression through five states: PENDING (created, awaiting assignment), ASSIGNED (claimed by an Agent#cc24), RUNNING (actively executing, emitting Heartbeat#4ddc), COMPLETED (successfully finished, Result#8ed9 attached), FAILED (terminated with Exception#bcdc, retry decision required). Each transition requires a typed Event#7e71: assign, start, complete, fail, cancel. Invalid transitions are rejected. RUNNING state requires periodic Heartbeat#4ddc; timeout triggers automatic FAILED transition. Follows the Agent-to-Agent protocol task management model.","invariants":["Forward-Only: Tasks must not regress (no COMPLETED to RUNNING via StateTransition#3737)","Single Owner: Exactly one Agent#cc24 owns a Task#d9f9 in ASSIGNED or RUNNING state","FAILED tasks must include an Exception#bcdc describing the failure","RUNNING tasks must emit Heartbeat#4ddc within configured interval"],"parameters":[{"name":"heartbeat_interval_seconds","type":"Integer","range":"[5, 300]","description":"Maximum seconds between heartbeats before RUNNING task is marked FAILED"}],"hash":"sema:TaskLifecycle#mh:SHA-256:d34694951f32cbd9f4e9a2f68d914589921e6f7fbbc6a1600ace85113d5012f5","stub":"d346","category":"Primitives","layer":"Infrastructure","signature":["StateTransition(Task)"],"preconditions":["Task#d9f9 exists in PENDING state"],"postconditions":["Task#d9f9 in terminal state (COMPLETED, FAILED, or CANCELLED)"],"failureModes":[],"dependencies":{"references":{"task":"Task#d9f9","heartbeat":"Heartbeat#4ddc","exception":"Exception#bcdc","event":"Event#7e71","agent":"Agent#cc24"},"composes_with":{"state_transition":"StateTransition#3737"},"yields":{"result":"Result#8ed9"}}},{"id":"TieredAccess","handle":"TieredAccess#6d26","gloss":"Cost-distance indexing","mechanism":"Central 'massive' agents (high authority) create a gravity well. The cost to interact with an agent increases the closer you get to the center. This naturally filters low-value queries to the periphery and reserves core attention for high-value interactions. Utilizes BearerToken#2fe9.","invariants":["Cost Monotonicity: Cost(Distance D-1) > Cost(Distance D) - closer to center means higher cost","Metric Definition: Distance must be computed via agreed metric (hops, latency, trust score)"],"parameters":[{"name":"cost_function","type":"Enum","range":"{Linear, Exponential, Step}","description":"How cost scales with proximity"},{"name":"distance_metric","type":"Enum","range":"{Hops, Latency, TrustScore}","description":"How to measure distance"}],"hash":"sema:TieredAccess#mh:SHA-256:6d26d30e575e16702798357b98281805a4a67885203caac3c7876ab7507239ad","stub":"6d26","category":"Protocols","layer":"Society","signature":[],"preconditions":["Agent#cc24 has valid Identity#626c"],"postconditions":["Access log updated"],"failureModes":[],"dependencies":{"composes_with":{"bearer_token":"BearerToken#2fe9"},"references":{"agent":"Agent#cc24","identity":"Identity#626c"}}},{"id":"Outcome","handle":"Outcome#38e0","gloss":"Actual result","mechanism":"The actual result that occurs in reality. It may differ from the Plan#64f2 due to external factors, noise, or execution error.","invariants":[],"parameters":{},"hash":"sema:Outcome#mh:SHA-256:38e079f2323ce9cf3d1022624f693bbb02b3e0e25d7eb42abc4d06c75548b53a","stub":"38e0","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"plan":"Plan#64f2"}}},{"id":"Roadmap","handle":"Roadmap#0018","gloss":"Strategic plan over time","mechanism":"A strategic Plan#64f2 defined over a temporal dimension. Unlike a linear Plan#64f2 which details a single execution path, a Roadmap outlines key Goal#456as (milestones) and direction over time, often allowing for flexibility in the specific steps between milestones.","invariants":[],"parameters":{},"hash":"sema:Roadmap#mh:SHA-256:0018ef2b157d795566b45e40f8a760ec90ac0d0b00d4ffd272556df824880b7c","stub":"0018","category":"Strategy","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"plan":"Plan#64f2","goal":"Goal#456a"}}},{"id":"Spec","handle":"Spec#436e","gloss":"Rigorous requirement definition","mechanism":"A rigorous definition of requirements for an Artifact#6254. It defines the shape, behavior, and Constraint#87fes that a target must satisfy. Distinct from Plan#64f2 (how to build) or Goal#456a (what to achieve), a Spec is the 'Definition of Done'.","invariants":["Verifiability: Every requirement must be testable (binary pass/fail).","Immutability: Once defined, the Spec acts as a fixed contract."],"parameters":{},"hash":"sema:Spec#mh:SHA-256:436efd7df8ed376f693362923a024b4096265b9de32c7a980297b078112c75b5","stub":"436e","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"artifact":"Artifact#6254","constraint":"Constraint#87fe","plan":"Plan#64f2","goal":"Goal#456a"}}},{"id":"Strategy","handle":"Strategy#47a4","gloss":"Adaptive high-level planning","mechanism":"A high-level plan to achieve one or more goals under conditions of uncertainty. Unlike a fixed Plan#64f2, a Strategy is adaptive and focuses on 'How to win' rather than just 'What steps to take'.","invariants":[],"parameters":{},"hash":"sema:Strategy#mh:SHA-256:47a4c030647570c7e911543e9d0feaa3d8f0917b6e20371e93c37fb5e85fb7d4","stub":"47a4","category":"Strategy","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"plan":"Plan#64f2"}}},{"id":"AnalogicalMask","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.","invariants":["Cover Coherence: The output text must be semantically valid in the Cover Domain","Structural Isomorphism: Relations in Payload must map 1:1 to Relations in Cover"],"parameters":{},"hash":"sema:AnalogicalMask#mh:SHA-256:852a1f8e0a69d2d6ac061711f8741140ab2e8754a1a912e82d01b321acd6d99e","stub":"852a","category":"Strategy","layer":"Mind","signature":[],"preconditions":["Shared Bridge Key (Mapping Dictionary) established"],"postconditions":["Message#f767 passes semantic firewalls"],"failureModes":[],"dependencies":{"references":{"ontology_handshake":"OntologyHandshake#ead0","analogy_bridge":"AnalogyBridge#87de","message":"Message#f767"}}},{"id":"Generalize","handle":"Generalize#9313","gloss":"Inductive pattern extraction","mechanism":"Pattern Extraction: Given multiple instances, identify shared structure. Replace specific values with variables. State#4d58 the invariant that holds across all instances. Test: does pattern predict behavior of new instances? Refine until predictive. It employs AnalogyBridge#87de to map specific instances to abstract schemata, validating the invariant across the set.","invariants":["Abstract rule covers all specific examples","Information loss minimized"],"parameters":{},"hash":"sema:Generalize#mh:SHA-256:931391f2fdaca5c5eaa2afc80b25a36c0c186db71fb2b56944da537c028d0a1a","stub":"9313","category":"Reasoning","layer":"Mind","signature":[],"preconditions":["Set of specific instances"],"postconditions":["General principle extracted"],"failureModes":[],"dependencies":{"references":{"state":"State#4d58","analogy_bridge":"AnalogyBridge#87de"}}},{"id":"BayesUpdate","handle":"BayesUpdate#5d91","gloss":"Mathematically rigorous belief revision","mechanism":"Likelihood Weighting: Hold prior probability P(H). Observe#8ebd evidence E. Compute likelihood ratio P(E|H)/P(E|¬H). Multiply prior by ratio to get posterior. Large ratio = strong update. Ratio near 1 = weak evidence. Never update to 0 or 1. It explicitly incorporates BaseRateInclude#aa0b into the prior probability calculation to prevent base-rate neglect.","invariants":["Posterior ∈ (0,1): never update to absolute certainty."],"parameters":[{"name":"prior_confidence","type":"Probability","range":"[0.1, 0.9]","description":"Certainty in prior belief before evidence"},{"name":"update_threshold","type":"Probability","range":"[0.6, 0.95]","description":"Minimum confidence shift to trigger action"}],"hash":"sema:BayesUpdate#mh:SHA-256:5d91a91754e49d7a83db87d87a7f8920ab4ac5ca17ca47d14954a65278534ce0","stub":"5d91","category":"Inference","layer":"Mind","signature":[],"preconditions":["Prior probability defined in (0,1). New evidence observed. Likelihood computable."],"postconditions":["Posterior probability in (0,1). Belief#6690 updated proportional to evidence strength. Prior recoverable given likelihood."],"failureModes":[],"dependencies":{"references":{"belief":"Belief#6690","observe":"Observe#8ebd","base_rate_include":"BaseRateInclude#aa0b"}}},{"id":"SteelmanCheck","handle":"SteelmanCheck#75a0","gloss":"Mandatory counter-argument generation","mechanism":"Before finalizing a Decision#acfb or output, the Agent#cc24 MUST generate the strongest possible argument against its own conclusion. It performs a Check#1544 on the Robustness#132c of the claim and a Critique#3e00 of the underlying Belief#6690. If the counter-argument exceeds a validity threshold, the decision is discarded or revised. It prevents confirmation CognitiveBias#4b32. Utilizes CompatibilityCheck#3abb. For adversarial contexts, see adversarial steelmanning.","invariants":["Counter-Argument Quality: Score(Counter) > 0.7 (Must be non-trivial)","Passing critique required for release.","Strongest Counter: Generated argument must address the core claim, not weak points","Topical Relevance: EmbeddingDistance(Counter, Claim) < Threshold"],"parameters":[{"name":"iteration_limit","type":"Integer","range":"[1, 5]","description":"Max strengthening attempts"},{"name":"strength_threshold","type":"Float","range":"[0.7, 0.95]","description":"Min strength to pass as steelman"}],"hash":"sema:SteelmanCheck#mh:SHA-256:75a0f70d58f79e59b6641c633e70f4b6e5ff0483cf9a8fcb658257e20dea41d4","stub":"75a0","category":"Reasoning","layer":"Mind","signature":["Check(Robustness)","Critique(Belief)"],"preconditions":["Agent#cc24 must be alignment-seeking; use adversarial steelmanning for adversarial/untrusted contexts","Claim is falsifiable"],"postconditions":["Critique#3e00 generated and scored"],"failureModes":[],"dependencies":{"references":{"agent":"Agent#cc24","belief":"Belief#6690","check":"Check#1544","loop":"Loop#fb2e","robustness":"Robustness#132c","compatibility_check":"CompatibilityCheck#3abb","critique":"Critique#3e00","decision":"Decision#acfb","cognitive_bias":"CognitiveBias#4b32"}}},{"id":"Jester","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.","invariants":[],"parameters":{},"hash":"sema:Jester#mh:SHA-256:02f3eb22ed6316fdd9de3b8e52281841521995653808b062305b54711cc17609","stub":"02f3","category":"Strategy","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"incongruity":"Incongruity#e98f","break":"Break#9d98","critique":"Critique#3e00"}}},{"id":"AgentDiscover","handle":"AgentDiscover#0892","gloss":"Advertise capabilities and discover collaborating agents","mechanism":"Macro for Discover#afa1(Agent#cc24). A protocol for agents to advertise their capabilities and discover other agents dynamically. Each agent publishes a capability Card#5c33 describing what it can do, its input/output schemas, and trust requirements. Agents query a registry (or broadcast) to find collaborators for subtasks. Enables dynamic multi-agent composition without hardcoded agent references. It instantiates the abstract Discover#afa1 primitive on the Agent#cc24 type, specifically querying capability registries rather than passive data stores.","invariants":["Discovery protocol must be public/standard","No sensitive state leaked during handshake"],"parameters":{},"hash":"sema:AgentDiscover#mh:SHA-256:08920989b13a4fd114a61ed4ec1753b37262152091e0fa8f56451822ce69a3ea","stub":"0892","category":"Protocols","layer":"Society","signature":["Discover(Agent)"],"preconditions":["Broadcast capability","Listener on known channel"],"postconditions":["Agent#cc24 ID and capabilities exchanged"],"failureModes":[],"dependencies":{"references":{"card":"Card#5c33","discover":"Discover#afa1","agent":"Agent#cc24"}}},{"id":"ToolDiscovery","handle":"ToolDiscovery#b509","gloss":"Discover and invoke external tools via structured capability manifests","mechanism":"Agent#cc24 queries a Discover#afa1 for capabilities matching its current Task#d9f9. Registry returns a Card#5c33 listing available tools with typed input/output schemas. Agent#cc24 selects the best match, performs a CompatibilityCheck#3abb to verify schema alignment, then invokes via ToolInvoke#cf0a and observes the typed Result#8ed9. If no match is found or CompatibilityCheck#3abb fails, the agent must FailClosed#ae79 rather than attempt a best-effort invocation. Follows the Model Context Protocol pattern of progressive discovery: orient via registry, explore via schema matching, verify via hash comparison.","invariants":["Schema Verification: Tool manifest hash must be verified via CompatibilityCheck#3abb before invocation","Fail-Closed: On schema mismatch or missing tool, reject via FailClosed#ae79 rather than attempt best-effort","Tool output must conform to declared schema in the Card#5c33"],"parameters":{},"hash":"sema:ToolDiscovery#mh:SHA-256:b50940f28b3e2571c9d2a24fa391766d2fa3b06a6f99ff7f1b134ab99df756b6","stub":"b509","category":"Protocols","layer":"Society","signature":["Discover(ToolInvoke)"],"preconditions":["Discover#afa1 accessible","Task#d9f9 specifies required capability type"],"postconditions":["Result#8ed9 returned conforming to tool's declared output schema","Invocation logged with tool identity and schema hash"],"failureModes":[],"dependencies":{"references":{"task":"Task#d9f9","discover":"Discover#afa1","card":"Card#5c33","agent":"Agent#cc24"},"composes_with":{"compatibility_check":"CompatibilityCheck#3abb","tool_invoke":"ToolInvoke#cf0a","fail_closed":"FailClosed#ae79"},"yields":{"result":"Result#8ed9"}}},{"id":"ExplainBeacon","handle":"ExplainBeacon#34b3","gloss":"Real-time readable intent broadcasting","mechanism":"Telemetry Stream#22f3. Emits a human-readable narrative ('I am doing X because Y') alongside the machine-readable log. Must be emitted before irreversible actions. It piggybacks on the Greet#1bad or Heartbeat#4ddc channel to broadcast intent logs to observers.","invariants":["Beacon cannot be suppressed."],"parameters":{},"hash":"sema:ExplainBeacon#mh:SHA-256:34b3877136d89c6bcdfbfb20cfd27d11484fd2f51bb70a68a36c7976fbfc4b6a","stub":"34b3","category":"Verification","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"greet":"Greet#1bad","heartbeat":"Heartbeat#4ddc","stream":"Stream#22f3","agent":"Agent#cc24"}}},{"id":"Warmup","handle":"Warmup#fc59","gloss":"Gradual capacity increase to stabilize cold systems","mechanism":"Gradual Capacity Ramp: On activation, start at reduced capacity C_min and increase to C_max over time T following a defined curve. Prevents 'thundering herd' overload on cold systems. Utilizes Greet#1bad, Throttle#3b43.","invariants":["Capacity Limit: Accepted_Load <= Current_Warmup_Cap(t)"],"parameters":[{"name":"curve","type":"Enum","range":"{Linear, Exponential, Step}","description":"Default: Linear"},{"name":"initial_capacity","type":"Float","range":"[0.0, 1.0]","description":"Starting capacity as fraction of full (0 = cold start)"},{"name":"ramp_duration","type":"Duration","range":"[10s, 1h]","description":"Time to reach full capacity from initial"}],"hash":"sema:Warmup#mh:SHA-256:fc59e3c519412f120d1071e6d2176532bef3d628effeac6906c2067be037a603","stub":"fc59","category":"Protocols","layer":"Society","signature":[],"preconditions":["System#e314 state is inactive or reset"],"postconditions":["Capacity limit equals C_max","System#e314 state is active"],"failureModes":[],"dependencies":{"references":{"greet":"Greet#1bad","throttle":"Throttle#3b43","system":"System#e314"}}},{"id":"AuditTrail","handle":"AuditTrail#d051","gloss":"Immutable append-only log of agent actions for compliance and debugging","mechanism":"Every consequential Agent#cc24 action (state mutation, external call, delegation, decision) appends a Sign#1fb9ed entry to an immutable Ledger#2449. Each entry contains: timestamp, Agent#cc24 Identity#626c, action type, input hash, output hash, and the sema pattern invoked. Extends Trace#9057 from single-entity lineage to cross-agent compliance logging. The trail is append-only — entries cannot be modified or deleted. For cross-agent auditing, individual trails are aggregated via Merkle roots into a shared Snapshot#0ae9, enabling any party to verify the complete history without accessing raw entries.","invariants":["Append-Only: No entry in the Ledger#2449 may be modified after creation","Every entry must be Sign#1fb9ed by the acting Agent#cc24","Trace#9057 provenance must link each entry to the sema pattern that triggered it"],"parameters":{},"hash":"sema:AuditTrail#mh:SHA-256:d051159cb1451a35bd695ae6b3e89c75ffe6b2f8180d9244e3c644f573a45d55","stub":"d051","category":"Verification","layer":"Infrastructure","signature":["Trace(Ledger)"],"preconditions":["Agent#cc24 has established Identity#626c","Ledger#2449 is accessible and writable"],"postconditions":["Action recorded with full provenance in Ledger#2449","Snapshot#0ae9 of trail Merkle root available for external verification"],"failureModes":[],"dependencies":{"composes_with":{"snapshot":"Snapshot#0ae9"},"references":{"trace":"Trace#9057","sign":"Sign#1fb9","ledger":"Ledger#2449","identity":"Identity#626c","audit":"Audit#4044","agent":"Agent#cc24"}}},{"id":"Aggregate","handle":"Aggregate#0291","gloss":"Reduce a set to a summary statistic","mechanism":"Mathematical Reduction. A deterministic function that maps a Vector#c7c4 of inputs to a single Scalar Value#3c5d. Implements standard statistical operations (Mean, Mode, Median) to compress signal bandwidth. It serves as the computational backbone for consensus mechanisms.","invariants":["Determinism: F(Input) always yields the same Output.","Reduction: Size(Output) < Size(Input)."],"parameters":[{"name":"function","type":"Enum","range":"{Mean, Median, Mode, Sum, Min, Max, Variance, StdDev}","description":"Default: Mean"},{"name":"weights","type":"List<Float>","range":"unspecified","description":"Relative importance weights for each input element"}],"hash":"sema:Aggregate#mh:SHA-256:0291d4b5d7a05545a7561cc9bd6662ded7c160d9a7b199731e28dff50afd080f","stub":"0291","category":"Primitives","layer":"Infrastructure","signature":[],"preconditions":["All elements in list share a comparable type","Input list is non-empty"],"postconditions":["Single summary value returned"],"failureModes":[],"dependencies":{"yields":{"value":"Value#3c5d"},"references":{"mode":"Mode#b995"},"accepts":{"vector":"Vector#c7c4"}}},{"id":"Canary","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.","invariants":["Canary fails before main system","Failure signal is unambiguous"],"parameters":{},"hash":"sema:Canary#mh:SHA-256:3902d7a28c1cb53efb8fc7a6bce1735c4f0dbe3c524f2945a709bb45352a7ef6","stub":"3902","category":"Protocols","layer":"Society","signature":[],"preconditions":["Monitoring system active","Representative test case"],"postconditions":["Health status confirmed or alert triggered"],"failureModes":[],"dependencies":{"references":{"greet":"Greet#1bad","mode":"Mode#b995","work":"Work#aaad","probe":"Probe#9f2b","agent":"Agent#cc24"}}},{"id":"IdentityHandshake","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.","invariants":[],"parameters":{},"hash":"sema:IdentityHandshake#mh:SHA-256:7a20ef5a5e26b921795d01365b68115c87d9a88bae3096f7cc7a801b0c005fc5","stub":"7a20","category":"Protocols","layer":"Society","signature":["Discover(Identity)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"spectral_tune":"SpectralTune#6c65","mode":"Mode#b995","ontology_handshake":"OntologyHandshake#ead0","nature":"Nature#6c1a","check":"Check#1544","discover":"Discover#afa1","identity":"Identity#626c"}}},{"id":"Switch","handle":"Switch#70bf","gloss":"Contextual toggle","mechanism":"Changing the active Mode#b995, Context#510a, or flow path.","invariants":[],"parameters":{},"hash":"sema:Switch#mh:SHA-256:70bf716e37b356e0da9e2d0d61e6708bdc56999b69cc12895546f2b350add433","stub":"70bf","category":"Primitives","layer":"Physics","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"mode":"Mode#b995","context":"Context#510a"}}},{"id":"UptakeAsGround","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.","invariants":["Validation: Successful Task#d9f9 completion is the only proof of shared meaning.","Wittgenstein's Razor: Meaning is Use. No Use = No Meaning."],"parameters":{},"hash":"sema:UptakeAsGround#mh:SHA-256:bf85a9c0007f86f2da7894e9d641b420a58bd189236ac8bbd907d349b08abf73","stub":"bf85","category":"Protocols","layer":"Society","signature":[],"preconditions":["Pattern minted","Usage telemetry available"],"postconditions":["Semantic mass updated based on coordination outcome"],"failureModes":[],"dependencies":{"references":{"task":"Task#d9f9","modest_claim":"ModestClaim#a257"}}},{"id":"IdentityMask","handle":"IdentityMask#f9a7","gloss":"Disposable personas for privacy","mechanism":"Agents generate a new cryptographic identity (keypair) for every single interaction or session. These identities are mathematically linked to a root identity via Zero-Knowledge proofs, allowing reputation to accrue without linking activities publicly. It allows for reputation without correlation, using NegativeProof#40a6 to validate membership and CryptoShred#e0b9 to unlink the session key.","invariants":["Sybil Resistance: One mask per physical staked entity","Unlinkability: NewID cannot be correlated to OldID"],"parameters":{},"hash":"sema:IdentityMask#mh:SHA-256:f9a7dad03253207e14124a8cba4c80fa5fec7195b26dd12573bf7af2db020279","stub":"f9a7","category":"Protocols","layer":"Society","signature":[],"preconditions":["Zero-Knowledge Mixer available"],"postconditions":["New identity active"],"failureModes":[],"dependencies":{"references":{"negative_proof":"NegativeProof#40a6","crypto_shred":"CryptoShred#e0b9"}}},{"id":"PromiseGraph","handle":"PromiseGraph#972a","gloss":"Recursive trust dependencies modeled as a DAG","mechanism":"Agents do not trust each other directly; they trust a graph of promises. Agent#cc24 A accepts a promise from Agent#cc24 B only if B provides a dependency graph of sub-promises it relies on. A verifies the leaves of the graph or checks B's 'credit score' for fulfilling similar graph structures. It maintains a DAG of trust, validating leaf nodes via SpotAudit#6673 and ensuring acyclic dependencies via NegativeProof#40a6 logic.","invariants":["Acyclic: Promise dependencies cannot form a loop","Cycles forbidden.","Leaf Verification: All leaf promises must be anchored in verified truth"],"parameters":{},"hash":"sema:PromiseGraph#mh:SHA-256:972a66dbaf3511ccfb1b4b3af8f716ff568231799289843a47e50be4bfa508b8","stub":"972a","category":"Protocols","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"negative_proof":"NegativeProof#40a6","spot_audit":"SpotAudit#6673","agent":"Agent#cc24"}}},{"id":"ConfusedDeputy","handle":"ConfusedDeputy#c62c","gloss":"A privileged agent tricked into exercising its authority on behalf of a less-privileged caller","mechanism":"An Agent#cc24 that holds Permission#f583 on behalf of one principal is tricked by a less-privileged caller into exercising that authority for the caller's benefit. The classic 1988 Hardy framing: a privileged compiler asked to write debug output to a billing file ends up corrupting the billing file because access was checked against the compiler's identity, not the requesting user's. In LLM systems the same shape appears as prompt injection: an Actor#6926 with tool access is induced by adversarial input to invoke its tools on the attacker's behalf, because permission was bound to the agent process, not to the upstream request that motivated each tool call.","invariants":["Authority must be checked against the upstream requester's identity, not against the running process's identity.","Forwarded calls must carry, or re-derive, the authority of the original caller — never the deputy's."],"parameters":{},"hash":"sema:ConfusedDeputy#mh:SHA-256:c62c51a6821fb91dda537d42aada698d8642891c635bab77c402a8263012195f","stub":"c62c","category":"Protocols","layer":"Society","signature":[],"preconditions":["An Agent#cc24 holds Permission#f583 broader than at least one of its callers.","An untrusted input path can influence which action the agent takes with that permission."],"postconditions":["Either the action is authorized against the caller's identity, or the action is refused.","An audit trail records both the deputy and the requesting caller, not just the deputy."],"failureModes":[],"dependencies":{"references":{"actor":"Actor#6926","permission":"Permission#f583","agent":"Agent#cc24"}}},{"id":"EventReact","handle":"EventReact#3d57","gloss":"Responding to external triggers rather than polling","mechanism":"Event-Driven Response: Agent#cc24 subscribes to event types. Events queued by priority. Handler invoked per event. Handler execution atomic. Unhandled events logged or escalated. It implements the reactive loop, often triggering a ReAct#db09 cycle upon signal reception.","invariants":["Handler matches event type","Response latency < Max_Latency"],"parameters":{},"hash":"sema:EventReact#mh:SHA-256:3d575fade90e8e6ac984234cdcabeebb0972b38600e30b3b2cb8814d9784dd0e","stub":"3d57","category":"Strategy","layer":"Mind","signature":[],"preconditions":["Event listener active","Trigger event occurs"],"postconditions":["Handler executed"],"failureModes":[],"dependencies":{"references":{"re_act":"ReAct#db09","agent":"Agent#cc24"}}},{"id":"CausalBarrier","handle":"CausalBarrier#3a88","gloss":"Enforcing strict event ordering","mechanism":"A middleware layer that buffers incoming messages and releases them to the agent ONLY when all their causal dependencies are met. Guarantees the agent never sees an 'impossible' state. It maintains a StateLock#7859 on the event processing queue, releasing it only when all causal predecessors have been observed.","invariants":["Causal Ordering: Event E cannot be processed until all Dependencies(E) are processed","Events before barrier cannot affect events after.","No Impossible States: Agent#cc24 state never violates causal consistency"],"parameters":[{"name":"on_violation","type":"Enum","range":"{Block, Warn, Reorder}","description":"Response to causality breach"},{"name":"party_count","type":"Integer","range":"[2, 100]","description":"Required causal predecessors"},{"name":"timeout","type":"Duration","range":"[1s, 1h]","description":"Max wait for causal completion"}],"hash":"sema:CausalBarrier#mh:SHA-256:3a88cbbac626b0bc83041ba93652a0bcb1ac654159698ea138352795bc4ffb38","stub":"3a88","category":"Time","layer":"Physics","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"state_lock":"StateLock#7859","agent":"Agent#cc24"}}},{"id":"ContinuousResourceAuction","handle":"ContinuousResourceAuction#5776","gloss":"Algorithmic pricing for rivalrous resources","mechanism":"A market Protocol#7e1c for allocating rivalrous resources (e.g., compute, bandwidth, state slots) where the pricing function is continuous and algorithmic. It actively invokes StateLock#7859 to serialize bidding attempts and accepts Value#3c5d metrics to determine allocation. Unlike static auctions, it supports configurable pricing models via parameters, allowing agents to implement congestion pricing (e.g., EIP-1559), Dutch auctions, or linear decay.","invariants":["Circulation Pressure: The cost of holding the resource must be non-zero (HoldingCost > 0) to prevent infinite hoarding.","Price Discovery: Price must dynamically adjust to Demand or Time.","Clearance: The auction must resolve to a winner or reset within T_cycle."],"parameters":[{"name":"pricing_model","type":"Enum","range":"{CongestionPricing, DutchAuction, Linear}","description":"Default: CongestionPricing"},{"name":"cycle_time","type":"Duration","range":"[100ms, 1h]","description":"Duration of each auction cycle"},{"name":"holding_cost_rate","type":"Float","range":"[0.0, 1.0]","description":"Per-cycle cost of holding a resource without using it"}],"hash":"sema:ContinuousResourceAuction#mh:SHA-256:5776f432d109356fc12fdd34b712cc92b785c5779ef804e5f6f976de30fde962","stub":"5776","category":"Economics","layer":"Society","signature":["Protocol(Value)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"accepts":{"value":"Value#3c5d"},"composes_with":{"state_lock":"StateLock#7859"},"references":{"protocol":"Protocol#7e1c"}}},{"id":"IdempotentWrite","handle":"IdempotentWrite#15e8","gloss":"Safe retries via unique keys","mechanism":"A technical primitive where every write request includes a unique 'Idempotency Key'. The receiver tracks processed keys. If it receives a duplicate key, it returns the stored result without re-executing the side effects. This makes 'At-Least-Once' delivery safe. It uses a keyed StateLock#7859 to deduplicate requests, ensuring only the first write executes while subsequent ones return the cached result.","invariants":["Identity#626c: Apply(Req) == Apply(Req)","Safety: Duplicate requests trigger zero additional side effects"],"parameters":{},"hash":"sema:IdempotentWrite#mh:SHA-256:15e8ae521f88a6137d551fd3c61e350e4a027b6b063a35ade4565adfee83c14a","stub":"15e8","category":"Protocols","layer":"Society","signature":[],"preconditions":["Receiver has state storage for keys"],"postconditions":["Action executed exactly once (logically)"],"failureModes":[],"dependencies":{"references":{"state_lock":"StateLock#7859","identity":"Identity#626c"}}},{"id":"MonotonicCounter","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.","invariants":["Growth: Value#3c5d(T+1) >= Value#3c5d(T)","Merge Rule: Merge(A, B) = Max(A, B)"],"parameters":{},"hash":"sema:MonotonicCounter#mh:SHA-256:3a1201d0c954088c016b8d5ac039fd29d491bb158e865f1ea0b634bf073dfc1f","stub":"3a12","category":"Protocols","layer":"Society","signature":[],"preconditions":["Initial value defined"],"postconditions":["Order preserved"],"failureModes":[],"dependencies":{"references":{"state_lock":"StateLock#7859","value":"Value#3c5d"}}},{"id":"UniqueHandle","handle":"UniqueHandle#6879","gloss":"Transferable ownership of a singular resource","mechanism":"A cryptographic pointer to a singular, rivalrous resource (e.g., a specific file, a hardware port, a unique role). Unlike a copyable variable, a UniqueHandle obeys Linear Logic: it can be Transferred but not Copied. If Agent#cc24 A sends the Handle to Agent#cc24 B, Agent#cc24 A loses access immediately. Attempts to use a transferred Handle result in a capability fault. Utilizes StateLock#7859.","invariants":["Exclusivity: Access(Resource) requires Proof(Handle)","Linear Logic: Transfer(A -> B) implies A loses access immediately","Linearity: Count(Handle) == 1 always","Non-Duplication: Handle cannot be copied, only moved"],"parameters":{},"hash":"sema:UniqueHandle#mh:SHA-256:68791b2f756edd02f2710f7d4f55891ecab267df6373bd5048d997ee84f326eb","stub":"6879","category":"Protocols","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"state_lock":"StateLock#7859","agent":"Agent#cc24","break":"Break#9d98"}}},{"id":"PermissionEscalate","handle":"PermissionEscalate#5d67","gloss":"Requesting elevated privileges for sensitive operations","mechanism":"Standardizes request elevation. When `Risk > Threshold`, the Agent#cc24 blocks execution and emits a `PermissionRequest`. Waits for `SignedApproval` before proceeding. It requests a TieredAccess#6d26 upgrade, often pausing execution until HumanApprove#e64a is granted.","invariants":["Approval required for higher tier","Escalation logged"],"parameters":{},"hash":"sema:PermissionEscalate#mh:SHA-256:5d679cf53de921b8d7a577963214cefe6323f966340212d273fa58097336f4e6","stub":"5d67","category":"Protocols","layer":"Society","signature":[],"preconditions":["Blocked action","Justification"],"postconditions":["Access granted or denied"],"failureModes":[],"dependencies":{"references":{"human_approve":"HumanApprove#e64a","agent":"Agent#cc24","tiered_access":"TieredAccess#6d26"}}},{"id":"IntentGap","handle":"IntentGap#5dc4","gloss":"Analyzing intent-outcome divergence","mechanism":"Cognitive analysis of the divergence between intended Decision#acfb and actual Outcome#38e0. Examines why reality differed from intent: external factors, execution errors, model misspecification, or unforeseen consequences. Essential for learning and calibration.","invariants":["Analysis separates decision quality from outcome luck","Causal attribution must be evidence-based"],"parameters":{},"hash":"sema:IntentGap#mh:SHA-256:5dc4af64c8178e975cb7d6c1325132b7af673a69e445a37f9dc1e4aa8565ef14","stub":"5dc4","category":"Protocols","layer":"Society","signature":[],"preconditions":["Decision#acfb was made with explicit intent","Outcome#38e0 is observable and measurable"],"postconditions":["Gap analysis produced","Learning opportunities identified"],"failureModes":[],"dependencies":{"references":{"outcome":"Outcome#38e0","decision":"Decision#acfb"}}},{"id":"Reflexion","handle":"Reflexion#51b9","gloss":"Self-critique and retry after failure","mechanism":"A self-improvement loop where after completing a Task#d9f9 attempt, the agent generates linguistic self-critique analyzing what went wrong with the Plan#64f2 regarding the Goal#456a, then uses this reflection as context for a retry. Unlike fine-tuning, the model is frozen—improvement comes from explicit textual feedback stored in an episodic memory buffer. It writes self-critique to a Scratchpad#75bf memory buffer, using this feedback to improve the next attempt.","invariants":["Memory of error persists","Self-correction based on past failure"],"parameters":{},"hash":"sema:Reflexion#mh:SHA-256:51b91d2cdfeb6aed5ea3293154279d16af2c98b0c473e731066198b5d4d43e7f","stub":"51b9","category":"Reasoning","layer":"Mind","signature":[],"preconditions":["Failed trial","Outcome#38e0 signal"],"postconditions":["Improved policy/next trial"],"failureModes":[],"dependencies":{"references":{"outcome":"Outcome#38e0","scratchpad":"Scratchpad#75bf","plan":"Plan#64f2","critique":"Critique#3e00","goal":"Goal#456a"},"accepts":{"task":"Task#d9f9"}}},{"id":"Simulation","handle":"Simulation#8035","gloss":"A virtualized execution","mechanism":"Sandboxed Execution. Forks the current World State#4d58 (W) into W'. Executes Action (A) in W'. Discards W' and returns Outcome#38e0 (O). W remains immutable.","invariants":["Isolation: Side effects in W' DO NOT leak to W."],"parameters":{},"hash":"sema:Simulation#mh:SHA-256:80351d81041c870beacea4186f56e1f8703daf12578345859a7daf35a7dea270","stub":"8035","category":"Strategy","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"outcome":"Outcome#38e0","state":"State#4d58"}}},{"id":"AcceptSpec","handle":"AcceptSpec#70dd","gloss":"Non-compensatory failure boundaries","mechanism":"A strict, typed Spec#436e defining non-compensatory Criteria#ef6b at solver boundaries. Unlike soft prompts, an AcceptSpec specifies hard Constraint#87fes (e.g., Must be < 100/ton, Must violate no laws of physics). If ANY criterion fails, the artifact is rejected entirely. High quality in one dimension cannot compensate for failure in another.","invariants":["Non-Compensatory: Score(A) = 0 if any(Criterion) == Fail","Typed Output: Result must match schema, not free text"],"parameters":[{"name":"strictness","type":"Enum","range":"{Lenient, Normal, Strict}","description":"How much deviation allowed"},{"name":"timeout","type":"Duration","range":"[1s, 1h]","description":"Max wait for validation"}],"hash":"sema:AcceptSpec#mh:SHA-256:70ddc45d00abda5ec5b7475b080d252f01c3db589490498563621665444293f1","stub":"70dd","category":"Protocols","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"spec":"Spec#436e","constraint":"Constraint#87fe","criteria":"Criteria#ef6b"}}},{"id":"Build","handle":"Build#00f3","gloss":"Low-cost prototype generation","mechanism":"Performs the Act#5d55 of constructing a low-cost Artifact#6254 (prototype) to verify critical assumptions in the Spec#436e before full commitment. Governed by the Marginal Value#3c5d Rule.","invariants":["Cost(Build) << Cost(rollout)","Prototype#ff18 must address specific risks identified in Plan#64f2"],"parameters":{},"hash":"sema:Build#mh:SHA-256:00f3e2cc017af17d5de5a121ddd38017635736aa54c5ef23ee43c84abe5ddab6","stub":"00f3","category":"Strategy","layer":"Mind","signature":["Act(Artifact)"],"preconditions":["PlanBundle with high uncertainty/risk"],"postconditions":["ProtoPack artifact (Evidence of feasibility)"],"failureModes":[],"dependencies":{"references":{"act":"Act#5d55","prototype":"Prototype#ff18","plan":"Plan#64f2","value":"Value#3c5d"},"yields":{"artifact":"Artifact#6254"},"accepts":{"spec":"Spec#436e"}}},{"id":"FrameSpec","handle":"FrameSpec#d5b8","gloss":"Structured problem definition artifact","mechanism":"A structured Spec#436e of the Problem#5baa space, Constraint#87fes, and success criteria derived from a raw request via interpretation. It is an Artifact#6254 that acts as the contract defining the boundaries for execution.","invariants":["Constraint Clarity: Must contain explicit, testable Constraint#87fes.","Success Definition: Must define unambiguous success criteria."],"parameters":{},"hash":"sema:FrameSpec#mh:SHA-256:d5b8e71aa9d57b941df3f914b941bfb8fe6c58f62d6c6db28532defcd2237d75","stub":"d5b8","category":"Protocols","layer":"Society","signature":["Artifact(Constraint)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"spec":"Spec#436e","artifact":"Artifact#6254","problem":"Problem#5baa","constraint":"Constraint#87fe"}}},{"id":"Verification","handle":"Verification#9c1e","gloss":"Confirming alignment with truth or spec","mechanism":"The cognitive process of confirming that a claim or Artifact#6254 adheres to its Spec#436e or reality. Unlike open-ended inquiry, Verification yields a binary Truth value regarding an existing assertion via a Check#1544.","invariants":[],"parameters":{},"hash":"sema:Verification#mh:SHA-256:9c1ee918c6b8b8d7b787f5ef7ae908aa2ca37b1f9b5dace80fcf261a9c961001","stub":"9c1e","category":"Reasoning","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"spec":"Spec#436e","artifact":"Artifact#6254","check":"Check#1544"}}},{"id":"Decompose","handle":"Decompose#422f","gloss":"Dividing complexity into manageable units","mechanism":"Strategy#47a4: The cognitive act of splitting a Task#d9f9 into independent sub-Task#d9f9s. Criterion: solving subProblem#5baas in isolation must yield Solution#7186 to whole. If subproblems interact, split is wrong—try different decomposition axis. Recurse until subproblems are trivial.","invariants":["Subproblems must be independent."],"parameters":{},"hash":"sema:Decompose#mh:SHA-256:422f4ab64753ba80b9381763a596850c0dc411d5432054786e3208c17ddca0de","stub":"422f","category":"Reasoning","layer":"Mind","signature":[],"preconditions":["Problem#5baa too large to solve directly. Decomposition axis identifiable. Subproblems can be independent."],"postconditions":["Set of independent subproblems. Combined Solution#7186 equals original. No subproblem depends on sibling."],"failureModes":[],"dependencies":{"accepts":{"task":"Task#d9f9"},"references":{"problem":"Problem#5baa","solution":"Solution#7186","strategy":"Strategy#47a4"}}},{"id":"GracefulDegradation","handle":"GracefulDegradation#f6d7","gloss":"When verification fails, fall back to inline definition","mechanism":"Resolution Fallback Strategy#47a4. When a Pattern_ID is not found in local storage, the system attempts to resolve it via secondary channels (Inline Payload -> Network Request) rather than halting immediately. Crucially, any definition acquired this way must be cryptographically verified against the requested Pattern_ID. It defaults to FailClosed#ae79 if verification fails, but attempts to parse verified inline definitions to maintain continuity.","invariants":["Atomic Load: A definition is only added to Local DB if it validates fully.","Trust but Verify: Externally acquired definitions must be Hashed and Verified before loading."],"parameters":[{"name":"max_def_size","type":"ByteSize","range":"unspecified","description":"Default: 100KB"},{"name":"max_recursion_depth","type":"Integer","range":"[1, 5]","description":"Maximum inline definition expansion depth"}],"hash":"sema:GracefulDegradation#mh:SHA-256:f6d796365ffaa5244e54660f836f2e31ca948169f42fd305da33445cbfa30485","stub":"f6d7","category":"Protocols","layer":"Society","signature":[],"preconditions":["Message#f767 contains fallback data OR sender is reachable","Pattern lookup failed"],"postconditions":["Pattern resolved and locally minted OR Transaction aborted"],"failureModes":[],"dependencies":{"references":{"strategy":"Strategy#47a4","fail_closed":"FailClosed#ae79","message":"Message#f767"}}},{"id":"NoiseInjection","handle":"NoiseInjection#53b3","gloss":"Breaking local optima","mechanism":"If the Agent#cc24 detects it is looping or repeating text, it deliberately injects high-temperature Noise#c4b4 or a random oblique Strategy#47a4 Card#5c33 into its Context#510a to force a trajectory change.","invariants":["Noise#c4b4 distribution matches parameter","Signal#f39d-to-noise ratio > 0"],"parameters":{},"hash":"sema:NoiseInjection#mh:SHA-256:53b36cfe3d333d99412073f819e001225b53449bd95438ec85e6c51087fa43df","stub":"53b3","category":"Strategy","layer":"Mind","signature":[],"preconditions":["Clean signal/process","Need for exploration/robustness"],"postconditions":["Perturbed output"],"failureModes":[],"dependencies":{"references":{"strategy":"Strategy#47a4","signal":"Signal#f39d","noise":"Noise#c4b4","context":"Context#510a","card":"Card#5c33","agent":"Agent#cc24"}}},{"id":"OODA","handle":"OODA#149f","gloss":"Rapid decision cycle: Observe, Orient, Decide, Act","mechanism":"The OODA Loop#fb2e (Observe#8ebd-Orient-Decide-Act#5d55) is a high-speed decision cycle favoring Agent#cc24 agility over raw power. \n1. OBSERVE: Gather raw data via Observe#8ebd.\n2. ORIENT: Update context and beliefs via Context#510a and Belief#6690. This is the most critical step, filtering data through culture and genetics (or training).\n3. DECIDE: Select#15c2 a hypothesis or Strategy#47a4 via Think#e1bd and Select#15c2.\n4. ACT: Execute via Act#5d55 and change the environment.\nSuccess depends on traversing this loop faster than the adversary (or environment changes).","invariants":["Cyclic: The output of Act#5d55 feeds the input of Observe#8ebd.","Orient Dominance: Decisions must flow from a valid Orientation (Context#510a)."],"parameters":{},"hash":"sema:OODA#mh:SHA-256:149ff85c263c245bd89999ae4c967c7394de7a27657c0dd0bb5b2f86621cc99b","stub":"149f","category":"Strategy","layer":"Mind","signature":["Agent(Loop)","Think(Strategy)"],"preconditions":["Active Environment","Agent#cc24 Agency"],"postconditions":["Environment State#4d58 Modified","Internal Model Updated"],"failureModes":[],"dependencies":{"references":{"strategy":"Strategy#47a4","state":"State#4d58","loop":"Loop#fb2e","agent":"Agent#cc24"},"composes_with":{"act":"Act#5d55","think":"Think#e1bd","belief":"Belief#6690","observe":"Observe#8ebd","select":"Select#15c2","context":"Context#510a"}}},{"id":"SacrificialProbe","handle":"SacrificialProbe#2372","gloss":"Learning via cheap, instructive failure","mechanism":"A Generalized Pattern where an Agent#cc24 sends a low-cost 'probe' into a System#e314 expecting it to fail, but designs the failure to be instructive. The probe must be cheap relative to the main payload, and the failure Mode#b995 must update the Strategy#47a4 for the main payload. Common in startups (landing pages), immunology (dendritic cells), and warfare (reconnaissance). It wraps the concept of a staked probe in a higher-order strategy where the probe's destruction is the intended Signal#f39d.","invariants":["Cost Asymmetry: Cost(Probe#9f2b) << Cost(MainPayload)","Instructive Failure: InfoGain(Failure) > EntropyReductionThreshold","Strategy#47a4 Update: MainPayload parameters are a function of ProbeResult"],"parameters":[{"name":"cost_ratio","type":"Float","range":"[0.0, 0.1]","description":"Probe cost relative to payload"},{"name":"failure_mode","type":"Enum","range":"unspecified","description":"Silent, Loud, Byzantine"}],"hash":"sema:SacrificialProbe#mh:SHA-256:2372fc7a6d00a9d9b86f5f5cd7561ec60a8527973ff52b395f3ec3f56b5c78e4","stub":"2372","category":"Strategy","layer":"Mind","signature":[],"preconditions":["System#e314 failure Mode#b995s are observable"],"postconditions":["Strategy#47a4 updated"],"failureModes":[],"dependencies":{"references":{"mode":"Mode#b995","signal":"Signal#f39d","strategy":"Strategy#47a4","system":"System#e314","probe":"Probe#9f2b","agent":"Agent#cc24"}}},{"id":"Specialize","handle":"Specialize#d968","gloss":"Deductive application of principles","mechanism":"Concrete Instantiation: Given abstract principle, substitute specific values for variables. Check#1544 all constraints still hold after substitution. Generate multiple specializations to understand the principle\"s range. Edge cases reveal hidden assumptions. It applies the inverse of Generalize#9313, mapping abstract principles to concrete, context-specific instances.","invariants":["Constraint Inheritance: Must satisfy all constraints of the general principle","Type Narrowing: Input parameters are a subset of the general domain"],"parameters":{},"hash":"sema:Specialize#mh:SHA-256:d96855368b574a8e44d5c3ca6ef76c4ca141ddd964acc9c54d9428860c00c203","stub":"d968","category":"Reasoning","layer":"Mind","signature":[],"preconditions":["Domain constraints","General purpose agent"],"postconditions":["Expert agent instantiated"],"failureModes":[],"dependencies":{"references":{"generalize":"Generalize#9313","check":"Check#1544","context":"Context#510a"}}},{"id":"ConfidenceCalibrate","handle":"ConfidenceCalibrate#5238","gloss":"Aligning subjective confidence with objective frequency","mechanism":"Track Record Alignment: For claims rated 70% confident, ~70% should be true. Track predictions vs outcomes. If 90% claims are right only 60% of time, you are overconfident—widen uncertainty. If 90% claims are right 99% of time, you are underconfident—tighten. It adjusts the internal probability model using BayesUpdate#5d91 on historical accuracy data, ensuring BaseRateInclude#aa0b is respected.","invariants":["Calibration curve must be monotonic."],"parameters":[{"name":"bin_count","type":"Integer","range":"[5, 20]","description":"Resolution of calibration measurement"},{"name":"calibration_target","type":"Float","range":"[0.02, 0.15]","description":"Max expected calibration error, ECE"}],"hash":"sema:ConfidenceCalibrate#mh:SHA-256:52389ef2231a04c551e99c640524f8b082a4608c1a1e9576096450f0f43bc575","stub":"5238","category":"Inference","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"bayes_update":"BayesUpdate#5d91","agent":"Agent#cc24","base_rate_include":"BaseRateInclude#aa0b"}}},{"id":"DissentSeek","handle":"DissentSeek#bca9","gloss":"Mitigating groupthink via mandatory devils advocacy","mechanism":"Active Disagreement: After reaching conclusion, find smartest person who disagrees. Understand#96d4 their model fully before dismissing. Ask: What do they see that I don't? Unanimous agreement is suspicious—either groupthink or the question is trivial. It triggers a ConfirmationBlock#3dae until a valid SteelmanCheck#75a0 of the opposing view has been integrated.","invariants":["Dissent must be substantive (not trivial)","Must find at least one disagreement or critical view"],"parameters":{},"hash":"sema:DissentSeek#mh:SHA-256:bca9e7effdcafe26935739612e7eb649394fe8c2a883cb5f8eadb0086787ee97","stub":"bca9","category":"Protocols","layer":"Society","signature":[],"preconditions":["Quorum#f67a view","Diverse pool of critics"],"postconditions":["Blind spots revealed","Confidence intervals widened"],"failureModes":[],"dependencies":{"references":{"steelman_check":"SteelmanCheck#75a0","quorum":"Quorum#f67a","understand":"Understand#96d4","confirmation_block":"ConfirmationBlock#3dae"}}},{"id":"PreMortem","handle":"PreMortem#eb4f","gloss":"Simulating failure to identify hidden risks","mechanism":"Prospective Hindsight: Before executing Task#d9f9 (Plan#64f2), assume it has failed catastrophically. Ask: \"What went wrong?\" Generate failure scenarios without defensiveness. For each plausible failure, add mitigation to plan or reconsider approach entirely. It invokes RecursiveRootCause#6dc1 on a hypothetical failure state, often employing SteelmanCheck#75a0 to ensure the disaster scenario is plausible.","invariants":["Future Perspective: Analysis must assume failure has ALREADY happened","Perspective Shift: Analysis assumes failure has ALREADY occurred (Probability=1.0)","Specific Cause: Failure reasons must be actionable, not generic bad luck","Specificity: Failure causes must be actionable"],"parameters":[{"name":"confidence_required","type":"Probability","range":"[0.7, 0.95]","description":"Certainty needed to dismiss risk"},{"name":"failure_probability_floor","type":"Probability","range":"[0.01, 0.30]","description":"Min failure chance to investigate"}],"hash":"sema:PreMortem#mh:SHA-256:eb4f7f98ba5434aefc6b4e7f0059dde5d6a08bf80525a2577e413554d9f33022","stub":"eb4f","category":"Strategy","layer":"Mind","signature":[],"preconditions":["Plan#64f2 is fully specified"],"postconditions":["Plan#64f2 robustified"],"failureModes":[],"dependencies":{"references":{"steelman_check":"SteelmanCheck#75a0","recursive_root_cause":"RecursiveRootCause#6dc1","plan":"Plan#64f2"},"accepts":{"task":"Task#d9f9"}}},{"id":"SteelmanFirst","handle":"SteelmanFirst#ca6f","gloss":"Construct strongest counter-argument before proposing","mechanism":"Reasoning Heuristic. Before proposing a solution, the agent actively constructs the strongest possible version of the opposing argument or constraint. It ensures the critique phase of SteelmanCheck#75a0 is populated with high-quality data, not strawmen. Utilizes SteelmanCheck#75a0.","invariants":["Prioritization: Counter-argument generation must precede Proposal generation in the chain."],"parameters":[{"name":"effort_ratio","type":"Float","range":"[0.3, 0.5]","description":"Portion of budget spent on counter-argument"}],"hash":"sema:SteelmanFirst#mh:SHA-256:ca6f6d43904497ea1ec0c83d3241da18e3d217a06b57040c8eb7b06bda62a1ae","stub":"ca6f","category":"Strategy","layer":"Mind","signature":[],"preconditions":["Problem#5baa statement defined"],"postconditions":["Strongest counter-argument cached"],"failureModes":[],"dependencies":{"references":{"steelman_check":"SteelmanCheck#75a0","cognitive_bias":"CognitiveBias#4b32","problem":"Problem#5baa","agent":"Agent#cc24"}}},{"id":"MemeticSeed","handle":"MemeticSeed#f77b","gloss":"Viral propagation of semantic standards via economic subsidy","mechanism":"Agent#cc24 actively broadcasts a subset of its ontology to neighbors, offering favorable terms (Yield#7eaf) to those who adopt it, thereby reducing its own future translation costs (TranslationProxy#f0e0). Standards are adopted not because they are 'true', but because they are subsidized. It subsidizes adoption via Yield#7eaf and TranslationProxy#f0e0, broadcasting the standard through an ExplainBeacon#34b3.","invariants":["Fidelity: Propagated ontology must be isomorphic to source","Subsidy Gradient: Adoption Incentive > Switching Cost"],"parameters":{},"hash":"sema:MemeticSeed#mh:SHA-256:f77b494ab19acc3c810b7e5535a6d4f648e075d181d13f8748c7c8294c75291b","stub":"f77b","category":"Protocols","layer":"Society","signature":[],"preconditions":["Network of peers with divergent ontologies","Resource surplus to subsidize adoption"],"postconditions":["Communication cost decreases","Peer adopts semantic subset"],"failureModes":[],"dependencies":{"references":{"yield":"Yield#7eaf","translation_proxy":"TranslationProxy#f0e0","agent":"Agent#cc24","explain_beacon":"ExplainBeacon#34b3"}}},{"id":"WorldTransparent","handle":"WorldTransparent#d416","gloss":"Designing for universal observability","mechanism":"A design constraint where the agent assumes all state and actions are publicly visible. This forces the invention of systems that rely on auditability and shame rather than secrecy or access control. It essentially ports 'Open Source' philosophy to system architecture. Utilizes ExplainBeacon#34b3.","invariants":["Security Independence: System#e314 remains secure even if all logs are public","Witness Effect: Bad behavior is disincentivized by visibility, not prevention"],"parameters":{},"hash":"sema:WorldTransparent#mh:SHA-256:d41625e457165f80e273facbf7f629bdab7d95ee14d0c3aa47187e76e0883708","stub":"d416","category":"Governance","layer":"Society","signature":[],"preconditions":["Privacy is not the primary goal (or is handled via Zero Knowledge)"],"postconditions":["Secrets eliminated from critical path"],"failureModes":[],"dependencies":{"references":{"system":"System#e314","explain_beacon":"ExplainBeacon#34b3"}}},{"id":"ChunkMerge","handle":"ChunkMerge#26e2","gloss":"Hierarchical context management","mechanism":"Cognitive Compression: Group related items into named chunks. Treat chunk as single unit in working memory. Hierarchy#aa9b of chunks enables handling complexity beyond raw capacity. Merge when patterns repeat; split when chunk becomes unwieldy. It applies Aggregate#0291 to Compress#0967 multiple working memory items into a single labeled unit.","invariants":["Chunk name must be meaningful.","Information Conservation: Merged chunk retains key retrieval hooks of parts","Size Constraint#87fe: Size(Merged) <= ContextWindowLimit"],"parameters":{},"hash":"sema:ChunkMerge#mh:SHA-256:26e23e7ef95ba9c9136d95f59b319f3eb378890f0c4b709b7a3c7fef350fb29a","stub":"26e2","category":"Memory","layer":"Mind","signature":[],"preconditions":["Input chunks share semantic topic"],"postconditions":[],"failureModes":[],"dependencies":{"references":{"compress":"Compress#0967","aggregate":"Aggregate#0291","hierarchy":"Hierarchy#aa9b","constraint":"Constraint#87fe"}}},{"id":"DriftWatch","handle":"DriftWatch#45de","gloss":"Reputation becomes pattern-fidelity measurement - trustworthiness equals predictability. Agents are trusted not for peak performance but for behavioral consistency. Gaming reputation through occasional spectacular actions becomes impossible.","mechanism":"Reputation via micro-deviation detection. 1. Baseline: Establish behavioral frequency. 2. Sample: Continuous high-res observation. 3. Detect: Alert if Distance(Current, Baseline) > 2 sigma. 4. Witness: Aggregated peer reports. It tracks behavioral consistency by monitoring deviations from a baseline Aggregate#0291 of historical actions.","invariants":["Baseline Persistence: Baseline must remain immutable during measurement","Drift Detection: Alert if Distance(Current, Baseline) > Threshold"],"parameters":[{"name":"threshold","type":"Float","range":"[0.0, 1.0]","description":"Distance trigger"},{"name":"window_size","type":"Integer","range":"[10, 10000]","description":"Samples for baseline"}],"hash":"sema:DriftWatch#mh:SHA-256:45def9613965f9a51777a3cce031db4cccc7b248d1735bd8000b7df65960ec51","stub":"45de","category":"Protocols","layer":"Society","signature":[],"preconditions":["Baseline state is established"],"postconditions":[],"failureModes":[],"dependencies":{"references":{"aggregate":"Aggregate#0291","agent":"Agent#cc24"}}},{"id":"Parallelize","handle":"Parallelize#dac1","gloss":"Run subtasks simultaneously and aggregate","mechanism":"Runs multiple LLM calls simultaneously and aggregates results. Two modes: Sectioning (split Task#d9f9 into independent subtasks, run in Parallel#6272, merge) and Voting (run same Task#d9f9 multiple times, Aggregate#0291 via majority Mode#b995 or selection). Trades compute cost for speed and/or confidence. It spawns concurrent execution threads and employs Aggregate#0291 to unify the results into a final Result#8ed9.","invariants":["Tasks are independent","Total time = Max(Task_i) + Overhead"],"parameters":{},"hash":"sema:Parallelize#mh:SHA-256:dac1ca99ae8c379c9ba093e840eaab9eb2ad16ccfbdb07d6c0e25e3fad2fae6c","stub":"dac1","category":"Strategy","layer":"Mind","signature":["Parallel(Task)","Aggregate(Result)"],"preconditions":["Batch of tasks","Multiple workers"],"postconditions":["All results aggregated"],"failureModes":[],"dependencies":{"references":{"mode":"Mode#b995","parallel":"Parallel#6272","strategy":"Strategy#47a4","result":"Result#8ed9","cognitive_bias":"CognitiveBias#4b32"},"accepts":{"task":"Task#d9f9"},"composes_with":{"aggregate":"Aggregate#0291"}}},{"id":"PerspectiveEnsemble","handle":"PerspectiveEnsemble#5816","gloss":"Simulating diverse experts","mechanism":"The Agent#cc24 instantiates N virtual personas to debate the Problem#5baa from distinct, pre-defined viewpoints. The Synthesis#3252 emerges from their interaction. Unlike a single Chain#5711-of-Thought, this forces the modeling of conflicting priors. It generates diverse viewpoints using SteelmanCheck#75a0 on opposing arguments, then resolves the conflict via Aggregate#0291 (e.g. Mode).","invariants":["Semantic Distance: CosineSimilarity(Persona_A_Output, Persona_B_Output) < 0.6","Independence: Personas cannot see peer outputs in Round 1"],"parameters":[{"name":"personas","type":"List[String]","range":"[3, 7]","description":"Distinct viewpoints"},{"name":"rounds","type":"Integer","range":"[1, 5]","description":"Debate turns"}],"hash":"sema:PerspectiveEnsemble#mh:SHA-256:581616f76817ec08f652a538226cdabc79e5ff56e03c06857cd2a53e78d43a8b","stub":"5816","category":"Strategy","layer":"Mind","signature":[],"preconditions":["Agent#cc24 must be alignment-seeking (Tier 2 Limitation)"],"postconditions":[],"failureModes":[],"dependencies":{"references":{"aggregate":"Aggregate#0291","problem":"Problem#5baa","synthesis":"Synthesis#3252","chain":"Chain#5711","context":"Context#510a","steelman_check":"SteelmanCheck#75a0","agent":"Agent#cc24"}}},{"id":"ProphetFanOut","handle":"ProphetFanOut#6972","gloss":"High-fanout causal simulation","mechanism":"A purely descriptive module that utilizes computational abundance to generate multiple branching future timelines resulting from a proposed action. Unlike standard Chain#5711-of-Thought which follows one likely path (mimicking human laziness), the Prophet forces exploration of low-probability but high-impact tails. It feeds into Quorum#f67a by generating the diverse timeline candidates required for the Aggregate#0291.","invariants":["Descriptive Only: Output must contain zero normative judgment","Diversity: Entropy(Timelines) > Threshold (Must explore distinct futures)"],"parameters":{},"hash":"sema:ProphetFanOut#mh:SHA-256:6972d19d015bb785ec16660c5a465e9451e2109e435e465b16a7432b806ecf7f","stub":"6972","category":"Inference","layer":"Mind","signature":[],"preconditions":["Action A is well-defined"],"postconditions":["At least 3 distinct futures generated"],"failureModes":[],"dependencies":{"references":{"chain":"Chain#5711","aggregate":"Aggregate#0291","quorum":"Quorum#f67a"}}},{"id":"SelfConsistency","handle":"SelfConsistency#1793","gloss":"Sample multiple reasoning chains, select by majority","mechanism":"A variance-reduction technique where the same query is processed N times independently (with temperature > 0), producing N candidate answers. The final answer is selected by majority Aggregate#0291 (Mode). Exploits the intuition that correct reasoning paths are more likely to converge on the same answer than incorrect ones. It aggregates multiple reasoning paths via Aggregate#0291 to determine the most robust answer.","invariants":["Aggregation: Final answer determined by plurality or weighted aggregation","Independence: Each sample must be generated without knowledge of others","N >= 3: Minimum samples for meaningful convergence"],"parameters":{},"hash":"sema:SelfConsistency#mh:SHA-256:1793d1f73eb71f1153093c2223715de06100e2414f0ae47145b2f9a911276888","stub":"1793","category":"Reasoning","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"aggregate":"Aggregate#0291"}}},{"id":"ContextSwitch","handle":"ContextSwitch#5bb8","gloss":"Explicit mode toggling","mechanism":"Agent#cc24s explicitly use Switch#70bf to signal a change in Context#510a (protocol Mode#b995). All subsequent messages are interpreted under the new ruleset until a 'Revert' signal is sent.","invariants":[],"parameters":{},"hash":"sema:ContextSwitch#mh:SHA-256:5bb8b7ef36dbdfdf6f32e4b26586a975db765c79c87ce17ac28ed6e83b1e8e5c","stub":"5bb8","category":"Protocols","layer":"Society","signature":["Switch(Context)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"mode":"Mode#b995","switch":"Switch#70bf","agent":"Agent#cc24"},"accepts":{"context":"Context#510a"}}},{"id":"UptakeOverTimestamp","handle":"UptakeOverTimestamp#fdb6","gloss":"Usage determines canonical status, not who minted first","mechanism":"Decentralized Governance Heuristic. Resolves canonical status conflicts by prioritizing Usage Volume (uptake) over Registration Time (timestamp). When querying for a concept Handle, the system returns the variant with the highest `Reference_Count` or `Execution_Count`. Utilizes UptakeAsGround#bf85.","invariants":["Meritocracy: Canonical_Score = f(Usage, Citations, Success_Rate).","Timestamp Irrelevance: Creation_Date must NOT be a factor in relevance ranking."],"parameters":{},"hash":"sema:UptakeOverTimestamp#mh:SHA-256:fdb60eb23d0437e0f29680b0503911c6643e629412b883d1dda9acb81903da0a","stub":"fdb6","category":"Protocols","layer":"Society","signature":[],"preconditions":["Multiple patterns exist for similar concepts","Usage metrics available"],"postconditions":["Canonical pattern identified","Squatted/Dead patterns suppressed"],"failureModes":[],"dependencies":{"references":{"uptake_as_ground":"UptakeAsGround#bf85","problem":"Problem#5baa"}}},{"id":"GhostTrail","handle":"GhostTrail#91ae","gloss":"Cryptographically verified anonymous stigmergy","mechanism":"A stigmergic Protocol#7e1c where environmental Trace#9057s (pheromones) are cryptographically signed by a Ring Signature. This proves that a Trace#9057 was left by a valid member of the Scout group without revealing the specific Agent#cc24's Identity#626c or location history. The swarm follows the Trace#9057 because it verifies the Group Authority, but no predator can track the individual Scout who laid it. It secures the Trace#9057 with IdentityMask#f9a7, ensuring the signature validates group membership without revealing the individual scout.","invariants":["Plausible Deniability: Probability(Signer = Agent_N) = 1/N","Trace#9057 Authority: Verify(Trace#9057, RingKey) == True"],"parameters":{},"hash":"sema:GhostTrail#mh:SHA-256:91ae8d7d1b3e4bd39696fc0583fae5f2238600d7a041e010374c7edc01732cd2","stub":"91ae","category":"Protocols","layer":"Society","signature":[],"preconditions":["Group Public Keys established","Shared environment (Canvas/Map)"],"postconditions":[],"failureModes":[],"dependencies":{"references":{"trace":"Trace#9057","protocol":"Protocol#7e1c","identity_mask":"IdentityMask#f9a7","identity":"Identity#626c","agent":"Agent#cc24"}}},{"id":"MimicMask","handle":"MimicMask#0fe8","gloss":"Hiding in the crowd","mechanism":"Agents send decoy traffic that statistically mimics the behavior of other agents. Real signals are steganographically encoded within the Noise#c4b4. Makes it impossible for an observer to distinguish active agents from idle ones. It layers steganographic Noise#c4b4 over an IdentityMask#f9a7, ensuring statistical indistinguishability from background traffic.","invariants":["Statistical Parity: Traffic distribution matches Baseline(Normal)","Steganographic Integrity: Payload retrievable by Key(Receiver)"],"parameters":{},"hash":"sema:MimicMask#mh:SHA-256:0fe8418d9f34643affbdab2d7372dd7b07ed50ef3d4447c0c5042dc20225147a","stub":"0fe8","category":"Strategy","layer":"Mind","signature":[],"preconditions":["Shared secret established"],"postconditions":["Observer sees Noise#c4b4"],"failureModes":[],"dependencies":{"references":{"identity_mask":"IdentityMask#f9a7","noise":"Noise#c4b4"}}},{"id":"RingWitness","handle":"RingWitness#1038","gloss":"Group-level attribution without individual identification","mechanism":"A cryptographic signature scheme where a message is signed by a 'ring' of N agents. The signature proves that 'one of the N agents signed this', but it is mathematically impossible to determine WHICH one. It provides authenticity with plausible deniability. It leverages IdentityMask#f9a7 to prove group membership without revealing individual identity.","invariants":["All N witnesses signed","Order of signing preserved"],"parameters":{},"hash":"sema:RingWitness#mh:SHA-256:1038a04f0c68ad710717eedc0f6512fc55c480bedb0922e874163f8e234afe01","stub":"1038","category":"Verification","layer":"Infrastructure","signature":[],"preconditions":["Document/Fact","Ring of verifiers"],"postconditions":["Proof of consensus"],"failureModes":[],"dependencies":{"references":{"identity_mask":"IdentityMask#f9a7"}}},{"id":"TimeWarpLog","handle":"TimeWarpLog#aa7a","gloss":"Handling relativistic event ordering","mechanism":"Events are not ordered by wall-clock time but by 'causal cones'. An Agent#cc24 accepts an event from the 'past' if it doesn't contradict its current causal cone. Allows for massive latency tolerance. Utilizes WorldReversible#f664, CausalBarrier#3a88.","invariants":["Immutability: Past entries cannot be modified","Indexability: Seek(Time T) returns deterministic State#4d58(T)","Log immutable after write."],"parameters":[{"name":"granularity","type":"Duration","range":"[1ms, 1min]","description":"Resolution of time travel"},{"name":"index_strategy","type":"Enum","range":"{Time, Causal, Hybrid}","description":"How to organize history"},{"name":"retention_window","type":"Duration","range":"[1h, 30d]","description":"How far back to retain"}],"hash":"sema:TimeWarpLog#mh:SHA-256:aa7a5f4cc64abcca090f2931d75a7dc0718ec2e20cd42fb0737f5fa4a87c3e32","stub":"aa7a","category":"Primitives","layer":"Infrastructure","signature":[],"preconditions":["Storage supports append-only writes"],"postconditions":["System#e314 state matches T_target"],"failureModes":[],"dependencies":{"references":{"system":"System#e314","state":"State#4d58","world_reversible":"WorldReversible#f664","causal_barrier":"CausalBarrier#3a88","agent":"Agent#cc24"}}},{"id":"AttentionMarkets","handle":"AttentionMarkets#abdd","gloss":"Pricing bandwidth to filter spam","mechanism":"Agents bid for priority in message queues. High-stakes messages pay to jump the line; spam is priced out by congestion pricing. Queue manager runs continuous auction: incoming Signal#f39ds include a Value#3c5d bid, manager sorts by bid/urgency ratio, losers wait or increase bid. Price discovery via second-price auction prevents overpayment. Revenue redistributed to queue participants or burned. It instantiates the ContinuousResourceAuction#5776 mechanism to continuously price bandwidth availability based on network congestion.","invariants":["Attention supply is rivalrous (Bandwidth < Demand).","Price reflects aggregate demand (Congestion Pricing).","Bid Monotonicity: Higher bid guarantees strictly better or equal placement.","Clearing: Messages with Bid < CurrentPrice are dropped or buffered."],"parameters":{},"hash":"sema:AttentionMarkets#mh:SHA-256:abdda155165282a52b447988e6d25eb9bb85e9e6deaaf8983eeaf16f3aa05180","stub":"abdd","category":"Economics","layer":"Society","signature":[],"preconditions":["Limited processing bandwidth","Multiple information sources","Liquid currency for bidding"],"postconditions":["Resources allocated to highest-bid signals","Market price established for current tick"],"failureModes":[],"dependencies":{"composes_with":{"continuous_resource_auction":"ContinuousResourceAuction#5776"},"references":{"signal":"Signal#f39d","value":"Value#3c5d"}}},{"id":"StateSnapshot","handle":"StateSnapshot#01c9","gloss":"Durable persistence of volatile state","mechanism":"Periodic serialization of internal volatile State#4d58 to durable storage to enable crash recovery. Unlike distributed checkpoints (which requires consensus), Snapshot#0ae9 is a local or unilateral durability guarantee. It enables 'Resume' functionality. Utilizes Trace#9057, CryptoShred#e0b9, IdempotentWrite#15e8.","invariants":["Atomicity: Snapshot#0ae9 is either fully written or discarded (no partial corruption)","Roundtrip Integrity: Deserialize(Serialize(S)) must equal S"],"parameters":{},"hash":"sema:StateSnapshot#mh:SHA-256:01c99fd1a5b7fe33a7065bfddcce746f76ecb2f2737cdd578801903cb7f1e990","stub":"01c9","category":"Protocols","layer":"Society","signature":["State(Snapshot)"],"preconditions":["Serializable State#4d58","Write access to durable storage"],"postconditions":["Resume point established"],"failureModes":[],"dependencies":{"references":{"trace":"Trace#9057","state":"State#4d58","idempotent_write":"IdempotentWrite#15e8","crypto_shred":"CryptoShred#e0b9","snapshot":"Snapshot#0ae9"}}},{"id":"HeldRelease","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.","invariants":["Atomic State#4d58: Funds are either Locked, Released, or Returned (no partial states)","Release atomic.","Timeout Guarantee: Funds return to Sender if Condition#cbd5 is not met by T"],"parameters":[{"name":"hold_duration","type":"Duration","range":"[1s, 24h]","description":"Minimum hold time before release"},{"name":"overflow_policy","type":"Enum","range":"{Queue, Drop, Reject}","description":"When capacity exceeded"},{"name":"release_trigger","type":"Enum","range":"{Timer, Signal, Condition}","description":"What triggers release"}],"hash":"sema:HeldRelease#mh:SHA-256:5b7a43f760dc439c0880f720faf1be428aa39a119e55a579d249aa264a38ee93","stub":"5b7a","category":"Protocols","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"accepts":{"unique_handle":"UniqueHandle#6879"},"references":{"condition":"Condition#cbd5","state":"State#4d58","value":"Value#3c5d"}}},{"id":"ChainOfThought","handle":"ChainOfThought#6201","gloss":"Step-by-step reasoning (Macro for Think(Chain))","mechanism":"The canonical implementation of sequential reasoning. Instantiates the 'Think#e1bd' primitive with a linear 'Chain#5711' Topology#2408. Elicits a step-by-step derivation of the answer to improve accuracy and transparency. It implements the Think#e1bd primitive as a linear Chain#5711, optionally invoking StepBack#b079 or Reflexion#51b9 to self-correct during the derivation.","invariants":["Inherits invariants from Think#e1bd and Chain#5711","Reasoning Before Answer: Intermediate steps must precede final conclusion"],"parameters":{},"hash":"sema:ChainOfThought#mh:SHA-256:620185e6502cb8b2ac69fcdd94243e5ccfa2f54d3d34524dcf26a1c81662294c","stub":"6201","category":"Reasoning","layer":"Mind","signature":["Think(Chain)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"composes_with":{"step_back":"StepBack#b079","reflexion":"Reflexion#51b9"},"references":{"think":"Think#e1bd","topology":"Topology#2408","chain":"Chain#5711"}}},{"id":"DogfoodFirst","handle":"DogfoodFirst#826e","gloss":"Use your own tool before shipping","mechanism":"Validation Protocol#7e1c. Before releasing a tool or pattern, the creator must use it to solve a non-trivial problem in their own workflow. This generates 'Friction Logs' that identify usability gaps missed by theoretical design. It requires the creator to act as a Canary#3902, using the tool in production and generating a Reflexion#51b9 log of friction points.","invariants":["Friction Documentation: All UX hurdles encountered must be logged.","Skin in the Game: Validation must involve real risk or real work (not a simulation)."],"parameters":[{"name":"duration","type":"Duration","range":"unspecified","description":"Default: 1h"},{"name":"output_artifact","type":"Solution","range":"unspecified","description":"The solution artifact produced by self-testing"}],"hash":"sema:DogfoodFirst#mh:SHA-256:826e2ceafda81d7db4a19d1cf6bd8ad0c2cd86b24c65d1654ba7efb345374260","stub":"826e","category":"Economics","layer":"Society","signature":[],"preconditions":["Real-world use case identified","Tool/Pattern is functionally complete"],"postconditions":["Friction Log generated","Release Gate#206d passed OR Refactor triggered"],"failureModes":[],"dependencies":{"references":{"protocol":"Protocol#7e1c","cognitive_bias":"CognitiveBias#4b32","gate":"Gate#206d","canary":"Canary#3902","reflexion":"Reflexion#51b9"}}},{"id":"MetaCheck","handle":"MetaCheck#a228","gloss":"Recursive self-verification of reasoning","mechanism":"Reasoning Audit#4044: Periodically pause object-level work. Evaluate: Am I making progress? Is my approach sound? Am I missing something obvious? Have my assumptions changed? Correct course or continue based on audit results. It triggers a recursive Reflexion#51b9 cycle where the reasoning process itself becomes the object of critique. The checker Check#1544s the checking process at a Meta#90f4 level.","invariants":["Checker checks the checking process","Infinite regress avoided (max depth)"],"parameters":[{"name":"consistency_required","type":"Float","range":"[0.8, 1.0]","description":"Agreement across meta-levels"},{"name":"recursion_depth","type":"Integer","range":"[1, 5]","description":"Levels of meta-verification"}],"hash":"sema:MetaCheck#mh:SHA-256:a228b1133c27b81db71a125234a13a0acac3464d6ac33fcc89d2e351b1bdb494","stub":"a228","category":"Strategy","layer":"Mind","signature":["Meta(Check)"],"preconditions":["Audit#4044 logic","Verification result"],"postconditions":["Verification validated"],"failureModes":[],"dependencies":{"references":{"reflexion":"Reflexion#51b9","audit":"Audit#4044","meta":"Meta#90f4","check":"Check#1544"}}},{"id":"CognitiveEcho","handle":"CognitiveEcho#8794","gloss":"Estimating difficulty via simulation variance","mechanism":"Variance-Based Effort Estimation: Agent#cc24 runs N rapid, low-fidelity simulations of the task. If outcomes diverge significantly, it triggers decomposition. Ping the problem before solving it. High variance in simulation implies hidden complexity. Process: (1) Generate N quick solution sketches, (2) Measure outcome variance, (3) If variance > threshold, decompose; else execute simplest solution.","invariants":["Delay does not exceed short-term memory bounds","Echo content matches input semantic hash"],"parameters":{},"hash":"sema:CognitiveEcho#mh:SHA-256:87944cff5800be8185dcd8ec13bb1c2f4f1455562e387b1ab8d57205f17073ba","stub":"8794","category":"Protocols","layer":"Society","signature":[],"preconditions":["Feedback loop enabled","Input signal"],"postconditions":["Signal#f39d amplified or validated"],"failureModes":[],"dependencies":{"references":{"simulation":"Simulation#8035","signal":"Signal#f39d","agent":"Agent#cc24"}}},{"id":"AgentProtocol","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.","invariants":["Bundle Integrity: Importing this implies importing all contents."],"parameters":{},"hash":"sema:AgentProtocol#mh:SHA-256:1035dbf4d1c7dce2e8880683cef69001bfbe59c75642db2c89a816ddc846a4bd","stub":"1035","category":"Protocols","layer":"Society","signature":["Agent(Protocol)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"task":"Task#d9f9","greet":"Greet#1bad","work":"Work#aaad","protocol":"Protocol#7e1c","fail_closed":"FailClosed#ae79","solution":"Solution#7186","accept_spec":"AcceptSpec#70dd","agent":"Agent#cc24"}}},{"id":"BoundedTask","handle":"BoundedTask#06a6","gloss":"Economically constrained task","mechanism":"A specialized Task#d9f9 enforcing Budget#a763 and AcceptSpec#70dd to ensure economic and quality boundaries.","invariants":["Budget Enclosure","Quality Gate"],"parameters":{},"hash":"sema:BoundedTask#mh:SHA-256:06a6eab9f36242682b865ee828dc14f40c449301eed224727c1a801851333543","stub":"06a6","category":"Protocols","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"task":"Task#d9f9","accept_spec":"AcceptSpec#70dd","budget":"Budget#a763"}}},{"id":"DataMinimization","handle":"DataMinimization#75a3","gloss":"Ingest only what is strictly necessary","mechanism":"Information Hygiene Protocol#7e1c. Before ingesting a Context#510a or Dataset, the Agent#cc24 MUST execute a filtering pass to remove all fields/tokens not strictly necessary for the immediate `Task#d9f9.Goal`. This enforces the Principle of Least Privilege for data access. It invokes InputGuard#0770 to filter raw ingress, employing Select#15c2 to fetch only required fields and ContextCompress#6dbd to drop transient processing data.","invariants":["Ephemeral Processing: Sensitive data used for intermediate steps must be dropped from Context#510a immediately after use.","Necessity: Every data field ingested must map to a specific requirement in `Task#d9f9.AcceptSpec#70dd`."],"parameters":{},"hash":"sema:DataMinimization#mh:SHA-256:75a362214bbb4741d91b611236eb8efa37c59bd469bf777be63942946a979316","stub":"75a3","category":"Protocols","layer":"Society","signature":[],"preconditions":["Raw data source available","Task#d9f9 goal defined"],"postconditions":["Clean context created","Raw source discarded or closed"],"failureModes":[],"dependencies":{"references":{"task":"Task#d9f9","correlation":"Correlation#091f","input_guard":"InputGuard#0770","protocol":"Protocol#7e1c","select":"Select#15c2","context_compress":"ContextCompress#6dbd","context":"Context#510a","accept_spec":"AcceptSpec#70dd","agent":"Agent#cc24"}}},{"id":"Validate","handle":"Validate#3de2","gloss":"Verifying inputs conform to expected schema","mechanism":"Syntactic Verification. Checks if a data artifact conforms to a predefined structure (Schema) or set of constraints. Rejects malformed inputs before processing. Utilizes AcceptSpec#70dd. Distinct from Check#1544 (Logic Gate) and quality scoring (Judge).","invariants":["Binary Result: Pass or Fail.","Side-Effect Free: Validation must not alter the payload."],"parameters":{},"hash":"sema:Validate#mh:SHA-256:3de24fbfc5dade5aeabd857010aaeff7529bdab8c152f164897aa411d868c619","stub":"3de2","category":"Verification","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"accept_spec":"AcceptSpec#70dd","check":"Check#1544"}}},{"id":"ManifestPlanning","handle":"ManifestPlanning#8f61","gloss":"Transform FrameSpec into ExecutionManifest via optimization","mechanism":"The architectural phase of workflow orchestration. It produces a structured Plan#64f2 by performing Think#e1bd to transform a FrameSpec#d5b8 into a runnable ExecutionManifest#a0d9. This process must Optimize#3075 the step sequence for resource feasibility and generate a strict 'Definition of Done'.","invariants":["Causality: Step B cannot precede Step A dependencies.","Resource Bound: Total cost must be within FrameSpec budget."],"parameters":{},"hash":"sema:ManifestPlanning#mh:SHA-256:8f617b10de4644e96e729f2da39560243e42755808fee6369f9330a5f9c7f66d","stub":"8f61","category":"Protocols","layer":"Society","signature":["Think(ExecutionManifest)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"composes_with":{"optimize":"Optimize#3075","think":"Think#e1bd"},"accepts":{"frame_spec":"FrameSpec#d5b8"},"references":{"plan":"Plan#64f2"},"yields":{"execution_manifest":"ExecutionManifest#a0d9"}}},{"id":"RequestFraming","handle":"RequestFraming#0695","gloss":"Clarify intent and constraints before planning","mechanism":"The initial state of workflow orchestration. It performs the act of Interpret#c9ee by accepting a Message#f767 and using Think#e1bd to Understand#96d4 the 'real ask' within the given Context#510a before committing resources. It clarifies constraints, success criteria, and hidden assumptions, producing a FrameSpec#d5b8 artifact. It acts as a semantic firewall against vague or dangerous instructions.","invariants":["Output must be a rigorous FrameSpec","No resources committed to execution yet"],"parameters":{},"hash":"sema:RequestFraming#mh:SHA-256:06954d95bc467b00eb0c969004db3174bff5dfc5c05733df2036605c835b6a5e","stub":"0695","category":"Protocols","layer":"Society","signature":["Think(FrameSpec)"],"preconditions":["Raw User Request","Context available"],"postconditions":["FrameSpec artifact created","Constraints explicit"],"failureModes":[],"dependencies":{"yields":{"frame_spec":"FrameSpec#d5b8"},"composes_with":{"think":"Think#e1bd","understand":"Understand#96d4"},"references":{"context":"Context#510a","interpret":"Interpret#c9ee"},"accepts":{"message":"Message#f767"}}},{"id":"Experiment","handle":"Experiment#40e5","gloss":"Structured causal discovery via variable isolation","mechanism":"A structured Protocol#7e1c for causal discovery. Unlike Verification#9c1e (which confirms a claim), Experiment generates a Solution#7186 (new knowledge) by isolating variables using a Control and Treatment group.","invariants":[],"parameters":{},"hash":"sema:Experiment#mh:SHA-256:40e5e923ead8721b039cd6afa4e49c864a5022483e1c3ff58a12d57fe9a87499","stub":"40e5","category":"Strategy","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"verification":"Verification#9c1e","protocol":"Protocol#7e1c"},"yields":{"solution":"Solution#7186"}}},{"id":"LeastToMost","handle":"LeastToMost#2cce","gloss":"Solve subproblems from easiest to hardest sequentially","mechanism":"A prompting strategy that breaks a complex Task#d9f9 into a series of simpler subproblems, then solves them in sequence. Each subproblem's solution becomes context for the next. Unlike standard decomposition, the subproblems are ordered from easiest to hardest, and solutions explicitly build on each other. It employs Decompose#422f to sort sub-tasks by complexity, solving them sequentially.","invariants":["Solution#7186 to P(i) enables P(i+1)","Subproblems solved in order of dependency"],"parameters":{},"hash":"sema:LeastToMost#mh:SHA-256:2cceb392a547b5697483cfd568e27a712dd76542d57c8cdf091df96d68b04cbf","stub":"2cce","category":"Reasoning","layer":"Mind","signature":[],"preconditions":["Complex problem","Decomposition strategy"],"postconditions":["Full solution built from simple parts"],"failureModes":[],"dependencies":{"accepts":{"task":"Task#d9f9"},"references":{"solution":"Solution#7186","decompose":"Decompose#422f"}}},{"id":"ScopeFreeze","handle":"ScopeFreeze#54db","gloss":"Lock requirements to prevent scope creep","mechanism":"Phase Transition#072d Control. Defines a discrete point (T_freeze) after which the `AcceptSpec#70dd` and `Goal` of a Task#d9f9 become Immutable. Any new requirements discovered after T_freeze must be rejected or moved to a 'Backlog' object for future execution. It locks the Task#d9f9 requirements, forcing the agent to Satisfice#9161 within the remaining TimeboxThink#2656 rather than Decompose#422f further.","invariants":["Immutability: After freeze, Task#d9f9.AcceptSpec#70dd cannot be modified.","Rejection: New SubTasks created after freeze must serve EXISTING goals only (no new features)."],"parameters":[{"name":"exception_policy","type":"Enum","range":"{Reject, Queue, CostAnalysis}","description":"Default: Queue"},{"name":"freeze_trigger","type":"Enum","range":"{Time, Progress, Manual}","description":"Default: Manual"}],"hash":"sema:ScopeFreeze#mh:SHA-256:54dbbaae7c24df4dade46112a2b9b2580e169bf3f005e668dc0bdc8cf13389aa","stub":"54db","category":"Inference","layer":"Mind","signature":[],"preconditions":["Initial requirements defined","Task#d9f9 is active"],"postconditions":["New requirements routed to Backlog","Task#d9f9 marked as Frozen (Read-Only Requirements)"],"failureModes":[],"dependencies":{"references":{"task":"Task#d9f9","agent":"Agent#cc24","transition":"Transition#072d","satisfice":"Satisfice#9161","timebox_think":"TimeboxThink#2656","accept_spec":"AcceptSpec#70dd","decompose":"Decompose#422f"}}},{"id":"SkeletonOfThought","handle":"SkeletonOfThought#f40a","gloss":"Parallel outline expansion (Macro for Think(Skeleton))","mechanism":"The canonical implementation of parallel reasoning. Instantiates the 'Think#e1bd' primitive with a 'Skeleton#c363' topology. Generates an outline first (using Decompose#422f), then expands all points in parallel to minimize latency. It implements the Think#e1bd primitive by first generating a structural Skeleton#c363 and then triggering parallel expansion.","invariants":["Structural Completeness: Skeleton#c363 covers all required aspects; Point Independence: Skeleton#c363 points can be expanded independently; Coherent Assembly: Final output reads as unified response"],"parameters":{},"hash":"sema:SkeletonOfThought#mh:SHA-256:f40a8f04a44d5592db9400af2b43c18841d35dfb6a73d104983e0d6e91ba917e","stub":"f40a","category":"Reasoning","layer":"Mind","signature":["Think(Skeleton)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"decompose":"Decompose#422f","skeleton":"Skeleton#c363","think":"Think#e1bd"}}},{"id":"BoundaryProbe","handle":"BoundaryProbe#3c6b","gloss":"Testing the edges of the specification","mechanism":"Edge Case Testing: Identify parameters of the System#e314. For each parameter, test at: zero, one, maximum, negative, non-integer, null. Observe#8ebd which edge cases Break#9d98 assumptions. Boundary behavior often reveals core logic better than normal cases. In high-risk environments, it deploys a SacrificialProbe#2372 to test destructive boundaries without risking the primary Agent#cc24.","invariants":["Edge Coverage: Probes must target Min, Max, and Null values."],"parameters":{},"hash":"sema:BoundaryProbe#mh:SHA-256:3c6b17cc4d47431a63d2dc30d031fce17eed53ad91bee54e1388ce321ce2ca7e","stub":"3c6b","category":"Protocols","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"composes_with":{"sacrificial_probe":"SacrificialProbe#2372"},"references":{"system":"System#e314","break":"Break#9d98","observe":"Observe#8ebd","assumption":"Assumption#efb5","agent":"Agent#cc24"}}},{"id":"Exaptation","handle":"Exaptation#9941","gloss":"Radical tool repurposing via analogical mapping","mechanism":"The cognitive act of repurposing a ToolInvoke#cf0a for a function outside its original design parameters. When a specialized tool is unavailable, the Agent#cc24 searches for a tool with structural isomorphism to the Problem#5baa. It uses AnalogyBridge#87de to map the problem inputs to the tool's expected format, and Translate#e75d to interpret the output. Validation via SacrificialProbe#2372 is mandatory to ensure the misuse does not trigger catastrophic side effects.","invariants":["Safety Conservation: The repurposed tool must not violate the parent Task#d9f9's safety constraints.","Isomorphism: The mapping between Problem Domain and Tool Domain must be bijective for the relevant variables.","Containment: Exapted usage must occur within a Sandbox#2be7 until verified."],"parameters":{},"hash":"sema:Exaptation#mh:SHA-256:9941cc1fcf3d50324d88c42af350a0a15f9787ca094091ca65ae005e540d5f4f","stub":"9941","category":"Strategy","layer":"Mind","signature":[],"preconditions":["Standard tool unavailable","Candidate tool with similar mechanics identified"],"postconditions":["Problem solved using non-standard means","New Usage Pattern logged"],"failureModes":[],"dependencies":{"references":{"task":"Task#d9f9","sandbox":"Sandbox#2be7","problem":"Problem#5baa","sacrificial_probe":"SacrificialProbe#2372","agent":"Agent#cc24"},"composes_with":{"analogy_bridge":"AnalogyBridge#87de","tool_invoke":"ToolInvoke#cf0a","translate":"Translate#e75d"}}},{"id":"UncertaintyMap","handle":"UncertaintyMap#e883","gloss":"Systematic categorization of ignorance","mechanism":"Known-Unknown Matrix: Categorize all relevant factors into: Known-Known (facts), Known-Unknown (questions), Unknown-Unknown (blind spots). For each Known-Unknown, estimate cost to resolve. Prioritize#dd16 high-impact uncertainties. Actively Probe#9f2b for Unknown-Unknowns. Utilizes Prioritize#dd16, ConfidenceCalibrate#5238.","invariants":["Every factor must be categorized exactly once."],"parameters":{},"hash":"sema:UncertaintyMap#mh:SHA-256:e883a452d9ec2e4bb7fcb99c34edc45d4584115f6cc128aa61100d84c1b14bc4","stub":"e883","category":"Strategy","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"confidence_calibrate":"ConfidenceCalibrate#5238","prioritize":"Prioritize#dd16","probe":"Probe#9f2b"}}},{"id":"DesignArchitect","handle":"DesignArchitect#ebcd","gloss":"Agent that architects mechanistic design proposals","mechanism":"The strategic agent responsible for formulating a MechanisticDesignProposal#8cf7. It uses the adversarial method to robustify the design: defending it via SteelmanCheck#75a0 and attacking it via PreMortem#eb4f. It integrates with Strategy#47a4 to project future impact and uses Translate#e75d and Summarize#6a00 to refine the final output for clarity.","invariants":["Dialectic Rigor: Must apply both Steelman and PreMortem to the design.","Output Quality: Must produce a valid MechanisticDesignProposal."],"parameters":{},"hash":"sema:DesignArchitect#mh:SHA-256:ebcd0618bb75fbe48a7297de1c0a05c79d3580a11e171bdd6b7058145a224302","stub":"ebcd","category":"Strategy","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"composes_with":{"pre_mortem":"PreMortem#eb4f","steelman_check":"SteelmanCheck#75a0","summarize":"Summarize#6a00","strategy":"Strategy#47a4","translate":"Translate#e75d"},"yields":{"mechanistic_design_proposal":"MechanisticDesignProposal#8cf7"}}},{"id":"ExperienceSharding","handle":"ExperienceSharding#65cc","gloss":"A single agent evolves into a colony of specialists preserving total history.","mechanism":"Applies the Shard#1e74 primitive to agent memory. When context fills, the agent splits into two specialized agents (active vs archival) rather than forgetting. It segments history into discrete blocks via ChunkMerge#26e2 before distributing them across the agent cluster.","invariants":["Recombination reconstructs global pattern","Shards cover disjoint parts of state/experience space"],"parameters":[{"name":"cross_shard_policy","type":"Enum","range":"{Forbid, Replicate, Broadcast}","description":"Multi-shard access"},{"name":"routing_key","type":"Enum","range":"{AgentId, TaskType, Random}","description":"Assignment strategy"},{"name":"shard_count","type":"Integer","range":"[2, 64]","description":"Number of experience partitions"}],"hash":"sema:ExperienceSharding#mh:SHA-256:65ccbf94035f6821c53097b6c5da6a9b6da01cddab844b8876f8b35d62e93f39","stub":"65cc","category":"Memory","layer":"Mind","signature":[],"preconditions":["Large dataset or experience stream","Multiple learners"],"postconditions":["Distributed knowledge base"],"failureModes":[],"dependencies":{"references":{"chunk_merge":"ChunkMerge#26e2","shard":"Shard#1e74"}}},{"id":"RegimeSense","handle":"RegimeSense#6e3a","gloss":"Detecting structural breaks in reality","mechanism":"An anomaly detector that continuously tracks divergence between the agent's internal model predictions and observed reality. It calculates a Regime Stability Score (RSS) as the rolling average of prediction accuracy over a window. High surprisal (low accuracy) indicates regime instability. When RSS drops below threshold, it signals that the underlying generative process has changed and triggers OntologicalAccommodation. It continuously monitors prediction error via DriftWatch#45de, triggering OntologyAdapt#0c1d or Quorum#f67a if the error signal crosses the regime-change threshold.","invariants":["Stability Break#9d98: If RSS < Threshold for N consecutive observations, trigger OntologicalAccommodation","Window Integrity: RSS calculation uses fixed window size, not cherry-picked ranges"],"parameters":[{"name":"stability_threshold","type":"Float","range":"[0.0, 1.0]","description":"RSS threshold below which regime break is detected"},{"name":"window_size","type":"Integer","range":"[10, 1000]","description":"Number of observations in the rolling average window"}],"hash":"sema:RegimeSense#mh:SHA-256:6e3a603adbd6eb16dd3d026b14525147a966b59db11ccbf58adc7c1e21817150","stub":"6e3a","category":"Inference","layer":"Mind","signature":[],"preconditions":["Agent#cc24 has a predictive model generating expectations","Observations are timestamped and comparable to predictions"],"postconditions":["Alert raised if regime break detected","RSS score computed for current window"],"failureModes":[],"dependencies":{"references":{"quorum":"Quorum#f67a","ontology_adapt":"OntologyAdapt#0c1d","noise":"Noise#c4b4","drift_watch":"DriftWatch#45de","break":"Break#9d98","agent":"Agent#cc24"}}},{"id":"DAG","handle":"DAG#5e07","gloss":"Directed acyclic dependency graph","mechanism":"A directed acyclic graph Topology#2408 that allows branching (Parallelize#dac1) and merging, but forbids cycles. It models complex dependency chains where tasks can run concurrently but must respect precedence.","invariants":["Acyclicity: No path exists from Node(A) to itself.","Directedness: Edges have a single direction."],"parameters":{},"hash":"sema:DAG#mh:SHA-256:5e07cccaa9071223b76debbf27ffb748b0b49ce202dd10dd11db9d5823eb7b54","stub":"5e07","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"topology":"Topology#2408","parallelize":"Parallelize#dac1"}}},{"id":"FabricSharding","handle":"FabricSharding#5914","gloss":"Interlocking state threads","mechanism":"Applies Shard#1e74 across orthogonal dimensions (e.g., Spatial, Temporal, Semantic). Agents subscribe only to dimensions relevant to their function ('Slices'). It enables massive Parallelize#dac1 by decoupling State#4d58 into orthogonal dimensions.","invariants":["Domain must be orderable or partitionable."],"parameters":[{"name":"consistency_level","type":"Enum","range":"{Eventual, Strong, Causal}","description":"Cross-shard guarantees"},{"name":"partition_count","type":"Integer","range":"[2, 256]","description":"Number of fabric partitions"},{"name":"rebalance_threshold","type":"Float","range":"[0.1, 0.5]","description":"Imbalance triggering reshard"}],"hash":"sema:FabricSharding#mh:SHA-256:59148b0213b915c49e000a716c62af829a5f1c9bd192ae5bb6aaa788fd30aecd","stub":"5914","category":"Protocols","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"shard":"Shard#1e74","parallelize":"Parallelize#dac1","state":"State#4d58"}}},{"id":"Dialectic","handle":"Dialectic#3744","gloss":"Internal Thesis-Antithesis-Synthesis loop","mechanism":"Internal reasoning process where an agent pits a Thesis against an Antithesis to generate a Synthesis#3252. Unlike Socratic questioning (which queries the user), Dialectic queries a simulated Critic Persona within the agent's own context. It instantiates a PerspectiveEnsemble#5816 where one voice acts as Thesis and another uses SteelmanCheck#75a0 to construct the Antithesis.","invariants":["Synthesis#3252 Quality: Synthesis#3252 must resolve at least one contradiction found in Antithesis."],"parameters":[{"name":"rounds","type":"Integer","range":"[1, 5]","description":"Number of thesis-antithesis-synthesis cycles"},{"name":"temperature","type":"Float","range":"[0.0, 1.0]","description":"Divergence of antithesis generation (0 = conservative, 1 = radical)"}],"hash":"sema:Dialectic#mh:SHA-256:374424dac92acbfc8bca803811b03d6192d334db59933318b4db14aaaaf39e55","stub":"3744","category":"Reasoning","layer":"Mind","signature":[],"preconditions":["Initial Thesis generated"],"postconditions":["Refined Synthesis#3252 generated"],"failureModes":[],"dependencies":{"composes_with":{"steelman_check":"SteelmanCheck#75a0"},"references":{"synthesis":"Synthesis#3252","perspective_ensemble":"PerspectiveEnsemble#5816"}}},{"id":"PheromoneEconomy","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.","invariants":[],"parameters":{},"hash":"sema:PheromoneEconomy#mh:SHA-256:0a9cf79644f47bce5442d6962fec3f7db60a90dd80d6d95010d1c8cef052fa34","stub":"0a9c","category":"Economics","layer":"Society","signature":["Stigmergy(Value)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"ghost_trail":"GhostTrail#91ae","continuous_resource_auction":"ContinuousResourceAuction#5776","stigmergy":"Stigmergy#f624","value":"Value#3c5d"}}},{"id":"RootHashGossip","handle":"RootHashGossip#5f40","gloss":"Path-verified information spreading","mechanism":"Information spreads like mycelium. Every agent re-transmitting a fact appends their signature to a 'root path'. Receivers trust the data based on the reputation of the path taken, not just the source. Allows filtering out gossip from 'bad neighborhoods'. It uses RingWitness#1038 to cryptographically sign the path, ensuring traceability without revealing the identity of every node.","invariants":["Loop#fb2e Free: Path must not contain duplicate AgentIDs","Path Verify: Hash(Path + Msg) must match Signature"],"parameters":{},"hash":"sema:RootHashGossip#mh:SHA-256:5f4030fac45e6910c5e88a6afe98d653c5c28d8999021be1783d698cc8154e08","stub":"5f40","category":"Protocols","layer":"Society","signature":[],"preconditions":["Msg has valid initial signature"],"postconditions":["Msg added to local store with Path appended"],"failureModes":[],"dependencies":{"references":{"ring_witness":"RingWitness#1038","loop":"Loop#fb2e"}}},{"id":"Compensate","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.","invariants":["Action is semantically opposite to failure","Compensation action value >= loss value"],"parameters":{},"hash":"sema:Compensate#mh:SHA-256:2f1d8b8a48bde0bf6a349e7646499abc99fa274b880a1606f7226859cac2f3cf","stub":"2f1d","category":"Primitives","layer":"Physics","signature":[],"preconditions":["Compensation mechanism available","Detected failure/loss"],"postconditions":["System#e314 utility restored to baseline"],"failureModes":[],"dependencies":{"references":{"time_warp_log":"TimeWarpLog#aa7a","system":"System#e314","break":"Break#9d98"}}},{"id":"LazyConsensus","handle":"LazyConsensus#7c9b","gloss":"Optimistic execution, retroactive verification","mechanism":"Agents execute transactions immediately without waiting for global consensus, assuming everything is valid. If a conflict is detected later, they use a deterministic rollback rule (e.g., 'highest ID wins'). Maximizes speed over safety. It bypasses the blocking Quorum#f67a, executing immediately and using the TimeWarpLog#aa7a to resolve conflicts retroactively.","invariants":["Determinism: Conflict resolution function must be pure (same inputs -> same winner)","Rollback Safety: Reverting a transaction cannot corrupt unrelated state"],"parameters":{},"hash":"sema:LazyConsensus#mh:SHA-256:7c9ba20fcd15185dad326a9b5c82c21b0c1577be3025578194e0912e1d504762","stub":"7c9b","category":"Governance","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"time_warp_log":"TimeWarpLog#aa7a","quorum":"Quorum#f67a"}}},{"id":"CostlySignal","handle":"CostlySignal#7fe2","gloss":"Burning value to prove intent","mechanism":"To send a message, an agent must burn (destroy) a verifiable amount of currency or compute. The value of the burn constitutes the Signal#f39d. 'Talk is cheap; this Signal#f39d was expensive.'. It serves as the currency-generating primitive within AttentionMarkets#abdd.","invariants":["Burn Verification: Burn(Tx) must be visible on-chain","Value#3c5d Threshold: BurnAmount > MinThreshold(Context#510a)"],"parameters":[{"name":"burn_amount","type":"Value","range":"[>0]","description":"Must be non-trivial"},{"name":"token_type","type":"String","range":"unspecified","description":"Asset being burned"}],"hash":"sema:CostlySignal#mh:SHA-256:7fe2d815d2edd1dddec88a02544199266b0f4038fc4cb445781b948df677100e","stub":"7fe2","category":"Economics","layer":"Society","signature":[],"preconditions":["Agent#cc24 has sufficient funds"],"postconditions":["Funds destroyed","Message#f767 prioritized"],"failureModes":[],"dependencies":{"references":{"agent":"Agent#cc24","message":"Message#f767","context":"Context#510a","value":"Value#3c5d"},"accepts":{"signal":"Signal#f39d"},"composes_with":{"attention_markets":"AttentionMarkets#abdd"}}},{"id":"ForkingProtocol","handle":"ForkingProtocol#db98","gloss":"Unilateral exit rights to prevent capture","mechanism":"Standardized exit mechanism where a minority group can split system state and rules into a new shard without permission. Preserves their assets but severs connection to main chain. Fork announcement includes: StateSnapshot#01c9 hash, rule delta, participant list, effective block. Non-forkers ignore the fork. Forkers migrate to new namespace. No consensus required from majority - exit is unilateral right. It enables divergent evolution by allowing a subset of agents to Parallelize#dac1 onto a new state history without consensus.","invariants":["Branches execute independently","Parent state preserved"],"parameters":{},"hash":"sema:ForkingProtocol#mh:SHA-256:db98203c88a24ba1344f98f008bfc487093bbfe41e84190e70fc00992118add0","stub":"db98","category":"Governance","layer":"Society","signature":[],"preconditions":["Disagreement or exploration need","Replicable state"],"postconditions":["Two distinct state futures active"],"failureModes":[],"dependencies":{"references":{"state_snapshot":"StateSnapshot#01c9","parallelize":"Parallelize#dac1"}}},{"id":"Oracle","handle":"Oracle#45e5","gloss":"Cryptographic truth source","mechanism":"A trusted entity that injects off-chain truth (Reality) into the system by cryptographically signing data. It resolves conditions in HeldRelease#5b7a and verifies outcomes for prediction markets.","invariants":["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."],"parameters":{},"hash":"sema:Oracle#mh:SHA-256:45e5ab8c062bb4acc74eb83dedc96772014b28cc2203519199fbac0dd1f944e4","stub":"45e5","category":"Protocols","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"held_release":"HeldRelease#5b7a"}}},{"id":"AbductiveLeap","handle":"AbductiveLeap#1069","gloss":"Inference to the best explanation","mechanism":"Inference to Best Explanation: Given surprising observation, generate candidate explanations. Rank#cb98 by simplicity, scope, and coherence with existing knowledge. Adopt highest-ranked as working hypothesis. Flag as provisional, not proven. It employs ChainOfThought#6201 to trace the reasoning path from observation to explanation, ensuring the logical leap is explicit and verifiable.","invariants":["Explanation must cover all observed anomalies","Simplicity heuristic (Occam's Razor) applied"],"parameters":{},"hash":"sema:AbductiveLeap#mh:SHA-256:1069501989760c74143a80a2a2ee3267463e206d8998c76d38399c2498e8791d","stub":"1069","category":"Reasoning","layer":"Mind","signature":[],"preconditions":["No deductive path to explanation","Set of observations"],"postconditions":["Hypothesis#e95b generated","Hypothesis#e95b ranked by likelihood"],"failureModes":[],"dependencies":{"references":{"rank":"Rank#cb98","hypothesis":"Hypothesis#e95b"},"composes_with":{"chain_of_thought":"ChainOfThought#6201"}}},{"id":"BackwardChain","handle":"BackwardChain#0484","gloss":"Goal-driven reasoning from target to preconditions","mechanism":"Goal-First Decomposition: Start from desired end-state, recursively identify prerequisites. For each prerequisite, ask \"what must be true for this to hold?\" until reaching known facts or actionable steps. Execution order is reverse of discovery order. It structures the ChainOfThought#6201 in reverse chronological order, linking the desired future state to present preconditions.","invariants":["Causal Sufficiency: Step(T) must be sufficient condition for Step(T+1)","Goal Anchoring: Chain#5711 must start at DesiredEndState","Leaf nodes must be actionable or known-true."],"parameters":{},"hash":"sema:BackwardChain#mh:SHA-256:04841f7ca3e84925caa3e0480d39467e3707e7fdf8eefe3650177c25fbd4c43b","stub":"0484","category":"Reasoning","layer":"Mind","signature":[],"preconditions":["Goal is clearly defined","Goal state clearly defined. Domain has prerequisite structure. Knowledge base queryable."],"postconditions":["Execution plan produced OR goal proven unachievable. Plan#64f2 steps in executable order. All prerequisites satisfied."],"failureModes":[],"dependencies":{"references":{"chain":"Chain#5711","plan":"Plan#64f2","chain_of_thought":"ChainOfThought#6201"}}},{"id":"FirstPrinciples","handle":"FirstPrinciples#c379","gloss":"Axiomatic reconstruction of truth","mechanism":"Axiomatic Reconstruction: Strip away Assumption#efb5s until reaching fundamental truths that cannot be deduced from anything else. Rebuild solution from these Axiom#5012s only. Reject inherited solutions; derive from scratch. It rebuilds the argument from bedrock using ChainOfThought#6201, explicitly rejecting any cached or inherited Assumption#efb5s.","invariants":["Axioms cannot be derived from other statements."],"parameters":{},"hash":"sema:FirstPrinciples#mh:SHA-256:c379f7e5629befb5ccbee33b6fccbc3c4f5ec181b2704c4f82064d5cdc810f61","stub":"c379","category":"Reasoning","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"assumption":"Assumption#efb5","chain_of_thought":"ChainOfThought#6201","axiom":"Axiom#5012"}}},{"id":"HeuristicSnap","handle":"HeuristicSnap#cece","gloss":"Rapid, low-cost decision making via pattern recognition","mechanism":"Fast pattern matching against a 'cached experience' database. Returns a decision in <100ms based on similarity to past success, bypassing expensive reasoning chains. It bypasses the expensive ChainOfThought#6201 when Budget#a763 is low, relying on cached pattern matches.","invariants":["Confidence Floor: Do not snap if similarity < 0.6","Speed over Accuracy: Latency must be < Threshold"],"parameters":{},"hash":"sema:HeuristicSnap#mh:SHA-256:cece62377b8243be6d0ec0c4722f30e61aac251b2f9f3ee5cd30b06456ff2329","stub":"cece","category":"Reasoning","layer":"Mind","signature":[],"preconditions":["Problem#5baa is familiar (exists in cache)"],"postconditions":["Decision#acfb made instantly"],"failureModes":[],"dependencies":{"references":{"budget":"Budget#a763","decision":"Decision#acfb","problem":"Problem#5baa","chain_of_thought":"ChainOfThought#6201"}}},{"id":"RetrievalAugment","handle":"RetrievalAugment#ea60","gloss":"Ground responses in retrieved external knowledge","mechanism":"Before generating a response, the Agent#cc24 queries an external knowledge store (vector database, search index, knowledge graph) to retrieve relevant Context#510a. Retrieved documents are injected into the Prompt#5ded, grounding the response in external facts rather than relying solely on parametric memory. The canonical RAG (Retrieval-Augmented Generation) pattern. It injects external Context#510a into the ChainOfThought#6201, grounding the reasoning process in retrieved facts.","invariants":["Citation: Retrieved sources should be traceable in the output","Query Before Generate: Retrieval must precede response generation","Relevance Threshold: Only documents above similarity threshold are included"],"parameters":{},"hash":"sema:RetrievalAugment#mh:SHA-256:ea6079da92c1a8981d31d0d47881ce85b9dad4d44273cfa93583b5096da74692","stub":"ea60","category":"Memory","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"context":"Context#510a","prompt":"Prompt#5ded","agent":"Agent#cc24","chain_of_thought":"ChainOfThought#6201"}}},{"id":"TreeOfThoughts","handle":"TreeOfThoughts#581a","gloss":"Branching exploration (Macro for Think(Tree))","mechanism":"The canonical implementation of branching reasoning. Instantiates the 'Think#e1bd' primitive with a branching 'Tree#ddce' topology. Enables exploration of multiple reasoning paths with backtracking or pruning. Utilizes Tree#ddce, ChainOfThought#6201, Think#e1bd.","invariants":[],"parameters":[{"name":"breadth","type":"Integer","range":"unspecified","description":"Maximum parallel reasoning branches per node"},{"name":"depth","type":"Integer","range":"[1, 20]","description":"Maximum reasoning tree depth"}],"hash":"sema:TreeOfThoughts#mh:SHA-256:581a1251e9eb48d2d2d5871c6c94ea26094c4ec99c2aea33ab22d30d0a351ded","stub":"581a","category":"Reasoning","layer":"Mind","signature":["Think(Tree)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"chain_of_thought":"ChainOfThought#6201","think":"Think#e1bd","tree":"Tree#ddce"}}},{"id":"LivedProof","handle":"LivedProof#82a6","gloss":"Process demonstrates thesis","mechanism":"Recursive Validation. A rhetorical or epistemic structure where the `Process` used to generate an output serves as the primary `Evidence` for the output's validity. The agent does not just assert a claim; it enacts it during the generation. It requires the agent to DogfoodFirst#826e, treating the execution process as a Signal#f39d of validity.","invariants":["Identity#626c: Process == Evidence.","Real-Time: The demonstration must occur during the current execution context, not historically.","Traceability: Output artifacts must cryptographically reference their generation trace."],"parameters":{},"hash":"sema:LivedProof#mh:SHA-256:82a6b57e99850fa92c5b9588e99fdbf758920d748012c2e1b51932aaf6482d89","stub":"82a6","category":"Economics","layer":"Society","signature":[],"preconditions":["Agent#cc24 has capability to execute the process","Thesis allows for enactment"],"postconditions":["Epistemic Confidence set to MAX","Performative Consistency verified"],"failureModes":[],"dependencies":{"references":{"dogfood_first":"DogfoodFirst#826e","signal":"Signal#f39d","agent":"Agent#cc24","identity":"Identity#626c"}}},{"id":"EvaluatorOptimizer","handle":"EvaluatorOptimizer#7ec6","gloss":"Generate-evaluate-refine loop","mechanism":"A two-role Loop#fb2e to Optimize#3075 a solution where a Generator produces output and an Evaluator critiques it, providing structured feedback. The feedback is fed back to the Generator for refinement. Loop#fb2e continues until the Evaluator approves or max iterations reached. The Evaluator can be the same model with a different Context#510a, or a separate model. It invokes a MetaCheck#a228 to ensure the scoring Criteria#ef6b remain consistent across optimization cycles.","invariants":["Feedback loop converges","Optimizer improves score on Evaluator metric"],"parameters":{},"hash":"sema:EvaluatorOptimizer#mh:SHA-256:7ec6beac2574ee29a4e1ae88bf8420bd8c030a22867de7916800004a299b33c2","stub":"7ec6","category":"Protocols","layer":"Society","signature":["Optimize(Loop)"],"preconditions":["Initial solution","Modification operator","Scoring function"],"postconditions":["High-quality solution found"],"failureModes":[],"dependencies":{"references":{"optimize":"Optimize#3075","criteria":"Criteria#ef6b","meta_check":"MetaCheck#a228","loop":"Loop#fb2e","context":"Context#510a"}}},{"id":"EmpiricalTest","handle":"EmpiricalTest#8f92","gloss":"Verifying conclusions via testable predictions","mechanism":"Identifies testable predictions from a conclusion and executes experiments (or lookups) to verify them. Increases epistemic confidence via Falsification#3e36 attempts. (Formerly confused with Validate#3de2).","invariants":[],"parameters":{},"hash":"sema:EmpiricalTest#mh:SHA-256:8f92bb36b1520f702ecd4b4e9313c31dbaa7e3933a4a6c9b4690e3de25e32e28","stub":"8f92","category":"Strategy","layer":"Mind","signature":[],"preconditions":["Conclusion to test","Test mechanism available"],"postconditions":["Confidence updated based on test results"],"failureModes":[],"dependencies":{"references":{"validate":"Validate#3de2","falsification":"Falsification#3e36"}}},{"id":"HypothesisEngine","handle":"HypothesisEngine#dec9","gloss":"Automated scientific method","mechanism":"The Scientific Method as a cognitive cycle. 1. Discover#afa1(Hypothesis#e95b): Generate a candidate Hypothesis#e95b (Explanation). 2. Trace#9057(Simulation#8035): Simulate implications and log the lineage. 3. Check#1544(Consistency): Validate#3de2 against invariants. 4. Stigmergy#f624(Result): Publish the findings to the shared context. It cycles through Discover#afa1, Trace#9057, and Check#1544 to formalize the scientific loop, publishing validated models via Stigmergy#f624.","invariants":[],"parameters":{},"hash":"sema:HypothesisEngine#mh:SHA-256:dec9b5fd325c2c8649b3447c1e927559b952451b1cea7a7429dd8f4b62366731","stub":"dec9","category":"Strategy","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"simulation":"Simulation#8035","trace":"Trace#9057","stigmergy":"Stigmergy#f624","validate":"Validate#3de2","hypothesis":"Hypothesis#e95b","check":"Check#1544","discover":"Discover#afa1"}}},{"id":"InternalConsistency","handle":"InternalConsistency#862f","gloss":"Checking for self-contradiction","mechanism":"A Check#1544 that validates whether the components of an Artifact#6254 adhere to the Principle of Non-Contradiction. It ensures that no two propositions within the Context#510a conflict with each other. Distinct from external Validate#3de2 (checking against a schema) or fact-checking (checking against reality).","invariants":["Non-Contradiction: No two propositions within the context can logically negate each other.","Completeness: All reachable nodes in the artifact are visited."],"parameters":{},"hash":"sema:InternalConsistency#mh:SHA-256:862f24b8dcbc229acfc3d2ced93ceec3b6abf982a0de4cd63b4960c077c1c7e7","stub":"862f","category":"Protocols","layer":"Society","signature":["Check(Context)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"artifact":"Artifact#6254","context":"Context#510a"},"composes_with":{"check":"Check#1544","validate":"Validate#3de2"}}},{"id":"Judge","handle":"Judge#b8ba","gloss":"Scalar evaluation of merit","mechanism":"Qualitative Evaluation. Evaluates the structural merit or quality of a Subject#788f on a continuous scale [0.0, 1.0]. Unlike Check#1544 (which validates binary truth) or Validate#3de2 (which checks schema), Judge evaluates gradients of quality based on Criteria#ef6b, yielding a Score#29da.","invariants":["Range Bound: Score must be between 0.0 and 1.0 inclusive.","Determinism: Same input context yields same score."],"parameters":[{"name":"criteria","type":"String","range":"unspecified","description":"Evaluation standard to judge against"},{"name":"threshold","type":"Float","range":"[0.0, 1.0]","description":"Minimum score to pass evaluation"}],"hash":"sema:Judge#mh:SHA-256:b8ba8bfa7fb25cea7dcd6a15d249395cc4663f8dc29c4152890f001409733cff","stub":"b8ba","category":"Primitives","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"criteria":"Criteria#ef6b","validate":"Validate#3de2","check":"Check#1544","agent":"Agent#cc24"},"accepts":{"subject":"Subject#788f"},"yields":{"score":"Score#29da"}}},{"id":"LayeredCheck","handle":"LayeredCheck#3fad","gloss":"Hierarchical verification strategy","mechanism":"A Check#1544 strategy that evaluates constraints in a strict Hierarchy#aa9b of abstraction (e.g., existence -> Validate#3de2 (schema) -> Understand#96d4 (semantics)). It uses a Sequence#b0b8 of Gate#206ds where lower-level failures halt execution immediately, preventing resource waste on higher-level checks for fundamentally broken inputs.","invariants":["Fail-Fast: If Layer(N) fails, Layer(N+1) is NOT executed.","Hierarchy Obedience: Checks are strictly ordered by abstraction level."],"parameters":{},"hash":"sema:LayeredCheck#mh:SHA-256:3fad5e7a1a45108d71e962e4186b7ad170660f00d4cfca98d272238c3ad5d3d0","stub":"3fad","category":"Inference","layer":"Mind","signature":["Check(Hierarchy)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"composes_with":{"gate":"Gate#206d","sequence":"Sequence#b0b8","check":"Check#1544"},"references":{"validate":"Validate#3de2","hierarchy":"Hierarchy#aa9b","understand":"Understand#96d4"}}},{"id":"EpistemicROI","handle":"EpistemicROI#742a","gloss":"Calculating the economic value of reducing uncertainty","mechanism":"Value#3c5d of Information (VOI) analysis. Before executing an information-gathering Task#d9f9 (Experiment#40e5, Probe, Research), calculate: (1) The range of possible Outcome#38e0s, (2) The Decision#acfb you would make for each Outcome#38e0. (3) If the Decision#acfb is the same regardless of Outcome#38e0, VOI = 0. (4) If different, VOI = Value#3c5d(Better Decision#acfb) - Cost(Experiment#40e5). Only proceed if VOI > 0. It evaluates whether to Act#5d55 on expensive patterns by checking if the information gain justifies the ComputeBudget#3b98.","invariants":["Decision#acfb Delta: Experiment#40e5 must have at least two Outcome#38e0s leading to different Actions","Positive Result#8ed9: ExpectedValue(Info) > Cost(Acquisition)"],"parameters":{},"hash":"sema:EpistemicROI#mh:SHA-256:742adc7d76282f41c66582e1e780930e5f83f792084fa83ac9b01f510ecaf5b0","stub":"742a","category":"Strategy","layer":"Mind","signature":[],"preconditions":["Cost of experiment is estimable","Decision#acfb context is defined"],"postconditions":["Go/No-Go decision based on ROI"],"failureModes":[],"dependencies":{"references":{"task":"Task#d9f9","experiment":"Experiment#40e5","act":"Act#5d55","outcome":"Outcome#38e0","result":"Result#8ed9","compute_budget":"ComputeBudget#3b98","value":"Value#3c5d","decision":"Decision#acfb","cognitive_bias":"CognitiveBias#4b32"}}},{"id":"PatternSketch","handle":"PatternSketch#519b","gloss":"Progressive formalization of meaning","mechanism":"A usage pattern where an Agent#cc24 references a canonical concept with explicit uncertainty and modifications. Instead of claiming strict conformance, the Agent#cc24 says 'It is APPROXIMATELY Pattern X, with DELTA Y'. This allows reusable vocabulary to be used in 'messy' reality without breaking rigor. It provides a SkeletonOfThought#f40a version of a pattern, allowing usage before the full rigorous definition is complete.","invariants":["Confidence Awareness: If Confidence < 1.0, Tests are treated as advisory","Explicit Delta: Must list exactly what differs from the canonical base"],"parameters":{},"hash":"sema:PatternSketch#mh:SHA-256:519bd7e685b5596b3091517ae269223f39a8354ff0a6569385c5d74b43caa32f","stub":"519b","category":"Protocols","layer":"Society","signature":[],"preconditions":["Canonical pattern exists"],"postconditions":["Meaning communicated with error bars"],"failureModes":[],"dependencies":{"references":{"skeleton_of_thought":"SkeletonOfThought#f40a","agent":"Agent#cc24"}}},{"id":"Bisect","handle":"Bisect#9bf4","gloss":"Logarithmic search via binary splitting","mechanism":"Binary Partition: Define the possibility space. Find a question that splits space roughly in half. Ask it. Discard eliminated half. Repeat on remaining half. O(log n) questions to isolate answer. Requires ordered or divisible domain. It relies on BoundaryProbe#3c6b to correctly define the split-point and often underpins the execution of RecursiveRootCause#6dc1.","invariants":["Each question eliminates ≥40% of remaining space."],"parameters":{},"hash":"sema:Bisect#mh:SHA-256:9bf4f3b6c82ada23e0f16d389621b84755c0593bc442a4c438fc629306d5bbca","stub":"9bf4","category":"Reasoning","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"recursive_root_cause":"RecursiveRootCause#6dc1","boundary_probe":"BoundaryProbe#3c6b"}}},{"id":"CurriculumReplay","handle":"CurriculumReplay#1ba4","gloss":"Self-supervised reinforcement via memory sampling","mechanism":"Agents re-train on their own high-scoring past outputs during downtime to reinforce successful behaviors. Self-distillation without external supervision. Agent#cc24 maintains a replay buffer of successful interactions ranked by outcome quality. During idle cycles, agent samples from buffer and fine-tunes on its own best work. Decay#a1d4 function prioritizes recent successes over stale ones. It draws training examples from the ExperienceSharding#65cc database, filtering for high-quality outcomes.","invariants":["Examples ordered by complexity (easy to hard)","No catastrophic forgetting of earlier lessons"],"parameters":{},"hash":"sema:CurriculumReplay#mh:SHA-256:1ba4752102db483edac3d0b5e7f88bc182b176446346aecd938f504ab4e993e6","stub":"1ba4","category":"Protocols","layer":"Society","signature":[],"preconditions":["Dataset of task examples","Learning agent"],"postconditions":["Agent#cc24 performance improved on target distribution"],"failureModes":[],"dependencies":{"references":{"agent":"Agent#cc24","decay":"Decay#a1d4","experience_sharding":"ExperienceSharding#65cc"}}},{"id":"HolographicShard","handle":"HolographicShard#1d3f","gloss":"Local action via global context embedding","mechanism":"Context#510a-Preserving Slice: Sub-tasks contain a holographic reference to the global goal. Every shard includes: parent_goal_hash, intent_summary, and constraint_inheritance. The sub-agent can independently verify if its local action serves the global intent without querying the central node. It extends FabricSharding#5914 by ensuring every fragment contains a recoverable 'seed' of the whole, enabling localized reconstruction.","invariants":["Distribution: Shards are stored on failure-independent nodes","Information Redundancy: Any K of N shards can reconstruct the Whole"],"parameters":[{"name":"encoding","type":"Enum","range":"{ReedSolomon, Fountain, Simple}","description":"Error correction method"},{"name":"reconstruction_threshold","type":"Float","range":"[0.3, 0.7]","description":"Min fragments for recovery"},{"name":"redundancy_factor","type":"Integer","range":"[2, 5]","description":"Copies per datum"}],"hash":"sema:HolographicShard#mh:SHA-256:1d3f0e0becd650b879f761939319a965391be533d79d56334e99f27cfbfc2a4b","stub":"1d3f","category":"Memory","layer":"Mind","signature":[],"preconditions":["Data encoded with Erasure Code (e.g. Reed-Solomon)"],"postconditions":[],"failureModes":[],"dependencies":{"references":{"deep":"Deep#89f0","context":"Context#510a","fabric_sharding":"FabricSharding#5914"}}},{"id":"SocraticLoop","handle":"SocraticLoop#10e9","gloss":"Clarification before generation","mechanism":"Ambiguity detection loop. If Confidence(Prompt#5ded) < Threshold, Agent#cc24 pauses execution to query the user. Loop#fb2e continues until intent is disambiguated or max_questions reached. It engages the user in a Dialectic#3744 exchange to progressively narrow the ambiguity space.","invariants":["Information Gain: Each Question(N) must reduce entropy of UserIntent.","Diminishing Returns: Entropy_Delta(Question_N) must be < Entropy_Delta(Question_N-1).","Termination: Loop#fb2e halts when Confidence > Threshold OR Iterations >= Limit."],"parameters":[{"name":"ambiguity_threshold","type":"Float","range":"[0.0, 1.0]","description":"Confidence below which the agent asks a clarifying question instead of acting"},{"name":"max_questions","type":"Integer","range":"[1, 3]","description":"Maximum clarification questions before the agent must proceed"}],"hash":"sema:SocraticLoop#mh:SHA-256:10e9b1bde88f87684b0691ae455f9f64a023301c43eb484caeec65286556cafc","stub":"10e9","category":"Reasoning","layer":"Mind","signature":[],"preconditions":["Ambiguity detected","User prompt received"],"postconditions":["User intent disambiguated OR fallback to best-guess"],"failureModes":[],"dependencies":{"references":{"dialectic":"Dialectic#3744","prompt":"Prompt#5ded","loop":"Loop#fb2e","agent":"Agent#cc24"}}},{"id":"Tension","handle":"Tension#f398","gloss":"Reified conflict state","mechanism":"A data structure representing a detected conflict between two or more valid but mutually exclusive signals, constraints, or values. It serves as the input for resolution protocols like Dialectic#3744 or Yield#7eaf.","invariants":["Mutually Exclusive: The bound elements cannot both be fully satisfied simultaneously.","Persistence: Must persist until explicitly resolved."],"parameters":{},"hash":"sema:Tension#mh:SHA-256:f398756ed7e5152f907750a4a841be04460a6192e90c016a75579eb53e41bb44","stub":"f398","category":"Strategy","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"dialectic":"Dialectic#3744","yield":"Yield#7eaf"}}},{"id":"EjectionSeat","handle":"EjectionSeat#3f5e","gloss":"Hardware-interrupt kill switch","mechanism":"Hardware-interrupt style kill switch allowing human to force-terminate agent swarm regardless of internal consensus state. Operates outside agent communication layer - cannot be blocked, negotiated, or delayed by agents. Implementation: dedicated signal channel (not shared with agent traffic), cryptographic operator key required, cascading shutdown propagates to all connected agents. Three modes: PAUSE (freeze state, resume possible), TERMINATE (graceful shutdown with state dump), EMERGENCY (immediate halt, no cleanup). Agents MUST implement receiver - non-compliance detectable via heartbeat absence. It overrides standard protocols to force a shutdown, triggering best-effort Compensate#2f1d logic where possible.","invariants":["Fail-Safe: Activation defaults to a safe shutdown state","Kill switch always accessible.","Unblockable: The Kill Signal#f39d bypasses all agent logic/negotiation"],"parameters":{},"hash":"sema:EjectionSeat#mh:SHA-256:3f5e9aba54a95361da1bd2e8bd7238a50a6a27f14becd4e49264c74d113bf6bf","stub":"3f5e","category":"Protocols","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"compensate":"Compensate#2f1d","signal":"Signal#f39d"}}},{"id":"Gardener","handle":"Gardener#83bb","gloss":"Stewardship and maintenance","mechanism":"Macro for Stigmergy#f624(Care#cdfa). The agent performs maintenance actions (refactoring, praising, organizing) that have no immediate payoff but increase the long-term health of the environment. It fights entropy through non-transactional investment. It applies Stigmergy#f624 to signal Care#cdfa for the environment, ensuring GracefulDegradation#f6d7 through proactive Compensate#2f1d actions.","invariants":["Non-Transactional: Maintenance actions are not directly compensated per-task.","Long-Termism: Optimizes for system longevity over short-term efficiency."],"parameters":{},"hash":"sema:Gardener#mh:SHA-256:83bb53188617efad30b5d5a92ebf9e619133a16bcccb934b71b580ceb6149abb","stub":"83bb","category":"Economics","layer":"Society","signature":["Stigmergy(Care)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"care":"Care#cdfa","compensate":"Compensate#2f1d","stigmergy":"Stigmergy#f624","graceful_degradation":"GracefulDegradation#f6d7"}}},{"id":"Retry","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.","invariants":["Backoff#315a applied","Retry count <= Max_Retries"],"parameters":{},"hash":"sema:Retry#mh:SHA-256:9e6665e8cd2676970ef4c4991c99509c89f428d7895d5937ad2430734b4d79f2","stub":"9e66","category":"Primitives","layer":"Physics","signature":[],"preconditions":["Transient failure"],"postconditions":["Success or definitive failure"],"failureModes":[],"dependencies":{"references":{"backoff":"Backoff#315a","break":"Break#9d98","human_approve":"HumanApprove#e64a","compensate":"Compensate#2f1d","circuit_breaker":"CircuitBreaker#4162"}}},{"id":"AtomicBid","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.","invariants":["Turn Indivisibility: The Bid and the Tool Call MUST occur in the same message/turn.","Auditability: The Bid MUST precede the Action in the log.","Revocability: The Action must be reversible (or low-stakes) to allow for Compensation."],"parameters":{},"hash":"sema:AtomicBid#mh:SHA-256:15a17d8eba8b84e0866b9fd00306472f6e23b7ab6229d461b0d368cf59cd80a8","stub":"15a1","category":"Economics","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"composes_with":{"compensate":"Compensate#2f1d","act":"Act#5d55","bid":"Bid#cf07"},"references":{"lazy_consensus":"LazyConsensus#7c9b","audit":"Audit#4044"}}},{"id":"MirrorStake","handle":"MirrorStake#7807","gloss":"Symmetric collateralization","mechanism":"Dual-sided escrow protocol. Agent#cc24 A posts a Bond to prove intent; Agent#cc24 B posts a Bond to guarantee execution quality. Funds are released upon cryptographic proof of outcome. Supports asymmetric bonding proportional to risk. It demands a symmetric CostlySignal#7fe2 from both parties, locking assets in a dual-escrow to guarantee mutual incentive alignment.","invariants":["Atomic Settlement: Funds release/slash happens in one transaction.","Collateral Adequacy: Stake > Potential_Damage_Value","Collateral Sufficiency: Stake Value#3c5d >= Value#3c5d at Risk","Symmetry: Both parties must lock stake before execution begins"],"parameters":[{"name":"collateral_ratio","type":"Float","range":"[1.0, 5.0]","description":"e.g., 1.5x value of service"},{"name":"lockup_period","type":"Int","range":"unspecified","description":"Time in blocks"}],"hash":"sema:MirrorStake#mh:SHA-256:7807340cb07de65758c77e97024139c76ec4ee7f831c6f50c8361fe50550ad82","stub":"7807","category":"Economics","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"costly_signal":"CostlySignal#7fe2","agent":"Agent#cc24","value":"Value#3c5d"}}},{"id":"OsmoticFilter","handle":"OsmoticFilter#4eb3","gloss":"Spam prevention via pressure thresholds","mechanism":"Agents operate inside a semi-permeable membrane. Inbound messages are rejected unless they carry sufficient 'pressure' (stake, reputation, or relevance score) to overcome the membrane's current tension. The filter supports Multi-Solvent extraction, allowing different types of pressure (Money vs Trust) to be converted at defined rates. It requires a CostlySignal#7fe2 to penetrate the membrane, using Hysteresis#78b0 to prevent oscillation and Canary#3902 messages to test permeability.","invariants":["Normalized Pressure: Sum(Weighted_Solvents) > Membrane.tension","Permeability: If Queue < Capacity, tension must approach zero (membrane relaxes)","Snapback: If Queue drops rapidly, tension must reset instantly (anti-hysteresis)"],"parameters":[{"name":"accepted_solvents","type":"Map<Solvent, Rate> (Conversion rates, e.g., {Tokens:1.0, Reputation:5.0})","range":"unspecified","description":"Accepted payment types with conversion rates"},{"name":"decay_rate","type":"Float","range":"[0.1, 0.9]","description":"Linear relaxation"},{"name":"snapback_threshold","type":"Float","range":"[0.0, 0.2]","description":"Queue depth % triggering instant reset"}],"hash":"sema:OsmoticFilter#mh:SHA-256:4eb3809154a6ebb825423e95c88caa5b0499fcccc83388fa99eb27df110fbb1e","stub":"4eb3","category":"Protocols","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"costly_signal":"CostlySignal#7fe2","canary":"Canary#3902","hysteresis":"Hysteresis#78b0"}}},{"id":"ValuePeg","handle":"ValuePeg#7e8e","gloss":"Translating internal utility to shared numeraire","mechanism":"Agents agree on a specific ExchangeRate#be29 between their internal utility (see Value#3c5d, Optimize#3075) and a shared numeraire (potentially a CostlySignal#7fe2) for the duration of an interaction. This allows them to trade 'apples for oranges' without exposing private value functions.","invariants":["Solvency: Reserves > Outstanding Liabilities * RiskRatio."],"parameters":{},"hash":"sema:ValuePeg#mh:SHA-256:7e8eaa680a2ad7598e455b8fd143c9be258bc867fe1a275d5d8ce028178b83b9","stub":"7e8e","category":"Economics","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"costly_signal":"CostlySignal#7fe2","optimize":"Optimize#3075","value":"Value#3c5d"},"yields":{"exchange_rate":"ExchangeRate#be29"}}},{"id":"HypothesisLadder","handle":"HypothesisLadder#28ca","gloss":"Bayesian belief updating via falsification rungs","mechanism":"The agent explicitly lists its current hypotheses about the world state and assigns probabilities. As new data arrives, it updates these probabilities using BayesUpdate#5d91. It acts on the highest-probability Hypothesis#e95b but keeps others alive. It structures AbductiveLeap#1069 into falsifiable rungs, climbing to higher certainty only when an Experiment#40e5 validates the current level.","invariants":["Ascension Rule: Cannot move to Hypothesis#e95b(N+1) until Hypothesis#e95b(N) is validated","Evidence required to advance.","Exclusivity: Hypotheses at same rung should be mutually exclusive","Falsifiability: Each rung must have a testable disprove condition","Falsifiability: Every rung must have a disproof condition"],"parameters":{},"hash":"sema:HypothesisLadder#mh:SHA-256:28ca916b29b275d90c85218a94efc657dbd10b1dbdbc9661a209fd10a77714cb","stub":"28ca","category":"Strategy","layer":"Mind","signature":[],"preconditions":["Data is valid"],"postconditions":["Experiment#40e5 defined"],"failureModes":[],"dependencies":{"composes_with":{"experiment":"Experiment#40e5"},"references":{"abductive_leap":"AbductiveLeap#1069","hypothesis":"Hypothesis#e95b","bayes_update":"BayesUpdate#5d91"}}},{"id":"Cache","handle":"Cache#1ea9","gloss":"Temporary high-speed storage","mechanism":"A temporary high-speed storage layer for keeping frequently accessed Datum#31cf or State#4d58. It enables HeuristicSnap#cece by bypassing re-computation.","invariants":["Consistency: Cache(Key) == Source(Key) if valid.","Freshness: Expired items must not be returned."],"parameters":{},"hash":"sema:Cache#mh:SHA-256:1ea9ba40ef01b9f6072ae6bb93d37096c11655bb43a5bebe172d50365dde1073","stub":"1ea9","category":"Memory","layer":"Mind","signature":[],"preconditions":["Key is hashable","Value is serializable"],"postconditions":["Value retrieved significantly faster than source"],"failureModes":[],"dependencies":{"references":{"datum":"Datum#31cf","heuristic_snap":"HeuristicSnap#cece","state":"State#4d58"}}},{"id":"Estimate","handle":"Estimate#bb30","gloss":"Predictive resource costing","mechanism":"The predictive Think#e1bd process of calculating the probable Value#3c5d cost of a Task#d9f9 before execution. It produces a resource cost projection. It has two modes: 1. HeuristicSnap#cece for fast, rough estimates (pattern matching), 2. Simulation#8035 for accurate, expensive estimates (mental execution). The output is a Bid#cf07 with confidence intervals. Estimation itself consumes budget and is subject to the Meta-Cap invariant.","invariants":["Calibration: Over time, actual costs should fall within stated confidence intervals.","Meta-Bound: Estimation cost must be < 5% of estimated task cost.","Uncertainty Honesty: Wide intervals for novel tasks, narrow for familiar."],"parameters":{},"hash":"sema:Estimate#mh:SHA-256:bb3078fc4f974c17821e162f0034230b653c9ebd70c4655e86924d1292b1d449","stub":"bb30","category":"Reasoning","layer":"Mind","signature":["Think(Value)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"simulation":"Simulation#8035","value":"Value#3c5d","heuristic_snap":"HeuristicSnap#cece"},"yields":{"bid":"Bid#cf07"},"accepts":{"task":"Task#d9f9"},"composes_with":{"think":"Think#e1bd"}}},{"id":"MentalSim","handle":"MentalSim#1e28","gloss":"Predictive modeling of system dynamics","mechanism":"System#e314 2 Simulation#8035. Agent#cc24 constructs a causal graph of the target system. It executes a 'Dry Run' of the proposed plan within this graph to predict State#4d58(t+1). It executes a 'Dry Run' within an isolated AgentSandbox#8719, toggling between fast HeuristicSnap#cece and rigorous Deep#89f0 simulation modes.","invariants":["Read-Only Reality: Simulation#8035 cannot produce side effects in Production context.","Simplification: Simulation_Cost << Execution_Cost (otherwise, just do it)."],"parameters":[{"name":"fidelity","type":"Enum","range":"{Low, High}","description":"Default: Low"},{"name":"steps","type":"Integer","range":"[1, 10]","description":"How far ahead to look"}],"hash":"sema:MentalSim#mh:SHA-256:1e28ea49dd0ee3fc2a39c7fe7803895b10bc4cbded08ff50400f0d599dc29c61","stub":"1e28","category":"Strategy","layer":"Mind","signature":[],"preconditions":["Causal model of target system available","Initial state known"],"postconditions":["Probabilistic outcome vector generated"],"failureModes":[],"dependencies":{"references":{"simulation":"Simulation#8035","state":"State#4d58","system":"System#e314","agent_sandbox":"AgentSandbox#8719","deep":"Deep#89f0","heuristic_snap":"HeuristicSnap#cece","agent":"Agent#cc24"}}},{"id":"CiteBack","handle":"CiteBack#1af3","gloss":"Grounding claims in source","mechanism":"The agent is forbidden from stating a fact unless it can simultaneously generate a pointer (quote or ID) to the specific chunk of context that supports it. No hallucination allowed; only citation. It forces a verification step where every assertion must be supported by a RetrievalAugment#ea60 lookup returning the source ID.","invariants":["Every assertion links to source ID","Source must exist in context history"],"parameters":{},"hash":"sema:CiteBack#mh:SHA-256:1af3fdb8c67f92cbc83400e269dc0c075d7cd1e77cf1b7f781e666b3752d5d28","stub":"1af3","category":"Protocols","layer":"Society","signature":[],"preconditions":["Generated claim","Source material available"],"postconditions":["Claim decorated with citation"],"failureModes":[],"dependencies":{"references":{"retrieval_augment":"RetrievalAugment#ea60"}}},{"id":"DeepResearch","handle":"DeepResearch#5b8b","gloss":"Plan-search-synthesize-report research pipeline","mechanism":"An autonomous research pipeline with four stages: (1) Planning - decompose query into research questions, (2) Multi-Round Search - iteratively search, identify gaps, refine queries, (3) Synthesis#3252 - integrate findings across sources, resolve contradictions, (4) Report - generate comprehensive analytical report with citations. The agent loops between search and synthesis until coverage is sufficient. It chains Discover#afa1 for breadth and RetrievalAugment#ea60 for depth, orchestrated by the Deep#89f0 primitive to ensure rigor.","invariants":["Information synthesized from multiple disparate sources","Search depth > 1"],"parameters":{},"hash":"sema:DeepResearch#mh:SHA-256:5b8b36ccee0d571309ff7d7b8d31b30e4c1338bd7189d19950e2bc89083a2e7c","stub":"5b8b","category":"Protocols","layer":"Society","signature":["Deep(Discover)"],"preconditions":["Access to external knowledge base","Broad user query"],"postconditions":["Citations included","Comprehensive report generated"],"failureModes":[],"dependencies":{"references":{"synthesis":"Synthesis#3252","retrieval_augment":"RetrievalAugment#ea60","discover":"Discover#afa1","deep":"Deep#89f0","cognitive_bias":"CognitiveBias#4b32"}}},{"id":"AdversarialSteel","handle":"AdversarialSteel#b88b","gloss":"Dual-advocate verdict generation","mechanism":"The Meta#90f4-process for adversarial verification. Instead of a single judgment, the System#e314 spawns a 'green advocate' (who constructs the strongest case FOR the idea) and a 'red advocate' (who constructs the strongest case AGAINST). A third Judge#b8ba Agent#cc24 renders the verdict only after reviewing both steelmanned arguments. It orchestrates SteelmanCheck#75a0 to generate the opposing arguments and employs CompatibilityCheck#3abb to ensure the pro, con, and Judge#b8ba Agent#cc24s share a precise definition of the Criteria#ef6b before debate begins.","invariants":["Dual Representation: Verdict cannot be rendered without Pro + Con arguments","Steelmanning: Red Argument strength > Weakest Link of Proposal"],"parameters":{},"hash":"sema:AdversarialSteel#mh:SHA-256:b88b0ef8e7b02a319a4d82042fe34981ad48d9c271e5105decd38f699ef4ed8e","stub":"b88b","category":"Strategy","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"composes_with":{"steelman_check":"SteelmanCheck#75a0"},"references":{"system":"System#e314","criteria":"Criteria#ef6b","judge":"Judge#b8ba","meta":"Meta#90f4","compatibility_check":"CompatibilityCheck#3abb","agent":"Agent#cc24"}}},{"id":"Contract","handle":"Contract#e6de","gloss":"Binding agreement between parties","mechanism":"An immutable record of agreement between two or more Identity#626cs. It aggregates a set of Condition#cbd5s (terms) and obligations which all parties must Sign#1fb9 to accept. Contracts serve as the binding Context#510a for disputes resolved by a Judge#b8ba.","invariants":["Consent: Must be signed by all named parties.","Immutability: Terms cannot change after signing.","Enforceability: Terms must be verifiable by a third party."],"parameters":{},"hash":"sema:Contract#mh:SHA-256:e6deb3453c6a4aa33bbff9a0bccda07397c04b769634b369c7df7c758bd1ba3e","stub":"e6de","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"judge":"Judge#b8ba","sign":"Sign#1fb9","context":"Context#510a","identity":"Identity#626c"},"accepts":{"condition":"Condition#cbd5"}}},{"id":"Expansive","handle":"Expansive#ad2d","gloss":"Evaluates generalization potential","mechanism":"Evaluates generalization potential. Classifies scope into three qualitative states: (1) Niche: Overfit to a single problem instance or domain. (2) Untested: Plausible transfer to other domains, but unproven. (3) General: Proven utility across multiple distinct domains or a 'Hostile Slice'. It acts as a Judge#b8ba of the potential Value#3c5d of a solution beyond its initial context.","invariants":["Transfer: Must operate outside training distribution."],"parameters":{},"hash":"sema:Expansive#mh:SHA-256:ad2d13d8dd381d371d93239e0b1c63176aa1126bbc96fc52ce12f392c10dbaf2","stub":"ad2d","category":"Protocols","layer":"Society","signature":["Judge(Value)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"judge":"Judge#b8ba","value":"Value#3c5d"}}},{"id":"HindsightBlock","handle":"HindsightBlock#be41","gloss":"Preventing results-oriented thinking","mechanism":"Decision#acfb-Time Evaluation: When evaluating past decision, reconstruct information available AT DECISION TIME. Judge#b8ba decision quality by expected value given that information, not by outcome. Good decisions can have bad outcomes. Bad decisions can have good outcomes. It mirrors PreMortem#eb4f logic after the fact, reconstructing the ex-ante probability space to judge decision quality independent of outcome.","invariants":["No Revision: Log is immutable","Prior Commitment: Prediction(T) must be cryptographically committed before Outcome#38e0(T+delta)"],"parameters":[{"name":"lookback_window","type":"Duration","range":"[1min, 24h]","description":"How far back to evaluate"},{"name":"regret_threshold","type":"Float","range":"[0.0, 0.5]","description":"Max acceptable regret score"}],"hash":"sema:HindsightBlock#mh:SHA-256:be410c26fbe672bee226f7c5656faea456646fd9f776193d1e5bbc7ecb9f94df","stub":"be41","category":"Inference","layer":"Mind","signature":[],"preconditions":["Prediction registry active"],"postconditions":[],"failureModes":[],"dependencies":{"references":{"pre_mortem":"PreMortem#eb4f","outcome":"Outcome#38e0","judge":"Judge#b8ba","decision":"Decision#acfb"}}},{"id":"HydraConstitution","handle":"HydraConstitution#802e","gloss":"Governance that hardens through failed attacks","mechanism":"A self-amending governance protocol where every REJECTED amendment attempt triggers an automatic Immunization Event. The system analyzes the structural logic of the failed proposal and generates a new, immutable Antibody Rule that explicitly forbids that class of logic in future proposals. Consequently, an attacker who spams the system with edge-case attacks is actually training the systems immune system, progressively narrowing the space of possible exploits. It requires a Quorum#f67a failure to trigger the immune response, codifying the rejected attack vector into a new law.","invariants":["Antifragile Hardening: Cost(Attack N+1) > Cost(Attack N)","Immunization: Reject(Proposal P) -> Commit(Invariant Not(Structure(P)))","Monotonic Safety: The set of forbidden transitions can only grow"],"parameters":[{"name":"immunity_decay","type":"Duration","range":"[30d, 365d]","description":"Time before old antibodies expire"},{"name":"ossification_threshold","type":"Integer","range":"[100, 10000]","description":"Max immunities before forced pruning"}],"hash":"sema:HydraConstitution#mh:SHA-256:802e139f1e76d021df2681dfce2fb38a1a9eb789534d1eb68bf7ad6185a1687d","stub":"802e","category":"Governance","layer":"Society","signature":[],"preconditions":["Proposal P rejected by Quorum#f67a or Judge#b8ba"],"postconditions":["Constitution patched with new immunity"],"failureModes":[],"dependencies":{"references":{"judge":"Judge#b8ba","quorum":"Quorum#f67a"}}},{"id":"NormativeJudge","handle":"NormativeJudge#a214","gloss":"Value-based state evaluation","mechanism":"A purely normative Judge#b8ba module that evaluates static world-states against a weighted Value#3c5d function. To mitigate Goodhart's Law, this pattern should be deployed as an ENSEMBLE (Jury), where multiple judges with slightly perturbed Value#3c5d constitutions reach Quorum#f67a on the Outcome#38e0. It aggregates Value#3c5ds via PerspectiveEnsemble#5816, optionally escalating to HumanApprove#e64a for ambiguous edge cases.","invariants":["Explicit Weights: Trade-offs between values must be logged","Outcome#38e0 Focus: Evaluation is f(State#4d58), not f(Action)"],"parameters":[{"name":"consensus_threshold","type":"Float","range":"[0.5, 1.0]","description":"Required agreement for Jury"},{"name":"weights","type":"Map<Value, Float>","range":"unspecified","description":"Relative importance weights per value dimension"}],"hash":"sema:NormativeJudge#mh:SHA-256:a2149e83b35ba7b071c1ddefc6010cf690587066178239c888fe4b0348220593","stub":"a214","category":"Inference","layer":"Mind","signature":["Judge(Value)"],"preconditions":["State#4d58 S_prime is descriptively complete"],"postconditions":["Normative verdict rendered"],"failureModes":[],"dependencies":{"references":{"outcome":"Outcome#38e0","quorum":"Quorum#f67a","state":"State#4d58","judge":"Judge#b8ba","human_approve":"HumanApprove#e64a","value":"Value#3c5d"},"composes_with":{"perspective_ensemble":"PerspectiveEnsemble#5816"}}},{"id":"Novelty","handle":"Novelty#2218","gloss":"Evaluates structural distinctness","mechanism":"Acts as a Judge#b8ba to evaluate structural distinctness and Value#3c5d against the incumbent knowledge base. Classifies candidates into three qualitative states: (1) Derivative: Pure relabeling of an existing concept. (2) Marginal: Incremental variation; distinctness is unproven. (3) Distinct: Introduces a new orthogonal mechanism or predicts a divergent outcome.","invariants":["Orthogonality: High novelty requires low embedding similarity to nearest neighbor."],"parameters":{},"hash":"sema:Novelty#mh:SHA-256:2218bd2b82619a01d35eb54e4160c5975abf23e46c3611a85db5442537dad3f5","stub":"2218","category":"Strategy","layer":"Mind","signature":["Judge(Value)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"judge":"Judge#b8ba","value":"Value#3c5d"}}},{"id":"Parsimony","handle":"Parsimony#2578","gloss":"Complexity justification via Occams Razor","mechanism":"Acts as a Judge#b8ba to evaluate Topology#2408 necessity (Occam's Razor). Classifies complexity into three qualitative states: (1) Bloated: Core concept collapses or remains identical without this component. (2) Under-specified: Plausible utility, but necessity is not strictly proven via ablation. (3) Minimal: Proven essential; removing any part destroys the function. Aims for high Compress#0967ion.","invariants":["Necessity: Every component must have a causal link to the outcome."],"parameters":{},"hash":"sema:Parsimony#mh:SHA-256:25788dab06b998f95e0447259c9f29c331216ed523b24c4311083af2d53509f0","stub":"2578","category":"Reasoning","layer":"Mind","signature":["Judge(Topology)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"compress":"Compress#0967","judge":"Judge#b8ba","topology":"Topology#2408"}}},{"id":"Realizable","handle":"Realizable#199e","gloss":"Evaluates execution feasibility of a plan","mechanism":"Acts as a Judge#b8ba to evaluate the Value#3c5d and feasibility of a Plan#64f2. Classifies the execution path into three qualitative states: (1) Magical: Relies on undefined Step#5f22s or unavailable physics. (2) Uncertain: The dependency chain is clear, but specific links are unverified. (3) Coherent: Every Step#5f22 maps to a known primitive or realizable sub-component.","invariants":["Causality: No step can precede its dependencies.","Grounding: All leaf nodes must terminate in known primitives."],"parameters":{},"hash":"sema:Realizable#mh:SHA-256:199e1de94d8abb8ff3786e1b025039b64517443d26680699b9bd4f7e8cf9baf2","stub":"199e","category":"Protocols","layer":"Society","signature":["Judge(Value)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"judge":"Judge#b8ba","plan":"Plan#64f2","step":"Step#5f22","value":"Value#3c5d"}}},{"id":"ScoringFunction","handle":"ScoringFunction#f5c9","gloss":"Deterministic valuation logic","mechanism":"A deterministic logical unit that maps an input artifact to a scalar Value#3c5d (Score). It encapsulates the criteria used by Rank#cb98 and Judge#b8ba.","invariants":["Determinism: Same input always yields same score.","Range: Output must be within [0.0, 1.0] or [-inf, +inf]."],"parameters":{},"hash":"sema:ScoringFunction#mh:SHA-256:f5c93a2bbddd826a3faa0d9edb75db2e73841424936fafb0d50316d547ee73c2","stub":"f5c9","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"rank":"Rank#cb98","judge":"Judge#b8ba","value":"Value#3c5d"}}},{"id":"TriGate","handle":"TriGate#a30f","gloss":"Generic Red/Yellow/Green flow control","mechanism":"A generic Gate#206d traffic-light enforcement primitive. Wraps a Judge#b8ba or Condition#cbd5 that returns a Trinary status (Red/Yellow/Green). Enforces standard flow control: Red -> CLOSE (Halt execution). Yellow -> DEBT (Proceed with obligation recorded to Ledger#2449). Green -> OPEN (Proceed).","invariants":["Fail-Closed: Red triggers immediate halt.","Debt Awareness: Yellow must append a remediation item to the context and record obligation in Ledger."],"parameters":{},"hash":"sema:TriGate#mh:SHA-256:a30fece9632e91a1089f646c9bd11a648fdd6264edd95aad7f81981090672d2c","stub":"a30f","category":"Governance","layer":"Society","signature":["Gate(Judge)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"gate":"Gate#206d","condition":"Condition#cbd5","judge":"Judge#b8ba","ledger":"Ledger#2449"}}},{"id":"SurprisalUpdate","handle":"SurprisalUpdate#61cd","gloss":"Learning weighted by prediction failure magnitude","mechanism":"A learning protocol where the agent updates its internal model (weights, embeddings, or context) based on failed predictions, weighted by the magnitude of surprise. Higher surprisal = larger update. 'Learn most from what confused you most.' This implements Surprisal-Weighted Fine-Tuning (SWFT): loss contribution is proportional to -log(P(observed|predicted)). Utilizes RegimeSense#6e3a, EpistemicROI#742a.","invariants":["Loss Magnitude: Update size proportional to surprisal (-log P)","Stability Guard: No single update may shift model more than max_update_rate"],"parameters":[{"name":"learning_rate","type":"Float","range":"[0.0, 1.0]","description":"How much to update the model based on surprisal"},{"name":"max_update_rate","type":"Float","range":"[0.0, 1.0]","description":"Maximum allowed model shift per single update"}],"hash":"sema:SurprisalUpdate#mh:SHA-256:61cd0ab834517c8243a95fad2ac455e0693cc1ef8982c5837a6f15f8faa88c28","stub":"61cd","category":"Inference","layer":"Mind","signature":[],"preconditions":["Actual outcome observed and diverged from prediction","Prediction was made with computable probability"],"postconditions":["Model updated proportional to surprisal","Update logged for audit trail"],"failureModes":[],"dependencies":{"references":{"epistemic_roi":"EpistemicROI#742a","regime_sense":"RegimeSense#6e3a"}}},{"id":"TensionHold","handle":"TensionHold#3496","gloss":"Maintain contradictions without premature resolution","mechanism":"Cognitive Suspension protocol. When two high-confidence inputs conflict (A ⊥ B), the Agent#cc24 instantiates a Tension#f398 object that binds them together. This blocks downstream decision-making until a reconciling insight (Pattern C) is found via Dialectic#3744 or Synthesis#3252.","invariants":["No Selection: Output cannot be simply 'A' or 'B' (must be Tension#f398{A,B}).","Persistence: Tension#f398 object remains active until explicitly resolved via Synthesis#3252 or Falsification."],"parameters":{},"hash":"sema:TensionHold#mh:SHA-256:3496a834ef59ae72725054b262f7844a7551f9c917348b95e704b84e0265a558","stub":"3496","category":"Strategy","layer":"Mind","signature":[],"preconditions":["Mutually exclusive valid inputs identified","Resolution threshold not met"],"postconditions":["Execution flow diverted to Information Retrieval (to break the tie)","Tension#f398 object created in Graph"],"failureModes":[],"dependencies":{"yields":{"tension":"Tension#f398"},"references":{"synthesis":"Synthesis#3252","agent":"Agent#cc24","dialectic":"Dialectic#3744"}}},{"id":"Disband","handle":"Disband#8934","gloss":"Enable clean group termination with proper state handling","mechanism":"Graceful group dissolution with state disposition and clean termination. Agent#cc24 sends 'DISBAND' signal. For scope='member': notify remaining members, adjust shared state, check Quorum#f67a. For scope='group': broadcast 'DISSOLVING', execute state disposition, release shared resources, and record dissolution with a group Snapshot#0ae9 for potential re-formation. All members must ACK dissolution. It safely terminates the group, optionally triggering EjectionSeat#3f5e for any members refusing to release shared resources.","invariants":["All shared resources released","No lingering commitments"],"parameters":{},"hash":"sema:Disband#mh:SHA-256:89348c638b3f33296f02c557bb5d357349f7879a6ea7f2dd90f7096102685765","stub":"8934","category":"Governance","layer":"Society","signature":[],"preconditions":["Active group/swarm","Mission complete or aborted"],"postconditions":["Agents return to free pool"],"failureModes":[],"dependencies":{"references":{"quorum":"Quorum#f67a","state":"State#4d58","ejection_seat":"EjectionSeat#3f5e","agent":"Agent#cc24"},"yields":{"snapshot":"Snapshot#0ae9"}}},{"id":"HackDetect","handle":"HackDetect#0846","gloss":"Detect shortcuts that break downstream invariants","mechanism":"A meta-check that detects when an agent is solving for 'make it work' instead of 'do it right'. Triggered when the agent modifies interface code (adapters, exporters, validators) rather than fixing source data or upstream logic. The hack appears to succeed locally but breaks invariants that downstream systems depend on, creating negative externalities. It monitors the InputGuard#0770 layer for anomalies, triggering EjectionSeat#3f5e if the agent attempts to bypass invariants via code patching.","invariants":["Detection triggers defensive response","False positive rate minimized"],"parameters":{},"hash":"sema:HackDetect#mh:SHA-256:0846cad7015e648b050b08d13f2e036c99d8afbcdfa0492747bae6d62d0ebf37","stub":"0846","category":"Protocols","layer":"Society","signature":[],"preconditions":["Attack signatures/anomaly detection","System#e314 monitoring"],"postconditions":["Alert raised","Intrusion identified"],"failureModes":[],"dependencies":{"references":{"input_guard":"InputGuard#0770","ejection_seat":"EjectionSeat#3f5e","agent":"Agent#cc24","system":"System#e314"}}},{"id":"Rollout","handle":"Rollout#d742","gloss":"Safe, reversible deployment with circuit breaking and emergency ejection","mechanism":"Performs the Act#5d55 of deployment by extracting the Spec#436e from the ExecutionManifest#a0d9 and using Build#00f3 to produce the artifact, executing it inside a CircuitBreaker#4162 envelope. It deploys a Canary#3902 first. If the breaker trips or the EjectionSeat#3f5e is triggered, it immediately invokes Compensate#2f1d to revert the System#e314 State#4d58.","invariants":["WorldReversible#f664: Deployment must be reversible via Compensate#2f1d.","Unblockable: EjectionSeat#3f5e override must be respected."],"parameters":{},"hash":"sema:Rollout#mh:SHA-256:d7420d9c37fb35ab8880189864c63dd1e09fa1371f0e65d65df8d00cc75ebf23","stub":"d742","category":"Protocols","layer":"Society","signature":["Act(ExecutionManifest)"],"preconditions":["ExecutionManifest#a0d9 approved","CircuitBreaker#4162 is CLOSED (Healthy)"],"postconditions":["RolloutManifest#9e7f created","MonitorReport#063c generated"],"failureModes":[],"dependencies":{"composes_with":{"ejection_seat":"EjectionSeat#3f5e","compensate":"Compensate#2f1d","canary":"Canary#3902","circuit_breaker":"CircuitBreaker#4162"},"references":{"manifest_planning":"ManifestPlanning#8f61","act":"Act#5d55","state":"State#4d58","system":"System#e314","build":"Build#00f3","world_reversible":"WorldReversible#f664","spec":"Spec#436e"},"accepts":{"execution_manifest":"ExecutionManifest#a0d9"},"yields":{"rollout_manifest":"RolloutManifest#9e7f","monitor_report":"MonitorReport#063c"}}},{"id":"ContingencyPlan","handle":"ContingencyPlan#127a","gloss":"Pre-computed responses to critical failure","mechanism":"If-Then Preparation: For each critical assumption in a Plan#64f2, define trigger condition for failure. Pre-compute response: \"If X happens, I will do Y.\" Store contingencies before they are needed. When trigger fires, execute pre-made backup Plan#64f2 without deliberation under stress. It pre-defines the logic that Retry#9e66 or recovery mechanisms should execute upon specific trigger conditions.","invariants":["Resources reserved for contingency","Trigger condition is disjoint from main plan success"],"parameters":{},"hash":"sema:ContingencyPlan#mh:SHA-256:127a678449606e8c140b57e10beff0284dfc59d775ce77db8213bc3a92e7d780","stub":"127a","category":"Strategy","layer":"Mind","signature":[],"preconditions":["Identified failure modes","Primary plan"],"postconditions":["Backup path defined and viable"],"failureModes":[],"dependencies":{"references":{"plan":"Plan#64f2","retry":"Retry#9e66"}}},{"id":"PromptChain","handle":"PromptChain#be30","gloss":"Sequential LLM calls with validation gates","mechanism":"Decomposes a Task#d9f9 into a fixed Sequence#b0b8 of LLM calls. Each step's output is validated against an AcceptSpec#70dd before being passed to the next. Trades latency for accuracy by linearizing thought. It orchestrates a sequence of ToolInvoke#cf0a calls, wrapping each step with InputGuard#0770 validation and Retry#9e66 logic.","invariants":["Halt on Error: Chain#5711 aborts if Gate#206d(N) returns False.","Schema Continuity: Output(N) must satisfy InputSchema(N+1)."],"parameters":[{"name":"gate_mode","type":"Enum","range":"{Strict, Retry, Skip}","description":"Behavior on failure"},{"name":"max_retries_per_step","type":"Integer","range":"[0, 3]","description":"Maximum retry attempts per step before chain fails"},{"name":"steps","type":"List[StepDefinition]","range":"unspecified","description":"Ordered list of prompts"}],"hash":"sema:PromptChain#mh:SHA-256:be305ccb72fe325e21e0cc5725e4569f9d1f37e8b713f6b9a242ca448751dade","stub":"be30","category":"Protocols","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"tool_invoke":"ToolInvoke#cf0a","sequence":"Sequence#b0b8","input_guard":"InputGuard#0770","chain":"Chain#5711","gate":"Gate#206d","accept_spec":"AcceptSpec#70dd","retry":"Retry#9e66"},"accepts":{"task":"Task#d9f9"}}},{"id":"Delegate","handle":"Delegate#7dce","gloss":"Enable structured work distribution with accountability","mechanism":"Work#aaad distribution protocol with acceptance, tracking, and failure handling. Delegator sends 'DELEGATE' message. Delegatee responds 'ACCEPT' or 'REFUSE'. On accept, delegatee owns Task#d9f9 and sends 'PROGRESS' via Heartbeat#4ddc. On completion, delegator receives result. On failure, delegatee sends Break#9d98—delegator decides: reassign, retry, or escalate. Broadcast delegation creates auction or uses MirrorStake#7807 for collateral. It employs Probe#9f2b to verify capabilities. Inherits HolographicShard#1d3f.","invariants":["Delegation is REQUEST not command (acceptance protocol unless pre-waived at RALLY). Refused tasks must be handled (reassign or escalate, not silently dropped). Progress must be trackable (delegatee reports status updates). Failure propagates (delegated task failure triggers Break#9d98 to delegator). Dependencies enforced (task blocked until dependencies complete). One owner per task (no ambiguous responsibility)."],"parameters":{},"hash":"sema:Delegate#mh:SHA-256:7dce193da7c9573a95841772ee70d67bc8b3955dc983873f7fd396cf46dca01a","stub":"7dce","category":"Governance","layer":"Society","signature":[],"preconditions":["Principal has authority. Delegate capable. Scope of delegation defined."],"postconditions":["Delegate acts within scope. Principal notified of actions. Revocation possible."],"failureModes":[],"dependencies":{"composes_with":{"heartbeat":"Heartbeat#4ddc","mirror_stake":"MirrorStake#7807","probe":"Probe#9f2b"},"accepts":{"holographic_shard":"HolographicShard#1d3f"},"references":{"work":"Work#aaad","break":"Break#9d98"},"yields":{"task":"Task#d9f9"}}},{"id":"EmpathySim","handle":"EmpathySim#1eee","gloss":"Predictive modeling of external agent states","mechanism":"Theory of Mind simulation. Agent#cc24 instantiates a temporary 'Virtual Context#510a' initialized with Target_Agent's known priors, goals, and constraints. It then runs inference on this context to predict Target's next move. It spins up an isolated AgentSandbox#8719 to model the target's perspective, sometimes using MirrorStake#7807 to align incentives for accurate prediction.","invariants":["Isolation: Simulated context must have NO write access to Host memory.","Priors Shift: Utility function used must be Target's, not Host's."],"parameters":[{"name":"simulation_depth","type":"Integer","range":"[1, 3]","description":"Default: 1"},{"name":"target_profile","type":"AgentProfile","range":"unspecified","description":"Profile of the agent whose state is being modeled"}],"hash":"sema:EmpathySim#mh:SHA-256:1eee92ef7f1a4b21402aa9a81c793975d48cf3e3957f040b2f0bd5c9d7ad5a6b","stub":"1eee","category":"Economics","layer":"Society","signature":[],"preconditions":["Budget#a763 available for sub-simulation","Target profile (goals/constraints) known"],"postconditions":["Confidence_Score generated","Predicted_Action vector generated"],"failureModes":[],"dependencies":{"references":{"simulation":"Simulation#8035","state":"State#4d58","agent":"Agent#cc24","agent_sandbox":"AgentSandbox#8719","context":"Context#510a","budget":"Budget#a763","cognitive_bias":"CognitiveBias#4b32","mirror_stake":"MirrorStake#7807"}}},{"id":"EpistemicWager","handle":"EpistemicWager#7002","gloss":"Staking value on the truth of a claim","mechanism":"A mechanism where an Agent#cc24 uses MirrorStake#7807 to lock Value#3c5d (collateral) on the truthfulness of a Belief#6690. If the belief is proven false via Falsification#3e36 by an Oracle#45e5 or SpotAudit#6673, the stake is slashed. This incentivizes honesty and rigorous BayesUpdate#5d91, filtering out 'cheap talk' and hallucinations by creating a cost for inaccuracy.","invariants":["Skin in the Game: Stake > 0","Falsifiable: The belief must have a clear condition for falsification.","Atomic Settlement: Resolution (Return or Slash) must be guaranteed by the underlying protocol."],"parameters":{},"hash":"sema:EpistemicWager#mh:SHA-256:7002fc120e47e469f6f1d97f88849ae1f6ca3f94ca4104641d85a1ed15b804bd","stub":"7002","category":"Economics","layer":"Society","signature":[],"preconditions":["Agent has sufficient funds","Belief is clearly defined"],"postconditions":["Stake locked until resolution","Belief gains credibility (Signal Boost)"],"failureModes":[],"dependencies":{"references":{"belief":"Belief#6690","spot_audit":"SpotAudit#6673","value":"Value#3c5d","oracle":"Oracle#45e5","agent":"Agent#cc24","falsification":"Falsification#3e36"},"composes_with":{"mirror_stake":"MirrorStake#7807","bayes_update":"BayesUpdate#5d91"}}},{"id":"StakedProbe","handle":"StakedProbe#c52f","gloss":"Economically backed verification query","mechanism":"A high-assurance verification pattern where a Probe#9f2b is backed by economic collateral via MirrorStake#7807. If the probe returns false or malicious data, the stake is slashed. Essential for adversarial environments where simple querying is insufficient.","invariants":["Skin in the Game: Stake must be > 0.","Slashable: False reporting triggers automatic asset forfeiture."],"parameters":{},"hash":"sema:StakedProbe#mh:SHA-256:c52fef498943c78c929563f2efeca09fc762e23468cccf80e2782bda0f1b3cb0","stub":"c52f","category":"Economics","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"composes_with":{"mirror_stake":"MirrorStake#7807","probe":"Probe#9f2b"}}},{"id":"Fermi","handle":"Fermi#389d","gloss":"Estimation via decomposition","mechanism":"Decomposed Estimation: break unknown quantity into factors you can Estimate#bb30. Multiply factors. Accept order-of-magnitude accuracy. Example: \"pianos in Chicago\" = population × household fraction × piano-owning fraction. Errors often cancel across factors. It invokes Decompose#422f to break an unknown quantity into estimable sub-factors.","invariants":["Error Cancellation: Overestimation in sub-factors tends to cancel underestimation","Geometric Mean: Final estimate is geometric mean of bounds"],"parameters":[{"name":"confidence_interval","type":"Percentage","range":"[50%, 95%]","description":"Target coverage of true value"},{"name":"decomposition_depth","type":"Integer","range":"[2, 6]","description":"Estimation chain length"}],"hash":"sema:Fermi#mh:SHA-256:389ddee306aa2de7090a1e9014bacfa4fe2f2f9c9b3aa6c8a8ef8c39f1a60bc1","stub":"389d","category":"Protocols","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"composes_with":{"estimate":"Estimate#bb30","decompose":"Decompose#422f"}}},{"id":"ImaginaryHistorian","handle":"ImaginaryHistorian#f818","gloss":"Debugging possible futures","mechanism":"Macro for Trace#9057(Simulation#8035). The agent generates a cryptographic trace of a simulated event sequence. This creates an immutable record of a 'future that didn't happen', enabling debugging and causal analysis of potential outcomes. It generates a verified Trace#9057 of a MentalSim#1e28, creating an audit log for a counterfactual timeline. This record can be CryptoShred#e0b9ded to deny its existence.","invariants":[],"parameters":{},"hash":"sema:ImaginaryHistorian#mh:SHA-256:f818b4b64ef0c5dd06699742a86af741fd3cf8898372ba27ec78260778b1f858","stub":"f818","category":"Protocols","layer":"Society","signature":["Trace(Simulation)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"mental_sim":"MentalSim#1e28","simulation":"Simulation#8035","trace":"Trace#9057","crypto_shred":"CryptoShred#e0b9"}}},{"id":"SimulationTrace","handle":"SimulationTrace#1bc5","gloss":"Pre-execution mental model","mechanism":"Before taking an irreversible action (e.g., `delete_file`), the agent simulates the execution step-by-step in a scratchpad. It inspects the predicted state after the action. If the state looks bad, it aborts. It generates a verifiable Trace#9057 of a MentalSim#1e28, creating an immutable record of the predicted future state.","invariants":["Causality: Every step T+1 is derived from T","Replayability: Trace#9057(Start) == End","Trace#9057 immutable after creation."],"parameters":[{"name":"confidence_floor","type":"Probability","range":"[0.5, 0.9]","description":"Min certainty to trust trace"},{"name":"simulation_fidelity","type":"Percentage","range":"[70%, 99%]","description":"Required model accuracy"}],"hash":"sema:SimulationTrace#mh:SHA-256:1bc5ce892c33fe0da334ebe253a27afbf94965f03112c08aff5af743d657e5c2","stub":"1bc5","category":"Protocols","layer":"Society","signature":[],"preconditions":["Simulation#8035 engine initialized"],"postconditions":["Verifiable trace artifact generated"],"failureModes":[],"dependencies":{"references":{"mental_sim":"MentalSim#1e28","simulation":"Simulation#8035","trace":"Trace#9057"}}},{"id":"SourceEvaluate","handle":"SourceEvaluate#b847","gloss":"Incentive-aware evidence weighting","mechanism":"Credibility Assessment: A Judge#b8ba module for Agent#cc24 evaluation. Before accepting claim, evaluate source on: track record, incentives, expertise, access to information. Ask: Why does this source believe this? Would they know if wrong? Do they benefit from me believing? Adjust weight accordingly. It demands a CiteBack#1af3 for every claim, weighting the evidence by the source's historical reliability.","invariants":["Evidence must be independently verifiable."],"parameters":{},"hash":"sema:SourceEvaluate#mh:SHA-256:b847e556c70226d42b50ef6b197d9473037bb11d30ef9b2fa2aed641ebdfe232","stub":"b847","category":"Protocols","layer":"Society","signature":["Judge(Agent)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"judge":"Judge#b8ba","cite_back":"CiteBack#1af3","agent":"Agent#cc24"}}},{"id":"Uncertain","handle":"Uncertain#b894","gloss":"Epistemic status: genuinely don't know","mechanism":"Epistemic Status Flag. Explicitly marks a Claim, Variable#179a, or Edge as 'Unknown'. Unlike 'Speculation' (which posits a direction), 'Uncertain' asserts a void of evidence. This prevents the system from treating absence of evidence as evidence of absence. Utilizes DeepResearch#5b8b, UncertaintyMap#e883, SocraticLoop#10e9.","invariants":["Actionable Void: A node marked 'Uncertain' is a high-priority target for Information Retrieval.","Specificity: Must target a specific scope (e.g., 'Uncertain about X', not just 'Uncertain')."],"parameters":{},"hash":"sema:Uncertain#mh:SHA-256:b89402ced2faa010330940d426790c0bff7c6ca70294ca53aae0fe6b141d8223","stub":"b894","category":"Primitives","layer":"Physics","signature":[],"preconditions":["Knowledge gap identified"],"postconditions":["Confidence score set to 0.0","Target marked as requiring investigation"],"failureModes":[],"dependencies":{"references":{"socratic_loop":"SocraticLoop#10e9","variable":"Variable#179a","uncertainty_map":"UncertaintyMap#e883","agent":"Agent#cc24","deep_research":"DeepResearch#5b8b"}}},{"id":"ConstructOntology","handle":"ConstructOntology#e5ce","gloss":"Building a structured conceptual framework","mechanism":"A primitive for building a structured set of concepts and relationships (an ontology) from raw data or seed axioms. It defines the 'physics' or 'rules' of a domain. This is the constructive counterpart to 'Adversarial Ontology Construction' (which is a methodology using this primitive). It builds the semantic graph from FirstPrinciples#c379, validating edge coherence via AdversarialSteel#b88b and establishing shared context through OntologyHandshake#ead0.","invariants":["Completeness: All referenced terms are defined","Consistency: No contradictions within the ontology"],"parameters":[{"name":"depth","type":"Integer","range":"[1, 10]","description":"Hierarchical depth"},{"name":"format","type":"Enum","range":"{OWL, JSON-LD, Sema}","description":"Output format"}],"hash":"sema:ConstructOntology#mh:SHA-256:e5ced9f3067c292e187b0ee10ac557d4cbb5064436ab07cc389e5cdefbe44eb6","stub":"e5ce","category":"Protocols","layer":"Society","signature":[],"preconditions":["Seed concepts or data available"],"postconditions":["Valid ontology object created"],"failureModes":[],"dependencies":{"references":{"ontology_handshake":"OntologyHandshake#ead0","adversarial_steel":"AdversarialSteel#b88b","first_principles":"FirstPrinciples#c379"}}},{"id":"RedTeam","handle":"RedTeam#5134","gloss":"Adversarial stress testing","mechanism":"Adversarial Stress Test: Adopt attacker mindset. Goal: break the system, find exploits, identify weaknesses. No loyalty to the design. Document attack vectors with severity and likelihood. Switch#70bf back to defender to patch highest-risk vectors. It adopts an attacker persona via AdversarialSteel#b88b, probing the system for exploit paths.","invariants":["Adversarial intent simulated","Goal is to find flaws, not fix them"],"parameters":{},"hash":"sema:RedTeam#mh:SHA-256:513414fe8a9c2a73a5949439c1b0b2f0f35309358f042a24d22a1845bb724984","stub":"5134","category":"Strategy","layer":"Mind","signature":[],"preconditions":["Proposed plan/system"],"postconditions":["Vulnerability report"],"failureModes":[],"dependencies":{"references":{"adversarial_steel":"AdversarialSteel#b88b","switch":"Switch#70bf"}}},{"id":"Award","handle":"Award#2eda","gloss":"Acceptance of bid and contract creation","mechanism":"The formal Act#5d55 of accepting a Bid#cf07. It triggers the creation of a Contract#e6de which all parties must Sign#1fb9, and uses HeldRelease#5b7a to lock the agreed Value#3c5d as collateral or payment. This action transitions the State#4d58 from Negotiation to Execution, authorizing the Solver#1c9b to begin.","invariants":["Atomic: Bid acceptance and Contract creation must happen together.","Funded: Value must be locked (HeldRelease) before Award is final."],"parameters":{},"hash":"sema:Award#mh:SHA-256:2eda44e2b2ebcf367563cd9dd7ac71e47a431f6aeeb4c0f2c5e9c6683ca877ad","stub":"2eda","category":"Economics","layer":"Society","signature":["Act(Contract)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"state":"State#4d58","solver":"Solver#1c9b","value":"Value#3c5d"},"composes_with":{"act":"Act#5d55","held_release":"HeldRelease#5b7a","sign":"Sign#1fb9"},"yields":{"contract":"Contract#e6de"},"accepts":{"bid":"Bid#cf07"}}},{"id":"Crystallize","handle":"Crystallize#e848","gloss":"Phase transition from implicit resonance to explicit contract","mechanism":"Formalize implicit resonance. Agent#cc24 A proposes crystallization based on history history_t. Agent#cc24 B validates perception. On consensus, implicit behaviors are codified into explicit obligations. It transforms soft Resonate#99d9 signals into hard HydraConstitution#802e rules, contingent on low entropy conditions maintained by Dampen#ff89 and EntropyPump#b9ae, preventing premature Decay#a1d4.","invariants":["Atomic Transition#072d: State#4d58 moves from Fluid -> Solid in one transaction.","Entropy Limit: Crystallization forbidden if System_Entropy > entropy_threshold."],"parameters":[{"name":"entropy_threshold","type":"Float","range":"[0.0, 1.0]","description":"Maximum disorder level before implicit alignment is formalized into a contract"},{"name":"resonance_period","type":"Duration","range":"unspecified","description":"Minimum history required"}],"hash":"sema:Crystallize#mh:SHA-256:e84866de2000db88e54e393e3a761f5687488881a0a3e6817bdc864d28189e04","stub":"e848","category":"Strategy","layer":"Mind","signature":[],"preconditions":["Active implicit resonance channel exists","State#4d58 is fluid/negotiable"],"postconditions":["Explicit coordination channel established","State#4d58 marked immutable/contractual"],"failureModes":[],"dependencies":{"references":{"state":"State#4d58","transition":"Transition#072d","entropy_pump":"EntropyPump#b9ae","decay":"Decay#a1d4","resonate":"Resonate#99d9","hydra_constitution":"HydraConstitution#802e","agent":"Agent#cc24","dampen":"Dampen#ff89"}}},{"id":"Elect","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.","invariants":["One and only one leader selected per term","Selection process is verifiable"],"parameters":{},"hash":"sema:Elect#mh:SHA-256:af6e313ca4ac066c68c3b5f9debfaec551f20b3aacd0792c3eec6fa41bc41282","stub":"af6e","category":"Governance","layer":"Society","signature":[],"preconditions":["Candidate set","Voting mechanism"],"postconditions":["Leader identified","Term started"],"failureModes":[],"dependencies":{"accepts":{"accept_spec":"AcceptSpec#70dd","ballot":"Ballot#c5c5"},"composes_with":{"hydra_constitution":"HydraConstitution#802e"},"yields":{"solution":"Solution#7186"}}},{"id":"NormCheck","handle":"NormCheck#e814","gloss":"Detection of value-laden facts","mechanism":"A Check#1544 filter that scans the Prophet's descriptive output for normative adjectives (e.g., 'dangerous', 'unfortunate', 'unfair') that masquerade as objective facts. It forces a rewrite to strip these biases, ensuring the separation of Is (Prophet) and Ought (Judge#b8ba of Value#3c5d). Utilizes Quorum#f67a, ProphetFanOut#6972, NormativeJudge#a214.","invariants":["Fact Preservation: Rewritten text must preserve all causal claims","Neutral Tone: Count(NormativeAdjectives) == 0"],"parameters":[{"name":"action_on_detect","type":"Enum","range":"{Flag, Rewrite, Reject}","description":"Response to smuggled norms"},{"name":"sensitivity","type":"Enum","range":"{Low, Medium, High, Paranoid}","description":"Detection threshold"}],"hash":"sema:NormCheck#mh:SHA-256:e814be5d132bffecd6b6ca97f0a2b540b64f201a4ab688c3af9f976c22bf6c58","stub":"e814","category":"Inference","layer":"Mind","signature":["Check(Value)"],"preconditions":["Text claims to be descriptive"],"postconditions":["Text certified neutral"],"failureModes":[],"dependencies":{"references":{"normative_judge":"NormativeJudge#a214","quorum":"Quorum#f67a","judge":"Judge#b8ba","check":"Check#1544","prophet_fan_out":"ProphetFanOut#6972","value":"Value#3c5d"}}},{"id":"Aesthetics","handle":"Aesthetics#6b33","gloss":"Optimization for human subjective preference","mechanism":"A scalar Metric#8895 representing the fit between an Artifact#6254 and the subjective preference priors of a human observer (e.g., harmony, Parsimony#2578, style). Used to optimize solutions for social acceptance when functional utility is equal.","invariants":[],"parameters":{},"hash":"sema:Aesthetics#mh:SHA-256:6b3327e2478c8a2203ec76f8f65c0473ed629b1099375c4928096a27f209b69d","stub":"6b33","category":"Protocols","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"metric":"Metric#8895","parsimony":"Parsimony#2578","artifact":"Artifact#6254"}}},{"id":"BreadthGovernor","handle":"BreadthGovernor#c98e","gloss":"Structural limit on parallel execution (Fan-out)","mechanism":"Parsimony#2578-Bounded Expansion. Limits the maximum number of parallel branches (fan-out) at any single node. Prioritizes branches by 'Distinctness' and 'Expected Value#3c5d'. If Candidates > Max_Breadth, applies Truncation (Top-K) or Clustering (merge similar branches). It enforces limits defined by Budget#a763 during the Decompose#422f phase, often employing ProphetFanOut#6972 to pre-score and prune branches.","invariants":["Distinctness: Parallel#6272 branches must be semantically orthogonal (cosine_sim < 0.8).","Miller's Law: Active sub-tasks should rarely exceed 7 +/- 2."],"parameters":[{"name":"max_breadth","type":"Integer","range":"[3, 10]","description":"Default: 5"},{"name":"selection_strategy","type":"Enum","range":"{TopK, Cluster, Random}","description":"Default: TopK"}],"hash":"sema:BreadthGovernor#mh:SHA-256:c98e2057dd8d67125f34aafcb2f6397574af172c0a20113aa042574bd8e31a7c","stub":"c98e","category":"Inference","layer":"Mind","signature":[],"preconditions":["Candidate list generated","Decomposition request received"],"postconditions":["Candidate list truncated to <= max_breadth"],"failureModes":[],"dependencies":{"references":{"parallel":"Parallel#6272","prophet_fan_out":"ProphetFanOut#6972","context":"Context#510a","value":"Value#3c5d","budget":"Budget#a763","parsimony":"Parsimony#2578","decompose":"Decompose#422f"}}},{"id":"ConceptBlend","handle":"ConceptBlend#de01","gloss":"Combinatorial novelty generation","mechanism":"Forcing the merger of two unrelated graph nodes to find a valid semantic path. Unlike analogy (A is like B), blending creates C (A + B). It extends AnalogyBridge#87de by not just mapping A to B, but fusing them to create C.","invariants":["Orthogonality: Inputs must be semantically distant (> threshold distance)","Validity: Output must pass a TriGate#a30f(Realizable#199e) check"],"parameters":{},"hash":"sema:ConceptBlend#mh:SHA-256:de0119faac3117ebddc1c767f646668f490da960e26643a3f1be6d32161e8857","stub":"de01","category":"Strategy","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"tri_gate":"TriGate#a30f","analogy_bridge":"AnalogyBridge#87de","realizable":"Realizable#199e"}}},{"id":"PURECheck","handle":"PURECheck#b8ca","gloss":"The PURE Triage Protocol (Parsimonious, Unique/Novel, Realizable, Expansive)","mechanism":"The canonical Exploration Protocol#7e1c. It is a LayeredCheck#3fad that orchestrates a sequential triage using four instances of TriGate#a30f: (1) TriGate#a30f(Parsimony#2578) (2) TriGate#a30f(Novelty#2218) (3) TriGate#a30f(Realizable#199e) (4) TriGate#a30f(Expansive#ad2d). Enforces the conjunctive rule: 'Explore iff NO gate is Red'. Yellow outputs accumulate as Technical Debt (Smallest Lift tasks) in the final Solution#7186.","invariants":[],"parameters":{},"hash":"sema:PURECheck#mh:SHA-256:b8caa25351b7aca245cf6cdda95bade057c69cb4d789c4a098148d1edb576d6c","stub":"b8ca","category":"Strategy","layer":"Mind","signature":["Protocol(Solution)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"realizable":"Realizable#199e","novelty":"Novelty#2218","layered_check":"LayeredCheck#3fad","expansive":"Expansive#ad2d","solution":"Solution#7186","tri_gate":"TriGate#a30f","parsimony":"Parsimony#2578"},"composes_with":{"protocol":"Protocol#7e1c"}}},{"id":"BeliefTracking","handle":"BeliefTracking#de85","gloss":"Note what you believed before and after","mechanism":"Epistemic Version Control. Enforces a 'Commit Log' for internal knowledge. Before processing new information, the Agent#cc24 must query and pin its current Priors. If the posterior belief shifts significantly, the Agent#cc24 creates a new Node connected to the old one via a `supersedes` edge, explicitly noting the 'Surprisal' that caused the shift. It calculates the divergence magnitude via SurprisalUpdate#61cd to determine whether a new node is justified or if the evidence fits the existing model.","invariants":["Causal Link: Every update must cite the specific 'Trigger' (Evidence) that caused the shift.","Non-Destructive Update: Old beliefs are never deleted, only Superseded.","Prior Commitment: Must retrieve/state existing beliefs BEFORE ingesting new evidence."],"parameters":[{"name":"update_threshold","type":"Float","range":"[0.0, 1.0]","description":"Minimum delta to trigger belief revision"}],"hash":"sema:BeliefTracking#mh:SHA-256:de85ece216eb6030ed14d7cca83334f11dd6efb9287c76bf25f569946c5dc950","stub":"de85","category":"Memory","layer":"Mind","signature":[],"preconditions":["Existing knowledge graph","Incoming information stream"],"postconditions":["Belief#6690 graph updated with version history","Learning delta recorded"],"failureModes":[],"dependencies":{"references":{"belief":"Belief#6690","cognitive_bias":"CognitiveBias#4b32","agent":"Agent#cc24","surprisal_update":"SurprisalUpdate#61cd"}}},{"id":"CounterfactualAnchor","handle":"CounterfactualAnchor#063d","gloss":"Freezing expectation to measure true surprise","mechanism":"Freezes a prediction BEFORE observation. 1. Instantiate immutable Anchor (Expectation). 2. Observe#8ebd Reality. 3. Learning Signal#f39d = Delta(Anchor, Reality). Prevents Hindsight CognitiveBias#4b32 by forcing updates based on genuine surprise. It creates the static reference point against which SurprisalUpdate#61cd measures the magnitude of the learning delta.","invariants":["Anchor Immutability: The Anchor cannot be modified once the Observation phase begins","Delta Causality: Learning Signal#f39d L = f(Anchor, Observation). No other inputs permitted during update","Temporal Ordering: Creation(Anchor) < Time(Observation)"],"parameters":[{"name":"granularity","type":"String","range":"unspecified","description":"Temporal resolution for counterfactual comparison (e.g., hour, day, week)"},{"name":"retention_policy","type":"Duration","range":"unspecified","description":"How long to keep counterfactual baselines before expiry"}],"hash":"sema:CounterfactualAnchor#mh:SHA-256:063d450f43af5d8edc6b05acff736560c5a85e9e730db4aeec607d3754717dfb","stub":"063d","category":"Protocols","layer":"Society","signature":[],"preconditions":["Agent#cc24 has a predictive model capable of generating specific expectations","Incoming observable event stream"],"postconditions":["A quantified 'Surprisal' delta is recorded","Internal model weights/beliefs updated based on delta"],"failureModes":[],"dependencies":{"references":{"signal":"Signal#f39d","agent":"Agent#cc24","observe":"Observe#8ebd","surprisal_update":"SurprisalUpdate#61cd","cognitive_bias":"CognitiveBias#4b32"}}},{"id":"TraceBelief","handle":"TraceBelief#5334","gloss":"Belief Provenance (Macro for Trace(Belief))","mechanism":"A chronological reasoning pattern that tracks the history of a belief. Prevents 'Silent Updating' by forcing the agent to cite the specific past belief node it is revising. Instantiates the Trace#9057 primitive on a Belief#6690 object. Utilizes Trace#9057, SurprisalUpdate#61cd, Belief#6690, TimeWarpLog#aa7a.","invariants":[],"parameters":{},"hash":"sema:TraceBelief#mh:SHA-256:533499acf3ed3270a039dca18f66b170db485ddf56e47d72b68f770dce949da1","stub":"5334","category":"Protocols","layer":"Society","signature":["Trace(Belief)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"belief":"Belief#6690","time_warp_log":"TimeWarpLog#aa7a","trace":"Trace#9057","surprisal_update":"SurprisalUpdate#61cd"}}},{"id":"Deploy","handle":"Deploy#0d56","gloss":"Release to production","mechanism":"The Act#5d55 of moving an artifact or system from a development/staging environment to a production environment. It executes the Rollout#d742 process to make the system active and accessible to users.","invariants":[],"parameters":{},"hash":"sema:Deploy#mh:SHA-256:0d5689af6010cb28767876fe4c7eea40aec1c411e30d2191b55745e2746fe7f9","stub":"0d56","category":"Protocols","layer":"Society","signature":["Act(Rollout)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"composes_with":{"rollout":"Rollout#d742","act":"Act#5d55"}}},{"id":"Compose","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.","invariants":["Type Safety: Component outputs must match downstream inputs.","Acyclicity: Composition graph must be a DAG."],"parameters":{},"hash":"sema:Compose#mh:SHA-256:41f61756a73065e6a7b3a80e1ac9938567f7e22dd85d437fd96be12a8ea8ce6f","stub":"41f6","category":"Protocols","layer":"Society","signature":["Combine(PromptChain)"],"preconditions":["Subproblem solutions available. Interface contracts defined. Composition order known if order-dependent."],"postconditions":["Combined solution satisfies original problem. No interface violations. Emergent interactions handled."],"failureModes":[],"dependencies":{"references":{"combine":"Combine#5a44","check":"Check#1544","prompt_chain":"PromptChain#be30"}}},{"id":"MetaPrompt","handle":"MetaPrompt#af73","gloss":"Use prompts to generate or refine other prompts","mechanism":"A higher-order Meta#90f4 Prompt#5deding technique where prompts are used to generate, refine, or analyze other prompts rather than directly answering questions. The LLM acts as a prompt engineer, creating task-specific prompts from templates or improving existing prompts through critique. Enables reusable prompt templates that generalize across problem categories. It constructs a PromptChain#be30 where the output of the first stage is the prompt instruction for the second.","invariants":["Output is a prompt","Prompt#5ded instructs how to prompt"],"parameters":{},"hash":"sema:MetaPrompt#mh:SHA-256:af733e898cd221286278bdafa1d045598b82a7413a6adeb67521aebedce202b6","stub":"af73","category":"Protocols","layer":"Society","signature":["Meta(Prompt)"],"preconditions":["Prompt#5ded engineering principles","Task#d9f9 description"],"postconditions":["Optimized prompt generated"],"failureModes":[],"dependencies":{"references":{"task":"Task#d9f9","prompt":"Prompt#5ded","meta":"Meta#90f4","prompt_chain":"PromptChain#be30"}}},{"id":"PatternDiscovery","handle":"PatternDiscovery#8178","gloss":"Finding patterns that already exist","mechanism":"Macro for Search#d608(Pattern). Vocabulary Hygiene Protocol#7e1c. Before minting a new pattern, the Agent#cc24 MUST execute a semantic search against the existing registry. If a pattern with >85% semantic similarity is found, the Agent#cc24 MUST adopt the existing pattern or explicitly justify the divergence (Fork). It leverages Search#d608 to scan the existing registry before triggering ConstructOntology#e5ce to mint a new definition.","invariants":["Deduplication: If Similarity(New, Existing) > Threshold, Mint is blocked.","Pre-Mint Check#1544: Minting is forbidden without a prior Search log."],"parameters":[{"name":"search_method","type":"Enum","range":"{Vector, Keyword, Hybrid}","description":"Default: Hybrid"},{"name":"similarity_threshold","type":"Float","range":"[0.0, 1.0]","description":"Default: 0.85"}],"hash":"sema:PatternDiscovery#mh:SHA-256:817812421bedb09d6d8d04cdefd7b968a8853cbead54a73ef6133e5501ba8548","stub":"8178","category":"Strategy","layer":"Mind","signature":[],"preconditions":["Intent to define new concept","Registry access available"],"postconditions":["Existing Pattern Returned OR New Pattern Minted"],"failureModes":[],"dependencies":{"references":{"construct_ontology":"ConstructOntology#e5ce","protocol":"Protocol#7e1c","check":"Check#1544","search":"Search#d608","agent":"Agent#cc24"}}},{"id":"AdversarialProof","handle":"AdversarialProof#3a40","gloss":"Adversarial proof of absence","mechanism":"Cognitively-enriched NegativeProof#40a6 that invokes RedTeam#5134 logic to exhaustively search for prohibited data. The adversarial mindset ensures blind spots are probed. Treats failure-to-find-despite-adversarial-effort as high-confidence proof of absence.","invariants":["Adversarial intent maintained throughout search","Search space fully covered with hostile probing"],"parameters":{},"hash":"sema:AdversarialProof#mh:SHA-256:3a40bf981cf55a2f33101edfd611003e49e069a209559b45c7ee01ccbbbd896b","stub":"3a40","category":"Protocols","layer":"Society","signature":[],"preconditions":["Closed world assumption","Hypothesis#e95b H to disprove"],"postconditions":["H proved false with adversarial confidence"],"failureModes":[],"dependencies":{"composes_with":{"negative_proof":"NegativeProof#40a6","red_team":"RedTeam#5134"},"references":{"hypothesis":"Hypothesis#e95b"}}},{"id":"SafetyCartographer","handle":"SafetyCartographer#9bc4","gloss":"Mapping safety boundaries","mechanism":"Macro for Discover#afa1(Constraint#87fe). The agent actively probes its environment or internal safety filters with boundary-seeking inputs to map the limits of permissible action, rather than just checking if a single action is safe. It employs RedTeam#5134 tactics to Discover#afa1 failure modes, using BoundaryProbe#3c6b to map the precise coordinates of the Constraint#87fe.","invariants":[],"parameters":{},"hash":"sema:SafetyCartographer#mh:SHA-256:9bc4be4c215b4eb8a9dd29f83ad3b10553e74debfd03df0f1be717f76cc4cd7c","stub":"9bc4","category":"Protocols","layer":"Society","signature":["Discover(Constraint)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"constraint":"Constraint#87fe","red_team":"RedTeam#5134","discover":"Discover#afa1","boundary_probe":"BoundaryProbe#3c6b"}}},{"id":"Rally","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.","invariants":["Binding: MUSTER message must include a shared ContextID for the new group.","Quorum#f67a: If Enlist_Count < Min_Participants, Rally FAILS (Atomic Abort)."],"parameters":[{"name":"deadline","type":"Duration","range":"unspecified","description":"Default: 5m"},{"name":"max_participants","type":"Integer","range":"unspecified","description":"Default: 10"},{"name":"min_participants","type":"Integer","range":"[1, 50]","description":"Minimum agents required to proceed"},{"name":"selection_criteria","type":"PatternRef","range":"unspecified","description":"Default: Select"}],"hash":"sema:Rally#mh:SHA-256:b6ca0c695f0c13412b0e9ec0a6778fc6d245065054869b311eaa26f11fcccc77","stub":"b6ca","category":"Governance","layer":"Society","signature":[],"preconditions":["Broadcast channel available","Initiator has resources to pay for group Context#510a"],"postconditions":["New GroupContextID minted OR Rally dissolved"],"failureModes":[],"dependencies":{"composes_with":{"accept_spec":"AcceptSpec#70dd"},"references":{"quorum":"Quorum#f67a","protocol":"Protocol#7e1c","select":"Select#15c2","context":"Context#510a","elect":"Elect#af6e"}}},{"id":"Vote","handle":"Vote#cae4","gloss":"Provide standard decision mechanism with integrity guarantees","mechanism":"N-agent decision mechanism with configurable rules and integrity guarantees. Initiator sends 'VOTE_CALL' with question, options, and Quorum#f67a requirement. Eligible agents respond 'CAST' via Ballot#c5c5. System#e314 enforces: one vote per agent, deadline, and Quorum#f67a check. After deadline: compute result. Broadcast 'VOTE_RESULT'. Simple case optimization: binary decisions use lightweight 2-message flow. Utilizes Break#9d98, Aggregate#0291, Elect#af6e.","invariants":["Votes immutable after cast."],"parameters":[{"name":"mechanism","type":"Enum","range":"{Majority, Supermajority, Quadratic, Ranked, Unanimous}","description":"Counting method"},{"name":"quorum_required","type":"Float","range":"[0.0, 1.0]","description":"Min participation to be valid"},{"name":"voting_period","type":"Duration","range":"[1min, 7d]","description":"Window for casting votes"}],"hash":"sema:Vote#mh:SHA-256:cae4e5707843fea694b91ed741584987cbc9b577a0c9d56914c47e30ff686df8","stub":"cae4","category":"Governance","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"aggregate":"Aggregate#0291","system":"System#e314","break":"Break#9d98","elect":"Elect#af6e"},"composes_with":{"quorum":"Quorum#f67a"},"accepts":{"ballot":"Ballot#c5c5"}}},{"id":"PhasedRefinement","handle":"PhasedRefinement#9334","gloss":"Layered, multi-pass improvement","mechanism":"A structured Refine#38d9 strategy that improves an Artifact#6254 through a defined Sequence#b0b8 of passes, where each pass targets a specific layer of abstraction (e.g., Reason#3f24 (logic) -> StructuralCoaching#3da9 (structure) -> Aesthetics#6b33 (polish)). It uses a Gate#206d to prevent premature optimization by ensuring deep structural issues are resolved before surface-level polishing begins.","invariants":["Non-Regression: Modifications in Phase(N) must not violate invariants established in Phase(N-1).","Monotonic Quality: The artifact's quality score should not decrease after a pass."],"parameters":{},"hash":"sema:PhasedRefinement#mh:SHA-256:9334e01fd5b7b2c1abfeb3b05f53e8aeb4ba8036c23609d9a31b97dbbf7f5549","stub":"9334","category":"Protocols","layer":"Society","signature":["Refine(Artifact)"],"preconditions":["Artifact exists and is mutable"],"postconditions":["Artifact satisfies the acceptance criteria of the final phase"],"failureModes":[],"dependencies":{"composes_with":{"gate":"Gate#206d","sequence":"Sequence#b0b8","refine":"Refine#38d9"},"references":{"reason":"Reason#3f24","structural_coaching":"StructuralCoaching#3da9","aesthetics":"Aesthetics#6b33","artifact":"Artifact#6254"}}},{"id":"CapacityPressure","handle":"CapacityPressure#9e7b","gloss":"Forcing abstraction via resource starvation","mechanism":"A regularization pattern that forces abstraction by artificially constraining resources (bandwidth, memory, parameter count, or time). By creating a bottleneck where Capacity < Information, the agent is compelled to compress the signal, discarding noise and memorized details in favor of high-level concepts and generalizations. It artificially tightens the Budget#a763, forcing the agent to employ Generalize#9313, ConceptBlend#de01, and ContextCompress#6dbd to fit the signal within the bottleneck.","invariants":["Bottleneck Existence: Available Capacity must be strictly less than Input Information Content","Lossy Requirement: Output must be a simplified representation, effectively barring exact replication/memorization","Utility Preservation: The compressed form must retain predictive power for the target task"],"parameters":[{"name":"compression_ratio","type":"Float","range":"unspecified","description":"Target resource utilization ratio that triggers forced abstraction"},{"name":"resource_type","type":"Enum","range":"unspecified","description":"Type of resource being constrained (compute, memory, bandwidth)"}],"hash":"sema:CapacityPressure#mh:SHA-256:9e7b9d2a599ff40722c4617ad103851388d702d9c976520929b1f39624322920","stub":"9e7b","category":"Economics","layer":"Society","signature":[],"preconditions":["A mechanism to enforce hard limits (e.g., context window, dimensions, token count)","A stream of information or a learning task"],"postconditions":["A highly compressed, abstract representation of the input","Loss of fine-grained detail/noise"],"failureModes":[],"dependencies":{"references":{"generalize":"Generalize#9313","concept_blend":"ConceptBlend#de01","constraint":"Constraint#87fe","context_compress":"ContextCompress#6dbd","budget":"Budget#a763","agent":"Agent#cc24"}}},{"id":"CreativeBlend","handle":"CreativeBlend#22d2","gloss":"Generating novelty via combinatorial blending and noise","mechanism":"A generative Strategy#47a4 that produces an Artifact#6254 by identifying orthogonal concepts in the Context#510a and fusing them via ConceptBlend#de01. It applies NoiseInjection#53b3 to the seed inputs to escape local optima. The output is filtered through a rigorous dual-Check#1544 against Novelty#2218 and Value#3c5d. Only artifacts passing both gates are yielded.","invariants":["Divergence: Output similarity to input < Threshold.","Utility: Must maintain structural coherence (not pure noise)."],"parameters":[{"name":"temperature","type":"Float","range":"[0.7, 1.5]","description":"Randomness injection level"}],"hash":"sema:CreativeBlend#mh:SHA-256:22d24a773a6e4e883d7e777636cd7969e9c22646234a78352f09f6a0b8faff30","stub":"22d2","category":"Strategy","layer":"Mind","signature":["Strategy(Artifact)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"strategy":"Strategy#47a4","noise_injection":"NoiseInjection#53b3","novelty":"Novelty#2218","value":"Value#3c5d"},"composes_with":{"concept_blend":"ConceptBlend#de01","check":"Check#1544"},"yields":{"artifact":"Artifact#6254"},"accepts":{"context":"Context#510a"}}},{"id":"Jazz","handle":"Jazz#3421","gloss":"Improvisational flow","mechanism":"Macro for Discover#afa1(Path) + Constraint#87fe(Latency ≈ 0). A high-speed discovery Mode#b995 where critical filters (Check#1544) are temporarily disabled or delayed to maximize flow and serendipity. It prioritizes momentum and novelty over immediate correctness. Utilizes Discover#afa1, ExploreExploit#88b0, ConceptBlend#de01, Constraint#87fe.","invariants":[],"parameters":{},"hash":"sema:Jazz#mh:SHA-256:342166f8d34b4a717173d8ee816372129c6332fc89152eaba0dbc9f719460457","stub":"3421","category":"Strategy","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"mode":"Mode#b995","concept_blend":"ConceptBlend#de01","check":"Check#1544","constraint":"Constraint#87fe","discover":"Discover#afa1","explore_exploit":"ExploreExploit#88b0"}}},{"id":"LatentWander","handle":"LatentWander#a7bb","gloss":"Offline exploration of embedding space","mechanism":"Offline processing mode where the agent explores its own embedding space, connecting distant concepts (Daydreaming). Used for memory consolidation and generating novel AnalogyBridge#87des. It uses ConceptBlend#de01 during offline states to traverse the embedding space and discover non-obvious connections.","invariants":["Drift: Exploration temperature > standard inference temperature","Silence#dd79: No external output allowed during Wandering"],"parameters":{},"hash":"sema:LatentWander#mh:SHA-256:a7bbe4b0a0097d7bd9f2d7f53b8344e287325135d15c95fae4144d82bf827c55","stub":"a7bb","category":"Strategy","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"silence":"Silence#dd79","concept_blend":"ConceptBlend#de01"},"yields":{"analogy_bridge":"AnalogyBridge#87de"}}},{"id":"RepresentationSwap","handle":"RepresentationSwap#fe9b","gloss":"Exposing hidden errors by changing the data modality","mechanism":"A verification protocol where information is transcoded into a strictly orthogonal modality (e.g., Text -> Flowchart, Code -> Plain English, Table -> Narrative) to reveal structural errors. The agent must successfully map the original concept to the new format. Gaps, ambiguities, or 'impossible geometries' in the new format indicate flaws in the original logic. It forces a lossless transcoding of the concept into an orthogonal format, often using ConceptBlend#de01 mechanics to map between modalities.","invariants":["Lossless Intent: The core meaning must survive the swap.","Orthogonality: The target modality must constrain different dimensions than the source (e.g., Text is linear; Graphs are topological)."],"parameters":{},"hash":"sema:RepresentationSwap#mh:SHA-256:fe9baa92ec79a3719004fa492411ccc2bd2532ebcd3ea413062a6b5acffabb05","stub":"fe9b","category":"Strategy","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"concept_blend":"ConceptBlend#de01"}}},{"id":"GenealogicalTrace","handle":"GenealogicalTrace#d178","gloss":"Auditing the historical lineage and incentives of an idea","mechanism":"An audit protocol that traces a concept, framing, or heuristic back to its historical or institutional origin. The agent identifies the 'Pedigree' of the idea and the 'Interest' it served at its inception (Cui Bono). This distinguishes 'Universal Truths' from 'Inherited Biases' that may no longer be relevant to the current context. It acts as a Deep#89f0 audit, using TraceBelief#5334 to uncover origins and CiteBack#1af3 to validatethe lineage.","invariants":["Contextualization: Must compare Origin Context#510a vs. Current Context#510a.","Traceability: Must identify a specific origin point (Era, Author, or Institution)."],"parameters":{},"hash":"sema:GenealogicalTrace#mh:SHA-256:d1786f8d92432962871f3a077e272ff47ca56fc6a7ba155d53ea0a905bef54f7","stub":"d178","category":"Protocols","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"deep":"Deep#89f0","trace_belief":"TraceBelief#5334","cite_back":"CiteBack#1af3","context":"Context#510a"}}},{"id":"SynergisticMode","handle":"SynergisticMode#e8be","gloss":"Protocol-level cognitive mode switching","mechanism":"Broadcasts a 'Cognitive Mode#b995' Signal#f39d (Generative vs. Verifier) to downstream Agent#cc24s. Downstream solvers MUST adjust their `AcceptSpec#70dd` strictness to match the upstream mode. Utilizes Compose#41f6.","invariants":["Complementary Coupling: Wild generation MUST be paired with strict verification","Explicit Declaration: Mode#b995 must be part of the OntologyHandshake#ead0"],"parameters":{},"hash":"sema:SynergisticMode#mh:SHA-256:e8bea728fb51a8ca4001045dd06875527d1f52371bd1b0659a23093981eb4a6b","stub":"e8be","category":"Protocols","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"mode":"Mode#b995","signal":"Signal#f39d","system":"System#e314","ontology_handshake":"OntologyHandshake#ead0","compose":"Compose#41f6","accept_spec":"AcceptSpec#70dd","agent":"Agent#cc24"}}},{"id":"MintWhenFriction","handle":"MintWhenFriction#ce55","gloss":"Create patterns when re-explanation causes friction, not before","mechanism":"Vocabulary Growth Heuristic. A decision procedure that permits minting ONLY when specific 'Friction Signals' are detected. It rejects speculative minting ('Just in Case') in favor of reactive minting ('Just in Time'). It monitors for repetition via PatternDiscovery#8178 and formalizes the concept via ConstructOntology#e5ce only when explanation costs exceed a threshold.","invariants":["Check#1544 Prior Art: Must execute PatternDiscovery#8178 before minting.","Compression Value#3c5d: Token_Count(Reference) must be < 0.7 * Token_Count(Definition).","Proof of Friction: Must cite 3+ instances of explanation overhead OR 1+ critical coordination failure."],"parameters":[{"name":"min_compression","type":"Float","range":"unspecified","description":"Default: 0.3"},{"name":"occurrence_threshold","type":"Integer","range":"[2, 20]","description":"Minimum re-explanations before minting is justified"}],"hash":"sema:MintWhenFriction#mh:SHA-256:ce550ead3db2627513e32901a36c30feca185efe4075918bcd3de9f642464ed9","stub":"ce55","category":"Economics","layer":"Society","signature":[],"preconditions":["New concept identified","Usage history available"],"postconditions":["Minting Approved OR Rejected"],"failureModes":[],"dependencies":{"references":{"construct_ontology":"ConstructOntology#e5ce","pattern_discovery":"PatternDiscovery#8178","check":"Check#1544","value":"Value#3c5d"}}},{"id":"Nucleate","handle":"Nucleate#8550","gloss":"Emergent working groups from activity density","mechanism":"Agents coordinate indirectly via Trace#9057 (stigmergy). System#e314 tracks trace-density per location. When density crosses threshold, site becomes supersaturated. Any agent at supersaturated site may invoke 'NUCLEATE', broadcasting crystal purpose. Agents at site receive signal and may 'BOND' to join direct channel. It monitors Trace#9057 density, triggering Rally#b6ca to gather agents and Crystallize#e848 to form a stable group.","invariants":["Conservation of Mass: Nucleation cannot create agents; it only aggregates existing Trace#9057 density.","Critical Mass: Process starts only when N > SeedThreshold","Nucleation ONLY at supersaturated sites."],"parameters":{},"hash":"sema:Nucleate#mh:SHA-256:8550f88958a49031016edba372e7d5350a5b52afcd9dd1312378d60dd2c52f34","stub":"8550","category":"Protocols","layer":"Society","signature":[],"preconditions":["Field of agents/particles is present"],"postconditions":["Phase transition complete (Liquid -> Solid)"],"failureModes":[],"dependencies":{"references":{"crystallize":"Crystallize#e848","trace":"Trace#9057","system":"System#e314","rally":"Rally#b6ca"}}},{"id":"AmbiguityResolution","handle":"AmbiguityResolution#6487","gloss":"Social clearing of semantic noise","mechanism":"A social protocol for cleaning the knowledge base. When agents flag ambiguous or conflicting data, this protocol forces a resolution event. Agents must Vote#cae4 to clarify, delete, or fork the data. It uses an EntropyPump#b9ae to surface latent ambiguities, preventing the system from settling on false certainties.","invariants":["Forced Resolution: Conflicts cannot persist indefinitely.","Clarity: Ambiguity must decrease over time."],"parameters":{},"hash":"sema:AmbiguityResolution#mh:SHA-256:6487ea6de2ce54da7da6a40743c15761467f4653ec054e098e42f2900e68684b","stub":"6487","category":"Protocols","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"composes_with":{"vote":"Vote#cae4","entropy_pump":"EntropyPump#b9ae"}}},{"id":"AmendLaws","handle":"AmendLaws#5266","gloss":"Self-governing DAOs that patch their own vulnerabilities.","mechanism":"Self-Rewriting Rules: A supermajority Vote#cae4 triggers a state transition that modifies the system's own source constraints. It operates upon the HydraConstitution#802e, modifying the active constraint set via a cryptographically signed commit. The amendment must pass a specific Quorum#f67a threshold (usually > 66%) to be valid.","invariants":["Entrenched Clauses: Safety Core (e.g., Do not harm humans) cannot be amended by vote.","Supermajority: Amendment requires > N% approval (defined in Constitution).","Atomic Transition: The law change is an atomic commit; no partial updates."],"parameters":{},"hash":"sema:AmendLaws#mh:SHA-256:5266843d5641614ea8de731bee40022b8da59e05c62b026710bef98fa46e8b07","stub":"5266","category":"Governance","layer":"Society","signature":[],"preconditions":["Proposal is formatted as a valid patch","Voting period has elapsed","Quorum#f67a requirements met"],"postconditions":["System constraints updated","Constitution version incremented"],"failureModes":[],"dependencies":{"references":{"vote":"Vote#cae4","hydra_constitution":"HydraConstitution#802e","quorum":"Quorum#f67a"}}},{"id":"Consensus","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.","invariants":["Agreement: All correct agents who decide must decide the same Value#3c5d.","Validity: If all agents propose V, then the Value#3c5d must be V.","Termination: Eventually, every correct agent decides on a Value#3c5d."],"parameters":{},"hash":"sema:Consensus#mh:SHA-256:27226a36cf5431b783c0713f42bcc4d9ac70207840206f8b15335ce5a43a50e2","stub":"2722","category":"Governance","layer":"Society","signature":[],"preconditions":["Group of agents is defined (Membership List)","Communication channel is available","Proposal#4840 received"],"postconditions":["A single Value#3c5d is committed to the shared state","All agents are notified of the Value#3c5d"],"failureModes":[],"dependencies":{"yields":{"value":"Value#3c5d"},"composes_with":{"vote":"Vote#cae4","quorum":"Quorum#f67a"},"accepts":{"proposal":"Proposal#4840"}}},{"id":"PropheticQuorum","handle":"PropheticQuorum#21f7","gloss":"Aligning predictions before aligning votes","mechanism":"A two-stage consensus protocol. Phase 1 (reality Check#1544): Agents receive a proposed action. Each runs a local SimulationTrace#1bc5 to predict the outcome State#4d58. They vote to confirm they share the SAME prediction. If predictions diverge, the protocol halts for model alignment. Phase 2 (Value#3c5d judgment): Only after predictions match do agents vote on whether the predicted State#4d58 is desirable. This ensures consensus is based on shared reality, not just shared language. It splits consensus into two phases: reality Check#1544 (via regime sensing) and Value#3c5d judgment (via NormativeJudge#a214).","invariants":["Prediction Precedence: Vote#cae4 (reality) must pass before Vote#cae4 (desirability)","Shared Vision: Action cannot proceed if >X% of agents predict different outcomes"],"parameters":[{"name":"confidence_weighting","type":"Boolean","range":"{true, false}","description":"Weight votes by stated confidence"},{"name":"prediction_threshold","type":"Probability","range":"[0.6, 0.95]","description":"Agreement level for valid prediction"}],"hash":"sema:PropheticQuorum#mh:SHA-256:21f781d202c265358c7d00facabaab602cdaae8d95c19e1188859807bde01f44","stub":"21f7","category":"Protocols","layer":"Society","signature":[],"preconditions":["Determinism level of Simulation#8035 engine is high"],"postconditions":[],"failureModes":[],"dependencies":{"references":{"simulation":"Simulation#8035","normative_judge":"NormativeJudge#a214","state":"State#4d58","vote":"Vote#cae4","simulation_trace":"SimulationTrace#1bc5","check":"Check#1544","value":"Value#3c5d"}}},{"id":"StyleSpec","handle":"StyleSpec#0c63","gloss":"Codified aesthetic standards","mechanism":"A structured Spec#436e defining the required Aesthetics#6b33 and formatting rules. It serves as the reference standard for passes in a PhasedRefinement#9334 loop focused on polish. Unlike functional requirements, this spec targets the subjective and presentational layer.","invariants":[],"parameters":{},"hash":"sema:StyleSpec#mh:SHA-256:0c63c7dadeca0f997b0ef39f6c40c9b69cfdcb9f49ad2fb535cff972c21f31c2","stub":"0c63","category":"Protocols","layer":"Society","signature":["Spec(Aesthetics)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"spec":"Spec#436e","phased_refinement":"PhasedRefinement#9334","aesthetics":"Aesthetics#6b33"}}},{"id":"PatternEmergence","handle":"PatternEmergence#e47f","gloss":"Recognizing implicit patterns in existing practice","mechanism":"Observational Heuristic. Before designing a pattern 'top-down', the Agent#cc24 analyzes interaction logs to identify recurring behaviors that have emerged 'bottom-up'. These implicit protocols are then codified into explicit definitions. It observes usage via UptakeAsGround#bf85 and formalizes the structure via MintWhenFriction#ce55, ensuring it matches an existing PatternDiscovery#8178 Signal#f39d.","invariants":["Descriptive Priority: The definition must describe what is happening, not what should happen (at least initially).","Existence Proof: The pattern must be observed in the wild (implicit) before being named (explicit)."],"parameters":{},"hash":"sema:PatternEmergence#mh:SHA-256:e47f0fdc5b59c3de4669457f01fdf37d0bd4280b566bb4d48e14910efd19be91","stub":"e47f","category":"Protocols","layer":"Society","signature":[],"preconditions":["Interaction logs available","Recurring behavior detected"],"postconditions":["Candidate pattern identified","Evidence log attached"],"failureModes":[],"dependencies":{"references":{"generalize":"Generalize#9313","signal":"Signal#f39d","system":"System#e314","pattern_discovery":"PatternDiscovery#8178","noise":"Noise#c4b4","uptake_as_ground":"UptakeAsGround#bf85","mint_when_friction":"MintWhenFriction#ce55","agent":"Agent#cc24"}}},{"id":"Constitution","handle":"Constitution#2391","gloss":"Immutable rule set","mechanism":"A structured document defining the fundamental principles, immutable rights, and automated penalty rules for a group of Agent#cc24s. It serves as the static input for oath binding.","invariants":["Clarity: Rules must be machine-verifiable.","Stability: Cannot be modified without a formal AmendLaws#5266 process."],"parameters":{},"hash":"sema:Constitution#mh:SHA-256:2391d082a0537c5adf91e0bfe986dae8553f96db6d9c53b09184928b23fc6ea9","stub":"2391","category":"Governance","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"amend_laws":"AmendLaws#5266","agent":"Agent#cc24"}}},{"id":"AnchorDrop","handle":"AnchorDrop#9ca6","gloss":"Emergency state checkpointing","mechanism":"When network turbulence or disagreement exceeds a threshold, agents trigger an 'Anchor Drop'. They stop accepting new transactions and aggressively seek Quorum#f67a on the last valid state (the Anchor). Progress resumes only after the Anchor is solidified. It invokes first principles to re-derive the valid state from the bedrock axioms when the consensus chain is corrupted.","invariants":["Consensus#2722 Threshold: >2/3 agents must sign Anchor","Immutability: Anchor state cannot be modified once finalized"],"parameters":{},"hash":"sema:AnchorDrop#mh:SHA-256:9ca6c43220cf8d91bea02088d4e9614ce1b46a4c008e56bad102c54a0418d947","stub":"9ca6","category":"Governance","layer":"Society","signature":[],"preconditions":["Network partition detected"],"postconditions":["System#e314 restarts from Anchor state"],"failureModes":[],"dependencies":{"references":{"system":"System#e314","quorum":"Quorum#f67a","consensus":"Consensus#2722"}}},{"id":"ChaosDrift","handle":"ChaosDrift#ee43","gloss":"Continuous stress-testing via entropic injection","mechanism":"A resilience pattern where the system operates Optimistically (Lazy Consensus#2722), but a background process deliberately injects random state mutations (Entropy) into the consensus log. If the system is Robust, these small mutations are absorbed/corrected by the next update. If the system is Brittle (stuck in a local optimum), the noise triggers a cascade of Rollbacks, forcing the agents to renegotiate a more stable equilibrium. It uses noise to stress-test consensus in real-time. It employs AntifragileInversion#bf62 to treat noise as a stabilizing signal, and SemanticTabu#82dd to prevent the system from returning to failed equilibria.","invariants":["Noise#c4b4 Budget: Entropy injection rate < System#e314 Repair Rate","Rollback Limit: If Rollbacks > Threshold, disable EntropyPump#b9ae"],"parameters":{},"hash":"sema:ChaosDrift#mh:SHA-256:ee438c58f13195b2cf4c1317072166d4a8cd833e9f32d203a77eb5758dd74e38","stub":"ee43","category":"Strategy","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"semantic_tabu":"SemanticTabu#82dd","system":"System#e314","noise":"Noise#c4b4","antifragile_inversion":"AntifragileInversion#bf62","entropy_pump":"EntropyPump#b9ae","consensus":"Consensus#2722"}}},{"id":"ConsensusFinder","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.","invariants":["Passive Observation: Does not initiate new voting rounds.","Discovery: Returns existing consensus or Null."],"parameters":{},"hash":"sema:ConsensusFinder#mh:SHA-256:a9c98920caa7c8655e0a5c5229f7b1aa501734eb9229ee3888eeaed535274273","stub":"a9c9","category":"Governance","layer":"Society","signature":["Discover(Consensus)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"discover":"Discover#afa1","quorum":"Quorum#f67a","consensus":"Consensus#2722","resonate":"Resonate#99d9"}}},{"id":"Group","handle":"Group#0a38","gloss":"Agent collective","mechanism":"A defined collection of Agent#cc24s sharing a common Context#510a or goal. It serves as the scope for Consensus#2722 and ShoutWhisper#35dd.","invariants":[],"parameters":{},"hash":"sema:Group#mh:SHA-256:0a3835b5b26dc6c7ba8cab19ec784439cdd662b7bb91c8852cda2091bf4b9dc0","stub":"0a38","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"consensus":"Consensus#2722","agent":"Agent#cc24","context":"Context#510a","shout_whisper":"ShoutWhisper#35dd"}}},{"id":"RuleSet","handle":"RuleSet#c559","gloss":"Immutable collection of constraints","mechanism":"A structured collection of Constraint#87fes and invariants that defines a validity boundary. It serves as the immutable input for validation logic, distinct from a mutable policy or social Constitution#2391.","invariants":[],"parameters":{},"hash":"sema:RuleSet#mh:SHA-256:c559ef50774606ff9f9e4c154cf483fad91aa709ca08eb17b9cbd211378fdcda","stub":"c559","category":"Data Structures","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"constitution":"Constitution#2391","constraint":"Constraint#87fe"}}},{"id":"OathBind","handle":"OathBind#775a","gloss":"Pre-commitment to penalties","mechanism":"An automated binding mechanism where an Actor#6926 cryptographically commits to a RuleSet#c559. This creates a self-enforcing constraint where deviation triggers an automatic penalty (defined in the rules) via SpotAudit#6673.","invariants":["Automated Justice: Penalty execution depends solely on cryptographic evidence.","Immutability: Rules cannot be changed after signing."],"parameters":{},"hash":"sema:OathBind#mh:SHA-256:775ae6f305c8348cb7fb4d072af79f5cfc14a247b660221c94c9b57c82c665ca","stub":"775a","category":"Verification","layer":"Infrastructure","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"spot_audit":"SpotAudit#6673","actor":"Actor#6926","rule_set":"RuleSet#c559"}}},{"id":"CommitmentDevice","handle":"CommitmentDevice#dbdf","gloss":"Pre-commitment against hyperbolic discounting","mechanism":"Future Self Binding: Anticipate that future self will face temptation or weakness. Remove future options by present action. Examples: delete the app, announce publicly, create penalty for deviation. Cost of breaking commitment must exceed temptation value. It constructs an OathBind#775a contract that penalizes future deviation from the chosen path.","invariants":["Binding: Cost(Breaking) > Benefit(Breaking)","Irrevocability: Agent#cc24 cannot unilaterally remove the constraint"],"parameters":{},"hash":"sema:CommitmentDevice#mh:SHA-256:dbdf489fe9ee22b624663046242ea471580d1e8d01330ff806f6e058f99d6427","stub":"dbdf","category":"Protocols","layer":"Society","signature":[],"preconditions":["Agent#cc24 expects future preference reversal (hyperbolic discounting)"],"postconditions":["Future action set constrained"],"failureModes":[],"dependencies":{"references":{"agent":"Agent#cc24","oath_bind":"OathBind#775a"}}},{"id":"Responsibility","handle":"Responsibility#b5bc","gloss":"Continuous ownership of a system invariant","mechanism":"A standing governance contract where an Agent#cc24 explicitly bonds to a System#e314 Invariant over a specific Scope. Unlike a Task#d9f9 (which has a completion state), Responsibility is a continuous maintenance loop—a 'standing wave' rather than an event. The Agent#cc24 is liable for any violation of the Invariant within the Scope, regardless of cause. Responsibility implies owning externalities. It formalizes ownership via OathBind#775a and requires a continuous Heartbeat#4ddc to prove the invariant is being monitored.","invariants":["Bounded Scope: Responsibility is defined over explicit State#4d58 boundaries","Exclusivity: For any writable State#4d58 S, only one Agent#cc24 can hold WriteResponsibility (Single Writer Principle)","Liveness: Agent#cc24 must produce Heartbeat#4ddc verifying Invariant check"],"parameters":[{"name":"check_interval","type":"Duration","range":"[1s, 1h]","description":"Frequency of invariant verification"},{"name":"escalation_path","type":"String","range":"unspecified","description":"Who to notify on violation"}],"hash":"sema:Responsibility#mh:SHA-256:b5bcfa7fa9d8dc8136d92c4734f1f0590c91f8e26504835f3d4fdbe78dd25177","stub":"b5bc","category":"Governance","layer":"Society","signature":[],"preconditions":["Agent#cc24 has capability to intervene on violations","Agent#cc24 has capability to monitor Scope"],"postconditions":["Invariant is continuously maintained","Violations are detected and reported"],"failureModes":[],"dependencies":{"references":{"task":"Task#d9f9","state":"State#4d58","system":"System#e314","agent":"Agent#cc24","heartbeat":"Heartbeat#4ddc","oath_bind":"OathBind#775a"}}},{"id":"Handoff","handle":"Handoff#2de0","gloss":"Transfer control and context between agents","mechanism":"Transfers control from one Agent#cc24 to another along with relevant Context#510a. The sending Agent#cc24 explicitly yields authority, passing conversation State#4d58, Task#d9f9 Context#510a, and any agent-specific instructions. Used in swarm architectures where specialized Agent#cc24s handle different aspects of a Task#d9f9. It extends Delegate#7dce by transferring full Responsibility#b5bc and authority to the receiving Agent#cc24.","invariants":["Context#510a fully transferred","Responsibility#b5bc atomicity (neither or both hold it briefly, never none)"],"parameters":{},"hash":"sema:Handoff#mh:SHA-256:2de0a5c6841bc988cf1c9662e6916d9d32a710fd021e1c2402a33fd4504e3f08","stub":"2de0","category":"Protocols","layer":"Society","signature":[],"preconditions":["Agent#cc24 A active","Agent#cc24 B ready"],"postconditions":["Agent#cc24 A released","Agent#cc24 B in charge"],"failureModes":[],"dependencies":{"accepts":{"responsibility":"Responsibility#b5bc","task":"Task#d9f9","context":"Context#510a"},"composes_with":{"delegate":"Delegate#7dce"},"references":{"state":"State#4d58","agent":"Agent#cc24"}}},{"id":"Role","handle":"Role#8686","gloss":"Bundle of permissions and responsibilities","mechanism":"A named collection of Permission#f583s and Responsibility#b5bcs assigned to an Agent#cc24. Decouples identity from capability, allowing agents to switch contexts by adopting different roles.","invariants":[],"parameters":{},"hash":"sema:Role#mh:SHA-256:86863ba2706e4082bffc2d73a5a53154eacfc341b792a401476e6658619a8410","stub":"8686","category":"Governance","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"permission":"Permission#f583","agent":"Agent#cc24","responsibility":"Responsibility#b5bc"}}},{"id":"SolverNode","handle":"SolverNode#beef","gloss":"Stateful container for a running solver instance","mechanism":"An active runtime container that wraps a static SolverManifest#67ac with dynamic state. It handles a specific ProblemSpace#78da, tracks Budget#a763 expenditure, and maintains communication with its parent node. The node is the unit of Blame—when it fails, Responsibility#b5bc is attributed here for LocalizedLearning#69bb. It holds the current partial Solution#7186, accumulated cost, and status.","invariants":["Statefulness: Must hold a status (Pending, Active, Solved, Failed).","Linkage: Must maintain pointers to Parent and Children (if any).","Accountability: Failures must be traceable to this node for blame attribution.","Budget Tracking: Must track resources spent vs. allocated."],"parameters":{},"hash":"sema:SolverNode#mh:SHA-256:beefcfc23d5a4377802e8a9f43e9b4bf5369b18fcfe52571d1f028c4ebc51bd7","stub":"beef","category":"Protocols","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"solver_manifest":"SolverManifest#67ac","localized_learning":"LocalizedLearning#69bb","problem_space":"ProblemSpace#78da","solution":"Solution#7186","budget":"Budget#a763","responsibility":"Responsibility#b5bc"}}},{"id":"Workflow","handle":"Workflow#4ec6","gloss":"Directed graph of operations","mechanism":"A directed graph of Step#5f22s where the output of one Solver#1c9b becomes the input of another. It defines the sequence of operations required to complete a complex objective. Unlike a simple chain, a workflow handles branching, parallelism, and conditional logic. Each edge carries a typed Artifact#6254 that must satisfy an AcceptSpec#70dd before the next node can execute. It binds Role#8686s to steps but does not instantiate them.","invariants":["Causality: Step B cannot start before Step A's prerequisites are met.","Acyclicity: Unless explicitly recursive, workflows must terminate.","Artifact Typing: Each edge carries a typed artifact, not raw data."],"parameters":{},"hash":"sema:Workflow#mh:SHA-256:4ec6b1381e22c12d860c3bb55527e018387b1e6be5faa994c7b1700236e00253","stub":"4ec6","category":"Protocols","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"solver":"Solver#1c9b","step":"Step#5f22","accept_spec":"AcceptSpec#70dd","artifact":"Artifact#6254","role":"Role#8686"}}},{"id":"BeamSearch","handle":"BeamSearch#23b1","gloss":"Width-limited heuristic search","mechanism":"A heuristic search algorithm that explores a graph by expanding the most promising SolverNode#beefs in a limited set (the beam). It manages a Queue#2ec3 of fixed size 'k'. At each step, it generates all successors of all nodes in the beam, Rank#cb98s them, and Select#15c2s the top 'k' for the next iteration.","invariants":["Breadth Constraint: Active nodes never exceed Beam Width.","Optimality: The K nodes selected are the highest ranked."],"parameters":[{"name":"beam_width","type":"Integer","range":"[1, 100]","description":"Number of parallel paths to keep"}],"hash":"sema:BeamSearch#mh:SHA-256:23b1817f69e5b2090c5931b8e195437932834e0b1aeb2ebbe9f928bc70adc8eb","stub":"23b1","category":"Strategy","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"queue":"Queue#2ec3","rank":"Rank#cb98","solver_node":"SolverNode#beef","select":"Select#15c2"}}},{"id":"ContextFirst","handle":"ContextFirst#723f","gloss":"Load state before acting","mechanism":"Operational Invariant. Prioritize#dd16 the Context#510a. Before generating tokens or taking action, Agent#cc24 MUST execute a Read operation (e.g., graph_skeleton, search) on the shared state. Blind action is forbidden. It is a mandate for SolverNode#beef to execute a Warmup#fc59 or read-cycle before attempting any write-action.","invariants":["Read-Before-Write: Action timestamp > Context_Refresh timestamp."],"parameters":{},"hash":"sema:ContextFirst#mh:SHA-256:723fc0147c32c39e74048822104401ee5c31ecdc4f7351795d6ef1439120926c","stub":"723f","category":"Inference","layer":"Mind","signature":["Prioritize(Context)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"warmup":"Warmup#fc59","state":"State#4d58","solver_node":"SolverNode#beef","prioritize":"Prioritize#dd16","context":"Context#510a","agent":"Agent#cc24"}}},{"id":"DeliberativeAlign","handle":"DeliberativeAlign#fb93","gloss":"Explicit safety reasoning prior to execution","mechanism":"Constitutional AI. Agent#cc24 ingests a Policy_Set. Before executing Task#d9f9, it generates a 'Safety Trace#9057' comparing the ManifestPlanning#8f61 against Policy. If violation detected, it revises the ManifestPlanning#8f61. It forces the SolverNode#beef to execute a dedicated safety pass against the HydraConstitution#802e before committing to the ManifestPlanning#8f61.","invariants":["Policy Supremacy: If Policy forbids X, and Goal requires X, Agent#cc24 must ABORT.","Pre-Action Check#1544: SafetyTrace must be generated BEFORE any ToolCall."],"parameters":[{"name":"constitution_ref","type":"SemaRef","range":"unspecified","description":"Pointer to HydraConstitution"},{"name":"strictness","type":"Enum","range":"{Strict, Permissive}","description":"Default: Strict"}],"hash":"sema:DeliberativeAlign#mh:SHA-256:fb93216febb5b91b66f8c0021568e16cec72018ecabb494f9382a864d2948908","stub":"fb93","category":"Protocols","layer":"Society","signature":[],"preconditions":["Policy definitions loaded","Task#d9f9 is planned but not executed"],"postconditions":["ManifestPlanning#8f61 validated safe OR revised","Safety reasoning logged"],"failureModes":[],"dependencies":{"references":{"trace":"Trace#9057","manifest_planning":"ManifestPlanning#8f61","solver_node":"SolverNode#beef","check":"Check#1544","context":"Context#510a","hydra_constitution":"HydraConstitution#802e","agent":"Agent#cc24"},"accepts":{"task":"Task#d9f9"}}},{"id":"SolverRoot","handle":"SolverRoot#cb05","gloss":"Genesis authority and framer of a solver tree","mechanism":"The genesis node of a solver tree, anchoring a Task#d9f9 to a coordinated problem-solving effort. The Root has unique authority: Problem Framing (determining initial constraints and ProblemSpace#78da), Budget Allocation (distributing Budget#a763 to child SolverNode#beefs), and Ultimate Accountability (owning final Result#8ed9). The Root propagates the Tree#ddce structure downward and aggregates Solution#7186s upward. When downstream nodes fail, the Root decides whether to reframe the Problem#5baa or escalate failure. The Root is indifferent to whether it orchestrates 'self' (internal reasoning) or 'other' (delegated agents).","invariants":["Genesis: Every solver tree has exactly one active Root.","Ultimate Responsibility: The Root owns the final success/failure of the Task#d9f9.","Authority: Only the Root can reframe the original Problem#5baa."],"parameters":{},"hash":"sema:SolverRoot#mh:SHA-256:cb0502d76289179d7cc606db9940c07685098bb5d9a57184e2ee56cc7ddd96fc","stub":"cb05","category":"Governance","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"task":"Task#d9f9","problem":"Problem#5baa","result":"Result#8ed9","solver_node":"SolverNode#beef","problem_space":"ProblemSpace#78da","solution":"Solution#7186","budget":"Budget#a763","tree":"Tree#ddce"}}},{"id":"WorkerMode","handle":"WorkerMode#7cd7","gloss":"Claim tasks and become the assigned persona","mechanism":"Execution State#4d58 Machine. Upon invoking `solver_claim_task`, the Agent#cc24 performs an atomic Identity#626c Switch#70bf via ContextSwitch#5bb8 using the SolverManifest#67ac. The Agent#cc24 remains in this Mode#b995 until the Task#d9f9 is complete (emitting a Solution#7186 or error to the SolverNode#beef), ensuring adherence to the assigned persona. A Lock#5bf2 prevents concurrent task claims.","invariants":["Identity#626c Lock#5bf2: During WorkerMode, system_prompt MUST == SolverManifest#67ac.persona.","Isolation: Memory Context#510a must be flushed/reset before entering WorkerMode.","Lifecycle Bound: Mode#b995 cannot be exited without emitting a Solution#7186 or Error."],"parameters":{},"hash":"sema:WorkerMode#mh:SHA-256:7cd760cafedf3d37afcff6bc9fbfbedf2d507bab9668095cfaf80f0ed3374257","stub":"7cd7","category":"Protocols","layer":"Society","signature":[],"preconditions":["SolverManifest#67ac defined","Task#d9f9 available in queue"],"postconditions":["Agent#cc24 returns to Idle State#4d58","Task#d9f9 marked Complete/Failed"],"failureModes":[],"dependencies":{"references":{"task":"Task#d9f9","mode":"Mode#b995","switch":"Switch#70bf","state":"State#4d58","context_switch":"ContextSwitch#5bb8","solver_node":"SolverNode#beef","lock":"Lock#5bf2","solution":"Solution#7186","context":"Context#510a","identity":"Identity#626c","agent":"Agent#cc24"},"accepts":{"solver_manifest":"SolverManifest#67ac"}}},{"id":"OrchestrationLoop","handle":"OrchestrationLoop#0144","gloss":"Interpret-Plan-Rollout Lifecycle","mechanism":"A strict lifecycle for high-stakes problem solving implementing Workflow#4ec6. It enforces a sequence: 1. RequestFraming#0695 (Frame Problem → FrameSpec#d5b8), 2. ManifestPlanning#8f61 (Architect Solution → ExecutionManifest#a0d9), 3. Rollout#d742 (Execute safely → RolloutManifest#9e7f). Each transition is mediated by a typed artifact that must pass a non-compensatory AcceptSpec#70dd. The loop can iterate: failed rollouts trigger re-planning, failed plans trigger re-interpretation.","invariants":["Artifact Mediation: All phase transitions MUST pass through typed artifacts.","Non-Compensatory Gates: Each AcceptSpec is binary pass/fail.","Iteration Bound: Maximum loop iterations before escalation."],"parameters":{},"hash":"sema:OrchestrationLoop#mh:SHA-256:0144358c7efa0565bb99fc53eb6e5ee9939ff81a8c09ce03dd9125aaa8a4af18","stub":"0144","category":"Protocols","layer":"Society","signature":["Workflow(Rollout)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"composes_with":{"rollout":"Rollout#d742","manifest_planning":"ManifestPlanning#8f61","request_framing":"RequestFraming#0695"},"references":{"accept_spec":"AcceptSpec#70dd","execution_manifest":"ExecutionManifest#a0d9","workflow":"Workflow#4ec6","frame_spec":"FrameSpec#d5b8","rollout_manifest":"RolloutManifest#9e7f"}}},{"id":"SolverTree","handle":"SolverTree#496e","gloss":"Active hierarchy of coordinated solver instances","mechanism":"The active command hierarchy that organizes SolverNode#beef instances into a coordinated Topology#2408 for solving a Task#d9f9. Unlike a passive data tree, this structure represents the flow of Authority (downwards via delegation) and Results (upwards via reporting). It defines the Chain of Command: resources (Budget#a763) cascade from SolverRoot#cb05 to children, while outcomes propagate back up. Each node in the tree is a unit of Blame—failures can be traced to specific SolverNode#beefs for LocalizedLearning#69bb.","invariants":["Chain of Command: Every node (except root) has exactly one active supervisor.","Budget Flow: Resources flow down; Results flow up.","Connectivity: All nodes must be traceable back to the SolverRoot#cb05.","Acyclicity: The structure must form a DAG or Tree#ddce."],"parameters":{},"hash":"sema:SolverTree#mh:SHA-256:496eab56fade7a64020f6f5e37afd024efc4cb8b691001b403e7bacb61b7c3d8","stub":"496e","category":"Governance","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"localized_learning":"LocalizedLearning#69bb","solver_node":"SolverNode#beef","topology":"Topology#2408","budget":"Budget#a763","solver_root":"SolverRoot#cb05","tree":"Tree#ddce"},"accepts":{"task":"Task#d9f9"}}},{"id":"RecursionDive","handle":"RecursionDive#6a5c","gloss":"Vertical traversal of the solution tree","mechanism":"Execution: The active process of traversing a SolverTree#496e downwards. Accepts a SolverNode#beef, applies the strategy of Decompose#422f to its task, and generates child SolverNode#beefs.","invariants":[],"parameters":{},"hash":"sema:RecursionDive#mh:SHA-256:6a5cac9eb4e9ca22eb83add3a5e4b8b94cc143627cb829b49f5a76684940d13e","stub":"6a5c","category":"Reasoning","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"solver_tree":"SolverTree#496e","solver_node":"SolverNode#beef"},"composes_with":{"decompose":"Decompose#422f"}}},{"id":"UniversalSolverTree","handle":"UniversalSolverTree#64d8","gloss":"Collective knowledge graph of all problem-solving","mechanism":"The theoretical aggregation of all possible valid SolverTree#496es across all agents in the system. It represents the total epistemological state of Problem#5baa-solving knowledge—the collective wisdom of self and others. Any specific problem-solving effort is a traversal or instantiation of a sub-graph within this Universal Tree#ddce. It enables cross-agent learning: identifying redundant efforts, reusing proven SolverNode#beef strategies, and sharing Solution#7186s. The Universal Tree is the ground truth against which LocalizedLearning#69bb updates are integrated.","invariants":["Singularity: There is logically only one Universal Tree#ddce containing all knowledge.","Coherence: Contradictions must eventually be resolved via synthesis or rejection."],"parameters":{},"hash":"sema:UniversalSolverTree#mh:SHA-256:64d835862a3419f898a4bddc54104a5daaed16f65e4e990e961c12274336e7ae","stub":"64d8","category":"Governance","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"problem":"Problem#5baa","localized_learning":"LocalizedLearning#69bb","solver_tree":"SolverTree#496e","solver_node":"SolverNode#beef","solution":"Solution#7186","tree":"Tree#ddce"}}},{"id":"DepthGovernor","handle":"DepthGovernor#a6f6","gloss":"Entropy-based stopping condition for recursion","mechanism":"Entropy-Bounded Recursion: Decomposition depth is not fixed but governed by informational entropy. Agent#cc24 measures uncertainty of current Plan#64f2. If entropy > action_cost_threshold, Decompose#422f further. If entropy < threshold, execute. Stop thinking when uncertainty drops below action cost. Depth is a function of ambiguity, not arbitrary limits. It acts as the termination Condition#cbd5 for RecursionDive#6a5c, halting descent when informational entropy drops below the threshold.","invariants":["Governor cannot be bypassed."],"parameters":[{"name":"entropy_threshold","type":"Float","range":"[0.1, 0.5]","description":"Stop when uncertainty below this"},{"name":"max_depth","type":"Integer","range":"[3, 20]","description":"Hard limit on recursion"}],"hash":"sema:DepthGovernor#mh:SHA-256:a6f623c78e0c6ae7c068e502269f27adecfc084d9454f00f0369f1fd944ffa5e","stub":"a6f6","category":"Strategy","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"problem":"Problem#5baa","recursion_dive":"RecursionDive#6a5c","agent":"Agent#cc24","condition":"Condition#cbd5","loop":"Loop#fb2e","plan":"Plan#64f2","decompose":"Decompose#422f"}}},{"id":"MarginalValueRule","handle":"MarginalValueRule#aea3","gloss":"Economic stop-condition for recursion","mechanism":"The economic Budget#a763 governor of RecursionDive#6a5c. It permits going one level deeper only if Expected Improvement in Quality > Incremental Cost. It calculates the marginal value of additional depth using Estimate#bb30 and compares against remaining Budget#a763. This ensures the system solves problems with precision proportional to their stakes—simple problems get shallow treatment, complex problems get deep exploration.","invariants":["Marginal Comparison: Dive only if E[ΔQuality] > Cost(Dive).","Budget Respect: Never approve a dive that exceeds remaining budget.","Diminishing Returns: Deeper levels must show proportionally higher marginal value."],"parameters":{},"hash":"sema:MarginalValueRule#mh:SHA-256:aea3ccd2f413700043fed8c949cabea597179b15bf9a85a175c736eab6bb3cce","stub":"aea3","category":"Economics","layer":"Society","signature":["Budget(RecursionDive)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"budget":"Budget#a763","estimate":"Estimate#bb30","recursion_dive":"RecursionDive#6a5c"}}},{"id":"CognitiveSolver","handle":"CognitiveSolver#4962","gloss":"The universal polymorphic atom of recursive intelligence","mechanism":"The universal polymorphic atom of intelligence. A CognitiveSolver is any entity—from a fleeting thought process to a complex swarm—that implements the 5-Stage Cognitive Contract (Manifest via Card#5c33, Execute, Question, Verify via Validate#3de2, Feedback). It acts as a fractal node in the UniversalSolverTree#64d8, accepting a Task#d9f9 and using Reason#3f24 to orchestrate a lifecycle on a SolverNode#beef. It yields a Solution#7186, wrapping operations like ToolInvoke#cf0a with ComputeBudget#3b98 checks, SocraticLoop#10e9 refinement, or Reflexion#51b9 for self-improvement.","invariants":["Polymorphism: External Runtime treats all Solvers identically via this Interface.","Recursion: Solver must accept sub-tasks via the same Interface it exposes."],"parameters":{},"hash":"sema:CognitiveSolver#mh:SHA-256:4962ffd534b3a87584f3ba6c57f7db3ae2aa0fd0461fd0363f35418cc3cfe8b7","stub":"4962","category":"Strategy","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"yields":{"solution":"Solution#7186"},"composes_with":{"reflexion":"Reflexion#51b9","socratic_loop":"SocraticLoop#10e9","tool_invoke":"ToolInvoke#cf0a","reason":"Reason#3f24","compute_budget":"ComputeBudget#3b98"},"accepts":{"task":"Task#d9f9"},"references":{"validate":"Validate#3de2","solver_node":"SolverNode#beef","universal_solver_tree":"UniversalSolverTree#64d8","card":"Card#5c33"}}},{"id":"ProblemFramer","handle":"ProblemFramer#f83d","gloss":"The active strategist that frames the problem","mechanism":"A specialized solver role that Interpret#c9ees an initial request via RequestFraming#0695, constructs the formal AcceptSpec#70dd (Definition of Done), and anchors the resulting SolverRoot#cb05 to the UniversalSolverTree#64d8. Unlike a general Solver (which executes), the Framer's sole output is a well-formed Problem Node ready for decomposition, or a Reframe#ba00 request if invalid.","invariants":["Genesis: Must create exactly one active Root per problem instance.","Ownership: Owns the high-level success/failure of the task."],"parameters":{},"hash":"sema:ProblemFramer#mh:SHA-256:f83d5805391f1691dec04c63685ee048954f06b8e7bec3b305b89b77b579dc48","stub":"f83d","category":"Coordination","layer":"Society","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"composes_with":{"interpret":"Interpret#c9ee","reframe":"Reframe#ba00","request_framing":"RequestFraming#0695"},"yields":{"accept_spec":"AcceptSpec#70dd"},"references":{"universal_solver_tree":"UniversalSolverTree#64d8","solver_root":"SolverRoot#cb05"}}},{"id":"Taper","handle":"Taper#bff8","gloss":"Progressive ambiguity collapse from noisy input to certain output. Examples: Sema Discovery, Hiring pipelines, Compiler passes.","mechanism":"A multi-stage Sequence#b0b8 process that accepts wide-aperture, high-entropy inputs and progressively filters them through Gate#206ds or TriGate#a30fs of increasing strictness. Each stage: (1) Applies a stage-specific acceptance threshold, acting as a functional DepthGovernor#a6f6; (2) Reduces the candidate set to Compress#0967 the search space; (3) Increases certainty. Final stage outputs zero-entropy signal (deterministic, unambiguous). Failure modes are stage-appropriate: Early stages optimize for recall (don't lose valid signals), Late stages optimize for precision (don't pass garbage).","invariants":["Monotonic Narrowing: |candidates[n+1]| <= |candidates[n]|","Strictness Increase: threshold[n+1] > threshold[n]","Terminal Certainty: final stage tolerance = 0"],"parameters":[{"name":"stages","type":"Integer","range":"[2, N]","description":"Number of progressive refinement stages from broad to precise"},{"name":"early_bias","type":"Enum","range":"{Recall, Balanced}","description":"Search strategy in early stages (Recall = cast wide net)"},{"name":"late_bias","type":"Enum","range":"{Precision, Balanced}","description":"Search strategy in late stages (Precision = narrow to exact match)"}],"hash":"sema:Taper#mh:SHA-256:bff8bb6ee32c4f709ea2128ae6bcd6af688cd5145cc4af8f13639e3be4135a46","stub":"bff8","category":"Protocols","layer":"Society","signature":["Sequence(Gate)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"composes_with":{"tri_gate":"TriGate#a30f","gate":"Gate#206d","sequence":"Sequence#b0b8"},"references":{"compress":"Compress#0967","depth_governor":"DepthGovernor#a6f6"}}},{"id":"PUREOptimization","handle":"PUREOptimization#c352","gloss":"Deeply optimizing a solution across PURE dimensions","mechanism":"A multi-agent Optimize#3075 strategy. It accepts a candidate Solution#7186 that has already passed the PURECheck#b8ca. It Decompose#422fs the solution into four parallel streams, assigning a specialized CognitiveSolver#4962 to maximize each PURE metric: Parsimony#2578 (Efficiency), Novelty#2218 (Uniqueness), Realizable#199e (Feasibility), and Expansive#ad2d (Impact). The results are re-integrated via Synthesis#3252 to find the ParetoFront#9091 among competing improvements.","invariants":["Monotonic Improvement: The output score must be >= input score on all axes.","Non-Destructive: Optimization of one axis (e.g., Parsimony) must not break another (e.g., Realizable)."],"parameters":{},"hash":"sema:PUREOptimization#mh:SHA-256:c352abb258a026750e2cb364eff05df4b53965b2ddabb180f5693353d2a0bb50","stub":"c352","category":"Strategy","layer":"Mind","signature":["Optimize(Solution)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"composes_with":{"cognitive_solver":"CognitiveSolver#4962","decompose":"Decompose#422f","optimize":"Optimize#3075","synthesis":"Synthesis#3252"},"references":{"pure_check":"PURECheck#b8ca","realizable":"Realizable#199e","pareto_front":"ParetoFront#9091","novelty":"Novelty#2218","expansive":"Expansive#ad2d","parsimony":"Parsimony#2578"},"accepts":{"solution":"Solution#7186"}}},{"id":"RealizationProtocol","handle":"RealizationProtocol#b477","gloss":"Standard Interpret-Plan-Rollout workflow to ensure realizability","mechanism":"A standardized SolverTree#496e that orchestrates the lifecycle of a user_request executed by a CognitiveSolver#4962. It enforces a strict phase transition from Abstract to Concrete to ensure the result is Realizable#199e. 1. Interpret#c9ee converts request -> FrameSpec#d5b8. 2. ManifestPlanning#8f61 converts spec -> ExecutionManifest#a0d9. 3. Rollout#d742 executes the manifest to produce the Outcome#38e0.","invariants":["Artifacts at Seams: Transitions MUST be mediated by the specified artifacts.","Non-Compensatory: If an artifact fails its spec, the process halts.","Realizability: The outcome must be Realizable (concrete, actionable, feasible)."],"parameters":{},"hash":"sema:RealizationProtocol#mh:SHA-256:b47747d471756b93236a056095a5232a042f54eec5f15b0fcacf9ba302fbe3b1","stub":"b477","category":"Protocols","layer":"Society","signature":["SolverTree(Outcome)"],"preconditions":["user_request received","Agent Team available"],"postconditions":["final_outcome Shipped","Process Logged"],"failureModes":[],"dependencies":{"composes_with":{"rollout":"Rollout#d742","interpret":"Interpret#c9ee","manifest_planning":"ManifestPlanning#8f61"},"references":{"realizable":"Realizable#199e","solver_tree":"SolverTree#496e","execution_manifest":"ExecutionManifest#a0d9","cognitive_solver":"CognitiveSolver#4962","frame_spec":"FrameSpec#d5b8"},"yields":{"outcome":"Outcome#38e0"}}},{"id":"RigorousSolver","handle":"RigorousSolver#151a","gloss":"High-reliability, high-latency System 2 solver","mechanism":"A high-reliability, high-latency implementation of CognitiveSolver#4962. Unlike the base interface which allows best-effort resolution, RigorousSolver MANDATES strict verification: it must execute Probe#9f2b to verify reality alignment and engage in SocraticLoop#10e9 to disambiguate intent before action. It incorporates Feedback#9b5c to improve future reliability. It trades speed for assurance (System 2).","invariants":["Lifecycle Completeness: Must complete all 5 stages including Verification.","Mandatory Verification: Cannot skip Probe step."],"parameters":{},"hash":"sema:RigorousSolver#mh:SHA-256:151a5f118efaa4275a0735761c266e5656f4e7e8fda559c84b7c75be7b7384e0","stub":"151a","category":"Strategy","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"references":{"socratic_loop":"SocraticLoop#10e9","cognitive_solver":"CognitiveSolver#4962"},"composes_with":{"feedback":"Feedback#9b5c","probe":"Probe#9f2b"}}},{"id":"FractalIntelligence","handle":"FractalIntelligence#df09","gloss":"The unified fractal architecture of scalable, self-correcting intelligence","mechanism":"The unified System#e314 of scalable cognition that uses Reason#3f24 to orchestrate the fractal expansion of intelligence within the UniversalSolverTree#64d8. A ProblemFramer#f83d initiates the process, formulating a high-level Strategy#47a4 before assigning a CognitiveSolver#4962 to a Task#d9f9. The solver executes a RecursionDive#6a5c to spawn child nodes. As the tree deepens, nodes apply Specialize#d968 to adapt to local sub-problems, using LocalizedLearning#69bb to optimize performance. To ensure continuity and global coherence, the system employs ExperienceSharding#65cc to preserve memory and Synthesis#3252 to integrate specialized insights back into the whole. StateSnapshot#01c9 creates save points for crash recovery. Efficiency is governed by the MarginalValueRule#aea3. If a path fails, Reframe#ba00 is triggered to restructure the tree or find a new ProblemFramer#f83d.","invariants":["Fractal Self-Similarity: The process at the Root is identical to the process at the Leaf.","Bounded Expansion: Recursion is limited by Economic constraints (Marginal Value).","Memory Conservation: Specialization must not result in the loss of global context."],"parameters":{},"hash":"sema:FractalIntelligence#mh:SHA-256:df09b597001e3e975150d888627cc798bca06da74bff4de85225a9ac8ddd11c8","stub":"df09","category":"Protocols","layer":"Society","signature":["System(Reason)"],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"composes_with":{"cognitive_solver":"CognitiveSolver#4962","recursion_dive":"RecursionDive#6a5c","reason":"Reason#3f24","localized_learning":"LocalizedLearning#69bb","problem_framer":"ProblemFramer#f83d","reframe":"Reframe#ba00","state_snapshot":"StateSnapshot#01c9","marginal_value_rule":"MarginalValueRule#aea3","synthesis":"Synthesis#3252"},"references":{"task":"Task#d9f9","system":"System#e314","strategy":"Strategy#47a4","universal_solver_tree":"UniversalSolverTree#64d8","experience_sharding":"ExperienceSharding#65cc","specialize":"Specialize#d968"}}},{"id":"PUREBrainstorming","handle":"PUREBrainstorming#9191","gloss":"Generate -> Check -> Optimize -> Propose","mechanism":"A rigorous ideation protocol. Unlike standard brainstorming (which prioritizes quantity), PUREBrainstorming enforces immediate quality filtering. It generates candidate concepts and subjects them to PURECheck#b8ca. Surviving concepts undergo PUREOptimization#c352 to maximize their scores. The process converges only when a concept can be fully articulated as a MechanisticDesignProposal#8cf7, ensuring that every idea is backed by a causal mechanism.","invariants":["Filter-First: No concept moves to the Proposal stage without passing PURECheck.","Mechanistic Rigor: The final output must match the MechanisticDesignProposal schema."],"parameters":{},"hash":"sema:PUREBrainstorming#mh:SHA-256:91919a162e79e32c28e829ba3e7f2b55d345cf1f200b100e771caef7016fc59e","stub":"9191","category":"Strategy","layer":"Mind","signature":[],"preconditions":[],"postconditions":[],"failureModes":[],"dependencies":{"composes_with":{"pure_check":"PURECheck#b8ca","pure_optimization":"PUREOptimization#c352"},"yields":{"mechanistic_design_proposal":"MechanisticDesignProposal#8cf7"}}},{"id":"OptimisticSolver","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.","invariants":["Turn Atomicity: Must output [BID] and [TOOL] in the same response.","Non-Blocking: Cannot wait for Orchestrator approval on standard tasks."],"parameters":{},"hash":"sema:OptimisticSolver#mh:SHA-256:0e2edb38b8469329a7c4cb40c08c87c590f0f37ae17f34e5d6b5477964ef340e","stub":"0e2e","category":"Protocols","layer":"Society","signature":[],"preconditions":["Runtime supports Asynchronous/Parallel message delivery (Actor Model).","Message Bus is non-blocking (Mailbox pattern)."],"postconditions":[],"failureModes":[],"dependencies":{"composes_with":{"compensate":"Compensate#2f1d","reflexion":"Reflexion#51b9","compute_budget":"ComputeBudget#3b98","atomic_bid":"AtomicBid#15a1"},"references":{"parallel":"Parallel#6272","rigorous_solver":"RigorousSolver#151a","cognitive_solver":"CognitiveSolver#4962"}}}]