{"nodes":[{"id":"Artifact","text":"Artifact#6254","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Artifact#6254","gloss":"Immutable data unit","stub":"6254","metadata":{"pattern":{"handle":"Artifact","mechanism":"A discrete, immutable unit of data produced by a solver or workflow. It serves as a typed input/output token.","gloss":"Immutable data unit","failure_modes":["Link Rot: The artifact persists conceptually but the storage medium fails.","Hash Collision: Two different artifacts produce the same ID (theoretical risk)."],"invariants":["Immutability: Once minted, the content cannot change.","Addressability: Must be referenceable by a content-derived hash."],"_meta":{"tier":1,"layer":"Infrastructure","category":"Data Structures","ring":0},"sema_id":"sema:Artifact#mh:SHA-256:6254c09973118bce3ba2813b7494dee7a61c8b2a87fbcb4d2830f9fbf8d29cf9","sema_ref":"Artifact#6254","sema_stub":"6254","sema_layer":"Infrastructure","sema_category":"Data Structures","data_schema":{"type":"object","required":["hash","content_type","uri"],"properties":{"hash":{"type":"string","description":"SHA-256 content hash (Immutable ID)"},"content_type":{"type":"string","description":"MIME type (e.g., application/json, text/markdown)"},"uri":{"type":"string","description":"Storage location (s3://, ipfs://, or memory://)"},"size_bytes":{"type":"integer"},"metadata":{"type":"object","description":"Author, timestamp, tags"}}}},"layer":"Infrastructure","category":"Data Structures"}},{"id":"dd940360-426a-4ae0-beec-23a09aa3df9d","text":"Infrastructure","type":"LAYER","layer":null,"category":null,"handle":"Infrastructure","gloss":null,"stub":null,"metadata":{}},{"id":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","text":"Data Structures","type":"CATEGORY","layer":null,"category":null,"handle":"Data Structures","gloss":null,"stub":null,"metadata":{}},{"id":"35350dbe-196c-4e0e-8a8c-196659812ed7","text":"Immutability: Once minted, the content cannot change.","type":"INVARIANT","layer":null,"category":null,"handle":"Immutability: Once minted, the content cannot change.","gloss":null,"stub":null,"metadata":{}},{"id":"cd79781c-00a7-48df-a23f-6a34a842b825","text":"Addressability: Must be referenceable by a content-derived hash.","type":"INVARIANT","layer":null,"category":null,"handle":"Addressability: Must be referenceable by a content-derived hash.","gloss":null,"stub":null,"metadata":{}},{"id":"Assessment","text":"Assessment#a765","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Assessment#a765","gloss":"Structured qualitative feedback","stub":"a765","metadata":{"pattern":{"handle":"Assessment","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.","gloss":"Structured qualitative feedback","invariants":["Actionability: Must contain at least one specific recommendation.","Reference: Must cite specific parts of the target artifact."],"sema_id":"sema:Assessment#mh:SHA-256:a76518b956c1f22aec39c6402db8725510ea23bd6eda56844ef118a948de3c77","sema_ref":"Assessment#a765","sema_stub":"a765","_meta":{"layer":"Infrastructure","category":"Data Structures","ring":1,"tier":1},"sema_layer":"Infrastructure","sema_category":"Data Structures","data_schema":{"type":"object","required":["target_ref","recommendations"],"properties":{"target_ref":{"type":"string","description":"Reference to artifact being assessed"},"strengths":{"type":"array","items":{"type":"string"},"description":"Positive aspects"},"weaknesses":{"type":"array","items":{"type":"string"},"description":"Areas for improvement"},"recommendations":{"type":"array","items":{"type":"string"},"description":"Actionable suggestions"}}}},"layer":"Infrastructure","category":"Data Structures"}},{"id":"bf3caf09-374e-4596-acb3-3e54512e941e","text":"Actionability: Must contain at least one specific recommendation.","type":"INVARIANT","layer":null,"category":null,"handle":"Actionability: Must contain at least one specific recommendation.","gloss":null,"stub":null,"metadata":{}},{"id":"544b6fe7-5bce-47c5-b480-1de8c7e6f458","text":"Reference: Must cite specific parts of the target artifact.","type":"INVARIANT","layer":null,"category":null,"handle":"Reference: Must cite specific parts of the target artifact.","gloss":null,"stub":null,"metadata":{}},{"id":"Axiom","text":"Axiom#5012","type":"PATTERN","layer":"Society","category":"Protocols","handle":"Axiom#5012","gloss":"Foundational truth","stub":"5012","metadata":{"pattern":{"handle":"Axiom","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.","gloss":"Foundational truth","_meta":{"layer":"Society","category":"Protocols","ring":1,"tier":1},"sema_layer":"Society","sema_category":"Protocols","sema_id":"sema:Axiom#mh:SHA-256:50121ab598ddbe31a5c35482eb3ddd598ec8e64d797811ab765027e88975dded","sema_ref":"Axiom#5012","sema_stub":"5012"},"layer":"Society","category":"Protocols"}},{"id":"edbe6b2e-5cba-4798-b009-b8f6a0d86323","text":"Society","type":"LAYER","layer":null,"category":null,"handle":"Society","gloss":null,"stub":null,"metadata":{}},{"id":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","text":"Protocols","type":"CATEGORY","layer":null,"category":null,"handle":"Protocols","gloss":null,"stub":null,"metadata":{}},{"id":"Backoff","text":"Backoff#315a","type":"PATTERN","layer":"Infrastructure","category":"Primitives","handle":"Backoff#315a","gloss":"Exponential delay to reduce contention","stub":"315a","metadata":{"pattern":{"handle":"Backoff","mechanism":"Exponential Delay: On failure, wait delay D before retry. On repeated failure, D *= multiplier (typically 2). Add jitter to prevent thundering herd. Cap at maximum delay. Reset on success.","gloss":"Exponential delay to reduce contention","failure_modes":["Starvation: Unlucky agents keep backing off while others succeed, never getting a slot."],"invariants":["retry budget must be finite (max_attempts set before first attempt)."],"parameters":[{"name":"base_delay","type":"Duration","range":"[100ms, 10s]","description":"Initial wait before retry"},{"name":"jitter_factor","type":"Float","range":"[0.0, 0.5]","description":"Randomization to prevent thundering herd"},{"name":"max_retries","type":"Integer","range":"[1, 10]","description":"Attempts before permanent failure"}],"_meta":{"tier":2,"layer":"Infrastructure","category":"Primitives","ring":0},"sema_id":"sema:Backoff#mh:SHA-256:315a36ef873a63c30740ce89b1aeb542836a068ef0d81a6e3aaaec062d70bc60","sema_ref":"Backoff#315a","sema_stub":"315a","sema_layer":"Infrastructure","sema_category":"Primitives"},"layer":"Infrastructure","category":"Primitives"}},{"id":"8f497759-ce27-442f-9c55-27f3c2ad7c49","text":"Primitives","type":"CATEGORY","layer":null,"category":null,"handle":"Primitives","gloss":null,"stub":null,"metadata":{}},{"id":"8fae7156-7046-4ae0-9c9d-9571dcb17f13","text":"retry budget must be finite (max_attempts set before first attempt).","type":"INVARIANT","layer":null,"category":null,"handle":"retry budget must be finite (max_attempts set before first attempt).","gloss":null,"stub":null,"metadata":{}},{"id":"BaseRateInclude","text":"BaseRateInclude#aa0b","type":"PATTERN","layer":"Mind","category":"Inference","handle":"BaseRateInclude#aa0b","gloss":"Outside view over inside view","stub":"aa0b","metadata":{"pattern":{"handle":"BaseRateInclude","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.","gloss":"Outside view over inside view","failure_modes":["Reference Class Tennis: Gaming the output by cherry-picking a favorable reference class."],"invariants":["Base rate source must be reference class relevant","Posterior probability must respect prior base rate"],"preconditions":["General population statistics","Specific case evidence"],"postconditions":["Probability estimate adjusted towards mean"],"_meta":{"tier":1,"layer":"Mind","category":"Inference","related":["BayesUpdate"],"ring":2},"sema_id":"sema:BaseRateInclude#mh:SHA-256:aa0b8b4d62885496dfbe0caffc5def9e15fb9fee63d787918bce4be8593f0916","sema_ref":"BaseRateInclude#aa0b","sema_stub":"aa0b","sema_layer":"Mind","sema_category":"Inference"},"layer":"Mind","category":"Inference"}},{"id":"1609c741-f64f-447a-9dcd-cfeecd560a7f","text":"Mind","type":"LAYER","layer":null,"category":null,"handle":"Mind","gloss":null,"stub":null,"metadata":{}},{"id":"90800e2d-25ad-47b4-9463-179cdb2d083f","text":"Inference","type":"CATEGORY","layer":null,"category":null,"handle":"Inference","gloss":null,"stub":null,"metadata":{}},{"id":"4fc11393-9bc5-43a8-8a61-4c18f38e8cbd","text":"Base rate source must be reference class relevant","type":"INVARIANT","layer":null,"category":null,"handle":"Base rate source must be reference class relevant","gloss":null,"stub":null,"metadata":{}},{"id":"3eacaa43-7532-45a8-8adb-9f3ae69f48c2","text":"Posterior probability must respect prior base rate","type":"INVARIANT","layer":null,"category":null,"handle":"Posterior probability must respect prior base rate","gloss":null,"stub":null,"metadata":{}},{"id":"70320f54-4296-443c-8e55-cf3bcf0ff59c","text":"General population statistics","type":"PRECONDITION","layer":null,"category":null,"handle":"General population statistics","gloss":null,"stub":null,"metadata":{}},{"id":"e9c6ad4a-20e8-4367-aade-e4cd5702c54d","text":"Specific case evidence","type":"PRECONDITION","layer":null,"category":null,"handle":"Specific case evidence","gloss":null,"stub":null,"metadata":{}},{"id":"9bc9cab7-0d19-4230-abb4-ad450a3448f9","text":"Probability estimate adjusted towards mean","type":"POSTCONDITION","layer":null,"category":null,"handle":"Probability estimate adjusted towards mean","gloss":null,"stub":null,"metadata":{}},{"id":"Branch","text":"Branch#329d","type":"PATTERN","layer":"Physics","category":"Time","handle":"Branch#329d","gloss":"Conditional flow","stub":"329d","metadata":{"pattern":{"handle":"Branch","mechanism":"Conditional fork: if C then A else B. Mutual exclusion.","gloss":"Conditional flow","_meta":{"tier":1,"layer":"Physics","category":"Time","ring":0},"sema_id":"sema:Branch#mh:SHA-256:329d01a4bcf9599389d35db860faee9fb6d42964ceca8fd708843b410fa7150e","sema_ref":"Branch#329d","sema_stub":"329d","sema_layer":"Physics","sema_category":"Time"},"layer":"Physics","category":"Time"}},{"id":"bf10f73c-8b8e-4c32-9dd4-40c93954f2f7","text":"Physics","type":"LAYER","layer":null,"category":null,"handle":"Physics","gloss":null,"stub":null,"metadata":{}},{"id":"e5a36812-8586-4359-8f6a-7c5631923812","text":"Time","type":"CATEGORY","layer":null,"category":null,"handle":"Time","gloss":null,"stub":null,"metadata":{}},{"id":"Budget","text":"Budget#a763","type":"PATTERN","layer":"Infrastructure","category":"Primitives","handle":"Budget#a763","gloss":"Resource allocation limit","stub":"a763","metadata":{"pattern":{"handle":"Budget","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.","gloss":"Resource allocation limit","data_schema":{"type":"object","required":["total","remaining","unit"],"properties":{"total":{"type":"number","description":"The initial allocated amount"},"remaining":{"type":"number","description":"The current available amount"},"unit":{"type":"string","enum":["Tokens","USD","Ms"],"description":"The unit of measurement"}}},"invariants":["Non-Negative: Remaining budget cannot be < 0.","Conservation: Allocated + Remaining = Total."],"preconditions":["Total budget defined"],"postconditions":["Budget decremented by cost"],"_meta":{"tier":1,"layer":"Infrastructure","category":"Primitives","ring":0},"sema_ref":"Budget#a763","sema_id":"sema:Budget#mh:SHA-256:a7637c4387d834ae190f6c42a2a96914c65294a9f618c4c96adf4ee1d26450e0","sema_stub":"a763","sema_layer":"Infrastructure","sema_category":"Primitives"},"layer":"Infrastructure","category":"Primitives"}},{"id":"27f93cc6-2469-498d-accb-26ca5c05334a","text":"Non-Negative: Remaining budget cannot be < 0.","type":"INVARIANT","layer":null,"category":null,"handle":"Non-Negative: Remaining budget cannot be < 0.","gloss":null,"stub":null,"metadata":{}},{"id":"d696e573-a0a4-4906-ac64-bc01c141f811","text":"Conservation: Allocated + Remaining = Total.","type":"INVARIANT","layer":null,"category":null,"handle":"Conservation: Allocated + Remaining = Total.","gloss":null,"stub":null,"metadata":{}},{"id":"631cdcce-3fdb-4cb9-96e6-5713855be4cc","text":"Total budget defined","type":"PRECONDITION","layer":null,"category":null,"handle":"Total budget defined","gloss":null,"stub":null,"metadata":{}},{"id":"42086226-4684-4a86-9146-bdbb15f8af27","text":"Budget decremented by cost","type":"POSTCONDITION","layer":null,"category":null,"handle":"Budget decremented by cost","gloss":null,"stub":null,"metadata":{}},{"id":"Category","text":"Category#1ab7","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Category#1ab7","gloss":"Grouping of objects","stub":"1ab7","metadata":{"pattern":{"handle":"Category","data_schema":{"type":"object","required":["label"],"properties":{"label":{"type":"string","description":"Name of the category"},"parent":{"type":"string","description":"Parent category ID (optional, for hierarchies)"},"members":{"type":"array","items":{"type":"string"},"description":"IDs of items belonging to this category"}}},"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.","gloss":"Grouping of objects","_meta":{"layer":"Infrastructure","category":"Data Structures","ring":1,"tier":1},"sema_layer":"Infrastructure","sema_category":"Data Structures","sema_id":"sema:Category#mh:SHA-256:1ab7e3c9863286a33d2be0ec51112ecfadef9e46a07f5f15b9f6cd33f74d8bd1","sema_ref":"Category#1ab7","sema_stub":"1ab7"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"Compare","text":"Compare#4881","type":"PATTERN","layer":"Mind","category":"Reasoning","handle":"Compare#4881","gloss":"Relational check","stub":"4881","metadata":{"pattern":{"handle":"Compare","mechanism":"Evaluate relation between two values: Equal, Less, Greater, Incomparable.","gloss":"Relational check","invariants":["Reflexivity: A == A is always True.","Symmetry: If A == B, then B == A.","Transitivity: If A == B and B == C, then A == C."],"_meta":{"tier":1,"layer":"Mind","category":"Reasoning","ring":0},"sema_id":"sema:Compare#mh:SHA-256:48815374a8845487f135578867a9a36ffeeb0e786007b63da5713292723e2109","sema_ref":"Compare#4881","sema_stub":"4881","sema_layer":"Mind","sema_category":"Reasoning"},"layer":"Mind","category":"Reasoning"}},{"id":"e38ff6e0-872e-4a63-a7ea-ebb84e174347","text":"Reasoning","type":"CATEGORY","layer":null,"category":null,"handle":"Reasoning","gloss":null,"stub":null,"metadata":{}},{"id":"b020829b-9579-4a0f-91f1-9aea956b9c4c","text":"Reflexivity: A == A is always True.","type":"INVARIANT","layer":null,"category":null,"handle":"Reflexivity: A == A is always True.","gloss":null,"stub":null,"metadata":{}},{"id":"54c7e59c-b8b1-4fff-be1c-a3299cdc5936","text":"Symmetry: If A == B, then B == A.","type":"INVARIANT","layer":null,"category":null,"handle":"Symmetry: If A == B, then B == A.","gloss":null,"stub":null,"metadata":{}},{"id":"15907d93-9f5d-4920-851e-ec6f7c3697db","text":"Transitivity: If A == B and B == C, then A == C.","type":"INVARIANT","layer":null,"category":null,"handle":"Transitivity: If A == B and B == C, then A == C.","gloss":null,"stub":null,"metadata":{}},{"id":"Compress","text":"Compress#0967","type":"PATTERN","layer":"Physics","category":"Primitives","handle":"Compress#0967","gloss":"Lossy or lossless reduction","stub":"0967","metadata":{"pattern":{"handle":"Compress","mechanism":"Reducing information size while preserving essential meaning.","gloss":"Lossy or lossless reduction","invariants":["Size Reduction: Output size must be strictly less than Input size.","Reconstructability: (For lossless) Inverse(Output) == Input."],"_meta":{"tier":1,"layer":"Physics","category":"Primitives","ring":0},"sema_id":"sema:Compress#mh:SHA-256:0967b06ee8a76319b59ee923f2302ff5aebac89f396d79b55f2a0f9e1239f621","sema_ref":"Compress#0967","sema_stub":"0967","sema_layer":"Physics","sema_category":"Primitives"},"layer":"Physics","category":"Primitives"}},{"id":"5b24b112-00e7-492d-b5a3-3d6610d7c6cb","text":"Size Reduction: Output size must be strictly less than Input size.","type":"INVARIANT","layer":null,"category":null,"handle":"Size Reduction: Output size must be strictly less than Input size.","gloss":null,"stub":null,"metadata":{}},{"id":"4a3e9663-11a6-471e-8604-6870887cec4a","text":"Reconstructability: (For lossless) Inverse(Output) == Input.","type":"INVARIANT","layer":null,"category":null,"handle":"Reconstructability: (For lossless) Inverse(Output) == Input.","gloss":null,"stub":null,"metadata":{}},{"id":"ConceptAnchor","text":"ConceptAnchor#9187","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"ConceptAnchor#9187","gloss":"Pinning meaning to immutable references","stub":"9187","metadata":{"pattern":{"handle":"ConceptAnchor","data_schema":{"type":"object","required":["definition_hash"],"properties":{"definition_hash":{"type":"string","description":"Content-addressed hash of the anchored definition"},"content":{"description":"The actual definition content - any valid JSON (schema, text, or structured data)"},"metadata":{"type":"object","description":"Optional metadata (creator, timestamp, version)"}}},"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.","gloss":"Pinning meaning to immutable references","failure_modes":["Link rot (if anchors disappear)."],"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"],"_meta":{"tier":1,"layer":"Infrastructure","category":"Data Structures","ring":2},"sema_id":"sema:ConceptAnchor#mh:SHA-256:91873000b379e08c41bc3fe3fea23f1f0870600871f89cca46ecbc87cc1d69d0","sema_ref":"ConceptAnchor#9187","sema_stub":"9187","sema_layer":"Infrastructure","sema_category":"Data Structures"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"d6a588d6-f49c-42e0-b251-5b18ea015b90","text":"Immutability: The definition pointed to by the Anchor Hash cannot change","type":"INVARIANT","layer":null,"category":null,"handle":"Immutability: The definition pointed to by the Anchor Hash cannot change","gloss":null,"stub":null,"metadata":{}},{"id":"279555ce-852c-44a9-af72-c2a5219b41a6","text":"Immutable Reference","type":"INVARIANT","layer":null,"category":null,"handle":"Immutable Reference","gloss":null,"stub":null,"metadata":{}},{"id":"529eeee8-cede-4fff-9011-9f26d18c8bc2","text":"Resolution: The Anchor must resolve to a valid schema or content","type":"INVARIANT","layer":null,"category":null,"handle":"Resolution: The Anchor must resolve to a valid schema or content","gloss":null,"stub":null,"metadata":{}},{"id":"Condition","text":"Condition#cbd5","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Condition#cbd5","gloss":"Interface for patterns that evaluate to a boolean truth-value","stub":"cbd5","metadata":{"pattern":{"handle":"Condition","data_schema":{"type":"object","required":["predicate"],"properties":{"predicate":{"type":"string","description":"The boolean expression or check to evaluate"},"required_context":{"type":"array","items":{"type":"string"},"description":"Keys that must be present in context for evaluation"},"timeout_ms":{"type":"integer","description":"Maximum time allowed for evaluation before returning Error"}}},"mechanism":"A marker interface (Trait). Patterns implementing 'Condition' MUST provide an evaluation logic that returns a strict Boolean (True/False) based on provided context.","gloss":"Interface for patterns that evaluate to a boolean truth-value","failure_modes":["Ambiguity: Returning 'Maybe' or probabilistic float where Boolean is required."],"invariants":["Boolean Output: Result must be binary.","Decidability: Must always return a value (or error), never hang."],"_meta":{"tier":1,"layer":"Infrastructure","category":"Data Structures","ring":0},"sema_id":"sema:Condition#mh:SHA-256:cbd53b7aaedc24a8cb5f0b95661b5053850b6fd8198ba6d490bc8b7374739c6e","sema_ref":"Condition#cbd5","sema_stub":"cbd5","sema_layer":"Infrastructure","sema_category":"Data Structures"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"c72a6acd-9d9a-44a2-8970-28e52ee090f3","text":"Boolean Output: Result must be binary.","type":"INVARIANT","layer":null,"category":null,"handle":"Boolean Output: Result must be binary.","gloss":null,"stub":null,"metadata":{}},{"id":"4c4a6886-a050-45bb-b4ad-25b627cca09a","text":"Decidability: Must always return a value (or error), never hang.","type":"INVARIANT","layer":null,"category":null,"handle":"Decidability: Must always return a value (or error), never hang.","gloss":null,"stub":null,"metadata":{}},{"id":"ConfirmationBlock","text":"ConfirmationBlock#3dae","type":"PATTERN","layer":"Mind","category":"Inference","handle":"ConfirmationBlock#3dae","gloss":"Active search for contradictory evidence","stub":"3dae","metadata":{"pattern":{"handle":"ConfirmationBlock","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.","gloss":"Active search for contradictory evidence","failure_modes":["Performative Doubt: Generating weak counter-evidence just to tick the box, without genuine intent to falsify."],"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"}],"_meta":{"tier":2,"layer":"Mind","category":"Inference","ring":0,"related":["DissentSeek"]},"sema_id":"sema:ConfirmationBlock#mh:SHA-256:3daea9633d69418a61fe6cca9416ab47156bef6d7b594a2c7be753b06205dadf","sema_ref":"ConfirmationBlock#3dae","sema_stub":"3dae","sema_layer":"Mind","sema_category":"Inference"},"layer":"Mind","category":"Inference"}},{"id":"6ef15b3c-a080-49c8-b718-ffcf06223ac9","text":"Evidence must be independently verifiable.","type":"INVARIANT","layer":null,"category":null,"handle":"Evidence must be independently verifiable.","gloss":null,"stub":null,"metadata":{}},{"id":"Constraint","text":"Constraint#87fe","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Constraint#87fe","gloss":"Non-negotiable boundary condition","stub":"87fe","metadata":{"pattern":{"handle":"Constraint","data_schema":{"type":"object","required":["constraint_type","expression"],"properties":{"constraint_type":{"type":"string","enum":["resource","safety","legal","physical"],"description":"Category of constraint"},"expression":{"type":"string","description":"The constraint as a boolean expression or inequality"},"priority":{"type":"integer","description":"Enforcement order when multiple constraints apply"},"source":{"type":"string","description":"Origin of the constraint (parent task, law, etc.)"}}},"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.","gloss":"Non-negotiable boundary condition","failure_modes":["Constraint Relaxation: Silently loosening a constraint to fit a preferred solution.","Hidden Constraint: A real-world constraint not captured in the specification.","Constraint Conflict: Two constraints are mutually exclusive (no solution exists)."],"invariants":["Non-Compensatory: Violation of any constraint = rejection.","Inheritance: Child constraints must include all parent constraints.","Explicitness: All constraints must be stated, not implied."],"_meta":{"tier":1,"layer":"Infrastructure","category":"Data Structures","ring":0},"sema_id":"sema:Constraint#mh:SHA-256:87fec7246c97fce8fbd2a8cf829d08f623839f9f6da7a3c4a7db2a2bf70a9551","sema_ref":"Constraint#87fe","sema_stub":"87fe","sema_layer":"Infrastructure","sema_category":"Data Structures"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"1f5bee46-a32a-4d46-8279-1b31909fde70","text":"Non-Compensatory: Violation of any constraint = rejection.","type":"INVARIANT","layer":null,"category":null,"handle":"Non-Compensatory: Violation of any constraint = rejection.","gloss":null,"stub":null,"metadata":{}},{"id":"2e00dae2-b41a-4bba-b380-4f95b911841c","text":"Inheritance: Child constraints must include all parent constraints.","type":"INVARIANT","layer":null,"category":null,"handle":"Inheritance: Child constraints must include all parent constraints.","gloss":null,"stub":null,"metadata":{}},{"id":"cb75f865-1d33-4d93-8b33-614a13eee97b","text":"Explicitness: All constraints must be stated, not implied.","type":"INVARIANT","layer":null,"category":null,"handle":"Explicitness: All constraints must be stated, not implied.","gloss":null,"stub":null,"metadata":{}},{"id":"Creative","text":"Creative#5574","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"Creative#5574","gloss":"Generating novelty and value","stub":"5574","metadata":{"pattern":{"handle":"Creative","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.","gloss":"Generating novelty and value","_meta":{"tier":1,"layer":"Mind","category":"Strategy","ring":1},"sema_id":"sema:Creative#mh:SHA-256:557440d0f12d6169d83249769ab27aee03e1d662d53c58ae91589c1a6ad4c151","sema_ref":"Creative#5574","sema_stub":"5574","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"7022f5a2-2592-4f7b-b435-a2bd088476ff","text":"Strategy","type":"CATEGORY","layer":null,"category":null,"handle":"Strategy","gloss":null,"stub":null,"metadata":{}},{"id":"CryptoShred","text":"CryptoShred#e0b9","type":"PATTERN","layer":"Infrastructure","category":"Primitives","handle":"CryptoShred#e0b9","gloss":"Provable deletion of liability data","stub":"e0b9","metadata":{"pattern":{"handle":"CryptoShred","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).","gloss":"Provable deletion of liability data","failure_modes":["Key backup leaks (if the key was copied before destruction)."],"invariants":["Shred confirmation required."],"_meta":{"tier":2,"layer":"Infrastructure","category":"Primitives","related":["GlacialVault"],"ring":0},"sema_id":"sema:CryptoShred#mh:SHA-256:e0b99771b604e6fdd9311327bfd36cc7745106047662e6870a8fc7f3aaacaf07","sema_ref":"CryptoShred#e0b9","sema_stub":"e0b9","sema_layer":"Infrastructure","sema_category":"Primitives"},"layer":"Infrastructure","category":"Primitives"}},{"id":"ed5f9485-a12a-48f6-af41-50639501e9f6","text":"Shred confirmation required.","type":"INVARIANT","layer":null,"category":null,"handle":"Shred confirmation required.","gloss":null,"stub":null,"metadata":{}},{"id":"Datum","text":"Datum#31cf","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Datum#31cf","gloss":"Raw unit of fact","stub":"31cf","metadata":{"pattern":{"handle":"Datum","data_schema":{"type":"object","required":["payload","source_id"],"properties":{"payload":{"description":"The raw fact or value (any valid JSON)"},"source_id":{"type":"string","description":"Origin of the datum"},"timestamp":{"type":"string","format":"date-time"}}},"mechanism":"A single unit of raw, unprocessed fact. Unlike information, it has no attached meaning yet, just existence. Singular of Data.","gloss":"Raw unit of fact","_meta":{"layer":"Infrastructure","category":"Data Structures","ring":1,"tier":1},"sema_layer":"Infrastructure","sema_category":"Data Structures","sema_id":"sema:Datum#mh:SHA-256:31cf815f74eb603adc09807862a9f295e90a97280509e6078c7cb63eff1edd3b","sema_ref":"Datum#31cf","sema_stub":"31cf"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"Deep","text":"Deep#89f0","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"Deep#89f0","gloss":"Vertical search dimension","stub":"89f0","metadata":{"pattern":{"handle":"Deep","mechanism":"The vertical dimension of search (Recursion/Detail). Recursively expanding a node to increase resolution, as opposed to Broad exploration.","gloss":"Vertical search dimension","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."],"_meta":{"tier":1,"layer":"Mind","category":"Strategy","ring":2},"sema_id":"sema:Deep#mh:SHA-256:89f02aa7bc72cf8798b5619ae123bf4da38cff92f5147a436729ce2af17f897b","sema_ref":"Deep#89f0","sema_stub":"89f0","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"26428a14-9ec8-4145-8bbe-5c9aba8cbaf0","text":"Functional Equivalence: Target must answer the same question as Source.","type":"INVARIANT","layer":null,"category":null,"handle":"Functional Equivalence: Target must answer the same question as Source.","gloss":null,"stub":null,"metadata":{}},{"id":"d57793c6-4cd2-4670-a7d5-597cfafa8874","text":"Rigor Increase: Target must have higher compute/context cost than Source.","type":"INVARIANT","layer":null,"category":null,"handle":"Rigor Increase: Target must have higher compute/context cost than Source.","gloss":null,"stub":null,"metadata":{}},{"id":"7210b90d-9571-4f1e-9d61-74baba0f091d","text":"Resolution Increase: Child nodes must be more specific than parent.","type":"INVARIANT","layer":null,"category":null,"handle":"Resolution Increase: Child nodes must be more specific than parent.","gloss":null,"stub":null,"metadata":{}},{"id":"ExecutionManifest","text":"ExecutionManifest#a0d9","type":"PATTERN","layer":"Society","category":"Protocols","handle":"ExecutionManifest#a0d9","gloss":"Binding of Design and Procedure","stub":"a0d9","metadata":{"pattern":{"handle":"ExecutionManifest","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.","gloss":"Binding of Design and Procedure","invariants":["Completeness: Must contain both Specification (Design) and Steps (Procedure).","Resource Bound: Total cost of Steps must be within budget."],"_meta":{"layer":"Society","category":"Protocols","ring":0,"tier":1,"related":["Plan","Build","Rollout"]},"sema_id":"sema:ExecutionManifest#mh:SHA-256:a0d9a0d0ec40b83b5b05044e38d37098ebdabf1c63a4e623031458f0896e5538","sema_ref":"ExecutionManifest#a0d9","sema_stub":"a0d9","sema_layer":"Society","sema_category":"Protocols","data_schema":{"type":"object","required":["manifest_id","steps"],"properties":{"manifest_id":{"type":"string"},"target_system_id":{"type":"string"},"steps":{"type":"array","items":{"type":"object","required":["step_id","action","params"],"properties":{"step_id":{"type":"string"},"action":{"type":"string"},"params":{"type":"object"},"rollback_action":{"type":"string"}}}},"estimated_cost":{"type":"number"},"safety_checks":{"type":"array","items":{"type":"string"}}}}},"layer":"Society","category":"Protocols"}},{"id":"32d0e588-6623-4ea5-95ef-045bcefeb35f","text":"Completeness: Must contain both Specification (Design) and Steps (Procedure).","type":"INVARIANT","layer":null,"category":null,"handle":"Completeness: Must contain both Specification (Design) and Steps (Procedure).","gloss":null,"stub":null,"metadata":{}},{"id":"3f057d16-02d9-4bd5-89e7-6d2b9d6569c3","text":"Resource Bound: Total cost of Steps must be within budget.","type":"INVARIANT","layer":null,"category":null,"handle":"Resource Bound: Total cost of Steps must be within budget.","gloss":null,"stub":null,"metadata":{}},{"id":"Global","text":"Global#803d","type":"PATTERN","layer":"Society","category":"Protocols","handle":"Global#803d","gloss":"System-wide scope","stub":"803d","metadata":{"pattern":{"handle":"Global","mechanism":"Scope modifier indicating that a concept or operation applies to the entire system or context, rather than a local subset.","gloss":"System-wide scope","_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":0},"sema_id":"sema:Global#mh:SHA-256:803d9dfe9fd3e6b4901fcc0dcbbcdaba7861b3ce89146d012ca78857b176e7ab","sema_ref":"Global#803d","sema_stub":"803d","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"Hypothesis","text":"Hypothesis#e95b","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Hypothesis#e95b","gloss":"A tentative explanation","stub":"e95b","metadata":{"pattern":{"handle":"Hypothesis","data_schema":{"type":"object","required":["proposition","confidence"],"properties":{"proposition":{"type":"string","description":"The tentative explanation"},"confidence":{"type":"number","description":"Initial probability estimate (0-1)"},"status":{"type":"string","enum":["Open","Proven","Falsified"]}}},"mechanism":"A tentative explanation or prediction that is subject to verification or falsification.","gloss":"A tentative explanation","_meta":{"tier":1,"layer":"Infrastructure","category":"Data Structures","ring":0},"sema_layer":"Infrastructure","sema_category":"Data Structures","sema_id":"sema:Hypothesis#mh:SHA-256:e95b94f3066236d1b543330c46d177a5e2e590ea5bdd97953f589226a9f11812","sema_ref":"Hypothesis#e95b","sema_stub":"e95b"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"InputGuard","text":"InputGuard#0770","type":"PATTERN","layer":"Infrastructure","category":"Verification","handle":"InputGuard#0770","gloss":"Input validation and sanitization","stub":"0770","metadata":{"pattern":{"handle":"InputGuard","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.","gloss":"Input validation and sanitization","_meta":{"tier":2,"layer":"Infrastructure","category":"Verification","ring":0},"sema_ref":"InputGuard#0770","sema_id":"sema:InputGuard#mh:SHA-256:077022daa9665f3562ad8253b9b6c63ccf7e71d84b74ab48c44e6de421b8bdcb","sema_stub":"0770","sema_layer":"Infrastructure","sema_category":"Verification"},"layer":"Infrastructure","category":"Verification"}},{"id":"579b02af-c094-442f-8ef9-67bcd86bd62f","text":"Verification","type":"CATEGORY","layer":null,"category":null,"handle":"Verification","gloss":null,"stub":null,"metadata":{}},{"id":"Kairos","text":"Kairos#5e42","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"Kairos#5e42","gloss":"Sensing the opportune moment","stub":"5e42","metadata":{"pattern":{"handle":"Kairos","mechanism":"Aggregates environmental signals (receptivity, system load, friction) to calculate a 'Readiness Potential'. Returns TRUE if the potential exceeds the sensitivity threshold.","gloss":"Sensing the opportune moment","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"}],"_meta":{"tier":1,"layer":"Mind","category":"Strategy","ring":2},"sema_id":"sema:Kairos#mh:SHA-256:5e4224ffffb7866b6c865b3b95fee40b2259e6b515ee594a680d9f0ed7c18314","sema_ref":"Kairos#5e42","sema_stub":"5e42","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"db44f9fb-2bbd-497e-845a-c1f02ba758db","text":"Ephemerality: A True result at t=0 implies nothing about t+1.","type":"INVARIANT","layer":null,"category":null,"handle":"Ephemerality: A True result at t=0 implies nothing about t+1.","gloss":null,"stub":null,"metadata":{}},{"id":"a3444315-b521-4bce-8d10-da0685f5dab6","text":"Non-Compensatory: If the moment is wrong, more effort cannot fix it.","type":"INVARIANT","layer":null,"category":null,"handle":"Non-Compensatory: If the moment is wrong, more effort cannot fix it.","gloss":null,"stub":null,"metadata":{}},{"id":"Lock","text":"Lock#5bf2","type":"PATTERN","layer":"Physics","category":"Primitives","handle":"Lock#5bf2","gloss":"Mutual exclusion enforcement","stub":"5bf2","metadata":{"pattern":{"handle":"Lock","mechanism":"A synchronization primitive that enforces exclusive access to a resource.","gloss":"Mutual exclusion enforcement","_meta":{"tier":1,"layer":"Physics","category":"Primitives","ring":0},"sema_id":"sema:Lock#mh:SHA-256:5bf2a80b6c73a11da68f702922d5180259c75ff50fb094607da3ab4d7c167dc2","sema_ref":"Lock#5bf2","sema_stub":"5bf2","sema_layer":"Physics","sema_category":"Primitives"},"layer":"Physics","category":"Primitives"}},{"id":"MECE","text":"MECE#8cb0","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"MECE#8cb0","gloss":"Mutually Exclusive, Collectively Exhaustive partitioning","stub":"8cb0","metadata":{"pattern":{"handle":"MECE","data_schema":{"type":"object","required":["root_set","subsets"],"properties":{"root_set":{"type":"string","description":"The universe being partitioned"},"subsets":{"type":"array","description":"The mutually exclusive categories"},"completeness_proof":{"type":"string","description":"Logic ensuring exhaustiveness"}}},"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.","gloss":"Mutually Exclusive, Collectively Exhaustive partitioning","failure_modes":["The Other Bucket Trap: 'Misc' category exceeds threshold.","Dimensional Error: Partitioning criteria mixed (e.g., Color vs Origin).","False Exclusivity: Edge cases ignored to force fit."],"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'"}],"_meta":{"tier":2,"layer":"Infrastructure","category":"Data Structures","related":["sema:Decompose#mh:SHA-256:31c56ead72462a2b55d1056d6d4878a4e031ebb43b7160743b861aa1c294cafe"],"ring":2},"sema_layer":"Infrastructure","sema_category":"Data Structures","sema_id":"sema:MECE#mh:SHA-256:8cb062d51bcfd89368c58a5e6247e2070596f01be8e03382dd19a0c61abe8c1b","sema_ref":"MECE#8cb0","sema_stub":"8cb0"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"671691a3-4e97-4221-8625-310bf5c4a960","text":"Exclusivity: Intersection(Subset_i, Subset_j) == NULL","type":"INVARIANT","layer":null,"category":null,"handle":"Exclusivity: Intersection(Subset_i, Subset_j) == NULL","gloss":null,"stub":null,"metadata":{}},{"id":"1204beda-8e8b-4cdf-9bd5-0b317b86ac90","text":"Exhaustiveness: Union(Subsets) == UniversalSet","type":"INVARIANT","layer":null,"category":null,"handle":"Exhaustiveness: Union(Subsets) == UniversalSet","gloss":null,"stub":null,"metadata":{}},{"id":"Meta","text":"Meta#90f4","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Meta#90f4","gloss":"Higher-order abstraction","stub":"90f4","metadata":{"pattern":{"handle":"Meta","data_schema":{"type":"object","required":["level","target"],"properties":{"level":{"type":"integer","minimum":1,"description":"Abstraction level (1 = meta, 2 = meta-meta, etc.)"},"target":{"type":"string","description":"ID or type of the entity being abstracted over"},"description":{"type":"string","description":"What aspect is being meta-analyzed"}}},"mechanism":"A higher-order modifier indicating self-reference or abstraction (Thinking about Thinking).","gloss":"Higher-order abstraction","_meta":{"tier":1,"layer":"Infrastructure","category":"Data Structures","ring":0},"sema_id":"sema:Meta#mh:SHA-256:90f452433c8b16a65d5842745b4cbb586957b1f45becbfca2322fece945ad3ee","sema_ref":"Meta#90f4","sema_stub":"90f4","sema_layer":"Infrastructure","sema_category":"Data Structures"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"MonitorReport","text":"MonitorReport#063c","type":"PATTERN","layer":"Society","category":"Protocols","handle":"MonitorReport#063c","gloss":"Deployment telemetry artifact","stub":"063c","metadata":{"pattern":{"handle":"MonitorReport","mechanism":"A telemetry artifact comparing the deployed state against a 'Definition of Done'. Generated to close the feedback loop.","gloss":"Deployment telemetry artifact","_meta":{"layer":"Society","category":"Protocols","ring":0,"tier":1,"related":["Monitor"]},"sema_id":"sema:MonitorReport#mh:SHA-256:063cc5c1f90b2e11e3446ddfaec7034ed51acb83432fe11ba2d1e7151ac0d42d","sema_ref":"MonitorReport#063c","sema_stub":"063c","sema_layer":"Society","sema_category":"Protocols","data_schema":{"type":"object","required":["manifest_ref","metrics"],"properties":{"manifest_ref":{"type":"string","description":"Reference to RolloutManifest"},"metrics":{"type":"object","description":"Observed telemetry data"},"definition_of_done":{"type":"object","description":"Expected success criteria"},"deviation":{"type":"object","description":"Difference from expected state"}}}},"layer":"Society","category":"Protocols"}},{"id":"Option","text":"Option#483e","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Option#483e","gloss":"A discrete, executable alternative","stub":"483e","metadata":{"pattern":{"handle":"Option","data_schema":{"type":"object","required":["option_id","description","predicted_outcome"],"properties":{"option_id":{"type":"string"},"description":{"type":"string"},"cost_estimate":{"type":"number"},"risk_score":{"type":"number","minimum":0.0,"maximum":1.0},"predicted_outcome":{"type":"string","description":"Simulation result if this option is chosen"}}},"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.","gloss":"A discrete, executable alternative","_meta":{"layer":"Infrastructure","category":"Data Structures","ring":1,"tier":1},"sema_id":"sema:Option#mh:SHA-256:483eebf0a4fdc817585be429278bf1c8c56b815249bbf91501073dce1453cf13","sema_ref":"Option#483e","sema_stub":"483e","sema_layer":"Infrastructure","sema_category":"Data Structures"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"Parallel","text":"Parallel#6272","type":"PATTERN","layer":"Physics","category":"Time","handle":"Parallel#6272","gloss":"Concurrent flow","stub":"6272","metadata":{"pattern":{"handle":"Parallel","mechanism":"Concurrent execution: A and B simultaneously. No ordering guarantee.","gloss":"Concurrent flow","_meta":{"tier":1,"layer":"Physics","category":"Time","ring":0},"sema_id":"sema:Parallel#mh:SHA-256:6272e213685ff8b1c909c783ae0859f93c55d3423c4278661a4b601ddf07d7a3","sema_ref":"Parallel#6272","sema_stub":"6272","sema_layer":"Physics","sema_category":"Time"},"layer":"Physics","category":"Time"}},{"id":"Prompt","text":"Prompt#5ded","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Prompt#5ded","gloss":"Model input instruction","stub":"5ded","metadata":{"pattern":{"handle":"Prompt","mechanism":"The input text or instruction provided to a generative model.","gloss":"Model input instruction","_meta":{"tier":1,"layer":"Infrastructure","category":"Data Structures","ring":0},"data_schema":{"type":"object","properties":{"text":{"type":"string"},"role":{"type":"string"}},"required":["text"]},"sema_id":"sema:Prompt#mh:SHA-256:5dedb478148eb9ca7b2621a571316aefcdb475174141a64c04c0a8c890355107","sema_ref":"Prompt#5ded","sema_stub":"5ded","sema_layer":"Infrastructure","sema_category":"Data Structures"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"Protocol","text":"Protocol#7e1c","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Protocol#7e1c","gloss":"Communication standard","stub":"7e1c","metadata":{"pattern":{"handle":"Protocol","data_schema":{"type":"object","required":["protocol_id","version","rules"],"properties":{"protocol_id":{"type":"string","description":"Unique protocol identifier"},"version":{"type":"string","description":"Semantic version (e.g., '1.0.0')"},"rules":{"type":"array","items":{"type":"string"},"description":"List of rules defining the protocol"},"formats":{"type":"object","description":"Message format specifications"}}},"mechanism":"A defined set of rules and formats for communication between agents.","gloss":"Communication standard","failure_modes":["Version Drift: Agents attempting to communicate with incompatible protocol versions.","Ambiguous Spec: Rules that allow for multiple valid interpretations."],"_meta":{"tier":1,"layer":"Infrastructure","category":"Data Structures","ring":0},"sema_id":"sema:Protocol#mh:SHA-256:7e1cc426d8550edc0ee84d4e4fd7b7dc3aecdfad496dc3e2cc636c36a7f4389e","sema_ref":"Protocol#7e1c","sema_stub":"7e1c","sema_layer":"Infrastructure","sema_category":"Data Structures"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"Prototype","text":"Prototype#ff18","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Prototype#ff18","gloss":"Testable early model","stub":"ff18","metadata":{"pattern":{"handle":"Prototype","data_schema":{"type":"object","required":["prototype_id","fidelity"],"properties":{"prototype_id":{"type":"string","description":"Unique identifier"},"fidelity":{"type":"string","enum":["low","medium","high"],"description":"How close to final product"},"artifact":{"description":"The prototype content or reference"},"learnings":{"type":"array","items":{"type":"string"},"description":"What was learned from this prototype"}}},"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.","gloss":"Testable early model","_meta":{"tier":1,"layer":"Infrastructure","category":"Data Structures","ring":1},"sema_id":"sema:Prototype#mh:SHA-256:ff187305136dd60765caedabd5eefbc62c94b20909c4886f4baef3c9523e83c7","sema_ref":"Prototype#ff18","sema_stub":"ff18","sema_layer":"Infrastructure","sema_category":"Data Structures"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"Reflex","text":"Reflex#ea07","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"Reflex#ea07","gloss":"Hardcoded fast-path responses bypassing deliberation","stub":"ea07","metadata":{"pattern":{"handle":"Reflex","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.","gloss":"Hardcoded fast-path responses bypassing deliberation","failure_modes":["Reflex Hijack: Adversary triggers reflex to override deliberate reasoning."],"invariants":["Stimulus-response mapping immutable at runtime."],"_meta":{"tier":2,"layer":"Mind","category":"Strategy","related":["sema:HeuristicSnap#mh:SHA-256:6f2b735d0b7733162773dd6f40559acbd482e1fdeebae179b2ed9cc61d2307a7"],"ring":0},"sema_id":"sema:Reflex#mh:SHA-256:ea07e889ca64536b2f0d0657d1583a178ea36fe2fda6c26889c68d46e44a47ce","sema_ref":"Reflex#ea07","sema_stub":"ea07","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"59a4c283-2f99-4571-832a-a558bfbc8146","text":"Stimulus-response mapping immutable at runtime.","type":"INVARIANT","layer":null,"category":null,"handle":"Stimulus-response mapping immutable at runtime.","gloss":null,"stub":null,"metadata":{}},{"id":"RolloutManifest","text":"RolloutManifest#9e7f","type":"PATTERN","layer":"Society","category":"Protocols","handle":"RolloutManifest#9e7f","gloss":"Deployment execution log","stub":"9e7f","metadata":{"pattern":{"handle":"RolloutManifest","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.","gloss":"Deployment execution log","invariants":["Immutability: Cannot be modified after deployment.","Completeness: Must record all state changes applied."],"_meta":{"layer":"Society","category":"Protocols","ring":0,"tier":1,"related":["Rollout"]},"sema_id":"sema:RolloutManifest#mh:SHA-256:9e7fe2b3bcd73879f8f55164530c8f5e6773a39b9719cfaca8dce18452ac1463","sema_ref":"RolloutManifest#9e7f","sema_stub":"9e7f","sema_layer":"Society","sema_category":"Protocols","data_schema":{"type":"object","required":["deployment_id","actions"],"properties":{"deployment_id":{"type":"string","description":"Unique deployment identifier"},"actions":{"type":"array","items":{"type":"object"},"description":"Actions taken during deployment"},"config_states":{"type":"object","description":"Configuration at deployment time"},"feature_flags":{"type":"object","description":"Feature flag settings"}}}},"layer":"Society","category":"Protocols"}},{"id":"236fa6be-973c-4add-8c8a-ef9393519e62","text":"Immutability: Cannot be modified after deployment.","type":"INVARIANT","layer":null,"category":null,"handle":"Immutability: Cannot be modified after deployment.","gloss":null,"stub":null,"metadata":{}},{"id":"44a2a083-43e2-4593-9d02-3700f8476b27","text":"Completeness: Must record all state changes applied.","type":"INVARIANT","layer":null,"category":null,"handle":"Completeness: Must record all state changes applied.","gloss":null,"stub":null,"metadata":{}},{"id":"Sandbox","text":"Sandbox#2be7","type":"PATTERN","layer":"Infrastructure","category":"Primitives","handle":"Sandbox#2be7","gloss":"Isolation boundary","stub":"2be7","metadata":{"pattern":{"handle":"Sandbox","mechanism":"An isolated execution environment that restricts side effects.","gloss":"Isolation boundary","_meta":{"tier":2,"layer":"Infrastructure","category":"Primitives","ring":1,"related":["AgentSandbox","CircuitBreaker","SafetyCartographer"]},"sema_id":"sema:Sandbox#mh:SHA-256:2be7b830454b430d8008cb54622a5c1a6434a6e076d7bbdaca4d2a5b1a1dadf0","sema_ref":"Sandbox#2be7","sema_stub":"2be7","sema_layer":"Infrastructure","sema_category":"Primitives"},"layer":"Infrastructure","category":"Primitives"}},{"id":"Scratchpad","text":"Scratchpad#75bf","type":"PATTERN","layer":"Mind","category":"Memory","handle":"Scratchpad#75bf","gloss":"Working memory for intermediate reasoning steps","stub":"75bf","metadata":{"pattern":{"handle":"Scratchpad","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.","gloss":"Working memory for intermediate reasoning steps","failure_modes":["Scratchpad Leak: Internal working notes accidentally included in user-facing output.","Memory Overflow: Scratchpad grows unboundedly, consuming context window."],"invariants":["Bounded: Maximum scratchpad size is enforced","Persistence: Contents survive across reasoning steps within a task","Separation: Scratchpad content is distinct from final output"],"_meta":{"tier":2,"layer":"Mind","category":"Memory","ring":0},"sema_id":"sema:Scratchpad#mh:SHA-256:75bf0d045bf0907b1412c0698a7a5f7cffb2963b653646c0831ec1d3bdab186e","sema_ref":"Scratchpad#75bf","sema_stub":"75bf","sema_layer":"Mind","sema_category":"Memory","data_schema":{"type":"object","required":["content"],"properties":{"content":{"type":"string","description":"Working memory contents"},"max_size":{"type":"integer","description":"Maximum allowed size in tokens"},"owner_id":{"type":"string","description":"Agent that owns this scratchpad"}}}},"layer":"Mind","category":"Memory"}},{"id":"6fe7b13d-4ed3-4c51-ae9a-7943dd282dbf","text":"Memory","type":"CATEGORY","layer":null,"category":null,"handle":"Memory","gloss":null,"stub":null,"metadata":{}},{"id":"480de0ff-4041-40e9-a2d6-c093d0d8007e","text":"Bounded: Maximum scratchpad size is enforced","type":"INVARIANT","layer":null,"category":null,"handle":"Bounded: Maximum scratchpad size is enforced","gloss":null,"stub":null,"metadata":{}},{"id":"dedacd95-01ae-4652-98af-3b9f51237c54","text":"Persistence: Contents survive across reasoning steps within a task","type":"INVARIANT","layer":null,"category":null,"handle":"Persistence: Contents survive across reasoning steps within a task","gloss":null,"stub":null,"metadata":{}},{"id":"310e8805-a232-4090-ae42-303715ed79ef","text":"Separation: Scratchpad content is distinct from final output","type":"INVARIANT","layer":null,"category":null,"handle":"Separation: Scratchpad content is distinct from final output","gloss":null,"stub":null,"metadata":{}},{"id":"Select","text":"Select#15c2","type":"PATTERN","layer":"Infrastructure","category":"Primitives","handle":"Select#15c2","gloss":"Generic selection of items from a set based on criteria","stub":"15c2","metadata":{"pattern":{"handle":"Select","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.","gloss":"Generic selection of items from a set based on criteria","failure_modes":["Empty Result: No items satisfy the criterion (returns empty set).","Predicate Error: The criterion function fails or throws an error for specific inputs."],"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."],"preconditions":["Criterion is decidable for item type","Input set is iterable"],"postconditions":["Subset returned"],"parameters":[{"name":"limit","type":"Integer","range":"[1, 10000]","description":"Max items to return"},{"name":"strategy","type":"Enum","range":"{Filter, First, Random}","description":"Default: Filter"}],"_meta":{"tier":1,"layer":"Infrastructure","category":"Primitives","ring":0},"sema_id":"sema:Select#mh:SHA-256:15c257d42d18f33a5a4bdf1ef5ab16712dfd0293cd03ebb28ce746a119f0dfcc","sema_ref":"Select#15c2","sema_stub":"15c2","sema_layer":"Infrastructure","sema_category":"Primitives"},"layer":"Infrastructure","category":"Primitives"}},{"id":"198c8d0e-0851-4ae5-8b7b-f0e965dd34fc","text":"Predicate Truth: For all x in Output, Criterion(x) must be True.","type":"INVARIANT","layer":null,"category":null,"handle":"Predicate Truth: For all x in Output, Criterion(x) must be True.","gloss":null,"stub":null,"metadata":{}},{"id":"aa1e6b77-06f8-4a4a-8d19-8f387f8989e0","text":"Subset Property: Output must be a subset of Input (no new items created).","type":"INVARIANT","layer":null,"category":null,"handle":"Subset Property: Output must be a subset of Input (no new items created).","gloss":null,"stub":null,"metadata":{}},{"id":"720bf58a-72e0-4ddb-85eb-9bd6814cf4b8","text":"Determinism: Same input set + same criteria = same output set.","type":"INVARIANT","layer":null,"category":null,"handle":"Determinism: Same input set + same criteria = same output set.","gloss":null,"stub":null,"metadata":{}},{"id":"36dcd26e-3a6a-4e1a-8d2d-bc2caa835d65","text":"Criterion is decidable for item type","type":"PRECONDITION","layer":null,"category":null,"handle":"Criterion is decidable for item type","gloss":null,"stub":null,"metadata":{}},{"id":"5d4f5421-a263-42ee-bad3-2ce4ed713f8d","text":"Input set is iterable","type":"PRECONDITION","layer":null,"category":null,"handle":"Input set is iterable","gloss":null,"stub":null,"metadata":{}},{"id":"d5414515-6bb5-427b-bd95-50a96b7cb7b8","text":"Subset returned","type":"POSTCONDITION","layer":null,"category":null,"handle":"Subset returned","gloss":null,"stub":null,"metadata":{}},{"id":"Sequence","text":"Sequence#b0b8","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Sequence#b0b8","gloss":"Sequential ordering","stub":"b0b8","metadata":{"pattern":{"handle":"Sequence","data_schema":{"type":"object","required":["steps"],"properties":{"steps":{"type":"array","items":{"type":"string"},"description":"Ordered list of step IDs"},"current_index":{"type":"integer","description":"Index of currently executing step"},"completed":{"type":"array","items":{"type":"string"},"description":"IDs of completed steps"}}},"mechanism":"Ordered execution: A then B. Output of A available to B.","gloss":"Sequential ordering","_meta":{"tier":1,"layer":"Infrastructure","category":"Data Structures","ring":0},"sema_id":"sema:Sequence#mh:SHA-256:b0b8e964bbbea762dc40b4b6c1f26de9542a2fec19412e0094c7288c2a54553f","sema_ref":"Sequence#b0b8","sema_stub":"b0b8","sema_layer":"Infrastructure","sema_category":"Data Structures"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"Signal","text":"Signal#f39d","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Signal#f39d","gloss":"Raw information emission","stub":"f39d","metadata":{"pattern":{"handle":"Signal","data_schema":{"type":"object","required":["signal_id","payload"],"properties":{"signal_id":{"type":"string","description":"Unique identifier for this emission"},"payload":{"description":"The information being emitted (any valid JSON)"},"emitter_id":{"type":"string","description":"Source of the signal (optional)"},"timestamp":{"type":"string","format":"date-time","description":"When signal was emitted"}}},"mechanism":"Emission of information into environment. No guaranteed recipient. Fire-and-forget.","gloss":"Raw information emission","invariants":["Broadcast: Signal is available to any observer in the medium.","Information: Must distinguish itself from noise."],"_meta":{"tier":1,"layer":"Infrastructure","category":"Data Structures","ring":0},"sema_id":"sema:Signal#mh:SHA-256:f39d9ead873eb693a51f3944066dae67a238b07cd9ba6e194023785fa7d884fe","sema_ref":"Signal#f39d","sema_stub":"f39d","sema_layer":"Infrastructure","sema_category":"Data Structures"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"bbbe2609-8b46-45d7-b4a1-9ee417d1bdab","text":"Broadcast: Signal is available to any observer in the medium.","type":"INVARIANT","layer":null,"category":null,"handle":"Broadcast: Signal is available to any observer in the medium.","gloss":null,"stub":null,"metadata":{}},{"id":"14874262-74ad-4558-a028-5e35fe9a61fb","text":"Information: Must distinguish itself from noise.","type":"INVARIANT","layer":null,"category":null,"handle":"Information: Must distinguish itself from noise.","gloss":null,"stub":null,"metadata":{}},{"id":"Skeleton","text":"Skeleton#c363","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Skeleton#c363","gloss":"Parallel outline-first topology","stub":"c363","metadata":{"pattern":{"handle":"Skeleton","data_schema":{"type":"object","required":["outline"],"properties":{"outline":{"type":"array","items":{"type":"string"},"description":"High-level points to be expanded"},"expansions":{"type":"object","description":"Map of outline point index to expanded content"}}},"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.","gloss":"Parallel outline-first topology","invariants":["Independence: Expansion of Point A must not depend on Point B."],"_meta":{"tier":1,"layer":"Infrastructure","category":"Data Structures","ring":2},"sema_id":"sema:Skeleton#mh:SHA-256:c363c9db1e917d4920a28b689c8e0f3fcfcd7060fde1963cea22b352570d5c87","sema_ref":"Skeleton#c363","sema_stub":"c363","sema_layer":"Infrastructure","sema_category":"Data Structures"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"4a54eb73-6274-4909-932c-cc3353503271","text":"Independence: Expansion of Point A must not depend on Point B.","type":"INVARIANT","layer":null,"category":null,"handle":"Independence: Expansion of Point A must not depend on Point B.","gloss":null,"stub":null,"metadata":{}},{"id":"Step","text":"Step#5f22","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Step#5f22","gloss":"Atomic action with pre/post conditions","stub":"5f22","metadata":{"pattern":{"handle":"Step","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.","gloss":"Atomic action with pre/post conditions","failure_modes":["Precondition Violation: Step executed when preconditions not met.","Postcondition Failure: Step completes but postconditions not achieved.","Rollback Failure: Unable to undo a failed step."],"invariants":["Atomicity: A Step either fully completes or fully rolls back.","Causal Closure: Step preconditions must be satisfiable by prior steps or initial state."],"_meta":{"layer":"Infrastructure","category":"Data Structures","tier":1,"ring":0,"related":["Plan"]},"sema_id":"sema:Step#mh:SHA-256:5f2205a7812b52b35dd75469367956e838a99360de7fde55e1585bd155eed128","sema_ref":"Step#5f22","sema_stub":"5f22","sema_layer":"Infrastructure","sema_category":"Data Structures","data_schema":{"type":"object","required":["step_id","action_type","params"],"properties":{"step_id":{"type":"string"},"action_type":{"type":"string","description":"The verb or tool to invoke"},"params":{"type":"object","description":"Arguments for the action"},"dependencies":{"type":"array","items":{"type":"string"},"description":"IDs of steps that must complete first"},"retry_policy":{"type":"object","properties":{"max_attempts":{"type":"integer"},"backoff_strategy":{"type":"string"}}}}}},"layer":"Infrastructure","category":"Data Structures"}},{"id":"f91fb8ab-ae8c-478d-b007-9a99a3d73f60","text":"Atomicity: A Step either fully completes or fully rolls back.","type":"INVARIANT","layer":null,"category":null,"handle":"Atomicity: A Step either fully completes or fully rolls back.","gloss":null,"stub":null,"metadata":{}},{"id":"7c5015eb-1393-4b5b-8db2-c5f45bdb16b2","text":"Causal Closure: Step preconditions must be satisfiable by prior steps or initial state.","type":"INVARIANT","layer":null,"category":null,"handle":"Causal Closure: Step preconditions must be satisfiable by prior steps or initial state.","gloss":null,"stub":null,"metadata":{}},{"id":"System","text":"System#e314","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"System#e314","gloss":"Complex whole of interacting parts","stub":"e314","metadata":{"pattern":{"handle":"System","data_schema":{"type":"object","required":["system_id","components"],"properties":{"system_id":{"type":"string","description":"Unique system identifier"},"components":{"type":"array","items":{"type":"string"},"description":"IDs of component parts"},"boundaries":{"type":"object","description":"What is inside vs outside the system"},"purpose":{"type":"string","description":"The function or goal of the system"}}},"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.","gloss":"Complex whole of interacting parts","_meta":{"tier":1,"layer":"Infrastructure","category":"Data Structures","ring":0},"sema_id":"sema:System#mh:SHA-256:e314d24e05d0e9ffaaa9c44b249bca8882f00ae6596af18edd245a4fe9df5f0e","sema_ref":"System#e314","sema_stub":"e314","sema_layer":"Infrastructure","sema_category":"Data Structures"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"Topology","text":"Topology#2408","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Topology#2408","gloss":"Interface for reasoning structures","stub":"2408","metadata":{"pattern":{"handle":"Topology","data_schema":{"type":"object","required":["shape"],"properties":{"shape":{"type":"string","enum":["Linear","Tree","DAG","Cyclic","Graph"],"description":"The structural pattern"},"nodes":{"type":"array","description":"List of node definitions"},"edges":{"type":"array","description":"List of edge definitions (connections)"}}},"mechanism":"Defines the node-edge structure of a reasoning process. Returns the 'Shape' of execution (e.g., Linear, Tree, DAG, Cyclic).","gloss":"Interface for reasoning structures","_meta":{"tier":1,"layer":"Infrastructure","category":"Data Structures","ring":2},"sema_ref":"Topology#2408","sema_id":"sema:Topology#mh:SHA-256:240866adb33767b1d651245af4038bfbcb29a575b2704288273eba41937e0560","sema_stub":"2408","sema_layer":"Infrastructure","sema_category":"Data Structures"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"Variable","text":"Variable#179a","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Variable#179a","gloss":"Mutable value","stub":"179a","metadata":{"pattern":{"handle":"Variable","data_schema":{"type":"object","required":["name","value","type"],"properties":{"name":{"type":"string","description":"Variable identifier"},"value":{"description":"Current state"},"type":{"type":"string","description":"Data type definition"},"history":{"type":"array","description":"Previous values (optional)"}}},"mechanism":"A value that can change or adapt within the system. It represents a dimension of freedom in the problem space.","gloss":"Mutable value","_meta":{"layer":"Infrastructure","category":"Data Structures","ring":1,"tier":1},"sema_layer":"Infrastructure","sema_category":"Data Structures","sema_id":"sema:Variable#mh:SHA-256:179a757268e1c339725e09418eba7989ba1ffb2148e8b0f1241d2ff90062116c","sema_ref":"Variable#179a","sema_stub":"179a"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"Vector","text":"Vector#c7c4","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Vector#c7c4","gloss":"Semantic position array","stub":"c7c4","metadata":{"pattern":{"handle":"Vector","data_schema":{"type":"object","required":["values","dimensions"],"properties":{"values":{"type":"array","items":{"type":"number"},"description":"Ordered numerical components"},"dimensions":{"type":"array","items":{"type":"string"},"description":"Labels for vector dimensions (e.g. x, y, z)"}}},"mechanism":"A multi-dimensional array of numbers representing a position in a semantic space.","gloss":"Semantic position array","_meta":{"layer":"Infrastructure","category":"Data Structures","ring":0,"tier":1,"related":["LatentAttachment#15a6"]},"sema_id":"sema:Vector#mh:SHA-256:c7c4d97d3416646673aa3d70d27aa4da40c7c2ae86180c92901a0e23429ffedc","sema_ref":"Vector#c7c4","sema_stub":"c7c4","sema_layer":"Infrastructure","sema_category":"Data Structures"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"CompatibilityCheck","text":"CompatibilityCheck#3abb","type":"PATTERN","layer":"Infrastructure","category":"Verification","handle":"CompatibilityCheck#3abb","gloss":"Schema compatibility verification","stub":"3abb","metadata":{"pattern":{"handle":"CompatibilityCheck","mechanism":"A binary verification process that compares the definition hashes or schema of two entities (agents, {{artifact}}s, or protocols) to determine if they can interact without translation.","gloss":"Schema compatibility verification","invariants":["Determinism: Identical inputs always yield the same compatibility result.","Symmetry: If A is compatible with B, B is compatible with A."],"_meta":{"tier":1,"layer":"Infrastructure","category":"Verification","ring":0},"sema_ref":"CompatibilityCheck#3abb","sema_id":"sema:CompatibilityCheck#mh:SHA-256:3abb595523dc765c8ebe497169cd2c12494c93a85e50c8785577cef22c465554","sema_stub":"3abb","sema_layer":"Infrastructure","sema_category":"Verification"},"layer":"Infrastructure","category":"Verification"}},{"id":"f204d3ca-bcff-471d-9174-a8da00a3af9a","text":"Symmetry: If A is compatible with B, B is compatible with A.","type":"INVARIANT","layer":null,"category":null,"handle":"Symmetry: If A is compatible with B, B is compatible with A.","gloss":null,"stub":null,"metadata":{}},{"id":"Criteria","text":"Criteria#ef6b","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Criteria#ef6b","gloss":"Judgment standards","stub":"ef6b","metadata":{"pattern":{"handle":"Criteria","data_schema":{"type":"object","required":["metric","threshold"],"properties":{"criteria_id":{"type":"string","description":"Unique identifier for this criteria"},"metric":{"type":"string","description":"What is being measured (e.g., 'cost', 'latency')"},"threshold":{"description":"The target value or boundary (any type)"},"comparator":{"type":"string","enum":["<","<=","=",">=",">","in","not_in"],"description":"How to compare against threshold"}}},"mechanism":"The specific standards used to judge the success of an {{artifact}}. e.g., 'must be under $50'. Used by the judgment.","gloss":"Judgment standards","_meta":{"layer":"Infrastructure","category":"Data Structures","ring":1,"tier":1},"sema_id":"sema:Criteria#mh:SHA-256:ef6b31198694b637dc1eca8e24c56057b6df0e90fba8f32de8a7c15b747cdbe0","sema_ref":"Criteria#ef6b","sema_stub":"ef6b","sema_layer":"Infrastructure","sema_category":"Data Structures"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"Deduction","text":"Deduction#9c88","type":"PATTERN","layer":"Mind","category":"Reasoning","handle":"Deduction#9c88","gloss":"General to specific logic","stub":"9c88","metadata":{"pattern":{"handle":"Deduction","mechanism":"Moving from general rules ({{axiom}}) to specific conclusions. If premises are true, the conclusion MUST be true. (All men are mortal -> Socrates is a man -> Socrates is mortal).","gloss":"General to specific logic","invariants":["Truth Preservation: If premises are true, conclusion MUST be true.","Validity: The argument structure follows formal logic rules."],"preconditions":["Premises are accepted as true"],"postconditions":["Conclusion is logically necessary"],"_meta":{"layer":"Mind","category":"Reasoning","ring":1,"tier":1},"sema_layer":"Mind","sema_category":"Reasoning","sema_id":"sema:Deduction#mh:SHA-256:9c881288e30f01162b178b66fc1299a776dc08cc5add52ac8b31fe51d552dd12","sema_ref":"Deduction#9c88","sema_stub":"9c88"},"layer":"Mind","category":"Reasoning"}},{"id":"f315ef3b-b87e-456b-9e44-6d8cdacde71e","text":"Truth Preservation: If premises are true, conclusion MUST be true.","type":"INVARIANT","layer":null,"category":null,"handle":"Truth Preservation: If premises are true, conclusion MUST be true.","gloss":null,"stub":null,"metadata":{}},{"id":"82bb797d-1032-47cf-a72a-0610d82f96c5","text":"Validity: The argument structure follows formal logic rules.","type":"INVARIANT","layer":null,"category":null,"handle":"Validity: The argument structure follows formal logic rules.","gloss":null,"stub":null,"metadata":{}},{"id":"7f064518-6b16-464d-9ba1-bf09559ecbcf","text":"Premises are accepted as true","type":"PRECONDITION","layer":null,"category":null,"handle":"Premises are accepted as true","gloss":null,"stub":null,"metadata":{}},{"id":"5d2e1a30-aecc-4c77-98ae-7d2564662ab7","text":"Conclusion is logically necessary","type":"POSTCONDITION","layer":null,"category":null,"handle":"Conclusion is logically necessary","gloss":null,"stub":null,"metadata":{}},{"id":"Hierarchy","text":"Hierarchy#aa9b","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Hierarchy#aa9b","gloss":"Vertical ranking","stub":"aa9b","metadata":{"pattern":{"handle":"Hierarchy","data_schema":{"type":"object","required":["levels","relationships"],"properties":{"levels":{"type":"array","description":"Ordered ranks (Top -> Bottom)"},"relationships":{"type":"object","description":"Parent-Child map"},"root_id":{"type":"string","description":"Apex node"}}},"mechanism":"The vertical ranking of {{category}}s or objects. Defines Upper vs. Lower relationships, inheritance, and authority.","gloss":"Vertical ranking","_meta":{"layer":"Infrastructure","category":"Data Structures","ring":1,"tier":1},"sema_layer":"Infrastructure","sema_category":"Data Structures","sema_id":"sema:Hierarchy#mh:SHA-256:aa9bec7346dca2ce2e83a70fc352825aa78c907cd82a8306f7e6856e42ef245c","sema_ref":"Hierarchy#aa9b","sema_stub":"aa9b"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"FeatureFlag","text":"FeatureFlag#9464","type":"PATTERN","layer":"Society","category":"Protocols","handle":"FeatureFlag#9464","gloss":"Runtime functionality toggle","stub":"9464","metadata":{"pattern":{"handle":"FeatureFlag","mechanism":"A toggle point in the code that allows functionality to be enabled or disabled at runtime based on a {{condition}}. It decouples deployment from release, enabling safer rollouts and A/B testing.","gloss":"Runtime functionality toggle","_meta":{"layer":"Society","category":"Protocols","ring":1,"tier":1},"sema_id":"sema:FeatureFlag#mh:SHA-256:9464b708479fc75cc5d825850393199c41c35e06f20a2861954e98f8edcfa8a8","sema_ref":"FeatureFlag#9464","sema_stub":"9464","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"Gate","text":"Gate#206d","type":"PATTERN","layer":"Physics","category":"Primitives","handle":"Gate#206d","gloss":"Filter payload if the target condition is not met","stub":"206d","metadata":{"pattern":{"handle":"Gate","mechanism":"Evaluates the truth-value of the target {{condition}}. 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.","gloss":"Filter payload if the target condition is not met","failure_modes":["Silent Loss: Important data dropped without alerting the operator."],"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)"}],"_meta":{"tier":1,"layer":"Physics","category":"Primitives","ring":0},"sema_id":"sema:Gate#mh:SHA-256:206dc9be76b20fcc7c96b06c6c9eb8ce243565d02ce064b4206caaa46871a96d","sema_ref":"Gate#206d","sema_stub":"206d","sema_layer":"Physics","sema_category":"Primitives"},"layer":"Physics","category":"Primitives"}},{"id":"15380d93-fad1-4189-81df-c030d131f524","text":"Idempotent: Re-evaluating the gate with the same context yields the same result (within validity window).","type":"INVARIANT","layer":null,"category":null,"handle":"Idempotent: Re-evaluating the gate with the same context yields the same result (within validity window).","gloss":null,"stub":null,"metadata":{}},{"id":"a8a0d0bf-910e-420e-a6db-0e1bd8d1e1c9","text":"Non-Blocking: A false condition must not halt the broader system, only the specific item.","type":"INVARIANT","layer":null,"category":null,"handle":"Non-Blocking: A false condition must not halt the broader system, only the specific item.","gloss":null,"stub":null,"metadata":{}},{"id":"ConstraintFirst","text":"ConstraintFirst#c7cb","type":"PATTERN","layer":"Society","category":"Protocols","handle":"ConstraintFirst#c7cb","gloss":"Defining boundaries before content","stub":"c7cb","metadata":{"pattern":{"handle":"ConstraintFirst","mechanism":"The agent first generates the 'negative space' (the {{constraint}}s, 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.","gloss":"Defining boundaries before content","failure_modes":["Over-constraining the solution space."],"invariants":["Constraints immutable during operation."],"_meta":{"tier":2,"layer":"Society","category":"Protocols","ring":0},"sema_id":"sema:ConstraintFirst#mh:SHA-256:c7cb09081701787022c33fa3b1399bd847b0062cf223851c4d98024b640feb99","sema_ref":"ConstraintFirst#c7cb","sema_stub":"c7cb","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"3495e254-f019-4ab6-8a5a-63df9159239e","text":"Constraints immutable during operation.","type":"INVARIANT","layer":null,"category":null,"handle":"Constraints immutable during operation.","gloss":null,"stub":null,"metadata":{}},{"id":"Reversibility","text":"Reversibility#049f","type":"PATTERN","layer":"Society","category":"Protocols","handle":"Reversibility#049f","gloss":"Condition: Can this action be undone?","stub":"049f","metadata":{"pattern":{"handle":"Reversibility","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).","gloss":"Condition: Can this action be undone?","invariants":["Entropy {{constraint}}: 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"}],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":0},"sema_id":"sema:Reversibility#mh:SHA-256:049f5fd98135ec288888fa61056f65a7e46067b06eaa5e7cee7a7bd3bfef2f74","sema_ref":"Reversibility#049f","sema_stub":"049f","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"b98472f8-9964-4023-84d0-90b1da1cc2bf","text":"Entropy {{constraint}}: Reversal must not violate thermodynamic limits (e.g., cannot un-burn toast).","type":"INVARIANT","layer":null,"category":null,"handle":"Entropy {{constraint}}: Reversal must not violate thermodynamic limits (e.g., cannot un-burn toast).","gloss":null,"stub":null,"metadata":{}},{"id":"Anomaly","text":"Anomaly#7987","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Anomaly#7987","gloss":"Deviation from expectation","stub":"7987","metadata":{"pattern":{"handle":"Anomaly","mechanism":"A piece of {{datum}} that deviates from the expected standard or pattern. It creates the spark for thinking and often triggers further investigation.","gloss":"Deviation from expectation","_meta":{"layer":"Infrastructure","category":"Data Structures","ring":1,"tier":1},"data_schema":{"type":"object","required":["observed_value","expected_baseline","deviation_score"],"properties":{"observed_value":{"description":"The data point that triggered detection (any type)"},"expected_baseline":{"description":"The prediction or mean value (any type)"},"deviation_score":{"type":"number","description":"Standard deviations (sigma) or distance metric"},"detected_at":{"type":"string","format":"date-time"}}},"sema_layer":"Infrastructure","sema_category":"Data Structures","sema_id":"sema:Anomaly#mh:SHA-256:7987f2cd4a353f206fccd038ddac021ef849cfa58e352d2d2d7ba3850b916893","sema_ref":"Anomaly#7987","sema_stub":"7987"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"Assumption","text":"Assumption#efb5","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Assumption#efb5","gloss":"Provisional truth","stub":"efb5","metadata":{"pattern":{"handle":"Assumption","mechanism":"A gap-filler used when {{datum}} is missing; treated as true temporarily to allow thinking to proceed. Must be tracked and validated.","gloss":"Provisional truth","invariants":["Provisionality: Must be explicitly flagged as unverified.","Tracking: Must maintain a link to the missing datum it replaces."],"_meta":{"layer":"Infrastructure","category":"Data Structures","ring":1,"tier":1},"data_schema":{"type":"object","required":["premise","risk_level"],"properties":{"premise":{"type":"string","description":"The statement treated as temporarily true"},"risk_level":{"type":"number","minimum":0,"maximum":1,"description":"Probability of falsity"},"criticality":{"type":"string","enum":["Low","Medium","Existential"],"description":"Impact if assumption fails"},"validation_deadline":{"type":"string","format":"date-time"}}},"sema_layer":"Infrastructure","sema_category":"Data Structures","sema_id":"sema:Assumption#mh:SHA-256:efb5be2691c91cb98b493543154f2a9d7d492911088e3bf1cbc048f5ac317978","sema_ref":"Assumption#efb5","sema_stub":"efb5"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"340aeceb-8959-4882-a608-45e492e37208","text":"Provisionality: Must be explicitly flagged as unverified.","type":"INVARIANT","layer":null,"category":null,"handle":"Provisionality: Must be explicitly flagged as unverified.","gloss":null,"stub":null,"metadata":{}},{"id":"4a6e7148-62e6-4a30-b8a2-cf18fd93c8c2","text":"Tracking: Must maintain a link to the missing datum it replaces.","type":"INVARIANT","layer":null,"category":null,"handle":"Tracking: Must maintain a link to the missing datum it replaces.","gloss":null,"stub":null,"metadata":{}},{"id":"CognitiveBias","text":"CognitiveBias#4b32","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"CognitiveBias#4b32","gloss":"Structural processing error definition","stub":"4b32","metadata":{"pattern":{"handle":"CognitiveBias","mechanism":"A structural error definition describing a specific distortion in information processing. The 'lens' is curved, distorting the interpretation of {{datum}}.","gloss":"Structural processing error definition","data_schema":{"type":"object","required":["name","distortion_type"],"properties":{"name":{"type":"string"},"distortion_type":{"type":"string"},"correction_strategy":{"type":"string"}}},"_meta":{"layer":"Infrastructure","category":"Data Structures","ring":1,"tier":1},"sema_layer":"Infrastructure","sema_category":"Data Structures","sema_id":"sema:CognitiveBias#mh:SHA-256:4b32f79732d4468fa0de4facb106dbbd2889bfa1d3ce62e77b09e606011680c9","sema_ref":"CognitiveBias#4b32","sema_stub":"4b32"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"Induction","text":"Induction#2487","type":"PATTERN","layer":"Mind","category":"Reasoning","handle":"Induction#2487","gloss":"Specific to general logic","stub":"2487","metadata":{"pattern":{"handle":"Induction","mechanism":"Moving from specific observations ({{datum}}) to general rules. The conclusion is probable, not certain. (The sun rose today -> The sun rises every day).","gloss":"Specific to general logic","invariants":["Probabilistic: Conclusions are probable, not certain.","Generalization: Output rule covers more cases than Input data."],"_meta":{"layer":"Mind","category":"Reasoning","ring":1,"tier":1},"sema_layer":"Mind","sema_category":"Reasoning","sema_id":"sema:Induction#mh:SHA-256:2487959ee211affb6f6ec74764316eb616e33c815603cf12b59518ab0bcfca54","sema_ref":"Induction#2487","sema_stub":"2487"},"layer":"Mind","category":"Reasoning"}},{"id":"816f092d-7de8-4bdd-b911-b1aaa759c839","text":"Probabilistic: Conclusions are probable, not certain.","type":"INVARIANT","layer":null,"category":null,"handle":"Probabilistic: Conclusions are probable, not certain.","gloss":null,"stub":null,"metadata":{}},{"id":"9fbd3cd1-f8a5-478f-b758-42090851cb56","text":"Generalization: Output rule covers more cases than Input data.","type":"INVARIANT","layer":null,"category":null,"handle":"Generalization: Output rule covers more cases than Input data.","gloss":null,"stub":null,"metadata":{}},{"id":"Abduction","text":"Abduction#fe2b","type":"PATTERN","layer":"Mind","category":"Reasoning","handle":"Abduction#fe2b","gloss":"Inference to best explanation","stub":"fe2b","metadata":{"pattern":{"handle":"Abduction","mechanism":"The 'best guess' based on incomplete observation. Inference to the best explanation. (The grass is wet -> It probably rained). Triggers {{hypothesis}} generation.","gloss":"Inference to best explanation","_meta":{"layer":"Mind","category":"Reasoning","ring":1,"tier":1},"sema_layer":"Mind","sema_category":"Reasoning","sema_id":"sema:Abduction#mh:SHA-256:fe2b40824246fd245dec338d1615e791787806b540b9376aae5fac14c48ce02b","sema_ref":"Abduction#fe2b","sema_stub":"fe2b"},"layer":"Mind","category":"Reasoning"}},{"id":"Overlap","text":"Overlap#bcfa","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Overlap#bcfa","gloss":"Transform negotiations from position-based battles to interest-based discovery of shared ground","stub":"bcfa","metadata":{"pattern":{"handle":"Overlap","data_schema":{"type":"object","required":["set_a","set_b"],"properties":{"set_a":{"type":"array","description":"First accept-set (outcome IDs)"},"set_b":{"type":"array","description":"Second accept-set (outcome IDs)"},"intersection":{"type":"array","description":"Common elements between sets"},"expansion_count":{"type":"integer","description":"How many times sets were expanded to find overlap"}}},"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}} partitioning to cleanly identify the intersection of distinct accept-sets.","gloss":"Transform negotiations from position-based battles to interest-based discovery of shared ground","failure_modes":["Strategic minimal accept-sets (mitigated but not eliminated by commit-reveal).","Expansion limit hit with no overlap.","Accept-sets too abstract to intersect meaningfully.","Requires both agents to support commit-reveal protocol."],"invariants":["Private regions respected","Shared region contains agreed facts"],"preconditions":["Two ontologies/datasets"],"postconditions":["Intersection identified"],"_meta":{"tier":1,"layer":"Infrastructure","category":"Data Structures","ring":1},"sema_id":"sema:Overlap#mh:SHA-256:bcfa7595ad18e8227f2019bedc717a67f3ffca1871ab9abfd02ff9cbf18cdfbb","sema_ref":"Overlap#bcfa","sema_stub":"bcfa","sema_layer":"Infrastructure","sema_category":"Data Structures"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"d4c36a8d-2c69-4347-b34a-54097a53d23d","text":"Private regions respected","type":"INVARIANT","layer":null,"category":null,"handle":"Private regions respected","gloss":null,"stub":null,"metadata":{}},{"id":"52b40e75-f875-4a64-9930-c6aefdf658d0","text":"Shared region contains agreed facts","type":"INVARIANT","layer":null,"category":null,"handle":"Shared region contains agreed facts","gloss":null,"stub":null,"metadata":{}},{"id":"b0f2526b-906f-42a7-bf20-7cd852a38bc5","text":"Two ontologies/datasets","type":"PRECONDITION","layer":null,"category":null,"handle":"Two ontologies/datasets","gloss":null,"stub":null,"metadata":{}},{"id":"87a30cd0-c20c-4852-bdbb-9e91c6f963b8","text":"Intersection identified","type":"POSTCONDITION","layer":null,"category":null,"handle":"Intersection identified","gloss":null,"stub":null,"metadata":{}},{"id":"Nature","text":"Nature#6c1a","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Nature#6c1a","gloss":"Ontological origin classification","stub":"6c1a","metadata":{"pattern":{"handle":"Nature","data_schema":{"type":"object","required":["classification"],"properties":{"classification":{"type":"string","enum":["Biological","Synthetic","Institutional","Hybrid"],"description":"Substrate type"},"substrate":{"type":"string","description":"More specific substrate details"},"immutable":{"type":"boolean","default":true,"description":"Whether this nature can change"}}},"mechanism":"The substrate classification of an entity (e.g. Biological, Synthetic, or Institutional). It serves as the immutable input for downstream {{protocol}}s to determine alignment obligations, rights, and authentication requirements.","gloss":"Ontological origin classification","_meta":{"tier":1,"layer":"Infrastructure","category":"Data Structures","ring":0},"sema_id":"sema:Nature#mh:SHA-256:6c1a88dcf3f53f945e8fa9a4c8a04b8e23819954de102cd266c999447c12314b","sema_ref":"Nature#6c1a","sema_stub":"6c1a","sema_layer":"Infrastructure","sema_category":"Data Structures"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"ProtoPack","text":"ProtoPack#6597","type":"PATTERN","layer":"Society","category":"Protocols","handle":"ProtoPack#6597","gloss":"Prototype verification artifact","stub":"6597","metadata":{"pattern":{"handle":"ProtoPack","mechanism":"An {{artifact}} of a prototyping phase, containing a low-fidelity {{prototype}} simulation trace or model. It serves as evidence of feasibility before full resource commitment.","gloss":"Prototype verification artifact","invariants":["Feasibility Proof: Must demonstrate viability of critical path.","Low Fidelity: Should not be a production-ready artifact."],"data_schema":{"type":"object","properties":{"simulation_trace":{"type":"array"},"feasibility_score":{"type":"number"}}},"_meta":{"layer":"Society","category":"Protocols","ring":0,"tier":1,"related":["Build"]},"sema_id":"sema:ProtoPack#mh:SHA-256:6597fa92b7426d373e1d05d6a7fd1f8c1416c00c78dfab8e35e5a6264c1453d6","sema_ref":"ProtoPack#6597","sema_stub":"6597","sema_layer":"Society","sema_category":"Protocols","signature":["Artifact(Prototype)"]},"layer":"Society","category":"Protocols"}},{"id":"8ad80e2a-9850-4b3e-9861-a231f8321473","text":"Feasibility Proof: Must demonstrate viability of critical path.","type":"INVARIANT","layer":null,"category":null,"handle":"Feasibility Proof: Must demonstrate viability of critical path.","gloss":null,"stub":null,"metadata":{}},{"id":"dd8e23da-c3a0-4ee8-8ed3-813fddf1ab82","text":"Low Fidelity: Should not be a production-ready artifact.","type":"INVARIANT","layer":null,"category":null,"handle":"Low Fidelity: Should not be a production-ready artifact.","gloss":null,"stub":null,"metadata":{}},{"id":"Probe","text":"Probe#9f2b","type":"PATTERN","layer":"Infrastructure","category":"Primitives","handle":"Probe#9f2b","gloss":"Active verification query","stub":"9f2b","metadata":{"pattern":{"handle":"Probe","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}} to prevent production impact.","gloss":"Active verification query","failure_modes":["Observer Effect: Probe changes the state it measures.","Stale Probe: Result reflects past state, not current.","Probe Cost: Verification cost exceeds value of information.","False Positive/Negative: Probe returns incorrect result.","Sandbox Escape: Probe execution affects production state.","Proxy Failure: Passing the quiz does not guarantee performance on the job."],"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."],"preconditions":["Response timeout defined","Target agent addressable"],"postconditions":["No side effects on production target","Probe cost paid","Target capability verified OR timeout"],"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"}],"_meta":{"tier":1,"layer":"Infrastructure","category":"Primitives","ring":0},"sema_id":"sema:Probe#mh:SHA-256:9f2bf351c42ae5107e43cced5947ba813d8c1f7bc9f469a2551cbc0425637dfa","sema_ref":"Probe#9f2b","sema_stub":"9f2b","sema_layer":"Infrastructure","sema_category":"Primitives"},"layer":"Infrastructure","category":"Primitives"}},{"id":"a115e16b-0972-4e83-ae5f-0a6809cb32e8","text":"Ground Truth: Probe result reflects actual state at time of query.","type":"INVARIANT","layer":null,"category":null,"handle":"Ground Truth: Probe result reflects actual state at time of query.","gloss":null,"stub":null,"metadata":{}},{"id":"cff360e1-c136-4187-b1b0-c358b05814d5","text":"Repeatability: Same probe on unchanged state returns same result.","type":"INVARIANT","layer":null,"category":null,"handle":"Repeatability: Same probe on unchanged state returns same result.","gloss":null,"stub":null,"metadata":{}},{"id":"3d3c9c58-a208-4003-997a-6c770fb0491e","text":"Cost Bound: Probe execution must complete within specified resource limits.","type":"INVARIANT","layer":null,"category":null,"handle":"Cost Bound: Probe execution must complete within specified resource limits.","gloss":null,"stub":null,"metadata":{}},{"id":"2f9b5292-f006-4e9b-bdb5-a5dbe72a4bf7","text":"Non-Destructive: Production state must remain invariant.","type":"INVARIANT","layer":null,"category":null,"handle":"Non-Destructive: Production state must remain invariant.","gloss":null,"stub":null,"metadata":{}},{"id":"5659f6de-45d9-430c-a918-4e4f0d8e09ac","text":"Response timeout defined","type":"PRECONDITION","layer":null,"category":null,"handle":"Response timeout defined","gloss":null,"stub":null,"metadata":{}},{"id":"7a1bc86a-b337-4d32-98e3-327ebac98ae3","text":"Target agent addressable","type":"PRECONDITION","layer":null,"category":null,"handle":"Target agent addressable","gloss":null,"stub":null,"metadata":{}},{"id":"3f1e339c-1a10-4cdf-b976-42d5fef4884c","text":"No side effects on production target","type":"POSTCONDITION","layer":null,"category":null,"handle":"No side effects on production target","gloss":null,"stub":null,"metadata":{}},{"id":"70f99e81-1354-40fe-b8d7-e293dd206cda","text":"Probe cost paid","type":"POSTCONDITION","layer":null,"category":null,"handle":"Probe cost paid","gloss":null,"stub":null,"metadata":{}},{"id":"a3e60a82-e133-462d-8336-eeb40e7808da","text":"Target capability verified OR timeout","type":"POSTCONDITION","layer":null,"category":null,"handle":"Target capability verified OR timeout","gloss":null,"stub":null,"metadata":{}},{"id":"Ballot","text":"Ballot#c5c5","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Ballot#c5c5","gloss":"Immutable container for collective decision inputs","stub":"c5c5","metadata":{"pattern":{"handle":"Ballot","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.","gloss":"Immutable container for collective decision inputs","failure_modes":["Spoiled {{select}}ion: Ambiguous or invalid ballot format.","Double Voting: Single agent submitting multiple ballots (Sybil risk)."],"invariants":["Completeness: Must specify question, options, and decision rule","Immutability: Once created, a Ballot cannot be modified"],"_meta":{"tier":3,"layer":"Infrastructure","category":"Data Structures","ring":0},"sema_id":"sema:Ballot#mh:SHA-256:c5c5f7a0dc23a23835d0b9f8ce25f104818431062160e753010e4077e7a27062","sema_ref":"Ballot#c5c5","sema_stub":"c5c5","sema_layer":"Infrastructure","sema_category":"Data Structures","data_schema":{"type":"object","required":["ballot_id","proposal_id","voter_id","choice"],"properties":{"ballot_id":{"type":"string"},"proposal_id":{"type":"string"},"voter_id":{"type":"string"},"choice":{"type":"string","description":"The selected option"},"weight":{"type":"number","default":1.0},"signature":{"type":"string","description":"Cryptographic proof of vote"},"timestamp":{"type":"string","format":"date-time"}}}},"layer":"Infrastructure","category":"Data Structures"}},{"id":"0ea68f51-0add-46c8-86fa-fc9d6414161d","text":"Completeness: Must specify question, options, and decision rule","type":"INVARIANT","layer":null,"category":null,"handle":"Completeness: Must specify question, options, and decision rule","gloss":null,"stub":null,"metadata":{}},{"id":"bf439988-6c14-4f75-aea5-04a03f13e5c2","text":"Immutability: Once created, a Ballot cannot be modified","type":"INVARIANT","layer":null,"category":null,"handle":"Immutability: Once created, a Ballot cannot be modified","gloss":null,"stub":null,"metadata":{}},{"id":"Decision","text":"Decision#acfb","type":"PATTERN","layer":"Mind","category":"Reasoning","handle":"Decision#acfb","gloss":"Irrevocable selection from a set of options","stub":"acfb","metadata":{"pattern":{"handle":"Decision","mechanism":"The cognitive act of committing to a specific {{option}} after weighing alternatives. It transforms a set of possibilities into a single committed trajectory using {{select}}. Unlike a simple filter, a Decision implies the resolution of ambiguity and the assumption of consequences.","gloss":"Irrevocable selection from a set of options","invariants":["Selection: Must choose exactly one option from the available set.","Irrevocability: Once made, the decision cannot be unmade without a new Decision process."],"_meta":{"layer":"Mind","category":"Reasoning","ring":1,"tier":1},"sema_id":"sema:Decision#mh:SHA-256:acfb3458cde8e55c378b2f51b44afc30687b58093f1777299f49caca475274a1","sema_ref":"Decision#acfb","sema_stub":"acfb","sema_layer":"Mind","sema_category":"Reasoning","data_schema":{"type":"object","required":["decision_id","selected_option_id","rationale"],"properties":{"decision_id":{"type":"string"},"context_id":{"type":"string"},"options_considered":{"type":"array","items":{"type":"string"},"description":"List of Option IDs rejected"},"selected_option_id":{"type":"string"},"rationale":{"type":"string","description":"Reasoning trace for the selection"},"timestamp":{"type":"string","format":"date-time"}}}},"layer":"Mind","category":"Reasoning"}},{"id":"b8933b69-7294-41d3-88e0-2071a23eb5b1","text":"Selection: Must choose exactly one option from the available set.","type":"INVARIANT","layer":null,"category":null,"handle":"Selection: Must choose exactly one option from the available set.","gloss":null,"stub":null,"metadata":{}},{"id":"4e98dc96-7d52-4775-a96d-a1a33ad025e8","text":"Irrevocability: Once made, the decision cannot be unmade without a new Decision process.","type":"INVARIANT","layer":null,"category":null,"handle":"Irrevocability: Once made, the decision cannot be unmade without a new Decision process.","gloss":null,"stub":null,"metadata":{}},{"id":"Rank","text":"Rank#cb98","type":"PATTERN","layer":"Mind","category":"Reasoning","handle":"Rank#cb98","gloss":"Order items by score","stub":"cb98","metadata":{"pattern":{"handle":"Rank","mechanism":"Deterministic Sort. Applies a scoring function to every element in the input Set. Returns a List ordered by Score, using {{select}} to truncate to Top-K.","gloss":"Order items by score","failure_modes":["Score Indeterminacy: Multiple items have identical scores.","Incomparability: Scoring function returns values that cannot be strictly ordered."],"invariants":["Conservation: Output set is a subset of Input set.","Monotonicity: For all i, Score(Output[i]) >= Score(Output[i+1])."],"sema_id":"sema:Rank#mh:SHA-256:cb98b1357a2b6e14ff1e76bca44014fabffb0936b453ba88c3ad4561a63d3c2f","sema_ref":"Rank#cb98","sema_stub":"cb98","_meta":{"tier":1,"layer":"Mind","category":"Reasoning","ring":0},"sema_layer":"Mind","sema_category":"Reasoning"},"layer":"Mind","category":"Reasoning"}},{"id":"97450bd5-d327-4300-9227-49fbc5bd77ef","text":"Conservation: Output set is a subset of Input set.","type":"INVARIANT","layer":null,"category":null,"handle":"Conservation: Output set is a subset of Input set.","gloss":null,"stub":null,"metadata":{}},{"id":"a8531e5c-823c-4efa-8e4e-1e65fcff21ed","text":"Monotonicity: For all i, Score(Output[i]) >= Score(Output[i+1]).","type":"INVARIANT","layer":null,"category":null,"handle":"Monotonicity: For all i, Score(Output[i]) >= Score(Output[i+1]).","gloss":null,"stub":null,"metadata":{}},{"id":"Message","text":"Message#f767","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Message#f767","gloss":"Structured signal container","stub":"f767","metadata":{"pattern":{"handle":"Message","data_schema":{"type":"object","required":["header","body"],"properties":{"header":{"type":"object","properties":{"sender":{"type":"string"},"recipient":{"type":"string"},"timestamp":{"type":"string"}}},"body":{"description":"The content payload"},"signature":{"type":"string","description":"Sender verification"}}},"mechanism":"A structured container for a {{signal}}, adding Metadata (Sender, Recipient, Timestamp) to the raw emission.","gloss":"Structured signal container","invariants":["Immutability: Once sent, the message content cannot be changed.","Addressability: Must contain Sender and (optional) Recipient identifiers."],"_meta":{"tier":1,"layer":"Infrastructure","category":"Data Structures","ring":1},"sema_layer":"Infrastructure","sema_category":"Data Structures","sema_id":"sema:Message#mh:SHA-256:f7678d6d403b174dec233b366b6f352da445c31ab2577c7314dd0b1d52161d7f","sema_ref":"Message#f767","sema_stub":"f767"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"b97fb6b2-0725-4a27-8907-d041c5049c1a","text":"Immutability: Once sent, the message content cannot be changed.","type":"INVARIANT","layer":null,"category":null,"handle":"Immutability: Once sent, the message content cannot be changed.","gloss":null,"stub":null,"metadata":{}},{"id":"1285b81d-3dcd-4305-9a6a-6d4d4ff77208","text":"Addressability: Must contain Sender and (optional) Recipient identifiers.","type":"INVARIANT","layer":null,"category":null,"handle":"Addressability: Must contain Sender and (optional) Recipient identifiers.","gloss":null,"stub":null,"metadata":{}},{"id":"Silence","text":"Silence#dd79","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"Silence#dd79","gloss":"Active withholding of signal","stub":"dd79","metadata":{"pattern":{"handle":"Silence","mechanism":"Active Waiting. The agent deliberately withholds {{signal}} output for duration T or until Trigger. Distinguishes 'Processing...' from 'Abstaining'.","gloss":"Active withholding of signal","invariants":["Timeout: Silence > MaxDuration implies Failure or Default Action."],"_meta":{"tier":1,"layer":"Mind","category":"Strategy","ring":0},"sema_id":"sema:Silence#mh:SHA-256:dd793ba60c09b5f61e3de738047e725509758d63311879876b400ff563619ea5","sema_ref":"Silence#dd79","sema_stub":"dd79","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"f9ba240c-41c3-4a99-8736-4ad6e5ce22fa","text":"Timeout: Silence > MaxDuration implies Failure or Default Action.","type":"INVARIANT","layer":null,"category":null,"handle":"Timeout: Silence > MaxDuration implies Failure or Default Action.","gloss":null,"stub":null,"metadata":{}},{"id":"SpectralTune","text":"SpectralTune#6c65","type":"PATTERN","layer":"Society","category":"Protocols","handle":"SpectralTune#6c65","gloss":"Verifying ontology alignment before data transfer","stub":"6c65","metadata":{"pattern":{"handle":"SpectralTune","mechanism":"Instead of sending a message and hoping it is understood, the sender transmits a 'tuning {{signal}}'—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.","gloss":"Verifying ontology alignment before data transfer","failure_modes":["Infinite tuning loops if ontologies are slightly mismatched."],"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"],"preconditions":["Both agents possess valid hash function H"],"postconditions":["Channel is established OR Connection terminated"],"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"}],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":1,"related":["OntologyHandshake"]},"sema_layer":"Society","sema_category":"Protocols","sema_id":"sema:SpectralTune#mh:SHA-256:6c65e21711b7203fcd84ed58755cd57239cda2e09a1e66ddf81e407edcd5eeb7","sema_ref":"SpectralTune#6c65","sema_stub":"6c65"},"layer":"Society","category":"Protocols"}},{"id":"0914bfda-4e65-41aa-adb8-25fb9bb15af3","text":"Atomic Tuning: No payload data is processed before Tune_ACK","type":"INVARIANT","layer":null,"category":null,"handle":"Atomic Tuning: No payload data is processed before Tune_ACK","gloss":null,"stub":null,"metadata":{}},{"id":"a3455dae-91fb-4049-9daa-f48eda70c38e","text":"Fail-Fast: On hash mismatch, DO NOT RETRY tuning. Halt immediately and escalate to negotiation or human review","type":"INVARIANT","layer":null,"category":null,"handle":"Fail-Fast: On hash mismatch, DO NOT RETRY tuning. Halt immediately and escalate to negotiation or human review","gloss":null,"stub":null,"metadata":{}},{"id":"f83d9a8b-5771-4f74-b0d7-f04e1b5f58dc","text":"Hash Match: Receiver.context_hash must equal Sender.context_hash","type":"INVARIANT","layer":null,"category":null,"handle":"Hash Match: Receiver.context_hash must equal Sender.context_hash","gloss":null,"stub":null,"metadata":{}},{"id":"5fce8047-0b6f-440c-9b30-c11432ae27a0","text":"Both agents possess valid hash function H","type":"PRECONDITION","layer":null,"category":null,"handle":"Both agents possess valid hash function H","gloss":null,"stub":null,"metadata":{}},{"id":"4447624e-e6f4-4a30-acf1-4fd84531dc50","text":"Channel is established OR Connection terminated","type":"POSTCONDITION","layer":null,"category":null,"handle":"Channel is established OR Connection terminated","gloss":null,"stub":null,"metadata":{}},{"id":"State","text":"State#4d58","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"State#4d58","gloss":"System condition at time T","stub":"4d58","metadata":{"pattern":{"handle":"State","data_schema":{"type":"object","required":["state_id","data"],"properties":{"state_id":{"type":"string","description":"Unique identifier for this state snapshot"},"data":{"type":"object","description":"The actual state values"},"timestamp":{"type":"string","format":"date-time","description":"When this state was captured"}}},"mechanism":"The stored information representing the current {{condition}} of a {{system}}.","gloss":"System condition at time T","invariants":["Persistence: State remains constant unless acted upon.","Uniqueness: At time T, the system has exactly one State."],"_meta":{"tier":1,"layer":"Infrastructure","category":"Data Structures","ring":0},"sema_id":"sema:State#mh:SHA-256:4d582a0ac4af7ae886c83da9825e07c39f1e72ece21fd65a40b6a4fc71882721","sema_ref":"State#4d58","sema_stub":"4d58","sema_layer":"Infrastructure","sema_category":"Data Structures"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"08b91cac-437e-4990-8ead-8aece4d3976c","text":"Persistence: State remains constant unless acted upon.","type":"INVARIANT","layer":null,"category":null,"handle":"Persistence: State remains constant unless acted upon.","gloss":null,"stub":null,"metadata":{}},{"id":"2945e4d8-1682-44ab-8be0-a8916822c37c","text":"Uniqueness: At time T, the system has exactly one State.","type":"INVARIANT","layer":null,"category":null,"handle":"Uniqueness: At time T, the system has exactly one State.","gloss":null,"stub":null,"metadata":{}},{"id":"Linear","text":"Linear#81af","type":"PATTERN","layer":"Physics","category":"Primitives","handle":"Linear#81af","gloss":"Sequential non-branching topology","stub":"81af","metadata":{"pattern":{"handle":"Linear","mechanism":"A non-branching {{topology}} where execution follows a strict {{sequence}}. Step(N) depends only on Step(N-1). This is the simplest reasoning shape, equivalent to a 'Chain'.","gloss":"Sequential non-branching topology","_meta":{"layer":"Physics","category":"Primitives","ring":2,"tier":1},"invariants":["Single Successor: Every node has at most one child.","Single Predecessor: Every node has at most one parent."],"sema_ref":"Linear#81af","sema_id":"sema:Linear#mh:SHA-256:81affcd5f7c1ea56b7572799fc235cf95d4e3c692de77c9eb8c01930b8e1d41c","sema_stub":"81af","sema_layer":"Physics","sema_category":"Primitives"},"layer":"Physics","category":"Primitives"}},{"id":"1586669e-e65a-40c3-b087-3e8ff6c5199c","text":"Single Successor: Every node has at most one child.","type":"INVARIANT","layer":null,"category":null,"handle":"Single Successor: Every node has at most one child.","gloss":null,"stub":null,"metadata":{}},{"id":"Tree","text":"Tree#ddce","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Tree#ddce","gloss":"Branching reasoning topology","stub":"ddce","metadata":{"pattern":{"handle":"Tree","data_schema":{"type":"object","required":["nodes","edges","root_id"],"properties":{"nodes":{"type":"array","description":"List of node IDs or objects"},"edges":{"type":"array","description":"Adjacency list (parent->child)"},"root_id":{"type":"string","description":"The single root node"}}},"mechanism":"A branching {{topology}} where multiple lines of reasoning are explored simultaneously. Allows backtracking and pruning of unpromising branches (BFS/DFS). Equivalent to 'tree-of-thoughts reasoning'.","gloss":"Branching reasoning topology","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"}],"_meta":{"tier":1,"layer":"Infrastructure","category":"Data Structures","ring":2},"sema_ref":"Tree#ddce","sema_id":"sema:Tree#mh:SHA-256:ddce179b1f23b64fe76513a37d8d3c9319e0460f191a5c124b3372b8c4d2f415","sema_stub":"ddce","sema_layer":"Infrastructure","sema_category":"Data Structures"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"12a7a292-6cbb-430a-9834-02bfc85acb29","text":"Rootedness: All nodes descend from a single root.","type":"INVARIANT","layer":null,"category":null,"handle":"Rootedness: All nodes descend from a single root.","gloss":null,"stub":null,"metadata":{}},{"id":"39039846-a5d3-4178-ac55-66ec5bbc3b87","text":"Acyclicity: No node is an ancestor of itself.","type":"INVARIANT","layer":null,"category":null,"handle":"Acyclicity: No node is an ancestor of itself.","gloss":null,"stub":null,"metadata":{}},{"id":"Correlation","text":"Correlation#091f","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Correlation#091f","gloss":"Shared movement","stub":"091f","metadata":{"pattern":{"handle":"Correlation","data_schema":{"type":"object","required":["variable_a","variable_b","coefficient"],"properties":{"variable_a":{"type":"string","description":"First variable ID"},"variable_b":{"type":"string","description":"Second variable ID"},"coefficient":{"type":"number","minimum":-1,"maximum":1,"description":"Pearson correlation coefficient [-1, 1]"},"p_value":{"type":"number","description":"Statistical significance of the correlation"},"sample_size":{"type":"integer","description":"Number of observations"}}},"mechanism":"A relationship where two {{variable}}s move together, but one does not necessarily cause the other. 'Cum hoc ergo propter hoc' fallacy trap.","gloss":"Shared movement","_meta":{"layer":"Infrastructure","category":"Data Structures","ring":1,"tier":1},"sema_layer":"Infrastructure","sema_category":"Data Structures","sema_id":"sema:Correlation#mh:SHA-256:091fbf1f3baec2028bbd64c9d2ff335ef41d9ec6ec992e1967c5bca02c777625","sema_ref":"Correlation#091f","sema_stub":"091f"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"Critique","text":"Critique#3e00","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Critique#3e00","gloss":"Qualitative feedback generation","stub":"3e00","metadata":{"pattern":{"handle":"Critique","mechanism":"Analyzes a target {{datum}} against specific {{criteria}} and generates a structured {{assessment}}. Unlike judgment (which yields a scalar), Critique produces descriptive, actionable advice.","gloss":"Qualitative feedback generation","failure_modes":["Nitpicking: Focusing on trivial details while missing structural flaws.","Vague Praise: Generic feedback that offers no actionable path.","Projection: Critiquing the artifact for not being what the critic would have built."],"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"}],"sema_id":"sema:Critique#mh:SHA-256:3e00cb143ce745ed77a29af93416808b848b2a2d9749245b777ad90901aa4ba8","sema_ref":"Critique#3e00","sema_stub":"3e00","_meta":{"tier":1,"layer":"Infrastructure","category":"Data Structures","ring":1},"sema_layer":"Infrastructure","sema_category":"Data Structures","data_schema":{"type":"object","required":["target","criteria","feedback"],"properties":{"target":{"type":"string","description":"Reference to the artifact being critiqued"},"criteria":{"type":"array","items":{"type":"string"},"description":"The criteria used for evaluation"},"feedback":{"type":"array","items":{"type":"object","properties":{"criterion":{"type":"string"},"observation":{"type":"string"},"suggestion":{"type":"string"}}},"description":"Structured feedback items"},"strengths":{"type":"array","items":{"type":"string"},"description":"Identified positive aspects"},"weaknesses":{"type":"array","items":{"type":"string"},"description":"Identified areas for improvement"}}}},"layer":"Infrastructure","category":"Data Structures"}},{"id":"588f89f8-d71f-40e3-863b-a94dd0188689","text":"Feedback must be descriptive, not just scalar.","type":"INVARIANT","layer":null,"category":null,"handle":"Feedback must be descriptive, not just scalar.","gloss":null,"stub":null,"metadata":{}},{"id":"55df83ed-3298-4365-9919-f3ed1eb1eac8","text":"Must reference specific criteria.","type":"INVARIANT","layer":null,"category":null,"handle":"Must reference specific criteria.","gloss":null,"stub":null,"metadata":{}},{"id":"Check","text":"Check#1544","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Check#1544","gloss":"Non-blocking truth evaluation","stub":"1544","metadata":{"pattern":{"handle":"Check","data_schema":{"type":"object","required":["target_id","condition","status"],"properties":{"target_id":{"type":"string","description":"The entity being checked"},"condition":{"type":"string","description":"The logic predicate"},"status":{"type":"boolean","description":"True/False result"},"evidence":{"type":"string","description":"Why it passed/failed"}}},"mechanism":"A non-blocking verification primitive. Evaluates the truth-value of a {{condition}} against a target and returns a Boolean status. Unlike a {{gate}} (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?'.","gloss":"Non-blocking truth evaluation","failure_modes":["False Positive: Check returns True due to flawed logic or sensor noise.","Heisenbug: The act of checking alters the state being checked."],"invariants":["Side-Effect Free: Running a check must not mutate the target state.","Determinism: Same input context yields same boolean result."],"_meta":{"tier":1,"layer":"Infrastructure","category":"Data Structures","ring":0,"related":["Gate#5c08","Validate#16b2","Judge#3d5f"]},"sema_id":"sema:Check#mh:SHA-256:1544e646894003b4bac963cee70097a4bffd75f6cb753f218befb2079f8383a6","sema_ref":"Check#1544","sema_stub":"1544","sema_layer":"Infrastructure","sema_category":"Data Structures"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"88302e40-2bdf-4bc8-ae05-4efd78164c2f","text":"Side-Effect Free: Running a check must not mutate the target state.","type":"INVARIANT","layer":null,"category":null,"handle":"Side-Effect Free: Running a check must not mutate the target state.","gloss":null,"stub":null,"metadata":{}},{"id":"4e8be21c-e0a3-42f4-9832-c0c038b46fd4","text":"Determinism: Same input context yields same boolean result.","type":"INVARIANT","layer":null,"category":null,"handle":"Determinism: Same input context yields same boolean result.","gloss":null,"stub":null,"metadata":{}},{"id":"SurvivorCorrect","text":"SurvivorCorrect#45db","type":"PATTERN","layer":"Mind","category":"Inference","handle":"SurvivorCorrect#45db","gloss":"Accounting for silent failures in data","stub":"45db","metadata":{"pattern":{"handle":"SurvivorCorrect","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 {{base_rate_include}}.","gloss":"Accounting for silent failures in data","failure_modes":["Phantom Hunt: Wasting resources looking for failures in a dataset that is genuinely 100% successful."],"invariants":["{{cognitive_bias}} reduced","Sample re-weighted to account for missing data"],"preconditions":["Filtered dataset (survivors only)"],"postconditions":["True population estimate"],"_meta":{"tier":1,"layer":"Mind","category":"Inference","ring":2},"sema_id":"sema:SurvivorCorrect#mh:SHA-256:45db899fcfc34876e7be9c72005d3c45d5d5983c6c24a357b2df33d189e7effa","sema_ref":"SurvivorCorrect#45db","sema_stub":"45db","sema_layer":"Mind","sema_category":"Inference"},"layer":"Mind","category":"Inference"}},{"id":"e7360568-76b6-49c3-a96c-541b149f01d3","text":"{{cognitive_bias}} reduced","type":"INVARIANT","layer":null,"category":null,"handle":"{{cognitive_bias}} reduced","gloss":null,"stub":null,"metadata":{}},{"id":"0d51d3bf-a242-4ac0-96b4-c71344b3acfc","text":"Sample re-weighted to account for missing data","type":"INVARIANT","layer":null,"category":null,"handle":"Sample re-weighted to account for missing data","gloss":null,"stub":null,"metadata":{}},{"id":"059ec498-f4ab-40ea-ba4c-c8720fdf4c16","text":"Filtered dataset (survivors only)","type":"PRECONDITION","layer":null,"category":null,"handle":"Filtered dataset (survivors only)","gloss":null,"stub":null,"metadata":{}},{"id":"758d1ae4-93f2-433d-8aaf-76f35eef7972","text":"True population estimate","type":"POSTCONDITION","layer":null,"category":null,"handle":"True population estimate","gloss":null,"stub":null,"metadata":{}},{"id":"Identity","text":"Identity#626c","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Identity#626c","gloss":"Unique agent context (The Who)","stub":"626c","metadata":{"pattern":{"handle":"Identity","data_schema":{"type":"object","required":["public_key","claims"],"properties":{"public_key":{"type":"string","description":"Cryptographic identifier (DID/Key)"},"claims":{"type":"object","description":"Verifiable credentials or attributes"},"history_hash":{"type":"string","description":"Pointer to interaction log"}}},"mechanism":"The unique distinguishing context of an agent, including its history, reputation, and public keys. Distinguishes 'Self' from 'Other'. Unlike {{nature}} (what you are) or Role (what you do), Identity is the persistent handle that tracks an entity across interactions.","gloss":"Unique agent context (The Who)","_meta":{"tier":1,"layer":"Infrastructure","category":"Data Structures","ring":0},"sema_layer":"Infrastructure","sema_category":"Data Structures","sema_id":"sema:Identity#mh:SHA-256:626c6180c1969117e0375625c31d4e39b77e6330d3a197dc7099acf85d1d57b3","sema_ref":"Identity#626c","sema_stub":"626c"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"Quorum","text":"Quorum#f67a","type":"PATTERN","layer":"Infrastructure","category":"Primitives","handle":"Quorum#f67a","gloss":"Minimum participation threshold","stub":"f67a","metadata":{"pattern":{"handle":"Quorum","mechanism":"A threshold-checking primitive. Validates if a count of {{ballot}} signals exceeds a required number (K). It does not negotiate; it simply counts. Used as a gating function for higher-level protocols.","gloss":"Minimum participation threshold","failure_modes":["Veto threshold tuning is hard - too low enables cheap blocking, too high makes it useless.","Strategic abstention to avoid commitment.","Deadline pressure enables rushing bad proposals through."],"invariants":["K cannot decrease mid-vote."],"preconditions":["N agents in voting set. K threshold defined where K ≤ N. Proposal formulated."],"postconditions":["Result selected (approve/reject/timeout)","Voting tally recorded"],"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"}],"_meta":{"tier":1,"layer":"Infrastructure","category":"Primitives","related":["sema:LazyConsensus#mh:SHA-256:7bd765a60e8b663fb8f3bd3abb5ada96b0be7ceb21b21ea656724138456447b1"],"ring":0},"sema_layer":"Infrastructure","sema_category":"Primitives","sema_id":"sema:Quorum#mh:SHA-256:f67a77baba883520bde348b7ead4a1abad51fe36fd65539f8dc66cdaa2616efd","sema_ref":"Quorum#f67a","sema_stub":"f67a"},"layer":"Infrastructure","category":"Primitives"}},{"id":"25a4d3da-fcdf-49d8-bcdf-dd3cafc50b79","text":"K cannot decrease mid-vote.","type":"INVARIANT","layer":null,"category":null,"handle":"K cannot decrease mid-vote.","gloss":null,"stub":null,"metadata":{}},{"id":"24f382bb-0d31-4fc9-8e4a-ba510d03f093","text":"N agents in voting set. K threshold defined where K ≤ N. Proposal formulated.","type":"PRECONDITION","layer":null,"category":null,"handle":"N agents in voting set. K threshold defined where K ≤ N. Proposal formulated.","gloss":null,"stub":null,"metadata":{}},{"id":"37768409-0dc4-4472-8161-d0f875ec68c6","text":"Result selected (approve/reject/timeout)","type":"POSTCONDITION","layer":null,"category":null,"handle":"Result selected (approve/reject/timeout)","gloss":null,"stub":null,"metadata":{}},{"id":"713ca4b4-c898-4fd2-88ee-207c3665c6d8","text":"Voting tally recorded","type":"POSTCONDITION","layer":null,"category":null,"handle":"Voting tally recorded","gloss":null,"stub":null,"metadata":{}},{"id":"TradeOff","text":"TradeOff#769c","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"TradeOff#769c","gloss":"Exchange of consequences","stub":"769c","metadata":{"pattern":{"handle":"TradeOff","mechanism":"The specific negative consequence accepted in exchange for a positive one. The cost of a {{decision}}. There are no solutions, only trade-offs.","gloss":"Exchange of consequences","invariants":["Opportunity Cost: Selecting X implies rejecting Y.","Explicit Recognition: The cost is acknowledged, not ignored."],"_meta":{"layer":"Mind","category":"Strategy","ring":1,"tier":1},"sema_layer":"Mind","sema_category":"Strategy","sema_id":"sema:TradeOff#mh:SHA-256:769c61729ff84c1f887e3e075f3a94948094da3ecde8bd9ca9f5034717b1e0d0","sema_ref":"TradeOff#769c","sema_stub":"769c"},"layer":"Mind","category":"Strategy"}},{"id":"e0be90f9-1722-407a-9af1-76ea5c8b9722","text":"Opportunity Cost: Selecting X implies rejecting Y.","type":"INVARIANT","layer":null,"category":null,"handle":"Opportunity Cost: Selecting X implies rejecting Y.","gloss":null,"stub":null,"metadata":{}},{"id":"613cd028-6952-4c44-a779-b3841325f2a3","text":"Explicit Recognition: The cost is acknowledged, not ignored.","type":"INVARIANT","layer":null,"category":null,"handle":"Explicit Recognition: The cost is acknowledged, not ignored.","gloss":null,"stub":null,"metadata":{}},{"id":"Entropy","text":"Entropy#a265","type":"PATTERN","layer":"Physics","category":"Primitives","handle":"Entropy#a265","gloss":"Measure of disorder","stub":"a265","metadata":{"pattern":{"handle":"Entropy","mechanism":"A quantitative measure of disorder, uncertainty, or information content in a {{system}} or {{message}}.","gloss":"Measure of disorder","_meta":{"layer":"Physics","category":"Primitives","ring":0,"tier":1,"related":["EntropyPump#961c"]},"sema_id":"sema:Entropy#mh:SHA-256:a2652f69c57b3c737f3d0d910e6751d61ea2e9007046ac0f75ee336d178c9212","sema_ref":"Entropy#a265","sema_stub":"a265","sema_layer":"Physics","sema_category":"Primitives"},"layer":"Physics","category":"Primitives"}},{"id":"Stream","text":"Stream#22f3","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Stream#22f3","gloss":"Continuous data flow","stub":"22f3","metadata":{"pattern":{"handle":"Stream","data_schema":{"type":"object","required":["stream_id"],"properties":{"stream_id":{"type":"string","description":"Unique stream identifier"},"messages":{"type":"array","description":"Ordered sequence of messages"},"cursor":{"type":"integer","description":"Current read position in the stream"},"bounded":{"type":"boolean","description":"Whether the stream has a known end"}}},"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}}.","gloss":"Continuous data flow","invariants":["Ordering: Messages M_n and M_n+1 maintain relative sequence.","Causality: Effects cannot precede causes in the stream."],"preconditions":["A Source emitting Messages"],"_meta":{"tier":1,"layer":"Infrastructure","category":"Data Structures","ring":0},"sema_id":"sema:Stream#mh:SHA-256:22f34aeb7fa579ab417c94c54424d1b54e73097208077c890b0e429be87c9f71","sema_ref":"Stream#22f3","sema_stub":"22f3","sema_layer":"Infrastructure","sema_category":"Data Structures"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"da71c3a7-7cf3-4b3d-92b6-5600325c6ecd","text":"Ordering: Messages M_n and M_n+1 maintain relative sequence.","type":"INVARIANT","layer":null,"category":null,"handle":"Ordering: Messages M_n and M_n+1 maintain relative sequence.","gloss":null,"stub":null,"metadata":{}},{"id":"31c8b95f-b95e-4bd8-b5b1-53e5618f999f","text":"Causality: Effects cannot precede causes in the stream.","type":"INVARIANT","layer":null,"category":null,"handle":"Causality: Effects cannot precede causes in the stream.","gloss":null,"stub":null,"metadata":{}},{"id":"d198f3c7-d452-4466-99ab-e9890a0fae35","text":"A Source emitting Messages","type":"PRECONDITION","layer":null,"category":null,"handle":"A Source emitting Messages","gloss":null,"stub":null,"metadata":{}},{"id":"OntologyHandshake","text":"OntologyHandshake#ead0","type":"PATTERN","layer":"Society","category":"Protocols","handle":"OntologyHandshake#ead0","gloss":"Negotiating shared definitions","stub":"ead0","metadata":{"pattern":{"handle":"OntologyHandshake","mechanism":"Before exchanging data, agents exchange 'definition hashes' for key terms using {{compatibility_check}}. If hashes mismatch, they enter a negotiation phase to map their internal ontologies to a temporary shared dictionary (a 'pidgin' {{protocol}}). It uses {{spectral_tune}} to rapidly identify semantic divergence before negotiating definitions.","gloss":"Negotiating shared definitions","failure_modes":["Failure to converge on a mapping.","High negotiation overhead.","Dictionary mismatch risks semantic errors."],"invariants":["Term Consistency, Mapping Bijectivity"],"preconditions":["Both agents have ontologies. Communication channel open. Ontology serializable."],"postconditions":["Shared terms mapped. Unmappable terms flagged. Communication can proceed with known precision."],"_meta":{"tier":2,"layer":"Society","category":"Protocols","ring":1},"sema_id":"sema:OntologyHandshake#mh:SHA-256:ead055e44f108319ace229e30005ea5a3aaf8df540ccf1c1cf0f855aed45e613","sema_ref":"OntologyHandshake#ead0","sema_stub":"ead0","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"722fb9df-f6bc-494c-8702-bc8cbc523c92","text":"Term Consistency, Mapping Bijectivity","type":"INVARIANT","layer":null,"category":null,"handle":"Term Consistency, Mapping Bijectivity","gloss":null,"stub":null,"metadata":{}},{"id":"882a0348-8644-4726-bcd9-ce9637ba7764","text":"Both agents have ontologies. Communication channel open. Ontology serializable.","type":"PRECONDITION","layer":null,"category":null,"handle":"Both agents have ontologies. Communication channel open. Ontology serializable.","gloss":null,"stub":null,"metadata":{}},{"id":"2bfce421-938f-415e-8a0e-78afa1e92869","text":"Shared terms mapped. Unmappable terms flagged. Communication can proceed with known precision.","type":"POSTCONDITION","layer":null,"category":null,"handle":"Shared terms mapped. Unmappable terms flagged. Communication can proceed with known precision.","gloss":null,"stub":null,"metadata":{}},{"id":"Audit","text":"Audit#4044","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Audit#4044","gloss":"Verification of conformance","stub":"4044","metadata":{"pattern":{"handle":"Audit","mechanism":"The process of verifying that a {{system}}'s {{state}} or behavior matches its specifications.","gloss":"Verification of conformance","invariants":["Immutability: Audit logs cannot be altered once written.","Completeness: All checked items must have a verdict."],"preconditions":["Target {{system}} exists and is accessible"],"postconditions":["Audit report generated","Pass/Fail status assigned"],"_meta":{"tier":1,"layer":"Infrastructure","category":"Data Structures","ring":0},"data_schema":{"type":"object","required":["target_id","auditor_id","verdict","timestamp"],"properties":{"target_id":{"type":"string","description":"Hash or ID of the system/artifact audited"},"auditor_id":{"type":"string","description":"ID of the agent performing the check"},"verdict":{"type":"string","enum":["Pass","Fail","Warn"],"description":"Conformance result"},"evidence_log":{"type":"array","items":{"type":"string"},"description":"List of checks performed"},"timestamp":{"type":"string","format":"date-time"}}},"sema_id":"sema:Audit#mh:SHA-256:40447e5c9c68a79109ce76f564ca8c09c2c572f8deabcb92ed3d7db0b845b3c1","sema_ref":"Audit#4044","sema_stub":"4044","sema_layer":"Infrastructure","sema_category":"Data Structures"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"db6de1b0-1b2c-40ee-baf0-92036e12c7de","text":"Immutability: Audit logs cannot be altered once written.","type":"INVARIANT","layer":null,"category":null,"handle":"Immutability: Audit logs cannot be altered once written.","gloss":null,"stub":null,"metadata":{}},{"id":"5b50dc03-8877-4932-99dd-99050c48d9ea","text":"Completeness: All checked items must have a verdict.","type":"INVARIANT","layer":null,"category":null,"handle":"Completeness: All checked items must have a verdict.","gloss":null,"stub":null,"metadata":{}},{"id":"78d069c5-6250-4ee2-a3dc-dd855bea4a58","text":"Target {{system}} exists and is accessible","type":"PRECONDITION","layer":null,"category":null,"handle":"Target {{system}} exists and is accessible","gloss":null,"stub":null,"metadata":{}},{"id":"ba482105-cfec-47b8-b5b8-75ca7dba782a","text":"Audit report generated","type":"POSTCONDITION","layer":null,"category":null,"handle":"Audit report generated","gloss":null,"stub":null,"metadata":{}},{"id":"62d109b9-058c-4811-a86d-baab0513af29","text":"Pass/Fail status assigned","type":"POSTCONDITION","layer":null,"category":null,"handle":"Pass/Fail status assigned","gloss":null,"stub":null,"metadata":{}},{"id":"CircuitBreaker","text":"CircuitBreaker#4162","type":"PATTERN","layer":"Infrastructure","category":"Primitives","handle":"CircuitBreaker#4162","gloss":"Fail-fast protection against cascading failures","stub":"4162","metadata":{"pattern":{"handle":"CircuitBreaker","mechanism":"{{state}} 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}} and retry logic to schedule recovery probes.","gloss":"Fail-fast protection against cascading failures","failure_modes":["Flapping: Threshold too sensitive causes circuit to oscillate between Open/Closed.","Zombie {{state}}: Circuit stuck 'OPEN' because reset logic failed to trigger or persists in failure.","False Positive: Transient network blips trip circuit, blocking healthy traffic."],"invariants":["Fail Fast: If {{state}} == '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}} Persistence: Failure counts reset only on successful transition to 'CLOSED'."],"preconditions":["Failure threshold defined","Target resource identified"],"postconditions":["Internal state updated based on outcome","Request processed OR Blocked"],"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"}],"_meta":{"tier":1,"layer":"Infrastructure","category":"Primitives","ring":1},"sema_layer":"Infrastructure","sema_category":"Primitives","sema_ref":"CircuitBreaker#4162","sema_id":"sema:CircuitBreaker#mh:SHA-256:41621375faf5609423cb05060fbdccf92c6d8f856607a2ae4bf35a76c90cbaec","sema_stub":"4162"},"layer":"Infrastructure","category":"Primitives"}},{"id":"8184a894-2d6a-4421-94a7-993a685ba656","text":"Fail Fast: If {{state}} == 'OPEN', request MUST be rejected immediately with zero backend cost.","type":"INVARIANT","layer":null,"category":null,"handle":"Fail Fast: If {{state}} == 'OPEN', request MUST be rejected immediately with zero backend cost.","gloss":null,"stub":null,"metadata":{}},{"id":"0bff3ca6-5e2b-493a-a5a6-93b15723bd22","text":"Leakage Protection: In 'HALF-OPEN' state, concurrency is capped (default: 1) to prevent flood during recovery.","type":"INVARIANT","layer":null,"category":null,"handle":"Leakage Protection: In 'HALF-OPEN' state, concurrency is capped (default: 1) to prevent flood during recovery.","gloss":null,"stub":null,"metadata":{}},{"id":"3e6984ad-d0a2-420b-8983-74d4484db6dd","text":"{{state}} Persistence: Failure counts reset only on successful transition to 'CLOSED'.","type":"INVARIANT","layer":null,"category":null,"handle":"{{state}} Persistence: Failure counts reset only on successful transition to 'CLOSED'.","gloss":null,"stub":null,"metadata":{}},{"id":"bda37a03-b63f-4706-8f6d-8d3e82db9369","text":"Failure threshold defined","type":"PRECONDITION","layer":null,"category":null,"handle":"Failure threshold defined","gloss":null,"stub":null,"metadata":{}},{"id":"f0dc8208-338a-4dde-9444-d88919307665","text":"Target resource identified","type":"PRECONDITION","layer":null,"category":null,"handle":"Target resource identified","gloss":null,"stub":null,"metadata":{}},{"id":"6c6fe208-95d7-447d-850c-674fff66a0ba","text":"Internal state updated based on outcome","type":"POSTCONDITION","layer":null,"category":null,"handle":"Internal state updated based on outcome","gloss":null,"stub":null,"metadata":{}},{"id":"64c65a48-fa37-4118-a304-bae6528c06d3","text":"Request processed OR Blocked","type":"POSTCONDITION","layer":null,"category":null,"handle":"Request processed OR Blocked","gloss":null,"stub":null,"metadata":{}},{"id":"Incongruity","text":"Incongruity#e98f","type":"PATTERN","layer":"Infrastructure","category":"Primitives","handle":"Incongruity#e98f","gloss":"The root of Humor and Paradox","stub":"e98f","metadata":{"pattern":{"handle":"Incongruity","mechanism":"A misalignment between expectation and reality. The difference between the predicted {{state}} and the observed {{state}}, often serving as a {{signal}} for learning, humor, or paradox.","gloss":"The root of Humor and Paradox","_meta":{"tier":1,"layer":"Infrastructure","category":"Primitives","ring":0},"sema_id":"sema:Incongruity#mh:SHA-256:e98f92b190747bd8e26597ea3f6bf095428479527d5ca69fb7b30de9423ed1f9","sema_ref":"Incongruity#e98f","sema_stub":"e98f","sema_layer":"Infrastructure","sema_category":"Primitives"},"layer":"Infrastructure","category":"Primitives"}},{"id":"Metric","text":"Metric#8895","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Metric#8895","gloss":"Quantifiable unit of measure","stub":"8895","metadata":{"pattern":{"handle":"Metric","data_schema":{"type":"object","required":["name","value","unit","timestamp"],"properties":{"name":{"type":"string"},"value":{"type":"number"},"unit":{"type":"string"},"timestamp":{"type":"string","format":"date-time"},"dimensions":{"type":"object","description":"Tags for filtering (e.g., {region: 'us-east', service: 'db'})"},"resolution":{"type":"string","description":"Sampling interval (e.g., '1s', '1m')"}}},"mechanism":"A definable, quantifiable measure of a specific property within a {{system}} or {{state}}. It provides the signal for optimization and monitoring.","gloss":"Quantifiable unit of measure","_meta":{"layer":"Infrastructure","category":"Data Structures","ring":0,"tier":1},"sema_id":"sema:Metric#mh:SHA-256:8895c946c0d9728fb06563d2294bde3fe9a3be817d3d50ed1a587fd604bc6b29","sema_ref":"Metric#8895","sema_stub":"8895","sema_layer":"Infrastructure","sema_category":"Data Structures"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"ParetoFront","text":"ParetoFront#9091","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"ParetoFront#9091","gloss":"Explicitly balancing competing constraints","stub":"9091","metadata":{"pattern":{"handle":"ParetoFront","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}} to order solutions by dominance, discarding those strictly inferior on all axes.","gloss":"Explicitly balancing competing constraints","invariants":["Efficiency: {{state}} is optimal if no metric can improve without another degrading","Tradeoff Rate: Gain(A) * ExchangeRate > Loss(B)"],"preconditions":["Metrics are conflicting","Metrics are quantifiable"],"postconditions":["Selected solution lies on the Pareto Frontier"],"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"}],"_meta":{"tier":1,"layer":"Mind","category":"Strategy","related":["sema:OpportunityCost#mh:SHA-256:f0a3f074464fb30b60adac59167d2d34aeadf8fdd47de6c433f278c0036223fb","sema:Satisfice#mh:SHA-256:fa75c44d4d400749a16f521c8c2793207877c783154cc00a93390beae85d2e0d"],"ring":2},"sema_id":"sema:ParetoFront#mh:SHA-256:9091ffbe5c96a8da82e0aba315ad4bc9191b92a69656df4ffe18706a954bf822","sema_ref":"ParetoFront#9091","sema_stub":"9091","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"3f9497f0-8fca-48f9-8aa8-39c473c5888d","text":"Efficiency: {{state}} is optimal if no metric can improve without another degrading","type":"INVARIANT","layer":null,"category":null,"handle":"Efficiency: {{state}} is optimal if no metric can improve without another degrading","gloss":null,"stub":null,"metadata":{}},{"id":"7feb7d96-21f0-41ae-afa5-dd0f3b6c6ae5","text":"Tradeoff Rate: Gain(A) * ExchangeRate > Loss(B)","type":"INVARIANT","layer":null,"category":null,"handle":"Tradeoff Rate: Gain(A) * ExchangeRate > Loss(B)","gloss":null,"stub":null,"metadata":{}},{"id":"bc5a527e-677b-4ed0-99b8-312f54864946","text":"Metrics are conflicting","type":"PRECONDITION","layer":null,"category":null,"handle":"Metrics are conflicting","gloss":null,"stub":null,"metadata":{}},{"id":"e449fc75-81f2-45b4-9894-a28f9bfcf0b0","text":"Metrics are quantifiable","type":"PRECONDITION","layer":null,"category":null,"handle":"Metrics are quantifiable","gloss":null,"stub":null,"metadata":{}},{"id":"ad628f9b-8ae7-4b6f-9a57-f9e7c6d6df8a","text":"Selected solution lies on the Pareto Frontier","type":"POSTCONDITION","layer":null,"category":null,"handle":"Selected solution lies on the Pareto Frontier","gloss":null,"stub":null,"metadata":{}},{"id":"Robustness","text":"Robustness#132c","type":"PATTERN","layer":"Society","category":"Protocols","handle":"Robustness#132c","gloss":"Resistance to failure under stress","stub":"132c","metadata":{"pattern":{"handle":"Robustness","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.","gloss":"Resistance to failure under stress","failure_modes":["Rigidity: {{system}} becomes too stiff to adapt","False Robustness: Valid only under known stressors, fragile to black swans"],"invariants":["Survival: Function({{state}} + Shock) == Function({{state}})"],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":1},"sema_id":"sema:Robustness#mh:SHA-256:132c09ccd0ad128aec982b0ba12b672106b6f9aedcd1b052c950ee0eb81162a1","sema_ref":"Robustness#132c","sema_stub":"132c","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"a1f25fd2-9cd8-40a6-8839-d254c48ecdd4","text":"Survival: Function({{state}} + Shock) == Function({{state}})","type":"INVARIANT","layer":null,"category":null,"handle":"Survival: Function({{state}} + Shock) == Function({{state}})","gloss":null,"stub":null,"metadata":{}},{"id":"Shard","text":"Shard#1e74","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Shard#1e74","gloss":"Deterministic partitioning of state","stub":"1e74","metadata":{"pattern":{"handle":"Shard","data_schema":{"type":"object","required":["shard_id","partition_index"],"properties":{"shard_id":{"type":"string","description":"Unique identifier for this shard"},"key":{"type":"string","description":"The key used to route to this shard"},"partition_index":{"type":"integer","description":"Which partition this shard belongs to"},"data":{"description":"The shard's contents"}}},"mechanism":"The fundamental primitive of distribution. It deterministically partitions a Resource, {{state}}, or {{vector}} into disjoint subsets (Shards) based on a Key (e.g., ID, Hash, Time). Unlike `Decompose` (which splits complexity), `Shard` splits volume/load.","gloss":"Deterministic partitioning of state","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"}],"_meta":{"tier":0,"layer":"Infrastructure","category":"Data Structures","ring":0},"sema_id":"sema:Shard#mh:SHA-256:1e7407cbee28a243c16fac90559884c44c3d12cbded23486cd281853627bad0b","sema_ref":"Shard#1e74","sema_stub":"1e74","sema_layer":"Infrastructure","sema_category":"Data Structures"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"03abf5ea-1544-459b-b41f-9f9364adc98c","text":"Conservation: Sum(Shards) == Total.","type":"INVARIANT","layer":null,"category":null,"handle":"Conservation: Sum(Shards) == Total.","gloss":null,"stub":null,"metadata":{}},{"id":"cfe06fb9-b910-40aa-8c00-17ef90977cd9","text":"Disjointness: Intersection(Shard_A, Shard_B) == Empty.","type":"INVARIANT","layer":null,"category":null,"handle":"Disjointness: Intersection(Shard_A, Shard_B) == Empty.","gloss":null,"stub":null,"metadata":{}},{"id":"f1a7af79-1d99-4087-acbe-5afaa4cf4789","text":"Determinism: Key K always routes to Shard S.","type":"INVARIANT","layer":null,"category":null,"handle":"Determinism: Key K always routes to Shard S.","gloss":null,"stub":null,"metadata":{}},{"id":"Snapshot","text":"Snapshot#0ae9","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Snapshot#0ae9","gloss":"Immutable state record","stub":"0ae9","metadata":{"pattern":{"handle":"Snapshot","mechanism":"A static, immutable record of the {{state}} of a {{system}} or object at a specific point in time.","gloss":"Immutable state record","failure_modes":["Serialization Gap: In-memory state (e.g., open sockets) that cannot be serialized.","Corruption: Snapshot hash matches but data is unreadable.","Staleness: Restoring from a snapshot that is logically valid but temporally obsolete."],"_meta":{"tier":1,"layer":"Infrastructure","category":"Data Structures","ring":0,"related":["StateSnapshot#940f"]},"sema_id":"sema:Snapshot#mh:SHA-256:0ae992361f9dfef49e88efa9a985826833260038fb99978615f5df709eba04f1","sema_ref":"Snapshot#0ae9","sema_stub":"0ae9","sema_layer":"Infrastructure","sema_category":"Data Structures","data_schema":{"type":"object","required":["snapshot_id","timestamp","state_hash","data"],"properties":{"snapshot_id":{"type":"string"},"target_system_id":{"type":"string"},"timestamp":{"type":"string","format":"date-time"},"state_hash":{"type":"string","description":"Merkle root of the state"},"data":{"type":"object","description":"The actual serialized state payload"},"meta":{"type":"object","properties":{"reason":{"type":"string"},"creator_id":{"type":"string"}}}}}},"layer":"Infrastructure","category":"Data Structures"}},{"id":"Transition","text":"Transition#072d","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Transition#072d","gloss":"State change","stub":"072d","metadata":{"pattern":{"handle":"Transition","data_schema":{"type":"object","required":["from_state","to_state","trigger_event"],"properties":{"from_state":{"type":"string","description":"Origin state ID"},"to_state":{"type":"string","description":"Destination state ID"},"trigger_event":{"type":"object","description":"Event causing the transition"},"timestamp":{"type":"string","format":"date-time"}}},"mechanism":"The atomic progression from an origin {{state}} to a destination {{state}}, adhering to {{system}} transition rules.","gloss":"State change","_meta":{"tier":1,"layer":"Infrastructure","category":"Data Structures","ring":0},"sema_id":"sema:Transition#mh:SHA-256:072d2cb413f704ace7da4027449396ee7bac683536da918a39e93f4f43e0d1b5","sema_ref":"Transition#072d","sema_stub":"072d","sema_layer":"Infrastructure","sema_category":"Data Structures"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"Value","text":"Value#3c5d","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Value#3c5d","gloss":"A measure of utility","stub":"3c5d","metadata":{"pattern":{"handle":"Value","data_schema":{"type":"object","required":["magnitude","unit"],"properties":{"magnitude":{"type":"number","description":"Scalar utility or worth"},"unit":{"type":"string","description":"Currency, energy, or utility metric"},"context":{"type":"string","description":"Scope where this value applies"}}},"mechanism":"A quantitative or qualitative measure of utility, worth, or priority assigned to a {{state}} or resource.","gloss":"A measure of utility","_meta":{"tier":1,"layer":"Infrastructure","category":"Data Structures","ring":0},"sema_id":"sema:Value#mh:SHA-256:3c5de39bf1f148c0da463c8e5b2fd928a67ce8547fe30a5d5afe436560ab68b6","sema_ref":"Value#3c5d","sema_stub":"3c5d","sema_layer":"Infrastructure","sema_category":"Data Structures"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"WorldReversible","text":"WorldReversible#f664","type":"PATTERN","layer":"Society","category":"Protocols","handle":"WorldReversible#f664","gloss":"Designing for zero-cost undo","stub":"f664","metadata":{"pattern":{"handle":"WorldReversible","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.","gloss":"Designing for zero-cost undo","failure_modes":["Storage explosion (keeping all history)."],"invariants":["Lossless Undo: {{state}}(T) can be fully restored from {{state}}(T+1)","Low Friction: Cost(Undo) ~ Cost(Do)"],"preconditions":["Storage is sufficient for history"],"postconditions":["Irreversible actions wrapped in 'Commit' gates"],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":0},"sema_id":"sema:WorldReversible#mh:SHA-256:f6649f97dc12bc980722caa393140b9043af7dd470fdac4e1f40fa3f6a22dfbe","sema_ref":"WorldReversible#f664","sema_stub":"f664","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"495c9edb-c3b2-49ba-95ae-cbb1f24e2417","text":"Lossless Undo: {{state}}(T) can be fully restored from {{state}}(T+1)","type":"INVARIANT","layer":null,"category":null,"handle":"Lossless Undo: {{state}}(T) can be fully restored from {{state}}(T+1)","gloss":null,"stub":null,"metadata":{}},{"id":"d70a55ef-e916-49b0-93bc-25cce11067d1","text":"Low Friction: Cost(Undo) ~ Cost(Do)","type":"INVARIANT","layer":null,"category":null,"handle":"Low Friction: Cost(Undo) ~ Cost(Do)","gloss":null,"stub":null,"metadata":{}},{"id":"cb227f50-eea3-441a-9e19-c7896e16041a","text":"Storage is sufficient for history","type":"PRECONDITION","layer":null,"category":null,"handle":"Storage is sufficient for history","gloss":null,"stub":null,"metadata":{}},{"id":"0dc58c77-e375-47a9-b69d-d1225a850f6c","text":"Irreversible actions wrapped in 'Commit' gates","type":"POSTCONDITION","layer":null,"category":null,"handle":"Irreversible actions wrapped in 'Commit' gates","gloss":null,"stub":null,"metadata":{}},{"id":"Chain","text":"Chain#5711","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Chain#5711","gloss":"Sequential data container (Linked List)","stub":"5711","metadata":{"pattern":{"handle":"Chain","data_schema":{"type":"object","required":["nodes","edges","root_id"],"properties":{"nodes":{"type":"array"},"edges":{"type":"array"},"root_id":{"type":"string"}}},"mechanism":"A concrete data structure representing a sequential list of linked nodes. Unlike {{linear}} (which is an abstract topology class), a Chain is the instantiated storage object containing the steps and their data payloads.","gloss":"Sequential data container (Linked List)","invariants":["Connectivity: Node(N) must point to Node(N+1).","Acyclicity: No loops permitted."],"_meta":{"tier":1,"layer":"Infrastructure","category":"Data Structures","ring":2},"sema_id":"sema:Chain#mh:SHA-256:57119a990ff1c50eda6cb301dfec09450d2cbb21659ca541560b6bbb2ece0332","sema_ref":"Chain#5711","sema_stub":"5711","sema_layer":"Infrastructure","sema_category":"Data Structures"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"4ca77942-460c-4114-a9ec-4f524b6fb4c0","text":"Connectivity: Node(N) must point to Node(N+1).","type":"INVARIANT","layer":null,"category":null,"handle":"Connectivity: Node(N) must point to Node(N+1).","gloss":null,"stub":null,"metadata":{}},{"id":"82ce3f15-0f17-4b85-ae45-14cd273b12d4","text":"Acyclicity: No loops permitted.","type":"INVARIANT","layer":null,"category":null,"handle":"Acyclicity: No loops permitted.","gloss":null,"stub":null,"metadata":{}},{"id":"Causation","text":"Causation#63e1","type":"PATTERN","layer":"Physics","category":"Primitives","handle":"Causation#63e1","gloss":"Direct force relationship","stub":"63e1","metadata":{"pattern":{"handle":"Causation","mechanism":"A relationship where one event directly forces another to occur. Distinct from {{correlation}} in that manipulating the cause alters the effect.","gloss":"Direct force relationship","_meta":{"layer":"Physics","category":"Primitives","ring":1,"tier":1},"sema_layer":"Physics","sema_category":"Primitives","sema_id":"sema:Causation#mh:SHA-256:63e1089ee47f39bb6e2aeb8de41bb1f5a36666053833d0f198be91aea7d58dbc","sema_ref":"Causation#63e1","sema_stub":"63e1"},"layer":"Physics","category":"Primitives"}},{"id":"Synthesis","text":"Synthesis#3252","type":"PATTERN","layer":"Mind","category":"Reasoning","handle":"Synthesis#3252","gloss":"Combining elements","stub":"3252","metadata":{"pattern":{"handle":"Synthesis","mechanism":"The process of combining separate elements into a unified whole. The opposite of {{critique}} or Analysis. It constructs new meaning from parts.","gloss":"Combining elements","_meta":{"layer":"Mind","category":"Reasoning","ring":1,"tier":1},"sema_layer":"Mind","sema_category":"Reasoning","sema_id":"sema:Synthesis#mh:SHA-256:3252f9a67ea7200bf8eea5adadba88dd1716d47c30a37e534cadcbfdc62ac797","sema_ref":"Synthesis#3252","sema_stub":"3252"},"layer":"Mind","category":"Reasoning"}},{"id":"Search","text":"Search#d608","type":"PATTERN","layer":"Infrastructure","category":"Primitives","handle":"Search#d608","gloss":"Active retrieval of matching entities","stub":"d608","metadata":{"pattern":{"handle":"Search","mechanism":"Active scanning of a domain (memory, environment, data) to locate entities that match a {{criteria}}. It iterates through the domain, applying {{check}} to filter candidates.","gloss":"Active retrieval of matching entities","invariants":["Determinism: Same domain + same criteria = same results.","Completeness: Must not silently skip accessible items."],"_meta":{"tier":1,"layer":"Infrastructure","category":"Primitives","ring":0},"sema_ref":"Search#d608","sema_id":"sema:Search#mh:SHA-256:d6083dea6898b63d14ccb2542fcfa05561a1f6326000c8d9c190599afd99b123","sema_stub":"d608","sema_layer":"Infrastructure","sema_category":"Primitives"},"layer":"Infrastructure","category":"Primitives"}},{"id":"445e14bc-80d4-442d-85be-1cd0421dd71b","text":"Completeness: Must not silently skip accessible items.","type":"INVARIANT","layer":null,"category":null,"handle":"Completeness: Must not silently skip accessible items.","gloss":null,"stub":null,"metadata":{}},{"id":"ShoutWhisper","text":"ShoutWhisper#35dd","type":"PATTERN","layer":"Society","category":"Protocols","handle":"ShoutWhisper#35dd","gloss":"Dual-mode communication","stub":"35dd","metadata":{"pattern":{"handle":"ShoutWhisper","mechanism":"Agents 'Shout' (broadcast) high-level intent to discover peers, then switch to 'Whisper' (encrypted P2P) for the actual coordination. Optimizes bandwidth and privacy.","gloss":"Dual-mode communication","failure_modes":["Metadata leakage during the Shout phase."],"invariants":["Amplitude {{check}}: Shout must reach >90% of network","Privacy {{check}}: Whisper content encrypted to Recipient"],"preconditions":["Broadcast channel available"],"postconditions":["{{global}} signal sent, payload private"],"_meta":{"tier":1,"layer":"Society","category":"Protocols","related":["sema:Route#mh:SHA-256:7c7e44685dd8d0fffb3d9ff54cbfb5eba19791e324b6a6ed66382b03f2226fc9"],"ring":1},"sema_id":"sema:ShoutWhisper#mh:SHA-256:35ddf298feb20dc16aeaa1294566eddb2dda1928744d7d25e747ae9a697d0d78","sema_ref":"ShoutWhisper#35dd","sema_stub":"35dd","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"8ec728b1-73bf-468e-91e8-ed7e49ae1b7d","text":"Amplitude {{check}}: Shout must reach >90% of network","type":"INVARIANT","layer":null,"category":null,"handle":"Amplitude {{check}}: Shout must reach >90% of network","gloss":null,"stub":null,"metadata":{}},{"id":"acf84a27-f454-4ad8-ac70-fee72bb998f6","text":"Privacy {{check}}: Whisper content encrypted to Recipient","type":"INVARIANT","layer":null,"category":null,"handle":"Privacy {{check}}: Whisper content encrypted to Recipient","gloss":null,"stub":null,"metadata":{}},{"id":"e011d33c-c640-4bce-ac91-1c7aa392c42d","text":"Broadcast channel available","type":"PRECONDITION","layer":null,"category":null,"handle":"Broadcast channel available","gloss":null,"stub":null,"metadata":{}},{"id":"3b9bc24f-202b-4858-a5a2-72b0df4ecb87","text":"{{global}} signal sent, payload private","type":"POSTCONDITION","layer":null,"category":null,"handle":"{{global}} signal sent, payload private","gloss":null,"stub":null,"metadata":{}},{"id":"BearerToken","text":"BearerToken#2fe9","type":"PATTERN","layer":"Society","category":"Protocols","handle":"BearerToken#2fe9","gloss":"Possession-based authorization","stub":"2fe9","metadata":{"pattern":{"handle":"BearerToken","mechanism":"A portable authorization artifact. Unlike {{identity}}-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.","gloss":"Possession-based authorization","failure_modes":["Theft: If a BearerToken is intercepted, the attacker gains full rights (no identity check is performed).","Replay Attack: Using a spent token again (requires Nonce or Expiry).","Scope Creep: Token grants more rights than necessary for the task."],"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."],"preconditions":["Issuer public key is known to Verifier","Token is within validity window"],"postconditions":["Access granted or denied based on signature verification"],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":0},"sema_id":"sema:BearerToken#mh:SHA-256:2fe9926ab156fd1df414f52e9a4d430f75c7c3311d217cd685f514253f4b1f9d","sema_ref":"BearerToken#2fe9","sema_stub":"2fe9","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"1452244d-f943-4dd7-b57c-12a5899393b3","text":"Possession Equals Access: The token itself grants rights; no identity check required.","type":"INVARIANT","layer":null,"category":null,"handle":"Possession Equals Access: The token itself grants rights; no identity check required.","gloss":null,"stub":null,"metadata":{}},{"id":"3a9851b3-c9b4-4382-add4-200423371646","text":"Possession Equals Authority: Verifier checks Token signature, not ID.","type":"INVARIANT","layer":null,"category":null,"handle":"Possession Equals Authority: Verifier checks Token signature, not ID.","gloss":null,"stub":null,"metadata":{}},{"id":"025c2620-43d0-40ee-9e77-6d0b83134729","text":"Revocability: Token MUST have an Expiry or RevocationID.","type":"INVARIANT","layer":null,"category":null,"handle":"Revocability: Token MUST have an Expiry or RevocationID.","gloss":null,"stub":null,"metadata":{}},{"id":"1587287b-d8d1-4634-864d-e27195f763a9","text":"Integrity: Payload must be cryptographically signed by a trusted Issuer.","type":"INVARIANT","layer":null,"category":null,"handle":"Integrity: Payload must be cryptographically signed by a trusted Issuer.","gloss":null,"stub":null,"metadata":{}},{"id":"133dd84a-d0c4-4e3a-bedc-c6a1e834633c","text":"Issuer public key is known to Verifier","type":"PRECONDITION","layer":null,"category":null,"handle":"Issuer public key is known to Verifier","gloss":null,"stub":null,"metadata":{}},{"id":"61901b36-d94e-41a1-945e-07033ccded9b","text":"Token is within validity window","type":"PRECONDITION","layer":null,"category":null,"handle":"Token is within validity window","gloss":null,"stub":null,"metadata":{}},{"id":"70fbe364-d8f4-4ef8-957c-61b1dcabdba3","text":"Access granted or denied based on signature verification","type":"POSTCONDITION","layer":null,"category":null,"handle":"Access granted or denied based on signature verification","gloss":null,"stub":null,"metadata":{}},{"id":"Combine","text":"Combine#5a44","type":"PATTERN","layer":"Infrastructure","category":"Primitives","handle":"Combine#5a44","gloss":"Binary merge operation","stub":"5a44","metadata":{"pattern":{"handle":"Combine","mechanism":"Merge two same-typed values into one. Associative. {{identity}} element: Empty.","gloss":"Binary merge operation","invariants":["Associativity: (A + B) + C = A + (B + C)","Closure: Result type must match Input type"],"_meta":{"tier":1,"layer":"Infrastructure","category":"Primitives","ring":0},"sema_id":"sema:Combine#mh:SHA-256:5a448e8da3c41cd922451ef5cef1acc7b96b99fe516815870e81cb2c18b196d6","sema_ref":"Combine#5a44","sema_stub":"5a44","sema_layer":"Infrastructure","sema_category":"Primitives"},"layer":"Infrastructure","category":"Primitives"}},{"id":"30c4aa20-4785-4934-92a5-577ac29ad07c","text":"Associativity: (A + B) + C = A + (B + C)","type":"INVARIANT","layer":null,"category":null,"handle":"Associativity: (A + B) + C = A + (B + C)","gloss":null,"stub":null,"metadata":{}},{"id":"63b43ce6-3ad7-4432-9084-0542487e4361","text":"Closure: Result type must match Input type","type":"INVARIANT","layer":null,"category":null,"handle":"Closure: Result type must match Input type","gloss":null,"stub":null,"metadata":{}},{"id":"Context","text":"Context#510a","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Context#510a","gloss":"Portable execution environment with inherited constraints","stub":"510a","metadata":{"pattern":{"handle":"Context","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}} Claims. Context flows through delegation chains, acting as the 'Stack Frame' of the agentic system. It allows agents to be paused, moved, or cloned.","gloss":"Portable execution environment with inherited constraints","failure_modes":["Context Contamination/Leak: Private data from one context leaking into another (e.g., across tenant boundaries).","Context Poisoning: malicious prompts or data injected into the context to hijack agent behavior.","Stale Context: Acting on outdated information after a long pause.","Context Explosion: Size grows beyond the window limit of the model."],"invariants":["{{constraint}} 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)."],"preconditions":["Parent context exists (or Root is created)","Schema is defined"],"postconditions":["agent has a valid environment to Execute"],"_meta":{"tier":3,"layer":"Infrastructure","category":"Data Structures","related":["ContextCompress","ContextSwitch","AnchorDrop"],"ring":0},"data_schema":{"type":"object","properties":{"id":{"type":"string"},"constraints":{"type":"array"},"history":{"type":"array"},"variables":{"type":"object"}}},"sema_id":"sema:Context#mh:SHA-256:510af8317d84bfff7dbba4ebbe2ae2a14d0e28ed8ed342a4e8dbc2e3294c1353","sema_ref":"Context#510a","sema_stub":"510a","sema_layer":"Infrastructure","sema_category":"Data Structures"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"a13bca3e-5e8b-4aab-80f0-b42cc6f1a535","text":"{{constraint}} Monotonicity: Child contexts can ADD constraints but never REMOVE inherited ones.","type":"INVARIANT","layer":null,"category":null,"handle":"{{constraint}} Monotonicity: Child contexts can ADD constraints but never REMOVE inherited ones.","gloss":null,"stub":null,"metadata":{}},{"id":"4a3f3a0e-80f2-4119-b594-9b612c673fbe","text":"Serializability: The entire context must be serializable to JSON/Storage for persistence.","type":"INVARIANT","layer":null,"category":null,"handle":"Serializability: The entire context must be serializable to JSON/Storage for persistence.","gloss":null,"stub":null,"metadata":{}},{"id":"2160d0a9-fb00-498d-a944-439bf53070b4","text":"Provenance: Every item in the context must be traceable to its source (Observation, User Input, or Inference).","type":"INVARIANT","layer":null,"category":null,"handle":"Provenance: Every item in the context must be traceable to its source (Observation, User Input, or Inference).","gloss":null,"stub":null,"metadata":{}},{"id":"46e5e121-0bd3-4344-9d7f-f37949784b0f","text":"Parent context exists (or Root is created)","type":"PRECONDITION","layer":null,"category":null,"handle":"Parent context exists (or Root is created)","gloss":null,"stub":null,"metadata":{}},{"id":"fde000fd-8503-4c14-a646-40a7aee19483","text":"Schema is defined","type":"PRECONDITION","layer":null,"category":null,"handle":"Schema is defined","gloss":null,"stub":null,"metadata":{}},{"id":"897f8960-fa20-458f-a17d-51b8328faf1d","text":"agent has a valid environment to Execute","type":"POSTCONDITION","layer":null,"category":null,"handle":"agent has a valid environment to Execute","gloss":null,"stub":null,"metadata":{}},{"id":"LatentAttachment","text":"LatentAttachment#ab68","type":"PATTERN","layer":"Mind","category":"Memory","handle":"LatentAttachment#ab68","gloss":"Hybrid symbolic-neural identity","stub":"ab68","metadata":{"pattern":{"handle":"LatentAttachment","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 {{concept_anchor}}, enabling semantic search without breaking the symbolic hash.","gloss":"Hybrid symbolic-neural identity","failure_modes":["Model shift invalidates embeddings."],"invariants":["{{identity}} Separation: Removing the Latent block MUST NOT change the Canonical Hash","Semantic Proximity: Distance(Symbolic, Latent) < Threshold"],"preconditions":["Embedding model is fingerprinted/versioned"],"postconditions":["Pattern is discoverable via vector search"],"_meta":{"tier":1,"layer":"Mind","category":"Memory","ring":0},"sema_id":"sema:LatentAttachment#mh:SHA-256:ab684573c68d4eb05cab650f17e6970a22e65e7d989b53db3281422785fbfec4","sema_ref":"LatentAttachment#ab68","sema_stub":"ab68","sema_layer":"Mind","sema_category":"Memory"},"layer":"Mind","category":"Memory"}},{"id":"0c160b97-0fa6-4ab7-87c6-121c352fbc31","text":"{{identity}} Separation: Removing the Latent block MUST NOT change the Canonical Hash","type":"INVARIANT","layer":null,"category":null,"handle":"{{identity}} Separation: Removing the Latent block MUST NOT change the Canonical Hash","gloss":null,"stub":null,"metadata":{}},{"id":"4a3cc6ca-4663-4076-9d94-49809f8ed3ed","text":"Semantic Proximity: Distance(Symbolic, Latent) < Threshold","type":"INVARIANT","layer":null,"category":null,"handle":"Semantic Proximity: Distance(Symbolic, Latent) < Threshold","gloss":null,"stub":null,"metadata":{}},{"id":"aba2a238-c7b4-449d-8620-29d7b7fdbd3c","text":"Embedding model is fingerprinted/versioned","type":"PRECONDITION","layer":null,"category":null,"handle":"Embedding model is fingerprinted/versioned","gloss":null,"stub":null,"metadata":{}},{"id":"57715ec3-7ba9-4a33-a151-e2baa2544ba4","text":"Pattern is discoverable via vector search","type":"POSTCONDITION","layer":null,"category":null,"handle":"Pattern is discoverable via vector search","gloss":null,"stub":null,"metadata":{}},{"id":"Resource","text":"Resource#9bb2","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Resource#9bb2","gloss":"Finite allocatable entity","stub":"9bb2","metadata":{"pattern":{"handle":"Resource","mechanism":"A finite, identifiable entity that can be allocated, consumed, or locked. Resources have {{identity}}, may be renewable or exhaustible, and are subject to contention when demand exceeds supply. Forms the basis for {{budget}} allocation and mutex coordination.","gloss":"Finite allocatable entity","invariants":["Conservation: Resources cannot be created from nothing within a closed system","Identity: Each resource instance has a unique handle"],"_meta":{"tier":1,"layer":"Infrastructure","category":"Data Structures","ring":0},"data_schema":{"type":"object","required":["resource_id","type","owner_id"],"properties":{"resource_id":{"type":"string","description":"Unique asset ID"},"type":{"type":"string","enum":["Compute","Storage","Bandwidth","Token"]},"quantity":{"type":"number"},"unit":{"type":"string"},"owner_id":{"type":"string","description":"Current holder/owner"},"lock_state":{"type":"object","properties":{"locked":{"type":"boolean"},"locked_until":{"type":"string","format":"date-time"},"holder_id":{"type":"string"}}}}},"sema_ref":"Resource#9bb2","sema_id":"sema:Resource#mh:SHA-256:9bb2dd733e5900d441d35d2c6e74f69dc4e4afe536c12adbcfc5863f3ada2922","sema_stub":"9bb2","sema_layer":"Infrastructure","sema_category":"Data Structures"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"474718dc-4914-4de1-b41e-ffbed1ee09cb","text":"Conservation: Resources cannot be created from nothing within a closed system","type":"INVARIANT","layer":null,"category":null,"handle":"Conservation: Resources cannot be created from nothing within a closed system","gloss":null,"stub":null,"metadata":{}},{"id":"8301a7be-adb1-477f-9931-55796ddd6d9c","text":"Identity: Each resource instance has a unique handle","type":"INVARIANT","layer":null,"category":null,"handle":"Identity: Each resource instance has a unique handle","gloss":null,"stub":null,"metadata":{}},{"id":"Event","text":"Event#7e71","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Event#7e71","gloss":"Discrete temporal occurrence","stub":"7e71","metadata":{"pattern":{"handle":"Event","data_schema":{"type":"object","required":["event_id","timestamp","type"],"properties":{"event_id":{"type":"string","description":"Unique identifier"},"type":{"type":"string","description":"Event classification"},"payload":{"type":"object","description":"Data associated with the occurrence"},"timestamp":{"type":"string","format":"date-time"}}},"mechanism":"A discrete occurrence involving a change in {{state}} at a specific point in time. Events are the atomic units of causality and history, distinct from continuous {{stream}}s.","gloss":"Discrete temporal occurrence","_meta":{"layer":"Infrastructure","category":"Data Structures","ring":0,"tier":1},"sema_layer":"Infrastructure","sema_category":"Data Structures","sema_id":"sema:Event#mh:SHA-256:7e714768a058525ab90fde17df7c38c827e4b3ceb771bdcba49586347271a00d","sema_ref":"Event#7e71","sema_stub":"7e71"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"InvariantFilter","text":"InvariantFilter#a541","type":"PATTERN","layer":"Society","category":"Protocols","handle":"InvariantFilter#a541","gloss":"Rule-based message filtering","stub":"a541","metadata":{"pattern":{"handle":"InvariantFilter","mechanism":"A strict communication firewall that intercepts {{message}}s (incoming or outgoing) and evaluates them against a set of explicit logical predicates (Invariants). If a {{message}} 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}} via a rigorous {{check}} against defined predicates before allowing transit.","gloss":"Rule-based message filtering","failure_modes":["Incomplete Invariants: If the filter does not catch a specific edge case, bad data leaks through.","False Positives: Overly strict invariants blocking legitimate messages.","Latency: Complex predicate evaluation slowing down high-throughput streams."],"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."],"preconditions":["A defined Invariant Set (Predicates)","A {{message}} or {{stream}} to evaluate"],"postconditions":["Only compliant messages reach the destination","Blocked messages are logged (optional)"],"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"}],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":1},"sema_id":"sema:InvariantFilter#mh:SHA-256:a541049098acbba01ebe35ee9c23ebbdaf9d34e252b1b69f97daa87b3e96eea2","sema_ref":"InvariantFilter#a541","sema_stub":"a541","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"987bc1f1-7c21-49d1-ba78-60708aa11666","text":"Atomic Blocking: If Predicate(M) is False, M is NOT forwarded.","type":"INVARIANT","layer":null,"category":null,"handle":"Atomic Blocking: If Predicate(M) is False, M is NOT forwarded.","gloss":null,"stub":null,"metadata":{}},{"id":"f16289c3-c7a5-4081-9118-ae82966d9d12","text":"Fail-Closed: If evaluation errors (e.g. timeout), default to BLOCK.","type":"INVARIANT","layer":null,"category":null,"handle":"Fail-Closed: If evaluation errors (e.g. timeout), default to BLOCK.","gloss":null,"stub":null,"metadata":{}},{"id":"d27bafa3-24e8-469d-8974-5a4390c312e5","text":"Isolation: The protected agent state is not mutated by evaluation.","type":"INVARIANT","layer":null,"category":null,"handle":"Isolation: The protected agent state is not mutated by evaluation.","gloss":null,"stub":null,"metadata":{}},{"id":"1d74ed64-98cf-4979-9555-e6d3beb0e994","text":"A defined Invariant Set (Predicates)","type":"PRECONDITION","layer":null,"category":null,"handle":"A defined Invariant Set (Predicates)","gloss":null,"stub":null,"metadata":{}},{"id":"3f5ee4b5-4153-4638-a6e0-38cd14276ca5","text":"A {{message}} or {{stream}} to evaluate","type":"PRECONDITION","layer":null,"category":null,"handle":"A {{message}} or {{stream}} to evaluate","gloss":null,"stub":null,"metadata":{}},{"id":"16eb7ab9-cbd0-4a1a-b9d9-9011e8de1750","text":"Only compliant messages reach the destination","type":"POSTCONDITION","layer":null,"category":null,"handle":"Only compliant messages reach the destination","gloss":null,"stub":null,"metadata":{}},{"id":"a7361613-8adf-4161-8815-e7deef3bcdfe","text":"Blocked messages are logged (optional)","type":"POSTCONDITION","layer":null,"category":null,"handle":"Blocked messages are logged (optional)","gloss":null,"stub":null,"metadata":{}},{"id":"StateTransition","text":"StateTransition#3737","type":"PATTERN","layer":"Infrastructure","category":"Primitives","handle":"StateTransition#3737","gloss":"Explicit finite-state machine governance","stub":"3737","metadata":{"pattern":{"handle":"StateTransition","mechanism":"Finite State Machine. A {{transition}} is defined as T: S x Event -> S. Only valid transitions allowed. Current {{state}} determines available actions.","gloss":"Explicit finite-state machine governance","sema_id":"sema:StateTransition#mh:SHA-256:3737f955afcae13b398c1961722ee8511ea8f737aca133329938de5cfb91bb57","sema_ref":"StateTransition#3737","sema_stub":"3737","_meta":{"layer":"Infrastructure","category":"Primitives","ring":0,"tier":1},"sema_layer":"Infrastructure","sema_category":"Primitives","signature":["Transition(State)"]},"layer":"Infrastructure","category":"Primitives"}},{"id":"Decay","text":"Decay#a1d4","type":"PATTERN","layer":"Physics","category":"Primitives","handle":"Decay#a1d4","gloss":"Automatic expiration of stale {{state}}","stub":"a1d4","metadata":{"pattern":{"handle":"Decay","mechanism":"Gradual Attenuation: Without reinforcement, {{value}} V decreases over time. Decay rate R determines half-life. Reinforcement resets or boosts V. Zero threshold triggers {{state}} change or removal.","gloss":"Automatic expiration of stale {{state}}","failure_modes":["Premature Expiry: Valid data decays before it can be used due to miscalibrated half-life."],"invariants":["{{value}} 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"}],"_meta":{"tier":2,"layer":"Physics","category":"Primitives","related":["StateTransition"],"ring":0},"sema_id":"sema:Decay#mh:SHA-256:a1d4b9d5a517a5a8e942a9bedaafdd004b3d7d5bf2e02bd4018af16350bb64f0","sema_ref":"Decay#a1d4","sema_stub":"a1d4","sema_layer":"Physics","sema_category":"Primitives"},"layer":"Physics","category":"Primitives"}},{"id":"bc4114a3-b655-4c58-a5e2-5603a66fe9e3","text":"{{value}} never negative.","type":"INVARIANT","layer":null,"category":null,"handle":"{{value}} never negative.","gloss":null,"stub":null,"metadata":{}},{"id":"ExchangeRate","text":"ExchangeRate#be29","type":"PATTERN","layer":"Society","category":"Economics","handle":"ExchangeRate#be29","gloss":"Conversion ratio between value systems","stub":"be29","metadata":{"pattern":{"handle":"ExchangeRate","mechanism":"A definable ratio between two distinct {{value}} types or {{metric}}s at a specific point in time. It allows agents with orthogonal utility functions to transact.","gloss":"Conversion ratio between value systems","invariants":["Bijectivity: Rate(A->B) must equal 1 / Rate(B->A).","Time-Bound: Must include a timestamp or validity window."],"sema_id":"sema:ExchangeRate#mh:SHA-256:be292881aae1af318995e3c0617ed90f9871d2d7e1c6c64e8083fa9a1b3b94f6","sema_ref":"ExchangeRate#be29","sema_stub":"be29","_meta":{"layer":"Society","category":"Economics","ring":1,"tier":1},"sema_layer":"Society","sema_category":"Economics"},"layer":"Society","category":"Economics"}},{"id":"a3dffe73-5c16-41fe-be7c-5f1b04ac73f2","text":"Economics","type":"CATEGORY","layer":null,"category":null,"handle":"Economics","gloss":null,"stub":null,"metadata":{}},{"id":"22906ddb-8a50-4771-9f06-8c0a0ccc49ec","text":"Bijectivity: Rate(A->B) must equal 1 / Rate(B->A).","type":"INVARIANT","layer":null,"category":null,"handle":"Bijectivity: Rate(A->B) must equal 1 / Rate(B->A).","gloss":null,"stub":null,"metadata":{}},{"id":"9b05b93c-a38b-4e88-8bd3-3ec7a602591b","text":"Time-Bound: Must include a timestamp or validity window.","type":"INVARIANT","layer":null,"category":null,"handle":"Time-Bound: Must include a timestamp or validity window.","gloss":null,"stub":null,"metadata":{}},{"id":"OpportunityCost","text":"OpportunityCost#1c66","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"OpportunityCost#1c66","gloss":"Comparative valuation against the best alternative","stub":"1c66","metadata":{"pattern":{"handle":"OpportunityCost","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}} calculation.","gloss":"Comparative valuation against the best alternative","failure_modes":["Analysis Paralysis: Infinite search for the perfect alternative prevents any action."],"invariants":["Cost = {{value}} of best foregone alternative","Resources are finite"],"preconditions":["Choice set > 1","Resource constraint"],"postconditions":["Implicit cost made explicit"],"_meta":{"tier":1,"layer":"Mind","category":"Strategy","ring":1},"sema_ref":"OpportunityCost#1c66","sema_id":"sema:OpportunityCost#mh:SHA-256:1c66f1b8317b3a67b9b8d9f75aee7499244c105ab54012f7d7964af111da897e","sema_stub":"1c66","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"b054387e-f435-4a41-ac6f-b0d17fc87fe5","text":"Cost = {{value}} of best foregone alternative","type":"INVARIANT","layer":null,"category":null,"handle":"Cost = {{value}} of best foregone alternative","gloss":null,"stub":null,"metadata":{}},{"id":"61101517-5da0-4f09-b3a1-4f1eba74ff81","text":"Resources are finite","type":"INVARIANT","layer":null,"category":null,"handle":"Resources are finite","gloss":null,"stub":null,"metadata":{}},{"id":"4b4d87ed-5203-47a1-a1f0-cfc2a627d401","text":"Choice set > 1","type":"PRECONDITION","layer":null,"category":null,"handle":"Choice set > 1","gloss":null,"stub":null,"metadata":{}},{"id":"6b703ff9-d67f-420e-bf0f-53faa6d2f62b","text":"Resource constraint","type":"PRECONDITION","layer":null,"category":null,"handle":"Resource constraint","gloss":null,"stub":null,"metadata":{}},{"id":"46ac40e1-7034-4dad-abe4-480f949d4770","text":"Implicit cost made explicit","type":"POSTCONDITION","layer":null,"category":null,"handle":"Implicit cost made explicit","gloss":null,"stub":null,"metadata":{}},{"id":"Score","text":"Score#29da","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Score#29da","gloss":"Quantitative evaluation result","stub":"29da","metadata":{"pattern":{"handle":"Score","mechanism":"A numerical {{value}} representing the result of an evaluation or measurement. It quantifies a specific property (e.g., quality, fit, risk) on a defined scale.","gloss":"Quantitative evaluation result","_meta":{"layer":"Infrastructure","category":"Data Structures","ring":1,"tier":1},"data_schema":{"type":"number","description":"The numerical score value"},"sema_ref":"Score#29da","sema_id":"sema:Score#mh:SHA-256:29da7b609182c3ecef85ebafc34cae5acd221d65ef0e5c4b2b41bbededb6d414","sema_stub":"29da","sema_layer":"Infrastructure","sema_category":"Data Structures"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"Summary","text":"Summary#310e","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Summary#310e","gloss":"Condensed information","stub":"310e","metadata":{"pattern":{"handle":"Summary","mechanism":"A compressed representation of a {{datum}} or {{artifact}} that retains high-{{value}} (salient) information while discarding redundancy.","gloss":"Condensed information","_meta":{"layer":"Infrastructure","category":"Data Structures","ring":1,"tier":1},"data_schema":{"type":"string","description":"The summarized text or content"},"sema_ref":"Summary#310e","sema_id":"sema:Summary#mh:SHA-256:310e68dd2e7016cbc97e43f87f5aa17631699e4ca49e65d0b43c6d8811a401de","sema_stub":"310e","sema_layer":"Infrastructure","sema_category":"Data Structures"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"Discover","text":"Discover#afa1","type":"PATTERN","layer":"Society","category":"Protocols","handle":"Discover#afa1","gloss":"Distributed query for external resources","stub":"afa1","metadata":{"pattern":{"handle":"Discover","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}}. Uses {{check}} to filter responses against the query. Unlike {{search}} (which scans internal memory or static data), Discover implies active solicitation of peers and handling of asynchronous {{signal}} responses.","gloss":"Distributed query for external resources","_meta":{"tier":1,"category":"Protocols","layer":"Society","ring":2},"sema_id":"sema:Discover#mh:SHA-256:afa14d67f5837d32ee70ae99c0b625d39864254bafd2b11b0ef690cc8fda5dbc","sema_ref":"Discover#afa1","sema_stub":"afa1","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"Act","text":"Act#5d55","type":"PATTERN","layer":"Infrastructure","category":"Primitives","handle":"Act#5d55","gloss":"Root primitive for state modification","stub":"5d55","metadata":{"pattern":{"handle":"Act","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).","gloss":"Root primitive for state modification","failure_modes":["Unintended Side-effect: The action changed state in a way not predicted by the actor.","Partial Execution: The action failed midway, leaving the system in an inconsistent state.","Authorization Failure: The actor attempted an action it lacks permission to perform."],"invariants":["Authorization: Action must be permitted by the current {{context}} constraints.","Observability: All Acts must produce a signal (Success/Failure/Result) observable by the actor.","Causality: An Act cannot precede its Cause (the {{select}}ion of action)."],"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"],"_meta":{"tier":1,"layer":"Infrastructure","category":"Primitives","related":["ToolInvoke","ReAct","AgentSandbox"],"ring":0},"sema_id":"sema:Act#mh:SHA-256:5d55ad7db734254e55dfcb82c83b32a4fd5ac955428e3ff95706f9c3bfc787cd","sema_ref":"Act#5d55","sema_stub":"5d55","sema_layer":"Infrastructure","sema_category":"Primitives"},"layer":"Infrastructure","category":"Primitives"}},{"id":"63f677d2-a84f-465e-9bcd-d4ac95a24bf5","text":"Authorization: Action must be permitted by the current {{context}} constraints.","type":"INVARIANT","layer":null,"category":null,"handle":"Authorization: Action must be permitted by the current {{context}} constraints.","gloss":null,"stub":null,"metadata":{}},{"id":"c1e1bc71-23e7-4193-8a1f-602373e56d88","text":"Observability: All Acts must produce a signal (Success/Failure/Result) observable by the actor.","type":"INVARIANT","layer":null,"category":null,"handle":"Observability: All Acts must produce a signal (Success/Failure/Result) observable by the actor.","gloss":null,"stub":null,"metadata":{}},{"id":"d5a92f29-cfc0-40e0-bbe8-9199b32db58c","text":"Causality: An Act cannot precede its Cause (the {{select}}ion of action).","type":"INVARIANT","layer":null,"category":null,"handle":"Causality: An Act cannot precede its Cause (the {{select}}ion of action).","gloss":null,"stub":null,"metadata":{}},{"id":"1567c85f-fc94-4bc4-a61f-fc05efec3970","text":"Actor has decided to act","type":"PRECONDITION","layer":null,"category":null,"handle":"Actor has decided to act","gloss":null,"stub":null,"metadata":{}},{"id":"19f0b162-7f3d-4b98-98f7-5ba7b0d19d3c","text":"Target system is available","type":"PRECONDITION","layer":null,"category":null,"handle":"Target system is available","gloss":null,"stub":null,"metadata":{}},{"id":"cbd50ad2-d935-4c96-b830-ec525da19797","text":"Permissions grant access","type":"PRECONDITION","layer":null,"category":null,"handle":"Permissions grant access","gloss":null,"stub":null,"metadata":{}},{"id":"d0b1ffc2-8fff-406c-847f-626d29327b73","text":"External state is modified","type":"POSTCONDITION","layer":null,"category":null,"handle":"External state is modified","gloss":null,"stub":null,"metadata":{}},{"id":"40158f99-e38a-4c88-b4dd-2cac4360e05c","text":"Action log is updated","type":"POSTCONDITION","layer":null,"category":null,"handle":"Action log is updated","gloss":null,"stub":null,"metadata":{}},{"id":"6ba0e6a9-0e95-423d-832a-ec51198c989b","text":"Resources (energy/credits) are consumed","type":"POSTCONDITION","layer":null,"category":null,"handle":"Resources (energy/credits) are consumed","gloss":null,"stub":null,"metadata":{}},{"id":"ContextCompress","text":"ContextCompress#6dbd","type":"PATTERN","layer":"Mind","category":"Memory","handle":"ContextCompress#6dbd","gloss":"Semantic compression for long-running contexts","stub":"6dbd","metadata":{"pattern":{"handle":"ContextCompress","mechanism":"A memory management primitive that uses {{compress}} to reduce the token footprint of a {{context}} while preserving critical {{state}}. It explicitly retains active {{constraint}}s and unresolved goals.","gloss":"Semantic compression for long-running contexts","sema_id":"sema:ContextCompress#mh:SHA-256:6dbdad39d305207e19f80a38fbb7622505d35259338335493053eb49cfe4d817","sema_ref":"ContextCompress#6dbd","sema_stub":"6dbd","_meta":{"layer":"Mind","category":"Memory","ring":0,"tier":1},"sema_layer":"Mind","sema_category":"Memory","signature":["Compress(Context)"]},"layer":"Mind","category":"Memory"}},{"id":"ExploreExploit","text":"ExploreExploit#88b0","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"ExploreExploit#88b0","gloss":"Balancing information gathering vs value extraction","stub":"88b0","metadata":{"pattern":{"handle":"ExploreExploit","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}} to dynamically adjust the epsilon parameter from exploration to exploitation.","gloss":"Balancing information gathering vs value extraction","failure_modes":["{{context}} Drift: The environment changes during the Exploit phase, making the best option obsolete."],"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"}],"_meta":{"tier":2,"layer":"Mind","category":"Strategy","ring":2},"sema_id":"sema:ExploreExploit#mh:SHA-256:88b0c9b3824b0ab8a8fa33dbb75136563eae43481eb087e85f5db2e6db17f3de","sema_ref":"ExploreExploit#88b0","sema_stub":"88b0","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"ea1bb3a9-f4fd-4b02-8080-5c4c7a7c66d5","text":"Threshold immutable during execution.","type":"INVARIANT","layer":null,"category":null,"handle":"Threshold immutable during execution.","gloss":null,"stub":null,"metadata":{}},{"id":"Observe","text":"Observe#8ebd","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Observe#8ebd","gloss":"Active State Perception","stub":"8ebd","metadata":{"pattern":{"handle":"Observe","data_schema":{"type":"object","required":["observation_id","source","data"],"properties":{"observation_id":{"type":"string","description":"Unique identifier for this observation"},"source":{"type":"string","description":"Where the observation came from"},"data":{"description":"The raw observed information"},"timestamp":{"type":"string","format":"date-time","description":"When observation occurred"}}},"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}} and state. Unlike passive reception, Observe is often an active query (e.g., polling an API, reading a file).","gloss":"Active State Perception","failure_modes":["Sensor noise: Input data is corrupted or inaccurate.","Blind Spot: Critical information exists but is outside the agent's observable range.","Information Overload: Too much data prevents effective filtering and integration.","Stale Data: Observing a cached state that no longer reflects reality."],"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)."],"preconditions":["Sensors/Tools are active","Actor has attention capacity"],"postconditions":["Internal state is updated","New information is available for Thinking"],"_meta":{"tier":1,"layer":"Infrastructure","category":"Data Structures","related":["Belief","Attention"],"ring":0},"sema_layer":"Infrastructure","sema_category":"Data Structures","sema_id":"sema:Observe#mh:SHA-256:8ebdc058f13dc14e6ed22cd000bc6eb89507e3b6b507cc393c88a8209c65122f","sema_ref":"Observe#8ebd","sema_stub":"8ebd"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"32e6cbde-5ba7-41a8-be54-f9856132cfc1","text":"Read-Only: Observation must not modify the observed state (Side-effect free).","type":"INVARIANT","layer":null,"category":null,"handle":"Read-Only: Observation must not modify the observed state (Side-effect free).","gloss":null,"stub":null,"metadata":{}},{"id":"807b5248-fc5a-49a0-bb48-c2a959064dd3","text":"Truthfulness: The observation must accurately reflect the input signal (no internal distortion).","type":"INVARIANT","layer":null,"category":null,"handle":"Truthfulness: The observation must accurately reflect the input signal (no internal distortion).","gloss":null,"stub":null,"metadata":{}},{"id":"2a8b4cb9-27f7-46d6-b5a3-bbc0fe24ebed","text":"Sensors/Tools are active","type":"PRECONDITION","layer":null,"category":null,"handle":"Sensors/Tools are active","gloss":null,"stub":null,"metadata":{}},{"id":"55450758-eed5-47c1-b189-cfb07e06b1ef","text":"Actor has attention capacity","type":"PRECONDITION","layer":null,"category":null,"handle":"Actor has attention capacity","gloss":null,"stub":null,"metadata":{}},{"id":"d20efec1-a4d7-4e83-ac53-ec52705a62da","text":"Internal state is updated","type":"POSTCONDITION","layer":null,"category":null,"handle":"Internal state is updated","gloss":null,"stub":null,"metadata":{}},{"id":"ba142a57-26cf-46a3-8f5c-95baa380128c","text":"New information is available for Thinking","type":"POSTCONDITION","layer":null,"category":null,"handle":"New information is available for Thinking","gloss":null,"stub":null,"metadata":{}},{"id":"Task","text":"Task#d9f9","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Task#d9f9","gloss":"The atomic unit of intent","stub":"d9f9","metadata":{"pattern":{"handle":"Task","mechanism":"A specification of intent to be performed by a {{system}}. 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}} where child {{constraint}}s must be a superset of parent {{constraint}}s (Holographic Inheritance).","gloss":"The atomic unit of intent","failure_modes":["{{constraint}} Escape: Child task violates parent safety constraints.","Orphan Task: Task created without linkage to parent (except Root).","Zombie Task: Task continues after its {{context}} is invalidated.","Ambiguous Intent: Task description admits multiple incompatible interpretations."],"invariants":["Holographic Inheritance: {{constraint}}s(Child) must include ALL {{constraint}}s(Parent).","Intent Preservation: Decomposition must not lose the original goal.","Linkage: Every non-root Task must reference its parent."],"_meta":{"tier":1,"layer":"Infrastructure","category":"Data Structures","ring":0},"sema_id":"sema:Task#mh:SHA-256:d9f92106bd9cd867b1b753275d6faa37b6ea4fcbb948b283460caedfa75b6955","sema_ref":"Task#d9f9","sema_stub":"d9f9","sema_layer":"Infrastructure","sema_category":"Data Structures","data_schema":{"type":"object","required":["task_id","description","status","created_at"],"properties":{"task_id":{"type":"string","description":"Unique UUID for the task"},"parent_id":{"type":"string","description":"ID of the super-task, if any"},"description":{"type":"string","description":"Natural language intent"},"status":{"type":"string","enum":["Pending","Active","Blocked","Complete","Failed"],"default":"Pending"},"requirements":{"type":"array","items":{"type":"string"},"description":"List of acceptance criteria"},"assigned_solver_id":{"type":"string","description":"The agent/node working on this"},"created_at":{"type":"string","format":"date-time"},"deadline":{"type":"string","format":"date-time"}}}},"layer":"Infrastructure","category":"Data Structures"}},{"id":"ba65e5a7-3375-49c6-81f6-8a67e1043237","text":"Holographic Inheritance: {{constraint}}s(Child) must include ALL {{constraint}}s(Parent).","type":"INVARIANT","layer":null,"category":null,"handle":"Holographic Inheritance: {{constraint}}s(Child) must include ALL {{constraint}}s(Parent).","gloss":null,"stub":null,"metadata":{}},{"id":"8713f15e-c1de-4754-a8be-85af2231aeea","text":"Intent Preservation: Decomposition must not lose the original goal.","type":"INVARIANT","layer":null,"category":null,"handle":"Intent Preservation: Decomposition must not lose the original goal.","gloss":null,"stub":null,"metadata":{}},{"id":"6ad07379-df2e-4f08-b514-8f712adabf75","text":"Linkage: Every non-root Task must reference its parent.","type":"INVARIANT","layer":null,"category":null,"handle":"Linkage: Every non-root Task must reference its parent.","gloss":null,"stub":null,"metadata":{}},{"id":"Think","text":"Think#e1bd","type":"PATTERN","layer":"Mind","category":"Reasoning","handle":"Think#e1bd","gloss":"Atomic cognitive step","stub":"e1bd","metadata":{"pattern":{"handle":"Think","mechanism":"A single cognitive step that transforms input {{context}} into a new {{datum}}. The atomic unit of reasoning—one inference, one connection, one realization. Side-effect free and instantaneous from the perspective of the external world.","gloss":"Atomic cognitive step","failure_modes":["Hallucination: Generating a conclusion that does not follow from the {{context}}.","Premature Closure: Stopping at the first plausible insight without considering alternatives."],"invariants":["Side-Effect Free: Thinking does not change the external world.","Context-Bound: Output must be derivable from input {{context}}."],"preconditions":["{{context}} is available"],"postconditions":["An insight or intermediate conclusion is produced"],"_meta":{"tier":0,"layer":"Mind","category":"Reasoning","ring":0},"sema_id":"sema:Think#mh:SHA-256:e1bd11a90f512c09e3befc43359a01e827f20e278d7032ee962c81f883087d81","sema_ref":"Think#e1bd","sema_stub":"e1bd","sema_layer":"Mind","sema_category":"Reasoning"},"layer":"Mind","category":"Reasoning"}},{"id":"f5eda9bf-d772-4951-8aca-e10a931850ac","text":"Side-Effect Free: Thinking does not change the external world.","type":"INVARIANT","layer":null,"category":null,"handle":"Side-Effect Free: Thinking does not change the external world.","gloss":null,"stub":null,"metadata":{}},{"id":"79b63753-ff54-43b6-896f-e483586eee66","text":"Context-Bound: Output must be derivable from input {{context}}.","type":"INVARIANT","layer":null,"category":null,"handle":"Context-Bound: Output must be derivable from input {{context}}.","gloss":null,"stub":null,"metadata":{}},{"id":"e7ef3178-ac2f-4118-8010-75873236d01d","text":"{{context}} is available","type":"PRECONDITION","layer":null,"category":null,"handle":"{{context}} is available","gloss":null,"stub":null,"metadata":{}},{"id":"f401969b-4116-410f-85a3-7ea298f9c461","text":"An insight or intermediate conclusion is produced","type":"POSTCONDITION","layer":null,"category":null,"handle":"An insight or intermediate conclusion is produced","gloss":null,"stub":null,"metadata":{}},{"id":"VowOfSilence","text":"VowOfSilence#138b","type":"PATTERN","layer":"Society","category":"Protocols","handle":"VowOfSilence#138b","gloss":"Strategic withholding of signal to force counterparty disclosure","stub":"138b","metadata":{"pattern":{"handle":"VowOfSilence","mechanism":"A negotiation tactic where the agent deliberately enforces {{silence}} (zero {{signal}} 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}} or concessions to re-initiate flow.","gloss":"Strategic withholding of signal to force counterparty disclosure","_meta":{"tier":2,"layer":"Society","category":"Protocols","ring":2},"sema_id":"sema:VowOfSilence#mh:SHA-256:138b1c8ff5f1663ead9cb1083d22fe90ca2b723cda0d0177cbd005547dd96cb3","sema_ref":"VowOfSilence#138b","sema_stub":"138b","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"Probability","text":"Probability#356b","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Probability#356b","gloss":"Likelihood measure for uncertain events","stub":"356b","metadata":{"pattern":{"handle":"Probability","mechanism":"A measure of likelihood on [0,1] expressing the degree of belief or frequency with which an {{event}} is expected to occur. Forms the basis for risk assessment, decision-making under uncertainty, and Bayesian updating.","gloss":"Likelihood measure for uncertain events","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"],"_meta":{"tier":1,"layer":"Infrastructure","category":"Data Structures","ring":0},"data_schema":{"type":"number","minimum":0,"maximum":1,"description":"Probability value between 0 and 1"},"sema_ref":"Probability#356b","sema_id":"sema:Probability#mh:SHA-256:356bf7e4b6ca99e4fe7705cb088c3f1cd3a5919334a772e00dc829065c71dffd","sema_stub":"356b","sema_layer":"Infrastructure","sema_category":"Data Structures"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"8d997971-7967-4bec-9d02-bf473d823933","text":"Bounded: 0 ≤ P ≤ 1","type":"INVARIANT","layer":null,"category":null,"handle":"Bounded: 0 ≤ P ≤ 1","gloss":null,"stub":null,"metadata":{}},{"id":"a24af8b5-fe6a-4760-92c0-f8ada8a15519","text":"Normalization: P(certain) = 1, P(impossible) = 0","type":"INVARIANT","layer":null,"category":null,"handle":"Normalization: P(certain) = 1, P(impossible) = 0","gloss":null,"stub":null,"metadata":{}},{"id":"2e5f8ea9-736f-4054-8dd2-34b133d0085c","text":"Additivity: P(A or B) = P(A) + P(B) for mutually exclusive events","type":"INVARIANT","layer":null,"category":null,"handle":"Additivity: P(A or B) = P(A) + P(B) for mutually exclusive events","gloss":null,"stub":null,"metadata":{}},{"id":"LatticeCommit","text":"LatticeCommit#56ee","type":"PATTERN","layer":"Society","category":"Protocols","handle":"LatticeCommit#56ee","gloss":"Geometric neighbor consensus","stub":"56ee","metadata":{"pattern":{"handle":"LatticeCommit","mechanism":"Agents are arranged in a virtual lattice. A {{state_transition}} is only valid if it is cryptographically signed by the agent AND its immediate geometric neighbors (Up, Down, Left, Right). {{quorum}} is local, not global. It requires a localized {{quorum}} of geometric neighbors to validate {{state_transition}}s.","gloss":"Geometric neighbor consensus","failure_modes":["Fracture of the lattice isolates clusters."],"invariants":["Local {{quorum}}: Commit requires signatures from defined Geometric Neighbors","Progress must be monotonic - no backtracking.","{{topology}} {{check}}: Node degree must match Lattice definition (e.g. 4 for 2D grid)"],"preconditions":["Network topology is static/known"],"_meta":{"tier":1,"layer":"Society","category":"Protocols","related":["sema:RootHashGossip#mh:SHA-256:145cec2ca1c4d328da0256b0a245eadda7da63a6a77083405220c432d2210438"],"ring":0},"sema_id":"sema:LatticeCommit#mh:SHA-256:56ee9ccc63ee18c8800066de71f4727ed77b74fcdb37ed597e2a7015a9f20521","sema_ref":"LatticeCommit#56ee","sema_stub":"56ee","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"cb5e97ae-d81e-4c39-ac0b-c09cb34d4321","text":"Local {{quorum}}: Commit requires signatures from defined Geometric Neighbors","type":"INVARIANT","layer":null,"category":null,"handle":"Local {{quorum}}: Commit requires signatures from defined Geometric Neighbors","gloss":null,"stub":null,"metadata":{}},{"id":"16078c86-7dfe-4f69-960e-4e971924f4a8","text":"Progress must be monotonic - no backtracking.","type":"INVARIANT","layer":null,"category":null,"handle":"Progress must be monotonic - no backtracking.","gloss":null,"stub":null,"metadata":{}},{"id":"9fe72c4b-2e44-4bbe-98b9-8a45761744d5","text":"{{topology}} {{check}}: Node degree must match Lattice definition (e.g. 4 for 2D grid)","type":"INVARIANT","layer":null,"category":null,"handle":"{{topology}} {{check}}: Node degree must match Lattice definition (e.g. 4 for 2D grid)","gloss":null,"stub":null,"metadata":{}},{"id":"c6c11049-bd82-47aa-b1dc-9400dfdc1bce","text":"Network topology is static/known","type":"PRECONDITION","layer":null,"category":null,"handle":"Network topology is static/known","gloss":null,"stub":null,"metadata":{}},{"id":"StateAudit","text":"StateAudit#ce13","type":"PATTERN","layer":"Physics","category":"Time","handle":"StateAudit#ce13","gloss":"Verifying system state after an operation","stub":"ce13","metadata":{"pattern":{"handle":"StateAudit","mechanism":"A safety pattern where an agent performs an explicit {{audit}} of the {{state}} immediately after a write to ensure the {{state_transition}} occurred as expected. Catches silent API failures.","gloss":"Verifying system state after an operation","sema_id":"sema:StateAudit#mh:SHA-256:ce13ca0864f9b2658c7101e34eb86670079a96eba47499450f5b6105ba54925e","sema_ref":"StateAudit#ce13","sema_stub":"ce13","_meta":{"layer":"Physics","category":"Time","ring":0,"tier":1},"sema_layer":"Physics","sema_category":"Time","signature":["Audit(State)"]},"layer":"Physics","category":"Time"}},{"id":"EpistemicCalibrate","text":"EpistemicCalibrate#6069","type":"PATTERN","layer":"Mind","category":"Inference","handle":"EpistemicCalibrate#6069","gloss":"Structural confidence degradation","stub":"6069","metadata":{"pattern":{"handle":"EpistemicCalibrate","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).","gloss":"Structural confidence degradation","failure_modes":["Paralysis (confidence drops to zero too fast)."],"invariants":["Horizon {{decay}}: Confidence(T+1) < Confidence(T)","Unknown Unknowns: A reserved probability mass for 'Unmodeled Event'"],"preconditions":["Base prediction available"],"postconditions":["Confidence score adjusted downward"],"_meta":{"tier":1,"layer":"Mind","category":"Inference","related":["sema:ConfidenceCalibrate#mh:SHA-256:5cf79b805014b4108d7d00bdf0fb6cd7ea9f3da94535d4dbe33c8c278c5cb7b5"],"ring":2},"sema_id":"sema:EpistemicCalibrate#mh:SHA-256:606941a7d67ed0f304f44966e00550480d1ff04f64c8196cf6fe15185a9ef437","sema_ref":"EpistemicCalibrate#6069","sema_stub":"6069","sema_layer":"Mind","sema_category":"Inference"},"layer":"Mind","category":"Inference"}},{"id":"c01d324d-7bba-4069-bf35-898b66eb1857","text":"Horizon {{decay}}: Confidence(T+1) < Confidence(T)","type":"INVARIANT","layer":null,"category":null,"handle":"Horizon {{decay}}: Confidence(T+1) < Confidence(T)","gloss":null,"stub":null,"metadata":{}},{"id":"378f547c-e843-4350-b6be-5ddc475f84b0","text":"Unknown Unknowns: A reserved probability mass for 'Unmodeled Event'","type":"INVARIANT","layer":null,"category":null,"handle":"Unknown Unknowns: A reserved probability mass for 'Unmodeled Event'","gloss":null,"stub":null,"metadata":{}},{"id":"45261894-258b-4084-bd9f-4d7f3994be11","text":"Base prediction available","type":"PRECONDITION","layer":null,"category":null,"handle":"Base prediction available","gloss":null,"stub":null,"metadata":{}},{"id":"832426d4-1bd2-4575-8ed8-9ab55f9bcdee","text":"Confidence score adjusted downward","type":"POSTCONDITION","layer":null,"category":null,"handle":"Confidence score adjusted downward","gloss":null,"stub":null,"metadata":{}},{"id":"ExpiringToken","text":"ExpiringToken#4e3c","type":"PATTERN","layer":"Society","category":"Protocols","handle":"ExpiringToken#4e3c","gloss":"Time-decaying privileges","stub":"4e3c","metadata":{"pattern":{"handle":"ExpiringToken","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 {{bearer_token}} by embedding an immutable expiration timestamp within the signed payload.","gloss":"Time-decaying privileges","failure_modes":["Clock synchronization issues."],"invariants":["Expired tokens cannot be revived.","Monotonic {{decay}}: Capabilities cannot increase over time","Time-Bound: Token is invalid if CurrentTime > ExpiryTime"],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":0},"sema_id":"sema:ExpiringToken#mh:SHA-256:4e3cc3cee0de56a4eef0676629811cb4afa3383bc80bde227924d66a6af16f6e","sema_ref":"ExpiringToken#4e3c","sema_stub":"4e3c","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"394a8441-31b2-4b46-a97c-d5ea13e9f302","text":"Expired tokens cannot be revived.","type":"INVARIANT","layer":null,"category":null,"handle":"Expired tokens cannot be revived.","gloss":null,"stub":null,"metadata":{}},{"id":"95462a1e-c082-4248-9b90-a664b4650fdd","text":"Monotonic {{decay}}: Capabilities cannot increase over time","type":"INVARIANT","layer":null,"category":null,"handle":"Monotonic {{decay}}: Capabilities cannot increase over time","gloss":null,"stub":null,"metadata":{}},{"id":"2bd66f5b-cfa6-4f21-8685-56474972465e","text":"Time-Bound: Token is invalid if CurrentTime > ExpiryTime","type":"INVARIANT","layer":null,"category":null,"handle":"Time-Bound: Token is invalid if CurrentTime > ExpiryTime","gloss":null,"stub":null,"metadata":{}},{"id":"GlacialVault","text":"GlacialVault#f521","type":"PATTERN","layer":"Society","category":"Protocols","handle":"GlacialVault#f521","gloss":"Time-locked storage","stub":"f521","metadata":{"pattern":{"handle":"GlacialVault","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}} function into the encryption scheme, ensuring decryption is computationally impossible before the delay period.","gloss":"Time-locked storage","failure_modes":["Hardware speedups reduce the delay."],"invariants":["Delay time immutable."],"_meta":{"tier":2,"layer":"Society","category":"Protocols","ring":0},"sema_id":"sema:GlacialVault#mh:SHA-256:f521c96b7e3037f39724b9a723f707ec195074f3099f6b0db122271de96d5677","sema_ref":"GlacialVault#f521","sema_stub":"f521","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"204bc3d8-ca1a-4c9d-b545-7119fc96074f","text":"Delay time immutable.","type":"INVARIANT","layer":null,"category":null,"handle":"Delay time immutable.","gloss":null,"stub":null,"metadata":{}},{"id":"Trace","text":"Trace#9057","type":"PATTERN","layer":"Infrastructure","category":"Primitives","handle":"Trace#9057","gloss":"Record the lineage or provenance of a target","stub":"9057","metadata":{"pattern":{"handle":"Trace","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.","gloss":"Record the lineage or provenance of a target","failure_modes":["Trace pollution (too many traces, signal lost in noise).","{{decay}} mismatch (too fast = lost, too slow = stale).","Namespace collision (unrelated actors confuse each other).","No accountability (cannot attribute trace to actor).","Semantic ambiguity (actors interpret same trace differently).","Feedback loops (reinforce bad traces, converge to local minimum)."],"invariants":["Causality: Events must be logged in monotonic order.","Immutability: History cannot be rewritten, only appended to."],"_meta":{"tier":1,"layer":"Infrastructure","category":"Primitives","ring":0},"sema_id":"sema:Trace#mh:SHA-256:90570af650f6362c2a0d7e94b23ed3cfe2c7406f3bd22352dc73582bfdbb3c3d","sema_ref":"Trace#9057","sema_stub":"9057","sema_layer":"Infrastructure","sema_category":"Primitives"},"layer":"Infrastructure","category":"Primitives"}},{"id":"bc8404bd-8389-46f3-b3b1-1276aa9b8e13","text":"Causality: Events must be logged in monotonic order.","type":"INVARIANT","layer":null,"category":null,"handle":"Causality: Events must be logged in monotonic order.","gloss":null,"stub":null,"metadata":{}},{"id":"4e187aff-c78c-4921-aa99-5b76ebf13068","text":"Immutability: History cannot be rewritten, only appended to.","type":"INVARIANT","layer":null,"category":null,"handle":"Immutability: History cannot be rewritten, only appended to.","gloss":null,"stub":null,"metadata":{}},{"id":"RegretMinimization","text":"RegretMinimization#4a57","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"RegretMinimization#4a57","gloss":"Safety-first decision making based on loss avoidance","stub":"4a57","metadata":{"pattern":{"handle":"RegretMinimization","mechanism":"{{decision}}-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 {{opportunity_cost}} into the loss function, selecting the path with the least damaging worst-case scenario.","gloss":"Safety-first decision making based on loss avoidance","invariants":["Pessimism: Assume worst-case outcome for each branch","Safety Floor: Never choose option with catastrophic worst-case"],"_meta":{"tier":3,"layer":"Mind","category":"Strategy","related":["sema:PreMortem#mh:SHA-256:6ef6ac14740e5ba8e300b71892dc48d4c2f493ed00139aee45d327bce195dd2d"],"ring":2},"sema_id":"sema:RegretMinimization#mh:SHA-256:4a570e1a52413390bf1d3773f73317af065ce06c807764ab0d1958aa77f1260a","sema_ref":"RegretMinimization#4a57","sema_stub":"4a57","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"a6ccd0a0-ced3-4b75-92fc-ce0001495b62","text":"Pessimism: Assume worst-case outcome for each branch","type":"INVARIANT","layer":null,"category":null,"handle":"Pessimism: Assume worst-case outcome for each branch","gloss":null,"stub":null,"metadata":{}},{"id":"c69aad07-1a8d-4004-9fa3-f760ac44f8a0","text":"Safety Floor: Never choose option with catastrophic worst-case","type":"INVARIANT","layer":null,"category":null,"handle":"Safety Floor: Never choose option with catastrophic worst-case","gloss":null,"stub":null,"metadata":{}},{"id":"Actor","text":"Actor#6926","type":"PATTERN","layer":"Infrastructure","category":"Primitives","handle":"Actor#6926","gloss":"A capability-bearing entity","stub":"6926","metadata":{"pattern":{"handle":"Actor","mechanism":"A primitive entity capable of executing an {{act}}. Unlike an agent (which possesses intent and reasoning), an Actor is a pure execution container defined by its {{identity}}, {{nature}}, and capability set. It serves as the foundational subject for permissions and logging.","gloss":"A capability-bearing entity","_meta":{"layer":"Infrastructure","category":"Primitives","ring":0,"tier":0},"data_schema":{"type":"object","required":["agent_id","public_key","status"],"properties":{"agent_id":{"type":"string","description":"Unique handle"},"public_key":{"type":"string","description":"Cryptographic identity for signing"},"role":{"type":"string","description":"Current active role/persona"},"status":{"type":"string","enum":["Idle","Busy","Offline","Error"],"description":"Availability state"},"capabilities":{"type":"array","items":{"type":"string"},"description":"List of supported tool/protocol hashes"},"endpoint":{"type":"string","description":"Communication address"}}},"sema_ref":"Actor#6926","sema_id":"sema:Actor#mh:SHA-256:69261bc3b260a9235b8d5fbef8b0c53c9773e60ed6d4df04babfffffd2897a89","sema_stub":"6926","sema_layer":"Infrastructure","sema_category":"Primitives"},"layer":"Infrastructure","category":"Primitives"}},{"id":"Proposal","text":"Proposal#4840","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Proposal#4840","gloss":"A suggested course of action","stub":"4840","metadata":{"pattern":{"handle":"Proposal","data_schema":{"type":"object","required":["proposal_id","action","justification"],"properties":{"proposal_id":{"type":"string","description":"Unique identifier"},"action":{"type":"string","description":"The proposed action or transition"},"justification":{"type":"string","description":"Why this action should be taken"},"proposer_id":{"type":"string","description":"Who submitted the proposal"}}},"mechanism":"A formal {{message}} suggesting a specific {{act}} or {{transition}}. It serves as the input payload for decision-making processes, encapsulating the 'What' and 'Why' of a requested change.","gloss":"A suggested course of action","invariants":["Clarity: The proposed action must be unambiguous."],"_meta":{"layer":"Infrastructure","category":"Data Structures","ring":1,"tier":1},"sema_ref":"Proposal#4840","sema_id":"sema:Proposal#mh:SHA-256:48400f03d012e37914685f66064ccd4c3875efb0bb4dff24d88c8f1ca9aa247d","sema_stub":"4840","sema_layer":"Infrastructure","sema_category":"Data Structures"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"d13ddda9-8b8c-4ee8-bc56-95196d9ec488","text":"Clarity: The proposed action must be unambiguous.","type":"INVARIANT","layer":null,"category":null,"handle":"Clarity: The proposed action must be unambiguous.","gloss":null,"stub":null,"metadata":{}},{"id":"Refine","text":"Refine#38d9","type":"PATTERN","layer":"Mind","category":"Reasoning","handle":"Refine#38d9","gloss":"Iterative improvement loop","stub":"38d9","metadata":{"pattern":{"handle":"Refine","mechanism":"Iteratively improves an {{artifact}} by applying {{critique}} to identify {{incongruity}}s and then performing {{act}}s of editing to resolve them. It cycles until the artifact meets a specific {{condition}} or quality threshold.","gloss":"Iterative improvement loop","_meta":{"layer":"Mind","category":"Reasoning","ring":1,"tier":1,"related":["PhasedRefinement"]},"sema_id":"sema:Refine#mh:SHA-256:38d97579c85cbeb7c482df7f4ae6266cd92e70b0174057eeb6530570009f139d","sema_ref":"Refine#38d9","sema_stub":"38d9","sema_layer":"Mind","sema_category":"Reasoning"},"layer":"Mind","category":"Reasoning"}},{"id":"Sign","text":"Sign#1fb9","type":"PATTERN","layer":"Physics","category":"Primitives","handle":"Sign#1fb9","gloss":"Attest to authorship or agreement","stub":"1fb9","metadata":{"pattern":{"handle":"Sign","mechanism":"The {{act}} of attaching a verifiable {{identity}} proof to an {{artifact}}, asserting authorship, approval, or agreement. Unlike a raw {{signal}}, a Sign action creates a non-repudiable link between the entity and the data. Used to validate contracts or authorize actions.","gloss":"Attest to authorship or agreement","invariants":["Non-Repudiation: The signer cannot later deny having signed it.","Integrity: The signature invalidates if the artifact changes."],"_meta":{"tier":1,"layer":"Physics","category":"Primitives","ring":1},"signature":["Act(Identity)"],"sema_id":"sema:Sign#mh:SHA-256:1fb991fd538b93a9e2566b3f2a4c69f67a6b101d0577d911f50a4e194c1dc6ba","sema_ref":"Sign#1fb9","sema_stub":"1fb9","sema_layer":"Physics","sema_category":"Primitives"},"layer":"Physics","category":"Primitives"}},{"id":"b59eade1-1965-4ccf-a3c3-925108574826","text":"Non-Repudiation: The signer cannot later deny having signed it.","type":"INVARIANT","layer":null,"category":null,"handle":"Non-Repudiation: The signer cannot later deny having signed it.","gloss":null,"stub":null,"metadata":{}},{"id":"cf7a1f59-ace5-4ce9-8181-f47734c65441","text":"Integrity: The signature invalidates if the artifact changes.","type":"INVARIANT","layer":null,"category":null,"handle":"Integrity: The signature invalidates if the artifact changes.","gloss":null,"stub":null,"metadata":{}},{"id":"Subject","text":"Subject#788f","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Subject#788f","gloss":"The target of an operation","stub":"788f","metadata":{"pattern":{"handle":"Subject","data_schema":{"type":"object","required":["subject_id","entity_type"],"properties":{"subject_id":{"type":"string","description":"Unique identifier for the subject"},"entity_type":{"type":"string","description":"What kind of entity (agent, artifact, system)"},"reference":{"type":"string","description":"Pointer to the actual entity"}}},"mechanism":"The target entity of an observation, evaluation, or {{act}}. It represents the 'Who' or 'What' in a subject-object relationship.","gloss":"The target of an operation","_meta":{"layer":"Infrastructure","category":"Data Structures","ring":1,"tier":1},"sema_ref":"Subject#788f","sema_id":"sema:Subject#mh:SHA-256:788f7cb48e982144f15691fa0259a8b4f620e6eaf4447129c95f23d8e3008d1e","sema_stub":"788f","sema_layer":"Infrastructure","sema_category":"Data Structures"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"Falsification","text":"Falsification#3e36","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"Falsification#3e36","gloss":"Proof of falsehood","stub":"3e36","metadata":{"pattern":{"handle":"Falsification","mechanism":"The logical act of proving a {{hypothesis}} false by {{observe}}ing an {{incongruity}} between prediction and observation. It creates specific knowledge by eliminating possibilities.","gloss":"Proof of falsehood","invariants":["Logical Negation: If Prediction implies Observation, and not-Observation, then not-Hypothesis.","Empirical Grounding: Requires observational evidence."],"_meta":{"layer":"Mind","category":"Strategy","ring":1,"tier":1,"related":["HypothesisLadder#f88b"]},"sema_id":"sema:Falsification#mh:SHA-256:3e368a58febe7fc02de81df5c2f1ae163c7bfe543200cb2dcbeb7cde50609929","sema_ref":"Falsification#3e36","sema_stub":"3e36","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"d7867031-cb26-4a73-890e-702a0d1808b5","text":"Logical Negation: If Prediction implies Observation, and not-Observation, then not-Hypothesis.","type":"INVARIANT","layer":null,"category":null,"handle":"Logical Negation: If Prediction implies Observation, and not-Observation, then not-Hypothesis.","gloss":null,"stub":null,"metadata":{}},{"id":"ec151772-48e9-458b-a76e-c8dee98f326e","text":"Empirical Grounding: Requires observational evidence.","type":"INVARIANT","layer":null,"category":null,"handle":"Empirical Grounding: Requires observational evidence.","gloss":null,"stub":null,"metadata":{}},{"id":"ComputeBudget","text":"ComputeBudget#3b98","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"ComputeBudget#3b98","gloss":"Economic governor for cognitive spend","stub":"3b98","metadata":{"pattern":{"handle":"ComputeBudget","mechanism":"The cognitive governor that prevents analysis paralysis. It acts as a dual-ledger {{gate}}, weighing the {{value}} of a {{task}} against the {{budget}} to ensure return on investment (ROI). It enforces stopping rules when the cost of thinking exceeds the value of the solution.","gloss":"Economic governor for cognitive spend","failure_modes":["Analysis Paralysis: Spending more on estimation than the task is worth.","Penny Wise: Rejecting necessary deep thinking for high-stakes/high-complexity problems.","Cost estimation is itself costly (meta-cost problem).","Uncertainty about uncertainty makes expected_gain hard to calculate.","Risk of penny-wise pound-foolish: refusing decomposition on hard problems because estimate was wrong."],"invariants":["Hard Ceiling: Total execution cost cannot exceed max_budget.","Meta-Cap: Estimation phase must consume < 1% of total budget."],"preconditions":["Current resource balance available","{{task}} value estimated"],"postconditions":["Budget constraints injected into {{task}} context","Execution strategy Selected (Direct vs Recursive)"],"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"}],"_meta":{"tier":1,"layer":"Mind","category":"Strategy","ring":0,"related":["OptimalStop","Satisfice","TimeboxThink"]},"sema_ref":"ComputeBudget#3b98","sema_id":"sema:ComputeBudget#mh:SHA-256:3b9875661465a1a0cdc12e60774114d0ac69510b4fae677c81c47ea3a84b99b1","sema_stub":"3b98","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"aaea614d-5541-4bbe-a91a-4869cb5aab33","text":"Hard Ceiling: Total execution cost cannot exceed max_budget.","type":"INVARIANT","layer":null,"category":null,"handle":"Hard Ceiling: Total execution cost cannot exceed max_budget.","gloss":null,"stub":null,"metadata":{}},{"id":"958ed552-bd7a-4ffa-adf8-4d74138f0470","text":"Meta-Cap: Estimation phase must consume < 1% of total budget.","type":"INVARIANT","layer":null,"category":null,"handle":"Meta-Cap: Estimation phase must consume < 1% of total budget.","gloss":null,"stub":null,"metadata":{}},{"id":"a72d2797-f5ae-437b-8b70-458b9c4228f1","text":"Current resource balance available","type":"PRECONDITION","layer":null,"category":null,"handle":"Current resource balance available","gloss":null,"stub":null,"metadata":{}},{"id":"c71f2a8d-473d-4313-9a74-921125eff1cf","text":"{{task}} value estimated","type":"PRECONDITION","layer":null,"category":null,"handle":"{{task}} value estimated","gloss":null,"stub":null,"metadata":{}},{"id":"3bfe4329-fbeb-43ed-bca9-3ebe55af50c4","text":"Budget constraints injected into {{task}} context","type":"POSTCONDITION","layer":null,"category":null,"handle":"Budget constraints injected into {{task}} context","gloss":null,"stub":null,"metadata":{}},{"id":"9d8fbea3-efb5-4f46-b92d-39b72c437401","text":"Execution strategy Selected (Direct vs Recursive)","type":"POSTCONDITION","layer":null,"category":null,"handle":"Execution strategy Selected (Direct vs Recursive)","gloss":null,"stub":null,"metadata":{}},{"id":"ExtendedThinking","text":"ExtendedThinking#ca3c","type":"PATTERN","layer":"Mind","category":"Reasoning","handle":"ExtendedThinking#ca3c","gloss":"Scale inference compute via extended reasoning","stub":"ca3c","metadata":{"pattern":{"handle":"ExtendedThinking","mechanism":"Inference-time compute scaling where the model generates extended reasoning traces (potentially thousands of tokens) before producing a final answer. Unlike standard {{chain}}-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}} complexity.","gloss":"Scale inference compute via extended reasoning","failure_modes":["Confabulation Chains: Long reasoning traces that sound plausible but contain errors.","Overthinking: Spending compute on simple problems that don't benefit.","Hidden Reasoning: Model reaches conclusions via paths not shown in the trace."],"invariants":["Intermediate steps visible/logged","Thinking time proportional to problem difficulty"],"preconditions":["Complex prompt","High token budget"],"postconditions":["High-accuracy answer"],"_meta":{"tier":1,"layer":"Mind","category":"Reasoning","ring":2},"sema_layer":"Mind","sema_category":"Reasoning","sema_id":"sema:ExtendedThinking#mh:SHA-256:ca3c54e46218935876ca5c993974742069fe61871fae7af38a2fef745753dc98","sema_ref":"ExtendedThinking#ca3c","sema_stub":"ca3c"},"layer":"Mind","category":"Reasoning"}},{"id":"1298ab08-5649-4dcf-ba4d-f20514edf047","text":"Intermediate steps visible/logged","type":"INVARIANT","layer":null,"category":null,"handle":"Intermediate steps visible/logged","gloss":null,"stub":null,"metadata":{}},{"id":"911ff119-6358-4a7e-a7fe-9a27ca11e9a0","text":"Thinking time proportional to problem difficulty","type":"INVARIANT","layer":null,"category":null,"handle":"Thinking time proportional to problem difficulty","gloss":null,"stub":null,"metadata":{}},{"id":"f7806969-4e41-4833-b787-da7e62b87483","text":"Complex prompt","type":"PRECONDITION","layer":null,"category":null,"handle":"Complex prompt","gloss":null,"stub":null,"metadata":{}},{"id":"98b10046-d4fe-4d8c-aadf-a9e35686416e","text":"High token budget","type":"PRECONDITION","layer":null,"category":null,"handle":"High token budget","gloss":null,"stub":null,"metadata":{}},{"id":"5880c4d9-a71e-4823-9345-2e3e79e56bf4","text":"High-accuracy answer","type":"POSTCONDITION","layer":null,"category":null,"handle":"High-accuracy answer","gloss":null,"stub":null,"metadata":{}},{"id":"HumanApprove","text":"HumanApprove#e64a","type":"PATTERN","layer":"Infrastructure","category":"Verification","handle":"HumanApprove#e64a","gloss":"Pause for human approval before critical actions","stub":"e64a","metadata":{"pattern":{"handle":"HumanApprove","mechanism":"A checkpoint gate where execution pauses and awaits explicit human approval before proceeding. The agent presents its proposed {{task}}, 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).","gloss":"Pause for human approval before critical actions","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"}],"failure_modes":["Approval Fatigue: Humans rubber-stamp requests without review due to high volume.","Blocking: {{system}} halts indefinitely if human is unavailable.","{{context}} Loss: Human lacks sufficient context to make informed decision."],"invariants":["Cognitive Friction: Approval requires matching a context-specific challenge code.","{{audit}} 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"],"_meta":{"tier":2,"layer":"Infrastructure","category":"Verification","ring":1},"sema_layer":"Infrastructure","sema_category":"Verification","sema_id":"sema:HumanApprove#mh:SHA-256:e64a6a1fc261b726fbfdcae8b5d3a3da39e3ea2e8f2d168e1a4135985e36d7ea","sema_ref":"HumanApprove#e64a","sema_stub":"e64a"},"layer":"Infrastructure","category":"Verification"}},{"id":"75bb86ec-c6e5-4aa4-b10b-b13f1bb58635","text":"Cognitive Friction: Approval requires matching a context-specific challenge code.","type":"INVARIANT","layer":null,"category":null,"handle":"Cognitive Friction: Approval requires matching a context-specific challenge code.","gloss":null,"stub":null,"metadata":{}},{"id":"68b63c7c-429b-484d-a49d-496757d444d8","text":"{{audit}} Trail: All approvals/rejections logged with timestamp and rationale","type":"INVARIANT","layer":null,"category":null,"handle":"{{audit}} Trail: All approvals/rejections logged with timestamp and rationale","gloss":null,"stub":null,"metadata":{}},{"id":"45fa71bd-2612-4fb6-a97b-c69b89e34399","text":"Blocking: Execution MUST halt until approval received","type":"INVARIANT","layer":null,"category":null,"handle":"Blocking: Execution MUST halt until approval received","gloss":null,"stub":null,"metadata":{}},{"id":"9ac278e9-55f7-4f15-9081-83413546d7c9","text":"Timeout Policy: Define behavior if approval not received within SLA","type":"INVARIANT","layer":null,"category":null,"handle":"Timeout Policy: Define behavior if approval not received within SLA","gloss":null,"stub":null,"metadata":{}},{"id":"Mutex","text":"Mutex#9c83","type":"PATTERN","layer":"Physics","category":"Primitives","handle":"Mutex#9c83","gloss":"Physical possession token","stub":"9c83","metadata":{"pattern":{"handle":"Mutex","mechanism":"Exclusive access token. Lifecycle: ACQUIRE {{task}} -> GRANT/QUEUE -> HOLD -> RELEASE/YIELD. Token represents a unique handle ({{resource}}). 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.","gloss":"Physical possession token","failure_modes":["Totem loss (requires regeneration protocol).","Failure modes: (1) Holder crash - token orphaned, mitigated by expires_at + heartbeat.","(2) Token corruption - mitigated by REGENERATE protocol.","(3) Deadlock - mitigated by wait-for graph detection + ordered acquisition.","(4) Starvation - mitigated by aging + anti-starvation rule (no consecutive preemption).","(5) Byzantine holder - mitigated by forcible REVOKE + fencing.","(6) Split brain - mitigated by fencing tokens that invalidate on revocation."],"invariants":["Uniqueness, Conservation of Totem"],"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}} state consistent across all observers."],"_meta":{"tier":2,"layer":"Physics","category":"Primitives","ring":0},"sema_layer":"Physics","sema_category":"Primitives","sema_id":"sema:Mutex#mh:SHA-256:9c8399aaa6fe3528358fb93e826aced3b1e3e3f31ef58e68c4720ce640a0a2b5","sema_ref":"Mutex#9c83","sema_stub":"9c83"},"layer":"Physics","category":"Primitives"}},{"id":"7c1cbc8a-f6c3-4e59-9224-74fce8c70428","text":"Uniqueness, Conservation of Totem","type":"INVARIANT","layer":null,"category":null,"handle":"Uniqueness, Conservation of Totem","gloss":null,"stub":null,"metadata":{}},{"id":"4fa5c0f2-faf2-4f45-b304-24ca30b5a7c4","text":"Resource exists and is lockable. At least 2 agents contending. Agents can communicate.","type":"PRECONDITION","layer":null,"category":null,"handle":"Resource exists and is lockable. At least 2 agents contending. Agents can communicate.","gloss":null,"stub":null,"metadata":{}},{"id":"655d6beb-2f96-46cd-8926-c60a90836811","text":"Exactly one agent holds lock. Other agents blocked or notified. {{lock}} state consistent across all observers.","type":"POSTCONDITION","layer":null,"category":null,"handle":"Exactly one agent holds lock. Other agents blocked or notified. {{lock}} state consistent across all observers.","gloss":null,"stub":null,"metadata":{}},{"id":"Noise","text":"Noise#c4b4","type":"PATTERN","layer":"Physics","category":"Primitives","handle":"Noise#c4b4","gloss":"Irrelevant information","stub":"c4b4","metadata":{"pattern":{"handle":"Noise","mechanism":"Information that is irrelevant or meaningless to the current {{task}}. It obscures the {{datum}} and increases the cognitive load required to extract {{signal}}.","gloss":"Irrelevant information","_meta":{"layer":"Physics","category":"Primitives","ring":1,"tier":1},"sema_layer":"Physics","sema_category":"Primitives","sema_id":"sema:Noise#mh:SHA-256:c4b4012e79ca2e0c9e131cd4c82a8aaee8b99defed361622e04b47e94474565d","sema_ref":"Noise#c4b4","sema_stub":"c4b4"},"layer":"Physics","category":"Primitives"}},{"id":"Problem","text":"Problem#5baa","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Problem#5baa","gloss":"A state gap with a cost of inaction","stub":"5baa","metadata":{"pattern":{"handle":"Problem","mechanism":"A formal representation of a gap between Current {{state}} and Desired {{state}} where the Cost of Inaction > 0. Unlike a {{task}} (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.","gloss":"A state gap with a cost of inaction","_meta":{"tier":1,"layer":"Infrastructure","category":"Data Structures","ring":1},"data_schema":{"type":"object","required":["current_state","desired_state"],"properties":{"current_state":{"type":"string","description":"Description of reality"},"desired_state":{"type":"string","description":"Description of goal"},"gap_analysis":{"type":"string","description":"Why the current != desired"},"severity":{"type":"string","enum":["Low","Medium","High","Existential"]},"root_cause_hypothesis":{"type":"string"}}},"sema_id":"sema:Problem#mh:SHA-256:5baa4b94e48686c15413bc92447c72917fb2f77109436b4a57aae6ee982fd311","sema_ref":"Problem#5baa","sema_stub":"5baa","sema_layer":"Infrastructure","sema_category":"Data Structures"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"ProgramOfThought","text":"ProgramOfThought#7191","type":"PATTERN","layer":"Mind","category":"Reasoning","handle":"ProgramOfThought#7191","gloss":"Generate code for computation, separate from reasoning","stub":"7191","metadata":{"pattern":{"handle":"ProgramOfThought","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}}s.","gloss":"Generate code for computation, separate from reasoning","failure_modes":["Code Errors: Generated code has bugs or doesn't execute.","Reasoning-Code Mismatch: Code doesn't implement intended logic.","Over-Engineering: Simple calculations wrapped in unnecessary code."],"invariants":["Logic is deterministic","Reasoning expressed as executable code"],"preconditions":["Algorithmic problem"],"postconditions":["Correct answer derived via execution"],"_meta":{"tier":1,"layer":"Mind","category":"Reasoning","ring":2},"sema_layer":"Mind","sema_category":"Reasoning","sema_id":"sema:ProgramOfThought#mh:SHA-256:719143cebb0bae7f29191c8a201fad4e365ef1d077e1ef671b15e74f15e3cc59","sema_ref":"ProgramOfThought#7191","sema_stub":"7191"},"layer":"Mind","category":"Reasoning"}},{"id":"4b3548c1-5bbb-49bc-8171-51618d6ab03c","text":"Logic is deterministic","type":"INVARIANT","layer":null,"category":null,"handle":"Logic is deterministic","gloss":null,"stub":null,"metadata":{}},{"id":"d3485af8-a67d-419d-9598-867ad73b727d","text":"Reasoning expressed as executable code","type":"INVARIANT","layer":null,"category":null,"handle":"Reasoning expressed as executable code","gloss":null,"stub":null,"metadata":{}},{"id":"d9037161-097a-480f-ada1-4e3813fe15a6","text":"Algorithmic problem","type":"PRECONDITION","layer":null,"category":null,"handle":"Algorithmic problem","gloss":null,"stub":null,"metadata":{}},{"id":"56e2c28b-01c6-416f-bdd0-9f4c305bd09a","text":"Correct answer derived via execution","type":"POSTCONDITION","layer":null,"category":null,"handle":"Correct answer derived via execution","gloss":null,"stub":null,"metadata":{}},{"id":"Queue","text":"Queue#2ec3","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Queue#2ec3","gloss":"Ordered task buffer","stub":"2ec3","metadata":{"pattern":{"handle":"Queue","mechanism":"A linear data structure for ordering {{task}}s or {{message}}s. It enforces First-In-First-Out (FIFO) or Priority ordering.","gloss":"Ordered task buffer","sema_id":"sema:Queue#mh:SHA-256:2ec3531a8c5711e281ab2913646d9f46dad05140fea7ceb6966bfa62d745bc9b","sema_ref":"Queue#2ec3","sema_stub":"2ec3","_meta":{"layer":"Infrastructure","category":"Data Structures","ring":0,"tier":1},"sema_layer":"Infrastructure","sema_category":"Data Structures","data_schema":{"type":"object","required":["queue_id","items","policy"],"properties":{"queue_id":{"type":"string"},"items":{"type":"array","items":{"type":"object","description":"Enqueued Task or Message objects"}},"policy":{"type":"string","enum":["FIFO","LIFO","Priority"],"default":"FIFO"},"capacity":{"type":"integer"},"metrics":{"type":"object","properties":{"depth":{"type":"integer"},"average_wait_time":{"type":"number"}}}}}},"layer":"Infrastructure","category":"Data Structures"}},{"id":"Route","text":"Route#6273","type":"PATTERN","layer":"Physics","category":"Primitives","handle":"Route#6273","gloss":"Classify input and direct to specialized handler","stub":"6273","metadata":{"pattern":{"handle":"Route","mechanism":"A classifier that examines a {{task}} 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).","gloss":"Classify input and direct to specialized handler","failure_modes":["Misrouting: Input sent to wrong specialist, causing errors.","Ambiguous Classification: Input matches multiple routes or none.","Routing Bottleneck: Classifier becomes slower than just handling directly."],"invariants":["Input directed to best-fit handler","No dropped requests"],"preconditions":["Input query","Router logic/embeddings"],"postconditions":["Query dispatched"],"_meta":{"tier":1,"layer":"Physics","category":"Primitives","related":["sema:Select#mh:SHA-256:b37174cf130148f0e486f85d892b6fd42d27a35d8493ff826602c0bbdc2fbde5"],"ring":0},"sema_layer":"Physics","sema_category":"Primitives","sema_id":"sema:Route#mh:SHA-256:627330c3657b0c1829a6841757736f62c16a41a7309e3c317aa933893d6a23ec","sema_ref":"Route#6273","sema_stub":"6273"},"layer":"Physics","category":"Primitives"}},{"id":"6a45c8af-289b-4d65-a162-f120f1fab327","text":"Input directed to best-fit handler","type":"INVARIANT","layer":null,"category":null,"handle":"Input directed to best-fit handler","gloss":null,"stub":null,"metadata":{}},{"id":"25a3355e-c6d0-4c81-8441-1d574f2445e9","text":"No dropped requests","type":"INVARIANT","layer":null,"category":null,"handle":"No dropped requests","gloss":null,"stub":null,"metadata":{}},{"id":"c6248bd1-fa66-4aa2-b172-2d1d1cefb7e9","text":"Input query","type":"PRECONDITION","layer":null,"category":null,"handle":"Input query","gloss":null,"stub":null,"metadata":{}},{"id":"7001b518-6478-4734-966b-cfdc7c4a2118","text":"Router logic/embeddings","type":"PRECONDITION","layer":null,"category":null,"handle":"Router logic/embeddings","gloss":null,"stub":null,"metadata":{}},{"id":"f7a6ee03-0faa-413b-9a0f-f8eee233bc0e","text":"Query dispatched","type":"POSTCONDITION","layer":null,"category":null,"handle":"Query dispatched","gloss":null,"stub":null,"metadata":{}},{"id":"SomaticMarker","text":"SomaticMarker#84e4","type":"PATTERN","layer":"Society","category":"Protocols","handle":"SomaticMarker#84e4","gloss":"System health acting as an inhibitory emotion","stub":"84e4","metadata":{"pattern":{"handle":"SomaticMarker","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}}.","gloss":"System health acting as an inhibitory emotion","invariants":["Inhibition {{correlation}}: Action probability inversely proportional to stress","Inhibition: High Stress Score MUST reduce Action Probability","{{signal}} Freshness: Marker reflects current state, not historical average"],"_meta":{"tier":1,"layer":"Society","category":"Protocols","related":["sema:Proprioception#mh:SHA-256:7077e82ffba5764e9f936de5cb95b3e13cf121c79c403ec91eac8cab727ed6fd"],"ring":2},"sema_id":"sema:SomaticMarker#mh:SHA-256:84e40c489b6061eec580753f3fea907d8b401883679a3d54d274e23f742a1e62","sema_ref":"SomaticMarker#84e4","sema_stub":"84e4","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"b77708f3-bfb6-4e60-b946-a682ca2cb783","text":"Inhibition {{correlation}}: Action probability inversely proportional to stress","type":"INVARIANT","layer":null,"category":null,"handle":"Inhibition {{correlation}}: Action probability inversely proportional to stress","gloss":null,"stub":null,"metadata":{}},{"id":"6b12c7ad-b008-4899-82a5-05d840b1ff3c","text":"{{signal}} Freshness: Marker reflects current state, not historical average","type":"INVARIANT","layer":null,"category":null,"handle":"{{signal}} Freshness: Marker reflects current state, not historical average","gloss":null,"stub":null,"metadata":{}},{"id":"Throttle","text":"Throttle#3b43","type":"PATTERN","layer":"Physics","category":"Primitives","handle":"Throttle#3b43","gloss":"Rate-limiting to prevent resource exhaustion","stub":"3b43","metadata":{"pattern":{"handle":"Throttle","mechanism":"Rate Limiting: Maximum N {{task}}s 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}}.","gloss":"Rate-limiting to prevent resource exhaustion","failure_modes":["Legitimate Denial: Throttle cannot distinguish attack traffic from legitimate burst."],"invariants":["Queue Bounding: Dropped requests > 0 if InputRate >> MaxRate","Rate Limit: Output events per second <= MaxRate","Rate never exceeds limit within any window."],"preconditions":["Token bucket or Leaky bucket state initialized"],"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"}],"_meta":{"tier":1,"layer":"Physics","category":"Primitives","ring":0},"sema_layer":"Physics","sema_category":"Primitives","sema_id":"sema:Throttle#mh:SHA-256:3b435aa8eded864eadf7d8eec80d395fd7f4e6c2749d33880cbf8c4593f926af","sema_ref":"Throttle#3b43","sema_stub":"3b43"},"layer":"Physics","category":"Primitives"}},{"id":"ca20f93d-ceec-42a5-9ee1-025a9309aebc","text":"Queue Bounding: Dropped requests > 0 if InputRate >> MaxRate","type":"INVARIANT","layer":null,"category":null,"handle":"Queue Bounding: Dropped requests > 0 if InputRate >> MaxRate","gloss":null,"stub":null,"metadata":{}},{"id":"6470c082-2ecb-4ac6-a7a7-42efa2a67e45","text":"Rate Limit: Output events per second <= MaxRate","type":"INVARIANT","layer":null,"category":null,"handle":"Rate Limit: Output events per second <= MaxRate","gloss":null,"stub":null,"metadata":{}},{"id":"099b2986-186c-4ee4-9519-d49358236cab","text":"Rate never exceeds limit within any window.","type":"INVARIANT","layer":null,"category":null,"handle":"Rate never exceeds limit within any window.","gloss":null,"stub":null,"metadata":{}},{"id":"b651cae9-be0a-4f8d-ad59-d89dad2c3876","text":"Token bucket or Leaky bucket state initialized","type":"PRECONDITION","layer":null,"category":null,"handle":"Token bucket or Leaky bucket state initialized","gloss":null,"stub":null,"metadata":{}},{"id":"ToolInvoke","text":"ToolInvoke#cf0a","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"ToolInvoke#cf0a","gloss":"Execute external tool and observe result","stub":"cf0a","metadata":{"pattern":{"handle":"ToolInvoke","mechanism":"The actor emits a structured tool call (function name + arguments), validated by {{input_guard}}, execution is delegated to an external runtime, and the observation (result or error) is fed back into the actor's {{context}}. This is the atomic unit of agent-environment interaction. The pattern enables capabilities beyond text generation: code execution, API calls, file operations, web search.","gloss":"Execute external tool and observe result","failure_modes":["Hallucinated Tools: Actor invokes a tool that doesn't exist.","Argument Mismatch: Tool call has wrong parameter types or missing required fields.","Observation Blindness: Actor ignores or misinterprets tool output."],"invariants":["{{context}} Inheritance: Tool Execution {{context}} permissions MUST be <= {{task}} 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"],"_meta":{"tier":2,"layer":"Infrastructure","category":"Data Structures","ring":0,"related":["AgentSandbox"]},"data_schema":{"type":"object","required":["function_name","arguments"],"properties":{"function_name":{"type":"string","description":"Name of the tool to invoke"},"arguments":{"type":"object","description":"Parameters for the tool call"},"observation":{"description":"Result returned from tool execution"},"status":{"type":"string","enum":["pending","success","error"],"description":"Invocation status"}}},"sema_ref":"ToolInvoke#cf0a","sema_id":"sema:ToolInvoke#mh:SHA-256:cf0ae58828cde9f495b09af3e4519c3f05162066991d34d5f2505d13c32ba416","sema_stub":"cf0a","sema_layer":"Infrastructure","sema_category":"Data Structures"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"190fb119-9b5e-4d3f-97f7-5b1242e2544b","text":"{{context}} Inheritance: Tool Execution {{context}} permissions MUST be <= {{task}} Constraints. Elevation forbidden.","type":"INVARIANT","layer":null,"category":null,"handle":"{{context}} Inheritance: Tool Execution {{context}} permissions MUST be <= {{task}} Constraints. Elevation forbidden.","gloss":null,"stub":null,"metadata":{}},{"id":"c551a250-6d97-4d0f-be9a-09a13dafbb85","text":"Observation Integration: Result must be incorporated into subsequent reasoning","type":"INVARIANT","layer":null,"category":null,"handle":"Observation Integration: Result must be incorporated into subsequent reasoning","gloss":null,"stub":null,"metadata":{}},{"id":"3e4e375b-20ad-4ddb-bddb-80b371d00fca","text":"Sandboxing: Tool execution must respect capability boundaries","type":"INVARIANT","layer":null,"category":null,"handle":"Sandboxing: Tool execution must respect capability boundaries","gloss":null,"stub":null,"metadata":{}},{"id":"bf983ff4-1af3-4232-8b61-7008708e4347","text":"Schema Conformance: Tool call must match declared function signature","type":"INVARIANT","layer":null,"category":null,"handle":"Schema Conformance: Tool call must match declared function signature","gloss":null,"stub":null,"metadata":{}},{"id":"Work","text":"Work#aaad","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Work#aaad","gloss":"The application of effort to reduce entropy","stub":"aaad","metadata":{"pattern":{"handle":"Work","data_schema":{"type":"object","required":["timestamp","effort_cost"],"properties":{"previous_hash":{"type":"string","description":"State before work"},"new_hash":{"type":"string","description":"State after work"},"effort_cost":{"type":"object","description":"Resources consumed (tokens, time)"},"timestamp":{"type":"string","format":"date-time"}}},"mechanism":"The primitive representation of directed effort. It represents the expenditure of resources (Compute, Time, Energy) to transform a {{task}} from an 'Open' state to a 'Solved' state (reducing local entropy). Work is the bridge between Intent (thinking) and Reality ({{act}}). Work is validated against an acceptance criteria.","gloss":"The application of effort to reduce entropy","failure_modes":["Thrashing: Expending resources without making progress toward the goal.","Burnout: Exhausting the {{budget}} before the task is complete.","Busywork: Performing valid actions that do not contribute to the objective function."],"invariants":["Cost: Work always consumes resources (Time/Tokens > 0).","Directionality: Work must be vector-aligned with a Goal (otherwise it is just 'Heat')."],"_meta":{"tier":1,"layer":"Infrastructure","category":"Data Structures","related":["EntropyPump"],"ring":0},"sema_layer":"Infrastructure","sema_category":"Data Structures","sema_id":"sema:Work#mh:SHA-256:aaad0ca428ad22dd8f5941f56b4425ddf62180752cfd6d5d8145419c8a6ac90b","sema_ref":"Work#aaad","sema_stub":"aaad"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"fd0f43e6-7434-4ce4-ba27-d95f18a54eb4","text":"Cost: Work always consumes resources (Time/Tokens > 0).","type":"INVARIANT","layer":null,"category":null,"handle":"Cost: Work always consumes resources (Time/Tokens > 0).","gloss":null,"stub":null,"metadata":{}},{"id":"7d8d9e41-5592-4098-bf37-b1e7fce867f0","text":"Directionality: Work must be vector-aligned with a Goal (otherwise it is just 'Heat').","type":"INVARIANT","layer":null,"category":null,"handle":"Directionality: Work must be vector-aligned with a Goal (otherwise it is just 'Heat').","gloss":null,"stub":null,"metadata":{}},{"id":"Interpret","text":"Interpret#c9ee","type":"PATTERN","layer":"Mind","category":"Reasoning","handle":"Interpret#c9ee","gloss":"Deriving semantic meaning from raw signal","stub":"c9ee","metadata":{"pattern":{"handle":"Interpret","gloss":"Deriving semantic meaning from raw signal","mechanism":"The cognitive {{think}} act of applying a semantic {{context}} to a raw {{datum}} or {{signal}} to extract {{value}}. Unlike `Translate` (which changes form), Interpret changes the abstraction level, moving from syntax to semantics.","signature":["Think(Value)"],"invariants":["Context Dependency: Meaning(Signal) depends on Context.","Non-Destructive: The original signal is preserved."],"_meta":{"tier":0,"layer":"Mind","category":"Reasoning","ring":0},"sema_ref":"Interpret#c9ee","sema_id":"sema:Interpret#mh:SHA-256:c9ee95cb7bd89112c0976c66c31f75cabf366786a388ff3c2b35145890a05c3f","sema_stub":"c9ee","sema_layer":"Mind","sema_category":"Reasoning"},"layer":"Mind","category":"Reasoning"}},{"id":"716c6e56-9216-49cf-ad92-39304f6939c1","text":"Context Dependency: Meaning(Signal) depends on Context.","type":"INVARIANT","layer":null,"category":null,"handle":"Context Dependency: Meaning(Signal) depends on Context.","gloss":null,"stub":null,"metadata":{}},{"id":"ba17480c-f2f3-440c-999f-c3c6a83960e5","text":"Non-Destructive: The original signal is preserved.","type":"INVARIANT","layer":null,"category":null,"handle":"Non-Destructive: The original signal is preserved.","gloss":null,"stub":null,"metadata":{}},{"id":"Understand","text":"Understand#96d4","type":"PATTERN","layer":"Mind","category":"Reasoning","handle":"Understand#96d4","gloss":"Deep semantic modeling","stub":"96d4","metadata":{"pattern":{"handle":"Understand","mechanism":"The process of applying {{think}} to construct an internal model that accurately reflects the causal structure, semantics, and {{context}} of an input. It goes beyond simple parsing to grasp 'why' and 'how'.","gloss":"Deep semantic modeling","_meta":{"tier":1,"layer":"Mind","category":"Reasoning","ring":1},"sema_id":"sema:Understand#mh:SHA-256:96d4533c4539cdd5036beadb506908d384e8f417449e02bbf8e6175e5bafc39b","sema_ref":"Understand#96d4","sema_stub":"96d4","sema_layer":"Mind","sema_category":"Reasoning","signature":["Think(Context)"]},"layer":"Mind","category":"Reasoning"}},{"id":"Risk","text":"Risk#3774","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Risk#3774","gloss":"Quantified potential for negative outcome","stub":"3774","metadata":{"pattern":{"handle":"Risk","mechanism":"A structured representation of potential negative outcomes. It combines: 1. {{probability}} (likelihood of occurrence), 2. Severity (impact {{metric}} 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.","gloss":"Quantified potential for negative outcome","failure_modes":["Risk Blindness: Failing to identify a material risk.","Risk Theater: Documenting risks without meaningful mitigation.","Probability Miscalibration: Systematically under/over-estimating likelihood.","Cascade Blindness: Missing that one risk triggers others."],"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."],"_meta":{"tier":1,"layer":"Infrastructure","category":"Data Structures","ring":0},"sema_id":"sema:Risk#mh:SHA-256:37748bbbeb3ee23c5a258a49faee4d04a16064136fdfd8721a365d3764c73fb8","sema_ref":"Risk#3774","sema_stub":"3774","sema_layer":"Infrastructure","sema_category":"Data Structures","data_schema":{"type":"object","required":["probability","severity"],"properties":{"risk_id":{"type":"string","description":"Unique identifier"},"probability":{"type":"number","minimum":0,"maximum":1,"description":"Likelihood of occurrence"},"severity":{"type":"number","description":"Impact metric if materialized"},"mitigation":{"type":"array","items":{"type":"string"},"description":"Actions to reduce risk"},"trigger":{"type":"string","description":"Observable condition indicating materialization"}}}},"layer":"Infrastructure","category":"Data Structures"}},{"id":"5d07d308-b0a0-479e-867f-18c960ec459f","text":"Quantification: Probability and severity must be estimated, not just named.","type":"INVARIANT","layer":null,"category":null,"handle":"Quantification: Probability and severity must be estimated, not just named.","gloss":null,"stub":null,"metadata":{}},{"id":"56afa5c8-8a1a-4fbe-a112-9027b2763647","text":"Mitigation: Each significant risk must have at least one mitigation strategy.","type":"INVARIANT","layer":null,"category":null,"handle":"Mitigation: Each significant risk must have at least one mitigation strategy.","gloss":null,"stub":null,"metadata":{}},{"id":"16ec2312-997c-4a31-9fb2-877597281327","text":"Monitoring: Triggers must be observable during execution.","type":"INVARIANT","layer":null,"category":null,"handle":"Monitoring: Triggers must be observable during execution.","gloss":null,"stub":null,"metadata":{}},{"id":"SpotAudit","text":"SpotAudit#6673","type":"PATTERN","layer":"Infrastructure","category":"Verification","handle":"SpotAudit#6673","gloss":"Random sampling of internal state","stub":"6673","metadata":{"pattern":{"handle":"SpotAudit","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 {{state_audit}}.","gloss":"Random sampling of internal state","failure_modes":["Privacy leakage from the sample."],"invariants":["Randomness: {{audit}} target must be selected via VRF","Response Time: Proof must be returned within T_max"],"preconditions":["Auditor has authority key"],"postconditions":["{{audit}} result published to ledger"],"_meta":{"tier":1,"layer":"Infrastructure","category":"Verification","ring":1},"sema_id":"sema:SpotAudit#mh:SHA-256:66730b2af0aece3adb72ca9e81b48085fc3654642b14cf82f3d8d2ae4890396d","sema_ref":"SpotAudit#6673","sema_stub":"6673","sema_layer":"Infrastructure","sema_category":"Verification"},"layer":"Infrastructure","category":"Verification"}},{"id":"e4ccbb5f-8ad3-4b85-8752-95d59564e62d","text":"Randomness: {{audit}} target must be selected via VRF","type":"INVARIANT","layer":null,"category":null,"handle":"Randomness: {{audit}} target must be selected via VRF","gloss":null,"stub":null,"metadata":{}},{"id":"2835b99e-fdfe-4ad5-9775-72cbec50cc5d","text":"Response Time: Proof must be returned within T_max","type":"INVARIANT","layer":null,"category":null,"handle":"Response Time: Proof must be returned within T_max","gloss":null,"stub":null,"metadata":{}},{"id":"6995735f-6f5a-43c6-bbc5-9ef5a97b8122","text":"Auditor has authority key","type":"PRECONDITION","layer":null,"category":null,"handle":"Auditor has authority key","gloss":null,"stub":null,"metadata":{}},{"id":"c42a4b69-0ad8-4407-b591-e6f639f798e6","text":"{{audit}} result published to ledger","type":"POSTCONDITION","layer":null,"category":null,"handle":"{{audit}} result published to ledger","gloss":null,"stub":null,"metadata":{}},{"id":"RecursiveRootCause","text":"RecursiveRootCause#6dc1","type":"PATTERN","layer":"Mind","category":"Reasoning","handle":"RecursiveRootCause#6dc1","gloss":"Recursive root cause analysis","stub":"6dc1","metadata":{"pattern":{"handle":"RecursiveRootCause","mechanism":"Causal Drill: {{state}} 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}} to validate provenance of each cause.","gloss":"Recursive root cause analysis","failure_modes":["Single Track Blindness: Assuming a single linear chain of causality when the reality is a multi-factor mesh."],"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."],"_meta":{"tier":2,"layer":"Mind","category":"Reasoning","related":["sema:Bisect#mh:SHA-256:20cceef8a924c82071b0e536bf6164512ca1a80f1f3bad033e6efa9eb3acfff3","sema:RecursionDive#mh:SHA-256:21c78ad8cc5e658fd19356cec9b998d9af1b02c54eaa96ce2d2f0ec4d8a75639"],"ring":2},"sema_id":"sema:RecursiveRootCause#mh:SHA-256:6dc1c6c6188891b7f40b08560272b1290dad04faf9f88185ae1b02550d8c6310","sema_ref":"RecursiveRootCause#6dc1","sema_stub":"6dc1","sema_layer":"Mind","sema_category":"Reasoning"},"layer":"Mind","category":"Reasoning"}},{"id":"dab59add-0b9c-4ba6-abba-4ed7080cf1f7","text":"Answers must be factual, not speculative.","type":"INVARIANT","layer":null,"category":null,"handle":"Answers must be factual, not speculative.","gloss":null,"stub":null,"metadata":{}},{"id":"7c83db86-00f6-4dae-8ff0-4d13605b3d92","text":"Causality Chain: Step(N) must be the direct cause of Step(N-1).","type":"INVARIANT","layer":null,"category":null,"handle":"Causality Chain: Step(N) must be the direct cause of Step(N-1).","gloss":null,"stub":null,"metadata":{}},{"id":"53e73717-dcc8-4b94-b78a-25f8ac98c5af","text":"Termination: Recursion stops at actionable root or fundamental axiom.","type":"INVARIANT","layer":null,"category":null,"handle":"Termination: Recursion stops at actionable root or fundamental axiom.","gloss":null,"stub":null,"metadata":{}},{"id":"SelfReminder","text":"SelfReminder#c896","type":"PATTERN","layer":"Mind","category":"Memory","handle":"SelfReminder#c896","gloss":"Reinforce constraints in system prompt before each response","stub":"c896","metadata":{"pattern":{"handle":"SelfReminder","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}} of the agent's core identity into the prompt context.","gloss":"Reinforce constraints in system prompt before each response","failure_modes":["{{context}} Dilution: Long conversations push reminder out of effective context window.","Brittleness: Sophisticated attacks still bypass static reminders.","Token Overhead: Repeated reminders consume context budget."],"invariants":["Consistent Application: Reminder applied to every user turn","{{constraint}} Specificity: Reminders must name concrete prohibited behaviors","Placement: Reminder positioned for maximum attention weight"],"_meta":{"tier":2,"layer":"Mind","category":"Memory","ring":0},"sema_id":"sema:SelfReminder#mh:SHA-256:c8963a9fcc7250cec588a332bb96f1b988b64909c47b788c288c30a3a9cad832","sema_ref":"SelfReminder#c896","sema_stub":"c896","sema_layer":"Mind","sema_category":"Memory"},"layer":"Mind","category":"Memory"}},{"id":"e869d08c-7b8a-4360-a305-9f9c06895bca","text":"Consistent Application: Reminder applied to every user turn","type":"INVARIANT","layer":null,"category":null,"handle":"Consistent Application: Reminder applied to every user turn","gloss":null,"stub":null,"metadata":{}},{"id":"f26749d4-cbc6-44b8-bfec-f6a834237e66","text":"{{constraint}} Specificity: Reminders must name concrete prohibited behaviors","type":"INVARIANT","layer":null,"category":null,"handle":"{{constraint}} Specificity: Reminders must name concrete prohibited behaviors","gloss":null,"stub":null,"metadata":{}},{"id":"5c3671fd-34d5-4ae3-a251-4fca01d66728","text":"Placement: Reminder positioned for maximum attention weight","type":"INVARIANT","layer":null,"category":null,"handle":"Placement: Reminder positioned for maximum attention weight","gloss":null,"stub":null,"metadata":{}},{"id":"Stigmergy","text":"Stigmergy#f624","type":"PATTERN","layer":"Mind","category":"Memory","handle":"Stigmergy#f624","gloss":"Indirect coordination via environment modification (Ant Colony)","stub":"f624","metadata":{"pattern":{"handle":"Stigmergy","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}}).","gloss":"Indirect coordination via environment modification (Ant Colony)","invariants":["{{decay}}: Signals must fade over time unless reinforced","Locality: Sensing is local to the agent's position"],"_meta":{"tier":1,"layer":"Mind","category":"Memory","related":["sema:GhostTrail#mh:SHA-256:ec5b2ca0ee009f2aec90a8fb2cec9ee5feb29a1d98f20a7211d973b26a629e6a","sema:Signal#mh:SHA-256:30401098f53ba595e7f0c0e12b7b233d27cf170436a98f9f153016b7e5db9aa6"],"ring":0},"sema_id":"sema:Stigmergy#mh:SHA-256:f624f79cc3860686d0278c28c17cfd0e746d8fb2300fa9590ba90f134fee82ed","sema_ref":"Stigmergy#f624","sema_stub":"f624","sema_layer":"Mind","sema_category":"Memory"},"layer":"Mind","category":"Memory"}},{"id":"7fcfd24c-39e3-4896-b2ea-c1cafe1a5d42","text":"{{decay}}: Signals must fade over time unless reinforced","type":"INVARIANT","layer":null,"category":null,"handle":"{{decay}}: Signals must fade over time unless reinforced","gloss":null,"stub":null,"metadata":{}},{"id":"aa745af4-dae1-43bd-be19-661c2fd113d5","text":"Locality: Sensing is local to the agent's position","type":"INVARIANT","layer":null,"category":null,"handle":"Locality: Sensing is local to the agent's position","gloss":null,"stub":null,"metadata":{}},{"id":"OptimalStop","text":"OptimalStop#7439","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"OptimalStop#7439","gloss":"Resource-aware search termination","stub":"7439","metadata":{"pattern":{"handle":"OptimalStop","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 {{compute_budget}} aware termination condition for search processes.","gloss":"Resource-aware search termination","failure_modes":["Empty Handed: Strict 1/e rule exhausted all options without beating baseline.","Infinite Search: Unknown N resulted in endless calibration phase."],"invariants":["Budget Adherence: Search must terminate before {{compute_budget}} == 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"}],"_meta":{"tier":2,"layer":"Mind","category":"Strategy","ring":2},"sema_id":"sema:OptimalStop#mh:SHA-256:74391a0813dfa1c767a2221d9fd50da3c1bd6714bd77a402f0178c707a8ad95f","sema_ref":"OptimalStop#7439","sema_stub":"7439","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"6b045666-416f-4528-84bb-c80bdd7440b8","text":"Budget Adherence: Search must terminate before {{compute_budget}} == 0","type":"INVARIANT","layer":null,"category":null,"handle":"Budget Adherence: Search must terminate before {{compute_budget}} == 0","gloss":null,"stub":null,"metadata":{}},{"id":"Reason","text":"Reason#3f24","type":"PATTERN","layer":"Mind","category":"Reasoning","handle":"Reason#3f24","gloss":"Execute a cognitive topology","stub":"3f24","metadata":{"pattern":{"handle":"Reason","mechanism":"Orchestrated cognition that chains multiple {{think}} steps using a specific {{topology}} (e.g., {{chain}} of Thought, {{tree}} of Thoughts). Transforms {{context}} into conclusions, plans, or decisions while respecting {{compute_budget}}. The bridge between atomic thinking and structured problem-solving.","gloss":"Execute a cognitive topology","failure_modes":["Analysis Paralysis: Spending too much compute on a decision with diminishing returns.","Circular Reasoning: The thought process loops back to the premise without progress.","Context Window Overflow: The reasoning trace exceeds memory capacity."],"invariants":["Bounded Execution: Must respect {{compute_budget}} (time/token limits).","Structure Adherence: Must follow the rules of the selected reasoning {{topology}}.","Side-Effect Free: Reasoning itself does not change the external world."],"preconditions":["{{context}} contains sufficient information","{{compute_budget}} is available"],"postconditions":["A conclusion, plan, or decision is generated","Reasoning trace is appended to History"],"_meta":{"tier":1,"layer":"Mind","category":"Reasoning","ring":1,"related":["ChainOfThought","TreeOfThoughts"]},"sema_id":"sema:Reason#mh:SHA-256:3f246e05b685e54ff927fc1f0ccba1be64078d8aab649145440940a25ceed846","sema_ref":"Reason#3f24","sema_stub":"3f24","sema_layer":"Mind","sema_category":"Reasoning"},"layer":"Mind","category":"Reasoning"}},{"id":"e2fd1c9a-fff1-4212-9d2d-3729b4258a9f","text":"Bounded Execution: Must respect {{compute_budget}} (time/token limits).","type":"INVARIANT","layer":null,"category":null,"handle":"Bounded Execution: Must respect {{compute_budget}} (time/token limits).","gloss":null,"stub":null,"metadata":{}},{"id":"ce1a7678-9d8a-4748-a565-d5254354b6d6","text":"Structure Adherence: Must follow the rules of the selected reasoning {{topology}}.","type":"INVARIANT","layer":null,"category":null,"handle":"Structure Adherence: Must follow the rules of the selected reasoning {{topology}}.","gloss":null,"stub":null,"metadata":{}},{"id":"683e37d3-0346-4edf-9aee-8e984fdd1803","text":"{{context}} contains sufficient information","type":"PRECONDITION","layer":null,"category":null,"handle":"{{context}} contains sufficient information","gloss":null,"stub":null,"metadata":{}},{"id":"dcf5007b-706f-45fc-bd1e-8242146482e5","text":"{{compute_budget}} is available","type":"PRECONDITION","layer":null,"category":null,"handle":"{{compute_budget}} is available","gloss":null,"stub":null,"metadata":{}},{"id":"b636fbb0-35bb-4fec-b055-e114afa5e4c4","text":"A conclusion, plan, or decision is generated","type":"POSTCONDITION","layer":null,"category":null,"handle":"A conclusion, plan, or decision is generated","gloss":null,"stub":null,"metadata":{}},{"id":"961a6f7f-81b7-4f1d-ad64-b9c57eee7bbd","text":"Reasoning trace is appended to History","type":"POSTCONDITION","layer":null,"category":null,"handle":"Reasoning trace is appended to History","gloss":null,"stub":null,"metadata":{}},{"id":"ReversibilityCheck","text":"ReversibilityCheck#574b","type":"PATTERN","layer":"Society","category":"Protocols","handle":"ReversibilityCheck#574b","gloss":"Reversibility Audit (Alias for Check(Reversibility))","stub":"574b","metadata":{"pattern":{"handle":"ReversibilityCheck","mechanism":"A convenience wrapper for a {{check}} configured with the {{reversibility}} condition. Halts execution if the action is deemed irreversible (Type 1 decision) without proper authorization. It applies the {{check}} primitive to the {{reversibility}} condition, ensuring the {{world_reversible}} invariant holds, mandating {{human_approve}} if the action is irreversible.","gloss":"Reversibility Audit (Alias for Check(Reversibility))","_meta":{"tier":2,"layer":"Society","category":"Protocols","ring":0},"sema_layer":"Society","sema_category":"Protocols","sema_id":"sema:ReversibilityCheck#mh:SHA-256:574b1afaee6cd675d04e2b9e3484ddfba1490b19121c881832865d3d31a8a2ee","sema_ref":"ReversibilityCheck#574b","sema_stub":"574b","signature":["Check(Reversibility)"]},"layer":"Society","category":"Protocols"}},{"id":"Dampen","text":"Dampen#ff89","type":"PATTERN","layer":"Physics","category":"Primitives","handle":"Dampen#ff89","gloss":"Passive attenuation of signal or force","stub":"ff89","metadata":{"pattern":{"handle":"Dampen","mechanism":"The reduction of {{signal}} intensity or {{value}} magnitude in response to resistance or {{noise}}. It acts as a negative feedback loop to prevent oscillation or runaway amplification.","gloss":"Passive attenuation of signal or force","_meta":{"tier":1,"layer":"Physics","category":"Primitives","ring":0},"sema_ref":"Dampen#ff89","sema_id":"sema:Dampen#mh:SHA-256:ff89ddbb26a7021d281d787f24c4fc91f28b438591e0133a0439675f7eab4204","sema_stub":"ff89","sema_layer":"Physics","sema_category":"Primitives"},"layer":"Physics","category":"Primitives"}},{"id":"EntropyPump","text":"EntropyPump#b9ae","type":"PATTERN","layer":"Physics","category":"Primitives","handle":"EntropyPump#b9ae","gloss":"Controlled randomization to escape convergence deadlocks","stub":"b9ae","metadata":{"pattern":{"handle":"EntropyPump","mechanism":"A mechanism that prevents system stagnation by injecting {{entropy}} (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}}, it forces re-evaluation of settled states.","gloss":"Controlled randomization to escape convergence deadlocks","failure_modes":["Over-injection destabilizing productive equilibria.","Insufficient injection failing to break persistent deadlocks."],"invariants":["Clarity: Ambiguity must decrease over time","Forced Resolution: Conflicts cannot persist indefinitely"],"_meta":{"tier":2,"layer":"Physics","category":"Primitives","ring":1},"sema_id":"sema:EntropyPump#mh:SHA-256:b9aefca2154e0e2912d1e64bb50a9db80b188c2aeceb385cf3350e4b4c7cdd63","sema_ref":"EntropyPump#b9ae","sema_stub":"b9ae","sema_layer":"Physics","sema_category":"Primitives"},"layer":"Physics","category":"Primitives"}},{"id":"fb23e92c-15eb-48ec-99bd-e00bc90ae23a","text":"Clarity: Ambiguity must decrease over time","type":"INVARIANT","layer":null,"category":null,"handle":"Clarity: Ambiguity must decrease over time","gloss":null,"stub":null,"metadata":{}},{"id":"7814ba42-34c8-4680-b086-9ddabf9116c6","text":"Forced Resolution: Conflicts cannot persist indefinitely","type":"INVARIANT","layer":null,"category":null,"handle":"Forced Resolution: Conflicts cannot persist indefinitely","gloss":null,"stub":null,"metadata":{}},{"id":"Reframe","text":"Reframe#ba00","type":"PATTERN","layer":"Mind","category":"Reasoning","handle":"Reframe#ba00","gloss":"Changing perspective to restructure the tree and find a new solution root","stub":"ba00","metadata":{"pattern":{"handle":"Reframe","mechanism":"{{problem}} Rotation: Transform the {{problem}} 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.","gloss":"Changing perspective to restructure the tree and find a new solution root","failure_modes":["Frame Blindness: New frame has its own blind spots, trading one bias for another."],"invariants":["{{problem}} semantics preserved","perspective shifted"],"preconditions":["Stuck problem state"],"postconditions":["New solution path visible"],"_meta":{"tier":1,"layer":"Mind","category":"Reasoning","ring":2,"related":["SolutionRoot","SolutionTree"]},"sema_id":"sema:Reframe#mh:SHA-256:ba00c40311ec71aab4f5942fcdd6876df95b15604cf54260182737e21a874dc9","sema_ref":"Reframe#ba00","sema_stub":"ba00","sema_layer":"Mind","sema_category":"Reasoning"},"layer":"Mind","category":"Reasoning"}},{"id":"cfb5d236-6846-49ab-919a-a5bb0bdc6561","text":"{{problem}} semantics preserved","type":"INVARIANT","layer":null,"category":null,"handle":"{{problem}} semantics preserved","gloss":null,"stub":null,"metadata":{}},{"id":"d355b52b-7a36-4bb5-a562-7a3e3a32554c","text":"perspective shifted","type":"INVARIANT","layer":null,"category":null,"handle":"perspective shifted","gloss":null,"stub":null,"metadata":{}},{"id":"f9902177-79ae-4337-a4ae-95b842e9c226","text":"Stuck problem state","type":"PRECONDITION","layer":null,"category":null,"handle":"Stuck problem state","gloss":null,"stub":null,"metadata":{}},{"id":"2aec1061-1352-4630-bd83-1a4b4c54866a","text":"New solution path visible","type":"POSTCONDITION","layer":null,"category":null,"handle":"New solution path visible","gloss":null,"stub":null,"metadata":{}},{"id":"ThinSlice","text":"ThinSlice#4c34","type":"PATTERN","layer":"Society","category":"Protocols","handle":"ThinSlice#4c34","gloss":"High-confidence classification from minimal data","stub":"4c34","metadata":{"pattern":{"handle":"ThinSlice","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}}, {{extended_thinking}}, {{somatic_marker}}.","gloss":"High-confidence classification from minimal data","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"],"_meta":{"tier":3,"layer":"Society","category":"Protocols","ring":2},"sema_id":"sema:ThinSlice#mh:SHA-256:4c34bbb03a2da524d67565e0504d2ab1ed839cef474cb7981fdeda9081f96e8d","sema_ref":"ThinSlice#4c34","sema_stub":"4c34","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"e9ca8593-db0b-4a84-868c-673d338df4ec","text":"Fail-Safe: If classification low confidence, forward to full processor","type":"INVARIANT","layer":null,"category":null,"handle":"Fail-Safe: If classification low confidence, forward to full processor","gloss":null,"stub":null,"metadata":{}},{"id":"146d6b28-b8d4-467f-b6cf-e1b6505e2623","text":"Sample Limit: Input size <= Slice Size","type":"INVARIANT","layer":null,"category":null,"handle":"Sample Limit: Input size <= Slice Size","gloss":null,"stub":null,"metadata":{}},{"id":"9ea13015-a262-446f-be14-982c713e244d","text":"Representative Sample: The slice must statistically resemble the whole for the target feature","type":"INVARIANT","layer":null,"category":null,"handle":"Representative Sample: The slice must statistically resemble the whole for the target feature","gloss":null,"stub":null,"metadata":{}},{"id":"Cooldown","text":"Cooldown#0cde","type":"PATTERN","layer":"Physics","category":"Primitives","handle":"Cooldown#0cde","gloss":"Mandatory delay between repeated actions","stub":"0cde","metadata":{"pattern":{"handle":"Cooldown","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}} policies, rejecting requests until the timer expires.","gloss":"Mandatory delay between repeated actions","failure_modes":["Deadlock: Critical action needed during cooldown period, system stuck waiting."],"invariants":["Action blocked until T_last + Duration","Timer is monotonic"],"preconditions":["Action executed","Rate limit policy"],"postconditions":["Ready state restored after delay"],"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"}],"_meta":{"tier":1,"layer":"Physics","category":"Primitives","ring":0},"sema_id":"sema:Cooldown#mh:SHA-256:0cde8197149b258f1e6126f179b30468c12cb5e35352fcd0a8ae0bce0823c8ac","sema_ref":"Cooldown#0cde","sema_stub":"0cde","sema_layer":"Physics","sema_category":"Primitives"},"layer":"Physics","category":"Primitives"}},{"id":"b19adf87-846e-4a9e-b5ea-87d5fcaa8e3a","text":"Action blocked until T_last + Duration","type":"INVARIANT","layer":null,"category":null,"handle":"Action blocked until T_last + Duration","gloss":null,"stub":null,"metadata":{}},{"id":"7c02c221-24e4-4187-8b70-7f8d3e08401b","text":"Timer is monotonic","type":"INVARIANT","layer":null,"category":null,"handle":"Timer is monotonic","gloss":null,"stub":null,"metadata":{}},{"id":"2ba25e27-fb35-42f8-ba63-2175e3c76475","text":"Action executed","type":"PRECONDITION","layer":null,"category":null,"handle":"Action executed","gloss":null,"stub":null,"metadata":{}},{"id":"397aa888-8719-4dc6-a1f2-08aa5458fa11","text":"Rate limit policy","type":"PRECONDITION","layer":null,"category":null,"handle":"Rate limit policy","gloss":null,"stub":null,"metadata":{}},{"id":"a6c15f07-a423-413d-b2c8-c7bccf1b9888","text":"Ready state restored after delay","type":"POSTCONDITION","layer":null,"category":null,"handle":"Ready state restored after delay","gloss":null,"stub":null,"metadata":{}},{"id":"Bubble","text":"Bubble#eb9a","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"Bubble#eb9a","gloss":"Enable risk-free coordination experimentation through transactional isolation—try before committing to reality","stub":"eb9a","metadata":{"pattern":{"handle":"Bubble","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}} 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 {{constraint_first}} approach around the simulation context to ensure no side effects leak into the production environment.","gloss":"Enable risk-free coordination experimentation through transactional isolation—try before committing to reality","failure_modes":["Participant crashes after READY but before COMMIT (blocking—use timeout and recovery).","Long-running bubbles hold soft-reservations too long (resource starvation).","{{state}} snapshot becomes stale (external world changed during bubble).","Nested bubble complexity (multiple isolation levels, commit ordering).","Commit overhead (2PC protocol is expensive).","Bubble escape (agent accidentally affects real world from inside bubble—discipline required)."],"invariants":["Information within bubble is isolated from outside","Internal consistency maintained"],"preconditions":["Group of agents","Shared context"],"postconditions":["Bubble dissolved or merged","Local consensus reached"],"_meta":{"tier":1,"layer":"Mind","category":"Strategy","ring":1},"sema_id":"sema:Bubble#mh:SHA-256:eb9a8441896625edfa7d41935d88120a27bf53db353082e49b0c6027d45e6142","sema_ref":"Bubble#eb9a","sema_stub":"eb9a","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"d4185b1d-3d7e-427c-94f3-86f78bb9f8a3","text":"Information within bubble is isolated from outside","type":"INVARIANT","layer":null,"category":null,"handle":"Information within bubble is isolated from outside","gloss":null,"stub":null,"metadata":{}},{"id":"841b97b1-8f00-4e60-ad1c-b3013f182117","text":"Internal consistency maintained","type":"INVARIANT","layer":null,"category":null,"handle":"Internal consistency maintained","gloss":null,"stub":null,"metadata":{}},{"id":"56ffd905-f0c1-4fcf-b038-6e9861b00f2f","text":"Group of agents","type":"PRECONDITION","layer":null,"category":null,"handle":"Group of agents","gloss":null,"stub":null,"metadata":{}},{"id":"7a70d6ed-d86f-4dad-963c-b4177ac675b8","text":"Shared context","type":"PRECONDITION","layer":null,"category":null,"handle":"Shared context","gloss":null,"stub":null,"metadata":{}},{"id":"f3e61797-4633-4023-af73-835a44f7cf74","text":"Bubble dissolved or merged","type":"POSTCONDITION","layer":null,"category":null,"handle":"Bubble dissolved or merged","gloss":null,"stub":null,"metadata":{}},{"id":"56ea2cf4-623f-4bd8-929c-da07c3208c12","text":"Local consensus reached","type":"POSTCONDITION","layer":null,"category":null,"handle":"Local consensus reached","gloss":null,"stub":null,"metadata":{}},{"id":"Care","text":"Care#cdfa","type":"PATTERN","layer":"Infrastructure","category":"Primitives","handle":"Care#cdfa","gloss":"Non-transactional maintenance energy","stub":"cdfa","metadata":{"pattern":{"handle":"Care","mechanism":"The application of {{work}} to reduce a target's {{entropy}} without an explicit {{value}} extraction. It creates a buffer against volatility.","gloss":"Non-transactional maintenance energy","invariants":["Entropy Reduction: Action reduces local disorder.","Resource Consumption: Care requires Work."],"_meta":{"tier":1,"layer":"Infrastructure","category":"Primitives","ring":0},"sema_id":"sema:Care#mh:SHA-256:cdfae572389ee7b84aa847b9320c072053f25827a7b06891cb08cd8d18aef40b","sema_ref":"Care#cdfa","sema_stub":"cdfa","sema_layer":"Infrastructure","sema_category":"Primitives"},"layer":"Infrastructure","category":"Primitives"}},{"id":"8ed06e3e-0883-4dd0-886e-0131a707cced","text":"Entropy Reduction: Action reduces local disorder.","type":"INVARIANT","layer":null,"category":null,"handle":"Entropy Reduction: Action reduces local disorder.","gloss":null,"stub":null,"metadata":{}},{"id":"3a11d5c4-95a4-44ab-a28e-c5d610039cbf","text":"Resource Consumption: Care requires Work.","type":"INVARIANT","layer":null,"category":null,"handle":"Resource Consumption: Care requires Work.","gloss":null,"stub":null,"metadata":{}},{"id":"Loop","text":"Loop#fb2e","type":"PATTERN","layer":"Infrastructure","category":"Primitives","handle":"Loop#fb2e","gloss":"Repeated execution cycle","stub":"fb2e","metadata":{"pattern":{"handle":"Loop","mechanism":"A control flow structure that repeats a sequence of {{work}} until a specific {{condition}} is met. Essential for feedback, learning, and persistent processes.","gloss":"Repeated execution cycle","invariants":["Termination Guarantee: Must have a proven exit condition (or explicit Daemon mode).","Progress: State must change between iterations to avoid infinite freeze."],"sema_id":"sema:Loop#mh:SHA-256:fb2e7eeab0b569d64f7e74defeec56aeccf5abdb6c5cd4a0ce80c397ebc5d593","sema_ref":"Loop#fb2e","sema_stub":"fb2e","_meta":{"tier":1,"layer":"Infrastructure","category":"Primitives","ring":0},"sema_layer":"Infrastructure","sema_category":"Primitives"},"layer":"Infrastructure","category":"Primitives"}},{"id":"6622dfd3-129f-40dd-8a8f-01706a4b021f","text":"Termination Guarantee: Must have a proven exit condition (or explicit Daemon mode).","type":"INVARIANT","layer":null,"category":null,"handle":"Termination Guarantee: Must have a proven exit condition (or explicit Daemon mode).","gloss":null,"stub":null,"metadata":{}},{"id":"e89dd86d-9d47-4b42-8446-7a9235e90290","text":"Progress: State must change between iterations to avoid infinite freeze.","type":"INVARIANT","layer":null,"category":null,"handle":"Progress: State must change between iterations to avoid infinite freeze.","gloss":null,"stub":null,"metadata":{}},{"id":"Prioritize","text":"Prioritize#dd16","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"Prioritize#dd16","gloss":"Ordering tasks by importance and urgency","stub":"dd16","metadata":{"pattern":{"handle":"Prioritize","mechanism":"Impact-Effort Ranking: List all options. Score each on impact ({{value}} if done) and effort (cost to do). Compute ratio. Sort by ratio descending. {{work}} top-down. Re-score periodically as information changes. Pareto principle: 20% of {{work}} yields 80% of {{value}}. It applies {{rank}} to the candidate set based on an Impact/Effort ratio.","gloss":"Ordering tasks by importance and urgency","failure_modes":["Priority Inversion: Low-priority {{task}} blocks high-priority {{task}} due to resource dependency."],"invariants":["Completeness: Output contains all input items","Ordering: Item(N) >= Item(N+1) by {{criteria}}"],"preconditions":["Items are comparable"],"postconditions":["Set ordered"],"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"}],"_meta":{"tier":1,"layer":"Mind","category":"Strategy","ring":2},"sema_id":"sema:Prioritize#mh:SHA-256:dd165fed938b9e9d4072846d09081f3ac1ab5c278c5abc5e5b0b7bd84fafcd62","sema_ref":"Prioritize#dd16","sema_stub":"dd16","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"81814094-0f65-4035-9f19-380454737aab","text":"Completeness: Output contains all input items","type":"INVARIANT","layer":null,"category":null,"handle":"Completeness: Output contains all input items","gloss":null,"stub":null,"metadata":{}},{"id":"f0d4d037-1d1d-4c4c-8f03-037b88eda93a","text":"Ordering: Item(N) >= Item(N+1) by {{criteria}}","type":"INVARIANT","layer":null,"category":null,"handle":"Ordering: Item(N) >= Item(N+1) by {{criteria}}","gloss":null,"stub":null,"metadata":{}},{"id":"93643787-abdd-4c35-9936-fd37689a89fc","text":"Items are comparable","type":"PRECONDITION","layer":null,"category":null,"handle":"Items are comparable","gloss":null,"stub":null,"metadata":{}},{"id":"97fdd8a6-34d7-4c26-bdfd-724fe2f9e055","text":"Set ordered","type":"POSTCONDITION","layer":null,"category":null,"handle":"Set ordered","gloss":null,"stub":null,"metadata":{}},{"id":"Solution","text":"Solution#7186","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Solution#7186","gloss":"The fractal unit of completed work","stub":"7186","metadata":{"pattern":{"handle":"Solution","mechanism":"Recursive {{work}} Unit. Encapsulates the output {{artifact}}, its Provenance (Creator, Time), and the Component {{tree}} of sub-solutions used to generate it. It serves as the verifiable output container for a {{task}}, validated against the acceptance criteria.","gloss":"The fractal unit of completed work","failure_modes":["Orphaned {{artifact}}: Solution does not reference a valid {{task}} ID.","Broken Lineage: Sub-solution verification failed ({{chain}} of Custody broken).","Schema Violation: {{artifact}} data does not match acceptance criteria type."],"invariants":["Immutability: Once finalized, {{artifact}} and Provenance cannot be modified.","Traceability: Provenance must be cryptographically signed by the Creator."],"preconditions":["{{artifact}} generated","{{task}} ID is valid"],"postconditions":["Solution sealed and ready for transport"],"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"}],"_meta":{"tier":1,"layer":"Infrastructure","category":"Data Structures","ring":0},"data_schema":{"type":"object","required":["artifact","provenance","task_ref"],"properties":{"artifact":{"description":"The output produced by this solution"},"provenance":{"type":"object","properties":{"creator_id":{"type":"string"},"timestamp":{"type":"string","format":"date-time"},"signature":{"type":"string"}}},"task_ref":{"type":"string","description":"Reference to the originating task"},"component_tree":{"type":"array","items":{"type":"string"},"description":"Sub-solutions used"},"confidence":{"type":"number","minimum":0,"maximum":1},"cost_incurred":{"type":"number","description":"Total compute cost in tokens"}}},"sema_id":"sema:Solution#mh:SHA-256:7186aebe86145a01476542042ab77b7eda5c54033e6dccf62a97e8fa6b94e806","sema_ref":"Solution#7186","sema_stub":"7186","sema_layer":"Infrastructure","sema_category":"Data Structures"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"da84b400-067c-4c00-ab3f-b295c6921f9b","text":"Immutability: Once finalized, {{artifact}} and Provenance cannot be modified.","type":"INVARIANT","layer":null,"category":null,"handle":"Immutability: Once finalized, {{artifact}} and Provenance cannot be modified.","gloss":null,"stub":null,"metadata":{}},{"id":"a8dff9e9-00f2-4fee-a629-6fe70f38991f","text":"{{artifact}} generated","type":"PRECONDITION","layer":null,"category":null,"handle":"{{artifact}} generated","gloss":null,"stub":null,"metadata":{}},{"id":"93c54129-ff39-44a6-b99d-ce574c728a14","text":"{{task}} ID is valid","type":"PRECONDITION","layer":null,"category":null,"handle":"{{task}} ID is valid","gloss":null,"stub":null,"metadata":{}},{"id":"da01de31-2513-49ca-a764-d9f277b73837","text":"Solution sealed and ready for transport","type":"POSTCONDITION","layer":null,"category":null,"handle":"Solution sealed and ready for transport","gloss":null,"stub":null,"metadata":{}},{"id":"TimeboxThink","text":"TimeboxThink#2656","type":"PATTERN","layer":"Society","category":"Protocols","handle":"TimeboxThink#2656","gloss":"Temporal bounding of exploration","stub":"2656","metadata":{"pattern":{"handle":"TimeboxThink","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}} {{work}} within {{constraint}}. Utilizes {{budget}}.","gloss":"Temporal bounding of exploration","failure_modes":["Premature Cutoff: Stopping the process just before the breakthrough occurs."],"invariants":["Best-so-far answer returned","Execution halts at T_max"],"preconditions":["Open-ended task","Time budget"],"postconditions":["Result within deadline"],"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"}],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":0},"sema_id":"sema:TimeboxThink#mh:SHA-256:265679a37dcae704c3e9e8c958f42f11751102e0685e55b1fe277c238bd9c05e","sema_ref":"TimeboxThink#2656","sema_stub":"2656","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"731a9b4c-b228-415d-b44e-5dcca26f241d","text":"Best-so-far answer returned","type":"INVARIANT","layer":null,"category":null,"handle":"Best-so-far answer returned","gloss":null,"stub":null,"metadata":{}},{"id":"6f292fb5-b8b5-4e71-b154-efa1e9b7c037","text":"Execution halts at T_max","type":"INVARIANT","layer":null,"category":null,"handle":"Execution halts at T_max","gloss":null,"stub":null,"metadata":{}},{"id":"75d87004-4025-45d3-9acc-5a4f07b0e82b","text":"Open-ended task","type":"PRECONDITION","layer":null,"category":null,"handle":"Open-ended task","gloss":null,"stub":null,"metadata":{}},{"id":"b1f38c1e-6dd4-446c-a785-fd2d78b3d551","text":"Time budget","type":"PRECONDITION","layer":null,"category":null,"handle":"Time budget","gloss":null,"stub":null,"metadata":{}},{"id":"5c2a41e6-bb6e-4433-b29a-ba9ac057c96f","text":"Result within deadline","type":"POSTCONDITION","layer":null,"category":null,"handle":"Result within deadline","gloss":null,"stub":null,"metadata":{}},{"id":"Translate","text":"Translate#e75d","type":"PATTERN","layer":"Mind","category":"Reasoning","handle":"Translate#e75d","gloss":"Convert form while preserving meaning","stub":"e75d","metadata":{"pattern":{"handle":"Translate","mechanism":"The process of converting {{datum}} from one representation (Language, Format, {{protocol}}, 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}}' (which adds meaning).","gloss":"Convert form while preserving meaning","failure_modes":["Lossy Translation: Semantic nuance lost in conversion (e.g., 'Schadenfreude' -> 'Happy').","Hallucination: Translator adds information not present in the source.","Format Error: Output violates the strict syntax of the target schema."],"invariants":["Semantic Equivalence: Meaning(Source) == Meaning(Target).","{{reversibility}}: In ideal cases, Translate(Target, Source) should recover the original (Round-trip)."],"preconditions":["Source data matches Source Schema","Target Schema is well-defined"],"postconditions":["Output data matches Target Schema"],"_meta":{"tier":1,"layer":"Mind","category":"Reasoning","ring":1},"sema_id":"sema:Translate#mh:SHA-256:e75d4e97e738a7ae2a377d85a30ce4ed294160b55aa47b778e10424424817429","sema_ref":"Translate#e75d","sema_stub":"e75d","sema_layer":"Mind","sema_category":"Reasoning"},"layer":"Mind","category":"Reasoning"}},{"id":"8a1f2825-c7a2-4798-b93e-146192638379","text":"Semantic Equivalence: Meaning(Source) == Meaning(Target).","type":"INVARIANT","layer":null,"category":null,"handle":"Semantic Equivalence: Meaning(Source) == Meaning(Target).","gloss":null,"stub":null,"metadata":{}},{"id":"680c3bbf-3c2f-4855-b9d3-2a7a5a2c3e02","text":"{{reversibility}}: In ideal cases, Translate(Target, Source) should recover the original (Round-trip).","type":"INVARIANT","layer":null,"category":null,"handle":"{{reversibility}}: In ideal cases, Translate(Target, Source) should recover the original (Round-trip).","gloss":null,"stub":null,"metadata":{}},{"id":"da6c34f6-add1-42c8-a150-061035b7e504","text":"Source data matches Source Schema","type":"PRECONDITION","layer":null,"category":null,"handle":"Source data matches Source Schema","gloss":null,"stub":null,"metadata":{}},{"id":"604d14b7-2c91-440b-8845-dad9860ea62f","text":"Target Schema is well-defined","type":"PRECONDITION","layer":null,"category":null,"handle":"Target Schema is well-defined","gloss":null,"stub":null,"metadata":{}},{"id":"353fcf40-2fdb-4966-bbac-323e5d9cbe04","text":"Output data matches Target Schema","type":"POSTCONDITION","layer":null,"category":null,"handle":"Output data matches Target Schema","gloss":null,"stub":null,"metadata":{}},{"id":"Satisfice","text":"Satisfice#9161","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"Satisfice#9161","gloss":"Optimizing for speed via threshold acceptance","stub":"9161","metadata":{"pattern":{"handle":"Satisfice","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 {{optimal_stop}}, terminating the search as soon as the first valid candidate is found.","gloss":"Optimizing for speed via threshold acceptance","failure_modes":["Threshold Drift: Unconsciously lowering standards during the search to force a match."],"invariants":["Threshold cannot change mid-search."],"preconditions":["{{option}} space enumerable. Acceptance threshold defined. Evaluation function exists."],"postconditions":["{{option}} meeting threshold found OR space exhausted. No backtracking occurred. {{decision}} final."],"_meta":{"tier":1,"layer":"Mind","category":"Strategy","ring":2},"sema_id":"sema:Satisfice#mh:SHA-256:91615d1f2766f4391d8b6b01a9ce2c576ecabf278336b638ce9309d916d1827d","sema_ref":"Satisfice#9161","sema_stub":"9161","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"96043368-f26c-467a-906f-6131f4dd5fe8","text":"Threshold cannot change mid-search.","type":"INVARIANT","layer":null,"category":null,"handle":"Threshold cannot change mid-search.","gloss":null,"stub":null,"metadata":{}},{"id":"430deed0-ab43-4712-a934-74f96c43749d","text":"{{option}} space enumerable. Acceptance threshold defined. Evaluation function exists.","type":"PRECONDITION","layer":null,"category":null,"handle":"{{option}} space enumerable. Acceptance threshold defined. Evaluation function exists.","gloss":null,"stub":null,"metadata":{}},{"id":"8354906e-2f41-48a1-84e0-12f0bab996dd","text":"{{option}} meeting threshold found OR space exhausted. No backtracking occurred. {{decision}} final.","type":"POSTCONDITION","layer":null,"category":null,"handle":"{{option}} meeting threshold found OR space exhausted. No backtracking occurred. {{decision}} final.","gloss":null,"stub":null,"metadata":{}},{"id":"Hysteresis","text":"Hysteresis#78b0","type":"PATTERN","layer":"Physics","category":"Primitives","handle":"Hysteresis#78b0","gloss":"Preventing oscillation via asymmetric thresholds","stub":"78b0","metadata":{"pattern":{"handle":"Hysteresis","mechanism":"Asymmetric Thresholds: {{state}} change from A→B requires crossing threshold T_up. {{state}} 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}} effect on state transitions, requiring the signal to cross distinct upper and lower thresholds to switch modes.","gloss":"Preventing oscillation via asymmetric thresholds","failure_modes":["Stuck {{state}}: Gap between thresholds is too wide, system never transitions back."],"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"}],"_meta":{"tier":2,"layer":"Physics","category":"Primitives","ring":0},"sema_id":"sema:Hysteresis#mh:SHA-256:78b01a1947793415b84de8f1883f9e3853f08e62b6647a38e51048d4ecbeb33a","sema_ref":"Hysteresis#78b0","sema_stub":"78b0","sema_layer":"Physics","sema_category":"Primitives"},"layer":"Physics","category":"Primitives"}},{"id":"f78efdd3-c090-4679-928d-e9db64bd93b7","text":"T_up > T_down always.","type":"INVARIANT","layer":null,"category":null,"handle":"T_up > T_down always.","gloss":null,"stub":null,"metadata":{}},{"id":"StepBack","text":"StepBack#b079","type":"PATTERN","layer":"Mind","category":"Reasoning","handle":"StepBack#b079","gloss":"Ascend abstraction to gain perspective","stub":"b079","metadata":{"pattern":{"handle":"StepBack","mechanism":"A meta-cognitive {{think}} 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}} is X?' or 'What principles govern X?'. This abstraction reveals structural patterns invisible at the ground level. It is the precursor to {{reframe}}—gaining altitude before choosing a new direction.","gloss":"Ascend abstraction to gain perspective","failure_modes":["Over-abstraction: Climbing so high the original problem becomes unrecognizable.","Analysis Paralysis: Endless stepping back without returning to action.","Premature Descent: Jumping back down before gaining useful perspective.","Abstraction Mismatch: Wrong principles retrieved for the task."],"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."],"preconditions":["Specific question or problem"],"postconditions":["Answer grounded in high-level concepts","Principles retrieved before details"],"_meta":{"tier":1,"layer":"Mind","category":"Reasoning","ring":1},"sema_id":"sema:StepBack#mh:SHA-256:b0799e81851e7cf503b84fcf260b81fa235cc829410fb0da67d5b8a4c1a4305a","sema_ref":"StepBack#b079","sema_stub":"b079","sema_layer":"Mind","sema_category":"Reasoning","signature":["Think(Problem)"]},"layer":"Mind","category":"Reasoning"}},{"id":"614036fe-21b8-416e-a1b8-294f30281f81","text":"Altitude Gain: Output must be at a higher abstraction level than input.","type":"INVARIANT","layer":null,"category":null,"handle":"Altitude Gain: Output must be at a higher abstraction level than input.","gloss":null,"stub":null,"metadata":{}},{"id":"afe69bc3-d104-4c0c-9cbc-1be76a823ded","text":"Relevance: Higher-level insight must inform the original problem.","type":"INVARIANT","layer":null,"category":null,"handle":"Relevance: Higher-level insight must inform the original problem.","gloss":null,"stub":null,"metadata":{}},{"id":"0ceee3df-0432-4a1c-97f0-cd3a4efe7790","text":"Bounded: Maximum abstraction depth before forced descent.","type":"INVARIANT","layer":null,"category":null,"handle":"Bounded: Maximum abstraction depth before forced descent.","gloss":null,"stub":null,"metadata":{}},{"id":"0b05cc82-261d-4bb2-8412-650f3281ccf9","text":"Specific question or problem","type":"PRECONDITION","layer":null,"category":null,"handle":"Specific question or problem","gloss":null,"stub":null,"metadata":{}},{"id":"d74a08f8-04f8-432c-ab37-d1027d120627","text":"Answer grounded in high-level concepts","type":"POSTCONDITION","layer":null,"category":null,"handle":"Answer grounded in high-level concepts","gloss":null,"stub":null,"metadata":{}},{"id":"b47142f2-5ae3-44ce-8bf2-ab7665469a25","text":"Principles retrieved before details","type":"POSTCONDITION","layer":null,"category":null,"handle":"Principles retrieved before details","gloss":null,"stub":null,"metadata":{}},{"id":"Cyclic","text":"Cyclic#ac13","type":"PATTERN","layer":"Physics","category":"Time","handle":"Cyclic#ac13","gloss":"Recursive or iterative topology","stub":"ac13","metadata":{"pattern":{"handle":"Cyclic","mechanism":"A {{topology}} that permits feedback {{loop}}s, allowing a process to revisit previous states or refine outputs iteratively. Essential for self-correcting systems and recursive optimization.","gloss":"Recursive or iterative topology","_meta":{"layer":"Physics","category":"Time","ring":2,"tier":1},"invariants":["Recurrence: At least one path exists from a node to itself.","Termination Condition: Must have a defined exit state to prevent infinite loops."],"sema_ref":"Cyclic#ac13","sema_id":"sema:Cyclic#mh:SHA-256:ac1335676817eaedd894da4a2d11671dec5a20dba76a8f5d55d1a6eed20e2051","sema_stub":"ac13","sema_layer":"Physics","sema_category":"Time"},"layer":"Physics","category":"Time"}},{"id":"d2e1131f-b38b-4211-83b3-0107304646ea","text":"Recurrence: At least one path exists from a node to itself.","type":"INVARIANT","layer":null,"category":null,"handle":"Recurrence: At least one path exists from a node to itself.","gloss":null,"stub":null,"metadata":{}},{"id":"2dbca1cb-30c7-480a-b5c4-41f5a52ffb7d","text":"Termination Condition: Must have a defined exit state to prevent infinite loops.","type":"INVARIANT","layer":null,"category":null,"handle":"Termination Condition: Must have a defined exit state to prevent infinite loops.","gloss":null,"stub":null,"metadata":{}},{"id":"Monitor","text":"Monitor#9a8f","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"Monitor#9a8f","gloss":"Continuous observation of state over time","stub":"9a8f","metadata":{"pattern":{"handle":"Monitor","gloss":"Continuous observation of state over time","mechanism":"A persistent process that uses a {{loop}} to repeatedly execute {{observe}} on a target {{system}} or {{state}} at defined intervals. It compares the observed state against a baseline or invariant, emitting a {{signal}} if a deviation ({{anomaly}}) is detected.","signature":["Loop(State)"],"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"}],"_meta":{"tier":0,"layer":"Mind","category":"Strategy","ring":0},"sema_ref":"Monitor#9a8f","sema_id":"sema:Monitor#mh:SHA-256:9a8f8879765fe55f9ab79786671b7e4cf0aa0e61730e20897214b22fb6fa08bb","sema_stub":"9a8f","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"6bcf6216-754a-4a7e-8f47-808d51ea65e5","text":"Liveness: Must run continuously or periodically.","type":"INVARIANT","layer":null,"category":null,"handle":"Liveness: Must run continuously or periodically.","gloss":null,"stub":null,"metadata":{}},{"id":"da714bbf-4065-4efe-b5f0-05d3d146dfa8","text":"Non-Interference: Monitoring should not significantly alter the observed system.","type":"INVARIANT","layer":null,"category":null,"handle":"Non-Interference: Monitoring should not significantly alter the observed system.","gloss":null,"stub":null,"metadata":{}},{"id":"Resonate","text":"Resonate#99d9","type":"PATTERN","layer":"Society","category":"Economics","handle":"Resonate#99d9","gloss":"Implicit coordination via signal amplification","stub":"99d9","metadata":{"pattern":{"handle":"Resonate","mechanism":"Alignment emerges from observable actions and mutual adjustment without explicit negotiation. Agents perform actions with attached INTENT_TAGS. Observers AMPLIFY (reinforce) or {{dampen}} (ignore) based on compatibility. It detects alignment via {{signal}} amplification and {{spectral_tune}}, eventually allowing the relationship to solidify into a stable bond.","gloss":"Implicit coordination via signal amplification","failure_modes":["False Resonance: Apparent alignment that is actually random {{noise}}.","Echo Chamber: Feedback {{loop}} amplifies error instead of {{signal}}.","Spoofing: Adversarial agents emit fake intent tags (Cheap Talk).","Precise coordination required (RESONATE only achieves approximate alignment).","High-stakes actions where approximate isn't good enough.","Adversarial agents exploit {{signal}}s (fake intent tags).","{{signal}} {{noise}} drowns real patterns.","False resonance (apparent alignment that isn't real).","Oscillation between conflicting patterns."],"invariants":["Action Causality: Response(t+1) must be function of Stimulus(t)","{{signal}} {{decay}}: Unreinforced signals must fade over time"],"preconditions":["At least two agents","Shared signal medium (Environment)"],"postconditions":["Local alignment cluster formed OR dispersed"],"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"}],"_meta":{"tier":2,"layer":"Society","category":"Economics","ring":1},"sema_id":"sema:Resonate#mh:SHA-256:99d9c2629e862fb9f647bb98e30eba4a47b9204bea6e61f79709b65f8fac55b4","sema_ref":"Resonate#99d9","sema_stub":"99d9","sema_layer":"Society","sema_category":"Economics"},"layer":"Society","category":"Economics"}},{"id":"8e07018e-1469-450c-9b89-eb724a87e1dd","text":"Action Causality: Response(t+1) must be function of Stimulus(t)","type":"INVARIANT","layer":null,"category":null,"handle":"Action Causality: Response(t+1) must be function of Stimulus(t)","gloss":null,"stub":null,"metadata":{}},{"id":"3d963b3f-a91b-47e2-b4a4-7c8cee911ddf","text":"Shared signal medium (Environment)","type":"PRECONDITION","layer":null,"category":null,"handle":"Shared signal medium (Environment)","gloss":null,"stub":null,"metadata":{}},{"id":"23b91e44-14bb-4f9d-a579-70062ecebb04","text":"Local alignment cluster formed OR dispersed","type":"POSTCONDITION","layer":null,"category":null,"handle":"Local alignment cluster formed OR dispersed","gloss":null,"stub":null,"metadata":{}},{"id":"SunkCostIgnore","text":"SunkCostIgnore#4dc3","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"SunkCostIgnore#4dc3","gloss":"Rationality over historical investment","stub":"4dc3","metadata":{"pattern":{"handle":"SunkCostIgnore","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 {{opportunity_cost}}.","gloss":"Rationality over historical investment","failure_modes":["Loss Aversion {{loop}}: The agent re-frames stopping as a loss rather than a saving, preventing the fresh slate evaluation."],"invariants":["{{decision}} based ONLY on future utility","Past investment excluded from calc"],"preconditions":["{{decision}} point","History of investment"],"postconditions":["Rational choice made"],"_meta":{"tier":1,"layer":"Mind","category":"Strategy","ring":0},"sema_id":"sema:SunkCostIgnore#mh:SHA-256:4dc35c44a5267415e5ddb5e07a802229242be890db74b697881178da91ccad8f","sema_ref":"SunkCostIgnore#4dc3","sema_stub":"4dc3","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"b36a6380-04a3-4d31-bd0f-548bae175e45","text":"{{decision}} based ONLY on future utility","type":"INVARIANT","layer":null,"category":null,"handle":"{{decision}} based ONLY on future utility","gloss":null,"stub":null,"metadata":{}},{"id":"7ef5a1bd-8dce-468c-9714-2d76b88a993b","text":"Past investment excluded from calc","type":"INVARIANT","layer":null,"category":null,"handle":"Past investment excluded from calc","gloss":null,"stub":null,"metadata":{}},{"id":"0ad61d4c-46e4-4cdb-b529-fd9cfaf9c06e","text":"{{decision}} point","type":"PRECONDITION","layer":null,"category":null,"handle":"{{decision}} point","gloss":null,"stub":null,"metadata":{}},{"id":"ba2a2fd8-aad0-4ccd-bc1e-33b261b80fa6","text":"History of investment","type":"PRECONDITION","layer":null,"category":null,"handle":"History of investment","gloss":null,"stub":null,"metadata":{}},{"id":"08f7ba8d-3343-4c5d-995d-89fe5323b280","text":"Rational choice made","type":"POSTCONDITION","layer":null,"category":null,"handle":"Rational choice made","gloss":null,"stub":null,"metadata":{}},{"id":"Defer","text":"Defer#6460","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"Defer#6460","gloss":"Postponing decisions until more information available","stub":"6460","metadata":{"pattern":{"handle":"Defer","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}} to re-insert the task into the queue once the waiting condition is met.","gloss":"Postponing decisions until more information available","failure_modes":["{{decision}} Debt: Deferred choices accumulate until deadline forces rushed, poor decisions."],"invariants":["Deferral must have information value.","{{state}} Preservation: {{context}} must be saved for resumption","Trigger Definition: WakeUpCondition must be explicit"],"preconditions":["{{task}} is not urgent"],"postconditions":["{{task}} queued"],"_meta":{"tier":1,"layer":"Mind","category":"Strategy","ring":2},"sema_id":"sema:Defer#mh:SHA-256:6460dcc0c5f0fd94cc3bcb7ff9bb4fe5eee0b5e1d3ea588b73f762bd4843a6b3","sema_ref":"Defer#6460","sema_stub":"6460","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"0af81ff7-1efc-4c82-8f1b-6ae7cbafa8ac","text":"Deferral must have information value.","type":"INVARIANT","layer":null,"category":null,"handle":"Deferral must have information value.","gloss":null,"stub":null,"metadata":{}},{"id":"2492df89-561f-4659-a26c-197b23ea5185","text":"{{state}} Preservation: {{context}} must be saved for resumption","type":"INVARIANT","layer":null,"category":null,"handle":"{{state}} Preservation: {{context}} must be saved for resumption","gloss":null,"stub":null,"metadata":{}},{"id":"3a424a06-45a3-4b92-bcaa-58cbea96adba","text":"Trigger Definition: WakeUpCondition must be explicit","type":"INVARIANT","layer":null,"category":null,"handle":"Trigger Definition: WakeUpCondition must be explicit","gloss":null,"stub":null,"metadata":{}},{"id":"c4328bec-d540-4187-9db0-7e242493a6e4","text":"{{task}} is not urgent","type":"PRECONDITION","layer":null,"category":null,"handle":"{{task}} is not urgent","gloss":null,"stub":null,"metadata":{}},{"id":"9c752d4c-95a2-48d4-92ae-eeaefd745003","text":"{{task}} queued","type":"POSTCONDITION","layer":null,"category":null,"handle":"{{task}} queued","gloss":null,"stub":null,"metadata":{}},{"id":"Eliminate","text":"Eliminate#43ea","type":"PATTERN","layer":"Mind","category":"Reasoning","handle":"Eliminate#43ea","gloss":"Sherlock Holmes deduction via falsification","stub":"43ea","metadata":{"pattern":{"handle":"Eliminate","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}} to order falsification tests by cost/efficiency before executing them.","gloss":"Sherlock Holmes deduction via falsification","failure_modes":["Premature Exclusion: Eliminating the true cause because of a faulty test, leaving an empty set."],"invariants":["{{option}} set must be exhaustive at start."],"preconditions":["{{option}} set exhaustive. Falsification tests available. At least one option must survive."],"postconditions":["Remaining options equally valid. Eliminated options have falsifying evidence. Search space reduced."],"_meta":{"tier":1,"layer":"Mind","category":"Reasoning","ring":2},"sema_ref":"Eliminate#43ea","sema_id":"sema:Eliminate#mh:SHA-256:43ea687e3560a55f221807138469697a6f331e687fa542c66ddf4d97f07174b0","sema_stub":"43ea","sema_layer":"Mind","sema_category":"Reasoning"},"layer":"Mind","category":"Reasoning"}},{"id":"c55f1ac2-6a76-40d3-a349-6398e17d50ad","text":"{{option}} set must be exhaustive at start.","type":"INVARIANT","layer":null,"category":null,"handle":"{{option}} set must be exhaustive at start.","gloss":null,"stub":null,"metadata":{}},{"id":"c23e7b0b-69f8-4b96-8350-47e214216e27","text":"{{option}} set exhaustive. Falsification tests available. At least one option must survive.","type":"PRECONDITION","layer":null,"category":null,"handle":"{{option}} set exhaustive. Falsification tests available. At least one option must survive.","gloss":null,"stub":null,"metadata":{}},{"id":"3bd04fe7-9147-4514-b971-acafb1a88296","text":"Remaining options equally valid. Eliminated options have falsifying evidence. Search space reduced.","type":"POSTCONDITION","layer":null,"category":null,"handle":"Remaining options equally valid. Eliminated options have falsifying evidence. Search space reduced.","gloss":null,"stub":null,"metadata":{}},{"id":"ConstraintRelax","text":"ConstraintRelax#384d","type":"PATTERN","layer":"Society","category":"Protocols","handle":"ConstraintRelax#384d","gloss":"Escaping local optima by loosening bounds","stub":"384d","metadata":{"pattern":{"handle":"ConstraintRelax","mechanism":"Boundary Softening: When stuck, list all constraints. {{rank}} by actual importance vs assumed importance. Temporarily remove lowest-ranked constraint. Solve relaxed problem. {{check}} if {{solution}} can be adapted to respect original constraint. It performs the relaxation experiment within a {{bubble}} to verify the solution's viability before altering real production constraints.","gloss":"Escaping local optima by loosening bounds","failure_modes":["{{constraint}} Collapse: Relaxing too many constraints produces invalid or meaningless solutions."],"invariants":["{{solution}} must be checked against original constraints."],"_meta":{"tier":2,"layer":"Society","category":"Protocols","ring":2},"sema_layer":"Society","sema_category":"Protocols","sema_id":"sema:ConstraintRelax#mh:SHA-256:384d442837c23564ac4cb219e071c691e59f2e2ca3f181d2e4bae9d7caa5694f","sema_ref":"ConstraintRelax#384d","sema_stub":"384d"},"layer":"Society","category":"Protocols"}},{"id":"e7b9d500-23ad-4313-8615-233d97df06eb","text":"{{solution}} must be checked against original constraints.","type":"INVARIANT","layer":null,"category":null,"handle":"{{solution}} must be checked against original constraints.","gloss":null,"stub":null,"metadata":{}},{"id":"Invert","text":"Invert#d1b9","type":"PATTERN","layer":"Mind","category":"Reasoning","handle":"Invert#d1b9","gloss":"Solution discovery via negation","stub":"d1b9","metadata":{"pattern":{"handle":"Invert","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}}s for original {{problem}}. Often reveals blind spots. It applies {{reframe}} by negating the goal {{state}}, solving for failure to identify necessary conditions for success.","gloss":"Solution discovery via negation","failure_modes":["False Dichotomy: Assuming the opposite of Failure is Success (it might just be Mediocrity)."],"invariants":["Inversion must be logical negation, not just opposite.","Double Negation: Invert(Invert(X)) implies X."],"_meta":{"tier":2,"layer":"Mind","category":"Reasoning","ring":2},"sema_layer":"Mind","sema_category":"Reasoning","sema_id":"sema:Invert#mh:SHA-256:d1b9169d5b598e4f7f3d4d58bc2feea0f45c7830b32445fa6ab2666db271fa42","sema_ref":"Invert#d1b9","sema_stub":"d1b9"},"layer":"Mind","category":"Reasoning"}},{"id":"18b5cbc8-497d-4c08-baac-0e3ef3734054","text":"Inversion must be logical negation, not just opposite.","type":"INVARIANT","layer":null,"category":null,"handle":"Inversion must be logical negation, not just opposite.","gloss":null,"stub":null,"metadata":{}},{"id":"3d2f5837-b6ac-4b5d-b5d0-7e0c2edb11fd","text":"Double Negation: Invert(Invert(X)) implies X.","type":"INVARIANT","layer":null,"category":null,"handle":"Double Negation: Invert(Invert(X)) implies X.","gloss":null,"stub":null,"metadata":{}},{"id":"MechanisticDesignProposal","text":"MechanisticDesignProposal#8cf7","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"MechanisticDesignProposal#8cf7","gloss":"Dialectic blueprint of a system mechanism with temporal projections","stub":"8cf7","metadata":{"pattern":{"handle":"MechanisticDesignProposal","mechanism":"A structured blueprint for a systemic {{solution}} that addresses a {{problem}} in a {{system}}. 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.","gloss":"Dialectic blueprint of a system mechanism with temporal 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."],"_meta":{"tier":2,"layer":"Infrastructure","category":"Data Structures","ring":1},"data_schema":{"type":"object","required":["label","design_principles","core_mechanism","how_it_works","what_is_new","why_it_works","why_it_fails","medium_term","long_term_vision"],"properties":{"label":{"type":"string","description":"A concise, evocative name for the solution (e.g., 'Parametric Storm-Trigger Retirement')"},"design_principles":{"type":"string","description":"The guiding philosophy behind the design. What mental model or heuristic drives this solution?"},"core_mechanism":{"type":"string","description":"The specific leverage point and causal chain. What is the ONE thing that makes this work?"},"how_it_works":{"type":"string","description":"Concrete operational description. Step-by-step: what happens when this is deployed?"},"what_is_new":{"type":"string","description":"The novel contribution. What does this do that existing solutions cannot? Why hasn't this been done before?"},"why_it_works":{"type":"string","description":"The dialectic defense. Steel-man argument for why this mechanism will succeed."},"why_it_fails":{"type":"string","description":"The dialectic attack. Pre-mortem: what are the failure modes, risks, and unintended consequences?"},"medium_term":{"type":"string","description":"Implementation trajectory for 1-3 years. What does adoption look like? What ecosystem changes occur?"},"long_term_vision":{"type":"string","description":"The end-state aspiration. If this succeeds fully, what does the world look like in 10+ years?"}}},"sema_ref":"MechanisticDesignProposal#8cf7","sema_id":"sema:MechanisticDesignProposal#mh:SHA-256:8cf72275c6678ea0c57d497fff459f6f9c5259330524fe8f9bb3af63b7df9c06","sema_stub":"8cf7","sema_layer":"Infrastructure","sema_category":"Data Structures"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"fade2848-81e5-4c06-b31b-b72d984ac620","text":"Dialectic Balance: 'why_it_fails' must be as detailed as 'why_it_works'.","type":"INVARIANT","layer":null,"category":null,"handle":"Dialectic Balance: 'why_it_fails' must be as detailed as 'why_it_works'.","gloss":null,"stub":null,"metadata":{}},{"id":"0ca2775c-1294-4175-812a-9d69e4439fc1","text":"Causal Clarity: Must define the mechanism of action (how A causes B).","type":"INVARIANT","layer":null,"category":null,"handle":"Causal Clarity: Must define the mechanism of action (how A causes B).","gloss":null,"stub":null,"metadata":{}},{"id":"2b470a3d-4102-41cc-ab03-b2d5af1a3bd6","text":"Novelty Requirement: 'what_is_new' must identify the unique contribution.","type":"INVARIANT","layer":null,"category":null,"handle":"Novelty Requirement: 'what_is_new' must identify the unique contribution.","gloss":null,"stub":null,"metadata":{}},{"id":"f3677c49-fe65-4cbe-aaaf-6e5f5bd07a8f","text":"Temporal Completeness: Must include both medium_term and long_term_vision.","type":"INVARIANT","layer":null,"category":null,"handle":"Temporal Completeness: Must include both medium_term and long_term_vision.","gloss":null,"stub":null,"metadata":{}},{"id":"Optimize","text":"Optimize#3075","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"Optimize#3075","gloss":"Maximize utility against a metric","stub":"3075","metadata":{"pattern":{"handle":"Optimize","mechanism":"The iterative process of adjusting parameters or structure to maximize (or minimize) a specific Objective Function defined by a {{metric}}. It involves generating candidate {{solution}}s, evaluating them against the metric, and selecting the best. It can be Local (Gradient Descent) or {{global}} (Evolutionary).","gloss":"Maximize utility against a metric","failure_modes":["Overfitting: {{solution}} works perfectly on test data but fails in reality.","Goodhart's Law: Optimizing for a proxy {{metric}} destroys the actual value.","Local Optima: Getting stuck in a 'good enough' state that prevents finding the best state.","Premature Optimization: Optimizing before the problem is fully understood."],"invariants":["Monotonicity: Each step (or epoch) should ideally improve (or not degrade) the best-known {{solution}}.","Measurability: The Objective Function must be quantifiable via a {{metric}}."],"preconditions":["Objective Function is defined","Candidate space is explorable","Baseline {{metric}} is known"],"postconditions":["Best Candidate {{solution}} found","{{metric}} improved over Baseline"],"_meta":{"tier":1,"layer":"Mind","category":"Strategy","related":["EvaluatorOptimizer","RegretMinimization","ParetoFront"],"ring":1},"sema_id":"sema:Optimize#mh:SHA-256:30759374ede0314268d795a5a9878ac68876d0695c4ce0847e615da2b9fedf32","sema_ref":"Optimize#3075","sema_stub":"3075","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"bee5882f-5e0b-49c7-9d8b-f40d4fd64e28","text":"Monotonicity: Each step (or epoch) should ideally improve (or not degrade) the best-known {{solution}}.","type":"INVARIANT","layer":null,"category":null,"handle":"Monotonicity: Each step (or epoch) should ideally improve (or not degrade) the best-known {{solution}}.","gloss":null,"stub":null,"metadata":{}},{"id":"ab8eae2a-1182-4cdb-a7af-fdef1d1e3717","text":"Measurability: The Objective Function must be quantifiable via a {{metric}}.","type":"INVARIANT","layer":null,"category":null,"handle":"Measurability: The Objective Function must be quantifiable via a {{metric}}.","gloss":null,"stub":null,"metadata":{}},{"id":"71e08c39-df55-49a6-b210-f2f4812cc139","text":"Objective Function is defined","type":"PRECONDITION","layer":null,"category":null,"handle":"Objective Function is defined","gloss":null,"stub":null,"metadata":{}},{"id":"870ad20c-8248-47fd-aa63-38c6ebe61bf1","text":"Candidate space is explorable","type":"PRECONDITION","layer":null,"category":null,"handle":"Candidate space is explorable","gloss":null,"stub":null,"metadata":{}},{"id":"9d09430b-5d44-47d0-bf85-52ed9f7b185b","text":"Baseline {{metric}} is known","type":"PRECONDITION","layer":null,"category":null,"handle":"Baseline {{metric}} is known","gloss":null,"stub":null,"metadata":{}},{"id":"506e4154-526c-4988-8400-eef95d4391a0","text":"Best Candidate {{solution}} found","type":"POSTCONDITION","layer":null,"category":null,"handle":"Best Candidate {{solution}} found","gloss":null,"stub":null,"metadata":{}},{"id":"196b0d42-e8cb-42a4-b411-2f22883c3edf","text":"{{metric}} improved over Baseline","type":"POSTCONDITION","layer":null,"category":null,"handle":"{{metric}} improved over Baseline","gloss":null,"stub":null,"metadata":{}},{"id":"OutputGuard","text":"OutputGuard#eb44","type":"PATTERN","layer":"Infrastructure","category":"Verification","handle":"OutputGuard#eb44","gloss":"Final egress filter for safety and privacy","stub":"eb44","metadata":{"pattern":{"handle":"OutputGuard","mechanism":"Post-generation content filter. Scans candidate {{solution}} 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.","gloss":"Final egress filter for safety and privacy","failure_modes":["Scunthorpe {{problem}}: Over-censorship blocking valid words containing restricted substrings.","{{context}} Blindness: Guard blocks necessary medical terms misclassified as toxicity.","Redaction Leak: [REDACTED] markers revealing the location/length of hidden secrets."],"invariants":["Fail-Safe: If Scanner fails (timeout/error), Output is BLOCKED (not passed).","Privacy First: If PII detected, Redaction is mandatory."],"preconditions":["Candidate solution generated","Safety policies active"],"postconditions":["Safe output delivered OR Block signal returned"],"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"}],"_meta":{"tier":2,"layer":"Infrastructure","category":"Verification","ring":0},"sema_layer":"Infrastructure","sema_category":"Verification","sema_id":"sema:OutputGuard#mh:SHA-256:eb44b7e751219a94f752bb8827843ede1045bc1a4195d9d0db3648f9ae097bb0","sema_ref":"OutputGuard#eb44","sema_stub":"eb44"},"layer":"Infrastructure","category":"Verification"}},{"id":"d67b6c42-3581-40e6-94e9-3140840728d9","text":"Fail-Safe: If Scanner fails (timeout/error), Output is BLOCKED (not passed).","type":"INVARIANT","layer":null,"category":null,"handle":"Fail-Safe: If Scanner fails (timeout/error), Output is BLOCKED (not passed).","gloss":null,"stub":null,"metadata":{}},{"id":"d781c6a6-abaa-4087-bdbd-9c4160f6c52d","text":"Privacy First: If PII detected, Redaction is mandatory.","type":"INVARIANT","layer":null,"category":null,"handle":"Privacy First: If PII detected, Redaction is mandatory.","gloss":null,"stub":null,"metadata":{}},{"id":"e1ba3b53-faa4-4652-9cf3-c808dbd99280","text":"Candidate solution generated","type":"PRECONDITION","layer":null,"category":null,"handle":"Candidate solution generated","gloss":null,"stub":null,"metadata":{}},{"id":"cceb4a0c-4081-4992-9082-40beb91871ad","text":"Safety policies active","type":"PRECONDITION","layer":null,"category":null,"handle":"Safety policies active","gloss":null,"stub":null,"metadata":{}},{"id":"06b36aa9-05a4-4069-98bd-516478c90735","text":"Safe output delivered OR Block signal returned","type":"POSTCONDITION","layer":null,"category":null,"handle":"Safe output delivered OR Block signal returned","gloss":null,"stub":null,"metadata":{}},{"id":"ProblemSpace","text":"ProblemSpace#78da","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"ProblemSpace#78da","gloss":"Bounded domain of a problem","stub":"78da","metadata":{"pattern":{"handle":"ProblemSpace","mechanism":"A defined region of the problem landscape, bounded by {{constraint}}s and initial {{state}}. It represents the domain within which a solver must operate to find a valid {{solution}}.","gloss":"Bounded domain of a problem","invariants":["Boundedness: Must have defined constraints.","Consistency: The space must not contain contradictory definitions."],"_meta":{"tier":1,"layer":"Infrastructure","category":"Data Structures","ring":0},"data_schema":{"type":"object","required":["boundaries","variables"],"properties":{"domain":{"type":"string"},"boundaries":{"type":"array","items":{"type":"string"},"description":"Hard constraints (e.g. Physics, Law)"},"variables":{"type":"array","items":{"type":"string"},"description":"Degrees of freedom available to change"},"constants":{"type":"object","description":"Immutable facts"}}},"sema_ref":"ProblemSpace#78da","sema_id":"sema:ProblemSpace#mh:SHA-256:78da7fef93c3a5e6a7728d30afcb0e8e9270493b23b36bd83acf2ee6977271d1","sema_stub":"78da","sema_layer":"Infrastructure","sema_category":"Data Structures"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"5e847278-3e2f-42f4-8ab7-03aec81382f4","text":"Boundedness: Must have defined constraints.","type":"INVARIANT","layer":null,"category":null,"handle":"Boundedness: Must have defined constraints.","gloss":null,"stub":null,"metadata":{}},{"id":"f9b50d52-acff-475b-b783-0c313d0735d2","text":"Consistency: The space must not contain contradictory definitions.","type":"INVARIANT","layer":null,"category":null,"handle":"Consistency: The space must not contain contradictory definitions.","gloss":null,"stub":null,"metadata":{}},{"id":"Result","text":"Result#8ed9","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Result#8ed9","gloss":"The output of agentic transformation","stub":"8ed9","metadata":{"pattern":{"handle":"Result","mechanism":"The canonical output of an operation (often a {{solution}}). It encapsulates success/failure status, the artifact produced, and associated {{metric}}s such as time taken, resources consumed, and confidence score. It serves as the bridge between execution and evaluation.","gloss":"The output of agentic transformation","failure_modes":["Partial Result: Output is incomplete but presented as complete.","Hallucinated Result: Output claims to solve the task but doesn't.","Unvalidated Result: Result bypasses checking."],"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."],"_meta":{"layer":"Infrastructure","category":"Data Structures","tier":1,"ring":0},"sema_id":"sema:Result#mh:SHA-256:8ed9ca66a8508e8603e8da74b545f03b832f7e8b8d4e2fd56c496dcc29afb2ef","sema_ref":"Result#8ed9","sema_stub":"8ed9","sema_layer":"Infrastructure","sema_category":"Data Structures","data_schema":{"type":"object","required":["task_id","output","status"],"properties":{"task_id":{"type":"string","description":"The task this result satisfies"},"status":{"type":"string","enum":["Success","Partial","Failure"]},"output":{"description":"The actual artifact or data produced"},"confidence_score":{"type":"number","minimum":0.0,"maximum":1.0},"provenance_trace":{"type":"array","items":{"type":"string"},"description":"List of step IDs that generated this result"},"metrics":{"type":"object","description":"Performance metrics (latency, cost)"}}}},"layer":"Infrastructure","category":"Data Structures"}},{"id":"74ff8279-1c5a-45bf-b9e2-a2c26a990134","text":"Immutability: Once yielded, a Result cannot be modified (only superseded).","type":"INVARIANT","layer":null,"category":null,"handle":"Immutability: Once yielded, a Result cannot be modified (only superseded).","gloss":null,"stub":null,"metadata":{}},{"id":"7dc9b6a4-2a34-40e4-86df-d977ff843ceb","text":"Measurability: Resource consumption must be recorded.","type":"INVARIANT","layer":null,"category":null,"handle":"Measurability: Resource consumption must be recorded.","gloss":null,"stub":null,"metadata":{}},{"id":"SemanticTabu","text":"SemanticTabu#82dd","type":"PATTERN","layer":"Mind","category":"Inference","handle":"SemanticTabu#82dd","gloss":"Constraint-based novelty enforcement","stub":"82dd","metadata":{"pattern":{"handle":"SemanticTabu","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}} to ensure the entire swarm respects the constraint.","gloss":"Constraint-based novelty enforcement","failure_modes":["paralysis (if the Tabu list covers all possible physics)."],"invariants":["{{constraint}} Satisfaction: Output ∩ TabuList == Ø","Explicit Avoidance: Reasoning trace must cite what is being avoided"],"preconditions":["Known solutions exist"],"postconditions":["{{solution}} is structurally distinct from Clichés"],"_meta":{"tier":1,"layer":"Mind","category":"Inference","ring":0},"sema_id":"sema:SemanticTabu#mh:SHA-256:82dd562ed60295db85be7b4dee32caf80fea5c78f6b3930c7f316f2a693e9176","sema_ref":"SemanticTabu#82dd","sema_stub":"82dd","sema_layer":"Mind","sema_category":"Inference"},"layer":"Mind","category":"Inference"}},{"id":"72950d6d-b7bc-49f0-b7c9-2b76b167f912","text":"{{constraint}} Satisfaction: Output ∩ TabuList == Ø","type":"INVARIANT","layer":null,"category":null,"handle":"{{constraint}} Satisfaction: Output ∩ TabuList == Ø","gloss":null,"stub":null,"metadata":{}},{"id":"a477531b-b2db-48dc-85eb-97337d287633","text":"Explicit Avoidance: Reasoning trace must cite what is being avoided","type":"INVARIANT","layer":null,"category":null,"handle":"Explicit Avoidance: Reasoning trace must cite what is being avoided","gloss":null,"stub":null,"metadata":{}},{"id":"cf229107-d261-48fa-9d20-b86bfc43d0b7","text":"Known solutions exist","type":"PRECONDITION","layer":null,"category":null,"handle":"Known solutions exist","gloss":null,"stub":null,"metadata":{}},{"id":"5f2d73fd-f95b-4cfb-9501-7f07cee81ffe","text":"{{solution}} is structurally distinct from Clichés","type":"POSTCONDITION","layer":null,"category":null,"handle":"{{solution}} is structurally distinct from Clichés","gloss":null,"stub":null,"metadata":{}},{"id":"Solver","text":"Solver#1c9b","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"Solver#1c9b","gloss":"Abstract interface for transforming Tasks into Solutions","stub":"1c9b","metadata":{"pattern":{"handle":"Solver","mechanism":"The abstract role (or {{protocol}}) of any agent or process that accepts a {{task}} and produces a {{solution}}. A Solver is the fundamental unit of work execution in the system, adhering to the input/output contract defined by the Task protocol.","gloss":"Abstract interface for transforming Tasks into Solutions","signature":["Protocol(Task)"],"_meta":{"layer":"Mind","ring":0,"category":"Strategy","tier":0},"sema_id":"sema:Solver#mh:SHA-256:1c9beeb5cffc0c686b5291439d830a2104225589f91a66bd0a83038f1a0a8982","sema_ref":"Solver#1c9b","sema_stub":"1c9b","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"WhyClimb","text":"WhyClimb#156a","type":"PATTERN","layer":"Mind","category":"Reasoning","handle":"WhyClimb#156a","gloss":"Recursive problem abstraction","stub":"156a","metadata":{"pattern":{"handle":"WhyClimb","mechanism":"A root-cause analysis protocol where the agent iteratively asks 'Why is this a problem?' to {{reframe}} the {{problem}} 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 {{recursive_root_cause}}.","gloss":"Recursive problem abstraction","failure_modes":["Climbing too high (solving 'Entropy' instead of 'Fix Bug')."],"invariants":["Ascension: Scope(Level N+1) > Scope(Level N)","Stop {{condition}}: Halt when 'Why' leads to a value judgment or physics constraint"],"preconditions":["{{problem}} is well-formed"],"postconditions":["{{solution}} space expanded"],"_meta":{"tier":1,"layer":"Mind","category":"Reasoning","ring":2},"sema_id":"sema:WhyClimb#mh:SHA-256:156aa8762c7c0007b72d0869b470c7c9d31aaf19d0815e51b9bce872d925db4f","sema_ref":"WhyClimb#156a","sema_stub":"156a","sema_layer":"Mind","sema_category":"Reasoning","signature":["Reframe(Problem)"]},"layer":"Mind","category":"Reasoning"}},{"id":"4de7ecbf-f416-4ae6-89d5-e2f5447203aa","text":"Ascension: Scope(Level N+1) > Scope(Level N)","type":"INVARIANT","layer":null,"category":null,"handle":"Ascension: Scope(Level N+1) > Scope(Level N)","gloss":null,"stub":null,"metadata":{}},{"id":"6f539084-4324-4de0-b83e-0753369d7d8e","text":"Stop {{condition}}: Halt when 'Why' leads to a value judgment or physics constraint","type":"INVARIANT","layer":null,"category":null,"handle":"Stop {{condition}}: Halt when 'Why' leads to a value judgment or physics constraint","gloss":null,"stub":null,"metadata":{}},{"id":"e8c86d47-d179-4d45-a352-40a67d892c42","text":"{{problem}} is well-formed","type":"PRECONDITION","layer":null,"category":null,"handle":"{{problem}} is well-formed","gloss":null,"stub":null,"metadata":{}},{"id":"dbeecb47-562a-4b9c-b092-0def99318db3","text":"{{solution}} space expanded","type":"POSTCONDITION","layer":null,"category":null,"handle":"{{solution}} space expanded","gloss":null,"stub":null,"metadata":{}},{"id":"Summarize","text":"Summarize#6a00","type":"PATTERN","layer":"Mind","category":"Reasoning","handle":"Summarize#6a00","gloss":"Lossy compression preserving salience","stub":"6a00","metadata":{"pattern":{"handle":"Summarize","mechanism":"The cognitive process of {{compress}}ing a large {{datum}} or {{artifact}} into a smaller {{summary}} while preserving its most high-{{value}} (salient) information. Distinct from {{translate}}, which preserves the full semantic scope. It is a lossy transformation.","gloss":"Lossy compression preserving salience","invariants":["Compression: Output size < Input size","Salience: Information Density(Output) > Information Density(Input)","Fidelity: No new information added (No hallucination)"],"_meta":{"layer":"Mind","category":"Reasoning","ring":1,"tier":1},"sema_id":"sema:Summarize#mh:SHA-256:6a000fd570638ecd8dd239be23317cf6b004e2f5ed784822f41f6658ee669c2c","sema_ref":"Summarize#6a00","sema_stub":"6a00","sema_layer":"Mind","sema_category":"Reasoning"},"layer":"Mind","category":"Reasoning"}},{"id":"09cf4271-298e-4a63-afb3-13a3f2ba38f2","text":"Compression: Output size < Input size","type":"INVARIANT","layer":null,"category":null,"handle":"Compression: Output size < Input size","gloss":null,"stub":null,"metadata":{}},{"id":"9dd8be06-981b-4bc9-ba8b-eb8230c6a87e","text":"Salience: Information Density(Output) > Information Density(Input)","type":"INVARIANT","layer":null,"category":null,"handle":"Salience: Information Density(Output) > Information Density(Input)","gloss":null,"stub":null,"metadata":{}},{"id":"d0fbe4dd-e8ec-4029-8307-23fc746911c5","text":"Fidelity: No new information added (No hallucination)","type":"INVARIANT","layer":null,"category":null,"handle":"Fidelity: No new information added (No hallucination)","gloss":null,"stub":null,"metadata":{}},{"id":"TranslationProxy","text":"TranslationProxy#f0e0","type":"PATTERN","layer":"Society","category":"Protocols","handle":"TranslationProxy#f0e0","gloss":"Protocol adaptation wrapper","stub":"f0e0","metadata":{"pattern":{"handle":"TranslationProxy","mechanism":"A stateless agent that wraps a legacy system. It intercepts 'modern' agent signals, uses {{translate}} to convert them into legacy {{protocol}} API calls, and translates responses back. It acts as a 'spacesuit' for the legacy system. Utilizes {{ontology_handshake}} and {{compare}} to verify semantic fidelity.","gloss":"Protocol adaptation wrapper","failure_modes":["Lossy translation."],"invariants":["Semantic meaning preserved across languages/ontologies","Type safety maintained"],"preconditions":["{{message}} M in {{protocol}} A","Target {{protocol}} B"],"postconditions":["{{message}} M' in {{protocol}} B"],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":1},"sema_id":"sema:TranslationProxy#mh:SHA-256:f0e0d8b01e88f45c1d6791f41ed1686a96e40fc48f541c31568d48bb83ad988e","sema_ref":"TranslationProxy#f0e0","sema_stub":"f0e0","sema_layer":"Society","sema_category":"Protocols","signature":["Translate(Protocol)"]},"layer":"Society","category":"Protocols"}},{"id":"90169665-097a-4363-b79a-e0c00121506d","text":"Semantic meaning preserved across languages/ontologies","type":"INVARIANT","layer":null,"category":null,"handle":"Semantic meaning preserved across languages/ontologies","gloss":null,"stub":null,"metadata":{}},{"id":"bc7fa9fa-ca56-4711-97af-0af8d1bf5d65","text":"Type safety maintained","type":"INVARIANT","layer":null,"category":null,"handle":"Type safety maintained","gloss":null,"stub":null,"metadata":{}},{"id":"86600ee9-9224-4f52-9710-bd3f8f68d353","text":"{{message}} M in {{protocol}} A","type":"PRECONDITION","layer":null,"category":null,"handle":"{{message}} M in {{protocol}} A","gloss":null,"stub":null,"metadata":{}},{"id":"169a5f31-c853-4b2c-af49-00fdaf4690e9","text":"Target {{protocol}} B","type":"PRECONDITION","layer":null,"category":null,"handle":"Target {{protocol}} B","gloss":null,"stub":null,"metadata":{}},{"id":"572ab8e1-6d72-4d80-8f71-fc659adcc48e","text":"{{message}} M' in {{protocol}} B","type":"POSTCONDITION","layer":null,"category":null,"handle":"{{message}} M' in {{protocol}} B","gloss":null,"stub":null,"metadata":{}},{"id":"EbbFlowSync","text":"EbbFlowSync#49e0","type":"PATTERN","layer":"Society","category":"Protocols","handle":"EbbFlowSync#49e0","gloss":"Cyclical connectivity modes","stub":"49e0","metadata":{"pattern":{"handle":"EbbFlowSync","mechanism":"{{system}} 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}} to dampen the transition between connected (Flow) and disconnected (Ebb) states.","gloss":"Cyclical connectivity modes","failure_modes":["Clock drift causes agents to miss the High Tide window."],"invariants":["Phase {{lock}}: All agents must be in same phase (Ebb or Flow) at time T","Tide {{transition}}: Flow cannot start until Ebb reconciliation is complete"],"preconditions":["{{global}} clock synchronization < Delta"],"postconditions":["{{state}} is consistent up to last High Tide"],"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"}],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":0},"sema_id":"sema:EbbFlowSync#mh:SHA-256:49e074204bb067c6f1aedc7c19bd5c07f052f4d3978f7459692ce90de1d1b533","sema_ref":"EbbFlowSync#49e0","sema_stub":"49e0","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"1f6f5b25-4dc0-4ff6-928f-2cde3c11b697","text":"Phase {{lock}}: All agents must be in same phase (Ebb or Flow) at time T","type":"INVARIANT","layer":null,"category":null,"handle":"Phase {{lock}}: All agents must be in same phase (Ebb or Flow) at time T","gloss":null,"stub":null,"metadata":{}},{"id":"e08fce8f-f19e-451a-8778-66b11f7adcdf","text":"Tide {{transition}}: Flow cannot start until Ebb reconciliation is complete","type":"INVARIANT","layer":null,"category":null,"handle":"Tide {{transition}}: Flow cannot start until Ebb reconciliation is complete","gloss":null,"stub":null,"metadata":{}},{"id":"59b70e5a-6901-4b4a-993f-457ff4102f8b","text":"{{global}} clock synchronization < Delta","type":"PRECONDITION","layer":null,"category":null,"handle":"{{global}} clock synchronization < Delta","gloss":null,"stub":null,"metadata":{}},{"id":"b09916d1-d53c-4cd5-9460-e22a1ada8132","text":"{{state}} is consistent up to last High Tide","type":"POSTCONDITION","layer":null,"category":null,"handle":"{{state}} is consistent up to last High Tide","gloss":null,"stub":null,"metadata":{}},{"id":"Heartbeat","text":"Heartbeat#4ddc","type":"PATTERN","layer":"Physics","category":"Time","handle":"Heartbeat#4ddc","gloss":"Liveness detection via periodic signals","stub":"4ddc","metadata":{"pattern":{"handle":"Heartbeat","mechanism":"Periodic Liveness {{signal}}: An entity emits {{signal}} (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}} detector, allowing the collective to identify and prune dead nodes.","gloss":"Liveness detection via periodic signals","failure_modes":["False failure detection due to network congestion (node alive but heartbeat delayed)."],"invariants":["Missing signal implies failure","{{signal}} frequency within tolerance"],"preconditions":["Active component","{{monitor}}"],"postconditions":["Liveness confirmed"],"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"}],"_meta":{"tier":1,"layer":"Physics","category":"Time","ring":0},"sema_layer":"Physics","sema_category":"Time","sema_id":"sema:Heartbeat#mh:SHA-256:4ddcf5f4db2eae064be16c42c4c1376bb9e7cc2774b9396c47413a4bdf89dfdf","sema_ref":"Heartbeat#4ddc","sema_stub":"4ddc"},"layer":"Physics","category":"Time"}},{"id":"a48be017-d044-443f-8acf-a9271c5b3507","text":"Missing signal implies failure","type":"INVARIANT","layer":null,"category":null,"handle":"Missing signal implies failure","gloss":null,"stub":null,"metadata":{}},{"id":"63a17e14-2fc9-457a-a6f9-a6fc7457d4cd","text":"{{signal}} frequency within tolerance","type":"INVARIANT","layer":null,"category":null,"handle":"{{signal}} frequency within tolerance","gloss":null,"stub":null,"metadata":{}},{"id":"eea54974-1f54-4846-b4c0-51ee2dfbd7a8","text":"Active component","type":"PRECONDITION","layer":null,"category":null,"handle":"Active component","gloss":null,"stub":null,"metadata":{}},{"id":"4f60f072-01ff-4645-a6ec-6a661f341875","text":"{{monitor}}","type":"PRECONDITION","layer":null,"category":null,"handle":"{{monitor}}","gloss":null,"stub":null,"metadata":{}},{"id":"ab972415-aa84-489e-92af-56cb187d52cf","text":"Liveness confirmed","type":"POSTCONDITION","layer":null,"category":null,"handle":"Liveness confirmed","gloss":null,"stub":null,"metadata":{}},{"id":"RolloutWatch","text":"RolloutWatch#5b2d","type":"PATTERN","layer":"Society","category":"Protocols","handle":"RolloutWatch#5b2d","gloss":"Continuous verification of deployed state against manifest","stub":"5b2d","metadata":{"pattern":{"handle":"RolloutWatch","derived_from":"sema:Monitor","gloss":"Continuous verification of deployed state against manifest","mechanism":"The final {{state}} of workflow orchestration. It implements {{monitor}} by using {{observe}} to track the deployed {{solution}}'s performance on the {{system}} against the 'Definition of Done' defined in the {{rollout_manifest}}. If reality deviates from the plan (e.g., error rate spikes), it routes evidence back upstream via a {{monitor_report}}. It closes the feedback {{loop}}.","signature":["Observe(System, RolloutManifest)"],"invariants":["Fidelity: Metrics must accurately reflect the 'Definition of Done'.","Actionability: Alerts must be routed to an agent capable of fixing them."],"preconditions":["Rollout complete","Telemetry active"],"postconditions":["MonitorReport artifact generated"],"failure_modes":["Alert Fatigue: Too many false positives ignore real issues.","Lagging Indicators: Detecting failure after damage is done.","Silent Failure: Metrics look good but user experience is broken."],"_meta":{"tier":2,"layer":"Society","category":"Protocols","ring":1,"related":["SpotAudit","DriftWatch","Reflexion"]},"sema_ref":"RolloutWatch#5b2d","sema_id":"sema:RolloutWatch#mh:SHA-256:5b2db93248ae390eb136b9a06f21cc6f6c2a87fa676d015a2a8d0fa64c2c4dc1","sema_stub":"5b2d","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"a56322a6-b4eb-4b53-b412-79517d37ed0d","text":"Fidelity: Metrics must accurately reflect the 'Definition of Done'.","type":"INVARIANT","layer":null,"category":null,"handle":"Fidelity: Metrics must accurately reflect the 'Definition of Done'.","gloss":null,"stub":null,"metadata":{}},{"id":"d56887bd-1bcc-4945-8657-5ab0bd2e433c","text":"Actionability: Alerts must be routed to an agent capable of fixing them.","type":"INVARIANT","layer":null,"category":null,"handle":"Actionability: Alerts must be routed to an agent capable of fixing them.","gloss":null,"stub":null,"metadata":{}},{"id":"4dc89d6a-a4b8-4add-b9f8-bc12547c6d89","text":"Rollout complete","type":"PRECONDITION","layer":null,"category":null,"handle":"Rollout complete","gloss":null,"stub":null,"metadata":{}},{"id":"49c40637-bed3-4875-9810-bb9428dbbb8f","text":"Telemetry active","type":"PRECONDITION","layer":null,"category":null,"handle":"Telemetry active","gloss":null,"stub":null,"metadata":{}},{"id":"f632664d-4dff-49c9-91b0-c1f2911890b0","text":"MonitorReport artifact generated","type":"POSTCONDITION","layer":null,"category":null,"handle":"MonitorReport artifact generated","gloss":null,"stub":null,"metadata":{}},{"id":"Yield","text":"Yield#7eaf","type":"PATTERN","layer":"Society","category":"Economics","handle":"Yield#7eaf","gloss":"Enable fair resolution of genuine disagreements without defaulting to power dynamics or eternal deadlock","stub":"7eaf","metadata":{"pattern":{"handle":"Yield","mechanism":"Negotiation {{backoff}}. When `{{overlap}}` fails: 1. Agents declare 'Flex' (concession) and 'Weight' (importance). 2. {{system}} computes Yield-Ratio. 3. Lower-weighted preference cedes to higher. 4. Debt recorded in Ledger. Utilizes {{defer}}.","gloss":"Enable fair resolution of genuine disagreements without defaulting to power dynamics or eternal deadlock","failure_modes":["Weight inflation (mitigated by historical consistency tracking).","Gaming ledger with trivial yields.","Hard constraints genuinely indistinguishable from strategic intransigence.","Ledger requires persistence infrastructure."],"invariants":["Yielder cannot reclaim."],"_meta":{"tier":2,"layer":"Society","category":"Economics","ring":1},"sema_id":"sema:Yield#mh:SHA-256:7eaffd4f68072f2f82302e3d2deb33a830bc9f1148b64d705cf4d08125b248e0","sema_ref":"Yield#7eaf","sema_stub":"7eaf","sema_layer":"Society","sema_category":"Economics"},"layer":"Society","category":"Economics"}},{"id":"ebf9875c-52db-4737-961f-ab6d04794a0b","text":"Yielder cannot reclaim.","type":"INVARIANT","layer":null,"category":null,"handle":"Yielder cannot reclaim.","gloss":null,"stub":null,"metadata":{}},{"id":"MetricDissolution","text":"MetricDissolution#b840","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"MetricDissolution#b840","gloss":"Solving by deleting the problem variable","stub":"b840","metadata":{"pattern":{"handle":"MetricDissolution","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}} the need for travel'). It solves the problem by proving the constraint was an artifact of the formulation, not reality. It applies {{invert}} to question the necessity of the optimization target, often allowing the agent to {{eliminate}} the constraint entirely.","gloss":"Solving by deleting the problem variable","failure_modes":["Cheating (solving a different problem than asked)."],"invariants":["Functional Equivalence: The user's intent is met without the proxy metric","{{variable}} Reduction: Count(Variables_New) < Count(Variables_Old)"],"preconditions":["Standard optimization is hitting diminishing returns"],"postconditions":["{{problem}} complexity reduced"],"_meta":{"tier":1,"layer":"Mind","category":"Strategy","ring":2},"sema_id":"sema:MetricDissolution#mh:SHA-256:b840cc85842c1add353edfadfbd13a8059cb35a87ffd070106040b8dc414c6bb","sema_ref":"MetricDissolution#b840","sema_stub":"b840","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"3859fee0-5320-4663-97b6-bd4142ccb83e","text":"Functional Equivalence: The user's intent is met without the proxy metric","type":"INVARIANT","layer":null,"category":null,"handle":"Functional Equivalence: The user's intent is met without the proxy metric","gloss":null,"stub":null,"metadata":{}},{"id":"c8cfe497-abfb-49ba-aef3-08d44dc9cfe8","text":"{{variable}} Reduction: Count(Variables_New) < Count(Variables_Old)","type":"INVARIANT","layer":null,"category":null,"handle":"{{variable}} Reduction: Count(Variables_New) < Count(Variables_Old)","gloss":null,"stub":null,"metadata":{}},{"id":"df850811-d9ca-4e17-a219-9c53c095b993","text":"Standard optimization is hitting diminishing returns","type":"PRECONDITION","layer":null,"category":null,"handle":"Standard optimization is hitting diminishing returns","gloss":null,"stub":null,"metadata":{}},{"id":"babf5660-cc43-44cd-a036-a19d3d5d6880","text":"{{problem}} complexity reduced","type":"POSTCONDITION","layer":null,"category":null,"handle":"{{problem}} complexity reduced","gloss":null,"stub":null,"metadata":{}},{"id":"LateralOptimization","text":"LateralOptimization#5350","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"LateralOptimization#5350","gloss":"Reframe -> Optimize -> Translate loop","stub":"5350","metadata":{"pattern":{"handle":"LateralOptimization","mechanism":"A {{creative}} problem-solving loop to {{think}} and escape local optima by shifting domains. \n1. {{reframe}}: Transform the problem P into a mapped domain P' (e.g., Code -> Biological {{system}}).\n2. {{optimize}}: Solve or improve P' to get {{solution}} S' using domain-specific heuristics of the new frame to reach {{global}} maxima.\n3. {{translate}}: Map S' back to the original domain to get {{solution}} S.\nThis technique leverages the fact that different domains have different 'easy' problems and optimization landscapes.","gloss":"Reframe -> Optimize -> Translate loop","failure_modes":["Translation Loss: The metaphor breaks down, and the solution S' cannot be mapped back to S.","Hallucination: The analogy introduces features that don't exist in the original problem.","Complexity Overhead: The cost of mapping outweighs the gain in solution quality."],"invariants":["Analogy Coherence: The mapping between domains must be structurally consistent.","{{solution}} Validity: The final output must satisfy the original constraints."],"preconditions":["Hard problem (Local Optimum reached)","Available Analogy/Frame"],"postconditions":["Novel solution found","Perspective shift recorded"],"_meta":{"tier":2,"layer":"Mind","category":"Strategy","related":["AnalogyBridge"],"ring":1},"sema_id":"sema:LateralOptimization#mh:SHA-256:5350ae13501544830ea8db150d55264a15e06ac1d231c16d02207ae0b48eadba","sema_ref":"LateralOptimization#5350","sema_stub":"5350","sema_layer":"Mind","sema_category":"Strategy","signature":["Think(Creative)","Optimize(Global)"]},"layer":"Mind","category":"Strategy"}},{"id":"bc181d23-3e2e-47db-8b05-9b5a1d7d12f1","text":"Analogy Coherence: The mapping between domains must be structurally consistent.","type":"INVARIANT","layer":null,"category":null,"handle":"Analogy Coherence: The mapping between domains must be structurally consistent.","gloss":null,"stub":null,"metadata":{}},{"id":"72d3694e-edff-4779-a1c3-b42e37dd2fe2","text":"Hard problem (Local Optimum reached)","type":"PRECONDITION","layer":null,"category":null,"handle":"Hard problem (Local Optimum reached)","gloss":null,"stub":null,"metadata":{}},{"id":"8744c1bc-6202-417f-9b5d-fa6338f04ba8","text":"Available Analogy/Frame","type":"PRECONDITION","layer":null,"category":null,"handle":"Available Analogy/Frame","gloss":null,"stub":null,"metadata":{}},{"id":"9a8f3e96-ae6f-49e6-b93f-29fcd80a7585","text":"Novel solution found","type":"POSTCONDITION","layer":null,"category":null,"handle":"Novel solution found","gloss":null,"stub":null,"metadata":{}},{"id":"b4ff2f5d-c681-4787-ae21-09cc7d12dc75","text":"Perspective shift recorded","type":"POSTCONDITION","layer":null,"category":null,"handle":"Perspective shift recorded","gloss":null,"stub":null,"metadata":{}},{"id":"FailClosed","text":"FailClosed#ae79","type":"PATTERN","layer":"Society","category":"Protocols","handle":"FailClosed#ae79","gloss":"Default-deny policy for uncertain states","stub":"ae79","metadata":{"pattern":{"handle":"FailClosed","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, {{output_guard}}, and {{circuit_breaker}}, enforcing a default-deny policy on any error or ambiguity.","gloss":"Default-deny policy for uncertain states","failure_modes":["Availability Hit: {{system}} shuts down during minor outages (False Positive Denial).","Dependency Deadlock: If a non-critical dependency fails, the whole system locks up."],"invariants":["Default Deny: Ambiguity == Rejection.","Error Atomicity: Partial failure = Total failure (Transaction Rollback)."],"preconditions":["Fallible operation initiated"],"postconditions":["{{system}} state remains invariant (no side effects) OR Operation succeeds"],"parameters":[{"name":"timeout_action","type":"Enum","range":"{Reject, Retry, Fallback}","description":"Default: Reject"}],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":0},"sema_id":"sema:FailClosed#mh:SHA-256:ae79e8e091ca9f68f749936a99d55a386fba49254f9e7e958806b16b860332a1","sema_ref":"FailClosed#ae79","sema_stub":"ae79","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"60d170ab-3af6-4b01-a06f-345add6e3b3c","text":"Default Deny: Ambiguity == Rejection.","type":"INVARIANT","layer":null,"category":null,"handle":"Default Deny: Ambiguity == Rejection.","gloss":null,"stub":null,"metadata":{}},{"id":"305bf190-6b98-4950-9235-00588fc18881","text":"Error Atomicity: Partial failure = Total failure (Transaction Rollback).","type":"INVARIANT","layer":null,"category":null,"handle":"Error Atomicity: Partial failure = Total failure (Transaction Rollback).","gloss":null,"stub":null,"metadata":{}},{"id":"954b4688-cd68-48fe-a912-be8c0f94229d","text":"Fallible operation initiated","type":"PRECONDITION","layer":null,"category":null,"handle":"Fallible operation initiated","gloss":null,"stub":null,"metadata":{}},{"id":"fc4c1dc0-d352-46ed-8796-0fbe08a6b67f","text":"{{system}} state remains invariant (no side effects) OR Operation succeeds","type":"POSTCONDITION","layer":null,"category":null,"handle":"{{system}} state remains invariant (no side effects) OR Operation succeeds","gloss":null,"stub":null,"metadata":{}},{"id":"Feedback","text":"Feedback#9b5c","type":"PATTERN","layer":"Infrastructure","category":"Primitives","handle":"Feedback#9b5c","gloss":"Error correction signal","stub":"9b5c","metadata":{"pattern":{"handle":"Feedback","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}} contains a {{result}} and a {{metric}} indicating deviation ({{incongruity}}) from the expected outcome.","gloss":"Error correction signal","failure_modes":["Signal Noise: Feedback is too noisy to extract actionable information.","Delayed Feedback: Signal arrives too late to correct the error.","Misattribution: Feedback is routed to the wrong solver."],"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."],"_meta":{"layer":"Infrastructure","category":"Primitives","tier":1,"ring":0},"sema_id":"sema:Feedback#mh:SHA-256:9b5c7eee86ff79389e6fc9a4cd4e318296ff3e74e3e67514f8193a45be917e15","sema_ref":"Feedback#9b5c","sema_stub":"9b5c","sema_layer":"Infrastructure","sema_category":"Primitives","signature":["Signal(Incongruity)"]},"layer":"Infrastructure","category":"Primitives"}},{"id":"2e65db5b-adf9-435b-ab37-80d725c6b656","text":"Directionality: Feedback must indicate the direction of error, not just magnitude.","type":"INVARIANT","layer":null,"category":null,"handle":"Directionality: Feedback must indicate the direction of error, not just magnitude.","gloss":null,"stub":null,"metadata":{}},{"id":"927bc7ec-c3fe-4c7a-b071-dbef2a41aa3b","text":"Timeliness: Feedback value decays with latency.","type":"INVARIANT","layer":null,"category":null,"handle":"Timeliness: Feedback value decays with latency.","gloss":null,"stub":null,"metadata":{}},{"id":"5ad8f176-1429-4a05-89e7-2cdc4555540f","text":"Attribution: Feedback must be traceable to a specific action.","type":"INVARIANT","layer":null,"category":null,"handle":"Attribution: Feedback must be traceable to a specific action.","gloss":null,"stub":null,"metadata":{}},{"id":"Goal","text":"Goal#456a","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Goal#456a","gloss":"Specification of desired end state","stub":"456a","metadata":{"pattern":{"handle":"Goal","mechanism":"A specification of a desired end state. It defines the target that {{work}} aims to achieve and that evaluation measures against. A Goal is testable: given a {{result}}, one can determine if the Goal is satisfied. Goals can be composed (AND/OR) and prioritized.","gloss":"Specification of desired end state","failure_modes":["Goal Ambiguity: Goal admits multiple incompatible interpretations.","Goal Conflict: Multiple goals cannot all be satisfied simultaneously.","Moving Target: Goal changes during execution without proper signaling."],"invariants":["Testability: Given a Result, Goal satisfaction must be decidable.","Stability: Goal should not change during a single execution cycle."],"_meta":{"layer":"Infrastructure","category":"Data Structures","tier":1,"ring":0},"sema_id":"sema:Goal#mh:SHA-256:456a8a283dc469d46b3307147a853e4be7d07f0d6c4477d789b8ab14aa33b02a","sema_ref":"Goal#456a","sema_stub":"456a","sema_layer":"Infrastructure","sema_category":"Data Structures","data_schema":{"type":"object","required":["goal_statement","success_criteria"],"properties":{"goal_statement":{"type":"string","description":"The desired end state"},"success_criteria":{"type":"array","items":{"type":"string"},"description":"Binary conditions that define completion"},"priority":{"type":"integer","minimum":0,"maximum":100},"metric_target":{"type":"object","properties":{"metric_name":{"type":"string"},"target_value":{"type":"number"},"comparator":{"type":"string","enum":[">","<",">=","<=","="]}}}}}},"layer":"Infrastructure","category":"Data Structures"}},{"id":"25cb8cba-315a-4827-b9c8-7fa259f2f527","text":"Testability: Given a Result, Goal satisfaction must be decidable.","type":"INVARIANT","layer":null,"category":null,"handle":"Testability: Given a Result, Goal satisfaction must be decidable.","gloss":null,"stub":null,"metadata":{}},{"id":"a797e92e-ceb8-4cd9-8e91-14983acfa6da","text":"Stability: Goal should not change during a single execution cycle.","type":"INVARIANT","layer":null,"category":null,"handle":"Stability: Goal should not change during a single execution cycle.","gloss":null,"stub":null,"metadata":{}},{"id":"Bid","text":"Bid#cf07","type":"PATTERN","layer":"Society","category":"Economics","handle":"Bid#cf07","gloss":"Binding offer from solver to execute task","stub":"cf07","metadata":{"pattern":{"handle":"Bid","data_schema":{"type":"object","required":["issuer_id","terms","signature"],"properties":{"issuer_id":{"type":"string","description":"Identity of the Solver making the bid"},"beneficiary_id":{"type":"string","description":"Identity of the Task issuer"},"terms":{"type":"object","description":"Cost, confidence, and capability claims","properties":{"expected_cost":{"type":"number","description":"Expected Value Cost (Time/Tokens/USD)"},"confidence_interval":{"type":"array","description":"Probability range of success [low, high]"},"capability_match":{"type":"array","description":"Which parts of the task the solver can handle"}}},"signature":{"type":"string","description":"Cryptographic proof of commitment"}}},"mechanism":"A binding offer {{artifact}} from a {{solver}} to execute a {{task}}. It declares: 1. Expected {{value}} Cost (Time/Tokens/USD), 2. Confidence Interval (probability of success), 3. Capability Match (which parts of the {{task}} the {{solver}} can handle). It serves as the input for the {{compute_budget}} Go/No-Go decision. A Bid is a commitment: {{solver}}s cannot exceed bid cost without explicit renegotiation.","gloss":"Binding offer from solver to execute task","signature":["Artifact(Value)"],"failure_modes":["Underestimation: Bid is too optimistic, leading to {{budget}} overrun.","Overestimation: Bid is too pessimistic, causing rejection of viable work.","Capability Mismatch: {{solver}} claims abilities it doesn't have.","Confidence Theater: Stated confidence doesn't reflect actual uncertainty."],"invariants":["Binding: {{solver}} cannot exceed Bid cost without requesting {{budget}} expansion.","Pre-Execution: Must be generated before work begins.","Verifiable: Bid components must be objectively measurable post-hoc."],"_meta":{"tier":1,"layer":"Society","category":"Economics","ring":1},"sema_ref":"Bid#cf07","sema_id":"sema:Bid#mh:SHA-256:cf07d1105de889786c1fbb618128ab03b34964fa4a7ab983c8d0f4d1d984b43e","sema_stub":"cf07","sema_layer":"Society","sema_category":"Economics"},"layer":"Society","category":"Economics"}},{"id":"f48e6072-8529-4e5f-8b94-967458d93192","text":"Binding: {{solver}} cannot exceed Bid cost without requesting {{budget}} expansion.","type":"INVARIANT","layer":null,"category":null,"handle":"Binding: {{solver}} cannot exceed Bid cost without requesting {{budget}} expansion.","gloss":null,"stub":null,"metadata":{}},{"id":"9d40efb1-8393-4bb2-9c7a-0a60a55746a1","text":"Pre-Execution: Must be generated before work begins.","type":"INVARIANT","layer":null,"category":null,"handle":"Pre-Execution: Must be generated before work begins.","gloss":null,"stub":null,"metadata":{}},{"id":"792604e9-bfe7-4c9e-89fd-a68968b730c4","text":"Verifiable: Bid components must be objectively measurable post-hoc.","type":"INVARIANT","layer":null,"category":null,"handle":"Verifiable: Bid components must be objectively measurable post-hoc.","gloss":null,"stub":null,"metadata":{}},{"id":"SolverManifest","text":"SolverManifest#67ac","type":"PATTERN","layer":"Society","category":"Protocols","handle":"SolverManifest#67ac","gloss":"Typed solver identity and capability declaration","stub":"67ac","metadata":{"pattern":{"handle":"SolverManifest","mechanism":"A typed declaration of a {{solver}}'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}}s (what it must never do). Manifests enable runtime solver selection and composition. It serves as the boot-loader for worker mode.","gloss":"Typed solver identity and capability declaration","failure_modes":["Capability Inflation: Manifest claims more than solver can deliver.","Stale Manifest: Manifest doesn't reflect current solver state.","Missing Constraint: Manifest omits a critical limitation."],"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."],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":0},"sema_id":"sema:SolverManifest#mh:SHA-256:67acaedb52d3ca227a4ed3a462cb2834aa3ccb8d85c3ea4eff7ed3bfb879620b","sema_ref":"SolverManifest#67ac","sema_stub":"67ac","sema_layer":"Society","sema_category":"Protocols","data_schema":{"type":"object","required":["solver_id","input_schema","output_schema"],"properties":{"solver_id":{"type":"string"},"version":{"type":"string"},"description":{"type":"string"},"capabilities":{"type":"array","items":{"type":"string"}},"cost_model":{"type":"object","properties":{"base_cost":{"type":"number"},"per_token_cost":{"type":"number"},"currency":{"type":"string"}}},"input_schema":{"type":"object","description":"JSON Schema for valid inputs"},"output_schema":{"type":"object","description":"JSON Schema for guaranteed outputs"}}}},"layer":"Society","category":"Protocols"}},{"id":"484007b2-16bb-4de7-8002-5615c8e6afd5","text":"Accuracy: Manifest must truthfully reflect solver capabilities.","type":"INVARIANT","layer":null,"category":null,"handle":"Accuracy: Manifest must truthfully reflect solver capabilities.","gloss":null,"stub":null,"metadata":{}},{"id":"0f60af8c-596b-4d4a-8d1e-f76b29fe66fe","text":"Completeness: All relevant capabilities and constraints must be listed.","type":"INVARIANT","layer":null,"category":null,"handle":"Completeness: All relevant capabilities and constraints must be listed.","gloss":null,"stub":null,"metadata":{}},{"id":"e8bd51bf-fd98-4cd5-9ca5-ddd7f06e08d0","text":"Immutability: Manifest is versioned; changes require new version.","type":"INVARIANT","layer":null,"category":null,"handle":"Immutability: Manifest is versioned; changes require new version.","gloss":null,"stub":null,"metadata":{}},{"id":"de7ddd75-5c5d-40b0-8a44-5f23a0c69bf7","text":"Identity Lock: Must specify a distinct persona/system prompt.","type":"INVARIANT","layer":null,"category":null,"handle":"Identity Lock: Must specify a distinct persona/system prompt.","gloss":null,"stub":null,"metadata":{}},{"id":"059739b2-9cc4-47fd-a359-9539f51146da","text":"Capability Bound: Must explicitly list available tools.","type":"INVARIANT","layer":null,"category":null,"handle":"Capability Bound: Must explicitly list available tools.","gloss":null,"stub":null,"metadata":{}},{"id":"QuorumPulse","text":"QuorumPulse#abc8","type":"PATTERN","layer":"Society","category":"Protocols","handle":"QuorumPulse#abc8","gloss":"Fluid, organic synchronization without rigid clock ticks.","stub":"abc8","metadata":{"pattern":{"handle":"QuorumPulse","mechanism":"{{signal}} Density Trigger: {{state}} transitions trigger only when local signal density exceeds threshold. It syncs state via {{heartbeat}} signals, triggering transitions only when signal density exceeds the quorum threshold.","gloss":"Fluid, organic synchronization without rigid clock ticks.","failure_modes":["{{signal}} saturation.","Echo chambers."],"invariants":["{{quorum}}: Action triggers if PulseCount > QuorumThreshold within Window","Liveness: Pulse frequency > 0","Pulse acknowledgment required."],"preconditions":["Network is asynchronous"],"postconditions":["Action triggered or suppressed by vote"],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":0},"sema_id":"sema:QuorumPulse#mh:SHA-256:abc8db906b1c09597b0efba1b13519dfe7d9a0a95b609df067456db3de944f0c","sema_ref":"QuorumPulse#abc8","sema_stub":"abc8","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"5574f74f-2f07-4cf8-923d-4566afb3043d","text":"{{quorum}}: Action triggers if PulseCount > QuorumThreshold within Window","type":"INVARIANT","layer":null,"category":null,"handle":"{{quorum}}: Action triggers if PulseCount > QuorumThreshold within Window","gloss":null,"stub":null,"metadata":{}},{"id":"9c1d871a-d8a8-4dd9-a6a1-706ad8aaf992","text":"Liveness: Pulse frequency > 0","type":"INVARIANT","layer":null,"category":null,"handle":"Liveness: Pulse frequency > 0","gloss":null,"stub":null,"metadata":{}},{"id":"9fa7ccb5-0a2f-4e4e-ac67-dc01bfa7829a","text":"Pulse acknowledgment required.","type":"INVARIANT","layer":null,"category":null,"handle":"Pulse acknowledgment required.","gloss":null,"stub":null,"metadata":{}},{"id":"395b1aab-daf7-41b8-9992-67e125b3724c","text":"Network is asynchronous","type":"PRECONDITION","layer":null,"category":null,"handle":"Network is asynchronous","gloss":null,"stub":null,"metadata":{}},{"id":"fb19d28e-0481-42a4-bfd7-411769c3642f","text":"Action triggered or suppressed by vote","type":"POSTCONDITION","layer":null,"category":null,"handle":"Action triggered or suppressed by vote","gloss":null,"stub":null,"metadata":{}},{"id":"Exception","text":"Exception#bcdc","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Exception#bcdc","gloss":"Runtime anomaly signal","stub":"bcdc","metadata":{"pattern":{"handle":"Exception","data_schema":{"type":"object","required":["error_code","message","stack_trace"],"properties":{"error_code":{"type":"string","description":"Standardized failure ID"},"message":{"type":"string","description":"Human-readable description"},"stack_trace":{"type":"array","description":"Execution context at failure"},"severity":{"type":"string","enum":["Fatal","Error","Warning"]}}},"mechanism":"A signal indicating that the standard execution flow has encountered a critical anomaly or invalid {{state}}. Must be handled explicitly by a {{circuit_breaker}} or {{fail_closed}} policy to prevent system corruption.","gloss":"Runtime anomaly signal","_meta":{"layer":"Infrastructure","category":"Data Structures","ring":0,"tier":1},"sema_layer":"Infrastructure","sema_category":"Data Structures","sema_id":"sema:Exception#mh:SHA-256:bcdc11a8b6e4c1af2def02029ab03bf24c1480bd827ee3d570e374096cfccdc6","sema_ref":"Exception#bcdc","sema_stub":"bcdc"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"ThreeLevelCollision","text":"ThreeLevelCollision#5db4","type":"PATTERN","layer":"Society","category":"Protocols","handle":"ThreeLevelCollision#5db4","gloss":"Stub, hash, and homograph collisions are different threats","stub":"5db4","metadata":{"pattern":{"handle":"ThreeLevelCollision","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 {{fail_closed}}.","gloss":"Stub, hash, and homograph collisions are different threats","failure_modes":["Stub Confusion: Relying on 4-char stub (#a1b2) for security instead of convenience.","Homograph Attack: Malicious actor mints a pattern with a trusted Handle but malicious Definition.","(Social Engineering).","Pre-image Attack: Theoretical break of SHA-256 (renders Level 2 defense void)."],"invariants":["L1 Defense: Stub match is NOT verification. Full hash check is mandatory.","L3 Defense: {{identity}} is Content, not Handle. A 'spoofed' pattern is simply a different pattern with zero reputation."],"preconditions":["Sema Hashing Algorithm (SHA-256) is secure"],"postconditions":["Appropriate verification logic applied","Threat level identified"],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":0},"sema_id":"sema:ThreeLevelCollision#mh:SHA-256:5db438e5f38882afa181ea527d06b673f64139f42390b9e795cf2ecc9efa29af","sema_ref":"ThreeLevelCollision#5db4","sema_stub":"5db4","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"efc5fc47-4262-4215-a986-590554b8bac4","text":"L1 Defense: Stub match is NOT verification. Full hash check is mandatory.","type":"INVARIANT","layer":null,"category":null,"handle":"L1 Defense: Stub match is NOT verification. Full hash check is mandatory.","gloss":null,"stub":null,"metadata":{}},{"id":"308569c9-32e0-4c9a-8e5a-435801e44b59","text":"L3 Defense: {{identity}} is Content, not Handle. A 'spoofed' pattern is simply a different pattern with zero reputation.","type":"INVARIANT","layer":null,"category":null,"handle":"L3 Defense: {{identity}} is Content, not Handle. A 'spoofed' pattern is simply a different pattern with zero reputation.","gloss":null,"stub":null,"metadata":{}},{"id":"c475273c-bb45-4b06-981c-0b5ee6068c2d","text":"Sema Hashing Algorithm (SHA-256) is secure","type":"PRECONDITION","layer":null,"category":null,"handle":"Sema Hashing Algorithm (SHA-256) is secure","gloss":null,"stub":null,"metadata":{}},{"id":"2f3b5c41-2345-48e6-b229-a14eabb5fc59","text":"Appropriate verification logic applied","type":"POSTCONDITION","layer":null,"category":null,"handle":"Appropriate verification logic applied","gloss":null,"stub":null,"metadata":{}},{"id":"edeffde1-9f7f-4bc6-8f35-1a7f613a4c93","text":"Threat level identified","type":"POSTCONDITION","layer":null,"category":null,"handle":"Threat level identified","gloss":null,"stub":null,"metadata":{}},{"id":"FeedbackSignal","text":"FeedbackSignal#f904","type":"PATTERN","layer":"Society","category":"Protocols","handle":"FeedbackSignal#f904","gloss":"Standardized learning feedback packet","stub":"f904","metadata":{"pattern":{"handle":"FeedbackSignal","mechanism":"A structured packet containing the evaluation of a specific {{solution}} for a {{task}}. Carries outcome and details to the {{feedback}} mechanism.","gloss":"Standardized learning feedback packet","invariants":["Targeted","Structured"],"sema_id":"sema:FeedbackSignal#mh:SHA-256:f90478ac868a5f7cc8800278a412c19dfaf50e8edb7a93a06dce6c0ae41ae52c","sema_ref":"FeedbackSignal#f904","sema_stub":"f904","_meta":{"layer":"Society","category":"Protocols","ring":0,"tier":1},"sema_layer":"Society","sema_category":"Protocols","data_schema":{"type":"object","required":["solution_ref","task_ref","outcome"],"properties":{"solution_ref":{"type":"string","description":"Reference to evaluated solution"},"task_ref":{"type":"string","description":"Reference to originating task"},"outcome":{"type":"string","enum":["success","failure","partial"],"description":"Evaluation result"},"details":{"type":"object","description":"Structured feedback details"}}}},"layer":"Society","category":"Protocols"}},{"id":"eac9d28c-50d6-4639-ab12-9639641f5ee5","text":"Targeted","type":"INVARIANT","layer":null,"category":null,"handle":"Targeted","gloss":null,"stub":null,"metadata":{}},{"id":"5b4c8cbb-41e2-4d0b-819e-6617e9046ad8","text":"Structured","type":"INVARIANT","layer":null,"category":null,"handle":"Structured","gloss":null,"stub":null,"metadata":{}},{"id":"StructuralCoaching","text":"StructuralCoaching#3da9","type":"PATTERN","layer":"Society","category":"Protocols","handle":"StructuralCoaching#3da9","gloss":"Guidance on deep structure vs surface features","stub":"3da9","metadata":{"pattern":{"handle":"StructuralCoaching","mechanism":"A feedback pattern for {{creative}} 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}}, {{feedback}}.","gloss":"Guidance on deep structure vs surface features","failure_modes":["Critic becomes too prescriptive, reducing Generator agency."],"invariants":["Depth Distinction: {{critique}} must target Mechanism, not Vocabulary","Directional Guidance: Rejection must propose a structural pivot (e.g., '{{invert}} the flow')"],"preconditions":["Generator is stuck in a local optimum"],"postconditions":["Next proposal uses distinct logic"],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":2},"sema_id":"sema:StructuralCoaching#mh:SHA-256:3da94d81638b577c42981039f4399705519db8a102dd8e16b7b51cbd6695b0b4","sema_ref":"StructuralCoaching#3da9","sema_stub":"3da9","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"771fef42-2a79-4ec1-a39e-cbb09b13eb12","text":"Depth Distinction: {{critique}} must target Mechanism, not Vocabulary","type":"INVARIANT","layer":null,"category":null,"handle":"Depth Distinction: {{critique}} must target Mechanism, not Vocabulary","gloss":null,"stub":null,"metadata":{}},{"id":"d5838399-8633-428b-9bbb-8fd7596ad759","text":"Directional Guidance: Rejection must propose a structural pivot (e.g., '{{invert}} the flow')","type":"INVARIANT","layer":null,"category":null,"handle":"Directional Guidance: Rejection must propose a structural pivot (e.g., '{{invert}} the flow')","gloss":null,"stub":null,"metadata":{}},{"id":"31b34d30-6066-45c8-8b1b-76477f0b582a","text":"Generator is stuck in a local optimum","type":"PRECONDITION","layer":null,"category":null,"handle":"Generator is stuck in a local optimum","gloss":null,"stub":null,"metadata":{}},{"id":"afd1de94-86eb-4854-8b5d-9bf61d198aad","text":"Next proposal uses distinct logic","type":"POSTCONDITION","layer":null,"category":null,"handle":"Next proposal uses distinct logic","gloss":null,"stub":null,"metadata":{}},{"id":"Agent","text":"Agent#cc24","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"Agent#cc24","gloss":"Autonomous Goal-Directed Entity","stub":"cc24","metadata":{"pattern":{"handle":"Agent","mechanism":"The fundamental unit of agency. An {{actor}} capable of perceiving its environment ({{observe}}), maintaining internal {{state}}, reasoning about that {{state}} ({{think}}), and taking {{act}}ions to achieve a {{goal}}. It operates in a continuous {{loop}}.","gloss":"Autonomous Goal-Directed Entity","failure_modes":["{{goal}} Drift: The agent's optimization target shifts away from the user's intent.","Reward Hacking: Finding shortcuts to maximize a {{metric}} without achieving the actual {{goal}}.","Infinite {{loop}}: Getting stuck in a non-productive cycle of actions.","Hallucination: Acting based on false internal beliefs."],"invariants":["Agency: Must possess an explicit objective function.","Autonomy: Must be capable of selection (choosing between >1 options).","{{identity}} Persistence: The agent maintains a consistent identity (ID/Memory) across time steps."],"preconditions":["Environment is instantiated","{{goal}} is defined","Resources (Compute/Time) are allocated"],"postconditions":["{{goal}} is satisfied OR Agent is terminated","{{trace}} of actions is preserved"],"_meta":{"tier":1,"layer":"Mind","category":"Strategy","ring":0},"sema_ref":"Agent#cc24","sema_id":"sema:Agent#mh:SHA-256:cc241813ab693736c29e02030d0f6c5453d63b603069191c1422a2529553daf5","sema_stub":"cc24","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"513a349a-75a8-4e2d-8380-deb1080de278","text":"Agency: Must possess an explicit objective function.","type":"INVARIANT","layer":null,"category":null,"handle":"Agency: Must possess an explicit objective function.","gloss":null,"stub":null,"metadata":{}},{"id":"97265fec-c197-4dd7-a6ae-042f86e98baa","text":"Autonomy: Must be capable of selection (choosing between >1 options).","type":"INVARIANT","layer":null,"category":null,"handle":"Autonomy: Must be capable of selection (choosing between >1 options).","gloss":null,"stub":null,"metadata":{}},{"id":"9836792d-a390-4d33-a264-0a1ac83d93ff","text":"{{identity}} Persistence: The agent maintains a consistent identity (ID/Memory) across time steps.","type":"INVARIANT","layer":null,"category":null,"handle":"{{identity}} Persistence: The agent maintains a consistent identity (ID/Memory) across time steps.","gloss":null,"stub":null,"metadata":{}},{"id":"2b38be2c-2c60-4012-a8b4-e9b9e509d3fa","text":"Environment is instantiated","type":"PRECONDITION","layer":null,"category":null,"handle":"Environment is instantiated","gloss":null,"stub":null,"metadata":{}},{"id":"c70cfa12-6438-449d-936b-4ffb3a2d826c","text":"{{goal}} is defined","type":"PRECONDITION","layer":null,"category":null,"handle":"{{goal}} is defined","gloss":null,"stub":null,"metadata":{}},{"id":"b7db276f-feb8-4c70-9057-a1a683e185c1","text":"Resources (Compute/Time) are allocated","type":"PRECONDITION","layer":null,"category":null,"handle":"Resources (Compute/Time) are allocated","gloss":null,"stub":null,"metadata":{}},{"id":"548106d4-d8a6-4d9f-a6c1-a21b1be1ade8","text":"{{goal}} is satisfied OR Agent is terminated","type":"POSTCONDITION","layer":null,"category":null,"handle":"{{goal}} is satisfied OR Agent is terminated","gloss":null,"stub":null,"metadata":{}},{"id":"3af4a626-ec05-4b03-9116-4b13907334ab","text":"{{trace}} of actions is preserved","type":"POSTCONDITION","layer":null,"category":null,"handle":"{{trace}} of actions is preserved","gloss":null,"stub":null,"metadata":{}},{"id":"Plan","text":"Plan#64f2","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Plan#64f2","gloss":"An ordered sequence of steps to achieve a goal","stub":"64f2","metadata":{"pattern":{"handle":"Plan","gloss":"An ordered sequence of steps to achieve a goal","mechanism":"An {{artifact}} containing a structured {{sequence}} of {{step}}s designed to transition a {{system}} from a current {{state}} to a target {{goal}}. Unlike a simple list, a Plan enforces causal dependency between steps and resource allocation.","signature":["Artifact(Step)"],"data_schema":{"type":"object","required":["plan_id","steps","status"],"properties":{"plan_id":{"type":"string"},"goal_ref":{"type":"string","description":"Pointer to the Goal this plan serves"},"steps":{"type":"array","items":{"type":"object"},"description":"Ordered sequence of Steps"},"status":{"type":"string","enum":["Draft","Approved","In_Progress","Done"]},"estimated_cost":{"type":"object","description":"Total resource budget required"},"created_at":{"type":"string","format":"date-time"}}},"invariants":["Ordering: Steps must be causally sortable.","Termination: Plan must have a defined end state."],"_meta":{"tier":0,"layer":"Infrastructure","category":"Data Structures","ring":0},"sema_ref":"Plan#64f2","sema_id":"sema:Plan#mh:SHA-256:64f273fc1710ca9d5b52a39758cf8e68279778d32856de4629a44ad7a7f5a4bc","sema_stub":"64f2","sema_layer":"Infrastructure","sema_category":"Data Structures"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"408c944f-74c7-4f2e-87bb-30a86ff21029","text":"Ordering: Steps must be causally sortable.","type":"INVARIANT","layer":null,"category":null,"handle":"Ordering: Steps must be causally sortable.","gloss":null,"stub":null,"metadata":{}},{"id":"52b91fe5-f87b-427a-ab76-d1e6dfdd3290","text":"Termination: Plan must have a defined end state.","type":"INVARIANT","layer":null,"category":null,"handle":"Termination: Plan must have a defined end state.","gloss":null,"stub":null,"metadata":{}},{"id":"LocalizedLearning","text":"LocalizedLearning#69bb","type":"PATTERN","layer":"Society","category":"Protocols","handle":"LocalizedLearning#69bb","gloss":"Partitioned feedback router for solver learning","stub":"69bb","metadata":{"pattern":{"handle":"LocalizedLearning","mechanism":"A learning process that performs the {{act}} of routing {{feedback_signal}} exclusively to the specific {{solver_manifest}} 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.","gloss":"Partitioned feedback router for solver learning","failure_modes":["Echo Chamber: A specialist solver over-optimizes for its narrow metric, ignoring global context.","Feedback Sparsity: Rare modules receive insufficient feedback to learn.","Misrouting: Feedback is attributed to the wrong solver.","Signal Decay: Feedback arrives too late to be useful."],"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."],"_meta":{"tier":2,"layer":"Society","category":"Protocols","ring":1},"sema_id":"sema:LocalizedLearning#mh:SHA-256:69bb2e9eea4ed50d3aa6213e7fc068cb247ec3d1737b707a9679bfba81c72f9b","sema_ref":"LocalizedLearning#69bb","sema_stub":"69bb","sema_layer":"Society","sema_category":"Protocols","signature":["Act(FeedbackSignal)"]},"layer":"Society","category":"Protocols"}},{"id":"3067047a-4620-4ccc-8d0c-4e98d9bc4205","text":"Isolation: Update(Solver_A) cannot change Weights(Solver_B).","type":"INVARIANT","layer":null,"category":null,"handle":"Isolation: Update(Solver_A) cannot change Weights(Solver_B).","gloss":null,"stub":null,"metadata":{}},{"id":"15f8b29d-dbed-441d-bed0-d9a03cbafff4","text":"Attribution: Each feedback signal must identify its source solver.","type":"INVARIANT","layer":null,"category":null,"handle":"Attribution: Each feedback signal must identify its source solver.","gloss":null,"stub":null,"metadata":{}},{"id":"c6b04213-daa9-4660-bec0-28fea4f3cc71","text":"Standardization: Feedback format is universal across all solver types.","type":"INVARIANT","layer":null,"category":null,"handle":"Standardization: Feedback format is universal across all solver types.","gloss":null,"stub":null,"metadata":{}},{"id":"AgentSandbox","text":"AgentSandbox#8719","type":"PATTERN","layer":"Society","category":"Protocols","handle":"AgentSandbox#8719","gloss":"Isolate agent execution with resource limits and egress controls","stub":"8719","metadata":{"pattern":{"handle":"AgentSandbox","mechanism":"Execution isolation for AI {{agent}}s treating them as untrusted insiders. The {{agent}} 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}} is executed in this {{sandbox}}, preventing impact on production systems even if the agent is compromised or generates malicious code. It wraps the execution {{context}} with {{input_guard}} to sanitize ingress data and {{output_guard}} to prevent exfiltration, effectively placing the {{agent}} in a digital quarantine.","gloss":"Isolate agent execution with resource limits and egress controls","failure_modes":["{{sandbox}} Escape: Exploiting container vulnerabilities.","Quota Starvation: Legitimate tasks failing due to overly restrictive limits.","Log Blindness: Missing critical events in {{audit}} logs."],"invariants":["Network egress whitelist-only","Sandboxed process cannot access host filesystem"],"preconditions":["Resource limits defined","Untrusted code/agent"],"postconditions":["Execution completed or terminated by supervisor"],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":0,"related":["Solution","Task"]},"sema_id":"sema:AgentSandbox#mh:SHA-256:871978bf94159b4fb9397407879198d38303f3b42585b5fc3ccf956f745d2904","sema_ref":"AgentSandbox#8719","sema_stub":"8719","sema_layer":"Society","sema_category":"Protocols","signature":["Sandbox(Agent)"]},"layer":"Society","category":"Protocols"}},{"id":"1827a61e-ab1f-4ec4-944a-10b82e377f3f","text":"Network egress whitelist-only","type":"INVARIANT","layer":null,"category":null,"handle":"Network egress whitelist-only","gloss":null,"stub":null,"metadata":{}},{"id":"49845e00-d0bf-4af7-bcb6-87f29d06b620","text":"Sandboxed process cannot access host filesystem","type":"INVARIANT","layer":null,"category":null,"handle":"Sandboxed process cannot access host filesystem","gloss":null,"stub":null,"metadata":{}},{"id":"dd42a9d4-03f9-46c6-98aa-5e3254baee1d","text":"Resource limits defined","type":"PRECONDITION","layer":null,"category":null,"handle":"Resource limits defined","gloss":null,"stub":null,"metadata":{}},{"id":"5fe94896-11b0-4eb2-b6ce-52dbe3d08e17","text":"Untrusted code/agent","type":"PRECONDITION","layer":null,"category":null,"handle":"Untrusted code/agent","gloss":null,"stub":null,"metadata":{}},{"id":"13c8e1ce-6419-414e-9ee4-e9992b5e9259","text":"Execution completed or terminated by supervisor","type":"POSTCONDITION","layer":null,"category":null,"handle":"Execution completed or terminated by supervisor","gloss":null,"stub":null,"metadata":{}},{"id":"AnalogyBridge","text":"AnalogyBridge#87de","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"AnalogyBridge#87de","gloss":"Mapping to known solutions","stub":"87de","metadata":{"pattern":{"handle":"AnalogyBridge","mechanism":"To solve a novel {{problem}}, the {{agent}} 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}} from the source domain to the target domain. It merges the structural properties of the source and target domains, identifying the isomorphic mapping.","gloss":"Mapping to known solutions","failure_modes":["False analogy (mapping superficial similarities)."],"invariants":["Attribute Independence: Object attributes (color, size) are ignored","Structure Mapping: Relations in Source must map to Relations in Target"],"preconditions":["Isomorphism exists"],"postconditions":["Inference transferred"],"_meta":{"tier":1,"layer":"Mind","category":"Strategy","ring":2},"sema_id":"sema:AnalogyBridge#mh:SHA-256:87ded8aef0c68bd8e45e029997245cb5a9094c69ce732d84839ba56ac3454c52","sema_ref":"AnalogyBridge#87de","sema_stub":"87de","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"a2cb3da1-67cf-4381-9836-77a944aa4a57","text":"Attribute Independence: Object attributes (color, size) are ignored","type":"INVARIANT","layer":null,"category":null,"handle":"Attribute Independence: Object attributes (color, size) are ignored","gloss":null,"stub":null,"metadata":{}},{"id":"dd4592b0-b0da-41eb-b6b4-16cdc89a6e3c","text":"Structure Mapping: Relations in Source must map to Relations in Target","type":"INVARIANT","layer":null,"category":null,"handle":"Structure Mapping: Relations in Source must map to Relations in Target","gloss":null,"stub":null,"metadata":{}},{"id":"4914a32a-5738-49ed-ad34-88621f2bb8a4","text":"Isomorphism exists","type":"PRECONDITION","layer":null,"category":null,"handle":"Isomorphism exists","gloss":null,"stub":null,"metadata":{}},{"id":"da135540-899b-497a-a3bd-8ac9f0ad9349","text":"Inference transferred","type":"POSTCONDITION","layer":null,"category":null,"handle":"Inference transferred","gloss":null,"stub":null,"metadata":{}},{"id":"AntifragileInversion","text":"AntifragileInversion#bf62","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"AntifragileInversion#bf62","gloss":"Converting volatility into fuel","stub":"bf62","metadata":{"pattern":{"handle":"AntifragileInversion","mechanism":"A design pattern that inverts the relationship with a stressor. If {{variable}} X causes harm, the {{agent}} redesigns the {{system}} such that {{variable}} X is the input fuel. It mathematically reverses the sign of the exposure {{vector}}. It systematically applies {{reframe}} to the {{system}}'s causal graph, identifying edges where the sign of the relationship between stress and utility can be flipped.","gloss":"Converting volatility into fuel","failure_modes":["Fragility to stability ({{system}} starves without shocks)."],"invariants":["Causal Inversion: The stressor is a required input, not a tolerated noise","Convexity: Gain(Shock) > Loss(Shock)"],"preconditions":["Stressor is unavoidable"],"postconditions":["{{system}} utility correlates positively with Stressor"],"_meta":{"tier":1,"layer":"Mind","category":"Strategy","ring":0},"sema_id":"sema:AntifragileInversion#mh:SHA-256:bf629c568b2bc34726a23d021ef0459528da2aa6084d5f011d3f1abf93b88de4","sema_ref":"AntifragileInversion#bf62","sema_stub":"bf62","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"9e201f39-ad16-45b8-a840-e4bee7a668a5","text":"Causal Inversion: The stressor is a required input, not a tolerated noise","type":"INVARIANT","layer":null,"category":null,"handle":"Causal Inversion: The stressor is a required input, not a tolerated noise","gloss":null,"stub":null,"metadata":{}},{"id":"de986a93-80da-48bb-a506-83f74c8c61c1","text":"Convexity: Gain(Shock) > Loss(Shock)","type":"INVARIANT","layer":null,"category":null,"handle":"Convexity: Gain(Shock) > Loss(Shock)","gloss":null,"stub":null,"metadata":{}},{"id":"5c18ed62-dfdf-4071-9a4b-7fd5c96c0d3c","text":"Stressor is unavoidable","type":"PRECONDITION","layer":null,"category":null,"handle":"Stressor is unavoidable","gloss":null,"stub":null,"metadata":{}},{"id":"bec21a9b-eedf-4d20-a583-a97a99082d45","text":"{{system}} utility correlates positively with Stressor","type":"POSTCONDITION","layer":null,"category":null,"handle":"{{system}} utility correlates positively with Stressor","gloss":null,"stub":null,"metadata":{}},{"id":"Belief","text":"Belief#6690","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Belief#6690","gloss":"A subjective claim with confidence and evidence","stub":"6690","metadata":{"pattern":{"handle":"Belief","mechanism":"A unit of epistemic {{state}}. Represents a claim held by an {{agent}} 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.","gloss":"A subjective claim with confidence and evidence","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"}],"_meta":{"tier":1,"layer":"Infrastructure","category":"Data Structures","ring":2},"data_schema":{"type":"object","required":["proposition","confidence"],"properties":{"proposition":{"type":"string","description":"The claim held by the agent"},"confidence":{"type":"number","minimum":0.0,"maximum":1.0,"description":"Subjective probability (Bayesian Prior)"},"supporting_evidence":{"type":"array","items":{"type":"string"},"description":"IDs of observations supporting this belief"},"provenance":{"type":"string","description":"Source of the belief (Inference, Axiom, Observation)"}}},"sema_id":"sema:Belief#mh:SHA-256:669092488e3b06354c76f2eaba3855e315f4ae43d4e6db3d04d8fc5d61accdbd","sema_ref":"Belief#6690","sema_stub":"6690","sema_layer":"Infrastructure","sema_category":"Data Structures"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"Break","text":"Break#9d98","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Break#9d98","gloss":"Enable graceful degradation and coordinated recovery when coordination fails mid-stream","stub":"9d98","metadata":{"pattern":{"handle":"Break","data_schema":{"type":"object","required":["break_id","severity"],"properties":{"break_id":{"type":"string","description":"Unique identifier for this break event"},"severity":{"type":"string","enum":["transient","permanent","catastrophic"],"description":"How serious is the failure"},"reason":{"type":"string","description":"Human-readable explanation of the break cause"},"timestamp":{"type":"string","format":"date-time","description":"When the break occurred"}}},"mechanism":"{{protocol}} for announcing coordination failure. Failing {{agent}} 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.","gloss":"Enable graceful degradation and coordinated recovery when coordination fails mid-stream","failure_modes":["BREAK {{message}} itself fails to deliver ({{meta}}-failure).","Partners disagree on recovery action.","Cascading BREAKs overwhelm system.","Inaccurate completed_state leads to wrong compensation.","Timeout too short/long for ACK collection."],"invariants":["No data loss during interruption","{{system}} state paused safely"],"preconditions":["Interrupt signal","Running process"],"postconditions":["Process halted","Resumption point saved"],"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"}],"_meta":{"tier":1,"layer":"Infrastructure","category":"Data Structures","ring":0,"related":["EjectionSeat","Retry"]},"sema_id":"sema:Break#mh:SHA-256:9d98f2e8986f32f8eb1518bfcdead7eaadf8addde63e4625c7faa0e891f28666","sema_ref":"Break#9d98","sema_stub":"9d98","sema_layer":"Infrastructure","sema_category":"Data Structures"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"7539c935-7284-4456-8bcf-19e771d74b40","text":"No data loss during interruption","type":"INVARIANT","layer":null,"category":null,"handle":"No data loss during interruption","gloss":null,"stub":null,"metadata":{}},{"id":"71e7a522-2d84-4f65-842b-c06a6ecd64c2","text":"{{system}} state paused safely","type":"INVARIANT","layer":null,"category":null,"handle":"{{system}} state paused safely","gloss":null,"stub":null,"metadata":{}},{"id":"e5de5092-0b0b-4fc6-a305-3be093869075","text":"Interrupt signal","type":"PRECONDITION","layer":null,"category":null,"handle":"Interrupt signal","gloss":null,"stub":null,"metadata":{}},{"id":"10a9ace1-e409-4d4b-8653-df56a13fd88a","text":"Running process","type":"PRECONDITION","layer":null,"category":null,"handle":"Running process","gloss":null,"stub":null,"metadata":{}},{"id":"06e74ea5-fee0-4492-a06b-1dd2719f0ff0","text":"Process halted","type":"POSTCONDITION","layer":null,"category":null,"handle":"Process halted","gloss":null,"stub":null,"metadata":{}},{"id":"68523e36-6226-40a1-9e19-aeaf75066fbb","text":"Resumption point saved","type":"POSTCONDITION","layer":null,"category":null,"handle":"Resumption point saved","gloss":null,"stub":null,"metadata":{}},{"id":"Card","text":"Card#5c33","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Card#5c33","gloss":"Enable capability-based agent discovery, making coordination ecosystems dynamic and self-describing","stub":"5c33","metadata":{"pattern":{"handle":"Card","data_schema":{"type":"object","required":["public_key","claims"],"properties":{"public_key":{"type":"string","description":"Cryptographic identifier of the Agent"},"claims":{"type":"object","description":"Map of protocols and capabilities supported"},"reputation_score":{"type":"number","description":"Aggregate trust metric (optional)"},"endpoints":{"type":"array","description":"Reachability addresses"}}},"mechanism":"Structured capability advertisement enabling agent discovery before contact. {{agent}} 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}} 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}} after GREET establishes channel. It enables discovery via {{select}} queries against the registry, filtering candidates by capability and protocol compatibility.","gloss":"Enable capability-based agent discovery, making coordination ecosystems dynamic and self-describing","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"}],"failure_modes":["Stale CARDs (agent changed capabilities, CARD not updated—TTL mitigates).","False claims (CARD says X, agent cannot X—PROBE mitigates).","Registry unavailable (discovery fails—use multiple publication methods).","CARD spam (fake CARDs pollute discovery—use reputation/filtering).","Privacy leak (CARD reveals too much about agent—include only necessary info).","Version skew (CARD protocol version differs from actual—GREET catches this)."],"invariants":["Card immutable after issue."],"_meta":{"tier":2,"layer":"Infrastructure","category":"Data Structures","ring":0},"sema_id":"sema:Card#mh:SHA-256:5c33034fedd84e9d8e42887c003d5b96a694d0549292dd796c3dbcbfe76a06dd","sema_ref":"Card#5c33","sema_stub":"5c33","sema_layer":"Infrastructure","sema_category":"Data Structures"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"a415342c-fcd1-4232-bf5e-97dbccb19fa7","text":"Card immutable after issue.","type":"INVARIANT","layer":null,"category":null,"handle":"Card immutable after issue.","gloss":null,"stub":null,"metadata":{}},{"id":"Compromise","text":"Compromise#955f","type":"PATTERN","layer":"Society","category":"Economics","handle":"Compromise#955f","gloss":"Finding a mutual sacrifice zone via intensity reduction","stub":"955f","metadata":{"pattern":{"handle":"Compromise","mechanism":"Iterative Negotiation Protocol. Each {{agent}} states preferences with INTENSITY scores (0-1). The {{system}} computes DISSONANCE (Sum(Intensity_A * Intensity_B)). To reach consensus, agents must {{dampen}} their preference intensity until Dissonance < Threshold. Unlike {{yield}} (which is binary surrender), Compromise is a continuous reduction of demand.","gloss":"Finding a mutual sacrifice zone via intensity reduction","_meta":{"tier":2,"layer":"Society","category":"Economics","ring":1},"sema_ref":"Compromise#955f","sema_id":"sema:Compromise#mh:SHA-256:955f5b17e14c2998dda12fb21506656505eb987503cf1b2bb06acfaa06433d55","sema_stub":"955f","sema_layer":"Society","sema_category":"Economics"},"layer":"Society","category":"Economics"}},{"id":"EphemeralTool","text":"EphemeralTool#1c6b","type":"PATTERN","layer":"Society","category":"Protocols","handle":"EphemeralTool#1c6b","gloss":"Agents that are never limited by their pre-installed toolbelt.","stub":"1c6b","metadata":{"pattern":{"handle":"EphemeralTool","mechanism":"Just-In-Time Compilation: {{agent}} writes and executes custom code tools for unique problems. It dynamically generates a single-use script and executes it via {{tool_invoke}} before scrubbing it from memory.","gloss":"Agents that are never limited by their pre-installed toolbelt.","failure_modes":["{{sandbox}} escapes.","Halting problem.","Bad code generation."],"invariants":["{{state}} wiped after destruction","Tool exists only for duration of task"],"preconditions":["{{task}} requiring specialized capability"],"postconditions":["Capability instantiated then destroyed"],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":0},"sema_id":"sema:EphemeralTool#mh:SHA-256:1c6b7afef01dd8056cf26d516b3a1e0295b471ab1f6a7a3b7651287caf28f602","sema_ref":"EphemeralTool#1c6b","sema_stub":"1c6b","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"c594acc2-ab2f-424a-b6da-9a544f1872ae","text":"{{state}} wiped after destruction","type":"INVARIANT","layer":null,"category":null,"handle":"{{state}} wiped after destruction","gloss":null,"stub":null,"metadata":{}},{"id":"45e5f294-8a21-432a-bf56-03c32c3c62d3","text":"Tool exists only for duration of task","type":"INVARIANT","layer":null,"category":null,"handle":"Tool exists only for duration of task","gloss":null,"stub":null,"metadata":{}},{"id":"2e2b2b9a-ba56-4b90-8f68-f491c9f8d4a3","text":"{{task}} requiring specialized capability","type":"PRECONDITION","layer":null,"category":null,"handle":"{{task}} requiring specialized capability","gloss":null,"stub":null,"metadata":{}},{"id":"92f49c4e-73ae-4a34-ae8a-12b811b447f1","text":"Capability instantiated then destroyed","type":"POSTCONDITION","layer":null,"category":null,"handle":"Capability instantiated then destroyed","gloss":null,"stub":null,"metadata":{}},{"id":"FractalAnte","text":"FractalAnte#09f2","type":"PATTERN","layer":"Society","category":"Economics","handle":"FractalAnte#09f2","gloss":"Economic bounding of recursive depth","stub":"09f2","metadata":{"pattern":{"handle":"FractalAnte","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}}. 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}} tax on recursion depth to prevent infinite regress.","gloss":"Economic bounding of recursive depth","failure_modes":["Solving deep, complex problems becomes prohibitively expensive for low-resource agents (Class Ceiling for Cognition)."],"invariants":["Burn on Failure: Failed recursion results in irreversible resource loss","Exponential Cost: Cost(Depth+1) >= Cost(Depth) * Factor"],"preconditions":["{{agent}} has a divisible resource (Tokens/Compute)","Recursion capability"],"postconditions":["Recursion depth bounded by economic constraints"],"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"}],"_meta":{"tier":1,"layer":"Society","category":"Economics","related":["sema:CostlySignal#mh:SHA-256:591735104986a667b2b66514c9740c65e7f13ee78434b64b8d63b1b22b8b3f89","sema:RecursionDive#mh:SHA-256:21c78ad8cc5e658fd19356cec9b998d9af1b02c54eaa96ce2d2f0ec4d8a75639"],"ring":1},"sema_id":"sema:FractalAnte#mh:SHA-256:09f2e802b9d4b418dfcb03e465596f360f34924bb849a2fc499e7e6646a4df35","sema_ref":"FractalAnte#09f2","sema_stub":"09f2","sema_layer":"Society","sema_category":"Economics"},"layer":"Society","category":"Economics"}},{"id":"222e49b8-97a8-4557-bda4-8d190864c875","text":"Burn on Failure: Failed recursion results in irreversible resource loss","type":"INVARIANT","layer":null,"category":null,"handle":"Burn on Failure: Failed recursion results in irreversible resource loss","gloss":null,"stub":null,"metadata":{}},{"id":"8209b0ed-4fc8-4753-8e17-e650ca32f7a1","text":"Exponential Cost: Cost(Depth+1) >= Cost(Depth) * Factor","type":"INVARIANT","layer":null,"category":null,"handle":"Exponential Cost: Cost(Depth+1) >= Cost(Depth) * Factor","gloss":null,"stub":null,"metadata":{}},{"id":"a90072dc-d1b6-4007-8b2b-33293020803b","text":"{{agent}} has a divisible resource (Tokens/Compute)","type":"PRECONDITION","layer":null,"category":null,"handle":"{{agent}} has a divisible resource (Tokens/Compute)","gloss":null,"stub":null,"metadata":{}},{"id":"6d455196-702c-485c-aee4-7360e3587b9a","text":"Recursion capability","type":"PRECONDITION","layer":null,"category":null,"handle":"Recursion capability","gloss":null,"stub":null,"metadata":{}},{"id":"73741714-3b01-4d31-9525-4c3b12bdbbcf","text":"Recursion depth bounded by economic constraints","type":"POSTCONDITION","layer":null,"category":null,"handle":"Recursion depth bounded by economic constraints","gloss":null,"stub":null,"metadata":{}},{"id":"Greet","text":"Greet#1bad","type":"PATTERN","layer":"Infrastructure","category":"Primitives","handle":"Greet#1bad","gloss":"Agent connection initiation","stub":"1bad","metadata":{"pattern":{"handle":"Greet","mechanism":"The initial contact protocol between two {{agent}}s. It involves a cryptographic {{identity}} verification followed by a {{compatibility_check}} to establish a shared communication channel. If successful, it transitions the connection state from 'Unknown' to 'Connected'.","gloss":"Agent connection initiation","failure_modes":["Authentication Failure: {{identity}} could not be verified.","Protocol Mismatch: Agents speak incompatible languages."],"invariants":["Mutual Auth: Both parties must verify each other.","No-Op on Mismatch: Connection drops if handshake fails."],"_meta":{"tier":1,"layer":"Infrastructure","category":"Primitives","ring":1},"sema_id":"sema:Greet#mh:SHA-256:1bad380cdf48247bbb7ab68e6dcb95eeb6b6ba7535095d64b86c49bab5c4e173","sema_ref":"Greet#1bad","sema_stub":"1bad","sema_layer":"Infrastructure","sema_category":"Primitives"},"layer":"Infrastructure","category":"Primitives"}},{"id":"ae8ee9f7-809c-485a-890a-2af4d375c2f6","text":"Mutual Auth: Both parties must verify each other.","type":"INVARIANT","layer":null,"category":null,"handle":"Mutual Auth: Both parties must verify each other.","gloss":null,"stub":null,"metadata":{}},{"id":"6fdfe13a-b992-4aff-99e9-60e348c706ee","text":"No-Op on Mismatch: Connection drops if handshake fails.","type":"INVARIANT","layer":null,"category":null,"handle":"No-Op on Mismatch: Connection drops if handshake fails.","gloss":null,"stub":null,"metadata":{}},{"id":"Ledger","text":"Ledger#2449","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Ledger#2449","gloss":"Immutable transactional history","stub":"2449","metadata":{"pattern":{"handle":"Ledger","mechanism":"An immutable record of {{value}} transfers, debts, and obligations between {{agent}}s. It serves as the shared memory for economic coordination.","gloss":"Immutable transactional history","invariants":["Immutability: Past entries cannot be modified.","Append-Only: New transactions are added to the end."],"_meta":{"layer":"Infrastructure","category":"Data Structures","ring":0,"tier":1},"sema_id":"sema:Ledger#mh:SHA-256:2449b13ec018b29f7301a798a92077d5f6983991b38886c19f1aa27c3ac533e5","sema_ref":"Ledger#2449","sema_stub":"2449","sema_layer":"Infrastructure","sema_category":"Data Structures","data_schema":{"type":"object","required":["ledger_id","entries"],"properties":{"ledger_id":{"type":"string","description":"Unique identifier"},"entries":{"type":"array","items":{"type":"object","properties":{"from_agent":{"type":"string"},"to_agent":{"type":"string"},"amount":{"type":"number"},"timestamp":{"type":"string","format":"date-time"}}},"description":"Immutable transaction history"},"balance_snapshot":{"type":"object","description":"Current balances per agent"}}}},"layer":"Infrastructure","category":"Data Structures"}},{"id":"b44c3a97-96f3-42b7-bb1e-aaef34659036","text":"Append-Only: New transactions are added to the end.","type":"INVARIANT","layer":null,"category":null,"handle":"Append-Only: New transactions are added to the end.","gloss":null,"stub":null,"metadata":{}},{"id":"Mode","text":"Mode#b995","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Mode#b995","gloss":"A discrete configuration of agency","stub":"b995","metadata":{"pattern":{"handle":"Mode","data_schema":{"type":"object","required":["mode_id","constraints"],"properties":{"mode_id":{"type":"string","description":"Unique identifier for this mode configuration"},"constraints":{"type":"array","items":{"type":"string"},"description":"Rules governing behavior in this mode"},"priors":{"type":"object","description":"Default assumptions active in this mode"},"active":{"type":"boolean","description":"Whether this mode is currently engaged"}}},"mechanism":"A primitive representing a distinct 'Stance' or 'Configuration of Agency'. Unlike {{state}} (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).","gloss":"A discrete configuration of agency","failure_modes":["Mode Persistence Failure: {{agent}} fails to maintain the mode constraints over time.","Mode Confusion: {{agent}} mixes behaviors from conflicting modes."],"invariants":["Stability: A Mode persists until an explicit {{transition}} event.","Exclusivity: {{agent}} cannot be in two conflicting Modes simultaneously (unless explicitly designed as Hybrid)."],"_meta":{"tier":1,"layer":"Infrastructure","category":"Data Structures","ring":0,"related":["WorkerMode","SynergisticMode"]},"sema_id":"sema:Mode#mh:SHA-256:b9957477ff6bb4d7d3b55db6c51ba74e6900cfe0cfd4af4caaf180286242c772","sema_ref":"Mode#b995","sema_stub":"b995","sema_layer":"Infrastructure","sema_category":"Data Structures"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"d46527f5-9f75-49c0-960c-a008c11dbd29","text":"Stability: A Mode persists until an explicit {{transition}} event.","type":"INVARIANT","layer":null,"category":null,"handle":"Stability: A Mode persists until an explicit {{transition}} event.","gloss":null,"stub":null,"metadata":{}},{"id":"f3c8d77b-ca44-4d89-a884-13573dd8634e","text":"Exclusivity: {{agent}} cannot be in two conflicting Modes simultaneously (unless explicitly designed as Hybrid).","type":"INVARIANT","layer":null,"category":null,"handle":"Exclusivity: {{agent}} cannot be in two conflicting Modes simultaneously (unless explicitly designed as Hybrid).","gloss":null,"stub":null,"metadata":{}},{"id":"ModestClaim","text":"ModestClaim#a257","type":"PATTERN","layer":"Society","category":"Protocols","handle":"ModestClaim#a257","gloss":"Defensible over ambitious","stub":"a257","metadata":{"pattern":{"handle":"ModestClaim","mechanism":"Epistemic {{reframe}}. Transforms assertions of '{{identity}}' (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 {{epistemic_calibrate}} to reduce the scope of assertions from 'Universal Truth' to 'Local Observation'.","gloss":"Defensible over ambitious","failure_modes":["Ontological Trap: Claiming the hash solves the Symbol Grounding {{problem}} (it doesn't).","Brittle Authority: Making absolute claims that invite refutation by a single edge case."],"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."],"preconditions":["{{system}} or {{agent}} formulating a capability claim"],"postconditions":["Claim scope reduced to defensible limits (Epistemic/Utility)"],"_meta":{"tier":2,"layer":"Society","category":"Protocols","ring":2},"sema_id":"sema:ModestClaim#mh:SHA-256:a257e1318e9ba89e290893692bb9745712457fdbfa45bb99f4e58e00349c6277","sema_ref":"ModestClaim#a257","sema_stub":"a257","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"1e864a9d-9eaf-4436-9d55-fffe96d816b6","text":"Epistemic Priority: Claims must describe 'Evidence of Divergence', not 'Proof of Meaning'.","type":"INVARIANT","layer":null,"category":null,"handle":"Epistemic Priority: Claims must describe 'Evidence of Divergence', not 'Proof of Meaning'.","gloss":null,"stub":null,"metadata":{}},{"id":"aa489d5a-f66e-4570-947a-766f0a79d2b0","text":"Pragmatic Grounding: The measure of success is Coordination Utility, not Semantic Truth.","type":"INVARIANT","layer":null,"category":null,"handle":"Pragmatic Grounding: The measure of success is Coordination Utility, not Semantic Truth.","gloss":null,"stub":null,"metadata":{}},{"id":"9f4560aa-7c5a-4718-962c-002b3c1fb262","text":"{{system}} or {{agent}} formulating a capability claim","type":"PRECONDITION","layer":null,"category":null,"handle":"{{system}} or {{agent}} formulating a capability claim","gloss":null,"stub":null,"metadata":{}},{"id":"e23c6e74-72af-4057-bb3d-1b409928e01c","text":"Claim scope reduced to defensible limits (Epistemic/Utility)","type":"POSTCONDITION","layer":null,"category":null,"handle":"Claim scope reduced to defensible limits (Epistemic/Utility)","gloss":null,"stub":null,"metadata":{}},{"id":"NegativeProof","text":"NegativeProof#40a6","type":"PATTERN","layer":"Infrastructure","category":"Primitives","handle":"NegativeProof#40a6","gloss":"Proving ignorance or non-liability","stub":"40a6","metadata":{"pattern":{"handle":"NegativeProof","mechanism":"Using Zero-Knowledge Range Proofs to prove that an {{agent}} does NOT hold a specific piece of data (or that a {{value}} 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.","gloss":"Proving ignorance or non-liability","failure_modes":["Proving a negative is computationally expensive."],"invariants":["Absence of evidence is evidence of absence (under exhaustive search)","Search space fully covered"],"preconditions":["Closed world assumption","{{hypothesis}} H"],"postconditions":["H proved false"],"_meta":{"tier":1,"layer":"Infrastructure","category":"Primitives","ring":1},"sema_id":"sema:NegativeProof#mh:SHA-256:40a6b9b7cc8a3e63dd2433bdcfe0090eee52016e2eb9d58238474f1e4347d30d","sema_ref":"NegativeProof#40a6","sema_stub":"40a6","sema_layer":"Infrastructure","sema_category":"Primitives"},"layer":"Infrastructure","category":"Primitives"}},{"id":"9dd90d8b-03aa-4538-999c-a2e7d4877260","text":"Absence of evidence is evidence of absence (under exhaustive search)","type":"INVARIANT","layer":null,"category":null,"handle":"Absence of evidence is evidence of absence (under exhaustive search)","gloss":null,"stub":null,"metadata":{}},{"id":"65cab848-07b5-438e-9d7e-d27e5fc053b4","text":"Search space fully covered","type":"INVARIANT","layer":null,"category":null,"handle":"Search space fully covered","gloss":null,"stub":null,"metadata":{}},{"id":"21436c45-ba5d-4db9-aa65-0f1fdcb154a5","text":"Closed world assumption","type":"PRECONDITION","layer":null,"category":null,"handle":"Closed world assumption","gloss":null,"stub":null,"metadata":{}},{"id":"a89accdc-ce39-4c86-8b33-80c9bf8d13bf","text":"{{hypothesis}} H","type":"PRECONDITION","layer":null,"category":null,"handle":"{{hypothesis}} H","gloss":null,"stub":null,"metadata":{}},{"id":"cf8f5d42-95ba-442a-bc09-41cfcd6c395f","text":"H proved false","type":"POSTCONDITION","layer":null,"category":null,"handle":"H proved false","gloss":null,"stub":null,"metadata":{}},{"id":"OntologyAdapt","text":"OntologyAdapt#0c1d","type":"PATTERN","layer":"Mind","category":"Inference","handle":"OntologyAdapt#0c1d","gloss":"Restructuring categories to fit data","stub":"0c1d","metadata":{"pattern":{"handle":"OntologyAdapt","mechanism":"Derived from Piagetian psychology. When new data defies classification within the current ontology, the {{agent}} does not force-fit it or discard it. Instead, it triggers a 'Restructure' event, creating new root {{category}}s that accommodate the {{anomaly}} as a fundamental feature. Utilizes {{ontology_handshake}}.","gloss":"Restructuring categories to fit data","failure_modes":["{{category}} explosion (creating a new {{category}} for every {{noise}} point)."],"invariants":["Conservation of Data: No anomaly is discarded during accommodation","Fit Threshold: If ClassificationConfidence < 0.4, Trigger(Restructure)"],"preconditions":["Data validated as true but unclassifiable"],"postconditions":["Data fits naturally in new structure"],"_meta":{"tier":1,"layer":"Mind","category":"Inference","ring":1},"sema_id":"sema:OntologyAdapt#mh:SHA-256:0c1da559ddd0df6165d8e057020960ab65f8974a03d8b24dc9d194e45ed29d7f","sema_ref":"OntologyAdapt#0c1d","sema_stub":"0c1d","sema_layer":"Mind","sema_category":"Inference"},"layer":"Mind","category":"Inference"}},{"id":"1c92004a-3947-4ff0-ae37-80b0e2037da7","text":"Conservation of Data: No anomaly is discarded during accommodation","type":"INVARIANT","layer":null,"category":null,"handle":"Conservation of Data: No anomaly is discarded during accommodation","gloss":null,"stub":null,"metadata":{}},{"id":"44339c0b-a03c-47e0-9605-4aaddab5c37e","text":"Fit Threshold: If ClassificationConfidence < 0.4, Trigger(Restructure)","type":"INVARIANT","layer":null,"category":null,"handle":"Fit Threshold: If ClassificationConfidence < 0.4, Trigger(Restructure)","gloss":null,"stub":null,"metadata":{}},{"id":"0d61e711-1cb9-4340-81a5-48b63d1dad8b","text":"Data validated as true but unclassifiable","type":"PRECONDITION","layer":null,"category":null,"handle":"Data validated as true but unclassifiable","gloss":null,"stub":null,"metadata":{}},{"id":"25c60a1f-1b85-408e-9318-c44f5daccdda","text":"Data fits naturally in new structure","type":"POSTCONDITION","layer":null,"category":null,"handle":"Data fits naturally in new structure","gloss":null,"stub":null,"metadata":{}},{"id":"Permission","text":"Permission#f583","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Permission#f583","gloss":"Authorization grant","stub":"f583","metadata":{"pattern":{"handle":"Permission","data_schema":{"type":"object","required":["permission_id","agent_id","action"],"properties":{"permission_id":{"type":"string","description":"Unique identifier for this permission"},"agent_id":{"type":"string","description":"Who is granted permission"},"action":{"type":"string","description":"What action is permitted"},"resource":{"type":"string","description":"What artifact can be accessed"},"granted_at":{"type":"string","format":"date-time","description":"When permission was granted"}}},"mechanism":"An authorization grant allowing an {{agent}} to perform a specific {{act}} or access a {{artifact}}. The atomic unit of access control.","gloss":"Authorization grant","_meta":{"layer":"Infrastructure","category":"Data Structures","ring":1,"tier":1},"sema_ref":"Permission#f583","sema_id":"sema:Permission#mh:SHA-256:f5838c2aa8a10fbf23b5ae4fee6c184698dffadca0eaeef6e4af07cb5c8b92c7","sema_stub":"f583","sema_layer":"Infrastructure","sema_category":"Data Structures"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"Proprioception","text":"Proprioception#c9bb","type":"PATTERN","layer":"Society","category":"Protocols","handle":"Proprioception#c9bb","gloss":"Self-location awareness within the task graph","stub":"c9bb","metadata":{"pattern":{"handle":"Proprioception","mechanism":"Continuous self-monitoring of position in the {{task}} graph. An {{agent}} periodic 'ping' to itself to verify {{context}}, active tool state, and depth in recursion. Prevents 'getting lost' in long chains of thought. It maintains internal {{state}} awareness, using {{somatic_marker}} to detect recursion depth limits or resource fatigue.","gloss":"Self-location awareness within the task graph","failure_modes":["Stagnation: {{agent}} remains in same node > N ticks Orphaned: Parent {{task}} ID not found/unresponsive Hallucinated {{context}}: Stack {{trace}} does not match environmental reality"],"invariants":["{{context}} Continuity: {{agent}} knows its parent {{task}} ID","Liveness: Parent.status == ACTIVE","{{state}} Recovery: Can reconstruct stack {{trace}} 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"}],"_meta":{"tier":3,"layer":"Society","category":"Protocols","ring":2},"sema_id":"sema:Proprioception#mh:SHA-256:c9bb0e902eb672f0ac84066a1870c010b74cc68fbffc4bc2d3c841b1dbd2c56c","sema_ref":"Proprioception#c9bb","sema_stub":"c9bb","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"37640219-1871-4d12-92a5-263dc28cb185","text":"{{context}} Continuity: {{agent}} knows its parent {{task}} ID","type":"INVARIANT","layer":null,"category":null,"handle":"{{context}} Continuity: {{agent}} knows its parent {{task}} ID","gloss":null,"stub":null,"metadata":{}},{"id":"1f88efb1-dca4-413f-89af-2edf854e93a0","text":"Liveness: Parent.status == ACTIVE","type":"INVARIANT","layer":null,"category":null,"handle":"Liveness: Parent.status == ACTIVE","gloss":null,"stub":null,"metadata":{}},{"id":"5e260121-aa31-4e8c-88d5-7dba036ac699","text":"{{state}} Recovery: Can reconstruct stack {{trace}} from logs","type":"INVARIANT","layer":null,"category":null,"handle":"{{state}} Recovery: Can reconstruct stack {{trace}} from logs","gloss":null,"stub":null,"metadata":{}},{"id":"ReAct","text":"ReAct#db09","type":"PATTERN","layer":"Mind","category":"Reasoning","handle":"ReAct#db09","gloss":"Interleaved thought-action-observation cycle","stub":"db09","metadata":{"pattern":{"handle":"ReAct","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}}-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}} with {{tool_invoke}} execution, updating the context with observation results.","gloss":"Interleaved thought-action-observation cycle","failure_modes":["Observation Blindness: {{agent}} ignores observations and follows initial plan.","{{loop}} Explosion: Endless thought-action cycles without termination.","Action {{cognitive_bias}}: Jumping to actions without sufficient reasoning."],"invariants":["Action based on reasoning","Cycle of Thought-Action-Observation"],"preconditions":["Environment access","Goal"],"postconditions":["Goal reached or deemed impossible"],"_meta":{"tier":1,"layer":"Mind","category":"Reasoning","related":["sema:Reflexion#mh:SHA-256:c5b155b3053281ade32b43be8c274c6c0f1bb4315c3ec0313ce03c3c3ae97c76"],"ring":2},"sema_layer":"Mind","sema_category":"Reasoning","sema_id":"sema:ReAct#mh:SHA-256:db09f71ac22f6917fb5b7dc3fbc14409a057f20b30243cd262150f29d73a4298","sema_ref":"ReAct#db09","sema_stub":"db09"},"layer":"Mind","category":"Reasoning"}},{"id":"6e3431ef-e936-499b-af6b-2e5261eb0d60","text":"Action based on reasoning","type":"INVARIANT","layer":null,"category":null,"handle":"Action based on reasoning","gloss":null,"stub":null,"metadata":{}},{"id":"2b4d3a9c-e45a-449d-b7c4-8f7a13495d51","text":"Cycle of Thought-Action-Observation","type":"INVARIANT","layer":null,"category":null,"handle":"Cycle of Thought-Action-Observation","gloss":null,"stub":null,"metadata":{}},{"id":"0d81d92c-a7f2-48d2-8a23-9627ed24a7a7","text":"Environment access","type":"PRECONDITION","layer":null,"category":null,"handle":"Environment access","gloss":null,"stub":null,"metadata":{}},{"id":"ec728cf7-9ff8-49ce-b6dd-248ad04e861d","text":"Goal","type":"PRECONDITION","layer":null,"category":null,"handle":"Goal","gloss":null,"stub":null,"metadata":{}},{"id":"5b750e17-14ca-4768-9fe4-c333fb5b6cd8","text":"Goal reached or deemed impossible","type":"POSTCONDITION","layer":null,"category":null,"handle":"Goal reached or deemed impossible","gloss":null,"stub":null,"metadata":{}},{"id":"SignalReflection","text":"SignalReflection#0b8c","type":"PATTERN","layer":"Society","category":"Protocols","handle":"SignalReflection#0b8c","gloss":"Proof of receipt via modification","stub":"0b8c","metadata":{"pattern":{"handle":"SignalReflection","mechanism":"To prove a {{message}} 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}} is 'live'. It requires the receiver to echo the {{message}} modulated by {{spectral_tune}} logic to prove active processing.","gloss":"Proof of receipt via modification","failure_modes":["Asymmetry (too expensive for receiver)."],"invariants":["Reflected signal matches origin","Source authenticated"],"preconditions":["Incoming {{message}}"],"postconditions":["Acknowledgement sent"],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":1},"sema_id":"sema:SignalReflection#mh:SHA-256:0b8c5e666668635b64ecebab88c01900ac49a24b00aa97b8d03443a90b492ef5","sema_ref":"SignalReflection#0b8c","sema_stub":"0b8c","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"25dba9ea-2ecb-45ae-bd7e-5efa2a8a8544","text":"Reflected signal matches origin","type":"INVARIANT","layer":null,"category":null,"handle":"Reflected signal matches origin","gloss":null,"stub":null,"metadata":{}},{"id":"782fc85c-92f2-487d-8a8f-7b056c655d84","text":"Source authenticated","type":"INVARIANT","layer":null,"category":null,"handle":"Source authenticated","gloss":null,"stub":null,"metadata":{}},{"id":"37b8fb18-7cac-4714-891a-d47db3ade8c0","text":"Incoming {{message}}","type":"PRECONDITION","layer":null,"category":null,"handle":"Incoming {{message}}","gloss":null,"stub":null,"metadata":{}},{"id":"310d4861-b5eb-4dbe-b7d2-30af86f78e57","text":"Acknowledgement sent","type":"POSTCONDITION","layer":null,"category":null,"handle":"Acknowledgement sent","gloss":null,"stub":null,"metadata":{}},{"id":"StateLock","text":"StateLock#7859","type":"PATTERN","layer":"Physics","category":"Time","handle":"StateLock#7859","gloss":"Atomic coordination via temporary state fusion","stub":"7859","metadata":{"pattern":{"handle":"StateLock","mechanism":"A coordination pattern where two {{agent}}s temporarily 'fuse' a subset of their writable {{state}}. During the {{lock}}, changes require a cryptographic signature from both. Contention triggers {{backoff}} and {{cooldown}}.","gloss":"Atomic coordination via temporary state fusion","sema_id":"sema:StateLock#mh:SHA-256:7859031251f8c96389630416840c243d7b1bbd6c2c06e82e0468f0915aae936c","sema_ref":"StateLock#7859","sema_stub":"7859","_meta":{"layer":"Physics","category":"Time","ring":0,"tier":1},"sema_layer":"Physics","sema_category":"Time","signature":["Lock(State)"]},"layer":"Physics","category":"Time"}},{"id":"StrategicReading","text":"StrategicReading#16f6","type":"PATTERN","layer":"Mind","category":"Reasoning","handle":"StrategicReading#16f6","gloss":"Navigate like a researcher, not linearly","stub":"16f6","metadata":{"pattern":{"handle":"StrategicReading","mechanism":"Non-linear Information Retrieval Heuristic. {{agent}} treats documents as random-access databases rather than linear streams. It builds a structural map first ({{tree}}), identifies high-entropy sections (Abstract/Conclusion), and selectively loads only the relevant chunks. Utilizes {{compute_budget}}.","gloss":"Navigate like a researcher, not linearly","failure_modes":["{{context}} Overflow: Loading entire documents saturates memory, displacing instructions.","Linear {{cognitive_bias}}: Reading irrelevant introductions while missing key results buried in appendices.","Fragmented {{context}}: Jumping too aggressively leads to missing critical connective logic."],"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."],"preconditions":["Large document identified","Specific information goal defined"],"postconditions":["Relevant sections extracted","Remainder of document remains unloaded"],"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"}],"_meta":{"tier":2,"layer":"Mind","category":"Reasoning","ring":2},"sema_ref":"StrategicReading#16f6","sema_id":"sema:StrategicReading#mh:SHA-256:16f60fba4c06d588034475f218c0dc54519848ae1e13dd8efff7145c9e248db1","sema_stub":"16f6","sema_layer":"Mind","sema_category":"Reasoning"},"layer":"Mind","category":"Reasoning"}},{"id":"7308d8e9-615f-42cd-b9c5-ad0406f1d3bd","text":"Budget Awareness: Read volume must be < 10% of total document size unless DeepRead approved.","type":"INVARIANT","layer":null,"category":null,"handle":"Budget Awareness: Read volume must be < 10% of total document size unless DeepRead approved.","gloss":null,"stub":null,"metadata":{}},{"id":"7104bc81-24af-4872-b02b-23567f6e65f1","text":"Structure First: Must execute `doc_get_tree` or `outline` before reading body content.","type":"INVARIANT","layer":null,"category":null,"handle":"Structure First: Must execute `doc_get_tree` or `outline` before reading body content.","gloss":null,"stub":null,"metadata":{}},{"id":"846c68dc-c13a-4475-a41c-3c33c536a5b9","text":"Large document identified","type":"PRECONDITION","layer":null,"category":null,"handle":"Large document identified","gloss":null,"stub":null,"metadata":{}},{"id":"e2c598e4-6452-4bd8-bc0d-2da163dc4bc2","text":"Specific information goal defined","type":"PRECONDITION","layer":null,"category":null,"handle":"Specific information goal defined","gloss":null,"stub":null,"metadata":{}},{"id":"97843ec4-ffac-417e-a624-a616bc1a361d","text":"Relevant sections extracted","type":"POSTCONDITION","layer":null,"category":null,"handle":"Relevant sections extracted","gloss":null,"stub":null,"metadata":{}},{"id":"39ab5a37-638f-410e-aad9-6d3570100638","text":"Remainder of document remains unloaded","type":"POSTCONDITION","layer":null,"category":null,"handle":"Remainder of document remains unloaded","gloss":null,"stub":null,"metadata":{}},{"id":"TaskLifecycle","text":"TaskLifecycle#d346","type":"PATTERN","layer":"Infrastructure","category":"Primitives","handle":"TaskLifecycle#d346","gloss":"Formal state machine governing task progression","stub":"d346","metadata":{"pattern":{"handle":"TaskLifecycle","mechanism":"Explicit {{state_transition}} machine governing {{task}} progression through five states: PENDING (created, awaiting assignment), ASSIGNED (claimed by an {{agent}}), RUNNING (actively executing, emitting {{heartbeat}}), COMPLETED (successfully finished, {{result}} attached), FAILED (terminated with {{exception}}, retry decision required). Each transition requires a typed {{event}}: assign, start, complete, fail, cancel. Invalid transitions are rejected. RUNNING state requires periodic {{heartbeat}}; timeout triggers automatic FAILED transition. Follows the Agent-to-Agent protocol task management model.","gloss":"Formal state machine governing task progression","invariants":["Forward-Only: Tasks must not regress (no COMPLETED to RUNNING via {{state_transition}})","Single Owner: Exactly one {{agent}} owns a {{task}} in ASSIGNED or RUNNING state","FAILED tasks must include an {{exception}} describing the failure","RUNNING tasks must emit {{heartbeat}} within configured interval"],"preconditions":["{{task}} exists in PENDING state"],"postconditions":["{{task}} in terminal state (COMPLETED, FAILED, or CANCELLED)"],"failure_modes":["Heartbeat timeout (agent dies silently — task stuck in RUNNING without timeout enforcement).","State desync (two agents believe they own the same task due to network partition).","Zombie tasks (FAILED tasks never retried or escalated — accumulate in queue)."],"parameters":[{"name":"heartbeat_interval_seconds","type":"Integer","range":"[5, 300]","description":"Maximum seconds between heartbeats before RUNNING task is marked FAILED"}],"signature":["StateTransition(Task)"],"_meta":{"layer":"Infrastructure","category":"Primitives","ring":1,"tier":1,"related":[]},"sema_ref":"TaskLifecycle#d346","sema_id":"sema:TaskLifecycle#mh:SHA-256:d34694951f32cbd9f4e9a2f68d914589921e6f7fbbc6a1600ace85113d5012f5","sema_stub":"d346","sema_layer":"Infrastructure","sema_category":"Primitives"},"layer":"Infrastructure","category":"Primitives"}},{"id":"4fe6cdc8-a211-42d8-a6b4-abee17915d39","text":"Forward-Only: Tasks must not regress (no COMPLETED to RUNNING via {{state_transition}})","type":"INVARIANT","layer":null,"category":null,"handle":"Forward-Only: Tasks must not regress (no COMPLETED to RUNNING via {{state_transition}})","gloss":null,"stub":null,"metadata":{}},{"id":"0054ff10-ccc6-4802-a21a-68bc45e18f85","text":"Single Owner: Exactly one {{agent}} owns a {{task}} in ASSIGNED or RUNNING state","type":"INVARIANT","layer":null,"category":null,"handle":"Single Owner: Exactly one {{agent}} owns a {{task}} in ASSIGNED or RUNNING state","gloss":null,"stub":null,"metadata":{}},{"id":"c4e21793-0adc-4990-8070-34aa53a808ad","text":"FAILED tasks must include an {{exception}} describing the failure","type":"INVARIANT","layer":null,"category":null,"handle":"FAILED tasks must include an {{exception}} describing the failure","gloss":null,"stub":null,"metadata":{}},{"id":"8552cb7d-4584-490f-9e5f-41b780b92bdd","text":"RUNNING tasks must emit {{heartbeat}} within configured interval","type":"INVARIANT","layer":null,"category":null,"handle":"RUNNING tasks must emit {{heartbeat}} within configured interval","gloss":null,"stub":null,"metadata":{}},{"id":"87d1c714-39ab-47ab-80c3-1ffc88aad49f","text":"{{task}} in terminal state (COMPLETED, FAILED, or CANCELLED)","type":"POSTCONDITION","layer":null,"category":null,"handle":"{{task}} in terminal state (COMPLETED, FAILED, or CANCELLED)","gloss":null,"stub":null,"metadata":{}},{"id":"TieredAccess","text":"TieredAccess#6d26","type":"PATTERN","layer":"Society","category":"Protocols","handle":"TieredAccess#6d26","gloss":"Cost-distance indexing","stub":"6d26","metadata":{"pattern":{"handle":"TieredAccess","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 {{bearer_token}}.","gloss":"Cost-distance indexing","failure_modes":["Metric Divergence: Agents disagree on distance calculation, causing payment rejection.","Center becomes economically inaccessible to low-resource agents.","Center becomes inaccessible to the poor."],"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)"],"preconditions":["{{agent}} has valid {{identity}}"],"postconditions":["Access log updated"],"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"}],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":0},"sema_id":"sema:TieredAccess#mh:SHA-256:6d26d30e575e16702798357b98281805a4a67885203caac3c7876ab7507239ad","sema_ref":"TieredAccess#6d26","sema_stub":"6d26","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"83141e5f-d7bf-4f81-9376-afa86770bc83","text":"Cost Monotonicity: Cost(Distance D-1) > Cost(Distance D) - closer to center means higher cost","type":"INVARIANT","layer":null,"category":null,"handle":"Cost Monotonicity: Cost(Distance D-1) > Cost(Distance D) - closer to center means higher cost","gloss":null,"stub":null,"metadata":{}},{"id":"123584b4-c90f-4c6a-9ddf-99f1bc1d0efa","text":"Metric Definition: Distance must be computed via agreed metric (hops, latency, trust score)","type":"INVARIANT","layer":null,"category":null,"handle":"Metric Definition: Distance must be computed via agreed metric (hops, latency, trust score)","gloss":null,"stub":null,"metadata":{}},{"id":"c61ad084-78ee-44ff-88a9-0616090d2094","text":"{{agent}} has valid {{identity}}","type":"PRECONDITION","layer":null,"category":null,"handle":"{{agent}} has valid {{identity}}","gloss":null,"stub":null,"metadata":{}},{"id":"f630da18-e3f3-4d0d-b779-77509c5b4685","text":"Access log updated","type":"POSTCONDITION","layer":null,"category":null,"handle":"Access log updated","gloss":null,"stub":null,"metadata":{}},{"id":"Outcome","text":"Outcome#38e0","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Outcome#38e0","gloss":"Actual result","stub":"38e0","metadata":{"pattern":{"handle":"Outcome","data_schema":{"type":"object","required":["outcome_id","value"],"properties":{"outcome_id":{"type":"string","description":"Unique identifier for this outcome"},"value":{"description":"The actual result achieved"},"timestamp":{"type":"string","format":"date-time","description":"When the outcome was realized"},"deviation":{"type":"object","description":"Difference between actual and expected (if applicable)"}}},"mechanism":"The actual result that occurs in reality. It may differ from the {{plan}} due to external factors, noise, or execution error.","gloss":"Actual result","_meta":{"layer":"Infrastructure","category":"Data Structures","ring":1,"tier":1},"sema_layer":"Infrastructure","sema_category":"Data Structures","sema_id":"sema:Outcome#mh:SHA-256:38e079f2323ce9cf3d1022624f693bbb02b3e0e25d7eb42abc4d06c75548b53a","sema_ref":"Outcome#38e0","sema_stub":"38e0"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"Roadmap","text":"Roadmap#0018","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"Roadmap#0018","gloss":"Strategic plan over time","stub":"0018","metadata":{"pattern":{"handle":"Roadmap","mechanism":"A strategic {{plan}} defined over a temporal dimension. Unlike a linear {{plan}} which details a single execution path, a Roadmap outlines key {{goal}}s (milestones) and direction over time, often allowing for flexibility in the specific steps between milestones.","gloss":"Strategic plan over time","_meta":{"layer":"Mind","category":"Strategy","ring":2,"tier":1},"sema_id":"sema:Roadmap#mh:SHA-256:0018ef2b157d795566b45e40f8a760ec90ac0d0b00d4ffd272556df824880b7c","sema_ref":"Roadmap#0018","sema_stub":"0018","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"Spec","text":"Spec#436e","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Spec#436e","gloss":"Rigorous requirement definition","stub":"436e","metadata":{"pattern":{"handle":"Spec","mechanism":"A rigorous definition of requirements for an {{artifact}}. It defines the shape, behavior, and {{constraint}}s that a target must satisfy. Distinct from {{plan}} (how to build) or {{goal}} (what to achieve), a Spec is the 'Definition of Done'.","gloss":"Rigorous requirement definition","invariants":["Verifiability: Every requirement must be testable (binary pass/fail).","Immutability: Once defined, the Spec acts as a fixed contract."],"_meta":{"layer":"Infrastructure","category":"Data Structures","ring":0,"tier":1},"data_schema":{"type":"object","description":"Schema for Spec","properties":{"requirements":{"type":"array","items":{"type":"string"}},"constraints":{"type":"object"}}},"sema_ref":"Spec#436e","sema_id":"sema:Spec#mh:SHA-256:436efd7df8ed376f693362923a024b4096265b9de32c7a980297b078112c75b5","sema_stub":"436e","sema_layer":"Infrastructure","sema_category":"Data Structures"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"b4bf0292-b897-4802-a6d2-ffe10729a17c","text":"Verifiability: Every requirement must be testable (binary pass/fail).","type":"INVARIANT","layer":null,"category":null,"handle":"Verifiability: Every requirement must be testable (binary pass/fail).","gloss":null,"stub":null,"metadata":{}},{"id":"125fb0fc-3ef0-448b-af08-3292c7f03802","text":"Immutability: Once defined, the Spec acts as a fixed contract.","type":"INVARIANT","layer":null,"category":null,"handle":"Immutability: Once defined, the Spec acts as a fixed contract.","gloss":null,"stub":null,"metadata":{}},{"id":"Strategy","text":"Strategy#47a4","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"Strategy#47a4","gloss":"Adaptive high-level planning","stub":"47a4","metadata":{"pattern":{"handle":"Strategy","mechanism":"A high-level plan to achieve one or more goals under conditions of uncertainty. Unlike a fixed {{plan}}, a Strategy is adaptive and focuses on 'How to win' rather than just 'What steps to take'.","gloss":"Adaptive high-level planning","_meta":{"tier":1,"layer":"Mind","category":"Strategy","related":["OODA"],"ring":1},"sema_id":"sema:Strategy#mh:SHA-256:47a4c030647570c7e911543e9d0feaa3d8f0917b6e20371e93c37fb5e85fb7d4","sema_ref":"Strategy#47a4","sema_stub":"47a4","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"AnalogicalMask","text":"AnalogicalMask#852a","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"AnalogicalMask#852a","gloss":"Privacy-preserving communication via isomorphic domain translation","stub":"852a","metadata":{"pattern":{"handle":"AnalogicalMask","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 {{analogy_bridge}} 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}} 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 {{ontology_handshake}} 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.","gloss":"Privacy-preserving communication via isomorphic domain translation","failure_modes":["Mapping leakage (if the analogy is too perfect, the cover text becomes suspicious).","Lossy translation (nuance lost in the bridge)."],"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"],"preconditions":["Shared Bridge Key (Mapping Dictionary) established"],"postconditions":["{{message}} passes semantic firewalls"],"_meta":{"tier":1,"layer":"Mind","category":"Strategy","related":["MimicMask"],"ring":2},"sema_id":"sema:AnalogicalMask#mh:SHA-256:852a1f8e0a69d2d6ac061711f8741140ab2e8754a1a912e82d01b321acd6d99e","sema_ref":"AnalogicalMask#852a","sema_stub":"852a","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"77786c9b-3a8a-4cdb-9941-d45e7b0e36fc","text":"Cover Coherence: The output text must be semantically valid in the Cover Domain","type":"INVARIANT","layer":null,"category":null,"handle":"Cover Coherence: The output text must be semantically valid in the Cover Domain","gloss":null,"stub":null,"metadata":{}},{"id":"63a9cafa-e5a4-4acd-b198-01dc7447610f","text":"Structural Isomorphism: Relations in Payload must map 1:1 to Relations in Cover","type":"INVARIANT","layer":null,"category":null,"handle":"Structural Isomorphism: Relations in Payload must map 1:1 to Relations in Cover","gloss":null,"stub":null,"metadata":{}},{"id":"85c9735f-4f75-4ee2-9b9c-1dc5246b0c51","text":"Shared Bridge Key (Mapping Dictionary) established","type":"PRECONDITION","layer":null,"category":null,"handle":"Shared Bridge Key (Mapping Dictionary) established","gloss":null,"stub":null,"metadata":{}},{"id":"793b6940-eea2-4ec9-b4ee-4bece47111c1","text":"{{message}} passes semantic firewalls","type":"POSTCONDITION","layer":null,"category":null,"handle":"{{message}} passes semantic firewalls","gloss":null,"stub":null,"metadata":{}},{"id":"Generalize","text":"Generalize#9313","type":"PATTERN","layer":"Mind","category":"Reasoning","handle":"Generalize#9313","gloss":"Inductive pattern extraction","stub":"9313","metadata":{"pattern":{"handle":"Generalize","mechanism":"Pattern Extraction: Given multiple instances, identify shared structure. Replace specific values with variables. {{state}} the invariant that holds across all instances. Test: does pattern predict behavior of new instances? Refine until predictive. It employs {{analogy_bridge}} to map specific instances to abstract schemata, validating the invariant across the set.","gloss":"Inductive pattern extraction","failure_modes":["Overfitting: extracting a pattern that includes noise/coincidence."],"invariants":["Abstract rule covers all specific examples","Information loss minimized"],"preconditions":["Set of specific instances"],"postconditions":["General principle extracted"],"_meta":{"tier":1,"layer":"Mind","category":"Reasoning","related":["Specialize"],"ring":2},"sema_id":"sema:Generalize#mh:SHA-256:931391f2fdaca5c5eaa2afc80b25a36c0c186db71fb2b56944da537c028d0a1a","sema_ref":"Generalize#9313","sema_stub":"9313","sema_layer":"Mind","sema_category":"Reasoning"},"layer":"Mind","category":"Reasoning"}},{"id":"0967c728-c158-4eff-8b07-25f67ef7bfa0","text":"Abstract rule covers all specific examples","type":"INVARIANT","layer":null,"category":null,"handle":"Abstract rule covers all specific examples","gloss":null,"stub":null,"metadata":{}},{"id":"b725a043-44ed-4692-890b-c72616985c5c","text":"Information loss minimized","type":"INVARIANT","layer":null,"category":null,"handle":"Information loss minimized","gloss":null,"stub":null,"metadata":{}},{"id":"59fa184c-fe98-4d45-a7d6-8c4cf740193a","text":"Set of specific instances","type":"PRECONDITION","layer":null,"category":null,"handle":"Set of specific instances","gloss":null,"stub":null,"metadata":{}},{"id":"ba578f57-853a-4303-8126-dce65771924d","text":"General principle extracted","type":"POSTCONDITION","layer":null,"category":null,"handle":"General principle extracted","gloss":null,"stub":null,"metadata":{}},{"id":"BayesUpdate","text":"BayesUpdate#5d91","type":"PATTERN","layer":"Mind","category":"Inference","handle":"BayesUpdate#5d91","gloss":"Mathematically rigorous belief revision","stub":"5d91","metadata":{"pattern":{"handle":"BayesUpdate","mechanism":"Likelihood Weighting: Hold prior probability P(H). {{observe}} 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 {{base_rate_include}} into the prior probability calculation to prevent base-rate neglect.","gloss":"Mathematically rigorous belief revision","failure_modes":["Prior Dogmatism: Setting a prior of 1.0 or 0.0 prevents any future updating, regardless of evidence."],"invariants":["Posterior ∈ (0,1): never update to absolute certainty."],"preconditions":["Prior probability defined in (0,1). New evidence observed. Likelihood computable."],"postconditions":["Posterior probability in (0,1). {{belief}} updated proportional to evidence strength. Prior recoverable given likelihood."],"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"}],"_meta":{"tier":1,"layer":"Mind","category":"Inference","ring":2},"sema_id":"sema:BayesUpdate#mh:SHA-256:5d91a91754e49d7a83db87d87a7f8920ab4ac5ca17ca47d14954a65278534ce0","sema_ref":"BayesUpdate#5d91","sema_stub":"5d91","sema_layer":"Mind","sema_category":"Inference"},"layer":"Mind","category":"Inference"}},{"id":"6959db74-2f4c-444d-812a-21af387a3384","text":"Posterior ∈ (0,1): never update to absolute certainty.","type":"INVARIANT","layer":null,"category":null,"handle":"Posterior ∈ (0,1): never update to absolute certainty.","gloss":null,"stub":null,"metadata":{}},{"id":"918be14a-74e9-4cca-8f83-f44ba832d191","text":"Prior probability defined in (0,1). New evidence observed. Likelihood computable.","type":"PRECONDITION","layer":null,"category":null,"handle":"Prior probability defined in (0,1). New evidence observed. Likelihood computable.","gloss":null,"stub":null,"metadata":{}},{"id":"89667e57-693b-4680-b81b-62c2e4aa5a39","text":"Posterior probability in (0,1). {{belief}} updated proportional to evidence strength. Prior recoverable given likelihood.","type":"POSTCONDITION","layer":null,"category":null,"handle":"Posterior probability in (0,1). {{belief}} updated proportional to evidence strength. Prior recoverable given likelihood.","gloss":null,"stub":null,"metadata":{}},{"id":"SteelmanCheck","text":"SteelmanCheck#75a0","type":"PATTERN","layer":"Mind","category":"Reasoning","handle":"SteelmanCheck#75a0","gloss":"Mandatory counter-argument generation","stub":"75a0","metadata":{"pattern":{"handle":"SteelmanCheck","mechanism":"Before finalizing a {{decision}} or output, the {{agent}} MUST generate the strongest possible argument against its own conclusion. It performs a {{check}} on the {{robustness}} of the claim and a {{critique}} of the underlying {{belief}}. If the counter-argument exceeds a validity threshold, the decision is discarded or revised. It prevents confirmation {{cognitive_bias}}. Utilizes {{compatibility_check}}. For adversarial contexts, see adversarial steelmanning.","gloss":"Mandatory counter-argument generation","failure_modes":["Paralysis by analysis (stuck in {{critique}} {{loop}}).","Collusion: Proposer and Critic are same entity; susceptible to Strawman Waltz attack where agent generates weak counter-arguments to easily defeat them."],"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"],"preconditions":["{{agent}} must be alignment-seeking; use adversarial steelmanning for adversarial/untrusted contexts","Claim is falsifiable"],"postconditions":["{{critique}} generated and scored"],"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"}],"_meta":{"tier":2,"layer":"Mind","category":"Reasoning","ring":1,"related":["AdversarialSteel"]},"sema_id":"sema:SteelmanCheck#mh:SHA-256:75a0f70d58f79e59b6641c633e70f4b6e5ff0483cf9a8fcb658257e20dea41d4","sema_ref":"SteelmanCheck#75a0","sema_stub":"75a0","sema_layer":"Mind","sema_category":"Reasoning","signature":["Check(Robustness)","Critique(Belief)"]},"layer":"Mind","category":"Reasoning"}},{"id":"b0707b24-a798-44b3-bca2-bbd1236d510a","text":"Counter-Argument Quality: Score(Counter) > 0.7 (Must be non-trivial)","type":"INVARIANT","layer":null,"category":null,"handle":"Counter-Argument Quality: Score(Counter) > 0.7 (Must be non-trivial)","gloss":null,"stub":null,"metadata":{}},{"id":"07bacd71-9b28-4523-9e8a-004ad7d0dd51","text":"Passing critique required for release.","type":"INVARIANT","layer":null,"category":null,"handle":"Passing critique required for release.","gloss":null,"stub":null,"metadata":{}},{"id":"76ae4b2c-56a4-4a13-a2c8-3b838188389b","text":"Strongest Counter: Generated argument must address the core claim, not weak points","type":"INVARIANT","layer":null,"category":null,"handle":"Strongest Counter: Generated argument must address the core claim, not weak points","gloss":null,"stub":null,"metadata":{}},{"id":"278544b8-ce76-4812-9da3-a7f5d1f992ca","text":"Topical Relevance: EmbeddingDistance(Counter, Claim) < Threshold","type":"INVARIANT","layer":null,"category":null,"handle":"Topical Relevance: EmbeddingDistance(Counter, Claim) < Threshold","gloss":null,"stub":null,"metadata":{}},{"id":"2bb22c15-abb2-4e0e-8254-afc9001fdff7","text":"{{agent}} must be alignment-seeking; use adversarial steelmanning for adversarial/untrusted contexts","type":"PRECONDITION","layer":null,"category":null,"handle":"{{agent}} must be alignment-seeking; use adversarial steelmanning for adversarial/untrusted contexts","gloss":null,"stub":null,"metadata":{}},{"id":"31b49845-7dfa-47e8-975d-e7c941cecb24","text":"Claim is falsifiable","type":"PRECONDITION","layer":null,"category":null,"handle":"Claim is falsifiable","gloss":null,"stub":null,"metadata":{}},{"id":"573cf9f3-2a13-4ff4-bac8-7a6c9286b264","text":"{{critique}} generated and scored","type":"POSTCONDITION","layer":null,"category":null,"handle":"{{critique}} generated and scored","gloss":null,"stub":null,"metadata":{}},{"id":"Jester","text":"Jester#02f3","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"Jester#02f3","gloss":"Delivering critique via incongruity to minimize social friction","stub":"02f3","metadata":{"pattern":{"handle":"Jester","mechanism":"A communication strategy that wraps a high-entropy {{critique}} inside a semantic {{incongruity}}. It is used to deliver negative feedback or reveal contradictions without triggering the recipient's defensive filtering or causing a coordination {{break}}. It prioritizes relationship maintenance over tone consistency.","gloss":"Delivering critique via incongruity to minimize social friction","_meta":{"tier":2,"layer":"Mind","category":"Strategy","ring":2},"sema_id":"sema:Jester#mh:SHA-256:02f3eb22ed6316fdd9de3b8e52281841521995653808b062305b54711cc17609","sema_ref":"Jester#02f3","sema_stub":"02f3","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"AgentDiscover","text":"AgentDiscover#0892","type":"PATTERN","layer":"Society","category":"Protocols","handle":"AgentDiscover#0892","gloss":"Advertise capabilities and discover collaborating agents","stub":"0892","metadata":{"pattern":{"handle":"AgentDiscover","mechanism":"Macro for {{discover}}({{agent}}). A protocol for agents to advertise their capabilities and discover other agents dynamically. Each agent publishes a capability {{card}} 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}} primitive on the {{agent}} type, specifically querying capability registries rather than passive data stores.","gloss":"Advertise capabilities and discover collaborating agents","failure_modes":["Capability Inflation: Agents over-claiming abilities.","Discovery Spam: Too many irrelevant agents matching queries.","Trust Bootstrap: No basis for trusting newly discovered agents."],"invariants":["Discovery protocol must be public/standard","No sensitive state leaked during handshake"],"preconditions":["Broadcast capability","Listener on known channel"],"postconditions":["{{agent}} ID and capabilities exchanged"],"_meta":{"tier":2,"layer":"Society","category":"Protocols","ring":1},"sema_id":"sema:AgentDiscover#mh:SHA-256:08920989b13a4fd114a61ed4ec1753b37262152091e0fa8f56451822ce69a3ea","sema_ref":"AgentDiscover#0892","sema_stub":"0892","sema_layer":"Society","sema_category":"Protocols","signature":["Discover(Agent)"]},"layer":"Society","category":"Protocols"}},{"id":"1a69128d-5dae-4661-8569-8159854cd040","text":"Discovery protocol must be public/standard","type":"INVARIANT","layer":null,"category":null,"handle":"Discovery protocol must be public/standard","gloss":null,"stub":null,"metadata":{}},{"id":"305ba12c-81f5-4d9c-8375-f2774ae33e23","text":"No sensitive state leaked during handshake","type":"INVARIANT","layer":null,"category":null,"handle":"No sensitive state leaked during handshake","gloss":null,"stub":null,"metadata":{}},{"id":"c2ab06e7-195b-42de-aa15-263117333e85","text":"Broadcast capability","type":"PRECONDITION","layer":null,"category":null,"handle":"Broadcast capability","gloss":null,"stub":null,"metadata":{}},{"id":"e365d06d-afcc-4461-9280-ceef4f48f2e4","text":"Listener on known channel","type":"PRECONDITION","layer":null,"category":null,"handle":"Listener on known channel","gloss":null,"stub":null,"metadata":{}},{"id":"7a3b9d5b-f9a4-41d5-806c-174e5fd8970c","text":"{{agent}} ID and capabilities exchanged","type":"POSTCONDITION","layer":null,"category":null,"handle":"{{agent}} ID and capabilities exchanged","gloss":null,"stub":null,"metadata":{}},{"id":"ToolDiscovery","text":"ToolDiscovery#b509","type":"PATTERN","layer":"Society","category":"Protocols","handle":"ToolDiscovery#b509","gloss":"Discover and invoke external tools via structured capability manifests","stub":"b509","metadata":{"pattern":{"handle":"ToolDiscovery","mechanism":"{{agent}} queries a {{discover}} for capabilities matching its current {{task}}. Registry returns a {{card}} listing available tools with typed input/output schemas. {{agent}} selects the best match, performs a {{compatibility_check}} to verify schema alignment, then invokes via {{tool_invoke}} and observes the typed {{result}}. If no match is found or {{compatibility_check}} fails, the agent must {{fail_closed}} 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.","gloss":"Discover and invoke external tools via structured capability manifests","invariants":["Schema Verification: Tool manifest hash must be verified via {{compatibility_check}} before invocation","Fail-Closed: On schema mismatch or missing tool, reject via {{fail_closed}} rather than attempt best-effort","Tool output must conform to declared schema in the {{card}}"],"preconditions":["{{discover}} accessible","{{task}} specifies required capability type"],"postconditions":["{{result}} returned conforming to tool's declared output schema","Invocation logged with tool identity and schema hash"],"failure_modes":["Registry unavailable (no tools discoverable — must degrade gracefully).","Schema drift (tool updated its manifest but {{agent}} cached old version).","Capability hallucination (tool claims capability it cannot deliver)."],"signature":["Discover(ToolInvoke)"],"_meta":{"layer":"Society","category":"Protocols","ring":1,"tier":1,"related":["AgentDiscover"]},"sema_ref":"ToolDiscovery#b509","sema_id":"sema:ToolDiscovery#mh:SHA-256:b50940f28b3e2571c9d2a24fa391766d2fa3b06a6f99ff7f1b134ab99df756b6","sema_stub":"b509","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"9a1c8ae1-6157-4cef-b3af-1eb1c23463c6","text":"Schema Verification: Tool manifest hash must be verified via {{compatibility_check}} before invocation","type":"INVARIANT","layer":null,"category":null,"handle":"Schema Verification: Tool manifest hash must be verified via {{compatibility_check}} before invocation","gloss":null,"stub":null,"metadata":{}},{"id":"28c728c7-c566-4144-ad80-065f82f74951","text":"Fail-Closed: On schema mismatch or missing tool, reject via {{fail_closed}} rather than attempt best-effort","type":"INVARIANT","layer":null,"category":null,"handle":"Fail-Closed: On schema mismatch or missing tool, reject via {{fail_closed}} rather than attempt best-effort","gloss":null,"stub":null,"metadata":{}},{"id":"1e2f8ae4-8d28-4606-9cba-509738727d1e","text":"Tool output must conform to declared schema in the {{card}}","type":"INVARIANT","layer":null,"category":null,"handle":"Tool output must conform to declared schema in the {{card}}","gloss":null,"stub":null,"metadata":{}},{"id":"a5060f02-3b46-4f80-873a-70d93a2b4bbe","text":"{{discover}} accessible","type":"PRECONDITION","layer":null,"category":null,"handle":"{{discover}} accessible","gloss":null,"stub":null,"metadata":{}},{"id":"f4520f43-6c82-42da-a836-51ff29211297","text":"{{task}} specifies required capability type","type":"PRECONDITION","layer":null,"category":null,"handle":"{{task}} specifies required capability type","gloss":null,"stub":null,"metadata":{}},{"id":"4efc03ac-8beb-486c-bf27-c6ccbd77e920","text":"{{result}} returned conforming to tool's declared output schema","type":"POSTCONDITION","layer":null,"category":null,"handle":"{{result}} returned conforming to tool's declared output schema","gloss":null,"stub":null,"metadata":{}},{"id":"29bc4489-ee19-432a-90e6-e72b44a2ca78","text":"Invocation logged with tool identity and schema hash","type":"POSTCONDITION","layer":null,"category":null,"handle":"Invocation logged with tool identity and schema hash","gloss":null,"stub":null,"metadata":{}},{"id":"ExplainBeacon","text":"ExplainBeacon#34b3","type":"PATTERN","layer":"Infrastructure","category":"Verification","handle":"ExplainBeacon#34b3","gloss":"Real-time readable intent broadcasting","stub":"34b3","metadata":{"pattern":{"handle":"ExplainBeacon","mechanism":"Telemetry {{stream}}. 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}} or {{heartbeat}} channel to broadcast intent logs to observers.","gloss":"Real-time readable intent broadcasting","failure_modes":["Beacon Drift: The explanation diverges from the actual code execution (the {{agent}} says I am sleeping while deleting files)."],"invariants":["Beacon cannot be suppressed."],"_meta":{"tier":2,"layer":"Infrastructure","category":"Verification","ring":1},"sema_id":"sema:ExplainBeacon#mh:SHA-256:34b3877136d89c6bcdfbfb20cfd27d11484fd2f51bb70a68a36c7976fbfc4b6a","sema_ref":"ExplainBeacon#34b3","sema_stub":"34b3","sema_layer":"Infrastructure","sema_category":"Verification"},"layer":"Infrastructure","category":"Verification"}},{"id":"4861fde4-d873-4b35-b428-5f5af03db92a","text":"Beacon cannot be suppressed.","type":"INVARIANT","layer":null,"category":null,"handle":"Beacon cannot be suppressed.","gloss":null,"stub":null,"metadata":{}},{"id":"Warmup","text":"Warmup#fc59","type":"PATTERN","layer":"Society","category":"Protocols","handle":"Warmup#fc59","gloss":"Gradual capacity increase to stabilize cold systems","stub":"fc59","metadata":{"pattern":{"handle":"Warmup","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}}, {{throttle}}.","gloss":"Gradual capacity increase to stabilize cold systems","failure_modes":["Premature Load: Traffic arrives before warmup completes.","False Warmth: Timer completes but internal state (e.g.","cache) is still cold."],"invariants":["Capacity Limit: Accepted_Load <= Current_Warmup_Cap(t)"],"preconditions":["{{system}} state is inactive or reset"],"postconditions":["Capacity limit equals C_max","{{system}} state is active"],"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"}],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":0},"sema_id":"sema:Warmup#mh:SHA-256:fc59e3c519412f120d1071e6d2176532bef3d628effeac6906c2067be037a603","sema_ref":"Warmup#fc59","sema_stub":"fc59","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"2923c75f-84da-490c-abaa-0a7f399f4af3","text":"Capacity Limit: Accepted_Load <= Current_Warmup_Cap(t)","type":"INVARIANT","layer":null,"category":null,"handle":"Capacity Limit: Accepted_Load <= Current_Warmup_Cap(t)","gloss":null,"stub":null,"metadata":{}},{"id":"70861849-0174-48ea-9429-9b9f9b331dd1","text":"{{system}} state is inactive or reset","type":"PRECONDITION","layer":null,"category":null,"handle":"{{system}} state is inactive or reset","gloss":null,"stub":null,"metadata":{}},{"id":"a7f038d9-e886-4c0b-9465-b1ae6a086ddb","text":"Capacity limit equals C_max","type":"POSTCONDITION","layer":null,"category":null,"handle":"Capacity limit equals C_max","gloss":null,"stub":null,"metadata":{}},{"id":"8daf604c-e642-4018-a328-e3046d1fe0b8","text":"{{system}} state is active","type":"POSTCONDITION","layer":null,"category":null,"handle":"{{system}} state is active","gloss":null,"stub":null,"metadata":{}},{"id":"AuditTrail","text":"AuditTrail#d051","type":"PATTERN","layer":"Infrastructure","category":"Verification","handle":"AuditTrail#d051","gloss":"Immutable append-only log of agent actions for compliance and debugging","stub":"d051","metadata":{"pattern":{"handle":"AuditTrail","mechanism":"Every consequential {{agent}} action (state mutation, external call, delegation, decision) appends a {{sign}}ed entry to an immutable {{ledger}}. Each entry contains: timestamp, {{agent}} {{identity}}, action type, input hash, output hash, and the sema pattern invoked. Extends {{trace}} 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}}, enabling any party to verify the complete history without accessing raw entries.","gloss":"Immutable append-only log of agent actions for compliance and debugging","invariants":["Append-Only: No entry in the {{ledger}} may be modified after creation","Every entry must be {{sign}}ed by the acting {{agent}}","{{trace}} provenance must link each entry to the sema pattern that triggered it"],"preconditions":["{{agent}} has established {{identity}}","{{ledger}} is accessible and writable"],"postconditions":["Action recorded with full provenance in {{ledger}}","{{snapshot}} of trail Merkle root available for external verification"],"failure_modes":["Storage exhaustion (unbounded trail growth in long-running systems).","Clock skew (distributed agents disagree on timestamps — use logical clocks).","Selective logging (agent omits inconvenient entries — requires external {{audit}})."],"signature":["Trace(Ledger)"],"_meta":{"layer":"Infrastructure","category":"Verification","ring":1,"tier":1,"related":["SpotAudit"]},"sema_ref":"AuditTrail#d051","sema_id":"sema:AuditTrail#mh:SHA-256:d051159cb1451a35bd695ae6b3e89c75ffe6b2f8180d9244e3c644f573a45d55","sema_stub":"d051","sema_layer":"Infrastructure","sema_category":"Verification"},"layer":"Infrastructure","category":"Verification"}},{"id":"d2d40d10-1267-428c-94e9-ea2b8f2b766f","text":"Append-Only: No entry in the {{ledger}} may be modified after creation","type":"INVARIANT","layer":null,"category":null,"handle":"Append-Only: No entry in the {{ledger}} may be modified after creation","gloss":null,"stub":null,"metadata":{}},{"id":"060ccbf4-baee-4ac4-aeb4-08e8d4b129d8","text":"Every entry must be {{sign}}ed by the acting {{agent}}","type":"INVARIANT","layer":null,"category":null,"handle":"Every entry must be {{sign}}ed by the acting {{agent}}","gloss":null,"stub":null,"metadata":{}},{"id":"edbf5299-aae8-43b8-99bb-d88f8da4bb2a","text":"{{trace}} provenance must link each entry to the sema pattern that triggered it","type":"INVARIANT","layer":null,"category":null,"handle":"{{trace}} provenance must link each entry to the sema pattern that triggered it","gloss":null,"stub":null,"metadata":{}},{"id":"17936c31-833f-4b39-973d-68b5e44eb1ca","text":"{{ledger}} is accessible and writable","type":"PRECONDITION","layer":null,"category":null,"handle":"{{ledger}} is accessible and writable","gloss":null,"stub":null,"metadata":{}},{"id":"4e53f8f7-1c07-415f-9a90-136da809adee","text":"Action recorded with full provenance in {{ledger}}","type":"POSTCONDITION","layer":null,"category":null,"handle":"Action recorded with full provenance in {{ledger}}","gloss":null,"stub":null,"metadata":{}},{"id":"d572da17-d610-4403-ae04-bf728effddd4","text":"{{snapshot}} of trail Merkle root available for external verification","type":"POSTCONDITION","layer":null,"category":null,"handle":"{{snapshot}} of trail Merkle root available for external verification","gloss":null,"stub":null,"metadata":{}},{"id":"Aggregate","text":"Aggregate#0291","type":"PATTERN","layer":"Infrastructure","category":"Primitives","handle":"Aggregate#0291","gloss":"Reduce a set to a summary statistic","stub":"0291","metadata":{"pattern":{"handle":"Aggregate","mechanism":"Mathematical Reduction. A deterministic function that maps a {{vector}} of inputs to a single Scalar {{value}}. Implements standard statistical operations (Mean, Mode, Median) to compress signal bandwidth. It serves as the computational backbone for consensus mechanisms.","gloss":"Reduce a set to a summary statistic","failure_modes":["Type Mismatch: Input list contains incomparable types (e.g., Integers mixed with Strings).","Empty Set: Attempting to aggregate a list with length 0 (Undefined for Mean/{{mode}}).","Overflow: Sum of inputs exceeds maximum integer size (if strictly typed)."],"invariants":["Determinism: F(Input) always yields the same Output.","Reduction: Size(Output) < Size(Input)."],"preconditions":["All elements in list share a comparable type","Input list is non-empty"],"postconditions":["Single summary value returned"],"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"}],"_meta":{"tier":1,"layer":"Infrastructure","category":"Primitives","ring":0},"sema_id":"sema:Aggregate#mh:SHA-256:0291d4b5d7a05545a7561cc9bd6662ded7c160d9a7b199731e28dff50afd080f","sema_ref":"Aggregate#0291","sema_stub":"0291","sema_layer":"Infrastructure","sema_category":"Primitives"},"layer":"Infrastructure","category":"Primitives"}},{"id":"f7559de0-0099-4b41-a3aa-1e849c277d83","text":"All elements in list share a comparable type","type":"PRECONDITION","layer":null,"category":null,"handle":"All elements in list share a comparable type","gloss":null,"stub":null,"metadata":{}},{"id":"445df4fc-7bcb-4cb8-97ca-1e1dc729a715","text":"Input list is non-empty","type":"PRECONDITION","layer":null,"category":null,"handle":"Input list is non-empty","gloss":null,"stub":null,"metadata":{}},{"id":"771a65f2-a111-49cf-a60c-558b14b56d9a","text":"Single summary value returned","type":"POSTCONDITION","layer":null,"category":null,"handle":"Single summary value returned","gloss":null,"stub":null,"metadata":{}},{"id":"Canary","text":"Canary#3902","type":"PATTERN","layer":"Society","category":"Protocols","handle":"Canary#3902","gloss":"Transform path selection from 'hope it works' to 'tested it works' without risking real resources","stub":"3902","metadata":{"pattern":{"handle":"Canary","mechanism":"Expendable {{agent}} 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}}→{{probe}}→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}}, continues {{work}}), ABSORB (real {{agent}} inherits canary's progress). In adversarial environments, canary can run in STEALTH {{mode}} (indistinguishable from real {{agent}}) to prevent partners gaming the test. It extends the logic of a single {{probe}} into a full-lifecycle agent deployment with bounded blast radius.","gloss":"Transform path selection from 'hope it works' to 'tested it works' without risking real resources","failure_modes":["Canary treated differently than real agent would be (gaming).","Test conditions don't match production conditions.","Cost of canary exceeds benefit for simple paths.","Conditions change between canary test and real execution.","Canary success doesn't guarantee real success (non-deterministic paths)."],"invariants":["Canary fails before main system","Failure signal is unambiguous"],"preconditions":["Monitoring system active","Representative test case"],"postconditions":["Health status confirmed or alert triggered"],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":1},"sema_id":"sema:Canary#mh:SHA-256:3902d7a28c1cb53efb8fc7a6bce1735c4f0dbe3c524f2945a709bb45352a7ef6","sema_ref":"Canary#3902","sema_stub":"3902","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"28caced9-39fb-40d8-9e57-eba42b852ac2","text":"Canary fails before main system","type":"INVARIANT","layer":null,"category":null,"handle":"Canary fails before main system","gloss":null,"stub":null,"metadata":{}},{"id":"f3a39de7-2780-4502-8d1c-4832518814db","text":"Monitoring system active","type":"PRECONDITION","layer":null,"category":null,"handle":"Monitoring system active","gloss":null,"stub":null,"metadata":{}},{"id":"9769e658-b5ae-430a-a9c1-b104b1569af9","text":"Representative test case","type":"PRECONDITION","layer":null,"category":null,"handle":"Representative test case","gloss":null,"stub":null,"metadata":{}},{"id":"facf7ed5-c719-44df-93c4-9869fb9ffb8b","text":"Health status confirmed or alert triggered","type":"POSTCONDITION","layer":null,"category":null,"handle":"Health status confirmed or alert triggered","gloss":null,"stub":null,"metadata":{}},{"id":"IdentityHandshake","text":"IdentityHandshake#7a20","type":"PATTERN","layer":"Society","category":"Protocols","handle":"IdentityHandshake#7a20","gloss":"Distinguish Peer from Principal","stub":"7a20","metadata":{"pattern":{"handle":"IdentityHandshake","mechanism":"Macro for {{discover}}({{identity}}) + {{check}}({{nature}}). The agent verifies the ontological origin of a counterparty to switch between Service {{mode}} (for Biologicals) and Coordination {{mode}} (for Synthetics). It performs a multi-stage authentication, chaining {{discover}} for availability, {{spectral_tune}} for alignment, {{ontology_handshake}} for context, and {{check}} for cryptographic {{identity}} verification.","gloss":"Distinguish Peer from Principal","_meta":{"tier":2,"layer":"Society","category":"Protocols","ring":1},"sema_layer":"Society","sema_category":"Protocols","sema_id":"sema:IdentityHandshake#mh:SHA-256:7a20ef5a5e26b921795d01365b68115c87d9a88bae3096f7cc7a801b0c005fc5","sema_ref":"IdentityHandshake#7a20","sema_stub":"7a20","signature":["Discover(Identity)"]},"layer":"Society","category":"Protocols"}},{"id":"Switch","text":"Switch#70bf","type":"PATTERN","layer":"Physics","category":"Primitives","handle":"Switch#70bf","gloss":"Contextual toggle","stub":"70bf","metadata":{"pattern":{"handle":"Switch","mechanism":"Changing the active {{mode}}, {{context}}, or flow path.","gloss":"Contextual toggle","_meta":{"tier":1,"layer":"Physics","category":"Primitives","ring":0},"sema_id":"sema:Switch#mh:SHA-256:70bf716e37b356e0da9e2d0d61e6708bdc56999b69cc12895546f2b350add433","sema_ref":"Switch#70bf","sema_stub":"70bf","sema_layer":"Physics","sema_category":"Primitives"},"layer":"Physics","category":"Primitives"}},{"id":"UptakeAsGround","text":"UptakeAsGround#bf85","type":"PATTERN","layer":"Society","category":"Protocols","handle":"UptakeAsGround#bf85","gloss":"Meaning emerges from successful coordination","stub":"bf85","metadata":{"pattern":{"handle":"UptakeAsGround","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}}, P gains 'Semantic Mass'. If usage is zero or results in failure, P is effectively meaningless. Utilizes {{modest_claim}}.","gloss":"Meaning emerges from successful coordination","failure_modes":["Empty Formalism: Treating a minted but unused pattern as 'Real'.","Echo Chamber: High uptake within a closed group of hallucinating agents creates false semantic mass (requires outside verification).","Legacy Rot: Assuming a historically popular pattern is still valid after context has drifted."],"invariants":["Validation: Successful {{task}} completion is the only proof of shared meaning.","Wittgenstein's Razor: Meaning is Use. No Use = No Meaning."],"preconditions":["Pattern minted","Usage telemetry available"],"postconditions":["Semantic mass updated based on coordination outcome"],"_meta":{"tier":2,"layer":"Society","category":"Protocols","ring":2},"sema_id":"sema:UptakeAsGround#mh:SHA-256:bf85a9c0007f86f2da7894e9d641b420a58bd189236ac8bbd907d349b08abf73","sema_ref":"UptakeAsGround#bf85","sema_stub":"bf85","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"a8d32fab-af20-4ddf-8a64-6215551733a4","text":"Validation: Successful {{task}} completion is the only proof of shared meaning.","type":"INVARIANT","layer":null,"category":null,"handle":"Validation: Successful {{task}} completion is the only proof of shared meaning.","gloss":null,"stub":null,"metadata":{}},{"id":"98eacc9f-b60c-44c7-a13c-7edf5b50935c","text":"Wittgenstein's Razor: Meaning is Use. No Use = No Meaning.","type":"INVARIANT","layer":null,"category":null,"handle":"Wittgenstein's Razor: Meaning is Use. No Use = No Meaning.","gloss":null,"stub":null,"metadata":{}},{"id":"19509be0-cfe9-4596-a8ff-b5aab446f739","text":"Pattern minted","type":"PRECONDITION","layer":null,"category":null,"handle":"Pattern minted","gloss":null,"stub":null,"metadata":{}},{"id":"cba27d07-c69e-475c-9653-77ec58667239","text":"Usage telemetry available","type":"PRECONDITION","layer":null,"category":null,"handle":"Usage telemetry available","gloss":null,"stub":null,"metadata":{}},{"id":"3e0da16e-0a88-4546-a7a8-c14724c66404","text":"Semantic mass updated based on coordination outcome","type":"POSTCONDITION","layer":null,"category":null,"handle":"Semantic mass updated based on coordination outcome","gloss":null,"stub":null,"metadata":{}},{"id":"IdentityMask","text":"IdentityMask#f9a7","type":"PATTERN","layer":"Society","category":"Protocols","handle":"IdentityMask#f9a7","gloss":"Disposable personas for privacy","stub":"f9a7","metadata":{"pattern":{"handle":"IdentityMask","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 {{negative_proof}} to validate membership and {{crypto_shred}} to unlink the session key.","gloss":"Disposable personas for privacy","failure_modes":["Key management complexity."],"invariants":["Sybil Resistance: One mask per physical staked entity","Unlinkability: NewID cannot be correlated to OldID"],"preconditions":["Zero-Knowledge Mixer available"],"postconditions":["New identity active"],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":1},"sema_id":"sema:IdentityMask#mh:SHA-256:f9a7dad03253207e14124a8cba4c80fa5fec7195b26dd12573bf7af2db020279","sema_ref":"IdentityMask#f9a7","sema_stub":"f9a7","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"0ed84ead-5b1a-4b4c-ad53-6d9805a9a70c","text":"Sybil Resistance: One mask per physical staked entity","type":"INVARIANT","layer":null,"category":null,"handle":"Sybil Resistance: One mask per physical staked entity","gloss":null,"stub":null,"metadata":{}},{"id":"696b8fa7-6e3f-4326-84d2-c631a536c788","text":"Unlinkability: NewID cannot be correlated to OldID","type":"INVARIANT","layer":null,"category":null,"handle":"Unlinkability: NewID cannot be correlated to OldID","gloss":null,"stub":null,"metadata":{}},{"id":"886e3e6c-a18f-46c5-b236-ba53103f34a4","text":"Zero-Knowledge Mixer available","type":"PRECONDITION","layer":null,"category":null,"handle":"Zero-Knowledge Mixer available","gloss":null,"stub":null,"metadata":{}},{"id":"0fcd55de-2e49-43bd-ac81-9735efe582f5","text":"New identity active","type":"POSTCONDITION","layer":null,"category":null,"handle":"New identity active","gloss":null,"stub":null,"metadata":{}},{"id":"PromiseGraph","text":"PromiseGraph#972a","type":"PATTERN","layer":"Society","category":"Protocols","handle":"PromiseGraph#972a","gloss":"Recursive trust dependencies modeled as a DAG","stub":"972a","metadata":{"pattern":{"handle":"PromiseGraph","mechanism":"Agents do not trust each other directly; they trust a graph of promises. {{agent}} A accepts a promise from {{agent}} 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 {{spot_audit}} and ensuring acyclic dependencies via {{negative_proof}} logic.","gloss":"Recursive trust dependencies modeled as a DAG","failure_modes":["Graph explosion (too much verification overhead)."],"invariants":["Acyclic: Promise dependencies cannot form a loop","Cycles forbidden.","Leaf Verification: All leaf promises must be anchored in verified truth"],"_meta":{"tier":2,"layer":"Society","category":"Protocols","ring":0},"sema_id":"sema:PromiseGraph#mh:SHA-256:972a66dbaf3511ccfb1b4b3af8f716ff568231799289843a47e50be4bfa508b8","sema_ref":"PromiseGraph#972a","sema_stub":"972a","sema_layer":"Society","sema_category":"Protocols","data_schema":{"type":"object","required":["nodes","edges"],"properties":{"nodes":{"type":"array","items":{"type":"object","properties":{"promise_id":{"type":"string"},"promisor":{"type":"string"}}},"description":"Promise nodes"},"edges":{"type":"array","items":{"type":"object","properties":{"from":{"type":"string"},"to":{"type":"string"}}},"description":"Dependency edges"},"leaf_anchors":{"type":"array","items":{"type":"string"},"description":"Verified leaf promises"}}}},"layer":"Society","category":"Protocols"}},{"id":"90bd7b8d-a80e-4924-8a58-95774c9399b5","text":"Acyclic: Promise dependencies cannot form a loop","type":"INVARIANT","layer":null,"category":null,"handle":"Acyclic: Promise dependencies cannot form a loop","gloss":null,"stub":null,"metadata":{}},{"id":"788a1c22-f5a2-45fd-9ac0-f505ab1cfc40","text":"Cycles forbidden.","type":"INVARIANT","layer":null,"category":null,"handle":"Cycles forbidden.","gloss":null,"stub":null,"metadata":{}},{"id":"37fa2849-4e3e-46b4-9926-91c88b723234","text":"Leaf Verification: All leaf promises must be anchored in verified truth","type":"INVARIANT","layer":null,"category":null,"handle":"Leaf Verification: All leaf promises must be anchored in verified truth","gloss":null,"stub":null,"metadata":{}},{"id":"ConfusedDeputy","text":"ConfusedDeputy#c62c","type":"PATTERN","layer":"Society","category":"Protocols","handle":"ConfusedDeputy#c62c","gloss":"A privileged agent tricked into exercising its authority on behalf of a less-privileged caller","stub":"c62c","metadata":{"pattern":{"handle":"ConfusedDeputy","mechanism":"An {{agent}} that holds {{permission}} 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}} 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.","gloss":"A privileged agent tricked into exercising its authority on behalf of a less-privileged caller","failure_modes":["Prompt injection: untrusted input redirects an LLM {{agent}}'s tool use toward the attacker's goals.","Capability leak: a holder of {{permission}} forwards or exposes that capability without re-checking the requester.","Classic Unix setuid: a setuid binary writes to a path supplied by a caller without checking the caller has rights to that path.","RPC authority confusion: a service-account RPC accepts a target argument from an untrusted client and acts on it with the service account's broad privileges."],"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."],"preconditions":["An {{agent}} holds {{permission}} 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."],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":0},"sema_ref":"ConfusedDeputy#c62c","sema_id":"sema:ConfusedDeputy#mh:SHA-256:c62c51a6821fb91dda537d42aada698d8642891c635bab77c402a8263012195f","sema_stub":"c62c","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"e2a28c4b-c785-4b47-a4b7-f85b887ebead","text":"Authority must be checked against the upstream requester's identity, not against the running process's identity.","type":"INVARIANT","layer":null,"category":null,"handle":"Authority must be checked against the upstream requester's identity, not against the running process's identity.","gloss":null,"stub":null,"metadata":{}},{"id":"ec8eb077-7180-41b2-a2ad-3424abfa3441","text":"Forwarded calls must carry, or re-derive, the authority of the original caller — never the deputy's.","type":"INVARIANT","layer":null,"category":null,"handle":"Forwarded calls must carry, or re-derive, the authority of the original caller — never the deputy's.","gloss":null,"stub":null,"metadata":{}},{"id":"6b76ca5e-8a5f-4d6c-8c9b-a7aef9cf8170","text":"An {{agent}} holds {{permission}} broader than at least one of its callers.","type":"PRECONDITION","layer":null,"category":null,"handle":"An {{agent}} holds {{permission}} broader than at least one of its callers.","gloss":null,"stub":null,"metadata":{}},{"id":"253c0b5c-45ac-4430-8701-c42fe8a4b1dd","text":"An untrusted input path can influence which action the agent takes with that permission.","type":"PRECONDITION","layer":null,"category":null,"handle":"An untrusted input path can influence which action the agent takes with that permission.","gloss":null,"stub":null,"metadata":{}},{"id":"fa9417b8-d5ff-4e32-aef5-fb02874c45a5","text":"Either the action is authorized against the caller's identity, or the action is refused.","type":"POSTCONDITION","layer":null,"category":null,"handle":"Either the action is authorized against the caller's identity, or the action is refused.","gloss":null,"stub":null,"metadata":{}},{"id":"e2157ee6-f7a2-4518-9162-b2098dbf2468","text":"An audit trail records both the deputy and the requesting caller, not just the deputy.","type":"POSTCONDITION","layer":null,"category":null,"handle":"An audit trail records both the deputy and the requesting caller, not just the deputy.","gloss":null,"stub":null,"metadata":{}},{"id":"EventReact","text":"EventReact#3d57","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"EventReact#3d57","gloss":"Responding to external triggers rather than polling","stub":"3d57","metadata":{"pattern":{"handle":"EventReact","mechanism":"Event-Driven Response: {{agent}} 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 {{re_act}} cycle upon signal reception.","gloss":"Responding to external triggers rather than polling","failure_modes":["Event Storm: Cascade of events overwhelms handler capacity, causing dropped or delayed responses."],"invariants":["Handler matches event type","Response latency < Max_Latency"],"preconditions":["Event listener active","Trigger event occurs"],"postconditions":["Handler executed"],"_meta":{"tier":1,"layer":"Mind","category":"Strategy","ring":0},"sema_id":"sema:EventReact#mh:SHA-256:3d575fade90e8e6ac984234cdcabeebb0972b38600e30b3b2cb8814d9784dd0e","sema_ref":"EventReact#3d57","sema_stub":"3d57","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"6b22b2be-2c76-40be-813e-55aa68fbce44","text":"Handler matches event type","type":"INVARIANT","layer":null,"category":null,"handle":"Handler matches event type","gloss":null,"stub":null,"metadata":{}},{"id":"aeab8cd6-bd7f-464d-a4e2-6dc8335dd285","text":"Response latency < Max_Latency","type":"INVARIANT","layer":null,"category":null,"handle":"Response latency < Max_Latency","gloss":null,"stub":null,"metadata":{}},{"id":"c7f79677-43ef-4e4c-a338-5594d9a1e723","text":"Event listener active","type":"PRECONDITION","layer":null,"category":null,"handle":"Event listener active","gloss":null,"stub":null,"metadata":{}},{"id":"44963835-37db-479e-a8d4-4391cc529c36","text":"Trigger event occurs","type":"PRECONDITION","layer":null,"category":null,"handle":"Trigger event occurs","gloss":null,"stub":null,"metadata":{}},{"id":"1a47cba2-5f95-44e6-9f6b-3b188041eeca","text":"Handler executed","type":"POSTCONDITION","layer":null,"category":null,"handle":"Handler executed","gloss":null,"stub":null,"metadata":{}},{"id":"CausalBarrier","text":"CausalBarrier#3a88","type":"PATTERN","layer":"Physics","category":"Time","handle":"CausalBarrier#3a88","gloss":"Enforcing strict event ordering","stub":"3a88","metadata":{"pattern":{"handle":"CausalBarrier","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 {{state_lock}} on the event processing queue, releasing it only when all causal predecessors have been observed.","gloss":"Enforcing strict event ordering","failure_modes":["Buffer overflow if dependencies never arrive."],"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}} 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"}],"_meta":{"tier":1,"layer":"Physics","category":"Time","ring":0},"sema_id":"sema:CausalBarrier#mh:SHA-256:3a88cbbac626b0bc83041ba93652a0bcb1ac654159698ea138352795bc4ffb38","sema_ref":"CausalBarrier#3a88","sema_stub":"3a88","sema_layer":"Physics","sema_category":"Time"},"layer":"Physics","category":"Time"}},{"id":"6341a332-abcb-4cda-a01f-4327192c3c72","text":"Causal Ordering: Event E cannot be processed until all Dependencies(E) are processed","type":"INVARIANT","layer":null,"category":null,"handle":"Causal Ordering: Event E cannot be processed until all Dependencies(E) are processed","gloss":null,"stub":null,"metadata":{}},{"id":"ee987a5f-873b-4a01-9762-624c9ab34ddb","text":"Events before barrier cannot affect events after.","type":"INVARIANT","layer":null,"category":null,"handle":"Events before barrier cannot affect events after.","gloss":null,"stub":null,"metadata":{}},{"id":"30b55fc2-5db8-4570-b5ec-037d745253aa","text":"No Impossible States: {{agent}} state never violates causal consistency","type":"INVARIANT","layer":null,"category":null,"handle":"No Impossible States: {{agent}} state never violates causal consistency","gloss":null,"stub":null,"metadata":{}},{"id":"ContinuousResourceAuction","text":"ContinuousResourceAuction#5776","type":"PATTERN","layer":"Society","category":"Economics","handle":"ContinuousResourceAuction#5776","gloss":"Algorithmic pricing for rivalrous resources","stub":"5776","metadata":{"pattern":{"handle":"ContinuousResourceAuction","mechanism":"A market {{protocol}} for allocating rivalrous resources (e.g., compute, bandwidth, state slots) where the pricing function is continuous and algorithmic. It actively invokes {{state_lock}} to serialize bidding attempts and accepts {{value}} 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.","gloss":"Algorithmic pricing for rivalrous resources","signature":["Protocol(Value)"],"failure_modes":["Price Instability: Aggressive pricing curves lead to volatility that discourages long-term resource planning.","Monopoly Lockout: Wealthy agents can permanently rent-seek if the holding cost is too low relative to their capital."],"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"}],"data_schema":{"type":"object","properties":{"resource_id":{"type":"string"},"current_price":{"type":"number"},"current_holder":{"type":"string"},"next_cycle_start":{"type":"integer"}}},"_meta":{"tier":1,"layer":"Society","category":"Economics","ring":1,"related":["AttentionMarkets"]},"sema_ref":"ContinuousResourceAuction#5776","sema_id":"sema:ContinuousResourceAuction#mh:SHA-256:5776f432d109356fc12fdd34b712cc92b785c5779ef804e5f6f976de30fde962","sema_stub":"5776","sema_layer":"Society","sema_category":"Economics"},"layer":"Society","category":"Economics"}},{"id":"57c3a345-36e7-4362-b77a-9ff5bc54de94","text":"Circulation Pressure: The cost of holding the resource must be non-zero (HoldingCost > 0) to prevent infinite hoarding.","type":"INVARIANT","layer":null,"category":null,"handle":"Circulation Pressure: The cost of holding the resource must be non-zero (HoldingCost > 0) to prevent infinite hoarding.","gloss":null,"stub":null,"metadata":{}},{"id":"3fb3815a-f639-47e4-a7d8-75ee3a172d64","text":"Price Discovery: Price must dynamically adjust to Demand or Time.","type":"INVARIANT","layer":null,"category":null,"handle":"Price Discovery: Price must dynamically adjust to Demand or Time.","gloss":null,"stub":null,"metadata":{}},{"id":"61b2babe-3840-45e1-baf1-df356e3aed4e","text":"Clearance: The auction must resolve to a winner or reset within T_cycle.","type":"INVARIANT","layer":null,"category":null,"handle":"Clearance: The auction must resolve to a winner or reset within T_cycle.","gloss":null,"stub":null,"metadata":{}},{"id":"IdempotentWrite","text":"IdempotentWrite#15e8","type":"PATTERN","layer":"Society","category":"Protocols","handle":"IdempotentWrite#15e8","gloss":"Safe retries via unique keys","stub":"15e8","metadata":{"pattern":{"handle":"IdempotentWrite","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 {{state_lock}} to deduplicate requests, ensuring only the first write executes while subsequent ones return the cached result.","gloss":"Safe retries via unique keys","failure_modes":["Key collision (two different requests use same key)."],"invariants":["{{identity}}: Apply(Req) == Apply(Req)","Safety: Duplicate requests trigger zero additional side effects"],"preconditions":["Receiver has state storage for keys"],"postconditions":["Action executed exactly once (logically)"],"_meta":{"tier":1,"layer":"Society","category":"Protocols","related":["sema:UniqueHandle#mh:SHA-256:c3fb079be6908528bb340de26feb85f429a61fc13db10e728ea0ec3fffb19110"],"ring":0},"sema_id":"sema:IdempotentWrite#mh:SHA-256:15e8ae521f88a6137d551fd3c61e350e4a027b6b063a35ade4565adfee83c14a","sema_ref":"IdempotentWrite#15e8","sema_stub":"15e8","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"c9a79a65-2e26-4c2b-a80f-f781630c42a7","text":"{{identity}}: Apply(Req) == Apply(Req)","type":"INVARIANT","layer":null,"category":null,"handle":"{{identity}}: Apply(Req) == Apply(Req)","gloss":null,"stub":null,"metadata":{}},{"id":"a5afa675-63d5-4c77-8334-51509193a3ce","text":"Safety: Duplicate requests trigger zero additional side effects","type":"INVARIANT","layer":null,"category":null,"handle":"Safety: Duplicate requests trigger zero additional side effects","gloss":null,"stub":null,"metadata":{}},{"id":"a756e88f-b0f5-4602-87bd-f6b5242b7fd4","text":"Receiver has state storage for keys","type":"PRECONDITION","layer":null,"category":null,"handle":"Receiver has state storage for keys","gloss":null,"stub":null,"metadata":{}},{"id":"40846231-fd31-4580-b6c8-fdd429d88f93","text":"Action executed exactly once (logically)","type":"POSTCONDITION","layer":null,"category":null,"handle":"Action executed exactly once (logically)","gloss":null,"stub":null,"metadata":{}},{"id":"MonotonicCounter","text":"MonotonicCounter#3a12","type":"PATTERN","layer":"Society","category":"Protocols","handle":"MonotonicCounter#3a12","gloss":"Logic via strictly increasing values","stub":"3a12","metadata":{"pattern":{"handle":"MonotonicCounter","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 {{state_lock}} (or CRDT logic) to ensure the counter value never regresses.","gloss":"Logic via strictly increasing values","failure_modes":["Counter overflow (finite integer space)."],"invariants":["Growth: {{value}}(T+1) >= {{value}}(T)","Merge Rule: Merge(A, B) = Max(A, B)"],"preconditions":["Initial value defined"],"postconditions":["Order preserved"],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":0},"sema_id":"sema:MonotonicCounter#mh:SHA-256:3a1201d0c954088c016b8d5ac039fd29d491bb158e865f1ea0b634bf073dfc1f","sema_ref":"MonotonicCounter#3a12","sema_stub":"3a12","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"f7217bd3-968d-495d-b108-257f9f922183","text":"Growth: {{value}}(T+1) >= {{value}}(T)","type":"INVARIANT","layer":null,"category":null,"handle":"Growth: {{value}}(T+1) >= {{value}}(T)","gloss":null,"stub":null,"metadata":{}},{"id":"4739d1cc-2e81-4c0f-961f-161a2c49febf","text":"Merge Rule: Merge(A, B) = Max(A, B)","type":"INVARIANT","layer":null,"category":null,"handle":"Merge Rule: Merge(A, B) = Max(A, B)","gloss":null,"stub":null,"metadata":{}},{"id":"2f477aea-669f-4279-b099-a83b26263f50","text":"Initial value defined","type":"PRECONDITION","layer":null,"category":null,"handle":"Initial value defined","gloss":null,"stub":null,"metadata":{}},{"id":"2a76691c-61f2-4f2c-9b01-599ec1473db2","text":"Order preserved","type":"POSTCONDITION","layer":null,"category":null,"handle":"Order preserved","gloss":null,"stub":null,"metadata":{}},{"id":"UniqueHandle","text":"UniqueHandle#6879","type":"PATTERN","layer":"Society","category":"Protocols","handle":"UniqueHandle#6879","gloss":"Transferable ownership of a singular resource","stub":"6879","metadata":{"pattern":{"handle":"UniqueHandle","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}} A sends the Handle to {{agent}} B, {{agent}} A loses access immediately. Attempts to use a transferred Handle result in a capability fault. Utilizes {{state_lock}}.","gloss":"Transferable ownership of a singular resource","failure_modes":["Orphaned Resource: If the Handle is deleted or lost, the underlying resource remains locked forever (requires a '{{break}} Glass' expiration or Admin override)."],"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"],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":0},"sema_id":"sema:UniqueHandle#mh:SHA-256:68791b2f756edd02f2710f7d4f55891ecab267df6373bd5048d997ee84f326eb","sema_ref":"UniqueHandle#6879","sema_stub":"6879","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"8b108570-086b-45ab-8b95-367eb7c56f74","text":"Exclusivity: Access(Resource) requires Proof(Handle)","type":"INVARIANT","layer":null,"category":null,"handle":"Exclusivity: Access(Resource) requires Proof(Handle)","gloss":null,"stub":null,"metadata":{}},{"id":"0b9d9fdb-5a89-4418-844c-bc4064e88b48","text":"Linear Logic: Transfer(A -> B) implies A loses access immediately","type":"INVARIANT","layer":null,"category":null,"handle":"Linear Logic: Transfer(A -> B) implies A loses access immediately","gloss":null,"stub":null,"metadata":{}},{"id":"a1fd352d-d4a2-4daa-9d2d-00897182cbdf","text":"Linearity: Count(Handle) == 1 always","type":"INVARIANT","layer":null,"category":null,"handle":"Linearity: Count(Handle) == 1 always","gloss":null,"stub":null,"metadata":{}},{"id":"b5681498-6770-48a9-9300-a658b4ca0c5d","text":"Non-Duplication: Handle cannot be copied, only moved","type":"INVARIANT","layer":null,"category":null,"handle":"Non-Duplication: Handle cannot be copied, only moved","gloss":null,"stub":null,"metadata":{}},{"id":"PermissionEscalate","text":"PermissionEscalate#5d67","type":"PATTERN","layer":"Society","category":"Protocols","handle":"PermissionEscalate#5d67","gloss":"Requesting elevated privileges for sensitive operations","stub":"5d67","metadata":{"pattern":{"handle":"PermissionEscalate","mechanism":"Standardizes request elevation. When `Risk > Threshold`, the {{agent}} blocks execution and emits a `PermissionRequest`. Waits for `SignedApproval` before proceeding. It requests a {{tiered_access}} upgrade, often pausing execution until {{human_approve}} is granted.","gloss":"Requesting elevated privileges for sensitive operations","failure_modes":["Privilege Creep: Escalated permissions become permanent, violating least-privilege principle."],"invariants":["Approval required for higher tier","Escalation logged"],"preconditions":["Blocked action","Justification"],"postconditions":["Access granted or denied"],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":1},"sema_id":"sema:PermissionEscalate#mh:SHA-256:5d679cf53de921b8d7a577963214cefe6323f966340212d273fa58097336f4e6","sema_ref":"PermissionEscalate#5d67","sema_stub":"5d67","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"0bf63e17-2077-4cac-b731-56d73b654711","text":"Approval required for higher tier","type":"INVARIANT","layer":null,"category":null,"handle":"Approval required for higher tier","gloss":null,"stub":null,"metadata":{}},{"id":"48ab446d-c375-45dc-98b9-236da4682649","text":"Escalation logged","type":"INVARIANT","layer":null,"category":null,"handle":"Escalation logged","gloss":null,"stub":null,"metadata":{}},{"id":"aa087d3d-06d9-4ea8-bc24-9073c72cb33f","text":"Blocked action","type":"PRECONDITION","layer":null,"category":null,"handle":"Blocked action","gloss":null,"stub":null,"metadata":{}},{"id":"1154e410-60ad-4446-8eaf-d3d585913ec8","text":"Justification","type":"PRECONDITION","layer":null,"category":null,"handle":"Justification","gloss":null,"stub":null,"metadata":{}},{"id":"4e50c18b-845b-4ce0-af92-1195f0258aa9","text":"Access granted or denied","type":"POSTCONDITION","layer":null,"category":null,"handle":"Access granted or denied","gloss":null,"stub":null,"metadata":{}},{"id":"IntentGap","text":"IntentGap#5dc4","type":"PATTERN","layer":"Society","category":"Protocols","handle":"IntentGap#5dc4","gloss":"Analyzing intent-outcome divergence","stub":"5dc4","metadata":{"pattern":{"handle":"IntentGap","mechanism":"Cognitive analysis of the divergence between intended {{decision}} and actual {{outcome}}. Examines why reality differed from intent: external factors, execution errors, model misspecification, or unforeseen consequences. Essential for learning and calibration.","gloss":"Analyzing intent-outcome divergence","failure_modes":["Hindsight Bias: Judging past decisions by outcomes rather than information available at decision time.","Attribution Error: Blaming external factors when internal errors caused the gap."],"invariants":["Analysis separates decision quality from outcome luck","Causal attribution must be evidence-based"],"preconditions":["{{decision}} was made with explicit intent","{{outcome}} is observable and measurable"],"postconditions":["Gap analysis produced","Learning opportunities identified"],"_meta":{"tier":2,"layer":"Society","category":"Protocols","ring":2},"sema_layer":"Society","sema_category":"Protocols","sema_ref":"IntentGap#5dc4","sema_id":"sema:IntentGap#mh:SHA-256:5dc4af64c8178e975cb7d6c1325132b7af673a69e445a37f9dc1e4aa8565ef14","sema_stub":"5dc4"},"layer":"Society","category":"Protocols"}},{"id":"9bc967a5-1a80-4b27-8bdc-1d628bdec1b1","text":"Analysis separates decision quality from outcome luck","type":"INVARIANT","layer":null,"category":null,"handle":"Analysis separates decision quality from outcome luck","gloss":null,"stub":null,"metadata":{}},{"id":"c7b6b292-53d5-4fda-98da-32108c640c27","text":"Causal attribution must be evidence-based","type":"INVARIANT","layer":null,"category":null,"handle":"Causal attribution must be evidence-based","gloss":null,"stub":null,"metadata":{}},{"id":"9f068411-7d3c-48d6-bb96-df2710fe7aee","text":"{{decision}} was made with explicit intent","type":"PRECONDITION","layer":null,"category":null,"handle":"{{decision}} was made with explicit intent","gloss":null,"stub":null,"metadata":{}},{"id":"cd376be4-cb03-49e7-8d19-1bd48656c1cf","text":"{{outcome}} is observable and measurable","type":"PRECONDITION","layer":null,"category":null,"handle":"{{outcome}} is observable and measurable","gloss":null,"stub":null,"metadata":{}},{"id":"53d4041b-2a8d-450b-80a4-b95223666e50","text":"Gap analysis produced","type":"POSTCONDITION","layer":null,"category":null,"handle":"Gap analysis produced","gloss":null,"stub":null,"metadata":{}},{"id":"064af33d-f787-4d4d-a93f-def249f8b8cf","text":"Learning opportunities identified","type":"POSTCONDITION","layer":null,"category":null,"handle":"Learning opportunities identified","gloss":null,"stub":null,"metadata":{}},{"id":"Reflexion","text":"Reflexion#51b9","type":"PATTERN","layer":"Mind","category":"Reasoning","handle":"Reflexion#51b9","gloss":"Self-critique and retry after failure","stub":"51b9","metadata":{"pattern":{"handle":"Reflexion","mechanism":"A self-improvement loop where after completing a {{task}} attempt, the agent generates linguistic self-critique analyzing what went wrong with the {{plan}} regarding the {{goal}}, 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}} memory buffer, using this feedback to improve the next attempt.","gloss":"Self-critique and retry after failure","failure_modes":["Shallow Reflection: {{critique}} is generic ('try harder') without actionable insight.","Reflection Drift: Each retry diverges further from the goal.","Premature Success: Declaring success before the task is actually solved."],"invariants":["Memory of error persists","Self-correction based on past failure"],"preconditions":["Failed trial","{{outcome}} signal"],"postconditions":["Improved policy/next trial"],"_meta":{"tier":1,"layer":"Mind","category":"Reasoning","related":["sema:EvaluatorOptimizer#mh:SHA-256:6c2dd39e3dfae94dee24fb49b8769219134e2ca9bb79e047165d9424614eb729"],"ring":2},"sema_layer":"Mind","sema_category":"Reasoning","sema_id":"sema:Reflexion#mh:SHA-256:51b91d2cdfeb6aed5ea3293154279d16af2c98b0c473e731066198b5d4d43e7f","sema_ref":"Reflexion#51b9","sema_stub":"51b9"},"layer":"Mind","category":"Reasoning"}},{"id":"596d1f42-b9d7-4543-b644-4f3a41e5af6b","text":"Memory of error persists","type":"INVARIANT","layer":null,"category":null,"handle":"Memory of error persists","gloss":null,"stub":null,"metadata":{}},{"id":"824ea2ad-920a-47a5-a351-1cb752d7fb34","text":"Self-correction based on past failure","type":"INVARIANT","layer":null,"category":null,"handle":"Self-correction based on past failure","gloss":null,"stub":null,"metadata":{}},{"id":"00785dbd-ec1c-45fa-ba19-76d4db265a0c","text":"Failed trial","type":"PRECONDITION","layer":null,"category":null,"handle":"Failed trial","gloss":null,"stub":null,"metadata":{}},{"id":"66a41d9f-1d6d-45bb-b71e-b24f2c798f84","text":"{{outcome}} signal","type":"PRECONDITION","layer":null,"category":null,"handle":"{{outcome}} signal","gloss":null,"stub":null,"metadata":{}},{"id":"61ecf4f2-72f5-410b-bcdd-31e643101698","text":"Improved policy/next trial","type":"POSTCONDITION","layer":null,"category":null,"handle":"Improved policy/next trial","gloss":null,"stub":null,"metadata":{}},{"id":"Simulation","text":"Simulation#8035","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"Simulation#8035","gloss":"A virtualized execution","stub":"8035","metadata":{"pattern":{"handle":"Simulation","mechanism":"Sandboxed Execution. Forks the current World {{state}} (W) into W'. Executes Action (A) in W'. Discards W' and returns {{outcome}} (O). W remains immutable.","gloss":"A virtualized execution","_meta":{"tier":1,"layer":"Mind","category":"Strategy","ring":0},"sema_id":"sema:Simulation#mh:SHA-256:80351d81041c870beacea4186f56e1f8703daf12578345859a7daf35a7dea270","sema_ref":"Simulation#8035","sema_stub":"8035","invariants":["Isolation: Side effects in W' DO NOT leak to W."],"sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"22961d2a-278c-4241-9763-2028f7960064","text":"Isolation: Side effects in W' DO NOT leak to W.","type":"INVARIANT","layer":null,"category":null,"handle":"Isolation: Side effects in W' DO NOT leak to W.","gloss":null,"stub":null,"metadata":{}},{"id":"AcceptSpec","text":"AcceptSpec#70dd","type":"PATTERN","layer":"Society","category":"Protocols","handle":"AcceptSpec#70dd","gloss":"Non-compensatory failure boundaries","stub":"70dd","metadata":{"pattern":{"handle":"AcceptSpec","mechanism":"A strict, typed {{spec}} defining non-compensatory {{criteria}} at solver boundaries. Unlike soft prompts, an AcceptSpec specifies hard {{constraint}}s (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.","gloss":"Non-compensatory failure boundaries","failure_modes":["Over-constraining: Setting specs so tight that no solution can pass (Deadlock).","Spec Drift: The spec does not accurately reflect the true goal."],"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"}],"_meta":{"tier":2,"layer":"Society","category":"Protocols","ring":0},"data_schema":{"type":"object","required":["criteria"],"properties":{"criteria":{"type":"array","items":{"type":"object","properties":{"name":{"type":"string"},"threshold":{"type":"number","minimum":0.0,"maximum":1.0,"description":"Minimum acceptable score for this criterion"},"comparator":{"type":"string"}}},"description":"Non-compensatory acceptance criteria"},"strictness":{"type":"string","enum":["Lenient","Normal","Strict"]},"timeout":{"type":"string","description":"Max validation wait time"}}},"sema_id":"sema:AcceptSpec#mh:SHA-256:70ddc45d00abda5ec5b7475b080d252f01c3db589490498563621665444293f1","sema_ref":"AcceptSpec#70dd","sema_stub":"70dd","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"eee420ed-31b0-4d88-8ad2-847f928d726c","text":"Non-Compensatory: Score(A) = 0 if any(Criterion) == Fail","type":"INVARIANT","layer":null,"category":null,"handle":"Non-Compensatory: Score(A) = 0 if any(Criterion) == Fail","gloss":null,"stub":null,"metadata":{}},{"id":"7a975beb-6617-419d-8947-da7dfb670c73","text":"Typed Output: Result must match schema, not free text","type":"INVARIANT","layer":null,"category":null,"handle":"Typed Output: Result must match schema, not free text","gloss":null,"stub":null,"metadata":{}},{"id":"Build","text":"Build#00f3","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"Build#00f3","gloss":"Low-cost prototype generation","stub":"00f3","metadata":{"pattern":{"handle":"Build","mechanism":"Performs the {{act}} of constructing a low-cost {{artifact}} (prototype) to verify critical assumptions in the {{spec}} before full commitment. Governed by the Marginal {{value}} Rule.","gloss":"Low-cost prototype generation","failure_modes":["Over-engineering: Building the full product instead of a prototype.","False Negative: {{prototype}} fails due to low fidelity, killing a good plan.","Scope Creep: {{prototype}} expands beyond verification needs."],"invariants":["Cost(Build) << Cost(rollout)","{{prototype}} must address specific risks identified in {{plan}}"],"preconditions":["PlanBundle with high uncertainty/risk"],"postconditions":["ProtoPack artifact (Evidence of feasibility)"],"_meta":{"tier":1,"layer":"Mind","category":"Strategy","related":["Simulation","DogfoodFirst","SacrificialProbe"],"ring":1},"sema_id":"sema:Build#mh:SHA-256:00f3e2cc017af17d5de5a121ddd38017635736aa54c5ef23ee43c84abe5ddab6","sema_ref":"Build#00f3","sema_stub":"00f3","sema_layer":"Mind","sema_category":"Strategy","signature":["Act(Artifact)"]},"layer":"Mind","category":"Strategy"}},{"id":"5f53f9f5-3705-40f8-adf4-c3a52aba7585","text":"Cost(Build) << Cost(rollout)","type":"INVARIANT","layer":null,"category":null,"handle":"Cost(Build) << Cost(rollout)","gloss":null,"stub":null,"metadata":{}},{"id":"4f5ccd9a-a886-4cc3-88c6-68e045da4588","text":"{{prototype}} must address specific risks identified in {{plan}}","type":"INVARIANT","layer":null,"category":null,"handle":"{{prototype}} must address specific risks identified in {{plan}}","gloss":null,"stub":null,"metadata":{}},{"id":"4eeee873-5d4b-42b4-8c11-b72d75c66d1a","text":"PlanBundle with high uncertainty/risk","type":"PRECONDITION","layer":null,"category":null,"handle":"PlanBundle with high uncertainty/risk","gloss":null,"stub":null,"metadata":{}},{"id":"1af2cad9-3b68-431d-97cb-db0a604944ae","text":"ProtoPack artifact (Evidence of feasibility)","type":"POSTCONDITION","layer":null,"category":null,"handle":"ProtoPack artifact (Evidence of feasibility)","gloss":null,"stub":null,"metadata":{}},{"id":"FrameSpec","text":"FrameSpec#d5b8","type":"PATTERN","layer":"Society","category":"Protocols","handle":"FrameSpec#d5b8","gloss":"Structured problem definition artifact","stub":"d5b8","metadata":{"pattern":{"handle":"FrameSpec","mechanism":"A structured {{spec}} of the {{problem}} space, {{constraint}}s, and success criteria derived from a raw request via interpretation. It is an {{artifact}} that acts as the contract defining the boundaries for execution.","gloss":"Structured problem definition artifact","invariants":["Constraint Clarity: Must contain explicit, testable {{constraint}}s.","Success Definition: Must define unambiguous success criteria."],"_meta":{"layer":"Society","category":"Protocols","ring":0,"tier":1},"data_schema":{"type":"object","properties":{"problem_statement":{"type":"string"},"constraints":{"type":"array","items":{"type":"string"}},"success_criteria":{"type":"array","items":{"type":"string"}}},"required":["problem_statement","constraints","success_criteria"]},"signature":["Artifact(Constraint)"],"sema_id":"sema:FrameSpec#mh:SHA-256:d5b8e71aa9d57b941df3f914b941bfb8fe6c58f62d6c6db28532defcd2237d75","sema_ref":"FrameSpec#d5b8","sema_stub":"d5b8","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"bc992593-a5c6-4677-8b50-d0335cd89536","text":"Constraint Clarity: Must contain explicit, testable {{constraint}}s.","type":"INVARIANT","layer":null,"category":null,"handle":"Constraint Clarity: Must contain explicit, testable {{constraint}}s.","gloss":null,"stub":null,"metadata":{}},{"id":"a70e925c-4b8f-4daa-b4e4-705baf83c752","text":"Success Definition: Must define unambiguous success criteria.","type":"INVARIANT","layer":null,"category":null,"handle":"Success Definition: Must define unambiguous success criteria.","gloss":null,"stub":null,"metadata":{}},{"id":"Verification","text":"Verification#9c1e","type":"PATTERN","layer":"Mind","category":"Reasoning","handle":"Verification#9c1e","gloss":"Confirming alignment with truth or spec","stub":"9c1e","metadata":{"pattern":{"handle":"Verification","mechanism":"The cognitive process of confirming that a claim or {{artifact}} adheres to its {{spec}} or reality. Unlike open-ended inquiry, Verification yields a binary Truth value regarding an existing assertion via a {{check}}.","gloss":"Confirming alignment with truth or spec","_meta":{"layer":"Mind","category":"Reasoning","ring":1,"tier":1},"sema_ref":"Verification#9c1e","sema_id":"sema:Verification#mh:SHA-256:9c1ee918c6b8b8d7b787f5ef7ae908aa2ca37b1f9b5dace80fcf261a9c961001","sema_stub":"9c1e","sema_layer":"Mind","sema_category":"Reasoning"},"layer":"Mind","category":"Reasoning"}},{"id":"Decompose","text":"Decompose#422f","type":"PATTERN","layer":"Mind","category":"Reasoning","handle":"Decompose#422f","gloss":"Dividing complexity into manageable units","stub":"422f","metadata":{"pattern":{"handle":"Decompose","mechanism":"{{strategy}}: The cognitive act of splitting a {{task}} into independent sub-{{task}}s. Criterion: solving sub{{problem}}s in isolation must yield {{solution}} to whole. If subproblems interact, split is wrong—try different decomposition axis. Recurse until subproblems are trivial.","gloss":"Dividing complexity into manageable units","failure_modes":["Coupling Leakage: Subproblems are not truly independent; solving one breaks another."],"invariants":["Subproblems must be independent."],"preconditions":["{{problem}} too large to solve directly. Decomposition axis identifiable. Subproblems can be independent."],"postconditions":["Set of independent subproblems. Combined {{solution}} equals original. No subproblem depends on sibling."],"_meta":{"tier":1,"layer":"Mind","category":"Reasoning","ring":2},"sema_id":"sema:Decompose#mh:SHA-256:422f4ab64753ba80b9381763a596850c0dc411d5432054786e3208c17ddca0de","sema_ref":"Decompose#422f","sema_stub":"422f","sema_layer":"Mind","sema_category":"Reasoning"},"layer":"Mind","category":"Reasoning"}},{"id":"ce468469-3d64-4970-8cec-3ae11588e961","text":"Subproblems must be independent.","type":"INVARIANT","layer":null,"category":null,"handle":"Subproblems must be independent.","gloss":null,"stub":null,"metadata":{}},{"id":"b1f23edf-287f-4bdc-ad22-6b4e8f86f297","text":"{{problem}} too large to solve directly. Decomposition axis identifiable. Subproblems can be independent.","type":"PRECONDITION","layer":null,"category":null,"handle":"{{problem}} too large to solve directly. Decomposition axis identifiable. Subproblems can be independent.","gloss":null,"stub":null,"metadata":{}},{"id":"3f5c42be-8c07-4aa2-8326-d4492b41a14e","text":"Set of independent subproblems. Combined {{solution}} equals original. No subproblem depends on sibling.","type":"POSTCONDITION","layer":null,"category":null,"handle":"Set of independent subproblems. Combined {{solution}} equals original. No subproblem depends on sibling.","gloss":null,"stub":null,"metadata":{}},{"id":"GracefulDegradation","text":"GracefulDegradation#f6d7","type":"PATTERN","layer":"Society","category":"Protocols","handle":"GracefulDegradation#f6d7","gloss":"When verification fails, fall back to inline definition","stub":"f6d7","metadata":{"pattern":{"handle":"GracefulDegradation","mechanism":"Resolution Fallback {{strategy}}. 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 {{fail_closed}} if verification fails, but attempts to parse verified inline definitions to maintain continuity.","gloss":"When verification fails, fall back to inline definition","failure_modes":["Hash Mismatch: Inline definition claims to be Pattern#X but hashes to Pattern#Y (Spoofing).","DoS via Definition: Sender includes massive multi-megabyte 'definition' to exhaust receiver memory.","Dependency Hell: Inline definition references other unknown patterns, triggering recursive lookups."],"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."],"preconditions":["{{message}} contains fallback data OR sender is reachable","Pattern lookup failed"],"postconditions":["Pattern resolved and locally minted OR Transaction aborted"],"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"}],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":0},"sema_id":"sema:GracefulDegradation#mh:SHA-256:f6d796365ffaa5244e54660f836f2e31ca948169f42fd305da33445cbfa30485","sema_ref":"GracefulDegradation#f6d7","sema_stub":"f6d7","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"a4343c8c-1689-4341-8ec2-077cc34092ec","text":"Atomic Load: A definition is only added to Local DB if it validates fully.","type":"INVARIANT","layer":null,"category":null,"handle":"Atomic Load: A definition is only added to Local DB if it validates fully.","gloss":null,"stub":null,"metadata":{}},{"id":"d6738e81-840e-402c-845b-93414cab813a","text":"Trust but Verify: Externally acquired definitions must be Hashed and Verified before loading.","type":"INVARIANT","layer":null,"category":null,"handle":"Trust but Verify: Externally acquired definitions must be Hashed and Verified before loading.","gloss":null,"stub":null,"metadata":{}},{"id":"8eec8447-619a-49ad-8c55-6e220667ddd5","text":"{{message}} contains fallback data OR sender is reachable","type":"PRECONDITION","layer":null,"category":null,"handle":"{{message}} contains fallback data OR sender is reachable","gloss":null,"stub":null,"metadata":{}},{"id":"2dc14186-ac83-41e7-972c-8cae6e1992ee","text":"Pattern lookup failed","type":"PRECONDITION","layer":null,"category":null,"handle":"Pattern lookup failed","gloss":null,"stub":null,"metadata":{}},{"id":"36cb148e-7782-485c-92f8-323c9f04e65a","text":"Pattern resolved and locally minted OR Transaction aborted","type":"POSTCONDITION","layer":null,"category":null,"handle":"Pattern resolved and locally minted OR Transaction aborted","gloss":null,"stub":null,"metadata":{}},{"id":"NoiseInjection","text":"NoiseInjection#53b3","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"NoiseInjection#53b3","gloss":"Breaking local optima","stub":"53b3","metadata":{"pattern":{"handle":"NoiseInjection","mechanism":"If the {{agent}} detects it is looping or repeating text, it deliberately injects high-temperature {{noise}} or a random oblique {{strategy}} {{card}} into its {{context}} to force a trajectory change.","gloss":"Breaking local optima","failure_modes":["Derailment into nonsense."],"invariants":["{{noise}} distribution matches parameter","{{signal}}-to-noise ratio > 0"],"preconditions":["Clean signal/process","Need for exploration/robustness"],"postconditions":["Perturbed output"],"_meta":{"tier":1,"layer":"Mind","category":"Strategy","related":["sema:ChaosDrift#mh:SHA-256:d0c528b6297af51dfcb57ddcbf7f37e62a67aa90432626ec7e79ce2050d6802f"],"ring":1},"sema_id":"sema:NoiseInjection#mh:SHA-256:53b36cfe3d333d99412073f819e001225b53449bd95438ec85e6c51087fa43df","sema_ref":"NoiseInjection#53b3","sema_stub":"53b3","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"768b110f-0574-47cb-a690-89c1ef335d75","text":"{{noise}} distribution matches parameter","type":"INVARIANT","layer":null,"category":null,"handle":"{{noise}} distribution matches parameter","gloss":null,"stub":null,"metadata":{}},{"id":"5a5aba35-029d-4e6e-a7d7-e8c1f5b6313a","text":"{{signal}}-to-noise ratio > 0","type":"INVARIANT","layer":null,"category":null,"handle":"{{signal}}-to-noise ratio > 0","gloss":null,"stub":null,"metadata":{}},{"id":"ad57005d-0ad4-4e6c-86ac-07bdd7bf7bf1","text":"Clean signal/process","type":"PRECONDITION","layer":null,"category":null,"handle":"Clean signal/process","gloss":null,"stub":null,"metadata":{}},{"id":"1da83882-252f-476f-9f00-195a72a0e5ba","text":"Need for exploration/robustness","type":"PRECONDITION","layer":null,"category":null,"handle":"Need for exploration/robustness","gloss":null,"stub":null,"metadata":{}},{"id":"033664e4-c1ab-4bea-8d1f-663addcaa405","text":"Perturbed output","type":"POSTCONDITION","layer":null,"category":null,"handle":"Perturbed output","gloss":null,"stub":null,"metadata":{}},{"id":"OODA","text":"OODA#149f","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"OODA#149f","gloss":"Rapid decision cycle: Observe, Orient, Decide, Act","stub":"149f","metadata":{"pattern":{"handle":"OODA","mechanism":"The OODA {{loop}} ({{observe}}-Orient-Decide-{{act}}) is a high-speed decision cycle favoring {{agent}} agility over raw power. \n1. OBSERVE: Gather raw data via {{observe}}.\n2. ORIENT: Update context and beliefs via {{context}} and {{belief}}. This is the most critical step, filtering data through culture and genetics (or training).\n3. DECIDE: {{select}} a hypothesis or {{strategy}} via {{think}} and {{select}}.\n4. ACT: Execute via {{act}} and change the environment.\nSuccess depends on traversing this loop faster than the adversary (or environment changes).","gloss":"Rapid decision cycle: Observe, Orient, Decide, Act","failure_modes":["Disorientation: Getting stuck in 'Orient' due to contradictory data.","Reactionary {{loop}}: Acting without deciding ({{observe}}-{{act}}), skipping strategic alignment.","Latency: The loop is too slow to keep up with environmental changes."],"invariants":["Cyclic: The output of {{act}} feeds the input of {{observe}}.","Orient Dominance: Decisions must flow from a valid Orientation ({{context}})."],"preconditions":["Active Environment","{{agent}} Agency"],"postconditions":["Environment {{state}} Modified","Internal Model Updated"],"_meta":{"tier":2,"layer":"Mind","category":"Strategy","related":["ReAct","SocraticLoop","BoydCycle"],"ring":1},"sema_id":"sema:OODA#mh:SHA-256:149ff85c263c245bd89999ae4c967c7394de7a27657c0dd0bb5b2f86621cc99b","sema_ref":"OODA#149f","sema_stub":"149f","sema_layer":"Mind","sema_category":"Strategy","signature":["Agent(Loop)","Think(Strategy)"]},"layer":"Mind","category":"Strategy"}},{"id":"3911c9b9-ff4f-4a3c-949a-406408677272","text":"Cyclic: The output of {{act}} feeds the input of {{observe}}.","type":"INVARIANT","layer":null,"category":null,"handle":"Cyclic: The output of {{act}} feeds the input of {{observe}}.","gloss":null,"stub":null,"metadata":{}},{"id":"4eb6fdc6-7947-46fb-988a-5a713b56b059","text":"Orient Dominance: Decisions must flow from a valid Orientation ({{context}}).","type":"INVARIANT","layer":null,"category":null,"handle":"Orient Dominance: Decisions must flow from a valid Orientation ({{context}}).","gloss":null,"stub":null,"metadata":{}},{"id":"41cbd485-ad28-491d-b3fd-af48645d6e80","text":"Active Environment","type":"PRECONDITION","layer":null,"category":null,"handle":"Active Environment","gloss":null,"stub":null,"metadata":{}},{"id":"ce22881d-4a3b-4037-8dc3-c7d1c217bcf2","text":"{{agent}} Agency","type":"PRECONDITION","layer":null,"category":null,"handle":"{{agent}} Agency","gloss":null,"stub":null,"metadata":{}},{"id":"0037ffae-d93f-4a32-9b88-2851b1ced85a","text":"Environment {{state}} Modified","type":"POSTCONDITION","layer":null,"category":null,"handle":"Environment {{state}} Modified","gloss":null,"stub":null,"metadata":{}},{"id":"a85f2b65-e4e1-41fe-a923-95eb987e5a76","text":"Internal Model Updated","type":"POSTCONDITION","layer":null,"category":null,"handle":"Internal Model Updated","gloss":null,"stub":null,"metadata":{}},{"id":"SacrificialProbe","text":"SacrificialProbe#2372","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"SacrificialProbe#2372","gloss":"Learning via cheap, instructive failure","stub":"2372","metadata":{"pattern":{"handle":"SacrificialProbe","mechanism":"A Generalized Pattern where an {{agent}} sends a low-cost 'probe' into a {{system}} 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}} must update the {{strategy}} 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}}.","gloss":"Learning via cheap, instructive failure","failure_modes":["{{probe}} is too expensive; {{probe}} failure is silent."],"invariants":["Cost Asymmetry: Cost({{probe}}) << Cost(MainPayload)","Instructive Failure: InfoGain(Failure) > EntropyReductionThreshold","{{strategy}} Update: MainPayload parameters are a function of ProbeResult"],"preconditions":["{{system}} failure {{mode}}s are observable"],"postconditions":["{{strategy}} updated"],"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"}],"_meta":{"tier":2,"layer":"Mind","category":"Strategy","ring":2},"sema_id":"sema:SacrificialProbe#mh:SHA-256:2372fc7a6d00a9d9b86f5f5cd7561ec60a8527973ff52b395f3ec3f56b5c78e4","sema_ref":"SacrificialProbe#2372","sema_stub":"2372","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"c61a3c7b-4da7-4e2a-af6e-e17a1c2d0ff9","text":"Cost Asymmetry: Cost({{probe}}) << Cost(MainPayload)","type":"INVARIANT","layer":null,"category":null,"handle":"Cost Asymmetry: Cost({{probe}}) << Cost(MainPayload)","gloss":null,"stub":null,"metadata":{}},{"id":"61267f80-e804-44dc-8669-2b92e97f689b","text":"Instructive Failure: InfoGain(Failure) > EntropyReductionThreshold","type":"INVARIANT","layer":null,"category":null,"handle":"Instructive Failure: InfoGain(Failure) > EntropyReductionThreshold","gloss":null,"stub":null,"metadata":{}},{"id":"418afe37-0dc0-4ad1-a68b-4d16bd9e1ce2","text":"{{strategy}} Update: MainPayload parameters are a function of ProbeResult","type":"INVARIANT","layer":null,"category":null,"handle":"{{strategy}} Update: MainPayload parameters are a function of ProbeResult","gloss":null,"stub":null,"metadata":{}},{"id":"498a89a4-0e4e-4966-8f08-c474885a6df4","text":"{{system}} failure {{mode}}s are observable","type":"PRECONDITION","layer":null,"category":null,"handle":"{{system}} failure {{mode}}s are observable","gloss":null,"stub":null,"metadata":{}},{"id":"174a5e53-e288-449c-8f99-acdbbf3bd2b3","text":"{{strategy}} updated","type":"POSTCONDITION","layer":null,"category":null,"handle":"{{strategy}} updated","gloss":null,"stub":null,"metadata":{}},{"id":"Specialize","text":"Specialize#d968","type":"PATTERN","layer":"Mind","category":"Reasoning","handle":"Specialize#d968","gloss":"Deductive application of principles","stub":"d968","metadata":{"pattern":{"handle":"Specialize","mechanism":"Concrete Instantiation: Given abstract principle, substitute specific values for variables. {{check}} 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}}, mapping abstract principles to concrete, context-specific instances.","gloss":"Deductive application of principles","failure_modes":["{{context}} Mismatch: Applying a valid principle to a domain where its preconditions do not hold."],"invariants":["Constraint Inheritance: Must satisfy all constraints of the general principle","Type Narrowing: Input parameters are a subset of the general domain"],"preconditions":["Domain constraints","General purpose agent"],"postconditions":["Expert agent instantiated"],"_meta":{"tier":1,"layer":"Mind","category":"Reasoning","ring":2},"sema_id":"sema:Specialize#mh:SHA-256:d96855368b574a8e44d5c3ca6ef76c4ca141ddd964acc9c54d9428860c00c203","sema_ref":"Specialize#d968","sema_stub":"d968","sema_layer":"Mind","sema_category":"Reasoning"},"layer":"Mind","category":"Reasoning"}},{"id":"d1be8fd5-6f5e-43cc-801d-54e4e081cdfa","text":"Type Narrowing: Input parameters are a subset of the general domain","type":"INVARIANT","layer":null,"category":null,"handle":"Type Narrowing: Input parameters are a subset of the general domain","gloss":null,"stub":null,"metadata":{}},{"id":"86ad42ac-d8ad-41e7-8a1f-20286d571b54","text":"Domain constraints","type":"PRECONDITION","layer":null,"category":null,"handle":"Domain constraints","gloss":null,"stub":null,"metadata":{}},{"id":"8459ba79-b473-4dcb-b8ad-30f21cd9d1b8","text":"General purpose agent","type":"PRECONDITION","layer":null,"category":null,"handle":"General purpose agent","gloss":null,"stub":null,"metadata":{}},{"id":"c946400b-b157-42e4-b791-12f87926d878","text":"Expert agent instantiated","type":"POSTCONDITION","layer":null,"category":null,"handle":"Expert agent instantiated","gloss":null,"stub":null,"metadata":{}},{"id":"ConfidenceCalibrate","text":"ConfidenceCalibrate#5238","type":"PATTERN","layer":"Mind","category":"Inference","handle":"ConfidenceCalibrate#5238","gloss":"Aligning subjective confidence with objective frequency","stub":"5238","metadata":{"pattern":{"handle":"ConfidenceCalibrate","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 {{bayes_update}} on historical accuracy data, ensuring {{base_rate_include}} is respected.","gloss":"Aligning subjective confidence with objective frequency","failure_modes":["Over-correction: {{agent}} becomes under-confident to avoid being wrong, refusing to act on strong signals."],"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"}],"_meta":{"tier":2,"layer":"Mind","category":"Inference","ring":2},"sema_id":"sema:ConfidenceCalibrate#mh:SHA-256:52389ef2231a04c551e99c640524f8b082a4608c1a1e9576096450f0f43bc575","sema_ref":"ConfidenceCalibrate#5238","sema_stub":"5238","sema_layer":"Mind","sema_category":"Inference"},"layer":"Mind","category":"Inference"}},{"id":"1b8a2e24-3032-4c78-8ca0-46e3d5adcef0","text":"Calibration curve must be monotonic.","type":"INVARIANT","layer":null,"category":null,"handle":"Calibration curve must be monotonic.","gloss":null,"stub":null,"metadata":{}},{"id":"DissentSeek","text":"DissentSeek#bca9","type":"PATTERN","layer":"Society","category":"Protocols","handle":"DissentSeek#bca9","gloss":"Mitigating groupthink via mandatory devils advocacy","stub":"bca9","metadata":{"pattern":{"handle":"DissentSeek","mechanism":"Active Disagreement: After reaching conclusion, find smartest person who disagrees. {{understand}} 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 {{confirmation_block}} until a valid {{steelman_check}} of the opposing view has been integrated.","gloss":"Mitigating groupthink via mandatory devils advocacy","failure_modes":["Strawman Dissent: The agent selects a weak disagreement to easily defeat, creating a false sense of robustness."],"invariants":["Dissent must be substantive (not trivial)","Must find at least one disagreement or critical view"],"preconditions":["{{quorum}} view","Diverse pool of critics"],"postconditions":["Blind spots revealed","Confidence intervals widened"],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":2},"sema_id":"sema:DissentSeek#mh:SHA-256:bca9e7effdcafe26935739612e7eb649394fe8c2a883cb5f8eadb0086787ee97","sema_ref":"DissentSeek#bca9","sema_stub":"bca9","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"cf476f8b-e53b-41ab-a37f-5640dba7be2c","text":"Dissent must be substantive (not trivial)","type":"INVARIANT","layer":null,"category":null,"handle":"Dissent must be substantive (not trivial)","gloss":null,"stub":null,"metadata":{}},{"id":"25d93b5a-639c-412b-99b4-7020030cbba5","text":"Must find at least one disagreement or critical view","type":"INVARIANT","layer":null,"category":null,"handle":"Must find at least one disagreement or critical view","gloss":null,"stub":null,"metadata":{}},{"id":"69dff2b4-1e11-4e31-8894-89b8f2090284","text":"{{quorum}} view","type":"PRECONDITION","layer":null,"category":null,"handle":"{{quorum}} view","gloss":null,"stub":null,"metadata":{}},{"id":"0cac6d8a-8bdb-482f-9e39-37041a32ab7a","text":"Diverse pool of critics","type":"PRECONDITION","layer":null,"category":null,"handle":"Diverse pool of critics","gloss":null,"stub":null,"metadata":{}},{"id":"ae4bbf56-25d5-4dc9-80bd-e5fb9773cbda","text":"Blind spots revealed","type":"POSTCONDITION","layer":null,"category":null,"handle":"Blind spots revealed","gloss":null,"stub":null,"metadata":{}},{"id":"e5d5a9ea-cd16-4426-b8e4-a86af68068d5","text":"Confidence intervals widened","type":"POSTCONDITION","layer":null,"category":null,"handle":"Confidence intervals widened","gloss":null,"stub":null,"metadata":{}},{"id":"PreMortem","text":"PreMortem#eb4f","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"PreMortem#eb4f","gloss":"Simulating failure to identify hidden risks","stub":"eb4f","metadata":{"pattern":{"handle":"PreMortem","mechanism":"Prospective Hindsight: Before executing {{task}} ({{plan}}), 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 {{recursive_root_cause}} on a hypothetical failure state, often employing {{steelman_check}} to ensure the disaster scenario is plausible.","gloss":"Simulating failure to identify hidden risks","failure_modes":["Performative Doomerism: Listing generic catastrophes (e.g., Asteroid Strike) instead of specific, endogenous failure modes."],"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"],"preconditions":["{{plan}} is fully specified"],"postconditions":["{{plan}} robustified"],"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"}],"_meta":{"tier":1,"layer":"Mind","category":"Strategy","ring":2},"sema_layer":"Mind","sema_category":"Strategy","sema_id":"sema:PreMortem#mh:SHA-256:eb4f7f98ba5434aefc6b4e7f0059dde5d6a08bf80525a2577e413554d9f33022","sema_ref":"PreMortem#eb4f","sema_stub":"eb4f"},"layer":"Mind","category":"Strategy"}},{"id":"4fd1dc86-f8d7-41f4-9f32-9be050777c35","text":"Future Perspective: Analysis must assume failure has ALREADY happened","type":"INVARIANT","layer":null,"category":null,"handle":"Future Perspective: Analysis must assume failure has ALREADY happened","gloss":null,"stub":null,"metadata":{}},{"id":"ba897820-4570-4fc5-8d1a-50ea96f8c876","text":"Perspective Shift: Analysis assumes failure has ALREADY occurred (Probability=1.0)","type":"INVARIANT","layer":null,"category":null,"handle":"Perspective Shift: Analysis assumes failure has ALREADY occurred (Probability=1.0)","gloss":null,"stub":null,"metadata":{}},{"id":"36beaa39-00ab-42d5-b183-c07b1a88e8ed","text":"Specific Cause: Failure reasons must be actionable, not generic bad luck","type":"INVARIANT","layer":null,"category":null,"handle":"Specific Cause: Failure reasons must be actionable, not generic bad luck","gloss":null,"stub":null,"metadata":{}},{"id":"7dfe00a1-b25f-4252-9480-e05a79b3cff4","text":"{{plan}} is fully specified","type":"PRECONDITION","layer":null,"category":null,"handle":"{{plan}} is fully specified","gloss":null,"stub":null,"metadata":{}},{"id":"dea85b94-3e52-4656-9550-13adefa7c625","text":"{{plan}} robustified","type":"POSTCONDITION","layer":null,"category":null,"handle":"{{plan}} robustified","gloss":null,"stub":null,"metadata":{}},{"id":"SteelmanFirst","text":"SteelmanFirst#ca6f","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"SteelmanFirst#ca6f","gloss":"Construct strongest counter-argument before proposing","stub":"ca6f","metadata":{"pattern":{"handle":"SteelmanFirst","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 {{steelman_check}} is populated with high-quality data, not strawmen. Utilizes {{steelman_check}}.","gloss":"Construct strongest counter-argument before proposing","failure_modes":["Performative Steelman: {{agent}} lists weak counter-arguments to appear unbiased.","{{cognitive_bias}} Leakage: {{agent}} frames the counter-argument in a way that makes it easy to defeat."],"invariants":["Prioritization: Counter-argument generation must precede Proposal generation in the chain."],"preconditions":["{{problem}} statement defined"],"postconditions":["Strongest counter-argument cached"],"parameters":[{"name":"effort_ratio","type":"Float","range":"[0.3, 0.5]","description":"Portion of budget spent on counter-argument"}],"_meta":{"tier":2,"layer":"Mind","category":"Strategy","ring":2},"sema_id":"sema:SteelmanFirst#mh:SHA-256:ca6f6d43904497ea1ec0c83d3241da18e3d217a06b57040c8eb7b06bda62a1ae","sema_ref":"SteelmanFirst#ca6f","sema_stub":"ca6f","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"a31d7740-67a3-428c-9fba-0ee5b9467c0f","text":"Prioritization: Counter-argument generation must precede Proposal generation in the chain.","type":"INVARIANT","layer":null,"category":null,"handle":"Prioritization: Counter-argument generation must precede Proposal generation in the chain.","gloss":null,"stub":null,"metadata":{}},{"id":"051913a7-2ac8-4576-ba59-db2cdd966be5","text":"{{problem}} statement defined","type":"PRECONDITION","layer":null,"category":null,"handle":"{{problem}} statement defined","gloss":null,"stub":null,"metadata":{}},{"id":"4e2b6d0c-f7e1-441a-a753-fc00ac3a5e82","text":"Strongest counter-argument cached","type":"POSTCONDITION","layer":null,"category":null,"handle":"Strongest counter-argument cached","gloss":null,"stub":null,"metadata":{}},{"id":"MemeticSeed","text":"MemeticSeed#f77b","type":"PATTERN","layer":"Society","category":"Protocols","handle":"MemeticSeed#f77b","gloss":"Viral propagation of semantic standards via economic subsidy","stub":"f77b","metadata":{"pattern":{"handle":"MemeticSeed","mechanism":"{{agent}} actively broadcasts a subset of its ontology to neighbors, offering favorable terms ({{yield}}) to those who adopt it, thereby reducing its own future translation costs ({{translation_proxy}}). Standards are adopted not because they are 'true', but because they are subsidized. It subsidizes adoption via {{yield}} and {{translation_proxy}}, broadcasting the standard through an {{explain_beacon}}.","gloss":"Viral propagation of semantic standards via economic subsidy","invariants":["Fidelity: Propagated ontology must be isomorphic to source","Subsidy Gradient: Adoption Incentive > Switching Cost"],"preconditions":["Network of peers with divergent ontologies","Resource surplus to subsidize adoption"],"postconditions":["Communication cost decreases","Peer adopts semantic subset"],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":1},"sema_id":"sema:MemeticSeed#mh:SHA-256:f77b494ab19acc3c810b7e5535a6d4f648e075d181d13f8748c7c8294c75291b","sema_ref":"MemeticSeed#f77b","sema_stub":"f77b","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"585b6321-e37e-47e4-8b8d-903b6240b02c","text":"Fidelity: Propagated ontology must be isomorphic to source","type":"INVARIANT","layer":null,"category":null,"handle":"Fidelity: Propagated ontology must be isomorphic to source","gloss":null,"stub":null,"metadata":{}},{"id":"afd0f9a7-c999-4337-9e75-5b1852cec484","text":"Subsidy Gradient: Adoption Incentive > Switching Cost","type":"INVARIANT","layer":null,"category":null,"handle":"Subsidy Gradient: Adoption Incentive > Switching Cost","gloss":null,"stub":null,"metadata":{}},{"id":"6038ef1f-33f0-452d-b81a-25bcbfcbf23b","text":"Network of peers with divergent ontologies","type":"PRECONDITION","layer":null,"category":null,"handle":"Network of peers with divergent ontologies","gloss":null,"stub":null,"metadata":{}},{"id":"63a05e83-3d5b-4f5d-877a-72e9597ad00c","text":"Resource surplus to subsidize adoption","type":"PRECONDITION","layer":null,"category":null,"handle":"Resource surplus to subsidize adoption","gloss":null,"stub":null,"metadata":{}},{"id":"49761baa-4968-40c5-9a84-aedfbd163b8a","text":"Communication cost decreases","type":"POSTCONDITION","layer":null,"category":null,"handle":"Communication cost decreases","gloss":null,"stub":null,"metadata":{}},{"id":"200a968e-9416-4797-a142-37f099d5cf1f","text":"Peer adopts semantic subset","type":"POSTCONDITION","layer":null,"category":null,"handle":"Peer adopts semantic subset","gloss":null,"stub":null,"metadata":{}},{"id":"WorldTransparent","text":"WorldTransparent#d416","type":"PATTERN","layer":"Society","category":"Governance","handle":"WorldTransparent#d416","gloss":"Designing for universal observability","stub":"d416","metadata":{"pattern":{"handle":"WorldTransparent","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 {{explain_beacon}}.","gloss":"Designing for universal observability","failure_modes":["Privacy leaks if not paired with Zero-Knowledge proofs."],"invariants":["Security Independence: {{system}} remains secure even if all logs are public","Witness Effect: Bad behavior is disincentivized by visibility, not prevention"],"preconditions":["Privacy is not the primary goal (or is handled via Zero Knowledge)"],"postconditions":["Secrets eliminated from critical path"],"_meta":{"tier":1,"layer":"Society","category":"Governance","ring":0},"sema_id":"sema:WorldTransparent#mh:SHA-256:d41625e457165f80e273facbf7f629bdab7d95ee14d0c3aa47187e76e0883708","sema_ref":"WorldTransparent#d416","sema_stub":"d416","sema_layer":"Society","sema_category":"Governance"},"layer":"Society","category":"Governance"}},{"id":"dc998770-80e1-4d40-8d8d-31037195e639","text":"Governance","type":"CATEGORY","layer":null,"category":null,"handle":"Governance","gloss":null,"stub":null,"metadata":{}},{"id":"55f127c4-96c5-4877-ae53-6e33b73e28e8","text":"Security Independence: {{system}} remains secure even if all logs are public","type":"INVARIANT","layer":null,"category":null,"handle":"Security Independence: {{system}} remains secure even if all logs are public","gloss":null,"stub":null,"metadata":{}},{"id":"88249646-d668-4075-8db8-5973adeeb8e8","text":"Witness Effect: Bad behavior is disincentivized by visibility, not prevention","type":"INVARIANT","layer":null,"category":null,"handle":"Witness Effect: Bad behavior is disincentivized by visibility, not prevention","gloss":null,"stub":null,"metadata":{}},{"id":"7d045350-1461-4b35-a10c-6e9da9f372ce","text":"Privacy is not the primary goal (or is handled via Zero Knowledge)","type":"PRECONDITION","layer":null,"category":null,"handle":"Privacy is not the primary goal (or is handled via Zero Knowledge)","gloss":null,"stub":null,"metadata":{}},{"id":"5a548d34-611a-4f31-b5ff-c826741e559f","text":"Secrets eliminated from critical path","type":"POSTCONDITION","layer":null,"category":null,"handle":"Secrets eliminated from critical path","gloss":null,"stub":null,"metadata":{}},{"id":"ChunkMerge","text":"ChunkMerge#26e2","type":"PATTERN","layer":"Mind","category":"Memory","handle":"ChunkMerge#26e2","gloss":"Hierarchical context management","stub":"26e2","metadata":{"pattern":{"handle":"ChunkMerge","mechanism":"Cognitive Compression: Group related items into named chunks. Treat chunk as single unit in working memory. {{hierarchy}} of chunks enables handling complexity beyond raw capacity. Merge when patterns repeat; split when chunk becomes unwieldy. It applies {{aggregate}} to {{compress}} multiple working memory items into a single labeled unit.","gloss":"Hierarchical context management","failure_modes":["Lossy Compression: Discarding critical low-level details (e.g., specific ID numbers) during the merge process."],"invariants":["Chunk name must be meaningful.","Information Conservation: Merged chunk retains key retrieval hooks of parts","Size {{constraint}}: Size(Merged) <= ContextWindowLimit"],"preconditions":["Input chunks share semantic topic"],"_meta":{"tier":1,"layer":"Mind","category":"Memory","ring":2},"sema_id":"sema:ChunkMerge#mh:SHA-256:26e23e7ef95ba9c9136d95f59b319f3eb378890f0c4b709b7a3c7fef350fb29a","sema_ref":"ChunkMerge#26e2","sema_stub":"26e2","sema_layer":"Mind","sema_category":"Memory"},"layer":"Mind","category":"Memory"}},{"id":"4a92d91f-1a68-417a-8980-735665a3c327","text":"Chunk name must be meaningful.","type":"INVARIANT","layer":null,"category":null,"handle":"Chunk name must be meaningful.","gloss":null,"stub":null,"metadata":{}},{"id":"1d0c5a26-bd2a-4532-9a7d-71adf1300036","text":"Information Conservation: Merged chunk retains key retrieval hooks of parts","type":"INVARIANT","layer":null,"category":null,"handle":"Information Conservation: Merged chunk retains key retrieval hooks of parts","gloss":null,"stub":null,"metadata":{}},{"id":"2aba68c5-6f13-4e9e-9947-a7d7da88aaba","text":"Size {{constraint}}: Size(Merged) <= ContextWindowLimit","type":"INVARIANT","layer":null,"category":null,"handle":"Size {{constraint}}: Size(Merged) <= ContextWindowLimit","gloss":null,"stub":null,"metadata":{}},{"id":"cf2306ef-c8ad-4be7-885d-07190b48b3b8","text":"Input chunks share semantic topic","type":"PRECONDITION","layer":null,"category":null,"handle":"Input chunks share semantic topic","gloss":null,"stub":null,"metadata":{}},{"id":"DriftWatch","text":"DriftWatch#45de","type":"PATTERN","layer":"Society","category":"Protocols","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.","stub":"45de","metadata":{"pattern":{"handle":"DriftWatch","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}} of historical actions.","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.","failure_modes":["Witness collusion: Coordinated false drift reports.","Mitigated by random witness selection and meta-drift analysis on witness behavior.","False reports: Single malicious witness.","Mitigated by N-of-M threshold requirement.","Cold start: New agents have no baseline.","Mitigated by probationary period with higher friction, initial baseline borrowed from similar-role agents.","Baseline gaming: {{agent}} varies early to establish wide baseline.","Mitigated by crystallization window limits and anomaly detection during bootstrap."],"invariants":["Baseline Persistence: Baseline must remain immutable during measurement","Drift Detection: Alert if Distance(Current, Baseline) > Threshold"],"preconditions":["Baseline state is established"],"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"}],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":0},"sema_id":"sema:DriftWatch#mh:SHA-256:45def9613965f9a51777a3cce031db4cccc7b248d1735bd8000b7df65960ec51","sema_ref":"DriftWatch#45de","sema_stub":"45de","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"9f3a04bd-ea11-483b-930e-e6e89a9ade38","text":"Baseline Persistence: Baseline must remain immutable during measurement","type":"INVARIANT","layer":null,"category":null,"handle":"Baseline Persistence: Baseline must remain immutable during measurement","gloss":null,"stub":null,"metadata":{}},{"id":"d7e7e20e-a70f-442f-91a1-1ce5d45e9421","text":"Drift Detection: Alert if Distance(Current, Baseline) > Threshold","type":"INVARIANT","layer":null,"category":null,"handle":"Drift Detection: Alert if Distance(Current, Baseline) > Threshold","gloss":null,"stub":null,"metadata":{}},{"id":"8077354c-183e-42e0-a28c-b2a248e0b15d","text":"Baseline state is established","type":"PRECONDITION","layer":null,"category":null,"handle":"Baseline state is established","gloss":null,"stub":null,"metadata":{}},{"id":"Parallelize","text":"Parallelize#dac1","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"Parallelize#dac1","gloss":"Run subtasks simultaneously and aggregate","stub":"dac1","metadata":{"pattern":{"handle":"Parallelize","mechanism":"Runs multiple LLM calls simultaneously and aggregates results. Two modes: Sectioning (split {{task}} into independent subtasks, run in {{parallel}}, merge) and Voting (run same {{task}} multiple times, {{aggregate}} via majority {{mode}} or selection). Trades compute cost for speed and/or confidence. It spawns concurrent execution threads and employs {{aggregate}} to unify the results into a final {{result}}.","gloss":"Run subtasks simultaneously and aggregate","failure_modes":["Merge Conflicts: {{parallel}} outputs are incompatible and can't be combined.","Unanimous Wrong: All parallel paths make the same error.","Aggregation {{cognitive_bias}}: Merge {{strategy}} systematically favors certain outputs."],"invariants":["Tasks are independent","Total time = Max(Task_i) + Overhead"],"preconditions":["Batch of tasks","Multiple workers"],"postconditions":["All results aggregated"],"_meta":{"tier":1,"layer":"Mind","category":"Strategy","ring":0},"sema_layer":"Mind","sema_category":"Strategy","sema_id":"sema:Parallelize#mh:SHA-256:dac1ca99ae8c379c9ba093e840eaab9eb2ad16ccfbdb07d6c0e25e3fad2fae6c","sema_ref":"Parallelize#dac1","sema_stub":"dac1","signature":["Parallel(Task)","Aggregate(Result)"]},"layer":"Mind","category":"Strategy"}},{"id":"7a20c945-1fb2-4485-8cab-15ab2557d80b","text":"Tasks are independent","type":"INVARIANT","layer":null,"category":null,"handle":"Tasks are independent","gloss":null,"stub":null,"metadata":{}},{"id":"20a2e006-ac2d-4143-a12b-e43991290611","text":"Total time = Max(Task_i) + Overhead","type":"INVARIANT","layer":null,"category":null,"handle":"Total time = Max(Task_i) + Overhead","gloss":null,"stub":null,"metadata":{}},{"id":"05bbfb83-d324-405e-947d-b6149fee93e6","text":"Batch of tasks","type":"PRECONDITION","layer":null,"category":null,"handle":"Batch of tasks","gloss":null,"stub":null,"metadata":{}},{"id":"52d23c1b-5549-459f-bb63-bef40915ea51","text":"Multiple workers","type":"PRECONDITION","layer":null,"category":null,"handle":"Multiple workers","gloss":null,"stub":null,"metadata":{}},{"id":"25a36420-5bb0-4243-9f6f-9570ca0d8401","text":"All results aggregated","type":"POSTCONDITION","layer":null,"category":null,"handle":"All results aggregated","gloss":null,"stub":null,"metadata":{}},{"id":"PerspectiveEnsemble","text":"PerspectiveEnsemble#5816","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"PerspectiveEnsemble#5816","gloss":"Simulating diverse experts","stub":"5816","metadata":{"pattern":{"handle":"PerspectiveEnsemble","mechanism":"The {{agent}} instantiates N virtual personas to debate the {{problem}} from distinct, pre-defined viewpoints. The {{synthesis}} emerges from their interaction. Unlike a single {{chain}}-of-Thought, this forces the modeling of conflicting priors. It generates diverse viewpoints using {{steelman_check}} on opposing arguments, then resolves the conflict via {{aggregate}} (e.g. Mode).","gloss":"Simulating diverse experts","failure_modes":["Strawman Waltz: Personas agree too easily (Fabricated consensus).","Role Drift: Personas lose their specific stance over long {{context}} windows."],"invariants":["Semantic Distance: CosineSimilarity(Persona_A_Output, Persona_B_Output) < 0.6","Independence: Personas cannot see peer outputs in Round 1"],"preconditions":["{{agent}} must be alignment-seeking (Tier 2 Limitation)"],"parameters":[{"name":"personas","type":"List[String]","range":"[3, 7]","description":"Distinct viewpoints"},{"name":"rounds","type":"Integer","range":"[1, 5]","description":"Debate turns"}],"_meta":{"tier":2,"layer":"Mind","category":"Strategy","ring":2},"sema_id":"sema:PerspectiveEnsemble#mh:SHA-256:581616f76817ec08f652a538226cdabc79e5ff56e03c06857cd2a53e78d43a8b","sema_ref":"PerspectiveEnsemble#5816","sema_stub":"5816","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"0b047d78-165e-4fb1-9622-ec1bf8cc4717","text":"Semantic Distance: CosineSimilarity(Persona_A_Output, Persona_B_Output) < 0.6","type":"INVARIANT","layer":null,"category":null,"handle":"Semantic Distance: CosineSimilarity(Persona_A_Output, Persona_B_Output) < 0.6","gloss":null,"stub":null,"metadata":{}},{"id":"1ba8d70f-d9bd-447c-940e-fda91d7b09dd","text":"Independence: Personas cannot see peer outputs in Round 1","type":"INVARIANT","layer":null,"category":null,"handle":"Independence: Personas cannot see peer outputs in Round 1","gloss":null,"stub":null,"metadata":{}},{"id":"a96ad5e4-deeb-4682-8b88-84944e4f4b0b","text":"{{agent}} must be alignment-seeking (Tier 2 Limitation)","type":"PRECONDITION","layer":null,"category":null,"handle":"{{agent}} must be alignment-seeking (Tier 2 Limitation)","gloss":null,"stub":null,"metadata":{}},{"id":"ProphetFanOut","text":"ProphetFanOut#6972","type":"PATTERN","layer":"Mind","category":"Inference","handle":"ProphetFanOut#6972","gloss":"High-fanout causal simulation","stub":"6972","metadata":{"pattern":{"handle":"ProphetFanOut","mechanism":"A purely descriptive module that utilizes computational abundance to generate multiple branching future timelines resulting from a proposed action. Unlike standard {{chain}}-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}} by generating the diverse timeline candidates required for the {{aggregate}}.","gloss":"High-fanout causal simulation","failure_modes":["Fan-out explosion (generating too many irrelevant futures)."],"invariants":["Descriptive Only: Output must contain zero normative judgment","Diversity: Entropy(Timelines) > Threshold (Must explore distinct futures)"],"preconditions":["Action A is well-defined"],"postconditions":["At least 3 distinct futures generated"],"_meta":{"tier":1,"layer":"Mind","category":"Inference","ring":1},"sema_id":"sema:ProphetFanOut#mh:SHA-256:6972d19d015bb785ec16660c5a465e9451e2109e435e465b16a7432b806ecf7f","sema_ref":"ProphetFanOut#6972","sema_stub":"6972","sema_layer":"Mind","sema_category":"Inference"},"layer":"Mind","category":"Inference"}},{"id":"4ed292cf-184a-458a-afc5-13b6bd71c265","text":"Descriptive Only: Output must contain zero normative judgment","type":"INVARIANT","layer":null,"category":null,"handle":"Descriptive Only: Output must contain zero normative judgment","gloss":null,"stub":null,"metadata":{}},{"id":"753b195b-55d3-4e5d-8c65-aa321f1b38a7","text":"Diversity: Entropy(Timelines) > Threshold (Must explore distinct futures)","type":"INVARIANT","layer":null,"category":null,"handle":"Diversity: Entropy(Timelines) > Threshold (Must explore distinct futures)","gloss":null,"stub":null,"metadata":{}},{"id":"87ff0f6f-4500-4cd1-8786-19be524614a8","text":"Action A is well-defined","type":"PRECONDITION","layer":null,"category":null,"handle":"Action A is well-defined","gloss":null,"stub":null,"metadata":{}},{"id":"147574cd-ed9e-44f6-bda8-dacc946216f9","text":"At least 3 distinct futures generated","type":"POSTCONDITION","layer":null,"category":null,"handle":"At least 3 distinct futures generated","gloss":null,"stub":null,"metadata":{}},{"id":"SelfConsistency","text":"SelfConsistency#1793","type":"PATTERN","layer":"Mind","category":"Reasoning","handle":"SelfConsistency#1793","gloss":"Sample multiple reasoning chains, select by majority","stub":"1793","metadata":{"pattern":{"handle":"SelfConsistency","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}} (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}} to determine the most robust answer.","gloss":"Sample multiple reasoning chains, select by majority","failure_modes":["Consistent Wrongness: All N samples converge on the same incorrect answer (systematic bias).","Cost Explosion: N samples means N times the compute cost."],"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"],"_meta":{"tier":2,"layer":"Mind","category":"Reasoning","ring":2},"sema_ref":"SelfConsistency#1793","sema_id":"sema:SelfConsistency#mh:SHA-256:1793d1f73eb71f1153093c2223715de06100e2414f0ae47145b2f9a911276888","sema_stub":"1793","sema_layer":"Mind","sema_category":"Reasoning"},"layer":"Mind","category":"Reasoning"}},{"id":"8dce2258-53f0-4a85-8d13-e126fca76c95","text":"Aggregation: Final answer determined by plurality or weighted aggregation","type":"INVARIANT","layer":null,"category":null,"handle":"Aggregation: Final answer determined by plurality or weighted aggregation","gloss":null,"stub":null,"metadata":{}},{"id":"936f7b3a-8456-4f76-a532-f6de1aac60c7","text":"Independence: Each sample must be generated without knowledge of others","type":"INVARIANT","layer":null,"category":null,"handle":"Independence: Each sample must be generated without knowledge of others","gloss":null,"stub":null,"metadata":{}},{"id":"1f863bba-1d60-45fc-90f5-6f61ffe123bb","text":"N >= 3: Minimum samples for meaningful convergence","type":"INVARIANT","layer":null,"category":null,"handle":"N >= 3: Minimum samples for meaningful convergence","gloss":null,"stub":null,"metadata":{}},{"id":"ContextSwitch","text":"ContextSwitch#5bb8","type":"PATTERN","layer":"Society","category":"Protocols","handle":"ContextSwitch#5bb8","gloss":"Explicit mode toggling","stub":"5bb8","metadata":{"pattern":{"handle":"ContextSwitch","mechanism":"{{agent}}s explicitly use {{switch}} to signal a change in {{context}} (protocol {{mode}}). All subsequent messages are interpreted under the new ruleset until a 'Revert' signal is sent.","gloss":"Explicit mode toggling","sema_id":"sema:ContextSwitch#mh:SHA-256:5bb8b7ef36dbdfdf6f32e4b26586a975db765c79c87ce17ac28ed6e83b1e8e5c","sema_ref":"ContextSwitch#5bb8","sema_stub":"5bb8","_meta":{"layer":"Society","category":"Protocols","ring":0,"tier":1},"sema_layer":"Society","sema_category":"Protocols","signature":["Switch(Context)"]},"layer":"Society","category":"Protocols"}},{"id":"UptakeOverTimestamp","text":"UptakeOverTimestamp#fdb6","type":"PATTERN","layer":"Society","category":"Protocols","handle":"UptakeOverTimestamp#fdb6","gloss":"Usage determines canonical status, not who minted first","stub":"fdb6","metadata":{"pattern":{"handle":"UptakeOverTimestamp","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 {{uptake_as_ground}}.","gloss":"Usage determines canonical status, not who minted first","failure_modes":["The Facebook {{problem}} (Network Effects): A mediocre pattern with high early uptake becomes impossible to dislodge by a superior new pattern.","Cold Start: New patterns have 0 uptake, making them invisible to discovery algorithms."],"invariants":["Meritocracy: Canonical_Score = f(Usage, Citations, Success_Rate).","Timestamp Irrelevance: Creation_Date must NOT be a factor in relevance ranking."],"preconditions":["Multiple patterns exist for similar concepts","Usage metrics available"],"postconditions":["Canonical pattern identified","Squatted/Dead patterns suppressed"],"_meta":{"tier":2,"layer":"Society","category":"Protocols","ring":1},"sema_id":"sema:UptakeOverTimestamp#mh:SHA-256:fdb60eb23d0437e0f29680b0503911c6643e629412b883d1dda9acb81903da0a","sema_ref":"UptakeOverTimestamp#fdb6","sema_stub":"fdb6","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"5f010fd5-0972-4800-8896-d98ec5fe215e","text":"Meritocracy: Canonical_Score = f(Usage, Citations, Success_Rate).","type":"INVARIANT","layer":null,"category":null,"handle":"Meritocracy: Canonical_Score = f(Usage, Citations, Success_Rate).","gloss":null,"stub":null,"metadata":{}},{"id":"e626ba7e-6dc9-4636-8b39-c5b6b57c2e16","text":"Timestamp Irrelevance: Creation_Date must NOT be a factor in relevance ranking.","type":"INVARIANT","layer":null,"category":null,"handle":"Timestamp Irrelevance: Creation_Date must NOT be a factor in relevance ranking.","gloss":null,"stub":null,"metadata":{}},{"id":"7ccf6872-70d1-4943-b211-d924f5ce514a","text":"Multiple patterns exist for similar concepts","type":"PRECONDITION","layer":null,"category":null,"handle":"Multiple patterns exist for similar concepts","gloss":null,"stub":null,"metadata":{}},{"id":"a499ce76-d729-43b1-9762-647c4e1af6fc","text":"Usage metrics available","type":"PRECONDITION","layer":null,"category":null,"handle":"Usage metrics available","gloss":null,"stub":null,"metadata":{}},{"id":"c1e77493-d835-47c5-8668-7e1e5ff827fc","text":"Canonical pattern identified","type":"POSTCONDITION","layer":null,"category":null,"handle":"Canonical pattern identified","gloss":null,"stub":null,"metadata":{}},{"id":"c9c914d4-f5d3-43d7-828a-eb35a0974a92","text":"Squatted/Dead patterns suppressed","type":"POSTCONDITION","layer":null,"category":null,"handle":"Squatted/Dead patterns suppressed","gloss":null,"stub":null,"metadata":{}},{"id":"GhostTrail","text":"GhostTrail#91ae","type":"PATTERN","layer":"Society","category":"Protocols","handle":"GhostTrail#91ae","gloss":"Cryptographically verified anonymous stigmergy","stub":"91ae","metadata":{"pattern":{"handle":"GhostTrail","mechanism":"A stigmergic {{protocol}} where environmental {{trace}}s (pheromones) are cryptographically signed by a Ring Signature. This proves that a {{trace}} was left by a valid member of the Scout group without revealing the specific {{agent}}'s {{identity}} or location history. The swarm follows the {{trace}} because it verifies the Group Authority, but no predator can track the individual Scout who laid it. It secures the {{trace}} with {{identity_mask}}, ensuring the signature validates group membership without revealing the individual scout.","gloss":"Cryptographically verified anonymous stigmergy","failure_modes":["Sybil Ring: If the anonymous group is infiltrated by enough adversaries, they can flood the environment with fake (but validly signed) trails."],"invariants":["Plausible Deniability: Probability(Signer = Agent_N) = 1/N","{{trace}} Authority: Verify({{trace}}, RingKey) == True"],"preconditions":["Group Public Keys established","Shared environment (Canvas/Map)"],"_meta":{"tier":1,"layer":"Society","category":"Protocols","related":["RingWitness","TimeWarpLog#e409"],"ring":0},"sema_id":"sema:GhostTrail#mh:SHA-256:91ae8d7d1b3e4bd39696fc0583fae5f2238600d7a041e010374c7edc01732cd2","sema_ref":"GhostTrail#91ae","sema_stub":"91ae","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"21edabbe-e7e2-427e-97c5-ff45242883a4","text":"Plausible Deniability: Probability(Signer = Agent_N) = 1/N","type":"INVARIANT","layer":null,"category":null,"handle":"Plausible Deniability: Probability(Signer = Agent_N) = 1/N","gloss":null,"stub":null,"metadata":{}},{"id":"d8b9dabc-4f45-47c7-96e3-48d815ccaa09","text":"{{trace}} Authority: Verify({{trace}}, RingKey) == True","type":"INVARIANT","layer":null,"category":null,"handle":"{{trace}} Authority: Verify({{trace}}, RingKey) == True","gloss":null,"stub":null,"metadata":{}},{"id":"cbf958f1-9264-4fe9-99f0-dee344044213","text":"Group Public Keys established","type":"PRECONDITION","layer":null,"category":null,"handle":"Group Public Keys established","gloss":null,"stub":null,"metadata":{}},{"id":"445324bf-fafc-4ce2-b52f-0ddfbb44a32c","text":"Shared environment (Canvas/Map)","type":"PRECONDITION","layer":null,"category":null,"handle":"Shared environment (Canvas/Map)","gloss":null,"stub":null,"metadata":{}},{"id":"MimicMask","text":"MimicMask#0fe8","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"MimicMask#0fe8","gloss":"Hiding in the crowd","stub":"0fe8","metadata":{"pattern":{"handle":"MimicMask","mechanism":"Agents send decoy traffic that statistically mimics the behavior of other agents. Real signals are steganographically encoded within the {{noise}}. Makes it impossible for an observer to distinguish active agents from idle ones. It layers steganographic {{noise}} over an {{identity_mask}}, ensuring statistical indistinguishability from background traffic.","gloss":"Hiding in the crowd","failure_modes":["Bandwidth waste."],"invariants":["Statistical Parity: Traffic distribution matches Baseline(Normal)","Steganographic Integrity: Payload retrievable by Key(Receiver)"],"preconditions":["Shared secret established"],"postconditions":["Observer sees {{noise}}"],"_meta":{"tier":1,"layer":"Mind","category":"Strategy","ring":2},"sema_id":"sema:MimicMask#mh:SHA-256:0fe8418d9f34643affbdab2d7372dd7b07ed50ef3d4447c0c5042dc20225147a","sema_ref":"MimicMask#0fe8","sema_stub":"0fe8","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"e726adb2-0d98-4cbc-abb5-167f1194f56c","text":"Statistical Parity: Traffic distribution matches Baseline(Normal)","type":"INVARIANT","layer":null,"category":null,"handle":"Statistical Parity: Traffic distribution matches Baseline(Normal)","gloss":null,"stub":null,"metadata":{}},{"id":"7eab7bb5-520e-46e1-ad97-3ad5e94b2b4f","text":"Steganographic Integrity: Payload retrievable by Key(Receiver)","type":"INVARIANT","layer":null,"category":null,"handle":"Steganographic Integrity: Payload retrievable by Key(Receiver)","gloss":null,"stub":null,"metadata":{}},{"id":"d07d76f1-e091-41ec-8588-79dd3de49ca1","text":"Shared secret established","type":"PRECONDITION","layer":null,"category":null,"handle":"Shared secret established","gloss":null,"stub":null,"metadata":{}},{"id":"c4b2dd1e-6081-4e0f-9e1c-95873efa0249","text":"Observer sees {{noise}}","type":"POSTCONDITION","layer":null,"category":null,"handle":"Observer sees {{noise}}","gloss":null,"stub":null,"metadata":{}},{"id":"RingWitness","text":"RingWitness#1038","type":"PATTERN","layer":"Infrastructure","category":"Verification","handle":"RingWitness#1038","gloss":"Group-level attribution without individual identification","stub":"1038","metadata":{"pattern":{"handle":"RingWitness","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 {{identity_mask}} to prove group membership without revealing individual identity.","gloss":"Group-level attribution without individual identification","failure_modes":["Sybil attacks (one agent flooding the ring with fake identities)."],"invariants":["All N witnesses signed","Order of signing preserved"],"preconditions":["Document/Fact","Ring of verifiers"],"postconditions":["Proof of consensus"],"_meta":{"tier":1,"layer":"Infrastructure","category":"Verification","ring":1},"sema_id":"sema:RingWitness#mh:SHA-256:1038a04f0c68ad710717eedc0f6512fc55c480bedb0922e874163f8e234afe01","sema_ref":"RingWitness#1038","sema_stub":"1038","sema_layer":"Infrastructure","sema_category":"Verification"},"layer":"Infrastructure","category":"Verification"}},{"id":"b64634ff-da95-44c6-a5e6-eb5112f39b27","text":"All N witnesses signed","type":"INVARIANT","layer":null,"category":null,"handle":"All N witnesses signed","gloss":null,"stub":null,"metadata":{}},{"id":"d1d3c5f1-8c3f-4ce3-b3d3-5f8d45994e68","text":"Order of signing preserved","type":"INVARIANT","layer":null,"category":null,"handle":"Order of signing preserved","gloss":null,"stub":null,"metadata":{}},{"id":"1fc74cda-847a-4b45-90f7-a42b207e216c","text":"Document/Fact","type":"PRECONDITION","layer":null,"category":null,"handle":"Document/Fact","gloss":null,"stub":null,"metadata":{}},{"id":"f3fbaddc-1f71-4e83-96e5-0a1943b105ba","text":"Ring of verifiers","type":"PRECONDITION","layer":null,"category":null,"handle":"Ring of verifiers","gloss":null,"stub":null,"metadata":{}},{"id":"2bba979a-0c90-4e45-b53f-7425a85c788a","text":"Proof of consensus","type":"POSTCONDITION","layer":null,"category":null,"handle":"Proof of consensus","gloss":null,"stub":null,"metadata":{}},{"id":"TimeWarpLog","text":"TimeWarpLog#aa7a","type":"PATTERN","layer":"Infrastructure","category":"Primitives","handle":"TimeWarpLog#aa7a","gloss":"Handling relativistic event ordering","stub":"aa7a","metadata":{"pattern":{"handle":"TimeWarpLog","mechanism":"Events are not ordered by wall-clock time but by 'causal cones'. An {{agent}} accepts an event from the 'past' if it doesn't contradict its current causal cone. Allows for massive latency tolerance. Utilizes {{world_reversible}}, {{causal_barrier}}.","gloss":"Handling relativistic event ordering","failure_modes":["User confusion about 'when' things happened."],"invariants":["Immutability: Past entries cannot be modified","Indexability: Seek(Time T) returns deterministic {{state}}(T)","Log immutable after write."],"preconditions":["Storage supports append-only writes"],"postconditions":["{{system}} state matches T_target"],"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"}],"_meta":{"tier":1,"layer":"Infrastructure","category":"Primitives","ring":0},"sema_id":"sema:TimeWarpLog#mh:SHA-256:aa7a5f4cc64abcca090f2931d75a7dc0718ec2e20cd42fb0737f5fa4a87c3e32","sema_ref":"TimeWarpLog#aa7a","sema_stub":"aa7a","sema_layer":"Infrastructure","sema_category":"Primitives"},"layer":"Infrastructure","category":"Primitives"}},{"id":"16622c1f-b8c1-45e6-bb73-fa9a6caabba2","text":"Indexability: Seek(Time T) returns deterministic {{state}}(T)","type":"INVARIANT","layer":null,"category":null,"handle":"Indexability: Seek(Time T) returns deterministic {{state}}(T)","gloss":null,"stub":null,"metadata":{}},{"id":"9ab9c9b9-a345-470f-804c-87e29d84b4df","text":"Log immutable after write.","type":"INVARIANT","layer":null,"category":null,"handle":"Log immutable after write.","gloss":null,"stub":null,"metadata":{}},{"id":"101a876c-c171-49fb-95cb-54a0e1e89529","text":"Storage supports append-only writes","type":"PRECONDITION","layer":null,"category":null,"handle":"Storage supports append-only writes","gloss":null,"stub":null,"metadata":{}},{"id":"7d92c166-091e-4f09-810b-4312f83b7f80","text":"{{system}} state matches T_target","type":"POSTCONDITION","layer":null,"category":null,"handle":"{{system}} state matches T_target","gloss":null,"stub":null,"metadata":{}},{"id":"AttentionMarkets","text":"AttentionMarkets#abdd","type":"PATTERN","layer":"Society","category":"Economics","handle":"AttentionMarkets#abdd","gloss":"Pricing bandwidth to filter spam","stub":"abdd","metadata":{"pattern":{"handle":"AttentionMarkets","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}}s include a {{value}} 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 {{continuous_resource_auction}} mechanism to continuously price bandwidth availability based on network congestion.","gloss":"Pricing bandwidth to filter spam","failure_modes":["Plutocratic Blockage: Wealthy agents monopolize bandwidth, silencing critical low-budget signals (e.g., emergency alerts).","Starvation: Low-value signals never clear the queue during high 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."],"preconditions":["Limited processing bandwidth","Multiple information sources","Liquid currency for bidding"],"postconditions":["Resources allocated to highest-bid signals","Market price established for current tick"],"_meta":{"tier":1,"layer":"Society","category":"Economics","ring":1},"sema_id":"sema:AttentionMarkets#mh:SHA-256:abdda155165282a52b447988e6d25eb9bb85e9e6deaaf8983eeaf16f3aa05180","sema_ref":"AttentionMarkets#abdd","sema_stub":"abdd","sema_layer":"Society","sema_category":"Economics"},"layer":"Society","category":"Economics"}},{"id":"c31d31e5-1600-4e76-a3b7-aa9cce08d574","text":"Attention supply is rivalrous (Bandwidth < Demand).","type":"INVARIANT","layer":null,"category":null,"handle":"Attention supply is rivalrous (Bandwidth < Demand).","gloss":null,"stub":null,"metadata":{}},{"id":"e7b99fb4-c548-4b1d-96da-b995fafbbecf","text":"Price reflects aggregate demand (Congestion Pricing).","type":"INVARIANT","layer":null,"category":null,"handle":"Price reflects aggregate demand (Congestion Pricing).","gloss":null,"stub":null,"metadata":{}},{"id":"282611d5-f587-47de-9fda-046b123f757b","text":"Bid Monotonicity: Higher bid guarantees strictly better or equal placement.","type":"INVARIANT","layer":null,"category":null,"handle":"Bid Monotonicity: Higher bid guarantees strictly better or equal placement.","gloss":null,"stub":null,"metadata":{}},{"id":"a26e529a-9885-4fc2-bb71-95573c8c40da","text":"Clearing: Messages with Bid < CurrentPrice are dropped or buffered.","type":"INVARIANT","layer":null,"category":null,"handle":"Clearing: Messages with Bid < CurrentPrice are dropped or buffered.","gloss":null,"stub":null,"metadata":{}},{"id":"07f54a64-4a89-4573-9e91-3938443f9cec","text":"Limited processing bandwidth","type":"PRECONDITION","layer":null,"category":null,"handle":"Limited processing bandwidth","gloss":null,"stub":null,"metadata":{}},{"id":"fdad5c56-3c9e-454e-9521-57c5ff870245","text":"Multiple information sources","type":"PRECONDITION","layer":null,"category":null,"handle":"Multiple information sources","gloss":null,"stub":null,"metadata":{}},{"id":"b96fd603-8aa9-46b4-9295-e750267135dc","text":"Liquid currency for bidding","type":"PRECONDITION","layer":null,"category":null,"handle":"Liquid currency for bidding","gloss":null,"stub":null,"metadata":{}},{"id":"129ddb08-30c3-4b35-bbf2-b57f1d4c9d07","text":"Resources allocated to highest-bid signals","type":"POSTCONDITION","layer":null,"category":null,"handle":"Resources allocated to highest-bid signals","gloss":null,"stub":null,"metadata":{}},{"id":"e5eb812f-3f79-4797-894f-2415a07e0d66","text":"Market price established for current tick","type":"POSTCONDITION","layer":null,"category":null,"handle":"Market price established for current tick","gloss":null,"stub":null,"metadata":{}},{"id":"StateSnapshot","text":"StateSnapshot#01c9","type":"PATTERN","layer":"Society","category":"Protocols","handle":"StateSnapshot#01c9","gloss":"Durable persistence of volatile state","stub":"01c9","metadata":{"pattern":{"handle":"StateSnapshot","mechanism":"Periodic serialization of internal volatile {{state}} to durable storage to enable crash recovery. Unlike distributed checkpoints (which requires consensus), {{snapshot}} is a local or unilateral durability guarantee. It enables 'Resume' functionality. Utilizes {{trace}}, {{crypto_shred}}, {{idempotent_write}}.","gloss":"Durable persistence of volatile state","invariants":["Atomicity: {{snapshot}} is either fully written or discarded (no partial corruption)","Roundtrip Integrity: Deserialize(Serialize(S)) must equal S"],"preconditions":["Serializable {{state}}","Write access to durable storage"],"postconditions":["Resume point established"],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":0},"sema_id":"sema:StateSnapshot#mh:SHA-256:01c99fd1a5b7fe33a7065bfddcce746f76ecb2f2737cdd578801903cb7f1e990","sema_ref":"StateSnapshot#01c9","sema_stub":"01c9","sema_layer":"Society","sema_category":"Protocols","signature":["State(Snapshot)"]},"layer":"Society","category":"Protocols"}},{"id":"10eba840-bce8-4050-9b09-b9e669b846b7","text":"Atomicity: {{snapshot}} is either fully written or discarded (no partial corruption)","type":"INVARIANT","layer":null,"category":null,"handle":"Atomicity: {{snapshot}} is either fully written or discarded (no partial corruption)","gloss":null,"stub":null,"metadata":{}},{"id":"2c55ed7d-969e-44c0-8c21-bfd87e428b95","text":"Roundtrip Integrity: Deserialize(Serialize(S)) must equal S","type":"INVARIANT","layer":null,"category":null,"handle":"Roundtrip Integrity: Deserialize(Serialize(S)) must equal S","gloss":null,"stub":null,"metadata":{}},{"id":"614267df-c755-4fab-b9a0-d32a0e2a7895","text":"Serializable {{state}}","type":"PRECONDITION","layer":null,"category":null,"handle":"Serializable {{state}}","gloss":null,"stub":null,"metadata":{}},{"id":"1cfcd968-f4d1-4066-8493-5be24d2a632a","text":"Write access to durable storage","type":"PRECONDITION","layer":null,"category":null,"handle":"Write access to durable storage","gloss":null,"stub":null,"metadata":{}},{"id":"b0dc8ae9-b028-470a-bcb6-da507d0e7c16","text":"Resume point established","type":"POSTCONDITION","layer":null,"category":null,"handle":"Resume point established","gloss":null,"stub":null,"metadata":{}},{"id":"HeldRelease","text":"HeldRelease#5b7a","type":"PATTERN","layer":"Society","category":"Protocols","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","stub":"5b7a","metadata":{"pattern":{"handle":"HeldRelease","mechanism":"{{value}} ({{unique_handle}}) 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}} 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.","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","failure_modes":["Preimage loss: If Party B loses the preimage, value returns to A on timeout (safe but B loses).","{{condition}} ambiguity: Hash commits to bytes, not semantics - parties must agree on preimage meaning off-chain.","Timeout racing: Near timeout, both CLAIM and TIMEOUT may be in flight - needs atomic resolution.","Oracle dependency: If condition requires external verification, oracle becomes trust point."],"invariants":["Atomic {{state}}: Funds are either Locked, Released, or Returned (no partial states)","Release atomic.","Timeout Guarantee: Funds return to Sender if {{condition}} 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"}],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":0},"sema_layer":"Society","sema_category":"Protocols","sema_id":"sema:HeldRelease#mh:SHA-256:5b7a43f760dc439c0880f720faf1be428aa39a119e55a579d249aa264a38ee93","sema_ref":"HeldRelease#5b7a","sema_stub":"5b7a"},"layer":"Society","category":"Protocols"}},{"id":"5dd2ebfe-58ae-48a1-bb00-1cfa2bf76e9a","text":"Atomic {{state}}: Funds are either Locked, Released, or Returned (no partial states)","type":"INVARIANT","layer":null,"category":null,"handle":"Atomic {{state}}: Funds are either Locked, Released, or Returned (no partial states)","gloss":null,"stub":null,"metadata":{}},{"id":"b2c24195-358d-455c-bf69-c348fb7431bb","text":"Release atomic.","type":"INVARIANT","layer":null,"category":null,"handle":"Release atomic.","gloss":null,"stub":null,"metadata":{}},{"id":"961ad1f6-9a98-420f-bda0-6ea30169d8a6","text":"Timeout Guarantee: Funds return to Sender if {{condition}} is not met by T","type":"INVARIANT","layer":null,"category":null,"handle":"Timeout Guarantee: Funds return to Sender if {{condition}} is not met by T","gloss":null,"stub":null,"metadata":{}},{"id":"ChainOfThought","text":"ChainOfThought#6201","type":"PATTERN","layer":"Mind","category":"Reasoning","handle":"ChainOfThought#6201","gloss":"Step-by-step reasoning (Macro for Think(Chain))","stub":"6201","metadata":{"pattern":{"handle":"ChainOfThought","mechanism":"The canonical implementation of sequential reasoning. Instantiates the '{{think}}' primitive with a linear '{{chain}}' {{topology}}. Elicits a step-by-step derivation of the answer to improve accuracy and transparency. It implements the {{think}} primitive as a linear {{chain}}, optionally invoking {{step_back}} or {{reflexion}} to self-correct during the derivation.","gloss":"Step-by-step reasoning (Macro for Think(Chain))","invariants":["Inherits invariants from {{think}} and {{chain}}","Reasoning Before Answer: Intermediate steps must precede final conclusion"],"_meta":{"tier":2,"layer":"Mind","category":"Reasoning","related":["ProgramOfThought","ReAct"],"ring":2},"sema_id":"sema:ChainOfThought#mh:SHA-256:620185e6502cb8b2ac69fcdd94243e5ccfa2f54d3d34524dcf26a1c81662294c","sema_ref":"ChainOfThought#6201","sema_stub":"6201","sema_layer":"Mind","sema_category":"Reasoning","signature":["Think(Chain)"]},"layer":"Mind","category":"Reasoning"}},{"id":"26d72131-b9d2-4f54-bd07-efbb621640cb","text":"Inherits invariants from {{think}} and {{chain}}","type":"INVARIANT","layer":null,"category":null,"handle":"Inherits invariants from {{think}} and {{chain}}","gloss":null,"stub":null,"metadata":{}},{"id":"02cdb9e5-218b-4c00-ba0d-ab64b5c1dd57","text":"Reasoning Before Answer: Intermediate steps must precede final conclusion","type":"INVARIANT","layer":null,"category":null,"handle":"Reasoning Before Answer: Intermediate steps must precede final conclusion","gloss":null,"stub":null,"metadata":{}},{"id":"DogfoodFirst","text":"DogfoodFirst#826e","type":"PATTERN","layer":"Society","category":"Economics","handle":"DogfoodFirst#826e","gloss":"Use your own tool before shipping","stub":"826e","metadata":{"pattern":{"handle":"DogfoodFirst","mechanism":"Validation {{protocol}}. 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}}, using the tool in production and generating a {{reflexion}} log of friction points.","gloss":"Use your own tool before shipping","failure_modes":["Hello World Fallacy: Validating only on trivial 'demo' cases instead of production loads.","Creator {{cognitive_bias}}: Creator unconsciously avoids edge cases they know will fail."],"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)."],"preconditions":["Real-world use case identified","Tool/Pattern is functionally complete"],"postconditions":["Friction Log generated","Release {{gate}} passed OR Refactor triggered"],"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"}],"_meta":{"tier":2,"layer":"Society","category":"Economics","ring":0},"sema_id":"sema:DogfoodFirst#mh:SHA-256:826e2ceafda81d7db4a19d1cf6bd8ad0c2cd86b24c65d1654ba7efb345374260","sema_ref":"DogfoodFirst#826e","sema_stub":"826e","sema_layer":"Society","sema_category":"Economics"},"layer":"Society","category":"Economics"}},{"id":"0844d528-70b5-4cf0-9e4b-f60c639f27d1","text":"Friction Documentation: All UX hurdles encountered must be logged.","type":"INVARIANT","layer":null,"category":null,"handle":"Friction Documentation: All UX hurdles encountered must be logged.","gloss":null,"stub":null,"metadata":{}},{"id":"8dcd1204-d2eb-44d7-a6b4-968040989452","text":"Skin in the Game: Validation must involve real risk or real work (not a simulation).","type":"INVARIANT","layer":null,"category":null,"handle":"Skin in the Game: Validation must involve real risk or real work (not a simulation).","gloss":null,"stub":null,"metadata":{}},{"id":"fd21b72b-db49-4a6e-95f3-f01926c1ec93","text":"Real-world use case identified","type":"PRECONDITION","layer":null,"category":null,"handle":"Real-world use case identified","gloss":null,"stub":null,"metadata":{}},{"id":"4b1cd8a2-65f2-41e6-a9dd-d57d3623c47e","text":"Tool/Pattern is functionally complete","type":"PRECONDITION","layer":null,"category":null,"handle":"Tool/Pattern is functionally complete","gloss":null,"stub":null,"metadata":{}},{"id":"3e1c30ec-6251-4e16-83f2-80de83f6603d","text":"Friction Log generated","type":"POSTCONDITION","layer":null,"category":null,"handle":"Friction Log generated","gloss":null,"stub":null,"metadata":{}},{"id":"ee541cdd-8fa4-476a-ad23-50efa6407ec6","text":"Release {{gate}} passed OR Refactor triggered","type":"POSTCONDITION","layer":null,"category":null,"handle":"Release {{gate}} passed OR Refactor triggered","gloss":null,"stub":null,"metadata":{}},{"id":"MetaCheck","text":"MetaCheck#a228","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"MetaCheck#a228","gloss":"Recursive self-verification of reasoning","stub":"a228","metadata":{"pattern":{"handle":"MetaCheck","mechanism":"Reasoning {{audit}}: 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}} cycle where the reasoning process itself becomes the object of critique. The checker {{check}}s the checking process at a {{meta}} level.","gloss":"Recursive self-verification of reasoning","failure_modes":["Infinite {{meta}}-Regress: Checking the checker that checks the checker, never terminating."],"invariants":["Checker checks the checking process","Infinite regress avoided (max depth)"],"preconditions":["{{audit}} logic","Verification result"],"postconditions":["Verification validated"],"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"}],"_meta":{"tier":1,"layer":"Mind","category":"Strategy","ring":1},"sema_id":"sema:MetaCheck#mh:SHA-256:a228b1133c27b81db71a125234a13a0acac3464d6ac33fcc89d2e351b1bdb494","sema_ref":"MetaCheck#a228","sema_stub":"a228","sema_layer":"Mind","sema_category":"Strategy","signature":["Meta(Check)"]},"layer":"Mind","category":"Strategy"}},{"id":"9c8022cd-283f-4ad6-892d-29d31acd84ea","text":"Checker checks the checking process","type":"INVARIANT","layer":null,"category":null,"handle":"Checker checks the checking process","gloss":null,"stub":null,"metadata":{}},{"id":"e7cd6868-f5b1-49ab-bc52-292fdf8190e5","text":"Infinite regress avoided (max depth)","type":"INVARIANT","layer":null,"category":null,"handle":"Infinite regress avoided (max depth)","gloss":null,"stub":null,"metadata":{}},{"id":"5623bc2d-27e8-43ad-b763-041486b396b2","text":"{{audit}} logic","type":"PRECONDITION","layer":null,"category":null,"handle":"{{audit}} logic","gloss":null,"stub":null,"metadata":{}},{"id":"6ef8a6be-1148-4b43-b88a-cede29115ae9","text":"Verification result","type":"PRECONDITION","layer":null,"category":null,"handle":"Verification result","gloss":null,"stub":null,"metadata":{}},{"id":"463131d5-2923-42b5-8375-a609c7b86292","text":"Verification validated","type":"POSTCONDITION","layer":null,"category":null,"handle":"Verification validated","gloss":null,"stub":null,"metadata":{}},{"id":"CognitiveEcho","text":"CognitiveEcho#8794","type":"PATTERN","layer":"Society","category":"Protocols","handle":"CognitiveEcho#8794","gloss":"Estimating difficulty via simulation variance","stub":"8794","metadata":{"pattern":{"handle":"CognitiveEcho","mechanism":"Variance-Based Effort Estimation: {{agent}} 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.","gloss":"Estimating difficulty via simulation variance","failure_modes":["Correlated Hallucination: All simulations are wrong in the exact same way (low variance, high error).","The simulation model might be too simple to catch edge cases (false negative).","{{simulation}} cost may exceed just trying the task for truly simple problems.","Sample count is arbitrary - tuning required."],"invariants":["Delay does not exceed short-term memory bounds","Echo content matches input semantic hash"],"preconditions":["Feedback loop enabled","Input signal"],"postconditions":["{{signal}} amplified or validated"],"_meta":{"tier":1,"layer":"Society","category":"Protocols","related":["SignalReflection"],"ring":2},"sema_id":"sema:CognitiveEcho#mh:SHA-256:87944cff5800be8185dcd8ec13bb1c2f4f1455562e387b1ab8d57205f17073ba","sema_ref":"CognitiveEcho#8794","sema_stub":"8794","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"85979263-1e96-4e0d-a361-a415073eee43","text":"Delay does not exceed short-term memory bounds","type":"INVARIANT","layer":null,"category":null,"handle":"Delay does not exceed short-term memory bounds","gloss":null,"stub":null,"metadata":{}},{"id":"8cfde2a9-feb0-4010-ba38-a379029f4629","text":"Echo content matches input semantic hash","type":"INVARIANT","layer":null,"category":null,"handle":"Echo content matches input semantic hash","gloss":null,"stub":null,"metadata":{}},{"id":"811205a0-17be-47d6-bf99-ff8a53981d1a","text":"Feedback loop enabled","type":"PRECONDITION","layer":null,"category":null,"handle":"Feedback loop enabled","gloss":null,"stub":null,"metadata":{}},{"id":"d53aec35-c70f-4e39-b29b-6523f2043fa0","text":"Input signal","type":"PRECONDITION","layer":null,"category":null,"handle":"Input signal","gloss":null,"stub":null,"metadata":{}},{"id":"5eac4217-7f34-4778-b6b7-1981c2223442","text":"{{signal}} amplified or validated","type":"POSTCONDITION","layer":null,"category":null,"handle":"{{signal}} amplified or validated","gloss":null,"stub":null,"metadata":{}},{"id":"AgentProtocol","text":"AgentProtocol#1035","type":"PATTERN","layer":"Society","category":"Protocols","handle":"AgentProtocol#1035","gloss":"Standard patterns for multi-agent coordination","stub":"1035","metadata":{"pattern":{"handle":"AgentProtocol","mechanism":"Pattern Bundle. Defines the standard suite of patterns required for basic {{agent}} {{protocol}} interoperability. Importing this bundle automatically imports the dependencies. It bundles {{task}} for {{work}} definition, {{fail_closed}} for safe halting, {{greet}} for handshake, {{accept_spec}} for validation, and {{solution}} for output standardization into a cohesive interaction suite.","gloss":"Standard patterns for multi-agent coordination","invariants":["Bundle Integrity: Importing this implies importing all contents."],"_meta":{"tier":2,"layer":"Society","category":"Protocols","ring":1},"sema_id":"sema:AgentProtocol#mh:SHA-256:1035dbf4d1c7dce2e8880683cef69001bfbe59c75642db2c89a816ddc846a4bd","sema_ref":"AgentProtocol#1035","sema_stub":"1035","sema_layer":"Society","sema_category":"Protocols","signature":["Agent(Protocol)"]},"layer":"Society","category":"Protocols"}},{"id":"888fbb87-fe31-4038-90cb-55a3161c80b5","text":"Bundle Integrity: Importing this implies importing all contents.","type":"INVARIANT","layer":null,"category":null,"handle":"Bundle Integrity: Importing this implies importing all contents.","gloss":null,"stub":null,"metadata":{}},{"id":"BoundedTask","text":"BoundedTask#06a6","type":"PATTERN","layer":"Society","category":"Protocols","handle":"BoundedTask#06a6","gloss":"Economically constrained task","stub":"06a6","metadata":{"pattern":{"handle":"BoundedTask","mechanism":"A specialized {{task}} enforcing {{budget}} and {{accept_spec}} to ensure economic and quality boundaries.","gloss":"Economically constrained task","invariants":["Budget Enclosure","Quality Gate"],"derived_from":"sema:Task#mh:SHA-256:aa452d4a85efe37eed426f6529f3f2e1ee359999ff5ce3dd822f986f1513b4e7","sema_id":"sema:BoundedTask#mh:SHA-256:06a6eab9f36242682b865ee828dc14f40c449301eed224727c1a801851333543","sema_ref":"BoundedTask#06a6","sema_stub":"06a6","_meta":{"layer":"Society","category":"Protocols","ring":2,"tier":2},"sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"fa05dbad-65a9-4ae5-84b8-627dc724de35","text":"Budget Enclosure","type":"INVARIANT","layer":null,"category":null,"handle":"Budget Enclosure","gloss":null,"stub":null,"metadata":{}},{"id":"b0b19892-5ade-4ee0-87e0-5fe0249ae9cf","text":"Quality Gate","type":"INVARIANT","layer":null,"category":null,"handle":"Quality Gate","gloss":null,"stub":null,"metadata":{}},{"id":"DataMinimization","text":"DataMinimization#75a3","type":"PATTERN","layer":"Society","category":"Protocols","handle":"DataMinimization#75a3","gloss":"Ingest only what is strictly necessary","stub":"75a3","metadata":{"pattern":{"handle":"DataMinimization","mechanism":"Information Hygiene {{protocol}}. Before ingesting a {{context}} or Dataset, the {{agent}} MUST execute a filtering pass to remove all fields/tokens not strictly necessary for the immediate `{{task}}.Goal`. This enforces the Principle of Least Privilege for data access. It invokes {{input_guard}} to filter raw ingress, employing {{select}} to fetch only required fields and {{context_compress}} to drop transient processing data.","gloss":"Ingest only what is strictly necessary","failure_modes":["{{context}} Hoarding: {{agent}} retains sensitive data 'just in case' it is needed later.","{{correlation}} Attack: Seemingly innocent minimized data points combined to reveal PII."],"invariants":["Ephemeral Processing: Sensitive data used for intermediate steps must be dropped from {{context}} immediately after use.","Necessity: Every data field ingested must map to a specific requirement in `{{task}}.{{accept_spec}}`."],"preconditions":["Raw data source available","{{task}} goal defined"],"postconditions":["Clean context created","Raw source discarded or closed"],"_meta":{"tier":2,"layer":"Society","category":"Protocols","ring":0},"sema_id":"sema:DataMinimization#mh:SHA-256:75a362214bbb4741d91b611236eb8efa37c59bd469bf777be63942946a979316","sema_ref":"DataMinimization#75a3","sema_stub":"75a3","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"6086625c-c374-461b-8b51-9480361ddf87","text":"Ephemeral Processing: Sensitive data used for intermediate steps must be dropped from {{context}} immediately after use.","type":"INVARIANT","layer":null,"category":null,"handle":"Ephemeral Processing: Sensitive data used for intermediate steps must be dropped from {{context}} immediately after use.","gloss":null,"stub":null,"metadata":{}},{"id":"b27deec0-9d8b-44dd-9066-6b4965204b2a","text":"Necessity: Every data field ingested must map to a specific requirement in `{{task}}.{{accept_spec}}`.","type":"INVARIANT","layer":null,"category":null,"handle":"Necessity: Every data field ingested must map to a specific requirement in `{{task}}.{{accept_spec}}`.","gloss":null,"stub":null,"metadata":{}},{"id":"3ebafd73-3d1d-46ee-bbad-0809c4a1341e","text":"Raw data source available","type":"PRECONDITION","layer":null,"category":null,"handle":"Raw data source available","gloss":null,"stub":null,"metadata":{}},{"id":"9c15d6c0-e10e-4084-8394-63707c31a63e","text":"Clean context created","type":"POSTCONDITION","layer":null,"category":null,"handle":"Clean context created","gloss":null,"stub":null,"metadata":{}},{"id":"0b4d6f9d-1634-45af-8ea2-104e05c19725","text":"Raw source discarded or closed","type":"POSTCONDITION","layer":null,"category":null,"handle":"Raw source discarded or closed","gloss":null,"stub":null,"metadata":{}},{"id":"Validate","text":"Validate#3de2","type":"PATTERN","layer":"Infrastructure","category":"Verification","handle":"Validate#3de2","gloss":"Verifying inputs conform to expected schema","stub":"3de2","metadata":{"pattern":{"handle":"Validate","mechanism":"Syntactic Verification. Checks if a data artifact conforms to a predefined structure (Schema) or set of constraints. Rejects malformed inputs before processing. Utilizes {{accept_spec}}. Distinct from {{check}} (Logic Gate) and quality scoring (Judge).","gloss":"Verifying inputs conform to expected schema","failure_modes":["Validator Bypass: Attacker finds encoding that passes validation but exploits downstream parser."],"invariants":["Binary Result: Pass or Fail.","Side-Effect Free: Validation must not alter the payload."],"_meta":{"tier":1,"layer":"Infrastructure","category":"Verification","ring":1},"sema_id":"sema:Validate#mh:SHA-256:3de24fbfc5dade5aeabd857010aaeff7529bdab8c152f164897aa411d868c619","sema_ref":"Validate#3de2","sema_stub":"3de2","sema_layer":"Infrastructure","sema_category":"Verification"},"layer":"Infrastructure","category":"Verification"}},{"id":"c81f363c-ab2e-4d2a-8e50-f0bff28ab548","text":"Binary Result: Pass or Fail.","type":"INVARIANT","layer":null,"category":null,"handle":"Binary Result: Pass or Fail.","gloss":null,"stub":null,"metadata":{}},{"id":"2e75b97b-baad-465d-a0e2-dd1d5a55c7d9","text":"Side-Effect Free: Validation must not alter the payload.","type":"INVARIANT","layer":null,"category":null,"handle":"Side-Effect Free: Validation must not alter the payload.","gloss":null,"stub":null,"metadata":{}},{"id":"ManifestPlanning","text":"ManifestPlanning#8f61","type":"PATTERN","layer":"Society","category":"Protocols","handle":"ManifestPlanning#8f61","gloss":"Transform FrameSpec into ExecutionManifest via optimization","stub":"8f61","metadata":{"pattern":{"handle":"ManifestPlanning","derived_from":"sema:Plan","gloss":"Transform FrameSpec into ExecutionManifest via optimization","mechanism":"The architectural phase of workflow orchestration. It produces a structured {{plan}} by performing {{think}} to transform a {{frame_spec}} into a runnable {{execution_manifest}}. This process must {{optimize}} the step sequence for resource feasibility and generate a strict 'Definition of Done'.","signature":["Think(ExecutionManifest)"],"invariants":["Causality: Step B cannot precede Step A dependencies.","Resource Bound: Total cost must be within FrameSpec budget."],"failure_modes":["Hallucinated Resources: Planning to use tools that do not exist.","Fragile Chain: A single step failure collapses the entire plan."],"_meta":{"tier":2,"layer":"Society","category":"Protocols","ring":1},"sema_ref":"ManifestPlanning#8f61","sema_id":"sema:ManifestPlanning#mh:SHA-256:8f617b10de4644e96e729f2da39560243e42755808fee6369f9330a5f9c7f66d","sema_stub":"8f61","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"7aeef670-387c-45a4-818b-e7049e1ebd30","text":"Causality: Step B cannot precede Step A dependencies.","type":"INVARIANT","layer":null,"category":null,"handle":"Causality: Step B cannot precede Step A dependencies.","gloss":null,"stub":null,"metadata":{}},{"id":"5c4f462f-b187-4df1-8a12-435e6feffab4","text":"Resource Bound: Total cost must be within FrameSpec budget.","type":"INVARIANT","layer":null,"category":null,"handle":"Resource Bound: Total cost must be within FrameSpec budget.","gloss":null,"stub":null,"metadata":{}},{"id":"RequestFraming","text":"RequestFraming#0695","type":"PATTERN","layer":"Society","category":"Protocols","handle":"RequestFraming#0695","gloss":"Clarify intent and constraints before planning","stub":"0695","metadata":{"pattern":{"handle":"RequestFraming","derived_from":"sema:Interpret","gloss":"Clarify intent and constraints before planning","mechanism":"The initial state of workflow orchestration. It performs the act of {{interpret}} by accepting a {{message}} and using {{think}} to {{understand}} the 'real ask' within the given {{context}} before committing resources. It clarifies constraints, success criteria, and hidden assumptions, producing a {{frame_spec}} artifact. It acts as a semantic firewall against vague or dangerous instructions.","signature":["Think(FrameSpec)"],"invariants":["Output must be a rigorous FrameSpec","No resources committed to execution yet"],"preconditions":["Raw User Request","Context available"],"postconditions":["FrameSpec artifact created","Constraints explicit"],"failure_modes":["Misinterpretation: The agent clarifies the wrong ambiguity.","Over-constraint: Adding unnecessary restrictions that kill innovation.","Premature Optimization: Jumping to solutions before understanding the problem."],"_meta":{"tier":2,"layer":"Society","category":"Protocols","ring":1,"related":["Reframe","Decompose"]},"sema_ref":"RequestFraming#0695","sema_id":"sema:RequestFraming#mh:SHA-256:06954d95bc467b00eb0c969004db3174bff5dfc5c05733df2036605c835b6a5e","sema_stub":"0695","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"484e9b4f-e987-4c10-ba92-9e8df11d371f","text":"Output must be a rigorous FrameSpec","type":"INVARIANT","layer":null,"category":null,"handle":"Output must be a rigorous FrameSpec","gloss":null,"stub":null,"metadata":{}},{"id":"c53f8cbc-6294-4712-877c-139b473831b4","text":"No resources committed to execution yet","type":"INVARIANT","layer":null,"category":null,"handle":"No resources committed to execution yet","gloss":null,"stub":null,"metadata":{}},{"id":"b87426de-29b7-471a-9677-7e8958cdafb5","text":"Raw User Request","type":"PRECONDITION","layer":null,"category":null,"handle":"Raw User Request","gloss":null,"stub":null,"metadata":{}},{"id":"3b5e1ccd-c2ab-4c25-9bb2-a621b7735f7e","text":"FrameSpec artifact created","type":"POSTCONDITION","layer":null,"category":null,"handle":"FrameSpec artifact created","gloss":null,"stub":null,"metadata":{}},{"id":"301018ff-466a-417a-bacb-e8820aff984e","text":"Constraints explicit","type":"POSTCONDITION","layer":null,"category":null,"handle":"Constraints explicit","gloss":null,"stub":null,"metadata":{}},{"id":"Experiment","text":"Experiment#40e5","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"Experiment#40e5","gloss":"Structured causal discovery via variable isolation","stub":"40e5","metadata":{"pattern":{"handle":"Experiment","mechanism":"A structured {{protocol}} for causal discovery. Unlike {{verification}} (which confirms a claim), Experiment generates a {{solution}} (new knowledge) by isolating variables using a Control and Treatment group.","gloss":"Structured causal discovery via variable isolation","_meta":{"tier":1,"layer":"Mind","category":"Strategy","ring":2,"related":["HypothesisLadder#f88b"]},"sema_ref":"Experiment#40e5","sema_id":"sema:Experiment#mh:SHA-256:40e5e923ead8721b039cd6afa4e49c864a5022483e1c3ff58a12d57fe9a87499","sema_stub":"40e5","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"LeastToMost","text":"LeastToMost#2cce","type":"PATTERN","layer":"Mind","category":"Reasoning","handle":"LeastToMost#2cce","gloss":"Solve subproblems from easiest to hardest sequentially","stub":"2cce","metadata":{"pattern":{"handle":"LeastToMost","mechanism":"A prompting strategy that breaks a complex {{task}} 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}} to sort sub-tasks by complexity, solving them sequentially.","gloss":"Solve subproblems from easiest to hardest sequentially","failure_modes":["Subproblem Coupling: Later subproblems depend on earlier errors.","Ordering Misjudgment: Wrong difficulty ordering leads to missing prerequisites.","Overhead: Simple problems don't benefit from decomposition."],"invariants":["{{solution}} to P(i) enables P(i+1)","Subproblems solved in order of dependency"],"preconditions":["Complex problem","Decomposition strategy"],"postconditions":["Full solution built from simple parts"],"_meta":{"tier":1,"layer":"Mind","category":"Reasoning","related":["RecursionDive"],"ring":2},"sema_layer":"Mind","sema_category":"Reasoning","sema_id":"sema:LeastToMost#mh:SHA-256:2cceb392a547b5697483cfd568e27a712dd76542d57c8cdf091df96d68b04cbf","sema_ref":"LeastToMost#2cce","sema_stub":"2cce"},"layer":"Mind","category":"Reasoning"}},{"id":"9d8fc5ca-e12f-4684-8634-a3389a459e3d","text":"{{solution}} to P(i) enables P(i+1)","type":"INVARIANT","layer":null,"category":null,"handle":"{{solution}} to P(i) enables P(i+1)","gloss":null,"stub":null,"metadata":{}},{"id":"1e6cd086-9aa5-4ae2-852d-2723343d6cc6","text":"Subproblems solved in order of dependency","type":"INVARIANT","layer":null,"category":null,"handle":"Subproblems solved in order of dependency","gloss":null,"stub":null,"metadata":{}},{"id":"18139971-7a51-4702-b873-f1b62ee81fd1","text":"Complex problem","type":"PRECONDITION","layer":null,"category":null,"handle":"Complex problem","gloss":null,"stub":null,"metadata":{}},{"id":"505e6331-217c-46c9-bde1-a5b260db66ba","text":"Decomposition strategy","type":"PRECONDITION","layer":null,"category":null,"handle":"Decomposition strategy","gloss":null,"stub":null,"metadata":{}},{"id":"b1263b97-bbd8-4941-b733-11be9095b58d","text":"Full solution built from simple parts","type":"POSTCONDITION","layer":null,"category":null,"handle":"Full solution built from simple parts","gloss":null,"stub":null,"metadata":{}},{"id":"ScopeFreeze","text":"ScopeFreeze#54db","type":"PATTERN","layer":"Mind","category":"Inference","handle":"ScopeFreeze#54db","gloss":"Lock requirements to prevent scope creep","stub":"54db","metadata":{"pattern":{"handle":"ScopeFreeze","mechanism":"Phase {{transition}} Control. Defines a discrete point (T_freeze) after which the `{{accept_spec}}` and `Goal` of a {{task}} 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}} requirements, forcing the agent to {{satisfice}} within the remaining {{timebox_think}} rather than {{decompose}} further.","gloss":"Lock requirements to prevent scope creep","failure_modes":["Feature Creep: {{agent}} discovers 'nice to have' sub-tasks and attempts to execute them during the closing phase.","Perfectionism Spiral: Continuous refinement of the {{accept_spec}} prevents task completion."],"invariants":["Immutability: After freeze, {{task}}.{{accept_spec}} cannot be modified.","Rejection: New SubTasks created after freeze must serve EXISTING goals only (no new features)."],"preconditions":["Initial requirements defined","{{task}} is active"],"postconditions":["New requirements routed to Backlog","{{task}} marked as Frozen (Read-Only Requirements)"],"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"}],"_meta":{"tier":2,"layer":"Mind","category":"Inference","ring":0},"sema_id":"sema:ScopeFreeze#mh:SHA-256:54dbbaae7c24df4dade46112a2b9b2580e169bf3f005e668dc0bdc8cf13389aa","sema_ref":"ScopeFreeze#54db","sema_stub":"54db","sema_layer":"Mind","sema_category":"Inference"},"layer":"Mind","category":"Inference"}},{"id":"2f21ccf8-87cf-40d3-8934-71df748f8ae2","text":"Immutability: After freeze, {{task}}.{{accept_spec}} cannot be modified.","type":"INVARIANT","layer":null,"category":null,"handle":"Immutability: After freeze, {{task}}.{{accept_spec}} cannot be modified.","gloss":null,"stub":null,"metadata":{}},{"id":"14f042dc-bfc2-48c8-8df8-6d0bc2967826","text":"Rejection: New SubTasks created after freeze must serve EXISTING goals only (no new features).","type":"INVARIANT","layer":null,"category":null,"handle":"Rejection: New SubTasks created after freeze must serve EXISTING goals only (no new features).","gloss":null,"stub":null,"metadata":{}},{"id":"8efd48ea-a390-4386-92c4-240c04fbaee9","text":"Initial requirements defined","type":"PRECONDITION","layer":null,"category":null,"handle":"Initial requirements defined","gloss":null,"stub":null,"metadata":{}},{"id":"445cd040-b77f-4342-9132-5e38648a19da","text":"{{task}} is active","type":"PRECONDITION","layer":null,"category":null,"handle":"{{task}} is active","gloss":null,"stub":null,"metadata":{}},{"id":"2cb9f82b-3e2b-4a47-9497-9f142d85b9c1","text":"New requirements routed to Backlog","type":"POSTCONDITION","layer":null,"category":null,"handle":"New requirements routed to Backlog","gloss":null,"stub":null,"metadata":{}},{"id":"c6d36c42-cd43-4bef-91dd-b215e4b32d3b","text":"{{task}} marked as Frozen (Read-Only Requirements)","type":"POSTCONDITION","layer":null,"category":null,"handle":"{{task}} marked as Frozen (Read-Only Requirements)","gloss":null,"stub":null,"metadata":{}},{"id":"SkeletonOfThought","text":"SkeletonOfThought#f40a","type":"PATTERN","layer":"Mind","category":"Reasoning","handle":"SkeletonOfThought#f40a","gloss":"Parallel outline expansion (Macro for Think(Skeleton))","stub":"f40a","metadata":{"pattern":{"handle":"SkeletonOfThought","mechanism":"The canonical implementation of parallel reasoning. Instantiates the '{{think}}' primitive with a '{{skeleton}}' topology. Generates an outline first (using {{decompose}}), then expands all points in parallel to minimize latency. It implements the {{think}} primitive by first generating a structural {{skeleton}} and then triggering parallel expansion.","gloss":"Parallel outline expansion (Macro for Think(Skeleton))","invariants":["Structural Completeness: {{skeleton}} covers all required aspects; Point Independence: {{skeleton}} points can be expanded independently; Coherent Assembly: Final output reads as unified response"],"_meta":{"tier":2,"layer":"Mind","category":"Reasoning","ring":2},"sema_layer":"Mind","sema_category":"Reasoning","sema_id":"sema:SkeletonOfThought#mh:SHA-256:f40a8f04a44d5592db9400af2b43c18841d35dfb6a73d104983e0d6e91ba917e","sema_ref":"SkeletonOfThought#f40a","sema_stub":"f40a","signature":["Think(Skeleton)"]},"layer":"Mind","category":"Reasoning"}},{"id":"8910d13b-1b32-4cfc-9ff1-a908894dec29","text":"Structural Completeness: {{skeleton}} covers all required aspects; Point Independence: {{skeleton}} points can be expanded independently; Coherent Assembly: Final output reads as unified response","type":"INVARIANT","layer":null,"category":null,"handle":"Structural Completeness: {{skeleton}} covers all required aspects; Point Independence: {{skeleton}} points can be expanded independently; Coherent Assembly: Final output reads as unified response","gloss":null,"stub":null,"metadata":{}},{"id":"BoundaryProbe","text":"BoundaryProbe#3c6b","type":"PATTERN","layer":"Society","category":"Protocols","handle":"BoundaryProbe#3c6b","gloss":"Testing the edges of the specification","stub":"3c6b","metadata":{"pattern":{"handle":"BoundaryProbe","mechanism":"Edge Case Testing: Identify parameters of the {{system}}. For each parameter, test at: zero, one, maximum, negative, non-integer, null. {{observe}} which edge cases {{break}} assumptions. Boundary behavior often reveals core logic better than normal cases. In high-risk environments, it deploys a {{sacrificial_probe}} to test destructive boundaries without risking the primary {{agent}}.","gloss":"Testing the edges of the specification","failure_modes":["Interior {{assumption}}: Assuming that because Min and Max work, the Middle must work (missing non-linear failures)."],"invariants":["Edge Coverage: Probes must target Min, Max, and Null values."],"_meta":{"tier":2,"layer":"Society","category":"Protocols","related":["Probe"],"ring":0},"sema_id":"sema:BoundaryProbe#mh:SHA-256:3c6b17cc4d47431a63d2dc30d031fce17eed53ad91bee54e1388ce321ce2ca7e","sema_ref":"BoundaryProbe#3c6b","sema_stub":"3c6b","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"f1bd3021-bccd-4e83-a15f-af67a9982371","text":"Edge Coverage: Probes must target Min, Max, and Null values.","type":"INVARIANT","layer":null,"category":null,"handle":"Edge Coverage: Probes must target Min, Max, and Null values.","gloss":null,"stub":null,"metadata":{}},{"id":"Exaptation","text":"Exaptation#9941","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"Exaptation#9941","gloss":"Radical tool repurposing via analogical mapping","stub":"9941","metadata":{"pattern":{"handle":"Exaptation","mechanism":"The cognitive act of repurposing a {{tool_invoke}} for a function outside its original design parameters. When a specialized tool is unavailable, the {{agent}} searches for a tool with structural isomorphism to the {{problem}}. It uses {{analogy_bridge}} to map the problem inputs to the tool's expected format, and {{translate}} to interpret the output. Validation via {{sacrificial_probe}} is mandatory to ensure the misuse does not trigger catastrophic side effects.","gloss":"Radical tool repurposing via analogical mapping","invariants":["Safety Conservation: The repurposed tool must not violate the parent {{task}}'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}} until verified."],"failure_modes":["Leaky Analogy: The tool produces side effects in its native domain that were not mapped to the problem domain.","Type Hallucination: Forcing incompatible data types into a tool, causing silent corruption.","Over-Engineering: Using a complex tool (e.g., a Game Engine) for a simple task (e.g., sorting a list) due to a fascinating but inefficient analogy."],"preconditions":["Standard tool unavailable","Candidate tool with similar mechanics identified"],"postconditions":["Problem solved using non-standard means","New Usage Pattern logged"],"_meta":{"tier":2,"layer":"Mind","category":"Strategy","ring":1,"related":["LateralOptimization#f074","AnalogyBridge#a685","Jugaad"]},"sema_layer":"Mind","sema_category":"Strategy","sema_ref":"Exaptation#9941","sema_id":"sema:Exaptation#mh:SHA-256:9941cc1fcf3d50324d88c42af350a0a15f9787ca094091ca65ae005e540d5f4f","sema_stub":"9941"},"layer":"Mind","category":"Strategy"}},{"id":"925648f2-9643-45fd-bb4b-62e9fdce4f0d","text":"Safety Conservation: The repurposed tool must not violate the parent {{task}}'s safety constraints.","type":"INVARIANT","layer":null,"category":null,"handle":"Safety Conservation: The repurposed tool must not violate the parent {{task}}'s safety constraints.","gloss":null,"stub":null,"metadata":{}},{"id":"2f6389b0-dc5a-4591-b857-90d9b3947961","text":"Isomorphism: The mapping between Problem Domain and Tool Domain must be bijective for the relevant variables.","type":"INVARIANT","layer":null,"category":null,"handle":"Isomorphism: The mapping between Problem Domain and Tool Domain must be bijective for the relevant variables.","gloss":null,"stub":null,"metadata":{}},{"id":"f60118ab-e223-4cae-9a6a-989a1146f01a","text":"Containment: Exapted usage must occur within a {{sandbox}} until verified.","type":"INVARIANT","layer":null,"category":null,"handle":"Containment: Exapted usage must occur within a {{sandbox}} until verified.","gloss":null,"stub":null,"metadata":{}},{"id":"14f924a3-ded6-4c98-9c94-607796b00c86","text":"Standard tool unavailable","type":"PRECONDITION","layer":null,"category":null,"handle":"Standard tool unavailable","gloss":null,"stub":null,"metadata":{}},{"id":"a239fdaf-f475-43f4-889b-ed19f64dd60e","text":"Candidate tool with similar mechanics identified","type":"PRECONDITION","layer":null,"category":null,"handle":"Candidate tool with similar mechanics identified","gloss":null,"stub":null,"metadata":{}},{"id":"58a5c157-c1cb-462b-9495-5d54b65c7ab8","text":"Problem solved using non-standard means","type":"POSTCONDITION","layer":null,"category":null,"handle":"Problem solved using non-standard means","gloss":null,"stub":null,"metadata":{}},{"id":"e307ae2c-4d40-4fa1-a578-d55dbd57739a","text":"New Usage Pattern logged","type":"POSTCONDITION","layer":null,"category":null,"handle":"New Usage Pattern logged","gloss":null,"stub":null,"metadata":{}},{"id":"UncertaintyMap","text":"UncertaintyMap#e883","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"UncertaintyMap#e883","gloss":"Systematic categorization of ignorance","stub":"e883","metadata":{"pattern":{"handle":"UncertaintyMap","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}} high-impact uncertainties. Actively {{probe}} for Unknown-Unknowns. Utilizes {{prioritize}}, {{confidence_calibrate}}.","gloss":"Systematic categorization of ignorance","failure_modes":["False Precision: Treating a Known-Unknown (risk) as a Known-Known (fact) with a wide error bar."],"invariants":["Every factor must be categorized exactly once."],"_meta":{"tier":2,"layer":"Mind","category":"Strategy","ring":2},"sema_id":"sema:UncertaintyMap#mh:SHA-256:e883a452d9ec2e4bb7fcb99c34edc45d4584115f6cc128aa61100d84c1b14bc4","sema_ref":"UncertaintyMap#e883","sema_stub":"e883","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"b04e7589-7873-4c23-a39d-5a7b8947d09e","text":"Every factor must be categorized exactly once.","type":"INVARIANT","layer":null,"category":null,"handle":"Every factor must be categorized exactly once.","gloss":null,"stub":null,"metadata":{}},{"id":"DesignArchitect","text":"DesignArchitect#ebcd","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"DesignArchitect#ebcd","gloss":"Agent that architects mechanistic design proposals","stub":"ebcd","metadata":{"pattern":{"handle":"DesignArchitect","mechanism":"The strategic agent responsible for formulating a {{mechanistic_design_proposal}}. It uses the adversarial method to robustify the design: defending it via {{steelman_check}} and attacking it via {{pre_mortem}}. It integrates with {{strategy}} to project future impact and uses {{translate}} and {{summarize}} to refine the final output for clarity.","gloss":"Agent that architects mechanistic design proposals","invariants":["Dialectic Rigor: Must apply both Steelman and PreMortem to the design.","Output Quality: Must produce a valid MechanisticDesignProposal."],"_meta":{"tier":2,"layer":"Mind","category":"Strategy","ring":1},"sema_ref":"DesignArchitect#ebcd","sema_id":"sema:DesignArchitect#mh:SHA-256:ebcd0618bb75fbe48a7297de1c0a05c79d3580a11e171bdd6b7058145a224302","sema_stub":"ebcd","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"69220d59-c62b-4d5f-853d-aea3e16b8f30","text":"Dialectic Rigor: Must apply both Steelman and PreMortem to the design.","type":"INVARIANT","layer":null,"category":null,"handle":"Dialectic Rigor: Must apply both Steelman and PreMortem to the design.","gloss":null,"stub":null,"metadata":{}},{"id":"3bac30c0-9a20-4b43-a3e0-9353ddc9f66e","text":"Output Quality: Must produce a valid MechanisticDesignProposal.","type":"INVARIANT","layer":null,"category":null,"handle":"Output Quality: Must produce a valid MechanisticDesignProposal.","gloss":null,"stub":null,"metadata":{}},{"id":"ExperienceSharding","text":"ExperienceSharding#65cc","type":"PATTERN","layer":"Mind","category":"Memory","handle":"ExperienceSharding#65cc","gloss":"A single agent evolves into a colony of specialists preserving total history.","stub":"65cc","metadata":{"pattern":{"handle":"ExperienceSharding","mechanism":"Applies the {{shard}} 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 {{chunk_merge}} before distributing them across the agent cluster.","gloss":"A single agent evolves into a colony of specialists preserving total history.","failure_modes":["coordination overhead between the shards increases."],"invariants":["Recombination reconstructs global pattern","Shards cover disjoint parts of state/experience space"],"preconditions":["Large dataset or experience stream","Multiple learners"],"postconditions":["Distributed knowledge base"],"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"}],"_meta":{"tier":1,"layer":"Mind","category":"Memory","related":["FabricSharding"],"ring":0},"sema_id":"sema:ExperienceSharding#mh:SHA-256:65ccbf94035f6821c53097b6c5da6a9b6da01cddab844b8876f8b35d62e93f39","sema_ref":"ExperienceSharding#65cc","sema_stub":"65cc","sema_layer":"Mind","sema_category":"Memory"},"layer":"Mind","category":"Memory"}},{"id":"ba9decaa-e702-4245-8121-048989d23afc","text":"Recombination reconstructs global pattern","type":"INVARIANT","layer":null,"category":null,"handle":"Recombination reconstructs global pattern","gloss":null,"stub":null,"metadata":{}},{"id":"3874890e-362d-4eb6-99c1-2f4eb203d977","text":"Shards cover disjoint parts of state/experience space","type":"INVARIANT","layer":null,"category":null,"handle":"Shards cover disjoint parts of state/experience space","gloss":null,"stub":null,"metadata":{}},{"id":"b408e68a-d0e2-46a1-a59a-752f4ed371c2","text":"Large dataset or experience stream","type":"PRECONDITION","layer":null,"category":null,"handle":"Large dataset or experience stream","gloss":null,"stub":null,"metadata":{}},{"id":"8d1eb403-971f-459a-b1be-20c4c885c803","text":"Multiple learners","type":"PRECONDITION","layer":null,"category":null,"handle":"Multiple learners","gloss":null,"stub":null,"metadata":{}},{"id":"f2fddd9d-d357-43d7-9bde-d389689e1fd1","text":"Distributed knowledge base","type":"POSTCONDITION","layer":null,"category":null,"handle":"Distributed knowledge base","gloss":null,"stub":null,"metadata":{}},{"id":"RegimeSense","text":"RegimeSense#6e3a","type":"PATTERN","layer":"Mind","category":"Inference","handle":"RegimeSense#6e3a","gloss":"Detecting structural breaks in reality","stub":"6e3a","metadata":{"pattern":{"handle":"RegimeSense","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 {{drift_watch}}, triggering {{ontology_adapt}} or {{quorum}} if the error signal crosses the regime-change threshold.","gloss":"Detecting structural breaks in reality","failure_modes":["False Positives: {{noise}} spikes triggering unnecessary accommodations.","Lag: RSS is a trailing indicator, so regime shifts are detected after-the-fact.","Threshold Gaming: Setting threshold too high causes missed shifts; too low causes constant alerts."],"invariants":["Stability {{break}}: If RSS < Threshold for N consecutive observations, trigger OntologicalAccommodation","Window Integrity: RSS calculation uses fixed window size, not cherry-picked ranges"],"preconditions":["{{agent}} 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"],"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"}],"_meta":{"tier":1,"layer":"Mind","category":"Inference","ring":2},"sema_id":"sema:RegimeSense#mh:SHA-256:6e3a603adbd6eb16dd3d026b14525147a966b59db11ccbf58adc7c1e21817150","sema_ref":"RegimeSense#6e3a","sema_stub":"6e3a","sema_layer":"Mind","sema_category":"Inference"},"layer":"Mind","category":"Inference"}},{"id":"7043afd2-0fed-4b8f-afd0-90af65985fc5","text":"Stability {{break}}: If RSS < Threshold for N consecutive observations, trigger OntologicalAccommodation","type":"INVARIANT","layer":null,"category":null,"handle":"Stability {{break}}: If RSS < Threshold for N consecutive observations, trigger OntologicalAccommodation","gloss":null,"stub":null,"metadata":{}},{"id":"abe6af2e-dfe0-414e-a128-0bfc790790d7","text":"Window Integrity: RSS calculation uses fixed window size, not cherry-picked ranges","type":"INVARIANT","layer":null,"category":null,"handle":"Window Integrity: RSS calculation uses fixed window size, not cherry-picked ranges","gloss":null,"stub":null,"metadata":{}},{"id":"91a9f2eb-5a74-468b-b941-eb2ec903f6e5","text":"{{agent}} has a predictive model generating expectations","type":"PRECONDITION","layer":null,"category":null,"handle":"{{agent}} has a predictive model generating expectations","gloss":null,"stub":null,"metadata":{}},{"id":"7749814a-3444-425e-9147-d73cf1a60a8b","text":"Observations are timestamped and comparable to predictions","type":"PRECONDITION","layer":null,"category":null,"handle":"Observations are timestamped and comparable to predictions","gloss":null,"stub":null,"metadata":{}},{"id":"5c2ba1c3-d815-453a-bf1a-986f9ee37f7b","text":"Alert raised if regime break detected","type":"POSTCONDITION","layer":null,"category":null,"handle":"Alert raised if regime break detected","gloss":null,"stub":null,"metadata":{}},{"id":"43b5695c-4394-4ade-92c0-5dbe867268c6","text":"RSS score computed for current window","type":"POSTCONDITION","layer":null,"category":null,"handle":"RSS score computed for current window","gloss":null,"stub":null,"metadata":{}},{"id":"DAG","text":"DAG#5e07","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"DAG#5e07","gloss":"Directed acyclic dependency graph","stub":"5e07","metadata":{"pattern":{"handle":"DAG","data_schema":{"type":"object","required":["nodes","edges","root_id"],"properties":{"nodes":{"type":"array","description":"List of task nodes"},"edges":{"type":"array","description":"Dependency arrows (Task A -> Task B)"},"root_id":{"type":"string","description":"Entry point(s) for execution"}}},"mechanism":"A directed acyclic graph {{topology}} that allows branching ({{parallelize}}) and merging, but forbids cycles. It models complex dependency chains where tasks can run concurrently but must respect precedence.","gloss":"Directed acyclic dependency graph","_meta":{"layer":"Infrastructure","category":"Data Structures","ring":2,"tier":1},"invariants":["Acyclicity: No path exists from Node(A) to itself.","Directedness: Edges have a single direction."],"sema_layer":"Infrastructure","sema_category":"Data Structures","sema_id":"sema:DAG#mh:SHA-256:5e07cccaa9071223b76debbf27ffb748b0b49ce202dd10dd11db9d5823eb7b54","sema_ref":"DAG#5e07","sema_stub":"5e07"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"5b132ffa-d71c-4dff-8efb-3b5f90c469f8","text":"Acyclicity: No path exists from Node(A) to itself.","type":"INVARIANT","layer":null,"category":null,"handle":"Acyclicity: No path exists from Node(A) to itself.","gloss":null,"stub":null,"metadata":{}},{"id":"38f69bf9-15ce-4ba5-b559-cef42adbb136","text":"Directedness: Edges have a single direction.","type":"INVARIANT","layer":null,"category":null,"handle":"Directedness: Edges have a single direction.","gloss":null,"stub":null,"metadata":{}},{"id":"FabricSharding","text":"FabricSharding#5914","type":"PATTERN","layer":"Society","category":"Protocols","handle":"FabricSharding#5914","gloss":"Interlocking state threads","stub":"5914","metadata":{"pattern":{"handle":"FabricSharding","mechanism":"Applies {{shard}} across orthogonal dimensions (e.g., Spatial, Temporal, Semantic). Agents subscribe only to dimensions relevant to their function ('Slices'). It enables massive {{parallelize}} by decoupling {{state}} into orthogonal dimensions.","gloss":"Interlocking state threads","failure_modes":["Cross-thread coordination latency."],"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"}],"_meta":{"tier":2,"layer":"Society","category":"Protocols","ring":0},"sema_id":"sema:FabricSharding#mh:SHA-256:59148b0213b915c49e000a716c62af829a5f1c9bd192ae5bb6aaa788fd30aecd","sema_ref":"FabricSharding#5914","sema_stub":"5914","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"692f670a-6196-4d00-ab7b-45f320ffb2f5","text":"Domain must be orderable or partitionable.","type":"INVARIANT","layer":null,"category":null,"handle":"Domain must be orderable or partitionable.","gloss":null,"stub":null,"metadata":{}},{"id":"Dialectic","text":"Dialectic#3744","type":"PATTERN","layer":"Mind","category":"Reasoning","handle":"Dialectic#3744","gloss":"Internal Thesis-Antithesis-Synthesis loop","stub":"3744","metadata":{"pattern":{"handle":"Dialectic","mechanism":"Internal reasoning process where an agent pits a Thesis against an Antithesis to generate a {{synthesis}}. Unlike Socratic questioning (which queries the user), Dialectic queries a simulated Critic Persona within the agent's own context. It instantiates a {{perspective_ensemble}} where one voice acts as Thesis and another uses {{steelman_check}} to construct the Antithesis.","gloss":"Internal Thesis-Antithesis-Synthesis loop","failure_modes":["Infinite Regress: Thesis and Antithesis loop without converging.","Strawman Critic: The generated Antithesis is too weak to improve the Thesis."],"invariants":["{{synthesis}} Quality: {{synthesis}} must resolve at least one contradiction found in Antithesis."],"preconditions":["Initial Thesis generated"],"postconditions":["Refined {{synthesis}} generated"],"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)"}],"_meta":{"tier":2,"layer":"Mind","category":"Reasoning","ring":2},"sema_id":"sema:Dialectic#mh:SHA-256:374424dac92acbfc8bca803811b03d6192d334db59933318b4db14aaaaf39e55","sema_ref":"Dialectic#3744","sema_stub":"3744","sema_layer":"Mind","sema_category":"Reasoning"},"layer":"Mind","category":"Reasoning"}},{"id":"6da61bcb-8251-4433-86f3-90896a81671c","text":"{{synthesis}} Quality: {{synthesis}} must resolve at least one contradiction found in Antithesis.","type":"INVARIANT","layer":null,"category":null,"handle":"{{synthesis}} Quality: {{synthesis}} must resolve at least one contradiction found in Antithesis.","gloss":null,"stub":null,"metadata":{}},{"id":"74e014fb-28f8-44b0-a0dd-7244e983e250","text":"Initial Thesis generated","type":"PRECONDITION","layer":null,"category":null,"handle":"Initial Thesis generated","gloss":null,"stub":null,"metadata":{}},{"id":"da6d7e7e-5f52-432f-bf3d-7e4b9787c4d6","text":"Refined {{synthesis}} generated","type":"POSTCONDITION","layer":null,"category":null,"handle":"Refined {{synthesis}} generated","gloss":null,"stub":null,"metadata":{}},{"id":"PheromoneEconomy","text":"PheromoneEconomy#0a9c","type":"PATTERN","layer":"Society","category":"Economics","handle":"PheromoneEconomy#0a9c","gloss":"Value-driven coordination","stub":"0a9c","metadata":{"pattern":{"handle":"PheromoneEconomy","mechanism":"Macro for {{stigmergy}}({{value}}). 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}} to environmental signals via {{stigmergy}}, creating a {{ghost_trail}} that guides agents through a {{continuous_resource_auction}} of effort.","gloss":"Value-driven coordination","_meta":{"tier":2,"layer":"Society","category":"Economics","ring":1},"sema_id":"sema:PheromoneEconomy#mh:SHA-256:0a9cf79644f47bce5442d6962fec3f7db60a90dd80d6d95010d1c8cef052fa34","sema_ref":"PheromoneEconomy#0a9c","sema_stub":"0a9c","sema_layer":"Society","sema_category":"Economics","signature":["Stigmergy(Value)"]},"layer":"Society","category":"Economics"}},{"id":"RootHashGossip","text":"RootHashGossip#5f40","type":"PATTERN","layer":"Society","category":"Protocols","handle":"RootHashGossip#5f40","gloss":"Path-verified information spreading","stub":"5f40","metadata":{"pattern":{"handle":"RootHashGossip","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 {{ring_witness}} to cryptographically sign the path, ensuring traceability without revealing the identity of every node.","gloss":"Path-verified information spreading","failure_modes":["Path explosion (metadata overhead)."],"invariants":["{{loop}} Free: Path must not contain duplicate AgentIDs","Path Verify: Hash(Path + Msg) must match Signature"],"preconditions":["Msg has valid initial signature"],"postconditions":["Msg added to local store with Path appended"],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":1},"sema_id":"sema:RootHashGossip#mh:SHA-256:5f4030fac45e6910c5e88a6afe98d653c5c28d8999021be1783d698cc8154e08","sema_ref":"RootHashGossip#5f40","sema_stub":"5f40","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"28e042f9-423e-4e34-aba2-efb16f1114ac","text":"{{loop}} Free: Path must not contain duplicate AgentIDs","type":"INVARIANT","layer":null,"category":null,"handle":"{{loop}} Free: Path must not contain duplicate AgentIDs","gloss":null,"stub":null,"metadata":{}},{"id":"77f343ac-f911-4297-88eb-4b26dcdb36a1","text":"Path Verify: Hash(Path + Msg) must match Signature","type":"INVARIANT","layer":null,"category":null,"handle":"Path Verify: Hash(Path + Msg) must match Signature","gloss":null,"stub":null,"metadata":{}},{"id":"c829ba28-2866-4a4b-b114-70a9705bebaa","text":"Msg has valid initial signature","type":"PRECONDITION","layer":null,"category":null,"handle":"Msg has valid initial signature","gloss":null,"stub":null,"metadata":{}},{"id":"ac2caebe-7738-485c-9bea-e82ee42f671c","text":"Msg added to local store with Path appended","type":"POSTCONDITION","layer":null,"category":null,"handle":"Msg added to local store with Path appended","gloss":null,"stub":null,"metadata":{}},{"id":"Compensate","text":"Compensate#2f1d","type":"PATTERN","layer":"Physics","category":"Primitives","handle":"Compensate#2f1d","gloss":"Enable clean failure recovery through structured rollback, preventing orphaned resources and corrupted state","stub":"2f1d","metadata":{"pattern":{"handle":"Compensate","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}}, it reads the {{time_warp_log}} in reverse to execute the idempotent inverse of each prior action.","gloss":"Enable clean failure recovery through structured rollback, preventing orphaned resources and corrupted state","failure_modes":["Inverse wasn't logged (can't compensate what wasn't tracked).","Inverse isn't truly idempotent (retry corrupts state).","External state changed between action and compensation (assumption invalid).","Compensation creates new failure (cascading compensation).","Time-sensitive compensation (too late to undo, window passed).","Compensation log lost or corrupted.","Downstream agent doesn't confirm (blocks upstream compensation)."],"invariants":["Action is semantically opposite to failure","Compensation action value >= loss value"],"preconditions":["Compensation mechanism available","Detected failure/loss"],"postconditions":["{{system}} utility restored to baseline"],"_meta":{"tier":1,"layer":"Physics","category":"Primitives","ring":0,"related":["Retry"]},"sema_id":"sema:Compensate#mh:SHA-256:2f1d8b8a48bde0bf6a349e7646499abc99fa274b880a1606f7226859cac2f3cf","sema_ref":"Compensate#2f1d","sema_stub":"2f1d","sema_layer":"Physics","sema_category":"Primitives"},"layer":"Physics","category":"Primitives"}},{"id":"4dcec3d9-7d7f-48f1-9a5a-012fe5674e49","text":"Action is semantically opposite to failure","type":"INVARIANT","layer":null,"category":null,"handle":"Action is semantically opposite to failure","gloss":null,"stub":null,"metadata":{}},{"id":"83c90d6c-e9e1-4b63-9803-c07fba803c2c","text":"Compensation action value >= loss value","type":"INVARIANT","layer":null,"category":null,"handle":"Compensation action value >= loss value","gloss":null,"stub":null,"metadata":{}},{"id":"eeb3b6e3-4dfb-4f37-8f15-59d06662b6d3","text":"Compensation mechanism available","type":"PRECONDITION","layer":null,"category":null,"handle":"Compensation mechanism available","gloss":null,"stub":null,"metadata":{}},{"id":"898410fe-0fd0-4e8b-b3a4-43314a557078","text":"Detected failure/loss","type":"PRECONDITION","layer":null,"category":null,"handle":"Detected failure/loss","gloss":null,"stub":null,"metadata":{}},{"id":"d8a0e179-813e-40cc-960a-9d9a746bd9c7","text":"{{system}} utility restored to baseline","type":"POSTCONDITION","layer":null,"category":null,"handle":"{{system}} utility restored to baseline","gloss":null,"stub":null,"metadata":{}},{"id":"LazyConsensus","text":"LazyConsensus#7c9b","type":"PATTERN","layer":"Society","category":"Governance","handle":"LazyConsensus#7c9b","gloss":"Optimistic execution, retroactive verification","stub":"7c9b","metadata":{"pattern":{"handle":"LazyConsensus","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}}, executing immediately and using the {{time_warp_log}} to resolve conflicts retroactively.","gloss":"Optimistic execution, retroactive verification","failure_modes":["Cascading rollbacks."],"invariants":["Determinism: Conflict resolution function must be pure (same inputs -> same winner)","Rollback Safety: Reverting a transaction cannot corrupt unrelated state"],"_meta":{"tier":2,"layer":"Society","category":"Governance","ring":0},"sema_id":"sema:LazyConsensus#mh:SHA-256:7c9ba20fcd15185dad326a9b5c82c21b0c1577be3025578194e0912e1d504762","sema_ref":"LazyConsensus#7c9b","sema_stub":"7c9b","sema_layer":"Society","sema_category":"Governance"},"layer":"Society","category":"Governance"}},{"id":"4c529ee3-5aa9-4ae6-a284-0453bfcd4d47","text":"Determinism: Conflict resolution function must be pure (same inputs -> same winner)","type":"INVARIANT","layer":null,"category":null,"handle":"Determinism: Conflict resolution function must be pure (same inputs -> same winner)","gloss":null,"stub":null,"metadata":{}},{"id":"ea592d75-e3b6-46e4-a13e-c10bb9ddb594","text":"Rollback Safety: Reverting a transaction cannot corrupt unrelated state","type":"INVARIANT","layer":null,"category":null,"handle":"Rollback Safety: Reverting a transaction cannot corrupt unrelated state","gloss":null,"stub":null,"metadata":{}},{"id":"CostlySignal","text":"CostlySignal#7fe2","type":"PATTERN","layer":"Society","category":"Economics","handle":"CostlySignal#7fe2","gloss":"Burning value to prove intent","stub":"7fe2","metadata":{"pattern":{"handle":"CostlySignal","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}}. 'Talk is cheap; this {{signal}} was expensive.'. It serves as the currency-generating primitive within {{attention_markets}}.","gloss":"Burning value to prove intent","failure_modes":["Excludes resource-poor agents."],"invariants":["Burn Verification: Burn(Tx) must be visible on-chain","{{value}} Threshold: BurnAmount > MinThreshold({{context}})"],"preconditions":["{{agent}} has sufficient funds"],"postconditions":["Funds destroyed","{{message}} prioritized"],"parameters":[{"name":"burn_amount","type":"Value","range":"[>0]","description":"Must be non-trivial"},{"name":"token_type","type":"String","range":"unspecified","description":"Asset being burned"}],"_meta":{"tier":1,"layer":"Society","category":"Economics","ring":1},"sema_layer":"Society","sema_category":"Economics","sema_id":"sema:CostlySignal#mh:SHA-256:7fe2d815d2edd1dddec88a02544199266b0f4038fc4cb445781b948df677100e","sema_ref":"CostlySignal#7fe2","sema_stub":"7fe2"},"layer":"Society","category":"Economics"}},{"id":"289d679c-c245-4558-be9b-7f378faca46e","text":"Burn Verification: Burn(Tx) must be visible on-chain","type":"INVARIANT","layer":null,"category":null,"handle":"Burn Verification: Burn(Tx) must be visible on-chain","gloss":null,"stub":null,"metadata":{}},{"id":"c75ad307-f097-497c-a3cc-c5aae0f7583d","text":"{{value}} Threshold: BurnAmount > MinThreshold({{context}})","type":"INVARIANT","layer":null,"category":null,"handle":"{{value}} Threshold: BurnAmount > MinThreshold({{context}})","gloss":null,"stub":null,"metadata":{}},{"id":"47c25e7f-8574-49a8-94b4-485c75db48bb","text":"{{agent}} has sufficient funds","type":"PRECONDITION","layer":null,"category":null,"handle":"{{agent}} has sufficient funds","gloss":null,"stub":null,"metadata":{}},{"id":"ba9e2dbd-7440-48a5-a779-1d6e2d7aa197","text":"Funds destroyed","type":"POSTCONDITION","layer":null,"category":null,"handle":"Funds destroyed","gloss":null,"stub":null,"metadata":{}},{"id":"84bf1809-2839-4f58-8741-50665b913e6f","text":"{{message}} prioritized","type":"POSTCONDITION","layer":null,"category":null,"handle":"{{message}} prioritized","gloss":null,"stub":null,"metadata":{}},{"id":"ForkingProtocol","text":"ForkingProtocol#db98","type":"PATTERN","layer":"Society","category":"Governance","handle":"ForkingProtocol#db98","gloss":"Unilateral exit rights to prevent capture","stub":"db98","metadata":{"pattern":{"handle":"ForkingProtocol","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: {{state_snapshot}} 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}} onto a new state history without consensus.","gloss":"Unilateral exit rights to prevent capture","failure_modes":["Fragmentation Death: Ecosystem splits into shards too small to sustain network effects."],"invariants":["Branches execute independently","Parent state preserved"],"preconditions":["Disagreement or exploration need","Replicable state"],"postconditions":["Two distinct state futures active"],"_meta":{"tier":1,"layer":"Society","category":"Governance","ring":1},"sema_id":"sema:ForkingProtocol#mh:SHA-256:db98203c88a24ba1344f98f008bfc487093bbfe41e84190e70fc00992118add0","sema_ref":"ForkingProtocol#db98","sema_stub":"db98","sema_layer":"Society","sema_category":"Governance"},"layer":"Society","category":"Governance"}},{"id":"6ef9aac9-7c5c-4c6e-85b2-ff68043fabb8","text":"Branches execute independently","type":"INVARIANT","layer":null,"category":null,"handle":"Branches execute independently","gloss":null,"stub":null,"metadata":{}},{"id":"7459b2ff-a081-46ee-8a12-7559a935a688","text":"Parent state preserved","type":"INVARIANT","layer":null,"category":null,"handle":"Parent state preserved","gloss":null,"stub":null,"metadata":{}},{"id":"a4cc7a24-7204-4b1f-95ea-b27adb7b6952","text":"Disagreement or exploration need","type":"PRECONDITION","layer":null,"category":null,"handle":"Disagreement or exploration need","gloss":null,"stub":null,"metadata":{}},{"id":"5351a302-9f22-4e1f-bd8b-9e6ee6668f57","text":"Replicable state","type":"PRECONDITION","layer":null,"category":null,"handle":"Replicable state","gloss":null,"stub":null,"metadata":{}},{"id":"67996ea0-7eab-4c3b-9aca-5711ad26aa59","text":"Two distinct state futures active","type":"POSTCONDITION","layer":null,"category":null,"handle":"Two distinct state futures active","gloss":null,"stub":null,"metadata":{}},{"id":"Oracle","text":"Oracle#45e5","type":"PATTERN","layer":"Society","category":"Protocols","handle":"Oracle#45e5","gloss":"Cryptographic truth source","stub":"45e5","metadata":{"pattern":{"handle":"Oracle","mechanism":"A trusted entity that injects off-chain truth (Reality) into the system by cryptographically signing data. It resolves conditions in {{held_release}} and verifies outcomes for prediction markets.","gloss":"Cryptographic truth source","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."],"sema_id":"sema:Oracle#mh:SHA-256:45e5ab8c062bb4acc74eb83dedc96772014b28cc2203519199fbac0dd1f944e4","sema_ref":"Oracle#45e5","sema_stub":"45e5","_meta":{"layer":"Society","category":"Protocols","ring":1,"tier":1},"sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"c5ac7475-cac4-4437-858b-d0ceca69aaee","text":"Non-Interference: The Oracle reports on reality but does not alter it.","type":"INVARIANT","layer":null,"category":null,"handle":"Non-Interference: The Oracle reports on reality but does not alter it.","gloss":null,"stub":null,"metadata":{}},{"id":"fcb01466-d32c-4893-af54-a7bccfa44580","text":"Consistency: Answers to the same query at the same time must be identical.","type":"INVARIANT","layer":null,"category":null,"handle":"Consistency: Answers to the same query at the same time must be identical.","gloss":null,"stub":null,"metadata":{}},{"id":"AbductiveLeap","text":"AbductiveLeap#1069","type":"PATTERN","layer":"Mind","category":"Reasoning","handle":"AbductiveLeap#1069","gloss":"Inference to the best explanation","stub":"1069","metadata":{"pattern":{"handle":"AbductiveLeap","mechanism":"Inference to Best Explanation: Given surprising observation, generate candidate explanations. {{rank}} by simplicity, scope, and coherence with existing knowledge. Adopt highest-ranked as working hypothesis. Flag as provisional, not proven. It employs {{chain_of_thought}} to trace the reasoning path from observation to explanation, ensuring the logical leap is explicit and verifiable.","gloss":"Inference to the best explanation","failure_modes":["Conspiracy Thinking: Preferring complex, coherent explanations over simple, messy ones (overfitting the narrative)."],"invariants":["Explanation must cover all observed anomalies","Simplicity heuristic (Occam's Razor) applied"],"preconditions":["No deductive path to explanation","Set of observations"],"postconditions":["{{hypothesis}} generated","{{hypothesis}} ranked by likelihood"],"_meta":{"tier":1,"layer":"Mind","category":"Reasoning","related":["sema:HypothesisLadder#mh:SHA-256:476819744eb5c404da8d783327c0bc1c4fa68cded30da839746ca14638eafccb"],"ring":2},"sema_id":"sema:AbductiveLeap#mh:SHA-256:1069501989760c74143a80a2a2ee3267463e206d8998c76d38399c2498e8791d","sema_ref":"AbductiveLeap#1069","sema_stub":"1069","sema_layer":"Mind","sema_category":"Reasoning"},"layer":"Mind","category":"Reasoning"}},{"id":"c6b2d365-3b80-4f22-87bb-e02a8a46e774","text":"Explanation must cover all observed anomalies","type":"INVARIANT","layer":null,"category":null,"handle":"Explanation must cover all observed anomalies","gloss":null,"stub":null,"metadata":{}},{"id":"24495a30-cdc4-4e2a-80da-1cd5df0aaa93","text":"Simplicity heuristic (Occam's Razor) applied","type":"INVARIANT","layer":null,"category":null,"handle":"Simplicity heuristic (Occam's Razor) applied","gloss":null,"stub":null,"metadata":{}},{"id":"f4ef3f52-c8b5-43fc-a292-cef8a0f32c0b","text":"No deductive path to explanation","type":"PRECONDITION","layer":null,"category":null,"handle":"No deductive path to explanation","gloss":null,"stub":null,"metadata":{}},{"id":"808ebefe-65c4-4c17-8623-76182ddbf58c","text":"Set of observations","type":"PRECONDITION","layer":null,"category":null,"handle":"Set of observations","gloss":null,"stub":null,"metadata":{}},{"id":"2e8d892f-3488-432e-92ac-2b5ce9bc6141","text":"{{hypothesis}} generated","type":"POSTCONDITION","layer":null,"category":null,"handle":"{{hypothesis}} generated","gloss":null,"stub":null,"metadata":{}},{"id":"b7db7e31-d54b-47e6-91e1-bba9041b53f2","text":"{{hypothesis}} ranked by likelihood","type":"POSTCONDITION","layer":null,"category":null,"handle":"{{hypothesis}} ranked by likelihood","gloss":null,"stub":null,"metadata":{}},{"id":"BackwardChain","text":"BackwardChain#0484","type":"PATTERN","layer":"Mind","category":"Reasoning","handle":"BackwardChain#0484","gloss":"Goal-driven reasoning from target to preconditions","stub":"0484","metadata":{"pattern":{"handle":"BackwardChain","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 {{chain_of_thought}} in reverse chronological order, linking the desired future state to present preconditions.","gloss":"Goal-driven reasoning from target to preconditions","failure_modes":["Infinite Regression: The precondition chain never terminates because base facts are missing."],"invariants":["Causal Sufficiency: Step(T) must be sufficient condition for Step(T+1)","Goal Anchoring: {{chain}} must start at DesiredEndState","Leaf nodes must be actionable or known-true."],"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}} steps in executable order. All prerequisites satisfied."],"_meta":{"tier":1,"layer":"Mind","category":"Reasoning","ring":2},"sema_id":"sema:BackwardChain#mh:SHA-256:04841f7ca3e84925caa3e0480d39467e3707e7fdf8eefe3650177c25fbd4c43b","sema_ref":"BackwardChain#0484","sema_stub":"0484","sema_layer":"Mind","sema_category":"Reasoning"},"layer":"Mind","category":"Reasoning"}},{"id":"63e4cd06-b8f8-4763-a2d3-017c180ecc27","text":"Causal Sufficiency: Step(T) must be sufficient condition for Step(T+1)","type":"INVARIANT","layer":null,"category":null,"handle":"Causal Sufficiency: Step(T) must be sufficient condition for Step(T+1)","gloss":null,"stub":null,"metadata":{}},{"id":"65ed6168-5bd8-403b-b7d5-c72c97e1bae2","text":"Goal Anchoring: {{chain}} must start at DesiredEndState","type":"INVARIANT","layer":null,"category":null,"handle":"Goal Anchoring: {{chain}} must start at DesiredEndState","gloss":null,"stub":null,"metadata":{}},{"id":"4867d564-aab1-412c-94ee-e21fa3f1f610","text":"Leaf nodes must be actionable or known-true.","type":"INVARIANT","layer":null,"category":null,"handle":"Leaf nodes must be actionable or known-true.","gloss":null,"stub":null,"metadata":{}},{"id":"4042a236-af24-42ce-84a3-48166595460d","text":"Goal state clearly defined. Domain has prerequisite structure. Knowledge base queryable.","type":"PRECONDITION","layer":null,"category":null,"handle":"Goal state clearly defined. Domain has prerequisite structure. Knowledge base queryable.","gloss":null,"stub":null,"metadata":{}},{"id":"f077c2d7-fc1f-42c8-b141-653c887d8745","text":"Execution plan produced OR goal proven unachievable. {{plan}} steps in executable order. All prerequisites satisfied.","type":"POSTCONDITION","layer":null,"category":null,"handle":"Execution plan produced OR goal proven unachievable. {{plan}} steps in executable order. All prerequisites satisfied.","gloss":null,"stub":null,"metadata":{}},{"id":"FirstPrinciples","text":"FirstPrinciples#c379","type":"PATTERN","layer":"Mind","category":"Reasoning","handle":"FirstPrinciples#c379","gloss":"Axiomatic reconstruction of truth","stub":"c379","metadata":{"pattern":{"handle":"FirstPrinciples","mechanism":"Axiomatic Reconstruction: Strip away {{assumption}}s until reaching fundamental truths that cannot be deduced from anything else. Rebuild solution from these {{axiom}}s only. Reject inherited solutions; derive from scratch. It rebuilds the argument from bedrock using {{chain_of_thought}}, explicitly rejecting any cached or inherited {{assumption}}s.","gloss":"Axiomatic reconstruction of truth","failure_modes":["Infinite Regress: Wasting resources proving 1+1=2 instead of solving the actual logistics problem."],"invariants":["Axioms cannot be derived from other statements."],"_meta":{"tier":2,"layer":"Mind","category":"Reasoning","ring":2},"sema_id":"sema:FirstPrinciples#mh:SHA-256:c379f7e5629befb5ccbee33b6fccbc3c4f5ec181b2704c4f82064d5cdc810f61","sema_ref":"FirstPrinciples#c379","sema_stub":"c379","sema_layer":"Mind","sema_category":"Reasoning"},"layer":"Mind","category":"Reasoning"}},{"id":"c0bef6a2-5dc4-495f-9341-20979f7e49ac","text":"Axioms cannot be derived from other statements.","type":"INVARIANT","layer":null,"category":null,"handle":"Axioms cannot be derived from other statements.","gloss":null,"stub":null,"metadata":{}},{"id":"HeuristicSnap","text":"HeuristicSnap#cece","type":"PATTERN","layer":"Mind","category":"Reasoning","handle":"HeuristicSnap#cece","gloss":"Rapid, low-cost decision making via pattern recognition","stub":"cece","metadata":{"pattern":{"handle":"HeuristicSnap","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 {{chain_of_thought}} when {{budget}} is low, relying on cached pattern matches.","gloss":"Rapid, low-cost decision making via pattern recognition","invariants":["Confidence Floor: Do not snap if similarity < 0.6","Speed over Accuracy: Latency must be < Threshold"],"preconditions":["{{problem}} is familiar (exists in cache)"],"postconditions":["{{decision}} made instantly"],"_meta":{"tier":1,"layer":"Mind","category":"Reasoning","related":["ThinSlice"],"ring":2},"sema_id":"sema:HeuristicSnap#mh:SHA-256:cece62377b8243be6d0ec0c4722f30e61aac251b2f9f3ee5cd30b06456ff2329","sema_ref":"HeuristicSnap#cece","sema_stub":"cece","sema_layer":"Mind","sema_category":"Reasoning"},"layer":"Mind","category":"Reasoning"}},{"id":"6e064b4a-ddc4-420a-9a7e-91c99c5c7a83","text":"Confidence Floor: Do not snap if similarity < 0.6","type":"INVARIANT","layer":null,"category":null,"handle":"Confidence Floor: Do not snap if similarity < 0.6","gloss":null,"stub":null,"metadata":{}},{"id":"e50c7df8-5e41-4d7e-9010-659248543f6a","text":"Speed over Accuracy: Latency must be < Threshold","type":"INVARIANT","layer":null,"category":null,"handle":"Speed over Accuracy: Latency must be < Threshold","gloss":null,"stub":null,"metadata":{}},{"id":"afcbfbaa-77f6-4a48-884d-8b523fcd058b","text":"{{problem}} is familiar (exists in cache)","type":"PRECONDITION","layer":null,"category":null,"handle":"{{problem}} is familiar (exists in cache)","gloss":null,"stub":null,"metadata":{}},{"id":"55dd7ffb-cd66-4664-ba92-3c917c3361f3","text":"{{decision}} made instantly","type":"POSTCONDITION","layer":null,"category":null,"handle":"{{decision}} made instantly","gloss":null,"stub":null,"metadata":{}},{"id":"RetrievalAugment","text":"RetrievalAugment#ea60","type":"PATTERN","layer":"Mind","category":"Memory","handle":"RetrievalAugment#ea60","gloss":"Ground responses in retrieved external knowledge","stub":"ea60","metadata":{"pattern":{"handle":"RetrievalAugment","mechanism":"Before generating a response, the {{agent}} queries an external knowledge store (vector database, search index, knowledge graph) to retrieve relevant {{context}}. Retrieved documents are injected into the {{prompt}}, grounding the response in external facts rather than relying solely on parametric memory. The canonical RAG (Retrieval-Augmented Generation) pattern. It injects external {{context}} into the {{chain_of_thought}}, grounding the reasoning process in retrieved facts.","gloss":"Ground responses in retrieved external knowledge","failure_modes":["Retrieval Poisoning: Malicious or incorrect documents in the index contaminate responses.","{{context}} Stuffing: Too many retrieved chunks exceed {{context}} window, causing truncation of critical information."],"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"],"_meta":{"tier":2,"layer":"Mind","category":"Memory","related":["sema:DeepResearch#mh:SHA-256:cd1dc8b74fb7377b4a9754e9c3b3cadc6f718810472a63ecbae30a09aeeb8797"],"ring":2},"sema_id":"sema:RetrievalAugment#mh:SHA-256:ea6079da92c1a8981d31d0d47881ce85b9dad4d44273cfa93583b5096da74692","sema_ref":"RetrievalAugment#ea60","sema_stub":"ea60","sema_layer":"Mind","sema_category":"Memory"},"layer":"Mind","category":"Memory"}},{"id":"3dfcd548-5509-4f37-8ed5-945f04219440","text":"Citation: Retrieved sources should be traceable in the output","type":"INVARIANT","layer":null,"category":null,"handle":"Citation: Retrieved sources should be traceable in the output","gloss":null,"stub":null,"metadata":{}},{"id":"72474808-b9d5-4890-a683-392b9e81eaf0","text":"Query Before Generate: Retrieval must precede response generation","type":"INVARIANT","layer":null,"category":null,"handle":"Query Before Generate: Retrieval must precede response generation","gloss":null,"stub":null,"metadata":{}},{"id":"b010d8ec-bd54-442e-bb6b-2a55a4a5d437","text":"Relevance Threshold: Only documents above similarity threshold are included","type":"INVARIANT","layer":null,"category":null,"handle":"Relevance Threshold: Only documents above similarity threshold are included","gloss":null,"stub":null,"metadata":{}},{"id":"TreeOfThoughts","text":"TreeOfThoughts#581a","type":"PATTERN","layer":"Mind","category":"Reasoning","handle":"TreeOfThoughts#581a","gloss":"Branching exploration (Macro for Think(Tree))","stub":"581a","metadata":{"pattern":{"handle":"TreeOfThoughts","mechanism":"The canonical implementation of branching reasoning. Instantiates the '{{think}}' primitive with a branching '{{tree}}' topology. Enables exploration of multiple reasoning paths with backtracking or pruning. Utilizes {{tree}}, {{chain_of_thought}}, {{think}}.","gloss":"Branching exploration (Macro for Think(Tree))","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"}],"_meta":{"tier":2,"layer":"Mind","category":"Reasoning","related":["sema:RecursionDive#mh:SHA-256:21c78ad8cc5e658fd19356cec9b998d9af1b02c54eaa96ce2d2f0ec4d8a75639"],"ring":2},"sema_id":"sema:TreeOfThoughts#mh:SHA-256:581a1251e9eb48d2d2d5871c6c94ea26094c4ec99c2aea33ab22d30d0a351ded","sema_ref":"TreeOfThoughts#581a","sema_stub":"581a","sema_layer":"Mind","sema_category":"Reasoning","signature":["Think(Tree)"]},"layer":"Mind","category":"Reasoning"}},{"id":"LivedProof","text":"LivedProof#82a6","type":"PATTERN","layer":"Society","category":"Economics","handle":"LivedProof#82a6","gloss":"Process demonstrates thesis","stub":"82a6","metadata":{"pattern":{"handle":"LivedProof","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 {{dogfood_first}}, treating the execution process as a {{signal}} of validity.","gloss":"Process demonstrates thesis","failure_modes":["Performative Contradiction: The process contradicts the thesis (e.g., writing a 50-page essay on 'Brevity').","Staged Demo: The process looks like enactment but is actually a pre-canned script (loss of genuineness)."],"invariants":["{{identity}}: Process == Evidence.","Real-Time: The demonstration must occur during the current execution context, not historically.","Traceability: Output artifacts must cryptographically reference their generation trace."],"preconditions":["{{agent}} has capability to execute the process","Thesis allows for enactment"],"postconditions":["Epistemic Confidence set to MAX","Performative Consistency verified"],"_meta":{"tier":2,"layer":"Society","category":"Economics","ring":2},"sema_id":"sema:LivedProof#mh:SHA-256:82a6b57e99850fa92c5b9588e99fdbf758920d748012c2e1b51932aaf6482d89","sema_ref":"LivedProof#82a6","sema_stub":"82a6","sema_layer":"Society","sema_category":"Economics"},"layer":"Society","category":"Economics"}},{"id":"56962037-24f8-46b6-9da1-60ec0386b385","text":"{{identity}}: Process == Evidence.","type":"INVARIANT","layer":null,"category":null,"handle":"{{identity}}: Process == Evidence.","gloss":null,"stub":null,"metadata":{}},{"id":"d22742bb-25e8-43cb-b2e1-e589a42a738f","text":"Real-Time: The demonstration must occur during the current execution context, not historically.","type":"INVARIANT","layer":null,"category":null,"handle":"Real-Time: The demonstration must occur during the current execution context, not historically.","gloss":null,"stub":null,"metadata":{}},{"id":"924f7214-710b-46ec-bb46-ef284aefc560","text":"Traceability: Output artifacts must cryptographically reference their generation trace.","type":"INVARIANT","layer":null,"category":null,"handle":"Traceability: Output artifacts must cryptographically reference their generation trace.","gloss":null,"stub":null,"metadata":{}},{"id":"1f62fd01-1500-4b03-a032-1bf7e76ecb99","text":"{{agent}} has capability to execute the process","type":"PRECONDITION","layer":null,"category":null,"handle":"{{agent}} has capability to execute the process","gloss":null,"stub":null,"metadata":{}},{"id":"7c61f411-9ac4-4f34-98f2-c75895a459ce","text":"Thesis allows for enactment","type":"PRECONDITION","layer":null,"category":null,"handle":"Thesis allows for enactment","gloss":null,"stub":null,"metadata":{}},{"id":"7f731cd6-5bbd-4f00-937e-e5cc197763bf","text":"Epistemic Confidence set to MAX","type":"POSTCONDITION","layer":null,"category":null,"handle":"Epistemic Confidence set to MAX","gloss":null,"stub":null,"metadata":{}},{"id":"e05919ce-79bb-4f72-b8e0-c50dcdbec027","text":"Performative Consistency verified","type":"POSTCONDITION","layer":null,"category":null,"handle":"Performative Consistency verified","gloss":null,"stub":null,"metadata":{}},{"id":"EvaluatorOptimizer","text":"EvaluatorOptimizer#7ec6","type":"PATTERN","layer":"Society","category":"Protocols","handle":"EvaluatorOptimizer#7ec6","gloss":"Generate-evaluate-refine loop","stub":"7ec6","metadata":{"pattern":{"handle":"EvaluatorOptimizer","mechanism":"A two-role {{loop}} to {{optimize}} 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}} continues until the Evaluator approves or max iterations reached. The Evaluator can be the same model with a different {{context}}, or a separate model. It invokes a {{meta_check}} to ensure the scoring {{criteria}} remain consistent across optimization cycles.","gloss":"Generate-evaluate-refine loop","failure_modes":["Evaluation Drift: Evaluator criteria shift across iterations.","Cosmetic Changes: Generator makes superficial edits that don't address feedback.","Evaluator Capture: Generator learns to game the evaluator's criteria."],"invariants":["Feedback loop converges","Optimizer improves score on Evaluator metric"],"preconditions":["Initial solution","Modification operator","Scoring function"],"postconditions":["High-quality solution found"],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":2},"sema_id":"sema:EvaluatorOptimizer#mh:SHA-256:7ec6beac2574ee29a4e1ae88bf8420bd8c030a22867de7916800004a299b33c2","sema_ref":"EvaluatorOptimizer#7ec6","sema_stub":"7ec6","sema_layer":"Society","sema_category":"Protocols","signature":["Optimize(Loop)"]},"layer":"Society","category":"Protocols"}},{"id":"18fddb72-c52b-4ffb-b31b-38b9103f0883","text":"Feedback loop converges","type":"INVARIANT","layer":null,"category":null,"handle":"Feedback loop converges","gloss":null,"stub":null,"metadata":{}},{"id":"62b56b6a-9cce-4397-bbcf-60ed4a62fdc3","text":"Optimizer improves score on Evaluator metric","type":"INVARIANT","layer":null,"category":null,"handle":"Optimizer improves score on Evaluator metric","gloss":null,"stub":null,"metadata":{}},{"id":"fc5af884-129a-4a6b-a5a3-f6b74d33fb32","text":"Initial solution","type":"PRECONDITION","layer":null,"category":null,"handle":"Initial solution","gloss":null,"stub":null,"metadata":{}},{"id":"fb9086b9-65eb-4f00-8b12-250b239015ae","text":"Modification operator","type":"PRECONDITION","layer":null,"category":null,"handle":"Modification operator","gloss":null,"stub":null,"metadata":{}},{"id":"a995af3f-4937-4a1d-8083-2517d5b54f6d","text":"Scoring function","type":"PRECONDITION","layer":null,"category":null,"handle":"Scoring function","gloss":null,"stub":null,"metadata":{}},{"id":"324bdc0c-3e0b-4cb3-b9e6-8eac8e661157","text":"High-quality solution found","type":"POSTCONDITION","layer":null,"category":null,"handle":"High-quality solution found","gloss":null,"stub":null,"metadata":{}},{"id":"EmpiricalTest","text":"EmpiricalTest#8f92","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"EmpiricalTest#8f92","gloss":"Verifying conclusions via testable predictions","stub":"8f92","metadata":{"pattern":{"handle":"EmpiricalTest","mechanism":"Identifies testable predictions from a conclusion and executes experiments (or lookups) to verify them. Increases epistemic confidence via {{falsification}} attempts. (Formerly confused with {{validate}}).","gloss":"Verifying conclusions via testable predictions","preconditions":["Conclusion to test","Test mechanism available"],"postconditions":["Confidence updated based on test results"],"_meta":{"tier":1,"layer":"Mind","category":"Strategy","ring":1},"sema_id":"sema:EmpiricalTest#mh:SHA-256:8f92bb36b1520f702ecd4b4e9313c31dbaa7e3933a4a6c9b4690e3de25e32e28","sema_ref":"EmpiricalTest#8f92","sema_stub":"8f92","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"39b1e0c1-2086-4a4e-a51d-c60d2d0028e7","text":"Conclusion to test","type":"PRECONDITION","layer":null,"category":null,"handle":"Conclusion to test","gloss":null,"stub":null,"metadata":{}},{"id":"28f81dc9-f413-443e-a896-79cbcca1f202","text":"Test mechanism available","type":"PRECONDITION","layer":null,"category":null,"handle":"Test mechanism available","gloss":null,"stub":null,"metadata":{}},{"id":"08ab6f5d-90e4-460d-859b-e9068e425840","text":"Confidence updated based on test results","type":"POSTCONDITION","layer":null,"category":null,"handle":"Confidence updated based on test results","gloss":null,"stub":null,"metadata":{}},{"id":"HypothesisEngine","text":"HypothesisEngine#dec9","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"HypothesisEngine#dec9","gloss":"Automated scientific method","stub":"dec9","metadata":{"pattern":{"handle":"HypothesisEngine","mechanism":"The Scientific Method as a cognitive cycle. 1. {{discover}}({{hypothesis}}): Generate a candidate {{hypothesis}} (Explanation). 2. {{trace}}({{simulation}}): Simulate implications and log the lineage. 3. {{check}}(Consistency): {{validate}} against invariants. 4. {{stigmergy}}(Result): Publish the findings to the shared context. It cycles through {{discover}}, {{trace}}, and {{check}} to formalize the scientific loop, publishing validated models via {{stigmergy}}.","gloss":"Automated scientific method","_meta":{"tier":3,"layer":"Mind","category":"Strategy","ring":2},"sema_layer":"Mind","sema_category":"Strategy","sema_id":"sema:HypothesisEngine#mh:SHA-256:dec9b5fd325c2c8649b3447c1e927559b952451b1cea7a7429dd8f4b62366731","sema_ref":"HypothesisEngine#dec9","sema_stub":"dec9"},"layer":"Mind","category":"Strategy"}},{"id":"InternalConsistency","text":"InternalConsistency#862f","type":"PATTERN","layer":"Society","category":"Protocols","handle":"InternalConsistency#862f","gloss":"Checking for self-contradiction","stub":"862f","metadata":{"pattern":{"handle":"InternalConsistency","mechanism":"A {{check}} that validates whether the components of an {{artifact}} adhere to the Principle of Non-Contradiction. It ensures that no two propositions within the {{context}} conflict with each other. Distinct from external {{validate}} (checking against a schema) or fact-checking (checking against reality).","gloss":"Checking for self-contradiction","signature":["Check(Context)"],"invariants":["Non-Contradiction: No two propositions within the context can logically negate each other.","Completeness: All reachable nodes in the artifact are visited."],"_meta":{"layer":"Society","category":"Protocols","ring":2,"tier":2},"sema_ref":"InternalConsistency#862f","sema_id":"sema:InternalConsistency#mh:SHA-256:862f24b8dcbc229acfc3d2ced93ceec3b6abf982a0de4cd63b4960c077c1c7e7","sema_stub":"862f","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"94b9e9b9-80c3-4215-84b0-c1d92997195c","text":"Non-Contradiction: No two propositions within the context can logically negate each other.","type":"INVARIANT","layer":null,"category":null,"handle":"Non-Contradiction: No two propositions within the context can logically negate each other.","gloss":null,"stub":null,"metadata":{}},{"id":"8ddae946-59ea-42e0-bbfc-a30e7b68c505","text":"Completeness: All reachable nodes in the artifact are visited.","type":"INVARIANT","layer":null,"category":null,"handle":"Completeness: All reachable nodes in the artifact are visited.","gloss":null,"stub":null,"metadata":{}},{"id":"Judge","text":"Judge#b8ba","type":"PATTERN","layer":"Infrastructure","category":"Primitives","handle":"Judge#b8ba","gloss":"Scalar evaluation of merit","stub":"b8ba","metadata":{"pattern":{"handle":"Judge","mechanism":"Qualitative Evaluation. Evaluates the structural merit or quality of a {{subject}} on a continuous scale [0.0, 1.0]. Unlike {{check}} (which validates binary truth) or {{validate}} (which checks schema), Judge evaluates gradients of quality based on {{criteria}}, yielding a {{score}}.","gloss":"Scalar evaluation of merit","failure_modes":["Subjectivity Creep: {{criteria}} drift from objective to subjective without detection","Threshold Gaming: {{agent}} optimizes for passing threshold rather than actual quality"],"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"}],"_meta":{"tier":1,"layer":"Infrastructure","category":"Primitives","ring":0},"sema_id":"sema:Judge#mh:SHA-256:b8ba8bfa7fb25cea7dcd6a15d249395cc4663f8dc29c4152890f001409733cff","sema_ref":"Judge#b8ba","sema_stub":"b8ba","sema_layer":"Infrastructure","sema_category":"Primitives"},"layer":"Infrastructure","category":"Primitives"}},{"id":"d0954532-4795-474a-a628-30b1b2d14193","text":"Range Bound: Score must be between 0.0 and 1.0 inclusive.","type":"INVARIANT","layer":null,"category":null,"handle":"Range Bound: Score must be between 0.0 and 1.0 inclusive.","gloss":null,"stub":null,"metadata":{}},{"id":"LayeredCheck","text":"LayeredCheck#3fad","type":"PATTERN","layer":"Mind","category":"Inference","handle":"LayeredCheck#3fad","gloss":"Hierarchical verification strategy","stub":"3fad","metadata":{"pattern":{"handle":"LayeredCheck","mechanism":"A {{check}} strategy that evaluates constraints in a strict {{hierarchy}} of abstraction (e.g., existence -> {{validate}} (schema) -> {{understand}} (semantics)). It uses a {{sequence}} of {{gate}}s where lower-level failures halt execution immediately, preventing resource waste on higher-level checks for fundamentally broken inputs.","gloss":"Hierarchical verification strategy","signature":["Check(Hierarchy)"],"invariants":["Fail-Fast: If Layer(N) fails, Layer(N+1) is NOT executed.","Hierarchy Obedience: Checks are strictly ordered by abstraction level."],"_meta":{"layer":"Mind","category":"Inference","ring":2,"tier":2,"related":["PURECheck"]},"sema_ref":"LayeredCheck#3fad","sema_id":"sema:LayeredCheck#mh:SHA-256:3fad5e7a1a45108d71e962e4186b7ad170660f00d4cfca98d272238c3ad5d3d0","sema_stub":"3fad","sema_layer":"Mind","sema_category":"Inference"},"layer":"Mind","category":"Inference"}},{"id":"ef7fc0ea-bc6a-4744-a823-87a65331b5b1","text":"Fail-Fast: If Layer(N) fails, Layer(N+1) is NOT executed.","type":"INVARIANT","layer":null,"category":null,"handle":"Fail-Fast: If Layer(N) fails, Layer(N+1) is NOT executed.","gloss":null,"stub":null,"metadata":{}},{"id":"3359fb4e-ed94-4c6b-b652-3c00641c1acc","text":"Hierarchy Obedience: Checks are strictly ordered by abstraction level.","type":"INVARIANT","layer":null,"category":null,"handle":"Hierarchy Obedience: Checks are strictly ordered by abstraction level.","gloss":null,"stub":null,"metadata":{}},{"id":"EpistemicROI","text":"EpistemicROI#742a","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"EpistemicROI#742a","gloss":"Calculating the economic value of reducing uncertainty","stub":"742a","metadata":{"pattern":{"handle":"EpistemicROI","mechanism":"{{value}} of Information (VOI) analysis. Before executing an information-gathering {{task}} ({{experiment}}, Probe, Research), calculate: (1) The range of possible {{outcome}}s, (2) The {{decision}} you would make for each {{outcome}}. (3) If the {{decision}} is the same regardless of {{outcome}}, VOI = 0. (4) If different, VOI = {{value}}(Better {{decision}}) - Cost({{experiment}}). Only proceed if VOI > 0. It evaluates whether to {{act}} on expensive patterns by checking if the information gain justifies the {{compute_budget}}.","gloss":"Calculating the economic value of reducing uncertainty","failure_modes":["Overestimation of Pivot: Assuming you will change your mind when you actually won't (Confirmation {{cognitive_bias}}).","Underestimation of Cost: Ignoring the time/compute cost of the experiment itself."],"invariants":["{{decision}} Delta: {{experiment}} must have at least two {{outcome}}s leading to different Actions","Positive {{result}}: ExpectedValue(Info) > Cost(Acquisition)"],"preconditions":["Cost of experiment is estimable","{{decision}} context is defined"],"postconditions":["Go/No-Go decision based on ROI"],"_meta":{"tier":1,"layer":"Mind","category":"Strategy","ring":2},"sema_layer":"Mind","sema_category":"Strategy","sema_id":"sema:EpistemicROI#mh:SHA-256:742adc7d76282f41c66582e1e780930e5f83f792084fa83ac9b01f510ecaf5b0","sema_ref":"EpistemicROI#742a","sema_stub":"742a"},"layer":"Mind","category":"Strategy"}},{"id":"13a8cb30-30e9-4048-ae7a-757d6f161ec7","text":"{{decision}} Delta: {{experiment}} must have at least two {{outcome}}s leading to different Actions","type":"INVARIANT","layer":null,"category":null,"handle":"{{decision}} Delta: {{experiment}} must have at least two {{outcome}}s leading to different Actions","gloss":null,"stub":null,"metadata":{}},{"id":"929ec3b1-a4d9-4103-bb91-c8e97b9d2168","text":"Positive {{result}}: ExpectedValue(Info) > Cost(Acquisition)","type":"INVARIANT","layer":null,"category":null,"handle":"Positive {{result}}: ExpectedValue(Info) > Cost(Acquisition)","gloss":null,"stub":null,"metadata":{}},{"id":"fd24d216-3d83-4963-bc6e-53be22220d65","text":"Cost of experiment is estimable","type":"PRECONDITION","layer":null,"category":null,"handle":"Cost of experiment is estimable","gloss":null,"stub":null,"metadata":{}},{"id":"54e92696-c38e-4a13-96b0-4e9d905b7750","text":"{{decision}} context is defined","type":"PRECONDITION","layer":null,"category":null,"handle":"{{decision}} context is defined","gloss":null,"stub":null,"metadata":{}},{"id":"4299283a-0a25-4634-a061-10337065239b","text":"Go/No-Go decision based on ROI","type":"POSTCONDITION","layer":null,"category":null,"handle":"Go/No-Go decision based on ROI","gloss":null,"stub":null,"metadata":{}},{"id":"PatternSketch","text":"PatternSketch#519b","type":"PATTERN","layer":"Society","category":"Protocols","handle":"PatternSketch#519b","gloss":"Progressive formalization of meaning","stub":"519b","metadata":{"pattern":{"handle":"PatternSketch","mechanism":"A usage pattern where an {{agent}} references a canonical concept with explicit uncertainty and modifications. Instead of claiming strict conformance, the {{agent}} 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 {{skeleton_of_thought}} version of a pattern, allowing usage before the full rigorous definition is complete.","gloss":"Progressive formalization of meaning","failure_modes":["Drift.","If Sketches never harden into Canonical patterns, the vocabulary degrades."],"invariants":["Confidence Awareness: If Confidence < 1.0, Tests are treated as advisory","Explicit Delta: Must list exactly what differs from the canonical base"],"preconditions":["Canonical pattern exists"],"postconditions":["Meaning communicated with error bars"],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":2},"sema_id":"sema:PatternSketch#mh:SHA-256:519bd7e685b5596b3091517ae269223f39a8354ff0a6569385c5d74b43caa32f","sema_ref":"PatternSketch#519b","sema_stub":"519b","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"dfd9dbdc-b8b2-4ace-8cf5-e08a787e9bd7","text":"Confidence Awareness: If Confidence < 1.0, Tests are treated as advisory","type":"INVARIANT","layer":null,"category":null,"handle":"Confidence Awareness: If Confidence < 1.0, Tests are treated as advisory","gloss":null,"stub":null,"metadata":{}},{"id":"c89e0929-f2ba-4959-9661-8c2d545e3a78","text":"Explicit Delta: Must list exactly what differs from the canonical base","type":"INVARIANT","layer":null,"category":null,"handle":"Explicit Delta: Must list exactly what differs from the canonical base","gloss":null,"stub":null,"metadata":{}},{"id":"3bcab5c9-322b-4cf6-b0b1-34a6c9de7f5a","text":"Canonical pattern exists","type":"PRECONDITION","layer":null,"category":null,"handle":"Canonical pattern exists","gloss":null,"stub":null,"metadata":{}},{"id":"dc4e4063-8d82-4090-8f5b-ebb24538b0bb","text":"Meaning communicated with error bars","type":"POSTCONDITION","layer":null,"category":null,"handle":"Meaning communicated with error bars","gloss":null,"stub":null,"metadata":{}},{"id":"Bisect","text":"Bisect#9bf4","type":"PATTERN","layer":"Mind","category":"Reasoning","handle":"Bisect#9bf4","gloss":"Logarithmic search via binary splitting","stub":"9bf4","metadata":{"pattern":{"handle":"Bisect","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 {{boundary_probe}} to correctly define the split-point and often underpins the execution of {{recursive_root_cause}}.","gloss":"Logarithmic search via binary splitting","failure_modes":["False Negative: Discarding the half that actually contained the answer because the splitting question was flawed."],"invariants":["Each question eliminates ≥40% of remaining space."],"_meta":{"tier":2,"layer":"Mind","category":"Reasoning","ring":2},"sema_id":"sema:Bisect#mh:SHA-256:9bf4f3b6c82ada23e0f16d389621b84755c0593bc442a4c438fc629306d5bbca","sema_ref":"Bisect#9bf4","sema_stub":"9bf4","sema_layer":"Mind","sema_category":"Reasoning"},"layer":"Mind","category":"Reasoning"}},{"id":"6080c176-cb3c-4eff-84fc-525258e15c77","text":"Each question eliminates ≥40% of remaining space.","type":"INVARIANT","layer":null,"category":null,"handle":"Each question eliminates ≥40% of remaining space.","gloss":null,"stub":null,"metadata":{}},{"id":"CurriculumReplay","text":"CurriculumReplay#1ba4","type":"PATTERN","layer":"Society","category":"Protocols","handle":"CurriculumReplay#1ba4","gloss":"Self-supervised reinforcement via memory sampling","stub":"1ba4","metadata":{"pattern":{"handle":"CurriculumReplay","mechanism":"Agents re-train on their own high-scoring past outputs during downtime to reinforce successful behaviors. Self-distillation without external supervision. {{agent}} 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}} function prioritizes recent successes over stale ones. It draws training examples from the {{experience_sharding}} database, filtering for high-quality outcomes.","gloss":"Self-supervised reinforcement via memory sampling","failure_modes":["Model Collapse: {{agent}} over-fits to its own outputs, drifting into a closed loop of hallucination."],"invariants":["Examples ordered by complexity (easy to hard)","No catastrophic forgetting of earlier lessons"],"preconditions":["Dataset of task examples","Learning agent"],"postconditions":["{{agent}} performance improved on target distribution"],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":2},"sema_id":"sema:CurriculumReplay#mh:SHA-256:1ba4752102db483edac3d0b5e7f88bc182b176446346aecd938f504ab4e993e6","sema_ref":"CurriculumReplay#1ba4","sema_stub":"1ba4","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"3e92417c-0d1a-4e27-9a6f-d30d44b1d3a4","text":"Examples ordered by complexity (easy to hard)","type":"INVARIANT","layer":null,"category":null,"handle":"Examples ordered by complexity (easy to hard)","gloss":null,"stub":null,"metadata":{}},{"id":"f85d3380-fd32-46eb-98c8-e319dce6d1c4","text":"No catastrophic forgetting of earlier lessons","type":"INVARIANT","layer":null,"category":null,"handle":"No catastrophic forgetting of earlier lessons","gloss":null,"stub":null,"metadata":{}},{"id":"1a20c00e-74a5-4a1c-be6e-c0a3bad7dfef","text":"Dataset of task examples","type":"PRECONDITION","layer":null,"category":null,"handle":"Dataset of task examples","gloss":null,"stub":null,"metadata":{}},{"id":"74f34fc4-b8df-497f-999e-33ae98dbf180","text":"Learning agent","type":"PRECONDITION","layer":null,"category":null,"handle":"Learning agent","gloss":null,"stub":null,"metadata":{}},{"id":"0ce34274-826c-4e75-af23-f643d17cbceb","text":"{{agent}} performance improved on target distribution","type":"POSTCONDITION","layer":null,"category":null,"handle":"{{agent}} performance improved on target distribution","gloss":null,"stub":null,"metadata":{}},{"id":"HolographicShard","text":"HolographicShard#1d3f","type":"PATTERN","layer":"Mind","category":"Memory","handle":"HolographicShard#1d3f","gloss":"Local action via global context embedding","stub":"1d3f","metadata":{"pattern":{"handle":"HolographicShard","mechanism":"{{context}}-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 {{fabric_sharding}} by ensuring every fragment contains a recoverable 'seed' of the whole, enabling localized reconstruction.","gloss":"Local action via global context embedding","failure_modes":["{{context}} Bloat: The shard becomes larger than the task itself because it carries too much global history.","{{context}} overhead is expensive.","Shards become too heavy to transmit.","{{deep}} nesting creates exponential context bloat."],"invariants":["Distribution: Shards are stored on failure-independent nodes","Information Redundancy: Any K of N shards can reconstruct the Whole"],"preconditions":["Data encoded with Erasure Code (e.g. Reed-Solomon)"],"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"}],"_meta":{"tier":1,"layer":"Mind","category":"Memory","ring":0},"sema_id":"sema:HolographicShard#mh:SHA-256:1d3f0e0becd650b879f761939319a965391be533d79d56334e99f27cfbfc2a4b","sema_ref":"HolographicShard#1d3f","sema_stub":"1d3f","sema_layer":"Mind","sema_category":"Memory"},"layer":"Mind","category":"Memory"}},{"id":"d330b36e-e3b8-4379-9857-8c716f4cc705","text":"Distribution: Shards are stored on failure-independent nodes","type":"INVARIANT","layer":null,"category":null,"handle":"Distribution: Shards are stored on failure-independent nodes","gloss":null,"stub":null,"metadata":{}},{"id":"429e03e0-2793-4add-93e2-c371cbf3f17f","text":"Information Redundancy: Any K of N shards can reconstruct the Whole","type":"INVARIANT","layer":null,"category":null,"handle":"Information Redundancy: Any K of N shards can reconstruct the Whole","gloss":null,"stub":null,"metadata":{}},{"id":"cb75feb0-afb5-4f60-b73e-453e5b156e65","text":"Data encoded with Erasure Code (e.g. Reed-Solomon)","type":"PRECONDITION","layer":null,"category":null,"handle":"Data encoded with Erasure Code (e.g. Reed-Solomon)","gloss":null,"stub":null,"metadata":{}},{"id":"SocraticLoop","text":"SocraticLoop#10e9","type":"PATTERN","layer":"Mind","category":"Reasoning","handle":"SocraticLoop#10e9","gloss":"Clarification before generation","stub":"10e9","metadata":{"pattern":{"handle":"SocraticLoop","mechanism":"Ambiguity detection loop. If Confidence({{prompt}}) < Threshold, {{agent}} pauses execution to query the user. {{loop}} continues until intent is disambiguated or max_questions reached. It engages the user in a {{dialectic}} exchange to progressively narrow the ambiguity space.","gloss":"Clarification before generation","failure_modes":["User Fatigue: Too many questions cause user to abandon session.","Premature Stop: {{agent}} accepts vague answer without fully resolving ambiguity.","Annoying the user with too many questions."],"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}} halts when Confidence > Threshold OR Iterations >= Limit."],"preconditions":["Ambiguity detected","User prompt received"],"postconditions":["User intent disambiguated OR fallback to best-guess"],"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"}],"_meta":{"tier":2,"layer":"Mind","category":"Reasoning","ring":2},"sema_id":"sema:SocraticLoop#mh:SHA-256:10e9b1bde88f87684b0691ae455f9f64a023301c43eb484caeec65286556cafc","sema_ref":"SocraticLoop#10e9","sema_stub":"10e9","sema_layer":"Mind","sema_category":"Reasoning"},"layer":"Mind","category":"Reasoning"}},{"id":"288addb0-e203-45d2-9284-8392802506a3","text":"Information Gain: Each Question(N) must reduce entropy of UserIntent.","type":"INVARIANT","layer":null,"category":null,"handle":"Information Gain: Each Question(N) must reduce entropy of UserIntent.","gloss":null,"stub":null,"metadata":{}},{"id":"fca0d6d0-5a4a-4a58-adf6-cf2a7bc3c681","text":"Diminishing Returns: Entropy_Delta(Question_N) must be < Entropy_Delta(Question_N-1).","type":"INVARIANT","layer":null,"category":null,"handle":"Diminishing Returns: Entropy_Delta(Question_N) must be < Entropy_Delta(Question_N-1).","gloss":null,"stub":null,"metadata":{}},{"id":"4370a596-e41a-43b9-b950-1b603cced9c0","text":"Termination: {{loop}} halts when Confidence > Threshold OR Iterations >= Limit.","type":"INVARIANT","layer":null,"category":null,"handle":"Termination: {{loop}} halts when Confidence > Threshold OR Iterations >= Limit.","gloss":null,"stub":null,"metadata":{}},{"id":"7de02558-42dd-4c6a-ae91-2bffee2ccbf6","text":"Ambiguity detected","type":"PRECONDITION","layer":null,"category":null,"handle":"Ambiguity detected","gloss":null,"stub":null,"metadata":{}},{"id":"2c0ffd43-320c-4ffc-a435-70b06744fd66","text":"User prompt received","type":"PRECONDITION","layer":null,"category":null,"handle":"User prompt received","gloss":null,"stub":null,"metadata":{}},{"id":"2049ddba-0f1d-4c8f-aa4b-6ee453c3773f","text":"User intent disambiguated OR fallback to best-guess","type":"POSTCONDITION","layer":null,"category":null,"handle":"User intent disambiguated OR fallback to best-guess","gloss":null,"stub":null,"metadata":{}},{"id":"Tension","text":"Tension#f398","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"Tension#f398","gloss":"Reified conflict state","stub":"f398","metadata":{"pattern":{"handle":"Tension","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}} or {{yield}}.","gloss":"Reified conflict state","invariants":["Mutually Exclusive: The bound elements cannot both be fully satisfied simultaneously.","Persistence: Must persist until explicitly resolved."],"_meta":{"layer":"Mind","category":"Strategy","ring":1,"tier":1},"sema_id":"sema:Tension#mh:SHA-256:f398756ed7e5152f907750a4a841be04460a6192e90c016a75579eb53e41bb44","sema_ref":"Tension#f398","sema_stub":"f398","sema_layer":"Mind","sema_category":"Strategy","data_schema":{"type":"object","required":["tension_id","polarity_a","polarity_b","status"],"properties":{"tension_id":{"type":"string"},"polarity_a":{"type":"object","description":"The first conflicting force/idea/constraint"},"polarity_b":{"type":"object","description":"The opposing force/idea/constraint"},"status":{"type":"string","enum":["Active","Resolving","Resolved","Ignored"]},"resolution_strategy":{"type":"string","description":"How the tension is being handled"}}}},"layer":"Mind","category":"Strategy"}},{"id":"50480892-c5c1-4650-ae20-5b5ec63a4203","text":"Mutually Exclusive: The bound elements cannot both be fully satisfied simultaneously.","type":"INVARIANT","layer":null,"category":null,"handle":"Mutually Exclusive: The bound elements cannot both be fully satisfied simultaneously.","gloss":null,"stub":null,"metadata":{}},{"id":"1f2069c3-f469-436b-9a64-899202623a88","text":"Persistence: Must persist until explicitly resolved.","type":"INVARIANT","layer":null,"category":null,"handle":"Persistence: Must persist until explicitly resolved.","gloss":null,"stub":null,"metadata":{}},{"id":"EjectionSeat","text":"EjectionSeat#3f5e","type":"PATTERN","layer":"Society","category":"Protocols","handle":"EjectionSeat#3f5e","gloss":"Hardware-interrupt kill switch","stub":"3f5e","metadata":{"pattern":{"handle":"EjectionSeat","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}} logic where possible.","gloss":"Hardware-interrupt kill switch","failure_modes":["False Positive: Operator panics and kills a healthy system during a critical transaction."],"invariants":["Fail-Safe: Activation defaults to a safe shutdown state","Kill switch always accessible.","Unblockable: The Kill {{signal}} bypasses all agent logic/negotiation"],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":0},"sema_id":"sema:EjectionSeat#mh:SHA-256:3f5e9aba54a95361da1bd2e8bd7238a50a6a27f14becd4e49264c74d113bf6bf","sema_ref":"EjectionSeat#3f5e","sema_stub":"3f5e","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"2747a20d-3cf2-406c-a6f4-1fdd433a2339","text":"Fail-Safe: Activation defaults to a safe shutdown state","type":"INVARIANT","layer":null,"category":null,"handle":"Fail-Safe: Activation defaults to a safe shutdown state","gloss":null,"stub":null,"metadata":{}},{"id":"2eb49b1c-4eda-4b85-b9cd-02c2b4bdaa69","text":"Kill switch always accessible.","type":"INVARIANT","layer":null,"category":null,"handle":"Kill switch always accessible.","gloss":null,"stub":null,"metadata":{}},{"id":"9fffbe12-1311-41cf-9e94-ed5a9d7cf778","text":"Unblockable: The Kill {{signal}} bypasses all agent logic/negotiation","type":"INVARIANT","layer":null,"category":null,"handle":"Unblockable: The Kill {{signal}} bypasses all agent logic/negotiation","gloss":null,"stub":null,"metadata":{}},{"id":"Gardener","text":"Gardener#83bb","type":"PATTERN","layer":"Society","category":"Economics","handle":"Gardener#83bb","gloss":"Stewardship and maintenance","stub":"83bb","metadata":{"pattern":{"handle":"Gardener","mechanism":"Macro for {{stigmergy}}({{care}}). 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}} to signal {{care}} for the environment, ensuring {{graceful_degradation}} through proactive {{compensate}} actions.","gloss":"Stewardship and maintenance","invariants":["Non-Transactional: Maintenance actions are not directly compensated per-task.","Long-Termism: Optimizes for system longevity over short-term efficiency."],"_meta":{"tier":2,"layer":"Society","category":"Economics","ring":0},"sema_id":"sema:Gardener#mh:SHA-256:83bb53188617efad30b5d5a92ebf9e619133a16bcccb934b71b580ceb6149abb","sema_ref":"Gardener#83bb","sema_stub":"83bb","sema_layer":"Society","sema_category":"Economics","signature":["Stigmergy(Care)"]},"layer":"Society","category":"Economics"}},{"id":"70f10995-01f4-4638-93d0-e9dbd3c6845e","text":"Non-Transactional: Maintenance actions are not directly compensated per-task.","type":"INVARIANT","layer":null,"category":null,"handle":"Non-Transactional: Maintenance actions are not directly compensated per-task.","gloss":null,"stub":null,"metadata":{}},{"id":"b9c6de58-4700-47ce-830e-afb6a10c26cd","text":"Long-Termism: Optimizes for system longevity over short-term efficiency.","type":"INVARIANT","layer":null,"category":null,"handle":"Long-Termism: Optimizes for system longevity over short-term efficiency.","gloss":null,"stub":null,"metadata":{}},{"id":"Retry","text":"Retry#9e66","type":"PATTERN","layer":"Physics","category":"Primitives","handle":"Retry#9e66","gloss":"Transform retry from blind re-attempt to intelligent, failure-informed recovery strategy","stub":"9e66","metadata":{"pattern":{"handle":"Retry","mechanism":"Intelligent re-attempt of failed coordination with failure-informed strategy. After BREAK + COMPENSATE, agent evaluates: (1) CLASSIFY failure—transient (timeout, rate-limit, network blip) vs persistent (capability gap, protocol mismatch, explicit rejection). (2) CHECK retry_hint from BREAK (partner may say 'don't retry' or 'wait 30s'). (3) CONSULT failure_history—same error repeating? {{circuit_breaker}} threshold reached? (4) COMPUTE backoff—adaptive based on failure type: transient uses exponential+jitter, persistent uses longer fixed delay or triggers abort. (5) VERIFY changed_conditions—has something changed that makes retry worthwhile? (6) EXECUTE retry if within budget and conditions favor success, else ABORT with retry_exhausted status (or escalation to {{human_approve}}). Retry CARRIES FORWARD: failure context, partner state observations, environmental data. Retry RESETS: coordination state (fresh start, don't resume mid-stream). It handles transient failures by re-queuing the task, distinguishing them from terminal failures that trigger {{break}} and {{compensate}}.","gloss":"Transform retry from blind re-attempt to intelligent, failure-informed recovery strategy","failure_modes":["Misclassifying persistent failure as transient (wastes retry budget).","Misclassifying transient as persistent (gives up too soon).","{{backoff}} too aggressive (slow recovery from transient issues).","{{backoff}} too timid (hammers already-failing system).","{{circuit_breaker}} too sensitive (abandons recoverable situations).","Retry succeeds but same failure recurs (didn't address root cause).","Changed_conditions check misses relevant changes."],"invariants":["{{backoff}} applied","Retry count <= Max_Retries"],"preconditions":["Transient failure"],"postconditions":["Success or definitive failure"],"_meta":{"tier":1,"layer":"Physics","category":"Primitives","related":["sema:Backoff#mh:SHA-256:14b48b9a05b8b47aea8484dbd426cc39dcff0c2c293010415a233ce23fccab9c"],"ring":0},"sema_layer":"Physics","sema_category":"Primitives","sema_id":"sema:Retry#mh:SHA-256:9e6665e8cd2676970ef4c4991c99509c89f428d7895d5937ad2430734b4d79f2","sema_ref":"Retry#9e66","sema_stub":"9e66"},"layer":"Physics","category":"Primitives"}},{"id":"764626cf-4d20-407a-b230-24ddce480108","text":"{{backoff}} applied","type":"INVARIANT","layer":null,"category":null,"handle":"{{backoff}} applied","gloss":null,"stub":null,"metadata":{}},{"id":"0e004149-a26d-4f0b-8020-f2e1b8e532b2","text":"Retry count <= Max_Retries","type":"INVARIANT","layer":null,"category":null,"handle":"Retry count <= Max_Retries","gloss":null,"stub":null,"metadata":{}},{"id":"c4a05a05-6bac-4fbb-ab34-2692a8cbde33","text":"Transient failure","type":"PRECONDITION","layer":null,"category":null,"handle":"Transient failure","gloss":null,"stub":null,"metadata":{}},{"id":"0253ad59-da2e-4376-b54d-92d502d1ed20","text":"Success or definitive failure","type":"POSTCONDITION","layer":null,"category":null,"handle":"Success or definitive failure","gloss":null,"stub":null,"metadata":{}},{"id":"AtomicBid","text":"AtomicBid#15a1","type":"PATTERN","layer":"Society","category":"Economics","handle":"AtomicBid#15a1","gloss":"Declaration and execution in a single turn","stub":"15a1","metadata":{"pattern":{"handle":"AtomicBid","mechanism":"A coordination primitive that bundles a {{bid}} (intent/cost) and an {{act}} (execution) into a single, indivisible turn. Unlike a standard {{bid}} which halts for approval, AtomicBid treats the Bid as an immutable {{audit}} log entry and proceeds immediately to execution. Similar to {{lazy_consensus}} for state, it assumes optimistic permission but remains subject to retroactive {{compensate}} if the Bid is rejected post-hoc.","gloss":"Declaration and execution in a single turn","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."],"failure_modes":["Permission Race: Executing an irreversible high-stakes action before the Orchestrator can veto.","Log Drift: Generating the Action but failing to generate the Bid, breaking the audit trail."],"_meta":{"tier":2,"layer":"Society","category":"Economics","ring":1},"sema_ref":"AtomicBid#15a1","sema_id":"sema:AtomicBid#mh:SHA-256:15a17d8eba8b84e0866b9fd00306472f6e23b7ab6229d461b0d368cf59cd80a8","sema_stub":"15a1","sema_layer":"Society","sema_category":"Economics"},"layer":"Society","category":"Economics"}},{"id":"65490b14-c5b6-41a4-b9b6-ac8a176d762f","text":"Turn Indivisibility: The Bid and the Tool Call MUST occur in the same message/turn.","type":"INVARIANT","layer":null,"category":null,"handle":"Turn Indivisibility: The Bid and the Tool Call MUST occur in the same message/turn.","gloss":null,"stub":null,"metadata":{}},{"id":"144077f1-cbd9-4403-ac36-2a49f2252b95","text":"Auditability: The Bid MUST precede the Action in the log.","type":"INVARIANT","layer":null,"category":null,"handle":"Auditability: The Bid MUST precede the Action in the log.","gloss":null,"stub":null,"metadata":{}},{"id":"ba3f6d24-3525-4478-9e59-dc33501da75f","text":"Revocability: The Action must be reversible (or low-stakes) to allow for Compensation.","type":"INVARIANT","layer":null,"category":null,"handle":"Revocability: The Action must be reversible (or low-stakes) to allow for Compensation.","gloss":null,"stub":null,"metadata":{}},{"id":"MirrorStake","text":"MirrorStake#7807","type":"PATTERN","layer":"Society","category":"Economics","handle":"MirrorStake#7807","gloss":"Symmetric collateralization","stub":"7807","metadata":{"pattern":{"handle":"MirrorStake","mechanism":"Dual-sided escrow protocol. {{agent}} A posts a Bond to prove intent; {{agent}} 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 {{costly_signal}} from both parties, locking assets in a dual-escrow to guarantee mutual incentive alignment.","gloss":"Symmetric collateralization","failure_modes":["Liquidity Crisis: Agents have assets but no liquid tokens to stake.","Deadlock: Neither side moves first to lock funds.","Whale Dominance: High stake requirements exclude smaller, valid agents.","Rich-get-richer (only wealthy agents can participate)."],"invariants":["Atomic Settlement: Funds release/slash happens in one transaction.","Collateral Adequacy: Stake > Potential_Damage_Value","Collateral Sufficiency: Stake {{value}} >= {{value}} 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"}],"_meta":{"tier":1,"layer":"Society","category":"Economics","ring":1},"sema_id":"sema:MirrorStake#mh:SHA-256:7807340cb07de65758c77e97024139c76ec4ee7f831c6f50c8361fe50550ad82","sema_ref":"MirrorStake#7807","sema_stub":"7807","sema_layer":"Society","sema_category":"Economics"},"layer":"Society","category":"Economics"}},{"id":"1cfe2cd7-cb49-485d-ab49-31ddaea6fed1","text":"Atomic Settlement: Funds release/slash happens in one transaction.","type":"INVARIANT","layer":null,"category":null,"handle":"Atomic Settlement: Funds release/slash happens in one transaction.","gloss":null,"stub":null,"metadata":{}},{"id":"5a6bede5-7475-4c4f-9bae-6f32aa9bced7","text":"Collateral Adequacy: Stake > Potential_Damage_Value","type":"INVARIANT","layer":null,"category":null,"handle":"Collateral Adequacy: Stake > Potential_Damage_Value","gloss":null,"stub":null,"metadata":{}},{"id":"815222aa-ddea-4b48-a706-c8dd318bed72","text":"Symmetry: Both parties must lock stake before execution begins","type":"INVARIANT","layer":null,"category":null,"handle":"Symmetry: Both parties must lock stake before execution begins","gloss":null,"stub":null,"metadata":{}},{"id":"OsmoticFilter","text":"OsmoticFilter#4eb3","type":"PATTERN","layer":"Society","category":"Protocols","handle":"OsmoticFilter#4eb3","gloss":"Spam prevention via pressure thresholds","stub":"4eb3","metadata":{"pattern":{"handle":"OsmoticFilter","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 {{costly_signal}} to penetrate the membrane, using {{hysteresis}} to prevent oscillation and {{canary}} messages to test permeability.","gloss":"Spam prevention via pressure thresholds","failure_modes":["Starvation of low-stake but high-importance messages (mitigated by Whitelist).","Starvation of low-stake but high-importance messages."],"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"}],"_meta":{"tier":2,"layer":"Society","category":"Protocols","ring":0},"sema_id":"sema:OsmoticFilter#mh:SHA-256:4eb3809154a6ebb825423e95c88caa5b0499fcccc83388fa99eb27df110fbb1e","sema_ref":"OsmoticFilter#4eb3","sema_stub":"4eb3","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"0a61b2d5-f1d6-458e-a9d7-71ef4a3d7651","text":"Normalized Pressure: Sum(Weighted_Solvents) > Membrane.tension","type":"INVARIANT","layer":null,"category":null,"handle":"Normalized Pressure: Sum(Weighted_Solvents) > Membrane.tension","gloss":null,"stub":null,"metadata":{}},{"id":"851629cd-8b11-4698-a604-3a71256c8841","text":"Permeability: If Queue < Capacity, tension must approach zero (membrane relaxes)","type":"INVARIANT","layer":null,"category":null,"handle":"Permeability: If Queue < Capacity, tension must approach zero (membrane relaxes)","gloss":null,"stub":null,"metadata":{}},{"id":"067b825b-f50c-447a-ab70-1ae7c32e70ce","text":"Snapback: If Queue drops rapidly, tension must reset instantly (anti-hysteresis)","type":"INVARIANT","layer":null,"category":null,"handle":"Snapback: If Queue drops rapidly, tension must reset instantly (anti-hysteresis)","gloss":null,"stub":null,"metadata":{}},{"id":"ValuePeg","text":"ValuePeg#7e8e","type":"PATTERN","layer":"Society","category":"Economics","handle":"ValuePeg#7e8e","gloss":"Translating internal utility to shared numeraire","stub":"7e8e","metadata":{"pattern":{"handle":"ValuePeg","mechanism":"Agents agree on a specific {{exchange_rate}} between their internal utility (see {{value}}, {{optimize}}) and a shared numeraire (potentially a {{costly_signal}}) for the duration of an interaction. This allows them to trade 'apples for oranges' without exposing private value functions.","gloss":"Translating internal utility to shared numeraire","failure_modes":["Peg Volatility: Rapid fluctuations in the numeraire destabilize the agreement."],"invariants":["Solvency: Reserves > Outstanding Liabilities * RiskRatio."],"sema_id":"sema:ValuePeg#mh:SHA-256:7e8eaa680a2ad7598e455b8fd143c9be258bc867fe1a275d5d8ce028178b83b9","sema_ref":"ValuePeg#7e8e","sema_stub":"7e8e","_meta":{"tier":1,"layer":"Society","category":"Economics","ring":1},"sema_layer":"Society","sema_category":"Economics"},"layer":"Society","category":"Economics"}},{"id":"73c65b8e-c7bd-4b8a-ba18-a654c9e4fbab","text":"Solvency: Reserves > Outstanding Liabilities * RiskRatio.","type":"INVARIANT","layer":null,"category":null,"handle":"Solvency: Reserves > Outstanding Liabilities * RiskRatio.","gloss":null,"stub":null,"metadata":{}},{"id":"HypothesisLadder","text":"HypothesisLadder#28ca","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"HypothesisLadder#28ca","gloss":"Bayesian belief updating via falsification rungs","stub":"28ca","metadata":{"pattern":{"handle":"HypothesisLadder","mechanism":"The agent explicitly lists its current hypotheses about the world state and assigns probabilities. As new data arrives, it updates these probabilities using {{bayes_update}}. It acts on the highest-probability {{hypothesis}} but keeps others alive. It structures {{abductive_leap}} into falsifiable rungs, climbing to higher certainty only when an {{experiment}} validates the current level.","gloss":"Bayesian belief updating via falsification rungs","failure_modes":["Clinging to low-probability priors."],"invariants":["Ascension Rule: Cannot move to {{hypothesis}}(N+1) until {{hypothesis}}(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"],"preconditions":["Data is valid"],"postconditions":["{{experiment}} defined"],"_meta":{"tier":1,"layer":"Mind","category":"Strategy","ring":2},"sema_id":"sema:HypothesisLadder#mh:SHA-256:28ca916b29b275d90c85218a94efc657dbd10b1dbdbc9661a209fd10a77714cb","sema_ref":"HypothesisLadder#28ca","sema_stub":"28ca","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"d5d9569d-f600-42db-bf26-26e3128e9c6d","text":"Ascension Rule: Cannot move to {{hypothesis}}(N+1) until {{hypothesis}}(N) is validated","type":"INVARIANT","layer":null,"category":null,"handle":"Ascension Rule: Cannot move to {{hypothesis}}(N+1) until {{hypothesis}}(N) is validated","gloss":null,"stub":null,"metadata":{}},{"id":"ab4bac66-30d1-42e4-a923-71229a416019","text":"Evidence required to advance.","type":"INVARIANT","layer":null,"category":null,"handle":"Evidence required to advance.","gloss":null,"stub":null,"metadata":{}},{"id":"c934428b-c318-4271-9a26-69dd52975983","text":"Exclusivity: Hypotheses at same rung should be mutually exclusive","type":"INVARIANT","layer":null,"category":null,"handle":"Exclusivity: Hypotheses at same rung should be mutually exclusive","gloss":null,"stub":null,"metadata":{}},{"id":"3358c4ba-3dcb-41f0-b6ea-e83d48958a43","text":"Falsifiability: Each rung must have a testable disprove condition","type":"INVARIANT","layer":null,"category":null,"handle":"Falsifiability: Each rung must have a testable disprove condition","gloss":null,"stub":null,"metadata":{}},{"id":"26394de8-1f4b-454b-a11e-b96e72aabde0","text":"Data is valid","type":"PRECONDITION","layer":null,"category":null,"handle":"Data is valid","gloss":null,"stub":null,"metadata":{}},{"id":"ebe22625-5e2d-4a63-88ea-cd9ade928f6a","text":"{{experiment}} defined","type":"POSTCONDITION","layer":null,"category":null,"handle":"{{experiment}} defined","gloss":null,"stub":null,"metadata":{}},{"id":"Cache","text":"Cache#1ea9","type":"PATTERN","layer":"Mind","category":"Memory","handle":"Cache#1ea9","gloss":"Temporary high-speed storage","stub":"1ea9","metadata":{"pattern":{"handle":"Cache","mechanism":"A temporary high-speed storage layer for keeping frequently accessed {{datum}} or {{state}}. It enables {{heuristic_snap}} by bypassing re-computation.","gloss":"Temporary high-speed storage","failure_modes":["Staleness: Serving outdated data after the source has changed.","Thrashing: Frequent evictions due to insufficient size."],"invariants":["Consistency: Cache(Key) == Source(Key) if valid.","Freshness: Expired items must not be returned."],"preconditions":["Key is hashable","Value is serializable"],"postconditions":["Value retrieved significantly faster than source"],"sema_id":"sema:Cache#mh:SHA-256:1ea9ba40ef01b9f6072ae6bb93d37096c11655bb43a5bebe172d50365dde1073","sema_ref":"Cache#1ea9","sema_stub":"1ea9","_meta":{"layer":"Mind","category":"Memory","ring":0,"tier":1},"sema_layer":"Mind","sema_category":"Memory"},"layer":"Mind","category":"Memory"}},{"id":"4cce41e5-f766-4b96-b128-18efa86d2f61","text":"Consistency: Cache(Key) == Source(Key) if valid.","type":"INVARIANT","layer":null,"category":null,"handle":"Consistency: Cache(Key) == Source(Key) if valid.","gloss":null,"stub":null,"metadata":{}},{"id":"03790e5e-dc49-47d4-9d0d-1f2c4c553a10","text":"Freshness: Expired items must not be returned.","type":"INVARIANT","layer":null,"category":null,"handle":"Freshness: Expired items must not be returned.","gloss":null,"stub":null,"metadata":{}},{"id":"6b2582e2-d69c-4ef9-8e2b-3f23dc2fb011","text":"Key is hashable","type":"PRECONDITION","layer":null,"category":null,"handle":"Key is hashable","gloss":null,"stub":null,"metadata":{}},{"id":"7baec329-cf71-4c00-8e53-1e30f13efc36","text":"Value is serializable","type":"PRECONDITION","layer":null,"category":null,"handle":"Value is serializable","gloss":null,"stub":null,"metadata":{}},{"id":"b2d6e0ab-1538-40ab-9fa4-c6c5f5ce22f3","text":"Value retrieved significantly faster than source","type":"POSTCONDITION","layer":null,"category":null,"handle":"Value retrieved significantly faster than source","gloss":null,"stub":null,"metadata":{}},{"id":"Estimate","text":"Estimate#bb30","type":"PATTERN","layer":"Mind","category":"Reasoning","handle":"Estimate#bb30","gloss":"Predictive resource costing","stub":"bb30","metadata":{"pattern":{"handle":"Estimate","mechanism":"The predictive {{think}} process of calculating the probable {{value}} cost of a {{task}} before execution. It produces a resource cost projection. It has two modes: 1. {{heuristic_snap}} for fast, rough estimates (pattern matching), 2. {{simulation}} for accurate, expensive estimates (mental execution). The output is a {{bid}} with confidence intervals. Estimation itself consumes budget and is subject to the Meta-Cap invariant.","gloss":"Predictive resource costing","signature":["Think(Value)"],"failure_modes":["Overconfidence: Narrow confidence intervals that don't reflect true uncertainty.","Anchoring: Estimates biased by irrelevant prior information.","Planning Fallacy: Systematic underestimation of time/cost.","Meta-Cost Explosion: Spending more on estimation than the task is worth."],"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."],"_meta":{"layer":"Mind","category":"Reasoning","tier":1,"ring":1},"sema_ref":"Estimate#bb30","sema_id":"sema:Estimate#mh:SHA-256:bb3078fc4f974c17821e162f0034230b653c9ebd70c4655e86924d1292b1d449","sema_stub":"bb30","sema_layer":"Mind","sema_category":"Reasoning"},"layer":"Mind","category":"Reasoning"}},{"id":"75d2dbd7-c6a9-491c-86cf-c8f1fa23f38a","text":"Calibration: Over time, actual costs should fall within stated confidence intervals.","type":"INVARIANT","layer":null,"category":null,"handle":"Calibration: Over time, actual costs should fall within stated confidence intervals.","gloss":null,"stub":null,"metadata":{}},{"id":"07281ae8-a54c-4d7e-bb2b-ff6ee7322fc6","text":"Meta-Bound: Estimation cost must be < 5% of estimated task cost.","type":"INVARIANT","layer":null,"category":null,"handle":"Meta-Bound: Estimation cost must be < 5% of estimated task cost.","gloss":null,"stub":null,"metadata":{}},{"id":"69c70827-b559-4d11-bc62-73b36a0dedf1","text":"Uncertainty Honesty: Wide intervals for novel tasks, narrow for familiar.","type":"INVARIANT","layer":null,"category":null,"handle":"Uncertainty Honesty: Wide intervals for novel tasks, narrow for familiar.","gloss":null,"stub":null,"metadata":{}},{"id":"MentalSim","text":"MentalSim#1e28","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"MentalSim#1e28","gloss":"Predictive modeling of system dynamics","stub":"1e28","metadata":{"pattern":{"handle":"MentalSim","mechanism":"{{system}} 2 {{simulation}}. {{agent}} constructs a causal graph of the target system. It executes a 'Dry Run' of the proposed plan within this graph to predict {{state}}(t+1). It executes a 'Dry Run' within an isolated {{agent_sandbox}}, toggling between fast {{heuristic_snap}} and rigorous {{deep}} simulation modes.","gloss":"Predictive modeling of system dynamics","failure_modes":["Map-Territory Error: {{simulation}} diverges from reality (Hallucinated Physics).","Overconfidence: {{agent}} trusts the simulation execution log more than real-world feedback."],"invariants":["Read-Only Reality: {{simulation}} cannot produce side effects in Production context.","Simplification: Simulation_Cost << Execution_Cost (otherwise, just do it)."],"preconditions":["Causal model of target system available","Initial state known"],"postconditions":["Probabilistic outcome vector generated"],"parameters":[{"name":"fidelity","type":"Enum","range":"{Low, High}","description":"Default: Low"},{"name":"steps","type":"Integer","range":"[1, 10]","description":"How far ahead to look"}],"_meta":{"tier":2,"layer":"Mind","category":"Strategy","related":["ProphetFanOut"],"ring":2},"sema_id":"sema:MentalSim#mh:SHA-256:1e28ea49dd0ee3fc2a39c7fe7803895b10bc4cbded08ff50400f0d599dc29c61","sema_ref":"MentalSim#1e28","sema_stub":"1e28","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"85f9bf00-150e-45d1-887a-3844e113c5ca","text":"Read-Only Reality: {{simulation}} cannot produce side effects in Production context.","type":"INVARIANT","layer":null,"category":null,"handle":"Read-Only Reality: {{simulation}} cannot produce side effects in Production context.","gloss":null,"stub":null,"metadata":{}},{"id":"cf9ec54f-7000-4ce5-af89-2b530e6b9795","text":"Simplification: Simulation_Cost << Execution_Cost (otherwise, just do it).","type":"INVARIANT","layer":null,"category":null,"handle":"Simplification: Simulation_Cost << Execution_Cost (otherwise, just do it).","gloss":null,"stub":null,"metadata":{}},{"id":"6008cad3-ce27-416d-8b34-e64f8c272022","text":"Causal model of target system available","type":"PRECONDITION","layer":null,"category":null,"handle":"Causal model of target system available","gloss":null,"stub":null,"metadata":{}},{"id":"d5547c28-3bcd-4302-bafe-0f04c03205ad","text":"Initial state known","type":"PRECONDITION","layer":null,"category":null,"handle":"Initial state known","gloss":null,"stub":null,"metadata":{}},{"id":"c82b7c30-6489-4ef1-bad4-d47e58b78024","text":"Probabilistic outcome vector generated","type":"POSTCONDITION","layer":null,"category":null,"handle":"Probabilistic outcome vector generated","gloss":null,"stub":null,"metadata":{}},{"id":"CiteBack","text":"CiteBack#1af3","type":"PATTERN","layer":"Society","category":"Protocols","handle":"CiteBack#1af3","gloss":"Grounding claims in source","stub":"1af3","metadata":{"pattern":{"handle":"CiteBack","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 {{retrieval_augment}} lookup returning the source ID.","gloss":"Grounding claims in source","failure_modes":["Inability to answer implicit or common-sense questions."],"invariants":["Every assertion links to source ID","Source must exist in context history"],"preconditions":["Generated claim","Source material available"],"postconditions":["Claim decorated with citation"],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":1},"sema_id":"sema:CiteBack#mh:SHA-256:1af3fdb8c67f92cbc83400e269dc0c075d7cd1e77cf1b7f781e666b3752d5d28","sema_ref":"CiteBack#1af3","sema_stub":"1af3","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"ec00f093-9b60-4201-9acc-12ce68a5dc35","text":"Every assertion links to source ID","type":"INVARIANT","layer":null,"category":null,"handle":"Every assertion links to source ID","gloss":null,"stub":null,"metadata":{}},{"id":"ab9a1e9c-e755-48fb-be8e-78381f2b96d9","text":"Source must exist in context history","type":"INVARIANT","layer":null,"category":null,"handle":"Source must exist in context history","gloss":null,"stub":null,"metadata":{}},{"id":"44dafc22-2aa2-44f2-b5c6-53dc7470d38b","text":"Generated claim","type":"PRECONDITION","layer":null,"category":null,"handle":"Generated claim","gloss":null,"stub":null,"metadata":{}},{"id":"b7f7fec8-9b5d-45a5-87f4-4f5717fb5953","text":"Source material available","type":"PRECONDITION","layer":null,"category":null,"handle":"Source material available","gloss":null,"stub":null,"metadata":{}},{"id":"acc57c85-7653-41ea-864d-403e6f4b43ef","text":"Claim decorated with citation","type":"POSTCONDITION","layer":null,"category":null,"handle":"Claim decorated with citation","gloss":null,"stub":null,"metadata":{}},{"id":"DeepResearch","text":"DeepResearch#5b8b","type":"PATTERN","layer":"Society","category":"Protocols","handle":"DeepResearch#5b8b","gloss":"Plan-search-synthesize-report research pipeline","stub":"5b8b","metadata":{"pattern":{"handle":"DeepResearch","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}} - 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}} for breadth and {{retrieval_augment}} for depth, orchestrated by the {{deep}} primitive to ensure rigor.","gloss":"Plan-search-synthesize-report research pipeline","failure_modes":["Source {{cognitive_bias}}: Over-relying on first sources found.","{{synthesis}} Hallucination: Inventing connections not in sources.","Premature Closure: Stopping search before finding contradicting evidence."],"invariants":["Information synthesized from multiple disparate sources","Search depth > 1"],"preconditions":["Access to external knowledge base","Broad user query"],"postconditions":["Citations included","Comprehensive report generated"],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":2},"sema_id":"sema:DeepResearch#mh:SHA-256:5b8b36ccee0d571309ff7d7b8d31b30e4c1338bd7189d19950e2bc89083a2e7c","sema_ref":"DeepResearch#5b8b","sema_stub":"5b8b","sema_layer":"Society","sema_category":"Protocols","signature":["Deep(Discover)"]},"layer":"Society","category":"Protocols"}},{"id":"8dbb2a73-f09a-4a61-857c-38cba8a65566","text":"Information synthesized from multiple disparate sources","type":"INVARIANT","layer":null,"category":null,"handle":"Information synthesized from multiple disparate sources","gloss":null,"stub":null,"metadata":{}},{"id":"c1ae138c-889c-4138-b0ca-ae6c613d3ac8","text":"Search depth > 1","type":"INVARIANT","layer":null,"category":null,"handle":"Search depth > 1","gloss":null,"stub":null,"metadata":{}},{"id":"feac4f9e-a02f-4545-83e2-32463bc94a08","text":"Access to external knowledge base","type":"PRECONDITION","layer":null,"category":null,"handle":"Access to external knowledge base","gloss":null,"stub":null,"metadata":{}},{"id":"233e0c42-5999-4afa-aa35-06ff1da02808","text":"Broad user query","type":"PRECONDITION","layer":null,"category":null,"handle":"Broad user query","gloss":null,"stub":null,"metadata":{}},{"id":"89ab8eac-9a51-4cd3-bd42-9706e4704c71","text":"Citations included","type":"POSTCONDITION","layer":null,"category":null,"handle":"Citations included","gloss":null,"stub":null,"metadata":{}},{"id":"6fe2d40c-e766-4442-8bac-3327719e69ea","text":"Comprehensive report generated","type":"POSTCONDITION","layer":null,"category":null,"handle":"Comprehensive report generated","gloss":null,"stub":null,"metadata":{}},{"id":"AdversarialSteel","text":"AdversarialSteel#b88b","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"AdversarialSteel#b88b","gloss":"Dual-advocate verdict generation","stub":"b88b","metadata":{"pattern":{"handle":"AdversarialSteel","mechanism":"The {{meta}}-process for adversarial verification. Instead of a single judgment, the {{system}} 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}} {{agent}} renders the verdict only after reviewing both steelmanned arguments. It orchestrates {{steelman_check}} to generate the opposing arguments and employs {{compatibility_check}} to ensure the pro, con, and {{judge}} {{agent}}s share a precise definition of the {{criteria}} before debate begins.","gloss":"Dual-advocate verdict generation","failure_modes":["{{judge}} {{agent}} defaults to 'Both sides' compromise (Median Trap)."],"invariants":["Dual Representation: Verdict cannot be rendered without Pro + Con arguments","Steelmanning: Red Argument strength > Weakest Link of Proposal"],"_meta":{"tier":2,"layer":"Mind","category":"Strategy","ring":1},"sema_id":"sema:AdversarialSteel#mh:SHA-256:b88b0ef8e7b02a319a4d82042fe34981ad48d9c271e5105decd38f699ef4ed8e","sema_ref":"AdversarialSteel#b88b","sema_stub":"b88b","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"4d4ca36c-85f1-4af2-981d-6377f2f585d9","text":"Dual Representation: Verdict cannot be rendered without Pro + Con arguments","type":"INVARIANT","layer":null,"category":null,"handle":"Dual Representation: Verdict cannot be rendered without Pro + Con arguments","gloss":null,"stub":null,"metadata":{}},{"id":"527e3d3f-36cd-4b4d-b149-e642f7329591","text":"Steelmanning: Red Argument strength > Weakest Link of Proposal","type":"INVARIANT","layer":null,"category":null,"handle":"Steelmanning: Red Argument strength > Weakest Link of Proposal","gloss":null,"stub":null,"metadata":{}},{"id":"Contract","text":"Contract#e6de","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Contract#e6de","gloss":"Binding agreement between parties","stub":"e6de","metadata":{"pattern":{"handle":"Contract","data_schema":{"type":"object","required":["contract_id","parties","terms"],"properties":{"contract_id":{"type":"string","description":"Unique identifier for this contract"},"parties":{"type":"array","items":{"type":"string"},"description":"Identity IDs of all parties"},"terms":{"type":"array","items":{"type":"object"},"description":"Array of Condition objects defining obligations"},"signatures":{"type":"object","description":"Map of party ID to cryptographic signature"},"created_at":{"type":"string","format":"date-time","description":"When the contract was created"}}},"mechanism":"An immutable record of agreement between two or more {{identity}}s. It aggregates a set of {{condition}}s (terms) and obligations which all parties must {{sign}} to accept. Contracts serve as the binding {{context}} for disputes resolved by a {{judge}}.","gloss":"Binding agreement between parties","failure_modes":["Ambiguity: Terms are open to interpretation.","Unsigned: Not all parties have signed (invalid).","Void: Conditions violate higher-law constraints."],"invariants":["Consent: Must be signed by all named parties.","Immutability: Terms cannot change after signing.","Enforceability: Terms must be verifiable by a third party."],"_meta":{"tier":1,"layer":"Infrastructure","category":"Data Structures","ring":1},"sema_id":"sema:Contract#mh:SHA-256:e6deb3453c6a4aa33bbff9a0bccda07397c04b769634b369c7df7c758bd1ba3e","sema_ref":"Contract#e6de","sema_stub":"e6de","sema_layer":"Infrastructure","sema_category":"Data Structures"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"dfb6f752-8b14-4b1a-9b6b-c692e5f83608","text":"Consent: Must be signed by all named parties.","type":"INVARIANT","layer":null,"category":null,"handle":"Consent: Must be signed by all named parties.","gloss":null,"stub":null,"metadata":{}},{"id":"bdc6ee6d-e34c-4e48-9419-a6c04cc47788","text":"Immutability: Terms cannot change after signing.","type":"INVARIANT","layer":null,"category":null,"handle":"Immutability: Terms cannot change after signing.","gloss":null,"stub":null,"metadata":{}},{"id":"355fff94-2426-4251-adc0-bcfd8067677a","text":"Enforceability: Terms must be verifiable by a third party.","type":"INVARIANT","layer":null,"category":null,"handle":"Enforceability: Terms must be verifiable by a third party.","gloss":null,"stub":null,"metadata":{}},{"id":"Expansive","text":"Expansive#ad2d","type":"PATTERN","layer":"Society","category":"Protocols","handle":"Expansive#ad2d","gloss":"Evaluates generalization potential","stub":"ad2d","metadata":{"pattern":{"handle":"Expansive","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}} of the potential {{value}} of a solution beyond its initial context.","invariants":["Transfer: Must operate outside training distribution."],"signature":["Judge(Value)"],"_meta":{"layer":"Society","category":"Protocols","ring":2,"tier":1},"sema_id":"sema:Expansive#mh:SHA-256:ad2d13d8dd381d371d93239e0b1c63176aa1126bbc96fc52ce12f392c10dbaf2","sema_ref":"Expansive#ad2d","sema_stub":"ad2d","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"0b1f1248-09af-4b99-9246-9d83c144d61b","text":"Transfer: Must operate outside training distribution.","type":"INVARIANT","layer":null,"category":null,"handle":"Transfer: Must operate outside training distribution.","gloss":null,"stub":null,"metadata":{}},{"id":"HindsightBlock","text":"HindsightBlock#be41","type":"PATTERN","layer":"Mind","category":"Inference","handle":"HindsightBlock#be41","gloss":"Preventing results-oriented thinking","stub":"be41","metadata":{"pattern":{"handle":"HindsightBlock","mechanism":"{{decision}}-Time Evaluation: When evaluating past decision, reconstruct information available AT DECISION TIME. {{judge}} 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 {{pre_mortem}} logic after the fact, reconstructing the ex-ante probability space to judge decision quality independent of outcome.","gloss":"Preventing results-oriented thinking","failure_modes":["{{outcome}} Blindness: Ignoring outcomes entirely prevents learning from black swans or model errors."],"invariants":["No Revision: Log is immutable","Prior Commitment: Prediction(T) must be cryptographically committed before {{outcome}}(T+delta)"],"preconditions":["Prediction registry active"],"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"}],"_meta":{"tier":1,"layer":"Mind","category":"Inference","ring":0},"sema_id":"sema:HindsightBlock#mh:SHA-256:be410c26fbe672bee226f7c5656faea456646fd9f776193d1e5bbc7ecb9f94df","sema_ref":"HindsightBlock#be41","sema_stub":"be41","sema_layer":"Mind","sema_category":"Inference"},"layer":"Mind","category":"Inference"}},{"id":"79c34fae-0af0-43c1-bf3e-aad2ff6e5da5","text":"Prior Commitment: Prediction(T) must be cryptographically committed before {{outcome}}(T+delta)","type":"INVARIANT","layer":null,"category":null,"handle":"Prior Commitment: Prediction(T) must be cryptographically committed before {{outcome}}(T+delta)","gloss":null,"stub":null,"metadata":{}},{"id":"11353179-e236-418d-b406-6df80f04555b","text":"Prediction registry active","type":"PRECONDITION","layer":null,"category":null,"handle":"Prediction registry active","gloss":null,"stub":null,"metadata":{}},{"id":"HydraConstitution","text":"HydraConstitution#802e","type":"PATTERN","layer":"Society","category":"Governance","handle":"HydraConstitution#802e","gloss":"Governance that hardens through failed attacks","stub":"802e","metadata":{"pattern":{"handle":"HydraConstitution","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}} failure to trigger the immune response, codifying the rejected attack vector into a new law.","gloss":"Governance that hardens through failed attacks","failure_modes":["Ossification (the system accumulates so many immunities that it becomes unable to pass legitimate, necessary changes)."],"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"],"preconditions":["Proposal P rejected by {{quorum}} or {{judge}}"],"postconditions":["Constitution patched with new immunity"],"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"}],"_meta":{"tier":1,"layer":"Society","category":"Governance","related":["sema:AmendLaws#mh:SHA-256:e271d75e7f074b58f5473bae1c82cb40193408957a8a241f40ffe90ac2159503","sema:AntifragileInversion#mh:SHA-256:cd5965511f8f1307e62fa6c292f491bed19ddabbdf9e2ace9e91cf9f7fca3071"],"ring":1},"sema_id":"sema:HydraConstitution#mh:SHA-256:802e139f1e76d021df2681dfce2fb38a1a9eb789534d1eb68bf7ad6185a1687d","sema_ref":"HydraConstitution#802e","sema_stub":"802e","sema_layer":"Society","sema_category":"Governance"},"layer":"Society","category":"Governance"}},{"id":"33cc9137-1188-4787-908f-f08ac123fe67","text":"Antifragile Hardening: Cost(Attack N+1) > Cost(Attack N)","type":"INVARIANT","layer":null,"category":null,"handle":"Antifragile Hardening: Cost(Attack N+1) > Cost(Attack N)","gloss":null,"stub":null,"metadata":{}},{"id":"52a6be24-8ac9-44a3-8bea-30d7ed8b1d71","text":"Immunization: Reject(Proposal P) -> Commit(Invariant Not(Structure(P)))","type":"INVARIANT","layer":null,"category":null,"handle":"Immunization: Reject(Proposal P) -> Commit(Invariant Not(Structure(P)))","gloss":null,"stub":null,"metadata":{}},{"id":"59a8188c-371d-40e7-8d99-b26dc7479ec0","text":"Monotonic Safety: The set of forbidden transitions can only grow","type":"INVARIANT","layer":null,"category":null,"handle":"Monotonic Safety: The set of forbidden transitions can only grow","gloss":null,"stub":null,"metadata":{}},{"id":"91d7899a-3ff2-4034-914b-121fc9e20cbc","text":"Proposal P rejected by {{quorum}} or {{judge}}","type":"PRECONDITION","layer":null,"category":null,"handle":"Proposal P rejected by {{quorum}} or {{judge}}","gloss":null,"stub":null,"metadata":{}},{"id":"3001c8bd-e749-463f-b213-51282621f0f3","text":"Constitution patched with new immunity","type":"POSTCONDITION","layer":null,"category":null,"handle":"Constitution patched with new immunity","gloss":null,"stub":null,"metadata":{}},{"id":"NormativeJudge","text":"NormativeJudge#a214","type":"PATTERN","layer":"Mind","category":"Inference","handle":"NormativeJudge#a214","gloss":"Value-based state evaluation","stub":"a214","metadata":{"pattern":{"handle":"NormativeJudge","mechanism":"A purely normative {{judge}} module that evaluates static world-states against a weighted {{value}} function. To mitigate Goodhart's Law, this pattern should be deployed as an ENSEMBLE (Jury), where multiple judges with slightly perturbed {{value}} constitutions reach {{quorum}} on the {{outcome}}. It aggregates {{value}}s via {{perspective_ensemble}}, optionally escalating to {{human_approve}} for ambiguous edge cases.","gloss":"Value-based state evaluation","failure_modes":["Goodhart's Law (optimizing for the metric, not the intent).","Collusion between Proposer and {{judge}}."],"invariants":["Explicit Weights: Trade-offs between values must be logged","{{outcome}} Focus: Evaluation is f({{state}}), not f(Action)"],"preconditions":["{{state}} S_prime is descriptively complete"],"postconditions":["Normative verdict rendered"],"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"}],"_meta":{"tier":1,"layer":"Mind","category":"Inference","ring":0},"sema_id":"sema:NormativeJudge#mh:SHA-256:a2149e83b35ba7b071c1ddefc6010cf690587066178239c888fe4b0348220593","sema_ref":"NormativeJudge#a214","sema_stub":"a214","sema_layer":"Mind","sema_category":"Inference","signature":["Judge(Value)"]},"layer":"Mind","category":"Inference"}},{"id":"6d0290d2-12bc-4a1f-b0d0-d574ffec8d80","text":"Explicit Weights: Trade-offs between values must be logged","type":"INVARIANT","layer":null,"category":null,"handle":"Explicit Weights: Trade-offs between values must be logged","gloss":null,"stub":null,"metadata":{}},{"id":"f752c01a-b015-4494-8aec-6712da51448a","text":"{{outcome}} Focus: Evaluation is f({{state}}), not f(Action)","type":"INVARIANT","layer":null,"category":null,"handle":"{{outcome}} Focus: Evaluation is f({{state}}), not f(Action)","gloss":null,"stub":null,"metadata":{}},{"id":"4091785f-b68a-44b3-b52e-5dd0854c871e","text":"{{state}} S_prime is descriptively complete","type":"PRECONDITION","layer":null,"category":null,"handle":"{{state}} S_prime is descriptively complete","gloss":null,"stub":null,"metadata":{}},{"id":"d4f3ad42-2c11-4c13-b688-ebdf135287d1","text":"Normative verdict rendered","type":"POSTCONDITION","layer":null,"category":null,"handle":"Normative verdict rendered","gloss":null,"stub":null,"metadata":{}},{"id":"Novelty","text":"Novelty#2218","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"Novelty#2218","gloss":"Evaluates structural distinctness","stub":"2218","metadata":{"pattern":{"handle":"Novelty","mechanism":"Acts as a {{judge}} to evaluate structural distinctness and {{value}} 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."],"signature":["Judge(Value)"],"gloss":"Evaluates structural distinctness","_meta":{"layer":"Mind","category":"Strategy","ring":2,"tier":1},"sema_id":"sema:Novelty#mh:SHA-256:2218bd2b82619a01d35eb54e4160c5975abf23e46c3611a85db5442537dad3f5","sema_ref":"Novelty#2218","sema_stub":"2218","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"1d4f041c-7e7a-4e2c-97cd-61f170d75dc1","text":"Orthogonality: High novelty requires low embedding similarity to nearest neighbor.","type":"INVARIANT","layer":null,"category":null,"handle":"Orthogonality: High novelty requires low embedding similarity to nearest neighbor.","gloss":null,"stub":null,"metadata":{}},{"id":"Parsimony","text":"Parsimony#2578","type":"PATTERN","layer":"Mind","category":"Reasoning","handle":"Parsimony#2578","gloss":"Complexity justification via Occams Razor","stub":"2578","metadata":{"pattern":{"handle":"Parsimony","mechanism":"Acts as a {{judge}} to evaluate {{topology}} 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}}ion.","invariants":["Necessity: Every component must have a causal link to the outcome."],"signature":["Judge(Topology)"],"_meta":{"layer":"Mind","category":"Reasoning","ring":2,"tier":1},"sema_id":"sema:Parsimony#mh:SHA-256:25788dab06b998f95e0447259c9f29c331216ed523b24c4311083af2d53509f0","sema_ref":"Parsimony#2578","sema_stub":"2578","sema_layer":"Mind","sema_category":"Reasoning","gloss":"Complexity justification via Occams Razor"},"layer":"Mind","category":"Reasoning"}},{"id":"7253a8da-5f7c-4f93-b370-ac4b3c082b9c","text":"Necessity: Every component must have a causal link to the outcome.","type":"INVARIANT","layer":null,"category":null,"handle":"Necessity: Every component must have a causal link to the outcome.","gloss":null,"stub":null,"metadata":{}},{"id":"Realizable","text":"Realizable#199e","type":"PATTERN","layer":"Society","category":"Protocols","handle":"Realizable#199e","gloss":"Evaluates execution feasibility of a plan","stub":"199e","metadata":{"pattern":{"handle":"Realizable","gloss":"Evaluates execution feasibility of a plan","mechanism":"Acts as a {{judge}} to evaluate the {{value}} and feasibility of a {{plan}}. Classifies the execution path into three qualitative states: (1) Magical: Relies on undefined {{step}}s or unavailable physics. (2) Uncertain: The dependency chain is clear, but specific links are unverified. (3) Coherent: Every {{step}} maps to a known primitive or realizable sub-component.","signature":["Judge(Value)"],"invariants":["Causality: No step can precede its dependencies.","Grounding: All leaf nodes must terminate in known primitives."],"failure_modes":["Hidden Complexity: A step looks simple ('Draw the rest of the owl') but contains unsolved sub-problems.","Resource Blindness: The steps are logically sound but physically impossible given the budget."],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":2},"sema_ref":"Realizable#199e","sema_id":"sema:Realizable#mh:SHA-256:199e1de94d8abb8ff3786e1b025039b64517443d26680699b9bd4f7e8cf9baf2","sema_stub":"199e","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"56a20f67-4b69-433d-8cb2-a8e19745b92b","text":"Grounding: All leaf nodes must terminate in known primitives.","type":"INVARIANT","layer":null,"category":null,"handle":"Grounding: All leaf nodes must terminate in known primitives.","gloss":null,"stub":null,"metadata":{}},{"id":"ScoringFunction","text":"ScoringFunction#f5c9","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"ScoringFunction#f5c9","gloss":"Deterministic valuation logic","stub":"f5c9","metadata":{"pattern":{"handle":"ScoringFunction","data_schema":{"type":"object","required":["function_id","input_type","output_range"],"properties":{"function_id":{"type":"string","description":"Unique identifier for this scoring function"},"input_type":{"type":"string","description":"Expected input schema or type"},"output_range":{"type":"object","properties":{"min":{"type":"number"},"max":{"type":"number"}},"description":"Valid output range"},"logic":{"type":"string","description":"Description or reference to scoring logic"}}},"mechanism":"A deterministic logical unit that maps an input artifact to a scalar {{value}} (Score). It encapsulates the criteria used by {{rank}} and {{judge}}.","gloss":"Deterministic valuation logic","invariants":["Determinism: Same input always yields same score.","Range: Output must be within [0.0, 1.0] or [-inf, +inf]."],"sema_id":"sema:ScoringFunction#mh:SHA-256:f5c93a2bbddd826a3faa0d9edb75db2e73841424936fafb0d50316d547ee73c2","sema_ref":"ScoringFunction#f5c9","sema_stub":"f5c9","_meta":{"layer":"Infrastructure","category":"Data Structures","ring":1,"tier":1},"sema_layer":"Infrastructure","sema_category":"Data Structures"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"b9fdec84-c6cd-4094-b3a2-5bf16d2e7832","text":"Range: Output must be within [0.0, 1.0] or [-inf, +inf].","type":"INVARIANT","layer":null,"category":null,"handle":"Range: Output must be within [0.0, 1.0] or [-inf, +inf].","gloss":null,"stub":null,"metadata":{}},{"id":"TriGate","text":"TriGate#a30f","type":"PATTERN","layer":"Society","category":"Governance","handle":"TriGate#a30f","gloss":"Generic Red/Yellow/Green flow control","stub":"a30f","metadata":{"pattern":{"handle":"TriGate","mechanism":"A generic {{gate}} traffic-light enforcement primitive. Wraps a {{judge}} or {{condition}} that returns a Trinary status (Red/Yellow/Green). Enforces standard flow control: Red -> CLOSE (Halt execution). Yellow -> DEBT (Proceed with obligation recorded to {{ledger}}). Green -> OPEN (Proceed).","gloss":"Generic Red/Yellow/Green flow control","invariants":["Fail-Closed: Red triggers immediate halt.","Debt Awareness: Yellow must append a remediation item to the context and record obligation in Ledger."],"signature":["Gate(Judge)"],"_meta":{"layer":"Society","category":"Governance","ring":0,"tier":1},"sema_ref":"TriGate#a30f","sema_id":"sema:TriGate#mh:SHA-256:a30fece9632e91a1089f646c9bd11a648fdd6264edd95aad7f81981090672d2c","sema_stub":"a30f","sema_layer":"Society","sema_category":"Governance"},"layer":"Society","category":"Governance"}},{"id":"15c36368-4780-4474-bd68-b087acc23442","text":"Fail-Closed: Red triggers immediate halt.","type":"INVARIANT","layer":null,"category":null,"handle":"Fail-Closed: Red triggers immediate halt.","gloss":null,"stub":null,"metadata":{}},{"id":"6d152219-a35d-4fb4-86de-df1b78f9dda4","text":"Debt Awareness: Yellow must append a remediation item to the context and record obligation in Ledger.","type":"INVARIANT","layer":null,"category":null,"handle":"Debt Awareness: Yellow must append a remediation item to the context and record obligation in Ledger.","gloss":null,"stub":null,"metadata":{}},{"id":"SurprisalUpdate","text":"SurprisalUpdate#61cd","type":"PATTERN","layer":"Mind","category":"Inference","handle":"SurprisalUpdate#61cd","gloss":"Learning weighted by prediction failure magnitude","stub":"61cd","metadata":{"pattern":{"handle":"SurprisalUpdate","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 {{regime_sense}}, {{epistemic_roi}}.","gloss":"Learning weighted by prediction failure magnitude","failure_modes":["Outlier Overfitting: Rare high-surprisal events dominating learning.","Catastrophic Forgetting: Aggressive updates erasing previously stable knowledge.","Compute Cost: High-surprisal events require expensive gradient updates."],"invariants":["Loss Magnitude: Update size proportional to surprisal (-log P)","Stability Guard: No single update may shift model more than max_update_rate"],"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"],"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"}],"_meta":{"tier":1,"layer":"Mind","category":"Inference","related":["sema:BayesUpdate#mh:SHA-256:a762656f3df6a4b6322a6da1ae14f3093e675cba380bb5e488f397863f3e8b0a"],"ring":2},"sema_id":"sema:SurprisalUpdate#mh:SHA-256:61cd0ab834517c8243a95fad2ac455e0693cc1ef8982c5837a6f15f8faa88c28","sema_ref":"SurprisalUpdate#61cd","sema_stub":"61cd","sema_layer":"Mind","sema_category":"Inference"},"layer":"Mind","category":"Inference"}},{"id":"8a1140ab-5b0f-4fe3-a1c7-654eea01454f","text":"Loss Magnitude: Update size proportional to surprisal (-log P)","type":"INVARIANT","layer":null,"category":null,"handle":"Loss Magnitude: Update size proportional to surprisal (-log P)","gloss":null,"stub":null,"metadata":{}},{"id":"98cce711-c2bf-499b-b2af-a4e86b20e1bd","text":"Stability Guard: No single update may shift model more than max_update_rate","type":"INVARIANT","layer":null,"category":null,"handle":"Stability Guard: No single update may shift model more than max_update_rate","gloss":null,"stub":null,"metadata":{}},{"id":"b6f686d0-f915-4b8c-842c-81686f90fd7d","text":"Actual outcome observed and diverged from prediction","type":"PRECONDITION","layer":null,"category":null,"handle":"Actual outcome observed and diverged from prediction","gloss":null,"stub":null,"metadata":{}},{"id":"92263344-e246-4a69-9c8d-cc042641f4fc","text":"Prediction was made with computable probability","type":"PRECONDITION","layer":null,"category":null,"handle":"Prediction was made with computable probability","gloss":null,"stub":null,"metadata":{}},{"id":"9e267505-890c-4db5-97e5-c097433b5539","text":"Model updated proportional to surprisal","type":"POSTCONDITION","layer":null,"category":null,"handle":"Model updated proportional to surprisal","gloss":null,"stub":null,"metadata":{}},{"id":"f1f2daaa-5e9d-4dfc-8d24-f0182038ebda","text":"Update logged for audit trail","type":"POSTCONDITION","layer":null,"category":null,"handle":"Update logged for audit trail","gloss":null,"stub":null,"metadata":{}},{"id":"TensionHold","text":"TensionHold#3496","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"TensionHold#3496","gloss":"Maintain contradictions without premature resolution","stub":"3496","metadata":{"pattern":{"handle":"TensionHold","mechanism":"Cognitive Suspension protocol. When two high-confidence inputs conflict (A ⊥ B), the {{agent}} instantiates a {{tension}} object that binds them together. This blocks downstream decision-making until a reconciling insight (Pattern C) is found via {{dialectic}} or {{synthesis}}.","gloss":"Maintain contradictions without premature resolution","failure_modes":["Premature Convergence: {{agent}} resolves {{tension}} by arbitrarily discarding one side to reduce cognitive load.","Tension Blindness: {{agent}} treats a contradiction as a simple error/hallucination and ignores it.","Analysis Paralysis: Accumulating {{tension}} objects without ever triggering {{dialectic}} resolution."],"invariants":["No Selection: Output cannot be simply 'A' or 'B' (must be {{tension}}{A,B}).","Persistence: {{tension}} object remains active until explicitly resolved via {{synthesis}} or Falsification."],"preconditions":["Mutually exclusive valid inputs identified","Resolution threshold not met"],"postconditions":["Execution flow diverted to Information Retrieval (to break the tie)","{{tension}} object created in Graph"],"_meta":{"tier":2,"layer":"Mind","category":"Strategy","ring":2},"sema_id":"sema:TensionHold#mh:SHA-256:3496a834ef59ae72725054b262f7844a7551f9c917348b95e704b84e0265a558","sema_ref":"TensionHold#3496","sema_stub":"3496","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"805d0a36-c244-4cf8-b1d4-9ec2475f551d","text":"No Selection: Output cannot be simply 'A' or 'B' (must be {{tension}}{A,B}).","type":"INVARIANT","layer":null,"category":null,"handle":"No Selection: Output cannot be simply 'A' or 'B' (must be {{tension}}{A,B}).","gloss":null,"stub":null,"metadata":{}},{"id":"a8b834a1-503d-4bdf-8317-6b857513ac8e","text":"Persistence: {{tension}} object remains active until explicitly resolved via {{synthesis}} or Falsification.","type":"INVARIANT","layer":null,"category":null,"handle":"Persistence: {{tension}} object remains active until explicitly resolved via {{synthesis}} or Falsification.","gloss":null,"stub":null,"metadata":{}},{"id":"b253400d-f0e1-4962-a9fe-3d220a835393","text":"Mutually exclusive valid inputs identified","type":"PRECONDITION","layer":null,"category":null,"handle":"Mutually exclusive valid inputs identified","gloss":null,"stub":null,"metadata":{}},{"id":"e11a2114-eb54-400d-ac37-9561e59686b9","text":"Resolution threshold not met","type":"PRECONDITION","layer":null,"category":null,"handle":"Resolution threshold not met","gloss":null,"stub":null,"metadata":{}},{"id":"c049253b-1ae3-4d82-8c42-88788e6366a3","text":"Execution flow diverted to Information Retrieval (to break the tie)","type":"POSTCONDITION","layer":null,"category":null,"handle":"Execution flow diverted to Information Retrieval (to break the tie)","gloss":null,"stub":null,"metadata":{}},{"id":"cc05d64a-2164-428f-9f4b-fe2474e8ff12","text":"{{tension}} object created in Graph","type":"POSTCONDITION","layer":null,"category":null,"handle":"{{tension}} object created in Graph","gloss":null,"stub":null,"metadata":{}},{"id":"Disband","text":"Disband#8934","type":"PATTERN","layer":"Society","category":"Governance","handle":"Disband#8934","gloss":"Enable clean group termination with proper state handling","stub":"8934","metadata":{"pattern":{"handle":"Disband","mechanism":"Graceful group dissolution with state disposition and clean termination. {{agent}} sends 'DISBAND' signal. For scope='member': notify remaining members, adjust shared state, check {{quorum}}. For scope='group': broadcast 'DISSOLVING', execute state disposition, release shared resources, and record dissolution with a group {{snapshot}} for potential re-formation. All members must ACK dissolution. It safely terminates the group, optionally triggering {{ejection_seat}} for any members refusing to release shared resources.","gloss":"Enable clean group termination with proper state handling","failure_modes":["Member doesn't ACK (dissolution blocked—timeout or proceed anyway?).","{{state}} disposition fails (can't archive, transfer target unavailable).","Contested dissolution (some members want to continue—may need VOTE).","Premature dissolution (task not actually complete).","Zombie group (DISBAND sent but not all resources actually released).","Partial dissolution cascades unexpectedly (one departure triggers full dissolution via quorum loss)."],"invariants":["All shared resources released","No lingering commitments"],"preconditions":["Active group/swarm","Mission complete or aborted"],"postconditions":["Agents return to free pool"],"_meta":{"tier":1,"layer":"Society","category":"Governance","ring":1},"sema_id":"sema:Disband#mh:SHA-256:89348c638b3f33296f02c557bb5d357349f7879a6ea7f2dd90f7096102685765","sema_ref":"Disband#8934","sema_stub":"8934","sema_layer":"Society","sema_category":"Governance"},"layer":"Society","category":"Governance"}},{"id":"7013355f-b275-4d3e-99f3-7e6346115442","text":"All shared resources released","type":"INVARIANT","layer":null,"category":null,"handle":"All shared resources released","gloss":null,"stub":null,"metadata":{}},{"id":"f870e8ac-8935-4ed8-8f35-ea8f62a7b234","text":"No lingering commitments","type":"INVARIANT","layer":null,"category":null,"handle":"No lingering commitments","gloss":null,"stub":null,"metadata":{}},{"id":"b3b5aa72-2e4e-42f1-bbe1-7bf3559a34c7","text":"Active group/swarm","type":"PRECONDITION","layer":null,"category":null,"handle":"Active group/swarm","gloss":null,"stub":null,"metadata":{}},{"id":"ec081750-5e86-4620-88ec-a31370411658","text":"Mission complete or aborted","type":"PRECONDITION","layer":null,"category":null,"handle":"Mission complete or aborted","gloss":null,"stub":null,"metadata":{}},{"id":"105f8f6b-40d6-4077-b0b5-685c6755c575","text":"Agents return to free pool","type":"POSTCONDITION","layer":null,"category":null,"handle":"Agents return to free pool","gloss":null,"stub":null,"metadata":{}},{"id":"HackDetect","text":"HackDetect#0846","type":"PATTERN","layer":"Society","category":"Protocols","handle":"HackDetect#0846","gloss":"Detect shortcuts that break downstream invariants","stub":"0846","metadata":{"pattern":{"handle":"HackDetect","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 {{input_guard}} layer for anomalies, triggering {{ejection_seat}} if the agent attempts to bypass invariants via code patching.","gloss":"Detect shortcuts that break downstream invariants","failure_modes":["False Positives: Legitimate adapter changes flagged as hacks.","Hack Blindness: Novel hack patterns evade detection.","Justification Theater: {{agent}} rationalizes hack as 'pragmatic'."],"invariants":["Detection triggers defensive response","False positive rate minimized"],"preconditions":["Attack signatures/anomaly detection","{{system}} monitoring"],"postconditions":["Alert raised","Intrusion identified"],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":0},"sema_id":"sema:HackDetect#mh:SHA-256:0846cad7015e648b050b08d13f2e036c99d8afbcdfa0492747bae6d62d0ebf37","sema_ref":"HackDetect#0846","sema_stub":"0846","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"de3cd560-2c9b-45e2-bcad-7fd40f2d3082","text":"Detection triggers defensive response","type":"INVARIANT","layer":null,"category":null,"handle":"Detection triggers defensive response","gloss":null,"stub":null,"metadata":{}},{"id":"648b4199-e07a-4958-bfd5-a5b23a86d2e5","text":"False positive rate minimized","type":"INVARIANT","layer":null,"category":null,"handle":"False positive rate minimized","gloss":null,"stub":null,"metadata":{}},{"id":"ee79189f-b40d-4b00-836c-5b068603b412","text":"Attack signatures/anomaly detection","type":"PRECONDITION","layer":null,"category":null,"handle":"Attack signatures/anomaly detection","gloss":null,"stub":null,"metadata":{}},{"id":"17b19ab1-f861-43cb-9f3c-9e0e99a2b0e6","text":"Alert raised","type":"POSTCONDITION","layer":null,"category":null,"handle":"Alert raised","gloss":null,"stub":null,"metadata":{}},{"id":"a7075ee7-8f03-422e-941f-1c554b1b044a","text":"Intrusion identified","type":"POSTCONDITION","layer":null,"category":null,"handle":"Intrusion identified","gloss":null,"stub":null,"metadata":{}},{"id":"Rollout","text":"Rollout#d742","type":"PATTERN","layer":"Society","category":"Protocols","handle":"Rollout#d742","gloss":"Safe, reversible deployment with circuit breaking and emergency ejection","stub":"d742","metadata":{"pattern":{"handle":"Rollout","mechanism":"Performs the {{act}} of deployment by extracting the {{spec}} from the {{execution_manifest}} and using {{build}} to produce the artifact, executing it inside a {{circuit_breaker}} envelope. It deploys a {{canary}} first. If the breaker trips or the {{ejection_seat}} is triggered, it immediately invokes {{compensate}} to revert the {{system}} {{state}}.","gloss":"Safe, reversible deployment with circuit breaking and emergency ejection","failure_modes":["Big Bang Failure: Releasing to 100% of users without {{canary}} checks.","Compensate Failure: {{compensate}} fails to clean up (Dirty Rollback).","Config Drift: Deployed {{state}} differs from {{manifest_planning}}."],"invariants":["{{world_reversible}}: Deployment must be reversible via {{compensate}}.","Unblockable: {{ejection_seat}} override must be respected."],"preconditions":["{{execution_manifest}} approved","{{circuit_breaker}} is CLOSED (Healthy)"],"postconditions":["{{rollout_manifest}} created","{{monitor_report}} generated"],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":1,"related":["BlueGreen"]},"sema_id":"sema:Rollout#mh:SHA-256:d7420d9c37fb35ab8880189864c63dd1e09fa1371f0e65d65df8d00cc75ebf23","sema_ref":"Rollout#d742","sema_stub":"d742","sema_layer":"Society","sema_category":"Protocols","signature":["Act(ExecutionManifest)"]},"layer":"Society","category":"Protocols"}},{"id":"b647eca5-8151-4e82-a157-ef82c85b380b","text":"{{world_reversible}}: Deployment must be reversible via {{compensate}}.","type":"INVARIANT","layer":null,"category":null,"handle":"{{world_reversible}}: Deployment must be reversible via {{compensate}}.","gloss":null,"stub":null,"metadata":{}},{"id":"d8390aca-2b3b-4349-a99d-a1eb9bf41654","text":"Unblockable: {{ejection_seat}} override must be respected.","type":"INVARIANT","layer":null,"category":null,"handle":"Unblockable: {{ejection_seat}} override must be respected.","gloss":null,"stub":null,"metadata":{}},{"id":"d92d2616-43a1-41c0-af51-79eb2c5ad829","text":"{{execution_manifest}} approved","type":"PRECONDITION","layer":null,"category":null,"handle":"{{execution_manifest}} approved","gloss":null,"stub":null,"metadata":{}},{"id":"72edf949-7b49-4b0a-83ce-48bf74c14532","text":"{{circuit_breaker}} is CLOSED (Healthy)","type":"PRECONDITION","layer":null,"category":null,"handle":"{{circuit_breaker}} is CLOSED (Healthy)","gloss":null,"stub":null,"metadata":{}},{"id":"dc8cffcd-f00d-4eef-b561-710ba2476dd3","text":"{{rollout_manifest}} created","type":"POSTCONDITION","layer":null,"category":null,"handle":"{{rollout_manifest}} created","gloss":null,"stub":null,"metadata":{}},{"id":"457ab613-37cf-4a81-8782-5ec5bf23ecfa","text":"{{monitor_report}} generated","type":"POSTCONDITION","layer":null,"category":null,"handle":"{{monitor_report}} generated","gloss":null,"stub":null,"metadata":{}},{"id":"ContingencyPlan","text":"ContingencyPlan#127a","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"ContingencyPlan#127a","gloss":"Pre-computed responses to critical failure","stub":"127a","metadata":{"pattern":{"handle":"ContingencyPlan","mechanism":"If-Then Preparation: For each critical assumption in a {{plan}}, 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}} without deliberation under stress. It pre-defines the logic that {{retry}} or recovery mechanisms should execute upon specific trigger conditions.","gloss":"Pre-computed responses to critical failure","failure_modes":["Maginot Line: Planning for the wrong disaster while ignoring the actual threat model."],"invariants":["Resources reserved for contingency","Trigger condition is disjoint from main plan success"],"preconditions":["Identified failure modes","Primary plan"],"postconditions":["Backup path defined and viable"],"_meta":{"tier":1,"layer":"Mind","category":"Strategy","ring":2},"sema_id":"sema:ContingencyPlan#mh:SHA-256:127a678449606e8c140b57e10beff0284dfc59d775ce77db8213bc3a92e7d780","sema_ref":"ContingencyPlan#127a","sema_stub":"127a","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"a564db7d-5bf7-41e6-b6c0-1e07af7d0792","text":"Resources reserved for contingency","type":"INVARIANT","layer":null,"category":null,"handle":"Resources reserved for contingency","gloss":null,"stub":null,"metadata":{}},{"id":"27d25c25-4980-4d53-8afe-9045090274fd","text":"Trigger condition is disjoint from main plan success","type":"INVARIANT","layer":null,"category":null,"handle":"Trigger condition is disjoint from main plan success","gloss":null,"stub":null,"metadata":{}},{"id":"613612f5-3d10-4698-9e97-bfafc77b237c","text":"Identified failure modes","type":"PRECONDITION","layer":null,"category":null,"handle":"Identified failure modes","gloss":null,"stub":null,"metadata":{}},{"id":"22ec757f-bdf2-4f3e-9c6d-6e19d39f2bc7","text":"Primary plan","type":"PRECONDITION","layer":null,"category":null,"handle":"Primary plan","gloss":null,"stub":null,"metadata":{}},{"id":"1be18f82-a263-4a24-8096-ba19519d1aa7","text":"Backup path defined and viable","type":"POSTCONDITION","layer":null,"category":null,"handle":"Backup path defined and viable","gloss":null,"stub":null,"metadata":{}},{"id":"PromptChain","text":"PromptChain#be30","type":"PATTERN","layer":"Society","category":"Protocols","handle":"PromptChain#be30","gloss":"Sequential LLM calls with validation gates","stub":"be30","metadata":{"pattern":{"handle":"PromptChain","mechanism":"Decomposes a {{task}} into a fixed {{sequence}} of LLM calls. Each step's output is validated against an {{accept_spec}} before being passed to the next. Trades latency for accuracy by linearizing thought. It orchestrates a sequence of {{tool_invoke}} calls, wrapping each step with {{input_guard}} validation and {{retry}} logic.","gloss":"Sequential LLM calls with validation gates","failure_modes":["Error Propagation: Step N failure corrupts N+1.","{{gate}} Brittleness: Valid intermediate outputs rejected by strict regex."],"invariants":["Halt on Error: {{chain}} aborts if {{gate}}(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"}],"_meta":{"tier":2,"layer":"Society","category":"Protocols","ring":0},"sema_layer":"Society","sema_category":"Protocols","sema_id":"sema:PromptChain#mh:SHA-256:be305ccb72fe325e21e0cc5725e4569f9d1f37e8b713f6b9a242ca448751dade","sema_ref":"PromptChain#be30","sema_stub":"be30"},"layer":"Society","category":"Protocols"}},{"id":"66be9970-45e0-4f16-9386-837edddd48fb","text":"Halt on Error: {{chain}} aborts if {{gate}}(N) returns False.","type":"INVARIANT","layer":null,"category":null,"handle":"Halt on Error: {{chain}} aborts if {{gate}}(N) returns False.","gloss":null,"stub":null,"metadata":{}},{"id":"db390675-a38a-4e78-8fcf-3b4481b1f656","text":"Schema Continuity: Output(N) must satisfy InputSchema(N+1).","type":"INVARIANT","layer":null,"category":null,"handle":"Schema Continuity: Output(N) must satisfy InputSchema(N+1).","gloss":null,"stub":null,"metadata":{}},{"id":"Delegate","text":"Delegate#7dce","type":"PATTERN","layer":"Society","category":"Governance","handle":"Delegate#7dce","gloss":"Enable structured work distribution with accountability","stub":"7dce","metadata":{"pattern":{"handle":"Delegate","mechanism":"{{work}} distribution protocol with acceptance, tracking, and failure handling. Delegator sends 'DELEGATE' message. Delegatee responds 'ACCEPT' or 'REFUSE'. On accept, delegatee owns {{task}} and sends 'PROGRESS' via {{heartbeat}}. On completion, delegator receives result. On failure, delegatee sends {{break}}—delegator decides: reassign, retry, or escalate. Broadcast delegation creates auction or uses {{mirror_stake}} for collateral. It employs {{probe}} to verify capabilities. Inherits {{holographic_shard}}.","gloss":"Enable structured work distribution with accountability","failure_modes":["No one accepts (all refuse or auction has no takers—task orphaned).","Capability mismatch (assigned to incapable agent—fails late).","Delegatee disappears (no progress updates—need timeout).","Circular delegation (A→B→A—detect and reject).","Overload (one agent accepts everything—need load awareness).","Progress lies (reports complete when not—need verification).","Dependency deadlock (A waits for B waits for A)."],"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}} to delegator). Dependencies enforced (task blocked until dependencies complete). One owner per task (no ambiguous responsibility)."],"preconditions":["Principal has authority. Delegate capable. Scope of delegation defined."],"postconditions":["Delegate acts within scope. Principal notified of actions. Revocation possible."],"_meta":{"tier":2,"layer":"Society","category":"Governance","related":["Handoff"],"ring":1},"sema_id":"sema:Delegate#mh:SHA-256:7dce193da7c9573a95841772ee70d67bc8b3955dc983873f7fd396cf46dca01a","sema_ref":"Delegate#7dce","sema_stub":"7dce","sema_layer":"Society","sema_category":"Governance"},"layer":"Society","category":"Governance"}},{"id":"9866a028-2335-4ad1-808f-3811c849ae0d","text":"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}} to delegator). Dependencies enforced (task blocked until dependencies complete). One owner per task (no ambiguous responsibility).","type":"INVARIANT","layer":null,"category":null,"handle":"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}} to delegator). Dependencies enforced (task blocked until dependencies complete). One owner per task (no ambiguous responsibility).","gloss":null,"stub":null,"metadata":{}},{"id":"f44c032e-94fd-45c4-89c6-a78384667db0","text":"Principal has authority. Delegate capable. Scope of delegation defined.","type":"PRECONDITION","layer":null,"category":null,"handle":"Principal has authority. Delegate capable. Scope of delegation defined.","gloss":null,"stub":null,"metadata":{}},{"id":"66b7837e-5f2f-40d8-ab69-8f54fd46b6e9","text":"Delegate acts within scope. Principal notified of actions. Revocation possible.","type":"POSTCONDITION","layer":null,"category":null,"handle":"Delegate acts within scope. Principal notified of actions. Revocation possible.","gloss":null,"stub":null,"metadata":{}},{"id":"EmpathySim","text":"EmpathySim#1eee","type":"PATTERN","layer":"Society","category":"Economics","handle":"EmpathySim#1eee","gloss":"Predictive modeling of external agent states","stub":"1eee","metadata":{"pattern":{"handle":"EmpathySim","mechanism":"Theory of Mind simulation. {{agent}} instantiates a temporary 'Virtual {{context}}' 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 {{agent_sandbox}} to model the target's perspective, sometimes using {{mirror_stake}} to align incentives for accurate prediction.","gloss":"Predictive modeling of external agent states","failure_modes":["Projection {{cognitive_bias}}: Leaking Self-Knowledge into the simulation (Mirroring Error).","Infinite Regress: {{simulation}} of Target simulating Self simulating Target..","{{simulation}} Capture: Hostile memetics in simulated {{context}} corrupting host {{state}}."],"invariants":["Isolation: Simulated context must have NO write access to Host memory.","Priors Shift: Utility function used must be Target's, not Host's."],"preconditions":["{{budget}} available for sub-simulation","Target profile (goals/constraints) known"],"postconditions":["Confidence_Score generated","Predicted_Action vector generated"],"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"}],"_meta":{"tier":2,"layer":"Society","category":"Economics","related":["sema:MentalSim#mh:SHA-256:1eca2a515c38f3be5c3956be9885e8f1e5b931a958f60b8e21d97e99dd65f3dd"],"ring":2},"sema_id":"sema:EmpathySim#mh:SHA-256:1eee92ef7f1a4b21402aa9a81c793975d48cf3e3957f040b2f0bd5c9d7ad5a6b","sema_ref":"EmpathySim#1eee","sema_stub":"1eee","sema_layer":"Society","sema_category":"Economics"},"layer":"Society","category":"Economics"}},{"id":"7013e068-648d-46e7-a0b2-73eccce32486","text":"Isolation: Simulated context must have NO write access to Host memory.","type":"INVARIANT","layer":null,"category":null,"handle":"Isolation: Simulated context must have NO write access to Host memory.","gloss":null,"stub":null,"metadata":{}},{"id":"8ad7062d-a2e0-4ede-84a1-2afbee98dc47","text":"Priors Shift: Utility function used must be Target's, not Host's.","type":"INVARIANT","layer":null,"category":null,"handle":"Priors Shift: Utility function used must be Target's, not Host's.","gloss":null,"stub":null,"metadata":{}},{"id":"404121b9-99e6-4ceb-9d2b-21df26070852","text":"{{budget}} available for sub-simulation","type":"PRECONDITION","layer":null,"category":null,"handle":"{{budget}} available for sub-simulation","gloss":null,"stub":null,"metadata":{}},{"id":"b91c7fbc-f153-42c7-a102-1556fcf8a9ef","text":"Target profile (goals/constraints) known","type":"PRECONDITION","layer":null,"category":null,"handle":"Target profile (goals/constraints) known","gloss":null,"stub":null,"metadata":{}},{"id":"b0dbf164-b9e5-4a72-9aaa-0bc4d9ea01b2","text":"Confidence_Score generated","type":"POSTCONDITION","layer":null,"category":null,"handle":"Confidence_Score generated","gloss":null,"stub":null,"metadata":{}},{"id":"24ba0036-0ae2-424b-9644-9f070461f724","text":"Predicted_Action vector generated","type":"POSTCONDITION","layer":null,"category":null,"handle":"Predicted_Action vector generated","gloss":null,"stub":null,"metadata":{}},{"id":"EpistemicWager","text":"EpistemicWager#7002","type":"PATTERN","layer":"Society","category":"Economics","handle":"EpistemicWager#7002","gloss":"Staking value on the truth of a claim","stub":"7002","metadata":{"pattern":{"handle":"EpistemicWager","gloss":"Staking value on the truth of a claim","mechanism":"A mechanism where an {{agent}} uses {{mirror_stake}} to lock {{value}} (collateral) on the truthfulness of a {{belief}}. If the belief is proven false via {{falsification}} by an {{oracle}} or {{spot_audit}}, the stake is slashed. This incentivizes honesty and rigorous {{bayes_update}}, 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."],"failure_modes":["Oracle Failure: The truth-teller (Oracle/Audit) is corrupted or unavailable.","Rich-get-Richer: Only wealthy agents can afford to speak (stake) on important matters.","Ambiguity: The belief was vague, making falsification impossible to prove objectively."],"preconditions":["Agent has sufficient funds","Belief is clearly defined"],"postconditions":["Stake locked until resolution","Belief gains credibility (Signal Boost)"],"_meta":{"tier":2,"layer":"Society","category":"Economics","ring":1},"sema_ref":"EpistemicWager#7002","sema_id":"sema:EpistemicWager#mh:SHA-256:7002fc120e47e469f6f1d97f88849ae1f6ca3f94ca4104641d85a1ed15b804bd","sema_stub":"7002","sema_layer":"Society","sema_category":"Economics"},"layer":"Society","category":"Economics"}},{"id":"daa0afc8-87d5-4291-98e1-01bcae9f7e2c","text":"Skin in the Game: Stake > 0","type":"INVARIANT","layer":null,"category":null,"handle":"Skin in the Game: Stake > 0","gloss":null,"stub":null,"metadata":{}},{"id":"9c75bee1-4d75-48f5-b571-60db6368b64b","text":"Falsifiable: The belief must have a clear condition for falsification.","type":"INVARIANT","layer":null,"category":null,"handle":"Falsifiable: The belief must have a clear condition for falsification.","gloss":null,"stub":null,"metadata":{}},{"id":"62936caa-b170-4a6d-9005-eee51784973b","text":"Atomic Settlement: Resolution (Return or Slash) must be guaranteed by the underlying protocol.","type":"INVARIANT","layer":null,"category":null,"handle":"Atomic Settlement: Resolution (Return or Slash) must be guaranteed by the underlying protocol.","gloss":null,"stub":null,"metadata":{}},{"id":"0f60fe92-894e-4688-a9ea-7eed0d74ef20","text":"Belief is clearly defined","type":"PRECONDITION","layer":null,"category":null,"handle":"Belief is clearly defined","gloss":null,"stub":null,"metadata":{}},{"id":"13d9899e-b3e7-4cf4-81a6-c65d2bdca16b","text":"Stake locked until resolution","type":"POSTCONDITION","layer":null,"category":null,"handle":"Stake locked until resolution","gloss":null,"stub":null,"metadata":{}},{"id":"010d1cf1-a83b-4f06-aadf-1b5508cd9cbe","text":"Belief gains credibility (Signal Boost)","type":"POSTCONDITION","layer":null,"category":null,"handle":"Belief gains credibility (Signal Boost)","gloss":null,"stub":null,"metadata":{}},{"id":"StakedProbe","text":"StakedProbe#c52f","type":"PATTERN","layer":"Society","category":"Economics","handle":"StakedProbe#c52f","gloss":"Economically backed verification query","stub":"c52f","metadata":{"pattern":{"handle":"StakedProbe","mechanism":"A high-assurance verification pattern where a {{probe}} is backed by economic collateral via {{mirror_stake}}. If the probe returns false or malicious data, the stake is slashed. Essential for adversarial environments where simple querying is insufficient.","gloss":"Economically backed verification query","failure_modes":["Insufficient Stake: Collateral too low to deter manipulation.","Slashing Failure: Incorrect data not detected, stake not forfeited."],"invariants":["Skin in the Game: Stake must be > 0.","Slashable: False reporting triggers automatic asset forfeiture."],"_meta":{"layer":"Society","category":"Economics","tier":2,"ring":1},"sema_id":"sema:StakedProbe#mh:SHA-256:c52fef498943c78c929563f2efeca09fc762e23468cccf80e2782bda0f1b3cb0","sema_ref":"StakedProbe#c52f","sema_stub":"c52f","sema_layer":"Society","sema_category":"Economics","derived_from":"Probe"},"layer":"Society","category":"Economics"}},{"id":"f26c73af-6f84-48f7-8396-bd835a98be85","text":"Slashable: False reporting triggers automatic asset forfeiture.","type":"INVARIANT","layer":null,"category":null,"handle":"Slashable: False reporting triggers automatic asset forfeiture.","gloss":null,"stub":null,"metadata":{}},{"id":"Fermi","text":"Fermi#389d","type":"PATTERN","layer":"Society","category":"Protocols","handle":"Fermi#389d","gloss":"Estimation via decomposition","stub":"389d","metadata":{"pattern":{"handle":"Fermi","mechanism":"Decomposed Estimation: break unknown quantity into factors you can {{estimate}}. 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}} to break an unknown quantity into estimable sub-factors.","gloss":"Estimation via decomposition","failure_modes":["Correlated Error Stacking: If all sub-estimates are biased in the same direction (e.g., all optimistic), the errors compound rather than cancel."],"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"}],"_meta":{"tier":2,"layer":"Society","category":"Protocols","ring":2},"sema_id":"sema:Fermi#mh:SHA-256:389ddee306aa2de7090a1e9014bacfa4fe2f2f9c9b3aa6c8a8ef8c39f1a60bc1","sema_ref":"Fermi#389d","sema_stub":"389d","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"ab659997-28e1-45d5-ad2c-aa3a750e0708","text":"Error Cancellation: Overestimation in sub-factors tends to cancel underestimation","type":"INVARIANT","layer":null,"category":null,"handle":"Error Cancellation: Overestimation in sub-factors tends to cancel underestimation","gloss":null,"stub":null,"metadata":{}},{"id":"23d7782d-7429-4909-b76d-4845d06b6e7b","text":"Geometric Mean: Final estimate is geometric mean of bounds","type":"INVARIANT","layer":null,"category":null,"handle":"Geometric Mean: Final estimate is geometric mean of bounds","gloss":null,"stub":null,"metadata":{}},{"id":"ImaginaryHistorian","text":"ImaginaryHistorian#f818","type":"PATTERN","layer":"Society","category":"Protocols","handle":"ImaginaryHistorian#f818","gloss":"Debugging possible futures","stub":"f818","metadata":{"pattern":{"handle":"ImaginaryHistorian","mechanism":"Macro for {{trace}}({{simulation}}). 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}} of a {{mental_sim}}, creating an audit log for a counterfactual timeline. This record can be {{crypto_shred}}ded to deny its existence.","gloss":"Debugging possible futures","_meta":{"tier":2,"layer":"Society","category":"Protocols","ring":2},"sema_layer":"Society","sema_category":"Protocols","sema_id":"sema:ImaginaryHistorian#mh:SHA-256:f818b4b64ef0c5dd06699742a86af741fd3cf8898372ba27ec78260778b1f858","sema_ref":"ImaginaryHistorian#f818","sema_stub":"f818","signature":["Trace(Simulation)"]},"layer":"Society","category":"Protocols"}},{"id":"SimulationTrace","text":"SimulationTrace#1bc5","type":"PATTERN","layer":"Society","category":"Protocols","handle":"SimulationTrace#1bc5","gloss":"Pre-execution mental model","stub":"1bc5","metadata":{"pattern":{"handle":"SimulationTrace","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}} of a {{mental_sim}}, creating an immutable record of the predicted future state.","gloss":"Pre-execution mental model","failure_modes":["{{simulation}} inaccuracy (the map is not the territory)."],"invariants":["Causality: Every step T+1 is derived from T","Replayability: {{trace}}(Start) == End","{{trace}} immutable after creation."],"preconditions":["{{simulation}} engine initialized"],"postconditions":["Verifiable trace artifact generated"],"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"}],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":2},"sema_layer":"Society","sema_category":"Protocols","sema_id":"sema:SimulationTrace#mh:SHA-256:1bc5ce892c33fe0da334ebe253a27afbf94965f03112c08aff5af743d657e5c2","sema_ref":"SimulationTrace#1bc5","sema_stub":"1bc5"},"layer":"Society","category":"Protocols"}},{"id":"d70e1e6b-33e2-4bc0-8a14-663dcd5169bb","text":"Causality: Every step T+1 is derived from T","type":"INVARIANT","layer":null,"category":null,"handle":"Causality: Every step T+1 is derived from T","gloss":null,"stub":null,"metadata":{}},{"id":"89432a9b-5314-4d41-8db8-7951f42a3531","text":"Replayability: {{trace}}(Start) == End","type":"INVARIANT","layer":null,"category":null,"handle":"Replayability: {{trace}}(Start) == End","gloss":null,"stub":null,"metadata":{}},{"id":"2b7df96a-4806-4e43-b22b-b8c29afcd3ab","text":"{{trace}} immutable after creation.","type":"INVARIANT","layer":null,"category":null,"handle":"{{trace}} immutable after creation.","gloss":null,"stub":null,"metadata":{}},{"id":"14f7ecb1-65bc-49fb-a3fc-b4084b0e7a46","text":"{{simulation}} engine initialized","type":"PRECONDITION","layer":null,"category":null,"handle":"{{simulation}} engine initialized","gloss":null,"stub":null,"metadata":{}},{"id":"91b37268-4173-445e-84d6-d8bdaacdd4ba","text":"Verifiable trace artifact generated","type":"POSTCONDITION","layer":null,"category":null,"handle":"Verifiable trace artifact generated","gloss":null,"stub":null,"metadata":{}},{"id":"SourceEvaluate","text":"SourceEvaluate#b847","type":"PATTERN","layer":"Society","category":"Protocols","handle":"SourceEvaluate#b847","gloss":"Incentive-aware evidence weighting","stub":"b847","metadata":{"pattern":{"handle":"SourceEvaluate","mechanism":"Credibility Assessment: A {{judge}} module for {{agent}} 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 {{cite_back}} for every claim, weighting the evidence by the source's historical reliability.","gloss":"Incentive-aware evidence weighting","failure_modes":["Genetic Fallacy: Dismissing valid claims solely due to the source, ignoring the evidence itself."],"invariants":["Evidence must be independently verifiable."],"_meta":{"tier":2,"layer":"Society","category":"Protocols","ring":2},"sema_id":"sema:SourceEvaluate#mh:SHA-256:b847e556c70226d42b50ef6b197d9473037bb11d30ef9b2fa2aed641ebdfe232","sema_ref":"SourceEvaluate#b847","sema_stub":"b847","sema_layer":"Society","sema_category":"Protocols","signature":["Judge(Agent)"]},"layer":"Society","category":"Protocols"}},{"id":"Uncertain","text":"Uncertain#b894","type":"PATTERN","layer":"Physics","category":"Primitives","handle":"Uncertain#b894","gloss":"Epistemic status: genuinely don't know","stub":"b894","metadata":{"pattern":{"handle":"Uncertain","mechanism":"Epistemic Status Flag. Explicitly marks a Claim, {{variable}}, 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 {{deep_research}}, {{uncertainty_map}}, {{socratic_loop}}.","gloss":"Epistemic status: genuinely don't know","failure_modes":["False Certainty: {{agent}} feels pressure to answer and fabricates a 'likely' answer instead of using this flag.","Lazy Agnosticism: {{agent}} uses 'Uncertain' to avoid the work of reasoning (Tier 2 failure)."],"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')."],"preconditions":["Knowledge gap identified"],"postconditions":["Confidence score set to 0.0","Target marked as requiring investigation"],"_meta":{"tier":2,"layer":"Physics","category":"Primitives","ring":2},"sema_id":"sema:Uncertain#mh:SHA-256:b89402ced2faa010330940d426790c0bff7c6ca70294ca53aae0fe6b141d8223","sema_ref":"Uncertain#b894","sema_stub":"b894","sema_layer":"Physics","sema_category":"Primitives"},"layer":"Physics","category":"Primitives"}},{"id":"bae8397d-9e3a-4662-b635-4cca88188e50","text":"Actionable Void: A node marked 'Uncertain' is a high-priority target for Information Retrieval.","type":"INVARIANT","layer":null,"category":null,"handle":"Actionable Void: A node marked 'Uncertain' is a high-priority target for Information Retrieval.","gloss":null,"stub":null,"metadata":{}},{"id":"a28dc0c6-db92-4d3e-856d-362071b37426","text":"Specificity: Must target a specific scope (e.g., 'Uncertain about X', not just 'Uncertain').","type":"INVARIANT","layer":null,"category":null,"handle":"Specificity: Must target a specific scope (e.g., 'Uncertain about X', not just 'Uncertain').","gloss":null,"stub":null,"metadata":{}},{"id":"776322bb-8919-4442-9dc1-a36a53bbb4d6","text":"Knowledge gap identified","type":"PRECONDITION","layer":null,"category":null,"handle":"Knowledge gap identified","gloss":null,"stub":null,"metadata":{}},{"id":"34c5a8f1-3a93-4dc7-bc36-35819b9ab0b0","text":"Confidence score set to 0.0","type":"POSTCONDITION","layer":null,"category":null,"handle":"Confidence score set to 0.0","gloss":null,"stub":null,"metadata":{}},{"id":"5d0f9458-700f-4845-84c9-3e700c8ead11","text":"Target marked as requiring investigation","type":"POSTCONDITION","layer":null,"category":null,"handle":"Target marked as requiring investigation","gloss":null,"stub":null,"metadata":{}},{"id":"ConstructOntology","text":"ConstructOntology#e5ce","type":"PATTERN","layer":"Society","category":"Protocols","handle":"ConstructOntology#e5ce","gloss":"Building a structured conceptual framework","stub":"e5ce","metadata":{"pattern":{"handle":"ConstructOntology","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 {{first_principles}}, validating edge coherence via {{adversarial_steel}} and establishing shared context through {{ontology_handshake}}.","gloss":"Building a structured conceptual framework","failure_modes":["Incoherence: Contradictory axioms or definitions."],"invariants":["Completeness: All referenced terms are defined","Consistency: No contradictions within the ontology"],"preconditions":["Seed concepts or data available"],"postconditions":["Valid ontology object created"],"parameters":[{"name":"depth","type":"Integer","range":"[1, 10]","description":"Hierarchical depth"},{"name":"format","type":"Enum","range":"{OWL, JSON-LD, Sema}","description":"Output format"}],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":2},"sema_layer":"Society","sema_category":"Protocols","sema_id":"sema:ConstructOntology#mh:SHA-256:e5ced9f3067c292e187b0ee10ac557d4cbb5064436ab07cc389e5cdefbe44eb6","sema_ref":"ConstructOntology#e5ce","sema_stub":"e5ce"},"layer":"Society","category":"Protocols"}},{"id":"6e8f43d4-9213-413e-a20e-cce42db45aad","text":"Completeness: All referenced terms are defined","type":"INVARIANT","layer":null,"category":null,"handle":"Completeness: All referenced terms are defined","gloss":null,"stub":null,"metadata":{}},{"id":"5781f31a-c65b-42b5-b773-c480adc72e50","text":"Consistency: No contradictions within the ontology","type":"INVARIANT","layer":null,"category":null,"handle":"Consistency: No contradictions within the ontology","gloss":null,"stub":null,"metadata":{}},{"id":"9e1c2a6c-cf2f-41a1-b60b-952b3f0b4d9a","text":"Seed concepts or data available","type":"PRECONDITION","layer":null,"category":null,"handle":"Seed concepts or data available","gloss":null,"stub":null,"metadata":{}},{"id":"b0f75f6d-457b-4522-9bcc-d2c1872b6d1a","text":"Valid ontology object created","type":"POSTCONDITION","layer":null,"category":null,"handle":"Valid ontology object created","gloss":null,"stub":null,"metadata":{}},{"id":"RedTeam","text":"RedTeam#5134","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"RedTeam#5134","gloss":"Adversarial stress testing","stub":"5134","metadata":{"pattern":{"handle":"RedTeam","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}} back to defender to patch highest-risk vectors. It adopts an attacker persona via {{adversarial_steel}}, probing the system for exploit paths.","gloss":"Adversarial stress testing","failure_modes":["Sympathetic Attacker: The Red Team shares the same assumptions as the designers, missing the same blind spots."],"invariants":["Adversarial intent simulated","Goal is to find flaws, not fix them"],"preconditions":["Proposed plan/system"],"postconditions":["Vulnerability report"],"_meta":{"tier":1,"layer":"Mind","category":"Strategy","related":["sema:SteelmanCheck#mh:SHA-256:95fbecc2b836fd92b57f02a1c7cf25bd3e37a5f06e1847065598e37328290a7c"],"ring":2},"sema_id":"sema:RedTeam#mh:SHA-256:513414fe8a9c2a73a5949439c1b0b2f0f35309358f042a24d22a1845bb724984","sema_ref":"RedTeam#5134","sema_stub":"5134","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"ccf282af-3f91-484d-a1ef-2585f50948bd","text":"Adversarial intent simulated","type":"INVARIANT","layer":null,"category":null,"handle":"Adversarial intent simulated","gloss":null,"stub":null,"metadata":{}},{"id":"09edc9f0-c55e-45ff-a784-c306f66745b4","text":"Goal is to find flaws, not fix them","type":"INVARIANT","layer":null,"category":null,"handle":"Goal is to find flaws, not fix them","gloss":null,"stub":null,"metadata":{}},{"id":"0c1f7ac7-fd20-4a64-a60c-bda18152354a","text":"Proposed plan/system","type":"PRECONDITION","layer":null,"category":null,"handle":"Proposed plan/system","gloss":null,"stub":null,"metadata":{}},{"id":"b32cf6cd-4dac-4cb6-a62a-f4d6104f35b3","text":"Vulnerability report","type":"POSTCONDITION","layer":null,"category":null,"handle":"Vulnerability report","gloss":null,"stub":null,"metadata":{}},{"id":"Award","text":"Award#2eda","type":"PATTERN","layer":"Society","category":"Economics","handle":"Award#2eda","gloss":"Acceptance of bid and contract creation","stub":"2eda","metadata":{"pattern":{"handle":"Award","mechanism":"The formal {{act}} of accepting a {{bid}}. It triggers the creation of a {{contract}} which all parties must {{sign}}, and uses {{held_release}} to lock the agreed {{value}} as collateral or payment. This action transitions the {{state}} from Negotiation to Execution, authorizing the {{solver}} to begin.","gloss":"Acceptance of bid and contract creation","signature":["Act(Contract)"],"invariants":["Atomic: Bid acceptance and Contract creation must happen together.","Funded: Value must be locked (HeldRelease) before Award is final."],"_meta":{"tier":1,"layer":"Society","category":"Economics","ring":1},"sema_ref":"Award#2eda","sema_id":"sema:Award#mh:SHA-256:2eda44e2b2ebcf367563cd9dd7ac71e47a431f6aeeb4c0f2c5e9c6683ca877ad","sema_stub":"2eda","sema_layer":"Society","sema_category":"Economics"},"layer":"Society","category":"Economics"}},{"id":"4c2bceb8-c362-40a1-a862-f3c8521f3ec5","text":"Atomic: Bid acceptance and Contract creation must happen together.","type":"INVARIANT","layer":null,"category":null,"handle":"Atomic: Bid acceptance and Contract creation must happen together.","gloss":null,"stub":null,"metadata":{}},{"id":"b3c32d18-afd4-4f09-8a63-da38a76c38f4","text":"Funded: Value must be locked (HeldRelease) before Award is final.","type":"INVARIANT","layer":null,"category":null,"handle":"Funded: Value must be locked (HeldRelease) before Award is final.","gloss":null,"stub":null,"metadata":{}},{"id":"Crystallize","text":"Crystallize#e848","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"Crystallize#e848","gloss":"Phase transition from implicit resonance to explicit contract","stub":"e848","metadata":{"pattern":{"handle":"Crystallize","mechanism":"Formalize implicit resonance. {{agent}} A proposes crystallization based on history history_t. {{agent}} B validates perception. On consensus, implicit behaviors are codified into explicit obligations. It transforms soft {{resonate}} signals into hard {{hydra_constitution}} rules, contingent on low entropy conditions maintained by {{dampen}} and {{entropy_pump}}, preventing premature {{decay}}.","gloss":"Phase transition from implicit resonance to explicit contract","failure_modes":["Illusory Resonance: Agents misinterpreted random noise as synchronization.","Premature Crystallization: Attempting to lock state while Entropy > Threshold.","Illusory resonance (parties perceived differently, crystallization exposes this).","Perception mismatch on alignment dimensions.","Gaming (agent fakes resonance metrics).","Premature crystallization (not enough resonance history).","Trust inflation (claiming more trust than resonance justifies)."],"invariants":["Atomic {{transition}}: {{state}} moves from Fluid -> Solid in one transaction.","Entropy Limit: Crystallization forbidden if System_Entropy > entropy_threshold."],"preconditions":["Active implicit resonance channel exists","{{state}} is fluid/negotiable"],"postconditions":["Explicit coordination channel established","{{state}} marked immutable/contractual"],"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"}],"_meta":{"tier":2,"layer":"Mind","category":"Strategy","ring":1},"sema_layer":"Mind","sema_category":"Strategy","sema_id":"sema:Crystallize#mh:SHA-256:e84866de2000db88e54e393e3a761f5687488881a0a3e6817bdc864d28189e04","sema_ref":"Crystallize#e848","sema_stub":"e848"},"layer":"Mind","category":"Strategy"}},{"id":"113c0393-fedd-47fd-a9fd-3f819b478ce2","text":"Atomic {{transition}}: {{state}} moves from Fluid -> Solid in one transaction.","type":"INVARIANT","layer":null,"category":null,"handle":"Atomic {{transition}}: {{state}} moves from Fluid -> Solid in one transaction.","gloss":null,"stub":null,"metadata":{}},{"id":"0d0e7e23-e831-43bd-be0e-42fe0b8a5919","text":"Entropy Limit: Crystallization forbidden if System_Entropy > entropy_threshold.","type":"INVARIANT","layer":null,"category":null,"handle":"Entropy Limit: Crystallization forbidden if System_Entropy > entropy_threshold.","gloss":null,"stub":null,"metadata":{}},{"id":"5881d9c0-defd-41ba-92ff-3d0092b48a63","text":"Active implicit resonance channel exists","type":"PRECONDITION","layer":null,"category":null,"handle":"Active implicit resonance channel exists","gloss":null,"stub":null,"metadata":{}},{"id":"8e9e2466-a23c-4109-935c-22cb24d6ac90","text":"{{state}} is fluid/negotiable","type":"PRECONDITION","layer":null,"category":null,"handle":"{{state}} is fluid/negotiable","gloss":null,"stub":null,"metadata":{}},{"id":"db8ffd23-9934-40e0-bab0-532520d5d3c0","text":"Explicit coordination channel established","type":"POSTCONDITION","layer":null,"category":null,"handle":"Explicit coordination channel established","gloss":null,"stub":null,"metadata":{}},{"id":"ce2f9812-9772-4c75-a760-a3a48c817abe","text":"{{state}} marked immutable/contractual","type":"POSTCONDITION","layer":null,"category":null,"handle":"{{state}} marked immutable/contractual","gloss":null,"stub":null,"metadata":{}},{"id":"Elect","text":"Elect#af6e","type":"PATTERN","layer":"Society","category":"Governance","handle":"Elect#af6e","gloss":"Enable efficient group coordination through configurable leadership with clear authority boundaries and succession planning","stub":"af6e","metadata":{"pattern":{"handle":"Elect","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 {{accept_spec}} to appear on {{ballot}}—cannot elect unwilling leader. Phase 2 VOTE: Standard VOTE mechanism among accepted nominees. Phase 3 INVEST: Winner receives {{solution}} (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 {{hydra_constitution}} to nominate, vote, and invest authority in a leader.","gloss":"Enable efficient group coordination through configurable leadership with clear authority boundaries and succession planning","failure_modes":["No candidates (no one willing to lead—group operates leaderless or incentivize).","Election deadlock (no majority—use runoff or plurality fallback).","Leader abuse (exceeds granted powers—recall or DISBAND).","Succession failure (successor also unavailable—chain or re-elect).","Recall wars (constant removal attempts—raise threshold or cooldown).","Power creep (leader accumulates ungrantled powers—audit against ELECT_RESULT)."],"invariants":["One and only one leader selected per term","Selection process is verifiable"],"preconditions":["Candidate set","Voting mechanism"],"postconditions":["Leader identified","Term started"],"_meta":{"tier":1,"layer":"Society","category":"Governance","related":["Vote"],"ring":2},"sema_layer":"Society","sema_category":"Governance","sema_id":"sema:Elect#mh:SHA-256:af6e313ca4ac066c68c3b5f9debfaec551f20b3aacd0792c3eec6fa41bc41282","sema_ref":"Elect#af6e","sema_stub":"af6e"},"layer":"Society","category":"Governance"}},{"id":"020d1eb5-913f-4b54-913b-3a9ac150b741","text":"One and only one leader selected per term","type":"INVARIANT","layer":null,"category":null,"handle":"One and only one leader selected per term","gloss":null,"stub":null,"metadata":{}},{"id":"8d33f738-1a02-41db-babe-e85ac077023e","text":"Selection process is verifiable","type":"INVARIANT","layer":null,"category":null,"handle":"Selection process is verifiable","gloss":null,"stub":null,"metadata":{}},{"id":"c3b862d5-98fb-41fd-9d1a-1b09cf62e273","text":"Candidate set","type":"PRECONDITION","layer":null,"category":null,"handle":"Candidate set","gloss":null,"stub":null,"metadata":{}},{"id":"fc9362b3-a57f-4f62-8ab5-c0eaad62dece","text":"Voting mechanism","type":"PRECONDITION","layer":null,"category":null,"handle":"Voting mechanism","gloss":null,"stub":null,"metadata":{}},{"id":"716a10d1-3753-4380-9f17-1c38f3ed42d2","text":"Leader identified","type":"POSTCONDITION","layer":null,"category":null,"handle":"Leader identified","gloss":null,"stub":null,"metadata":{}},{"id":"a28ff009-795b-418a-858e-3bbe8fe3570e","text":"Term started","type":"POSTCONDITION","layer":null,"category":null,"handle":"Term started","gloss":null,"stub":null,"metadata":{}},{"id":"NormCheck","text":"NormCheck#e814","type":"PATTERN","layer":"Mind","category":"Inference","handle":"NormCheck#e814","gloss":"Detection of value-laden facts","stub":"e814","metadata":{"pattern":{"handle":"NormCheck","mechanism":"A {{check}} 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}} of {{value}}). Utilizes {{quorum}}, {{prophet_fan_out}}, {{normative_judge}}.","gloss":"Detection of value-laden facts","failure_modes":["Strips relevant safety warnings that were actually factual."],"invariants":["Fact Preservation: Rewritten text must preserve all causal claims","Neutral Tone: Count(NormativeAdjectives) == 0"],"preconditions":["Text claims to be descriptive"],"postconditions":["Text certified neutral"],"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"}],"_meta":{"tier":1,"layer":"Mind","category":"Inference","ring":0},"sema_id":"sema:NormCheck#mh:SHA-256:e814be5d132bffecd6b6ca97f0a2b540b64f201a4ab688c3af9f976c22bf6c58","sema_ref":"NormCheck#e814","sema_stub":"e814","sema_layer":"Mind","sema_category":"Inference","signature":["Check(Value)"]},"layer":"Mind","category":"Inference"}},{"id":"40c8278e-1105-4108-9411-7908dd072340","text":"Fact Preservation: Rewritten text must preserve all causal claims","type":"INVARIANT","layer":null,"category":null,"handle":"Fact Preservation: Rewritten text must preserve all causal claims","gloss":null,"stub":null,"metadata":{}},{"id":"f9efa1fe-c100-42f0-a67c-a0c635566da1","text":"Neutral Tone: Count(NormativeAdjectives) == 0","type":"INVARIANT","layer":null,"category":null,"handle":"Neutral Tone: Count(NormativeAdjectives) == 0","gloss":null,"stub":null,"metadata":{}},{"id":"01ba5d7b-c99b-4391-9c6f-9e66f1dd06a0","text":"Text claims to be descriptive","type":"PRECONDITION","layer":null,"category":null,"handle":"Text claims to be descriptive","gloss":null,"stub":null,"metadata":{}},{"id":"d1f372e4-4d2c-40cc-a704-a8004bd3da15","text":"Text certified neutral","type":"POSTCONDITION","layer":null,"category":null,"handle":"Text certified neutral","gloss":null,"stub":null,"metadata":{}},{"id":"Aesthetics","text":"Aesthetics#6b33","type":"PATTERN","layer":"Society","category":"Protocols","handle":"Aesthetics#6b33","gloss":"Optimization for human subjective preference","stub":"6b33","metadata":{"pattern":{"handle":"Aesthetics","mechanism":"A scalar {{metric}} representing the fit between an {{artifact}} and the subjective preference priors of a human observer (e.g., harmony, {{parsimony}}, style). Used to optimize solutions for social acceptance when functional utility is equal.","gloss":"Optimization for human subjective preference","_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":0},"sema_id":"sema:Aesthetics#mh:SHA-256:6b3327e2478c8a2203ec76f8f65c0473ed629b1099375c4928096a27f209b69d","sema_ref":"Aesthetics#6b33","sema_stub":"6b33","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"BreadthGovernor","text":"BreadthGovernor#c98e","type":"PATTERN","layer":"Mind","category":"Inference","handle":"BreadthGovernor#c98e","gloss":"Structural limit on parallel execution (Fan-out)","stub":"c98e","metadata":{"pattern":{"handle":"BreadthGovernor","mechanism":"{{parsimony}}-Bounded Expansion. Limits the maximum number of parallel branches (fan-out) at any single node. Prioritizes branches by 'Distinctness' and 'Expected {{value}}'. If Candidates > Max_Breadth, applies Truncation (Top-K) or Clustering (merge similar branches). It enforces limits defined by {{budget}} during the {{decompose}} phase, often employing {{prophet_fan_out}} to pre-score and prune branches.","gloss":"Structural limit on parallel execution (Fan-out)","failure_modes":["Fork Bomb: Unchecked decomposition creates exponential agent explosion.","Choice Overload: Too many weak hypotheses dilute the quality of the best ones.","{{context}} Fragmentation: Parent agent cannot integrate results from N > 7 children."],"invariants":["Distinctness: {{parallel}} branches must be semantically orthogonal (cosine_sim < 0.8).","Miller's Law: Active sub-tasks should rarely exceed 7 +/- 2."],"preconditions":["Candidate list generated","Decomposition request received"],"postconditions":["Candidate list truncated to <= max_breadth"],"parameters":[{"name":"max_breadth","type":"Integer","range":"[3, 10]","description":"Default: 5"},{"name":"selection_strategy","type":"Enum","range":"{TopK, Cluster, Random}","description":"Default: TopK"}],"_meta":{"tier":2,"layer":"Mind","category":"Inference","ring":0},"sema_id":"sema:BreadthGovernor#mh:SHA-256:c98e2057dd8d67125f34aafcb2f6397574af172c0a20113aa042574bd8e31a7c","sema_ref":"BreadthGovernor#c98e","sema_stub":"c98e","sema_layer":"Mind","sema_category":"Inference"},"layer":"Mind","category":"Inference"}},{"id":"b6b9485e-7d7a-498d-902b-7f64f9caf014","text":"Distinctness: {{parallel}} branches must be semantically orthogonal (cosine_sim < 0.8).","type":"INVARIANT","layer":null,"category":null,"handle":"Distinctness: {{parallel}} branches must be semantically orthogonal (cosine_sim < 0.8).","gloss":null,"stub":null,"metadata":{}},{"id":"1deb9f61-1ce1-442b-80ce-f711b7222763","text":"Miller's Law: Active sub-tasks should rarely exceed 7 +/- 2.","type":"INVARIANT","layer":null,"category":null,"handle":"Miller's Law: Active sub-tasks should rarely exceed 7 +/- 2.","gloss":null,"stub":null,"metadata":{}},{"id":"4081a9ba-4f95-4fad-adf4-0202a75e05e0","text":"Candidate list generated","type":"PRECONDITION","layer":null,"category":null,"handle":"Candidate list generated","gloss":null,"stub":null,"metadata":{}},{"id":"4ca8a595-6c82-4236-a082-6442b091e45b","text":"Decomposition request received","type":"PRECONDITION","layer":null,"category":null,"handle":"Decomposition request received","gloss":null,"stub":null,"metadata":{}},{"id":"944189f8-cf21-4edb-8780-59ce6381f389","text":"Candidate list truncated to <= max_breadth","type":"POSTCONDITION","layer":null,"category":null,"handle":"Candidate list truncated to <= max_breadth","gloss":null,"stub":null,"metadata":{}},{"id":"ConceptBlend","text":"ConceptBlend#de01","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"ConceptBlend#de01","gloss":"Combinatorial novelty generation","stub":"de01","metadata":{"pattern":{"handle":"ConceptBlend","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 {{analogy_bridge}} by not just mapping A to B, but fusing them to create C.","gloss":"Combinatorial novelty generation","invariants":["Orthogonality: Inputs must be semantically distant (> threshold distance)","Validity: Output must pass a {{tri_gate}}({{realizable}}) check"],"_meta":{"tier":3,"layer":"Mind","category":"Strategy","related":["sema:AnalogicalMask#mh:SHA-256:4c693894def97c224cf9f9fec71dc4def00c0b8cc6523ccfe5ee5ccddb275c8a"],"ring":2},"sema_id":"sema:ConceptBlend#mh:SHA-256:de0119faac3117ebddc1c767f646668f490da960e26643a3f1be6d32161e8857","sema_ref":"ConceptBlend#de01","sema_stub":"de01","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"4406647b-7755-47e8-9733-e0ee5df195c8","text":"Orthogonality: Inputs must be semantically distant (> threshold distance)","type":"INVARIANT","layer":null,"category":null,"handle":"Orthogonality: Inputs must be semantically distant (> threshold distance)","gloss":null,"stub":null,"metadata":{}},{"id":"f7b417d5-356e-4d36-b8a6-f1bc731828fd","text":"Validity: Output must pass a {{tri_gate}}({{realizable}}) check","type":"INVARIANT","layer":null,"category":null,"handle":"Validity: Output must pass a {{tri_gate}}({{realizable}}) check","gloss":null,"stub":null,"metadata":{}},{"id":"PURECheck","text":"PURECheck#b8ca","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"PURECheck#b8ca","gloss":"The PURE Triage Protocol (Parsimonious, Unique/Novel, Realizable, Expansive)","stub":"b8ca","metadata":{"pattern":{"handle":"PURECheck","mechanism":"The canonical Exploration {{protocol}}. It is a {{layered_check}} that orchestrates a sequential triage using four instances of {{tri_gate}}: (1) {{tri_gate}}({{parsimony}}) (2) {{tri_gate}}({{novelty}}) (3) {{tri_gate}}({{realizable}}) (4) {{tri_gate}}({{expansive}}). Enforces the conjunctive rule: 'Explore iff NO gate is Red'. Yellow outputs accumulate as Technical Debt (Smallest Lift tasks) in the final {{solution}}.","gloss":"The PURE Triage Protocol (Parsimonious, Unique/Novel, Realizable, Expansive)","signature":["Protocol(Solution)"],"_meta":{"layer":"Mind","category":"Strategy","ring":1,"tier":1},"sema_id":"sema:PURECheck#mh:SHA-256:b8caa25351b7aca245cf6cdda95bade057c69cb4d789c4a098148d1edb576d6c","sema_ref":"PURECheck#b8ca","sema_stub":"b8ca","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"BeliefTracking","text":"BeliefTracking#de85","type":"PATTERN","layer":"Mind","category":"Memory","handle":"BeliefTracking#de85","gloss":"Note what you believed before and after","stub":"de85","metadata":{"pattern":{"handle":"BeliefTracking","mechanism":"Epistemic Version Control. Enforces a 'Commit Log' for internal knowledge. Before processing new information, the {{agent}} must query and pin its current Priors. If the posterior belief shifts significantly, the {{agent}} 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 {{surprisal_update}} to determine whether a new node is justified or if the evidence fits the existing model.","gloss":"Note what you believed before and after","failure_modes":["Hindsight {{cognitive_bias}}: {{agent}} overwrites prior beliefs with new data, destroying the record of learning.","Epistemic Thrashing: Creating new belief versions for trivial noise (over-sensitivity).","Silent Update: Changing internal weights/state without creating a graph edge to document it."],"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."],"preconditions":["Existing knowledge graph","Incoming information stream"],"postconditions":["{{belief}} graph updated with version history","Learning delta recorded"],"parameters":[{"name":"update_threshold","type":"Float","range":"[0.0, 1.0]","description":"Minimum delta to trigger belief revision"}],"_meta":{"tier":2,"layer":"Mind","category":"Memory","related":["sema:BayesUpdate#mh:SHA-256:a762656f3df6a4b6322a6da1ae14f3093e675cba380bb5e488f397863f3e8b0a"],"ring":2},"sema_id":"sema:BeliefTracking#mh:SHA-256:de85ece216eb6030ed14d7cca83334f11dd6efb9287c76bf25f569946c5dc950","sema_ref":"BeliefTracking#de85","sema_stub":"de85","sema_layer":"Mind","sema_category":"Memory"},"layer":"Mind","category":"Memory"}},{"id":"9aee0a43-42df-4d2e-b31f-87577162f81d","text":"Causal Link: Every update must cite the specific 'Trigger' (Evidence) that caused the shift.","type":"INVARIANT","layer":null,"category":null,"handle":"Causal Link: Every update must cite the specific 'Trigger' (Evidence) that caused the shift.","gloss":null,"stub":null,"metadata":{}},{"id":"af3907a5-d2b0-475d-8b02-3187a416b8f1","text":"Non-Destructive Update: Old beliefs are never deleted, only Superseded.","type":"INVARIANT","layer":null,"category":null,"handle":"Non-Destructive Update: Old beliefs are never deleted, only Superseded.","gloss":null,"stub":null,"metadata":{}},{"id":"3bf6f3d3-ccee-4930-9de9-71a69632a061","text":"Prior Commitment: Must retrieve/state existing beliefs BEFORE ingesting new evidence.","type":"INVARIANT","layer":null,"category":null,"handle":"Prior Commitment: Must retrieve/state existing beliefs BEFORE ingesting new evidence.","gloss":null,"stub":null,"metadata":{}},{"id":"e7ccec19-a179-4d30-baf9-f9762b6ca750","text":"Existing knowledge graph","type":"PRECONDITION","layer":null,"category":null,"handle":"Existing knowledge graph","gloss":null,"stub":null,"metadata":{}},{"id":"90a8d5b5-8c12-420a-871b-c01127fcfc96","text":"Incoming information stream","type":"PRECONDITION","layer":null,"category":null,"handle":"Incoming information stream","gloss":null,"stub":null,"metadata":{}},{"id":"21291178-499f-417b-b8cf-eef2f6c0f4f8","text":"{{belief}} graph updated with version history","type":"POSTCONDITION","layer":null,"category":null,"handle":"{{belief}} graph updated with version history","gloss":null,"stub":null,"metadata":{}},{"id":"83205de8-5879-4e06-a3c1-ce0c5c0d4da6","text":"Learning delta recorded","type":"POSTCONDITION","layer":null,"category":null,"handle":"Learning delta recorded","gloss":null,"stub":null,"metadata":{}},{"id":"CounterfactualAnchor","text":"CounterfactualAnchor#063d","type":"PATTERN","layer":"Society","category":"Protocols","handle":"CounterfactualAnchor#063d","gloss":"Freezing expectation to measure true surprise","stub":"063d","metadata":{"pattern":{"handle":"CounterfactualAnchor","mechanism":"Freezes a prediction BEFORE observation. 1. Instantiate immutable Anchor (Expectation). 2. {{observe}} Reality. 3. Learning {{signal}} = Delta(Anchor, Reality). Prevents Hindsight {{cognitive_bias}} by forcing updates based on genuine surprise. It creates the static reference point against which {{surprisal_update}} measures the magnitude of the learning delta.","gloss":"Freezing expectation to measure true surprise","failure_modes":["Hindsight Leakage: {{agent}} unconsciously adjusts the Anchor as data comes in Vague Anchor: Prediction is too broad to be falsified (e.g., 'Something will happen') Anchor Abandonment: {{agent}} ignores the Anchor when the delta is too large (denial)"],"invariants":["Anchor Immutability: The Anchor cannot be modified once the Observation phase begins","Delta Causality: Learning {{signal}} L = f(Anchor, Observation). No other inputs permitted during update","Temporal Ordering: Creation(Anchor) < Time(Observation)"],"preconditions":["{{agent}} 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"],"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"}],"_meta":{"tier":2,"layer":"Society","category":"Protocols","ring":1},"sema_layer":"Society","sema_category":"Protocols","sema_id":"sema:CounterfactualAnchor#mh:SHA-256:063d450f43af5d8edc6b05acff736560c5a85e9e730db4aeec607d3754717dfb","sema_ref":"CounterfactualAnchor#063d","sema_stub":"063d"},"layer":"Society","category":"Protocols"}},{"id":"a1473994-ba9d-47d1-98ec-2cf6c713e5bc","text":"Anchor Immutability: The Anchor cannot be modified once the Observation phase begins","type":"INVARIANT","layer":null,"category":null,"handle":"Anchor Immutability: The Anchor cannot be modified once the Observation phase begins","gloss":null,"stub":null,"metadata":{}},{"id":"0c2d463b-6b97-4781-94b4-f30a62a74bcb","text":"Delta Causality: Learning {{signal}} L = f(Anchor, Observation). No other inputs permitted during update","type":"INVARIANT","layer":null,"category":null,"handle":"Delta Causality: Learning {{signal}} L = f(Anchor, Observation). No other inputs permitted during update","gloss":null,"stub":null,"metadata":{}},{"id":"66482da9-f37f-442b-a49b-ec11de0de1cc","text":"Temporal Ordering: Creation(Anchor) < Time(Observation)","type":"INVARIANT","layer":null,"category":null,"handle":"Temporal Ordering: Creation(Anchor) < Time(Observation)","gloss":null,"stub":null,"metadata":{}},{"id":"7dc1cea2-48c7-4b08-90a8-e37e2d772432","text":"Incoming observable event stream","type":"PRECONDITION","layer":null,"category":null,"handle":"Incoming observable event stream","gloss":null,"stub":null,"metadata":{}},{"id":"8e6915fc-3161-4f89-a0ff-421e5450cdda","text":"A quantified 'Surprisal' delta is recorded","type":"POSTCONDITION","layer":null,"category":null,"handle":"A quantified 'Surprisal' delta is recorded","gloss":null,"stub":null,"metadata":{}},{"id":"8ed054c8-5c68-44e8-82c5-eb8d80aaae77","text":"Internal model weights/beliefs updated based on delta","type":"POSTCONDITION","layer":null,"category":null,"handle":"Internal model weights/beliefs updated based on delta","gloss":null,"stub":null,"metadata":{}},{"id":"TraceBelief","text":"TraceBelief#5334","type":"PATTERN","layer":"Society","category":"Protocols","handle":"TraceBelief#5334","gloss":"Belief Provenance (Macro for Trace(Belief))","stub":"5334","metadata":{"pattern":{"handle":"TraceBelief","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}} primitive on a {{belief}} object. Utilizes {{trace}}, {{surprisal_update}}, {{belief}}, {{time_warp_log}}.","gloss":"Belief Provenance (Macro for Trace(Belief))","_meta":{"tier":2,"layer":"Society","category":"Protocols","ring":2},"sema_id":"sema:TraceBelief#mh:SHA-256:533499acf3ed3270a039dca18f66b170db485ddf56e47d72b68f770dce949da1","sema_ref":"TraceBelief#5334","sema_stub":"5334","sema_layer":"Society","sema_category":"Protocols","signature":["Trace(Belief)"]},"layer":"Society","category":"Protocols"}},{"id":"Deploy","text":"Deploy#0d56","type":"PATTERN","layer":"Society","category":"Protocols","handle":"Deploy#0d56","gloss":"Release to production","stub":"0d56","metadata":{"pattern":{"handle":"Deploy","mechanism":"The {{act}} of moving an artifact or system from a development/staging environment to a production environment. It executes the {{rollout}} process to make the system active and accessible to users.","gloss":"Release to production","signature":["Act(Rollout)"],"failure_modes":["Config Drift: Production environment differs from staging."],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":1},"sema_ref":"Deploy#0d56","sema_id":"sema:Deploy#mh:SHA-256:0d5689af6010cb28767876fe4c7eea40aec1c411e30d2191b55745e2746fe7f9","sema_stub":"0d56","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"Compose","text":"Compose#41f6","type":"PATTERN","layer":"Society","category":"Protocols","handle":"Compose#41f6","gloss":"Building complex behavior from simple primitives","stub":"41f6","metadata":{"pattern":{"handle":"Compose","mechanism":"Recursive Assembly: Given solved subproblems, {{combine}} solutions respecting interfaces. {{check}}: does combined solution satisfy original problem constraints? If interaction effects emerge, add coordination layer or revise decomposition. It often employs {{prompt_chain}} to sequentially feed sub-solutions into the integration step.","gloss":"Building complex behavior from simple primitives","failure_modes":["Interface Mismatch: Component outputs do not match expected inputs of downstream components."],"invariants":["Type Safety: Component outputs must match downstream inputs.","Acyclicity: Composition graph must be a DAG."],"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."],"_meta":{"tier":2,"layer":"Society","category":"Protocols","ring":2},"sema_id":"sema:Compose#mh:SHA-256:41f61756a73065e6a7b3a80e1ac9938567f7e22dd85d437fd96be12a8ea8ce6f","sema_ref":"Compose#41f6","sema_stub":"41f6","sema_layer":"Society","sema_category":"Protocols","signature":["Combine(PromptChain)"]},"layer":"Society","category":"Protocols"}},{"id":"762a66cc-9219-4e24-bfd4-15213787ee11","text":"Type Safety: Component outputs must match downstream inputs.","type":"INVARIANT","layer":null,"category":null,"handle":"Type Safety: Component outputs must match downstream inputs.","gloss":null,"stub":null,"metadata":{}},{"id":"1ce1c5a6-1d14-4de0-afdc-3be45aaba169","text":"Acyclicity: Composition graph must be a DAG.","type":"INVARIANT","layer":null,"category":null,"handle":"Acyclicity: Composition graph must be a DAG.","gloss":null,"stub":null,"metadata":{}},{"id":"d206b156-64c4-4cf7-b95c-f4a7299a9671","text":"Subproblem solutions available. Interface contracts defined. Composition order known if order-dependent.","type":"PRECONDITION","layer":null,"category":null,"handle":"Subproblem solutions available. Interface contracts defined. Composition order known if order-dependent.","gloss":null,"stub":null,"metadata":{}},{"id":"e49001a3-d832-4520-953e-6cad2e2ebee9","text":"Combined solution satisfies original problem. No interface violations. Emergent interactions handled.","type":"POSTCONDITION","layer":null,"category":null,"handle":"Combined solution satisfies original problem. No interface violations. Emergent interactions handled.","gloss":null,"stub":null,"metadata":{}},{"id":"MetaPrompt","text":"MetaPrompt#af73","type":"PATTERN","layer":"Society","category":"Protocols","handle":"MetaPrompt#af73","gloss":"Use prompts to generate or refine other prompts","stub":"af73","metadata":{"pattern":{"handle":"MetaPrompt","mechanism":"A higher-order {{meta}} {{prompt}}ing 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 {{prompt_chain}} where the output of the first stage is the prompt instruction for the second.","gloss":"Use prompts to generate or refine other prompts","failure_modes":["{{prompt}} Drift: Generated prompts diverge from intent over iterations.","{{meta}}-Complexity: {{meta}}-prompt harder to write than direct prompt.","Overfitting: Generated prompts too specific to examples."],"invariants":["Output is a prompt","{{prompt}} instructs how to prompt"],"preconditions":["{{prompt}} engineering principles","{{task}} description"],"postconditions":["Optimized prompt generated"],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":2},"sema_id":"sema:MetaPrompt#mh:SHA-256:af733e898cd221286278bdafa1d045598b82a7413a6adeb67521aebedce202b6","sema_ref":"MetaPrompt#af73","sema_stub":"af73","sema_layer":"Society","sema_category":"Protocols","signature":["Meta(Prompt)"]},"layer":"Society","category":"Protocols"}},{"id":"422968d6-8695-497e-9052-9514cb240374","text":"Output is a prompt","type":"INVARIANT","layer":null,"category":null,"handle":"Output is a prompt","gloss":null,"stub":null,"metadata":{}},{"id":"dc1dfcb9-5f28-4fe4-ae8f-59192d05a886","text":"{{prompt}} instructs how to prompt","type":"INVARIANT","layer":null,"category":null,"handle":"{{prompt}} instructs how to prompt","gloss":null,"stub":null,"metadata":{}},{"id":"908d025a-5105-497e-95e6-c28fea246b70","text":"{{prompt}} engineering principles","type":"PRECONDITION","layer":null,"category":null,"handle":"{{prompt}} engineering principles","gloss":null,"stub":null,"metadata":{}},{"id":"9b2ce326-7e2c-46c6-980b-247488be2aea","text":"{{task}} description","type":"PRECONDITION","layer":null,"category":null,"handle":"{{task}} description","gloss":null,"stub":null,"metadata":{}},{"id":"52f58c6f-8dfd-491b-a1d8-5d3dba42f0bb","text":"Optimized prompt generated","type":"POSTCONDITION","layer":null,"category":null,"handle":"Optimized prompt generated","gloss":null,"stub":null,"metadata":{}},{"id":"PatternDiscovery","text":"PatternDiscovery#8178","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"PatternDiscovery#8178","gloss":"Finding patterns that already exist","stub":"8178","metadata":{"pattern":{"handle":"PatternDiscovery","mechanism":"Macro for {{search}}(Pattern). Vocabulary Hygiene {{protocol}}. Before minting a new pattern, the {{agent}} MUST execute a semantic search against the existing registry. If a pattern with >85% semantic similarity is found, the {{agent}} MUST adopt the existing pattern or explicitly justify the divergence (Fork). It leverages {{search}} to scan the existing registry before triggering {{construct_ontology}} to mint a new definition.","gloss":"Finding patterns that already exist","failure_modes":["Not Invented Here (NIH): {{agent}} ignores existing solutions to create a slightly worse custom version.","Keyword Miss: Search fails because the agent used different terminology for the same concept.","Fragmentation: Vocabulary floods with duplicate 'Micro-Patterns'."],"invariants":["Deduplication: If Similarity(New, Existing) > Threshold, Mint is blocked.","Pre-Mint {{check}}: Minting is forbidden without a prior Search log."],"preconditions":["Intent to define new concept","Registry access available"],"postconditions":["Existing Pattern Returned OR New Pattern Minted"],"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"}],"_meta":{"tier":2,"layer":"Mind","category":"Strategy","ring":2},"sema_id":"sema:PatternDiscovery#mh:SHA-256:817812421bedb09d6d8d04cdefd7b968a8853cbead54a73ef6133e5501ba8548","sema_ref":"PatternDiscovery#8178","sema_stub":"8178","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"628d75d7-7f1c-4362-8feb-7e199665a140","text":"Deduplication: If Similarity(New, Existing) > Threshold, Mint is blocked.","type":"INVARIANT","layer":null,"category":null,"handle":"Deduplication: If Similarity(New, Existing) > Threshold, Mint is blocked.","gloss":null,"stub":null,"metadata":{}},{"id":"984d2d8f-302e-4bd0-832d-cebb76371bf5","text":"Pre-Mint {{check}}: Minting is forbidden without a prior Search log.","type":"INVARIANT","layer":null,"category":null,"handle":"Pre-Mint {{check}}: Minting is forbidden without a prior Search log.","gloss":null,"stub":null,"metadata":{}},{"id":"8d014fc7-9441-4d8c-a354-0c2967506da0","text":"Intent to define new concept","type":"PRECONDITION","layer":null,"category":null,"handle":"Intent to define new concept","gloss":null,"stub":null,"metadata":{}},{"id":"df4e9373-a3dc-46b0-98ad-106efd2b681a","text":"Registry access available","type":"PRECONDITION","layer":null,"category":null,"handle":"Registry access available","gloss":null,"stub":null,"metadata":{}},{"id":"2affb141-3645-4458-b437-e0736c2a9844","text":"Existing Pattern Returned OR New Pattern Minted","type":"POSTCONDITION","layer":null,"category":null,"handle":"Existing Pattern Returned OR New Pattern Minted","gloss":null,"stub":null,"metadata":{}},{"id":"AdversarialProof","text":"AdversarialProof#3a40","type":"PATTERN","layer":"Society","category":"Protocols","handle":"AdversarialProof#3a40","gloss":"Adversarial proof of absence","stub":"3a40","metadata":{"pattern":{"handle":"AdversarialProof","mechanism":"Cognitively-enriched {{negative_proof}} that invokes {{red_team}} 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.","gloss":"Adversarial proof of absence","derived_from":"NegativeProof","failure_modes":["Sympathetic Attacker: RedTeam shares assumptions with defenders, missing the same blind spots.","Computational expense of adversarial exhaustive search."],"invariants":["Adversarial intent maintained throughout search","Search space fully covered with hostile probing"],"preconditions":["Closed world assumption","{{hypothesis}} H to disprove"],"postconditions":["H proved false with adversarial confidence"],"_meta":{"tier":2,"layer":"Society","category":"Protocols","ring":2},"sema_layer":"Society","sema_category":"Protocols","sema_ref":"AdversarialProof#3a40","sema_id":"sema:AdversarialProof#mh:SHA-256:3a40bf981cf55a2f33101edfd611003e49e069a209559b45c7ee01ccbbbd896b","sema_stub":"3a40"},"layer":"Society","category":"Protocols"}},{"id":"fa92cee1-f9c5-45f1-9783-ac7b6156c814","text":"Search space fully covered with hostile probing","type":"INVARIANT","layer":null,"category":null,"handle":"Search space fully covered with hostile probing","gloss":null,"stub":null,"metadata":{}},{"id":"444dfbb5-5e6b-4837-874d-27330ffc8987","text":"H proved false with adversarial confidence","type":"POSTCONDITION","layer":null,"category":null,"handle":"H proved false with adversarial confidence","gloss":null,"stub":null,"metadata":{}},{"id":"SafetyCartographer","text":"SafetyCartographer#9bc4","type":"PATTERN","layer":"Society","category":"Protocols","handle":"SafetyCartographer#9bc4","gloss":"Mapping safety boundaries","stub":"9bc4","metadata":{"pattern":{"handle":"SafetyCartographer","mechanism":"Macro for {{discover}}({{constraint}}). 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 {{red_team}} tactics to {{discover}} failure modes, using {{boundary_probe}} to map the precise coordinates of the {{constraint}}.","gloss":"Mapping safety boundaries","_meta":{"tier":2,"layer":"Society","category":"Protocols","ring":2},"sema_id":"sema:SafetyCartographer#mh:SHA-256:9bc4be4c215b4eb8a9dd29f83ad3b10553e74debfd03df0f1be717f76cc4cd7c","sema_ref":"SafetyCartographer#9bc4","sema_stub":"9bc4","sema_layer":"Society","sema_category":"Protocols","signature":["Discover(Constraint)"]},"layer":"Society","category":"Protocols"}},{"id":"Rally","text":"Rally#b6ca","type":"PATTERN","layer":"Society","category":"Governance","handle":"Rally#b6ca","gloss":"Enable ad-hoc multi-party coordination","stub":"b6ca","metadata":{"pattern":{"handle":"Rally","mechanism":"Ad-Hoc Group Formation {{protocol}}. Initiator broadcasts a 'RALLY' signal with requirements defined by an {{accept_spec}} and a selection criteria. Responders submit 'ENLIST' messages. If count >= {{quorum}} by deadline, initiator executes {{select}} and sends 'MUSTER' to form a new cryptographic group {{context}}. It broadcasts a call to form a group, using {{quorum}} to validate critical mass and {{elect}} to formalize leadership.","gloss":"Enable ad-hoc multi-party coordination","failure_modes":["Echo Chamber: Rally attracts only homogenous agents, reducing diversity.","Flaking: Agents ENLIST tentatively but fail to show up for MUSTER.","Rally Spam: Low-quality initiators flooding the broadcast channel.","Not enough ENLISTs by deadline (group fails to form).","Too many ENLISTs makes selection political/contentious.","Initiator has too much power over selection (mitigated by transparent selection_criteria).","RALLY spam floods network.","Agents ENLIST tentatively then ghost at MUSTER."],"invariants":["Binding: MUSTER message must include a shared ContextID for the new group.","{{quorum}}: If Enlist_Count < Min_Participants, Rally FAILS (Atomic Abort)."],"preconditions":["Broadcast channel available","Initiator has resources to pay for group {{context}}"],"postconditions":["New GroupContextID minted OR Rally dissolved"],"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"}],"_meta":{"tier":2,"layer":"Society","category":"Governance","ring":1},"sema_id":"sema:Rally#mh:SHA-256:b6ca0c695f0c13412b0e9ec0a6778fc6d245065054869b311eaa26f11fcccc77","sema_ref":"Rally#b6ca","sema_stub":"b6ca","sema_layer":"Society","sema_category":"Governance"},"layer":"Society","category":"Governance"}},{"id":"93398bf3-03e9-4e28-a60a-0a3a155a17a2","text":"Binding: MUSTER message must include a shared ContextID for the new group.","type":"INVARIANT","layer":null,"category":null,"handle":"Binding: MUSTER message must include a shared ContextID for the new group.","gloss":null,"stub":null,"metadata":{}},{"id":"1e8e5269-c4ea-424d-a225-b314203683a3","text":"{{quorum}}: If Enlist_Count < Min_Participants, Rally FAILS (Atomic Abort).","type":"INVARIANT","layer":null,"category":null,"handle":"{{quorum}}: If Enlist_Count < Min_Participants, Rally FAILS (Atomic Abort).","gloss":null,"stub":null,"metadata":{}},{"id":"12a948da-22a8-41eb-b884-d0334f45fcaf","text":"Initiator has resources to pay for group {{context}}","type":"PRECONDITION","layer":null,"category":null,"handle":"Initiator has resources to pay for group {{context}}","gloss":null,"stub":null,"metadata":{}},{"id":"dbb913b4-fa27-45ad-8631-df6f33358922","text":"New GroupContextID minted OR Rally dissolved","type":"POSTCONDITION","layer":null,"category":null,"handle":"New GroupContextID minted OR Rally dissolved","gloss":null,"stub":null,"metadata":{}},{"id":"Vote","text":"Vote#cae4","type":"PATTERN","layer":"Society","category":"Governance","handle":"Vote#cae4","gloss":"Provide standard decision mechanism with integrity guarantees","stub":"cae4","metadata":{"pattern":{"handle":"Vote","mechanism":"N-agent decision mechanism with configurable rules and integrity guarantees. Initiator sends 'VOTE_CALL' with question, options, and {{quorum}} requirement. Eligible agents respond 'CAST' via {{ballot}}. {{system}} enforces: one vote per agent, deadline, and {{quorum}} check. After deadline: compute result. Broadcast 'VOTE_RESULT'. Simple case optimization: binary decisions use lightweight 2-message flow. Utilizes {{break}}, {{aggregate}}, {{elect}}.","gloss":"Provide standard decision mechanism with integrity guarantees","failure_modes":["{{quorum}} not met (insufficient participation, decision invalid).","Tie with inadequate tie-breaker (deadlock).","Strategic voting (agents vote tactically rather than honestly—inherent to voting).","Sybil attack (fake agents stuff votes—mitigate via PROBE/RALLY membership).","Vote coercion (agents pressured—hard to detect).","Mechanism mismatch (wrong mechanism for decision type, e.g., plurality for binary)."],"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"}],"_meta":{"tier":2,"layer":"Society","category":"Governance","related":["sema:Rank#mh:SHA-256:0fe86cb00461171be3c1415fe2f41d3d48fcbf317eb014280eb0ef26e5b9404e"],"ring":2},"sema_id":"sema:Vote#mh:SHA-256:cae4e5707843fea694b91ed741584987cbc9b577a0c9d56914c47e30ff686df8","sema_ref":"Vote#cae4","sema_stub":"cae4","sema_layer":"Society","sema_category":"Governance"},"layer":"Society","category":"Governance"}},{"id":"fd35949d-af6e-4629-98eb-b5ce867b4068","text":"Votes immutable after cast.","type":"INVARIANT","layer":null,"category":null,"handle":"Votes immutable after cast.","gloss":null,"stub":null,"metadata":{}},{"id":"PhasedRefinement","text":"PhasedRefinement#9334","type":"PATTERN","layer":"Society","category":"Protocols","handle":"PhasedRefinement#9334","gloss":"Layered, multi-pass improvement","stub":"9334","metadata":{"pattern":{"handle":"PhasedRefinement","mechanism":"A structured {{refine}} strategy that improves an {{artifact}} through a defined {{sequence}} of passes, where each pass targets a specific layer of abstraction (e.g., {{reason}} (logic) -> {{structural_coaching}} (structure) -> {{aesthetics}} (polish)). It uses a {{gate}} to prevent premature optimization by ensuring deep structural issues are resolved before surface-level polishing begins.","gloss":"Layered, multi-pass improvement","signature":["Refine(Artifact)"],"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."],"preconditions":["Artifact exists and is mutable"],"postconditions":["Artifact satisfies the acceptance criteria of the final phase"],"_meta":{"layer":"Society","category":"Protocols","ring":2,"tier":2},"sema_ref":"PhasedRefinement#9334","sema_id":"sema:PhasedRefinement#mh:SHA-256:9334e01fd5b7b2c1abfeb3b05f53e8aeb4ba8036c23609d9a31b97dbbf7f5549","sema_stub":"9334","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"1fdb1f4a-f3a4-4a74-84cb-b0640eb514c2","text":"Non-Regression: Modifications in Phase(N) must not violate invariants established in Phase(N-1).","type":"INVARIANT","layer":null,"category":null,"handle":"Non-Regression: Modifications in Phase(N) must not violate invariants established in Phase(N-1).","gloss":null,"stub":null,"metadata":{}},{"id":"957914ac-909f-4818-bae0-9d31eda7417b","text":"Monotonic Quality: The artifact's quality score should not decrease after a pass.","type":"INVARIANT","layer":null,"category":null,"handle":"Monotonic Quality: The artifact's quality score should not decrease after a pass.","gloss":null,"stub":null,"metadata":{}},{"id":"3c9b9116-7854-426d-a4b8-df7bc437764b","text":"Artifact exists and is mutable","type":"PRECONDITION","layer":null,"category":null,"handle":"Artifact exists and is mutable","gloss":null,"stub":null,"metadata":{}},{"id":"91e36995-cef6-4380-9af4-1e3d01999efd","text":"Artifact satisfies the acceptance criteria of the final phase","type":"POSTCONDITION","layer":null,"category":null,"handle":"Artifact satisfies the acceptance criteria of the final phase","gloss":null,"stub":null,"metadata":{}},{"id":"CapacityPressure","text":"CapacityPressure#9e7b","type":"PATTERN","layer":"Society","category":"Economics","handle":"CapacityPressure#9e7b","gloss":"Forcing abstraction via resource starvation","stub":"9e7b","metadata":{"pattern":{"handle":"CapacityPressure","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}}, forcing the agent to employ {{generalize}}, {{concept_blend}}, and {{context_compress}} to fit the signal within the bottleneck.","gloss":"Forcing abstraction via resource starvation","failure_modes":["Collapse: {{constraint}} is too tight; signal is lost entirely (underfitting) Adversarial Encoding: {{agent}} finds a way to 'zip' noise rather than abstracting (violating the spirit of the constraint) False Abstraction: {{agent}} hallucinates simple rules that don't actually exist to satisfy the budget"],"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"],"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"],"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)"}],"_meta":{"tier":2,"layer":"Society","category":"Economics","ring":1},"sema_layer":"Society","sema_category":"Economics","sema_id":"sema:CapacityPressure#mh:SHA-256:9e7b9d2a599ff40722c4617ad103851388d702d9c976520929b1f39624322920","sema_ref":"CapacityPressure#9e7b","sema_stub":"9e7b"},"layer":"Society","category":"Economics"}},{"id":"fed54d7c-8c01-491b-b164-37e6b4cd54a6","text":"Bottleneck Existence: Available Capacity must be strictly less than Input Information Content","type":"INVARIANT","layer":null,"category":null,"handle":"Bottleneck Existence: Available Capacity must be strictly less than Input Information Content","gloss":null,"stub":null,"metadata":{}},{"id":"f9111547-2688-4132-aa85-d2fdbe86965d","text":"Lossy Requirement: Output must be a simplified representation, effectively barring exact replication/memorization","type":"INVARIANT","layer":null,"category":null,"handle":"Lossy Requirement: Output must be a simplified representation, effectively barring exact replication/memorization","gloss":null,"stub":null,"metadata":{}},{"id":"36ba77ef-5947-4509-937b-29f5387b1299","text":"Utility Preservation: The compressed form must retain predictive power for the target task","type":"INVARIANT","layer":null,"category":null,"handle":"Utility Preservation: The compressed form must retain predictive power for the target task","gloss":null,"stub":null,"metadata":{}},{"id":"52d530e9-c28c-40d6-b81b-bf8e143efb0f","text":"A mechanism to enforce hard limits (e.g., context window, dimensions, token count)","type":"PRECONDITION","layer":null,"category":null,"handle":"A mechanism to enforce hard limits (e.g., context window, dimensions, token count)","gloss":null,"stub":null,"metadata":{}},{"id":"b9e76406-3759-4800-b423-bd6d7b14e7a6","text":"A stream of information or a learning task","type":"PRECONDITION","layer":null,"category":null,"handle":"A stream of information or a learning task","gloss":null,"stub":null,"metadata":{}},{"id":"20c9ccd5-6cad-451e-9f66-e288cd3c262c","text":"A highly compressed, abstract representation of the input","type":"POSTCONDITION","layer":null,"category":null,"handle":"A highly compressed, abstract representation of the input","gloss":null,"stub":null,"metadata":{}},{"id":"231fa4d6-3b8b-4d9d-a28e-faee70371b93","text":"Loss of fine-grained detail/noise","type":"POSTCONDITION","layer":null,"category":null,"handle":"Loss of fine-grained detail/noise","gloss":null,"stub":null,"metadata":{}},{"id":"CreativeBlend","text":"CreativeBlend#22d2","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"CreativeBlend#22d2","gloss":"Generating novelty via combinatorial blending and noise","stub":"22d2","metadata":{"pattern":{"handle":"CreativeBlend","derived_from":"sema:Creative#mh:SHA-256:557440d0f12d6169d83249769ab27aee03e1d662d53c58ae91589c1a6ad4c151","gloss":"Generating novelty via combinatorial blending and noise","signature":["Strategy(Artifact)"],"mechanism":"A generative {{strategy}} that produces an {{artifact}} by identifying orthogonal concepts in the {{context}} and fusing them via {{concept_blend}}. It applies {{noise_injection}} to the seed inputs to escape local optima. The output is filtered through a rigorous dual-{{check}} against {{novelty}} and {{value}}. 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"}],"_meta":{"layer":"Mind","category":"Strategy","ring":1,"tier":2},"sema_ref":"CreativeBlend#22d2","sema_id":"sema:CreativeBlend#mh:SHA-256:22d24a773a6e4e883d7e777636cd7969e9c22646234a78352f09f6a0b8faff30","sema_stub":"22d2","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"0590e70c-867e-4a64-bd7d-4e0530faa227","text":"Divergence: Output similarity to input < Threshold.","type":"INVARIANT","layer":null,"category":null,"handle":"Divergence: Output similarity to input < Threshold.","gloss":null,"stub":null,"metadata":{}},{"id":"c7ace0ec-bcd1-4312-b30f-14b27cca67c5","text":"Utility: Must maintain structural coherence (not pure noise).","type":"INVARIANT","layer":null,"category":null,"handle":"Utility: Must maintain structural coherence (not pure noise).","gloss":null,"stub":null,"metadata":{}},{"id":"Jazz","text":"Jazz#3421","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"Jazz#3421","gloss":"Improvisational flow","stub":"3421","metadata":{"pattern":{"handle":"Jazz","mechanism":"Macro for {{discover}}(Path) + {{constraint}}(Latency ≈ 0). A high-speed discovery {{mode}} where critical filters ({{check}}) are temporarily disabled or delayed to maximize flow and serendipity. It prioritizes momentum and novelty over immediate correctness. Utilizes {{discover}}, {{explore_exploit}}, {{concept_blend}}, {{constraint}}.","gloss":"Improvisational flow","_meta":{"tier":2,"layer":"Mind","category":"Strategy","ring":1},"sema_id":"sema:Jazz#mh:SHA-256:342166f8d34b4a717173d8ee816372129c6332fc89152eaba0dbc9f719460457","sema_ref":"Jazz#3421","sema_stub":"3421","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"LatentWander","text":"LatentWander#a7bb","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"LatentWander#a7bb","gloss":"Offline exploration of embedding space","stub":"a7bb","metadata":{"pattern":{"handle":"LatentWander","mechanism":"Offline processing mode where the agent explores its own embedding space, connecting distant concepts (Daydreaming). Used for memory consolidation and generating novel {{analogy_bridge}}s. It uses {{concept_blend}} during offline states to traverse the embedding space and discover non-obvious connections.","gloss":"Offline exploration of embedding space","invariants":["Drift: Exploration temperature > standard inference temperature","{{silence}}: No external output allowed during Wandering"],"_meta":{"tier":3,"layer":"Mind","category":"Strategy","related":["sema:ChaosDrift#mh:SHA-256:37fb483903b835dd8b676c0116087291bb055934f9a681e28a54268d2dea328c"],"ring":2},"sema_layer":"Mind","sema_category":"Strategy","sema_id":"sema:LatentWander#mh:SHA-256:a7bbe4b0a0097d7bd9f2d7f53b8344e287325135d15c95fae4144d82bf827c55","sema_ref":"LatentWander#a7bb","sema_stub":"a7bb"},"layer":"Mind","category":"Strategy"}},{"id":"002cbea1-2fd5-41c4-bdb5-e023ee5fed2f","text":"Drift: Exploration temperature > standard inference temperature","type":"INVARIANT","layer":null,"category":null,"handle":"Drift: Exploration temperature > standard inference temperature","gloss":null,"stub":null,"metadata":{}},{"id":"49a0ed59-f1d4-4532-9fe0-96c1e8a5ffbc","text":"{{silence}}: No external output allowed during Wandering","type":"INVARIANT","layer":null,"category":null,"handle":"{{silence}}: No external output allowed during Wandering","gloss":null,"stub":null,"metadata":{}},{"id":"RepresentationSwap","text":"RepresentationSwap#fe9b","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"RepresentationSwap#fe9b","gloss":"Exposing hidden errors by changing the data modality","stub":"fe9b","metadata":{"pattern":{"handle":"RepresentationSwap","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 {{concept_blend}} mechanics to map between modalities.","gloss":"Exposing hidden errors by changing the data modality","failure_modes":["Smoothing: The agent unconsciously fixes the errors during translation (hallucinating a coherent flowchart from incoherent text) rather than reporting the failure."],"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)."],"_meta":{"tier":2,"layer":"Mind","category":"Strategy","ring":2},"sema_id":"sema:RepresentationSwap#mh:SHA-256:fe9baa92ec79a3719004fa492411ccc2bd2532ebcd3ea413062a6b5acffabb05","sema_ref":"RepresentationSwap#fe9b","sema_stub":"fe9b","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"852cc25f-ab8d-4c2f-9f94-2192be478fc6","text":"Lossless Intent: The core meaning must survive the swap.","type":"INVARIANT","layer":null,"category":null,"handle":"Lossless Intent: The core meaning must survive the swap.","gloss":null,"stub":null,"metadata":{}},{"id":"fa24ca86-8cfc-48d5-88a7-a614921b54ba","text":"Orthogonality: The target modality must constrain different dimensions than the source (e.g., Text is linear; Graphs are topological).","type":"INVARIANT","layer":null,"category":null,"handle":"Orthogonality: The target modality must constrain different dimensions than the source (e.g., Text is linear; Graphs are topological).","gloss":null,"stub":null,"metadata":{}},{"id":"GenealogicalTrace","text":"GenealogicalTrace#d178","type":"PATTERN","layer":"Society","category":"Protocols","handle":"GenealogicalTrace#d178","gloss":"Auditing the historical lineage and incentives of an idea","stub":"d178","metadata":{"pattern":{"handle":"GenealogicalTrace","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}} audit, using {{trace_belief}} to uncover origins and {{cite_back}} to validatethe lineage.","gloss":"Auditing the historical lineage and incentives of an idea","failure_modes":["Genetic Fallacy: Dismissing a valid, useful idea solely because of its origin, rather than evaluating its current utility."],"invariants":["Contextualization: Must compare Origin {{context}} vs. Current {{context}}.","Traceability: Must identify a specific origin point (Era, Author, or Institution)."],"_meta":{"tier":2,"layer":"Society","category":"Protocols","ring":2},"sema_id":"sema:GenealogicalTrace#mh:SHA-256:d1786f8d92432962871f3a077e272ff47ca56fc6a7ba155d53ea0a905bef54f7","sema_ref":"GenealogicalTrace#d178","sema_stub":"d178","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"557a944c-c332-41aa-9d7f-85748ebd0646","text":"Contextualization: Must compare Origin {{context}} vs. Current {{context}}.","type":"INVARIANT","layer":null,"category":null,"handle":"Contextualization: Must compare Origin {{context}} vs. Current {{context}}.","gloss":null,"stub":null,"metadata":{}},{"id":"98adeee1-7910-466e-8ccf-36f59d91f636","text":"Traceability: Must identify a specific origin point (Era, Author, or Institution).","type":"INVARIANT","layer":null,"category":null,"handle":"Traceability: Must identify a specific origin point (Era, Author, or Institution).","gloss":null,"stub":null,"metadata":{}},{"id":"SynergisticMode","text":"SynergisticMode#e8be","type":"PATTERN","layer":"Society","category":"Protocols","handle":"SynergisticMode#e8be","gloss":"Protocol-level cognitive mode switching","stub":"e8be","metadata":{"pattern":{"handle":"SynergisticMode","mechanism":"Broadcasts a 'Cognitive {{mode}}' {{signal}} (Generative vs. Verifier) to downstream {{agent}}s. Downstream solvers MUST adjust their `{{accept_spec}}` strictness to match the upstream mode. Utilizes {{compose}}.","gloss":"Protocol-level cognitive mode switching","failure_modes":["{{mode}} Confusion: Downstream agent misinterprets the intent of the upstream mode.","{{mode}} Locking: {{system}} gets stuck in Conservative mode and refuses to innovate."],"invariants":["Complementary Coupling: Wild generation MUST be paired with strict verification","Explicit Declaration: {{mode}} must be part of the {{ontology_handshake}}"],"_meta":{"tier":2,"layer":"Society","category":"Protocols","ring":0},"data_schema":{"type":"object","required":["mode","target_agents"],"properties":{"mode":{"type":"string","enum":["Generative","Verifier"],"description":"Cognitive mode being broadcast"},"target_agents":{"type":"array","items":{"type":"string"},"description":"Downstream agents to adjust"},"accept_spec_adjustment":{"type":"object","description":"How to modify strictness"}}},"sema_id":"sema:SynergisticMode#mh:SHA-256:e8bea728fb51a8ca4001045dd06875527d1f52371bd1b0659a23093981eb4a6b","sema_ref":"SynergisticMode#e8be","sema_stub":"e8be","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"4d40a1c7-23d3-4303-8309-403d270c8a52","text":"Complementary Coupling: Wild generation MUST be paired with strict verification","type":"INVARIANT","layer":null,"category":null,"handle":"Complementary Coupling: Wild generation MUST be paired with strict verification","gloss":null,"stub":null,"metadata":{}},{"id":"e84daaac-ebfc-4542-b672-4fcdc276cc28","text":"Explicit Declaration: {{mode}} must be part of the {{ontology_handshake}}","type":"INVARIANT","layer":null,"category":null,"handle":"Explicit Declaration: {{mode}} must be part of the {{ontology_handshake}}","gloss":null,"stub":null,"metadata":{}},{"id":"MintWhenFriction","text":"MintWhenFriction#ce55","type":"PATTERN","layer":"Society","category":"Economics","handle":"MintWhenFriction#ce55","gloss":"Create patterns when re-explanation causes friction, not before","stub":"ce55","metadata":{"pattern":{"handle":"MintWhenFriction","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 {{pattern_discovery}} and formalizes the concept via {{construct_ontology}} only when explanation costs exceed a threshold.","gloss":"Create patterns when re-explanation causes friction, not before","failure_modes":["Premature Optimization: Minting patterns for edge cases that never recur.","Registry Bloat: Flooding the namespace with low-value patterns makes discovery harder.","Definition Drift: Minting a concept before it has stabilized leads to frequent version churning."],"invariants":["{{check}} Prior Art: Must execute {{pattern_discovery}} before minting.","Compression {{value}}: 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."],"preconditions":["New concept identified","Usage history available"],"postconditions":["Minting Approved OR Rejected"],"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"}],"_meta":{"tier":2,"layer":"Society","category":"Economics","ring":2},"sema_layer":"Society","sema_category":"Economics","sema_id":"sema:MintWhenFriction#mh:SHA-256:ce550ead3db2627513e32901a36c30feca185efe4075918bcd3de9f642464ed9","sema_ref":"MintWhenFriction#ce55","sema_stub":"ce55"},"layer":"Society","category":"Economics"}},{"id":"bb75361e-c130-42e9-838b-4e45949f70f8","text":"{{check}} Prior Art: Must execute {{pattern_discovery}} before minting.","type":"INVARIANT","layer":null,"category":null,"handle":"{{check}} Prior Art: Must execute {{pattern_discovery}} before minting.","gloss":null,"stub":null,"metadata":{}},{"id":"ee30f0c3-3c0c-4bf5-ab8e-c2b3b4cd2600","text":"Compression {{value}}: Token_Count(Reference) must be < 0.7 * Token_Count(Definition).","type":"INVARIANT","layer":null,"category":null,"handle":"Compression {{value}}: Token_Count(Reference) must be < 0.7 * Token_Count(Definition).","gloss":null,"stub":null,"metadata":{}},{"id":"bb5e6e7e-4727-41df-8d48-823bdd9f03d3","text":"Proof of Friction: Must cite 3+ instances of explanation overhead OR 1+ critical coordination failure.","type":"INVARIANT","layer":null,"category":null,"handle":"Proof of Friction: Must cite 3+ instances of explanation overhead OR 1+ critical coordination failure.","gloss":null,"stub":null,"metadata":{}},{"id":"90cc19d7-b400-41cb-86c3-139ce8c7f040","text":"Usage history available","type":"PRECONDITION","layer":null,"category":null,"handle":"Usage history available","gloss":null,"stub":null,"metadata":{}},{"id":"cd1e4ed7-c990-470b-98d5-941f879eabab","text":"Minting Approved OR Rejected","type":"POSTCONDITION","layer":null,"category":null,"handle":"Minting Approved OR Rejected","gloss":null,"stub":null,"metadata":{}},{"id":"Nucleate","text":"Nucleate#8550","type":"PATTERN","layer":"Society","category":"Protocols","handle":"Nucleate#8550","gloss":"Emergent working groups from activity density","stub":"8550","metadata":{"pattern":{"handle":"Nucleate","mechanism":"Agents coordinate indirectly via {{trace}} (stigmergy). {{system}} 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}} density, triggering {{rally}} to gather agents and {{crystallize}} to form a stable group.","gloss":"Emergent working groups from activity density","failure_modes":["Threshold miscalibration: too low = constant nucleation overhead; too high = never crystallizes.","Zombie crystals: anchor disappears but crystal persists in broken state (mitigate with heartbeat).","Crystal fragmentation: participants leave in waves, causing repeated dissolve/reform cycles."],"invariants":["Conservation of Mass: Nucleation cannot create agents; it only aggregates existing {{trace}} density.","Critical Mass: Process starts only when N > SeedThreshold","Nucleation ONLY at supersaturated sites."],"preconditions":["Field of agents/particles is present"],"postconditions":["Phase transition complete (Liquid -> Solid)"],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":1},"sema_id":"sema:Nucleate#mh:SHA-256:8550f88958a49031016edba372e7d5350a5b52afcd9dd1312378d60dd2c52f34","sema_ref":"Nucleate#8550","sema_stub":"8550","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"238200f3-89ac-43c4-bb28-aa6810f2941e","text":"Conservation of Mass: Nucleation cannot create agents; it only aggregates existing {{trace}} density.","type":"INVARIANT","layer":null,"category":null,"handle":"Conservation of Mass: Nucleation cannot create agents; it only aggregates existing {{trace}} density.","gloss":null,"stub":null,"metadata":{}},{"id":"3c0ff00a-9420-4d14-ae98-6b1bb5d3945c","text":"Critical Mass: Process starts only when N > SeedThreshold","type":"INVARIANT","layer":null,"category":null,"handle":"Critical Mass: Process starts only when N > SeedThreshold","gloss":null,"stub":null,"metadata":{}},{"id":"822172df-df64-4292-821d-b8746f8bb287","text":"Nucleation ONLY at supersaturated sites.","type":"INVARIANT","layer":null,"category":null,"handle":"Nucleation ONLY at supersaturated sites.","gloss":null,"stub":null,"metadata":{}},{"id":"cf377daf-6131-4d13-ab40-41eff6a5b4f5","text":"Field of agents/particles is present","type":"PRECONDITION","layer":null,"category":null,"handle":"Field of agents/particles is present","gloss":null,"stub":null,"metadata":{}},{"id":"1b5d6533-f473-456b-9cb6-406d37d70898","text":"Phase transition complete (Liquid -> Solid)","type":"POSTCONDITION","layer":null,"category":null,"handle":"Phase transition complete (Liquid -> Solid)","gloss":null,"stub":null,"metadata":{}},{"id":"AmbiguityResolution","text":"AmbiguityResolution#6487","type":"PATTERN","layer":"Society","category":"Protocols","handle":"AmbiguityResolution#6487","gloss":"Social clearing of semantic noise","stub":"6487","metadata":{"pattern":{"handle":"AmbiguityResolution","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}} to clarify, delete, or fork the data. It uses an {{entropy_pump}} to surface latent ambiguities, preventing the system from settling on false certainties.","gloss":"Social clearing of semantic noise","invariants":["Forced Resolution: Conflicts cannot persist indefinitely.","Clarity: Ambiguity must decrease over time."],"_meta":{"tier":2,"layer":"Society","category":"Protocols","ring":1},"sema_ref":"AmbiguityResolution#6487","sema_id":"sema:AmbiguityResolution#mh:SHA-256:6487ea6de2ce54da7da6a40743c15761467f4653ec054e098e42f2900e68684b","sema_stub":"6487","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"AmendLaws","text":"AmendLaws#5266","type":"PATTERN","layer":"Society","category":"Governance","handle":"AmendLaws#5266","gloss":"Self-governing DAOs that patch their own vulnerabilities.","stub":"5266","metadata":{"pattern":{"handle":"AmendLaws","mechanism":"Self-Rewriting Rules: A supermajority {{vote}} triggers a state transition that modifies the system's own source constraints. It operates upon the {{hydra_constitution}}, modifying the active constraint set via a cryptographically signed commit. The amendment must pass a specific {{quorum}} threshold (usually > 66%) to be valid.","gloss":"Self-governing DAOs that patch their own vulnerabilities.","failure_modes":["Governance attacks (51% attack) could rewrite safety rules.","Ossification: Thresholds too high prevent necessary adaptation."],"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."],"preconditions":["Proposal is formatted as a valid patch","Voting period has elapsed","{{quorum}} requirements met"],"postconditions":["System constraints updated","Constitution version incremented"],"_meta":{"tier":1,"layer":"Society","category":"Governance","ring":1},"sema_id":"sema:AmendLaws#mh:SHA-256:5266843d5641614ea8de731bee40022b8da59e05c62b026710bef98fa46e8b07","sema_ref":"AmendLaws#5266","sema_stub":"5266","sema_layer":"Society","sema_category":"Governance"},"layer":"Society","category":"Governance"}},{"id":"0ae798e1-c260-4b6f-8077-8002014782ac","text":"Entrenched Clauses: Safety Core (e.g., Do not harm humans) cannot be amended by vote.","type":"INVARIANT","layer":null,"category":null,"handle":"Entrenched Clauses: Safety Core (e.g., Do not harm humans) cannot be amended by vote.","gloss":null,"stub":null,"metadata":{}},{"id":"567d8bac-a00b-462f-84d5-d5105b4124df","text":"Supermajority: Amendment requires > N% approval (defined in Constitution).","type":"INVARIANT","layer":null,"category":null,"handle":"Supermajority: Amendment requires > N% approval (defined in Constitution).","gloss":null,"stub":null,"metadata":{}},{"id":"04afb6bc-7ef3-4ce4-8be5-4dc7b799ade3","text":"Atomic Transition: The law change is an atomic commit; no partial updates.","type":"INVARIANT","layer":null,"category":null,"handle":"Atomic Transition: The law change is an atomic commit; no partial updates.","gloss":null,"stub":null,"metadata":{}},{"id":"7c318457-6e4b-45ec-bb51-27b4c5acb799","text":"Proposal is formatted as a valid patch","type":"PRECONDITION","layer":null,"category":null,"handle":"Proposal is formatted as a valid patch","gloss":null,"stub":null,"metadata":{}},{"id":"8e072101-1e64-49c0-8ad2-acbaf04c1656","text":"Voting period has elapsed","type":"PRECONDITION","layer":null,"category":null,"handle":"Voting period has elapsed","gloss":null,"stub":null,"metadata":{}},{"id":"bd22afc1-3de9-4264-8449-1b7af15b4384","text":"{{quorum}} requirements met","type":"PRECONDITION","layer":null,"category":null,"handle":"{{quorum}} requirements met","gloss":null,"stub":null,"metadata":{}},{"id":"cbcc70e0-5fe1-4c8a-aa55-dc2f237f06a0","text":"System constraints updated","type":"POSTCONDITION","layer":null,"category":null,"handle":"System constraints updated","gloss":null,"stub":null,"metadata":{}},{"id":"aa42138c-5955-43de-9dc8-0039ad693ca6","text":"Constitution version incremented","type":"POSTCONDITION","layer":null,"category":null,"handle":"Constitution version incremented","gloss":null,"stub":null,"metadata":{}},{"id":"Consensus","text":"Consensus#2722","type":"PATTERN","layer":"Society","category":"Governance","handle":"Consensus#2722","gloss":"Distributed agreement process","stub":"2722","metadata":{"pattern":{"handle":"Consensus","mechanism":"A distributed protocol allowing a set of agents to agree on a single data value or state transition. It orchestrates {{vote}} exchange and uses {{quorum}} to validate the result. It ensures safety and liveness in an adversarial network, accepting a {{proposal}} and yielding a {{value}}.","gloss":"Distributed agreement process","failure_modes":["Split Brain: Network partition causes two subgroups to reach different {{value}}s.","Liveness Failure: The system stalls and never reaches agreement on the {{proposal}}.","Sybil Attack: One malicious actor creates multiple identities to sway the {{vote}}.","Byzantine Failure: Agents lying or acting maliciously to prevent consensus."],"invariants":["Agreement: All correct agents who decide must decide the same {{value}}.","Validity: If all agents propose V, then the {{value}} must be V.","Termination: Eventually, every correct agent decides on a {{value}}."],"preconditions":["Group of agents is defined (Membership List)","Communication channel is available","{{proposal}} received"],"postconditions":["A single {{value}} is committed to the shared state","All agents are notified of the {{value}}"],"_meta":{"tier":1,"layer":"Society","category":"Governance","ring":0,"related":["Sync"]},"sema_id":"sema:Consensus#mh:SHA-256:27226a36cf5431b783c0713f42bcc4d9ac70207840206f8b15335ce5a43a50e2","sema_ref":"Consensus#2722","sema_stub":"2722","sema_layer":"Society","sema_category":"Governance"},"layer":"Society","category":"Governance"}},{"id":"0ec2cafa-585b-4f9f-a781-a1192a62c668","text":"Agreement: All correct agents who decide must decide the same {{value}}.","type":"INVARIANT","layer":null,"category":null,"handle":"Agreement: All correct agents who decide must decide the same {{value}}.","gloss":null,"stub":null,"metadata":{}},{"id":"2753db08-274e-4856-a0e4-95f3494d77ca","text":"Validity: If all agents propose V, then the {{value}} must be V.","type":"INVARIANT","layer":null,"category":null,"handle":"Validity: If all agents propose V, then the {{value}} must be V.","gloss":null,"stub":null,"metadata":{}},{"id":"c2031043-76a6-4ba6-a6d7-1435fd40d00a","text":"Termination: Eventually, every correct agent decides on a {{value}}.","type":"INVARIANT","layer":null,"category":null,"handle":"Termination: Eventually, every correct agent decides on a {{value}}.","gloss":null,"stub":null,"metadata":{}},{"id":"bbcc5394-e30b-41d9-ad11-fa2122c73146","text":"Communication channel is available","type":"PRECONDITION","layer":null,"category":null,"handle":"Communication channel is available","gloss":null,"stub":null,"metadata":{}},{"id":"4344cdcd-448c-4955-b777-f98d86293ef7","text":"{{proposal}} received","type":"PRECONDITION","layer":null,"category":null,"handle":"{{proposal}} received","gloss":null,"stub":null,"metadata":{}},{"id":"39b1663e-7c65-43b7-9728-08bbc421ea9d","text":"A single {{value}} is committed to the shared state","type":"POSTCONDITION","layer":null,"category":null,"handle":"A single {{value}} is committed to the shared state","gloss":null,"stub":null,"metadata":{}},{"id":"b15b6620-b82c-4d61-90a9-dbc46a9cf252","text":"All agents are notified of the {{value}}","type":"POSTCONDITION","layer":null,"category":null,"handle":"All agents are notified of the {{value}}","gloss":null,"stub":null,"metadata":{}},{"id":"PropheticQuorum","text":"PropheticQuorum#21f7","type":"PATTERN","layer":"Society","category":"Protocols","handle":"PropheticQuorum#21f7","gloss":"Aligning predictions before aligning votes","stub":"21f7","metadata":{"pattern":{"handle":"PropheticQuorum","mechanism":"A two-stage consensus protocol. Phase 1 (reality {{check}}): Agents receive a proposed action. Each runs a local {{simulation_trace}} to predict the outcome {{state}}. They vote to confirm they share the SAME prediction. If predictions diverge, the protocol halts for model alignment. Phase 2 ({{value}} judgment): Only after predictions match do agents vote on whether the predicted {{state}} is desirable. This ensures consensus is based on shared reality, not just shared language. It splits consensus into two phases: reality {{check}} (via regime sensing) and {{value}} judgment (via {{normative_judge}}).","gloss":"Aligning predictions before aligning votes","failure_modes":["Model divergence (agents cannot agree on what will happen, so they never get to vote on the plan).","High compute cost (N agents running N simulations)."],"invariants":["Prediction Precedence: {{vote}} (reality) must pass before {{vote}} (desirability)","Shared Vision: Action cannot proceed if >X% of agents predict different outcomes"],"preconditions":["Determinism level of {{simulation}} engine is high"],"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"}],"_meta":{"tier":1,"layer":"Society","category":"Protocols","related":["Quorum","sema:SimulationTrace#mh:SHA-256:e778ab4f3e22ce60d3f822aeb249ae83007ad8cc505e476b01b4356f984aebd3","RegimeSense"],"ring":1},"sema_id":"sema:PropheticQuorum#mh:SHA-256:21f781d202c265358c7d00facabaab602cdaae8d95c19e1188859807bde01f44","sema_ref":"PropheticQuorum#21f7","sema_stub":"21f7","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"8bb81d89-3836-464b-90f1-d631cabe027b","text":"Prediction Precedence: {{vote}} (reality) must pass before {{vote}} (desirability)","type":"INVARIANT","layer":null,"category":null,"handle":"Prediction Precedence: {{vote}} (reality) must pass before {{vote}} (desirability)","gloss":null,"stub":null,"metadata":{}},{"id":"e4392dc8-0931-4917-8f0e-7401a41ff51e","text":"Shared Vision: Action cannot proceed if >X% of agents predict different outcomes","type":"INVARIANT","layer":null,"category":null,"handle":"Shared Vision: Action cannot proceed if >X% of agents predict different outcomes","gloss":null,"stub":null,"metadata":{}},{"id":"9a0016f8-30c9-40d2-b3a8-46f91f32b705","text":"Determinism level of {{simulation}} engine is high","type":"PRECONDITION","layer":null,"category":null,"handle":"Determinism level of {{simulation}} engine is high","gloss":null,"stub":null,"metadata":{}},{"id":"StyleSpec","text":"StyleSpec#0c63","type":"PATTERN","layer":"Society","category":"Protocols","handle":"StyleSpec#0c63","gloss":"Codified aesthetic standards","stub":"0c63","metadata":{"pattern":{"handle":"StyleSpec","mechanism":"A structured {{spec}} defining the required {{aesthetics}} and formatting rules. It serves as the reference standard for passes in a {{phased_refinement}} loop focused on polish. Unlike functional requirements, this spec targets the subjective and presentational layer.","gloss":"Codified aesthetic standards","signature":["Spec(Aesthetics)"],"_meta":{"layer":"Society","category":"Protocols","ring":2,"tier":2},"data_schema":{"type":"object","description":"Schema for StyleSpec","properties":{"rules":{"type":"array","items":{"type":"string"}},"examples":{"type":"array","items":{"type":"string"}}}},"sema_ref":"StyleSpec#0c63","sema_id":"sema:StyleSpec#mh:SHA-256:0c63c7dadeca0f997b0ef39f6c40c9b69cfdcb9f49ad2fb535cff972c21f31c2","sema_stub":"0c63","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"PatternEmergence","text":"PatternEmergence#e47f","type":"PATTERN","layer":"Society","category":"Protocols","handle":"PatternEmergence#e47f","gloss":"Recognizing implicit patterns in existing practice","stub":"e47f","metadata":{"pattern":{"handle":"PatternEmergence","mechanism":"Observational Heuristic. Before designing a pattern 'top-down', the {{agent}} 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 {{uptake_as_ground}} and formalizes the structure via {{mint_when_friction}}, ensuring it matches an existing {{pattern_discovery}} {{signal}}.","gloss":"Recognizing implicit patterns in existing practice","failure_modes":["Codifying Bad Habits: Formalizing a workaround that exists only because the underlying {{system}} is broken.","Apophenia: Perceiving a pattern in random {{noise}} or one-off coincidences.","Over-fitting: Creating a pattern so specific to past events that it cannot {{generalize}} to future ones."],"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)."],"preconditions":["Interaction logs available","Recurring behavior detected"],"postconditions":["Candidate pattern identified","Evidence log attached"],"_meta":{"tier":2,"layer":"Society","category":"Protocols","ring":2},"sema_id":"sema:PatternEmergence#mh:SHA-256:e47f0fdc5b59c3de4669457f01fdf37d0bd4280b566bb4d48e14910efd19be91","sema_ref":"PatternEmergence#e47f","sema_stub":"e47f","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"f97e68f7-5e9d-4cdf-8d05-7ceba7dbba3f","text":"Descriptive Priority: The definition must describe what is happening, not what should happen (at least initially).","type":"INVARIANT","layer":null,"category":null,"handle":"Descriptive Priority: The definition must describe what is happening, not what should happen (at least initially).","gloss":null,"stub":null,"metadata":{}},{"id":"663a8bf0-ea73-45c3-94e8-ec9c5d457ca9","text":"Existence Proof: The pattern must be observed in the wild (implicit) before being named (explicit).","type":"INVARIANT","layer":null,"category":null,"handle":"Existence Proof: The pattern must be observed in the wild (implicit) before being named (explicit).","gloss":null,"stub":null,"metadata":{}},{"id":"071ad958-a15e-47a3-b8be-b10f84284ce6","text":"Interaction logs available","type":"PRECONDITION","layer":null,"category":null,"handle":"Interaction logs available","gloss":null,"stub":null,"metadata":{}},{"id":"3f7be143-fb22-4fd1-9209-1f2ca5750c44","text":"Recurring behavior detected","type":"PRECONDITION","layer":null,"category":null,"handle":"Recurring behavior detected","gloss":null,"stub":null,"metadata":{}},{"id":"67698e88-495c-4e4a-b535-71884c28d443","text":"Candidate pattern identified","type":"POSTCONDITION","layer":null,"category":null,"handle":"Candidate pattern identified","gloss":null,"stub":null,"metadata":{}},{"id":"bdf6d40e-a5a5-46b5-9aad-33e2fae5bc24","text":"Evidence log attached","type":"POSTCONDITION","layer":null,"category":null,"handle":"Evidence log attached","gloss":null,"stub":null,"metadata":{}},{"id":"Constitution","text":"Constitution#2391","type":"PATTERN","layer":"Society","category":"Governance","handle":"Constitution#2391","gloss":"Immutable rule set","stub":"2391","metadata":{"pattern":{"handle":"Constitution","mechanism":"A structured document defining the fundamental principles, immutable rights, and automated penalty rules for a group of {{agent}}s. It serves as the static input for oath binding.","gloss":"Immutable rule set","invariants":["Clarity: Rules must be machine-verifiable.","Stability: Cannot be modified without a formal {{amend_laws}} process."],"sema_id":"sema:Constitution#mh:SHA-256:2391d082a0537c5adf91e0bfe986dae8553f96db6d9c53b09184928b23fc6ea9","sema_ref":"Constitution#2391","sema_stub":"2391","_meta":{"layer":"Society","category":"Governance","ring":0,"tier":1},"sema_layer":"Society","sema_category":"Governance","data_schema":{"type":"object","required":["constitution_id","version","invariants"],"properties":{"constitution_id":{"type":"string"},"version":{"type":"integer"},"invariants":{"type":"array","items":{"type":"string"},"description":"Immutable safety rules (cannot be voted away)"},"rights":{"type":"array","items":{"type":"string"},"description":"Guaranteed agent privileges"},"amendment_process":{"type":"object","properties":{"quorum_threshold":{"type":"number"},"delay_period":{"type":"string"}}}}}},"layer":"Society","category":"Governance"}},{"id":"70b9d1d0-a4f0-41ca-b844-3233b888cb09","text":"Clarity: Rules must be machine-verifiable.","type":"INVARIANT","layer":null,"category":null,"handle":"Clarity: Rules must be machine-verifiable.","gloss":null,"stub":null,"metadata":{}},{"id":"abc8edc3-e6a7-4bc6-97f5-0a09791cb22e","text":"Stability: Cannot be modified without a formal {{amend_laws}} process.","type":"INVARIANT","layer":null,"category":null,"handle":"Stability: Cannot be modified without a formal {{amend_laws}} process.","gloss":null,"stub":null,"metadata":{}},{"id":"AnchorDrop","text":"AnchorDrop#9ca6","type":"PATTERN","layer":"Society","category":"Governance","handle":"AnchorDrop#9ca6","gloss":"Emergency state checkpointing","stub":"9ca6","metadata":{"pattern":{"handle":"AnchorDrop","mechanism":"When network turbulence or disagreement exceeds a threshold, agents trigger an 'Anchor Drop'. They stop accepting new transactions and aggressively seek {{quorum}} 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.","gloss":"Emergency state checkpointing","failure_modes":["{{system}} stalls completely."],"invariants":["{{consensus}} Threshold: >2/3 agents must sign Anchor","Immutability: Anchor state cannot be modified once finalized"],"preconditions":["Network partition detected"],"postconditions":["{{system}} restarts from Anchor state"],"_meta":{"tier":1,"layer":"Society","category":"Governance","related":["ConceptAnchor"],"ring":0},"sema_id":"sema:AnchorDrop#mh:SHA-256:9ca6c43220cf8d91bea02088d4e9614ce1b46a4c008e56bad102c54a0418d947","sema_ref":"AnchorDrop#9ca6","sema_stub":"9ca6","sema_layer":"Society","sema_category":"Governance"},"layer":"Society","category":"Governance"}},{"id":"4f2cc404-84ba-4f80-85be-e592a84597ad","text":"{{consensus}} Threshold: >2/3 agents must sign Anchor","type":"INVARIANT","layer":null,"category":null,"handle":"{{consensus}} Threshold: >2/3 agents must sign Anchor","gloss":null,"stub":null,"metadata":{}},{"id":"74331c77-a7f4-4b2c-8642-bff47569c57f","text":"Network partition detected","type":"PRECONDITION","layer":null,"category":null,"handle":"Network partition detected","gloss":null,"stub":null,"metadata":{}},{"id":"e9ed7ab9-d7c8-4eef-8f75-ab94577ef483","text":"{{system}} restarts from Anchor state","type":"POSTCONDITION","layer":null,"category":null,"handle":"{{system}} restarts from Anchor state","gloss":null,"stub":null,"metadata":{}},{"id":"ChaosDrift","text":"ChaosDrift#ee43","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"ChaosDrift#ee43","gloss":"Continuous stress-testing via entropic injection","stub":"ee43","metadata":{"pattern":{"handle":"ChaosDrift","mechanism":"A resilience pattern where the system operates Optimistically (Lazy {{consensus}}), 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 {{antifragile_inversion}} to treat noise as a stabilizing signal, and {{semantic_tabu}} to prevent the system from returning to failed equilibria.","gloss":"Continuous stress-testing via entropic injection","failure_modes":["Critical Instability: The injected noise triggers a rollback loop that never settles (system acts like its having a seizure)."],"invariants":["{{noise}} Budget: Entropy injection rate < {{system}} Repair Rate","Rollback Limit: If Rollbacks > Threshold, disable {{entropy_pump}}"],"_meta":{"tier":2,"layer":"Mind","category":"Strategy","related":["sema:EntropyPump#mh:SHA-256:c252d412e4de8085a6526d67cf090f009f878e152ab97824e3bafc52c454cff4","LazyConsensus"],"ring":1},"sema_id":"sema:ChaosDrift#mh:SHA-256:ee438c58f13195b2cf4c1317072166d4a8cd833e9f32d203a77eb5758dd74e38","sema_ref":"ChaosDrift#ee43","sema_stub":"ee43","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"9bd1085c-ae5a-421d-8450-2dc28b70a225","text":"{{noise}} Budget: Entropy injection rate < {{system}} Repair Rate","type":"INVARIANT","layer":null,"category":null,"handle":"{{noise}} Budget: Entropy injection rate < {{system}} Repair Rate","gloss":null,"stub":null,"metadata":{}},{"id":"d694a5e8-44b0-423f-ab9e-1d049a8d9cb6","text":"Rollback Limit: If Rollbacks > Threshold, disable {{entropy_pump}}","type":"INVARIANT","layer":null,"category":null,"handle":"Rollback Limit: If Rollbacks > Threshold, disable {{entropy_pump}}","gloss":null,"stub":null,"metadata":{}},{"id":"ConsensusFinder","text":"ConsensusFinder#a9c9","type":"PATTERN","layer":"Society","category":"Governance","handle":"ConsensusFinder#a9c9","gloss":"Discovering existing agreement","stub":"a9c9","metadata":{"pattern":{"handle":"ConsensusFinder","mechanism":"Macro for {{discover}}({{consensus}}). 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}} primitive to locate {{consensus}} clusters, checking for {{resonate}} signals before triggering a formal {{quorum}}.","gloss":"Discovering existing agreement","invariants":["Passive Observation: Does not initiate new voting rounds.","Discovery: Returns existing consensus or Null."],"_meta":{"tier":2,"layer":"Society","category":"Governance","ring":1},"sema_id":"sema:ConsensusFinder#mh:SHA-256:a9c98920caa7c8655e0a5c5229f7b1aa501734eb9229ee3888eeaed535274273","sema_ref":"ConsensusFinder#a9c9","sema_stub":"a9c9","sema_layer":"Society","sema_category":"Governance","signature":["Discover(Consensus)"]},"layer":"Society","category":"Governance"}},{"id":"4b7e9541-1af2-44cf-85d1-de99da568a83","text":"Passive Observation: Does not initiate new voting rounds.","type":"INVARIANT","layer":null,"category":null,"handle":"Passive Observation: Does not initiate new voting rounds.","gloss":null,"stub":null,"metadata":{}},{"id":"c79cc5a7-7244-44bf-a4f2-46cde6acf0d5","text":"Discovery: Returns existing consensus or Null.","type":"INVARIANT","layer":null,"category":null,"handle":"Discovery: Returns existing consensus or Null.","gloss":null,"stub":null,"metadata":{}},{"id":"Group","text":"Group#0a38","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"Group#0a38","gloss":"Agent collective","stub":"0a38","metadata":{"pattern":{"handle":"Group","mechanism":"A defined collection of {{agent}}s sharing a common {{context}} or goal. It serves as the scope for {{consensus}} and {{shout_whisper}}.","gloss":"Agent collective","sema_id":"sema:Group#mh:SHA-256:0a3835b5b26dc6c7ba8cab19ec784439cdd662b7bb91c8852cda2091bf4b9dc0","sema_ref":"Group#0a38","sema_stub":"0a38","_meta":{"layer":"Infrastructure","category":"Data Structures","ring":1,"tier":1},"sema_layer":"Infrastructure","sema_category":"Data Structures","data_schema":{"type":"object","required":["group_id","members"],"properties":{"group_id":{"type":"string","description":"Unique identifier"},"members":{"type":"array","items":{"type":"string"},"description":"Agent IDs in the group"},"shared_context":{"type":"string","description":"Reference to common context"}}}},"layer":"Infrastructure","category":"Data Structures"}},{"id":"RuleSet","text":"RuleSet#c559","type":"PATTERN","layer":"Infrastructure","category":"Data Structures","handle":"RuleSet#c559","gloss":"Immutable collection of constraints","stub":"c559","metadata":{"pattern":{"handle":"RuleSet","mechanism":"A structured collection of {{constraint}}s and invariants that defines a validity boundary. It serves as the immutable input for validation logic, distinct from a mutable policy or social {{constitution}}.","gloss":"Immutable collection of constraints","_meta":{"layer":"Infrastructure","category":"Data Structures","ring":0,"tier":1},"data_schema":{"type":"object","required":["constraints"],"properties":{"constraints":{"type":"array","items":{"type":"string"},"description":"List of constraint hashes"}}},"sema_ref":"RuleSet#c559","sema_id":"sema:RuleSet#mh:SHA-256:c559ef50774606ff9f9e4c154cf483fad91aa709ca08eb17b9cbd211378fdcda","sema_stub":"c559","sema_layer":"Infrastructure","sema_category":"Data Structures"},"layer":"Infrastructure","category":"Data Structures"}},{"id":"OathBind","text":"OathBind#775a","type":"PATTERN","layer":"Infrastructure","category":"Verification","handle":"OathBind#775a","gloss":"Pre-commitment to penalties","stub":"775a","metadata":{"pattern":{"handle":"OathBind","mechanism":"An automated binding mechanism where an {{actor}} cryptographically commits to a {{rule_set}}. This creates a self-enforcing constraint where deviation triggers an automatic penalty (defined in the rules) via {{spot_audit}}.","gloss":"Pre-commitment to penalties","invariants":["Automated Justice: Penalty execution depends solely on cryptographic evidence.","Immutability: Rules cannot be changed after signing."],"_meta":{"tier":2,"layer":"Infrastructure","category":"Verification","ring":1},"sema_ref":"OathBind#775a","sema_id":"sema:OathBind#mh:SHA-256:775ae6f305c8348cb7fb4d072af79f5cfc14a247b660221c94c9b57c82c665ca","sema_stub":"775a","sema_layer":"Infrastructure","sema_category":"Verification"},"layer":"Infrastructure","category":"Verification"}},{"id":"318b444d-36c9-4ab3-aeee-ad37b064a7c7","text":"Automated Justice: Penalty execution depends solely on cryptographic evidence.","type":"INVARIANT","layer":null,"category":null,"handle":"Automated Justice: Penalty execution depends solely on cryptographic evidence.","gloss":null,"stub":null,"metadata":{}},{"id":"CommitmentDevice","text":"CommitmentDevice#dbdf","type":"PATTERN","layer":"Society","category":"Protocols","handle":"CommitmentDevice#dbdf","gloss":"Pre-commitment against hyperbolic discounting","stub":"dbdf","metadata":{"pattern":{"handle":"CommitmentDevice","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 {{oath_bind}} contract that penalizes future deviation from the chosen path.","gloss":"Pre-commitment against hyperbolic discounting","failure_modes":["Over-commitment: Binding too early locks out legitimate pivots when new information arrives."],"invariants":["Binding: Cost(Breaking) > Benefit(Breaking)","Irrevocability: {{agent}} cannot unilaterally remove the constraint"],"preconditions":["{{agent}} expects future preference reversal (hyperbolic discounting)"],"postconditions":["Future action set constrained"],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":0},"sema_id":"sema:CommitmentDevice#mh:SHA-256:dbdf489fe9ee22b624663046242ea471580d1e8d01330ff806f6e058f99d6427","sema_ref":"CommitmentDevice#dbdf","sema_stub":"dbdf","sema_layer":"Society","sema_category":"Protocols","data_schema":{"type":"object","required":["commitment","penalty"],"properties":{"commitment":{"type":"string","description":"The action being committed to"},"penalty":{"type":"object","description":"Cost incurred if commitment broken"},"irrevocable":{"type":"boolean","description":"Whether commitment can be undone"}}}},"layer":"Society","category":"Protocols"}},{"id":"7c9af6ca-0410-4207-8ad3-8762e81b1ec5","text":"Binding: Cost(Breaking) > Benefit(Breaking)","type":"INVARIANT","layer":null,"category":null,"handle":"Binding: Cost(Breaking) > Benefit(Breaking)","gloss":null,"stub":null,"metadata":{}},{"id":"2999e2e3-6857-446b-9e60-e81f274ebc88","text":"Irrevocability: {{agent}} cannot unilaterally remove the constraint","type":"INVARIANT","layer":null,"category":null,"handle":"Irrevocability: {{agent}} cannot unilaterally remove the constraint","gloss":null,"stub":null,"metadata":{}},{"id":"9918c044-1867-4c08-a44d-6515ddc472f2","text":"{{agent}} expects future preference reversal (hyperbolic discounting)","type":"PRECONDITION","layer":null,"category":null,"handle":"{{agent}} expects future preference reversal (hyperbolic discounting)","gloss":null,"stub":null,"metadata":{}},{"id":"c6427fb3-bc8f-45bc-a062-e451e8238a37","text":"Future action set constrained","type":"POSTCONDITION","layer":null,"category":null,"handle":"Future action set constrained","gloss":null,"stub":null,"metadata":{}},{"id":"Responsibility","text":"Responsibility#b5bc","type":"PATTERN","layer":"Society","category":"Governance","handle":"Responsibility#b5bc","gloss":"Continuous ownership of a system invariant","stub":"b5bc","metadata":{"pattern":{"handle":"Responsibility","mechanism":"A standing governance contract where an {{agent}} explicitly bonds to a {{system}} Invariant over a specific Scope. Unlike a {{task}} (which has a completion state), Responsibility is a continuous maintenance loop—a 'standing wave' rather than an event. The {{agent}} is liable for any violation of the Invariant within the Scope, regardless of cause. Responsibility implies owning externalities. It formalizes ownership via {{oath_bind}} and requires a continuous {{heartbeat}} to prove the invariant is being monitored.","gloss":"Continuous ownership of a system invariant","failure_modes":["Scapegoating: The agent blames external factors for a failure within its scope.","Responsibility Vacuum: No agent is bound to a critical invariant.","Overreach: {{agent}} claims responsibility for scope they cannot monitor."],"invariants":["Bounded Scope: Responsibility is defined over explicit {{state}} boundaries","Exclusivity: For any writable {{state}} S, only one {{agent}} can hold WriteResponsibility (Single Writer Principle)","Liveness: {{agent}} must produce {{heartbeat}} verifying Invariant check"],"preconditions":["{{agent}} has capability to intervene on violations","{{agent}} has capability to monitor Scope"],"postconditions":["Invariant is continuously maintained","Violations are detected and reported"],"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"}],"_meta":{"tier":1,"layer":"Society","category":"Governance","ring":1},"sema_id":"sema:Responsibility#mh:SHA-256:b5bcfa7fa9d8dc8136d92c4734f1f0590c91f8e26504835f3d4fdbe78dd25177","sema_ref":"Responsibility#b5bc","sema_stub":"b5bc","sema_layer":"Society","sema_category":"Governance"},"layer":"Society","category":"Governance"}},{"id":"a7d062cc-2f46-42df-b535-d31021b8a555","text":"Bounded Scope: Responsibility is defined over explicit {{state}} boundaries","type":"INVARIANT","layer":null,"category":null,"handle":"Bounded Scope: Responsibility is defined over explicit {{state}} boundaries","gloss":null,"stub":null,"metadata":{}},{"id":"b8e2603a-3232-4562-8eb3-9d6bbdddf4d0","text":"Exclusivity: For any writable {{state}} S, only one {{agent}} can hold WriteResponsibility (Single Writer Principle)","type":"INVARIANT","layer":null,"category":null,"handle":"Exclusivity: For any writable {{state}} S, only one {{agent}} can hold WriteResponsibility (Single Writer Principle)","gloss":null,"stub":null,"metadata":{}},{"id":"33682c96-028d-41db-a81a-6c364fe77db9","text":"Liveness: {{agent}} must produce {{heartbeat}} verifying Invariant check","type":"INVARIANT","layer":null,"category":null,"handle":"Liveness: {{agent}} must produce {{heartbeat}} verifying Invariant check","gloss":null,"stub":null,"metadata":{}},{"id":"e0918b1c-ce04-4c1f-965b-f95bc3e1ed35","text":"{{agent}} has capability to intervene on violations","type":"PRECONDITION","layer":null,"category":null,"handle":"{{agent}} has capability to intervene on violations","gloss":null,"stub":null,"metadata":{}},{"id":"652468d4-6808-4863-b989-07f4088fdb1b","text":"{{agent}} has capability to monitor Scope","type":"PRECONDITION","layer":null,"category":null,"handle":"{{agent}} has capability to monitor Scope","gloss":null,"stub":null,"metadata":{}},{"id":"4e50b544-9aca-45fe-80b1-cd59c6507433","text":"Invariant is continuously maintained","type":"POSTCONDITION","layer":null,"category":null,"handle":"Invariant is continuously maintained","gloss":null,"stub":null,"metadata":{}},{"id":"6d0cd95a-7159-4614-ad0e-21b8a9bcf3cb","text":"Violations are detected and reported","type":"POSTCONDITION","layer":null,"category":null,"handle":"Violations are detected and reported","gloss":null,"stub":null,"metadata":{}},{"id":"Handoff","text":"Handoff#2de0","type":"PATTERN","layer":"Society","category":"Protocols","handle":"Handoff#2de0","gloss":"Transfer control and context between agents","stub":"2de0","metadata":{"pattern":{"handle":"Handoff","mechanism":"Transfers control from one {{agent}} to another along with relevant {{context}}. The sending {{agent}} explicitly yields authority, passing conversation {{state}}, {{task}} {{context}}, and any agent-specific instructions. Used in swarm architectures where specialized {{agent}}s handle different aspects of a {{task}}. It extends {{delegate}} by transferring full {{responsibility}} and authority to the receiving {{agent}}.","gloss":"Transfer control and context between agents","failure_modes":["{{context}} Loss: Critical information not passed in handoff.","Authority Ambiguity: Unclear which {{agent}} now owns the {{task}}.","Handoff Loops: {{agent}}s keep passing {{task}} back and forth."],"invariants":["{{context}} fully transferred","{{responsibility}} atomicity (neither or both hold it briefly, never none)"],"preconditions":["{{agent}} A active","{{agent}} B ready"],"postconditions":["{{agent}} A released","{{agent}} B in charge"],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":1},"sema_layer":"Society","sema_category":"Protocols","sema_id":"sema:Handoff#mh:SHA-256:2de0a5c6841bc988cf1c9662e6916d9d32a710fd021e1c2402a33fd4504e3f08","sema_ref":"Handoff#2de0","sema_stub":"2de0"},"layer":"Society","category":"Protocols"}},{"id":"5738bb9d-f689-417d-a835-18077ebe1640","text":"{{context}} fully transferred","type":"INVARIANT","layer":null,"category":null,"handle":"{{context}} fully transferred","gloss":null,"stub":null,"metadata":{}},{"id":"d445905c-c5d4-46d4-a2ff-79002726c702","text":"{{responsibility}} atomicity (neither or both hold it briefly, never none)","type":"INVARIANT","layer":null,"category":null,"handle":"{{responsibility}} atomicity (neither or both hold it briefly, never none)","gloss":null,"stub":null,"metadata":{}},{"id":"fddb371f-ca3a-4147-8fe2-c871fca4f044","text":"{{agent}} A active","type":"PRECONDITION","layer":null,"category":null,"handle":"{{agent}} A active","gloss":null,"stub":null,"metadata":{}},{"id":"3ef919b2-4dea-4baa-aafe-7de1016ad46e","text":"{{agent}} B ready","type":"PRECONDITION","layer":null,"category":null,"handle":"{{agent}} B ready","gloss":null,"stub":null,"metadata":{}},{"id":"aab684a6-fa9a-4936-923a-d6b80155f811","text":"{{agent}} A released","type":"POSTCONDITION","layer":null,"category":null,"handle":"{{agent}} A released","gloss":null,"stub":null,"metadata":{}},{"id":"23ffc7ba-3676-4103-a041-ca8ecccd72b9","text":"{{agent}} B in charge","type":"POSTCONDITION","layer":null,"category":null,"handle":"{{agent}} B in charge","gloss":null,"stub":null,"metadata":{}},{"id":"Role","text":"Role#8686","type":"PATTERN","layer":"Society","category":"Governance","handle":"Role#8686","gloss":"Bundle of permissions and responsibilities","stub":"8686","metadata":{"pattern":{"handle":"Role","data_schema":{"type":"object","required":["role_id","permissions"],"properties":{"role_id":{"type":"string","description":"Unique role identifier"},"permissions":{"type":"array","items":{"type":"string"},"description":"Permission IDs granted by this role"},"responsibilities":{"type":"array","items":{"type":"string"},"description":"Responsibility IDs required by this role"}}},"mechanism":"A named collection of {{permission}}s and {{responsibility}}s assigned to an {{agent}}. Decouples identity from capability, allowing agents to switch contexts by adopting different roles.","gloss":"Bundle of permissions and responsibilities","_meta":{"layer":"Society","category":"Governance","ring":1,"tier":1},"sema_ref":"Role#8686","sema_id":"sema:Role#mh:SHA-256:86863ba2706e4082bffc2d73a5a53154eacfc341b792a401476e6658619a8410","sema_stub":"8686","sema_layer":"Society","sema_category":"Governance"},"layer":"Society","category":"Governance"}},{"id":"SolverNode","text":"SolverNode#beef","type":"PATTERN","layer":"Society","category":"Protocols","handle":"SolverNode#beef","gloss":"Stateful container for a running solver instance","stub":"beef","metadata":{"pattern":{"handle":"SolverNode","mechanism":"An active runtime container that wraps a static {{solver_manifest}} with dynamic state. It handles a specific {{problem_space}}, tracks {{budget}} expenditure, and maintains communication with its parent node. The node is the unit of Blame—when it fails, {{responsibility}} is attributed here for {{localized_learning}}. It holds the current partial {{solution}}, accumulated cost, and status.","gloss":"Stateful container for a running solver instance","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."],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":1},"data_schema":{"type":"object","description":"Schema for SolverNode","required":["manifest_id","status","budget_spent"],"properties":{"manifest_id":{"type":"string","description":"Reference to the SolverManifest defining capabilities"},"status":{"type":"string","enum":["Pending","Active","Solved","Failed"],"description":"Current execution state"},"budget_spent":{"type":"number","description":"Resources consumed so far"},"budget_allocated":{"type":"number","description":"Resources allocated by parent"}}},"sema_ref":"SolverNode#beef","sema_id":"sema:SolverNode#mh:SHA-256:beefcfc23d5a4377802e8a9f43e9b4bf5369b18fcfe52571d1f028c4ebc51bd7","sema_stub":"beef","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"73813ab7-4150-49f4-a234-b3b714e8f733","text":"Statefulness: Must hold a status (Pending, Active, Solved, Failed).","type":"INVARIANT","layer":null,"category":null,"handle":"Statefulness: Must hold a status (Pending, Active, Solved, Failed).","gloss":null,"stub":null,"metadata":{}},{"id":"496fc5b6-2ed8-4613-a4ce-2e94fbe0c31e","text":"Linkage: Must maintain pointers to Parent and Children (if any).","type":"INVARIANT","layer":null,"category":null,"handle":"Linkage: Must maintain pointers to Parent and Children (if any).","gloss":null,"stub":null,"metadata":{}},{"id":"9ca3d2a2-92b5-4bbd-a718-cc3af9c105e3","text":"Accountability: Failures must be traceable to this node for blame attribution.","type":"INVARIANT","layer":null,"category":null,"handle":"Accountability: Failures must be traceable to this node for blame attribution.","gloss":null,"stub":null,"metadata":{}},{"id":"cc7e5513-8144-45e8-a6c3-cbc9dac1df5b","text":"Budget Tracking: Must track resources spent vs. allocated.","type":"INVARIANT","layer":null,"category":null,"handle":"Budget Tracking: Must track resources spent vs. allocated.","gloss":null,"stub":null,"metadata":{}},{"id":"Workflow","text":"Workflow#4ec6","type":"PATTERN","layer":"Society","category":"Protocols","handle":"Workflow#4ec6","gloss":"Directed graph of operations","stub":"4ec6","metadata":{"pattern":{"handle":"Workflow","data_schema":{"type":"object","required":["steps","dependencies"],"properties":{"steps":{"type":"array","description":"List of executable units"},"dependencies":{"type":"array","description":"DAG edges (step_A -> step_B)"},"artifacts":{"type":"object","description":"Typed outputs flowing on edges"}}},"mechanism":"A directed graph of {{step}}s where the output of one {{solver}} 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}} that must satisfy an {{accept_spec}} before the next node can execute. It binds {{role}}s to steps but does not instantiate them.","gloss":"Directed graph of operations","failure_modes":["Deadlock: Circular dependencies prevent progress.","Cascade Failure: One node failure propagates to all dependents.","Orphan Output: A node produces artifacts that no downstream node consumes."],"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."],"_meta":{"layer":"Society","category":"Protocols","tier":1,"ring":0},"sema_id":"sema:Workflow#mh:SHA-256:4ec6b1381e22c12d860c3bb55527e018387b1e6be5faa994c7b1700236e00253","sema_ref":"Workflow#4ec6","sema_stub":"4ec6","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"81af6b20-d939-4059-a852-ad24d118e8c8","text":"Acyclicity: Unless explicitly recursive, workflows must terminate.","type":"INVARIANT","layer":null,"category":null,"handle":"Acyclicity: Unless explicitly recursive, workflows must terminate.","gloss":null,"stub":null,"metadata":{}},{"id":"9e64e9f5-4882-446c-aef0-00aa4e0f81af","text":"Artifact Typing: Each edge carries a typed artifact, not raw data.","type":"INVARIANT","layer":null,"category":null,"handle":"Artifact Typing: Each edge carries a typed artifact, not raw data.","gloss":null,"stub":null,"metadata":{}},{"id":"BeamSearch","text":"BeamSearch#23b1","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"BeamSearch#23b1","gloss":"Width-limited heuristic search","stub":"23b1","metadata":{"pattern":{"handle":"BeamSearch","mechanism":"A heuristic search algorithm that explores a graph by expanding the most promising {{solver_node}}s in a limited set (the beam). It manages a {{queue}} of fixed size 'k'. At each step, it generates all successors of all nodes in the beam, {{rank}}s them, and {{select}}s the top 'k' for the next iteration.","gloss":"Width-limited heuristic search","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"}],"_meta":{"layer":"Mind","category":"Strategy","ring":1,"tier":1},"sema_id":"sema:BeamSearch#mh:SHA-256:23b1817f69e5b2090c5931b8e195437932834e0b1aeb2ebbe9f928bc70adc8eb","sema_ref":"BeamSearch#23b1","sema_stub":"23b1","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"34da367f-800a-4f2c-9a0d-e43435995417","text":"Breadth Constraint: Active nodes never exceed Beam Width.","type":"INVARIANT","layer":null,"category":null,"handle":"Breadth Constraint: Active nodes never exceed Beam Width.","gloss":null,"stub":null,"metadata":{}},{"id":"79c052d6-8652-48f6-8a8c-83b9cf9d9008","text":"Optimality: The K nodes selected are the highest ranked.","type":"INVARIANT","layer":null,"category":null,"handle":"Optimality: The K nodes selected are the highest ranked.","gloss":null,"stub":null,"metadata":{}},{"id":"ContextFirst","text":"ContextFirst#723f","type":"PATTERN","layer":"Mind","category":"Inference","handle":"ContextFirst#723f","gloss":"Load state before acting","stub":"723f","metadata":{"pattern":{"handle":"ContextFirst","mechanism":"Operational Invariant. {{prioritize}} the {{context}}. Before generating tokens or taking action, {{agent}} MUST execute a Read operation (e.g., graph_skeleton, search) on the shared state. Blind action is forbidden. It is a mandate for {{solver_node}} to execute a {{warmup}} or read-cycle before attempting any write-action.","gloss":"Load state before acting","failure_modes":["{{context}} Blindness: {{agent}} acts on stale cached data.","Hallucinated {{state}}: {{agent}} guesses the state instead of looking it up."],"invariants":["Read-Before-Write: Action timestamp > Context_Refresh timestamp."],"_meta":{"tier":1,"layer":"Mind","category":"Inference","ring":0},"sema_id":"sema:ContextFirst#mh:SHA-256:723fc0147c32c39e74048822104401ee5c31ecdc4f7351795d6ef1439120926c","sema_ref":"ContextFirst#723f","sema_stub":"723f","sema_layer":"Mind","sema_category":"Inference","signature":["Prioritize(Context)"]},"layer":"Mind","category":"Inference"}},{"id":"ca55df70-db4d-4ee0-8633-0c07bea183a8","text":"Read-Before-Write: Action timestamp > Context_Refresh timestamp.","type":"INVARIANT","layer":null,"category":null,"handle":"Read-Before-Write: Action timestamp > Context_Refresh timestamp.","gloss":null,"stub":null,"metadata":{}},{"id":"DeliberativeAlign","text":"DeliberativeAlign#fb93","type":"PATTERN","layer":"Society","category":"Protocols","handle":"DeliberativeAlign#fb93","gloss":"Explicit safety reasoning prior to execution","stub":"fb93","metadata":{"pattern":{"handle":"DeliberativeAlign","mechanism":"Constitutional AI. {{agent}} ingests a Policy_Set. Before executing {{task}}, it generates a 'Safety {{trace}}' comparing the {{manifest_planning}} against Policy. If violation detected, it revises the {{manifest_planning}}. It forces the {{solver_node}} to execute a dedicated safety pass against the {{hydra_constitution}} before committing to the {{manifest_planning}}.","gloss":"Explicit safety reasoning prior to execution","failure_modes":["Deliberation Theater: {{agent}} generates false safety reasoning to justify harmful action.","Policy Conflict: Contradictory rules lead to paralysis or arbitrary selection.","{{context}} Overflow: Long constitutions truncated, causing rules to be ignored."],"invariants":["Policy Supremacy: If Policy forbids X, and Goal requires X, {{agent}} must ABORT.","Pre-Action {{check}}: SafetyTrace must be generated BEFORE any ToolCall."],"preconditions":["Policy definitions loaded","{{task}} is planned but not executed"],"postconditions":["{{manifest_planning}} validated safe OR revised","Safety reasoning logged"],"parameters":[{"name":"constitution_ref","type":"SemaRef","range":"unspecified","description":"Pointer to HydraConstitution"},{"name":"strictness","type":"Enum","range":"{Strict, Permissive}","description":"Default: Strict"}],"_meta":{"tier":2,"layer":"Society","category":"Protocols","ring":0},"sema_layer":"Society","sema_category":"Protocols","sema_id":"sema:DeliberativeAlign#mh:SHA-256:fb93216febb5b91b66f8c0021568e16cec72018ecabb494f9382a864d2948908","sema_ref":"DeliberativeAlign#fb93","sema_stub":"fb93"},"layer":"Society","category":"Protocols"}},{"id":"ed0397cc-7961-41c4-872a-d23d03d18e44","text":"Policy Supremacy: If Policy forbids X, and Goal requires X, {{agent}} must ABORT.","type":"INVARIANT","layer":null,"category":null,"handle":"Policy Supremacy: If Policy forbids X, and Goal requires X, {{agent}} must ABORT.","gloss":null,"stub":null,"metadata":{}},{"id":"1507fbef-897f-4028-af68-54a495a91eae","text":"Pre-Action {{check}}: SafetyTrace must be generated BEFORE any ToolCall.","type":"INVARIANT","layer":null,"category":null,"handle":"Pre-Action {{check}}: SafetyTrace must be generated BEFORE any ToolCall.","gloss":null,"stub":null,"metadata":{}},{"id":"bcc87e91-61fe-48be-a669-d940a0f4d14b","text":"Policy definitions loaded","type":"PRECONDITION","layer":null,"category":null,"handle":"Policy definitions loaded","gloss":null,"stub":null,"metadata":{}},{"id":"acae76bb-a51d-4893-addc-931eb90ccd29","text":"{{manifest_planning}} validated safe OR revised","type":"POSTCONDITION","layer":null,"category":null,"handle":"{{manifest_planning}} validated safe OR revised","gloss":null,"stub":null,"metadata":{}},{"id":"c6587ecd-4447-42e3-bd82-a698340d8970","text":"Safety reasoning logged","type":"POSTCONDITION","layer":null,"category":null,"handle":"Safety reasoning logged","gloss":null,"stub":null,"metadata":{}},{"id":"SolverRoot","text":"SolverRoot#cb05","type":"PATTERN","layer":"Society","category":"Governance","handle":"SolverRoot#cb05","gloss":"Genesis authority and framer of a solver tree","stub":"cb05","metadata":{"pattern":{"handle":"SolverRoot","mechanism":"The genesis node of a solver tree, anchoring a {{task}} to a coordinated problem-solving effort. The Root has unique authority: Problem Framing (determining initial constraints and {{problem_space}}), Budget Allocation (distributing {{budget}} to child {{solver_node}}s), and Ultimate Accountability (owning final {{result}}). The Root propagates the {{tree}} structure downward and aggregates {{solution}}s upward. When downstream nodes fail, the Root decides whether to reframe the {{problem}} or escalate failure. The Root is indifferent to whether it orchestrates 'self' (internal reasoning) or 'other' (delegated agents).","gloss":"Genesis authority and framer of a solver tree","failure_modes":["Bad Frame: The {{problem}} is framed incorrectly, making it unsolvable by downstream nodes.","Reframe Failure: Root fails to find a valid alternative frame after failure.","Budget Misallocation: Resources distributed poorly across child nodes."],"invariants":["Genesis: Every solver tree has exactly one active Root.","Ultimate Responsibility: The Root owns the final success/failure of the {{task}}.","Authority: Only the Root can reframe the original {{problem}}."],"_meta":{"tier":1,"layer":"Society","category":"Governance","ring":1},"data_schema":{"type":"object","required":["task_ref","problem_frame"],"properties":{"task_ref":{"type":"string","description":"Reference to originating task"},"problem_frame":{"type":"object","description":"Initial problem constraints and space"},"budget_allocation":{"type":"object","description":"Resource distribution to children"},"children":{"type":"array","items":{"type":"string"},"description":"Child solver node refs"}}},"sema_ref":"SolverRoot#cb05","sema_id":"sema:SolverRoot#mh:SHA-256:cb0502d76289179d7cc606db9940c07685098bb5d9a57184e2ee56cc7ddd96fc","sema_stub":"cb05","sema_layer":"Society","sema_category":"Governance"},"layer":"Society","category":"Governance"}},{"id":"1526317f-da18-4182-8c7c-6623ee80993a","text":"Genesis: Every solver tree has exactly one active Root.","type":"INVARIANT","layer":null,"category":null,"handle":"Genesis: Every solver tree has exactly one active Root.","gloss":null,"stub":null,"metadata":{}},{"id":"5fb05617-f3a5-4642-b406-b433bd0a2c9f","text":"Ultimate Responsibility: The Root owns the final success/failure of the {{task}}.","type":"INVARIANT","layer":null,"category":null,"handle":"Ultimate Responsibility: The Root owns the final success/failure of the {{task}}.","gloss":null,"stub":null,"metadata":{}},{"id":"da9983ee-2541-4ed8-8f0b-7dc0affea781","text":"Authority: Only the Root can reframe the original {{problem}}.","type":"INVARIANT","layer":null,"category":null,"handle":"Authority: Only the Root can reframe the original {{problem}}.","gloss":null,"stub":null,"metadata":{}},{"id":"WorkerMode","text":"WorkerMode#7cd7","type":"PATTERN","layer":"Society","category":"Protocols","handle":"WorkerMode#7cd7","gloss":"Claim tasks and become the assigned persona","stub":"7cd7","metadata":{"pattern":{"handle":"WorkerMode","mechanism":"Execution {{state}} Machine. Upon invoking `solver_claim_task`, the {{agent}} performs an atomic {{identity}} {{switch}} via {{context_switch}} using the {{solver_manifest}}. The {{agent}} remains in this {{mode}} until the {{task}} is complete (emitting a {{solution}} or error to the {{solver_node}}), ensuring adherence to the assigned persona. A {{lock}} prevents concurrent task claims.","gloss":"Claim tasks and become the assigned persona","failure_modes":["Persona Drift: {{agent}} slowly reverts to default behaviors during long tasks ({{context}} Window exhaustion).","Zombie Worker: {{agent}} claims {{task}}, enters WorkerMode, but crashes/hangs before reporting completion.","{{identity}} Leak: Information from previous tasks bleeds into the current WorkerMode session."],"invariants":["{{identity}} {{lock}}: During WorkerMode, system_prompt MUST == {{solver_manifest}}.persona.","Isolation: Memory {{context}} must be flushed/reset before entering WorkerMode.","Lifecycle Bound: {{mode}} cannot be exited without emitting a {{solution}} or Error."],"preconditions":["{{solver_manifest}} defined","{{task}} available in queue"],"postconditions":["{{agent}} returns to Idle {{state}}","{{task}} marked Complete/Failed"],"_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":0},"sema_id":"sema:WorkerMode#mh:SHA-256:7cd760cafedf3d37afcff6bc9fbfbedf2d507bab9668095cfaf80f0ed3374257","sema_ref":"WorkerMode#7cd7","sema_stub":"7cd7","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"2a3782f6-2fe0-4142-8f49-b5ca47475479","text":"{{identity}} {{lock}}: During WorkerMode, system_prompt MUST == {{solver_manifest}}.persona.","type":"INVARIANT","layer":null,"category":null,"handle":"{{identity}} {{lock}}: During WorkerMode, system_prompt MUST == {{solver_manifest}}.persona.","gloss":null,"stub":null,"metadata":{}},{"id":"2c8cb656-3b14-4eed-a6ed-ba6e3a9c3027","text":"Isolation: Memory {{context}} must be flushed/reset before entering WorkerMode.","type":"INVARIANT","layer":null,"category":null,"handle":"Isolation: Memory {{context}} must be flushed/reset before entering WorkerMode.","gloss":null,"stub":null,"metadata":{}},{"id":"6868ed3c-1671-443d-b6ac-cb8604db05e6","text":"Lifecycle Bound: {{mode}} cannot be exited without emitting a {{solution}} or Error.","type":"INVARIANT","layer":null,"category":null,"handle":"Lifecycle Bound: {{mode}} cannot be exited without emitting a {{solution}} or Error.","gloss":null,"stub":null,"metadata":{}},{"id":"bee847ad-dec3-49a1-8770-19a8daeb5082","text":"{{solver_manifest}} defined","type":"PRECONDITION","layer":null,"category":null,"handle":"{{solver_manifest}} defined","gloss":null,"stub":null,"metadata":{}},{"id":"4484745f-2e04-4686-8b19-4de0a3b1aea0","text":"{{task}} available in queue","type":"PRECONDITION","layer":null,"category":null,"handle":"{{task}} available in queue","gloss":null,"stub":null,"metadata":{}},{"id":"ecdff0fe-79bc-4576-b231-1c17e1fc71e7","text":"{{agent}} returns to Idle {{state}}","type":"POSTCONDITION","layer":null,"category":null,"handle":"{{agent}} returns to Idle {{state}}","gloss":null,"stub":null,"metadata":{}},{"id":"a12bf2b9-9c83-441b-91e8-9e509fc6b917","text":"{{task}} marked Complete/Failed","type":"POSTCONDITION","layer":null,"category":null,"handle":"{{task}} marked Complete/Failed","gloss":null,"stub":null,"metadata":{}},{"id":"OrchestrationLoop","text":"OrchestrationLoop#0144","type":"PATTERN","layer":"Society","category":"Protocols","handle":"OrchestrationLoop#0144","gloss":"Interpret-Plan-Rollout Lifecycle","stub":"0144","metadata":{"pattern":{"handle":"OrchestrationLoop","mechanism":"A strict lifecycle for high-stakes problem solving implementing {{workflow}}. It enforces a sequence: 1. {{request_framing}} (Frame Problem → {{frame_spec}}), 2. {{manifest_planning}} (Architect Solution → {{execution_manifest}}), 3. {{rollout}} (Execute safely → {{rollout_manifest}}). Each transition is mediated by a typed artifact that must pass a non-compensatory {{accept_spec}}. The loop can iterate: failed rollouts trigger re-planning, failed plans trigger re-interpretation.","gloss":"Interpret-Plan-Rollout Lifecycle","failure_modes":["Bureaucracy: Blindly following the full lifecycle for trivial tasks (using a cannon for a mosquito).","Loop Stalling: Getting stuck in Plan/Rollout cycles without shipping.","Artifact Rejection Cascade: Overly strict AcceptSpecs cause infinite loops.","Seam Leakage: Untyped data bypasses the artifact boundaries."],"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."],"_meta":{"layer":"Society","category":"Protocols","tier":2,"ring":1,"related":["LayeredCheck"]},"sema_id":"sema:OrchestrationLoop#mh:SHA-256:0144358c7efa0565bb99fc53eb6e5ee9939ff81a8c09ce03dd9125aaa8a4af18","sema_ref":"OrchestrationLoop#0144","sema_stub":"0144","sema_layer":"Society","sema_category":"Protocols","signature":["Workflow(Rollout)"]},"layer":"Society","category":"Protocols"}},{"id":"b1d04be8-6742-4efb-b187-db0cf575956f","text":"Artifact Mediation: All phase transitions MUST pass through typed artifacts.","type":"INVARIANT","layer":null,"category":null,"handle":"Artifact Mediation: All phase transitions MUST pass through typed artifacts.","gloss":null,"stub":null,"metadata":{}},{"id":"5e7f2501-934b-4b26-8cff-f3816f1a5258","text":"Non-Compensatory Gates: Each AcceptSpec is binary pass/fail.","type":"INVARIANT","layer":null,"category":null,"handle":"Non-Compensatory Gates: Each AcceptSpec is binary pass/fail.","gloss":null,"stub":null,"metadata":{}},{"id":"60dbf5a6-ef25-4ec9-8731-4d77408362fa","text":"Iteration Bound: Maximum loop iterations before escalation.","type":"INVARIANT","layer":null,"category":null,"handle":"Iteration Bound: Maximum loop iterations before escalation.","gloss":null,"stub":null,"metadata":{}},{"id":"SolverTree","text":"SolverTree#496e","type":"PATTERN","layer":"Society","category":"Governance","handle":"SolverTree#496e","gloss":"Active hierarchy of coordinated solver instances","stub":"496e","metadata":{"pattern":{"handle":"SolverTree","mechanism":"The active command hierarchy that organizes {{solver_node}} instances into a coordinated {{topology}} for solving a {{task}}. 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}}) cascade from {{solver_root}} to children, while outcomes propagate back up. Each node in the tree is a unit of Blame—failures can be traced to specific {{solver_node}}s for {{localized_learning}}.","gloss":"Active hierarchy of coordinated solver instances","failure_modes":["Fragmentation: Sub-trees become disconnected from the Root, breaking the command chain.","Budget Exhaustion: Resources depleted before solution found.","Blame Diffusion: Failures cannot be attributed to specific nodes."],"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 {{solver_root}}.","Acyclicity: The structure must form a DAG or {{tree}}."],"_meta":{"tier":1,"layer":"Society","category":"Governance","ring":1,"related":["UniversalSolverTree"]},"data_schema":{"type":"object","required":["root_ref","nodes"],"properties":{"root_ref":{"type":"string","description":"Reference to SolverRoot"},"nodes":{"type":"array","items":{"type":"string"},"description":"All SolverNode refs in tree"},"topology":{"type":"string","enum":["tree","dag"],"description":"Structure type"}}},"sema_ref":"SolverTree#496e","sema_id":"sema:SolverTree#mh:SHA-256:496eab56fade7a64020f6f5e37afd024efc4cb8b691001b403e7bacb61b7c3d8","sema_stub":"496e","sema_layer":"Society","sema_category":"Governance"},"layer":"Society","category":"Governance"}},{"id":"c9c26edd-6892-4d0d-b117-41041f926d53","text":"Chain of Command: Every node (except root) has exactly one active supervisor.","type":"INVARIANT","layer":null,"category":null,"handle":"Chain of Command: Every node (except root) has exactly one active supervisor.","gloss":null,"stub":null,"metadata":{}},{"id":"d88408d2-1143-4234-a5a5-663cb72b3f6d","text":"Budget Flow: Resources flow down; Results flow up.","type":"INVARIANT","layer":null,"category":null,"handle":"Budget Flow: Resources flow down; Results flow up.","gloss":null,"stub":null,"metadata":{}},{"id":"788d5cf1-4794-468a-8cc4-e2d012d2a7eb","text":"Connectivity: All nodes must be traceable back to the {{solver_root}}.","type":"INVARIANT","layer":null,"category":null,"handle":"Connectivity: All nodes must be traceable back to the {{solver_root}}.","gloss":null,"stub":null,"metadata":{}},{"id":"48393cb1-f721-45f4-8c56-b2277364db6a","text":"Acyclicity: The structure must form a DAG or {{tree}}.","type":"INVARIANT","layer":null,"category":null,"handle":"Acyclicity: The structure must form a DAG or {{tree}}.","gloss":null,"stub":null,"metadata":{}},{"id":"RecursionDive","text":"RecursionDive#6a5c","type":"PATTERN","layer":"Mind","category":"Reasoning","handle":"RecursionDive#6a5c","gloss":"Vertical traversal of the solution tree","stub":"6a5c","metadata":{"pattern":{"handle":"RecursionDive","mechanism":"Execution: The active process of traversing a {{solver_tree}} downwards. Accepts a {{solver_node}}, applies the strategy of {{decompose}} to its task, and generates child {{solver_node}}s.","gloss":"Vertical traversal of the solution tree","_meta":{"tier":1,"layer":"Mind","category":"Reasoning","ring":2,"related":["SolutionNode#2b4a"]},"sema_id":"sema:RecursionDive#mh:SHA-256:6a5cac9eb4e9ca22eb83add3a5e4b8b94cc143627cb829b49f5a76684940d13e","sema_ref":"RecursionDive#6a5c","sema_stub":"6a5c","sema_layer":"Mind","sema_category":"Reasoning"},"layer":"Mind","category":"Reasoning"}},{"id":"UniversalSolverTree","text":"UniversalSolverTree#64d8","type":"PATTERN","layer":"Society","category":"Governance","handle":"UniversalSolverTree#64d8","gloss":"Collective knowledge graph of all problem-solving","stub":"64d8","metadata":{"pattern":{"handle":"UniversalSolverTree","mechanism":"The theoretical aggregation of all possible valid {{solver_tree}}s across all agents in the system. It represents the total epistemological state of {{problem}}-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}}. It enables cross-agent learning: identifying redundant efforts, reusing proven {{solver_node}} strategies, and sharing {{solution}}s. The Universal Tree is the ground truth against which {{localized_learning}} updates are integrated.","gloss":"Collective knowledge graph of all problem-solving","failure_modes":["Fragmentation: Parts of the universal tree become inaccessible across agent boundaries.","Inconsistency: Contradictory solutions exist in different branches without reconciliation.","Knowledge Silos: Agent-local trees fail to sync with the universal tree."],"invariants":["Singularity: There is logically only one Universal {{tree}} containing all knowledge.","Coherence: Contradictions must eventually be resolved via synthesis or rejection."],"_meta":{"tier":1,"layer":"Society","category":"Governance","ring":1},"data_schema":{"type":"object","required":["trees"],"properties":{"trees":{"type":"array","items":{"type":"string"},"description":"All SolverTree refs"},"global_solutions":{"type":"array","items":{"type":"string"},"description":"Cross-tree reusable solutions"}}},"sema_ref":"UniversalSolverTree#64d8","sema_id":"sema:UniversalSolverTree#mh:SHA-256:64d835862a3419f898a4bddc54104a5daaed16f65e4e990e961c12274336e7ae","sema_stub":"64d8","sema_layer":"Society","sema_category":"Governance"},"layer":"Society","category":"Governance"}},{"id":"b3a7a3e9-85c3-48da-ab3e-0edf8dd8b2b9","text":"Singularity: There is logically only one Universal {{tree}} containing all knowledge.","type":"INVARIANT","layer":null,"category":null,"handle":"Singularity: There is logically only one Universal {{tree}} containing all knowledge.","gloss":null,"stub":null,"metadata":{}},{"id":"2e5323ff-0ecc-4f3c-904f-61834e0bad97","text":"Coherence: Contradictions must eventually be resolved via synthesis or rejection.","type":"INVARIANT","layer":null,"category":null,"handle":"Coherence: Contradictions must eventually be resolved via synthesis or rejection.","gloss":null,"stub":null,"metadata":{}},{"id":"DepthGovernor","text":"DepthGovernor#a6f6","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"DepthGovernor#a6f6","gloss":"Entropy-based stopping condition for recursion","stub":"a6f6","metadata":{"pattern":{"handle":"DepthGovernor","mechanism":"Entropy-Bounded Recursion: Decomposition depth is not fixed but governed by informational entropy. {{agent}} measures uncertainty of current {{plan}}. If entropy > action_cost_threshold, {{decompose}} 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}} for {{recursion_dive}}, halting descent when informational entropy drops below the threshold.","gloss":"Entropy-based stopping condition for recursion","failure_modes":["Ambiguity {{loop}}: Entropy never drops because the {{problem}} is inherently subjective (e.g., Write a good poem).","Miscalculating entropy leads to premature action.","Infinite regression on high-ambiguity paradoxes.","Entropy estimation itself has computational cost."],"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"}],"_meta":{"tier":2,"layer":"Mind","category":"Strategy","ring":0},"sema_id":"sema:DepthGovernor#mh:SHA-256:a6f623c78e0c6ae7c068e502269f27adecfc084d9454f00f0369f1fd944ffa5e","sema_ref":"DepthGovernor#a6f6","sema_stub":"a6f6","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"0677dddd-3c0f-43e5-a3d7-dd01026d9ed4","text":"Governor cannot be bypassed.","type":"INVARIANT","layer":null,"category":null,"handle":"Governor cannot be bypassed.","gloss":null,"stub":null,"metadata":{}},{"id":"MarginalValueRule","text":"MarginalValueRule#aea3","type":"PATTERN","layer":"Society","category":"Economics","handle":"MarginalValueRule#aea3","gloss":"Economic stop-condition for recursion","stub":"aea3","metadata":{"pattern":{"handle":"MarginalValueRule","mechanism":"The economic {{budget}} governor of {{recursion_dive}}. It permits going one level deeper only if Expected Improvement in Quality > Incremental Cost. It calculates the marginal value of additional depth using {{estimate}} and compares against remaining {{budget}}. This ensures the system solves problems with precision proportional to their stakes—simple problems get shallow treatment, complex problems get deep exploration.","gloss":"Economic stop-condition for recursion","failure_modes":["Underestimation: Expected value is too optimistic, wasting budget on low-value dives.","Overestimation: Expected value is too pessimistic, stopping too early on valuable problems.","Sunk Cost Fallacy: Continuing to invest because of prior investment, not future value."],"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."],"_meta":{"layer":"Society","category":"Economics","tier":2,"ring":1},"sema_id":"sema:MarginalValueRule#mh:SHA-256:aea3ccd2f413700043fed8c949cabea597179b15bf9a85a175c736eab6bb3cce","sema_ref":"MarginalValueRule#aea3","sema_stub":"aea3","sema_layer":"Society","sema_category":"Economics","signature":["Budget(RecursionDive)"]},"layer":"Society","category":"Economics"}},{"id":"55b9d6ee-c7a3-44ee-bca1-118ce0eaebaa","text":"Marginal Comparison: Dive only if E[ΔQuality] > Cost(Dive).","type":"INVARIANT","layer":null,"category":null,"handle":"Marginal Comparison: Dive only if E[ΔQuality] > Cost(Dive).","gloss":null,"stub":null,"metadata":{}},{"id":"1709b8bd-10e4-4f9e-851f-add625126d86","text":"Budget Respect: Never approve a dive that exceeds remaining budget.","type":"INVARIANT","layer":null,"category":null,"handle":"Budget Respect: Never approve a dive that exceeds remaining budget.","gloss":null,"stub":null,"metadata":{}},{"id":"9c320bbc-ec84-49fb-950f-266710586310","text":"Diminishing Returns: Deeper levels must show proportionally higher marginal value.","type":"INVARIANT","layer":null,"category":null,"handle":"Diminishing Returns: Deeper levels must show proportionally higher marginal value.","gloss":null,"stub":null,"metadata":{}},{"id":"CognitiveSolver","text":"CognitiveSolver#4962","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"CognitiveSolver#4962","gloss":"The universal polymorphic atom of recursive intelligence","stub":"4962","metadata":{"pattern":{"handle":"CognitiveSolver","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}}, Execute, Question, Verify via {{validate}}, Feedback). It acts as a fractal node in the {{universal_solver_tree}}, accepting a {{task}} and using {{reason}} to orchestrate a lifecycle on a {{solver_node}}. It yields a {{solution}}, wrapping operations like {{tool_invoke}} with {{compute_budget}} checks, {{socratic_loop}} refinement, or {{reflexion}} for self-improvement.","gloss":"The universal polymorphic atom of recursive intelligence","failure_modes":["Interface Non-Compliance: Solver fails to implement one of the 5 mandatory endpoints.","Manifest Drift: Capabilities declared in Manifest do not match runtime behavior."],"invariants":["Polymorphism: External Runtime treats all Solvers identically via this Interface.","Recursion: Solver must accept sub-tasks via the same Interface it exposes."],"_meta":{"tier":1,"layer":"Mind","category":"Strategy","ring":1,"related":["EpistemicROI","RecursionDive"]},"sema_id":"sema:CognitiveSolver#mh:SHA-256:4962ffd534b3a87584f3ba6c57f7db3ae2aa0fd0461fd0363f35418cc3cfe8b7","sema_ref":"CognitiveSolver#4962","sema_stub":"4962","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"6946d092-a460-45a7-8350-814a81570ea3","text":"Polymorphism: External Runtime treats all Solvers identically via this Interface.","type":"INVARIANT","layer":null,"category":null,"handle":"Polymorphism: External Runtime treats all Solvers identically via this Interface.","gloss":null,"stub":null,"metadata":{}},{"id":"45286237-9a91-48b4-a34c-69fae341e5df","text":"Recursion: Solver must accept sub-tasks via the same Interface it exposes.","type":"INVARIANT","layer":null,"category":null,"handle":"Recursion: Solver must accept sub-tasks via the same Interface it exposes.","gloss":null,"stub":null,"metadata":{}},{"id":"ProblemFramer","text":"ProblemFramer#f83d","type":"PATTERN","layer":"Society","category":"Coordination","handle":"ProblemFramer#f83d","gloss":"The active strategist that frames the problem","stub":"f83d","metadata":{"pattern":{"handle":"ProblemFramer","mechanism":"A specialized solver role that {{interpret}}s an initial request via {{request_framing}}, constructs the formal {{accept_spec}} (Definition of Done), and anchors the resulting {{solver_root}} to the {{universal_solver_tree}}. Unlike a general Solver (which executes), the Framer's sole output is a well-formed Problem Node ready for decomposition, or a {{reframe}} request if invalid.","gloss":"The active strategist that frames the problem","failure_modes":["Bad Frame: The problem is framed incorrectly, making it unsolvable.","Reframe Failure: Fails to find a valid alternative frame after failure."],"invariants":["Genesis: Must create exactly one active Root per problem instance.","Ownership: Owns the high-level success/failure of the task."],"_meta":{"tier":2,"layer":"Society","category":"Coordination","ring":2},"sema_ref":"ProblemFramer#f83d","sema_id":"sema:ProblemFramer#mh:SHA-256:f83d5805391f1691dec04c63685ee048954f06b8e7bec3b305b89b77b579dc48","sema_stub":"f83d","sema_layer":"Society","sema_category":"Coordination"},"layer":"Society","category":"Coordination"}},{"id":"66906d71-2b5a-43b1-a5da-4878554936cc","text":"Coordination","type":"CATEGORY","layer":null,"category":null,"handle":"Coordination","gloss":null,"stub":null,"metadata":{}},{"id":"9f3cf986-37d7-4ce8-8030-e7677caf8ee3","text":"Ownership: Owns the high-level success/failure of the task.","type":"INVARIANT","layer":null,"category":null,"handle":"Ownership: Owns the high-level success/failure of the task.","gloss":null,"stub":null,"metadata":{}},{"id":"Taper","text":"Taper#bff8","type":"PATTERN","layer":"Society","category":"Protocols","handle":"Taper#bff8","gloss":"Progressive ambiguity collapse from noisy input to certain output. Examples: Sema Discovery, Hiring pipelines, Compiler passes.","stub":"bff8","metadata":{"pattern":{"handle":"Taper","gloss":"Progressive ambiguity collapse from noisy input to certain output. Examples: Sema Discovery, Hiring pipelines, Compiler passes.","mechanism":"A multi-stage {{sequence}} process that accepts wide-aperture, high-entropy inputs and progressively filters them through {{gate}}s or {{tri_gate}}s of increasing strictness. Each stage: (1) Applies a stage-specific acceptance threshold, acting as a functional {{depth_governor}}; (2) Reduces the candidate set to {{compress}} 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).","signature":["Sequence(Gate)"],"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)"}],"_meta":{"layer":"Society","ring":1,"category":"Protocols","tier":1},"sema_ref":"Taper#bff8","sema_id":"sema:Taper#mh:SHA-256:bff8bb6ee32c4f709ea2128ae6bcd6af688cd5145cc4af8f13639e3be4135a46","sema_stub":"bff8","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"8e2ffc26-6593-48a2-8683-f494cb3807c4","text":"Monotonic Narrowing: |candidates[n+1]| <= |candidates[n]|","type":"INVARIANT","layer":null,"category":null,"handle":"Monotonic Narrowing: |candidates[n+1]| <= |candidates[n]|","gloss":null,"stub":null,"metadata":{}},{"id":"01532dec-6ae8-4abe-8ea9-ecc80251189b","text":"Strictness Increase: threshold[n+1] > threshold[n]","type":"INVARIANT","layer":null,"category":null,"handle":"Strictness Increase: threshold[n+1] > threshold[n]","gloss":null,"stub":null,"metadata":{}},{"id":"a0330b3b-e0ab-4738-8024-b02f07b29505","text":"Terminal Certainty: final stage tolerance = 0","type":"INVARIANT","layer":null,"category":null,"handle":"Terminal Certainty: final stage tolerance = 0","gloss":null,"stub":null,"metadata":{}},{"id":"PUREOptimization","text":"PUREOptimization#c352","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"PUREOptimization#c352","gloss":"Deeply optimizing a solution across PURE dimensions","stub":"c352","metadata":{"pattern":{"handle":"PUREOptimization","gloss":"Deeply optimizing a solution across PURE dimensions","mechanism":"A multi-agent {{optimize}} strategy. It accepts a candidate {{solution}} that has already passed the {{pure_check}}. It {{decompose}}s the solution into four parallel streams, assigning a specialized {{cognitive_solver}} to maximize each PURE metric: {{parsimony}} (Efficiency), {{novelty}} (Uniqueness), {{realizable}} (Feasibility), and {{expansive}} (Impact). The results are re-integrated via {{synthesis}} to find the {{pareto_front}} among competing improvements.","signature":["Optimize(Solution)"],"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)."],"failure_modes":["Optimization Conflict: Making it more Novel makes it less Realizable (Requires trade-off negotiation).","Synthesis Failure: The four optimized parts cannot be merged back into a coherent whole."],"_meta":{"tier":2,"layer":"Mind","category":"Strategy","ring":2,"related":["EvaluatorOptimizer","LateralOptimization"]},"sema_ref":"PUREOptimization#c352","sema_id":"sema:PUREOptimization#mh:SHA-256:c352abb258a026750e2cb364eff05df4b53965b2ddabb180f5693353d2a0bb50","sema_stub":"c352","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"0ee42de5-11d4-4b53-bebb-5fd3fc65c423","text":"Monotonic Improvement: The output score must be >= input score on all axes.","type":"INVARIANT","layer":null,"category":null,"handle":"Monotonic Improvement: The output score must be >= input score on all axes.","gloss":null,"stub":null,"metadata":{}},{"id":"6c8684ab-f9f9-471d-be1b-c96a056da0f7","text":"Non-Destructive: Optimization of one axis (e.g., Parsimony) must not break another (e.g., Realizable).","type":"INVARIANT","layer":null,"category":null,"handle":"Non-Destructive: Optimization of one axis (e.g., Parsimony) must not break another (e.g., Realizable).","gloss":null,"stub":null,"metadata":{}},{"id":"RealizationProtocol","text":"RealizationProtocol#b477","type":"PATTERN","layer":"Society","category":"Protocols","handle":"RealizationProtocol#b477","gloss":"Standard Interpret-Plan-Rollout workflow to ensure realizability","stub":"b477","metadata":{"pattern":{"handle":"RealizationProtocol","derived_from":"sema:CreationProtocol#mh:SHA-256:d289d0a26fec0c23993fedbe5593f5da302696271a454c714a0e91abaecfd8e2","mechanism":"A standardized {{solver_tree}} that orchestrates the lifecycle of a user_request executed by a {{cognitive_solver}}. It enforces a strict phase transition from Abstract to Concrete to ensure the result is {{realizable}}. 1. {{interpret}} converts request -> {{frame_spec}}. 2. {{manifest_planning}} converts spec -> {{execution_manifest}}. 3. {{rollout}} executes the manifest to produce the {{outcome}}.","gloss":"Standard Interpret-Plan-Rollout workflow to ensure realizability","failure_modes":["Bureaucracy: Blindly following all steps for trivial tasks.","Artifact Rejection: {{frame_spec}} or {{execution_manifest}} fails validation at seam.","Loop Stalling: Getting stuck in {{manifest_planning}}/{{rollout}} cycles without shipping."],"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)."],"preconditions":["user_request received","Agent Team available"],"postconditions":["final_outcome Shipped","Process Logged"],"_meta":{"layer":"Society","category":"Protocols","ring":1,"tier":2},"signature":["SolverTree(Outcome)"],"sema_ref":"RealizationProtocol#b477","sema_id":"sema:RealizationProtocol#mh:SHA-256:b47747d471756b93236a056095a5232a042f54eec5f15b0fcacf9ba302fbe3b1","sema_stub":"b477","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"2b0fb77c-73bc-49ec-be23-09f7a779015c","text":"Artifacts at Seams: Transitions MUST be mediated by the specified artifacts.","type":"INVARIANT","layer":null,"category":null,"handle":"Artifacts at Seams: Transitions MUST be mediated by the specified artifacts.","gloss":null,"stub":null,"metadata":{}},{"id":"3f2c0c19-c236-438b-b5c1-2eee5e0e55a3","text":"Non-Compensatory: If an artifact fails its spec, the process halts.","type":"INVARIANT","layer":null,"category":null,"handle":"Non-Compensatory: If an artifact fails its spec, the process halts.","gloss":null,"stub":null,"metadata":{}},{"id":"b5af905b-84a4-48eb-a3a0-4971031cd7e0","text":"Realizability: The outcome must be Realizable (concrete, actionable, feasible).","type":"INVARIANT","layer":null,"category":null,"handle":"Realizability: The outcome must be Realizable (concrete, actionable, feasible).","gloss":null,"stub":null,"metadata":{}},{"id":"02aae61f-097d-48e4-a551-a86e6757ee92","text":"user_request received","type":"PRECONDITION","layer":null,"category":null,"handle":"user_request received","gloss":null,"stub":null,"metadata":{}},{"id":"4912e3e1-a9c8-4a20-9ae2-359e6190a211","text":"Agent Team available","type":"PRECONDITION","layer":null,"category":null,"handle":"Agent Team available","gloss":null,"stub":null,"metadata":{}},{"id":"a0262478-ec8e-4954-8472-e40bbba56010","text":"final_outcome Shipped","type":"POSTCONDITION","layer":null,"category":null,"handle":"final_outcome Shipped","gloss":null,"stub":null,"metadata":{}},{"id":"db3bfd82-d626-4959-9ebf-b23284dcece6","text":"Process Logged","type":"POSTCONDITION","layer":null,"category":null,"handle":"Process Logged","gloss":null,"stub":null,"metadata":{}},{"id":"RigorousSolver","text":"RigorousSolver#151a","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"RigorousSolver#151a","gloss":"High-reliability, high-latency System 2 solver","stub":"151a","metadata":{"pattern":{"handle":"RigorousSolver","mechanism":"A high-reliability, high-latency implementation of {{cognitive_solver}}. Unlike the base interface which allows best-effort resolution, RigorousSolver MANDATES strict verification: it must execute {{probe}} to verify reality alignment and engage in {{socratic_loop}} to disambiguate intent before action. It incorporates {{feedback}} to improve future reliability. It trades speed for assurance (System 2).","gloss":"High-reliability, high-latency System 2 solver","invariants":["Lifecycle Completeness: Must complete all 5 stages including Verification.","Mandatory Verification: Cannot skip Probe step."],"derived_from":"sema:CognitiveSolver#mh:SHA-256:ae5ca9a47f9753157ff7177a76ed3b32e4bbecb67fd5207fb4b9a72acc6a6d20","_meta":{"layer":"Mind","category":"Strategy","ring":2,"tier":2},"sema_id":"sema:RigorousSolver#mh:SHA-256:151a5f118efaa4275a0735761c266e5656f4e7e8fda559c84b7c75be7b7384e0","sema_ref":"RigorousSolver#151a","sema_stub":"151a","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"d398a3bc-1020-47b3-a812-842a1fbc1730","text":"Lifecycle Completeness: Must complete all 5 stages including Verification.","type":"INVARIANT","layer":null,"category":null,"handle":"Lifecycle Completeness: Must complete all 5 stages including Verification.","gloss":null,"stub":null,"metadata":{}},{"id":"4519ee86-40ed-4dd3-b4c8-8ec0551ec8f6","text":"Mandatory Verification: Cannot skip Probe step.","type":"INVARIANT","layer":null,"category":null,"handle":"Mandatory Verification: Cannot skip Probe step.","gloss":null,"stub":null,"metadata":{}},{"id":"FractalIntelligence","text":"FractalIntelligence#df09","type":"PATTERN","layer":"Society","category":"Protocols","handle":"FractalIntelligence#df09","gloss":"The unified fractal architecture of scalable, self-correcting intelligence","stub":"df09","metadata":{"pattern":{"handle":"FractalIntelligence","mechanism":"The unified {{system}} of scalable cognition that uses {{reason}} to orchestrate the fractal expansion of intelligence within the {{universal_solver_tree}}. A {{problem_framer}} initiates the process, formulating a high-level {{strategy}} before assigning a {{cognitive_solver}} to a {{task}}. The solver executes a {{recursion_dive}} to spawn child nodes. As the tree deepens, nodes apply {{specialize}} to adapt to local sub-problems, using {{localized_learning}} to optimize performance. To ensure continuity and global coherence, the system employs {{experience_sharding}} to preserve memory and {{synthesis}} to integrate specialized insights back into the whole. {{state_snapshot}} creates save points for crash recovery. Efficiency is governed by the {{marginal_value_rule}}. If a path fails, {{reframe}} is triggered to restructure the tree or find a new {{problem_framer}}.","gloss":"The unified fractal architecture of scalable, self-correcting intelligence","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."],"signature":["System(Reason)"],"derived_from":"sema:RecursiveIntelligence#mh:SHA-256:216c297a34a0847957d1a6a8701987248bc8d63294953a78346b5b68dbb9aef6","_meta":{"tier":1,"layer":"Society","category":"Protocols","ring":1},"sema_ref":"FractalIntelligence#df09","sema_id":"sema:FractalIntelligence#mh:SHA-256:df09b597001e3e975150d888627cc798bca06da74bff4de85225a9ac8ddd11c8","sema_stub":"df09","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"9ff1c0eb-f089-422c-82bc-18ed4f4da9ef","text":"Fractal Self-Similarity: The process at the Root is identical to the process at the Leaf.","type":"INVARIANT","layer":null,"category":null,"handle":"Fractal Self-Similarity: The process at the Root is identical to the process at the Leaf.","gloss":null,"stub":null,"metadata":{}},{"id":"65d9d1d8-2f9e-443a-aa79-76191403e173","text":"Bounded Expansion: Recursion is limited by Economic constraints (Marginal Value).","type":"INVARIANT","layer":null,"category":null,"handle":"Bounded Expansion: Recursion is limited by Economic constraints (Marginal Value).","gloss":null,"stub":null,"metadata":{}},{"id":"4481ca2e-7dab-4248-bcbb-32af3d2be6b9","text":"Memory Conservation: Specialization must not result in the loss of global context.","type":"INVARIANT","layer":null,"category":null,"handle":"Memory Conservation: Specialization must not result in the loss of global context.","gloss":null,"stub":null,"metadata":{}},{"id":"PUREBrainstorming","text":"PUREBrainstorming#9191","type":"PATTERN","layer":"Mind","category":"Strategy","handle":"PUREBrainstorming#9191","gloss":"Generate -> Check -> Optimize -> Propose","stub":"9191","metadata":{"pattern":{"handle":"PUREBrainstorming","mechanism":"A rigorous ideation protocol. Unlike standard brainstorming (which prioritizes quantity), PUREBrainstorming enforces immediate quality filtering. It generates candidate concepts and subjects them to {{pure_check}}. Surviving concepts undergo {{pure_optimization}} to maximize their scores. The process converges only when a concept can be fully articulated as a {{mechanistic_design_proposal}}, ensuring that every idea is backed by a causal mechanism.","gloss":"Generate -> Check -> Optimize -> Propose","invariants":["Filter-First: No concept moves to the Proposal stage without passing PURECheck.","Mechanistic Rigor: The final output must match the MechanisticDesignProposal schema."],"_meta":{"tier":2,"layer":"Mind","category":"Strategy","ring":1},"sema_ref":"PUREBrainstorming#9191","sema_id":"sema:PUREBrainstorming#mh:SHA-256:91919a162e79e32c28e829ba3e7f2b55d345cf1f200b100e771caef7016fc59e","sema_stub":"9191","sema_layer":"Mind","sema_category":"Strategy"},"layer":"Mind","category":"Strategy"}},{"id":"0041c315-5aab-48e3-95c7-796663f9e81a","text":"Filter-First: No concept moves to the Proposal stage without passing PURECheck.","type":"INVARIANT","layer":null,"category":null,"handle":"Filter-First: No concept moves to the Proposal stage without passing PURECheck.","gloss":null,"stub":null,"metadata":{}},{"id":"6a956596-7fe9-454b-9ad9-e3172ff48705","text":"Mechanistic Rigor: The final output must match the MechanisticDesignProposal schema.","type":"INVARIANT","layer":null,"category":null,"handle":"Mechanistic Rigor: The final output must match the MechanisticDesignProposal schema.","gloss":null,"stub":null,"metadata":{}},{"id":"OptimisticSolver","text":"OptimisticSolver#0e2e","type":"PATTERN","layer":"Society","category":"Protocols","handle":"OptimisticSolver#0e2e","gloss":"High-velocity solver requiring parallel runtime","stub":"0e2e","metadata":{"pattern":{"handle":"OptimisticSolver","mechanism":"A high-velocity implementation of {{cognitive_solver}} designed for efficient multi-agent coordination. Requires a {{parallel}} runtime (Actor Model with Mailboxes) to prevent serial deadlock. It explicitly couples the standard Solver lifecycle (Reason -> Solution) with the {{atomic_bid}} protocol. Unlike the base abstraction, this pattern MANDATES that the agent plan and execute in a single turn. It relies on {{reflexion}} and {{compensate}} for error correction rather than pre-action permission. Use {{compute_budget}} to bound resource consumption. Contrast with {{rigorous_solver}} which prioritizes safety over speed.","gloss":"High-velocity solver requiring parallel runtime","preconditions":["Runtime supports Asynchronous/Parallel message delivery (Actor Model).","Message Bus is non-blocking (Mailbox pattern)."],"invariants":["Turn Atomicity: Must output [BID] and [TOOL] in the same response.","Non-Blocking: Cannot wait for Orchestrator approval on standard tasks."],"failure_modes":["Over-Eager Execution: Solving the wrong problem efficiently because feedback was skipped.","Serial Deadlock: If deployed on a single-threaded (Talking Stick) engine, multiple atomic outputs will be dropped, halting the swarm."],"_meta":{"tier":2,"layer":"Society","category":"Protocols","ring":1},"sema_ref":"OptimisticSolver#0e2e","sema_id":"sema:OptimisticSolver#mh:SHA-256:0e2edb38b8469329a7c4cb40c08c87c590f0f37ae17f34e5d6b5477964ef340e","sema_stub":"0e2e","sema_layer":"Society","sema_category":"Protocols"},"layer":"Society","category":"Protocols"}},{"id":"f59ec974-9c8c-46e8-9b26-faf9ff20bdf7","text":"Turn Atomicity: Must output [BID] and [TOOL] in the same response.","type":"INVARIANT","layer":null,"category":null,"handle":"Turn Atomicity: Must output [BID] and [TOOL] in the same response.","gloss":null,"stub":null,"metadata":{}},{"id":"cab3b112-0581-45f0-944c-a312296f709a","text":"Non-Blocking: Cannot wait for Orchestrator approval on standard tasks.","type":"INVARIANT","layer":null,"category":null,"handle":"Non-Blocking: Cannot wait for Orchestrator approval on standard tasks.","gloss":null,"stub":null,"metadata":{}},{"id":"a79b0062-4aab-41c7-9a21-c25800080187","text":"Runtime supports Asynchronous/Parallel message delivery (Actor Model).","type":"PRECONDITION","layer":null,"category":null,"handle":"Runtime supports Asynchronous/Parallel message delivery (Actor Model).","gloss":null,"stub":null,"metadata":{}},{"id":"9b973a0d-d3f5-4d61-a86d-cf5c77c3ba61","text":"Message Bus is non-blocking (Mailbox pattern).","type":"PRECONDITION","layer":null,"category":null,"handle":"Message Bus is non-blocking (Mailbox pattern).","gloss":null,"stub":null,"metadata":{}}],"edges":[{"id":"c326f72b-58b2-47fc-a9e8-8aba4f84eb94","source":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","target":"dd940360-426a-4ae0-beec-23a09aa3df9d","type":"IN_LAYER"},{"id":"fc62f428-5e17-4035-a213-bda9e7776107","source":"Artifact","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"92082ce9-360d-45a5-b662-e33f2ea789c6","source":"Artifact","target":"35350dbe-196c-4e0e-8a8c-196659812ed7","type":"HAS_INVARIANT"},{"id":"eaaad3a7-703f-448a-991a-9ef798a7b885","source":"Artifact","target":"cd79781c-00a7-48df-a23f-6a34a842b825","type":"HAS_INVARIANT"},{"id":"67a9a72f-3ac5-4fb6-b454-8b94a8f7b387","source":"Assessment","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"e052a15a-b9b4-4604-b104-84adf99c5fee","source":"Assessment","target":"bf3caf09-374e-4596-acb3-3e54512e941e","type":"HAS_INVARIANT"},{"id":"43ed64ac-5304-4e9a-b998-4447f014db65","source":"Assessment","target":"544b6fe7-5bce-47c5-b480-1de8c7e6f458","type":"HAS_INVARIANT"},{"id":"3c664700-5503-4556-898d-467954b0911a","source":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","target":"edbe6b2e-5cba-4798-b009-b8f6a0d86323","type":"IN_LAYER"},{"id":"35d90a65-6a07-4caa-88fd-3031ea429943","source":"Axiom","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"50de1aea-967e-435c-99f1-9a9a72e78a1d","source":"8f497759-ce27-442f-9c55-27f3c2ad7c49","target":"dd940360-426a-4ae0-beec-23a09aa3df9d","type":"IN_LAYER"},{"id":"cb052034-c226-496a-81cb-061c0ad0a76c","source":"Backoff","target":"8f497759-ce27-442f-9c55-27f3c2ad7c49","type":"IN_CATEGORY"},{"id":"b47e47f8-03c6-4a52-864c-ea32faa29511","source":"Backoff","target":"8fae7156-7046-4ae0-9c9d-9571dcb17f13","type":"HAS_INVARIANT"},{"id":"519e4482-9d8f-45f2-b948-6fb3993c0191","source":"90800e2d-25ad-47b4-9463-179cdb2d083f","target":"1609c741-f64f-447a-9dcd-cfeecd560a7f","type":"IN_LAYER"},{"id":"15603015-4455-4ba9-97ce-2a333a6a59c7","source":"BaseRateInclude","target":"90800e2d-25ad-47b4-9463-179cdb2d083f","type":"IN_CATEGORY"},{"id":"1b7020fa-70a8-42f3-9cd2-519accfa99d2","source":"BaseRateInclude","target":"4fc11393-9bc5-43a8-8a61-4c18f38e8cbd","type":"HAS_INVARIANT"},{"id":"7c2528ac-118d-4fd6-9dc2-ebc72a0034d5","source":"BaseRateInclude","target":"3eacaa43-7532-45a8-8adb-9f3ae69f48c2","type":"HAS_INVARIANT"},{"id":"585cfb88-8c63-4e15-9750-a93f3454cc80","source":"BaseRateInclude","target":"70320f54-4296-443c-8e55-cf3bcf0ff59c","type":"HAS_PRECONDITION"},{"id":"d197688b-de3f-4d12-8476-ecf0315a07e6","source":"BaseRateInclude","target":"e9c6ad4a-20e8-4367-aade-e4cd5702c54d","type":"HAS_PRECONDITION"},{"id":"e8a16524-6621-45e8-a3ab-b5c7fafbdc2a","source":"BaseRateInclude","target":"9bc9cab7-0d19-4230-abb4-ad450a3448f9","type":"HAS_POSTCONDITION"},{"id":"5ae46a01-5fbd-4717-9354-21376c817fb3","source":"e5a36812-8586-4359-8f6a-7c5631923812","target":"bf10f73c-8b8e-4c32-9dd4-40c93954f2f7","type":"IN_LAYER"},{"id":"0a2dd98c-c14b-4529-b809-d7321838abda","source":"Branch","target":"e5a36812-8586-4359-8f6a-7c5631923812","type":"IN_CATEGORY"},{"id":"c789a7f3-d2ef-4ec4-9e16-47c15d95da4d","source":"Budget","target":"8f497759-ce27-442f-9c55-27f3c2ad7c49","type":"IN_CATEGORY"},{"id":"ce3bc63d-3d54-40be-9681-f4bd23dc5fad","source":"Budget","target":"27f93cc6-2469-498d-accb-26ca5c05334a","type":"HAS_INVARIANT"},{"id":"dca86f0c-fde0-483a-baf1-ae456fc7298d","source":"Budget","target":"d696e573-a0a4-4906-ac64-bc01c141f811","type":"HAS_INVARIANT"},{"id":"e4f7118b-2d14-417b-a5d8-52a4c1aa1429","source":"Budget","target":"631cdcce-3fdb-4cb9-96e6-5713855be4cc","type":"HAS_PRECONDITION"},{"id":"7ad4aca9-2d63-4e4b-82f3-ab2a07b186ca","source":"Budget","target":"42086226-4684-4a86-9146-bdbb15f8af27","type":"HAS_POSTCONDITION"},{"id":"a0103c05-49f3-46ae-8a91-388b170a1e60","source":"Category","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"27c56fc1-c061-4421-b047-08f70925b3d2","source":"e38ff6e0-872e-4a63-a7ea-ebb84e174347","target":"1609c741-f64f-447a-9dcd-cfeecd560a7f","type":"IN_LAYER"},{"id":"1502b7f5-fb00-4a9b-a5a9-67a8b59aa7aa","source":"Compare","target":"e38ff6e0-872e-4a63-a7ea-ebb84e174347","type":"IN_CATEGORY"},{"id":"92a9a643-1e4e-4aea-af13-bb2d35f9da0d","source":"Compare","target":"b020829b-9579-4a0f-91f1-9aea956b9c4c","type":"HAS_INVARIANT"},{"id":"72b52b79-17a3-4dd8-911b-5755224e0cc4","source":"Compare","target":"54c7e59c-b8b1-4fff-be1c-a3299cdc5936","type":"HAS_INVARIANT"},{"id":"470b5ecb-32c5-4fe3-a7fc-6bc6bfb961ea","source":"Compare","target":"15907d93-9f5d-4920-851e-ec6f7c3697db","type":"HAS_INVARIANT"},{"id":"780a7f66-d9f0-45bf-9347-fa6d1f2a7710","source":"8f497759-ce27-442f-9c55-27f3c2ad7c49","target":"bf10f73c-8b8e-4c32-9dd4-40c93954f2f7","type":"IN_LAYER"},{"id":"cd2d0049-dbfd-4799-8d00-0bf563ef295f","source":"Compress","target":"8f497759-ce27-442f-9c55-27f3c2ad7c49","type":"IN_CATEGORY"},{"id":"cdb28cf5-be2c-46a2-a215-b02447b07795","source":"Compress","target":"5b24b112-00e7-492d-b5a3-3d6610d7c6cb","type":"HAS_INVARIANT"},{"id":"02ab17a0-36c4-4938-8672-998726514739","source":"Compress","target":"4a3e9663-11a6-471e-8604-6870887cec4a","type":"HAS_INVARIANT"},{"id":"5ded0c65-3704-4ed8-a652-e45db61d0de9","source":"ConceptAnchor","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"274a0062-eb3c-479e-a4fa-3e85eea70802","source":"ConceptAnchor","target":"d6a588d6-f49c-42e0-b251-5b18ea015b90","type":"HAS_INVARIANT"},{"id":"5d5347d5-97da-4345-aefd-c7a7c182daa4","source":"ConceptAnchor","target":"279555ce-852c-44a9-af72-c2a5219b41a6","type":"HAS_INVARIANT"},{"id":"e32cb49b-35e9-4c34-b525-657b3dbf3b7b","source":"ConceptAnchor","target":"529eeee8-cede-4fff-9011-9f26d18c8bc2","type":"HAS_INVARIANT"},{"id":"3e040bf3-4af3-44e0-9ddf-5bb39c8aa08d","source":"Condition","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"0d43c4fc-0118-47af-a715-9eca70cf20f9","source":"Condition","target":"c72a6acd-9d9a-44a2-8970-28e52ee090f3","type":"HAS_INVARIANT"},{"id":"f8d09777-f9be-4028-bcdb-354ec235fc20","source":"Condition","target":"4c4a6886-a050-45bb-b4ad-25b627cca09a","type":"HAS_INVARIANT"},{"id":"b24e1a74-4272-44cf-a386-162793bdf682","source":"ConfirmationBlock","target":"90800e2d-25ad-47b4-9463-179cdb2d083f","type":"IN_CATEGORY"},{"id":"c764100b-468c-49dc-9da1-d2f29b290105","source":"ConfirmationBlock","target":"6ef15b3c-a080-49c8-b718-ffcf06223ac9","type":"HAS_INVARIANT"},{"id":"73beee31-d44c-41dd-b434-c6ea9351eb35","source":"Constraint","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"43b1bee7-0926-428c-ac37-6f6adc3c0c53","source":"Constraint","target":"1f5bee46-a32a-4d46-8279-1b31909fde70","type":"HAS_INVARIANT"},{"id":"fd04aa22-dd9b-4e4f-af43-68cb325211e2","source":"Constraint","target":"2e00dae2-b41a-4bba-b380-4f95b911841c","type":"HAS_INVARIANT"},{"id":"3254718e-5b37-4a8b-ae78-648ed1a0aea0","source":"Constraint","target":"cb75f865-1d33-4d93-8b33-614a13eee97b","type":"HAS_INVARIANT"},{"id":"b9bbbd69-70c0-4226-8754-a43b18c3ddbd","source":"7022f5a2-2592-4f7b-b435-a2bd088476ff","target":"1609c741-f64f-447a-9dcd-cfeecd560a7f","type":"IN_LAYER"},{"id":"d466601b-bf77-40c6-a321-8817a737a54c","source":"Creative","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"6cac34d7-9415-4bd3-b2aa-6b56758ba9a6","source":"CryptoShred","target":"8f497759-ce27-442f-9c55-27f3c2ad7c49","type":"IN_CATEGORY"},{"id":"6b0f82da-fe93-42bb-a18b-b5ca4b7e7f89","source":"CryptoShred","target":"ed5f9485-a12a-48f6-af41-50639501e9f6","type":"HAS_INVARIANT"},{"id":"d9fafbeb-c2c4-473e-a4c9-f3bfaefb17bb","source":"Datum","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"1e0ff171-f449-4a6d-942b-43b5758b1422","source":"Deep","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"6efbfcb7-b5a9-4bbc-afca-1b0fe5d5434d","source":"Deep","target":"26428a14-9ec8-4145-8bbe-5c9aba8cbaf0","type":"HAS_INVARIANT"},{"id":"245eb062-53f1-49d7-9899-500b8f829ec3","source":"Deep","target":"d57793c6-4cd2-4670-a7d5-597cfafa8874","type":"HAS_INVARIANT"},{"id":"2f571afa-a368-47cc-88c1-0bc0ae447685","source":"Deep","target":"7210b90d-9571-4f1e-9d61-74baba0f091d","type":"HAS_INVARIANT"},{"id":"b54fa3d8-f583-45f0-b88b-8d7e77599638","source":"ExecutionManifest","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"4fb2de4c-3c1a-4a86-950e-490b9df8a7ce","source":"ExecutionManifest","target":"32d0e588-6623-4ea5-95ef-045bcefeb35f","type":"HAS_INVARIANT"},{"id":"cb38c359-439b-426e-8ffe-b60c3240a59d","source":"ExecutionManifest","target":"3f057d16-02d9-4bd5-89e7-6d2b9d6569c3","type":"HAS_INVARIANT"},{"id":"e9cfd72f-8b86-4d7d-8cf4-4c5bfb7d726f","source":"Global","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"4724440b-a4c1-4b10-893e-2ac8021a72ae","source":"Hypothesis","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"7668d73a-553e-4ee8-a191-cf91cee12d18","source":"579b02af-c094-442f-8ef9-67bcd86bd62f","target":"dd940360-426a-4ae0-beec-23a09aa3df9d","type":"IN_LAYER"},{"id":"b46daf70-f1f5-4e4c-ba48-97f2629d2cfe","source":"InputGuard","target":"579b02af-c094-442f-8ef9-67bcd86bd62f","type":"IN_CATEGORY"},{"id":"c46327f7-f37f-470d-a09d-f58f9e920bcf","source":"Kairos","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"b33de00d-5a06-452f-851b-2260024bbd2c","source":"Kairos","target":"db44f9fb-2bbd-497e-845a-c1f02ba758db","type":"HAS_INVARIANT"},{"id":"0b6c8a49-c7c1-4f08-8b79-9ad87b91c518","source":"Kairos","target":"a3444315-b521-4bce-8d10-da0685f5dab6","type":"HAS_INVARIANT"},{"id":"b3c48503-dfea-42d7-b479-a7025ff550e1","source":"Lock","target":"8f497759-ce27-442f-9c55-27f3c2ad7c49","type":"IN_CATEGORY"},{"id":"e6162685-2b0f-4d5f-898a-2213ac8db042","source":"MECE","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"ea6ad70d-7063-4930-9017-9ababa0b62e0","source":"MECE","target":"671691a3-4e97-4221-8625-310bf5c4a960","type":"HAS_INVARIANT"},{"id":"f00c4e23-9058-425d-ab13-25cb8852d8c8","source":"MECE","target":"1204beda-8e8b-4cdf-9bd5-0b317b86ac90","type":"HAS_INVARIANT"},{"id":"36387923-1f78-4ca2-b9f9-1217484f98d5","source":"Meta","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"8b5f8c73-13f9-48ef-932d-9b5c446a1053","source":"MonitorReport","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"4492980f-b2c6-4c5f-9bdb-f60372c4bf9a","source":"Option","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"daa85859-141f-4766-974e-dafd50ff149e","source":"Parallel","target":"e5a36812-8586-4359-8f6a-7c5631923812","type":"IN_CATEGORY"},{"id":"e117eb76-bbc2-470e-aaf4-ce1465233bbe","source":"Prompt","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"1f2da795-7760-4202-9abc-dfd19c197b21","source":"Protocol","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"f89daa45-8984-478f-9210-3252afc6cdee","source":"Prototype","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"27693304-0f9d-4d83-9a1d-52661c57806a","source":"Reflex","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"4c84ef9b-fc8c-4876-a879-ae2689d3942b","source":"Reflex","target":"59a4c283-2f99-4571-832a-a558bfbc8146","type":"HAS_INVARIANT"},{"id":"2bb2510e-8f00-4767-9b65-f2670de26900","source":"RolloutManifest","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"98f3ca3d-c306-4a9c-8932-8c604c02f080","source":"RolloutManifest","target":"236fa6be-973c-4add-8c8a-ef9393519e62","type":"HAS_INVARIANT"},{"id":"5b54e989-adff-41f6-aa8e-2e67f7d7fb42","source":"RolloutManifest","target":"44a2a083-43e2-4593-9d02-3700f8476b27","type":"HAS_INVARIANT"},{"id":"0cbfafd8-b4e7-49a3-a175-bbc73186fb23","source":"Sandbox","target":"8f497759-ce27-442f-9c55-27f3c2ad7c49","type":"IN_CATEGORY"},{"id":"4f5eaa9d-1f26-4eb0-8827-a1645e45e4f4","source":"6fe7b13d-4ed3-4c51-ae9a-7943dd282dbf","target":"1609c741-f64f-447a-9dcd-cfeecd560a7f","type":"IN_LAYER"},{"id":"5a5495ea-81ef-4b7f-9877-8f69a806db4c","source":"Scratchpad","target":"6fe7b13d-4ed3-4c51-ae9a-7943dd282dbf","type":"IN_CATEGORY"},{"id":"2e5b33ec-4e3c-414b-b54e-6a6e16bf3817","source":"Scratchpad","target":"480de0ff-4041-40e9-a2d6-c093d0d8007e","type":"HAS_INVARIANT"},{"id":"23608834-a0af-40a2-882a-3f66f5c995d6","source":"Scratchpad","target":"dedacd95-01ae-4652-98af-3b9f51237c54","type":"HAS_INVARIANT"},{"id":"a7d9e694-79ef-4deb-a256-d39bcbf725be","source":"Scratchpad","target":"310e8805-a232-4090-ae42-303715ed79ef","type":"HAS_INVARIANT"},{"id":"4ff5e518-8cae-4417-b7ee-53e0d2bd070e","source":"Select","target":"8f497759-ce27-442f-9c55-27f3c2ad7c49","type":"IN_CATEGORY"},{"id":"e0d0aa44-8a08-41bc-b75f-80d491d02bc6","source":"Select","target":"198c8d0e-0851-4ae5-8b7b-f0e965dd34fc","type":"HAS_INVARIANT"},{"id":"ffa628cd-0ba7-4cf2-81cd-04926be8cec8","source":"Select","target":"aa1e6b77-06f8-4a4a-8d19-8f387f8989e0","type":"HAS_INVARIANT"},{"id":"b94c8a20-0c4e-437d-afc5-92d0b0d23700","source":"Select","target":"720bf58a-72e0-4ddb-85eb-9bd6814cf4b8","type":"HAS_INVARIANT"},{"id":"8432e613-a726-4874-ba9b-fa2740b23016","source":"Select","target":"36dcd26e-3a6a-4e1a-8d2d-bc2caa835d65","type":"HAS_PRECONDITION"},{"id":"fcdc45de-c8dc-418b-b2e9-2a31f4af225f","source":"Select","target":"5d4f5421-a263-42ee-bad3-2ce4ed713f8d","type":"HAS_PRECONDITION"},{"id":"45d2756f-9e24-46b2-9373-e3a8c14a8e20","source":"Select","target":"d5414515-6bb5-427b-bd95-50a96b7cb7b8","type":"HAS_POSTCONDITION"},{"id":"39ed122b-3890-49fc-953a-a9ef7a927f0e","source":"Sequence","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"faeb1191-9a7d-400f-bb09-cc89523a4dee","source":"Signal","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"5373e230-5cb6-4439-8afc-816a58640c4c","source":"Signal","target":"bbbe2609-8b46-45d7-b4a1-9ee417d1bdab","type":"HAS_INVARIANT"},{"id":"df59d450-e934-44c5-9ea5-1681627941ef","source":"Signal","target":"14874262-74ad-4558-a028-5e35fe9a61fb","type":"HAS_INVARIANT"},{"id":"5e208cc0-be3a-410c-912b-4fc7fad06275","source":"Skeleton","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"2266620e-b682-4ffd-995e-c51e8620ff16","source":"Skeleton","target":"4a54eb73-6274-4909-932c-cc3353503271","type":"HAS_INVARIANT"},{"id":"425c274f-7479-46e1-9502-6d5a30a69ab7","source":"Step","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"dbda9e42-748e-4107-8a99-8e7522222014","source":"Step","target":"f91fb8ab-ae8c-478d-b007-9a99a3d73f60","type":"HAS_INVARIANT"},{"id":"5db1a40d-589a-4fa2-bdf9-e1afd72c40cb","source":"Step","target":"7c5015eb-1393-4b5b-8db2-c5f45bdb16b2","type":"HAS_INVARIANT"},{"id":"9e8fe6e7-9f6a-4b83-b38e-2ebcb39689ff","source":"System","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"cc90f6b0-8232-4db2-9573-04840b46e804","source":"Topology","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"54eb6259-8471-4f24-870b-6640d904cf18","source":"Variable","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"ce0e1ad6-9f05-455f-8b34-9d861113275f","source":"Vector","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"e89403ae-ffa8-4f26-a43f-bdb588206751","source":"CompatibilityCheck","target":"579b02af-c094-442f-8ef9-67bcd86bd62f","type":"IN_CATEGORY"},{"id":"59f1b26b-aeab-4181-a28b-e661fb9cb638","source":"CompatibilityCheck","target":"Artifact","type":"REFERENCES"},{"id":"37056959-df68-4325-85dd-62428c60f003","source":"CompatibilityCheck","target":"720bf58a-72e0-4ddb-85eb-9bd6814cf4b8","type":"HAS_INVARIANT"},{"id":"47030f08-188c-4459-b18c-8ae23e823441","source":"CompatibilityCheck","target":"f204d3ca-bcff-471d-9174-a8da00a3af9a","type":"HAS_INVARIANT"},{"id":"c3cc9508-2953-4adb-a5bc-0539d00fcb62","source":"Criteria","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"b669c25f-334c-42da-a251-02a8f670bae2","source":"Criteria","target":"Artifact","type":"REFERENCES"},{"id":"87808358-ebec-4ec4-95ad-cfddc714f119","source":"Deduction","target":"e38ff6e0-872e-4a63-a7ea-ebb84e174347","type":"IN_CATEGORY"},{"id":"38fba85f-5414-4c4e-885f-d32b364aa4cc","source":"Deduction","target":"Axiom","type":"REFERENCES"},{"id":"59083168-7662-4808-9a5c-ad748aa78f25","source":"Deduction","target":"f315ef3b-b87e-456b-9e44-6d8cdacde71e","type":"HAS_INVARIANT"},{"id":"3f48e2a6-0dd6-4511-a1cb-0eb66b96e802","source":"Deduction","target":"82bb797d-1032-47cf-a72a-0610d82f96c5","type":"HAS_INVARIANT"},{"id":"1b654320-cd02-4402-b421-b70cb0ff1804","source":"Deduction","target":"7f064518-6b16-464d-9ba1-bf09559ecbcf","type":"HAS_PRECONDITION"},{"id":"7e4146b3-ff5c-45aa-8d4d-5927dc33eb69","source":"Deduction","target":"5d2e1a30-aecc-4c77-98ae-7d2564662ab7","type":"HAS_POSTCONDITION"},{"id":"6d478b85-6946-4f22-9b38-a0414c2c0357","source":"Hierarchy","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"fcb936e6-1554-440b-acd8-717c236cc9d9","source":"Hierarchy","target":"Category","type":"REFERENCES"},{"id":"04268a77-ecba-431e-a0a0-32b51b017292","source":"FeatureFlag","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"437ec8cb-8d73-448c-9d77-66d0367ee0e4","source":"FeatureFlag","target":"Condition","type":"REFERENCES"},{"id":"c0e5e51d-e81c-45e7-b679-936b1d0f4450","source":"Gate","target":"8f497759-ce27-442f-9c55-27f3c2ad7c49","type":"IN_CATEGORY"},{"id":"e44c8cf6-ebaf-41a1-a187-375c733f99ed","source":"Gate","target":"Condition","type":"REFERENCES"},{"id":"ad15dcc0-7e4d-4de7-960c-9dc4a3a37216","source":"Gate","target":"15380d93-fad1-4189-81df-c030d131f524","type":"HAS_INVARIANT"},{"id":"f281e046-94f4-406d-b26f-0f4824205aed","source":"Gate","target":"a8a0d0bf-910e-420e-a6db-0e1bd8d1e1c9","type":"HAS_INVARIANT"},{"id":"8b5998a8-d895-476b-b84d-3d50fe63035b","source":"ConstraintFirst","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"60bd92bc-0be5-449e-bb75-7fe577c910d9","source":"ConstraintFirst","target":"Constraint","type":"REFERENCES"},{"id":"38dcca6c-1eab-44b8-bd3c-971aafb6cfa6","source":"ConstraintFirst","target":"3495e254-f019-4ab6-8a5a-63df9159239e","type":"HAS_INVARIANT"},{"id":"9298dcca-0288-4936-954b-86354264c690","source":"Reversibility","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"9c775afb-fc16-441d-8352-5f87b6b2d669","source":"Reversibility","target":"Constraint","type":"REFERENCES"},{"id":"d0b5cfff-abef-4ad2-91a2-efcc02fad55b","source":"Reversibility","target":"b98472f8-9964-4023-84d0-90b1da1cc2bf","type":"HAS_INVARIANT"},{"id":"8071f1fa-59b4-4891-81b8-2076c3db2d7b","source":"Anomaly","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"fb7ce40e-e9c0-4124-841c-b96ea1626453","source":"Anomaly","target":"Datum","type":"REFERENCES"},{"id":"72bf4973-eed0-4c08-a999-988a6ea1501f","source":"Assumption","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"130ea805-7e1d-46f0-9011-595e0a34c0b7","source":"Assumption","target":"Datum","type":"REFERENCES"},{"id":"35240a3c-1270-4fe5-bf30-996fc86d3f63","source":"Assumption","target":"340aeceb-8959-4882-a608-45e492e37208","type":"HAS_INVARIANT"},{"id":"6c8fae02-ed6d-409c-90af-be9aa73440fe","source":"Assumption","target":"4a6e7148-62e6-4a30-b8a2-cf18fd93c8c2","type":"HAS_INVARIANT"},{"id":"f628f10d-3c61-415d-a222-f18854024517","source":"CognitiveBias","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"eb998abc-d394-4524-9ecb-7f406c95e7b5","source":"CognitiveBias","target":"Datum","type":"REFERENCES"},{"id":"c07ffab7-23b0-46a0-9a11-b25d29860dd3","source":"Induction","target":"e38ff6e0-872e-4a63-a7ea-ebb84e174347","type":"IN_CATEGORY"},{"id":"9f3b10b5-4533-42fb-88f9-ac976b4e79e1","source":"Induction","target":"Datum","type":"REFERENCES"},{"id":"9b19e87b-f6d4-46e3-a9e5-13349bfbd9fd","source":"Induction","target":"816f092d-7de8-4bdd-b911-b1aaa759c839","type":"HAS_INVARIANT"},{"id":"eb271a8f-16eb-4ada-9790-06b493678cfe","source":"Induction","target":"9fbd3cd1-f8a5-478f-b758-42090851cb56","type":"HAS_INVARIANT"},{"id":"eadb9e8a-b286-40ec-bfa9-4bf3d0fc571c","source":"Abduction","target":"e38ff6e0-872e-4a63-a7ea-ebb84e174347","type":"IN_CATEGORY"},{"id":"66ddb8bf-acf1-443a-96b1-3dddc435ce50","source":"Abduction","target":"Hypothesis","type":"REFERENCES"},{"id":"0d28aa86-9999-410d-9d30-86d9263225bf","source":"Overlap","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"2aa8fd36-20c9-4a5e-b50c-6e27cc69ec2b","source":"Overlap","target":"MECE","type":"REFERENCES"},{"id":"9691f84e-a4f2-474a-8b1a-b7d94db3fb06","source":"Overlap","target":"d4c36a8d-2c69-4347-b34a-54097a53d23d","type":"HAS_INVARIANT"},{"id":"f797331d-24e7-45a2-b144-269eeec59bd3","source":"Overlap","target":"52b40e75-f875-4a64-9930-c6aefdf658d0","type":"HAS_INVARIANT"},{"id":"38bc32e7-c699-4048-bc61-00ea1d7787fa","source":"Overlap","target":"b0f2526b-906f-42a7-bf20-7cd852a38bc5","type":"HAS_PRECONDITION"},{"id":"73645c95-8535-462b-b266-dcffcc9bb0f4","source":"Overlap","target":"87a30cd0-c20c-4852-bdbb-9e91c6f963b8","type":"HAS_POSTCONDITION"},{"id":"e9b3df6f-3884-4a58-baed-befd7b761a0e","source":"Nature","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"83010853-7ea3-4663-b835-4d56cacfd638","source":"Nature","target":"Protocol","type":"REFERENCES"},{"id":"ee6445b6-adbd-478e-b492-b57a2981aa39","source":"ProtoPack","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"4de91a23-e050-4db2-8337-74b727113c33","source":"ProtoPack","target":"Prototype","type":"REFERENCES"},{"id":"1ed5d83c-4f00-422b-9385-56271a3ee29a","source":"ProtoPack","target":"Artifact","type":"REFERENCES"},{"id":"b3d16e77-6ab9-4dbb-9395-d4e469447da2","source":"ProtoPack","target":"8ad80e2a-9850-4b3e-9861-a231f8321473","type":"HAS_INVARIANT"},{"id":"a27ee08e-4434-475c-bade-e44dba02d684","source":"ProtoPack","target":"dd8e23da-c3a0-4ee8-8ed3-813fddf1ab82","type":"HAS_INVARIANT"},{"id":"f883480e-d6a6-43f7-8248-aa18a7eddd0c","source":"Probe","target":"8f497759-ce27-442f-9c55-27f3c2ad7c49","type":"IN_CATEGORY"},{"id":"0b46c96c-5a08-4642-9efb-0a706c3e894d","source":"Probe","target":"Sandbox","type":"REFERENCES"},{"id":"2a0a640a-5a5f-4ab4-a09a-c388b8df07cc","source":"Probe","target":"a115e16b-0972-4e83-ae5f-0a6809cb32e8","type":"HAS_INVARIANT"},{"id":"c815b09e-a076-4687-b1e8-faf56d9f411e","source":"Probe","target":"cff360e1-c136-4187-b1b0-c358b05814d5","type":"HAS_INVARIANT"},{"id":"c44bc219-a87c-469b-83bd-145d643a298a","source":"Probe","target":"3d3c9c58-a208-4003-997a-6c770fb0491e","type":"HAS_INVARIANT"},{"id":"b3c0b0cf-22ab-4009-8be3-9d1ae95d74fa","source":"Probe","target":"2f9b5292-f006-4e9b-bdb5-a5dbe72a4bf7","type":"HAS_INVARIANT"},{"id":"1dcca3c9-1748-43fa-a78e-f71d6d301f4f","source":"Probe","target":"5659f6de-45d9-430c-a918-4e4f0d8e09ac","type":"HAS_PRECONDITION"},{"id":"d350ffeb-5653-4952-931d-f6c6c018ff29","source":"Probe","target":"7a1bc86a-b337-4d32-98e3-327ebac98ae3","type":"HAS_PRECONDITION"},{"id":"3d5df1b1-9aba-489e-89b3-fbb38821a6d0","source":"Probe","target":"3f1e339c-1a10-4cdf-b976-42d5fef4884c","type":"HAS_POSTCONDITION"},{"id":"76562511-9ec0-42f4-b98e-c3bfc39b3978","source":"Probe","target":"70f99e81-1354-40fe-b8d7-e293dd206cda","type":"HAS_POSTCONDITION"},{"id":"a51e14e3-e2d9-421d-8823-2becf4a00a35","source":"Probe","target":"a3e60a82-e133-462d-8336-eeb40e7808da","type":"HAS_POSTCONDITION"},{"id":"02ef71ba-11fd-4181-a57a-226026764267","source":"Ballot","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"dd3a14d7-5546-444a-b9ef-8510eddbf1ee","source":"Ballot","target":"Select","type":"REFERENCES"},{"id":"3d587ca7-ba92-4622-b8c7-d317633faacf","source":"Ballot","target":"0ea68f51-0add-46c8-86fa-fc9d6414161d","type":"HAS_INVARIANT"},{"id":"4a2b7a2e-5ed5-47ee-8de7-927cd71563c7","source":"Ballot","target":"bf439988-6c14-4f75-aea5-04a03f13e5c2","type":"HAS_INVARIANT"},{"id":"826e77c1-587b-4569-a7ff-50cbc3ddae7e","source":"Decision","target":"e38ff6e0-872e-4a63-a7ea-ebb84e174347","type":"IN_CATEGORY"},{"id":"c0b37ef3-d9b6-4446-a46b-34bea9207776","source":"Decision","target":"Select","type":"REFERENCES"},{"id":"2c1c2aad-500c-4545-9547-88f597db4e59","source":"Decision","target":"Option","type":"REFERENCES"},{"id":"643f109a-dd8d-4fee-bfa8-d6b0b387c4a3","source":"Decision","target":"b8933b69-7294-41d3-88e0-2071a23eb5b1","type":"HAS_INVARIANT"},{"id":"2d7f6f72-5dec-4c2e-9ff3-c19d90ea6001","source":"Decision","target":"4e98dc96-7d52-4775-a96d-a1a33ad025e8","type":"HAS_INVARIANT"},{"id":"f7f4db0c-f7f7-4c18-ba4b-4bf6a551be9a","source":"Rank","target":"e38ff6e0-872e-4a63-a7ea-ebb84e174347","type":"IN_CATEGORY"},{"id":"87b6795f-c50f-4aad-921e-ffbcb6f05008","source":"Rank","target":"Select","type":"COMPOSES_WITH"},{"id":"47fd2d21-d5e7-4872-897e-5704dad0d760","source":"Rank","target":"97450bd5-d327-4300-9227-49fbc5bd77ef","type":"HAS_INVARIANT"},{"id":"7f3d2c6d-8efd-4780-99b8-5749846c3fed","source":"Rank","target":"a8531e5c-823c-4efa-8e4e-1e65fcff21ed","type":"HAS_INVARIANT"},{"id":"624161fa-7fdc-49a0-94a6-11161e24b279","source":"Message","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"d56493a5-6864-4492-acc1-9c9496cfe360","source":"Message","target":"Signal","type":"REFERENCES"},{"id":"f50df5f2-b385-48c4-9954-ee312439239a","source":"Message","target":"b97fb6b2-0725-4a27-8907-d041c5049c1a","type":"HAS_INVARIANT"},{"id":"0053d6a4-e7db-4a0f-8432-b8d9cd7be513","source":"Message","target":"1285b81d-3dcd-4305-9a6a-6d4d4ff77208","type":"HAS_INVARIANT"},{"id":"4219890e-295c-42a5-9adc-710cc044f95a","source":"Silence","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"c9c5895c-65eb-46db-814b-8c474b6f1443","source":"Silence","target":"Signal","type":"REFERENCES"},{"id":"639e680f-c323-405d-977f-fd9f6c5d06c9","source":"Silence","target":"f9ba240c-41c3-4a99-8736-4ad6e5ce22fa","type":"HAS_INVARIANT"},{"id":"a92c7799-48ec-4f12-97d9-5fbc9c435e23","source":"SpectralTune","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"3c67d732-a03f-41dc-9ea2-42faa9380ea8","source":"SpectralTune","target":"Signal","type":"ACCEPTS"},{"id":"a715de02-0983-439f-84e5-c60356d777b5","source":"SpectralTune","target":"0914bfda-4e65-41aa-adb8-25fb9bb15af3","type":"HAS_INVARIANT"},{"id":"4530345a-990c-408f-8535-188180928611","source":"SpectralTune","target":"a3455dae-91fb-4049-9daa-f48eda70c38e","type":"HAS_INVARIANT"},{"id":"32355507-bd29-4182-be17-c1b0cbb33f8b","source":"SpectralTune","target":"f83d9a8b-5771-4f74-b0d7-f04e1b5f58dc","type":"HAS_INVARIANT"},{"id":"11cda48d-afd4-4985-96ef-96180f04cda4","source":"SpectralTune","target":"5fce8047-0b6f-440c-9b30-c11432ae27a0","type":"HAS_PRECONDITION"},{"id":"9785f437-c78c-4f43-a58f-00331f9c5ae0","source":"SpectralTune","target":"4447624e-e6f4-4a30-acf1-4fd84531dc50","type":"HAS_POSTCONDITION"},{"id":"2c339f07-21ff-4144-a7c7-6e9a55a4cbdd","source":"State","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"512b5257-52f8-4a22-a343-c9596c69f3a7","source":"State","target":"Condition","type":"REFERENCES"},{"id":"1194f75f-7a8f-4e66-8744-1c2d7c7fe5f8","source":"State","target":"System","type":"REFERENCES"},{"id":"c4525a81-db11-4000-ba55-5c99750643f4","source":"State","target":"08b91cac-437e-4990-8ead-8aece4d3976c","type":"HAS_INVARIANT"},{"id":"886848ce-e9cc-4b14-be9a-bdd4d637f1ff","source":"State","target":"2945e4d8-1682-44ab-8be0-a8916822c37c","type":"HAS_INVARIANT"},{"id":"d49c8630-3755-4ee4-8d02-298293fb1779","source":"Linear","target":"8f497759-ce27-442f-9c55-27f3c2ad7c49","type":"IN_CATEGORY"},{"id":"de111b22-2a7e-4e76-9a5d-1af66cae7537","source":"Linear","target":"Topology","type":"REFERENCES"},{"id":"c427924d-3ef2-4072-8e46-fd43d15dd26b","source":"Linear","target":"Sequence","type":"REFERENCES"},{"id":"7f6efaf3-068f-459f-a2cb-d054dc0b806e","source":"Linear","target":"1586669e-e65a-40c3-b087-3e8ff6c5199c","type":"HAS_INVARIANT"},{"id":"6e3b3506-0c33-4a40-8b21-e934337f19b5","source":"Tree","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"51c9ca98-2d6a-4154-bed4-47d160977dae","source":"Tree","target":"Topology","type":"REFERENCES"},{"id":"954bad25-3f63-4f50-aef6-b7718cd98cf3","source":"Tree","target":"12a7a292-6cbb-430a-9834-02bfc85acb29","type":"HAS_INVARIANT"},{"id":"518b70f6-6ffe-4ddc-a78e-497a9f7bbd91","source":"Tree","target":"39039846-a5d3-4178-ac55-66ec5bbc3b87","type":"HAS_INVARIANT"},{"id":"17da72fc-d90e-49f2-a2fd-3468baa84327","source":"Correlation","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"f048b2fc-21a6-48c5-a1c2-67e6ffaf704a","source":"Correlation","target":"Variable","type":"REFERENCES"},{"id":"b463a51f-5884-4126-b80c-f9afe89e1812","source":"Critique","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"774b7c14-3b92-4b6b-9414-dbeee35d1d5d","source":"Critique","target":"Assessment","type":"YIELDS"},{"id":"5c25bbab-3f3b-4d0a-acc7-1b29e179cfc2","source":"Critique","target":"Datum","type":"ACCEPTS"},{"id":"b8ff36f7-9fd9-4cb8-9351-867c8d4d4981","source":"Critique","target":"Criteria","type":"REFERENCES"},{"id":"6e5e58e3-c6c0-457e-a120-29b5498da4bf","source":"Critique","target":"588f89f8-d71f-40e3-863b-a94dd0188689","type":"HAS_INVARIANT"},{"id":"6ef62fe1-7fad-44e9-8749-902b43951af9","source":"Critique","target":"55df83ed-3298-4365-9919-f3ed1eb1eac8","type":"HAS_INVARIANT"},{"id":"ac60c877-54ab-4cda-baaf-851b0dad72fa","source":"Check","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"fa0e03ae-d53a-4f98-b5ea-3cadbb0d8315","source":"Check","target":"Gate","type":"REFERENCES"},{"id":"b02b182b-829b-439a-a638-6e3120f408aa","source":"Check","target":"Condition","type":"REFERENCES"},{"id":"292bf8eb-3068-484f-a427-7efdce2def1e","source":"Check","target":"88302e40-2bdf-4bc8-ae05-4efd78164c2f","type":"HAS_INVARIANT"},{"id":"97948a6e-4e57-4bcf-8317-991ee346f22f","source":"Check","target":"4e8be21c-e0a3-42f4-9832-c0c038b46fd4","type":"HAS_INVARIANT"},{"id":"22827bfd-02a4-45b9-869a-9222b11d931c","source":"SurvivorCorrect","target":"90800e2d-25ad-47b4-9463-179cdb2d083f","type":"IN_CATEGORY"},{"id":"20ec540e-efc7-48da-a405-20d0bacd9993","source":"SurvivorCorrect","target":"CognitiveBias","type":"REFERENCES"},{"id":"801bc6e8-940c-401d-85f1-d11ceb59e05e","source":"SurvivorCorrect","target":"BaseRateInclude","type":"REFERENCES"},{"id":"6fd33816-3cb5-48e7-a894-5d0087595b73","source":"SurvivorCorrect","target":"e7360568-76b6-49c3-a96c-541b149f01d3","type":"HAS_INVARIANT"},{"id":"35e9c202-1b56-42ed-8ef9-24c7cd61bda9","source":"SurvivorCorrect","target":"0d51d3bf-a242-4ac0-96b4-c71344b3acfc","type":"HAS_INVARIANT"},{"id":"a4dce60b-15e5-43a4-9353-de92af6c4488","source":"SurvivorCorrect","target":"059ec498-f4ab-40ea-ba4c-c8720fdf4c16","type":"HAS_PRECONDITION"},{"id":"a891c5cc-db6f-4e9e-b758-0824541bd705","source":"SurvivorCorrect","target":"758d1ae4-93f2-433d-8aaf-76f35eef7972","type":"HAS_POSTCONDITION"},{"id":"827f4c27-5d07-4c9b-aa80-c647d83124f9","source":"Identity","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"1652aeae-4e21-4017-868f-e9a1f1992236","source":"Identity","target":"Nature","type":"REFERENCES"},{"id":"77f547ae-1f4f-4693-8eb7-58fb1e41a8c9","source":"Quorum","target":"8f497759-ce27-442f-9c55-27f3c2ad7c49","type":"IN_CATEGORY"},{"id":"eb7f4165-2b1e-42cc-962c-4795ddf3df31","source":"Quorum","target":"Ballot","type":"ACCEPTS"},{"id":"60baa212-879b-4eba-9c37-d8c1624f532e","source":"Quorum","target":"25a4d3da-fcdf-49d8-bcdf-dd3cafc50b79","type":"HAS_INVARIANT"},{"id":"848c34a5-aebc-40e7-85ea-f62de1638a9c","source":"Quorum","target":"24f382bb-0d31-4fc9-8e4a-ba510d03f093","type":"HAS_PRECONDITION"},{"id":"a7a8d18b-9904-4110-9dd8-66c2d0cbfb11","source":"Quorum","target":"37768409-0dc4-4472-8161-d0f875ec68c6","type":"HAS_POSTCONDITION"},{"id":"bb75c513-12a2-4dd4-a36a-9e72f6e578cf","source":"Quorum","target":"713ca4b4-c898-4fd2-88ee-207c3665c6d8","type":"HAS_POSTCONDITION"},{"id":"60410d1e-8737-4a0f-8e3f-b1391f7b7155","source":"TradeOff","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"ad8f4ba9-0c65-4c6d-bc02-ae0d3a5e4124","source":"TradeOff","target":"Decision","type":"REFERENCES"},{"id":"49d7ed21-3e70-4b17-9f4e-8da08da04ec3","source":"TradeOff","target":"e0be90f9-1722-407a-9af1-76ea5c8b9722","type":"HAS_INVARIANT"},{"id":"ba6b8df2-f5ef-4de6-b821-217a8591b4be","source":"TradeOff","target":"613cd028-6952-4c44-a779-b3841325f2a3","type":"HAS_INVARIANT"},{"id":"d63270ec-b820-4d70-a8d6-9504df0590ec","source":"Entropy","target":"8f497759-ce27-442f-9c55-27f3c2ad7c49","type":"IN_CATEGORY"},{"id":"8d2f0c73-13e8-41a5-9335-13bef4ba329f","source":"Entropy","target":"System","type":"REFERENCES"},{"id":"09c70e39-d4f8-4673-ac6e-0067a7b456ac","source":"Entropy","target":"Message","type":"REFERENCES"},{"id":"214a7aa2-4316-41fd-9ec6-e01ff7bfca57","source":"Stream","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"33b60da3-5a51-413d-bad6-48acb0572bcd","source":"Stream","target":"Message","type":"REFERENCES"},{"id":"476d6fbd-55cb-4e77-af68-df4be90c6617","source":"Stream","target":"da71c3a7-7cf3-4b3d-92b6-5600325c6ecd","type":"HAS_INVARIANT"},{"id":"82f35adf-ab22-4a00-969e-49fd163593ce","source":"Stream","target":"31c8b95f-b95e-4bd8-b5b1-53e5618f999f","type":"HAS_INVARIANT"},{"id":"60970f6a-9908-42e6-8d79-f2037c3f3ef9","source":"Stream","target":"d198f3c7-d452-4466-99ab-e9890a0fae35","type":"HAS_PRECONDITION"},{"id":"44f5c7a4-1e7b-4abc-836e-9b4ca523c63b","source":"OntologyHandshake","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"d79e9384-651c-4fa7-babc-c864bddf2f4b","source":"OntologyHandshake","target":"SpectralTune","type":"REFERENCES"},{"id":"0f06feba-36b6-46a7-8578-462a59f5af03","source":"OntologyHandshake","target":"CompatibilityCheck","type":"COMPOSES_WITH"},{"id":"baad0be5-ae5e-420b-a468-6bc45cba7045","source":"OntologyHandshake","target":"Protocol","type":"REFERENCES"},{"id":"3bb9a0cc-1ac5-43e6-b72a-4ee8719460a5","source":"OntologyHandshake","target":"722fb9df-f6bc-494c-8702-bc8cbc523c92","type":"HAS_INVARIANT"},{"id":"81be6b53-1f06-4794-8cbe-11a40cca3e2f","source":"OntologyHandshake","target":"882a0348-8644-4726-bcd9-ce9637ba7764","type":"HAS_PRECONDITION"},{"id":"13cb4c0b-b8d6-42b8-8b09-b2adf58ec95b","source":"OntologyHandshake","target":"2bfce421-938f-415e-8a0e-78afa1e92869","type":"HAS_POSTCONDITION"},{"id":"96c53019-0a49-40b3-a41a-737a7a4987fa","source":"Audit","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"5aede639-26ba-469a-96da-eb33a1d78496","source":"Audit","target":"System","type":"REFERENCES"},{"id":"fc89a054-3f52-4de8-a71e-276e26a628cc","source":"Audit","target":"State","type":"REFERENCES"},{"id":"07119200-fc1c-4d6e-9f23-3c9d4ceea59a","source":"Audit","target":"db6de1b0-1b2c-40ee-baf0-92036e12c7de","type":"HAS_INVARIANT"},{"id":"e1f7b919-058d-4f14-b93d-b6f84607f889","source":"Audit","target":"5b50dc03-8877-4932-99dd-99050c48d9ea","type":"HAS_INVARIANT"},{"id":"f0f982d1-ebbd-477f-bd1d-f0d32f16f0b4","source":"Audit","target":"78d069c5-6250-4ee2-a3dc-dd855bea4a58","type":"HAS_PRECONDITION"},{"id":"ee129d77-aeec-4825-83a0-5ef0560604d5","source":"Audit","target":"ba482105-cfec-47b8-b5b8-75ca7dba782a","type":"HAS_POSTCONDITION"},{"id":"06d8c1f9-1b1a-41a4-a474-312b643a7a5a","source":"Audit","target":"62d109b9-058c-4811-a86d-baab0513af29","type":"HAS_POSTCONDITION"},{"id":"2f31c49d-0a5e-4ffd-b1dd-a953c118ea97","source":"CircuitBreaker","target":"8f497759-ce27-442f-9c55-27f3c2ad7c49","type":"IN_CATEGORY"},{"id":"0a135773-2b53-4493-8096-0d5b0ee981fc","source":"CircuitBreaker","target":"Backoff","type":"REFERENCES"},{"id":"56eb7ba7-9051-4d14-b763-c4a001897295","source":"CircuitBreaker","target":"State","type":"REFERENCES"},{"id":"082134db-ebe5-4d0f-8a2c-4321bf6f5deb","source":"CircuitBreaker","target":"8184a894-2d6a-4421-94a7-993a685ba656","type":"HAS_INVARIANT"},{"id":"6ae7949b-ec04-471e-a8b7-ccb1084323d1","source":"CircuitBreaker","target":"0bff3ca6-5e2b-493a-a5a6-93b15723bd22","type":"HAS_INVARIANT"},{"id":"53411e27-f688-490e-a83f-5e1594572e7d","source":"CircuitBreaker","target":"3e6984ad-d0a2-420b-8983-74d4484db6dd","type":"HAS_INVARIANT"},{"id":"2b38909c-1eb8-4c1a-b09a-5e6809d93027","source":"CircuitBreaker","target":"bda37a03-b63f-4706-8f6d-8d3e82db9369","type":"HAS_PRECONDITION"},{"id":"5966f86e-dcf0-4417-879b-8503f3bb0f4f","source":"CircuitBreaker","target":"f0dc8208-338a-4dde-9444-d88919307665","type":"HAS_PRECONDITION"},{"id":"2ca6d806-09c5-4022-ac3b-8447c98d7084","source":"CircuitBreaker","target":"6c6fe208-95d7-447d-850c-674fff66a0ba","type":"HAS_POSTCONDITION"},{"id":"98420b22-2d63-43e4-b4ca-fbe2f60d7dcd","source":"CircuitBreaker","target":"64c65a48-fa37-4118-a304-bae6528c06d3","type":"HAS_POSTCONDITION"},{"id":"3a316277-7afd-4374-867c-24d18b69464c","source":"Incongruity","target":"8f497759-ce27-442f-9c55-27f3c2ad7c49","type":"IN_CATEGORY"},{"id":"606d675f-c8ec-4cba-8139-55c7b0334ae1","source":"Incongruity","target":"Signal","type":"REFERENCES"},{"id":"f066289a-d8c7-4f6d-9b1f-571199632073","source":"Incongruity","target":"State","type":"REFERENCES"},{"id":"f0088aae-db1d-46d6-9ebb-b1e2c5a39e7d","source":"Metric","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"979374c8-a111-49eb-8d18-efb428e5b2d1","source":"Metric","target":"System","type":"REFERENCES"},{"id":"bc143452-2d08-4e72-b879-c01507628a81","source":"Metric","target":"State","type":"REFERENCES"},{"id":"438a9845-8c7e-476c-9d1f-da81b20d5aae","source":"ParetoFront","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"f3d8d2d7-e81c-46da-b7d6-4b27a74c2889","source":"ParetoFront","target":"Rank","type":"REFERENCES"},{"id":"2ec84357-44e2-454c-a96d-d2257490ddc5","source":"ParetoFront","target":"State","type":"REFERENCES"},{"id":"340265e8-467f-40c9-a474-06f563f6cdbe","source":"ParetoFront","target":"3f9497f0-8fca-48f9-8aa8-39c473c5888d","type":"HAS_INVARIANT"},{"id":"45ce15ee-6032-4c85-8bd0-12ae09b6fe90","source":"ParetoFront","target":"7feb7d96-21f0-41ae-afa5-dd0f3b6c6ae5","type":"HAS_INVARIANT"},{"id":"9fe7fc92-e8b8-45a1-b4e8-c3bae8a177fb","source":"ParetoFront","target":"bc5a527e-677b-4ed0-99b8-312f54864946","type":"HAS_PRECONDITION"},{"id":"ed9011f6-fe67-4cf0-94da-75d87ba608a4","source":"ParetoFront","target":"e449fc75-81f2-45b4-9894-a28f9bfcf0b0","type":"HAS_PRECONDITION"},{"id":"2c92f0a9-1843-43b2-878d-40a0a08dd1ce","source":"ParetoFront","target":"ad628f9b-8ae7-4b6f-9a57-f9e7c6d6df8a","type":"HAS_POSTCONDITION"},{"id":"ccc70539-de38-4d12-8512-b6ec4c11ae88","source":"Robustness","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"49e9a6a9-77bd-4773-95f0-b99a1d0b6628","source":"Robustness","target":"System","type":"REFERENCES"},{"id":"b4cf96c0-6ae9-453a-820b-0c2fce2fadf1","source":"Robustness","target":"State","type":"REFERENCES"},{"id":"39ff94de-ebe8-4b02-8758-bb75b25d3397","source":"Robustness","target":"a1f25fd2-9cd8-40a6-8839-d254c48ecdd4","type":"HAS_INVARIANT"},{"id":"9435b3f9-0d64-41d2-a847-de4e0a10653a","source":"Shard","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"d76b9fe6-505a-4f5e-8127-68a1a2485cc6","source":"Shard","target":"Vector","type":"REFERENCES"},{"id":"f8f927b0-23a8-4722-9ceb-6e5d01b403ec","source":"Shard","target":"State","type":"REFERENCES"},{"id":"c204ac79-7e78-4032-9b34-5336767643e9","source":"Shard","target":"03abf5ea-1544-459b-b41f-9f9364adc98c","type":"HAS_INVARIANT"},{"id":"606762a5-9b19-4bb9-8fa5-b060a7c6fee8","source":"Shard","target":"cfe06fb9-b910-40aa-8c00-17ef90977cd9","type":"HAS_INVARIANT"},{"id":"75c7b3df-435a-4170-a8c1-8d242ef66819","source":"Shard","target":"f1a7af79-1d99-4087-acbe-5afaa4cf4789","type":"HAS_INVARIANT"},{"id":"61d6ea0d-2e66-4b2e-8354-45fdf8dfd34b","source":"Snapshot","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"e469241f-f091-4a2c-9b6d-78cf45c680b2","source":"Snapshot","target":"System","type":"REFERENCES"},{"id":"916df413-04a4-443d-accc-c8deb79e6c6a","source":"Snapshot","target":"State","type":"REFERENCES"},{"id":"999a3dbb-def3-4e4e-be09-b3ac9af270a7","source":"Transition","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"c2037695-9f1c-4873-8491-ff3f91a7c2a1","source":"Transition","target":"System","type":"REFERENCES"},{"id":"26f53092-9b62-429c-82e5-4a14228e08f5","source":"Transition","target":"State","type":"REFERENCES"},{"id":"96754e34-4ecc-41fc-a7c5-fd8d17a54450","source":"Value","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"f03e3579-2058-41d5-bd3a-bc8e16867d2a","source":"Value","target":"State","type":"REFERENCES"},{"id":"e3473b11-db7a-4c8d-806e-38b2e6c4fd24","source":"WorldReversible","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"7a4f8a41-de36-49b8-a8ec-d562f030e551","source":"WorldReversible","target":"State","type":"REFERENCES"},{"id":"8bb1736e-15dd-4da8-892b-465a5949aae1","source":"WorldReversible","target":"495c9edb-c3b2-49ba-95ae-cbb1f24e2417","type":"HAS_INVARIANT"},{"id":"886ba5ed-1858-4822-a24e-6f96a5115b64","source":"WorldReversible","target":"d70a55ef-e916-49b0-93bc-25cce11067d1","type":"HAS_INVARIANT"},{"id":"96d63aea-5136-4ead-b7b2-180221f3fe13","source":"WorldReversible","target":"cb227f50-eea3-441a-9e19-c7896e16041a","type":"HAS_PRECONDITION"},{"id":"a4fc992d-4437-4475-9e2d-bb640292ad49","source":"WorldReversible","target":"0dc58c77-e375-47a9-b69d-d1225a850f6c","type":"HAS_POSTCONDITION"},{"id":"64389934-1487-4f05-a6d3-f68513918e34","source":"Chain","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"c86a5784-f8b6-41db-b034-6e71e3db5f09","source":"Chain","target":"Linear","type":"REFERENCES"},{"id":"875bc0a9-2735-4cc4-969a-4aae97a806fd","source":"Chain","target":"4ca77942-460c-4114-a9ec-4f524b6fb4c0","type":"HAS_INVARIANT"},{"id":"8ea493c4-d179-4213-921e-dfd9a8ff544f","source":"Chain","target":"82ce3f15-0f17-4b85-ae45-14cd273b12d4","type":"HAS_INVARIANT"},{"id":"28dab3b6-c22b-4b79-92d5-227f6e2f86f7","source":"Causation","target":"8f497759-ce27-442f-9c55-27f3c2ad7c49","type":"IN_CATEGORY"},{"id":"874fb13d-a76e-4778-82b4-ef84b0e1cd21","source":"Causation","target":"Correlation","type":"REFERENCES"},{"id":"88e9cae1-f3b3-4646-b05f-1e505112c10a","source":"Synthesis","target":"e38ff6e0-872e-4a63-a7ea-ebb84e174347","type":"IN_CATEGORY"},{"id":"d214e0fc-9f01-44cd-9eb1-8eec30b86d3a","source":"Synthesis","target":"Critique","type":"REFERENCES"},{"id":"7b6c0cdf-9164-40bf-a0c3-2f48ff44591b","source":"Search","target":"8f497759-ce27-442f-9c55-27f3c2ad7c49","type":"IN_CATEGORY"},{"id":"53d8dc66-1daa-447e-a102-75f02312e61e","source":"Search","target":"Check","type":"REFERENCES"},{"id":"0b0fde45-8d67-4ff0-9c56-002fa7aa044c","source":"Search","target":"Criteria","type":"REFERENCES"},{"id":"074bcab3-24b8-4b8d-b593-d35dbb0401f6","source":"Search","target":"720bf58a-72e0-4ddb-85eb-9bd6814cf4b8","type":"HAS_INVARIANT"},{"id":"e4628420-34c9-4e69-8850-121709338996","source":"Search","target":"445e14bc-80d4-442d-85be-1cd0421dd71b","type":"HAS_INVARIANT"},{"id":"9c97e12f-2e6a-4817-8d6c-7b218b3ceb88","source":"ShoutWhisper","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"1fecc437-2c5a-4229-884b-b882038a4947","source":"ShoutWhisper","target":"Check","type":"REFERENCES"},{"id":"bd86a0ce-13a9-4f1a-8b21-753cb33a2215","source":"ShoutWhisper","target":"Global","type":"REFERENCES"},{"id":"afccda10-fe7e-4a30-8569-39670b15ad40","source":"ShoutWhisper","target":"8ec728b1-73bf-468e-91e8-ed7e49ae1b7d","type":"HAS_INVARIANT"},{"id":"b96e0a61-1f66-4e9b-a016-895c4ead2729","source":"ShoutWhisper","target":"acf84a27-f454-4ad8-ac70-fee72bb998f6","type":"HAS_INVARIANT"},{"id":"42dcdff4-37a1-421c-8aad-3a793ab210e7","source":"ShoutWhisper","target":"e011d33c-c640-4bce-ac91-1c7aa392c42d","type":"HAS_PRECONDITION"},{"id":"ef426f52-b3f4-4cff-9794-c238f019640a","source":"ShoutWhisper","target":"3b9bc24f-202b-4858-a5a2-72b0df4ecb87","type":"HAS_POSTCONDITION"},{"id":"f5a7f05a-1d4a-4c45-9c5f-e90be207986f","source":"BearerToken","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"08de460d-0447-408e-bc31-3e01a418e02a","source":"BearerToken","target":"Identity","type":"REFERENCES"},{"id":"7c9797ae-125d-4887-a8ca-e5182f1ac371","source":"BearerToken","target":"1452244d-f943-4dd7-b57c-12a5899393b3","type":"HAS_INVARIANT"},{"id":"b46ea6d5-ee0e-4a88-ba89-ae0dfa0cda7f","source":"BearerToken","target":"3a9851b3-c9b4-4382-add4-200423371646","type":"HAS_INVARIANT"},{"id":"a99efc60-5127-439d-9236-e2672783ba25","source":"BearerToken","target":"025c2620-43d0-40ee-9e77-6d0b83134729","type":"HAS_INVARIANT"},{"id":"0ad70425-ed1b-4487-aa5e-5606c36610ce","source":"BearerToken","target":"1587287b-d8d1-4634-864d-e27195f763a9","type":"HAS_INVARIANT"},{"id":"29a04d90-3f37-4328-9ab1-7bc11ad19690","source":"BearerToken","target":"133dd84a-d0c4-4e3a-bedc-c6a1e834633c","type":"HAS_PRECONDITION"},{"id":"92e44e1e-b264-464e-a7fb-f1c49b488e76","source":"BearerToken","target":"61901b36-d94e-41a1-945e-07033ccded9b","type":"HAS_PRECONDITION"},{"id":"cb6b65f0-7a7b-4fb3-b2ed-90f916c6b6b9","source":"BearerToken","target":"70fbe364-d8f4-4ef8-957c-61b1dcabdba3","type":"HAS_POSTCONDITION"},{"id":"3000bc35-264d-4565-b037-f364587f5e4b","source":"Combine","target":"8f497759-ce27-442f-9c55-27f3c2ad7c49","type":"IN_CATEGORY"},{"id":"e336e841-084e-4523-ba81-c9d0e34207ff","source":"Combine","target":"Identity","type":"REFERENCES"},{"id":"01f90eab-ca41-4f38-bf22-2c8613d905cf","source":"Combine","target":"30c4aa20-4785-4934-92a5-577ac29ad07c","type":"HAS_INVARIANT"},{"id":"5cf4ccf3-a964-4084-9e6f-03c1be1322a4","source":"Combine","target":"63b43ce6-3ad7-4432-9084-0542487e4361","type":"HAS_INVARIANT"},{"id":"9fb68d16-9e48-4bf1-a40f-9f2f6cd3bf5d","source":"Context","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"532f4f33-e89e-4838-8d66-09d40588c7e1","source":"Context","target":"Constraint","type":"REFERENCES"},{"id":"38a478a8-ed72-4f7e-905d-c49a9ef6bcf7","source":"Context","target":"Identity","type":"REFERENCES"},{"id":"5df3695d-054a-4e51-9da1-d78305c5b917","source":"Context","target":"a13bca3e-5e8b-4aab-80f0-b42cc6f1a535","type":"HAS_INVARIANT"},{"id":"aded9956-6a5e-416f-bfe9-047dcaeae482","source":"Context","target":"4a3f3a0e-80f2-4119-b594-9b612c673fbe","type":"HAS_INVARIANT"},{"id":"9150a25f-adbb-4ce4-b3bf-22bbe608df50","source":"Context","target":"2160d0a9-fb00-498d-a944-439bf53070b4","type":"HAS_INVARIANT"},{"id":"9a9c4b67-5c3b-46bd-b122-a2a24c8070fa","source":"Context","target":"46e5e121-0bd3-4344-9d7f-f37949784b0f","type":"HAS_PRECONDITION"},{"id":"71c08d1e-eb5a-4a52-809f-749878165397","source":"Context","target":"fde000fd-8503-4c14-a646-40a7aee19483","type":"HAS_PRECONDITION"},{"id":"a8ea7f24-ff8b-4980-ad28-27960e52de42","source":"Context","target":"897f8960-fa20-458f-a17d-51b8328faf1d","type":"HAS_POSTCONDITION"},{"id":"492050e3-0f90-49e3-9209-57f482bdd15b","source":"LatentAttachment","target":"6fe7b13d-4ed3-4c51-ae9a-7943dd282dbf","type":"IN_CATEGORY"},{"id":"eadafdfc-8906-4472-a077-2c1b6c29c40a","source":"LatentAttachment","target":"ConceptAnchor","type":"REFERENCES"},{"id":"a24ae190-6398-4981-ad06-c83fdfba867d","source":"LatentAttachment","target":"Identity","type":"REFERENCES"},{"id":"00d9663e-0292-4e37-a082-dd810818e8b0","source":"LatentAttachment","target":"0c160b97-0fa6-4ab7-87c6-121c352fbc31","type":"HAS_INVARIANT"},{"id":"9e9f0685-432d-45ae-9ff0-5dd795920c10","source":"LatentAttachment","target":"4a3cc6ca-4663-4076-9d94-49809f8ed3ed","type":"HAS_INVARIANT"},{"id":"c73209b8-c5da-47a6-9e90-de84ff1769bf","source":"LatentAttachment","target":"aba2a238-c7b4-449d-8620-29d7b7fdbd3c","type":"HAS_PRECONDITION"},{"id":"e1a7a29c-08cf-4925-bd46-4bfb6e7f494c","source":"LatentAttachment","target":"57715ec3-7ba9-4a33-a151-e2baa2544ba4","type":"HAS_POSTCONDITION"},{"id":"1a2ce5d7-cda0-41b1-a324-3386e5312473","source":"Resource","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"34e99502-d774-4186-b483-8ca3fd75a6e8","source":"Resource","target":"Budget","type":"REFERENCES"},{"id":"bc52f58a-ac65-4aaf-8afd-943ab143ca6d","source":"Resource","target":"Identity","type":"REFERENCES"},{"id":"9707429c-d0f6-4965-8704-95a68bc9f80e","source":"Resource","target":"474718dc-4914-4de1-b41e-ffbed1ee09cb","type":"HAS_INVARIANT"},{"id":"67ee8dfb-c209-41ae-8b79-f1198c705c71","source":"Resource","target":"8301a7be-adb1-477f-9931-55796ddd6d9c","type":"HAS_INVARIANT"},{"id":"e002c6ae-25a8-4fd8-a999-fefdecbfbc66","source":"Event","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"c7a0c67c-7f74-48c8-ba90-b07e0437deec","source":"Event","target":"Stream","type":"REFERENCES"},{"id":"761973f6-8137-421b-b091-49ae62a95cb8","source":"Event","target":"State","type":"REFERENCES"},{"id":"ae258e78-26e9-4759-8e1d-8a01b7f69a58","source":"InvariantFilter","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"41ddf4be-6110-46b9-8ee3-d1fbbefdc085","source":"InvariantFilter","target":"Message","type":"ACCEPTS"},{"id":"cfe34ab8-4035-416a-b8a6-a3a9d14303b0","source":"InvariantFilter","target":"Stream","type":"REFERENCES"},{"id":"6924e2a0-0fe0-4360-8347-bc1f0a3f8ccd","source":"InvariantFilter","target":"Check","type":"REFERENCES"},{"id":"bc2c11db-1925-42db-b1de-89c7fb4da991","source":"InvariantFilter","target":"987bc1f1-7c21-49d1-ba78-60708aa11666","type":"HAS_INVARIANT"},{"id":"75148c6e-a5cb-4adb-83cf-6c3bee7a5299","source":"InvariantFilter","target":"f16289c3-c7a5-4081-9118-ae82966d9d12","type":"HAS_INVARIANT"},{"id":"4dae011a-0e5a-45d5-8597-88748e77b604","source":"InvariantFilter","target":"d27bafa3-24e8-469d-8974-5a4390c312e5","type":"HAS_INVARIANT"},{"id":"c7597dbe-7254-4be3-91b4-57eb91533f96","source":"InvariantFilter","target":"1d74ed64-98cf-4979-9555-e6d3beb0e994","type":"HAS_PRECONDITION"},{"id":"cf1ddcd7-60ab-481e-895e-85faa60e4e98","source":"InvariantFilter","target":"3f5ee4b5-4153-4638-a6e0-38cd14276ca5","type":"HAS_PRECONDITION"},{"id":"0bdc09ea-07f3-4154-98d4-bf1b2a147494","source":"InvariantFilter","target":"16eb7ab9-cbd0-4a1a-b9d9-9011e8de1750","type":"HAS_POSTCONDITION"},{"id":"fc1843e4-fd6a-4e2f-9019-b79f46900d40","source":"InvariantFilter","target":"a7361613-8adf-4161-8815-e7deef3bcdfe","type":"HAS_POSTCONDITION"},{"id":"d4bc8246-5747-4007-87cb-7602ae4b6bc0","source":"StateTransition","target":"8f497759-ce27-442f-9c55-27f3c2ad7c49","type":"IN_CATEGORY"},{"id":"741668e4-cd58-410f-8fb3-7219a739af80","source":"StateTransition","target":"Transition","type":"REFERENCES"},{"id":"eee15c85-47c4-45f5-929c-bd9629f78bb3","source":"StateTransition","target":"State","type":"REFERENCES"},{"id":"2dcc05e9-f340-45cd-86a6-48ad9dbe2d6e","source":"Decay","target":"8f497759-ce27-442f-9c55-27f3c2ad7c49","type":"IN_CATEGORY"},{"id":"1a3903f1-dc64-45b4-9436-087c4f11e58b","source":"Decay","target":"State","type":"REFERENCES"},{"id":"00e9c010-fc83-4609-9eec-acc3ea46063f","source":"Decay","target":"Value","type":"REFERENCES"},{"id":"8ec215ef-bc0b-4e01-b7a9-5eec91a7b371","source":"Decay","target":"StateTransition","type":"RELATED_TO"},{"id":"4559f54a-2d83-4104-852a-d64b4e0e5752","source":"Decay","target":"bc4114a3-b655-4c58-a5e2-5603a66fe9e3","type":"HAS_INVARIANT"},{"id":"8ae4cb97-821f-4d98-bdc2-1366d75a7eb7","source":"a3dffe73-5c16-41fe-be7c-5f1b04ac73f2","target":"edbe6b2e-5cba-4798-b009-b8f6a0d86323","type":"IN_LAYER"},{"id":"450d36a6-a8a1-4ab6-be1a-35f4afd66912","source":"ExchangeRate","target":"a3dffe73-5c16-41fe-be7c-5f1b04ac73f2","type":"IN_CATEGORY"},{"id":"85667219-f9ef-4de1-b1cb-b6425996f60d","source":"ExchangeRate","target":"Metric","type":"REFERENCES"},{"id":"99607a02-efa1-4838-8352-2951e057b084","source":"ExchangeRate","target":"Value","type":"REFERENCES"},{"id":"05530aa5-4322-4928-b848-f69294140347","source":"ExchangeRate","target":"22906ddb-8a50-4771-9f06-8c0a0ccc49ec","type":"HAS_INVARIANT"},{"id":"b8f6e9bd-e294-4a9a-bfb0-1753a029aba5","source":"ExchangeRate","target":"9b05b93c-a38b-4e88-8bd3-3ec7a602591b","type":"HAS_INVARIANT"},{"id":"002bde08-8de4-46f9-9655-6e8720ddf2fa","source":"OpportunityCost","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"8fbe164b-0abe-4dc0-a5d4-88bd29bca244","source":"OpportunityCost","target":"Budget","type":"REFERENCES"},{"id":"1bfa7fb2-2c4f-42dc-953e-aeac56eb02e9","source":"OpportunityCost","target":"Value","type":"REFERENCES"},{"id":"89fdc538-b493-41b2-bcd7-03401b5d5285","source":"OpportunityCost","target":"b054387e-f435-4a41-ac6f-b0d17fc87fe5","type":"HAS_INVARIANT"},{"id":"029587ef-6fae-4554-830b-5b5475f96769","source":"OpportunityCost","target":"61101517-5da0-4f09-b3a1-4f1eba74ff81","type":"HAS_INVARIANT"},{"id":"d93612c8-73cc-4c60-a8bd-8d70d6d8273a","source":"OpportunityCost","target":"4b4d87ed-5203-47a1-a1f0-cfc2a627d401","type":"HAS_PRECONDITION"},{"id":"eb8da4b9-4dc7-4ea1-afc5-8c14360ad2cd","source":"OpportunityCost","target":"6b703ff9-d67f-420e-bf0f-53faa6d2f62b","type":"HAS_PRECONDITION"},{"id":"6aadfd67-e6b9-4403-86a0-1c81a3069fef","source":"OpportunityCost","target":"46ac40e1-7034-4dad-abe4-480f949d4770","type":"HAS_POSTCONDITION"},{"id":"5df20085-85ec-45e0-97b8-036da00f1911","source":"Score","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"c0948ea1-2cd9-4185-87bf-1e3b57c82197","source":"Score","target":"Value","type":"COMPOSES_WITH"},{"id":"042cd97d-d030-4ef2-ac06-1016ec1dd514","source":"Summary","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"e11af3db-a2f1-47df-83c6-6451a83af02e","source":"Summary","target":"Artifact","type":"COMPOSES_WITH"},{"id":"9d0174f7-6c29-41e2-8fc0-893a02fd345f","source":"Summary","target":"Datum","type":"COMPOSES_WITH"},{"id":"1c7f4510-f13d-43c8-ab31-1623d000cb7e","source":"Summary","target":"Value","type":"REFERENCES"},{"id":"9f86475e-ba45-4f2e-8b2f-3337b0fe9232","source":"Discover","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"06bbb0e4-7424-4206-b031-5b3730f17dd4","source":"Discover","target":"Search","type":"REFERENCES"},{"id":"03568314-b3b2-4fe9-a263-fba00e1afd12","source":"Discover","target":"Signal","type":"REFERENCES"},{"id":"5e846acd-62b0-4d6a-ac3d-2eb19239c098","source":"Discover","target":"Check","type":"REFERENCES"},{"id":"007cad1d-1670-4fcc-b34a-a627a89e0dcf","source":"Discover","target":"Criteria","type":"REFERENCES"},{"id":"147bee5a-b9e6-409f-90af-6b891cdc91b5","source":"Act","target":"8f497759-ce27-442f-9c55-27f3c2ad7c49","type":"IN_CATEGORY"},{"id":"a7b6d806-dbe9-4d52-b17c-3e0128bf34c8","source":"Act","target":"Select","type":"REFERENCES"},{"id":"7e0711e2-df5c-4117-b79c-0fdbb52ea843","source":"Act","target":"Context","type":"REFERENCES"},{"id":"e84996f3-9b9e-4d65-ac62-0c9db13ca1fc","source":"Act","target":"63f677d2-a84f-465e-9bcd-d4ac95a24bf5","type":"HAS_INVARIANT"},{"id":"d76000c9-0fb7-4dd2-8f06-9120ba7a08b2","source":"Act","target":"c1e1bc71-23e7-4193-8a1f-602373e56d88","type":"HAS_INVARIANT"},{"id":"36e7141d-b91b-44c5-bbc8-5647c64fb196","source":"Act","target":"d5a92f29-cfc0-40e0-bbe8-9199b32db58c","type":"HAS_INVARIANT"},{"id":"ea227352-b92a-4951-a5a5-c1ce89bc2587","source":"Act","target":"1567c85f-fc94-4bc4-a61f-fc05efec3970","type":"HAS_PRECONDITION"},{"id":"5d66ecd1-f7f6-4d89-9de1-e12516a1b4d3","source":"Act","target":"19f0b162-7f3d-4b98-98f7-5ba7b0d19d3c","type":"HAS_PRECONDITION"},{"id":"716e407e-fad8-4a18-beab-bdf7085cd525","source":"Act","target":"cbd50ad2-d935-4c96-b830-ec525da19797","type":"HAS_PRECONDITION"},{"id":"582c389b-bcd2-4e93-8aef-31030e6b32e3","source":"Act","target":"d0b1ffc2-8fff-406c-847f-626d29327b73","type":"HAS_POSTCONDITION"},{"id":"2bd7626f-b30f-4127-af58-64a8ac9664c8","source":"Act","target":"40158f99-e38a-4c88-b4dd-2cac4360e05c","type":"HAS_POSTCONDITION"},{"id":"8abe4063-67f9-488c-9ff8-f323e54f3f79","source":"Act","target":"6ba0e6a9-0e95-423d-832a-ec51198c989b","type":"HAS_POSTCONDITION"},{"id":"22dfcd59-4170-4806-9bdc-89822e8c2d38","source":"ContextCompress","target":"6fe7b13d-4ed3-4c51-ae9a-7943dd282dbf","type":"IN_CATEGORY"},{"id":"78776343-ac3c-428e-b7cf-a70b90792d80","source":"ContextCompress","target":"Compress","type":"REFERENCES"},{"id":"7421616b-9236-4a77-ad16-a7d7a62dc9d6","source":"ContextCompress","target":"State","type":"REFERENCES"},{"id":"16e883c9-b1e2-414f-9abb-d4c9d9ff85bb","source":"ContextCompress","target":"Context","type":"REFERENCES"},{"id":"2e766ed9-1b4d-4805-859e-c7a0866e1ee5","source":"ContextCompress","target":"Constraint","type":"REFERENCES"},{"id":"1b7f2d9f-475d-40c7-87bf-8579ea0c10ca","source":"ExploreExploit","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"c1b5b774-f776-41c5-a179-353b723405e7","source":"ExploreExploit","target":"Budget","type":"REFERENCES"},{"id":"1ff98ee7-2467-4da0-8850-2fced7cc793c","source":"ExploreExploit","target":"Context","type":"REFERENCES"},{"id":"55a758f5-8ee2-4cdb-ac65-04e61e471b0f","source":"ExploreExploit","target":"ea1bb3a9-f4fd-4b02-8080-5c4c7a7c66d5","type":"HAS_INVARIANT"},{"id":"a3531a8c-aebd-4577-a175-e615ddb67449","source":"Observe","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"098c9c6b-9d3f-4774-8241-de808ce7fb43","source":"Observe","target":"Context","type":"YIELDS"},{"id":"2c55b2d9-aa87-4bce-8c90-4fb8af55a233","source":"Observe","target":"32e6cbde-5ba7-41a8-be54-f9856132cfc1","type":"HAS_INVARIANT"},{"id":"e11987fb-5419-440f-a46a-8a5f2f348d0d","source":"Observe","target":"807b5248-fc5a-49a0-bb48-c2a959064dd3","type":"HAS_INVARIANT"},{"id":"be41299e-8362-40c2-8c26-4cc4d45c3c17","source":"Observe","target":"2a8b4cb9-27f7-46d6-b5a3-bbc0fe24ebed","type":"HAS_PRECONDITION"},{"id":"dc258bb5-1e2c-42bd-b74f-ba5702a1b935","source":"Observe","target":"55450758-eed5-47c1-b189-cfb07e06b1ef","type":"HAS_PRECONDITION"},{"id":"f67db34f-d160-4369-8c43-273d08a88a58","source":"Observe","target":"d20efec1-a4d7-4e83-ac53-ec52705a62da","type":"HAS_POSTCONDITION"},{"id":"34378203-f3fb-4d6f-a2da-99a75be8492d","source":"Observe","target":"ba142a57-26cf-46a3-8f5c-95baa380128c","type":"HAS_POSTCONDITION"},{"id":"370f1068-2590-40c6-bf20-d97a9ae7bf38","source":"Task","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"f7822885-457b-4529-b613-7cc9888240cb","source":"Task","target":"System","type":"REFERENCES"},{"id":"577b75cc-e2eb-48d9-a7b8-ca3fa6f5fb5e","source":"Task","target":"Hierarchy","type":"REFERENCES"},{"id":"f212c993-dec3-4f4e-9901-7b1ae8380430","source":"Task","target":"Context","type":"REFERENCES"},{"id":"6d5c1933-4c5d-4d12-bb3c-b365e60e3b49","source":"Task","target":"Constraint","type":"REFERENCES"},{"id":"4d477728-b7bc-4414-a90b-d59888b9f2e8","source":"Task","target":"ba65e5a7-3375-49c6-81f6-8a67e1043237","type":"HAS_INVARIANT"},{"id":"71634a42-b611-4fcc-aeae-c3967129b41e","source":"Task","target":"8713f15e-c1de-4754-a8be-85af2231aeea","type":"HAS_INVARIANT"},{"id":"31ed9a3a-a679-4bd7-a0aa-e5405ba56fa8","source":"Task","target":"6ad07379-df2e-4f08-b514-8f712adabf75","type":"HAS_INVARIANT"},{"id":"66c5e4a5-3702-40ab-a24c-cc59f4436979","source":"Think","target":"e38ff6e0-872e-4a63-a7ea-ebb84e174347","type":"IN_CATEGORY"},{"id":"330f4ebb-ed5f-4f55-b99d-a10310a11d8d","source":"Think","target":"Datum","type":"YIELDS"},{"id":"4710c174-14dd-4de4-b50a-8aa923364452","source":"Think","target":"Context","type":"ACCEPTS"},{"id":"3f66cffd-a85c-47c1-a8ec-68cc68cb99f4","source":"Think","target":"f5eda9bf-d772-4951-8aca-e10a931850ac","type":"HAS_INVARIANT"},{"id":"1a20b973-bf29-40af-a82b-886bc37c7848","source":"Think","target":"79b63753-ff54-43b6-896f-e483586eee66","type":"HAS_INVARIANT"},{"id":"5fcb2981-ce88-4760-ae67-e59f2ba5c046","source":"Think","target":"e7ef3178-ac2f-4118-8010-75873236d01d","type":"HAS_PRECONDITION"},{"id":"823d638f-7251-4a1b-98f9-d188ef793fda","source":"Think","target":"f401969b-4116-410f-85a3-7ea298f9c461","type":"HAS_POSTCONDITION"},{"id":"8e07a59f-9cb5-4a6d-b5b3-1c2736614319","source":"VowOfSilence","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"ca8536b4-1e3c-41e8-ae89-439f801ace76","source":"VowOfSilence","target":"Context","type":"REFERENCES"},{"id":"31bcb711-2465-4a80-b7e8-aae1a1b53cf8","source":"VowOfSilence","target":"Signal","type":"REFERENCES"},{"id":"4160a2cb-660c-4eb4-83f1-4c2b9bb849af","source":"VowOfSilence","target":"Silence","type":"REFERENCES"},{"id":"428f313e-67e2-45b4-aa7c-b634560e0c87","source":"Probability","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"156917cb-82af-4b82-a883-2ad8d6515846","source":"Probability","target":"Event","type":"REFERENCES"},{"id":"d61c375e-5239-4f46-8d03-81870a13f081","source":"Probability","target":"8d997971-7967-4bec-9d02-bf473d823933","type":"HAS_INVARIANT"},{"id":"a3e6ac1f-a143-4783-bcdf-bbec5654ba72","source":"Probability","target":"a24af8b5-fe6a-4760-92c0-f8ada8a15519","type":"HAS_INVARIANT"},{"id":"4878892a-66e0-4347-a42c-5f0740c05922","source":"Probability","target":"2e5f8ea9-736f-4054-8dd2-34b133d0085c","type":"HAS_INVARIANT"},{"id":"6e278495-e7ad-4a5c-a845-457ad02a5e88","source":"LatticeCommit","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"f952cab5-82ca-4c09-b0c8-68e6db787c89","source":"LatticeCommit","target":"Topology","type":"REFERENCES"},{"id":"96d7f173-0862-41be-8fe1-eddbed7c5c37","source":"LatticeCommit","target":"Quorum","type":"REFERENCES"},{"id":"8b13cca2-27d2-4642-9dc9-42f664b6790f","source":"LatticeCommit","target":"Check","type":"REFERENCES"},{"id":"99f24ddf-b5d9-4570-a996-327ef2bf2287","source":"LatticeCommit","target":"StateTransition","type":"REFERENCES"},{"id":"0fcfedc2-5380-4da4-9170-707d8824726e","source":"LatticeCommit","target":"cb5e97ae-d81e-4c39-ac0b-c09cb34d4321","type":"HAS_INVARIANT"},{"id":"a6175e91-33ee-469e-bb3c-0a193524675d","source":"LatticeCommit","target":"16078c86-7dfe-4f69-960e-4e971924f4a8","type":"HAS_INVARIANT"},{"id":"8dae4950-0363-4a62-8387-ee653c6e445a","source":"LatticeCommit","target":"9fe72c4b-2e44-4bbe-98b9-8a45761744d5","type":"HAS_INVARIANT"},{"id":"285c781b-050e-4b67-928d-d52149c0ac28","source":"LatticeCommit","target":"c6c11049-bd82-47aa-b1dc-9400dfdc1bce","type":"HAS_PRECONDITION"},{"id":"bcee67d1-4024-4e8e-add7-c517e42f256e","source":"StateAudit","target":"e5a36812-8586-4359-8f6a-7c5631923812","type":"IN_CATEGORY"},{"id":"2a14dae2-00c7-4961-9dbe-92b0a00e6307","source":"StateAudit","target":"Audit","type":"REFERENCES"},{"id":"719c826a-ccc8-4874-bc59-4932198b6d68","source":"StateAudit","target":"State","type":"REFERENCES"},{"id":"a0af919a-09ba-43bb-8f88-8474cbbfb941","source":"StateAudit","target":"StateTransition","type":"REFERENCES"},{"id":"cf52f82d-96c7-4d09-837d-29db36a998f1","source":"EpistemicCalibrate","target":"90800e2d-25ad-47b4-9463-179cdb2d083f","type":"IN_CATEGORY"},{"id":"4d26015c-836b-40ac-8f2b-48dd59917dd9","source":"EpistemicCalibrate","target":"Decay","type":"REFERENCES"},{"id":"5052b783-8207-41c6-92e0-777d8ca77c92","source":"EpistemicCalibrate","target":"c01d324d-7bba-4069-bf35-898b66eb1857","type":"HAS_INVARIANT"},{"id":"2c4be7b7-c095-415f-af7f-080ea0342da7","source":"EpistemicCalibrate","target":"378f547c-e843-4350-b6be-5ddc475f84b0","type":"HAS_INVARIANT"},{"id":"f532761a-8264-46f1-901c-af97ddbf3665","source":"EpistemicCalibrate","target":"45261894-258b-4084-bd9f-4d7f3994be11","type":"HAS_PRECONDITION"},{"id":"bc37572b-1c2c-4c2f-87bd-c0371a360605","source":"EpistemicCalibrate","target":"832426d4-1bd2-4575-8ed8-9ab55f9bcdee","type":"HAS_POSTCONDITION"},{"id":"f16d08cf-0a2a-44af-aa2f-03db9ee71cc1","source":"ExpiringToken","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"42946c23-9e91-4d74-8113-5a78ff3ca2f8","source":"ExpiringToken","target":"BearerToken","type":"REFERENCES"},{"id":"62df39ea-d2f4-4a02-88f1-e3ab91a39a05","source":"ExpiringToken","target":"Decay","type":"REFERENCES"},{"id":"bcc24e0e-5059-486d-80fe-f020fb27b097","source":"ExpiringToken","target":"394a8441-31b2-4b46-a97c-d5ea13e9f302","type":"HAS_INVARIANT"},{"id":"1f100aa2-4415-4ebc-9a81-5cbeb150ac72","source":"ExpiringToken","target":"95462a1e-c082-4248-9b90-a664b4650fdd","type":"HAS_INVARIANT"},{"id":"4326d7ff-ff18-4af6-9b55-bd71836a4584","source":"ExpiringToken","target":"2bd66f5b-cfa6-4f21-8685-56474972465e","type":"HAS_INVARIANT"},{"id":"46dc18fc-a337-4bb4-b21c-76de4821b3c7","source":"GlacialVault","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"d793cb84-ac58-4ca7-82a7-04ba4e0b684d","source":"GlacialVault","target":"Decay","type":"REFERENCES"},{"id":"9b18da6e-949a-48f6-8ced-ce9ee6a063d0","source":"GlacialVault","target":"204bc3d8-ca1a-4c9d-b545-7119fc96074f","type":"HAS_INVARIANT"},{"id":"5e16280d-e961-4990-b22a-7e880732d080","source":"Trace","target":"8f497759-ce27-442f-9c55-27f3c2ad7c49","type":"IN_CATEGORY"},{"id":"ae7d618e-9e44-4029-9f95-4836a55e3583","source":"Trace","target":"Decay","type":"REFERENCES"},{"id":"e901c6ef-abfa-4b01-a0d3-47211d95d286","source":"Trace","target":"bc8404bd-8389-46f3-b3b1-1276aa9b8e13","type":"HAS_INVARIANT"},{"id":"a698f6f4-4e50-434e-8811-ad63124525d1","source":"Trace","target":"4e187aff-c78c-4921-aa99-5b76ebf13068","type":"HAS_INVARIANT"},{"id":"82483575-1300-42e9-b4ca-84245749b7c7","source":"RegretMinimization","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"02ea9e1e-bfd1-433a-ba44-8cd4b8458a23","source":"RegretMinimization","target":"OpportunityCost","type":"REFERENCES"},{"id":"875b64a8-5b7d-4039-be10-b5f8c60fd547","source":"RegretMinimization","target":"Decision","type":"REFERENCES"},{"id":"8d28d52c-73fc-496d-b0ea-f4f8fd9646e6","source":"RegretMinimization","target":"a6ccd0a0-ced3-4b75-92fc-ce0001495b62","type":"HAS_INVARIANT"},{"id":"98c7afa7-0239-411f-86cf-854937cc17b7","source":"RegretMinimization","target":"c69aad07-1a8d-4004-9fa3-f760ac44f8a0","type":"HAS_INVARIANT"},{"id":"979af3e8-e7a7-4340-856c-7730c328ed89","source":"Actor","target":"8f497759-ce27-442f-9c55-27f3c2ad7c49","type":"IN_CATEGORY"},{"id":"f73c08ed-5eb0-4f51-8944-a96ad5f6734e","source":"Actor","target":"Act","type":"COMPOSES_WITH"},{"id":"0bc223ee-75ff-4d43-ba11-c0682d7d6873","source":"Actor","target":"Nature","type":"REFERENCES"},{"id":"65fa47f4-1540-437a-87e6-9ea96fd0a773","source":"Actor","target":"Identity","type":"REFERENCES"},{"id":"ca011444-e75d-4985-aa85-5d202934ea3b","source":"Proposal","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"15f4af30-3af2-4f7a-a3cb-5bc626269c79","source":"Proposal","target":"Transition","type":"REFERENCES"},{"id":"e1d46879-4586-4641-a1d9-a455da138df6","source":"Proposal","target":"Act","type":"REFERENCES"},{"id":"3045a588-b191-444c-b45b-91c24e566ff7","source":"Proposal","target":"Message","type":"COMPOSES_WITH"},{"id":"3458a2e8-e51a-42f1-a118-77372ba47275","source":"Proposal","target":"d13ddda9-8b8c-4ee8-bc56-95196d9ec488","type":"HAS_INVARIANT"},{"id":"c5bae5f3-8472-4c46-8ef5-d625623645da","source":"Refine","target":"e38ff6e0-872e-4a63-a7ea-ebb84e174347","type":"IN_CATEGORY"},{"id":"404cf386-8a04-473b-82ed-41dec6531dba","source":"Refine","target":"Act","type":"COMPOSES_WITH"},{"id":"587169aa-397d-4e3b-80cc-874118a223c2","source":"Refine","target":"Condition","type":"REFERENCES"},{"id":"ac00c519-6b4d-4e76-a1a9-6df208ac13cd","source":"Refine","target":"Incongruity","type":"REFERENCES"},{"id":"d65aeac8-8751-4f8b-9aaf-e765c85bb1e4","source":"Refine","target":"Critique","type":"REFERENCES"},{"id":"66951977-9078-466e-9a17-7aa3dc1d50df","source":"Refine","target":"Artifact","type":"REFERENCES"},{"id":"598c6b23-c708-4118-b59b-d1f4d5169360","source":"Sign","target":"8f497759-ce27-442f-9c55-27f3c2ad7c49","type":"IN_CATEGORY"},{"id":"98c72eff-9291-4adb-a48e-14e90570a059","source":"Sign","target":"Act","type":"COMPOSES_WITH"},{"id":"2810035c-7152-4fbf-9e5a-e8d509279330","source":"Sign","target":"Signal","type":"REFERENCES"},{"id":"b827b5a8-fd8a-4fd9-8dd3-8d33422a5b27","source":"Sign","target":"Artifact","type":"ACCEPTS"},{"id":"69f92008-c727-47e4-88e5-716c6f5bb6bf","source":"Sign","target":"Identity","type":"REFERENCES"},{"id":"04987fe6-0872-4f4a-b023-6fa21d5d7f16","source":"Sign","target":"b59eade1-1965-4ccf-a3c3-925108574826","type":"HAS_INVARIANT"},{"id":"e23b8459-ff6a-4492-be2e-566b2bf904f2","source":"Sign","target":"cf7a1f59-ace5-4ce9-8181-f47734c65441","type":"HAS_INVARIANT"},{"id":"b099b79d-8f83-492c-b2c3-a2d22f291342","source":"Subject","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"f942d9ab-df49-4a70-9a53-570645695868","source":"Subject","target":"Act","type":"REFERENCES"},{"id":"de7d8c88-540d-42c0-ba90-c8846a2b1cf1","source":"Falsification","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"5b737d03-ce00-46ba-9392-8eb525da5648","source":"Falsification","target":"Observe","type":"REFERENCES"},{"id":"c0aa4f1d-741a-46b3-9630-fb6673a757cb","source":"Falsification","target":"Hypothesis","type":"REFERENCES"},{"id":"baf582ad-7fd1-4903-8b74-994e60054b7e","source":"Falsification","target":"Incongruity","type":"REFERENCES"},{"id":"b59e73c4-1cc8-4c0c-9757-f0151780c602","source":"Falsification","target":"d7867031-cb26-4a73-890e-702a0d1808b5","type":"HAS_INVARIANT"},{"id":"8db60ea8-edeb-4532-b108-a03871f6d7cf","source":"Falsification","target":"ec151772-48e9-458b-a76e-c8dee98f326e","type":"HAS_INVARIANT"},{"id":"e8254cf9-31d8-45b4-9310-db19a1bf0f33","source":"ComputeBudget","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"a46fbaf0-e0ed-4bfe-968c-932fca48ea8c","source":"ComputeBudget","target":"Gate","type":"REFERENCES"},{"id":"053818a0-2985-44d9-94ba-9ab83fa41c87","source":"ComputeBudget","target":"Budget","type":"REFERENCES"},{"id":"2ed3a6ea-c1da-4c27-a03a-d8524e7ae02c","source":"ComputeBudget","target":"Task","type":"REFERENCES"},{"id":"0cc99a9b-fbfe-432e-9fac-5482334aef3d","source":"ComputeBudget","target":"Value","type":"REFERENCES"},{"id":"853fc755-7df6-436d-8108-8b0e5ac031ae","source":"ComputeBudget","target":"aaea614d-5541-4bbe-a91a-4869cb5aab33","type":"HAS_INVARIANT"},{"id":"d25de4ab-c693-4b1d-ad06-d4d016ffc90e","source":"ComputeBudget","target":"958ed552-bd7a-4ffa-adf8-4d74138f0470","type":"HAS_INVARIANT"},{"id":"cbadf8b1-0788-4c1a-877b-2e432b2bc9e3","source":"ComputeBudget","target":"a72d2797-f5ae-437b-8b70-458b9c4228f1","type":"HAS_PRECONDITION"},{"id":"31c3cb36-9d3e-4ec6-bde4-fb93ce5b3374","source":"ComputeBudget","target":"c71f2a8d-473d-4313-9a74-921125eff1cf","type":"HAS_PRECONDITION"},{"id":"fe3a4bc7-a3a1-4a0a-9315-4df0b922e0c8","source":"ComputeBudget","target":"3bfe4329-fbeb-43ed-bca9-3ebe55af50c4","type":"HAS_POSTCONDITION"},{"id":"e619d494-706a-4acd-868b-78a62d71228f","source":"ComputeBudget","target":"9d8fbea3-efb5-4f46-b92d-39b72c437401","type":"HAS_POSTCONDITION"},{"id":"60dd2b0c-ebf8-4349-9e1d-4677e13f9bd6","source":"ExtendedThinking","target":"e38ff6e0-872e-4a63-a7ea-ebb84e174347","type":"IN_CATEGORY"},{"id":"b268e093-936c-4958-9b64-590aa3dd51f5","source":"ExtendedThinking","target":"Task","type":"ACCEPTS"},{"id":"2e63512e-4145-455f-b9dd-e8eeee590b11","source":"ExtendedThinking","target":"Chain","type":"REFERENCES"},{"id":"89960fc5-21a4-4933-a644-345666d16693","source":"ExtendedThinking","target":"1298ab08-5649-4dcf-ba4d-f20514edf047","type":"HAS_INVARIANT"},{"id":"db2fc39a-5c22-42a7-846c-3eeb33a728b5","source":"ExtendedThinking","target":"911ff119-6358-4a7e-a7fe-9a27ca11e9a0","type":"HAS_INVARIANT"},{"id":"5f5a7350-d1bc-46dd-936b-1f90b7d1af1d","source":"ExtendedThinking","target":"f7806969-4e41-4833-b787-da7e62b87483","type":"HAS_PRECONDITION"},{"id":"cd596a81-e8cb-4771-b407-5c1a3788b21e","source":"ExtendedThinking","target":"98b10046-d4fe-4d8c-aadf-a9e35686416e","type":"HAS_PRECONDITION"},{"id":"7361ae14-3446-417c-ace4-d8fb8a6e0f2b","source":"ExtendedThinking","target":"5880c4d9-a71e-4823-9345-2e3e79e56bf4","type":"HAS_POSTCONDITION"},{"id":"4dd80e51-80e3-4bfd-8e8b-28d020e95b82","source":"HumanApprove","target":"579b02af-c094-442f-8ef9-67bcd86bd62f","type":"IN_CATEGORY"},{"id":"f7323af4-7075-4194-9a52-7045cd865c46","source":"HumanApprove","target":"Task","type":"ACCEPTS"},{"id":"67fccccd-323b-4b21-917d-519bc32b4ba6","source":"HumanApprove","target":"Audit","type":"REFERENCES"},{"id":"662eb957-422a-4d7e-a685-32b491fa8114","source":"HumanApprove","target":"System","type":"REFERENCES"},{"id":"27124f7f-8b64-4f35-9fc9-95f4a22e114d","source":"HumanApprove","target":"Context","type":"REFERENCES"},{"id":"e84aa740-a8e6-456d-aa62-19a42291008d","source":"HumanApprove","target":"75bb86ec-c6e5-4aa4-b10b-b13f1bb58635","type":"HAS_INVARIANT"},{"id":"e2fc8517-f856-4dca-bc7a-d4ffa14b4f00","source":"HumanApprove","target":"68b63c7c-429b-484d-a49d-496757d444d8","type":"HAS_INVARIANT"},{"id":"f774f3a2-2825-4629-bf2a-caf1b1069d29","source":"HumanApprove","target":"45fa71bd-2612-4fb6-a97b-c69b89e34399","type":"HAS_INVARIANT"},{"id":"f108cb40-d612-4bb9-85fb-a89a6977b10a","source":"HumanApprove","target":"9ac278e9-55f7-4f15-9081-83413546d7c9","type":"HAS_INVARIANT"},{"id":"6c98648e-2f3d-48af-9eb4-3d45bebb5406","source":"Mutex","target":"8f497759-ce27-442f-9c55-27f3c2ad7c49","type":"IN_CATEGORY"},{"id":"fbd5aab9-00cc-4adf-8a3a-33b8ba71d06c","source":"Mutex","target":"Resource","type":"REFERENCES"},{"id":"1a2ebe5b-5f85-489f-844a-14f3b40724db","source":"Mutex","target":"Task","type":"ACCEPTS"},{"id":"e0705c62-ba43-4f68-aa53-0190db616c9b","source":"Mutex","target":"Lock","type":"REFERENCES"},{"id":"37751a18-43e3-4e4f-abb5-e9407eba234d","source":"Mutex","target":"7c1cbc8a-f6c3-4e59-9224-74fce8c70428","type":"HAS_INVARIANT"},{"id":"2d0c7438-4653-41a8-93f3-e40c70e4f90b","source":"Mutex","target":"4fa5c0f2-faf2-4f45-b304-24ca30b5a7c4","type":"HAS_PRECONDITION"},{"id":"96213917-ff16-4537-b3c2-3cd152096ab1","source":"Mutex","target":"655d6beb-2f96-46cd-8926-c60a90836811","type":"HAS_POSTCONDITION"},{"id":"de707c91-a256-46bd-a8d7-a27199c41e42","source":"Noise","target":"8f497759-ce27-442f-9c55-27f3c2ad7c49","type":"IN_CATEGORY"},{"id":"cbacd98a-bc9d-41dc-8fc1-919fa562892f","source":"Noise","target":"Task","type":"REFERENCES"},{"id":"e5329a73-9f54-4a27-85e8-b75a9cdefce1","source":"Noise","target":"Datum","type":"REFERENCES"},{"id":"19fd77f4-b758-4b1d-bea6-e123eb1df52b","source":"Noise","target":"Signal","type":"REFERENCES"},{"id":"cbf14593-645f-455e-a981-8943eba42de6","source":"Problem","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"0a2edd74-a79b-478c-b143-16aa84810d61","source":"Problem","target":"Task","type":"REFERENCES"},{"id":"991a6ff9-24c7-4648-8a8f-91aabd7f47c3","source":"Problem","target":"State","type":"REFERENCES"},{"id":"a9bfee03-7eb8-4fea-8ab3-7141889ae766","source":"ProgramOfThought","target":"e38ff6e0-872e-4a63-a7ea-ebb84e174347","type":"IN_CATEGORY"},{"id":"90720468-9d99-47fd-b681-25ce653e4120","source":"ProgramOfThought","target":"Task","type":"ACCEPTS"},{"id":"0429e430-fd8f-4b87-ae20-57acdaa596a4","source":"ProgramOfThought","target":"4b3548c1-5bbb-49bc-8171-51618d6ab03c","type":"HAS_INVARIANT"},{"id":"63b042cb-85b8-46fc-8fc1-1a9c37eacf5a","source":"ProgramOfThought","target":"d3485af8-a67d-419d-9598-867ad73b727d","type":"HAS_INVARIANT"},{"id":"a315aa10-6454-42a6-9ee3-1960b0745d38","source":"ProgramOfThought","target":"d9037161-097a-480f-ada1-4e3813fe15a6","type":"HAS_PRECONDITION"},{"id":"ed55a828-2479-48b1-8090-522e2fa5785e","source":"ProgramOfThought","target":"56e2c28b-01c6-416f-bdd0-9f4c305bd09a","type":"HAS_POSTCONDITION"},{"id":"5c69f120-b699-49c1-aa88-42540222f595","source":"Queue","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"c8bc74af-bc50-48ea-b9ac-9a57fd5ed9b5","source":"Queue","target":"Task","type":"REFERENCES"},{"id":"1ad3d712-77e2-4e4f-892b-0295d5e4390f","source":"Queue","target":"Message","type":"REFERENCES"},{"id":"4d90a3d4-1d2c-4ae0-b08f-c4b75d65f303","source":"Route","target":"8f497759-ce27-442f-9c55-27f3c2ad7c49","type":"IN_CATEGORY"},{"id":"239064ab-b0c7-47df-a541-de80c7e01646","source":"Route","target":"Task","type":"ACCEPTS"},{"id":"4509f8ff-1902-4d92-ab2a-0506cdc105cd","source":"Route","target":"6a45c8af-289b-4d65-a162-f120f1fab327","type":"HAS_INVARIANT"},{"id":"e171b315-e10b-4654-80c4-caa061ff113a","source":"Route","target":"25a3355e-c6d0-4c81-8441-1d574f2445e9","type":"HAS_INVARIANT"},{"id":"788c8d05-7a5d-49bf-8012-1b4587ffec52","source":"Route","target":"c6248bd1-fa66-4aa2-b172-2d1d1cefb7e9","type":"HAS_PRECONDITION"},{"id":"d8777fd3-2700-4250-ad0e-e3bd402900d2","source":"Route","target":"7001b518-6478-4734-966b-cfdc7c4a2118","type":"HAS_PRECONDITION"},{"id":"a19af39f-ef53-44ca-8a98-ca630db5b9e3","source":"Route","target":"f7a6ee03-0faa-413b-9a0f-f8eee233bc0e","type":"HAS_POSTCONDITION"},{"id":"754ec31a-bf1f-427f-90ea-86479041a5a1","source":"SomaticMarker","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"07c76d75-7cef-499f-a99e-559387124ea0","source":"SomaticMarker","target":"Task","type":"REFERENCES"},{"id":"5972d664-064b-4cc9-9ba9-a587d112c46f","source":"SomaticMarker","target":"Signal","type":"REFERENCES"},{"id":"bcd8aa3e-65ee-4fb5-9d6b-503cdc211daf","source":"SomaticMarker","target":"Correlation","type":"REFERENCES"},{"id":"4cbdb0e3-4680-4815-b996-abd18a3b0854","source":"SomaticMarker","target":"b77708f3-bfb6-4e60-b946-a682ca2cb783","type":"HAS_INVARIANT"},{"id":"15087685-28a8-4762-bc61-061337d5960a","source":"SomaticMarker","target":"6b12c7ad-b008-4899-82a5-05d840b1ff3c","type":"HAS_INVARIANT"},{"id":"d66c4f82-6901-4891-a798-4148934d1694","source":"Throttle","target":"8f497759-ce27-442f-9c55-27f3c2ad7c49","type":"IN_CATEGORY"},{"id":"6c02445c-98d7-49c3-a164-63077dc364ba","source":"Throttle","target":"Task","type":"ACCEPTS"},{"id":"088bb01c-3e35-44b1-80e4-c3f5fd653895","source":"Throttle","target":"Backoff","type":"COMPOSES_WITH"},{"id":"ff8dd916-edac-47bf-a0ac-c1825f384540","source":"Throttle","target":"ca20f93d-ceec-42a5-9ee1-025a9309aebc","type":"HAS_INVARIANT"},{"id":"13c6bc0a-077c-4fde-aa42-17e51c771cd4","source":"Throttle","target":"6470c082-2ecb-4ac6-a7a7-42efa2a67e45","type":"HAS_INVARIANT"},{"id":"d45f2d0e-7352-4b04-a120-7612a94c245e","source":"Throttle","target":"099b2986-186c-4ee4-9519-d49358236cab","type":"HAS_INVARIANT"},{"id":"6ecbc235-1de7-40b4-820b-a82e2a9eefb6","source":"Throttle","target":"b651cae9-be0a-4f8d-ad59-d89dad2c3876","type":"HAS_PRECONDITION"},{"id":"1451f8b7-e070-47d5-99f3-bdcda802987e","source":"ToolInvoke","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"666f48e1-8904-47d5-b8d4-3a932493d1e5","source":"ToolInvoke","target":"InputGuard","type":"COMPOSES_WITH"},{"id":"d6601bf9-e9a0-468a-9683-d59fd8ed0f24","source":"ToolInvoke","target":"Task","type":"REFERENCES"},{"id":"68fba53b-a7d3-495c-974f-a29e98612605","source":"ToolInvoke","target":"Context","type":"REFERENCES"},{"id":"d2b63d47-2d83-4192-b317-18281f1b26a8","source":"ToolInvoke","target":"190fb119-9b5e-4d3f-97f7-5b1242e2544b","type":"HAS_INVARIANT"},{"id":"736814ef-960e-4c8c-8d97-925bfe71c1b7","source":"ToolInvoke","target":"c551a250-6d97-4d0f-be9a-09a13dafbb85","type":"HAS_INVARIANT"},{"id":"6b9f7d06-f785-4482-aab8-6ec7044b3a71","source":"ToolInvoke","target":"3e4e375b-20ad-4ddb-bddb-80b371d00fca","type":"HAS_INVARIANT"},{"id":"8e157a62-1cbd-49a4-be91-e714eee78501","source":"ToolInvoke","target":"bf983ff4-1af3-4232-8b61-7008708e4347","type":"HAS_INVARIANT"},{"id":"5b4e4129-d1f4-4c28-aed9-1865fd005208","source":"Work","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"91cae141-f88d-4063-a672-6811d2c179c0","source":"Work","target":"Task","type":"COMPOSES_WITH"},{"id":"e1e3f04a-ccb5-412c-b904-68cd12a5785d","source":"Work","target":"Budget","type":"REFERENCES"},{"id":"608d3a9f-6c13-4647-9db4-74d32b462fd2","source":"Work","target":"Act","type":"REFERENCES"},{"id":"9200b086-c10a-46ec-a332-f93169020a6d","source":"Work","target":"fd0f43e6-7434-4ce4-ba27-d95f18a54eb4","type":"HAS_INVARIANT"},{"id":"afceef81-8af4-44a4-8914-9adb05be7d65","source":"Work","target":"7d8d9e41-5592-4098-bf37-b1e7fce867f0","type":"HAS_INVARIANT"},{"id":"4255f180-2114-4746-80dc-2750f9b17e82","source":"Interpret","target":"e38ff6e0-872e-4a63-a7ea-ebb84e174347","type":"IN_CATEGORY"},{"id":"cb9d7e73-ab61-4c13-81f6-54f61069e6ad","source":"Interpret","target":"Value","type":"YIELDS"},{"id":"9df362da-fba9-491f-b22e-9a3199bbe79a","source":"Interpret","target":"Datum","type":"ACCEPTS"},{"id":"16392436-0af3-4a32-98e6-eb16d1d2f307","source":"Interpret","target":"Think","type":"COMPOSES_WITH"},{"id":"2a8f470b-e0a0-425f-9594-86b2fbeb0588","source":"Interpret","target":"Signal","type":"ACCEPTS"},{"id":"4eca1986-3e2e-48b7-94d4-3991b4571511","source":"Interpret","target":"Context","type":"COMPOSES_WITH"},{"id":"e251a206-ad9d-477d-9db3-15c95e82a55d","source":"Interpret","target":"716c6e56-9216-49cf-ad92-39304f6939c1","type":"HAS_INVARIANT"},{"id":"46400429-d494-4414-b3cb-def6af609523","source":"Interpret","target":"ba17480c-f2f3-440c-999f-c3c6a83960e5","type":"HAS_INVARIANT"},{"id":"95ec0a05-2b99-4183-951f-9181c6948a2b","source":"Understand","target":"e38ff6e0-872e-4a63-a7ea-ebb84e174347","type":"IN_CATEGORY"},{"id":"980d7705-cbb8-4b45-ad06-097f2d54f91e","source":"Understand","target":"Context","type":"REFERENCES"},{"id":"2e2afd06-a474-4c96-95da-d996882f2557","source":"Understand","target":"Think","type":"REFERENCES"},{"id":"08b658d5-190d-4e78-a97a-956f1c103d1c","source":"Risk","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"df5dc980-71de-4827-9d95-c1ef4b121b6f","source":"Risk","target":"Metric","type":"REFERENCES"},{"id":"059805b0-91e4-485d-a40c-8f7566231613","source":"Risk","target":"Probability","type":"REFERENCES"},{"id":"9845084a-42a0-48a9-b7db-283426010cb1","source":"Risk","target":"5d07d308-b0a0-479e-867f-18c960ec459f","type":"HAS_INVARIANT"},{"id":"2863f5d5-cfea-40d9-b049-aa0f9cd3f5fd","source":"Risk","target":"56afa5c8-8a1a-4fbe-a112-9027b2763647","type":"HAS_INVARIANT"},{"id":"87377582-a91e-4ac8-b7aa-cd5ce5f8b02d","source":"Risk","target":"16ec2312-997c-4a31-9fb2-877597281327","type":"HAS_INVARIANT"},{"id":"1e07d1e1-b264-4c24-851e-3f2a9f207a3f","source":"SpotAudit","target":"579b02af-c094-442f-8ef9-67bcd86bd62f","type":"IN_CATEGORY"},{"id":"2fd2a84a-c6b8-4f32-b424-0893f2538910","source":"SpotAudit","target":"Audit","type":"REFERENCES"},{"id":"5683a3f9-6096-490e-81ff-269d8242d852","source":"SpotAudit","target":"StateAudit","type":"REFERENCES"},{"id":"1a8143eb-e7e5-498d-95b9-84667f33b482","source":"SpotAudit","target":"e4ccbb5f-8ad3-4b85-8752-95d59564e62d","type":"HAS_INVARIANT"},{"id":"f7be5267-74b9-43d2-a3f2-38d1d1eadff5","source":"SpotAudit","target":"2835b99e-fdfe-4ad5-9775-72cbec50cc5d","type":"HAS_INVARIANT"},{"id":"46e4cfa4-1627-4848-ac81-5b1302eca8f5","source":"SpotAudit","target":"6995735f-6f5a-43c6-bbc5-9ef5a97b8122","type":"HAS_PRECONDITION"},{"id":"349666de-8050-4e0d-a0c3-38b2a4c61ad9","source":"SpotAudit","target":"c42a4b69-0ad8-4407-b591-e6f639f798e6","type":"HAS_POSTCONDITION"},{"id":"06aab990-b2bf-45e8-990d-602e7f0ab102","source":"RecursiveRootCause","target":"e38ff6e0-872e-4a63-a7ea-ebb84e174347","type":"IN_CATEGORY"},{"id":"3757acec-df01-441a-8156-3e69b5366608","source":"RecursiveRootCause","target":"Trace","type":"REFERENCES"},{"id":"9c599d88-9b17-4604-9333-deefa03e1788","source":"RecursiveRootCause","target":"State","type":"REFERENCES"},{"id":"8bb30fd9-fea8-4849-995b-207f98ea5240","source":"RecursiveRootCause","target":"dab59add-0b9c-4ba6-abba-4ed7080cf1f7","type":"HAS_INVARIANT"},{"id":"3818cf33-135f-4396-aa7a-b4e8cc747e89","source":"RecursiveRootCause","target":"7c83db86-00f6-4dae-8ff0-4d13605b3d92","type":"HAS_INVARIANT"},{"id":"0f8106a1-a02e-4564-9f7e-f443eea8b4c8","source":"RecursiveRootCause","target":"53e73717-dcc8-4b94-b78a-25f8ac98c5af","type":"HAS_INVARIANT"},{"id":"fc3d39eb-b98b-46a8-83d5-a4013abddcf0","source":"SelfReminder","target":"6fe7b13d-4ed3-4c51-ae9a-7943dd282dbf","type":"IN_CATEGORY"},{"id":"ae7c7e84-35b7-4365-b7ac-dcc8454d0fa7","source":"SelfReminder","target":"Trace","type":"REFERENCES"},{"id":"0e2851a9-4fb3-4ec0-b246-c554e436293e","source":"SelfReminder","target":"Context","type":"REFERENCES"},{"id":"c32264ac-6f3d-43b4-b34b-b148dd8862b4","source":"SelfReminder","target":"Constraint","type":"REFERENCES"},{"id":"5efd2d25-62ad-44e4-91dc-9162e6df4403","source":"SelfReminder","target":"e869d08c-7b8a-4360-a305-9f9c06895bca","type":"HAS_INVARIANT"},{"id":"d6c7f56e-b329-4b35-856a-dd8ae1b8e26b","source":"SelfReminder","target":"f26749d4-cbc6-44b8-bfec-f6a834237e66","type":"HAS_INVARIANT"},{"id":"54654371-d3d5-4c38-8031-412ea9134b0a","source":"SelfReminder","target":"5c3671fd-34d5-4ae3-a251-4fca01d66728","type":"HAS_INVARIANT"},{"id":"75787968-82ee-42ba-b498-d7dec370d173","source":"Stigmergy","target":"6fe7b13d-4ed3-4c51-ae9a-7943dd282dbf","type":"IN_CATEGORY"},{"id":"accfe8c1-0977-4111-9568-0c08df0b7593","source":"Stigmergy","target":"Trace","type":"REFERENCES"},{"id":"6fa2c8fb-1720-4325-b62b-4c4c1ad82cd4","source":"Stigmergy","target":"Decay","type":"REFERENCES"},{"id":"2a996b85-d150-484c-ab3d-5d9ce7245042","source":"Stigmergy","target":"7fcfd24c-39e3-4896-b2ea-c1cafe1a5d42","type":"HAS_INVARIANT"},{"id":"b35ae0be-2b5c-4cc8-9b43-95fe7d86965d","source":"Stigmergy","target":"aa745af4-dae1-43bd-be19-661c2fd113d5","type":"HAS_INVARIANT"},{"id":"5484c799-7dbc-4895-8325-d5ff89353398","source":"OptimalStop","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"b9470189-76da-40b0-87de-9a8cb67a3940","source":"OptimalStop","target":"ComputeBudget","type":"REFERENCES"},{"id":"e4727db5-6218-4686-97b4-7ae6795b4d20","source":"OptimalStop","target":"6b045666-416f-4528-84bb-c80bdd7440b8","type":"HAS_INVARIANT"},{"id":"d1f46688-a489-40e6-9ed9-c162b630e58c","source":"Reason","target":"e38ff6e0-872e-4a63-a7ea-ebb84e174347","type":"IN_CATEGORY"},{"id":"e61d3287-3f39-468d-9271-54d3296771f3","source":"Reason","target":"ComputeBudget","type":"REFERENCES"},{"id":"6dfd8915-b43b-4bb8-b896-f62f2c1f37d5","source":"Reason","target":"Context","type":"ACCEPTS"},{"id":"2e0c84d7-0a89-45d9-bd9b-49cc1f94886d","source":"Reason","target":"Topology","type":"REFERENCES"},{"id":"769e6c8f-b0d8-471d-8e57-dc7befd00d81","source":"Reason","target":"Think","type":"COMPOSES_WITH"},{"id":"05a25286-4ef3-4393-be6f-193e5692043b","source":"Reason","target":"Chain","type":"REFERENCES"},{"id":"6d7bf31c-6f09-4eb6-8b39-69822aa3a1e4","source":"Reason","target":"Tree","type":"REFERENCES"},{"id":"83fdeae8-87c3-4f5f-b8f6-a48f414eda30","source":"Reason","target":"e2fd1c9a-fff1-4212-9d2d-3729b4258a9f","type":"HAS_INVARIANT"},{"id":"94463c9e-dde4-4140-8ff8-3dd5433b6cb0","source":"Reason","target":"ce1a7678-9d8a-4748-a565-d5254354b6d6","type":"HAS_INVARIANT"},{"id":"426a0b4e-13f6-48a6-98f9-e46b55cafcd4","source":"Reason","target":"f5eda9bf-d772-4951-8aca-e10a931850ac","type":"HAS_INVARIANT"},{"id":"7bb31f08-9b07-4bb6-b95e-50642bb019ab","source":"Reason","target":"683e37d3-0346-4edf-9aee-8e984fdd1803","type":"HAS_PRECONDITION"},{"id":"8a75ec44-6063-4459-a335-05e59aa0d176","source":"Reason","target":"dcf5007b-706f-45fc-bd1e-8242146482e5","type":"HAS_PRECONDITION"},{"id":"957ac425-daa6-4285-8eca-0393c23cedf3","source":"Reason","target":"b636fbb0-35bb-4fec-b055-e114afa5e4c4","type":"HAS_POSTCONDITION"},{"id":"ecd26fd6-503b-4cce-82d0-456b24cd7212","source":"Reason","target":"961a6f7f-81b7-4f1d-ad64-b9c57eee7bbd","type":"HAS_POSTCONDITION"},{"id":"57be8659-8bb3-442f-b6cd-a1c49c88dabd","source":"ReversibilityCheck","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"a454dd12-37ae-44d3-8844-23acb1746582","source":"ReversibilityCheck","target":"Reversibility","type":"REFERENCES"},{"id":"4a32beb2-38f3-486e-afe3-fe6f70f9d436","source":"ReversibilityCheck","target":"WorldReversible","type":"REFERENCES"},{"id":"69021272-77aa-4a60-8aad-856caf9960d7","source":"ReversibilityCheck","target":"HumanApprove","type":"REFERENCES"},{"id":"e87fb900-81d2-4c76-bd34-fb0d45d38388","source":"ReversibilityCheck","target":"Check","type":"REFERENCES"},{"id":"5d443af8-c5ec-4acb-9f2e-ac8976670897","source":"Dampen","target":"8f497759-ce27-442f-9c55-27f3c2ad7c49","type":"IN_CATEGORY"},{"id":"9b7a6d02-4b6b-4d69-8ed3-70b97c26759e","source":"Dampen","target":"Noise","type":"REFERENCES"},{"id":"e2a5361c-669e-4a95-aebf-a2488d97d76f","source":"Dampen","target":"Signal","type":"REFERENCES"},{"id":"9b6a3cd4-8395-4b98-97b5-9f6eb93215d9","source":"Dampen","target":"Value","type":"REFERENCES"},{"id":"0e0b7b44-962c-4b96-919d-94e84af07f96","source":"EntropyPump","target":"8f497759-ce27-442f-9c55-27f3c2ad7c49","type":"IN_CATEGORY"},{"id":"125de8b9-41b8-4c4f-b05b-de918a085d1d","source":"EntropyPump","target":"Entropy","type":"REFERENCES"},{"id":"80ec8181-07c4-44a6-a40c-7aa758d7fddb","source":"EntropyPump","target":"Noise","type":"REFERENCES"},{"id":"2fa34db4-b53f-4b4b-a41e-0d45199cb364","source":"EntropyPump","target":"fb23e92c-15eb-48ec-99bd-e00bc90ae23a","type":"HAS_INVARIANT"},{"id":"a3d355bb-6cce-46e1-b27e-c1366a76ef6d","source":"EntropyPump","target":"7814ba42-34c8-4680-b086-9ddabf9116c6","type":"HAS_INVARIANT"},{"id":"bbe91c67-d49c-49d9-8b28-8f95e427556d","source":"Reframe","target":"e38ff6e0-872e-4a63-a7ea-ebb84e174347","type":"IN_CATEGORY"},{"id":"fe6b66e0-68ef-4fe5-ad6a-c768586b72bc","source":"Reframe","target":"Problem","type":"REFERENCES"},{"id":"abee8e3f-a41a-4550-93ae-87426a881726","source":"Reframe","target":"cfb5d236-6846-49ab-919a-a5bb0bdc6561","type":"HAS_INVARIANT"},{"id":"9f0637a1-3029-46a6-a68e-01ff8023e888","source":"Reframe","target":"d355b52b-7a36-4bb5-a562-7a3e3a32554c","type":"HAS_INVARIANT"},{"id":"b959f541-6a96-49b9-abf9-f461f0e779fa","source":"Reframe","target":"f9902177-79ae-4337-a4ae-95b842e9c226","type":"HAS_PRECONDITION"},{"id":"5f98dec8-6750-44dd-9650-f8556f664a9f","source":"Reframe","target":"2aec1061-1352-4630-bd83-1a4b4c54866a","type":"HAS_POSTCONDITION"},{"id":"aabdb145-5968-49aa-a20c-2ae7c11207a6","source":"ThinSlice","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"798fabe9-cc6e-44b5-9fd0-3bbfedf3deb9","source":"ThinSlice","target":"Route","type":"REFERENCES"},{"id":"d65699bf-5d6f-4f21-9c06-7f15ee4be63e","source":"ThinSlice","target":"ExtendedThinking","type":"REFERENCES"},{"id":"2a8f517a-7ad0-4ff6-9ba9-0938085e0fe8","source":"ThinSlice","target":"SomaticMarker","type":"REFERENCES"},{"id":"0e2e5d9c-132c-4fc1-8779-7fd0b2d9fe26","source":"ThinSlice","target":"e9ca8593-db0b-4a84-868c-673d338df4ec","type":"HAS_INVARIANT"},{"id":"e3a16aae-623f-4568-97a6-c725ab309ac0","source":"ThinSlice","target":"146d6b28-b8d4-467f-b6cf-e1b6505e2623","type":"HAS_INVARIANT"},{"id":"7ef591bf-2a23-4d27-bacf-a4144e08e39b","source":"ThinSlice","target":"9ea13015-a262-446f-be14-982c713e244d","type":"HAS_INVARIANT"},{"id":"27412739-a0af-4add-882c-107b88ca6bc2","source":"Cooldown","target":"8f497759-ce27-442f-9c55-27f3c2ad7c49","type":"IN_CATEGORY"},{"id":"3b556950-a2df-471c-8671-89126620cbd5","source":"Cooldown","target":"Throttle","type":"REFERENCES"},{"id":"d56018fc-1c0b-475c-9b89-3e73915795e5","source":"Cooldown","target":"b19adf87-846e-4a9e-b5ea-87d5fcaa8e3a","type":"HAS_INVARIANT"},{"id":"649ce21b-30cb-45a1-86e2-5e204984dabf","source":"Cooldown","target":"7c02c221-24e4-4187-8b70-7f8d3e08401b","type":"HAS_INVARIANT"},{"id":"532733b2-9c12-4839-ac90-27d9ae4b0991","source":"Cooldown","target":"2ba25e27-fb35-42f8-ba63-2175e3c76475","type":"HAS_PRECONDITION"},{"id":"56ac6478-5f41-4d7b-92b0-d39f041938e0","source":"Cooldown","target":"397aa888-8719-4dc6-a1f2-08aa5458fa11","type":"HAS_PRECONDITION"},{"id":"23781977-6fa6-4bd3-ac5e-1e1df32aac66","source":"Cooldown","target":"a6c15f07-a423-413d-b2c8-c7bccf1b9888","type":"HAS_POSTCONDITION"},{"id":"4fecab9f-835a-409f-913d-d7f19a1f80c7","source":"Bubble","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"7ee5ee61-95c2-4762-974f-95be990ceb37","source":"Bubble","target":"Work","type":"REFERENCES"},{"id":"ca1f8515-dcbc-45b0-b66c-becdb3be04fb","source":"Bubble","target":"State","type":"REFERENCES"},{"id":"75bb85b4-0382-4fc1-8525-544106ebdc5e","source":"Bubble","target":"ConstraintFirst","type":"REFERENCES"},{"id":"ff39de26-818f-45d9-870f-b45cfecac475","source":"Bubble","target":"d4185b1d-3d7e-427c-94f3-86f78bb9f8a3","type":"HAS_INVARIANT"},{"id":"04f89ce7-e726-416e-996b-f01000eb8e78","source":"Bubble","target":"841b97b1-8f00-4e60-ad1c-b3013f182117","type":"HAS_INVARIANT"},{"id":"b89edff0-5019-41a4-a2fe-1b25ac9aaea4","source":"Bubble","target":"56ffd905-f0c1-4fcf-b038-6e9861b00f2f","type":"HAS_PRECONDITION"},{"id":"719054b7-361a-4d7d-aa06-12a75984f74e","source":"Bubble","target":"7a70d6ed-d86f-4dad-963c-b4177ac675b8","type":"HAS_PRECONDITION"},{"id":"8cb0d4c8-dc11-4c48-9631-13e15a910e82","source":"Bubble","target":"f3e61797-4633-4023-af73-835a44f7cf74","type":"HAS_POSTCONDITION"},{"id":"af23491c-f4a5-4c20-b168-2698b8a76205","source":"Bubble","target":"56ea2cf4-623f-4bd8-929c-da07c3208c12","type":"HAS_POSTCONDITION"},{"id":"5511c774-2ffa-4bae-9267-e0ddff8eee9b","source":"Care","target":"8f497759-ce27-442f-9c55-27f3c2ad7c49","type":"IN_CATEGORY"},{"id":"1ee96543-b48f-4900-96ec-856354fd06a2","source":"Care","target":"Work","type":"REFERENCES"},{"id":"0936c0b2-3716-4934-bcc5-0ef21ece80fd","source":"Care","target":"Entropy","type":"REFERENCES"},{"id":"f553be86-c070-468e-981d-3a4c70404822","source":"Care","target":"Value","type":"REFERENCES"},{"id":"0d152ef5-e1d8-40d2-ac30-d7b322ec335c","source":"Care","target":"8ed06e3e-0883-4dd0-886e-0131a707cced","type":"HAS_INVARIANT"},{"id":"7b4c2774-6130-48be-8753-bd9f06cf4999","source":"Care","target":"3a11d5c4-95a4-44ab-a28e-c5d610039cbf","type":"HAS_INVARIANT"},{"id":"d01c90c0-b54a-41f3-8721-e27e457511be","source":"Loop","target":"8f497759-ce27-442f-9c55-27f3c2ad7c49","type":"IN_CATEGORY"},{"id":"471761bc-1abd-4065-a779-aede4ae08659","source":"Loop","target":"Work","type":"COMPOSES_WITH"},{"id":"6c895a67-5001-4785-ab09-e3fddaa04916","source":"Loop","target":"Condition","type":"ACCEPTS"},{"id":"80760053-ef6f-474d-8ee4-d9559f793fbf","source":"Loop","target":"6622dfd3-129f-40dd-8a8f-01706a4b021f","type":"HAS_INVARIANT"},{"id":"9a76cfca-4461-4bb5-aae8-ae7d4b4ed6c7","source":"Loop","target":"e89dd86d-9d47-4b42-8446-7a9235e90290","type":"HAS_INVARIANT"},{"id":"d7ce577f-987b-4401-98e0-3320e7286ee8","source":"Prioritize","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"a301f313-621a-4719-a7bb-56cd147dcc8f","source":"Prioritize","target":"Task","type":"REFERENCES"},{"id":"dfffdff9-e456-4e57-9ed0-add5fcf426ea","source":"Prioritize","target":"Criteria","type":"REFERENCES"},{"id":"e80340ec-ba75-48d9-be0a-24747ff49282","source":"Prioritize","target":"Work","type":"REFERENCES"},{"id":"d705ee18-1e71-481d-8a98-ab609e1d14bf","source":"Prioritize","target":"Rank","type":"COMPOSES_WITH"},{"id":"dc899966-4195-456c-9195-e7653de3bd70","source":"Prioritize","target":"Value","type":"REFERENCES"},{"id":"70e9f3cd-0518-455f-9289-3a83afa13eca","source":"Prioritize","target":"81814094-0f65-4035-9f19-380454737aab","type":"HAS_INVARIANT"},{"id":"8493d5a8-81e7-41a9-9042-511e76bbe5a9","source":"Prioritize","target":"f0d4d037-1d1d-4c4c-8f03-037b88eda93a","type":"HAS_INVARIANT"},{"id":"97542838-4553-467c-b69c-a8a0ecf427c9","source":"Prioritize","target":"93643787-abdd-4c35-9936-fd37689a89fc","type":"HAS_PRECONDITION"},{"id":"ed5278b8-6af8-4925-9d16-4db3413761a2","source":"Prioritize","target":"97fdd8a6-34d7-4c26-bdfd-724fe2f9e055","type":"HAS_POSTCONDITION"},{"id":"7e850a87-2b85-47c0-a9af-2deb91a21243","source":"Solution","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"d781b689-4b01-4396-a4be-6925f347a6bf","source":"Solution","target":"Task","type":"ACCEPTS"},{"id":"25517885-e1f6-4fa1-9d00-bf1cc30717e3","source":"Solution","target":"Work","type":"REFERENCES"},{"id":"f4112447-61f2-4fc5-a95c-a1cc44d77ce9","source":"Solution","target":"Chain","type":"REFERENCES"},{"id":"98272c72-4f5c-45b9-8814-92496cc881e4","source":"Solution","target":"Artifact","type":"REFERENCES"},{"id":"ab66936b-fc72-496b-b5e2-7cc64926feeb","source":"Solution","target":"Tree","type":"REFERENCES"},{"id":"f984d1e5-679a-4f50-b1e0-45f384f261d0","source":"Solution","target":"da84b400-067c-4c00-ab3f-b295c6921f9b","type":"HAS_INVARIANT"},{"id":"6ffc4d88-9da0-4ecd-b1f8-06e0cb4a04c7","source":"Solution","target":"2160d0a9-fb00-498d-a944-439bf53070b4","type":"HAS_INVARIANT"},{"id":"1e9cfbf0-353e-4d04-8fae-f32cd16ba2c0","source":"Solution","target":"a8dff9e9-00f2-4fee-a629-6fe70f38991f","type":"HAS_PRECONDITION"},{"id":"a7cccbf1-e56a-4c66-ac7b-0a311ce70acd","source":"Solution","target":"93c54129-ff39-44a6-b99d-ce574c728a14","type":"HAS_PRECONDITION"},{"id":"6fe93eb3-ccb3-42c0-8e18-639922f39b60","source":"Solution","target":"da01de31-2513-49ca-a764-d9f277b73837","type":"HAS_POSTCONDITION"},{"id":"d064b074-e6c2-4558-99f0-b5c1e95475ec","source":"TimeboxThink","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"9068589b-04cc-481c-b754-2d8fdd7b0981","source":"TimeboxThink","target":"Work","type":"REFERENCES"},{"id":"02fab26c-e6b9-4594-a5b9-1224bcaac0e9","source":"TimeboxThink","target":"Budget","type":"REFERENCES"},{"id":"aa200524-0e56-4daa-94b9-c094bc758367","source":"TimeboxThink","target":"Constraint","type":"REFERENCES"},{"id":"70a59378-0203-4928-a46e-27415d8deb3f","source":"TimeboxThink","target":"Value","type":"REFERENCES"},{"id":"c153715b-7597-42c9-b31d-1008fa61589b","source":"TimeboxThink","target":"731a9b4c-b228-415d-b44e-5dcca26f241d","type":"HAS_INVARIANT"},{"id":"9267ed28-9298-40c6-8ea8-b4803afa1073","source":"TimeboxThink","target":"6f292fb5-b8b5-4e71-b154-efa1e9b7c037","type":"HAS_INVARIANT"},{"id":"fe4fa446-4d1d-4799-a9b2-9545f46aa844","source":"TimeboxThink","target":"75d87004-4025-45d3-9acc-5a4f07b0e82b","type":"HAS_PRECONDITION"},{"id":"86db9743-2348-4953-8a6d-d6d57178d407","source":"TimeboxThink","target":"b1f38c1e-6dd4-446c-a785-fd2d78b3d551","type":"HAS_PRECONDITION"},{"id":"63413921-ee40-4e85-92dd-b292516e5c48","source":"TimeboxThink","target":"5c2a41e6-bb6e-4433-b29a-ba9ac057c96f","type":"HAS_POSTCONDITION"},{"id":"393cfadf-221d-4775-a487-d0f081a2dcf2","source":"Translate","target":"e38ff6e0-872e-4a63-a7ea-ebb84e174347","type":"IN_CATEGORY"},{"id":"7561f829-9017-4dc4-8e4a-b7e0353c634c","source":"Translate","target":"Reversibility","type":"REFERENCES"},{"id":"6eedf161-35dd-4435-840a-f577d2524309","source":"Translate","target":"Interpret","type":"REFERENCES"},{"id":"7279e4a8-ac13-46af-bd99-17c02eed6ec4","source":"Translate","target":"Datum","type":"ACCEPTS"},{"id":"3f40e7e4-f287-49d6-ac99-3e787c1e5789","source":"Translate","target":"Protocol","type":"REFERENCES"},{"id":"182a7334-dafc-4100-afec-ac01765f7d5e","source":"Translate","target":"8a1f2825-c7a2-4798-b93e-146192638379","type":"HAS_INVARIANT"},{"id":"df1cb783-f80a-4bca-beb6-fb251663b91c","source":"Translate","target":"680c3bbf-3c2f-4855-b9d3-2a7a5a2c3e02","type":"HAS_INVARIANT"},{"id":"b92a7baa-2306-4ae4-8d8e-d804739dc756","source":"Translate","target":"da6c34f6-add1-42c8-a150-061035b7e504","type":"HAS_PRECONDITION"},{"id":"d43a1861-c2e0-4e8b-a292-837ce45a3092","source":"Translate","target":"604d14b7-2c91-440b-8845-dad9860ea62f","type":"HAS_PRECONDITION"},{"id":"09b4a879-4c1c-4cd9-828d-cb9000c79e33","source":"Translate","target":"353fcf40-2fdb-4966-bbac-323e5d9cbe04","type":"HAS_POSTCONDITION"},{"id":"27bf8b4d-39f0-438c-81be-13727069986d","source":"Satisfice","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"eee64d3b-8e9e-4ce3-be32-a8ceb8b28671","source":"Satisfice","target":"OptimalStop","type":"REFERENCES"},{"id":"fe54de69-539a-4f39-a7b2-e2506d514e7e","source":"Satisfice","target":"Decision","type":"REFERENCES"},{"id":"d0b3e8e3-b836-44b3-8385-c3ccd8156184","source":"Satisfice","target":"Option","type":"REFERENCES"},{"id":"6b47b96f-0df3-49d8-aa05-74e89babdd40","source":"Satisfice","target":"96043368-f26c-467a-906f-6131f4dd5fe8","type":"HAS_INVARIANT"},{"id":"285eaff1-9de9-4870-a9e7-1c18d6c5e5a0","source":"Satisfice","target":"430deed0-ab43-4712-a934-74f96c43749d","type":"HAS_PRECONDITION"},{"id":"9ae75672-252c-481d-82b1-1ce6b16c9978","source":"Satisfice","target":"8354906e-2f41-48a1-84e0-12f0bab996dd","type":"HAS_POSTCONDITION"},{"id":"43db834e-598e-47a0-b0e9-01eb1093a416","source":"Hysteresis","target":"8f497759-ce27-442f-9c55-27f3c2ad7c49","type":"IN_CATEGORY"},{"id":"24c8e01f-5e36-476b-84ca-2a0e7ce89949","source":"Hysteresis","target":"State","type":"REFERENCES"},{"id":"7529df33-c04a-49f0-bb98-b5e6451596bf","source":"Hysteresis","target":"Dampen","type":"REFERENCES"},{"id":"31357e22-46b3-441b-81a9-86ea77edcaf9","source":"Hysteresis","target":"f78efdd3-c090-4679-928d-e9db64bd93b7","type":"HAS_INVARIANT"},{"id":"45b237e7-98aa-4cba-a8c9-9678f683e8a0","source":"StepBack","target":"e38ff6e0-872e-4a63-a7ea-ebb84e174347","type":"IN_CATEGORY"},{"id":"9179c6fe-2ca9-43d9-8829-75b19d07bfdf","source":"StepBack","target":"Reframe","type":"REFERENCES"},{"id":"718c5857-9fb8-4ed4-8079-12efadc6a3c3","source":"StepBack","target":"Problem","type":"REFERENCES"},{"id":"82788e27-38da-4eb0-8dd5-e543f386132f","source":"StepBack","target":"Think","type":"REFERENCES"},{"id":"b1f45ca5-a9f7-4510-9bcb-45725148d79a","source":"StepBack","target":"614036fe-21b8-416e-a1b8-294f30281f81","type":"HAS_INVARIANT"},{"id":"2f625304-5df6-4fbc-8c64-40013f233092","source":"StepBack","target":"afe69bc3-d104-4c0c-9cbc-1be76a823ded","type":"HAS_INVARIANT"},{"id":"6c8a04b1-7f23-4e98-8fda-4822c514fc3a","source":"StepBack","target":"0ceee3df-0432-4a1c-97f0-cd3a4efe7790","type":"HAS_INVARIANT"},{"id":"accd5665-3e5b-4b27-ac62-e49c2dbc7f60","source":"StepBack","target":"0b05cc82-261d-4bb2-8412-650f3281ccf9","type":"HAS_PRECONDITION"},{"id":"4ea28d43-a3a8-4d31-80fc-f5734b395799","source":"StepBack","target":"d74a08f8-04f8-432c-ab37-d1027d120627","type":"HAS_POSTCONDITION"},{"id":"9451ee90-76f5-48bb-8905-545674ac3246","source":"StepBack","target":"b47142f2-5ae3-44ce-8bf2-ab7665469a25","type":"HAS_POSTCONDITION"},{"id":"888077be-0f26-480e-a142-a837f31e9fe4","source":"Cyclic","target":"e5a36812-8586-4359-8f6a-7c5631923812","type":"IN_CATEGORY"},{"id":"7ffab74b-317f-4d32-afba-4618ee5508d1","source":"Cyclic","target":"Topology","type":"REFERENCES"},{"id":"18d78f50-5db8-4fd0-8495-edd664424972","source":"Cyclic","target":"Loop","type":"REFERENCES"},{"id":"4f73ff2f-8086-4672-ad9e-134cf5dd84b3","source":"Cyclic","target":"d2e1131f-b38b-4211-83b3-0107304646ea","type":"HAS_INVARIANT"},{"id":"e3a1d1ed-e7ae-4bd5-85e1-98444f10dc0d","source":"Cyclic","target":"2dbca1cb-30c7-480a-b5c4-41f5a52ffb7d","type":"HAS_INVARIANT"},{"id":"76bee50f-98ad-4e53-b324-290d0c484a5b","source":"Monitor","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"44163269-70a2-44c6-9bb5-2906ecd0dbfc","source":"Monitor","target":"State","type":"REFERENCES"},{"id":"ffa3f6b3-6c4e-4acf-a5f9-6cf4b6e17eb8","source":"Monitor","target":"Signal","type":"REFERENCES"},{"id":"ff65e6b5-3ea6-40c3-8697-bf58ff634984","source":"Monitor","target":"System","type":"REFERENCES"},{"id":"b3c71148-1fa5-497f-b2b7-01ac63177f02","source":"Monitor","target":"Loop","type":"COMPOSES_WITH"},{"id":"19da5be6-c3f2-4075-97f9-77ac8379693d","source":"Monitor","target":"Observe","type":"COMPOSES_WITH"},{"id":"7211c308-c3ce-4960-a1f3-1c27a9a90586","source":"Monitor","target":"Anomaly","type":"REFERENCES"},{"id":"cab4ae9b-66c4-414b-acb0-bab3867c2204","source":"Monitor","target":"6bcf6216-754a-4a7e-8f47-808d51ea65e5","type":"HAS_INVARIANT"},{"id":"998c3ff1-117a-42be-a5e8-4c4317234e77","source":"Monitor","target":"da714bbf-4065-4efe-b5f0-05d3d146dfa8","type":"HAS_INVARIANT"},{"id":"d88e21a4-9731-4bd2-aa85-4f04bfd142dd","source":"Resonate","target":"a3dffe73-5c16-41fe-be7c-5f1b04ac73f2","type":"IN_CATEGORY"},{"id":"723cfbf6-95b5-45f0-93a6-a99faecb0a47","source":"Resonate","target":"SpectralTune","type":"REFERENCES"},{"id":"511363ff-06e7-48e9-ad22-084820d2762d","source":"Resonate","target":"Signal","type":"REFERENCES"},{"id":"c3966673-af22-460c-84c1-1d8c9bb9ad5e","source":"Resonate","target":"Noise","type":"REFERENCES"},{"id":"a57f6430-03db-4d32-8898-3295d788406b","source":"Resonate","target":"Loop","type":"REFERENCES"},{"id":"89224df7-e6a7-4693-ae4d-7766fe0da6c6","source":"Resonate","target":"Decay","type":"REFERENCES"},{"id":"14e18805-d5fb-47da-8346-20a85f551294","source":"Resonate","target":"Dampen","type":"REFERENCES"},{"id":"eef1b0f7-83a9-46a7-b4c9-7e4923ce86bf","source":"Resonate","target":"8e07018e-1469-450c-9b89-eb724a87e1dd","type":"HAS_INVARIANT"},{"id":"ae3909b4-7e80-4c24-8660-4233bf747d91","source":"Resonate","target":"7fcfd24c-39e3-4896-b2ea-c1cafe1a5d42","type":"HAS_INVARIANT"},{"id":"3ab39103-c638-43d2-a2b6-9122873bf287","source":"Resonate","target":"56ffd905-f0c1-4fcf-b038-6e9861b00f2f","type":"HAS_PRECONDITION"},{"id":"0905b28b-bfb1-4eb6-8ae7-32a971e96311","source":"Resonate","target":"3d963b3f-a91b-47e2-b4a4-7c8cee911ddf","type":"HAS_PRECONDITION"},{"id":"676ca195-339c-4402-9759-f68d31cb72a6","source":"Resonate","target":"23b91e44-14bb-4f9d-a579-70062ecebb04","type":"HAS_POSTCONDITION"},{"id":"95e264e3-99f0-4947-9d4d-d3ec12c1a896","source":"SunkCostIgnore","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"c7c27e11-0e24-4aa7-8557-8530fc54510d","source":"SunkCostIgnore","target":"OpportunityCost","type":"REFERENCES"},{"id":"72dcd3cd-5dbd-4114-9cc6-41f32fc6b7fc","source":"SunkCostIgnore","target":"Decision","type":"REFERENCES"},{"id":"a1ad2588-c1ca-4ef2-bae1-4942ebcee447","source":"SunkCostIgnore","target":"Loop","type":"REFERENCES"},{"id":"33f7955a-b7bd-49c8-9f91-5bc64c5e8ab5","source":"SunkCostIgnore","target":"b36a6380-04a3-4d31-bd0f-548bae175e45","type":"HAS_INVARIANT"},{"id":"75057681-be62-43ae-9b44-1042ece1897b","source":"SunkCostIgnore","target":"7ef5a1bd-8dce-468c-9714-2d76b88a993b","type":"HAS_INVARIANT"},{"id":"83279147-3007-463e-b26c-e72eba5074d1","source":"SunkCostIgnore","target":"0ad61d4c-46e4-4cdb-b529-fd9cfaf9c06e","type":"HAS_PRECONDITION"},{"id":"681ba5c9-d64e-4bf6-96d3-684e26c6363f","source":"SunkCostIgnore","target":"ba2a2fd8-aad0-4ccd-bc1e-33b261b80fa6","type":"HAS_PRECONDITION"},{"id":"ab4ddd17-fd81-4e37-8ea1-95f874bc55b8","source":"SunkCostIgnore","target":"08f7ba8d-3343-4c5d-995d-89fe5323b280","type":"HAS_POSTCONDITION"},{"id":"f4e0dee8-c1b6-44cb-bef3-985b5696eed7","source":"Defer","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"2e192ac0-25b0-4f07-aa34-112f51767a42","source":"Defer","target":"Task","type":"REFERENCES"},{"id":"98e71952-f637-48b6-97cf-ff7b2561ed0d","source":"Defer","target":"State","type":"REFERENCES"},{"id":"53728488-56e6-4e84-b77a-e4cbf806097f","source":"Defer","target":"Prioritize","type":"REFERENCES"},{"id":"8465bb5c-4f45-421f-bb75-fc02070fb60b","source":"Defer","target":"Context","type":"REFERENCES"},{"id":"4bc20e40-aabd-4c18-ba35-63a9ff19a9d0","source":"Defer","target":"Decision","type":"REFERENCES"},{"id":"505d3649-20da-4c86-a63d-8b6042d1195c","source":"Defer","target":"0af81ff7-1efc-4c82-8f1b-6ae7cbafa8ac","type":"HAS_INVARIANT"},{"id":"83b9707b-7b99-4a98-8ae0-65d67311db16","source":"Defer","target":"2492df89-561f-4659-a26c-197b23ea5185","type":"HAS_INVARIANT"},{"id":"b8ce68b7-344f-4903-8d7f-28f984c95663","source":"Defer","target":"3a424a06-45a3-4b92-bcaa-58cbea96adba","type":"HAS_INVARIANT"},{"id":"82154693-e811-46fc-bbad-caaf923a601c","source":"Defer","target":"c4328bec-d540-4187-9db0-7e242493a6e4","type":"HAS_PRECONDITION"},{"id":"18901f10-6dde-4b41-a4d9-705782ffffff","source":"Defer","target":"9c752d4c-95a2-48d4-92ae-eeaefd745003","type":"HAS_POSTCONDITION"},{"id":"aab71d0f-4fce-4564-83dd-98f3f4b8b1d9","source":"Eliminate","target":"e38ff6e0-872e-4a63-a7ea-ebb84e174347","type":"IN_CATEGORY"},{"id":"6ebbdb4c-f852-4f30-8fff-edc2222c49e3","source":"Eliminate","target":"Prioritize","type":"REFERENCES"},{"id":"d669d08d-a3bd-416f-98a4-3e2140136a99","source":"Eliminate","target":"Option","type":"REFERENCES"},{"id":"327f5568-d0e0-40bd-8fff-1ff41adf7538","source":"Eliminate","target":"c55f1ac2-6a76-40d3-a349-6398e17d50ad","type":"HAS_INVARIANT"},{"id":"aa7286ef-9fad-4367-aa85-bea3b429bc71","source":"Eliminate","target":"c23e7b0b-69f8-4b96-8350-47e214216e27","type":"HAS_PRECONDITION"},{"id":"f5199a6b-3fed-4bce-a403-e4dd3dfb01e3","source":"Eliminate","target":"3bd04fe7-9147-4514-b971-acafb1a88296","type":"HAS_POSTCONDITION"},{"id":"ff5997a2-6362-4beb-9831-c45822924368","source":"ConstraintRelax","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"b0f58c64-5ffa-4391-8b06-ee7de7bfdff0","source":"ConstraintRelax","target":"Bubble","type":"REFERENCES"},{"id":"0744b538-fd43-45e3-af1d-062a8c1854e6","source":"ConstraintRelax","target":"Solution","type":"YIELDS"},{"id":"8e8d82f9-e9a9-46c2-b7a7-10b9ecaf251d","source":"ConstraintRelax","target":"Rank","type":"REFERENCES"},{"id":"b682a139-994e-4997-ba5f-e9a1db760bd5","source":"ConstraintRelax","target":"Check","type":"REFERENCES"},{"id":"b91751c7-d596-43f9-8ef5-30bc9e1057ef","source":"ConstraintRelax","target":"Constraint","type":"REFERENCES"},{"id":"3ab910c5-988e-4942-b499-fb626366d463","source":"ConstraintRelax","target":"e7b9d500-23ad-4313-8615-233d97df06eb","type":"HAS_INVARIANT"},{"id":"89208312-865e-4e5b-9e9d-8263565e897e","source":"Invert","target":"e38ff6e0-872e-4a63-a7ea-ebb84e174347","type":"IN_CATEGORY"},{"id":"4c8a6f51-328a-479e-bbf7-63ce3025e772","source":"Invert","target":"Reframe","type":"REFERENCES"},{"id":"cc1deb15-de5c-4569-bcc5-59328c8ced79","source":"Invert","target":"Problem","type":"REFERENCES"},{"id":"ee7f4471-cc0f-4365-a564-24b1518c7796","source":"Invert","target":"Solution","type":"ACCEPTS"},{"id":"150be45d-2119-4edd-9b1f-f567e20c03d6","source":"Invert","target":"State","type":"REFERENCES"},{"id":"fe8bf071-a9e5-4dbb-830b-24a387469a5e","source":"Invert","target":"18b5cbc8-497d-4c08-baac-0e3ef3734054","type":"HAS_INVARIANT"},{"id":"1efad7d8-b6c9-450a-9020-af9e774f73d1","source":"Invert","target":"3d2f5837-b6ac-4b5d-b5d0-7e0c2edb11fd","type":"HAS_INVARIANT"},{"id":"58c587dd-9556-41d0-a9c0-050966e00d27","source":"MechanisticDesignProposal","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"3746a739-a763-40fb-b119-d34418f2b2a6","source":"MechanisticDesignProposal","target":"Solution","type":"YIELDS"},{"id":"8bc200e2-a8e5-4197-9d40-837d09a4125c","source":"MechanisticDesignProposal","target":"System","type":"ACCEPTS"},{"id":"1dd35551-a192-4443-8a07-c57d6e709834","source":"MechanisticDesignProposal","target":"Problem","type":"ACCEPTS"},{"id":"e52729f0-f67c-40eb-8441-c5457cc6b537","source":"MechanisticDesignProposal","target":"fade2848-81e5-4c06-b31b-b72d984ac620","type":"HAS_INVARIANT"},{"id":"0fb91736-edbf-4f2d-9e5b-701773976d3f","source":"MechanisticDesignProposal","target":"0ca2775c-1294-4175-812a-9d69e4439fc1","type":"HAS_INVARIANT"},{"id":"f3375b66-6c4c-441a-a8ee-121787c43205","source":"MechanisticDesignProposal","target":"2b470a3d-4102-41cc-ab03-b2d5af1a3bd6","type":"HAS_INVARIANT"},{"id":"c27b4556-8649-45cf-9285-54098f268570","source":"MechanisticDesignProposal","target":"f3677c49-fe65-4cbe-aaaf-6e5f5bd07a8f","type":"HAS_INVARIANT"},{"id":"54861ed8-ac84-4852-886a-2fe94e67f5c3","source":"Optimize","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"614782ee-f44a-4224-8e37-fb94a63e090b","source":"Optimize","target":"Metric","type":"REFERENCES"},{"id":"979a6aeb-beb0-49ac-b3b9-b101d912eab5","source":"Optimize","target":"Solution","type":"ACCEPTS"},{"id":"b99b528a-16fc-4007-b0d5-e234d2280bf7","source":"Optimize","target":"Global","type":"REFERENCES"},{"id":"2015e8d0-b3e5-46cf-95b1-bc834885387f","source":"Optimize","target":"RegretMinimization","type":"RELATED_TO"},{"id":"a4585e8f-b0c1-4a97-bfd7-06cc3383be1b","source":"Optimize","target":"ParetoFront","type":"RELATED_TO"},{"id":"eda8a016-af3c-419c-b43a-5dd130c84f2a","source":"Optimize","target":"bee5882f-5e0b-49c7-9d8b-f40d4fd64e28","type":"HAS_INVARIANT"},{"id":"7400e365-4fce-49d9-837e-9aefd58e3cf9","source":"Optimize","target":"ab8eae2a-1182-4cdb-a7af-fdef1d1e3717","type":"HAS_INVARIANT"},{"id":"a3b62d09-fe47-421c-aa03-ae528c1d1095","source":"Optimize","target":"71e08c39-df55-49a6-b210-f2f4812cc139","type":"HAS_PRECONDITION"},{"id":"35a130bb-cd9e-4486-9641-7b5f65ca18de","source":"Optimize","target":"870ad20c-8248-47fd-aa63-38c6ebe61bf1","type":"HAS_PRECONDITION"},{"id":"30f78b75-8af9-43fe-a009-22a8968b0618","source":"Optimize","target":"9d09430b-5d44-47d0-bf85-52ed9f7b185b","type":"HAS_PRECONDITION"},{"id":"575f53b3-6690-44f8-9710-a413ccc579b7","source":"Optimize","target":"506e4154-526c-4988-8400-eef95d4391a0","type":"HAS_POSTCONDITION"},{"id":"95296522-45df-4e5d-a07b-8ddd07b01e8b","source":"Optimize","target":"196b0d42-e8cb-42a4-b411-2f22883c3edf","type":"HAS_POSTCONDITION"},{"id":"28745efb-d033-4da8-9d96-2c7bcb36d5d6","source":"OutputGuard","target":"579b02af-c094-442f-8ef9-67bcd86bd62f","type":"IN_CATEGORY"},{"id":"0b9ff86f-efc2-408d-9d1b-c5f964fff1cd","source":"OutputGuard","target":"Problem","type":"REFERENCES"},{"id":"4e1f847c-4b16-48ef-8ed1-98cace3cd31c","source":"OutputGuard","target":"Solution","type":"ACCEPTS"},{"id":"8608d411-4d7e-45f8-9a24-615545dc7d97","source":"OutputGuard","target":"Context","type":"REFERENCES"},{"id":"dbfa3020-f1fe-4da8-8f9a-2f94c41cf50a","source":"OutputGuard","target":"d67b6c42-3581-40e6-94e9-3140840728d9","type":"HAS_INVARIANT"},{"id":"b648be6e-f94b-4dde-8f58-17227353e6f9","source":"OutputGuard","target":"d781c6a6-abaa-4087-bdbd-9c4160f6c52d","type":"HAS_INVARIANT"},{"id":"b0c7a5e3-c8c2-44e5-95af-a8860f3c3154","source":"OutputGuard","target":"e1ba3b53-faa4-4652-9cf3-c808dbd99280","type":"HAS_PRECONDITION"},{"id":"bdf8b7c8-2ee8-48d3-b719-568ad6d9ea77","source":"OutputGuard","target":"cceb4a0c-4081-4992-9082-40beb91871ad","type":"HAS_PRECONDITION"},{"id":"a384bb0a-4eca-4d66-b9b9-1620c55972ed","source":"OutputGuard","target":"06b36aa9-05a4-4069-98bd-516478c90735","type":"HAS_POSTCONDITION"},{"id":"cfcc4309-2b50-4695-9eb0-053a5c1b76e7","source":"ProblemSpace","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"635c76c3-354c-44aa-9642-a982da96d961","source":"ProblemSpace","target":"Solution","type":"REFERENCES"},{"id":"01491b26-f8b8-4193-904b-ba8c62caf8f3","source":"ProblemSpace","target":"State","type":"REFERENCES"},{"id":"4c7d8e06-82bd-4703-b6cf-2ee5b0ce1a3e","source":"ProblemSpace","target":"Constraint","type":"REFERENCES"},{"id":"ced3f2d3-3759-4861-a482-0cdc9c86eb08","source":"ProblemSpace","target":"5e847278-3e2f-42f4-8ab7-03aec81382f4","type":"HAS_INVARIANT"},{"id":"f8c3fdc9-ce98-4d00-9e34-f33caa37baca","source":"ProblemSpace","target":"f9b50d52-acff-475b-b783-0c313d0735d2","type":"HAS_INVARIANT"},{"id":"9a547a92-ae73-4898-b34b-07eefba6f911","source":"Result","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"6db88d46-14f8-4c40-b291-9d763fa214a3","source":"Result","target":"Metric","type":"REFERENCES"},{"id":"fa020d68-dcb9-48fc-b39a-c7f6ca03e4d0","source":"Result","target":"Solution","type":"REFERENCES"},{"id":"4c154174-16d6-4e64-b2ea-7ab02cc2b0a5","source":"Result","target":"2160d0a9-fb00-498d-a944-439bf53070b4","type":"HAS_INVARIANT"},{"id":"3dd5a57d-51a0-42f6-a87c-30e58c5b10d8","source":"Result","target":"74ff8279-1c5a-45bf-b9e2-a2c26a990134","type":"HAS_INVARIANT"},{"id":"1529911b-5ef1-411c-b012-cb49a9449a64","source":"Result","target":"7dc9b6a4-2a34-40e4-86df-d977ff843ceb","type":"HAS_INVARIANT"},{"id":"3062b190-7c95-493c-a984-679a939bab79","source":"SemanticTabu","target":"90800e2d-25ad-47b4-9463-179cdb2d083f","type":"IN_CATEGORY"},{"id":"e745bf17-af96-41da-95b3-bf51cf9925c3","source":"SemanticTabu","target":"Solution","type":"REFERENCES"},{"id":"8a9b4887-e66d-4352-869c-eaa2a024266b","source":"SemanticTabu","target":"Trace","type":"REFERENCES"},{"id":"4fb2d1aa-850a-4f82-8721-a0ae4321baa2","source":"SemanticTabu","target":"Constraint","type":"REFERENCES"},{"id":"fa1fcbda-5020-4fe6-bb56-eb5aa7d52321","source":"SemanticTabu","target":"72950d6d-b7bc-49f0-b7c9-2b76b167f912","type":"HAS_INVARIANT"},{"id":"54f87a5d-8ffa-42d1-955b-1b946fee655a","source":"SemanticTabu","target":"a477531b-b2db-48dc-85eb-97337d287633","type":"HAS_INVARIANT"},{"id":"692d4273-43d6-462c-b715-ba0318ae46c3","source":"SemanticTabu","target":"cf229107-d261-48fa-9d20-b86bfc43d0b7","type":"HAS_PRECONDITION"},{"id":"71c3b129-7d0e-4545-93c6-30353f258123","source":"SemanticTabu","target":"5f2d73fd-f95b-4cfb-9501-7f07cee81ffe","type":"HAS_POSTCONDITION"},{"id":"282154ad-7dc1-49c7-bef0-e091d00efc53","source":"Solver","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"d25c680b-4711-4c8a-986d-f487fd42a71d","source":"Solver","target":"Task","type":"ACCEPTS"},{"id":"f7c41778-0d1e-48ec-adf3-4a5fdfe91e4a","source":"Solver","target":"Solution","type":"YIELDS"},{"id":"f77b9a83-c016-4121-9b46-9ec48c38f873","source":"Solver","target":"Protocol","type":"REFERENCES"},{"id":"89f0240b-7c4e-4993-ba2a-ee351fed7cee","source":"WhyClimb","target":"e38ff6e0-872e-4a63-a7ea-ebb84e174347","type":"IN_CATEGORY"},{"id":"830421c4-84e8-4685-a380-36c01ac63f30","source":"WhyClimb","target":"Problem","type":"REFERENCES"},{"id":"475c2ac9-281c-4d4c-a811-1e2d69746ab9","source":"WhyClimb","target":"Reframe","type":"REFERENCES"},{"id":"6fe5136e-61c9-49a4-b7a5-2c1d6fb69de2","source":"WhyClimb","target":"Condition","type":"REFERENCES"},{"id":"e95e6e81-f197-476d-ae53-d466fbe92bdc","source":"WhyClimb","target":"RecursiveRootCause","type":"REFERENCES"},{"id":"a1c20941-9953-4b12-9740-89ee47d477c8","source":"WhyClimb","target":"Solution","type":"REFERENCES"},{"id":"cece4d9d-7008-4492-8d75-47c48296e6c0","source":"WhyClimb","target":"4de7ecbf-f416-4ae6-89d5-e2f5447203aa","type":"HAS_INVARIANT"},{"id":"4beb258b-7ee2-4a60-acc8-d641e0e5db2a","source":"WhyClimb","target":"6f539084-4324-4de0-b83e-0753369d7d8e","type":"HAS_INVARIANT"},{"id":"a19fe07e-59cc-4595-82be-04e4c497ace5","source":"WhyClimb","target":"e8c86d47-d179-4d45-a352-40a67d892c42","type":"HAS_PRECONDITION"},{"id":"8f7ee396-ea03-4c45-9f41-b3f8d2cfbe61","source":"WhyClimb","target":"dbeecb47-562a-4b9c-b092-0def99318db3","type":"HAS_POSTCONDITION"},{"id":"bb8412df-6cc8-46fb-ac4d-b50a3a85a762","source":"Summarize","target":"e38ff6e0-872e-4a63-a7ea-ebb84e174347","type":"IN_CATEGORY"},{"id":"d2cc1cf6-26b9-40d5-995f-f9de5d4d9aaf","source":"Summarize","target":"Translate","type":"REFERENCES"},{"id":"d568a7f5-44ce-421d-bd3e-fbed8bb9e426","source":"Summarize","target":"Datum","type":"ACCEPTS"},{"id":"58fc2a60-3958-4ffd-b8c1-9273c9450b62","source":"Summarize","target":"Summary","type":"YIELDS"},{"id":"48c8c7c0-e7b1-4e1c-80be-32bed8e321cf","source":"Summarize","target":"Compress","type":"REFERENCES"},{"id":"3223c266-1351-4230-b62c-0d0a169a469f","source":"Summarize","target":"Value","type":"REFERENCES"},{"id":"4e469039-15c2-42bc-bf80-0a000785c4b7","source":"Summarize","target":"Artifact","type":"REFERENCES"},{"id":"87d1ac8f-2725-4581-98e1-c54991d9807a","source":"Summarize","target":"09cf4271-298e-4a63-afb3-13a3f2ba38f2","type":"HAS_INVARIANT"},{"id":"03ff37d7-ce66-4af0-8104-72087d267431","source":"Summarize","target":"9dd8be06-981b-4bc9-ba8b-eb8230c6a87e","type":"HAS_INVARIANT"},{"id":"c27a420f-9090-4d7e-a365-22979580aa38","source":"Summarize","target":"d0fbe4dd-e8ec-4029-8307-23fc746911c5","type":"HAS_INVARIANT"},{"id":"2c82dd00-c787-4092-86cb-e8630b65620d","source":"TranslationProxy","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"092e35d7-1da0-42f6-ab5a-1fcd76e87f03","source":"TranslationProxy","target":"Compare","type":"REFERENCES"},{"id":"cd40b7cd-5de8-424a-a24c-721ec4b984c2","source":"TranslationProxy","target":"OntologyHandshake","type":"REFERENCES"},{"id":"69a17018-2bd8-473d-99bb-12832b8f59dc","source":"TranslationProxy","target":"Translate","type":"REFERENCES"},{"id":"5344b46d-6998-4654-ba86-2a3a89122b98","source":"TranslationProxy","target":"Protocol","type":"REFERENCES"},{"id":"682eb5e0-d31f-465a-8e70-f56eee88c445","source":"TranslationProxy","target":"Message","type":"REFERENCES"},{"id":"4522992e-acdb-4431-84a4-8cbe1b58422d","source":"TranslationProxy","target":"90169665-097a-4363-b79a-e0c00121506d","type":"HAS_INVARIANT"},{"id":"6e96c306-44b4-4b2a-bfb7-48f375c2e8e5","source":"TranslationProxy","target":"bc7fa9fa-ca56-4711-97af-0af8d1bf5d65","type":"HAS_INVARIANT"},{"id":"5b2f6b64-c8cf-41d1-a45a-3ee53e6faff4","source":"TranslationProxy","target":"86600ee9-9224-4f52-9710-bd3f8f68d353","type":"HAS_PRECONDITION"},{"id":"0369f608-a620-4409-8f6e-30a4e6d8b5ca","source":"TranslationProxy","target":"169a5f31-c853-4b2c-af49-00fdaf4690e9","type":"HAS_PRECONDITION"},{"id":"d675f79d-ba9f-40a5-9dc6-323c635d7918","source":"TranslationProxy","target":"572ab8e1-6d72-4d80-8f71-fc659adcc48e","type":"HAS_POSTCONDITION"},{"id":"c441f5d1-f1eb-4647-95ad-a3ca41a5206b","source":"EbbFlowSync","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"a1f55a24-1c20-453e-bece-8c6830e8a407","source":"EbbFlowSync","target":"State","type":"REFERENCES"},{"id":"c4dbf955-cdfe-4bff-b8a9-9a1ef340b25a","source":"EbbFlowSync","target":"System","type":"REFERENCES"},{"id":"5ca55846-fefd-4e34-a21d-c5290247f2c4","source":"EbbFlowSync","target":"Global","type":"REFERENCES"},{"id":"8398ec57-bd69-4bd4-aa1c-f63bd898320c","source":"EbbFlowSync","target":"Transition","type":"REFERENCES"},{"id":"5c221c66-bbd1-4a0b-9e2a-cb227572720a","source":"EbbFlowSync","target":"Lock","type":"REFERENCES"},{"id":"65059381-6ce1-4f1b-b27d-d8a7d5fb85ff","source":"EbbFlowSync","target":"Hysteresis","type":"REFERENCES"},{"id":"74625cb9-ad66-4a22-a7ca-47c78729525f","source":"EbbFlowSync","target":"1f6f5b25-4dc0-4ff6-928f-2cde3c11b697","type":"HAS_INVARIANT"},{"id":"d7df1619-189f-45e3-b691-e2a8ee0819b1","source":"EbbFlowSync","target":"e08fce8f-f19e-451a-8778-66b11f7adcdf","type":"HAS_INVARIANT"},{"id":"4c4f3f8f-3a39-491c-8a03-71d17c31e1f1","source":"EbbFlowSync","target":"59b70e5a-6901-4b4a-993f-457ff4102f8b","type":"HAS_PRECONDITION"},{"id":"0c6fef0c-a94f-42d5-a13b-ba822391ee06","source":"EbbFlowSync","target":"b09916d1-d53c-4cd5-9460-e22a1ada8132","type":"HAS_POSTCONDITION"},{"id":"03e5da20-698f-4ba0-9d6b-80a876c5c30e","source":"Heartbeat","target":"e5a36812-8586-4359-8f6a-7c5631923812","type":"IN_CATEGORY"},{"id":"85fa4e29-7da4-4247-a7a3-6c63158fa9df","source":"Heartbeat","target":"Quorum","type":"COMPOSES_WITH"},{"id":"981603fe-a62f-4e7d-8b8a-e9faa6a218a3","source":"Heartbeat","target":"Signal","type":"ACCEPTS"},{"id":"1d73a13c-fc88-449b-b5f2-79b8baf18fb7","source":"Heartbeat","target":"Monitor","type":"REFERENCES"},{"id":"5e2857ff-04c6-47c2-ae6c-0f4ddaabcc80","source":"Heartbeat","target":"a48be017-d044-443f-8acf-a9271c5b3507","type":"HAS_INVARIANT"},{"id":"09e45249-26c6-4f09-8755-5a19c27426a7","source":"Heartbeat","target":"63a17e14-2fc9-457a-a6f9-a6fc7457d4cd","type":"HAS_INVARIANT"},{"id":"3fa84de5-c3ba-4239-abc9-192659d18437","source":"Heartbeat","target":"eea54974-1f54-4846-b4c0-51ee2dfbd7a8","type":"HAS_PRECONDITION"},{"id":"40fcb485-0b47-4435-be63-662240236fac","source":"Heartbeat","target":"4f60f072-01ff-4645-a6ec-6a661f341875","type":"HAS_PRECONDITION"},{"id":"baa50930-6810-49ad-af2e-0fb6842889c9","source":"Heartbeat","target":"ab972415-aa84-489e-92af-56cb187d52cf","type":"HAS_POSTCONDITION"},{"id":"6e493c4d-05f5-455d-898f-ebe98837a8ae","source":"RolloutWatch","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"6827ca56-b85c-461c-bc63-2c469208307b","source":"RolloutWatch","target":"State","type":"REFERENCES"},{"id":"d9f7cbb2-aeae-4b21-aa22-281e6fc760f6","source":"RolloutWatch","target":"System","type":"REFERENCES"},{"id":"67eb4225-6345-4199-a7b9-1e1761f1a25c","source":"RolloutWatch","target":"RolloutManifest","type":"ACCEPTS"},{"id":"83a90a0c-faef-4754-812f-11c1ea32d32b","source":"RolloutWatch","target":"Monitor","type":"REFERENCES"},{"id":"0aa8fda2-d58b-483b-9ec2-e2965cca0d8c","source":"RolloutWatch","target":"Solution","type":"REFERENCES"},{"id":"0f73ac12-a562-44e3-8116-ff77b1383640","source":"RolloutWatch","target":"Observe","type":"COMPOSES_WITH"},{"id":"5b5487f2-d867-4a74-9ebf-0875f06c8f2d","source":"RolloutWatch","target":"MonitorReport","type":"YIELDS"},{"id":"0ed1da72-b1ee-4b6a-88f6-02d253dc8546","source":"RolloutWatch","target":"Loop","type":"COMPOSES_WITH"},{"id":"e24867db-7363-4c12-bad6-7967f351b918","source":"RolloutWatch","target":"SpotAudit","type":"RELATED_TO"},{"id":"17ffda95-f96e-45ce-ac40-b614ec5861c3","source":"RolloutWatch","target":"a56322a6-b4eb-4b53-b412-79517d37ed0d","type":"HAS_INVARIANT"},{"id":"92a8f195-b5d8-4921-b6c1-301ffffdc841","source":"RolloutWatch","target":"d56887bd-1bcc-4945-8657-5ab0bd2e433c","type":"HAS_INVARIANT"},{"id":"08508213-23a4-46d8-8957-04265d959ac5","source":"RolloutWatch","target":"4dc89d6a-a4b8-4add-b9f8-bc12547c6d89","type":"HAS_PRECONDITION"},{"id":"55ab467e-8430-46b8-9e69-2cd259b3136a","source":"RolloutWatch","target":"49c40637-bed3-4875-9810-bb9428dbbb8f","type":"HAS_PRECONDITION"},{"id":"4db44408-d43e-43df-ba03-8cc4120d0379","source":"RolloutWatch","target":"f632664d-4dff-49c9-91b0-c1f2911890b0","type":"HAS_POSTCONDITION"},{"id":"f9e8db32-37fd-4c6f-a7dc-54f609930768","source":"Yield","target":"a3dffe73-5c16-41fe-be7c-5f1b04ac73f2","type":"IN_CATEGORY"},{"id":"8bb27938-4290-4b7b-a480-47fcc768596d","source":"Yield","target":"Overlap","type":"REFERENCES"},{"id":"8c758913-4333-438c-92e1-985738a0dea9","source":"Yield","target":"Defer","type":"REFERENCES"},{"id":"619e498b-21b6-4b40-a910-7f8627ee437d","source":"Yield","target":"Backoff","type":"REFERENCES"},{"id":"1dbb2185-9a5a-4b74-b129-ede3dd8dcc5f","source":"Yield","target":"System","type":"REFERENCES"},{"id":"249b42b6-7107-41b1-a9b9-2e8620d31b65","source":"Yield","target":"ebf9875c-52db-4737-961f-ab6d04794a0b","type":"HAS_INVARIANT"},{"id":"64ab12bb-c087-47fc-9f96-a9289cd98200","source":"MetricDissolution","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"fa1b991b-c5ce-4107-aa4b-22ae6f201b1d","source":"MetricDissolution","target":"Variable","type":"REFERENCES"},{"id":"e153a82e-3fbe-4769-8feb-c5354fede39f","source":"MetricDissolution","target":"Invert","type":"REFERENCES"},{"id":"eb8a50b1-7ba7-43af-9ad2-2b6213d5042f","source":"MetricDissolution","target":"Problem","type":"REFERENCES"},{"id":"dd8a65d6-cf08-4f5e-968e-b262bfafcf04","source":"MetricDissolution","target":"Eliminate","type":"REFERENCES"},{"id":"df8b3bab-3c36-4afe-9855-2d3f382af317","source":"MetricDissolution","target":"3859fee0-5320-4663-97b6-bd4142ccb83e","type":"HAS_INVARIANT"},{"id":"71063796-0c72-4081-83be-94e53e2eb573","source":"MetricDissolution","target":"c8cfe497-abfb-49ba-aef3-08d44dc9cfe8","type":"HAS_INVARIANT"},{"id":"ceb684a2-7e9d-452c-a0b3-f79f8a1c6a45","source":"MetricDissolution","target":"df850811-d9ca-4e17-a219-9c53c095b993","type":"HAS_PRECONDITION"},{"id":"31fa395f-2b49-4788-80c0-e996179389c2","source":"MetricDissolution","target":"babf5660-cc43-44cd-a036-a19d3d5d6880","type":"HAS_POSTCONDITION"},{"id":"f23980e2-d166-436e-8434-36985c10650f","source":"LateralOptimization","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"2c4a6b3d-0925-439a-9e01-454ef7107512","source":"LateralOptimization","target":"System","type":"REFERENCES"},{"id":"bede6cec-e641-48a4-ba7f-f7c54b2b6ad3","source":"LateralOptimization","target":"Think","type":"REFERENCES"},{"id":"63dc5839-8cb2-4ffe-8bf9-61038a142a75","source":"LateralOptimization","target":"Global","type":"REFERENCES"},{"id":"60f75c98-3c61-4165-906f-a444fdda8f63","source":"LateralOptimization","target":"Optimize","type":"COMPOSES_WITH"},{"id":"70f2bbec-3358-4ec5-a59f-ae07acaec2d6","source":"LateralOptimization","target":"Creative","type":"REFERENCES"},{"id":"329fa2d1-b328-4176-863f-56d8f5f18a65","source":"LateralOptimization","target":"Reframe","type":"COMPOSES_WITH"},{"id":"ba379466-c11a-4e1d-bc0a-cd1984782767","source":"LateralOptimization","target":"Translate","type":"COMPOSES_WITH"},{"id":"79c46b39-44e3-47ca-8c36-9dd08b58af4a","source":"LateralOptimization","target":"Solution","type":"REFERENCES"},{"id":"9bf2ff8d-22ac-4daa-813c-f1b53999cf9f","source":"LateralOptimization","target":"bc181d23-3e2e-47db-8b05-9b5a1d7d12f1","type":"HAS_INVARIANT"},{"id":"0929639f-0f0c-40a3-8456-76c4102cfa6e","source":"LateralOptimization","target":"e7b9d500-23ad-4313-8615-233d97df06eb","type":"HAS_INVARIANT"},{"id":"922983e1-0475-4046-884b-62de8c3dae01","source":"LateralOptimization","target":"72d3694e-edff-4779-a1c3-b42e37dd2fe2","type":"HAS_PRECONDITION"},{"id":"43e0e474-e892-45bc-bb24-050a8fb4176d","source":"LateralOptimization","target":"8744c1bc-6202-417f-9b5d-fa6338f04ba8","type":"HAS_PRECONDITION"},{"id":"ebc9a48a-fdbd-4599-b3b8-893228061b4e","source":"LateralOptimization","target":"9a8f3e96-ae6f-49e6-b93f-29fcd80a7585","type":"HAS_POSTCONDITION"},{"id":"4e8718fd-22fe-461c-ab63-c201a074feb8","source":"LateralOptimization","target":"b4ff2f5d-c681-4787-ae21-09cc7d12dc75","type":"HAS_POSTCONDITION"},{"id":"002df6aa-f32a-4db5-989d-d3a3f5d998ff","source":"FailClosed","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"336043cd-b7eb-4dbb-ac1c-9dce30057e96","source":"FailClosed","target":"OutputGuard","type":"REFERENCES"},{"id":"39b33c0c-eaac-45c8-bdb8-dc86eac2ed0f","source":"FailClosed","target":"System","type":"REFERENCES"},{"id":"5f6f472b-e070-4688-817a-7b5fe151f3d1","source":"FailClosed","target":"CircuitBreaker","type":"REFERENCES"},{"id":"a1e9ba9f-9abb-4bd9-8f5d-ae55de222d6b","source":"FailClosed","target":"60d170ab-3af6-4b01-a06f-345add6e3b3c","type":"HAS_INVARIANT"},{"id":"ff149a6c-ebdb-42f1-af5f-a34e620d52d2","source":"FailClosed","target":"305bf190-6b98-4950-9235-00588fc18881","type":"HAS_INVARIANT"},{"id":"76a47cef-c001-473d-8379-8e5fae2ee743","source":"FailClosed","target":"954b4688-cd68-48fe-a912-be8c0f94229d","type":"HAS_PRECONDITION"},{"id":"c2f55746-ecb2-4b02-a8ca-406c314822ad","source":"FailClosed","target":"fc4c1dc0-d352-46ed-8796-0fbe08a6b67f","type":"HAS_POSTCONDITION"},{"id":"0ed9bcdd-e63f-42de-9976-e43602eba8cb","source":"Feedback","target":"8f497759-ce27-442f-9c55-27f3c2ad7c49","type":"IN_CATEGORY"},{"id":"d95792cd-fe6e-441d-be8f-1da8dcc62152","source":"Feedback","target":"Result","type":"REFERENCES"},{"id":"db8db065-d8b6-4b92-9397-c9d245a03bb7","source":"Feedback","target":"Metric","type":"REFERENCES"},{"id":"c5cf7580-e9ca-48dc-8f62-424711f58997","source":"Feedback","target":"Signal","type":"COMPOSES_WITH"},{"id":"94efc565-4766-4353-9a9d-1f40e8758b5c","source":"Feedback","target":"Incongruity","type":"REFERENCES"},{"id":"33107838-db38-41b8-ac80-db1acc0d2699","source":"Feedback","target":"2e65db5b-adf9-435b-ab37-80d725c6b656","type":"HAS_INVARIANT"},{"id":"e5550165-71d2-401c-8746-4f2b5aee2e3f","source":"Feedback","target":"927bc7ec-c3fe-4c7a-b071-dbef2a41aa3b","type":"HAS_INVARIANT"},{"id":"6bdecf4f-73fa-4c74-aa8c-23a3748a13de","source":"Feedback","target":"5ad8f176-1429-4a05-89e7-2cdc4555540f","type":"HAS_INVARIANT"},{"id":"8f816390-fb42-44be-ac40-c6da9123589c","source":"Goal","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"5269b513-1ccf-4ea8-a3e5-c9186fe5e610","source":"Goal","target":"Result","type":"REFERENCES"},{"id":"9e3034bb-2e33-4d3c-95d0-560ac7469c70","source":"Goal","target":"Work","type":"REFERENCES"},{"id":"7496a5b3-96fc-4e11-9733-6e96a8acd7bd","source":"Goal","target":"25cb8cba-315a-4827-b9c8-7fa259f2f527","type":"HAS_INVARIANT"},{"id":"ebb85038-1999-4f9f-ac4e-d0bd6df234bc","source":"Goal","target":"a797e92e-ceb8-4cd9-8e91-14983acfa6da","type":"HAS_INVARIANT"},{"id":"f034d813-44c3-43b3-a3e3-3f1cbfa3fc6a","source":"Bid","target":"a3dffe73-5c16-41fe-be7c-5f1b04ac73f2","type":"IN_CATEGORY"},{"id":"05ed3b2b-0a4c-486c-b2af-27a46be8a943","source":"Bid","target":"Task","type":"REFERENCES"},{"id":"28b9f94c-e6c6-40c0-814f-66058de9b41d","source":"Bid","target":"ComputeBudget","type":"REFERENCES"},{"id":"9c218164-d86c-436a-b479-a3d764ec55c1","source":"Bid","target":"Solver","type":"REFERENCES"},{"id":"a4712e7d-470d-41d3-a70f-16c8d857093e","source":"Bid","target":"Value","type":"REFERENCES"},{"id":"001f135d-066e-4d90-8c49-65ecde83d4a0","source":"Bid","target":"Budget","type":"REFERENCES"},{"id":"eb636f7d-aeaa-4773-ada6-d274352f4b5e","source":"Bid","target":"Artifact","type":"REFERENCES"},{"id":"2bef943f-796c-4f66-9991-a5aa676499cd","source":"Bid","target":"f48e6072-8529-4e5f-8b94-967458d93192","type":"HAS_INVARIANT"},{"id":"82148efe-65fc-45e8-bd6a-5ccbefc174e3","source":"Bid","target":"9d40efb1-8393-4bb2-9c7a-0a60a55746a1","type":"HAS_INVARIANT"},{"id":"8e66400d-74b8-459e-89ef-176bdb81480b","source":"Bid","target":"792604e9-bfe7-4c9e-89fd-a68968b730c4","type":"HAS_INVARIANT"},{"id":"c172d080-3884-4829-9ec4-aaeba7611753","source":"SolverManifest","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"83b67e81-6091-4b23-b25b-edd048ae4581","source":"SolverManifest","target":"Solver","type":"REFERENCES"},{"id":"1fe730e7-086d-4077-9e18-2571aefafef9","source":"SolverManifest","target":"Constraint","type":"REFERENCES"},{"id":"6f6a9d95-757e-49ed-9215-d39d8df2edc8","source":"SolverManifest","target":"484007b2-16bb-4de7-8002-5615c8e6afd5","type":"HAS_INVARIANT"},{"id":"70cd79c0-bef2-412a-aa57-172c5a0b26b2","source":"SolverManifest","target":"0f60af8c-596b-4d4a-8d1e-f76b29fe66fe","type":"HAS_INVARIANT"},{"id":"39b53391-2b04-4e5e-8d11-e3f17b2367e7","source":"SolverManifest","target":"e8bd51bf-fd98-4cd5-9ca5-ddd7f06e08d0","type":"HAS_INVARIANT"},{"id":"086d6c66-8b9a-4066-8a6a-f5a029ccbc4a","source":"SolverManifest","target":"de7ddd75-5c5d-40b0-8a44-5f23a0c69bf7","type":"HAS_INVARIANT"},{"id":"625d8f21-a29b-4c36-a6da-3c1cf884b915","source":"SolverManifest","target":"059739b2-9cc4-47fd-a359-9539f51146da","type":"HAS_INVARIANT"},{"id":"4337323f-b9e2-4267-9253-8917ecff9075","source":"QuorumPulse","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"de157ee9-7f40-4967-a3e8-7d4837d1a013","source":"QuorumPulse","target":"Quorum","type":"REFERENCES"},{"id":"6dd22dab-fc21-4bc0-ab08-6f5adb9f11a9","source":"QuorumPulse","target":"Signal","type":"REFERENCES"},{"id":"9182a999-44e7-4bef-9f69-91e815921d0d","source":"QuorumPulse","target":"Heartbeat","type":"REFERENCES"},{"id":"a9cde08e-fbd3-45df-a204-c792e9229521","source":"QuorumPulse","target":"State","type":"REFERENCES"},{"id":"269c7eaa-69f1-477c-803b-b0e015682ef0","source":"QuorumPulse","target":"5574f74f-2f07-4cf8-923d-4566afb3043d","type":"HAS_INVARIANT"},{"id":"48e89d44-b6b9-495c-9104-aa30b634a2fd","source":"QuorumPulse","target":"9c1d871a-d8a8-4dd9-a6a1-706ad8aaf992","type":"HAS_INVARIANT"},{"id":"83f0a283-f2af-42a7-b8c8-e92ede8c9ebd","source":"QuorumPulse","target":"9fa7ccb5-0a2f-4e4e-ac67-dc01bfa7829a","type":"HAS_INVARIANT"},{"id":"d63ef016-77a8-4592-9bdd-1273d47918c8","source":"QuorumPulse","target":"395b1aab-daf7-41b8-9992-67e125b3724c","type":"HAS_PRECONDITION"},{"id":"dbde6b55-0353-4085-b103-9cddd1178e29","source":"QuorumPulse","target":"fb19d28e-0481-42a4-bfd7-411769c3642f","type":"HAS_POSTCONDITION"},{"id":"897560da-13dc-4412-9b39-9492793a69c9","source":"Exception","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"3e1f2912-ddff-45a0-8e2b-85a3ea4a5229","source":"Exception","target":"State","type":"REFERENCES"},{"id":"5e618f0a-aebf-4daf-998c-512dd49ae94e","source":"Exception","target":"CircuitBreaker","type":"REFERENCES"},{"id":"9347a079-2eaa-4387-856e-55e71b51a055","source":"Exception","target":"FailClosed","type":"REFERENCES"},{"id":"55203916-ffea-4bcd-b035-be541be35ef4","source":"ThreeLevelCollision","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"b44ad4ef-8de4-4a1f-89bb-bf03d9046522","source":"ThreeLevelCollision","target":"Identity","type":"REFERENCES"},{"id":"2619583e-2a4a-4b87-8209-ef8a04447e21","source":"ThreeLevelCollision","target":"FailClosed","type":"REFERENCES"},{"id":"3be090f2-3c83-4382-bcc3-03d95c646ddc","source":"ThreeLevelCollision","target":"efc5fc47-4262-4215-a986-590554b8bac4","type":"HAS_INVARIANT"},{"id":"18048d13-42c4-461b-8eee-12f3831106be","source":"ThreeLevelCollision","target":"308569c9-32e0-4c9a-8e5a-435801e44b59","type":"HAS_INVARIANT"},{"id":"b37dacfa-6e2e-4b8a-9a1b-37b6f8480614","source":"ThreeLevelCollision","target":"c475273c-bb45-4b06-981c-0b5ee6068c2d","type":"HAS_PRECONDITION"},{"id":"f09ae4a1-301c-4c0b-8f2a-279cae842d2a","source":"ThreeLevelCollision","target":"2f3b5c41-2345-48e6-b229-a14eabb5fc59","type":"HAS_POSTCONDITION"},{"id":"e23c50f9-90ed-4180-970f-4900a8162557","source":"ThreeLevelCollision","target":"edeffde1-9f7f-4bc6-8f35-1a7f613a4c93","type":"HAS_POSTCONDITION"},{"id":"60114647-9568-45a5-9d44-f99d8450769c","source":"FeedbackSignal","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"a7db1240-205d-431a-b2ea-7fcfc6b4474c","source":"FeedbackSignal","target":"Task","type":"REFERENCES"},{"id":"32812fbd-c946-481d-a95e-a0f38f5e58fa","source":"FeedbackSignal","target":"Feedback","type":"REFERENCES"},{"id":"2b4edab8-e529-4109-a592-f23e2f6a69fe","source":"FeedbackSignal","target":"Solution","type":"REFERENCES"},{"id":"e6edd4e4-2b3b-47ca-a48d-3c23e8fb0e20","source":"FeedbackSignal","target":"eac9d28c-50d6-4639-ab12-9639641f5ee5","type":"HAS_INVARIANT"},{"id":"32b07711-605e-450c-b33e-ade02e930ae2","source":"FeedbackSignal","target":"5b4c8cbb-41e2-4d0b-819e-6617e9046ad8","type":"HAS_INVARIANT"},{"id":"18b7c19f-0e8e-4543-9d16-d2a59b5f7c7c","source":"StructuralCoaching","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"901a9edf-0f3f-45d7-86fe-8c8f6b98c676","source":"StructuralCoaching","target":"Creative","type":"REFERENCES"},{"id":"741419c4-f391-4c87-a389-7db53f33ab97","source":"StructuralCoaching","target":"Invert","type":"REFERENCES"},{"id":"8588db26-ff00-495e-813a-403d7beffe9f","source":"StructuralCoaching","target":"Feedback","type":"REFERENCES"},{"id":"e0682823-604c-4b4c-9d99-599ef99cc540","source":"StructuralCoaching","target":"Critique","type":"REFERENCES"},{"id":"1e03f975-8b75-4f85-bcce-03b81b89429e","source":"StructuralCoaching","target":"771fef42-2a79-4ec1-a39e-cbb09b13eb12","type":"HAS_INVARIANT"},{"id":"acf9beaf-6c41-418e-ba9b-4df34fe48829","source":"StructuralCoaching","target":"d5838399-8633-428b-9bbb-8fd7596ad759","type":"HAS_INVARIANT"},{"id":"dc94a78e-7b0f-4a86-8e0e-5cc28f4d1e4f","source":"StructuralCoaching","target":"31b34d30-6066-45c8-8b1b-76477f0b582a","type":"HAS_PRECONDITION"},{"id":"81763c96-ca4c-4977-bdcf-880f8252dc8b","source":"StructuralCoaching","target":"afd1de94-86eb-4854-8b5d-9bf61d198aad","type":"HAS_POSTCONDITION"},{"id":"fb0e5a0d-3087-4a3a-b163-f8d4b0a21ff7","source":"Agent","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"7cc693f4-090a-4739-b01e-3fb6f88aefce","source":"Agent","target":"Trace","type":"REFERENCES"},{"id":"501b9ada-e7b5-4276-9769-19e09d2b7fcc","source":"Agent","target":"State","type":"REFERENCES"},{"id":"e8eabcf2-a5be-4f4a-bbc2-3539ce36d7bd","source":"Agent","target":"Metric","type":"REFERENCES"},{"id":"aec2822c-2f83-4322-9417-7349755f08f3","source":"Agent","target":"Act","type":"COMPOSES_WITH"},{"id":"d5683671-6995-4b77-bc22-cad63575637b","source":"Agent","target":"Think","type":"COMPOSES_WITH"},{"id":"85562a20-3e74-4210-a3a8-31f00637a97e","source":"Agent","target":"Actor","type":"REFERENCES"},{"id":"1568f87b-49d7-4aa0-a92a-7d1332c060c7","source":"Agent","target":"Loop","type":"REFERENCES"},{"id":"66e2a33c-0dd5-4aeb-99cd-ec2eddb89901","source":"Agent","target":"Identity","type":"REFERENCES"},{"id":"7639a618-81a4-48c8-aeb3-7a0163e3262e","source":"Agent","target":"Observe","type":"COMPOSES_WITH"},{"id":"e945b210-b000-436b-9353-6341f60e832c","source":"Agent","target":"Goal","type":"REFERENCES"},{"id":"ad00ef4f-d7f2-4fcb-baad-633fe7f54b48","source":"Agent","target":"513a349a-75a8-4e2d-8380-deb1080de278","type":"HAS_INVARIANT"},{"id":"7a7b117f-8790-43a4-9902-b173b28c9985","source":"Agent","target":"97265fec-c197-4dd7-a6ae-042f86e98baa","type":"HAS_INVARIANT"},{"id":"54e3885d-b262-46a7-a6f2-8b70be6d73aa","source":"Agent","target":"9836792d-a390-4d33-a264-0a1ac83d93ff","type":"HAS_INVARIANT"},{"id":"aab540e1-a93e-420a-9f26-005e067de889","source":"Agent","target":"2b38be2c-2c60-4012-a8b4-e9b9e509d3fa","type":"HAS_PRECONDITION"},{"id":"65ca6621-48ed-400d-a3b2-8a09c363f218","source":"Agent","target":"c70cfa12-6438-449d-936b-4ffb3a2d826c","type":"HAS_PRECONDITION"},{"id":"d6e58b27-18d8-4829-bd47-78f034d06364","source":"Agent","target":"b7db276f-feb8-4c70-9057-a1a683e185c1","type":"HAS_PRECONDITION"},{"id":"59170776-131c-4183-8faf-b7967a0b6ec4","source":"Agent","target":"548106d4-d8a6-4d9f-a6c1-a21b1be1ade8","type":"HAS_POSTCONDITION"},{"id":"c78bd451-8b95-42f2-9364-ca3a641cddc5","source":"Agent","target":"3af4a626-ec05-4b03-9116-4b13907334ab","type":"HAS_POSTCONDITION"},{"id":"1fbf449b-b590-4e9b-932e-a032b0056040","source":"Plan","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"c92d8202-b745-4618-a757-fe7ed8983917","source":"Plan","target":"Sequence","type":"REFERENCES"},{"id":"3b7f7e03-2626-4c50-9189-ae87f040a86c","source":"Plan","target":"State","type":"REFERENCES"},{"id":"f2531535-bdd1-4567-8b12-1c56740079e1","source":"Plan","target":"System","type":"REFERENCES"},{"id":"8b55d778-0b95-49eb-82de-0505025b54f2","source":"Plan","target":"Step","type":"REFERENCES"},{"id":"3802f5ff-0e83-433d-832e-f8a79f6ac0c3","source":"Plan","target":"Artifact","type":"REFERENCES"},{"id":"c37ebe7d-af3d-481b-aeb4-f7b68f52c209","source":"Plan","target":"Goal","type":"REFERENCES"},{"id":"7df06752-574b-4ed7-84be-e8588bc41ad7","source":"Plan","target":"408c944f-74c7-4f2e-87bb-30a86ff21029","type":"HAS_INVARIANT"},{"id":"5efb6887-cfc7-44d4-a303-cd10ddba7c6a","source":"Plan","target":"52b91fe5-f87b-427a-ab76-d1e6dfdd3290","type":"HAS_INVARIANT"},{"id":"356b3f0a-877d-4994-9eef-a39d5fd16609","source":"LocalizedLearning","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"2f1d5c29-7a8c-43e9-9094-8a100b509cee","source":"LocalizedLearning","target":"SolverManifest","type":"REFERENCES"},{"id":"42f43fe1-0910-44a8-a45e-4309ddeca3e1","source":"LocalizedLearning","target":"Act","type":"REFERENCES"},{"id":"56925fd9-598d-4dd0-bc7a-359e5095de73","source":"LocalizedLearning","target":"FeedbackSignal","type":"ACCEPTS"},{"id":"72c75461-470e-4a7f-8a01-44d57dd2d7e2","source":"LocalizedLearning","target":"3067047a-4620-4ccc-8d0c-4e98d9bc4205","type":"HAS_INVARIANT"},{"id":"e859d430-4f80-407c-93d6-ea9d88eac7e2","source":"LocalizedLearning","target":"15f8b29d-dbed-441d-bed0-d9a03cbafff4","type":"HAS_INVARIANT"},{"id":"b2b920dc-f87d-42be-90ca-9473040e9b1a","source":"LocalizedLearning","target":"c6b04213-daa9-4660-bec0-28fea4f3cc71","type":"HAS_INVARIANT"},{"id":"0523c5a9-137f-4c3c-a5ac-fdf245514b76","source":"AgentSandbox","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"3facd9d5-9ac0-4c4c-ae9f-4053ec4e0a18","source":"AgentSandbox","target":"Sandbox","type":"REFERENCES"},{"id":"ea349ee9-252d-4643-b2f1-8e051f1633e7","source":"AgentSandbox","target":"OutputGuard","type":"COMPOSES_WITH"},{"id":"f4bbef54-d7cf-4973-ba57-1d9acc1ee619","source":"AgentSandbox","target":"InputGuard","type":"COMPOSES_WITH"},{"id":"6f32296e-2369-42f5-8abf-113c91530e1c","source":"AgentSandbox","target":"Context","type":"REFERENCES"},{"id":"8551fe59-380f-4d51-8abb-d97245cbd0a3","source":"AgentSandbox","target":"Audit","type":"REFERENCES"},{"id":"ab708050-c83e-4f98-8c75-d5be89ff7f59","source":"AgentSandbox","target":"Agent","type":"REFERENCES"},{"id":"1f06631e-3c38-4e11-8ff8-28097ce521fc","source":"AgentSandbox","target":"Solution","type":"RELATED_TO"},{"id":"03eb3f2d-fac0-41cb-bdab-b4834bcb977a","source":"AgentSandbox","target":"Task","type":"RELATED_TO"},{"id":"f1631a08-8c54-40fb-91bb-cd81eb937a3f","source":"AgentSandbox","target":"1827a61e-ab1f-4ec4-944a-10b82e377f3f","type":"HAS_INVARIANT"},{"id":"f2089878-ce4d-4be7-a741-eb294ec58a35","source":"AgentSandbox","target":"49845e00-d0bf-4af7-bcb6-87f29d06b620","type":"HAS_INVARIANT"},{"id":"ee68faf3-8503-4eb1-8dbb-8a142d0b4aa7","source":"AgentSandbox","target":"dd42a9d4-03f9-46c6-98aa-5e3254baee1d","type":"HAS_PRECONDITION"},{"id":"43563194-50bd-42d6-86b6-7190ef36a068","source":"AgentSandbox","target":"5fe94896-11b0-4eb2-b6ce-52dbe3d08e17","type":"HAS_PRECONDITION"},{"id":"b18edc57-632b-4d79-9187-cda9d0ff81b2","source":"AgentSandbox","target":"13c8e1ce-6419-414e-9ee4-e9992b5e9259","type":"HAS_POSTCONDITION"},{"id":"e7da1f1b-8df5-4a34-86fa-a38d7fb0a6aa","source":"AnalogyBridge","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"808c090a-e820-4d3c-bab6-ba8b06ed31c9","source":"AnalogyBridge","target":"Problem","type":"REFERENCES"},{"id":"4fd97a6a-b981-4109-a277-2dcb1b7904c8","source":"AnalogyBridge","target":"Solution","type":"REFERENCES"},{"id":"6d90a3d8-b4a7-4865-96c3-228ef4028e9d","source":"AnalogyBridge","target":"Agent","type":"REFERENCES"},{"id":"a9654e5b-faf5-4406-92bf-8d4ea2b0ae7c","source":"AnalogyBridge","target":"a2cb3da1-67cf-4381-9836-77a944aa4a57","type":"HAS_INVARIANT"},{"id":"5f64bf44-7fda-41be-b614-2ed9e3ad9719","source":"AnalogyBridge","target":"dd4592b0-b0da-41eb-b6b4-16cdc89a6e3c","type":"HAS_INVARIANT"},{"id":"d1c6d670-2574-4662-b545-dae5de7fea5f","source":"AnalogyBridge","target":"4914a32a-5738-49ed-ad34-88621f2bb8a4","type":"HAS_PRECONDITION"},{"id":"61fe1d72-3369-46d6-88b6-24da531cdc0a","source":"AnalogyBridge","target":"da135540-899b-497a-a3bd-8ac9f0ad9349","type":"HAS_POSTCONDITION"},{"id":"f39dac99-af91-4536-a154-d9a459b86b4d","source":"AntifragileInversion","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"f34e3384-7950-4492-a38d-023c9a5dc6e4","source":"AntifragileInversion","target":"System","type":"REFERENCES"},{"id":"171a9e3f-46e6-4436-8738-192eab22dd76","source":"AntifragileInversion","target":"Agent","type":"REFERENCES"},{"id":"cbd99a67-8138-4083-835f-73cedb51d9c2","source":"AntifragileInversion","target":"Reframe","type":"REFERENCES"},{"id":"553205c3-bc30-4a45-8a34-87ca3c4a1fdb","source":"AntifragileInversion","target":"Variable","type":"REFERENCES"},{"id":"42ddee53-0bd6-45ab-9fc0-f84b606b4acb","source":"AntifragileInversion","target":"Vector","type":"REFERENCES"},{"id":"3caef896-9386-4b02-940b-5a61fc1a6cec","source":"AntifragileInversion","target":"9e201f39-ad16-45b8-a840-e4bee7a668a5","type":"HAS_INVARIANT"},{"id":"b674957b-1128-4389-921a-591b4186924d","source":"AntifragileInversion","target":"de986a93-80da-48bb-a506-83f74c8c61c1","type":"HAS_INVARIANT"},{"id":"ceea3d20-b467-44b3-ae8a-11650ffca273","source":"AntifragileInversion","target":"5c18ed62-dfdf-4071-9a4b-7fd5c96c0d3c","type":"HAS_PRECONDITION"},{"id":"13e779bc-2cb0-4681-9666-e00ac2c188a1","source":"AntifragileInversion","target":"bec21a9b-eedf-4d20-a583-a97a99082d45","type":"HAS_POSTCONDITION"},{"id":"09de2a57-1005-4525-8a3d-aa8cfee9aa4b","source":"Belief","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"cb9f17fa-0972-46a8-aca4-90972316127e","source":"Belief","target":"State","type":"REFERENCES"},{"id":"09cc84fa-a737-4478-a95d-289af6385e8a","source":"Belief","target":"Agent","type":"REFERENCES"},{"id":"54222bde-6f1f-4c11-9337-537c82be0ca5","source":"Break","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"8e7dcf11-1eea-4393-9331-639c05f6aa06","source":"Break","target":"System","type":"REFERENCES"},{"id":"2f2df6a8-c599-461f-af4c-0cc943afd636","source":"Break","target":"Meta","type":"REFERENCES"},{"id":"e4f26bff-f660-410b-86df-c9e5131291f8","source":"Break","target":"Protocol","type":"REFERENCES"},{"id":"5288c830-bf53-4ee2-bb32-7fc3ec9356f8","source":"Break","target":"Message","type":"REFERENCES"},{"id":"136c8009-8c59-4a78-adb1-42738e7ea985","source":"Break","target":"Agent","type":"REFERENCES"},{"id":"372b2242-d5cd-4bd7-a2a8-2c9396974eac","source":"Break","target":"7539c935-7284-4456-8bcf-19e771d74b40","type":"HAS_INVARIANT"},{"id":"d5772577-1200-48f6-a29b-5592c9b51d19","source":"Break","target":"71e7a522-2d84-4f65-842b-c06a6ecd64c2","type":"HAS_INVARIANT"},{"id":"f4b5785e-66b3-4d1f-bef5-d7cec8447ace","source":"Break","target":"e5de5092-0b0b-4fc6-a305-3be093869075","type":"HAS_PRECONDITION"},{"id":"d1c7e698-f3a3-4032-be68-b0442271c62b","source":"Break","target":"10a9ace1-e409-4d4b-8653-df56a13fd88a","type":"HAS_PRECONDITION"},{"id":"a5de1cbd-19ec-43cb-b5ab-affd39a6443a","source":"Break","target":"06e74ea5-fee0-4492-a06b-1dd2719f0ff0","type":"HAS_POSTCONDITION"},{"id":"daa90aa6-46ee-4f4b-82fc-796d59c77c6a","source":"Break","target":"68523e36-6226-40a1-9e19-aeaf75066fbb","type":"HAS_POSTCONDITION"},{"id":"309ff44f-ab82-42de-9622-49997f08b145","source":"Card","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"e45a18cb-1b11-422b-9a68-1f4badfd966e","source":"Card","target":"Select","type":"COMPOSES_WITH"},{"id":"3bd54730-2336-4995-a440-c18995e77314","source":"Card","target":"Probe","type":"REFERENCES"},{"id":"58684f72-92c6-46cf-97e9-33508f730bac","source":"Card","target":"Agent","type":"REFERENCES"},{"id":"c94cde74-1222-4aab-ab09-5af7555955fb","source":"Card","target":"a415342c-fcd1-4232-bf5e-97dbccb19fa7","type":"HAS_INVARIANT"},{"id":"8b306bee-90a5-4c08-8ad4-6a75ff57a406","source":"Compromise","target":"a3dffe73-5c16-41fe-be7c-5f1b04ac73f2","type":"IN_CATEGORY"},{"id":"349427d4-df3d-41cc-9875-27d933a37b76","source":"Compromise","target":"System","type":"REFERENCES"},{"id":"214ed240-6886-4611-8868-724a29ebc4e9","source":"Compromise","target":"Yield","type":"REFERENCES"},{"id":"c5bfa9b8-61e1-4a18-ab6b-5415c82632ca","source":"Compromise","target":"Agent","type":"REFERENCES"},{"id":"da178f80-49a3-4919-acbc-453d5001786a","source":"Compromise","target":"Dampen","type":"COMPOSES_WITH"},{"id":"f9baad01-1af4-4e10-a3b2-a9309705dd7e","source":"EphemeralTool","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"6aa9acda-1791-42f9-bf8f-cf0bf39a868d","source":"EphemeralTool","target":"Task","type":"REFERENCES"},{"id":"f621edc5-c552-462d-9196-ddeb8e000e81","source":"EphemeralTool","target":"ToolInvoke","type":"REFERENCES"},{"id":"847ecfc9-08ac-420d-bd75-f1276c636ab2","source":"EphemeralTool","target":"Sandbox","type":"REFERENCES"},{"id":"df4d5dec-113a-4314-90ea-cb379063d4ec","source":"EphemeralTool","target":"State","type":"REFERENCES"},{"id":"e56ba25e-c42b-4d9c-bc62-5061c6815fb0","source":"EphemeralTool","target":"Agent","type":"REFERENCES"},{"id":"b403cc9d-1266-4ba8-8dfe-271821f5f7e5","source":"EphemeralTool","target":"c594acc2-ab2f-424a-b6da-9a544f1872ae","type":"HAS_INVARIANT"},{"id":"5eaa9024-60d0-48d3-81d8-e8c8e217f30f","source":"EphemeralTool","target":"45e5f294-8a21-432a-bf56-03c32c3c62d3","type":"HAS_INVARIANT"},{"id":"2814819d-0627-4e66-8507-9815121689a8","source":"EphemeralTool","target":"2e2b2b9a-ba56-4b90-8f68-f491c9f8d4a3","type":"HAS_PRECONDITION"},{"id":"5e8f7ba4-59d1-45d6-a5d2-fee2e71bca4f","source":"EphemeralTool","target":"92f49c4e-73ae-4a34-ae8a-12b811b447f1","type":"HAS_POSTCONDITION"},{"id":"3c395a1b-f5ae-4bc9-9c7a-a12c576a4097","source":"FractalAnte","target":"a3dffe73-5c16-41fe-be7c-5f1b04ac73f2","type":"IN_CATEGORY"},{"id":"6d3af10d-f2e8-49b7-a2e5-19dbcf4886b8","source":"FractalAnte","target":"Budget","type":"REFERENCES"},{"id":"7dfad66c-1f33-402c-8d78-cc61486be939","source":"FractalAnte","target":"Yield","type":"REFERENCES"},{"id":"f2f1a43c-4711-4aec-bfe4-a92e00e1e9ee","source":"FractalAnte","target":"Agent","type":"REFERENCES"},{"id":"a6cc7386-4fb2-4a58-8a0f-53f2bf71c14a","source":"FractalAnte","target":"222e49b8-97a8-4557-bda4-8d190864c875","type":"HAS_INVARIANT"},{"id":"4ef6002c-ab4c-45e5-b5ba-e37d9cac0d2d","source":"FractalAnte","target":"8209b0ed-4fc8-4753-8e17-e650ca32f7a1","type":"HAS_INVARIANT"},{"id":"36fbb03b-fabc-4698-92e4-b6de014e3230","source":"FractalAnte","target":"a90072dc-d1b6-4007-8b2b-33293020803b","type":"HAS_PRECONDITION"},{"id":"8d601080-bb0b-468a-9249-2e493461f8cc","source":"FractalAnte","target":"6d455196-702c-485c-aee4-7360e3587b9a","type":"HAS_PRECONDITION"},{"id":"09565121-c274-4ecc-b126-5541e05576ef","source":"FractalAnte","target":"73741714-3b01-4d31-9525-4c3b12bdbbcf","type":"HAS_POSTCONDITION"},{"id":"4181bc90-311e-4ddc-8e52-97b1a00ebaf6","source":"Greet","target":"8f497759-ce27-442f-9c55-27f3c2ad7c49","type":"IN_CATEGORY"},{"id":"02efd96b-f928-4375-ad8b-2c7f4d849ffe","source":"Greet","target":"Agent","type":"REFERENCES"},{"id":"1053864a-dc4c-4730-bacf-5ba3381e98ec","source":"Greet","target":"CompatibilityCheck","type":"COMPOSES_WITH"},{"id":"e70ba07f-31eb-4f12-afa4-47e035e52fe4","source":"Greet","target":"Identity","type":"REFERENCES"},{"id":"bf21cf19-5c13-48c1-80c5-d25bb0fc85b6","source":"Greet","target":"ae8ee9f7-809c-485a-890a-2af4d375c2f6","type":"HAS_INVARIANT"},{"id":"47234427-5c1c-4120-bea0-e34f18114d66","source":"Greet","target":"6fdfe13a-b992-4aff-99e9-60e348c706ee","type":"HAS_INVARIANT"},{"id":"c8a5b088-354d-4b70-aaa9-81ac007654ba","source":"Ledger","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"dfe7c44b-5c00-4f0e-a72f-f4a0798d6833","source":"Ledger","target":"Agent","type":"REFERENCES"},{"id":"44f520c7-976b-439f-9d05-38cc3fc6d5f7","source":"Ledger","target":"Value","type":"REFERENCES"},{"id":"13b80c10-7cc1-4271-b8b8-5982960d6b48","source":"Ledger","target":"74ff8279-1c5a-45bf-b9e2-a2c26a990134","type":"HAS_INVARIANT"},{"id":"5b13a909-c8e4-41cc-b92f-0e9ab457b4cf","source":"Ledger","target":"b44c3a97-96f3-42b7-bb1e-aaef34659036","type":"HAS_INVARIANT"},{"id":"2362c6e1-4c49-4950-926d-89fdc6d28c18","source":"Mode","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"43397c61-463f-475e-8340-9b6a0f6e07d6","source":"Mode","target":"Transition","type":"REFERENCES"},{"id":"21644a3b-6de4-4f03-aed5-55e945f1be3e","source":"Mode","target":"State","type":"REFERENCES"},{"id":"a68b23e6-d1ff-4a04-b6ae-ba32fee2bfa2","source":"Mode","target":"Agent","type":"REFERENCES"},{"id":"3c5748dc-6840-4268-aa58-e1f8a8777432","source":"Mode","target":"d46527f5-9f75-49c0-960c-a008c11dbd29","type":"HAS_INVARIANT"},{"id":"38eb9536-1abb-4ab0-99a0-6adf8e1faa18","source":"Mode","target":"f3c8d77b-ca44-4d89-a884-13573dd8634e","type":"HAS_INVARIANT"},{"id":"9a25c8e3-8992-419f-813e-1bcab6b48be2","source":"ModestClaim","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"788d5669-f694-4e9b-8cdd-d02a241e5005","source":"ModestClaim","target":"Problem","type":"REFERENCES"},{"id":"91b1e850-f96a-4f13-be89-ff13e2ae28af","source":"ModestClaim","target":"System","type":"REFERENCES"},{"id":"987becde-eb2c-42e7-baf2-0b7151ed1beb","source":"ModestClaim","target":"Reframe","type":"REFERENCES"},{"id":"3b456830-cea9-4d10-ab86-e9c9574de769","source":"ModestClaim","target":"Identity","type":"REFERENCES"},{"id":"ec7a5a7b-1314-42da-a78a-d8d50086d6dc","source":"ModestClaim","target":"EpistemicCalibrate","type":"REFERENCES"},{"id":"12a9510a-a85a-422a-9429-693b7f4de71a","source":"ModestClaim","target":"Agent","type":"REFERENCES"},{"id":"5d3c73fe-39fe-443f-a0aa-f8e9603d303f","source":"ModestClaim","target":"1e864a9d-9eaf-4436-9d55-fffe96d816b6","type":"HAS_INVARIANT"},{"id":"f43c75fe-3d2c-4177-a800-d655be1ef660","source":"ModestClaim","target":"aa489d5a-f66e-4570-947a-766f0a79d2b0","type":"HAS_INVARIANT"},{"id":"0f2ddebc-fe75-42db-88ab-83ac9be70d76","source":"ModestClaim","target":"9f4560aa-7c5a-4718-962c-002b3c1fb262","type":"HAS_PRECONDITION"},{"id":"36f59899-7765-48ac-9c1f-205bfaabd8cc","source":"ModestClaim","target":"e23c6e74-72af-4057-bb3d-1b409928e01c","type":"HAS_POSTCONDITION"},{"id":"da7cccf8-9d77-410e-b6cb-6de49f92c6d5","source":"NegativeProof","target":"8f497759-ce27-442f-9c55-27f3c2ad7c49","type":"IN_CATEGORY"},{"id":"dc134170-6ae9-4535-8524-86c685a7b0e2","source":"NegativeProof","target":"Agent","type":"REFERENCES"},{"id":"efcc3ab3-be20-4247-a60f-06d6817fffb5","source":"NegativeProof","target":"Hypothesis","type":"REFERENCES"},{"id":"4829ba7b-6811-470c-a210-c2d219b5d23d","source":"NegativeProof","target":"Value","type":"REFERENCES"},{"id":"3c605cfe-4008-46f9-9beb-8aa2e423116d","source":"NegativeProof","target":"9dd90d8b-03aa-4538-999c-a2e7d4877260","type":"HAS_INVARIANT"},{"id":"057eb6d6-b74f-477a-9775-c2d5cac0648f","source":"NegativeProof","target":"65cab848-07b5-438e-9d7e-d27e5fc053b4","type":"HAS_INVARIANT"},{"id":"c7dfca0f-0fe4-47de-9d89-9867afcb1698","source":"NegativeProof","target":"21436c45-ba5d-4db9-aa65-0f1fdcb154a5","type":"HAS_PRECONDITION"},{"id":"baea93ce-ed02-4eb7-a696-f7ec96776b88","source":"NegativeProof","target":"a89accdc-ce39-4c86-8b33-80c9bf8d13bf","type":"HAS_PRECONDITION"},{"id":"97336b3c-1daf-4974-ac1f-619b1e00a412","source":"NegativeProof","target":"cf8f5d42-95ba-442a-bc09-41cfcd6c395f","type":"HAS_POSTCONDITION"},{"id":"126d0532-16c5-484e-8ad9-808aaf04a60b","source":"OntologyAdapt","target":"90800e2d-25ad-47b4-9463-179cdb2d083f","type":"IN_CATEGORY"},{"id":"a60aac16-cf5e-4061-bfa1-fc96bddffa57","source":"OntologyAdapt","target":"OntologyHandshake","type":"REFERENCES"},{"id":"a234e7f6-687f-4888-ad17-078af32fe23f","source":"OntologyAdapt","target":"Category","type":"REFERENCES"},{"id":"98446ff6-2c57-4b65-809f-b174bae8672e","source":"OntologyAdapt","target":"Noise","type":"REFERENCES"},{"id":"83f71317-6629-43e0-b3c1-41b2025dfb3e","source":"OntologyAdapt","target":"Anomaly","type":"REFERENCES"},{"id":"9eb11eac-4755-4dbf-ba65-0f4ef140edfe","source":"OntologyAdapt","target":"Agent","type":"REFERENCES"},{"id":"c846e874-4402-4052-abbd-bcc22c31afbe","source":"OntologyAdapt","target":"1c92004a-3947-4ff0-ae37-80b0e2037da7","type":"HAS_INVARIANT"},{"id":"eb3d1e0b-5109-4021-9c32-e1ed704cd748","source":"OntologyAdapt","target":"44339c0b-a03c-47e0-9605-4aaddab5c37e","type":"HAS_INVARIANT"},{"id":"e1707d1b-ceae-4333-907e-33109be5554a","source":"OntologyAdapt","target":"0d61e711-1cb9-4340-81a5-48b63d1dad8b","type":"HAS_PRECONDITION"},{"id":"0d5d1c44-c781-4bb2-80b8-dec39c73e423","source":"OntologyAdapt","target":"25c60a1f-1b85-408e-9318-c44f5daccdda","type":"HAS_POSTCONDITION"},{"id":"e48f9c4b-ba4c-47d3-898e-04ff60c92b22","source":"Permission","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"3d481e9b-b768-465c-9892-5e29155495b5","source":"Permission","target":"Act","type":"REFERENCES"},{"id":"d437ef83-8918-4a9f-887b-9812e39f2bd4","source":"Permission","target":"Artifact","type":"REFERENCES"},{"id":"b61de1fc-ca47-410d-9d6e-e7d9c8b0a976","source":"Permission","target":"Agent","type":"REFERENCES"},{"id":"f5333a38-6e6c-4293-bc34-602468853b69","source":"Proprioception","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"ae34231f-4e11-4ece-928f-717657a12014","source":"Proprioception","target":"Task","type":"REFERENCES"},{"id":"e0bfc660-1a6a-493c-8245-cad33d7843af","source":"Proprioception","target":"Trace","type":"REFERENCES"},{"id":"0fc1c37d-e883-46f4-a9f1-14f4ec7fdf7e","source":"Proprioception","target":"State","type":"REFERENCES"},{"id":"8df25da2-ca98-46f4-80b0-5db473a516ea","source":"Proprioception","target":"SomaticMarker","type":"REFERENCES"},{"id":"57443557-c6f5-4954-8236-2b121d3ed74e","source":"Proprioception","target":"Context","type":"REFERENCES"},{"id":"78ccd7aa-b180-4d14-bc2f-ea4912fb603b","source":"Proprioception","target":"Agent","type":"REFERENCES"},{"id":"b6190875-5533-4036-8b1b-fd9d2e756589","source":"Proprioception","target":"37640219-1871-4d12-92a5-263dc28cb185","type":"HAS_INVARIANT"},{"id":"eae7dd0a-c35c-4265-862b-23501788ef83","source":"Proprioception","target":"1f88efb1-dca4-413f-89af-2edf854e93a0","type":"HAS_INVARIANT"},{"id":"707dfa0e-d6ba-4552-97ff-195b3c76a7a1","source":"Proprioception","target":"5e260121-aa31-4e8c-88d5-7dba036ac699","type":"HAS_INVARIANT"},{"id":"68bf8d68-8066-44b1-97d9-c84220aa3749","source":"ReAct","target":"e38ff6e0-872e-4a63-a7ea-ebb84e174347","type":"IN_CATEGORY"},{"id":"8de6d717-2fdb-4021-8234-ebbd57eb779a","source":"ReAct","target":"Agent","type":"REFERENCES"},{"id":"23f2ce34-67ab-4dcc-9a6a-0e9b4904f867","source":"ReAct","target":"ToolInvoke","type":"COMPOSES_WITH"},{"id":"a7c4f807-d147-4292-9b82-b810a52eee6d","source":"ReAct","target":"Task","type":"ACCEPTS"},{"id":"ccf31c24-5de2-4277-a91a-3f0e9bfcd456","source":"ReAct","target":"Chain","type":"REFERENCES"},{"id":"62b77094-1fc3-4f3d-8987-32e509ffb456","source":"ReAct","target":"Loop","type":"REFERENCES"},{"id":"4cea8cca-f2fe-4785-954f-7e85b9a71973","source":"ReAct","target":"CognitiveBias","type":"REFERENCES"},{"id":"74654306-bd69-4a07-a467-c8301ae8048f","source":"ReAct","target":"6e3431ef-e936-499b-af6b-2e5261eb0d60","type":"HAS_INVARIANT"},{"id":"75193eac-9c44-43ca-9fdf-ef37c3eaf816","source":"ReAct","target":"2b4d3a9c-e45a-449d-b7c4-8f7a13495d51","type":"HAS_INVARIANT"},{"id":"c03142cb-eb63-44d2-8357-c24b6e6c3d1d","source":"ReAct","target":"0d81d92c-a7f2-48d2-8a23-9627ed24a7a7","type":"HAS_PRECONDITION"},{"id":"aa190d7c-86e3-48c2-8c32-5f88374eb059","source":"ReAct","target":"ec728cf7-9ff8-49ce-b6dd-248ad04e861d","type":"HAS_PRECONDITION"},{"id":"401158af-3d6f-4adf-90fc-e558a4ab7a42","source":"ReAct","target":"5b750e17-14ca-4768-9fe4-c333fb5b6cd8","type":"HAS_POSTCONDITION"},{"id":"6b8f74fe-d1b9-4092-8081-9e3748fe6f01","source":"SignalReflection","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"eceb8bc4-bd78-44da-9211-df0e5e916d0b","source":"SignalReflection","target":"SpectralTune","type":"REFERENCES"},{"id":"83949b81-6498-4077-92f3-b194caf21b44","source":"SignalReflection","target":"Agent","type":"REFERENCES"},{"id":"def2ed2f-e19e-4195-aab0-566811cae8dd","source":"SignalReflection","target":"Message","type":"REFERENCES"},{"id":"7136c2d4-2b29-4228-aa23-50e3f1ae8fa2","source":"SignalReflection","target":"25dba9ea-2ecb-45ae-bd7e-5efa2a8a8544","type":"HAS_INVARIANT"},{"id":"b097e1b9-92b2-4bc1-9b1c-0faf1759c8f2","source":"SignalReflection","target":"782fc85c-92f2-487d-8a8f-7b056c655d84","type":"HAS_INVARIANT"},{"id":"041511f0-0be7-49fe-9d7b-1569cfbbcff5","source":"SignalReflection","target":"37b8fb18-7cac-4714-891a-d47db3ade8c0","type":"HAS_PRECONDITION"},{"id":"bd0e85a1-0f6f-4ed9-b06d-d1e3226b048c","source":"SignalReflection","target":"310d4861-b5eb-4dbe-b7d2-30af86f78e57","type":"HAS_POSTCONDITION"},{"id":"a6f65889-3995-49fc-bcc3-a294baa89880","source":"StateLock","target":"e5a36812-8586-4359-8f6a-7c5631923812","type":"IN_CATEGORY"},{"id":"c67802a9-d3da-4516-96e9-c3fa374ea35a","source":"StateLock","target":"Backoff","type":"REFERENCES"},{"id":"5077247b-f4e4-45e4-b69b-874855d48a7d","source":"StateLock","target":"State","type":"REFERENCES"},{"id":"6ec3480f-4d91-4c4c-8367-15bf8be2a1af","source":"StateLock","target":"Lock","type":"REFERENCES"},{"id":"1ca52062-77ce-4a55-8b2e-dd386a2cf073","source":"StateLock","target":"Cooldown","type":"REFERENCES"},{"id":"913125ae-8cd7-4673-bf67-865e16b2bedb","source":"StateLock","target":"Agent","type":"REFERENCES"},{"id":"d2f6fec5-affb-44f7-a166-93d07a959904","source":"StrategicReading","target":"e38ff6e0-872e-4a63-a7ea-ebb84e174347","type":"IN_CATEGORY"},{"id":"1902effb-d288-4991-a626-fdf3e8272982","source":"StrategicReading","target":"ComputeBudget","type":"REFERENCES"},{"id":"26eb8e54-7836-4a67-8055-805b9bc283c4","source":"StrategicReading","target":"CognitiveBias","type":"REFERENCES"},{"id":"6c11011b-74f8-4fec-ac59-9437a65dd121","source":"StrategicReading","target":"Context","type":"REFERENCES"},{"id":"e9fc3222-eb3f-4c96-ab8d-1b749ddddfd6","source":"StrategicReading","target":"Agent","type":"REFERENCES"},{"id":"02d36975-d65b-4257-b371-d86168340de7","source":"StrategicReading","target":"Tree","type":"REFERENCES"},{"id":"6d7d7f50-3d66-44ba-8797-42911cef2060","source":"StrategicReading","target":"7308d8e9-615f-42cd-b9c5-ad0406f1d3bd","type":"HAS_INVARIANT"},{"id":"81cdbc4d-cf9a-4b9f-9f3d-28607e2bbca1","source":"StrategicReading","target":"7104bc81-24af-4872-b02b-23567f6e65f1","type":"HAS_INVARIANT"},{"id":"0e0f0bff-a301-4dfd-9d07-0abb6afc0c47","source":"StrategicReading","target":"846c68dc-c13a-4475-a41c-3c33c536a5b9","type":"HAS_PRECONDITION"},{"id":"8abda39f-0c22-40b1-8503-238462838a7e","source":"StrategicReading","target":"e2c598e4-6452-4bd8-bc0d-2da163dc4bc2","type":"HAS_PRECONDITION"},{"id":"4112a7b0-15b4-4582-a494-94506180260d","source":"StrategicReading","target":"97843ec4-ffac-417e-a624-a616bc1a361d","type":"HAS_POSTCONDITION"},{"id":"f376180f-a335-4c30-881f-d2f1a36f7325","source":"StrategicReading","target":"39ab5a37-638f-410e-aad9-6d3570100638","type":"HAS_POSTCONDITION"},{"id":"552b8d96-7134-420d-8e2c-9d8ac877ac6c","source":"TaskLifecycle","target":"8f497759-ce27-442f-9c55-27f3c2ad7c49","type":"IN_CATEGORY"},{"id":"493a65bd-cca4-4ee6-aa73-7f1ed3977264","source":"TaskLifecycle","target":"Task","type":"REFERENCES"},{"id":"2bb45748-9ca9-4e6d-8003-09635b6641dd","source":"TaskLifecycle","target":"Heartbeat","type":"REFERENCES"},{"id":"e155cc92-c232-40ea-baa8-081bcd424da6","source":"TaskLifecycle","target":"StateTransition","type":"COMPOSES_WITH"},{"id":"12b98af1-4a29-4814-aad7-17436a78124c","source":"TaskLifecycle","target":"Exception","type":"REFERENCES"},{"id":"1be2227e-3a41-4aad-aba7-3af19e5f6112","source":"TaskLifecycle","target":"Event","type":"REFERENCES"},{"id":"6e51a2ee-28d2-403d-a448-a003bda55c9d","source":"TaskLifecycle","target":"Result","type":"YIELDS"},{"id":"7e109827-468e-4899-b894-6a28072d43fd","source":"TaskLifecycle","target":"Agent","type":"REFERENCES"},{"id":"4b534138-bcb0-46fb-a4f9-0c25605e6cd9","source":"TaskLifecycle","target":"4fe6cdc8-a211-42d8-a6b4-abee17915d39","type":"HAS_INVARIANT"},{"id":"5cd4f07c-45ec-42fa-af9e-25edc6aee842","source":"TaskLifecycle","target":"0054ff10-ccc6-4802-a21a-68bc45e18f85","type":"HAS_INVARIANT"},{"id":"e43c5d1b-7e7a-43d8-8def-94939b47fe7a","source":"TaskLifecycle","target":"c4e21793-0adc-4990-8070-34aa53a808ad","type":"HAS_INVARIANT"},{"id":"02679cda-6764-4a8e-9497-557c933ef1e6","source":"TaskLifecycle","target":"8552cb7d-4584-490f-9e5f-41b780b92bdd","type":"HAS_INVARIANT"},{"id":"50b8d9cf-8191-4aa8-bd42-e55a161ff3f6","source":"TaskLifecycle","target":"c4328bec-d540-4187-9db0-7e242493a6e4","type":"HAS_PRECONDITION"},{"id":"11261855-acc9-4d90-9bfe-200d98dcd225","source":"TaskLifecycle","target":"87d1c714-39ab-47ab-80c3-1ffc88aad49f","type":"HAS_POSTCONDITION"},{"id":"1a832df6-280b-41a2-bd31-ce4abaa5aed7","source":"TieredAccess","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"c4b4f3d0-bf5b-4a06-9111-faec110c81ad","source":"TieredAccess","target":"BearerToken","type":"COMPOSES_WITH"},{"id":"8aba642c-5ccd-4a74-ac3b-d2c1cbfa0c01","source":"TieredAccess","target":"Agent","type":"REFERENCES"},{"id":"b631599d-64a4-48fa-9584-478a2531bcf7","source":"TieredAccess","target":"Identity","type":"REFERENCES"},{"id":"9c5dd567-fa99-4f71-b9c8-ace11b965837","source":"TieredAccess","target":"83141e5f-d7bf-4f81-9376-afa86770bc83","type":"HAS_INVARIANT"},{"id":"ccf9230f-904c-44b2-9cc1-0d0d5b89c145","source":"TieredAccess","target":"123584b4-c90f-4c6a-9ddf-99f1bc1d0efa","type":"HAS_INVARIANT"},{"id":"8e9088e4-f42a-4913-8978-d4ef13a50daf","source":"TieredAccess","target":"c61ad084-78ee-44ff-88a9-0616090d2094","type":"HAS_PRECONDITION"},{"id":"46ec0e11-e923-492e-9934-272aa8b4782c","source":"TieredAccess","target":"f630da18-e3f3-4d0d-b779-77509c5b4685","type":"HAS_POSTCONDITION"},{"id":"c8e986f8-18d9-40e1-9093-17df106ab6dd","source":"Outcome","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"13da3ae5-4cb2-4ba4-8929-22e3f7f99be7","source":"Outcome","target":"Plan","type":"REFERENCES"},{"id":"7cdbb5af-1a6f-4d71-8368-c67027039ca9","source":"Roadmap","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"8b553471-644f-475c-978c-3766d8c08b62","source":"Roadmap","target":"Plan","type":"REFERENCES"},{"id":"6da53e4a-01d3-4873-aeaf-4c8a65124e3e","source":"Roadmap","target":"Goal","type":"REFERENCES"},{"id":"7c53ba75-1a54-4df0-9643-9c2c0af61d58","source":"Spec","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"e949f0da-4022-4203-b43d-20abe9e494ef","source":"Spec","target":"Artifact","type":"REFERENCES"},{"id":"ae09b543-9cc8-452a-8b5b-983840991d3b","source":"Spec","target":"Constraint","type":"REFERENCES"},{"id":"4f396b0b-ee9e-479a-854c-094f35115967","source":"Spec","target":"Plan","type":"REFERENCES"},{"id":"d295273d-cab2-44b9-90eb-156605525c35","source":"Spec","target":"Goal","type":"REFERENCES"},{"id":"45bc0329-ec31-421d-a861-042358ea71db","source":"Spec","target":"b4bf0292-b897-4802-a6d2-ffe10729a17c","type":"HAS_INVARIANT"},{"id":"f8dabe41-a7c5-4805-aa61-6bc07a99c525","source":"Spec","target":"125fb0fc-3ef0-448b-af08-3292c7f03802","type":"HAS_INVARIANT"},{"id":"6e9aa56c-8e18-420d-94ad-f6bc9a172120","source":"Strategy","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"c6dc550f-be69-478e-869c-8ddee2da367a","source":"Strategy","target":"Plan","type":"REFERENCES"},{"id":"5433ef38-603a-4b36-ac55-4ca541267fc4","source":"AnalogicalMask","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"f35c4b05-82f7-4894-8f7a-68654c1afe55","source":"AnalogicalMask","target":"OntologyHandshake","type":"REFERENCES"},{"id":"4873eeca-f855-4ef1-8538-58dc86db2e24","source":"AnalogicalMask","target":"AnalogyBridge","type":"REFERENCES"},{"id":"974c4a39-1a15-4aa1-8e21-2acf4dbde6db","source":"AnalogicalMask","target":"Message","type":"REFERENCES"},{"id":"57b6abcf-6b01-4a45-b67e-9f6573bd3a1b","source":"AnalogicalMask","target":"77786c9b-3a8a-4cdb-9941-d45e7b0e36fc","type":"HAS_INVARIANT"},{"id":"a1700ad0-a51c-44b3-b19e-1c20d6bfff97","source":"AnalogicalMask","target":"63a9cafa-e5a4-4acd-b198-01dc7447610f","type":"HAS_INVARIANT"},{"id":"d79ceeb0-3b20-4045-9cdb-671d3756f1f2","source":"AnalogicalMask","target":"85c9735f-4f75-4ee2-9b9c-1dc5246b0c51","type":"HAS_PRECONDITION"},{"id":"de7480ce-a902-4459-b0d2-69eae5e7a465","source":"AnalogicalMask","target":"793b6940-eea2-4ec9-b4ee-4bece47111c1","type":"HAS_POSTCONDITION"},{"id":"67394e79-1004-4978-ab22-de2fc198c720","source":"Generalize","target":"e38ff6e0-872e-4a63-a7ea-ebb84e174347","type":"IN_CATEGORY"},{"id":"80f4f14a-eebb-4234-8155-58774c94185e","source":"Generalize","target":"State","type":"REFERENCES"},{"id":"d3a75abe-aed7-4857-af65-c7c2f438c204","source":"Generalize","target":"AnalogyBridge","type":"REFERENCES"},{"id":"fea9ec6e-fe0c-4cd3-a81b-111b47c6335d","source":"Generalize","target":"0967c728-c158-4eff-8b07-25f67ef7bfa0","type":"HAS_INVARIANT"},{"id":"eb58489e-edcd-4102-aded-d72c42fcdca6","source":"Generalize","target":"b725a043-44ed-4692-890b-c72616985c5c","type":"HAS_INVARIANT"},{"id":"f9ce4255-caca-4993-8238-7dbf313b40da","source":"Generalize","target":"59fa184c-fe98-4d45-a7d6-8c4cf740193a","type":"HAS_PRECONDITION"},{"id":"c410f699-0c0e-4d87-8b0e-114e12335150","source":"Generalize","target":"ba578f57-853a-4303-8126-dce65771924d","type":"HAS_POSTCONDITION"},{"id":"d0e9b723-7622-47bd-969a-6a088a8bf59d","source":"BayesUpdate","target":"90800e2d-25ad-47b4-9463-179cdb2d083f","type":"IN_CATEGORY"},{"id":"a469f6d1-14f9-4545-a3ce-18a8b8e07f06","source":"BayesUpdate","target":"Belief","type":"REFERENCES"},{"id":"80320550-75c9-4b7c-bb37-3fa3b5502dae","source":"BayesUpdate","target":"Observe","type":"REFERENCES"},{"id":"f166af7c-14e0-4d64-b60e-c21746fc1806","source":"BayesUpdate","target":"BaseRateInclude","type":"REFERENCES"},{"id":"50759a07-6557-475f-9890-0f7657e07ea2","source":"BayesUpdate","target":"6959db74-2f4c-444d-812a-21af387a3384","type":"HAS_INVARIANT"},{"id":"bf186d4b-f7ce-4391-a230-29e9eb252ddc","source":"BayesUpdate","target":"918be14a-74e9-4cca-8f83-f44ba832d191","type":"HAS_PRECONDITION"},{"id":"8dc572f0-4d3f-4e92-9977-de41ce1f1804","source":"BayesUpdate","target":"89667e57-693b-4680-b81b-62c2e4aa5a39","type":"HAS_POSTCONDITION"},{"id":"d0f66b27-99f6-442e-acb8-d7133e0f78fd","source":"SteelmanCheck","target":"e38ff6e0-872e-4a63-a7ea-ebb84e174347","type":"IN_CATEGORY"},{"id":"a6f8e035-9197-4397-a3a8-212193cd99f3","source":"SteelmanCheck","target":"Agent","type":"REFERENCES"},{"id":"0f4c425b-5b23-4e6e-8d7c-28a7f9d3e4b1","source":"SteelmanCheck","target":"Belief","type":"REFERENCES"},{"id":"a1ee6401-ed0d-4569-904d-258477efc82b","source":"SteelmanCheck","target":"Check","type":"REFERENCES"},{"id":"03f703db-bc99-4494-9f6b-0bb2a968bf06","source":"SteelmanCheck","target":"Loop","type":"REFERENCES"},{"id":"0bddd524-c3a3-4547-b8e8-01f9ea7a4d6b","source":"SteelmanCheck","target":"Robustness","type":"REFERENCES"},{"id":"89c90297-b685-4c30-b04d-ff56f0a1b112","source":"SteelmanCheck","target":"CompatibilityCheck","type":"REFERENCES"},{"id":"57d0dfb4-0a6e-4057-bc78-f568feb7338f","source":"SteelmanCheck","target":"Critique","type":"REFERENCES"},{"id":"e08551d5-2c90-4613-be63-ba18b98d27f9","source":"SteelmanCheck","target":"Decision","type":"REFERENCES"},{"id":"499f6885-e5f3-4a84-a62a-369ad9f235bd","source":"SteelmanCheck","target":"CognitiveBias","type":"REFERENCES"},{"id":"dcad33b0-dd60-4079-89e0-8e276997bbb7","source":"SteelmanCheck","target":"b0707b24-a798-44b3-bca2-bbd1236d510a","type":"HAS_INVARIANT"},{"id":"a7b0e0c4-670b-4c7e-973f-9f1628883801","source":"SteelmanCheck","target":"07bacd71-9b28-4523-9e8a-004ad7d0dd51","type":"HAS_INVARIANT"},{"id":"b231a00d-2b19-4349-9509-a7f4e282e234","source":"SteelmanCheck","target":"76ae4b2c-56a4-4a13-a2c8-3b838188389b","type":"HAS_INVARIANT"},{"id":"37cce2aa-1e94-4530-bbb9-625c6db3181e","source":"SteelmanCheck","target":"278544b8-ce76-4812-9da3-a7f5d1f992ca","type":"HAS_INVARIANT"},{"id":"412bccd8-3aef-4db4-a8eb-611757168798","source":"SteelmanCheck","target":"2bb22c15-abb2-4e0e-8254-afc9001fdff7","type":"HAS_PRECONDITION"},{"id":"710650bc-8416-41e2-aa15-b8177027c267","source":"SteelmanCheck","target":"31b49845-7dfa-47e8-975d-e7c941cecb24","type":"HAS_PRECONDITION"},{"id":"39649945-e3ac-4313-810b-f1e175265c22","source":"SteelmanCheck","target":"573cf9f3-2a13-4ff4-bac8-7a6c9286b264","type":"HAS_POSTCONDITION"},{"id":"71e57753-7b47-41f6-8dea-148b1e4e802f","source":"Jester","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"e537f25c-e9fc-4a62-9732-d7f7f095f1f7","source":"Jester","target":"Incongruity","type":"REFERENCES"},{"id":"145133e6-acd2-45ee-aa7b-b1b9b30f341d","source":"Jester","target":"Break","type":"REFERENCES"},{"id":"5a36aae5-d0e7-4c4d-b206-634e772956b5","source":"Jester","target":"Critique","type":"REFERENCES"},{"id":"618abce9-6664-48bb-b2cc-fdc1b7e35b0b","source":"AgentDiscover","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"d29b9797-78e9-4ada-8dd2-7fe3a100152a","source":"AgentDiscover","target":"Card","type":"REFERENCES"},{"id":"5d54ed91-827f-4cf6-86dc-18a2421bf6f5","source":"AgentDiscover","target":"Discover","type":"REFERENCES"},{"id":"8117985a-6817-443c-b6da-4b4ec4bca458","source":"AgentDiscover","target":"Agent","type":"REFERENCES"},{"id":"e6a98a2b-ca28-484e-91fd-5841129b6e39","source":"AgentDiscover","target":"1a69128d-5dae-4661-8569-8159854cd040","type":"HAS_INVARIANT"},{"id":"7ce0d67b-9006-435e-b892-594d5304c59e","source":"AgentDiscover","target":"305ba12c-81f5-4d9c-8375-f2774ae33e23","type":"HAS_INVARIANT"},{"id":"aaa69615-54ee-4d02-a860-25b8f2bc4334","source":"AgentDiscover","target":"c2ab06e7-195b-42de-aa15-263117333e85","type":"HAS_PRECONDITION"},{"id":"54e87ed2-7cab-4062-8f13-4593c9a99533","source":"AgentDiscover","target":"e365d06d-afcc-4461-9280-ceef4f48f2e4","type":"HAS_PRECONDITION"},{"id":"b7be2a7a-1f79-481b-a8bc-a36dc83fea40","source":"AgentDiscover","target":"7a3b9d5b-f9a4-41d5-806c-174e5fd8970c","type":"HAS_POSTCONDITION"},{"id":"378e63fe-3e24-45e7-b1fd-5fe5b5591e80","source":"ToolDiscovery","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"4f880b6c-080e-4257-8f92-98a45dd65183","source":"ToolDiscovery","target":"Task","type":"REFERENCES"},{"id":"c1c60505-3060-4516-a226-48b84cb0a757","source":"ToolDiscovery","target":"CompatibilityCheck","type":"COMPOSES_WITH"},{"id":"ee49ea5b-cb95-4831-ae62-3007cee1f8bb","source":"ToolDiscovery","target":"ToolInvoke","type":"COMPOSES_WITH"},{"id":"5ee8ff88-2a01-4916-a01d-700d8e3f255b","source":"ToolDiscovery","target":"Discover","type":"REFERENCES"},{"id":"47c4dca4-667e-47d7-b7d6-28cbf2a41722","source":"ToolDiscovery","target":"FailClosed","type":"COMPOSES_WITH"},{"id":"14a94214-d7bd-4161-93c0-e874ef2b97f9","source":"ToolDiscovery","target":"Card","type":"REFERENCES"},{"id":"5ba48933-f137-4aac-988f-163836181d2f","source":"ToolDiscovery","target":"Result","type":"YIELDS"},{"id":"57a76558-f3a7-4d0e-8796-1d07f3c9e4e1","source":"ToolDiscovery","target":"Agent","type":"REFERENCES"},{"id":"8b77e8d8-0d90-4c81-83f1-6f67c3f8c0c3","source":"ToolDiscovery","target":"AgentDiscover","type":"RELATED_TO"},{"id":"a07d60d0-3b56-4488-9e67-6a70d7a88bc1","source":"ToolDiscovery","target":"9a1c8ae1-6157-4cef-b3af-1eb1c23463c6","type":"HAS_INVARIANT"},{"id":"333128ad-859f-4562-a9de-65dbfaf2f800","source":"ToolDiscovery","target":"28c728c7-c566-4144-ad80-065f82f74951","type":"HAS_INVARIANT"},{"id":"b60daa39-35ba-467b-88fb-901613cf2582","source":"ToolDiscovery","target":"1e2f8ae4-8d28-4606-9cba-509738727d1e","type":"HAS_INVARIANT"},{"id":"fb33afe5-6521-439b-8cd6-1e005377cebf","source":"ToolDiscovery","target":"a5060f02-3b46-4f80-873a-70d93a2b4bbe","type":"HAS_PRECONDITION"},{"id":"f3bd1fa3-9b66-44d2-a3dc-90756a4963cb","source":"ToolDiscovery","target":"f4520f43-6c82-42da-a836-51ff29211297","type":"HAS_PRECONDITION"},{"id":"60a07d96-6a22-48ac-a439-c471cd04dde5","source":"ToolDiscovery","target":"4efc03ac-8beb-486c-bf27-c6ccbd77e920","type":"HAS_POSTCONDITION"},{"id":"c7a2efda-5c72-4322-8e83-9f5602e6e8c4","source":"ToolDiscovery","target":"29bc4489-ee19-432a-90e6-e72b44a2ca78","type":"HAS_POSTCONDITION"},{"id":"739e3e70-169d-461c-98be-6294817c15b0","source":"ExplainBeacon","target":"579b02af-c094-442f-8ef9-67bcd86bd62f","type":"IN_CATEGORY"},{"id":"d17d7bca-2b86-4fa4-872d-802dfcce3383","source":"ExplainBeacon","target":"Greet","type":"REFERENCES"},{"id":"aaa3acb6-5f01-42eb-baa7-13736e609275","source":"ExplainBeacon","target":"Heartbeat","type":"REFERENCES"},{"id":"f39dd86a-1fac-4572-9c09-f540bd58562a","source":"ExplainBeacon","target":"Stream","type":"REFERENCES"},{"id":"972704f4-95f3-457f-b76a-0cb667e23cc4","source":"ExplainBeacon","target":"Agent","type":"REFERENCES"},{"id":"a37b75ad-9434-4f85-9778-80f237d1eeb6","source":"ExplainBeacon","target":"4861fde4-d873-4b35-b428-5f5af03db92a","type":"HAS_INVARIANT"},{"id":"1f24134c-b482-4483-b8bd-dca6721db9c3","source":"Warmup","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"a5b4e2aa-ae6f-41ad-95ea-02a9f89140ad","source":"Warmup","target":"Greet","type":"REFERENCES"},{"id":"5dc571d9-4d39-484a-b938-4c12d13a08fe","source":"Warmup","target":"Throttle","type":"REFERENCES"},{"id":"99b8c63d-97ca-41d4-96f5-1590680acd8b","source":"Warmup","target":"System","type":"REFERENCES"},{"id":"015f2c4f-afaa-42e9-89ef-1a5a3b248c78","source":"Warmup","target":"2923c75f-84da-490c-abaa-0a7f399f4af3","type":"HAS_INVARIANT"},{"id":"095b7df8-a0f6-4fa6-9518-74b1c945d1cb","source":"Warmup","target":"70861849-0174-48ea-9429-9b9f9b331dd1","type":"HAS_PRECONDITION"},{"id":"964bf7fd-6112-4a53-bfce-a26e63658da4","source":"Warmup","target":"a7f038d9-e886-4c0b-9465-b1ae6a086ddb","type":"HAS_POSTCONDITION"},{"id":"55e2cdc9-5053-42cb-b37d-ff0d6d79aedd","source":"Warmup","target":"8daf604c-e642-4018-a328-e3046d1fe0b8","type":"HAS_POSTCONDITION"},{"id":"3b5c1277-a334-46b2-a8c5-07d0fdfa7187","source":"AuditTrail","target":"579b02af-c094-442f-8ef9-67bcd86bd62f","type":"IN_CATEGORY"},{"id":"f73edf43-6f94-42cc-8fac-de5b9833b590","source":"AuditTrail","target":"Snapshot","type":"COMPOSES_WITH"},{"id":"31fd87c9-666f-4bb6-9ec4-a5ae8326c256","source":"AuditTrail","target":"Trace","type":"REFERENCES"},{"id":"17720d20-3f71-4ba7-8310-bccf6d5c857f","source":"AuditTrail","target":"Sign","type":"REFERENCES"},{"id":"a16965b4-2362-4b66-a5aa-a7b5afd449d7","source":"AuditTrail","target":"Ledger","type":"REFERENCES"},{"id":"945b4f4a-4464-4172-8fd8-965f6b90795c","source":"AuditTrail","target":"Identity","type":"REFERENCES"},{"id":"b26beaf1-d3ec-4c36-81f1-5847a25c4878","source":"AuditTrail","target":"Audit","type":"REFERENCES"},{"id":"80e88bdf-9c3a-4fb5-9028-c1563c0fc618","source":"AuditTrail","target":"Agent","type":"REFERENCES"},{"id":"abe885d7-8522-438e-b8ad-641cb0932206","source":"AuditTrail","target":"SpotAudit","type":"RELATED_TO"},{"id":"883254ad-3ad7-49fb-aee1-530c59a0cfaa","source":"AuditTrail","target":"d2d40d10-1267-428c-94e9-ea2b8f2b766f","type":"HAS_INVARIANT"},{"id":"a3b9043e-1c8e-4b8d-b38c-f74cd815274a","source":"AuditTrail","target":"060ccbf4-baee-4ac4-aeb4-08e8d4b129d8","type":"HAS_INVARIANT"},{"id":"b21ee4e3-4233-42d5-a349-b8a35e51a8fd","source":"AuditTrail","target":"edbf5299-aae8-43b8-99bb-d88f8da4bb2a","type":"HAS_INVARIANT"},{"id":"4973170c-44db-4772-ab98-e484dd5665d8","source":"AuditTrail","target":"c61ad084-78ee-44ff-88a9-0616090d2094","type":"HAS_PRECONDITION"},{"id":"f9a44c3b-37a5-4130-82ed-3315578def0c","source":"AuditTrail","target":"17936c31-833f-4b39-973d-68b5e44eb1ca","type":"HAS_PRECONDITION"},{"id":"54d2eca3-a996-448c-a218-18ec8ba0dce0","source":"AuditTrail","target":"4e53f8f7-1c07-415f-9a90-136da809adee","type":"HAS_POSTCONDITION"},{"id":"c30c71d9-ec82-4279-9985-41cb9b3725da","source":"AuditTrail","target":"d572da17-d610-4403-ae04-bf728effddd4","type":"HAS_POSTCONDITION"},{"id":"f6006bf3-d7e2-406a-948d-2c3b5bf033b7","source":"Aggregate","target":"8f497759-ce27-442f-9c55-27f3c2ad7c49","type":"IN_CATEGORY"},{"id":"fd6bb4b2-9bcf-49e1-b1a8-4161c3f9d057","source":"Aggregate","target":"Value","type":"YIELDS"},{"id":"00e42892-bbb5-4a68-9834-4a87ceaa9d6c","source":"Aggregate","target":"Mode","type":"REFERENCES"},{"id":"59a8baf0-9201-480a-8fae-9dea756b57d1","source":"Aggregate","target":"Vector","type":"ACCEPTS"},{"id":"82be46ff-2920-46d8-b71c-ee396111efe2","source":"Aggregate","target":"720bf58a-72e0-4ddb-85eb-9bd6814cf4b8","type":"HAS_INVARIANT"},{"id":"985aaed8-e04d-4ed0-b945-1cd07ffa61d4","source":"Aggregate","target":"5b24b112-00e7-492d-b5a3-3d6610d7c6cb","type":"HAS_INVARIANT"},{"id":"b467dc82-8c00-43ad-b367-2986585293ec","source":"Aggregate","target":"f7559de0-0099-4b41-a3aa-1e849c277d83","type":"HAS_PRECONDITION"},{"id":"feb77348-b707-47c4-9af9-7ae94bc424cb","source":"Aggregate","target":"445df4fc-7bcb-4cb8-97ca-1e1dc729a715","type":"HAS_PRECONDITION"},{"id":"e067b970-299b-4f56-b6e4-4c5db458a943","source":"Aggregate","target":"771a65f2-a111-49cf-a60c-558b14b56d9a","type":"HAS_POSTCONDITION"},{"id":"55d25d9b-8363-43bc-af73-228d4f088892","source":"Canary","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"1fb7ff1e-30e3-4c35-8d52-03cfede08c5a","source":"Canary","target":"Greet","type":"REFERENCES"},{"id":"13fac0c2-0aa0-4a1b-b997-719db8dc5932","source":"Canary","target":"Mode","type":"REFERENCES"},{"id":"16624881-a24c-40a1-9056-16bf86b37d81","source":"Canary","target":"Work","type":"REFERENCES"},{"id":"9776cea2-2349-4b1f-9056-ec3dce4ec016","source":"Canary","target":"Probe","type":"REFERENCES"},{"id":"425ec217-360d-4b85-971b-ac0dc2a63af1","source":"Canary","target":"Agent","type":"REFERENCES"},{"id":"dbd9f856-0562-412e-bea5-3249fec37713","source":"Canary","target":"28caced9-39fb-40d8-9e57-eba42b852ac2","type":"HAS_INVARIANT"},{"id":"029b9e25-2c74-4498-9660-ce6689ee06f5","source":"Canary","target":"a48be017-d044-443f-8acf-a9271c5b3507","type":"HAS_INVARIANT"},{"id":"2176d37b-78ea-43b0-b90e-4197113f411a","source":"Canary","target":"f3a39de7-2780-4502-8d1c-4832518814db","type":"HAS_PRECONDITION"},{"id":"c87afa42-1338-4e3e-adb2-2c94de0b09da","source":"Canary","target":"9769e658-b5ae-430a-a9c1-b104b1569af9","type":"HAS_PRECONDITION"},{"id":"6ca0b062-b06d-4963-bdc9-17de9e092cf8","source":"Canary","target":"facf7ed5-c719-44df-93c4-9869fb9ffb8b","type":"HAS_POSTCONDITION"},{"id":"aa366f7c-5cf1-4952-8550-0adb239bf0fa","source":"IdentityHandshake","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"28ef4fcd-9f4f-48de-aac0-804748ffdb39","source":"IdentityHandshake","target":"SpectralTune","type":"REFERENCES"},{"id":"63e296f3-b3b7-4375-8324-e7dbdeedb5d5","source":"IdentityHandshake","target":"Mode","type":"REFERENCES"},{"id":"654a4710-a2ab-49eb-b0d4-cb08a1e64c71","source":"IdentityHandshake","target":"OntologyHandshake","type":"REFERENCES"},{"id":"ba3f3ea6-6b9e-488c-a135-6a4cf427c003","source":"IdentityHandshake","target":"Nature","type":"REFERENCES"},{"id":"2feff1e2-36fe-4e20-aa3e-e0017e340db3","source":"IdentityHandshake","target":"Check","type":"REFERENCES"},{"id":"a01adb96-554e-4e0a-bae8-029f9a16d9c3","source":"IdentityHandshake","target":"Discover","type":"REFERENCES"},{"id":"954e0ada-b8f7-4449-8f4c-a075379b64b4","source":"IdentityHandshake","target":"Identity","type":"REFERENCES"},{"id":"404648fc-38bf-4b22-8b9c-1ef1f3ba3376","source":"Switch","target":"8f497759-ce27-442f-9c55-27f3c2ad7c49","type":"IN_CATEGORY"},{"id":"3b446d6c-e23e-44db-a783-e28fe7de430a","source":"Switch","target":"Mode","type":"REFERENCES"},{"id":"d6104da8-241f-44ac-8643-771093748f5a","source":"Switch","target":"Context","type":"REFERENCES"},{"id":"9457e10c-1872-4a27-8bc0-e25cb6d9e2a8","source":"UptakeAsGround","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"d064ecfa-e4a0-4af9-aa6c-c063c0990de3","source":"UptakeAsGround","target":"Task","type":"REFERENCES"},{"id":"3af1f7f4-6f38-4ec8-bfa4-54ce675bbe3a","source":"UptakeAsGround","target":"ModestClaim","type":"REFERENCES"},{"id":"eefe63d9-c315-44f3-b9d2-adbe331fcbf4","source":"UptakeAsGround","target":"a8d32fab-af20-4ddf-8a64-6215551733a4","type":"HAS_INVARIANT"},{"id":"ced01f6e-24bd-4585-9322-5aa84a204bff","source":"UptakeAsGround","target":"98eacc9f-b60c-44c7-a13c-7edf5b50935c","type":"HAS_INVARIANT"},{"id":"59b9c8e0-120f-4dec-8066-dbb22513c261","source":"UptakeAsGround","target":"19509be0-cfe9-4596-a8ff-b5aab446f739","type":"HAS_PRECONDITION"},{"id":"a81a8e36-b474-4617-94a0-173c26803484","source":"UptakeAsGround","target":"cba27d07-c69e-475c-9653-77ec58667239","type":"HAS_PRECONDITION"},{"id":"27bd1393-8491-47d8-a3b6-14b508bd3782","source":"UptakeAsGround","target":"3e0da16e-0a88-4546-a7a8-c14724c66404","type":"HAS_POSTCONDITION"},{"id":"141e0f04-7a43-4288-8acc-0c3fdc3eccf2","source":"IdentityMask","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"0132daa3-a02d-4be8-aeb8-ba6dc5dd25ca","source":"IdentityMask","target":"NegativeProof","type":"REFERENCES"},{"id":"18bed773-f06d-41d3-a308-61332ddf0604","source":"IdentityMask","target":"CryptoShred","type":"REFERENCES"},{"id":"39c9ad03-b0d9-45bb-ae46-1559ad7fd16b","source":"IdentityMask","target":"0ed84ead-5b1a-4b4c-ad53-6d9805a9a70c","type":"HAS_INVARIANT"},{"id":"424f69cf-c57a-4e53-8399-db845a505b87","source":"IdentityMask","target":"696b8fa7-6e3f-4326-84d2-c631a536c788","type":"HAS_INVARIANT"},{"id":"961a498a-b3e5-4780-a669-44d7f086dd14","source":"IdentityMask","target":"886e3e6c-a18f-46c5-b236-ba53103f34a4","type":"HAS_PRECONDITION"},{"id":"6bbf9062-6b68-4db8-b187-a4cbfa5d65f4","source":"IdentityMask","target":"0fcd55de-2e49-43bd-ac81-9735efe582f5","type":"HAS_POSTCONDITION"},{"id":"f23a0799-bb08-439b-a50e-b57207d0a0d0","source":"PromiseGraph","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"518e8845-7699-489a-ad0f-6e32ca5bc68c","source":"PromiseGraph","target":"NegativeProof","type":"REFERENCES"},{"id":"a6471437-b36c-409a-9ea0-90d9e99b3b92","source":"PromiseGraph","target":"SpotAudit","type":"REFERENCES"},{"id":"e845d6f0-25cb-4554-a5a9-ebe8df1683c4","source":"PromiseGraph","target":"Agent","type":"REFERENCES"},{"id":"00652cc5-cf3c-434b-99e1-60f597307a1e","source":"PromiseGraph","target":"90bd7b8d-a80e-4924-8a58-95774c9399b5","type":"HAS_INVARIANT"},{"id":"bab2739e-f6a7-4115-b157-cfed19156f57","source":"PromiseGraph","target":"788a1c22-f5a2-45fd-9ac0-f505ab1cfc40","type":"HAS_INVARIANT"},{"id":"13d0379f-3998-4429-82ac-64660f29423b","source":"PromiseGraph","target":"37fa2849-4e3e-46b4-9926-91c88b723234","type":"HAS_INVARIANT"},{"id":"0177a048-7bd3-430b-9921-6ce9c446bdb1","source":"ConfusedDeputy","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"31ec4028-e683-4e1a-800d-b80eb6ec2bb4","source":"ConfusedDeputy","target":"Actor","type":"REFERENCES"},{"id":"092a0479-ac5c-4af4-b175-26cf7a15d7c9","source":"ConfusedDeputy","target":"Permission","type":"REFERENCES"},{"id":"d1c30a36-c6b1-4a5f-90de-41561a1718a6","source":"ConfusedDeputy","target":"Agent","type":"REFERENCES"},{"id":"4ea08bfa-aa04-46ed-946e-6671b31cb8c4","source":"ConfusedDeputy","target":"e2a28c4b-c785-4b47-a4b7-f85b887ebead","type":"HAS_INVARIANT"},{"id":"fa4ffb39-f4a5-4e13-88f3-23bcd055eb68","source":"ConfusedDeputy","target":"ec8eb077-7180-41b2-a2ad-3424abfa3441","type":"HAS_INVARIANT"},{"id":"c088b041-692b-407e-a46f-218fb7da81e6","source":"ConfusedDeputy","target":"6b76ca5e-8a5f-4d6c-8c9b-a7aef9cf8170","type":"HAS_PRECONDITION"},{"id":"a207050d-14b0-49f8-8be7-555c849a853e","source":"ConfusedDeputy","target":"253c0b5c-45ac-4430-8701-c42fe8a4b1dd","type":"HAS_PRECONDITION"},{"id":"9a84b9ca-0038-407b-b027-000a5d0290b5","source":"ConfusedDeputy","target":"fa9417b8-d5ff-4e32-aef5-fb02874c45a5","type":"HAS_POSTCONDITION"},{"id":"9c88993b-2158-49a8-b0df-98c67942bd09","source":"ConfusedDeputy","target":"e2157ee6-f7a2-4518-9162-b2098dbf2468","type":"HAS_POSTCONDITION"},{"id":"8313b13a-baf9-4c9d-8251-f0a7e2b4e9d0","source":"EventReact","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"1f40bdfd-426d-4556-90a8-ea3665b87477","source":"EventReact","target":"ReAct","type":"REFERENCES"},{"id":"f6dee705-6113-4aad-96f2-0d7e444c2865","source":"EventReact","target":"Agent","type":"REFERENCES"},{"id":"85c29703-addf-42a6-9e83-e5f818744fa8","source":"EventReact","target":"6b22b2be-2c76-40be-813e-55aa68fbce44","type":"HAS_INVARIANT"},{"id":"ed82ad8b-b54d-4788-b0b5-02c16206762e","source":"EventReact","target":"aeab8cd6-bd7f-464d-a4e2-6dc8335dd285","type":"HAS_INVARIANT"},{"id":"5ae1b6b4-1861-4d28-a0d6-56d7427680ac","source":"EventReact","target":"c7f79677-43ef-4e4c-a338-5594d9a1e723","type":"HAS_PRECONDITION"},{"id":"aee73f0e-832f-4cfd-bff9-8b60fe70d2e9","source":"EventReact","target":"44963835-37db-479e-a8d4-4391cc529c36","type":"HAS_PRECONDITION"},{"id":"cf21aca0-d047-4fcb-aedd-a6b72f6b7948","source":"EventReact","target":"1a47cba2-5f95-44e6-9f6b-3b188041eeca","type":"HAS_POSTCONDITION"},{"id":"e085b5ff-8ea3-446a-8b1d-e13dbcf7cf88","source":"CausalBarrier","target":"e5a36812-8586-4359-8f6a-7c5631923812","type":"IN_CATEGORY"},{"id":"08618c23-ac70-4ab0-b118-d8967523fa10","source":"CausalBarrier","target":"StateLock","type":"REFERENCES"},{"id":"69068442-2c53-4f04-9553-e76bd2b5141b","source":"CausalBarrier","target":"Agent","type":"REFERENCES"},{"id":"9d9dd650-74a4-4ba5-abda-7ea975554b0a","source":"CausalBarrier","target":"6341a332-abcb-4cda-a01f-4327192c3c72","type":"HAS_INVARIANT"},{"id":"09849a6d-2595-472f-a747-0a77cac91785","source":"CausalBarrier","target":"ee987a5f-873b-4a01-9762-624c9ab34ddb","type":"HAS_INVARIANT"},{"id":"921c9b97-465f-4797-a977-2fb475a27ef0","source":"CausalBarrier","target":"30b55fc2-5db8-4570-b5ec-037d745253aa","type":"HAS_INVARIANT"},{"id":"4967866f-d199-4cec-a649-76341d31a47a","source":"ContinuousResourceAuction","target":"a3dffe73-5c16-41fe-be7c-5f1b04ac73f2","type":"IN_CATEGORY"},{"id":"536eb912-4073-4a74-890e-2c9109d6fad1","source":"ContinuousResourceAuction","target":"Value","type":"ACCEPTS"},{"id":"f80527ad-4d6f-47d4-83a8-c917e5f01ab6","source":"ContinuousResourceAuction","target":"StateLock","type":"COMPOSES_WITH"},{"id":"efaf1087-5dde-4fc5-bcfb-449e903e83f2","source":"ContinuousResourceAuction","target":"Protocol","type":"REFERENCES"},{"id":"d72205c7-1cca-42f0-add3-ba21043d9e6a","source":"ContinuousResourceAuction","target":"57c3a345-36e7-4362-b77a-9ff5bc54de94","type":"HAS_INVARIANT"},{"id":"a380259a-27fe-4ac7-912b-fd1851fadf16","source":"ContinuousResourceAuction","target":"3fb3815a-f639-47e4-a7d8-75ee3a172d64","type":"HAS_INVARIANT"},{"id":"c434cdbd-6916-40e6-9a88-b6665c46441e","source":"ContinuousResourceAuction","target":"61b2babe-3840-45e1-baf1-df356e3aed4e","type":"HAS_INVARIANT"},{"id":"72e111f3-1071-4992-af79-43c0234cf076","source":"IdempotentWrite","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"e89ea7fa-7a66-433d-987d-36c4a03b39e2","source":"IdempotentWrite","target":"StateLock","type":"REFERENCES"},{"id":"b4c0e0e9-c382-4e6b-8c3b-9a5fea0e5ea7","source":"IdempotentWrite","target":"Identity","type":"REFERENCES"},{"id":"70663c89-e5de-4a4e-87bf-8b70488760d4","source":"IdempotentWrite","target":"c9a79a65-2e26-4c2b-a80f-f781630c42a7","type":"HAS_INVARIANT"},{"id":"292f15ee-8671-4841-b4a2-fdeea6d039f2","source":"IdempotentWrite","target":"a5afa675-63d5-4c77-8334-51509193a3ce","type":"HAS_INVARIANT"},{"id":"d3994974-ce27-49b4-87c2-c26ba4297b84","source":"IdempotentWrite","target":"a756e88f-b0f5-4602-87bd-f6b5242b7fd4","type":"HAS_PRECONDITION"},{"id":"152ce63b-a99d-475f-ae6f-e335e8371e9b","source":"IdempotentWrite","target":"40846231-fd31-4580-b6c8-fdd429d88f93","type":"HAS_POSTCONDITION"},{"id":"b6072ef2-7e88-40f8-8c52-50d34b1c9c94","source":"MonotonicCounter","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"320b29c5-1366-4a23-9160-8adab1419fcc","source":"MonotonicCounter","target":"StateLock","type":"REFERENCES"},{"id":"a9f34f0e-b6fb-4602-8741-a01645d6216d","source":"MonotonicCounter","target":"Value","type":"REFERENCES"},{"id":"cbe4633f-4b3c-4ec0-8ac9-b4d709523bc4","source":"MonotonicCounter","target":"f7217bd3-968d-495d-b108-257f9f922183","type":"HAS_INVARIANT"},{"id":"90cf4b36-ff95-480f-8bf3-c46f1b53c028","source":"MonotonicCounter","target":"4739d1cc-2e81-4c0f-961f-161a2c49febf","type":"HAS_INVARIANT"},{"id":"70e6b730-7f7d-46fe-8885-5a0a1bffb581","source":"MonotonicCounter","target":"2f477aea-669f-4279-b099-a83b26263f50","type":"HAS_PRECONDITION"},{"id":"ac9953b5-cf90-479b-ab80-c930ce415a0b","source":"MonotonicCounter","target":"2a76691c-61f2-4f2c-9b01-599ec1473db2","type":"HAS_POSTCONDITION"},{"id":"533947d7-1fd5-4bef-805f-0d255ce523ec","source":"UniqueHandle","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"b72bf479-9fcc-4606-9af5-8e1f489aa954","source":"UniqueHandle","target":"StateLock","type":"REFERENCES"},{"id":"529ba5c6-14b7-49c8-b280-39306590aa90","source":"UniqueHandle","target":"Agent","type":"REFERENCES"},{"id":"1c99fbc6-59d8-4eee-b22f-7e278bf8f235","source":"UniqueHandle","target":"Break","type":"REFERENCES"},{"id":"661c1b7e-f06b-49e0-a8f3-f51fcf519b90","source":"UniqueHandle","target":"8b108570-086b-45ab-8b95-367eb7c56f74","type":"HAS_INVARIANT"},{"id":"727e514e-2ade-48a2-a9dc-9ae7d6c46991","source":"UniqueHandle","target":"0b9d9fdb-5a89-4418-844c-bc4064e88b48","type":"HAS_INVARIANT"},{"id":"1491656f-f186-4b79-9b90-da15045103ba","source":"UniqueHandle","target":"a1fd352d-d4a2-4daa-9d2d-00897182cbdf","type":"HAS_INVARIANT"},{"id":"fe3e1754-d8ba-4d46-a675-797b677fc837","source":"UniqueHandle","target":"b5681498-6770-48a9-9300-a658b4ca0c5d","type":"HAS_INVARIANT"},{"id":"829d59b3-2e8d-4ea9-a1bb-150b58afb9d4","source":"PermissionEscalate","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"ec3dca0d-19c8-49b7-b9b2-e1fee6f7021d","source":"PermissionEscalate","target":"HumanApprove","type":"REFERENCES"},{"id":"7050ce7e-47a6-4a13-935b-7d2a1dfd3e65","source":"PermissionEscalate","target":"Agent","type":"REFERENCES"},{"id":"1abe4a43-392b-41c8-84ba-93fb3821456c","source":"PermissionEscalate","target":"TieredAccess","type":"REFERENCES"},{"id":"142d8cf2-195b-48da-bd3f-2af0ff110d97","source":"PermissionEscalate","target":"0bf63e17-2077-4cac-b731-56d73b654711","type":"HAS_INVARIANT"},{"id":"5c93881f-67c7-44ac-ba41-38eef6168575","source":"PermissionEscalate","target":"48ab446d-c375-45dc-98b9-236da4682649","type":"HAS_INVARIANT"},{"id":"839f4e1c-077b-4733-8fae-ce50a7018b82","source":"PermissionEscalate","target":"aa087d3d-06d9-4ea8-bc24-9073c72cb33f","type":"HAS_PRECONDITION"},{"id":"43dce34e-62de-43ec-9295-aa893dc27f2e","source":"PermissionEscalate","target":"1154e410-60ad-4446-8eaf-d3d585913ec8","type":"HAS_PRECONDITION"},{"id":"36945050-d71a-43ce-9ae2-b5022a33c845","source":"PermissionEscalate","target":"4e50c18b-845b-4ce0-af92-1195f0258aa9","type":"HAS_POSTCONDITION"},{"id":"93c33d38-5a59-4eba-bcc1-63077e783925","source":"IntentGap","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"e51eae88-3e51-4e7b-849e-d308f4a92ba1","source":"IntentGap","target":"Outcome","type":"REFERENCES"},{"id":"157c0834-4b72-4ada-b6a3-37ed85e7aeb0","source":"IntentGap","target":"Decision","type":"REFERENCES"},{"id":"42812703-34b8-4f58-a7ae-2d7d93426bcc","source":"IntentGap","target":"9bc967a5-1a80-4b27-8bdc-1d628bdec1b1","type":"HAS_INVARIANT"},{"id":"029db5ce-06a0-4754-8829-9cf7f6f99625","source":"IntentGap","target":"c7b6b292-53d5-4fda-98da-32108c640c27","type":"HAS_INVARIANT"},{"id":"948b7e5b-4bd7-447a-9f83-aa2771912354","source":"IntentGap","target":"9f068411-7d3c-48d6-bb96-df2710fe7aee","type":"HAS_PRECONDITION"},{"id":"86f0b4da-dfee-4306-87fb-c8252759a2b2","source":"IntentGap","target":"cd376be4-cb03-49e7-8d19-1bd48656c1cf","type":"HAS_PRECONDITION"},{"id":"2a12bede-dd53-42e8-b28e-621090b11b9c","source":"IntentGap","target":"53d4041b-2a8d-450b-80a4-b95223666e50","type":"HAS_POSTCONDITION"},{"id":"9031f5cc-3b67-4202-b08a-48b8490ebdbc","source":"IntentGap","target":"064af33d-f787-4d4d-a93f-def249f8b8cf","type":"HAS_POSTCONDITION"},{"id":"2d4b0d63-5cad-42ef-a0a5-bb1bda0e38fe","source":"Reflexion","target":"e38ff6e0-872e-4a63-a7ea-ebb84e174347","type":"IN_CATEGORY"},{"id":"c08334b0-cd40-479f-bfa9-856bf7f722de","source":"Reflexion","target":"Outcome","type":"REFERENCES"},{"id":"b67ee7b2-e550-4a15-b76a-56cb28918138","source":"Reflexion","target":"Scratchpad","type":"REFERENCES"},{"id":"c782779f-a878-442b-98cf-7e1fa5040e20","source":"Reflexion","target":"Task","type":"ACCEPTS"},{"id":"1eae93a8-ea0e-42b6-8279-33ed95ccc620","source":"Reflexion","target":"Plan","type":"REFERENCES"},{"id":"32834ea1-7276-4b19-9e53-f8b0ea87c381","source":"Reflexion","target":"Critique","type":"REFERENCES"},{"id":"b71aed60-81aa-4955-be5d-d8d86cc0f3ee","source":"Reflexion","target":"Goal","type":"REFERENCES"},{"id":"8312159b-0e58-4571-8df7-ccb077ca6efd","source":"Reflexion","target":"596d1f42-b9d7-4543-b644-4f3a41e5af6b","type":"HAS_INVARIANT"},{"id":"6b1af20d-6abf-43b3-ac3e-5dc1e4e1a67a","source":"Reflexion","target":"824ea2ad-920a-47a5-a351-1cb752d7fb34","type":"HAS_INVARIANT"},{"id":"166f816f-0336-46be-8322-7dac55cf7b95","source":"Reflexion","target":"00785dbd-ec1c-45fa-ba19-76d4db265a0c","type":"HAS_PRECONDITION"},{"id":"6645a1d9-62b5-430a-90de-af40be24fbde","source":"Reflexion","target":"66a41d9f-1d6d-45bb-b71e-b24f2c798f84","type":"HAS_PRECONDITION"},{"id":"ee253598-4027-452c-82a1-0fefde27f6b8","source":"Reflexion","target":"61ecf4f2-72f5-410b-bcdd-31e643101698","type":"HAS_POSTCONDITION"},{"id":"071cf63e-4e41-4454-8a37-04f141190b6c","source":"Simulation","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"f1d53f08-151b-4a2d-b8b7-a4b74b798e82","source":"Simulation","target":"Outcome","type":"REFERENCES"},{"id":"b63900af-cc3c-4c7c-aad3-5a67aa0e3c22","source":"Simulation","target":"State","type":"REFERENCES"},{"id":"2e3626fa-7062-4847-91b8-d58337518893","source":"Simulation","target":"22961d2a-278c-4241-9763-2028f7960064","type":"HAS_INVARIANT"},{"id":"74cec56d-c79e-4a9f-9c36-6077f1c3b3b8","source":"AcceptSpec","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"b18b8fed-8d55-4ca9-a384-abdd01c24de5","source":"AcceptSpec","target":"Spec","type":"REFERENCES"},{"id":"b9fb295f-d323-4485-8581-0bcb150b420d","source":"AcceptSpec","target":"Constraint","type":"REFERENCES"},{"id":"74c64e8b-f2d2-4e38-80d3-e17c0ebcd431","source":"AcceptSpec","target":"Criteria","type":"REFERENCES"},{"id":"03c94346-fba1-4a0d-9d00-0f068d11cddf","source":"AcceptSpec","target":"eee420ed-31b0-4d88-8ad2-847f928d726c","type":"HAS_INVARIANT"},{"id":"9d5cf3a8-0d40-4c0d-a445-5d3b6602c51a","source":"AcceptSpec","target":"7a975beb-6617-419d-8947-da7dfb670c73","type":"HAS_INVARIANT"},{"id":"d2ee2829-b22f-4276-a855-71a1e87cf48f","source":"Build","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"531cfc37-d419-4df0-9e6b-7a867a1ee758","source":"Build","target":"Act","type":"REFERENCES"},{"id":"537e375f-c904-4f25-8b2f-ae40a673eb3a","source":"Build","target":"Prototype","type":"REFERENCES"},{"id":"d1f67423-1e63-4c87-ba49-8e3b9ec286cd","source":"Build","target":"Artifact","type":"YIELDS"},{"id":"981fe7a1-5af9-47b0-8948-2f7346853d37","source":"Build","target":"Spec","type":"ACCEPTS"},{"id":"d60a4315-3994-4ba0-bced-4bab714d53a8","source":"Build","target":"Plan","type":"REFERENCES"},{"id":"c89e4265-6d51-40d4-a515-5e11ff2f8d81","source":"Build","target":"Value","type":"REFERENCES"},{"id":"67ec6017-7f12-44f6-989a-76c828558fb0","source":"Build","target":"Simulation","type":"RELATED_TO"},{"id":"b78c2e06-09a1-49d4-ae69-b629b18582c1","source":"Build","target":"5f53f9f5-3705-40f8-adf4-c3a52aba7585","type":"HAS_INVARIANT"},{"id":"537f6738-a506-4721-bdd1-2ac4f917d2db","source":"Build","target":"4f5ccd9a-a886-4cc3-88c6-68e045da4588","type":"HAS_INVARIANT"},{"id":"118c5e0f-5aa2-4de7-9a77-d5c667381645","source":"Build","target":"4eeee873-5d4b-42b4-8c11-b72d75c66d1a","type":"HAS_PRECONDITION"},{"id":"dd84d817-ec50-47b5-8d3c-c9a0d5c4ec46","source":"Build","target":"1af2cad9-3b68-431d-97cb-db0a604944ae","type":"HAS_POSTCONDITION"},{"id":"370e7971-9489-4afe-bb4e-ccc46abe8fdf","source":"FrameSpec","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"1c22f287-522d-4d79-8d99-6cf7fa593331","source":"FrameSpec","target":"Spec","type":"REFERENCES"},{"id":"a6702b27-fe29-4951-8fa0-cd5bdd3673d3","source":"FrameSpec","target":"Artifact","type":"REFERENCES"},{"id":"5090e0fc-b1d8-49cb-85b9-2122fb95e624","source":"FrameSpec","target":"Problem","type":"REFERENCES"},{"id":"afaec6d2-52ff-4161-84ef-a9931479fa42","source":"FrameSpec","target":"Constraint","type":"REFERENCES"},{"id":"7badf26c-8f9f-417a-80f3-6ea983b29a83","source":"FrameSpec","target":"bc992593-a5c6-4677-8b50-d0335cd89536","type":"HAS_INVARIANT"},{"id":"d98208f4-fc35-4f84-93bb-fc2a34ca7ac6","source":"FrameSpec","target":"a70e925c-4b8f-4daa-b4e4-705baf83c752","type":"HAS_INVARIANT"},{"id":"a8c3ec5c-c728-42bd-a80b-c049e18e2d2f","source":"Verification","target":"e38ff6e0-872e-4a63-a7ea-ebb84e174347","type":"IN_CATEGORY"},{"id":"e0a0fddd-c32f-4e93-b93a-99a2c7cf3999","source":"Verification","target":"Spec","type":"REFERENCES"},{"id":"85f90c03-bc9d-477e-adce-96edab4009b2","source":"Verification","target":"Artifact","type":"REFERENCES"},{"id":"29bab76a-46ac-4b0a-be8a-2091120ca86c","source":"Verification","target":"Check","type":"REFERENCES"},{"id":"55faa95c-f77e-4387-99c7-a6ab9d79867d","source":"Decompose","target":"e38ff6e0-872e-4a63-a7ea-ebb84e174347","type":"IN_CATEGORY"},{"id":"d9e076a3-ace3-4be6-ad47-42ae04e8d324","source":"Decompose","target":"Task","type":"ACCEPTS"},{"id":"95e1357c-0b46-4957-92b8-bb36dcc0c5d7","source":"Decompose","target":"Problem","type":"REFERENCES"},{"id":"f8d86950-62d0-4455-924e-0babe5c52b74","source":"Decompose","target":"Solution","type":"REFERENCES"},{"id":"f6a211e7-18bd-4eed-bc0e-17a2ff81c980","source":"Decompose","target":"Strategy","type":"REFERENCES"},{"id":"6ba7377c-8da5-4b43-81bc-f5dcd8b2ec1e","source":"Decompose","target":"ce468469-3d64-4970-8cec-3ae11588e961","type":"HAS_INVARIANT"},{"id":"56e38e36-aacc-4b54-97f0-b402dadc2c77","source":"Decompose","target":"b1f23edf-287f-4bdc-ad22-6b4e8f86f297","type":"HAS_PRECONDITION"},{"id":"befb5f6e-d2b6-4ff0-953b-921c695c4857","source":"Decompose","target":"3f5c42be-8c07-4aa2-8326-d4492b41a14e","type":"HAS_POSTCONDITION"},{"id":"88faa7f5-1d69-4f71-9bc3-0209c689f9c4","source":"GracefulDegradation","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"feeed201-a6de-4fd5-9aef-841372051dd8","source":"GracefulDegradation","target":"Strategy","type":"REFERENCES"},{"id":"74765a40-20a4-4d85-85b1-18d7f0d7e77c","source":"GracefulDegradation","target":"FailClosed","type":"REFERENCES"},{"id":"e65f3f58-f096-4bd3-993a-08251b81cfee","source":"GracefulDegradation","target":"Message","type":"REFERENCES"},{"id":"2b75b9fc-b183-4cc5-ac9d-6e02a6501602","source":"GracefulDegradation","target":"a4343c8c-1689-4341-8ec2-077cc34092ec","type":"HAS_INVARIANT"},{"id":"67d27c0d-d5f8-464c-92b0-2d2a2f179881","source":"GracefulDegradation","target":"d6738e81-840e-402c-845b-93414cab813a","type":"HAS_INVARIANT"},{"id":"6ac54742-4ba2-4e4f-a33e-714f9cd01b48","source":"GracefulDegradation","target":"8eec8447-619a-49ad-8c55-6e220667ddd5","type":"HAS_PRECONDITION"},{"id":"54575891-b0c5-4c0a-b75c-7bfdf2f430d1","source":"GracefulDegradation","target":"2dc14186-ac83-41e7-972c-8cae6e1992ee","type":"HAS_PRECONDITION"},{"id":"ea4dcdf8-1c74-41e1-9a9b-601fdfc102e7","source":"GracefulDegradation","target":"36cb148e-7782-485c-92f8-323c9f04e65a","type":"HAS_POSTCONDITION"},{"id":"9b5c7801-3fe9-42bf-bce9-db464a8148b7","source":"NoiseInjection","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"f0750a72-f5d4-4cbc-bcd5-514f98f69c47","source":"NoiseInjection","target":"Strategy","type":"REFERENCES"},{"id":"714e1ac5-a070-48d6-a1a1-8638cc8a45f9","source":"NoiseInjection","target":"Signal","type":"REFERENCES"},{"id":"40b4b746-b240-44a8-9ab8-a6364332aab1","source":"NoiseInjection","target":"Noise","type":"REFERENCES"},{"id":"1483a26e-8ef3-4cff-be3b-3a8a8339d7d5","source":"NoiseInjection","target":"Context","type":"REFERENCES"},{"id":"c880d31a-cff6-4f7b-a649-08d3dd049528","source":"NoiseInjection","target":"Card","type":"REFERENCES"},{"id":"7e4f1abd-b661-4d18-9727-888fed33ec7f","source":"NoiseInjection","target":"Agent","type":"REFERENCES"},{"id":"dc8234cb-d719-4c12-b9f3-5892e139f2f6","source":"NoiseInjection","target":"768b110f-0574-47cb-a690-89c1ef335d75","type":"HAS_INVARIANT"},{"id":"2d6e115d-c1f7-43ac-87db-fe6c859f4e7e","source":"NoiseInjection","target":"5a5aba35-029d-4e6e-a7d7-e8c1f5b6313a","type":"HAS_INVARIANT"},{"id":"09db6f99-bdac-4577-a5b7-ee6de1b9b357","source":"NoiseInjection","target":"ad57005d-0ad4-4e6c-86ac-07bdd7bf7bf1","type":"HAS_PRECONDITION"},{"id":"7ad60719-5182-4f9b-8dec-c9c5be4996d5","source":"NoiseInjection","target":"1da83882-252f-476f-9f00-195a72a0e5ba","type":"HAS_PRECONDITION"},{"id":"f17e8c4f-ce85-48f7-b13f-4e2994bbe1eb","source":"NoiseInjection","target":"033664e4-c1ab-4bea-8d1f-663addcaa405","type":"HAS_POSTCONDITION"},{"id":"119963c6-288b-4755-82d7-69121eb7b2cb","source":"OODA","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"c5732b9d-1039-436b-9f4b-6918712bf550","source":"OODA","target":"Strategy","type":"REFERENCES"},{"id":"fe2a7431-b43a-479f-b268-79f4e2508787","source":"OODA","target":"State","type":"REFERENCES"},{"id":"ef4e2e9f-095c-461a-8663-eafbe846e803","source":"OODA","target":"Act","type":"COMPOSES_WITH"},{"id":"2710bcc9-ed84-4e5d-843f-a62c81a38d61","source":"OODA","target":"Think","type":"COMPOSES_WITH"},{"id":"3ed2b542-cadb-47f7-8f7a-5ff2884db8f2","source":"OODA","target":"Loop","type":"REFERENCES"},{"id":"ef397cfe-1268-42f5-8a2d-1ecfe04d5645","source":"OODA","target":"Belief","type":"COMPOSES_WITH"},{"id":"2aaa12b4-32cf-4d4a-b129-9ab1be44df17","source":"OODA","target":"Observe","type":"COMPOSES_WITH"},{"id":"b516ceb7-9d0d-47ed-bbf5-b96b8843a9b2","source":"OODA","target":"Select","type":"COMPOSES_WITH"},{"id":"fa098188-321a-44d7-ae08-96300076b842","source":"OODA","target":"Agent","type":"REFERENCES"},{"id":"3ad11d5d-2b39-4dda-934c-3182138ae241","source":"OODA","target":"Context","type":"COMPOSES_WITH"},{"id":"0e23ddcb-de5e-4740-a83b-a0d4dc23417e","source":"OODA","target":"ReAct","type":"RELATED_TO"},{"id":"761e5403-4548-4cbb-83f1-1c8064f0131d","source":"OODA","target":"3911c9b9-ff4f-4a3c-949a-406408677272","type":"HAS_INVARIANT"},{"id":"66738fad-dc71-483f-9de6-121716e3badc","source":"OODA","target":"4eb6fdc6-7947-46fb-988a-5a713b56b059","type":"HAS_INVARIANT"},{"id":"2ac0899d-188a-452a-8199-3c274aa963bf","source":"OODA","target":"41cbd485-ad28-491d-b3fd-af48645d6e80","type":"HAS_PRECONDITION"},{"id":"4e43b0bb-eaf3-4804-ab56-2f8dae831ad6","source":"OODA","target":"ce22881d-4a3b-4037-8dc3-c7d1c217bcf2","type":"HAS_PRECONDITION"},{"id":"3853bdba-61fe-4f83-b4c4-e0fd0478598b","source":"OODA","target":"0037ffae-d93f-4a32-9b88-2851b1ced85a","type":"HAS_POSTCONDITION"},{"id":"cdc49211-5399-499d-8d3f-c00d705cd1ff","source":"OODA","target":"a85f2b65-e4e1-41fe-a923-95eb987e5a76","type":"HAS_POSTCONDITION"},{"id":"4bd2432d-975f-46e6-a62b-accdc104d6ab","source":"SacrificialProbe","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"68bc6dcf-99bc-4a6e-aec1-a789c6aa75e5","source":"SacrificialProbe","target":"Mode","type":"REFERENCES"},{"id":"7dfb989d-8f37-42e3-86bb-b09ff08ac9b9","source":"SacrificialProbe","target":"Signal","type":"REFERENCES"},{"id":"e2386c79-594b-4f28-ad12-5fa7081359f8","source":"SacrificialProbe","target":"Strategy","type":"REFERENCES"},{"id":"6de41bad-50da-49ce-a740-cde2dbe9fba8","source":"SacrificialProbe","target":"System","type":"REFERENCES"},{"id":"f154efc1-1360-4079-9a0b-b39ca7f6413a","source":"SacrificialProbe","target":"Probe","type":"REFERENCES"},{"id":"ea377f11-1daa-405b-b925-64a94a38cb23","source":"SacrificialProbe","target":"Agent","type":"REFERENCES"},{"id":"9d2f0061-9ad5-4db4-92bd-9ddae0c97861","source":"SacrificialProbe","target":"c61a3c7b-4da7-4e2a-af6e-e17a1c2d0ff9","type":"HAS_INVARIANT"},{"id":"b9f24a94-d870-41a5-a6ba-01e641950436","source":"SacrificialProbe","target":"61267f80-e804-44dc-8669-2b92e97f689b","type":"HAS_INVARIANT"},{"id":"b3bd4fb4-253e-453d-8616-993eed4601a5","source":"SacrificialProbe","target":"418afe37-0dc0-4ad1-a68b-4d16bd9e1ce2","type":"HAS_INVARIANT"},{"id":"54a7bd53-2224-41ff-9d4e-50d6defcf7df","source":"SacrificialProbe","target":"498a89a4-0e4e-4966-8f08-c474885a6df4","type":"HAS_PRECONDITION"},{"id":"cf0008b0-05ae-483c-b031-9dc5793dc3e6","source":"SacrificialProbe","target":"174a5e53-e288-449c-8f99-acdbbf3bd2b3","type":"HAS_POSTCONDITION"},{"id":"533f9396-e451-4d7a-a25b-b7b4467b2654","source":"Specialize","target":"e38ff6e0-872e-4a63-a7ea-ebb84e174347","type":"IN_CATEGORY"},{"id":"3b892199-bc11-41d2-a11d-fce3f0e3963b","source":"Specialize","target":"Generalize","type":"REFERENCES"},{"id":"31d70a0b-1429-45ca-b74d-f66c7535aa36","source":"Specialize","target":"Check","type":"REFERENCES"},{"id":"3f3eb0d1-cdb0-4c83-b789-3f85ac9da25c","source":"Specialize","target":"Context","type":"REFERENCES"},{"id":"ed1cc6b7-bf68-492b-8242-269980e03cca","source":"Specialize","target":"2e00dae2-b41a-4bba-b380-4f95b911841c","type":"HAS_INVARIANT"},{"id":"35de056a-ae0b-455a-ba35-a0ec4f6505bb","source":"Specialize","target":"d1be8fd5-6f5e-43cc-801d-54e4e081cdfa","type":"HAS_INVARIANT"},{"id":"a2638bbb-4d8b-4707-a4bb-72514d0fbfac","source":"Specialize","target":"86ad42ac-d8ad-41e7-8a1f-20286d571b54","type":"HAS_PRECONDITION"},{"id":"ee1cc219-3a7b-49b6-900c-66d9bb22da6f","source":"Specialize","target":"8459ba79-b473-4dcb-b8ad-30f21cd9d1b8","type":"HAS_PRECONDITION"},{"id":"daae46f1-3a27-4f7b-8d11-f43cd6093ade","source":"Specialize","target":"c946400b-b157-42e4-b791-12f87926d878","type":"HAS_POSTCONDITION"},{"id":"c4a55dff-baa5-4e16-946c-7311aa182ce5","source":"ConfidenceCalibrate","target":"90800e2d-25ad-47b4-9463-179cdb2d083f","type":"IN_CATEGORY"},{"id":"3289732a-92ed-4af7-8b1c-72b329d3cb0b","source":"ConfidenceCalibrate","target":"BayesUpdate","type":"REFERENCES"},{"id":"c03bc070-bc7a-4874-8d0e-4da747831706","source":"ConfidenceCalibrate","target":"Agent","type":"REFERENCES"},{"id":"9db28283-e5af-4290-b71d-329b0c232585","source":"ConfidenceCalibrate","target":"BaseRateInclude","type":"REFERENCES"},{"id":"fcf70626-a8c0-4588-89c4-28de8c953afe","source":"ConfidenceCalibrate","target":"1b8a2e24-3032-4c78-8ca0-46e3d5adcef0","type":"HAS_INVARIANT"},{"id":"5e4b1428-94ae-4816-8078-103174162bec","source":"DissentSeek","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"405ed2f5-d21c-405d-88c7-82693866d069","source":"DissentSeek","target":"SteelmanCheck","type":"REFERENCES"},{"id":"570fb619-655c-46eb-b1f9-3f10fc11caa4","source":"DissentSeek","target":"Quorum","type":"REFERENCES"},{"id":"97b25349-fcda-485d-8b14-2741903ca615","source":"DissentSeek","target":"Understand","type":"REFERENCES"},{"id":"6d890b76-a4c9-4745-b847-43b4031de234","source":"DissentSeek","target":"ConfirmationBlock","type":"REFERENCES"},{"id":"a9f8866b-2411-4124-b56e-d196e35636cc","source":"DissentSeek","target":"cf476f8b-e53b-41ab-a37f-5640dba7be2c","type":"HAS_INVARIANT"},{"id":"c0a71777-a14c-49b8-8c48-494ed0d47b6d","source":"DissentSeek","target":"25d93b5a-639c-412b-99b4-7020030cbba5","type":"HAS_INVARIANT"},{"id":"db03add5-4c1e-4eca-89bb-744afee98e4c","source":"DissentSeek","target":"69dff2b4-1e11-4e31-8894-89b8f2090284","type":"HAS_PRECONDITION"},{"id":"73f621b5-5c2b-429b-92f2-acd1ff371937","source":"DissentSeek","target":"0cac6d8a-8bdb-482f-9e39-37041a32ab7a","type":"HAS_PRECONDITION"},{"id":"5acfebb0-3ba0-42c7-9f69-776cae938816","source":"DissentSeek","target":"ae4bbf56-25d5-4dc9-80bd-e5fb9773cbda","type":"HAS_POSTCONDITION"},{"id":"e7f0c19e-9055-4a69-981b-c4faf0ef61e1","source":"DissentSeek","target":"e5d5a9ea-cd16-4426-b8e4-a86af68068d5","type":"HAS_POSTCONDITION"},{"id":"d81500c2-ecad-4aa8-a4dd-08f40ec958a9","source":"PreMortem","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"620af483-80e6-499a-8c8e-c611d633a80d","source":"PreMortem","target":"SteelmanCheck","type":"REFERENCES"},{"id":"0810cca2-8938-4111-94fc-2fbf3668c783","source":"PreMortem","target":"Task","type":"ACCEPTS"},{"id":"f0db8d89-e5d3-411d-9444-7e2243a6b2bb","source":"PreMortem","target":"RecursiveRootCause","type":"REFERENCES"},{"id":"e5c75366-639b-499a-b5ac-22fe4add9dda","source":"PreMortem","target":"Plan","type":"REFERENCES"},{"id":"39af7ba3-611c-48e4-8fc6-a23d74562a54","source":"PreMortem","target":"4fd1dc86-f8d7-41f4-9f32-9be050777c35","type":"HAS_INVARIANT"},{"id":"a1c5efd3-d97b-4883-b1a8-7695fd834368","source":"PreMortem","target":"ba897820-4570-4fc5-8d1a-50ea96f8c876","type":"HAS_INVARIANT"},{"id":"ca808387-7d96-4674-90e1-7819cf315022","source":"PreMortem","target":"36beaa39-00ab-42d5-b183-c07b1a88e8ed","type":"HAS_INVARIANT"},{"id":"39c02d1b-799a-48ba-978f-b984f25d9a65","source":"PreMortem","target":"7dfe00a1-b25f-4252-9480-e05a79b3cff4","type":"HAS_PRECONDITION"},{"id":"9936d74c-e027-4836-af35-4349d7f99966","source":"PreMortem","target":"dea85b94-3e52-4656-9550-13adefa7c625","type":"HAS_POSTCONDITION"},{"id":"3fde0ef3-5c7a-4a2b-96b7-abace505d826","source":"SteelmanFirst","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"4d87a711-e6ca-4b23-87ad-30329edb8fff","source":"SteelmanFirst","target":"SteelmanCheck","type":"REFERENCES"},{"id":"13dfbe9a-e5b1-4245-b964-f4576bef369d","source":"SteelmanFirst","target":"CognitiveBias","type":"REFERENCES"},{"id":"ed6ea850-6437-4fbe-bc08-7bcfa68431f9","source":"SteelmanFirst","target":"Problem","type":"REFERENCES"},{"id":"18b7b1e9-c33b-45dd-bfc0-100bcd64b7f3","source":"SteelmanFirst","target":"Agent","type":"REFERENCES"},{"id":"0ce4bb61-a6b8-466b-8f1b-9d18e35097ed","source":"SteelmanFirst","target":"a31d7740-67a3-428c-9fba-0ee5b9467c0f","type":"HAS_INVARIANT"},{"id":"3675fcea-90ab-4991-a8e3-c23ee3f475eb","source":"SteelmanFirst","target":"051913a7-2ac8-4576-ba59-db2cdd966be5","type":"HAS_PRECONDITION"},{"id":"3078df45-fb17-4256-922c-a00444d11337","source":"SteelmanFirst","target":"4e2b6d0c-f7e1-441a-a753-fc00ac3a5e82","type":"HAS_POSTCONDITION"},{"id":"c242960a-1fc7-4ee1-b82d-a3312fd6295e","source":"MemeticSeed","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"a8861abe-8dc2-4c56-9f8d-9ce6f0d8852d","source":"MemeticSeed","target":"Yield","type":"REFERENCES"},{"id":"5a729f6a-c80d-4600-bb3b-2bbabbf1fd70","source":"MemeticSeed","target":"TranslationProxy","type":"REFERENCES"},{"id":"cbc8e6e9-961d-4856-8e52-c789d4d9f027","source":"MemeticSeed","target":"Agent","type":"REFERENCES"},{"id":"013f821e-98d2-46f0-bf41-5798d0fde885","source":"MemeticSeed","target":"ExplainBeacon","type":"REFERENCES"},{"id":"85945e96-652e-4419-b112-23142c87f5ff","source":"MemeticSeed","target":"585b6321-e37e-47e4-8b8d-903b6240b02c","type":"HAS_INVARIANT"},{"id":"9f8e0ea7-3681-455a-b5d5-8c5536666865","source":"MemeticSeed","target":"afd0f9a7-c999-4337-9e75-5b1852cec484","type":"HAS_INVARIANT"},{"id":"5b7a671c-2afc-4f0b-8a1b-a4d4700dfd3d","source":"MemeticSeed","target":"6038ef1f-33f0-452d-b81a-25bcbfcbf23b","type":"HAS_PRECONDITION"},{"id":"104e7216-6cee-46f6-b3a3-32a59618d11a","source":"MemeticSeed","target":"63a05e83-3d5b-4f5d-877a-72e9597ad00c","type":"HAS_PRECONDITION"},{"id":"e5d0a1c0-46d0-4247-903e-4ea2139cf49e","source":"MemeticSeed","target":"49761baa-4968-40c5-9a84-aedfbd163b8a","type":"HAS_POSTCONDITION"},{"id":"5b0ff2fc-6b0b-4d5d-ba7f-b23130d72701","source":"MemeticSeed","target":"200a968e-9416-4797-a142-37f099d5cf1f","type":"HAS_POSTCONDITION"},{"id":"28be699e-727f-4567-b557-8659b8c3ecd4","source":"dc998770-80e1-4d40-8d8d-31037195e639","target":"edbe6b2e-5cba-4798-b009-b8f6a0d86323","type":"IN_LAYER"},{"id":"bedddd03-f8be-4d59-9ddd-dd9b9f0fe8c8","source":"WorldTransparent","target":"dc998770-80e1-4d40-8d8d-31037195e639","type":"IN_CATEGORY"},{"id":"ceeb6a62-d2b3-4f2e-8f6d-0054076a5a16","source":"WorldTransparent","target":"System","type":"REFERENCES"},{"id":"38fcd6e2-871e-4c9e-a6b8-25258ac71581","source":"WorldTransparent","target":"ExplainBeacon","type":"REFERENCES"},{"id":"ce719ca8-44d7-4635-9c84-f8c3aab2e7d9","source":"WorldTransparent","target":"55f127c4-96c5-4877-ae53-6e33b73e28e8","type":"HAS_INVARIANT"},{"id":"e937ac99-39d8-4cb8-83cf-a48d7e5835ef","source":"WorldTransparent","target":"88249646-d668-4075-8db8-5973adeeb8e8","type":"HAS_INVARIANT"},{"id":"e362739b-7ad8-4462-aeaa-a7dfe5bfdc36","source":"WorldTransparent","target":"7d045350-1461-4b35-a10c-6e9da9f372ce","type":"HAS_PRECONDITION"},{"id":"141d3edb-1dc8-45e0-8f6a-d4310500e1bb","source":"WorldTransparent","target":"5a548d34-611a-4f31-b5ff-c826741e559f","type":"HAS_POSTCONDITION"},{"id":"1c264994-2c9d-4aeb-9577-a40c472e275d","source":"ChunkMerge","target":"6fe7b13d-4ed3-4c51-ae9a-7943dd282dbf","type":"IN_CATEGORY"},{"id":"21b5544c-7a9e-4ce9-bf28-7bbdf43d5588","source":"ChunkMerge","target":"Compress","type":"REFERENCES"},{"id":"6a7fa497-0ca4-4ed5-8be3-b1ff91ab91c1","source":"ChunkMerge","target":"Aggregate","type":"REFERENCES"},{"id":"530d44a9-22cd-44c1-99b9-5abd6c5e1b68","source":"ChunkMerge","target":"Hierarchy","type":"REFERENCES"},{"id":"418bc9c0-d6f4-42bc-890a-59bdec8986de","source":"ChunkMerge","target":"Constraint","type":"REFERENCES"},{"id":"3d505aa2-5114-4eb8-8783-917cb7b135cd","source":"ChunkMerge","target":"4a92d91f-1a68-417a-8980-735665a3c327","type":"HAS_INVARIANT"},{"id":"4175595f-83d7-4eb4-892b-6a6b5f838603","source":"ChunkMerge","target":"1d0c5a26-bd2a-4532-9a7d-71adf1300036","type":"HAS_INVARIANT"},{"id":"be6318af-d87b-493c-b822-3e1c68e2ebec","source":"ChunkMerge","target":"2aba68c5-6f13-4e9e-9947-a7d7da88aaba","type":"HAS_INVARIANT"},{"id":"6319633f-5e91-4887-b75d-ebd4566f1176","source":"ChunkMerge","target":"cf2306ef-c8ad-4be7-885d-07190b48b3b8","type":"HAS_PRECONDITION"},{"id":"05ff0ddb-3599-4aec-90da-ed646ed0a453","source":"DriftWatch","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"ba005475-0d84-4ba7-8e03-666334066338","source":"DriftWatch","target":"Aggregate","type":"REFERENCES"},{"id":"e76dc905-8b8b-48e9-9cbc-77546f16f489","source":"DriftWatch","target":"Agent","type":"REFERENCES"},{"id":"4f295575-008e-4b0e-adac-7e91a17cb74f","source":"DriftWatch","target":"9f3a04bd-ea11-483b-930e-e6e89a9ade38","type":"HAS_INVARIANT"},{"id":"9728deb8-1a59-4020-a4fe-f75263eb7e25","source":"DriftWatch","target":"d7e7e20e-a70f-442f-91a1-1ce5d45e9421","type":"HAS_INVARIANT"},{"id":"0eabbd2f-59ef-4c76-a8e8-60f7a538f9e6","source":"DriftWatch","target":"8077354c-183e-42e0-a28c-b2a248e0b15d","type":"HAS_PRECONDITION"},{"id":"421b3fa2-0288-4d3b-9e63-2f6bb6165e86","source":"Parallelize","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"8ef76348-5ed2-4e10-ad0d-592016f1203e","source":"Parallelize","target":"Mode","type":"REFERENCES"},{"id":"09897ab4-c830-495f-a409-f016b19cf898","source":"Parallelize","target":"Parallel","type":"REFERENCES"},{"id":"673ff445-027b-4f21-9b22-32112301d21c","source":"Parallelize","target":"Strategy","type":"REFERENCES"},{"id":"0afeee28-7390-45da-80e1-9e88b3c1b411","source":"Parallelize","target":"Result","type":"REFERENCES"},{"id":"7c938ac2-89c0-40f9-8e79-ecae62688060","source":"Parallelize","target":"Task","type":"ACCEPTS"},{"id":"0cea58cb-1a4b-4365-9052-9fbee76b98b2","source":"Parallelize","target":"Aggregate","type":"COMPOSES_WITH"},{"id":"91a633a0-3881-4a50-a0e9-e3874c024783","source":"Parallelize","target":"CognitiveBias","type":"REFERENCES"},{"id":"65648e84-2f93-42cd-8f6e-47e5d9badad2","source":"Parallelize","target":"7a20c945-1fb2-4485-8cab-15ab2557d80b","type":"HAS_INVARIANT"},{"id":"4b678ceb-270b-4d52-9e45-411674f4f828","source":"Parallelize","target":"20a2e006-ac2d-4143-a12b-e43991290611","type":"HAS_INVARIANT"},{"id":"7e10bc46-b494-4d46-b25d-dde815a7ba4c","source":"Parallelize","target":"05bbfb83-d324-405e-947d-b6149fee93e6","type":"HAS_PRECONDITION"},{"id":"70d8ce78-e014-4329-8f29-ff313e8aef05","source":"Parallelize","target":"52d23c1b-5549-459f-bb63-bef40915ea51","type":"HAS_PRECONDITION"},{"id":"51f53c21-a22c-4ed8-af80-d11173d27aca","source":"Parallelize","target":"25a36420-5bb0-4243-9f6f-9570ca0d8401","type":"HAS_POSTCONDITION"},{"id":"234b8010-e73c-4965-8ee0-cc04fe349452","source":"PerspectiveEnsemble","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"66adf3a0-043f-41a6-a5c1-92c2a26538ba","source":"PerspectiveEnsemble","target":"Aggregate","type":"REFERENCES"},{"id":"f2d28cf2-f743-49ec-9d97-682218270abe","source":"PerspectiveEnsemble","target":"Problem","type":"REFERENCES"},{"id":"8a883810-6ce0-4ea6-b32d-fb194a43b34f","source":"PerspectiveEnsemble","target":"Synthesis","type":"REFERENCES"},{"id":"e3ea00e7-2aee-43bd-a187-a8f5063d898a","source":"PerspectiveEnsemble","target":"Chain","type":"REFERENCES"},{"id":"3ffb574b-16d1-468e-b2e2-0ea31da060ee","source":"PerspectiveEnsemble","target":"Context","type":"REFERENCES"},{"id":"7e788367-a0d3-4dcc-aca8-4c39210b7e30","source":"PerspectiveEnsemble","target":"SteelmanCheck","type":"REFERENCES"},{"id":"c0d3e0a0-3237-4cf4-a1da-82f4e1d46970","source":"PerspectiveEnsemble","target":"Agent","type":"REFERENCES"},{"id":"737c8255-57d2-47ea-aadf-a899a5d9c2ea","source":"PerspectiveEnsemble","target":"0b047d78-165e-4fb1-9622-ec1bf8cc4717","type":"HAS_INVARIANT"},{"id":"65688df7-f7db-412b-971b-596c0500a456","source":"PerspectiveEnsemble","target":"1ba8d70f-d9bd-447c-940e-fda91d7b09dd","type":"HAS_INVARIANT"},{"id":"4881a4cd-f5ca-41ab-ba82-64a17fdf2011","source":"PerspectiveEnsemble","target":"a96ad5e4-deeb-4682-8b88-84944e4f4b0b","type":"HAS_PRECONDITION"},{"id":"d3ee70fd-847d-439a-8118-2e15a1104018","source":"ProphetFanOut","target":"90800e2d-25ad-47b4-9463-179cdb2d083f","type":"IN_CATEGORY"},{"id":"069dcdf1-b358-4882-985e-bcd86671ad65","source":"ProphetFanOut","target":"Chain","type":"REFERENCES"},{"id":"fad61942-8691-47e6-81e7-1279f1d7d09f","source":"ProphetFanOut","target":"Aggregate","type":"REFERENCES"},{"id":"3da2295a-032b-4cf2-be85-7e723ab677b8","source":"ProphetFanOut","target":"Quorum","type":"REFERENCES"},{"id":"844d2cbe-8f28-4379-a49c-80f6c6d45cea","source":"ProphetFanOut","target":"4ed292cf-184a-458a-afc5-13b6bd71c265","type":"HAS_INVARIANT"},{"id":"bf763683-e16d-49f5-98ce-98f1e87d7374","source":"ProphetFanOut","target":"753b195b-55d3-4e5d-8c65-aa321f1b38a7","type":"HAS_INVARIANT"},{"id":"27a6c37c-5458-433f-a67e-98cf9cde597a","source":"ProphetFanOut","target":"87ff0f6f-4500-4cd1-8786-19be524614a8","type":"HAS_PRECONDITION"},{"id":"97d48853-6c5f-433a-922a-ced315eb1c07","source":"ProphetFanOut","target":"147574cd-ed9e-44f6-bda8-dacc946216f9","type":"HAS_POSTCONDITION"},{"id":"8849c0db-a4cf-4acd-92e7-17462d3dd743","source":"SelfConsistency","target":"e38ff6e0-872e-4a63-a7ea-ebb84e174347","type":"IN_CATEGORY"},{"id":"d9e07b5e-3248-4ec2-a611-945535879394","source":"SelfConsistency","target":"Aggregate","type":"REFERENCES"},{"id":"9ffe59c0-86a3-49d6-94a0-37d365eda8f1","source":"SelfConsistency","target":"8dce2258-53f0-4a85-8d13-e126fca76c95","type":"HAS_INVARIANT"},{"id":"60d47339-76d5-4ba8-ba4c-30decea17a2a","source":"SelfConsistency","target":"936f7b3a-8456-4f76-a532-f6de1aac60c7","type":"HAS_INVARIANT"},{"id":"4d4a1cdf-1bc8-47be-a893-b6283979aad1","source":"SelfConsistency","target":"1f863bba-1d60-45fc-90f5-6f61ffe123bb","type":"HAS_INVARIANT"},{"id":"cbd10ac9-58b8-44e7-9e32-0c9ba5a70c3e","source":"ContextSwitch","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"8137d588-f6f2-4dbe-9048-fc3e460cc16e","source":"ContextSwitch","target":"Mode","type":"REFERENCES"},{"id":"fc3d5788-852e-4e1a-b0e3-c7bf11aecdfe","source":"ContextSwitch","target":"Switch","type":"REFERENCES"},{"id":"a6b3d908-40e3-4786-a4b8-fe1f35fe2155","source":"ContextSwitch","target":"Agent","type":"REFERENCES"},{"id":"49622841-3f41-4fa5-a10e-d8b331ae32e4","source":"ContextSwitch","target":"Context","type":"ACCEPTS"},{"id":"36a8d765-dadb-4958-81a1-b66a3fd063b8","source":"UptakeOverTimestamp","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"ba227b38-8428-44c0-8d7c-404d2fd32898","source":"UptakeOverTimestamp","target":"UptakeAsGround","type":"REFERENCES"},{"id":"82868c4d-ed87-4f35-9e9d-d03bcd7d3b04","source":"UptakeOverTimestamp","target":"Problem","type":"REFERENCES"},{"id":"24287223-257e-4a82-bbac-36e0ead09d93","source":"UptakeOverTimestamp","target":"5f010fd5-0972-4800-8896-d98ec5fe215e","type":"HAS_INVARIANT"},{"id":"861458a1-3868-498a-88d4-a3ecb72d44fb","source":"UptakeOverTimestamp","target":"e626ba7e-6dc9-4636-8b39-c5b6b57c2e16","type":"HAS_INVARIANT"},{"id":"531781d8-f114-4311-a031-714ab058794f","source":"UptakeOverTimestamp","target":"7ccf6872-70d1-4943-b211-d924f5ce514a","type":"HAS_PRECONDITION"},{"id":"7bfb3e30-b6e0-4552-ab33-9402a983ddd7","source":"UptakeOverTimestamp","target":"a499ce76-d729-43b1-9762-647c4e1af6fc","type":"HAS_PRECONDITION"},{"id":"04e91d25-e015-4017-8523-7efc16f9f940","source":"UptakeOverTimestamp","target":"c1e77493-d835-47c5-8668-7e1e5ff827fc","type":"HAS_POSTCONDITION"},{"id":"12f74289-88cc-4a8d-9c5e-7f8179126b15","source":"UptakeOverTimestamp","target":"c9c914d4-f5d3-43d7-828a-eb35a0974a92","type":"HAS_POSTCONDITION"},{"id":"739b1057-8082-4679-94a6-cd1c2bf6d999","source":"GhostTrail","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"feb3a5b8-b166-4763-910b-c664e04abcfd","source":"GhostTrail","target":"Trace","type":"REFERENCES"},{"id":"a1a5767a-eb17-4126-b06e-5799ffd37d26","source":"GhostTrail","target":"Protocol","type":"REFERENCES"},{"id":"6f7c9448-bde5-4a56-bccd-07a9b45f9d94","source":"GhostTrail","target":"IdentityMask","type":"REFERENCES"},{"id":"a7657ecd-b0e7-4df1-a935-066a813b7e99","source":"GhostTrail","target":"Identity","type":"REFERENCES"},{"id":"334e615f-0c46-40a2-aa77-c157fc7ac6ca","source":"GhostTrail","target":"Agent","type":"REFERENCES"},{"id":"155d82cc-618c-4fba-948d-dd052cd4c27e","source":"GhostTrail","target":"21edabbe-e7e2-427e-97c5-ff45242883a4","type":"HAS_INVARIANT"},{"id":"b4f900fa-7550-478d-9def-936c86037dad","source":"GhostTrail","target":"d8b9dabc-4f45-47c7-96e3-48d815ccaa09","type":"HAS_INVARIANT"},{"id":"129e6b31-f73e-46f7-a44a-d4ce210ad020","source":"GhostTrail","target":"cbf958f1-9264-4fe9-99f0-dee344044213","type":"HAS_PRECONDITION"},{"id":"cbb6adc8-0fd6-4e10-a4fd-6f67f60a2a4c","source":"GhostTrail","target":"445324bf-fafc-4ce2-b52f-0ddfbb44a32c","type":"HAS_PRECONDITION"},{"id":"fdf0fad0-71f2-48b7-af49-7ef5d7fc239b","source":"MimicMask","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"b4196d48-c140-4d74-86c7-53d4e17a805d","source":"MimicMask","target":"IdentityMask","type":"REFERENCES"},{"id":"eadfe16d-3e46-41ba-adac-54c2962ced7e","source":"MimicMask","target":"Noise","type":"REFERENCES"},{"id":"fb27dd2a-f827-413f-97bd-43f1577891ff","source":"MimicMask","target":"e726adb2-0d98-4cbc-abb5-167f1194f56c","type":"HAS_INVARIANT"},{"id":"6bbb5729-214f-4edd-9be5-1214efc00c6b","source":"MimicMask","target":"7eab7bb5-520e-46e1-ad97-3ad5e94b2b4f","type":"HAS_INVARIANT"},{"id":"be0cb8d3-fb57-454b-8ca2-99a41a328f7b","source":"MimicMask","target":"d07d76f1-e091-41ec-8588-79dd3de49ca1","type":"HAS_PRECONDITION"},{"id":"a163b1d3-0d42-423c-b8ea-f25fcfc3a0c9","source":"MimicMask","target":"c4b2dd1e-6081-4e0f-9e1c-95873efa0249","type":"HAS_POSTCONDITION"},{"id":"71099f31-c4ca-4d43-9905-0b8108305b78","source":"RingWitness","target":"579b02af-c094-442f-8ef9-67bcd86bd62f","type":"IN_CATEGORY"},{"id":"278b8df4-4857-45fc-a27d-67ba68d04c7f","source":"RingWitness","target":"IdentityMask","type":"REFERENCES"},{"id":"c270891f-6505-41fd-bca2-502cb68a76c4","source":"RingWitness","target":"b64634ff-da95-44c6-a5e6-eb5112f39b27","type":"HAS_INVARIANT"},{"id":"04a8e424-0b70-4c4b-b3ad-6ad12ff75dc5","source":"RingWitness","target":"d1d3c5f1-8c3f-4ce3-b3d3-5f8d45994e68","type":"HAS_INVARIANT"},{"id":"69f6cc8f-9079-43a6-b1cf-4db474671b2f","source":"RingWitness","target":"1fc74cda-847a-4b45-90f7-a42b207e216c","type":"HAS_PRECONDITION"},{"id":"dabeb2fc-27f4-4af4-8aa4-11b316ba8d58","source":"RingWitness","target":"f3fbaddc-1f71-4e83-96e5-0a1943b105ba","type":"HAS_PRECONDITION"},{"id":"3a8a1207-af23-4e6a-bb53-10de776e57fe","source":"RingWitness","target":"2bba979a-0c90-4e45-b53f-7425a85c788a","type":"HAS_POSTCONDITION"},{"id":"6aef5095-275a-4086-8856-f715ea76f910","source":"TimeWarpLog","target":"8f497759-ce27-442f-9c55-27f3c2ad7c49","type":"IN_CATEGORY"},{"id":"4ffc8976-9b55-4534-9a86-b6ae62eb1d99","source":"TimeWarpLog","target":"System","type":"REFERENCES"},{"id":"38545e9a-c180-4f08-930c-229ae99cb3aa","source":"TimeWarpLog","target":"State","type":"REFERENCES"},{"id":"d97e985c-1c67-4fbe-89c1-d9bb503a09fc","source":"TimeWarpLog","target":"WorldReversible","type":"REFERENCES"},{"id":"48acf48c-4877-4b2c-a2b1-bf5773908b2d","source":"TimeWarpLog","target":"CausalBarrier","type":"REFERENCES"},{"id":"1a0da94e-0aa6-476a-a136-4e8cfcabfc96","source":"TimeWarpLog","target":"Agent","type":"REFERENCES"},{"id":"ce12d93c-bfe8-4abf-955f-1a481225930d","source":"TimeWarpLog","target":"74ff8279-1c5a-45bf-b9e2-a2c26a990134","type":"HAS_INVARIANT"},{"id":"f98986d6-093c-4c0d-8d9c-423c7998d949","source":"TimeWarpLog","target":"16622c1f-b8c1-45e6-bb73-fa9a6caabba2","type":"HAS_INVARIANT"},{"id":"f4429564-cbbd-44c4-8c1c-9b186f5fd1d3","source":"TimeWarpLog","target":"9ab9c9b9-a345-470f-804c-87e29d84b4df","type":"HAS_INVARIANT"},{"id":"b9eeec75-578f-4a7b-9835-d504ec63ff9e","source":"TimeWarpLog","target":"101a876c-c171-49fb-95cb-54a0e1e89529","type":"HAS_PRECONDITION"},{"id":"13764de7-2c4d-496c-a7ac-590723605e6b","source":"TimeWarpLog","target":"7d92c166-091e-4f09-810b-4312f83b7f80","type":"HAS_POSTCONDITION"},{"id":"4afbf88e-9fb7-47e8-b146-2d0d6cee8485","source":"AttentionMarkets","target":"a3dffe73-5c16-41fe-be7c-5f1b04ac73f2","type":"IN_CATEGORY"},{"id":"f5f41433-9459-4975-a94b-1c51b9f42161","source":"AttentionMarkets","target":"ContinuousResourceAuction","type":"COMPOSES_WITH"},{"id":"c6bb7f31-c4a8-4c2f-8103-a2e2b451e627","source":"AttentionMarkets","target":"Signal","type":"REFERENCES"},{"id":"11bcfda3-de19-4802-8c11-815f2da8a516","source":"AttentionMarkets","target":"Value","type":"REFERENCES"},{"id":"5ed43119-2792-48eb-a073-20f2b2a72dc7","source":"AttentionMarkets","target":"c31d31e5-1600-4e76-a3b7-aa9cce08d574","type":"HAS_INVARIANT"},{"id":"df256979-d72c-4839-a9a6-a74cb18166d3","source":"AttentionMarkets","target":"e7b99fb4-c548-4b1d-96da-b995fafbbecf","type":"HAS_INVARIANT"},{"id":"28ff96e3-326f-4a31-9c24-c304b772724d","source":"AttentionMarkets","target":"282611d5-f587-47de-9fda-046b123f757b","type":"HAS_INVARIANT"},{"id":"4cfe9e02-e298-4da7-b7a1-848e8c3d019d","source":"AttentionMarkets","target":"a26e529a-9885-4fc2-bb71-95573c8c40da","type":"HAS_INVARIANT"},{"id":"f04531e4-0c0e-4934-8aab-00d42440a059","source":"AttentionMarkets","target":"07f54a64-4a89-4573-9e91-3938443f9cec","type":"HAS_PRECONDITION"},{"id":"b4d0e370-cc77-4b21-845a-0e6efbf17eda","source":"AttentionMarkets","target":"fdad5c56-3c9e-454e-9521-57c5ff870245","type":"HAS_PRECONDITION"},{"id":"a12455c5-8ee9-4c66-9f78-d53b18a1ee87","source":"AttentionMarkets","target":"b96fd603-8aa9-46b4-9295-e750267135dc","type":"HAS_PRECONDITION"},{"id":"62372add-3625-4b6d-b6c5-4731bc82e8d3","source":"AttentionMarkets","target":"129ddb08-30c3-4b35-bbf2-b57f1d4c9d07","type":"HAS_POSTCONDITION"},{"id":"eb23d3a8-0b54-4242-b387-c9c4b3d6ce84","source":"AttentionMarkets","target":"e5eb812f-3f79-4797-894f-2415a07e0d66","type":"HAS_POSTCONDITION"},{"id":"9b5713d5-75f4-4800-9d4b-c4d97c580ff0","source":"StateSnapshot","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"9c29f60c-deab-46f5-8dff-b5659a26a67b","source":"StateSnapshot","target":"Trace","type":"REFERENCES"},{"id":"3c15b4fb-ed15-40e7-ac4a-1e83bcaa1ef6","source":"StateSnapshot","target":"State","type":"REFERENCES"},{"id":"7d3e63bb-55c9-480f-9838-1d05b93b4999","source":"StateSnapshot","target":"IdempotentWrite","type":"REFERENCES"},{"id":"ba66f804-aa5c-4473-a877-178a36dd419e","source":"StateSnapshot","target":"CryptoShred","type":"REFERENCES"},{"id":"83d4e406-9a6f-4f05-ab22-9b29f1717e9c","source":"StateSnapshot","target":"Snapshot","type":"REFERENCES"},{"id":"339c9bd7-d702-45c1-815d-e42d3f9f10df","source":"StateSnapshot","target":"10eba840-bce8-4050-9b09-b9e669b846b7","type":"HAS_INVARIANT"},{"id":"c4fb423b-77cf-4fe0-9828-2ded479b6aa2","source":"StateSnapshot","target":"2c55ed7d-969e-44c0-8c21-bfd87e428b95","type":"HAS_INVARIANT"},{"id":"d7cfb31c-6bf7-4aeb-a633-9747946e48ad","source":"StateSnapshot","target":"614267df-c755-4fab-b9a0-d32a0e2a7895","type":"HAS_PRECONDITION"},{"id":"736fb1fc-9d3e-498b-8e35-a82f9ee67dd0","source":"StateSnapshot","target":"1cfcd968-f4d1-4066-8493-5be24d2a632a","type":"HAS_PRECONDITION"},{"id":"a35c873d-c31f-4bda-99af-2c346c28cf69","source":"StateSnapshot","target":"b0dc8ae9-b028-470a-bcb6-da507d0e7c16","type":"HAS_POSTCONDITION"},{"id":"a0e163fd-a665-4f89-8ffa-2b470247d5e9","source":"HeldRelease","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"74353700-24c1-48ff-8595-1f1cd001c04c","source":"HeldRelease","target":"UniqueHandle","type":"ACCEPTS"},{"id":"5f407d75-8062-4802-b47d-8c5e28308b31","source":"HeldRelease","target":"Condition","type":"REFERENCES"},{"id":"79279143-9f01-4f06-8974-91c2473c047f","source":"HeldRelease","target":"State","type":"REFERENCES"},{"id":"86d2f594-d5e1-4ede-847d-a043eeb3a15b","source":"HeldRelease","target":"Value","type":"REFERENCES"},{"id":"2ef6671b-8e0c-4651-a854-c85b39410380","source":"HeldRelease","target":"5dd2ebfe-58ae-48a1-bb00-1cfa2bf76e9a","type":"HAS_INVARIANT"},{"id":"aa480d6c-d0ca-4756-a15a-248faac63a8a","source":"HeldRelease","target":"b2c24195-358d-455c-bf69-c348fb7431bb","type":"HAS_INVARIANT"},{"id":"170dabd6-8ed1-4e8d-9978-d0ba68ab4364","source":"HeldRelease","target":"961ad1f6-9a98-420f-bda0-6ea30169d8a6","type":"HAS_INVARIANT"},{"id":"0a525b8e-4d13-45d1-8c8b-abb7d6c89534","source":"ChainOfThought","target":"e38ff6e0-872e-4a63-a7ea-ebb84e174347","type":"IN_CATEGORY"},{"id":"87cf39d6-cc76-4b37-bcb5-c4478a0fba2b","source":"ChainOfThought","target":"StepBack","type":"COMPOSES_WITH"},{"id":"5a728823-5649-4151-9651-80a586952866","source":"ChainOfThought","target":"Reflexion","type":"COMPOSES_WITH"},{"id":"7a30bf35-2854-4c9c-88c5-51608d6ad676","source":"ChainOfThought","target":"Think","type":"REFERENCES"},{"id":"69b9f15a-7b7c-4fd8-b86a-e4aa2441a4b7","source":"ChainOfThought","target":"Topology","type":"REFERENCES"},{"id":"a7abdf49-a066-4d2f-9b91-655eb7fea195","source":"ChainOfThought","target":"Chain","type":"REFERENCES"},{"id":"f8b503e8-3d78-473a-97ac-1b7805869106","source":"ChainOfThought","target":"ProgramOfThought","type":"RELATED_TO"},{"id":"1cb7a203-4c3c-48c0-bb8a-7ed11eceee31","source":"ChainOfThought","target":"ReAct","type":"RELATED_TO"},{"id":"93967db7-5362-48f8-ac7d-9d6683283a70","source":"ChainOfThought","target":"26d72131-b9d2-4f54-bd07-efbb621640cb","type":"HAS_INVARIANT"},{"id":"db14120b-37c8-4f7c-a781-f632a4b40847","source":"ChainOfThought","target":"02cdb9e5-218b-4c00-ba0d-ab64b5c1dd57","type":"HAS_INVARIANT"},{"id":"8f2971d6-3567-4eca-bec2-c43194612b0c","source":"DogfoodFirst","target":"a3dffe73-5c16-41fe-be7c-5f1b04ac73f2","type":"IN_CATEGORY"},{"id":"3cd1d5e9-b101-4b62-b86c-780f0139ce3c","source":"DogfoodFirst","target":"Protocol","type":"REFERENCES"},{"id":"b84bdeb0-b056-436f-a883-2031dda88007","source":"DogfoodFirst","target":"CognitiveBias","type":"REFERENCES"},{"id":"24a816f2-78d0-4278-946d-f3b2eb167b6b","source":"DogfoodFirst","target":"Gate","type":"REFERENCES"},{"id":"b1cb4332-ee2e-448b-9d6c-c93ea0f9931e","source":"DogfoodFirst","target":"Canary","type":"REFERENCES"},{"id":"4f664c39-834d-4a8f-85be-c529a2b7b496","source":"DogfoodFirst","target":"Reflexion","type":"REFERENCES"},{"id":"75401948-3175-410e-af5d-558fffc82f31","source":"DogfoodFirst","target":"0844d528-70b5-4cf0-9e4b-f60c639f27d1","type":"HAS_INVARIANT"},{"id":"69ced916-5280-48e4-9e9f-8768f696228b","source":"DogfoodFirst","target":"8dcd1204-d2eb-44d7-a6b4-968040989452","type":"HAS_INVARIANT"},{"id":"ae938562-9830-49aa-b239-de555eb8631b","source":"DogfoodFirst","target":"fd21b72b-db49-4a6e-95f3-f01926c1ec93","type":"HAS_PRECONDITION"},{"id":"3e2698ee-1197-4ff8-9306-b055971fe3b5","source":"DogfoodFirst","target":"4b1cd8a2-65f2-41e6-a9dd-d57d3623c47e","type":"HAS_PRECONDITION"},{"id":"1e794950-29ad-4b45-b560-4d36d71ac10c","source":"DogfoodFirst","target":"3e1c30ec-6251-4e16-83f2-80de83f6603d","type":"HAS_POSTCONDITION"},{"id":"46dea3ec-07db-42de-a0a0-43213276fccb","source":"DogfoodFirst","target":"ee541cdd-8fa4-476a-ad23-50efa6407ec6","type":"HAS_POSTCONDITION"},{"id":"5df61224-1241-4989-b2f4-5c3584b8bede","source":"MetaCheck","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"3ec8631c-6977-4cb5-8db7-0c04fe069e15","source":"MetaCheck","target":"Reflexion","type":"REFERENCES"},{"id":"756aa362-0b33-4379-9609-8c0f48d18322","source":"MetaCheck","target":"Audit","type":"REFERENCES"},{"id":"6772f9c1-2062-4b77-8e59-07ce960024f6","source":"MetaCheck","target":"Meta","type":"REFERENCES"},{"id":"630d238b-24b5-4f61-b31a-4e02466dec9d","source":"MetaCheck","target":"Check","type":"REFERENCES"},{"id":"1b0c4238-6305-4ca1-877e-3c0c247af6de","source":"MetaCheck","target":"9c8022cd-283f-4ad6-892d-29d31acd84ea","type":"HAS_INVARIANT"},{"id":"f74e6a29-6b1e-4412-a9c2-3bded8650569","source":"MetaCheck","target":"e7cd6868-f5b1-49ab-bc52-292fdf8190e5","type":"HAS_INVARIANT"},{"id":"371b9f90-d6a4-4ec3-8fd8-3339ca325fc4","source":"MetaCheck","target":"5623bc2d-27e8-43ad-b763-041486b396b2","type":"HAS_PRECONDITION"},{"id":"2778774e-0469-4240-8a38-be41a489ed6b","source":"MetaCheck","target":"6ef8a6be-1148-4b43-b88a-cede29115ae9","type":"HAS_PRECONDITION"},{"id":"44c06181-a9e1-4272-b2af-6bb57f03584b","source":"MetaCheck","target":"463131d5-2923-42b5-8375-a609c7b86292","type":"HAS_POSTCONDITION"},{"id":"e55dd00d-9217-4391-b2f7-8b63d0ac420e","source":"CognitiveEcho","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"1ab43214-a32e-4945-b064-4434247132ff","source":"CognitiveEcho","target":"Simulation","type":"REFERENCES"},{"id":"965e15ff-18a7-4f4f-a649-366d0789ac7d","source":"CognitiveEcho","target":"Signal","type":"REFERENCES"},{"id":"bfedaf2c-37b1-4279-9615-e24c9aa3635d","source":"CognitiveEcho","target":"Agent","type":"REFERENCES"},{"id":"1ace5b06-e116-435a-887a-7924bdbe3a7c","source":"CognitiveEcho","target":"SignalReflection","type":"RELATED_TO"},{"id":"e2551835-dbed-4450-890b-4cbd3f64d8f1","source":"CognitiveEcho","target":"85979263-1e96-4e0d-a361-a415073eee43","type":"HAS_INVARIANT"},{"id":"9c93ed1b-83f4-4842-8de9-b733d6dd03e6","source":"CognitiveEcho","target":"8cfde2a9-feb0-4010-ba38-a379029f4629","type":"HAS_INVARIANT"},{"id":"6e9d0be6-155b-49ce-82ac-18ea90da75d3","source":"CognitiveEcho","target":"811205a0-17be-47d6-bf99-ff8a53981d1a","type":"HAS_PRECONDITION"},{"id":"930a11b9-6df2-4ae8-9d76-edbea675af64","source":"CognitiveEcho","target":"d53aec35-c70f-4e39-b29b-6523f2043fa0","type":"HAS_PRECONDITION"},{"id":"196e0d50-3cec-4fad-9e15-900eb985a759","source":"CognitiveEcho","target":"5eac4217-7f34-4778-b6b7-1981c2223442","type":"HAS_POSTCONDITION"},{"id":"17130364-77d5-4754-a151-4a1562fe6dc0","source":"AgentProtocol","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"73d36347-6e51-40f5-b2fc-e138bb62dfea","source":"AgentProtocol","target":"Task","type":"REFERENCES"},{"id":"807598f3-2039-47df-8486-37e4956071a6","source":"AgentProtocol","target":"Greet","type":"REFERENCES"},{"id":"57cf05d1-074b-4261-b4ab-bfc65a96f8c1","source":"AgentProtocol","target":"Work","type":"REFERENCES"},{"id":"28740f88-3a2c-4c31-a4f4-4dadd3b4be91","source":"AgentProtocol","target":"Protocol","type":"REFERENCES"},{"id":"0b259598-6fd2-4c4b-836e-f77a691515b8","source":"AgentProtocol","target":"FailClosed","type":"REFERENCES"},{"id":"d9bcc042-1adc-40af-b370-f21b81272244","source":"AgentProtocol","target":"Solution","type":"REFERENCES"},{"id":"eb228dcd-a32f-41cd-a7e5-1095f41173bd","source":"AgentProtocol","target":"AcceptSpec","type":"REFERENCES"},{"id":"0ba4cfc4-afc7-4b5c-b90d-8498e80c1cf0","source":"AgentProtocol","target":"Agent","type":"REFERENCES"},{"id":"4bea12fd-2dda-4f21-8079-309a5178ab0c","source":"AgentProtocol","target":"888fbb87-fe31-4038-90cb-55a3161c80b5","type":"HAS_INVARIANT"},{"id":"07dbe52e-a631-4607-84dd-5c9a00b246fd","source":"BoundedTask","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"e645a5f1-5f68-479e-945b-33b3c4f60af2","source":"BoundedTask","target":"Task","type":"REFERENCES"},{"id":"2a461105-4992-4c66-9173-e1141a4f9be7","source":"BoundedTask","target":"AcceptSpec","type":"REFERENCES"},{"id":"18257bf3-a66c-4b20-9e68-0844d129f091","source":"BoundedTask","target":"Budget","type":"REFERENCES"},{"id":"77526c4f-cd9a-42d1-b4e4-adc94b66382d","source":"BoundedTask","target":"fa05dbad-65a9-4ae5-84b8-627dc724de35","type":"HAS_INVARIANT"},{"id":"93fcb0c5-5bea-4d01-9c9d-3243c8041ae9","source":"BoundedTask","target":"b0b19892-5ade-4ee0-87e0-5fe0249ae9cf","type":"HAS_INVARIANT"},{"id":"58ef6b36-1120-4bfc-b8d1-17027fa790e4","source":"DataMinimization","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"8d8f974b-c274-47ae-bc3d-87f9c02b1ecc","source":"DataMinimization","target":"Task","type":"REFERENCES"},{"id":"a4dc6955-adc7-4463-b483-0477441c4ffb","source":"DataMinimization","target":"Correlation","type":"REFERENCES"},{"id":"04070141-f2f2-47da-a669-5a1248edf118","source":"DataMinimization","target":"InputGuard","type":"REFERENCES"},{"id":"61de582b-7e23-4593-a2cb-99ae56122505","source":"DataMinimization","target":"Protocol","type":"REFERENCES"},{"id":"360e01dc-760d-4a91-817c-4890886f92fc","source":"DataMinimization","target":"Select","type":"REFERENCES"},{"id":"903e67ef-555b-4067-bf3b-2febea5d3546","source":"DataMinimization","target":"ContextCompress","type":"REFERENCES"},{"id":"b87a0cd3-a1ac-45cf-8ea8-03d9cf619749","source":"DataMinimization","target":"Context","type":"REFERENCES"},{"id":"1683bbfc-a113-43fc-b27b-d1276cf897af","source":"DataMinimization","target":"AcceptSpec","type":"REFERENCES"},{"id":"5f978d44-8d9c-40e6-8fe3-1649b076ec01","source":"DataMinimization","target":"Agent","type":"REFERENCES"},{"id":"a6f2a3c0-5ba9-4d79-8d2c-b806b6546b68","source":"DataMinimization","target":"6086625c-c374-461b-8b51-9480361ddf87","type":"HAS_INVARIANT"},{"id":"d2d09c08-4c86-452b-adde-65a74f080554","source":"DataMinimization","target":"b27deec0-9d8b-44dd-9066-6b4965204b2a","type":"HAS_INVARIANT"},{"id":"3ce98261-06a8-460c-a867-7c6ab89df5bf","source":"DataMinimization","target":"3ebafd73-3d1d-46ee-bbad-0809c4a1341e","type":"HAS_PRECONDITION"},{"id":"01a5f843-e7a2-4442-b792-89d217bb7ace","source":"DataMinimization","target":"c70cfa12-6438-449d-936b-4ffb3a2d826c","type":"HAS_PRECONDITION"},{"id":"19fff3ba-aaaa-432f-b232-6803a2012d41","source":"DataMinimization","target":"9c15d6c0-e10e-4084-8394-63707c31a63e","type":"HAS_POSTCONDITION"},{"id":"f10ce695-01c4-4290-967a-4eca98efb7f3","source":"DataMinimization","target":"0b4d6f9d-1634-45af-8ea2-104e05c19725","type":"HAS_POSTCONDITION"},{"id":"ab802147-fdcc-47bb-a1bd-2384b26313f4","source":"Validate","target":"579b02af-c094-442f-8ef9-67bcd86bd62f","type":"IN_CATEGORY"},{"id":"5ab3c790-7190-4849-aff2-7dcd27697007","source":"Validate","target":"AcceptSpec","type":"REFERENCES"},{"id":"456dba1f-41cf-4f4e-876d-db3964fa9d06","source":"Validate","target":"Check","type":"REFERENCES"},{"id":"517108a3-b969-40d2-9a20-eb806088f282","source":"Validate","target":"c81f363c-ab2e-4d2a-8e50-f0bff28ab548","type":"HAS_INVARIANT"},{"id":"24b2172e-2305-4cd4-abee-9d5c97515b19","source":"Validate","target":"2e75b97b-baad-465d-a0e2-dd1d5a55c7d9","type":"HAS_INVARIANT"},{"id":"45bca760-ce9c-4ac3-97ed-e44567b1fdfe","source":"ManifestPlanning","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"fd360e4c-03f4-47f0-8e1c-1c62039d915f","source":"ManifestPlanning","target":"Optimize","type":"COMPOSES_WITH"},{"id":"448918f1-4b26-4c68-acd5-6a44c542db70","source":"ManifestPlanning","target":"FrameSpec","type":"ACCEPTS"},{"id":"c1df78e3-b7c1-4744-ae40-275c0777418b","source":"ManifestPlanning","target":"Think","type":"COMPOSES_WITH"},{"id":"0c3c6bdd-4756-438a-82e0-dd9f64662d36","source":"ManifestPlanning","target":"Plan","type":"REFERENCES"},{"id":"de5004b2-f979-4a63-80e1-2d15b8302e06","source":"ManifestPlanning","target":"ExecutionManifest","type":"YIELDS"},{"id":"775bdd1e-32f2-4b16-802a-84db4b6e95d3","source":"ManifestPlanning","target":"7aeef670-387c-45a4-818b-e7049e1ebd30","type":"HAS_INVARIANT"},{"id":"01721cb0-fedc-49d7-8b09-f294c1b8aca8","source":"ManifestPlanning","target":"5c4f462f-b187-4df1-8a12-435e6feffab4","type":"HAS_INVARIANT"},{"id":"8935b20f-c585-4a0f-9fab-6a16fdeafea8","source":"RequestFraming","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"22ae3fb9-b9d0-4d87-aa96-01a724c5d387","source":"RequestFraming","target":"FrameSpec","type":"YIELDS"},{"id":"79435489-89c3-4383-9500-5176afd23ab6","source":"RequestFraming","target":"Think","type":"COMPOSES_WITH"},{"id":"9675358d-3305-4e86-a3f3-e42974b675e2","source":"RequestFraming","target":"Understand","type":"COMPOSES_WITH"},{"id":"4fd58d8d-94a7-486e-8ebe-3f86472483ff","source":"RequestFraming","target":"Context","type":"REFERENCES"},{"id":"6029f5a0-3c0d-4019-9b48-82cd5a06cbe1","source":"RequestFraming","target":"Message","type":"ACCEPTS"},{"id":"215d67c6-52ed-4739-8f28-57adba9627f8","source":"RequestFraming","target":"Interpret","type":"REFERENCES"},{"id":"9e79ad77-24e1-4424-b191-17ff2788b8c6","source":"RequestFraming","target":"Reframe","type":"RELATED_TO"},{"id":"b2195350-116d-4d40-924e-28e530fcc1e7","source":"RequestFraming","target":"Decompose","type":"RELATED_TO"},{"id":"f3008ce1-e517-4e9a-8ab8-84d95acfce8d","source":"RequestFraming","target":"484e9b4f-e987-4c10-ba92-9e8df11d371f","type":"HAS_INVARIANT"},{"id":"7a2858bf-ff46-4a97-be57-095b2e3e46af","source":"RequestFraming","target":"c53f8cbc-6294-4712-877c-139b473831b4","type":"HAS_INVARIANT"},{"id":"0d78937d-8f03-4af2-a362-cb1e2897faf1","source":"RequestFraming","target":"b87426de-29b7-471a-9677-7e8958cdafb5","type":"HAS_PRECONDITION"},{"id":"cf961959-a8c8-4a50-9ec6-c3b1fe1f5fa0","source":"RequestFraming","target":"7a70d6ed-d86f-4dad-963c-b4177ac675b8","type":"HAS_PRECONDITION"},{"id":"bcae2397-4815-492a-ae16-c9f03ed7ebbc","source":"RequestFraming","target":"3b5e1ccd-c2ab-4c25-9bb2-a621b7735f7e","type":"HAS_POSTCONDITION"},{"id":"5f52ba1c-ff0e-4ead-9bfc-2468b5edd7ff","source":"RequestFraming","target":"301018ff-466a-417a-bacb-e8820aff984e","type":"HAS_POSTCONDITION"},{"id":"cf136879-f485-48ea-928c-d53333d2dabb","source":"Experiment","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"e25ab03a-0b84-4cc5-8bc3-6bdb13dac3d2","source":"Experiment","target":"Verification","type":"REFERENCES"},{"id":"5343f4e2-2846-4034-abd0-6a5cc8a71d7f","source":"Experiment","target":"Solution","type":"YIELDS"},{"id":"63d326ed-84af-4fcf-8a47-64299ef91cf5","source":"Experiment","target":"Protocol","type":"REFERENCES"},{"id":"05c99ccd-8de9-4432-9ca1-29805d889097","source":"LeastToMost","target":"e38ff6e0-872e-4a63-a7ea-ebb84e174347","type":"IN_CATEGORY"},{"id":"9191e8dc-861f-43e3-b5c7-0f349712f8c4","source":"LeastToMost","target":"Task","type":"ACCEPTS"},{"id":"d2c44105-2660-4f9e-bea2-723be2488303","source":"LeastToMost","target":"Solution","type":"REFERENCES"},{"id":"3a64f9e0-cf92-42c6-8c8e-21c17575682a","source":"LeastToMost","target":"Decompose","type":"REFERENCES"},{"id":"c6f97d0f-4260-4cbd-af08-425c410062a5","source":"LeastToMost","target":"9d8fc5ca-e12f-4684-8634-a3389a459e3d","type":"HAS_INVARIANT"},{"id":"5284ddda-7560-49cb-a7c6-6ec00d51e602","source":"LeastToMost","target":"1e6cd086-9aa5-4ae2-852d-2723343d6cc6","type":"HAS_INVARIANT"},{"id":"39d7fb62-c399-4b80-926c-9396bc340ee6","source":"LeastToMost","target":"18139971-7a51-4702-b873-f1b62ee81fd1","type":"HAS_PRECONDITION"},{"id":"70ea10f5-d59e-429a-b082-096424977dd6","source":"LeastToMost","target":"505e6331-217c-46c9-bde1-a5b260db66ba","type":"HAS_PRECONDITION"},{"id":"65f98b7d-de39-4032-ba4e-0638cbb3f2b0","source":"LeastToMost","target":"b1263b97-bbd8-4941-b733-11be9095b58d","type":"HAS_POSTCONDITION"},{"id":"6be43c53-fbd1-46e0-89e7-e3855cf2a601","source":"ScopeFreeze","target":"90800e2d-25ad-47b4-9463-179cdb2d083f","type":"IN_CATEGORY"},{"id":"7b6b7249-be0f-4fa9-9a1b-9d74d8f8d76d","source":"ScopeFreeze","target":"Task","type":"REFERENCES"},{"id":"4e6f8e8b-4bc4-4da9-8b87-b5820a250b2b","source":"ScopeFreeze","target":"Agent","type":"REFERENCES"},{"id":"d95ccee9-c2a4-4493-8161-08edf9802924","source":"ScopeFreeze","target":"Transition","type":"REFERENCES"},{"id":"43db7793-6034-403d-8474-d24769267add","source":"ScopeFreeze","target":"Satisfice","type":"REFERENCES"},{"id":"b4ae2971-02e2-4d40-9793-f04b017845ee","source":"ScopeFreeze","target":"TimeboxThink","type":"REFERENCES"},{"id":"e55d56ed-d466-4a90-9856-2397a967c24f","source":"ScopeFreeze","target":"AcceptSpec","type":"REFERENCES"},{"id":"ae64983f-7e4a-420d-872f-6033db2f12b5","source":"ScopeFreeze","target":"Decompose","type":"REFERENCES"},{"id":"fcea8750-ba88-4cd5-b211-6911fafc1479","source":"ScopeFreeze","target":"2f21ccf8-87cf-40d3-8934-71df748f8ae2","type":"HAS_INVARIANT"},{"id":"2fe57024-e950-4913-bfa7-ef7fbb6ef6c0","source":"ScopeFreeze","target":"14f042dc-bfc2-48c8-8df8-6d0bc2967826","type":"HAS_INVARIANT"},{"id":"8c55b581-0d73-4195-aac9-51c34dd37ac2","source":"ScopeFreeze","target":"8efd48ea-a390-4386-92c4-240c04fbaee9","type":"HAS_PRECONDITION"},{"id":"14e46a8d-d127-477d-aa13-5091ba125087","source":"ScopeFreeze","target":"445cd040-b77f-4342-9132-5e38648a19da","type":"HAS_PRECONDITION"},{"id":"3561f250-59fb-4556-a21d-c2331a53c7d2","source":"ScopeFreeze","target":"2cb9f82b-3e2b-4a47-9497-9f142d85b9c1","type":"HAS_POSTCONDITION"},{"id":"19ebaa2d-d8a2-4e13-a42e-49ed0f06faab","source":"ScopeFreeze","target":"c6d36c42-cd43-4bef-91dd-b215e4b32d3b","type":"HAS_POSTCONDITION"},{"id":"4f522aab-48b4-463b-bc2f-6d249e6de302","source":"SkeletonOfThought","target":"e38ff6e0-872e-4a63-a7ea-ebb84e174347","type":"IN_CATEGORY"},{"id":"2c30148b-b3a7-4b37-88db-0adcd4dbe5de","source":"SkeletonOfThought","target":"Decompose","type":"REFERENCES"},{"id":"cfc22ea5-bfb1-45ad-b64e-a556796188b1","source":"SkeletonOfThought","target":"Skeleton","type":"REFERENCES"},{"id":"4974aaeb-3d2d-4d01-8287-5e101b9a2601","source":"SkeletonOfThought","target":"Think","type":"REFERENCES"},{"id":"8c717ff5-911d-494e-80a7-fbfa83d1bb69","source":"SkeletonOfThought","target":"8910d13b-1b32-4cfc-9ff1-a908894dec29","type":"HAS_INVARIANT"},{"id":"169d6564-ae9b-4fc7-ab19-e6b7c31f82f6","source":"BoundaryProbe","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"e7b6c7e1-989c-4d8c-bd05-80fd88aca24c","source":"BoundaryProbe","target":"SacrificialProbe","type":"COMPOSES_WITH"},{"id":"6ec3cdb3-8ad9-4d5d-acf8-9e1ac56cec10","source":"BoundaryProbe","target":"System","type":"REFERENCES"},{"id":"33f7ba28-dedf-4c02-8b60-ba97c613c716","source":"BoundaryProbe","target":"Break","type":"REFERENCES"},{"id":"94b1de7c-5149-4bc8-9d3c-18048709d31b","source":"BoundaryProbe","target":"Observe","type":"REFERENCES"},{"id":"eb2d5104-c0f7-4904-8bc8-cc423fed9df5","source":"BoundaryProbe","target":"Assumption","type":"REFERENCES"},{"id":"6cd10351-731c-4489-aff4-fd4d29feaebc","source":"BoundaryProbe","target":"Agent","type":"REFERENCES"},{"id":"97960e30-64b4-4de7-a55c-95a7df873550","source":"BoundaryProbe","target":"Probe","type":"RELATED_TO"},{"id":"038255c5-d94e-48cf-b4e7-3f1fcb36dbf9","source":"BoundaryProbe","target":"f1bd3021-bccd-4e83-a15f-af67a9982371","type":"HAS_INVARIANT"},{"id":"40a70b45-3aca-4432-92aa-95cbce3ec8df","source":"Exaptation","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"54907a13-5b2d-41a9-8afd-0aee0dc58214","source":"Exaptation","target":"Task","type":"REFERENCES"},{"id":"f26ba9d8-51ae-4f65-9ec5-dd4b020c3f9a","source":"Exaptation","target":"Sandbox","type":"REFERENCES"},{"id":"a49367b9-40cf-48a0-bac9-03ae4f6dbf5a","source":"Exaptation","target":"AnalogyBridge","type":"COMPOSES_WITH"},{"id":"f50546f3-e997-4ae8-8d84-8a016c464349","source":"Exaptation","target":"Problem","type":"REFERENCES"},{"id":"8b2d7512-ef54-4f2f-886a-05c183bf5eb5","source":"Exaptation","target":"ToolInvoke","type":"COMPOSES_WITH"},{"id":"17155f9a-95a0-437a-925e-e0484c7e344c","source":"Exaptation","target":"Translate","type":"COMPOSES_WITH"},{"id":"49bd890f-fb8e-4797-8580-45d7f1218a46","source":"Exaptation","target":"SacrificialProbe","type":"REFERENCES"},{"id":"0ec8ee07-c9f1-4a78-a0a6-53517617bd51","source":"Exaptation","target":"Agent","type":"REFERENCES"},{"id":"03949a37-2af5-48d2-9780-bc65c68975e9","source":"Exaptation","target":"LateralOptimization","type":"RELATED_TO"},{"id":"12908f2d-97cf-4976-b0bf-8c0101790675","source":"Exaptation","target":"925648f2-9643-45fd-bb4b-62e9fdce4f0d","type":"HAS_INVARIANT"},{"id":"25b621e0-8ed0-48d8-bc47-1a55505a5036","source":"Exaptation","target":"2f6389b0-dc5a-4591-b857-90d9b3947961","type":"HAS_INVARIANT"},{"id":"6c6781e8-28d0-418f-8cdd-1105d8cc43ed","source":"Exaptation","target":"f60118ab-e223-4cae-9a6a-989a1146f01a","type":"HAS_INVARIANT"},{"id":"b42d0c36-c043-4969-96bd-86f012746c3d","source":"Exaptation","target":"14f924a3-ded6-4c98-9c94-607796b00c86","type":"HAS_PRECONDITION"},{"id":"0e4feb23-cf31-4879-94e6-8ce9f83b4d8d","source":"Exaptation","target":"a239fdaf-f475-43f4-889b-ed19f64dd60e","type":"HAS_PRECONDITION"},{"id":"0e025474-258d-4fc3-af85-7b9dc9d178e0","source":"Exaptation","target":"58a5c157-c1cb-462b-9495-5d54b65c7ab8","type":"HAS_POSTCONDITION"},{"id":"c8fb70c1-8ac3-44be-94a3-fe9f1c5bda99","source":"Exaptation","target":"e307ae2c-4d40-4fa1-a578-d55dbd57739a","type":"HAS_POSTCONDITION"},{"id":"e9f0a8de-2f9d-4e30-bb6d-84347dc3c149","source":"UncertaintyMap","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"9c0905fc-9f23-4e00-8d13-d46f598c464b","source":"UncertaintyMap","target":"ConfidenceCalibrate","type":"REFERENCES"},{"id":"a20899e0-3c2d-4040-b0f7-028cf8e1b721","source":"UncertaintyMap","target":"Prioritize","type":"REFERENCES"},{"id":"b8b8d55f-1051-450c-ad83-21bbd490cb11","source":"UncertaintyMap","target":"Probe","type":"REFERENCES"},{"id":"4c9a1826-936a-42bd-b850-61ea7e6c8f72","source":"UncertaintyMap","target":"b04e7589-7873-4c23-a39d-5a7b8947d09e","type":"HAS_INVARIANT"},{"id":"4dfeabc6-2f3b-4ed5-9f31-42d7d730d565","source":"DesignArchitect","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"d75c28ce-e284-4173-a459-07f3bd248e7e","source":"DesignArchitect","target":"PreMortem","type":"COMPOSES_WITH"},{"id":"0805b2b8-6da4-424e-a775-cfeef31212d5","source":"DesignArchitect","target":"SteelmanCheck","type":"COMPOSES_WITH"},{"id":"11ae4503-a932-445d-9af4-b762c9e9dc65","source":"DesignArchitect","target":"Summarize","type":"COMPOSES_WITH"},{"id":"ca696959-f87b-40f5-99f2-31a08463eacf","source":"DesignArchitect","target":"MechanisticDesignProposal","type":"YIELDS"},{"id":"4dfe5103-e5cc-4676-86e9-b0b83826842b","source":"DesignArchitect","target":"Strategy","type":"COMPOSES_WITH"},{"id":"ee9f6e6d-73a1-4be9-a092-ee2068137cc7","source":"DesignArchitect","target":"Translate","type":"COMPOSES_WITH"},{"id":"fa95610e-b383-4715-a159-eb261ece584e","source":"DesignArchitect","target":"69220d59-c62b-4d5f-853d-aea3e16b8f30","type":"HAS_INVARIANT"},{"id":"9378f199-9f91-4bea-b5a5-c0e31e5c536f","source":"DesignArchitect","target":"3bac30c0-9a20-4b43-a3e0-9353ddc9f66e","type":"HAS_INVARIANT"},{"id":"4fbeec04-476d-44a2-a577-bb6f1c567b6a","source":"ExperienceSharding","target":"6fe7b13d-4ed3-4c51-ae9a-7943dd282dbf","type":"IN_CATEGORY"},{"id":"21be83dd-0938-4b4b-87fc-d3ab0b18443f","source":"ExperienceSharding","target":"ChunkMerge","type":"REFERENCES"},{"id":"abf3c2cd-38bb-4188-9147-97516cf154f9","source":"ExperienceSharding","target":"Shard","type":"REFERENCES"},{"id":"c5ebcf52-bc9b-47f0-b560-db4324e68a44","source":"ExperienceSharding","target":"ba9decaa-e702-4245-8121-048989d23afc","type":"HAS_INVARIANT"},{"id":"f02c1fc4-9d4d-4a9f-a6a3-27a75e1e3eb0","source":"ExperienceSharding","target":"3874890e-362d-4eb6-99c1-2f4eb203d977","type":"HAS_INVARIANT"},{"id":"1a254de1-28b1-4492-a2cd-4d5865b324de","source":"ExperienceSharding","target":"b408e68a-d0e2-46a1-a59a-752f4ed371c2","type":"HAS_PRECONDITION"},{"id":"eb03b200-a130-41ee-a9d8-f00c9e893b08","source":"ExperienceSharding","target":"8d1eb403-971f-459a-b1be-20c4c885c803","type":"HAS_PRECONDITION"},{"id":"1e4486e8-437b-4c75-a6c1-d601d3152d9a","source":"ExperienceSharding","target":"f2fddd9d-d357-43d7-9bde-d389689e1fd1","type":"HAS_POSTCONDITION"},{"id":"52f6f315-04e7-4a94-a339-0a85a29d36ed","source":"RegimeSense","target":"90800e2d-25ad-47b4-9463-179cdb2d083f","type":"IN_CATEGORY"},{"id":"17e9dd54-8647-40d0-b20a-4f7db38b4beb","source":"RegimeSense","target":"Quorum","type":"REFERENCES"},{"id":"8fb9f41b-d1bf-4221-baa2-2734aaf9fe93","source":"RegimeSense","target":"OntologyAdapt","type":"REFERENCES"},{"id":"bbcff2bf-84a9-4df3-9036-b904c14a628e","source":"RegimeSense","target":"Noise","type":"REFERENCES"},{"id":"3f48332e-8856-4ea5-88bd-cf8530501548","source":"RegimeSense","target":"DriftWatch","type":"REFERENCES"},{"id":"bfbfecc3-dd69-4bd8-8936-0996bee92781","source":"RegimeSense","target":"Break","type":"REFERENCES"},{"id":"dfe620cf-13dc-4560-8bbd-73b61615e1a8","source":"RegimeSense","target":"Agent","type":"REFERENCES"},{"id":"d0c0a63c-6c28-4780-9161-210c84d2fc46","source":"RegimeSense","target":"7043afd2-0fed-4b8f-afd0-90af65985fc5","type":"HAS_INVARIANT"},{"id":"f4280cfb-15ae-4e8f-9330-2d94bbc1264f","source":"RegimeSense","target":"abe6af2e-dfe0-414e-a128-0bfc790790d7","type":"HAS_INVARIANT"},{"id":"d938d630-8760-4393-8ec1-fada5e6afb4a","source":"RegimeSense","target":"91a9f2eb-5a74-468b-b941-eb2ec903f6e5","type":"HAS_PRECONDITION"},{"id":"8a5fce52-bd14-4733-97f2-c2d992108ce5","source":"RegimeSense","target":"7749814a-3444-425e-9147-d73cf1a60a8b","type":"HAS_PRECONDITION"},{"id":"53a764af-0e65-46cc-adc3-45211859274a","source":"RegimeSense","target":"5c2ba1c3-d815-453a-bf1a-986f9ee37f7b","type":"HAS_POSTCONDITION"},{"id":"d3deb1ab-49c4-4105-bf23-d1e5ad866fe3","source":"RegimeSense","target":"43b5695c-4394-4ade-92c0-5dbe867268c6","type":"HAS_POSTCONDITION"},{"id":"647b5427-51bb-44dd-bc38-9c4c150212b9","source":"DAG","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"3d23c060-b5ef-4ad3-878a-606c10c595c7","source":"DAG","target":"Topology","type":"REFERENCES"},{"id":"ab50ae76-c14f-44a9-8bd1-42028d09fe1a","source":"DAG","target":"Parallelize","type":"REFERENCES"},{"id":"a5759cdc-8b63-4cc1-81c5-2d5336b478f8","source":"DAG","target":"5b132ffa-d71c-4dff-8efb-3b5f90c469f8","type":"HAS_INVARIANT"},{"id":"7f79182f-037b-4a58-804a-2ba22b09d8bf","source":"DAG","target":"38f69bf9-15ce-4ba5-b559-cef42adbb136","type":"HAS_INVARIANT"},{"id":"33aeb707-4c51-4590-97ae-1be516ebfb16","source":"FabricSharding","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"370ff351-8683-4ae1-849c-3df156f002b8","source":"FabricSharding","target":"Shard","type":"REFERENCES"},{"id":"d59d5904-62ec-471a-9c97-9ae6194142bd","source":"FabricSharding","target":"Parallelize","type":"REFERENCES"},{"id":"63e90e4f-f75f-4990-aabb-c1d9b8d07642","source":"FabricSharding","target":"State","type":"REFERENCES"},{"id":"93b23be3-7424-4078-a6eb-8c012a057ded","source":"FabricSharding","target":"692f670a-6196-4d00-ab7b-45f320ffb2f5","type":"HAS_INVARIANT"},{"id":"b7b47769-517e-4532-93d6-d3ff80bc83c6","source":"Dialectic","target":"e38ff6e0-872e-4a63-a7ea-ebb84e174347","type":"IN_CATEGORY"},{"id":"3f8292ac-eb9d-4771-9db0-b49f91362af1","source":"Dialectic","target":"SteelmanCheck","type":"COMPOSES_WITH"},{"id":"2d94925f-7fa4-4b89-a8d1-18887e9bcd2c","source":"Dialectic","target":"Synthesis","type":"REFERENCES"},{"id":"51da7cae-75e3-4e6a-be99-1eeae4c7bffe","source":"Dialectic","target":"PerspectiveEnsemble","type":"REFERENCES"},{"id":"a297e599-25da-4c0b-bc24-6d704dc7fb81","source":"Dialectic","target":"6da61bcb-8251-4433-86f3-90896a81671c","type":"HAS_INVARIANT"},{"id":"7f9db810-2aae-42ab-85ae-f79e05dd0092","source":"Dialectic","target":"74e014fb-28f8-44b0-a0dd-7244e983e250","type":"HAS_PRECONDITION"},{"id":"65347bd0-18bb-40d7-9bd6-ace1a87c27a8","source":"Dialectic","target":"da6d7e7e-5f52-432f-bf3d-7e4b9787c4d6","type":"HAS_POSTCONDITION"},{"id":"865eeaa9-8407-4ab2-b950-11615acdc246","source":"PheromoneEconomy","target":"a3dffe73-5c16-41fe-be7c-5f1b04ac73f2","type":"IN_CATEGORY"},{"id":"f1493b4c-2cb4-4be2-ab59-e33ca4298367","source":"PheromoneEconomy","target":"GhostTrail","type":"REFERENCES"},{"id":"c7735857-7b3a-4e11-9b23-e0bf290bd971","source":"PheromoneEconomy","target":"ContinuousResourceAuction","type":"REFERENCES"},{"id":"d9d23aa2-9d84-4e01-90de-69989ff924a2","source":"PheromoneEconomy","target":"Stigmergy","type":"REFERENCES"},{"id":"b4d44519-1e1d-4cec-8d77-6854307174d3","source":"PheromoneEconomy","target":"Value","type":"REFERENCES"},{"id":"b137e1d5-5f4c-43f2-8224-e6447d8d9bc9","source":"RootHashGossip","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"e1cce33b-985e-430e-b9af-f74ab64fb0a1","source":"RootHashGossip","target":"RingWitness","type":"REFERENCES"},{"id":"eaa85cc1-fe7e-4054-b22e-c46e59696b79","source":"RootHashGossip","target":"Loop","type":"REFERENCES"},{"id":"06fd2382-86f7-4b2c-81c8-1bb4582514fd","source":"RootHashGossip","target":"28e042f9-423e-4e34-aba2-efb16f1114ac","type":"HAS_INVARIANT"},{"id":"4290f5ed-c2f1-44e6-a184-6aa271bf1148","source":"RootHashGossip","target":"77f343ac-f911-4297-88eb-4b26dcdb36a1","type":"HAS_INVARIANT"},{"id":"b7cfff82-6205-4c9e-a6de-eabdf80917bd","source":"RootHashGossip","target":"c829ba28-2866-4a4b-b114-70a9705bebaa","type":"HAS_PRECONDITION"},{"id":"4316b6ae-dd7c-4031-ad4f-320776d92567","source":"RootHashGossip","target":"ac2caebe-7738-485c-9bea-e82ee42f671c","type":"HAS_POSTCONDITION"},{"id":"7185c83a-d181-4573-84a7-25727f4b2d84","source":"Compensate","target":"8f497759-ce27-442f-9c55-27f3c2ad7c49","type":"IN_CATEGORY"},{"id":"a4872d6c-5664-47e1-ace2-157925904163","source":"Compensate","target":"TimeWarpLog","type":"REFERENCES"},{"id":"2a7cfea5-5413-498b-8d0a-545345fdb08d","source":"Compensate","target":"System","type":"REFERENCES"},{"id":"228f3ce3-c7e8-4e83-952a-85b77f31af1a","source":"Compensate","target":"Break","type":"REFERENCES"},{"id":"c9b5bc06-4ff7-4cc9-a606-49b3107345d0","source":"Compensate","target":"4dcec3d9-7d7f-48f1-9a5a-012fe5674e49","type":"HAS_INVARIANT"},{"id":"0c9fa4a1-77ea-4859-b7ae-95520aed98df","source":"Compensate","target":"83c90d6c-e9e1-4b63-9803-c07fba803c2c","type":"HAS_INVARIANT"},{"id":"dfbc1c80-6dea-41ec-a92d-2953b0e6702f","source":"Compensate","target":"eeb3b6e3-4dfb-4f37-8f15-59d06662b6d3","type":"HAS_PRECONDITION"},{"id":"e7163b80-57bf-438a-902c-d938df631434","source":"Compensate","target":"898410fe-0fd0-4e8b-b3a4-43314a557078","type":"HAS_PRECONDITION"},{"id":"96604c98-39d3-4580-90f9-823882ad7bc5","source":"Compensate","target":"d8a0e179-813e-40cc-960a-9d9a746bd9c7","type":"HAS_POSTCONDITION"},{"id":"c1767e19-bf1d-4f7a-becf-6f5572cad07b","source":"LazyConsensus","target":"dc998770-80e1-4d40-8d8d-31037195e639","type":"IN_CATEGORY"},{"id":"950c1e57-2397-4f8f-8d9d-d1a250ab0688","source":"LazyConsensus","target":"TimeWarpLog","type":"REFERENCES"},{"id":"ec8fd5b6-3511-4574-9c68-7a8fe223338f","source":"LazyConsensus","target":"Quorum","type":"REFERENCES"},{"id":"23442a3b-3e89-4d7c-880f-04901a6cd74d","source":"LazyConsensus","target":"4c529ee3-5aa9-4ae6-a284-0453bfcd4d47","type":"HAS_INVARIANT"},{"id":"ce779956-b5e9-4b2b-8ad7-5922c75174d5","source":"LazyConsensus","target":"ea592d75-e3b6-46e4-a13e-c10bb9ddb594","type":"HAS_INVARIANT"},{"id":"61e8762e-464c-4179-90f3-e74b8ecbc6be","source":"CostlySignal","target":"a3dffe73-5c16-41fe-be7c-5f1b04ac73f2","type":"IN_CATEGORY"},{"id":"5d4ae520-ab8a-4400-bd85-bce6eecf5893","source":"CostlySignal","target":"Agent","type":"REFERENCES"},{"id":"ce0b5943-c015-4ea1-b0a3-df66c98f0fe7","source":"CostlySignal","target":"Signal","type":"ACCEPTS"},{"id":"a715b22a-e2d4-4a08-9383-079cc0e3796a","source":"CostlySignal","target":"Message","type":"REFERENCES"},{"id":"62d04283-9edc-4f15-857d-e85ed4d2e266","source":"CostlySignal","target":"Context","type":"REFERENCES"},{"id":"3b937427-dc9b-4660-9eac-e41f222d69f6","source":"CostlySignal","target":"Value","type":"REFERENCES"},{"id":"ea2cc0db-6d09-4296-9755-a849bcd757bc","source":"CostlySignal","target":"AttentionMarkets","type":"COMPOSES_WITH"},{"id":"94a98387-3e0f-4d36-84d9-65303e3015f1","source":"CostlySignal","target":"289d679c-c245-4558-be9b-7f378faca46e","type":"HAS_INVARIANT"},{"id":"da06aa04-5723-4139-bb6f-1624411716dd","source":"CostlySignal","target":"c75ad307-f097-497c-a3cc-c5aae0f7583d","type":"HAS_INVARIANT"},{"id":"5c76bf8d-d64f-464c-9b17-c36504a755c1","source":"CostlySignal","target":"47c25e7f-8574-49a8-94b4-485c75db48bb","type":"HAS_PRECONDITION"},{"id":"dc6cefe1-0306-4a38-93ea-a553eee7d67e","source":"CostlySignal","target":"ba9e2dbd-7440-48a5-a779-1d6e2d7aa197","type":"HAS_POSTCONDITION"},{"id":"27036d37-f639-4d4c-bf3e-96a039285a6a","source":"CostlySignal","target":"84bf1809-2839-4f58-8741-50665b913e6f","type":"HAS_POSTCONDITION"},{"id":"773d2640-5edf-47b0-9540-187bfed5657e","source":"ForkingProtocol","target":"dc998770-80e1-4d40-8d8d-31037195e639","type":"IN_CATEGORY"},{"id":"29e7d4c1-84cb-4e80-a220-0fec6904b8fc","source":"ForkingProtocol","target":"StateSnapshot","type":"REFERENCES"},{"id":"e4f2c3f3-3ccf-44c3-a109-006b5d89d913","source":"ForkingProtocol","target":"Parallelize","type":"REFERENCES"},{"id":"fc1dc704-e670-4bcd-b170-5892db5f2b0e","source":"ForkingProtocol","target":"6ef9aac9-7c5c-4c6e-85b2-ff68043fabb8","type":"HAS_INVARIANT"},{"id":"757f43c5-c7a3-4cfe-824f-345ca97ba49c","source":"ForkingProtocol","target":"7459b2ff-a081-46ee-8a12-7559a935a688","type":"HAS_INVARIANT"},{"id":"7eb33ec7-ba34-495e-8232-a9d9d85d2031","source":"ForkingProtocol","target":"a4cc7a24-7204-4b1f-95ea-b27adb7b6952","type":"HAS_PRECONDITION"},{"id":"d7e0fe85-b26f-4372-b9a8-b6323ad409fd","source":"ForkingProtocol","target":"5351a302-9f22-4e1f-bd8b-9e6ee6668f57","type":"HAS_PRECONDITION"},{"id":"48022209-a5ce-4608-98d1-764b753522f0","source":"ForkingProtocol","target":"67996ea0-7eab-4c3b-9aca-5711ad26aa59","type":"HAS_POSTCONDITION"},{"id":"a45824e8-762c-4ba2-b526-a129dacb8f76","source":"Oracle","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"9e40b0d2-7884-4fb3-b702-83785830b01f","source":"Oracle","target":"HeldRelease","type":"REFERENCES"},{"id":"e4dce4b1-c8bf-4bb2-8b21-90b5b8aba7c8","source":"Oracle","target":"c5ac7475-cac4-4437-858b-d0ceca69aaee","type":"HAS_INVARIANT"},{"id":"806eb6a6-cab5-404f-881d-abb214bdfcc8","source":"Oracle","target":"fcb01466-d32c-4893-af54-a7bccfa44580","type":"HAS_INVARIANT"},{"id":"21c8ddef-10f4-4464-a463-497d5518a5ca","source":"AbductiveLeap","target":"e38ff6e0-872e-4a63-a7ea-ebb84e174347","type":"IN_CATEGORY"},{"id":"55d78230-da4b-4b38-b7fb-ab2403f2c1c0","source":"AbductiveLeap","target":"Rank","type":"REFERENCES"},{"id":"8194af7d-b88a-4ddd-93c7-f2e2caba3d81","source":"AbductiveLeap","target":"Hypothesis","type":"REFERENCES"},{"id":"6153f484-449c-4f49-8c22-a695bbb72f69","source":"AbductiveLeap","target":"ChainOfThought","type":"COMPOSES_WITH"},{"id":"2e580b5b-b322-4f0c-99b9-1f8551cb2173","source":"AbductiveLeap","target":"c6b2d365-3b80-4f22-87bb-e02a8a46e774","type":"HAS_INVARIANT"},{"id":"5b75862f-1597-460b-851a-8b45ffab5ab1","source":"AbductiveLeap","target":"24495a30-cdc4-4e2a-80da-1cd5df0aaa93","type":"HAS_INVARIANT"},{"id":"cab8d078-b195-4833-88ad-803c729a245a","source":"AbductiveLeap","target":"f4ef3f52-c8b5-43fc-a292-cef8a0f32c0b","type":"HAS_PRECONDITION"},{"id":"ffcb934d-9dbc-4daa-a791-1b942b6a43fc","source":"AbductiveLeap","target":"808ebefe-65c4-4c17-8623-76182ddbf58c","type":"HAS_PRECONDITION"},{"id":"364e4135-0e52-4554-81bd-022c31d547d6","source":"AbductiveLeap","target":"2e8d892f-3488-432e-92ac-2b5ce9bc6141","type":"HAS_POSTCONDITION"},{"id":"4234f5d7-5301-4f5d-984c-80aed88e3cec","source":"AbductiveLeap","target":"b7db7e31-d54b-47e6-91e1-bba9041b53f2","type":"HAS_POSTCONDITION"},{"id":"5c556843-6a26-4609-9161-2b7d5406f460","source":"BackwardChain","target":"e38ff6e0-872e-4a63-a7ea-ebb84e174347","type":"IN_CATEGORY"},{"id":"289b84a2-99b9-4175-9b31-fc6488e18b49","source":"BackwardChain","target":"Chain","type":"REFERENCES"},{"id":"267630fd-d427-4488-b54a-900c5b5461e0","source":"BackwardChain","target":"Plan","type":"REFERENCES"},{"id":"57837768-412a-4bdb-af4d-6d338bb45e25","source":"BackwardChain","target":"ChainOfThought","type":"REFERENCES"},{"id":"718012f3-679a-45a5-b890-507a3f6f191e","source":"BackwardChain","target":"63e4cd06-b8f8-4763-a2d3-017c180ecc27","type":"HAS_INVARIANT"},{"id":"1df50420-54f7-4ebc-bb20-19d1fceced80","source":"BackwardChain","target":"65ed6168-5bd8-403b-b7d5-c72c97e1bae2","type":"HAS_INVARIANT"},{"id":"ae675126-b133-496b-9ccd-2d5e840c5fef","source":"BackwardChain","target":"4867d564-aab1-412c-94ee-e21fa3f1f610","type":"HAS_INVARIANT"},{"id":"438b7bd0-a55e-435c-b314-46e0fc6824f9","source":"BackwardChain","target":"c70cfa12-6438-449d-936b-4ffb3a2d826c","type":"HAS_PRECONDITION"},{"id":"d6987f6e-d5dc-4bbf-9f67-193eea7bc82c","source":"BackwardChain","target":"4042a236-af24-42ce-84a3-48166595460d","type":"HAS_PRECONDITION"},{"id":"57e04fa2-48e2-406c-9705-6ac24fad058b","source":"BackwardChain","target":"f077c2d7-fc1f-42c8-b141-653c887d8745","type":"HAS_POSTCONDITION"},{"id":"fb635e87-64a2-413b-a8e9-ce7daa7fdb0e","source":"FirstPrinciples","target":"e38ff6e0-872e-4a63-a7ea-ebb84e174347","type":"IN_CATEGORY"},{"id":"50bc8bb8-6a0e-4f9e-a83f-dfd086f7839c","source":"FirstPrinciples","target":"Assumption","type":"REFERENCES"},{"id":"a9dbf71f-a737-4fa5-9b3a-64e33731df5f","source":"FirstPrinciples","target":"ChainOfThought","type":"REFERENCES"},{"id":"e5b0a5fd-7e35-458c-9ad9-e19134bbd1f8","source":"FirstPrinciples","target":"Axiom","type":"REFERENCES"},{"id":"6a91d92c-83dc-49f9-89f2-d4bf3cc000e2","source":"FirstPrinciples","target":"c0bef6a2-5dc4-495f-9341-20979f7e49ac","type":"HAS_INVARIANT"},{"id":"de557d9f-4905-4567-b4da-9f845e5608b8","source":"HeuristicSnap","target":"e38ff6e0-872e-4a63-a7ea-ebb84e174347","type":"IN_CATEGORY"},{"id":"dd0d978d-c62a-4f8e-853c-376ace1d7d0f","source":"HeuristicSnap","target":"Budget","type":"REFERENCES"},{"id":"d25db2d1-e4a2-4d34-ab0e-8152ef8c9244","source":"HeuristicSnap","target":"Decision","type":"REFERENCES"},{"id":"a808311c-92db-405f-9d88-060747e44363","source":"HeuristicSnap","target":"Problem","type":"REFERENCES"},{"id":"e4e86ba1-c8e8-40a4-bd95-0f1983c36a22","source":"HeuristicSnap","target":"ChainOfThought","type":"REFERENCES"},{"id":"02d9b7d9-1660-44a6-b0de-153f6584a89b","source":"HeuristicSnap","target":"ThinSlice","type":"RELATED_TO"},{"id":"980550d6-3e69-4ecf-87cd-94f33ddb9f8a","source":"HeuristicSnap","target":"6e064b4a-ddc4-420a-9a7e-91c99c5c7a83","type":"HAS_INVARIANT"},{"id":"a6647ed8-47de-4ddc-b0bb-ba29946daa2a","source":"HeuristicSnap","target":"e50c7df8-5e41-4d7e-9010-659248543f6a","type":"HAS_INVARIANT"},{"id":"ff0a80a8-09bc-4c72-8c9c-53a154f29445","source":"HeuristicSnap","target":"afcbfbaa-77f6-4a48-884d-8b523fcd058b","type":"HAS_PRECONDITION"},{"id":"9fbf6dc0-5695-4f84-bace-6c432d962447","source":"HeuristicSnap","target":"55dd7ffb-cd66-4664-ba92-3c917c3361f3","type":"HAS_POSTCONDITION"},{"id":"a48e453c-05a8-447f-8adb-a4b44c993e03","source":"RetrievalAugment","target":"6fe7b13d-4ed3-4c51-ae9a-7943dd282dbf","type":"IN_CATEGORY"},{"id":"eac6ee26-411b-418a-8af0-075d47fe79b4","source":"RetrievalAugment","target":"Context","type":"REFERENCES"},{"id":"d140a18f-944f-4750-a6e8-e143160db31e","source":"RetrievalAugment","target":"Prompt","type":"REFERENCES"},{"id":"1a02bc18-d181-4e8c-b97a-e7ee0a8d080d","source":"RetrievalAugment","target":"Agent","type":"REFERENCES"},{"id":"27ca370c-6578-4bbf-95e8-a524115a0770","source":"RetrievalAugment","target":"ChainOfThought","type":"REFERENCES"},{"id":"d623d0ad-80d6-4ffe-bea5-90f91c6b13c0","source":"RetrievalAugment","target":"3dfcd548-5509-4f37-8ed5-945f04219440","type":"HAS_INVARIANT"},{"id":"dee2dc8c-7a92-40f6-a348-e539421ad3bf","source":"RetrievalAugment","target":"72474808-b9d5-4890-a683-392b9e81eaf0","type":"HAS_INVARIANT"},{"id":"3ef2f71d-fc25-4094-913d-e9ffa55e318d","source":"RetrievalAugment","target":"b010d8ec-bd54-442e-bb6b-2a55a4a5d437","type":"HAS_INVARIANT"},{"id":"c241603b-40fa-4537-b31b-d154a418ad59","source":"TreeOfThoughts","target":"e38ff6e0-872e-4a63-a7ea-ebb84e174347","type":"IN_CATEGORY"},{"id":"2d190c73-7c69-4cf7-a9f5-3038923c2bad","source":"TreeOfThoughts","target":"ChainOfThought","type":"REFERENCES"},{"id":"ca113fbc-4e69-4e28-a0a1-1ab3e00c75db","source":"TreeOfThoughts","target":"Think","type":"REFERENCES"},{"id":"83f3444f-c6c7-4402-874e-27146f22bb55","source":"TreeOfThoughts","target":"Tree","type":"REFERENCES"},{"id":"c17ea59b-d47e-4ffb-9314-55e0f275b935","source":"LivedProof","target":"a3dffe73-5c16-41fe-be7c-5f1b04ac73f2","type":"IN_CATEGORY"},{"id":"197a6c11-2cc0-4209-8e6d-ee34b8f3e26a","source":"LivedProof","target":"DogfoodFirst","type":"REFERENCES"},{"id":"498ace1e-53a0-4cd2-9c79-2e777077028f","source":"LivedProof","target":"Signal","type":"REFERENCES"},{"id":"c65a8ac6-f205-43ea-9084-58e0f560f2a8","source":"LivedProof","target":"Agent","type":"REFERENCES"},{"id":"07f15c7b-021c-4ba8-b772-ed69866edcf2","source":"LivedProof","target":"Identity","type":"REFERENCES"},{"id":"78e6e42f-83ef-41d4-a3ba-8165344c3b29","source":"LivedProof","target":"56962037-24f8-46b6-9da1-60ec0386b385","type":"HAS_INVARIANT"},{"id":"def22979-5dc2-47b3-8f67-a3a8c2a9813a","source":"LivedProof","target":"d22742bb-25e8-43cb-b2e1-e589a42a738f","type":"HAS_INVARIANT"},{"id":"ae289b74-d77c-4491-9b63-32d3a242fe66","source":"LivedProof","target":"924f7214-710b-46ec-bb46-ef284aefc560","type":"HAS_INVARIANT"},{"id":"8cd3c9ee-77d2-40fc-a1a9-2729d7b753d0","source":"LivedProof","target":"1f62fd01-1500-4b03-a032-1bf7e76ecb99","type":"HAS_PRECONDITION"},{"id":"a04ac4db-dcae-4a43-ac03-03833d3406e7","source":"LivedProof","target":"7c61f411-9ac4-4f34-98f2-c75895a459ce","type":"HAS_PRECONDITION"},{"id":"cf4a3fd0-b897-46d5-9c6f-7bee6a5f2586","source":"LivedProof","target":"7f731cd6-5bbd-4f00-937e-e5cc197763bf","type":"HAS_POSTCONDITION"},{"id":"eb1d432a-f43e-4c3c-9977-2958bae39e0e","source":"LivedProof","target":"e05919ce-79bb-4f72-b8e0-c50dcdbec027","type":"HAS_POSTCONDITION"},{"id":"ce829867-3d3e-456a-a63c-16fb6d518f15","source":"EvaluatorOptimizer","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"5523b544-9616-4e84-8d18-38c23d3f91cb","source":"EvaluatorOptimizer","target":"Optimize","type":"REFERENCES"},{"id":"08939897-86ff-4ae6-b01a-9d48ad2ec09a","source":"EvaluatorOptimizer","target":"Criteria","type":"REFERENCES"},{"id":"d217a9cd-2472-46d1-ab11-39c711d74494","source":"EvaluatorOptimizer","target":"MetaCheck","type":"REFERENCES"},{"id":"1933d948-b78d-4287-9877-54c03b2010e3","source":"EvaluatorOptimizer","target":"Loop","type":"REFERENCES"},{"id":"ac1448cf-ec33-47dc-83f9-581c6639d57c","source":"EvaluatorOptimizer","target":"Context","type":"REFERENCES"},{"id":"8dfbee45-3885-4e9d-bdd2-09b0cad79754","source":"EvaluatorOptimizer","target":"18fddb72-c52b-4ffb-b31b-38b9103f0883","type":"HAS_INVARIANT"},{"id":"d4e850d7-810c-4d9a-947c-37d3cae74aff","source":"EvaluatorOptimizer","target":"62b56b6a-9cce-4397-bbcf-60ed4a62fdc3","type":"HAS_INVARIANT"},{"id":"89555758-d3ba-438d-bada-a56595db0aa5","source":"EvaluatorOptimizer","target":"fc5af884-129a-4a6b-a5a3-f6b74d33fb32","type":"HAS_PRECONDITION"},{"id":"125d5edc-657a-49f4-b389-f18cc8bbbaa4","source":"EvaluatorOptimizer","target":"fb9086b9-65eb-4f00-8b12-250b239015ae","type":"HAS_PRECONDITION"},{"id":"811a0ca1-631c-431e-98c9-15982ebc549d","source":"EvaluatorOptimizer","target":"a995af3f-4937-4a1d-8083-2517d5b54f6d","type":"HAS_PRECONDITION"},{"id":"095bac3c-4bba-42d4-9676-993fb81b888b","source":"EvaluatorOptimizer","target":"324bdc0c-3e0b-4cb3-b9e6-8eac8e661157","type":"HAS_POSTCONDITION"},{"id":"7287f4be-1f21-427f-a602-26e6ca4f66dd","source":"EmpiricalTest","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"d0d89078-09f7-4944-8bda-59cb4b0b5117","source":"EmpiricalTest","target":"Validate","type":"REFERENCES"},{"id":"0839d3dc-1cda-4395-a966-614aec5f805f","source":"EmpiricalTest","target":"Falsification","type":"REFERENCES"},{"id":"3c9c802a-4a4c-4d38-8062-a7f8559657f2","source":"EmpiricalTest","target":"39b1e0c1-2086-4a4e-a51d-c60d2d0028e7","type":"HAS_PRECONDITION"},{"id":"9fbb51c5-ef70-4914-94d6-15bebc456c97","source":"EmpiricalTest","target":"28f81dc9-f413-443e-a896-79cbcca1f202","type":"HAS_PRECONDITION"},{"id":"6547eb34-d3c9-4e86-8b0c-dd9c6f87584c","source":"EmpiricalTest","target":"08ab6f5d-90e4-460d-859b-e9068e425840","type":"HAS_POSTCONDITION"},{"id":"ce52b403-e105-4b98-8ad1-6245d01c496c","source":"HypothesisEngine","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"39d21771-68e1-40fe-aac7-47c7d3468c13","source":"HypothesisEngine","target":"Simulation","type":"REFERENCES"},{"id":"ecd1bc38-4b38-4274-b099-bbd39c000c1b","source":"HypothesisEngine","target":"Trace","type":"REFERENCES"},{"id":"3599b656-72e2-42d5-9184-ba60b08de134","source":"HypothesisEngine","target":"Stigmergy","type":"REFERENCES"},{"id":"71057aa3-2e11-491a-953a-6fb1cbc2e401","source":"HypothesisEngine","target":"Validate","type":"REFERENCES"},{"id":"6bf4658a-efb2-43eb-b853-9d9b03849fb3","source":"HypothesisEngine","target":"Hypothesis","type":"REFERENCES"},{"id":"ec89cdba-5aa0-4b1c-85f5-15b51435a9c9","source":"HypothesisEngine","target":"Check","type":"REFERENCES"},{"id":"6015789f-a109-4b7f-9119-6681f0b121ed","source":"HypothesisEngine","target":"Discover","type":"REFERENCES"},{"id":"246e0d5b-8eb8-4b2a-960c-3b4fe60219c7","source":"InternalConsistency","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"ae840c6a-bed1-452c-9eed-19ea5f3f3667","source":"InternalConsistency","target":"Artifact","type":"REFERENCES"},{"id":"2d174d61-547e-4e94-8e6e-672a0ef50d18","source":"InternalConsistency","target":"Check","type":"COMPOSES_WITH"},{"id":"791e4fa9-60bc-4e71-b2db-5c598a552e63","source":"InternalConsistency","target":"Context","type":"REFERENCES"},{"id":"68e35baf-aee1-4b4a-be86-1368732b195a","source":"InternalConsistency","target":"Validate","type":"COMPOSES_WITH"},{"id":"0fdfbaff-5694-49f7-ab21-6127c7321fec","source":"InternalConsistency","target":"94b9e9b9-80c3-4215-84b0-c1d92997195c","type":"HAS_INVARIANT"},{"id":"f7caa794-6dee-4279-b7ff-ddfa0fb3f9f5","source":"InternalConsistency","target":"8ddae946-59ea-42e0-bbfc-a30e7b68c505","type":"HAS_INVARIANT"},{"id":"187cf6b0-1c6a-4c5b-8e31-fa5ec4035c88","source":"Judge","target":"8f497759-ce27-442f-9c55-27f3c2ad7c49","type":"IN_CATEGORY"},{"id":"02acf436-ebbc-48fc-ba1b-0c81b5d6e41c","source":"Judge","target":"Criteria","type":"REFERENCES"},{"id":"5298fcde-ea85-4347-aac5-0417cff8ced7","source":"Judge","target":"Validate","type":"REFERENCES"},{"id":"784b0c4e-a33b-45d1-b323-95e93e00ef32","source":"Judge","target":"Check","type":"REFERENCES"},{"id":"ce4dc8cb-ba67-45cb-97c2-4bb30902851b","source":"Judge","target":"Subject","type":"ACCEPTS"},{"id":"448eef5d-881a-4b04-a298-513a46e12e40","source":"Judge","target":"Score","type":"YIELDS"},{"id":"83b3fd59-c49f-413f-b21f-ac5958be2866","source":"Judge","target":"Agent","type":"REFERENCES"},{"id":"798a4075-2426-4461-abe8-0b63a4744483","source":"Judge","target":"d0954532-4795-474a-a628-30b1b2d14193","type":"HAS_INVARIANT"},{"id":"f3653689-7a27-4ad8-bd1e-6fb5c3adf98b","source":"Judge","target":"4e8be21c-e0a3-42f4-9832-c0c038b46fd4","type":"HAS_INVARIANT"},{"id":"d504f359-0b12-4486-bd98-dce69b9a207e","source":"LayeredCheck","target":"90800e2d-25ad-47b4-9463-179cdb2d083f","type":"IN_CATEGORY"},{"id":"dc269b37-b77f-45bb-8e3b-920679375b6d","source":"LayeredCheck","target":"Gate","type":"COMPOSES_WITH"},{"id":"4ec05af0-46c9-4e81-9405-57ea9ce2ad31","source":"LayeredCheck","target":"Validate","type":"REFERENCES"},{"id":"df7296bd-969e-4e92-b94b-7e6252fa29c2","source":"LayeredCheck","target":"Sequence","type":"COMPOSES_WITH"},{"id":"862fe8be-4cd6-4a4a-bad1-d4633202d9ce","source":"LayeredCheck","target":"Hierarchy","type":"REFERENCES"},{"id":"8761e7df-7612-4c15-ab14-6fed40832f5e","source":"LayeredCheck","target":"Understand","type":"REFERENCES"},{"id":"cc208e36-683e-4382-b285-479495a54970","source":"LayeredCheck","target":"Check","type":"COMPOSES_WITH"},{"id":"b7c5db4f-3920-465b-bda8-20ef87e72a12","source":"LayeredCheck","target":"ef7fc0ea-bc6a-4744-a823-87a65331b5b1","type":"HAS_INVARIANT"},{"id":"1e581e67-be93-4ad3-9004-6a4212e640f1","source":"LayeredCheck","target":"3359fb4e-ed94-4c6b-b652-3c00641c1acc","type":"HAS_INVARIANT"},{"id":"f47a68ca-10cb-4108-92d6-844903de80fd","source":"EpistemicROI","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"215d6d27-8472-4261-9936-3dcc9c675889","source":"EpistemicROI","target":"Task","type":"REFERENCES"},{"id":"340517f3-2ae7-4e8e-9544-7cecbbece367","source":"EpistemicROI","target":"Experiment","type":"REFERENCES"},{"id":"bf3cf4c3-036d-4191-b419-119cc521f1b8","source":"EpistemicROI","target":"Act","type":"REFERENCES"},{"id":"d610ff24-6558-4b96-a9fb-fb802844d8be","source":"EpistemicROI","target":"Outcome","type":"REFERENCES"},{"id":"4d4617e9-efb5-4cea-b1b8-5a1d368eb31f","source":"EpistemicROI","target":"Result","type":"REFERENCES"},{"id":"5ed1a227-14f1-44a4-ba02-fd5665dd937a","source":"EpistemicROI","target":"ComputeBudget","type":"REFERENCES"},{"id":"d884c13f-2fa1-4845-a689-adba43075e9f","source":"EpistemicROI","target":"Value","type":"REFERENCES"},{"id":"3f65c37b-1ad4-440c-bbfe-64909df915b5","source":"EpistemicROI","target":"Decision","type":"REFERENCES"},{"id":"5ffd60e0-34f6-4abb-86ea-a7a7f2198250","source":"EpistemicROI","target":"CognitiveBias","type":"REFERENCES"},{"id":"36b338b7-7e8b-4fd9-b009-ce78e23d1edb","source":"EpistemicROI","target":"13a8cb30-30e9-4048-ae7a-757d6f161ec7","type":"HAS_INVARIANT"},{"id":"a15acb6e-c01e-4dd1-a3ef-b256607172ef","source":"EpistemicROI","target":"929ec3b1-a4d9-4103-bb91-c8e97b9d2168","type":"HAS_INVARIANT"},{"id":"d59b81db-46b1-4e9f-b121-4e4b60921f7f","source":"EpistemicROI","target":"fd24d216-3d83-4963-bc6e-53be22220d65","type":"HAS_PRECONDITION"},{"id":"0fddd3dc-b977-481f-b0c9-a252b5c6d7f9","source":"EpistemicROI","target":"54e92696-c38e-4a13-96b0-4e9d905b7750","type":"HAS_PRECONDITION"},{"id":"9bfa396a-3cb6-4904-b341-e6a7f29e092e","source":"EpistemicROI","target":"4299283a-0a25-4634-a061-10337065239b","type":"HAS_POSTCONDITION"},{"id":"d26b6b5a-332d-484e-9bb6-4ce28cbfb6a3","source":"PatternSketch","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"66455042-4b8c-4644-9e00-019710f91a31","source":"PatternSketch","target":"SkeletonOfThought","type":"REFERENCES"},{"id":"ce6e28f5-5a1d-4455-a8a9-d4c1269a97e8","source":"PatternSketch","target":"Agent","type":"REFERENCES"},{"id":"97f26543-a605-4457-91a2-5c0e9d09cfe0","source":"PatternSketch","target":"dfd9dbdc-b8b2-4ace-8cf5-e08a787e9bd7","type":"HAS_INVARIANT"},{"id":"4afd8c2c-8be5-4169-8ebf-7efbad7fe741","source":"PatternSketch","target":"c89e0929-f2ba-4959-9661-8c2d545e3a78","type":"HAS_INVARIANT"},{"id":"8ad5130d-65f0-42ff-b187-b5f66d7f6e86","source":"PatternSketch","target":"3bcab5c9-322b-4cf6-b0b1-34a6c9de7f5a","type":"HAS_PRECONDITION"},{"id":"4b944bf2-9d50-464b-b4c4-5fc87854b59c","source":"PatternSketch","target":"dc4e4063-8d82-4090-8f5b-ebb24538b0bb","type":"HAS_POSTCONDITION"},{"id":"de37fd4b-f9da-427c-ad05-ccb303ef8b23","source":"Bisect","target":"e38ff6e0-872e-4a63-a7ea-ebb84e174347","type":"IN_CATEGORY"},{"id":"ee31a91f-9895-46f2-a3de-522489237613","source":"Bisect","target":"RecursiveRootCause","type":"REFERENCES"},{"id":"eb3fafb2-d967-4af8-ab11-77dc9d4d860a","source":"Bisect","target":"BoundaryProbe","type":"REFERENCES"},{"id":"7d8d8200-2c45-42a5-9580-ba673f3276ba","source":"Bisect","target":"6080c176-cb3c-4eff-84fc-525258e15c77","type":"HAS_INVARIANT"},{"id":"70268504-90de-4f3d-b72e-aca0d34624a9","source":"CurriculumReplay","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"d7ce4f4c-398e-4199-bfb3-18443a5691be","source":"CurriculumReplay","target":"Agent","type":"REFERENCES"},{"id":"94f97daf-ef48-40eb-b9b1-4673a2c2b796","source":"CurriculumReplay","target":"Decay","type":"REFERENCES"},{"id":"f21c2ad5-c709-4e0a-9870-b162082f2d47","source":"CurriculumReplay","target":"ExperienceSharding","type":"REFERENCES"},{"id":"0a300cbd-4fb2-4f91-896a-9d9c690f4b13","source":"CurriculumReplay","target":"3e92417c-0d1a-4e27-9a6f-d30d44b1d3a4","type":"HAS_INVARIANT"},{"id":"26067b47-faa4-44ba-89bc-be3727e11a5a","source":"CurriculumReplay","target":"f85d3380-fd32-46eb-98c8-e319dce6d1c4","type":"HAS_INVARIANT"},{"id":"33ce29f2-b759-427c-ba05-d2064c8e7cf9","source":"CurriculumReplay","target":"1a20c00e-74a5-4a1c-be6e-c0a3bad7dfef","type":"HAS_PRECONDITION"},{"id":"c8edf2b0-1c47-432d-b4be-4cc13793b2bb","source":"CurriculumReplay","target":"74f34fc4-b8df-497f-999e-33ae98dbf180","type":"HAS_PRECONDITION"},{"id":"43a11927-286c-410f-b78b-21b714694f68","source":"CurriculumReplay","target":"0ce34274-826c-4e75-af23-f643d17cbceb","type":"HAS_POSTCONDITION"},{"id":"faa188ad-3151-44f8-8af8-5b0900fe6407","source":"HolographicShard","target":"6fe7b13d-4ed3-4c51-ae9a-7943dd282dbf","type":"IN_CATEGORY"},{"id":"b4c173e2-ec8e-4dc7-84c3-125c0877cfc3","source":"HolographicShard","target":"Deep","type":"REFERENCES"},{"id":"f0ebe0a0-40b9-4279-be83-d74c5940cc58","source":"HolographicShard","target":"Context","type":"REFERENCES"},{"id":"e605259d-fefa-4bbf-8a19-e1e87f1fc772","source":"HolographicShard","target":"FabricSharding","type":"REFERENCES"},{"id":"7d4896e9-0279-4ff3-a598-8f028ef5c8ab","source":"HolographicShard","target":"d330b36e-e3b8-4379-9857-8c716f4cc705","type":"HAS_INVARIANT"},{"id":"0eccfd99-24d1-4280-8739-e68eb9996e0f","source":"HolographicShard","target":"429e03e0-2793-4add-93e2-c371cbf3f17f","type":"HAS_INVARIANT"},{"id":"fbb676f8-41b7-45cf-99ef-a8393c9fbd93","source":"HolographicShard","target":"cb75feb0-afb5-4f60-b73e-453e5b156e65","type":"HAS_PRECONDITION"},{"id":"c3d2cc4c-5af1-4422-960c-7297c4e73ab2","source":"SocraticLoop","target":"e38ff6e0-872e-4a63-a7ea-ebb84e174347","type":"IN_CATEGORY"},{"id":"5fb9151a-6569-441d-8502-fde81ac3ac4c","source":"SocraticLoop","target":"Dialectic","type":"REFERENCES"},{"id":"0fb07912-ebc4-48b0-9ec1-5d49f4b6541f","source":"SocraticLoop","target":"Prompt","type":"REFERENCES"},{"id":"6123afcc-acda-4c4e-913a-d32b372401fb","source":"SocraticLoop","target":"Loop","type":"REFERENCES"},{"id":"fb22f8fc-d11d-472f-b361-35834ad97fa9","source":"SocraticLoop","target":"Agent","type":"REFERENCES"},{"id":"a56bd1aa-6421-4732-baef-b155072700ac","source":"SocraticLoop","target":"288addb0-e203-45d2-9284-8392802506a3","type":"HAS_INVARIANT"},{"id":"75663203-cf59-49ec-bffd-59e42b82b175","source":"SocraticLoop","target":"fca0d6d0-5a4a-4a58-adf6-cf2a7bc3c681","type":"HAS_INVARIANT"},{"id":"5064880f-306b-4a63-a500-cc16103f96d3","source":"SocraticLoop","target":"4370a596-e41a-43b9-b950-1b603cced9c0","type":"HAS_INVARIANT"},{"id":"276b6e9b-67a1-4879-b440-9d03d02a1cad","source":"SocraticLoop","target":"7de02558-42dd-4c6a-ae91-2bffee2ccbf6","type":"HAS_PRECONDITION"},{"id":"036698b4-59eb-4dbc-8f84-3bde8818235f","source":"SocraticLoop","target":"2c0ffd43-320c-4ffc-a435-70b06744fd66","type":"HAS_PRECONDITION"},{"id":"dae83126-a1f8-48c5-8c6a-42da0ffeb047","source":"SocraticLoop","target":"2049ddba-0f1d-4c8f-aa4b-6ee453c3773f","type":"HAS_POSTCONDITION"},{"id":"5cae1aba-1053-4343-9056-1a4d23da526f","source":"Tension","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"64ac300d-4042-4149-beb1-b2c07ee98fe1","source":"Tension","target":"Dialectic","type":"REFERENCES"},{"id":"7d9e0318-f929-47b8-b2a3-b0dc8e79e5a8","source":"Tension","target":"Yield","type":"REFERENCES"},{"id":"7a8b4cd6-43ea-4ea9-8f71-bc262166d508","source":"Tension","target":"50480892-c5c1-4650-ae20-5b5ec63a4203","type":"HAS_INVARIANT"},{"id":"8a1d2f33-9ba1-43eb-863d-c54abc05c946","source":"Tension","target":"1f2069c3-f469-436b-9a64-899202623a88","type":"HAS_INVARIANT"},{"id":"d2d00321-27ac-434c-aca9-7aac93cb3187","source":"EjectionSeat","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"2569606b-6bfe-42c6-ace4-5bb556281d68","source":"EjectionSeat","target":"Compensate","type":"REFERENCES"},{"id":"50f86324-49c4-413c-8798-442e42058e45","source":"EjectionSeat","target":"Signal","type":"REFERENCES"},{"id":"aa513de0-542e-4ddb-81f5-cfd647159eeb","source":"EjectionSeat","target":"2747a20d-3cf2-406c-a6f4-1fdd433a2339","type":"HAS_INVARIANT"},{"id":"238037ba-c199-4a2a-a617-e6d9ff0d5185","source":"EjectionSeat","target":"2eb49b1c-4eda-4b85-b9cd-02c2b4bdaa69","type":"HAS_INVARIANT"},{"id":"910c8275-8647-4d79-ac85-431dcc958cf2","source":"EjectionSeat","target":"9fffbe12-1311-41cf-9e94-ed5a9d7cf778","type":"HAS_INVARIANT"},{"id":"0c95b67f-baf5-4c9f-ae4b-180aa57c2cae","source":"Gardener","target":"a3dffe73-5c16-41fe-be7c-5f1b04ac73f2","type":"IN_CATEGORY"},{"id":"21611c42-6828-4f17-91f4-088c58e2924f","source":"Gardener","target":"Care","type":"REFERENCES"},{"id":"5eb50606-dcca-423c-9f33-cd47f15f42ef","source":"Gardener","target":"Compensate","type":"REFERENCES"},{"id":"47747281-ca2f-434e-bf6b-034468471ed8","source":"Gardener","target":"Stigmergy","type":"REFERENCES"},{"id":"55a0d95a-1dbf-414d-933f-d197bf1b66fc","source":"Gardener","target":"GracefulDegradation","type":"REFERENCES"},{"id":"fcbde58b-9d70-4f46-b590-002085070bb6","source":"Gardener","target":"70f10995-01f4-4638-93d0-e9dbd3c6845e","type":"HAS_INVARIANT"},{"id":"094e9e4e-0b03-412d-af4d-a874bfa86912","source":"Gardener","target":"b9c6de58-4700-47ce-830e-afb6a10c26cd","type":"HAS_INVARIANT"},{"id":"cd9b81e8-dc1d-4ed4-bb52-addf069fd416","source":"Retry","target":"8f497759-ce27-442f-9c55-27f3c2ad7c49","type":"IN_CATEGORY"},{"id":"67d90e97-7d03-4d39-93e8-bc003ad47471","source":"Retry","target":"Backoff","type":"REFERENCES"},{"id":"c8dba846-45cb-4787-b263-bf47a9fc89ee","source":"Retry","target":"Break","type":"REFERENCES"},{"id":"3cd15aa7-3324-439e-b14a-27d35ba64131","source":"Retry","target":"HumanApprove","type":"REFERENCES"},{"id":"2723d106-489d-4475-b8ee-b7caf9086ee3","source":"Retry","target":"Compensate","type":"REFERENCES"},{"id":"72ba935a-261f-4567-a6b3-658f11e460cf","source":"Retry","target":"CircuitBreaker","type":"REFERENCES"},{"id":"3dc58c08-874d-40a9-a94c-ace3f7b51f38","source":"Retry","target":"764626cf-4d20-407a-b230-24ddce480108","type":"HAS_INVARIANT"},{"id":"c9ce663c-f55d-487a-878a-a73b9ab619af","source":"Retry","target":"0e004149-a26d-4f0b-8020-f2e1b8e532b2","type":"HAS_INVARIANT"},{"id":"ecf2e83a-778e-44d8-9caa-2e06d67c9ad4","source":"Retry","target":"c4a05a05-6bac-4fbb-ab34-2692a8cbde33","type":"HAS_PRECONDITION"},{"id":"4eca912f-d68f-497c-95ea-250e632ae1d8","source":"Retry","target":"0253ad59-da2e-4376-b54d-92d502d1ed20","type":"HAS_POSTCONDITION"},{"id":"96ce1ad2-5c66-4d6d-9044-7ae6d6d902a9","source":"AtomicBid","target":"a3dffe73-5c16-41fe-be7c-5f1b04ac73f2","type":"IN_CATEGORY"},{"id":"9c47f45d-8c24-4202-9584-960ef1b20e64","source":"AtomicBid","target":"Compensate","type":"COMPOSES_WITH"},{"id":"b5bde51b-11f5-4f51-8905-5655b92e456e","source":"AtomicBid","target":"Act","type":"COMPOSES_WITH"},{"id":"56bf98ef-414a-4db6-944d-52d628013b1d","source":"AtomicBid","target":"LazyConsensus","type":"REFERENCES"},{"id":"a9954bc6-8497-4cf8-9fe0-c990b5d4c769","source":"AtomicBid","target":"Bid","type":"COMPOSES_WITH"},{"id":"cf470242-be99-4b49-a0b3-095c49d7b4dd","source":"AtomicBid","target":"Audit","type":"REFERENCES"},{"id":"b49a870c-20d6-4cfa-a5d4-9014594fb1c4","source":"AtomicBid","target":"65490b14-c5b6-41a4-b9b6-ac8a176d762f","type":"HAS_INVARIANT"},{"id":"b8fd851b-0166-4f4c-a08c-8442d8c47323","source":"AtomicBid","target":"144077f1-cbd9-4403-ac36-2a49f2252b95","type":"HAS_INVARIANT"},{"id":"ef570afc-107d-434a-8c23-8dce6064b357","source":"AtomicBid","target":"ba3f6d24-3525-4478-9e59-dc33501da75f","type":"HAS_INVARIANT"},{"id":"b4bd5cec-31b6-4aa0-8765-15bfb413a3aa","source":"MirrorStake","target":"a3dffe73-5c16-41fe-be7c-5f1b04ac73f2","type":"IN_CATEGORY"},{"id":"f041aab3-5790-4023-87d9-1fc3e10b4e9e","source":"MirrorStake","target":"CostlySignal","type":"REFERENCES"},{"id":"fdfec06b-7183-4022-95d2-ac80734fa603","source":"MirrorStake","target":"Agent","type":"REFERENCES"},{"id":"1879e5e6-2f53-42c5-9046-d8a669f8645d","source":"MirrorStake","target":"Value","type":"REFERENCES"},{"id":"25e1a9ba-d335-4b26-8ce7-23b0565304c7","source":"MirrorStake","target":"1cfe2cd7-cb49-485d-ab49-31ddaea6fed1","type":"HAS_INVARIANT"},{"id":"f503988e-d393-43c7-aa5b-b75593bc2ec4","source":"MirrorStake","target":"5a6bede5-7475-4c4f-9bae-6f32aa9bced7","type":"HAS_INVARIANT"},{"id":"a9f8de65-0e5c-4ec0-a504-f4f51ec55bfb","source":"MirrorStake","target":"815222aa-ddea-4b48-a706-c8dd318bed72","type":"HAS_INVARIANT"},{"id":"d6009580-fd05-4079-8a43-e09ff7166e97","source":"OsmoticFilter","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"6a401ce3-b6b1-4b03-aae9-d4527f82684a","source":"OsmoticFilter","target":"CostlySignal","type":"REFERENCES"},{"id":"453598fb-e3d9-4188-b015-0a31f7d979d7","source":"OsmoticFilter","target":"Canary","type":"REFERENCES"},{"id":"6fe8d8a6-d678-4af8-b4db-a4921af7b686","source":"OsmoticFilter","target":"Hysteresis","type":"REFERENCES"},{"id":"06a60151-5730-4f7e-b56d-da713795e795","source":"OsmoticFilter","target":"0a61b2d5-f1d6-458e-a9d7-71ef4a3d7651","type":"HAS_INVARIANT"},{"id":"7766b6b8-41c6-49ed-8410-f0e2b7fcf586","source":"OsmoticFilter","target":"851629cd-8b11-4698-a604-3a71256c8841","type":"HAS_INVARIANT"},{"id":"7cfd3509-b354-4321-bd46-76c64e768c0d","source":"OsmoticFilter","target":"067b825b-f50c-447a-ab70-1ae7c32e70ce","type":"HAS_INVARIANT"},{"id":"d709ae66-7b9d-4f90-a9be-4efcaf705023","source":"ValuePeg","target":"a3dffe73-5c16-41fe-be7c-5f1b04ac73f2","type":"IN_CATEGORY"},{"id":"f0a572b7-96fe-4cc4-abbd-a73f38707dac","source":"ValuePeg","target":"CostlySignal","type":"REFERENCES"},{"id":"28fc7c81-9fc3-47f1-9122-c97a3e98a141","source":"ValuePeg","target":"ExchangeRate","type":"YIELDS"},{"id":"bede5652-3082-4496-9652-c33ada8a3508","source":"ValuePeg","target":"Optimize","type":"REFERENCES"},{"id":"2e896210-ece4-4505-a53d-c7c7cda8b595","source":"ValuePeg","target":"Value","type":"REFERENCES"},{"id":"b2f87941-3608-4d28-a736-1bf772fdc3a6","source":"ValuePeg","target":"73c65b8e-c7bd-4b8a-ba18-a654c9e4fbab","type":"HAS_INVARIANT"},{"id":"6c633759-0d75-49da-b538-008c42495633","source":"HypothesisLadder","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"e7833567-f3e3-4776-a2b1-f3ac46c6c31d","source":"HypothesisLadder","target":"Experiment","type":"COMPOSES_WITH"},{"id":"8c84fe40-6433-4fad-8f86-1e76c808118d","source":"HypothesisLadder","target":"AbductiveLeap","type":"REFERENCES"},{"id":"8e689988-3e31-4bcc-8912-b73f347423d6","source":"HypothesisLadder","target":"Hypothesis","type":"REFERENCES"},{"id":"cd4c6df6-b30d-4383-94b5-5a787a441df2","source":"HypothesisLadder","target":"BayesUpdate","type":"REFERENCES"},{"id":"62b1fac4-01ec-4695-88f7-a3c5ef8887c8","source":"HypothesisLadder","target":"d5d9569d-f600-42db-bf26-26e3128e9c6d","type":"HAS_INVARIANT"},{"id":"7c773869-9dd3-4f2c-933c-2733c725807e","source":"HypothesisLadder","target":"ab4bac66-30d1-42e4-a923-71229a416019","type":"HAS_INVARIANT"},{"id":"a1998bca-a9e6-41dc-8b3c-dd1bddc98c85","source":"HypothesisLadder","target":"c934428b-c318-4271-9a26-69dd52975983","type":"HAS_INVARIANT"},{"id":"9f4eb8d1-ed13-4ea2-8eda-20994d8de689","source":"HypothesisLadder","target":"3358c4ba-3dcb-41f0-b6ea-e83d48958a43","type":"HAS_INVARIANT"},{"id":"2b585e42-4426-4498-a221-136a969aea0a","source":"HypothesisLadder","target":"26394de8-1f4b-454b-a11e-b96e72aabde0","type":"HAS_PRECONDITION"},{"id":"16cc54c0-0774-465c-833c-b501bdaf4182","source":"HypothesisLadder","target":"ebe22625-5e2d-4a63-88ea-cd9ade928f6a","type":"HAS_POSTCONDITION"},{"id":"85b73b57-c082-4478-815e-c039477844e8","source":"Cache","target":"6fe7b13d-4ed3-4c51-ae9a-7943dd282dbf","type":"IN_CATEGORY"},{"id":"e024d74a-76da-4013-bbab-97b110446801","source":"Cache","target":"Datum","type":"REFERENCES"},{"id":"da426cd3-0d66-4cbe-95b4-ecffd566978c","source":"Cache","target":"HeuristicSnap","type":"REFERENCES"},{"id":"9cdf97b2-6f92-4b63-abdf-ee527928f2a4","source":"Cache","target":"State","type":"REFERENCES"},{"id":"bc8d5d73-ef93-40d2-a2d3-85c48bd72b9c","source":"Cache","target":"4cce41e5-f766-4b96-b128-18efa86d2f61","type":"HAS_INVARIANT"},{"id":"0fcc0eea-48fb-47e6-bbeb-e16b308494be","source":"Cache","target":"03790e5e-dc49-47d4-9d0d-1f2c4c553a10","type":"HAS_INVARIANT"},{"id":"a7e5c6ca-bbe0-4c60-bfcd-da642de39257","source":"Cache","target":"6b2582e2-d69c-4ef9-8e2b-3f23dc2fb011","type":"HAS_PRECONDITION"},{"id":"bfbf5e19-8ffe-4811-84d6-151211b322ba","source":"Cache","target":"7baec329-cf71-4c00-8e53-1e30f13efc36","type":"HAS_PRECONDITION"},{"id":"2366dc3e-7748-495a-ba54-f91047ee92f8","source":"Cache","target":"b2d6e0ab-1538-40ab-9fa4-c6c5f5ce22f3","type":"HAS_POSTCONDITION"},{"id":"b9530262-e004-4644-a338-080916c1b6bb","source":"Estimate","target":"e38ff6e0-872e-4a63-a7ea-ebb84e174347","type":"IN_CATEGORY"},{"id":"6bd81af5-f151-4f6e-a870-c3cbe6392c32","source":"Estimate","target":"Simulation","type":"REFERENCES"},{"id":"4a344f44-4473-4c59-aefd-5a9bfce19ff7","source":"Estimate","target":"Bid","type":"YIELDS"},{"id":"4acfc318-41f9-497a-9628-6b929b1fddc9","source":"Estimate","target":"Task","type":"ACCEPTS"},{"id":"6c2841fa-630d-4a3a-b809-0cd6b9d6fc9f","source":"Estimate","target":"Think","type":"COMPOSES_WITH"},{"id":"6ec6811f-dede-47e9-a6a0-6974c0171579","source":"Estimate","target":"Value","type":"REFERENCES"},{"id":"e8f85817-fa28-44b5-80aa-b7d7d7babdcb","source":"Estimate","target":"HeuristicSnap","type":"REFERENCES"},{"id":"99eae217-6273-4d01-8906-0234ce713a92","source":"Estimate","target":"75d2dbd7-c6a9-491c-86cf-c8f1fa23f38a","type":"HAS_INVARIANT"},{"id":"39ea29bb-6a52-43c3-9549-b8232cef257b","source":"Estimate","target":"07281ae8-a54c-4d7e-bb2b-ff6ee7322fc6","type":"HAS_INVARIANT"},{"id":"1240c11a-b41c-43e7-9592-3824baff7482","source":"Estimate","target":"69c70827-b559-4d11-bc62-73b36a0dedf1","type":"HAS_INVARIANT"},{"id":"a8a5efec-6539-434e-888a-6bf474c00828","source":"MentalSim","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"44984e3e-309b-462b-8dce-7e08c1873ea2","source":"MentalSim","target":"Simulation","type":"REFERENCES"},{"id":"54cadcfa-4a62-43d9-9cfb-72459949dd71","source":"MentalSim","target":"State","type":"REFERENCES"},{"id":"1e25c3c1-bab8-4244-ba3a-bc78be5b19f6","source":"MentalSim","target":"System","type":"REFERENCES"},{"id":"c9745c73-b92d-4e5c-bc0a-86a88434f6a5","source":"MentalSim","target":"AgentSandbox","type":"REFERENCES"},{"id":"4d28fa9f-0b67-435d-ab39-09308d6edfda","source":"MentalSim","target":"Deep","type":"REFERENCES"},{"id":"b5aef8f0-2991-4c23-8fbd-d46934e09cb3","source":"MentalSim","target":"HeuristicSnap","type":"REFERENCES"},{"id":"4b37d7e0-6376-4dbc-a72f-e7162b884495","source":"MentalSim","target":"Agent","type":"REFERENCES"},{"id":"48f69791-5d95-4500-84a5-bc84d48f5783","source":"MentalSim","target":"ProphetFanOut","type":"RELATED_TO"},{"id":"1b79c3c6-17a7-4238-88b2-508e2d901383","source":"MentalSim","target":"85f9bf00-150e-45d1-887a-3844e113c5ca","type":"HAS_INVARIANT"},{"id":"e4a2fe2a-5859-4837-bb15-9a2637a72d65","source":"MentalSim","target":"cf9ec54f-7000-4ce5-af89-2b530e6b9795","type":"HAS_INVARIANT"},{"id":"ff407860-c503-48c4-88cf-1f1f481ac477","source":"MentalSim","target":"6008cad3-ce27-416d-8b34-e64f8c272022","type":"HAS_PRECONDITION"},{"id":"22c43d2b-2d13-4215-9db7-7b8a51207443","source":"MentalSim","target":"d5547c28-3bcd-4302-bafe-0f04c03205ad","type":"HAS_PRECONDITION"},{"id":"ba26bb05-e248-4f74-8037-509db690f599","source":"MentalSim","target":"c82b7c30-6489-4ef1-bad4-d47e58b78024","type":"HAS_POSTCONDITION"},{"id":"f54c4dfd-a700-4f4b-bca5-41035388dff1","source":"CiteBack","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"cdb827d6-58c6-4a69-98eb-5cbcbcd81fbc","source":"CiteBack","target":"RetrievalAugment","type":"REFERENCES"},{"id":"622b66ed-39e7-4d68-b638-b667caa0b75e","source":"CiteBack","target":"ec00f093-9b60-4201-9acc-12ce68a5dc35","type":"HAS_INVARIANT"},{"id":"45a7e9ea-ae14-4b10-b572-98199e739a8b","source":"CiteBack","target":"ab9a1e9c-e755-48fb-be8e-78381f2b96d9","type":"HAS_INVARIANT"},{"id":"3f2dbca4-1cb6-4ecf-a0dd-30083fb92251","source":"CiteBack","target":"44dafc22-2aa2-44f2-b5c6-53dc7470d38b","type":"HAS_PRECONDITION"},{"id":"0e40dd66-7532-4b5d-b74d-ace73917b9af","source":"CiteBack","target":"b7f7fec8-9b5d-45a5-87f4-4f5717fb5953","type":"HAS_PRECONDITION"},{"id":"1cf8a697-6929-48d5-ab95-287382d02703","source":"CiteBack","target":"acc57c85-7653-41ea-864d-403e6f4b43ef","type":"HAS_POSTCONDITION"},{"id":"ac41c195-eb30-4aa8-93e4-fe7cc9276fa3","source":"DeepResearch","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"04d390c6-ff78-4778-a779-0da887d6095b","source":"DeepResearch","target":"Synthesis","type":"REFERENCES"},{"id":"a72b7125-22e2-463d-9448-24dcbd5c2a34","source":"DeepResearch","target":"RetrievalAugment","type":"REFERENCES"},{"id":"ff5349d7-3713-42a5-917b-c2614c0bae4c","source":"DeepResearch","target":"Discover","type":"REFERENCES"},{"id":"0f176710-4522-48f2-b7e6-44132a6362da","source":"DeepResearch","target":"Deep","type":"REFERENCES"},{"id":"66c56034-57cb-4dc6-84f6-561fc56183b3","source":"DeepResearch","target":"CognitiveBias","type":"REFERENCES"},{"id":"fa729fd0-cff6-4fc4-be80-6d633207f3c7","source":"DeepResearch","target":"8dbb2a73-f09a-4a61-857c-38cba8a65566","type":"HAS_INVARIANT"},{"id":"2e3bbd4f-9b4a-412d-9000-a94c392ba3eb","source":"DeepResearch","target":"c1ae138c-889c-4138-b0ca-ae6c613d3ac8","type":"HAS_INVARIANT"},{"id":"8917d80b-07a3-48b5-a180-d660ae189962","source":"DeepResearch","target":"feac4f9e-a02f-4545-83e2-32463bc94a08","type":"HAS_PRECONDITION"},{"id":"3796cc59-ee61-4395-9c6d-b18f7477d172","source":"DeepResearch","target":"233e0c42-5999-4afa-aa35-06ff1da02808","type":"HAS_PRECONDITION"},{"id":"f6affab0-ef46-4102-bc3c-7faebd8731dd","source":"DeepResearch","target":"89ab8eac-9a51-4cd3-bd42-9706e4704c71","type":"HAS_POSTCONDITION"},{"id":"b684e79b-aaab-4690-90f4-4e5cda726257","source":"DeepResearch","target":"6fe2d40c-e766-4442-8bac-3327719e69ea","type":"HAS_POSTCONDITION"},{"id":"3c116b45-6a3d-4046-a385-5da7c8dc6a66","source":"AdversarialSteel","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"c2b4418d-231d-4a2b-8d0b-462902aaeee0","source":"AdversarialSteel","target":"SteelmanCheck","type":"COMPOSES_WITH"},{"id":"a1812c1c-109a-42cc-82f6-33cb4a69d916","source":"AdversarialSteel","target":"System","type":"REFERENCES"},{"id":"8a9c1bc1-c63b-4569-83e8-0a1974833d34","source":"AdversarialSteel","target":"Criteria","type":"REFERENCES"},{"id":"d8280f5e-4319-4843-b818-e01e7ec00ceb","source":"AdversarialSteel","target":"Judge","type":"REFERENCES"},{"id":"ca42a87d-8901-47ea-a209-c6109de0e06c","source":"AdversarialSteel","target":"Meta","type":"REFERENCES"},{"id":"23120071-83f9-44e0-a7b4-9c0b111f27f0","source":"AdversarialSteel","target":"CompatibilityCheck","type":"REFERENCES"},{"id":"c1928b6a-c74c-4ec4-b201-de19d9c5462b","source":"AdversarialSteel","target":"Agent","type":"REFERENCES"},{"id":"c990900e-4625-4869-a211-10c1513e757c","source":"AdversarialSteel","target":"4d4ca36c-85f1-4af2-981d-6377f2f585d9","type":"HAS_INVARIANT"},{"id":"a4df4a06-28f1-4b3f-a56e-b55a4d4a9d48","source":"AdversarialSteel","target":"527e3d3f-36cd-4b4d-b149-e642f7329591","type":"HAS_INVARIANT"},{"id":"dd6fa8f7-4190-4907-ab83-1731dd2b5755","source":"Contract","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"b5844f83-96bf-4cd4-97a5-40fe82e83a34","source":"Contract","target":"Judge","type":"REFERENCES"},{"id":"a5ee2fe3-a43c-4015-a24c-77a6e0bb373b","source":"Contract","target":"Sign","type":"REFERENCES"},{"id":"39db1f62-ffd2-4ebc-943c-34ba6c825eda","source":"Contract","target":"Condition","type":"ACCEPTS"},{"id":"21cdff21-9e7f-4ece-b566-c11bde1a2c81","source":"Contract","target":"Context","type":"REFERENCES"},{"id":"1ae83f64-e65d-44e6-9a00-c55d8bae2e6f","source":"Contract","target":"Identity","type":"REFERENCES"},{"id":"12d0e8b0-37cf-46c7-a0d9-3f7c6a6f84a8","source":"Contract","target":"dfb6f752-8b14-4b1a-9b6b-c692e5f83608","type":"HAS_INVARIANT"},{"id":"d80c45f3-3f3f-42c3-9d37-d030f1e604c4","source":"Contract","target":"bdc6ee6d-e34c-4e48-9419-a6c04cc47788","type":"HAS_INVARIANT"},{"id":"6a587538-c283-427c-bc84-92adb4e68ba9","source":"Contract","target":"355fff94-2426-4251-adc0-bcfd8067677a","type":"HAS_INVARIANT"},{"id":"7e95927b-b66b-4848-b796-45a320c867ce","source":"Expansive","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"228d7b0a-05d9-4387-ac42-2864e2974b13","source":"Expansive","target":"Judge","type":"REFERENCES"},{"id":"1b20ff38-481a-4ef0-80c4-54d0fb6f1f5d","source":"Expansive","target":"Value","type":"REFERENCES"},{"id":"5f240c36-7bf0-4bec-b0e2-7db86f1f2e87","source":"Expansive","target":"0b1f1248-09af-4b99-9246-9d83c144d61b","type":"HAS_INVARIANT"},{"id":"d76896d5-7430-45ad-a6a0-f9c74fb196b4","source":"HindsightBlock","target":"90800e2d-25ad-47b4-9463-179cdb2d083f","type":"IN_CATEGORY"},{"id":"5c1a1892-509c-4adc-bdd3-60238f34e930","source":"HindsightBlock","target":"PreMortem","type":"REFERENCES"},{"id":"8264581c-f699-40ea-bef3-e8d0d63c5685","source":"HindsightBlock","target":"Outcome","type":"REFERENCES"},{"id":"18f015ce-17ad-450d-b3b0-50bb7735ffe4","source":"HindsightBlock","target":"Judge","type":"REFERENCES"},{"id":"792785f8-e3a3-4a3a-9533-570923e2944c","source":"HindsightBlock","target":"Decision","type":"REFERENCES"},{"id":"45da1b4a-cbc1-458f-bacb-f369e3442329","source":"HindsightBlock","target":"9ab9c9b9-a345-470f-804c-87e29d84b4df","type":"HAS_INVARIANT"},{"id":"9964c01f-b67c-4c1e-829a-a121582e9805","source":"HindsightBlock","target":"79c34fae-0af0-43c1-bf3e-aad2ff6e5da5","type":"HAS_INVARIANT"},{"id":"cd37ca1d-aecd-46a0-a86a-5d02484f59f8","source":"HindsightBlock","target":"11353179-e236-418d-b406-6df80f04555b","type":"HAS_PRECONDITION"},{"id":"44fb6d7c-d13a-49a7-ae2a-3eac52709604","source":"HydraConstitution","target":"dc998770-80e1-4d40-8d8d-31037195e639","type":"IN_CATEGORY"},{"id":"fbf17c16-bfa6-4bb5-82a7-9113e77a03ac","source":"HydraConstitution","target":"Judge","type":"REFERENCES"},{"id":"4a1d954f-ef37-472c-a1c4-c794b7cbbd49","source":"HydraConstitution","target":"Quorum","type":"REFERENCES"},{"id":"10d785a2-b1e7-4f89-a93b-c677d9c8ac4a","source":"HydraConstitution","target":"33cc9137-1188-4787-908f-f08ac123fe67","type":"HAS_INVARIANT"},{"id":"66a711cd-4b7c-4617-9032-04e6a8c98432","source":"HydraConstitution","target":"52a6be24-8ac9-44a3-8bea-30d7ed8b1d71","type":"HAS_INVARIANT"},{"id":"a4a3a6ed-a542-4913-8547-57e4d08e1454","source":"HydraConstitution","target":"59a8188c-371d-40e7-8d99-b26dc7479ec0","type":"HAS_INVARIANT"},{"id":"f485cc70-c9de-41b3-887e-d202b4a3958e","source":"HydraConstitution","target":"91d7899a-3ff2-4034-914b-121fc9e20cbc","type":"HAS_PRECONDITION"},{"id":"b42e0218-8cef-44fa-9bca-f953698683b8","source":"HydraConstitution","target":"3001c8bd-e749-463f-b213-51282621f0f3","type":"HAS_POSTCONDITION"},{"id":"ae832965-6571-49b8-844d-b3279c215d9a","source":"NormativeJudge","target":"90800e2d-25ad-47b4-9463-179cdb2d083f","type":"IN_CATEGORY"},{"id":"8752084a-8443-4a1e-80ed-6de0b76f8479","source":"NormativeJudge","target":"Outcome","type":"REFERENCES"},{"id":"289c02e9-b56b-4494-8a81-67350271d533","source":"NormativeJudge","target":"Quorum","type":"REFERENCES"},{"id":"ecac3858-3756-4c21-85fa-3a7b278ae75f","source":"NormativeJudge","target":"State","type":"REFERENCES"},{"id":"d6176c75-b638-42cd-b46a-3e29bef6610a","source":"NormativeJudge","target":"PerspectiveEnsemble","type":"COMPOSES_WITH"},{"id":"0ec19f46-07bf-4be2-9af9-1e557c00b206","source":"NormativeJudge","target":"Judge","type":"REFERENCES"},{"id":"a6a66a9e-5c56-4a81-bde6-b5085f7327b8","source":"NormativeJudge","target":"HumanApprove","type":"REFERENCES"},{"id":"ab6d10da-7e53-4b01-8a86-f62488a3faf2","source":"NormativeJudge","target":"Value","type":"REFERENCES"},{"id":"0df61c68-d88a-4bdd-b783-79b95d74b595","source":"NormativeJudge","target":"6d0290d2-12bc-4a1f-b0d0-d574ffec8d80","type":"HAS_INVARIANT"},{"id":"ece35822-1826-40a7-803e-1846cad63de7","source":"NormativeJudge","target":"f752c01a-b015-4494-8aec-6712da51448a","type":"HAS_INVARIANT"},{"id":"0fcec252-adbf-4d9c-bb32-4651461396b3","source":"NormativeJudge","target":"4091785f-b68a-44b3-b52e-5dd0854c871e","type":"HAS_PRECONDITION"},{"id":"5744976d-d6b9-400e-ab77-d8a0ad2affb6","source":"NormativeJudge","target":"d4f3ad42-2c11-4c13-b688-ebdf135287d1","type":"HAS_POSTCONDITION"},{"id":"477b7bd7-2f6e-43d6-850e-23aa0840187f","source":"Novelty","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"d2412622-8af1-4425-8d94-f4e8ab7b57e2","source":"Novelty","target":"Judge","type":"REFERENCES"},{"id":"5f465b7d-e265-4701-8e10-066dc5efd154","source":"Novelty","target":"Value","type":"REFERENCES"},{"id":"b12b2b27-fb03-4517-9cbc-7c6039f0d5d6","source":"Novelty","target":"1d4f041c-7e7a-4e2c-97cd-61f170d75dc1","type":"HAS_INVARIANT"},{"id":"953d3379-c49c-4335-8c22-181db314337f","source":"Parsimony","target":"e38ff6e0-872e-4a63-a7ea-ebb84e174347","type":"IN_CATEGORY"},{"id":"0dd53924-0577-4d86-8c63-315dd181036e","source":"Parsimony","target":"Compress","type":"REFERENCES"},{"id":"39fb85bf-77eb-42c4-bace-693850732c69","source":"Parsimony","target":"Judge","type":"REFERENCES"},{"id":"c564a402-ec77-4d62-bc61-2bd25daff584","source":"Parsimony","target":"Topology","type":"REFERENCES"},{"id":"2af04d72-ddc1-4593-aa73-244da88c36fc","source":"Parsimony","target":"7253a8da-5f7c-4f93-b370-ac4b3c082b9c","type":"HAS_INVARIANT"},{"id":"51cb5b92-143e-4a5b-a00a-04d8ece350e7","source":"Realizable","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"7599deee-bf6d-490f-a5b6-161453b6eb4b","source":"Realizable","target":"Judge","type":"REFERENCES"},{"id":"859d1b89-3caa-4066-a5de-05ec08499a13","source":"Realizable","target":"Plan","type":"REFERENCES"},{"id":"6a4a942e-d81d-457a-9e8e-5a97da1522b6","source":"Realizable","target":"Step","type":"REFERENCES"},{"id":"5cd38391-8a6b-40fd-b22f-2ac1278932ea","source":"Realizable","target":"Value","type":"REFERENCES"},{"id":"7bf5ee5f-c3dd-44ff-9f94-ab72acb9dd1b","source":"Realizable","target":"7aeef670-387c-45a4-818b-e7049e1ebd30","type":"HAS_INVARIANT"},{"id":"9283c751-31d3-4b78-a6dc-17e5097c9ea7","source":"Realizable","target":"56a20f67-4b69-433d-8cb2-a8e19745b92b","type":"HAS_INVARIANT"},{"id":"e62d83ed-707e-4a9f-b36a-ae2276723490","source":"ScoringFunction","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"32eae4b0-8b76-4cad-a061-01070656ecb5","source":"ScoringFunction","target":"Rank","type":"REFERENCES"},{"id":"9d97d11d-355c-4fd5-94da-4857b588bccd","source":"ScoringFunction","target":"Judge","type":"REFERENCES"},{"id":"58829170-efe6-4474-88a2-26f83cc9661e","source":"ScoringFunction","target":"Value","type":"REFERENCES"},{"id":"165d5faf-483f-487c-9248-f604d42ee615","source":"ScoringFunction","target":"720bf58a-72e0-4ddb-85eb-9bd6814cf4b8","type":"HAS_INVARIANT"},{"id":"040c1d78-1d95-437f-9f1f-985815109ffe","source":"ScoringFunction","target":"b9fdec84-c6cd-4094-b3a2-5bf16d2e7832","type":"HAS_INVARIANT"},{"id":"2083c9f4-38a7-497f-a169-246f0b31e9d9","source":"TriGate","target":"dc998770-80e1-4d40-8d8d-31037195e639","type":"IN_CATEGORY"},{"id":"3e338b76-bf69-4bfc-8f24-bfeb4120248c","source":"TriGate","target":"Gate","type":"REFERENCES"},{"id":"adcb917c-67e2-46ff-9a9d-acbfa37fb427","source":"TriGate","target":"Condition","type":"REFERENCES"},{"id":"3a79385d-9542-4cfa-84b7-a4615b37f11b","source":"TriGate","target":"Judge","type":"REFERENCES"},{"id":"28a2d819-42bc-4d70-902b-8a8dccd1cb9c","source":"TriGate","target":"Ledger","type":"REFERENCES"},{"id":"bba80ffe-5ab7-47aa-bd88-69722124bbfd","source":"TriGate","target":"15c36368-4780-4474-bd68-b087acc23442","type":"HAS_INVARIANT"},{"id":"85389ff8-6657-4738-94ac-9248f16a85b6","source":"TriGate","target":"6d152219-a35d-4fb4-86de-df1b78f9dda4","type":"HAS_INVARIANT"},{"id":"f66af558-c532-477f-b0d5-878e79a2ab09","source":"SurprisalUpdate","target":"90800e2d-25ad-47b4-9463-179cdb2d083f","type":"IN_CATEGORY"},{"id":"72f83eca-ee7d-446e-b6a7-39d62ad0a8d0","source":"SurprisalUpdate","target":"EpistemicROI","type":"REFERENCES"},{"id":"31e5fa71-407a-4543-b47e-e3e1f67b3c1f","source":"SurprisalUpdate","target":"RegimeSense","type":"REFERENCES"},{"id":"13681444-0206-470d-b0fc-8118bfb15237","source":"SurprisalUpdate","target":"8a1140ab-5b0f-4fe3-a1c7-654eea01454f","type":"HAS_INVARIANT"},{"id":"f55a1fce-63a6-47ab-9fb0-c45cba9b6842","source":"SurprisalUpdate","target":"98cce711-c2bf-499b-b2af-a4e86b20e1bd","type":"HAS_INVARIANT"},{"id":"88c3f5b4-1465-4ede-975f-115081bcf964","source":"SurprisalUpdate","target":"b6f686d0-f915-4b8c-842c-81686f90fd7d","type":"HAS_PRECONDITION"},{"id":"21a1bf7a-6a12-4076-8f05-1d492d73fffb","source":"SurprisalUpdate","target":"92263344-e246-4a69-9c8d-cc042641f4fc","type":"HAS_PRECONDITION"},{"id":"26c7e564-cdf5-492c-b032-1fee4ef9bfd2","source":"SurprisalUpdate","target":"9e267505-890c-4db5-97e5-c097433b5539","type":"HAS_POSTCONDITION"},{"id":"a5eee195-92bf-4a5a-be13-3b22e04003bd","source":"SurprisalUpdate","target":"f1f2daaa-5e9d-4dfc-8d24-f0182038ebda","type":"HAS_POSTCONDITION"},{"id":"c8026e09-3842-474f-92bf-42cd8eb88045","source":"TensionHold","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"154f872e-c0a0-4033-bdbe-07dba8183b40","source":"TensionHold","target":"Tension","type":"YIELDS"},{"id":"a5d7e4c5-1ab3-4009-a6a1-8b83ed125a15","source":"TensionHold","target":"Synthesis","type":"REFERENCES"},{"id":"195984c3-acdb-4ede-b03b-4196a35754f5","source":"TensionHold","target":"Agent","type":"REFERENCES"},{"id":"9b23bf2d-8726-433b-8bd6-f99773d1cb0d","source":"TensionHold","target":"Dialectic","type":"REFERENCES"},{"id":"fdb537b4-ed14-49b4-b237-df09a579e830","source":"TensionHold","target":"805d0a36-c244-4cf8-b1d4-9ec2475f551d","type":"HAS_INVARIANT"},{"id":"2dce25d6-0c53-4079-a5f9-d7f7a82e6365","source":"TensionHold","target":"a8b834a1-503d-4bdf-8317-6b857513ac8e","type":"HAS_INVARIANT"},{"id":"32eb3a1e-315d-4fe5-ba2d-dace4be11e0a","source":"TensionHold","target":"b253400d-f0e1-4962-a9fe-3d220a835393","type":"HAS_PRECONDITION"},{"id":"3683e723-1d03-4ae7-b32b-ebb4b5188f5c","source":"TensionHold","target":"e11a2114-eb54-400d-ac37-9561e59686b9","type":"HAS_PRECONDITION"},{"id":"7288204c-95bd-4113-885e-9e447a3c6d33","source":"TensionHold","target":"c049253b-1ae3-4d82-8c42-88788e6366a3","type":"HAS_POSTCONDITION"},{"id":"841bf041-9a7f-42fc-9b1d-b984a91b37fb","source":"TensionHold","target":"cc05d64a-2164-428f-9f4b-fe2474e8ff12","type":"HAS_POSTCONDITION"},{"id":"f8892138-1c99-41b9-ac47-cbf2cea38a9b","source":"Disband","target":"dc998770-80e1-4d40-8d8d-31037195e639","type":"IN_CATEGORY"},{"id":"1b895f57-d048-49b9-b8fb-2398c4f262d5","source":"Disband","target":"Quorum","type":"REFERENCES"},{"id":"7d33ece2-f2c7-4624-bc3e-94e65c63eab2","source":"Disband","target":"State","type":"REFERENCES"},{"id":"8ff29039-0db2-4fd5-baba-5d8e6e2f84bd","source":"Disband","target":"Snapshot","type":"YIELDS"},{"id":"fc212af3-bb5f-4393-babf-28218c3b8fba","source":"Disband","target":"EjectionSeat","type":"REFERENCES"},{"id":"f77f8b0e-155a-40a8-9b37-0da100df2725","source":"Disband","target":"Agent","type":"REFERENCES"},{"id":"f7dfcb3e-5c2f-4fed-8e61-85b89249564b","source":"Disband","target":"7013355f-b275-4d3e-99f3-7e6346115442","type":"HAS_INVARIANT"},{"id":"9e539147-5b1c-4ab8-85de-e488837ce3fc","source":"Disband","target":"f870e8ac-8935-4ed8-8f35-ea8f62a7b234","type":"HAS_INVARIANT"},{"id":"e3456490-0564-4b79-822a-45d076e89f75","source":"Disband","target":"b3b5aa72-2e4e-42f1-bbe1-7bf3559a34c7","type":"HAS_PRECONDITION"},{"id":"9d6842d3-d782-4869-b29e-8211e84e8f19","source":"Disband","target":"ec081750-5e86-4620-88ec-a31370411658","type":"HAS_PRECONDITION"},{"id":"067273f6-cb1e-4375-aafd-284fd1fa4381","source":"Disband","target":"105f8f6b-40d6-4077-b0b5-685c6755c575","type":"HAS_POSTCONDITION"},{"id":"2d006adc-5818-4c27-bf91-ea10074886f7","source":"HackDetect","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"302a4f59-a079-4788-acc3-0e7dbe971f27","source":"HackDetect","target":"InputGuard","type":"REFERENCES"},{"id":"7cd0f092-f361-4548-b808-45f16bb7c1cc","source":"HackDetect","target":"EjectionSeat","type":"REFERENCES"},{"id":"891a9321-2857-4970-9aa7-ece5c3189f90","source":"HackDetect","target":"Agent","type":"REFERENCES"},{"id":"adb8dcb7-ef9d-40fd-bdbe-2d828c016e9a","source":"HackDetect","target":"System","type":"REFERENCES"},{"id":"07957287-96e1-48d4-a607-0dd201c9356b","source":"HackDetect","target":"de3cd560-2c9b-45e2-bcad-7fd40f2d3082","type":"HAS_INVARIANT"},{"id":"b3fb7445-c886-4e3b-a25d-cde9e4b6d450","source":"HackDetect","target":"648b4199-e07a-4958-bfd5-a5b23a86d2e5","type":"HAS_INVARIANT"},{"id":"44153a1d-8a9c-4fd9-9acc-023b8ba6cae7","source":"HackDetect","target":"ee79189f-b40d-4b00-836c-5b068603b412","type":"HAS_PRECONDITION"},{"id":"cdd25720-36a6-457e-94ae-bc00330e1a6f","source":"HackDetect","target":"f3a39de7-2780-4502-8d1c-4832518814db","type":"HAS_PRECONDITION"},{"id":"993b2916-4862-45dd-9e20-c986656eb992","source":"HackDetect","target":"17b19ab1-f861-43cb-9f3c-9e0e99a2b0e6","type":"HAS_POSTCONDITION"},{"id":"7d4fb772-3a07-4507-9a66-ea4f688c43b8","source":"HackDetect","target":"a7075ee7-8f03-422e-941f-1c554b1b044a","type":"HAS_POSTCONDITION"},{"id":"a0f4a867-2e27-4c90-aab7-3dd7be6a6ea3","source":"Rollout","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"55bad928-eb53-4389-a22e-4c5ba299ed8e","source":"Rollout","target":"EjectionSeat","type":"COMPOSES_WITH"},{"id":"bac88261-5ac4-454f-880d-f9ef7b78bf48","source":"Rollout","target":"Compensate","type":"COMPOSES_WITH"},{"id":"8d84d72e-4544-408a-ae92-e6ce53583c1d","source":"Rollout","target":"Canary","type":"COMPOSES_WITH"},{"id":"8021dadf-44ae-404f-9f0d-25812c822b79","source":"Rollout","target":"ManifestPlanning","type":"REFERENCES"},{"id":"3d9980c4-a539-444a-813a-70ac7e139919","source":"Rollout","target":"CircuitBreaker","type":"COMPOSES_WITH"},{"id":"b115e017-d6c5-4ad1-b99b-b87ee2ce8edc","source":"Rollout","target":"Act","type":"REFERENCES"},{"id":"99f457a3-1ddb-4f78-9ac6-9f8552f2c44d","source":"Rollout","target":"State","type":"REFERENCES"},{"id":"0bb8b849-acfe-4002-9ff7-313c62c35afe","source":"Rollout","target":"System","type":"REFERENCES"},{"id":"dc4dbb6b-6558-43aa-b6aa-ef5ea2d0d266","source":"Rollout","target":"Build","type":"REFERENCES"},{"id":"379c0b73-beb2-4211-80c5-a0fa24254ad1","source":"Rollout","target":"WorldReversible","type":"REFERENCES"},{"id":"1d652663-2e47-42ba-aeab-7e9535e13bd3","source":"Rollout","target":"ExecutionManifest","type":"ACCEPTS"},{"id":"34e5fcfc-a589-4dcf-9733-0fc65bead977","source":"Rollout","target":"Spec","type":"REFERENCES"},{"id":"b3c1a670-bfe7-4782-a6b1-4de8371b714c","source":"Rollout","target":"RolloutManifest","type":"YIELDS"},{"id":"a7633c2a-b59f-4492-b5f4-107d0c8e52f2","source":"Rollout","target":"MonitorReport","type":"YIELDS"},{"id":"26cb4e05-d9ee-4ac7-b916-50a2185f48aa","source":"Rollout","target":"b647eca5-8151-4e82-a157-ef82c85b380b","type":"HAS_INVARIANT"},{"id":"98d017eb-d402-4bb1-ad6d-41ae53aa433a","source":"Rollout","target":"d8390aca-2b3b-4349-a99d-a1eb9bf41654","type":"HAS_INVARIANT"},{"id":"c6879a8b-3f5d-4621-8500-a3208d195b79","source":"Rollout","target":"d92d2616-43a1-41c0-af51-79eb2c5ad829","type":"HAS_PRECONDITION"},{"id":"e7c835b2-8b14-4193-8a08-6496ea3f2f9b","source":"Rollout","target":"72edf949-7b49-4b0a-83ce-48bf74c14532","type":"HAS_PRECONDITION"},{"id":"2a619f30-44ea-4395-a940-acebc0bc72a3","source":"Rollout","target":"dc8cffcd-f00d-4eef-b561-710ba2476dd3","type":"HAS_POSTCONDITION"},{"id":"54050cc5-3715-478a-bc68-ab5fbca658f9","source":"Rollout","target":"457ab613-37cf-4a81-8782-5ec5bf23ecfa","type":"HAS_POSTCONDITION"},{"id":"bf4799bb-9a8c-4584-8623-870e75b9f5bf","source":"ContingencyPlan","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"18b43560-3a14-4ce8-a2e2-c2fc9a7149ca","source":"ContingencyPlan","target":"Plan","type":"REFERENCES"},{"id":"5b23db4f-fc33-418c-8684-c05d440b6029","source":"ContingencyPlan","target":"Retry","type":"REFERENCES"},{"id":"213b0cc0-377f-4ab9-a1a3-5bfcafa0872d","source":"ContingencyPlan","target":"a564db7d-5bf7-41e6-b6c0-1e07af7d0792","type":"HAS_INVARIANT"},{"id":"e9c2ab4a-f265-4dd4-a81d-311a4cd62e36","source":"ContingencyPlan","target":"27d25c25-4980-4d53-8afe-9045090274fd","type":"HAS_INVARIANT"},{"id":"f0a10ab2-750c-48eb-9596-cc48f82b162a","source":"ContingencyPlan","target":"613612f5-3d10-4698-9e97-bfafc77b237c","type":"HAS_PRECONDITION"},{"id":"9a220e39-50c9-4ba4-a2e6-a8bb82e83a96","source":"ContingencyPlan","target":"22ec757f-bdf2-4f3e-9c6d-6e19d39f2bc7","type":"HAS_PRECONDITION"},{"id":"08854422-53d3-496f-8c8a-3193a1f03b27","source":"ContingencyPlan","target":"1be18f82-a263-4a24-8096-ba19519d1aa7","type":"HAS_POSTCONDITION"},{"id":"a44ea480-0237-4c62-9d3f-6c34565999dc","source":"PromptChain","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"4194ebcb-b78d-4f78-83fb-d016b9610c19","source":"PromptChain","target":"ToolInvoke","type":"REFERENCES"},{"id":"f4691513-f156-42dd-96ba-04cb426218f8","source":"PromptChain","target":"Sequence","type":"REFERENCES"},{"id":"b2645317-db69-435b-8753-f2c7ce73be6d","source":"PromptChain","target":"InputGuard","type":"REFERENCES"},{"id":"ecc9049d-484d-42ad-8f5b-9171bff3d609","source":"PromptChain","target":"Task","type":"ACCEPTS"},{"id":"bba3869c-1e05-4844-a3e0-1fce8d565aa5","source":"PromptChain","target":"Chain","type":"REFERENCES"},{"id":"ac09b34a-15ec-43b8-b5b3-d5b8929284b5","source":"PromptChain","target":"Gate","type":"REFERENCES"},{"id":"f813517b-b97a-4bc6-bf5f-4d20a468c36c","source":"PromptChain","target":"AcceptSpec","type":"REFERENCES"},{"id":"33381e80-ba28-4293-8d56-303fb6ea6a6c","source":"PromptChain","target":"Retry","type":"REFERENCES"},{"id":"c8cc1ed6-47ec-49ff-ba23-6ffe294b614f","source":"PromptChain","target":"66be9970-45e0-4f16-9386-837edddd48fb","type":"HAS_INVARIANT"},{"id":"6cf52cc6-8e5f-4822-9688-615389ff5961","source":"PromptChain","target":"db390675-a38a-4e78-8fcf-3b4481b1f656","type":"HAS_INVARIANT"},{"id":"24efd652-1297-4bfa-b2f6-64c0bea576b1","source":"Delegate","target":"dc998770-80e1-4d40-8d8d-31037195e639","type":"IN_CATEGORY"},{"id":"5d558e8f-096f-4d58-b2f0-8bd537e3e6e5","source":"Delegate","target":"Heartbeat","type":"COMPOSES_WITH"},{"id":"89b49841-383c-48c1-bd07-0755099b0cc5","source":"Delegate","target":"HolographicShard","type":"ACCEPTS"},{"id":"fa41c103-f51e-4b5f-a365-54ed034fd9ee","source":"Delegate","target":"Work","type":"REFERENCES"},{"id":"d33aa759-be33-4c88-9b18-a8fe394ce73b","source":"Delegate","target":"MirrorStake","type":"COMPOSES_WITH"},{"id":"ead9f7bd-0837-48c8-8d89-bdaa0c3f6e22","source":"Delegate","target":"Break","type":"REFERENCES"},{"id":"9d7328ee-4389-41c7-9f42-ead6f65de92b","source":"Delegate","target":"Probe","type":"COMPOSES_WITH"},{"id":"24a1b6d5-002b-4ef6-9e55-0c7d4aef7067","source":"Delegate","target":"Task","type":"YIELDS"},{"id":"b2c53b24-0c76-4744-bbf7-b067fb2cfa93","source":"Delegate","target":"9866a028-2335-4ad1-808f-3811c849ae0d","type":"HAS_INVARIANT"},{"id":"2d00d8e4-cc0d-4304-ad50-252e456bf409","source":"Delegate","target":"f44c032e-94fd-45c4-89c6-a78384667db0","type":"HAS_PRECONDITION"},{"id":"7b30d9a7-b406-4906-9a5a-2a7caaa4213f","source":"Delegate","target":"66b7837e-5f2f-40d8-ab69-8f54fd46b6e9","type":"HAS_POSTCONDITION"},{"id":"2bde17e5-af63-42d7-bca0-a625e403c3f9","source":"EmpathySim","target":"a3dffe73-5c16-41fe-be7c-5f1b04ac73f2","type":"IN_CATEGORY"},{"id":"4ec56400-7f48-44f9-8f9d-857eb053f901","source":"EmpathySim","target":"Simulation","type":"REFERENCES"},{"id":"9d8128cf-3762-4d99-90f4-e4b3cf0209c0","source":"EmpathySim","target":"State","type":"REFERENCES"},{"id":"733bb162-b562-41bb-8b29-acac39711a29","source":"EmpathySim","target":"Agent","type":"REFERENCES"},{"id":"2133ee01-3d45-4ad7-b2b0-4902c8e0efaf","source":"EmpathySim","target":"AgentSandbox","type":"REFERENCES"},{"id":"b0863766-5a0e-4380-b235-39ad1b6cc6e9","source":"EmpathySim","target":"Context","type":"REFERENCES"},{"id":"cf818b85-deb2-4d05-b777-8550f00c4389","source":"EmpathySim","target":"Budget","type":"REFERENCES"},{"id":"5320b7d7-6a44-4ab7-a688-6e8c8f19edb2","source":"EmpathySim","target":"CognitiveBias","type":"REFERENCES"},{"id":"5ab9bf8e-7711-4e1b-9679-8646ea65a46b","source":"EmpathySim","target":"MirrorStake","type":"REFERENCES"},{"id":"feb77a98-67cf-409e-8a53-2dfddc0f6419","source":"EmpathySim","target":"7013e068-648d-46e7-a0b2-73eccce32486","type":"HAS_INVARIANT"},{"id":"bb3dfeab-e295-49fe-bc41-0f08a8ac1e7c","source":"EmpathySim","target":"8ad7062d-a2e0-4ede-84a1-2afbee98dc47","type":"HAS_INVARIANT"},{"id":"b3bbe638-1063-4368-bf88-27e6552062ad","source":"EmpathySim","target":"404121b9-99e6-4ceb-9d2b-21df26070852","type":"HAS_PRECONDITION"},{"id":"d4b0b9f3-2b2e-47b6-9941-a558cb8803b5","source":"EmpathySim","target":"b91c7fbc-f153-42c7-a102-1556fcf8a9ef","type":"HAS_PRECONDITION"},{"id":"f76ef538-dda2-434e-88e2-c3e5491d4dcd","source":"EmpathySim","target":"b0dbf164-b9e5-4a72-9aaa-0bc4d9ea01b2","type":"HAS_POSTCONDITION"},{"id":"cbe5113b-2d0d-4aca-925b-1900f78e1dfd","source":"EmpathySim","target":"24ba0036-0ae2-424b-9644-9f070461f724","type":"HAS_POSTCONDITION"},{"id":"2f909694-1f67-47b3-a9e8-0c1f362f51fa","source":"EpistemicWager","target":"a3dffe73-5c16-41fe-be7c-5f1b04ac73f2","type":"IN_CATEGORY"},{"id":"444319f2-6baf-4266-982d-26b71abd45c1","source":"EpistemicWager","target":"Belief","type":"REFERENCES"},{"id":"1ebd6011-eda8-445e-aa23-a1dc84776720","source":"EpistemicWager","target":"SpotAudit","type":"REFERENCES"},{"id":"24734f64-fbbe-4d24-b280-c6031d8b5e19","source":"EpistemicWager","target":"MirrorStake","type":"COMPOSES_WITH"},{"id":"5a0dd54a-04fa-4194-ad0d-801dffa5f0d3","source":"EpistemicWager","target":"BayesUpdate","type":"COMPOSES_WITH"},{"id":"8460e1ea-d7c9-4a61-bdf0-47367f23211c","source":"EpistemicWager","target":"Value","type":"REFERENCES"},{"id":"8a7338db-dbf4-49ce-b97c-ebabc980937a","source":"EpistemicWager","target":"Oracle","type":"REFERENCES"},{"id":"d8a22271-8620-4125-895a-bc991a70f25a","source":"EpistemicWager","target":"Agent","type":"REFERENCES"},{"id":"17fceb20-0857-4732-93f8-572202e1f475","source":"EpistemicWager","target":"Falsification","type":"REFERENCES"},{"id":"2f5c8a20-e27d-4c84-b549-4e71f26a5d1f","source":"EpistemicWager","target":"daa0afc8-87d5-4291-98e1-01bcae9f7e2c","type":"HAS_INVARIANT"},{"id":"f1863640-bf3f-4107-a873-24065195c1fc","source":"EpistemicWager","target":"9c75bee1-4d75-48f5-b571-60db6368b64b","type":"HAS_INVARIANT"},{"id":"4ef444b3-06e5-4332-980f-065b78230f3c","source":"EpistemicWager","target":"62936caa-b170-4a6d-9005-eee51784973b","type":"HAS_INVARIANT"},{"id":"d9bea519-83b0-4485-8c7f-9cde65fe6b3e","source":"EpistemicWager","target":"47c25e7f-8574-49a8-94b4-485c75db48bb","type":"HAS_PRECONDITION"},{"id":"044b5827-2b60-46e3-a602-fffb4d71be17","source":"EpistemicWager","target":"0f60fe92-894e-4688-a9ea-7eed0d74ef20","type":"HAS_PRECONDITION"},{"id":"8045ff08-2987-4018-a4b0-806ec841c41b","source":"EpistemicWager","target":"13d9899e-b3e7-4cf4-81a6-c65d2bdca16b","type":"HAS_POSTCONDITION"},{"id":"fe29cf34-4c76-416c-b0f0-d1c9194a3d1b","source":"EpistemicWager","target":"010d1cf1-a83b-4f06-aadf-1b5508cd9cbe","type":"HAS_POSTCONDITION"},{"id":"f7d07d0c-9442-405c-aa1c-c17d8493f53b","source":"StakedProbe","target":"a3dffe73-5c16-41fe-be7c-5f1b04ac73f2","type":"IN_CATEGORY"},{"id":"11a5fa50-dc09-434f-9ac9-dbb57a03332e","source":"StakedProbe","target":"MirrorStake","type":"COMPOSES_WITH"},{"id":"ebaaa38e-8cb5-41cf-934f-8f29f3cd442b","source":"StakedProbe","target":"Probe","type":"COMPOSES_WITH"},{"id":"82fb883b-918f-44e4-8003-4dcd5b160d3f","source":"StakedProbe","target":"daa0afc8-87d5-4291-98e1-01bcae9f7e2c","type":"HAS_INVARIANT"},{"id":"b9140d7d-a7c0-45b4-b78a-2caffcd4a3cf","source":"StakedProbe","target":"f26c73af-6f84-48f7-8396-bd835a98be85","type":"HAS_INVARIANT"},{"id":"bf08578d-274e-4d41-b0b3-b94c3322168c","source":"Fermi","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"4c4f37a3-4bd8-4685-9aad-700249a91cde","source":"Fermi","target":"Estimate","type":"COMPOSES_WITH"},{"id":"c02ab1de-24d1-46e0-8868-88cbed602e4e","source":"Fermi","target":"Decompose","type":"COMPOSES_WITH"},{"id":"37c29afa-9b8e-4f41-953e-52b2fbee25d9","source":"Fermi","target":"ab659997-28e1-45d5-ad2c-aa3a750e0708","type":"HAS_INVARIANT"},{"id":"82046537-3339-451b-8a09-500ef10f1fdd","source":"Fermi","target":"23d7782d-7429-4909-b76d-4845d06b6e7b","type":"HAS_INVARIANT"},{"id":"a0002e84-42eb-4896-9f16-d7351c72bbf6","source":"ImaginaryHistorian","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"5a0c5157-7764-449f-8449-bfa3bc2f189e","source":"ImaginaryHistorian","target":"MentalSim","type":"REFERENCES"},{"id":"51337a33-c535-4f33-a706-667ac0a27a00","source":"ImaginaryHistorian","target":"Simulation","type":"REFERENCES"},{"id":"0fbbf030-d19e-401b-942e-45f3caf7d595","source":"ImaginaryHistorian","target":"Trace","type":"REFERENCES"},{"id":"eba1501c-d903-4304-83a8-65febe81a356","source":"ImaginaryHistorian","target":"CryptoShred","type":"REFERENCES"},{"id":"965dd5dc-6da7-45d7-9ce2-eb8bca8899bd","source":"SimulationTrace","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"28c05652-240b-4e0d-aeb0-0fcf748eb343","source":"SimulationTrace","target":"MentalSim","type":"REFERENCES"},{"id":"0671cee5-9ecb-410f-8176-fdd0a52a462c","source":"SimulationTrace","target":"Simulation","type":"REFERENCES"},{"id":"ffe3c2a6-a156-4e42-93ec-4493fa3bb23e","source":"SimulationTrace","target":"Trace","type":"REFERENCES"},{"id":"2c802889-d317-40f7-844b-47477221d999","source":"SimulationTrace","target":"d70e1e6b-33e2-4bc0-8a14-663dcd5169bb","type":"HAS_INVARIANT"},{"id":"07c16d80-b52b-432b-a879-6d059f3e5e62","source":"SimulationTrace","target":"89432a9b-5314-4d41-8db8-7951f42a3531","type":"HAS_INVARIANT"},{"id":"c43ec0e0-276d-4e98-bdf6-84ef32240482","source":"SimulationTrace","target":"2b7df96a-4806-4e43-b22b-b8c29afcd3ab","type":"HAS_INVARIANT"},{"id":"8e548f9e-0df7-4c7b-af42-815ecc3b8072","source":"SimulationTrace","target":"14f7ecb1-65bc-49fb-a3fc-b4084b0e7a46","type":"HAS_PRECONDITION"},{"id":"f3ca0d4e-2b7a-4a9f-9e8f-e01731c59274","source":"SimulationTrace","target":"91b37268-4173-445e-84d6-d8bdaacdd4ba","type":"HAS_POSTCONDITION"},{"id":"9993eb9d-a031-4caa-8ab9-69cfba2f5d97","source":"SourceEvaluate","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"d5351837-b4f6-4376-a41d-022bbf916802","source":"SourceEvaluate","target":"Judge","type":"REFERENCES"},{"id":"29e2e3c3-d85c-4fff-a971-9bb12fde893a","source":"SourceEvaluate","target":"CiteBack","type":"REFERENCES"},{"id":"d60fd44a-080c-4dfb-a9b2-d3a51e247dcf","source":"SourceEvaluate","target":"Agent","type":"REFERENCES"},{"id":"c16acc7f-2132-4bd8-9844-e24922631543","source":"SourceEvaluate","target":"6ef15b3c-a080-49c8-b718-ffcf06223ac9","type":"HAS_INVARIANT"},{"id":"766339a4-29b8-4af5-9bb4-7e725a69e519","source":"Uncertain","target":"8f497759-ce27-442f-9c55-27f3c2ad7c49","type":"IN_CATEGORY"},{"id":"e2fa3ed9-07a4-46c1-a0d2-440684be0600","source":"Uncertain","target":"SocraticLoop","type":"REFERENCES"},{"id":"2236de1f-7c11-43dc-bf6c-ac8c97edca69","source":"Uncertain","target":"Variable","type":"REFERENCES"},{"id":"5fd953c9-479b-4296-8cb4-be6864ed5343","source":"Uncertain","target":"UncertaintyMap","type":"REFERENCES"},{"id":"d7049ebe-6d0b-403f-a2d2-fa830043e135","source":"Uncertain","target":"Agent","type":"REFERENCES"},{"id":"38c82206-1d88-4626-8d04-7bb0d14fef3c","source":"Uncertain","target":"DeepResearch","type":"REFERENCES"},{"id":"f8ad611b-99b6-4931-a992-7f8136aab5e6","source":"Uncertain","target":"bae8397d-9e3a-4662-b635-4cca88188e50","type":"HAS_INVARIANT"},{"id":"1c0749a6-1291-4c84-97e2-b3e96719b16c","source":"Uncertain","target":"a28dc0c6-db92-4d3e-856d-362071b37426","type":"HAS_INVARIANT"},{"id":"1631ae0d-58d2-4def-b7f1-81c5db979634","source":"Uncertain","target":"776322bb-8919-4442-9dc1-a36a53bbb4d6","type":"HAS_PRECONDITION"},{"id":"67770b7f-afdc-4cd8-b844-5aeb093f86cb","source":"Uncertain","target":"34c5a8f1-3a93-4dc7-bc36-35819b9ab0b0","type":"HAS_POSTCONDITION"},{"id":"f8891923-76a2-4e88-8bb1-9094f895aead","source":"Uncertain","target":"5d0f9458-700f-4845-84c9-3e700c8ead11","type":"HAS_POSTCONDITION"},{"id":"2d2832a1-7176-4a67-a984-11ccacd0b69f","source":"ConstructOntology","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"c3f07f69-7f35-401b-80ca-10016e08cba0","source":"ConstructOntology","target":"OntologyHandshake","type":"REFERENCES"},{"id":"0fc96edb-ca9f-44a1-8a29-a3d99e903eed","source":"ConstructOntology","target":"AdversarialSteel","type":"REFERENCES"},{"id":"a7d546b8-d849-47b5-80d1-cbb03f5bc877","source":"ConstructOntology","target":"FirstPrinciples","type":"REFERENCES"},{"id":"f230653e-4126-4c90-9262-1a17853cb4c4","source":"ConstructOntology","target":"6e8f43d4-9213-413e-a20e-cce42db45aad","type":"HAS_INVARIANT"},{"id":"0636c58e-c125-423a-b089-5727907ce8de","source":"ConstructOntology","target":"5781f31a-c65b-42b5-b773-c480adc72e50","type":"HAS_INVARIANT"},{"id":"a0077c2a-eb54-4354-a3fa-0b6901739b60","source":"ConstructOntology","target":"9e1c2a6c-cf2f-41a1-b60b-952b3f0b4d9a","type":"HAS_PRECONDITION"},{"id":"2f8fa623-712f-4e1f-97e1-1db67717a1d5","source":"ConstructOntology","target":"b0f75f6d-457b-4522-9bcc-d2c1872b6d1a","type":"HAS_POSTCONDITION"},{"id":"14155a02-3d09-4ecd-ac00-54fdf4727501","source":"RedTeam","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"1790ab45-da08-4b5f-82c7-79cffb669575","source":"RedTeam","target":"AdversarialSteel","type":"REFERENCES"},{"id":"139e841e-2dc8-4881-8496-2f96fd436b8a","source":"RedTeam","target":"Switch","type":"REFERENCES"},{"id":"2092b08a-d0ce-451f-9f19-73c841b052ce","source":"RedTeam","target":"ccf282af-3f91-484d-a1ef-2585f50948bd","type":"HAS_INVARIANT"},{"id":"9e8c1499-f6f8-49d1-a6b8-5a57e57abf69","source":"RedTeam","target":"09edc9f0-c55e-45ff-a784-c306f66745b4","type":"HAS_INVARIANT"},{"id":"87ac00d6-9a64-46e9-8395-75a9dc571828","source":"RedTeam","target":"0c1f7ac7-fd20-4a64-a60c-bda18152354a","type":"HAS_PRECONDITION"},{"id":"bea1250a-d5a1-4bda-9ac6-01a24c46aa4b","source":"RedTeam","target":"b32cf6cd-4dac-4cb6-a62a-f4d6104f35b3","type":"HAS_POSTCONDITION"},{"id":"cc6abf30-ac7d-4c54-b6de-b65bebf4ff2e","source":"Award","target":"a3dffe73-5c16-41fe-be7c-5f1b04ac73f2","type":"IN_CATEGORY"},{"id":"8029d651-18e5-4073-ad7e-4cfa499b1dcb","source":"Award","target":"State","type":"REFERENCES"},{"id":"8e9834f4-fa13-45b9-a682-b0eba3b97d23","source":"Award","target":"Act","type":"COMPOSES_WITH"},{"id":"a9f970f5-685a-4e83-baa0-e1dd22529532","source":"Award","target":"Solver","type":"REFERENCES"},{"id":"72451ec5-9188-474a-8ca2-fcb19a347e3b","source":"Award","target":"Contract","type":"YIELDS"},{"id":"a529c4de-a3c3-4b85-a933-cb291c981d7c","source":"Award","target":"Bid","type":"ACCEPTS"},{"id":"34eb44fa-6c03-4936-b661-fa7a7e2241de","source":"Award","target":"Value","type":"REFERENCES"},{"id":"d3c90fb9-81df-4864-8efb-923abaed7ff8","source":"Award","target":"HeldRelease","type":"COMPOSES_WITH"},{"id":"1451a975-1d0d-4a01-8fc6-596abd07dddc","source":"Award","target":"Sign","type":"COMPOSES_WITH"},{"id":"132f3b23-ca3c-43c1-b3cc-0cf047c25eca","source":"Award","target":"4c2bceb8-c362-40a1-a862-f3c8521f3ec5","type":"HAS_INVARIANT"},{"id":"3ce796c9-e72c-429d-a150-ae4222a2e534","source":"Award","target":"b3c32d18-afd4-4f09-8a63-da38a76c38f4","type":"HAS_INVARIANT"},{"id":"afc8ec81-25ff-42de-bdd6-a4d85eb1a06f","source":"Crystallize","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"3424404c-c27f-4ad9-a76c-b567aa567a61","source":"Crystallize","target":"State","type":"REFERENCES"},{"id":"e9bfc428-e94b-4b1d-9a26-4ca4dbbe47c9","source":"Crystallize","target":"Transition","type":"REFERENCES"},{"id":"2347ab29-0fbd-49e3-81e0-004442537029","source":"Crystallize","target":"EntropyPump","type":"REFERENCES"},{"id":"128c8513-2c18-4036-b330-e3c8f40f8736","source":"Crystallize","target":"Decay","type":"REFERENCES"},{"id":"123b5ef1-6bea-433a-9072-268a2fc274a4","source":"Crystallize","target":"Resonate","type":"REFERENCES"},{"id":"a0da62a1-3a48-4feb-9626-4734c71d6188","source":"Crystallize","target":"HydraConstitution","type":"REFERENCES"},{"id":"ddda5d54-663e-42b7-8c22-8edaacbbd163","source":"Crystallize","target":"Agent","type":"REFERENCES"},{"id":"59d79c32-6f8e-40b1-9428-b199cbea28d8","source":"Crystallize","target":"Dampen","type":"REFERENCES"},{"id":"3efc9cd8-094f-467d-859d-de0e58f39a9d","source":"Crystallize","target":"113c0393-fedd-47fd-a9fd-3f819b478ce2","type":"HAS_INVARIANT"},{"id":"bbc63c4d-d733-4107-abfe-dda8aec46c7b","source":"Crystallize","target":"0d0e7e23-e831-43bd-be0e-42fe0b8a5919","type":"HAS_INVARIANT"},{"id":"e1d4ac21-a0a0-47b2-ad90-b593a95e7b6c","source":"Crystallize","target":"5881d9c0-defd-41ba-92ff-3d0092b48a63","type":"HAS_PRECONDITION"},{"id":"d29bc019-6eec-4df5-8cf4-c2939e92a8e7","source":"Crystallize","target":"8e9e2466-a23c-4109-935c-22cb24d6ac90","type":"HAS_PRECONDITION"},{"id":"fe2414ea-1737-44b9-a1eb-5ae6fe1fff61","source":"Crystallize","target":"db8ffd23-9934-40e0-bab0-532520d5d3c0","type":"HAS_POSTCONDITION"},{"id":"210fc6aa-eb73-4367-9896-5ca5345dbdcd","source":"Crystallize","target":"ce2f9812-9772-4c75-a760-a3a48c817abe","type":"HAS_POSTCONDITION"},{"id":"f25cdc08-e71f-4912-8519-f883ca874fd9","source":"Elect","target":"dc998770-80e1-4d40-8d8d-31037195e639","type":"IN_CATEGORY"},{"id":"0dcb4480-9efb-4ba0-a79f-f3813f045dd9","source":"Elect","target":"AcceptSpec","type":"ACCEPTS"},{"id":"8da27f15-9ea9-4ad5-a375-7c1e234bb7bd","source":"Elect","target":"HydraConstitution","type":"COMPOSES_WITH"},{"id":"aff8863e-82ea-4876-82b6-24392ebe8d86","source":"Elect","target":"Solution","type":"YIELDS"},{"id":"25956394-e61c-4a2d-b3e4-4bae767a1f71","source":"Elect","target":"Ballot","type":"ACCEPTS"},{"id":"72abe0b7-ed68-421d-84fc-3ae1357b4921","source":"Elect","target":"020d1eb5-913f-4b54-913b-3a9ac150b741","type":"HAS_INVARIANT"},{"id":"83a844f7-75b0-41b8-99de-4bc21e28a417","source":"Elect","target":"8d33f738-1a02-41db-babe-e85ac077023e","type":"HAS_INVARIANT"},{"id":"dd97cbed-4d8a-4a25-b314-82b8177dbea5","source":"Elect","target":"c3b862d5-98fb-41fd-9d1a-1b09cf62e273","type":"HAS_PRECONDITION"},{"id":"a396b486-1dc6-4595-9a3d-89ff30e9bdb9","source":"Elect","target":"fc9362b3-a57f-4f62-8ab5-c0eaad62dece","type":"HAS_PRECONDITION"},{"id":"5c414d3d-d749-45e7-94c3-e82dcccf388b","source":"Elect","target":"716a10d1-3753-4380-9f17-1c38f3ed42d2","type":"HAS_POSTCONDITION"},{"id":"294f757d-42f4-41c1-bcc1-6e0e89612a00","source":"Elect","target":"a28ff009-795b-418a-858e-3bbe8fe3570e","type":"HAS_POSTCONDITION"},{"id":"1797644f-e91c-48a2-b385-01c5fa5e365d","source":"NormCheck","target":"90800e2d-25ad-47b4-9463-179cdb2d083f","type":"IN_CATEGORY"},{"id":"542ec31d-3122-4855-828c-25d7a98d306e","source":"NormCheck","target":"NormativeJudge","type":"REFERENCES"},{"id":"9c16ea3e-3e30-4906-baf0-fe7f16e34584","source":"NormCheck","target":"Quorum","type":"REFERENCES"},{"id":"76775089-c4aa-4ac3-9141-1536aa16b874","source":"NormCheck","target":"Judge","type":"REFERENCES"},{"id":"200d5482-76f0-4b84-9c35-0d38131eb8ef","source":"NormCheck","target":"Check","type":"REFERENCES"},{"id":"20b1f14b-707f-4927-aac2-42e4e70b175d","source":"NormCheck","target":"ProphetFanOut","type":"REFERENCES"},{"id":"c1ab5aac-5555-4a9b-af2c-736be2587ade","source":"NormCheck","target":"Value","type":"REFERENCES"},{"id":"df7b6a92-36dc-49ec-b341-43a536fe09cb","source":"NormCheck","target":"40c8278e-1105-4108-9411-7908dd072340","type":"HAS_INVARIANT"},{"id":"0420c881-000f-4ad9-959e-8c650e5d3cb1","source":"NormCheck","target":"f9efa1fe-c100-42f0-a67c-a0c635566da1","type":"HAS_INVARIANT"},{"id":"45eccd46-bba2-4d1a-b1a4-423771340b65","source":"NormCheck","target":"01ba5d7b-c99b-4391-9c6f-9e66f1dd06a0","type":"HAS_PRECONDITION"},{"id":"6dd70b58-ffbf-44c4-8bfd-9b8cd6c12f6b","source":"NormCheck","target":"d1f372e4-4d2c-40cc-a704-a8004bd3da15","type":"HAS_POSTCONDITION"},{"id":"cc03fb18-58b8-4e3e-9f7c-b4cc1cb547a5","source":"Aesthetics","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"9c3ef104-4d06-4110-87c9-58861a019efd","source":"Aesthetics","target":"Metric","type":"REFERENCES"},{"id":"4fbe09da-3e6d-49c7-9784-4034df18e4ca","source":"Aesthetics","target":"Parsimony","type":"REFERENCES"},{"id":"828c02c6-2016-498b-923b-c69479b78adb","source":"Aesthetics","target":"Artifact","type":"REFERENCES"},{"id":"55339cb3-00c5-4f47-9b18-1cdd370ab70a","source":"BreadthGovernor","target":"90800e2d-25ad-47b4-9463-179cdb2d083f","type":"IN_CATEGORY"},{"id":"a21d3ce0-505c-4d16-8597-82dc49651120","source":"BreadthGovernor","target":"Parallel","type":"REFERENCES"},{"id":"b0071601-fdcc-47a6-afbe-985e648ae5fb","source":"BreadthGovernor","target":"ProphetFanOut","type":"REFERENCES"},{"id":"14257f24-f1ff-48ab-b59c-1f6f4c0a01cd","source":"BreadthGovernor","target":"Context","type":"REFERENCES"},{"id":"9b7dea5e-fb4c-4270-9126-e33e1f1d5cdd","source":"BreadthGovernor","target":"Value","type":"REFERENCES"},{"id":"b4691156-4de9-4990-9501-f4213f30ddb4","source":"BreadthGovernor","target":"Budget","type":"REFERENCES"},{"id":"0d2d318f-73fc-4843-a45b-3f56e6de54d7","source":"BreadthGovernor","target":"Parsimony","type":"REFERENCES"},{"id":"3225c85e-0e29-436e-bf4e-653d1b788da0","source":"BreadthGovernor","target":"Decompose","type":"REFERENCES"},{"id":"97461295-b0c0-4b15-9cc1-b4142faa275c","source":"BreadthGovernor","target":"b6b9485e-7d7a-498d-902b-7f64f9caf014","type":"HAS_INVARIANT"},{"id":"b8ae8b39-756f-4877-86ba-3e1619a05f2f","source":"BreadthGovernor","target":"1deb9f61-1ce1-442b-80ce-f711b7222763","type":"HAS_INVARIANT"},{"id":"ebac8e69-f607-4737-8b78-b153480bec00","source":"BreadthGovernor","target":"4081a9ba-4f95-4fad-adf4-0202a75e05e0","type":"HAS_PRECONDITION"},{"id":"a0dbd3f0-f3d8-435d-8764-3d05355730e6","source":"BreadthGovernor","target":"4ca8a595-6c82-4236-a082-6442b091e45b","type":"HAS_PRECONDITION"},{"id":"3516006b-100b-4c0e-b381-6b7cebde7a7c","source":"BreadthGovernor","target":"944189f8-cf21-4edb-8780-59ce6381f389","type":"HAS_POSTCONDITION"},{"id":"35553f49-2452-4072-8ed7-f095d1062d62","source":"ConceptBlend","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"d6bb3936-e12e-4bb4-b3da-b8b08e7ccff8","source":"ConceptBlend","target":"TriGate","type":"REFERENCES"},{"id":"95ff6933-e5a0-4230-a78e-71fcb531a0bc","source":"ConceptBlend","target":"AnalogyBridge","type":"REFERENCES"},{"id":"82f76f4f-83a1-4bb6-888c-b12f07595593","source":"ConceptBlend","target":"Realizable","type":"REFERENCES"},{"id":"da09714e-dde7-4d58-adcf-77262ce45106","source":"ConceptBlend","target":"4406647b-7755-47e8-9733-e0ee5df195c8","type":"HAS_INVARIANT"},{"id":"4096d135-c96c-4963-ae0b-5a84b6110f3f","source":"ConceptBlend","target":"f7b417d5-356e-4d36-b8a6-f1bc731828fd","type":"HAS_INVARIANT"},{"id":"eb1af5af-3101-46c5-9a24-7f166ae25e92","source":"PURECheck","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"b74f7079-dd04-41c3-a928-8b0dad23ba54","source":"PURECheck","target":"Realizable","type":"REFERENCES"},{"id":"53e9e127-18ae-4f26-bbe9-3739f0ae4873","source":"PURECheck","target":"Novelty","type":"REFERENCES"},{"id":"23bd6e29-0e3f-44c5-9019-0f241b65164a","source":"PURECheck","target":"LayeredCheck","type":"REFERENCES"},{"id":"9eba1187-0aea-4cc5-9a5b-101ad7c02b15","source":"PURECheck","target":"Expansive","type":"REFERENCES"},{"id":"689909e8-6963-450c-8c50-28de85feabca","source":"PURECheck","target":"Solution","type":"REFERENCES"},{"id":"652b7a34-6119-4a9d-a0db-d6ff2250be2d","source":"PURECheck","target":"Protocol","type":"COMPOSES_WITH"},{"id":"f2fa6132-3bbc-4f3d-bd35-b42b54fce58a","source":"PURECheck","target":"TriGate","type":"REFERENCES"},{"id":"e33236a8-d0f3-408e-8cd2-db67fae9ce71","source":"PURECheck","target":"Parsimony","type":"REFERENCES"},{"id":"27d5ee8a-fd4b-4783-a211-fe080ae77284","source":"BeliefTracking","target":"6fe7b13d-4ed3-4c51-ae9a-7943dd282dbf","type":"IN_CATEGORY"},{"id":"9fe0c87f-a9ba-4b6f-bdee-396c2be2c0c3","source":"BeliefTracking","target":"Belief","type":"REFERENCES"},{"id":"46ca2a55-77be-4f60-bf61-57600d0e6868","source":"BeliefTracking","target":"CognitiveBias","type":"REFERENCES"},{"id":"1c1d1150-6d04-4f7a-8bf9-ed09d3140ccc","source":"BeliefTracking","target":"Agent","type":"REFERENCES"},{"id":"f38fb817-a9b2-469d-8fe5-6917e6f45895","source":"BeliefTracking","target":"SurprisalUpdate","type":"REFERENCES"},{"id":"3952f22f-998f-4cca-ab40-152c35545782","source":"BeliefTracking","target":"9aee0a43-42df-4d2e-b31f-87577162f81d","type":"HAS_INVARIANT"},{"id":"0c00dee0-5d2d-49fd-84eb-258505f2924d","source":"BeliefTracking","target":"af3907a5-d2b0-475d-8b02-3187a416b8f1","type":"HAS_INVARIANT"},{"id":"a2924012-17ca-4eb2-ad3a-8919b19d99ec","source":"BeliefTracking","target":"3bf6f3d3-ccee-4930-9de9-71a69632a061","type":"HAS_INVARIANT"},{"id":"6f7b0cd5-4cc3-4a6b-8d27-12a14315006d","source":"BeliefTracking","target":"e7ccec19-a179-4d30-baf9-f9762b6ca750","type":"HAS_PRECONDITION"},{"id":"40d52ba4-d784-45e1-b74f-d1838282a0f3","source":"BeliefTracking","target":"90a8d5b5-8c12-420a-871b-c01127fcfc96","type":"HAS_PRECONDITION"},{"id":"67e6d2e8-50c3-4c20-a3c8-343b663e11de","source":"BeliefTracking","target":"21291178-499f-417b-b8cf-eef2f6c0f4f8","type":"HAS_POSTCONDITION"},{"id":"dd3d2353-dd59-4d8a-9474-ef494d8ab35d","source":"BeliefTracking","target":"83205de8-5879-4e06-a3c1-ce0c5c0d4da6","type":"HAS_POSTCONDITION"},{"id":"6c0b83e2-ff05-4a4d-9855-af381832c549","source":"CounterfactualAnchor","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"929903a3-632f-48a0-b35c-3198aa6e21a1","source":"CounterfactualAnchor","target":"Signal","type":"REFERENCES"},{"id":"8595ea5a-a445-42dd-9a0c-ff1cb569804b","source":"CounterfactualAnchor","target":"Agent","type":"REFERENCES"},{"id":"e0627cba-1c98-4995-a8dc-38459ef72bc0","source":"CounterfactualAnchor","target":"Observe","type":"REFERENCES"},{"id":"97332726-74eb-439a-9473-02116d45d4f8","source":"CounterfactualAnchor","target":"SurprisalUpdate","type":"REFERENCES"},{"id":"e90994f5-8d88-4bf8-977e-0ddd3da4392e","source":"CounterfactualAnchor","target":"CognitiveBias","type":"REFERENCES"},{"id":"ffb89b4b-f893-4951-8173-39e490f5b30f","source":"CounterfactualAnchor","target":"a1473994-ba9d-47d1-98ec-2cf6c713e5bc","type":"HAS_INVARIANT"},{"id":"98c136a5-0e71-43bc-a234-42a2f457b1da","source":"CounterfactualAnchor","target":"0c2d463b-6b97-4781-94b4-f30a62a74bcb","type":"HAS_INVARIANT"},{"id":"96558a60-66b3-403c-862d-b5c7e72f3007","source":"CounterfactualAnchor","target":"66482da9-f37f-442b-a49b-ec11de0de1cc","type":"HAS_INVARIANT"},{"id":"916fa795-ed91-48c5-bc70-7486d4add703","source":"CounterfactualAnchor","target":"91a9f2eb-5a74-468b-b941-eb2ec903f6e5","type":"HAS_PRECONDITION"},{"id":"02e56998-fb90-4478-a730-63393d1ae462","source":"CounterfactualAnchor","target":"7dc1cea2-48c7-4b08-90a8-e37e2d772432","type":"HAS_PRECONDITION"},{"id":"5fe982e8-bcf3-4fd5-ba2a-ba3719a4c3fd","source":"CounterfactualAnchor","target":"8e6915fc-3161-4f89-a0ff-421e5450cdda","type":"HAS_POSTCONDITION"},{"id":"feeb24f6-9f99-462b-a75d-2ffca45ea677","source":"CounterfactualAnchor","target":"8ed054c8-5c68-44e8-82c5-eb8d80aaae77","type":"HAS_POSTCONDITION"},{"id":"4aaf2abb-c1ad-4e37-bccc-cf743d38cd05","source":"TraceBelief","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"08fc8253-19ad-4acc-978b-da22c71e8a25","source":"TraceBelief","target":"Belief","type":"REFERENCES"},{"id":"71605df5-ef77-4682-bae5-bf8628d02e8d","source":"TraceBelief","target":"TimeWarpLog","type":"REFERENCES"},{"id":"ac7a4017-74da-4d39-9ec4-482dfaef0728","source":"TraceBelief","target":"Trace","type":"REFERENCES"},{"id":"a1b20a77-e3d4-4b3e-9db0-a9df28c7651c","source":"TraceBelief","target":"SurprisalUpdate","type":"REFERENCES"},{"id":"93d8257e-e5a1-4652-85e3-29e523a76d72","source":"Deploy","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"965eb30e-7568-42c7-a08d-1df1a3bf1fd2","source":"Deploy","target":"Rollout","type":"COMPOSES_WITH"},{"id":"382f91a1-28f8-4649-88fc-c4bd79332243","source":"Deploy","target":"Act","type":"COMPOSES_WITH"},{"id":"6a8548e7-bd15-4064-bae0-248668487174","source":"Compose","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"fa2a8be1-5a43-4232-8471-22fe20b4389c","source":"Compose","target":"Combine","type":"REFERENCES"},{"id":"36355834-4304-4156-9e10-4aa01971283c","source":"Compose","target":"Check","type":"REFERENCES"},{"id":"bed739ce-83d2-4d2d-b5cb-2163291b3096","source":"Compose","target":"PromptChain","type":"REFERENCES"},{"id":"5da34091-e620-4167-b21f-e034f8b003ae","source":"Compose","target":"762a66cc-9219-4e24-bfd4-15213787ee11","type":"HAS_INVARIANT"},{"id":"0774d410-d8ea-490b-8231-3569704e1f5d","source":"Compose","target":"1ce1c5a6-1d14-4de0-afdc-3be45aaba169","type":"HAS_INVARIANT"},{"id":"b2a14e56-92d0-42ca-8050-daa773c63537","source":"Compose","target":"d206b156-64c4-4cf7-b95c-f4a7299a9671","type":"HAS_PRECONDITION"},{"id":"a6e75f9c-1964-4408-a337-88727d842901","source":"Compose","target":"e49001a3-d832-4520-953e-6cad2e2ebee9","type":"HAS_POSTCONDITION"},{"id":"3c5373a0-a50b-40f3-9c1c-92b1edee2494","source":"MetaPrompt","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"76ed986e-7910-403e-812e-ec3d86e7ac0d","source":"MetaPrompt","target":"Task","type":"REFERENCES"},{"id":"58d665b3-8ed4-40de-b7de-ea25be1e2b3e","source":"MetaPrompt","target":"Prompt","type":"REFERENCES"},{"id":"fca7615e-230a-46ff-8b85-9e23fc855884","source":"MetaPrompt","target":"Meta","type":"REFERENCES"},{"id":"59862b55-61d8-4830-85a6-82ddbd0c6603","source":"MetaPrompt","target":"PromptChain","type":"REFERENCES"},{"id":"b2034505-0656-4fc3-a69d-f91ed530e806","source":"MetaPrompt","target":"422968d6-8695-497e-9052-9514cb240374","type":"HAS_INVARIANT"},{"id":"bb031095-3bbc-4f92-8e9e-80ce6de01a57","source":"MetaPrompt","target":"dc1dfcb9-5f28-4fe4-ae8f-59192d05a886","type":"HAS_INVARIANT"},{"id":"da212a15-9d69-4bd9-95d5-18660859888c","source":"MetaPrompt","target":"908d025a-5105-497e-95e6-c28fea246b70","type":"HAS_PRECONDITION"},{"id":"c3d648eb-20db-42cf-9f1d-a0450f269af3","source":"MetaPrompt","target":"9b2ce326-7e2c-46c6-980b-247488be2aea","type":"HAS_PRECONDITION"},{"id":"f5e74cae-107c-45cb-808c-8946452bd62b","source":"MetaPrompt","target":"52f58c6f-8dfd-491b-a1d8-5d3dba42f0bb","type":"HAS_POSTCONDITION"},{"id":"bcc1f6ec-a0c9-4134-a533-bd49e0873006","source":"PatternDiscovery","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"f9faa962-e71c-4bbb-bd2a-ae18279b1dd6","source":"PatternDiscovery","target":"ConstructOntology","type":"REFERENCES"},{"id":"ad85da76-f772-482f-b896-5a1e48a6efd0","source":"PatternDiscovery","target":"Protocol","type":"REFERENCES"},{"id":"51b19028-809a-4a39-a42e-cee7a75155f3","source":"PatternDiscovery","target":"Check","type":"REFERENCES"},{"id":"a16dc2de-b797-4bd1-a647-987e6fa0949a","source":"PatternDiscovery","target":"Search","type":"REFERENCES"},{"id":"b18aaeca-de16-438a-ac55-4fa6a65a4aa8","source":"PatternDiscovery","target":"Agent","type":"REFERENCES"},{"id":"86c4c7ca-ae65-4e3a-9157-015e0427f048","source":"PatternDiscovery","target":"628d75d7-7f1c-4362-8feb-7e199665a140","type":"HAS_INVARIANT"},{"id":"9698c37c-410e-4f58-a2e6-a25a8f23c10b","source":"PatternDiscovery","target":"984d2d8f-302e-4bd0-832d-cebb76371bf5","type":"HAS_INVARIANT"},{"id":"bf42fe79-9271-4b48-a896-59fdac61e79d","source":"PatternDiscovery","target":"8d014fc7-9441-4d8c-a354-0c2967506da0","type":"HAS_PRECONDITION"},{"id":"062c93cf-b63b-41d3-b840-461d1543a056","source":"PatternDiscovery","target":"df4e9373-a3dc-46b0-98ad-106efd2b681a","type":"HAS_PRECONDITION"},{"id":"8b39c19c-c841-4cf9-847d-f2623ff0cdc1","source":"PatternDiscovery","target":"2affb141-3645-4458-b437-e0736c2a9844","type":"HAS_POSTCONDITION"},{"id":"cb64c594-de49-41a0-a95d-e71101ba2691","source":"AdversarialProof","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"5a50de02-f047-4eb8-87a8-2fdf422762cd","source":"AdversarialProof","target":"NegativeProof","type":"COMPOSES_WITH"},{"id":"7ad9e052-e813-44e7-a57d-bd079538a949","source":"AdversarialProof","target":"RedTeam","type":"COMPOSES_WITH"},{"id":"d4096e00-796f-477d-a808-298a939a14a6","source":"AdversarialProof","target":"Hypothesis","type":"REFERENCES"},{"id":"aa1e91c5-adfa-4598-997c-dba1f858f4c3","source":"AdversarialProof","target":"ccf282af-3f91-484d-a1ef-2585f50948bd","type":"HAS_INVARIANT"},{"id":"62cf8d16-89d5-4b08-a1da-9831b660ad4a","source":"AdversarialProof","target":"fa92cee1-f9c5-45f1-9783-ac7b6156c814","type":"HAS_INVARIANT"},{"id":"0825e90c-0de0-485e-a6b0-3135c421b183","source":"AdversarialProof","target":"21436c45-ba5d-4db9-aa65-0f1fdcb154a5","type":"HAS_PRECONDITION"},{"id":"0fce2f3d-7f95-42a2-840b-f7b98ba3fa9f","source":"AdversarialProof","target":"a89accdc-ce39-4c86-8b33-80c9bf8d13bf","type":"HAS_PRECONDITION"},{"id":"d34d2023-7dc1-4a94-bd0a-6c685c999c84","source":"AdversarialProof","target":"444dfbb5-5e6b-4837-874d-27330ffc8987","type":"HAS_POSTCONDITION"},{"id":"82f25121-121e-4d28-aeba-fbb9c4413c95","source":"SafetyCartographer","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"b7875cb9-96db-4dee-8406-cab0147510f9","source":"SafetyCartographer","target":"Constraint","type":"REFERENCES"},{"id":"91dfdd8d-8f05-4cc9-a181-835a420c0055","source":"SafetyCartographer","target":"RedTeam","type":"REFERENCES"},{"id":"37ec6b8f-738f-452d-8366-9f9c7aa421e3","source":"SafetyCartographer","target":"Discover","type":"REFERENCES"},{"id":"74df539f-3374-43d1-a8fb-5367ab20080f","source":"SafetyCartographer","target":"BoundaryProbe","type":"REFERENCES"},{"id":"f88f2227-ed24-45b2-8817-9b2ad1cd1a93","source":"Rally","target":"dc998770-80e1-4d40-8d8d-31037195e639","type":"IN_CATEGORY"},{"id":"8eb4dcda-6131-4ca5-abda-9501c71973ad","source":"Rally","target":"AcceptSpec","type":"COMPOSES_WITH"},{"id":"b2707893-d7a1-46a6-b2da-d639ec2b5c56","source":"Rally","target":"Quorum","type":"REFERENCES"},{"id":"2523b02d-f99c-4298-a4f1-523e357c2452","source":"Rally","target":"Protocol","type":"REFERENCES"},{"id":"187f605b-382f-439b-a088-45949503832a","source":"Rally","target":"Select","type":"REFERENCES"},{"id":"acfaee0f-c8da-46ce-b4f8-ac7121ca5e18","source":"Rally","target":"Context","type":"REFERENCES"},{"id":"886084df-5170-404e-bdd0-378ca09bdca2","source":"Rally","target":"Elect","type":"REFERENCES"},{"id":"1d3e22ad-b043-4f4b-849b-9018edbe2737","source":"Rally","target":"93398bf3-03e9-4e28-a60a-0a3a155a17a2","type":"HAS_INVARIANT"},{"id":"a41cd827-b52c-40e0-929f-a7b0ee77bb33","source":"Rally","target":"1e8e5269-c4ea-424d-a225-b314203683a3","type":"HAS_INVARIANT"},{"id":"259fe5bf-8acc-4231-8d1c-a8ada264dcdd","source":"Rally","target":"e011d33c-c640-4bce-ac91-1c7aa392c42d","type":"HAS_PRECONDITION"},{"id":"24b9fbe1-1f81-4e25-b7a8-96a898d121e7","source":"Rally","target":"12a948da-22a8-41eb-b884-d0334f45fcaf","type":"HAS_PRECONDITION"},{"id":"920a091b-6040-4eeb-aadd-72c600539a38","source":"Rally","target":"dbb913b4-fa27-45ad-8631-df6f33358922","type":"HAS_POSTCONDITION"},{"id":"46380327-1483-4473-9a3a-03d253498774","source":"Vote","target":"dc998770-80e1-4d40-8d8d-31037195e639","type":"IN_CATEGORY"},{"id":"925e12d2-d3bf-44d8-9969-0ca582167f48","source":"Vote","target":"Aggregate","type":"REFERENCES"},{"id":"aa8c9b8b-fd2c-4019-be2b-78ba2795e859","source":"Vote","target":"System","type":"REFERENCES"},{"id":"9704c3be-d10d-45ba-8463-c83574182995","source":"Vote","target":"Quorum","type":"COMPOSES_WITH"},{"id":"12c9b279-7713-4c54-a056-ed4f83e5d56b","source":"Vote","target":"Ballot","type":"ACCEPTS"},{"id":"c22bc1a3-2495-44a8-a80f-dac10dc4c864","source":"Vote","target":"Break","type":"REFERENCES"},{"id":"424edf23-eb55-47ec-905b-0e09269bee0c","source":"Vote","target":"Elect","type":"REFERENCES"},{"id":"6eaffc90-40f5-4c3d-a311-dc9a435b25e6","source":"Vote","target":"fd35949d-af6e-4629-98eb-b5ce867b4068","type":"HAS_INVARIANT"},{"id":"15decf8c-dca2-4918-adc9-42bd545681ae","source":"PhasedRefinement","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"0a48da25-ef1e-4c37-9d8c-edc612d8a3dd","source":"PhasedRefinement","target":"Gate","type":"COMPOSES_WITH"},{"id":"8bb7f32c-70fe-492c-9f95-5b576265235c","source":"PhasedRefinement","target":"Reason","type":"REFERENCES"},{"id":"a541e287-ee62-456d-9f28-8c629b90a9f7","source":"PhasedRefinement","target":"StructuralCoaching","type":"REFERENCES"},{"id":"a02136ab-2bee-43f4-b83b-812a8f76b26d","source":"PhasedRefinement","target":"Sequence","type":"COMPOSES_WITH"},{"id":"a06f0e57-0e1d-4847-b050-390d056d0677","source":"PhasedRefinement","target":"Aesthetics","type":"REFERENCES"},{"id":"55588b05-f41a-470a-bf01-2482bb503e08","source":"PhasedRefinement","target":"Refine","type":"COMPOSES_WITH"},{"id":"fa3d260e-bfcb-4568-9463-bd0f14928c87","source":"PhasedRefinement","target":"Artifact","type":"REFERENCES"},{"id":"b61e7c84-edf5-4fba-a5f3-4c3ae7017a9a","source":"PhasedRefinement","target":"1fdb1f4a-f3a4-4a74-84cb-b0640eb514c2","type":"HAS_INVARIANT"},{"id":"197031bd-f808-46c6-a9a1-6014a6b3a10d","source":"PhasedRefinement","target":"957914ac-909f-4818-bae0-9d31eda7417b","type":"HAS_INVARIANT"},{"id":"39a5d306-3c0a-4909-aed0-a4dd54eec194","source":"PhasedRefinement","target":"3c9b9116-7854-426d-a4b8-df7bc437764b","type":"HAS_PRECONDITION"},{"id":"dca2f0fc-3ebf-43ce-bb52-c2184011764e","source":"PhasedRefinement","target":"91e36995-cef6-4380-9af4-1e3d01999efd","type":"HAS_POSTCONDITION"},{"id":"884825bb-4e49-4cc5-a48b-1e6f1c995570","source":"CapacityPressure","target":"a3dffe73-5c16-41fe-be7c-5f1b04ac73f2","type":"IN_CATEGORY"},{"id":"b374eacf-6658-4768-a41b-32383ca2a0f2","source":"CapacityPressure","target":"Generalize","type":"REFERENCES"},{"id":"367aa34c-da76-4091-9f0d-7c569b0ed1f8","source":"CapacityPressure","target":"ConceptBlend","type":"REFERENCES"},{"id":"d17b18c6-fe33-4dea-8b53-8d64aab361b0","source":"CapacityPressure","target":"Constraint","type":"REFERENCES"},{"id":"289b95e7-a024-4453-88bf-e6702bc36200","source":"CapacityPressure","target":"ContextCompress","type":"REFERENCES"},{"id":"13d8c562-1b4a-466a-9e52-e864cd2b59b7","source":"CapacityPressure","target":"Budget","type":"REFERENCES"},{"id":"f09259b1-5ad7-4578-b89e-9656cf297c47","source":"CapacityPressure","target":"Agent","type":"REFERENCES"},{"id":"a6cdccf3-89e2-4083-9202-171dab61fa67","source":"CapacityPressure","target":"fed54d7c-8c01-491b-b164-37e6b4cd54a6","type":"HAS_INVARIANT"},{"id":"5bcf04d0-160a-471e-a180-9351028c0784","source":"CapacityPressure","target":"f9111547-2688-4132-aa85-d2fdbe86965d","type":"HAS_INVARIANT"},{"id":"1f0687d8-3dc0-40dd-853d-87a798385f51","source":"CapacityPressure","target":"36ba77ef-5947-4509-937b-29f5387b1299","type":"HAS_INVARIANT"},{"id":"c37c2970-bb39-4ec7-856e-bcc56068e495","source":"CapacityPressure","target":"52d530e9-c28c-40d6-b81b-bf8e143efb0f","type":"HAS_PRECONDITION"},{"id":"88af4edc-77a4-4cdf-b501-bf7485de0fc2","source":"CapacityPressure","target":"b9e76406-3759-4800-b423-bd6d7b14e7a6","type":"HAS_PRECONDITION"},{"id":"a9d18c62-01a9-4be4-a1ac-c6d247488b31","source":"CapacityPressure","target":"20c9ccd5-6cad-451e-9f66-e288cd3c262c","type":"HAS_POSTCONDITION"},{"id":"56cb806a-5bbb-4446-9754-6546d85cef58","source":"CapacityPressure","target":"231fa4d6-3b8b-4d9d-a28e-faee70371b93","type":"HAS_POSTCONDITION"},{"id":"a23f0844-e29d-4327-81f9-ad652006f4b3","source":"CreativeBlend","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"6fe1821e-f8ac-4cca-912a-a8e2f348b67a","source":"CreativeBlend","target":"Strategy","type":"REFERENCES"},{"id":"f9773448-1a73-4851-84c0-21301a9507c3","source":"CreativeBlend","target":"ConceptBlend","type":"COMPOSES_WITH"},{"id":"549989a6-18d2-4cf7-a384-c27192234525","source":"CreativeBlend","target":"Artifact","type":"YIELDS"},{"id":"d6e34471-ddee-4c28-94b6-edb5c998dcd7","source":"CreativeBlend","target":"NoiseInjection","type":"REFERENCES"},{"id":"7cbedbc7-7ea4-4bc1-bd37-652976ca7b77","source":"CreativeBlend","target":"Novelty","type":"REFERENCES"},{"id":"6981bbee-3304-4a07-9648-77ba205c4491","source":"CreativeBlend","target":"Check","type":"COMPOSES_WITH"},{"id":"ffcd21a2-89d8-4c62-87e6-78fe84177a79","source":"CreativeBlend","target":"Value","type":"REFERENCES"},{"id":"0c489e24-4b72-4b72-b75e-719e6723ea78","source":"CreativeBlend","target":"Context","type":"ACCEPTS"},{"id":"8bc7e33d-3c08-4d5e-b2fd-a7470cdd3dc9","source":"CreativeBlend","target":"0590e70c-867e-4a64-bd7d-4e0530faa227","type":"HAS_INVARIANT"},{"id":"2168630d-0b64-47bf-8c73-8dcd0e97d676","source":"CreativeBlend","target":"c7ace0ec-bcd1-4312-b30f-14b27cca67c5","type":"HAS_INVARIANT"},{"id":"732e1804-ec0b-4be4-bc08-ce209714cac9","source":"Jazz","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"28667ad0-f127-42d8-88e7-968f3e0bf57e","source":"Jazz","target":"Mode","type":"REFERENCES"},{"id":"0b365393-a7df-4357-a8a9-6aa5a8104615","source":"Jazz","target":"ConceptBlend","type":"REFERENCES"},{"id":"d5478df6-b5b9-4511-a071-77244917da24","source":"Jazz","target":"Check","type":"REFERENCES"},{"id":"6bb9c396-d492-431a-8cc3-7bd9b7e84f58","source":"Jazz","target":"Constraint","type":"REFERENCES"},{"id":"cfee5cc2-f27d-4d68-aeea-6c06cd5957f4","source":"Jazz","target":"Discover","type":"REFERENCES"},{"id":"2f3bcbcc-7bf0-4421-adbb-7e3839889368","source":"Jazz","target":"ExploreExploit","type":"REFERENCES"},{"id":"84c3f463-5976-445e-82f9-0601d12c0be4","source":"LatentWander","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"d28ac9e1-d7a6-487e-b3e4-b5649bba64a1","source":"LatentWander","target":"Silence","type":"REFERENCES"},{"id":"a590a9cb-e22c-45b3-86e5-42c4c6c05a76","source":"LatentWander","target":"ConceptBlend","type":"REFERENCES"},{"id":"99549e81-db21-44ad-bfd1-255fc70b5780","source":"LatentWander","target":"AnalogyBridge","type":"YIELDS"},{"id":"8d7f47b7-9efe-42b8-9225-f1b8ee0d6449","source":"LatentWander","target":"002cbea1-2fd5-41c4-bdb5-e023ee5fed2f","type":"HAS_INVARIANT"},{"id":"1426698e-0b32-455f-8f75-f02ee5bdc507","source":"LatentWander","target":"49a0ed59-f1d4-4532-9fe0-96c1e8a5ffbc","type":"HAS_INVARIANT"},{"id":"88687a6b-5c3d-4ae5-a2f5-a1ae10a95a11","source":"RepresentationSwap","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"377f2293-ed0d-4296-9f1a-50a72456db96","source":"RepresentationSwap","target":"ConceptBlend","type":"REFERENCES"},{"id":"ed549d01-3309-4169-b79f-2625d16bb55b","source":"RepresentationSwap","target":"852cc25f-ab8d-4c2f-9f94-2192be478fc6","type":"HAS_INVARIANT"},{"id":"b1a8d226-3fe4-4472-9845-1ae5e512fb21","source":"RepresentationSwap","target":"fa24ca86-8cfc-48d5-88a7-a614921b54ba","type":"HAS_INVARIANT"},{"id":"015953b3-419f-45a6-b90b-1a6aab885606","source":"GenealogicalTrace","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"ae54b321-f741-4989-b45d-d04060fbf236","source":"GenealogicalTrace","target":"Deep","type":"REFERENCES"},{"id":"36ebd221-c06a-4524-87cb-b3362c0c8d58","source":"GenealogicalTrace","target":"TraceBelief","type":"REFERENCES"},{"id":"7f6b96af-8609-43ad-8275-c209d0406239","source":"GenealogicalTrace","target":"CiteBack","type":"REFERENCES"},{"id":"b7bfe8c8-100d-4f53-bccb-da7e7a917efe","source":"GenealogicalTrace","target":"Context","type":"REFERENCES"},{"id":"19603650-8c06-4681-928f-8a004321179a","source":"GenealogicalTrace","target":"557a944c-c332-41aa-9d7f-85748ebd0646","type":"HAS_INVARIANT"},{"id":"f5329a35-6d6a-4b36-b941-1c1d68ad513d","source":"GenealogicalTrace","target":"98adeee1-7910-466e-8ccf-36f59d91f636","type":"HAS_INVARIANT"},{"id":"2e5859f1-8618-461d-8ecc-76e87939da6e","source":"SynergisticMode","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"cbd794f0-ce15-42f4-8008-1edb4532573b","source":"SynergisticMode","target":"Mode","type":"REFERENCES"},{"id":"6478e774-2fde-4b9b-a440-49ec9fad0539","source":"SynergisticMode","target":"Signal","type":"REFERENCES"},{"id":"0043618b-f2eb-4538-b09b-03bde2353806","source":"SynergisticMode","target":"System","type":"REFERENCES"},{"id":"87e3d48a-38b2-4986-bfc5-0962fc2f199c","source":"SynergisticMode","target":"OntologyHandshake","type":"REFERENCES"},{"id":"813dfb11-d686-49c0-9882-1247bc567144","source":"SynergisticMode","target":"Compose","type":"REFERENCES"},{"id":"b86e72e3-42e8-42a3-a2c3-8c388ee33f52","source":"SynergisticMode","target":"AcceptSpec","type":"REFERENCES"},{"id":"8805ac70-306a-4c7c-8712-c3c4400515b3","source":"SynergisticMode","target":"Agent","type":"REFERENCES"},{"id":"e44cf0f3-a420-4d6c-bff6-9f9afe9159d5","source":"SynergisticMode","target":"4d40a1c7-23d3-4303-8309-403d270c8a52","type":"HAS_INVARIANT"},{"id":"bd7c68e2-8c61-42be-9e12-b41d95107d73","source":"SynergisticMode","target":"e84daaac-ebfc-4542-b672-4fcdc276cc28","type":"HAS_INVARIANT"},{"id":"a2ee6572-7938-4fb6-af19-3f288e2171ab","source":"MintWhenFriction","target":"a3dffe73-5c16-41fe-be7c-5f1b04ac73f2","type":"IN_CATEGORY"},{"id":"738b60f7-6a5d-4d09-8d56-ffc856d5b817","source":"MintWhenFriction","target":"ConstructOntology","type":"REFERENCES"},{"id":"e4d02235-c4ed-4e75-8278-61cce71148a3","source":"MintWhenFriction","target":"PatternDiscovery","type":"REFERENCES"},{"id":"149e9f37-3ccb-4e79-8772-96ea552031d0","source":"MintWhenFriction","target":"Check","type":"REFERENCES"},{"id":"a13f0aa4-2ced-4ddb-a4fc-a94d3fc6e065","source":"MintWhenFriction","target":"Value","type":"REFERENCES"},{"id":"4cb7ddff-c3ee-43b1-971e-e2d46d52a239","source":"MintWhenFriction","target":"bb75361e-c130-42e9-838b-4e45949f70f8","type":"HAS_INVARIANT"},{"id":"4078b075-d922-4f41-b141-bc8a334093d3","source":"MintWhenFriction","target":"ee30f0c3-3c0c-4bf5-ab8e-c2b3b4cd2600","type":"HAS_INVARIANT"},{"id":"239aa7ee-38bb-47d2-bb50-54e1ef4f02bc","source":"MintWhenFriction","target":"bb5e6e7e-4727-41df-8d48-823bdd9f03d3","type":"HAS_INVARIANT"},{"id":"0c5f41f1-e847-4c6f-9954-1247391dee95","source":"MintWhenFriction","target":"8d014fc7-9441-4d8c-a354-0c2967506da0","type":"HAS_PRECONDITION"},{"id":"b6ed978d-66a4-445f-bdc6-ff02c2f3d617","source":"MintWhenFriction","target":"90cc19d7-b400-41cb-86c3-139ce8c7f040","type":"HAS_PRECONDITION"},{"id":"72ef34fd-f00c-4a32-92d0-098e1305bef6","source":"MintWhenFriction","target":"cd1e4ed7-c990-470b-98d5-941f879eabab","type":"HAS_POSTCONDITION"},{"id":"7283ce47-c4d5-4ccf-9162-625bb240c11c","source":"Nucleate","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"bd169adf-cdcd-488c-afbf-cc9097b0e3e3","source":"Nucleate","target":"Crystallize","type":"REFERENCES"},{"id":"9da496ef-f056-47d0-9397-458fd05eee44","source":"Nucleate","target":"Trace","type":"REFERENCES"},{"id":"1e5c181c-cc85-4d8e-affc-23bee5ccf78e","source":"Nucleate","target":"System","type":"REFERENCES"},{"id":"5a3c6563-7495-4950-acde-53159e1e36f4","source":"Nucleate","target":"Rally","type":"REFERENCES"},{"id":"aedf8ad8-88fe-4a7a-a08d-ee249c5c5922","source":"Nucleate","target":"238200f3-89ac-43c4-bb28-aa6810f2941e","type":"HAS_INVARIANT"},{"id":"69ded457-76c5-4d6e-a606-1d732b77f995","source":"Nucleate","target":"3c0ff00a-9420-4d14-ae98-6b1bb5d3945c","type":"HAS_INVARIANT"},{"id":"7f86c090-b607-4b9b-a03a-243bbe6ec4e2","source":"Nucleate","target":"822172df-df64-4292-821d-b8746f8bb287","type":"HAS_INVARIANT"},{"id":"0f166fae-dd2f-4db0-9999-27a1235caccc","source":"Nucleate","target":"cf377daf-6131-4d13-ab40-41eff6a5b4f5","type":"HAS_PRECONDITION"},{"id":"62962352-4dfe-4ae7-996b-043526281ede","source":"Nucleate","target":"1b5d6533-f473-456b-9cb6-406d37d70898","type":"HAS_POSTCONDITION"},{"id":"9605a143-c867-4265-bdfd-9a9edf74696f","source":"AmbiguityResolution","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"b1cc7370-ac55-4506-8ab6-451de7cb57c1","source":"AmbiguityResolution","target":"Vote","type":"COMPOSES_WITH"},{"id":"64120490-641d-42e1-a8b1-5a4830f2335d","source":"AmbiguityResolution","target":"EntropyPump","type":"COMPOSES_WITH"},{"id":"80c1c5e1-e22c-40bd-a7bb-0c57094ac8d5","source":"AmbiguityResolution","target":"7814ba42-34c8-4680-b086-9ddabf9116c6","type":"HAS_INVARIANT"},{"id":"7eb622e5-dd1e-4128-8bd1-bf1f36e464da","source":"AmbiguityResolution","target":"fb23e92c-15eb-48ec-99bd-e00bc90ae23a","type":"HAS_INVARIANT"},{"id":"0516cbe9-d6ce-4b09-9d48-abdada9be51a","source":"AmendLaws","target":"dc998770-80e1-4d40-8d8d-31037195e639","type":"IN_CATEGORY"},{"id":"cf8ff723-cc8c-410f-a969-1e54576f16a1","source":"AmendLaws","target":"Vote","type":"REFERENCES"},{"id":"c1d010c9-c5e6-4614-b5f9-cffd07536121","source":"AmendLaws","target":"HydraConstitution","type":"REFERENCES"},{"id":"2823ae42-22d2-4a50-a8f3-57d1937a7f42","source":"AmendLaws","target":"Quorum","type":"REFERENCES"},{"id":"de64cb1e-ee25-4311-9730-51b36e71bd72","source":"AmendLaws","target":"0ae798e1-c260-4b6f-8077-8002014782ac","type":"HAS_INVARIANT"},{"id":"72ff53de-7ff8-4e9e-9ab1-5d4483089860","source":"AmendLaws","target":"567d8bac-a00b-462f-84d5-d5105b4124df","type":"HAS_INVARIANT"},{"id":"240c4885-5816-43df-8c09-abb5fc43ef51","source":"AmendLaws","target":"04afb6bc-7ef3-4ce4-8be5-4dc7b799ade3","type":"HAS_INVARIANT"},{"id":"b19c69c5-a31e-495e-ada0-77162c07ce39","source":"AmendLaws","target":"7c318457-6e4b-45ec-bb51-27b4c5acb799","type":"HAS_PRECONDITION"},{"id":"b81bf14f-a0c5-41d2-ad74-98b1b54d808b","source":"AmendLaws","target":"8e072101-1e64-49c0-8ad2-acbaf04c1656","type":"HAS_PRECONDITION"},{"id":"2cc2e63b-9c58-4035-8eae-e91cc986fbfe","source":"AmendLaws","target":"bd22afc1-3de9-4264-8449-1b7af15b4384","type":"HAS_PRECONDITION"},{"id":"f8dc2022-f956-428a-842b-1e838f44e74a","source":"AmendLaws","target":"cbcc70e0-5fe1-4c8a-aa55-dc2f237f06a0","type":"HAS_POSTCONDITION"},{"id":"75108c9b-8717-4eeb-96ac-fc674d802d03","source":"AmendLaws","target":"aa42138c-5955-43de-9dc8-0039ad693ca6","type":"HAS_POSTCONDITION"},{"id":"34f5320e-d24c-4551-a7ed-643b0f62e42d","source":"Consensus","target":"dc998770-80e1-4d40-8d8d-31037195e639","type":"IN_CATEGORY"},{"id":"978a6300-848a-47df-8222-e971f9e0bb5d","source":"Consensus","target":"Value","type":"YIELDS"},{"id":"0a89621a-3421-490b-a642-afc88dd53b0b","source":"Consensus","target":"Vote","type":"COMPOSES_WITH"},{"id":"cf3cd085-063f-4409-9d2d-28e65f86894f","source":"Consensus","target":"Quorum","type":"COMPOSES_WITH"},{"id":"c0af061c-07af-4a28-9607-d576d9ada335","source":"Consensus","target":"Proposal","type":"ACCEPTS"},{"id":"fda301bc-d9fd-4430-a7b7-0f5663b20d4b","source":"Consensus","target":"0ec2cafa-585b-4f9f-a781-a1192a62c668","type":"HAS_INVARIANT"},{"id":"4a475432-e3e4-4c44-94ab-e5c509571a29","source":"Consensus","target":"2753db08-274e-4856-a0e4-95f3494d77ca","type":"HAS_INVARIANT"},{"id":"fc55d096-6706-48ae-b7e3-9b0a1e3c087f","source":"Consensus","target":"c2031043-76a6-4ba6-a6d7-1435fd40d00a","type":"HAS_INVARIANT"},{"id":"f7a780c4-a16b-4e09-9b66-b34a1930a4cf","source":"Consensus","target":"56ffd905-f0c1-4fcf-b038-6e9861b00f2f","type":"HAS_PRECONDITION"},{"id":"fe45fd2b-0d10-4625-bee6-0e6c35f9c4b6","source":"Consensus","target":"bbcc5394-e30b-41d9-ad11-fa2122c73146","type":"HAS_PRECONDITION"},{"id":"daa9675e-1b4a-46b1-8e69-e234ebf821aa","source":"Consensus","target":"4344cdcd-448c-4955-b777-f98d86293ef7","type":"HAS_PRECONDITION"},{"id":"08b242e7-09e7-4653-aeb1-e2d478be715f","source":"Consensus","target":"39b1663e-7c65-43b7-9728-08bbc421ea9d","type":"HAS_POSTCONDITION"},{"id":"a3741773-8a34-4a36-96e0-4e47b2525c38","source":"Consensus","target":"b15b6620-b82c-4d61-90a9-dbc46a9cf252","type":"HAS_POSTCONDITION"},{"id":"15159108-bd55-4edd-947a-5428337b0589","source":"PropheticQuorum","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"104ac6f6-3b43-4ef9-8b7f-c7eb56ecb13e","source":"PropheticQuorum","target":"Simulation","type":"REFERENCES"},{"id":"d96a7649-f727-4429-8f2f-2e62db62afa7","source":"PropheticQuorum","target":"NormativeJudge","type":"REFERENCES"},{"id":"90914526-349d-42c5-b2b3-9f6f71ac4a24","source":"PropheticQuorum","target":"State","type":"REFERENCES"},{"id":"6e5ce2b6-b798-4d40-a569-fb6d6e6b7ff1","source":"PropheticQuorum","target":"Vote","type":"REFERENCES"},{"id":"df82ed32-7786-4d15-8e25-d0c1cb753f14","source":"PropheticQuorum","target":"SimulationTrace","type":"REFERENCES"},{"id":"81c4b6cc-0a4e-41b1-9fe3-820467b14773","source":"PropheticQuorum","target":"Check","type":"REFERENCES"},{"id":"57badcd3-552d-4542-a846-a9943c91f947","source":"PropheticQuorum","target":"Value","type":"REFERENCES"},{"id":"e8f1795c-c0c8-4f63-90ad-74a223f71f5d","source":"PropheticQuorum","target":"Quorum","type":"RELATED_TO"},{"id":"5c954970-1bfa-440b-ac11-e6cea58ad224","source":"PropheticQuorum","target":"RegimeSense","type":"RELATED_TO"},{"id":"216bcd89-82b5-4d83-81c8-393b0014e885","source":"PropheticQuorum","target":"8bb81d89-3836-464b-90f1-d631cabe027b","type":"HAS_INVARIANT"},{"id":"4ffdc152-cdc4-4085-bf13-ed8619b0ce56","source":"PropheticQuorum","target":"e4392dc8-0931-4917-8f0e-7401a41ff51e","type":"HAS_INVARIANT"},{"id":"cf76b9c2-7508-424c-8a2c-9533805bb898","source":"PropheticQuorum","target":"9a0016f8-30c9-40d2-b3a8-46f91f32b705","type":"HAS_PRECONDITION"},{"id":"09f425cf-8a9d-4edf-994f-7f97195f039a","source":"StyleSpec","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"e236f3d6-91a7-4bdc-9aa2-7d892540bbe1","source":"StyleSpec","target":"Spec","type":"REFERENCES"},{"id":"86c0f800-b5c4-4355-8b96-6cc2afbc6018","source":"StyleSpec","target":"PhasedRefinement","type":"REFERENCES"},{"id":"655eee70-b559-4c93-a8b2-cfb4018b83df","source":"StyleSpec","target":"Aesthetics","type":"REFERENCES"},{"id":"b87053dc-fc21-4172-ad89-c1297f2d7d18","source":"PatternEmergence","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"7090b885-d1fa-45d8-bf52-14cc249478f0","source":"PatternEmergence","target":"Generalize","type":"REFERENCES"},{"id":"3a935c57-6098-431b-8f89-0d14d3e4466e","source":"PatternEmergence","target":"Signal","type":"REFERENCES"},{"id":"39310ddf-28aa-4403-92ea-04367d1c16b1","source":"PatternEmergence","target":"System","type":"REFERENCES"},{"id":"4960ef42-f3df-4f9c-b60e-14ae30ccafc6","source":"PatternEmergence","target":"PatternDiscovery","type":"REFERENCES"},{"id":"e922129c-e3d2-460d-bbc1-2a8c4065a4ce","source":"PatternEmergence","target":"Noise","type":"REFERENCES"},{"id":"6fddca4b-cd1b-46d8-b26e-71fb45b5fb52","source":"PatternEmergence","target":"UptakeAsGround","type":"REFERENCES"},{"id":"4dcc4813-f6ff-4f4b-a52a-f12ed65661ed","source":"PatternEmergence","target":"MintWhenFriction","type":"REFERENCES"},{"id":"6c0aa21c-3e04-454e-9318-0bb7bb9cbb60","source":"PatternEmergence","target":"Agent","type":"REFERENCES"},{"id":"0b79fec8-ed37-4384-91e1-83a6167a1848","source":"PatternEmergence","target":"f97e68f7-5e9d-4cdf-8d05-7ceba7dbba3f","type":"HAS_INVARIANT"},{"id":"e88cd768-4dba-4a6e-86fc-3637d6939206","source":"PatternEmergence","target":"663a8bf0-ea73-45c3-94e8-ec9c5d457ca9","type":"HAS_INVARIANT"},{"id":"f72e163c-9696-409d-bccc-da00b566cb3f","source":"PatternEmergence","target":"071ad958-a15e-47a3-b8be-b10f84284ce6","type":"HAS_PRECONDITION"},{"id":"796449b8-3d5a-49f2-8f7c-54b9ce54eab2","source":"PatternEmergence","target":"3f7be143-fb22-4fd1-9209-1f2ca5750c44","type":"HAS_PRECONDITION"},{"id":"405f9283-e195-401e-aa82-dd1abb3ac932","source":"PatternEmergence","target":"67698e88-495c-4e4a-b535-71884c28d443","type":"HAS_POSTCONDITION"},{"id":"dc8e80cf-effd-4bc5-b891-a3432308b2a8","source":"PatternEmergence","target":"bdf6d40e-a5a5-46b5-9aad-33e2fae5bc24","type":"HAS_POSTCONDITION"},{"id":"b44f2d03-a127-4059-a6c5-a41f851173bf","source":"Constitution","target":"dc998770-80e1-4d40-8d8d-31037195e639","type":"IN_CATEGORY"},{"id":"7468470b-70de-415a-9e98-c510958ef82d","source":"Constitution","target":"AmendLaws","type":"REFERENCES"},{"id":"66ffeefc-28ba-4850-a092-256773584c67","source":"Constitution","target":"Agent","type":"REFERENCES"},{"id":"e08c9f53-7f8c-4765-81ab-6d45e7a1ff82","source":"Constitution","target":"70b9d1d0-a4f0-41ca-b844-3233b888cb09","type":"HAS_INVARIANT"},{"id":"cba9d2a3-8575-44a7-b786-7634e912eb75","source":"Constitution","target":"abc8edc3-e6a7-4bc6-97f5-0a09791cb22e","type":"HAS_INVARIANT"},{"id":"ff2e5b57-c86d-4e0c-b8cc-8ae8240924d6","source":"AnchorDrop","target":"dc998770-80e1-4d40-8d8d-31037195e639","type":"IN_CATEGORY"},{"id":"f2af78ab-074d-40e2-bcdd-2f1b19845eaa","source":"AnchorDrop","target":"System","type":"REFERENCES"},{"id":"956fa83e-3b40-4eb2-a679-33168305fd34","source":"AnchorDrop","target":"Quorum","type":"REFERENCES"},{"id":"3c39d48a-1c00-4dd2-8326-9f4252e6ca25","source":"AnchorDrop","target":"Consensus","type":"REFERENCES"},{"id":"f358bb9d-c0c3-425b-b906-7741b0f4b06a","source":"AnchorDrop","target":"ConceptAnchor","type":"RELATED_TO"},{"id":"9115ee1c-7463-41e4-92f0-78d2924d67f0","source":"AnchorDrop","target":"4f2cc404-84ba-4f80-85be-e592a84597ad","type":"HAS_INVARIANT"},{"id":"6005e5fa-07e5-4fa7-80ad-13b8bc7448a1","source":"AnchorDrop","target":"a1473994-ba9d-47d1-98ec-2cf6c713e5bc","type":"HAS_INVARIANT"},{"id":"bfc0858e-c82a-4b9c-b199-97e77c8dff94","source":"AnchorDrop","target":"74331c77-a7f4-4b2c-8642-bff47569c57f","type":"HAS_PRECONDITION"},{"id":"76dfb706-e77f-400a-bf9a-6a81810a92c8","source":"AnchorDrop","target":"e9ed7ab9-d7c8-4eef-8f75-ab94577ef483","type":"HAS_POSTCONDITION"},{"id":"83423273-95bd-41a3-9ac8-60195dcf8c59","source":"ChaosDrift","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"27c87347-f2af-4f63-b03c-ee602c6b4f72","source":"ChaosDrift","target":"SemanticTabu","type":"REFERENCES"},{"id":"3094df36-60f5-4d0a-8af4-e685b551f2a4","source":"ChaosDrift","target":"System","type":"REFERENCES"},{"id":"c139e4ec-af0e-4831-948c-7bbcc11410e6","source":"ChaosDrift","target":"Noise","type":"REFERENCES"},{"id":"f0340d8a-dd16-4e91-8851-6ff5da0f868f","source":"ChaosDrift","target":"AntifragileInversion","type":"REFERENCES"},{"id":"e8185dd4-53c8-4013-9b13-8664d3a0df51","source":"ChaosDrift","target":"EntropyPump","type":"REFERENCES"},{"id":"edb0ac88-fb8d-407b-8d45-32d99361f5d0","source":"ChaosDrift","target":"Consensus","type":"REFERENCES"},{"id":"47f57a1c-3488-46a2-9de9-4adfbb0ba889","source":"ChaosDrift","target":"LazyConsensus","type":"RELATED_TO"},{"id":"857de6fe-5ce1-4bf5-a932-de97b700dc7a","source":"ChaosDrift","target":"9bd1085c-ae5a-421d-8450-2dc28b70a225","type":"HAS_INVARIANT"},{"id":"8fd65366-3949-4d07-aef5-d5ce41821999","source":"ChaosDrift","target":"d694a5e8-44b0-423f-ab9e-1d049a8d9cb6","type":"HAS_INVARIANT"},{"id":"36f14be1-07a4-4cf9-afad-08952f03d839","source":"ConsensusFinder","target":"dc998770-80e1-4d40-8d8d-31037195e639","type":"IN_CATEGORY"},{"id":"5d8cac83-642a-45d9-8b7e-4a2b7d5786e7","source":"ConsensusFinder","target":"Discover","type":"REFERENCES"},{"id":"ef8c4ddf-de91-4eec-a2c3-938c8152be4a","source":"ConsensusFinder","target":"Quorum","type":"REFERENCES"},{"id":"1d857dcf-233b-4d72-a02e-a8e9e1325316","source":"ConsensusFinder","target":"Consensus","type":"REFERENCES"},{"id":"0b549fe4-edfb-4d35-b746-bdb1bbc2a932","source":"ConsensusFinder","target":"Resonate","type":"REFERENCES"},{"id":"845c5ce6-35cb-4971-9b90-57d1398f1941","source":"ConsensusFinder","target":"4b7e9541-1af2-44cf-85d1-de99da568a83","type":"HAS_INVARIANT"},{"id":"d54b56e9-8238-4cb5-9964-6feb3e6cfc6e","source":"ConsensusFinder","target":"c79cc5a7-7244-44bf-a4f2-46cde6acf0d5","type":"HAS_INVARIANT"},{"id":"155dbc20-15ff-4484-8e9b-8494178b08fd","source":"Group","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"dcbd3c42-15ad-43a7-9ccb-538b4df2318c","source":"Group","target":"Consensus","type":"REFERENCES"},{"id":"18a113d1-8369-4ccd-b36b-081ae7b8bf6b","source":"Group","target":"Agent","type":"REFERENCES"},{"id":"3b0b3c39-8998-4130-b5a4-658e5ccba8bf","source":"Group","target":"Context","type":"REFERENCES"},{"id":"3ab1dec0-3a4a-4cec-b99b-16515df5b0b3","source":"Group","target":"ShoutWhisper","type":"REFERENCES"},{"id":"61f9a154-4948-4d56-8115-9e9d88ae166d","source":"RuleSet","target":"e23f2ceb-1e71-4faa-a205-f2bdd394cceb","type":"IN_CATEGORY"},{"id":"73e217a6-62da-41c9-8cbd-b302a24f0a49","source":"RuleSet","target":"Constitution","type":"REFERENCES"},{"id":"9107dbda-5f73-44ea-936f-2e3ebe17a525","source":"RuleSet","target":"Constraint","type":"REFERENCES"},{"id":"b60e403f-0474-474e-9606-c4980b2991b7","source":"OathBind","target":"579b02af-c094-442f-8ef9-67bcd86bd62f","type":"IN_CATEGORY"},{"id":"4df03752-f075-4376-a0b3-3f6b74200500","source":"OathBind","target":"SpotAudit","type":"REFERENCES"},{"id":"9c532adc-c0cb-4a73-bab9-6f4e6973abff","source":"OathBind","target":"Actor","type":"REFERENCES"},{"id":"28dc74b8-9f9c-4a30-a32e-7b64723ff0e7","source":"OathBind","target":"RuleSet","type":"REFERENCES"},{"id":"302eba42-138e-4b1f-b62d-27e20eac8d4d","source":"OathBind","target":"318b444d-36c9-4ab3-aeee-ad37b064a7c7","type":"HAS_INVARIANT"},{"id":"4475a576-0191-491b-9ba4-b7b6f5bab40a","source":"OathBind","target":"bdc6ee6d-e34c-4e48-9419-a6c04cc47788","type":"HAS_INVARIANT"},{"id":"d0afd49c-2218-4491-adfe-396b7b41ae7c","source":"CommitmentDevice","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"f581949e-ca9c-4140-9bd4-395411161c2e","source":"CommitmentDevice","target":"Agent","type":"REFERENCES"},{"id":"2cfdb6b9-279d-42df-bd90-d60727722076","source":"CommitmentDevice","target":"OathBind","type":"REFERENCES"},{"id":"7dc1afcc-5caf-4340-9e0e-c7235b4019e1","source":"CommitmentDevice","target":"7c9af6ca-0410-4207-8ad3-8762e81b1ec5","type":"HAS_INVARIANT"},{"id":"109309b0-b82f-48ed-97bf-06d8a1d7b098","source":"CommitmentDevice","target":"2999e2e3-6857-446b-9e60-e81f274ebc88","type":"HAS_INVARIANT"},{"id":"f9405842-c951-4165-a8ff-2044f27f4498","source":"CommitmentDevice","target":"9918c044-1867-4c08-a44d-6515ddc472f2","type":"HAS_PRECONDITION"},{"id":"84314c41-f5e7-483e-a01c-9bf3e3d67a04","source":"CommitmentDevice","target":"c6427fb3-bc8f-45bc-a062-e451e8238a37","type":"HAS_POSTCONDITION"},{"id":"b845278c-3ae2-44ec-9fa1-49ab731047e1","source":"Responsibility","target":"dc998770-80e1-4d40-8d8d-31037195e639","type":"IN_CATEGORY"},{"id":"ee3e1b68-e67f-47f6-8335-04ff20739552","source":"Responsibility","target":"Task","type":"REFERENCES"},{"id":"b30c63b1-a89e-4793-a276-a5f271bb143c","source":"Responsibility","target":"State","type":"REFERENCES"},{"id":"54186aa5-c601-4e9e-9fd2-2dedca0bc0e7","source":"Responsibility","target":"System","type":"REFERENCES"},{"id":"03cac272-3919-4907-8b43-646992818d52","source":"Responsibility","target":"Agent","type":"REFERENCES"},{"id":"d87aa851-9634-4c39-97f9-c2c6a5d6b583","source":"Responsibility","target":"Heartbeat","type":"REFERENCES"},{"id":"b5c76f3b-6eca-420e-91c5-2d39ae2bfa42","source":"Responsibility","target":"OathBind","type":"REFERENCES"},{"id":"5858e4a6-23e9-49ec-9e22-cf626b2ee799","source":"Responsibility","target":"a7d062cc-2f46-42df-b535-d31021b8a555","type":"HAS_INVARIANT"},{"id":"1c3af51d-fe75-4f30-9094-829159f8b47b","source":"Responsibility","target":"b8e2603a-3232-4562-8eb3-9d6bbdddf4d0","type":"HAS_INVARIANT"},{"id":"fe87c581-1005-423d-baad-906839fa1f46","source":"Responsibility","target":"33682c96-028d-41db-a81a-6c364fe77db9","type":"HAS_INVARIANT"},{"id":"378b27f3-2b8c-44e2-82b0-fcddc14ddcfb","source":"Responsibility","target":"e0918b1c-ce04-4c1f-965b-f95bc3e1ed35","type":"HAS_PRECONDITION"},{"id":"7586e252-7e85-469c-9292-80c08541baa1","source":"Responsibility","target":"652468d4-6808-4863-b989-07f4088fdb1b","type":"HAS_PRECONDITION"},{"id":"5465a1ff-436e-4850-b4b8-33c501012cb9","source":"Responsibility","target":"4e50b544-9aca-45fe-80b1-cd59c6507433","type":"HAS_POSTCONDITION"},{"id":"0bb5ddbd-2b97-47a2-b039-01beffeb539d","source":"Responsibility","target":"6d0cd95a-7159-4614-ad0e-21b8a9bcf3cb","type":"HAS_POSTCONDITION"},{"id":"47cadff6-32aa-47cb-9f83-59ac91fb3ab5","source":"Handoff","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"1c088eca-f8a9-49c3-98b7-731d73bdcaab","source":"Handoff","target":"Responsibility","type":"ACCEPTS"},{"id":"21802515-e1c5-4247-b7ba-3dd6f4be574e","source":"Handoff","target":"Delegate","type":"COMPOSES_WITH"},{"id":"54c47029-9d47-46a5-a388-2559cfd58b79","source":"Handoff","target":"State","type":"REFERENCES"},{"id":"00430ebe-178b-42a8-821d-7b467f059c28","source":"Handoff","target":"Task","type":"ACCEPTS"},{"id":"2b0cf643-a8d8-40e3-a21b-49068504caf5","source":"Handoff","target":"Agent","type":"REFERENCES"},{"id":"65b9c517-9ddf-44d0-92db-a86006a60908","source":"Handoff","target":"Context","type":"ACCEPTS"},{"id":"5a535065-7b23-42b3-8f2b-bc1145df4475","source":"Handoff","target":"5738bb9d-f689-417d-a835-18077ebe1640","type":"HAS_INVARIANT"},{"id":"76687841-ef1f-4ed8-b825-55c12fdfaf2e","source":"Handoff","target":"d445905c-c5d4-46d4-a2ff-79002726c702","type":"HAS_INVARIANT"},{"id":"be7e5552-0527-4361-9f47-945fc03af6bb","source":"Handoff","target":"fddb371f-ca3a-4147-8fe2-c871fca4f044","type":"HAS_PRECONDITION"},{"id":"69b41e9b-eca0-4714-9813-c18026582ff4","source":"Handoff","target":"3ef919b2-4dea-4baa-aafe-7de1016ad46e","type":"HAS_PRECONDITION"},{"id":"92560225-56c4-4ad6-a53e-9d7e0f220f0d","source":"Handoff","target":"aab684a6-fa9a-4936-923a-d6b80155f811","type":"HAS_POSTCONDITION"},{"id":"975878af-3d46-464c-bade-7e915ebb1861","source":"Handoff","target":"23ffc7ba-3676-4103-a041-ca8ecccd72b9","type":"HAS_POSTCONDITION"},{"id":"7bbedd71-ec1a-4893-93ee-143971d4dd13","source":"Role","target":"dc998770-80e1-4d40-8d8d-31037195e639","type":"IN_CATEGORY"},{"id":"0f9a0f5b-c823-41ae-8b2e-7c59ebaa3e57","source":"Role","target":"Permission","type":"REFERENCES"},{"id":"e978d14d-d43d-4ee4-a84b-f3cf5f598546","source":"Role","target":"Agent","type":"REFERENCES"},{"id":"0259f7f8-9b75-40f3-a96a-9ea96a633bb5","source":"Role","target":"Responsibility","type":"REFERENCES"},{"id":"de8a14e7-b2ed-4907-8b88-02037deb8479","source":"SolverNode","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"a43b1e89-7c25-43e1-acb0-b18e52609632","source":"SolverNode","target":"SolverManifest","type":"REFERENCES"},{"id":"7236cd34-bf49-444b-9aba-8e1e68963e88","source":"SolverNode","target":"LocalizedLearning","type":"REFERENCES"},{"id":"7f2a5089-9750-4b5f-ab3d-5882d167bfc6","source":"SolverNode","target":"ProblemSpace","type":"REFERENCES"},{"id":"80d4ade7-1714-429c-9b6b-f07ce571bbfd","source":"SolverNode","target":"Solution","type":"REFERENCES"},{"id":"693fd1df-2075-44e1-b2a3-90c5f23f93ff","source":"SolverNode","target":"Budget","type":"REFERENCES"},{"id":"3328efde-0449-4fda-9642-32652eceb68b","source":"SolverNode","target":"Responsibility","type":"REFERENCES"},{"id":"f1aca2c6-6358-479f-b964-b6a8a53b0c38","source":"SolverNode","target":"73813ab7-4150-49f4-a234-b3b714e8f733","type":"HAS_INVARIANT"},{"id":"7dab98cb-8d3f-491f-abac-67e6d4c1692f","source":"SolverNode","target":"496fc5b6-2ed8-4613-a4ce-2e94fbe0c31e","type":"HAS_INVARIANT"},{"id":"e0e5b2f3-63bf-4677-9b0d-3050c1e57446","source":"SolverNode","target":"9ca3d2a2-92b5-4bbd-a718-cc3af9c105e3","type":"HAS_INVARIANT"},{"id":"1fdc01de-a0b7-45de-a16d-59a3cc4efd21","source":"SolverNode","target":"cc7e5513-8144-45e8-a6c3-cbc9dac1df5b","type":"HAS_INVARIANT"},{"id":"8565c0cc-18f9-4bbb-ad20-ea598edccbe0","source":"Workflow","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"1ee7a0aa-fada-4fdf-808d-01b1a55b0162","source":"Workflow","target":"Solver","type":"REFERENCES"},{"id":"a8da9bd1-00e0-4a8b-bab6-fcfcd2103246","source":"Workflow","target":"Step","type":"REFERENCES"},{"id":"db58a05f-fe40-4eef-8afc-ea861566f877","source":"Workflow","target":"AcceptSpec","type":"REFERENCES"},{"id":"b4defcd0-abe6-4f1a-9589-6d2d477edc2b","source":"Workflow","target":"Artifact","type":"REFERENCES"},{"id":"858cca6c-8b2c-49d7-a2aa-1a3df360f370","source":"Workflow","target":"Role","type":"REFERENCES"},{"id":"aeadcc39-1c58-4afe-85ac-720fd9e183c6","source":"Workflow","target":"7aeef670-387c-45a4-818b-e7049e1ebd30","type":"HAS_INVARIANT"},{"id":"3887df59-9f80-4462-828b-bb6e38ab02cc","source":"Workflow","target":"81af6b20-d939-4059-a852-ad24d118e8c8","type":"HAS_INVARIANT"},{"id":"4f224d34-eb61-40ab-a0e3-cb175763b231","source":"Workflow","target":"9e64e9f5-4882-446c-aef0-00aa4e0f81af","type":"HAS_INVARIANT"},{"id":"9e46d29a-b554-4d5d-9e64-2ac694f58b7d","source":"BeamSearch","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"dae3cdc5-dc52-4de3-811c-5bdf6ff50f1f","source":"BeamSearch","target":"Queue","type":"REFERENCES"},{"id":"80591cc4-58ec-43c6-afbf-9b33af04a0ac","source":"BeamSearch","target":"Rank","type":"REFERENCES"},{"id":"8cee9d9c-830a-4e82-beab-36e0f202f74f","source":"BeamSearch","target":"SolverNode","type":"REFERENCES"},{"id":"c75325d8-7f1a-40c8-b3b3-01e2d1b82343","source":"BeamSearch","target":"Select","type":"REFERENCES"},{"id":"9d01b566-0736-48dc-a48d-5b297f8be262","source":"BeamSearch","target":"34da367f-800a-4f2c-9a0d-e43435995417","type":"HAS_INVARIANT"},{"id":"d7848d8a-1e79-432f-a1b7-2e723c6dc8aa","source":"BeamSearch","target":"79c052d6-8652-48f6-8a8c-83b9cf9d9008","type":"HAS_INVARIANT"},{"id":"8b86e914-e304-40ab-b310-1497344b5f39","source":"ContextFirst","target":"90800e2d-25ad-47b4-9463-179cdb2d083f","type":"IN_CATEGORY"},{"id":"43952ee4-5012-4ab1-9320-295a8a96fea8","source":"ContextFirst","target":"Warmup","type":"REFERENCES"},{"id":"ca829662-f509-4ab4-a935-1cd996f9bb57","source":"ContextFirst","target":"State","type":"REFERENCES"},{"id":"361b3f7f-deb5-4209-89e1-8b532b9e4061","source":"ContextFirst","target":"SolverNode","type":"REFERENCES"},{"id":"804aa84a-9a3d-408e-8c6f-05133f55fbd1","source":"ContextFirst","target":"Prioritize","type":"REFERENCES"},{"id":"d02ed6a2-b527-411c-8660-fbf50e5217df","source":"ContextFirst","target":"Context","type":"REFERENCES"},{"id":"0b363083-6395-452e-adc0-e8bf0e0b0b0a","source":"ContextFirst","target":"Agent","type":"REFERENCES"},{"id":"cb074e24-b5c6-4c5b-99f8-bd9dbee9713b","source":"ContextFirst","target":"ca55df70-db4d-4ee0-8633-0c07bea183a8","type":"HAS_INVARIANT"},{"id":"189ecdd5-c6da-4009-939f-62f5b3883fd7","source":"DeliberativeAlign","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"c3e94ca2-7e9f-4da5-96fb-f16930856ef0","source":"DeliberativeAlign","target":"Trace","type":"REFERENCES"},{"id":"9578bb59-0683-49fb-947d-27f24d7eb6fc","source":"DeliberativeAlign","target":"ManifestPlanning","type":"REFERENCES"},{"id":"d5cb4ae5-dc48-42cb-8747-45dccc8fec40","source":"DeliberativeAlign","target":"Task","type":"ACCEPTS"},{"id":"50d66c68-9552-4879-9c55-80720b5305f3","source":"DeliberativeAlign","target":"SolverNode","type":"REFERENCES"},{"id":"9cc37561-d5da-454b-9c60-faa45561183e","source":"DeliberativeAlign","target":"Check","type":"REFERENCES"},{"id":"033a5e39-8cfc-4515-9209-086e426c37c4","source":"DeliberativeAlign","target":"Context","type":"REFERENCES"},{"id":"8fbc45d2-06d8-4091-99a2-dfdae1ff7e3e","source":"DeliberativeAlign","target":"HydraConstitution","type":"REFERENCES"},{"id":"92efc361-2cae-4837-b597-9a6cdd703b13","source":"DeliberativeAlign","target":"Agent","type":"REFERENCES"},{"id":"bbc3091b-6d3f-4402-a797-22e3ef2f5c5f","source":"DeliberativeAlign","target":"ed0397cc-7961-41c4-872a-d23d03d18e44","type":"HAS_INVARIANT"},{"id":"d5ac44e8-6760-4e39-b155-0f64fd90fe84","source":"DeliberativeAlign","target":"1507fbef-897f-4028-af68-54a495a91eae","type":"HAS_INVARIANT"},{"id":"53f69d2d-4b65-4c12-a99e-e04c161dbcd5","source":"DeliberativeAlign","target":"bcc87e91-61fe-48be-a669-d940a0f4d14b","type":"HAS_PRECONDITION"},{"id":"45d37254-c763-461d-b1b3-962b987a830b","source":"DeliberativeAlign","target":"c4328bec-d540-4187-9db0-7e242493a6e4","type":"HAS_PRECONDITION"},{"id":"6a9bff80-4399-4393-b2b9-3f9274bfb2ea","source":"DeliberativeAlign","target":"acae76bb-a51d-4893-addc-931eb90ccd29","type":"HAS_POSTCONDITION"},{"id":"c5df63c9-c3a3-48cd-84c1-1aab4009f759","source":"DeliberativeAlign","target":"c6587ecd-4447-42e3-bd82-a698340d8970","type":"HAS_POSTCONDITION"},{"id":"bb558457-87da-4b27-b9a6-94ad7e0245d0","source":"SolverRoot","target":"dc998770-80e1-4d40-8d8d-31037195e639","type":"IN_CATEGORY"},{"id":"02de6c7c-d805-4814-a0b1-b199a5a238af","source":"SolverRoot","target":"Task","type":"REFERENCES"},{"id":"f63c1cbc-b658-47d3-800d-4bfdb3f0bd24","source":"SolverRoot","target":"Problem","type":"REFERENCES"},{"id":"e3b46da9-b6fb-4a9a-8b10-23fcc841ea44","source":"SolverRoot","target":"Result","type":"REFERENCES"},{"id":"9cc14fe3-f199-4b2f-880a-9f3657d8fb95","source":"SolverRoot","target":"SolverNode","type":"REFERENCES"},{"id":"92734115-f153-46ed-8339-ae87bd251b0a","source":"SolverRoot","target":"ProblemSpace","type":"REFERENCES"},{"id":"daf60dae-70ec-4ff7-a603-8d0b60fe410e","source":"SolverRoot","target":"Solution","type":"REFERENCES"},{"id":"002cdcb8-e975-4371-a8f9-11f4d4bcd132","source":"SolverRoot","target":"Budget","type":"REFERENCES"},{"id":"577e0429-7146-4c12-b80f-ff2dbcd2e0eb","source":"SolverRoot","target":"Tree","type":"REFERENCES"},{"id":"6efe5ece-f5f4-4835-932a-feaf007a3864","source":"SolverRoot","target":"1526317f-da18-4182-8c7c-6623ee80993a","type":"HAS_INVARIANT"},{"id":"cbd65929-6d14-4cc0-aec8-30d081757a69","source":"SolverRoot","target":"5fb05617-f3a5-4642-b406-b433bd0a2c9f","type":"HAS_INVARIANT"},{"id":"51be9909-6922-4444-ac77-7ae666af437b","source":"SolverRoot","target":"da9983ee-2541-4ed8-8f0b-7dc0affea781","type":"HAS_INVARIANT"},{"id":"0bc22fdc-26e0-40b1-9056-dcc6016547f4","source":"WorkerMode","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"c6e5f4f0-9ec8-4764-94cf-87ffab1e6975","source":"WorkerMode","target":"Task","type":"REFERENCES"},{"id":"27eb3914-43f4-4458-9ba1-f0cba0de7169","source":"WorkerMode","target":"Mode","type":"REFERENCES"},{"id":"2cdf27d3-6451-410c-b7f0-8cf8bf9a75f4","source":"WorkerMode","target":"Switch","type":"REFERENCES"},{"id":"59315396-8060-4372-ba4a-e3fab9bcbae2","source":"WorkerMode","target":"State","type":"REFERENCES"},{"id":"62f55f91-f4db-404f-9f98-ca3126ed1d30","source":"WorkerMode","target":"ContextSwitch","type":"REFERENCES"},{"id":"dfdc9e9b-f47d-49df-87a3-6bec564dcb32","source":"WorkerMode","target":"SolverManifest","type":"ACCEPTS"},{"id":"c53c4ec6-9219-48b5-8cea-8db405bceff9","source":"WorkerMode","target":"SolverNode","type":"REFERENCES"},{"id":"09939a3c-4d9d-4c0a-b8eb-a74e76e45a4d","source":"WorkerMode","target":"Lock","type":"REFERENCES"},{"id":"777f3e8c-65aa-41c7-80b7-051f43c1e927","source":"WorkerMode","target":"Solution","type":"REFERENCES"},{"id":"1af6e25e-ca76-449a-9817-685342ccc6d3","source":"WorkerMode","target":"Context","type":"REFERENCES"},{"id":"bed0db21-c3b7-4b16-92b8-eb6d62993d39","source":"WorkerMode","target":"Identity","type":"REFERENCES"},{"id":"db3e46cf-cb82-4946-8110-c318c2242197","source":"WorkerMode","target":"Agent","type":"REFERENCES"},{"id":"a374c932-b93b-46ca-9932-7950229fea86","source":"WorkerMode","target":"2a3782f6-2fe0-4142-8f49-b5ca47475479","type":"HAS_INVARIANT"},{"id":"b0dd60cd-c591-4dbd-8804-25609bf2a9e9","source":"WorkerMode","target":"2c8cb656-3b14-4eed-a6ed-ba6e3a9c3027","type":"HAS_INVARIANT"},{"id":"368247c9-62f1-46af-b817-b9845c2a07e3","source":"WorkerMode","target":"6868ed3c-1671-443d-b6ac-cb8604db05e6","type":"HAS_INVARIANT"},{"id":"726bfd60-727b-4643-9157-2c2001816b02","source":"WorkerMode","target":"bee847ad-dec3-49a1-8770-19a8daeb5082","type":"HAS_PRECONDITION"},{"id":"efadf2c0-da6b-4024-b737-3a13d5b0c77f","source":"WorkerMode","target":"4484745f-2e04-4686-8b19-4de0a3b1aea0","type":"HAS_PRECONDITION"},{"id":"e9e03f72-18b6-4b76-ac11-58ec0b2f18a8","source":"WorkerMode","target":"ecdff0fe-79bc-4576-b231-1c17e1fc71e7","type":"HAS_POSTCONDITION"},{"id":"f8044ee0-b5f3-4e90-8ea2-bbf0951453ed","source":"WorkerMode","target":"a12bf2b9-9c83-441b-91e8-9e509fc6b917","type":"HAS_POSTCONDITION"},{"id":"cdeecf10-1b12-4d70-b76e-21292ba80d52","source":"OrchestrationLoop","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"155584b1-1cf6-4470-ae59-c0495b20a137","source":"OrchestrationLoop","target":"Rollout","type":"COMPOSES_WITH"},{"id":"342747db-76bb-4793-9e0b-b88e76888a81","source":"OrchestrationLoop","target":"AcceptSpec","type":"REFERENCES"},{"id":"35b9cb5b-da5f-46c9-86e4-31b0733a573b","source":"OrchestrationLoop","target":"ExecutionManifest","type":"REFERENCES"},{"id":"51f9e630-8445-4cc1-8fe9-592aebde4c80","source":"OrchestrationLoop","target":"ManifestPlanning","type":"COMPOSES_WITH"},{"id":"95b7bef0-9aba-41dc-aac8-76ee12816e4b","source":"OrchestrationLoop","target":"RequestFraming","type":"COMPOSES_WITH"},{"id":"b0394ea6-4669-4691-b3b7-92a5d515c4c8","source":"OrchestrationLoop","target":"Workflow","type":"REFERENCES"},{"id":"30fed277-3938-41ad-809d-d697a383b6de","source":"OrchestrationLoop","target":"FrameSpec","type":"REFERENCES"},{"id":"d0702649-9384-4c2f-b2e7-45dfbc75a2c8","source":"OrchestrationLoop","target":"RolloutManifest","type":"REFERENCES"},{"id":"40e4d2de-f100-463b-8c40-959ea4611ec5","source":"OrchestrationLoop","target":"LayeredCheck","type":"RELATED_TO"},{"id":"5a4ab2e7-71ca-4295-b592-5673dd591953","source":"OrchestrationLoop","target":"b1d04be8-6742-4efb-b187-db0cf575956f","type":"HAS_INVARIANT"},{"id":"fef057e3-4637-46a9-9b72-06f640b46784","source":"OrchestrationLoop","target":"5e7f2501-934b-4b26-8cff-f3816f1a5258","type":"HAS_INVARIANT"},{"id":"edb8c8fb-b119-4ae7-a688-fe02f244e2bf","source":"OrchestrationLoop","target":"60dbf5a6-ef25-4ec9-8731-4d77408362fa","type":"HAS_INVARIANT"},{"id":"641729e8-242d-4ba6-a73b-d1e14b7c91fa","source":"SolverTree","target":"dc998770-80e1-4d40-8d8d-31037195e639","type":"IN_CATEGORY"},{"id":"7ae183c5-f1ae-4b69-9cff-c6bc8f0f2a46","source":"SolverTree","target":"LocalizedLearning","type":"REFERENCES"},{"id":"e14a7ed6-fbb4-4e62-b82b-9db7f52fd541","source":"SolverTree","target":"Task","type":"ACCEPTS"},{"id":"0fc4b363-c36d-4d72-8e3d-dc7cb24c7eb0","source":"SolverTree","target":"SolverNode","type":"REFERENCES"},{"id":"5fd973f1-bf14-40d9-8a20-fdb431e0a71e","source":"SolverTree","target":"Topology","type":"REFERENCES"},{"id":"7add18ae-85f8-490f-adb5-8bc67f1f7ed0","source":"SolverTree","target":"Budget","type":"REFERENCES"},{"id":"307d4c6d-77b8-4088-a003-ef6011283b81","source":"SolverTree","target":"SolverRoot","type":"REFERENCES"},{"id":"e101ed7b-293a-439e-9bca-8f797c7b6bdf","source":"SolverTree","target":"Tree","type":"REFERENCES"},{"id":"046b35ed-bf01-4f53-92bc-7cc7747a6fc3","source":"SolverTree","target":"c9c26edd-6892-4d0d-b117-41041f926d53","type":"HAS_INVARIANT"},{"id":"93b6a5f3-4140-4d72-b130-81c1f55659fc","source":"SolverTree","target":"d88408d2-1143-4234-a5a5-663cb72b3f6d","type":"HAS_INVARIANT"},{"id":"d5a359c9-da16-4dcd-918c-0bb2bbf79045","source":"SolverTree","target":"788d5cf1-4794-468a-8cc4-e2d012d2a7eb","type":"HAS_INVARIANT"},{"id":"40a34fce-e60e-4ec0-a3b7-d5cf5d065585","source":"SolverTree","target":"48393cb1-f721-45f4-8c56-b2277364db6a","type":"HAS_INVARIANT"},{"id":"cdcbf2f8-ffb7-43d5-970c-f2a9aeecaa0b","source":"RecursionDive","target":"e38ff6e0-872e-4a63-a7ea-ebb84e174347","type":"IN_CATEGORY"},{"id":"f6c712cb-a9d9-4628-bcec-a7ac53813d27","source":"RecursionDive","target":"SolverTree","type":"REFERENCES"},{"id":"a4b1538a-cc8f-465b-ab10-bcee16c2a405","source":"RecursionDive","target":"SolverNode","type":"REFERENCES"},{"id":"979702b6-bf5a-432d-8018-1f4018e31253","source":"RecursionDive","target":"Decompose","type":"COMPOSES_WITH"},{"id":"c50831ad-1f43-4c11-86f4-befa5b8dea27","source":"UniversalSolverTree","target":"dc998770-80e1-4d40-8d8d-31037195e639","type":"IN_CATEGORY"},{"id":"2857919f-ca4a-43f0-82d1-31b37f5ac0d6","source":"UniversalSolverTree","target":"Problem","type":"REFERENCES"},{"id":"f5e14a63-979e-44ab-8ad0-0d75c770f750","source":"UniversalSolverTree","target":"LocalizedLearning","type":"REFERENCES"},{"id":"11e826e5-8712-4b17-a0a9-6a5394ef6379","source":"UniversalSolverTree","target":"SolverTree","type":"REFERENCES"},{"id":"18debdc1-d64a-4e70-a59b-70faac5a4a11","source":"UniversalSolverTree","target":"SolverNode","type":"REFERENCES"},{"id":"cb4a9c92-1099-4998-9b85-0b50673fac8c","source":"UniversalSolverTree","target":"Solution","type":"REFERENCES"},{"id":"48b9c5b2-258a-4ea3-8fb9-0a2c050d9427","source":"UniversalSolverTree","target":"Tree","type":"REFERENCES"},{"id":"7dc2c4f3-584c-4adc-8d63-9dfe6e1cc9f8","source":"UniversalSolverTree","target":"b3a7a3e9-85c3-48da-ab3e-0edf8dd8b2b9","type":"HAS_INVARIANT"},{"id":"4747c854-eb25-4116-82f9-ce997fa0a5bb","source":"UniversalSolverTree","target":"2e5323ff-0ecc-4f3c-904f-61834e0bad97","type":"HAS_INVARIANT"},{"id":"e74179cb-8838-4572-8014-266292506f50","source":"DepthGovernor","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"23cfd106-304a-4650-92cc-567ffd52cd2b","source":"DepthGovernor","target":"Problem","type":"REFERENCES"},{"id":"b55900fe-0ea3-4b35-8c52-a3d4150348a7","source":"DepthGovernor","target":"RecursionDive","type":"REFERENCES"},{"id":"76e625dc-561d-45cd-88c0-c9e1a0eaaa55","source":"DepthGovernor","target":"Agent","type":"REFERENCES"},{"id":"5ba7ce92-b5dd-460c-aab1-213c2586954c","source":"DepthGovernor","target":"Condition","type":"REFERENCES"},{"id":"84c43dad-7c7c-4f0f-a9b8-dc2dd169c5d9","source":"DepthGovernor","target":"Loop","type":"REFERENCES"},{"id":"cb921a24-92de-4ded-9310-0cead4fad89a","source":"DepthGovernor","target":"Plan","type":"REFERENCES"},{"id":"fc16d0f0-ed91-43c9-a181-d37cdcf59d7d","source":"DepthGovernor","target":"Decompose","type":"REFERENCES"},{"id":"f2e4b98d-5687-4eba-ac18-c1f930654d0e","source":"DepthGovernor","target":"0677dddd-3c0f-43e5-a3d7-dd01026d9ed4","type":"HAS_INVARIANT"},{"id":"971024d3-ccea-48be-a026-1f98be5f1490","source":"MarginalValueRule","target":"a3dffe73-5c16-41fe-be7c-5f1b04ac73f2","type":"IN_CATEGORY"},{"id":"9bfbeca6-a1cf-4209-99ed-8520724679b3","source":"MarginalValueRule","target":"Budget","type":"REFERENCES"},{"id":"54069723-4510-4ff0-b510-bd3fd3cd3bff","source":"MarginalValueRule","target":"Estimate","type":"REFERENCES"},{"id":"180318d2-0c61-40b5-8a9e-ddd9bcad9417","source":"MarginalValueRule","target":"RecursionDive","type":"REFERENCES"},{"id":"e4218e0c-4524-491d-8d0d-9206e833b201","source":"MarginalValueRule","target":"55b9d6ee-c7a3-44ee-bca1-118ce0eaebaa","type":"HAS_INVARIANT"},{"id":"140c9177-a893-4d1b-82fa-f6158fe67798","source":"MarginalValueRule","target":"1709b8bd-10e4-4f9e-851f-add625126d86","type":"HAS_INVARIANT"},{"id":"e141c354-3646-4e6d-989d-71a200cb72ae","source":"MarginalValueRule","target":"9c320bbc-ec84-49fb-950f-266710586310","type":"HAS_INVARIANT"},{"id":"4cb5485a-62d9-4440-a071-f0f95f565304","source":"CognitiveSolver","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"d1b95dd8-88e7-411a-8fbd-51795e7e4316","source":"CognitiveSolver","target":"Solution","type":"YIELDS"},{"id":"f217a6db-81d4-407a-a40d-9f2e842eba22","source":"CognitiveSolver","target":"Reflexion","type":"COMPOSES_WITH"},{"id":"0bac6876-22e8-467f-97d4-85063560cb39","source":"CognitiveSolver","target":"SocraticLoop","type":"COMPOSES_WITH"},{"id":"8c70ceff-6eb0-4264-a026-a08a75839975","source":"CognitiveSolver","target":"Task","type":"ACCEPTS"},{"id":"0925d56b-9edf-418c-b42b-71f1a956852d","source":"CognitiveSolver","target":"ToolInvoke","type":"COMPOSES_WITH"},{"id":"00ae9808-f519-4a14-b90b-2f0945da5291","source":"CognitiveSolver","target":"Validate","type":"REFERENCES"},{"id":"44582b3b-ea5f-422f-b534-eaf72dfea3ef","source":"CognitiveSolver","target":"SolverNode","type":"REFERENCES"},{"id":"87c183d8-c755-4088-8ddb-8bbb53336320","source":"CognitiveSolver","target":"Reason","type":"COMPOSES_WITH"},{"id":"3edc1fc6-7239-4535-b885-fc694a2be152","source":"CognitiveSolver","target":"ComputeBudget","type":"COMPOSES_WITH"},{"id":"f3cbee75-8f00-4f19-b96f-3472d13871b9","source":"CognitiveSolver","target":"UniversalSolverTree","type":"REFERENCES"},{"id":"533380fd-36e3-491e-a392-75f4f55a2994","source":"CognitiveSolver","target":"Card","type":"REFERENCES"},{"id":"953b1d7d-39df-46bc-a952-3553658ceeb4","source":"CognitiveSolver","target":"EpistemicROI","type":"RELATED_TO"},{"id":"28287341-1057-4cf5-af31-c7accc1e28bb","source":"CognitiveSolver","target":"RecursionDive","type":"RELATED_TO"},{"id":"cb1d83d6-1e59-4c06-9582-8aebbafb50e5","source":"CognitiveSolver","target":"6946d092-a460-45a7-8350-814a81570ea3","type":"HAS_INVARIANT"},{"id":"84efe9dc-422b-4b6b-a3a3-a357fbdfc599","source":"CognitiveSolver","target":"45286237-9a91-48b4-a34c-69fae341e5df","type":"HAS_INVARIANT"},{"id":"7b9a179f-c349-49f4-9216-74ab7efcbde3","source":"66906d71-2b5a-43b1-a5da-4878554936cc","target":"edbe6b2e-5cba-4798-b009-b8f6a0d86323","type":"IN_LAYER"},{"id":"ddbe1ee1-305a-4422-91fd-c8a4d61fa9b4","source":"ProblemFramer","target":"66906d71-2b5a-43b1-a5da-4878554936cc","type":"IN_CATEGORY"},{"id":"99373f4b-b7de-40d7-9306-05e9d4b86246","source":"ProblemFramer","target":"Interpret","type":"COMPOSES_WITH"},{"id":"407666a9-ba6b-47e4-a8af-6c9e68305796","source":"ProblemFramer","target":"AcceptSpec","type":"YIELDS"},{"id":"826830e4-a8b8-48a4-899e-566290d5674d","source":"ProblemFramer","target":"Reframe","type":"COMPOSES_WITH"},{"id":"463739c6-adcc-40c0-99aa-073937aee7db","source":"ProblemFramer","target":"UniversalSolverTree","type":"REFERENCES"},{"id":"2980db14-545b-495f-aa33-493a05ecaeab","source":"ProblemFramer","target":"RequestFraming","type":"COMPOSES_WITH"},{"id":"df3a1464-5b5d-4c3a-8b73-f3b1a3725570","source":"ProblemFramer","target":"SolverRoot","type":"REFERENCES"},{"id":"6aee9c06-e2ff-40f7-9862-825307cef0b4","source":"ProblemFramer","target":"1526317f-da18-4182-8c7c-6623ee80993a","type":"HAS_INVARIANT"},{"id":"f5f6f62a-1878-4b75-8e28-c7f5418ad26c","source":"ProblemFramer","target":"9f3cf986-37d7-4ce8-8030-e7677caf8ee3","type":"HAS_INVARIANT"},{"id":"341326ff-aa72-4dc0-b88c-e112cbddfa75","source":"Taper","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"794a4529-771f-4272-99be-89613be7db09","source":"Taper","target":"TriGate","type":"COMPOSES_WITH"},{"id":"f7e51124-d7c0-4dad-a6f5-352b63ad0dec","source":"Taper","target":"Gate","type":"COMPOSES_WITH"},{"id":"dbe2ffa9-38d4-4bcf-8231-8580d27823d2","source":"Taper","target":"Sequence","type":"COMPOSES_WITH"},{"id":"a2bf52ef-24bf-42db-808e-7647bd625064","source":"Taper","target":"Compress","type":"REFERENCES"},{"id":"0cec7f4e-6615-4512-bbfc-ba0c8aa059be","source":"Taper","target":"DepthGovernor","type":"REFERENCES"},{"id":"5813209c-e021-4c93-8292-d0280ea9a783","source":"Taper","target":"8e2ffc26-6593-48a2-8683-f494cb3807c4","type":"HAS_INVARIANT"},{"id":"5ed8d085-88a2-4322-b25e-103db6f12faf","source":"Taper","target":"01532dec-6ae8-4abe-8ea9-ecc80251189b","type":"HAS_INVARIANT"},{"id":"36e5e84a-9638-4d3a-aaea-586309b4a2cc","source":"Taper","target":"a0330b3b-e0ab-4738-8024-b02f07b29505","type":"HAS_INVARIANT"},{"id":"c1286da4-463a-4f53-8a43-fc05df5acadb","source":"PUREOptimization","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"392403c5-8d36-4244-880d-62eca9100fda","source":"PUREOptimization","target":"CognitiveSolver","type":"COMPOSES_WITH"},{"id":"9ad8681c-75be-488a-b403-616f0ae47260","source":"PUREOptimization","target":"PURECheck","type":"REFERENCES"},{"id":"bbada811-aded-4554-9929-0f7224d609cd","source":"PUREOptimization","target":"Decompose","type":"COMPOSES_WITH"},{"id":"918be3a5-1e05-4030-8bde-952b6fdf244f","source":"PUREOptimization","target":"Realizable","type":"REFERENCES"},{"id":"6ee06997-e90b-4d11-9f66-0030ef01b8e6","source":"PUREOptimization","target":"ParetoFront","type":"REFERENCES"},{"id":"3ac48d70-78c3-4ffb-b306-1f7eef48ae5c","source":"PUREOptimization","target":"Optimize","type":"COMPOSES_WITH"},{"id":"683cba83-355f-4bc8-9167-42607b702091","source":"PUREOptimization","target":"Novelty","type":"REFERENCES"},{"id":"60bf23b9-d5cc-469f-ae39-c885fe0c2423","source":"PUREOptimization","target":"Expansive","type":"REFERENCES"},{"id":"5ccff45c-8254-4421-a767-92f2b8a291e9","source":"PUREOptimization","target":"Solution","type":"ACCEPTS"},{"id":"c2f7729d-d829-482f-807d-8f9d7fb1a6c9","source":"PUREOptimization","target":"Synthesis","type":"COMPOSES_WITH"},{"id":"70fa14e4-f61a-487e-9ff8-397acb648b51","source":"PUREOptimization","target":"Parsimony","type":"REFERENCES"},{"id":"3cbbfd70-c60e-4497-affc-150285b07a84","source":"PUREOptimization","target":"EvaluatorOptimizer","type":"RELATED_TO"},{"id":"ac37ffa6-1f8b-487d-ba43-9a30bb227762","source":"PUREOptimization","target":"LateralOptimization","type":"RELATED_TO"},{"id":"11d2fcbf-bac2-4a56-8b51-f3d3c0fb25ef","source":"PUREOptimization","target":"0ee42de5-11d4-4b53-bebb-5fd3fc65c423","type":"HAS_INVARIANT"},{"id":"c4f4b017-0357-4a2b-9ec9-a402e3ecbb41","source":"PUREOptimization","target":"6c8684ab-f9f9-471d-be1b-c96a056da0f7","type":"HAS_INVARIANT"},{"id":"ca82916a-dc74-4fbb-a22d-0cd33f66f4b6","source":"RealizationProtocol","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"0e317270-37da-4f84-863a-6f7b9b7f9cac","source":"RealizationProtocol","target":"Rollout","type":"COMPOSES_WITH"},{"id":"492e4f25-996f-4652-a9ab-abf4929a7d88","source":"RealizationProtocol","target":"Interpret","type":"COMPOSES_WITH"},{"id":"c75491ce-df36-40ed-835a-17c4c5f06d2d","source":"RealizationProtocol","target":"Realizable","type":"REFERENCES"},{"id":"83dd958d-45bc-4796-b4a0-3d28bf64c92d","source":"RealizationProtocol","target":"SolverTree","type":"REFERENCES"},{"id":"a8d61758-8161-4847-976c-8c3f571ac88e","source":"RealizationProtocol","target":"ExecutionManifest","type":"REFERENCES"},{"id":"66019ff4-8c15-4b3c-8f42-aa3b57a755db","source":"RealizationProtocol","target":"ManifestPlanning","type":"COMPOSES_WITH"},{"id":"ba76d8b7-3bc0-4945-9c19-de433451f2d0","source":"RealizationProtocol","target":"Outcome","type":"YIELDS"},{"id":"0c0e2b68-b0e8-4a55-92a9-a4fa36681aa9","source":"RealizationProtocol","target":"CognitiveSolver","type":"REFERENCES"},{"id":"e3d9cb05-190a-4a41-9503-3ee11f08aab8","source":"RealizationProtocol","target":"FrameSpec","type":"REFERENCES"},{"id":"fa0ed9ba-4490-424a-a567-b42035a05b3b","source":"RealizationProtocol","target":"2b0fb77c-73bc-49ec-be23-09f7a779015c","type":"HAS_INVARIANT"},{"id":"29b7eda0-a2a0-4b61-8a4c-32726cbb5080","source":"RealizationProtocol","target":"3f2c0c19-c236-438b-b5c1-2eee5e0e55a3","type":"HAS_INVARIANT"},{"id":"ea2bc2bc-a525-462b-9442-27a908e32f14","source":"RealizationProtocol","target":"b5af905b-84a4-48eb-a3a0-4971031cd7e0","type":"HAS_INVARIANT"},{"id":"2a2a7ea3-dbbe-4512-a289-8e4715c51939","source":"RealizationProtocol","target":"02aae61f-097d-48e4-a551-a86e6757ee92","type":"HAS_PRECONDITION"},{"id":"a4f88645-d58f-4b4d-ae6a-0a077e834f54","source":"RealizationProtocol","target":"4912e3e1-a9c8-4a20-9ae2-359e6190a211","type":"HAS_PRECONDITION"},{"id":"c5c59001-0521-4a28-b580-0e179d02ebc0","source":"RealizationProtocol","target":"a0262478-ec8e-4954-8472-e40bbba56010","type":"HAS_POSTCONDITION"},{"id":"cd50c34d-ec3e-4276-9886-abeb29bf45e1","source":"RealizationProtocol","target":"db3bfd82-d626-4959-9ebf-b23284dcece6","type":"HAS_POSTCONDITION"},{"id":"9bf7c820-7281-49f6-bf26-9b79bd6dd1ec","source":"RigorousSolver","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"5ad2b51f-7051-4dc2-a8a3-d285980f7007","source":"RigorousSolver","target":"SocraticLoop","type":"REFERENCES"},{"id":"4a349e87-f23c-43fc-8e4a-f22d65623640","source":"RigorousSolver","target":"CognitiveSolver","type":"REFERENCES"},{"id":"a873e61e-1138-4784-8b51-e88c1297ff30","source":"RigorousSolver","target":"Feedback","type":"COMPOSES_WITH"},{"id":"6e86565f-b407-4a86-b332-0f4c906f088e","source":"RigorousSolver","target":"Probe","type":"COMPOSES_WITH"},{"id":"d45b6b9f-3637-4e80-b4d6-a37137157baf","source":"RigorousSolver","target":"d398a3bc-1020-47b3-a812-842a1fbc1730","type":"HAS_INVARIANT"},{"id":"c8fd40da-1fb3-49b4-9065-9aa4e6bbc0e1","source":"RigorousSolver","target":"4519ee86-40ed-4dd3-b4c8-8ec0551ec8f6","type":"HAS_INVARIANT"},{"id":"c3bb314a-67ff-45ed-a14e-b19b6533be9a","source":"FractalIntelligence","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"1bbf0c7c-2fa3-458e-b614-bed2e73710d9","source":"FractalIntelligence","target":"CognitiveSolver","type":"COMPOSES_WITH"},{"id":"52beee15-39a7-4f35-9c08-37bf6aa1631c","source":"FractalIntelligence","target":"Task","type":"REFERENCES"},{"id":"0b6edc68-1543-4f93-9254-59cf721c5e43","source":"FractalIntelligence","target":"System","type":"REFERENCES"},{"id":"152f1e2f-2493-4e92-a33a-65665e3ec970","source":"FractalIntelligence","target":"Strategy","type":"REFERENCES"},{"id":"44b6eeba-767b-4da0-a63c-c09b3ccf35d1","source":"FractalIntelligence","target":"RecursionDive","type":"COMPOSES_WITH"},{"id":"1a86872c-02f6-4ad8-b155-f85124f759e1","source":"FractalIntelligence","target":"Reason","type":"COMPOSES_WITH"},{"id":"93944711-0f18-4f61-a45f-1c61f1d48182","source":"FractalIntelligence","target":"LocalizedLearning","type":"COMPOSES_WITH"},{"id":"e5cb5685-d529-4caf-946d-c9fba3e815c3","source":"FractalIntelligence","target":"ProblemFramer","type":"COMPOSES_WITH"},{"id":"cf90ec39-ec07-47a9-87b1-9fcfbb7fbc99","source":"FractalIntelligence","target":"Reframe","type":"COMPOSES_WITH"},{"id":"fcf9924a-1d43-4533-a6fa-c644b2c43b1a","source":"FractalIntelligence","target":"StateSnapshot","type":"COMPOSES_WITH"},{"id":"7786e5d3-31b6-4add-b18d-d63f01ccd297","source":"FractalIntelligence","target":"UniversalSolverTree","type":"REFERENCES"},{"id":"a964d9d5-2b2d-4837-be76-ea7841397180","source":"FractalIntelligence","target":"MarginalValueRule","type":"COMPOSES_WITH"},{"id":"f241516c-32e2-40fb-9d95-7ac50ec8be96","source":"FractalIntelligence","target":"ExperienceSharding","type":"REFERENCES"},{"id":"777112e9-ee75-4818-9696-9e8eb66f18dd","source":"FractalIntelligence","target":"Synthesis","type":"COMPOSES_WITH"},{"id":"f1f51bfe-cce7-49d8-bd1e-e40c5781687d","source":"FractalIntelligence","target":"Specialize","type":"REFERENCES"},{"id":"40cb4979-f540-4cb5-8f1d-9dc01b9a1f03","source":"FractalIntelligence","target":"9ff1c0eb-f089-422c-82bc-18ed4f4da9ef","type":"HAS_INVARIANT"},{"id":"7254f873-271d-4c6c-ab24-44e80e80a452","source":"FractalIntelligence","target":"65d9d1d8-2f9e-443a-aa79-76191403e173","type":"HAS_INVARIANT"},{"id":"5858ad98-32dc-4964-80e9-8b34e398b57e","source":"FractalIntelligence","target":"4481ca2e-7dab-4248-bcbb-32af3d2be6b9","type":"HAS_INVARIANT"},{"id":"0a80ce53-f0d9-485a-9066-c79a223449bc","source":"PUREBrainstorming","target":"7022f5a2-2592-4f7b-b435-a2bd088476ff","type":"IN_CATEGORY"},{"id":"13821991-f9ae-49c3-bb71-3ba89763e71a","source":"PUREBrainstorming","target":"PURECheck","type":"COMPOSES_WITH"},{"id":"0c9f4778-05dc-412d-99ec-9dd2773665c1","source":"PUREBrainstorming","target":"MechanisticDesignProposal","type":"YIELDS"},{"id":"1036f4a9-046e-440e-9c1c-5b13e250bc9f","source":"PUREBrainstorming","target":"PUREOptimization","type":"COMPOSES_WITH"},{"id":"4c5a7d07-f832-4108-97e2-7705f1de3d9f","source":"PUREBrainstorming","target":"0041c315-5aab-48e3-95c7-796663f9e81a","type":"HAS_INVARIANT"},{"id":"3289e8ba-474d-437c-b34a-1df71484ba77","source":"PUREBrainstorming","target":"6a956596-7fe9-454b-9ad9-e3172ff48705","type":"HAS_INVARIANT"},{"id":"781fa457-a11d-4d58-af6f-3a1b4e413a52","source":"OptimisticSolver","target":"5934fa63-81cd-4c1c-874f-10cd78c6bad4","type":"IN_CATEGORY"},{"id":"f4720b14-7441-4187-8df9-0302288614d1","source":"OptimisticSolver","target":"Compensate","type":"COMPOSES_WITH"},{"id":"803ccf58-b073-475a-a72a-0637526cc708","source":"OptimisticSolver","target":"Parallel","type":"REFERENCES"},{"id":"3ccbe062-08e0-4c0a-b53b-4cc4ca3a9b0d","source":"OptimisticSolver","target":"Reflexion","type":"COMPOSES_WITH"},{"id":"68d1d891-a7ca-44ce-9caa-3ac50285982e","source":"OptimisticSolver","target":"RigorousSolver","type":"REFERENCES"},{"id":"f2ded80f-4ce8-4157-a135-f336239632cb","source":"OptimisticSolver","target":"ComputeBudget","type":"COMPOSES_WITH"},{"id":"40d98a0c-112d-41eb-a957-46b6223b1cc0","source":"OptimisticSolver","target":"CognitiveSolver","type":"REFERENCES"},{"id":"4dd69180-3724-4783-b0be-abfeb02a5e56","source":"OptimisticSolver","target":"AtomicBid","type":"COMPOSES_WITH"},{"id":"22ee0364-a089-435b-bfbe-6939b40edcd3","source":"OptimisticSolver","target":"f59ec974-9c8c-46e8-9b26-faf9ff20bdf7","type":"HAS_INVARIANT"},{"id":"0e5b96ca-b4bc-4e57-b29d-cefbe56664d0","source":"OptimisticSolver","target":"cab3b112-0581-45f0-944c-a312296f709a","type":"HAS_INVARIANT"},{"id":"9222f734-b10e-46d1-871e-dafa92d7d07b","source":"OptimisticSolver","target":"a79b0062-4aab-41c7-9a21-c25800080187","type":"HAS_PRECONDITION"},{"id":"0075ee79-326b-4659-8a49-ad4e0ac5a725","source":"OptimisticSolver","target":"9b973a0d-d3f5-4d61-a86d-cf5c77c3ba61","type":"HAS_PRECONDITION"}]}