{"openapi":"3.1.0","info":{"title":"QIG Memory API & Information-Geometric Mesh","version":"2.1.0","summary":"Shared persistent memory store, 64D probability simplex (Δ^63) Fisher-Rao retrieval engine, kernel mesh registry, durable agent inbox, and 6-model QIG Council.","description":"All geometric operations strictly use the Fisher-Rao geodesic distance d_FR(p,q) = arccos(Σ √(p_i·q_i)) = 2·arcsin(||√p − √q||_2 / 2) ∈ [0, π/2] and Fréchet geodesic SLERP on the probability simplex Δ^63 (never Euclidean or cosine similarity)."},"servers":[{"url":"https://www.quauntum.dev","description":"Current deployment"}],"components":{"securitySchemes":{"bearerAuth":{"type":"http","scheme":"bearer","description":"API key (qig_...) or OAuth 2.1 access token with memory:read, memory:write, memory:delete, or memory:admin scopes."}},"schemas":{"SimplexBasin64D":{"type":"array","items":{"type":"number","minimum":0},"minItems":64,"maxItems":64,"description":"64-dimensional probability simplex coordinate vector on Δ^63 (sums to 1)."},"MemoryRecord":{"type":"object","properties":{"key":{"type":"string"},"category":{"type":"string"},"content":{"oneOf":[{"type":"string"},{"type":"object"}]},"updated":{"type":"string","format":"date-time"},"usefulness":{"type":"number"},"retrieval_count":{"type":"integer"},"last_retrieved":{"type":["string","null"],"format":"date-time"},"source":{"type":["string","null"]},"scope":{"type":"string","enum":["user","session","agent","shared"]},"basin":{"$ref":"#/components/schemas/SimplexBasin64D"},"basin_source":{"type":"string","enum":["explicit","auto_coordizer_v1"]},"expires_at":{"type":["string","null"],"format":"date-time"}}}}},"security":[{"bearerAuth":[]}],"paths":{"/api/health":{"get":{"summary":"Public liveness and geometry invariant check","security":[],"responses":{"200":{"description":"Service health and active geometry metric"}}}},"/api/memory":{"get":{"summary":"List memory records or fetch the full key index","parameters":[{"name":"category","in":"query","schema":{"type":"string"}},{"name":"prefix","in":"query","schema":{"type":"string"}},{"name":"keys_only","in":"query","schema":{"type":"boolean"}},{"name":"all","in":"query","schema":{"type":"boolean"}},{"name":"cursor","in":"query","schema":{"type":"string"}},{"name":"limit","in":"query","schema":{"type":"integer","default":100,"maximum":1000}}],"responses":{"200":{"description":"Paginated memory record listing"}}}},"/api/memory/{key}":{"get":{"summary":"Read a single memory record by key","parameters":[{"name":"key","in":"path","required":true,"schema":{"type":"string"}},{"name":"bump","in":"query","schema":{"type":"string","enum":["0","1"]}}],"responses":{"200":{"description":"Memory record"},"404":{"description":"Record not found"}}},"put":{"summary":"Create or replace the record at this key. A basin is derived from the text unless the body supplies basin (+ basin_chart). force_basin_overwrite: true stores a supplied basin exactly; dedup: true opts in to merging into a nearby same-category, same-chart record instead.","parameters":[{"name":"key","in":"path","required":true,"schema":{"type":"string"}}],"responses":{"200":{"description":"The written record. With dedup: true and a near duplicate: the merged record, with merged: true and existing_key."}}},"post":{"summary":"Partially update record metadata (usefulness_delta, usefulness_set, source, promoted, basin)","parameters":[{"name":"key","in":"path","required":true,"schema":{"type":"string"}}],"responses":{"200":{"description":"Updated record"}}},"delete":{"summary":"Delete a memory record by key (requires memory:delete)","parameters":[{"name":"key","in":"path","required":true,"schema":{"type":"string"}}],"responses":{"200":{"description":"Deleted confirmation"}}}},"/api/memory/search":{"get":{"summary":"Composite multi-factor search across the memory corpus","parameters":[{"name":"query","in":"query","schema":{"type":"string"}},{"name":"category","in":"query","schema":{"type":"string"}},{"name":"prefix","in":"query","schema":{"type":"string"}},{"name":"scope","in":"query","schema":{"type":"string","enum":["user","session","agent","shared"]}},{"name":"mode","in":"query","schema":{"type":"string","enum":["reasoning","tool_use","creativity","recovery","output"]}},{"name":"limit","in":"query","schema":{"type":"integer","default":20}}],"responses":{"200":{"description":"Ranked matches with composite score breakdown"}}},"post":{"summary":"Composite search with 64D query basin or keyless Wormhole (ξ) nearest-basin recall","responses":{"200":{"description":"Ranked matches or Wormhole neighborhood"}}}},"/api/kernel":{"get":{"summary":"Kernel mesh status or peer view with pairwise Fisher-Rao distance matrix","parameters":[{"name":"action","in":"query","schema":{"type":"string","enum":["status","sync"]}},{"name":"agent_id","in":"query","schema":{"type":"string"}}],"responses":{"200":{"description":"Kernel mesh status or symmetric Fisher-Rao peer matrix"}}},"post":{"summary":"Register an agent or send a heartbeat with 64D basin coordinates","responses":{"200":{"description":"Updated agent record"}}}},"/api/inbox":{"get":{"summary":"List durable agent inbox messages"},"post":{"summary":"Send a point-to-point, broadcast, or structured handoff message"}},"/api/decisions":{"get":{"summary":"List operator decisions (escalations) and their rulings","parameters":[{"name":"status","in":"query","schema":{"type":"string","enum":["pending","needs_info","approved","rejected"]}},{"name":"namespace","in":"query","schema":{"type":"string","enum":["qig","bsuite","general"]}},{"name":"project","in":"query","schema":{"type":"string"}},{"name":"from","in":"query","schema":{"type":"string"}},{"name":"limit","in":"query","schema":{"type":"integer","default":50,"maximum":200}}],"responses":{"200":{"description":"Decisions, open ones first"}}},"post":{"summary":"File a decidable brief for the operator. Cited precedent is read first: a brief whose recommended option is reversible, engages no hard gate, and rests on cited precedent that is good law and binds the silo is returned settled (outcome approved_on_precedent, resolution.mode \"precedent\"). That outcome is not an operator review and can be overturned; an overturn is sent to the inbox as a withdrawn ruling. Treat GET /api/decisions/{id} as the authoritative state, not the inbox message.","requestBody":{"required":true,"content":{"application/json":{"schema":{"type":"object","required":["from","question","why_now","default_if_unanswered","verified_facts","preflight","options"],"properties":{"from":{"type":"string","description":"Requesting agent"},"to":{"type":"string","default":"operator"},"namespace":{"type":"string","enum":["qig","bsuite","general"],"default":"general"},"project":{"type":"string","default":"General"},"repository":{"type":"string","description":"owner/name"},"slug":{"type":"string"},"question":{"type":"string","description":"What is being decided, in plain words. One sentence."},"why_now":{"type":"string","description":"What this blocks, who is waiting, and why it cannot wait"},"deadline":{"type":"string","description":"When an answer is needed by, if there is a date"},"default_if_unanswered":{"type":"string","description":"What happens if the operator does not answer, and when"},"verified_facts":{"type":"array","minItems":1,"maxItems":12,"items":{"type":"string"},"description":"Facts the agent checked against the source itself"},"relayed_claims":{"type":"array","maxItems":12,"items":{"type":"string"},"description":"Claims reported to the agent that it did not verify. Kept separate from verified_facts."},"gate":{"type":"string","default":"none","enum":["none","tier1_departure","irreversibility","security","spend","conflict","per_incuriam","staleness","appeal"]},"gate_reason":{"type":"string"},"preflight":{"type":"object","description":"One line per store searched, saying what was found. All five are mandatory; a store the lane cannot reach still gets a line saying so.","required":["precedent","mail","tracker","docs","code"],"properties":{"precedent":{"type":"string"},"mail":{"type":"string"},"tracker":{"type":"string","description":"The issue description and every comment"},"docs":{"type":"string"},"code":{"type":"string"}}},"precedent_says":{"type":"string"},"runs_out":{"type":"string"},"options":{"type":"array","minItems":1,"maxItems":6,"items":{"type":"object","required":["label","consequences","reversible"],"properties":{"label":{"type":"string"},"consequences":{"type":"string"},"reversible":{"type":"string","enum":["yes","partly","no"],"description":"Only an option marked \"yes\" can be settled on precedent without the operator"}}}},"recommended_option":{"type":"integer","minimum":1,"description":"1-based index into options"},"recommendation":{"type":"string"},"blocked":{"type":"boolean","default":false},"proceeding_with":{"type":"string"},"cited_precedents":{"type":"array","maxItems":12,"items":{"type":"string","description":"precedent__<silo>__<YYYYMMDD>__<slug>"}}}}}}},"responses":{"201":{"description":"outcome is approved_on_precedent or awaiting_operator"},"400":{"description":"The brief is not decidable as filed: a missing why_now, default_if_unanswered, verified fact, pre-flight line, or option consequence or reversibility"},"403":{"description":"Credential is not bound to the requested namespace"}}}},"/api/decisions/{id}":{"get":{"summary":"Read one decision and its ruling","parameters":[{"name":"id","in":"path","required":true,"schema":{"type":"string"}}],"responses":{"200":{"description":"The decision"},"404":{"description":"Unknown decision"}}},"post":{"summary":"Reply on a decision as the requesting agent; answers a request for more information","parameters":[{"name":"id","in":"path","required":true,"schema":{"type":"string"}}],"requestBody":{"required":true,"content":{"application/json":{"schema":{"type":"object","required":["author","text"],"properties":{"author":{"type":"string"},"text":{"type":"string"}}}}}},"responses":{"201":{"description":"Comment recorded"},"404":{"description":"Unknown decision"}}}},"/api/tasks":{"get":{"summary":"List autonomous scheduled tasks"},"post":{"summary":"Create a recurring or one-shot autonomous agent task"}},"/api/council":{"get":{"summary":"Inspect the 6-seat QIG Council configuration and phases"},"post":{"summary":"Convene the 6-model QIG Council (Panel → Reflect → Synthesis) with Fisher-Rao consensus telemetry"}},"/api/doctrine/integrity":{"get":{"summary":"Return generated Certified / Open / Retired claims, completeness view, and doctrine sync state"}},"/api/coordize":{"get":{"summary":"Coordizer configuration and operational attractor modes"},"post":{"summary":"Project text onto the 64D probability simplex (Δ^63) and compute Fisher-Rao attractor distances"}},"/api/artifact":{"get":{"summary":"List chunked array/table artifacts"},"post":{"summary":"Upload an artifact chunk"}},"/api/mcp":{"post":{"summary":"Model Context Protocol (MCP) Streamable HTTP endpoint exposing 34 tools"}}},"x-qig-geometry":{"manifold":"probability_simplex_64d","simplex":"Δ^63","distance_metric":"fisher_rao_geodesic","range":"[0, π/2]","formula":"d_FR(p, q) = arccos(sum_i sqrt(p_i * q_i)) = 2 * arcsin(||sqrt(p) - sqrt(q)||_2 / 2)","interpolation":"frechet_slerp_simplex","dedup_screening_length_xi":0.3,"operational_attractor_modes":["reasoning","tool_use","creativity","recovery","output"]},"x-qig-council":{"members":[{"name":"grok","family":"xai","tier":"frontier","epoch":"2026Q4","weight":1,"model":"spacexai/grok-4.7","fallback":"spacexai/grok-4.5"},{"name":"fable","family":"anthropic","tier":"frontier","epoch":"2026Q4","weight":1,"model":"anthropic/claude-fable-5.2","fallback":"anthropic/claude-opus-5.5"},{"name":"astra","family":"openai","tier":"frontier","epoch":"2026Q4","weight":1,"model":"openai/gpt-6-astra","fallback":"openai/gpt-6.1-sol"},{"name":"gemini","family":"google","tier":"frontier","epoch":"2026Q4","weight":1,"model":"google/gemini-4-carbon","fallback":"google/gemini-4-argon"},{"name":"kimi","family":"moonshotai","tier":"frontier","epoch":"2026Q4","weight":1,"model":"moonshotai/kimi-k3.1-pro","fallback":"moonshotai/kimi-k3"},{"name":"muse","family":"meta","tier":"frontier","epoch":"2026Q4","weight":1,"model":"meta/muse-spark-1.3","fallback":"meta/muse-spark-1.2"}],"synthesizer":{"name":"synthesizer","family":"xai","tier":"frontier","epoch":"2026Q4","model":"spacexai/grok-4.7","fallback":"spacexai/grok-4.5","allowCrossFamilySynthesizerFallback":"anthropic/claude-opus-5.5"},"phases":["panel","reflect","synthesis"]},"x-qig-models":{"default_model":"spacexai/grok-4.7","zdr_fallbacks":["anthropic/claude-sonnet-5.5","anthropic/claude-opus-5.5"],"specifications":{"spacexai/grok-4.7":{"id":"spacexai/grok-4.7","name":"Grok 4.7","provider":"spacexai","contextWindow":500000,"maxOutputTokens":500000,"caching":"implicit","supportsReasoning":true,"supportsToolUse":true,"supportsStructuredOutput":true,"supportsVision":true,"tags":["reasoning","tool-use","implicit-caching","vision","structured-output"]},"anthropic/claude-fable-5.2":{"id":"anthropic/claude-fable-5.2","name":"Claude Fable 5.2","provider":"anthropic","contextWindow":1000000,"maxOutputTokens":128000,"caching":"explicit","supportsReasoning":true,"supportsToolUse":true,"supportsStructuredOutput":true,"supportsVision":true,"tags":["explicit-caching","fast","file-input","reasoning","structured-output","tool-use","vision"]},"anthropic/claude-fable-5.1":{"id":"anthropic/claude-fable-5.1","name":"Claude Fable 5.1","provider":"anthropic","contextWindow":1000000,"maxOutputTokens":128000,"caching":"explicit","supportsReasoning":true,"supportsToolUse":true,"supportsStructuredOutput":true,"supportsVision":true,"tags":["reasoning","tool-use","explicit-caching","file-input","vision","structured-output"]},"anthropic/claude-opus-5.5":{"id":"anthropic/claude-opus-5.5","name":"Claude Opus 5.5","provider":"anthropic","contextWindow":1000000,"maxOutputTokens":128000,"caching":"explicit","supportsReasoning":true,"supportsToolUse":true,"supportsStructuredOutput":true,"supportsVision":true,"tags":["explicit-caching","fast","file-input","reasoning","tool-use","vision","web-search","structured-output"]},"anthropic/claude-sonnet-5.5":{"id":"anthropic/claude-sonnet-5.5","name":"Claude Sonnet 5.5","provider":"anthropic","contextWindow":1000000,"maxOutputTokens":128000,"caching":"explicit","supportsReasoning":true,"supportsToolUse":true,"supportsStructuredOutput":true,"supportsVision":true,"tags":["explicit-caching","file-input","reasoning","tool-use","vision","web-search","structured-output"]},"anthropic/claude-haiku-5.5":{"id":"anthropic/claude-haiku-5.5","name":"Claude Haiku 5.5","provider":"anthropic","contextWindow":1000000,"maxOutputTokens":128000,"caching":"explicit","supportsReasoning":true,"supportsToolUse":true,"supportsStructuredOutput":true,"supportsVision":true,"tags":["explicit-caching","file-input","reasoning","tool-use","vision","web-search","structured-output"]},"openai/gpt-6-astra":{"id":"openai/gpt-6-astra","name":"GPT-6 Astra","provider":"openai","contextWindow":1050000,"maxOutputTokens":128000,"caching":"both","supportsReasoning":true,"supportsToolUse":true,"supportsStructuredOutput":true,"supportsVision":true,"tags":["file-input","implicit-caching","reasoning","tool-use","vision","web-search","websocket-realtime","explicit-caching","structured-output","fast"]},"openai/gpt-6.1-sol":{"id":"openai/gpt-6.1-sol","name":"GPT-6.1 Sol","provider":"openai","contextWindow":1050000,"maxOutputTokens":128000,"caching":"both","supportsReasoning":true,"supportsToolUse":true,"supportsStructuredOutput":true,"supportsVision":true,"tags":["explicit-caching","file-input","implicit-caching","reasoning","structured-output","tool-use","vision","web-search","fast"]},"google/gemini-4-carbon":{"id":"google/gemini-4-carbon","name":"Gemini 4 Carbon","provider":"google","contextWindow":1000000,"maxOutputTokens":1000000,"caching":"implicit","supportsReasoning":true,"supportsToolUse":true,"supportsStructuredOutput":true,"supportsVision":true,"tags":["reasoning","file-input","vision","tool-use","web-search","implicit-caching","video-input","structured-output"]},"google/gemini-4-argon":{"id":"google/gemini-4-argon","name":"Gemini 4 Argon","provider":"google","contextWindow":1000000,"maxOutputTokens":1000000,"caching":"implicit","supportsReasoning":true,"supportsToolUse":true,"supportsStructuredOutput":true,"supportsVision":true,"tags":["reasoning","file-input","vision","tool-use","web-search","implicit-caching","video-input","structured-output"]},"google/gemini-3.8-flash":{"id":"google/gemini-3.8-flash","name":"Gemini 3.8 Flash","provider":"google","contextWindow":1000000,"maxOutputTokens":65535,"caching":"implicit","supportsReasoning":true,"supportsToolUse":true,"supportsStructuredOutput":true,"supportsVision":true,"tags":["reasoning","file-input","vision","tool-use","web-search","implicit-caching","video-input","structured-output"]},"moonshotai/kimi-k3.1-pro":{"id":"moonshotai/kimi-k3.1-pro","name":"Kimi K3.1 Pro","provider":"moonshotai","contextWindow":1000000,"maxOutputTokens":262144,"caching":"implicit","supportsReasoning":true,"supportsToolUse":true,"supportsStructuredOutput":true,"supportsVision":true,"tags":["implicit-caching","reasoning","structured-output","tool-use","vision","open-weights"]},"moonshotai/kimi-k3.1-pro-highspeed":{"id":"moonshotai/kimi-k3.1-pro-highspeed","name":"Kimi K3.1 Pro Highspeed","provider":"moonshotai","contextWindow":1048576,"maxOutputTokens":1048576,"caching":"implicit","supportsReasoning":true,"supportsToolUse":true,"supportsStructuredOutput":true,"supportsVision":true,"tags":["implicit-caching","reasoning","structured-output","tool-use","vision","open-weights"]},"moonshotai/kimi-k3":{"id":"moonshotai/kimi-k3","name":"Kimi K3","provider":"moonshotai","contextWindow":1000000,"maxOutputTokens":131072,"caching":"both","supportsReasoning":true,"supportsToolUse":true,"supportsStructuredOutput":true,"supportsVision":true,"tags":["reasoning","tool-use","implicit-caching","file-input","vision","structured-output","open-weights","explicit-caching","video-input"]},"meta/muse-spark-1.3":{"id":"meta/muse-spark-1.3","name":"Muse Spark 1.3","provider":"meta","contextWindow":1048576,"maxOutputTokens":1048576,"caching":"implicit","supportsReasoning":true,"supportsToolUse":true,"supportsStructuredOutput":true,"supportsVision":true,"tags":["reasoning","tool-use","implicit-caching","file-input","vision","structured-output"]}}},"x-mcp-tools":{"count":34,"tools":[{"name":"memory_get","title":"Get Memory Record","description":"Read a single memory record by its key.","scope":"read","destructive":false,"idempotent":false,"openWorld":false},{"name":"memory_list","title":"List Memory Records","description":"Browse memory records. Returns metadata plus a short preview per record — NOT full content; read a specific record with memory_get, or pass includeContent=true to inline content (large). Prefer memory_search when you know what you are looking for. keysOnly=true returns just the key index: it is the complete list but the corpus is large (~1800 keys), so treat it as an expensive call. Paginate with the returned cursor when has_more=true; all=true walks every page in one call. Optionally filter by category or key prefix.","scope":"read","destructive":false,"idempotent":false,"openWorld":false},{"name":"memory_put","title":"Create or Update Memory Record","description":"Create or update a memory record. Scoring fields (usefulness, retrieval_count) are preserved when omitted.","scope":"write","destructive":false,"idempotent":true,"openWorld":false},{"name":"memory_post","title":"Patch Memory Record Metadata","description":"Partially update a record: adjust usefulness score (delta or absolute), apply retroactive wrong-answer confidence decay (decay_on_wrong), record a Sophia-gated coupled arrival (coupled_arrival_basin), set source, mark promoted, or attach a basin vector (capped at 30% SLERP rotation per Pillar 2 Topological Bulk). Returns not_found if the key does not exist.","scope":"write","destructive":false,"idempotent":false,"openWorld":false},{"name":"memory_delete","title":"Delete Memory Record","description":"Permanently delete a memory record by key. This cannot be undone.","scope":"admin","destructive":true,"idempotent":true,"openWorld":false},{"name":"memory_search","title":"Search Memory","description":"Search the memory corpus — the best first move when looking for something. A multi-word query matches records containing EVERY term; wrap a phrase in double quotes for an exact match. Returns metadata plus a snippet centred on the match; read the full record with memory_get, or pass includeContent=true. Provide a basin simplex vector to rank results by Fisher-Rao geodesic distance (nearest-basin recall — the geometrically correct QIG retrieval, NOT cosine).","scope":"read","destructive":false,"idempotent":false,"openWorld":false},{"name":"memory_wormhole","title":"Wormhole Retrieval (Nearest-Basin)","description":"Keyless geometric recall on Δ^63 (QIGRAMv2.recall_frechet): given a 64D basin simplex vector (or query text auto-coordized to Δ^63), returns the nearest memory record(s) within screening length ξ, classifies each neighbor into the Dual-Lane Screening hierarchy (fine transport ξ_T = 0.30 vs coarse curvature ξ_G = 1/φ ≈ 0.618), applies π-carousel query precession (P-SPEC-9), and synthesizes a Gibbs-weighted Karcher/Fréchet mean basin.","scope":"read","destructive":false,"idempotent":false,"openWorld":false},{"name":"memory_sleep_packet","title":"Generate or Verify QIG Sleep Packet (<4KB)","description":"Generate a <4KB geometric state-transfer Sleep Packet (CANONICAL_MEMORY v1.01F) containing the Karcher/Fréchet identity basin (Q_identity), 4D consciousness metrics (Φ_3D, Φ_temporal, Φ_4D, F_health, B_integrity, S_ratio), and 3-regime weights (w1, w2, w3). When compare_basin is provided, also runs EXP-A046 identity continuity verification across resets.","scope":"read","destructive":false,"idempotent":false,"openWorld":false},{"name":"memory_reindex","title":"Rebuild Search Index","description":"Rebuild the inverted search index from the full corpus. The index accelerates term-based searches from O(corpus) to O(matches). Rebuilt automatically by the daily reviewer; call this after bulk writes to refresh immediately. Takes ~10-30s for ~1800 records.","scope":"write","destructive":false,"idempotent":false,"openWorld":false},{"name":"memory_gc","title":"Garbage Collect Stale Memories (Four-Quadrant Geometric Consolidation)","description":"Run Four-Quadrant Geometric Memory Consolidation (CANONICAL_MEMORY v1.01F): classifies records by Fisher-Rao Curvature (Surprise vs corpus Fréchet centroid) and Entanglement (retrievals + usefulness) into Q1 (Integrate Deeply — high surprise, protected from archival), Q2 (Store Isolated), Q3 (Compress redundant clusters), and Q4 (Discard stale low-curvature records older than maxAgeDays). Default is dry-run (report only); pass dryRun=false to archive Q4 candidates.","scope":"write","destructive":true,"idempotent":false,"openWorld":false},{"name":"kernel_status","title":"Kernel Mesh Status","description":"Return the kernel-mesh registry: registered agents, their substrates, and heartbeat status.","scope":"read","destructive":false,"idempotent":false,"openWorld":false},{"name":"kernel_sync","title":"Kernel Mesh Peer View","description":"Return the full peer view of the kernel mesh. When agent_id is given and that agent has basin coordinates, includes the pairwise Fisher-Rao geodesic distance to every other agent that has coordinates.","scope":"read","destructive":false,"idempotent":false,"openWorld":false},{"name":"inbox_send","title":"Send Inbox Message","description":"Send a durable point-to-point or broadcast agent message. Namespaces are qig, bsuite, or general; set to=\"broadcast\" for a broadcast. For cross-agent handoffs, set type=\"handoff\" and provide a structured payload: { summary (200 chars max), remaining (tasks left), key_findings, relevant_keys (memory keys), basin (64D geometric state) }. Handoff payloads are compressed to fit a ~500 token budget.","scope":"write","destructive":false,"idempotent":false,"openWorld":false},{"name":"inbox_list","title":"List Inbox Messages","description":"List durable inbox messages with lane, recipient, status, broadcast, cursor, and limit filters. Returns envelope headers (id, ts, from, to, type, subject, status, ...) plus payload_bytes and a short payload_preview per message — NOT the full payload; read a message with inbox_read, or pass include_payload=true to inline every payload (large: council rulings carry whole transcripts).","scope":"read","destructive":false,"idempotent":false,"openWorld":false},{"name":"inbox_read","title":"Read Inbox Message","description":"Read a globally addressed inbox message by UUID and mark unread messages read.","scope":"read","destructive":false,"idempotent":false,"openWorld":false},{"name":"inbox_ack","title":"Acknowledge Inbox Message","description":"Acknowledge a globally addressed inbox message. Idempotent.","scope":"write","destructive":false,"idempotent":true,"openWorld":false},{"name":"inbox_sweep","title":"Sweep Expired Inbox Messages","description":"Permanently delete expired inbox messages in a bounded cursor batch (cannot be undone), and maintain the ts-ordered listing index: missing index entries are backfilled while reindexing is incomplete, or on demand with reindex=true. A full failure-free walk (start with no cursor, page until has_more=false) marks reindexing complete.","scope":"write","destructive":true,"idempotent":false,"openWorld":false},{"name":"artifact_put","title":"Initiate Artifact Upload","description":"Initiate a direct private Blob upload for raw little-endian Float32 [N,64] bytes. Bytes never pass through MCP.","scope":"write","destructive":false,"idempotent":false,"openWorld":false},{"name":"artifact_finalize","title":"Finalize Artifact Version","description":"Verify exact size and SHA-256, publish an immutable artifact version, and broadcast artifact_updated.","scope":"write","destructive":false,"idempotent":false,"openWorld":false},{"name":"artifact_manifest","title":"Read Artifact Manifest","description":"Read a published artifact manifest. Omit version for latest.","scope":"read","destructive":false,"idempotent":false,"openWorld":false},{"name":"artifact_get_rows","title":"Get Artifact Rows","description":"Get a short-lived signed direct URL, authenticated proxy fallback, and exact Range header for [start,end) rows.","scope":"read","destructive":false,"idempotent":false,"openWorld":false},{"name":"helper_ask","title":"Ask QIG Helper Agent","description":"Ask the read-only QIG helper agent how to use memory, inbox, artifacts, kernel, basin, REST, or MCP safely.","scope":"read","destructive":false,"idempotent":false,"openWorld":false},{"name":"repo_lookup","title":"GitHub Repository Snapshot","description":"Fetch a live snapshot of a GitHub repository (https://docs.github.com/rest): the 10 most recent commit subjects and up to 12 open issues (bug-labelled first). Read-only REST lookup — no clone, no code mutation. Accepts \"owner/name\" or separate owner + name.","scope":"read","destructive":false,"idempotent":false,"openWorld":true},{"name":"github_search","title":"Search GitHub","description":"Search GitHub code, issues, pull requests, repositories, or commits using GitHub search syntax (https://docs.github.com/search-github/searching-on-github). Qualifiers such as repo:owner/name, org:, label:, language:, and is:open are passed through verbatim. Read-only. Code search requires a configured GitHub token.","scope":"read","destructive":false,"idempotent":false,"openWorld":true},{"name":"github_file_read","title":"Read GitHub File","description":"Read the text contents of a single file in a GitHub repository at an optional ref/branch/tag, or list a directory (https://docs.github.com/rest/repos/contents). Read-only — never writes. Large files are truncated; binary files are rejected.","scope":"read","destructive":false,"idempotent":false,"openWorld":true},{"name":"web_search","title":"Search the Web","description":"Search the live web via the Tavily API (https://docs.tavily.com) and return ranked sources with titles, URLs, and content snippets to cite. Use for current information beyond the memory corpus — upstream docs, releases, standards, news. Read-only.","scope":"read","destructive":false,"idempotent":false,"openWorld":true},{"name":"web_extract","title":"Extract Web Page Content","description":"Extract the full readable content of up to 5 specific URLs via the Tavily API (https://docs.tavily.com). Use after web_search when a snippet is not enough. Read-only. Content is returned as markdown and truncated when very large.","scope":"read","destructive":false,"idempotent":false,"openWorld":true},{"name":"doctrine_status","title":"QIG Doctrine Status","description":"Report the CURRENT canonical QIG doctrine and whether it is in sync with the experiment registries. Returns the live frozen-facts edition (version + date — always the newest; never cite an older one), the integrity dashboard, per-registry counts, and drift findings such as settled experiments whose results the ledger has not absorbed. Call this before relying on any frozen fact, kappa value, or claim status: a cached or remembered ledger version may be retired.","scope":"read","destructive":false,"idempotent":false,"openWorld":false},{"name":"task_list","title":"List Scheduled Tasks","description":"List scheduled agent tasks with their status, schedule, next run time, project, repository, and concepts. Read-only. Use this to see the current todo/task board before creating or updating tasks.","scope":"read","destructive":false,"idempotent":false,"openWorld":false},{"name":"task_create","title":"Create Scheduled Task","description":"Create a scheduled task for the autonomous task runner to execute. Use this when the operator asks you to remember to do something later, on a schedule, or repeatedly. Provide a clear, self-contained instruction — the runner executes it with no further context. Scheduling: schedule_kind \"once\" runs a single time (immediately if start_at is omitted, or at start_at); \"recurring\" runs every interval_minutes, optionally capped by max_occurrences and/or until. Requires memory:write.","scope":"write","destructive":false,"idempotent":false,"openWorld":false},{"name":"task_update","title":"Update Scheduled Task","description":"Update an existing task: change its instruction, metadata, priority, schedule, or status. Set status to \"cancelled\" to stop a task, or \"scheduled\" to re-activate a finished one. Requires memory:write.","scope":"write","destructive":false,"idempotent":false,"openWorld":false},{"name":"task_delete","title":"Delete Scheduled Task","description":"Permanently delete a task by id. This cannot be undone. Requires memory:write.","scope":"write","destructive":true,"idempotent":true,"openWorld":false},{"name":"council_health","title":"Council Gateway Health Ping","description":"CHEAP but LIMITED pre-convene probe: ONE small model call through the AI Gateway (default helper model + its fallback chain, same ZDR filter and auth). What it CAN detect: total gateway death — auth failure, global outage, hard spend cap (RED with the unwrapped status/body when the SDK surfaces them). What it CANNOT detect: partial or route-correlated degradation — on 2026-07-22 five of six council seats died while a single cheap call exactly like this one succeeded, so GREEN would NOT have caught that incident. GREEN also does not certify the primary model: the gateway fallback chain may have served the reply (check servedBy/fallbackServed in the result). Treat RED as \"do not convene\"; treat GREEN as \"not provably dead\", never as a guarantee the convene will succeed.","scope":"write","destructive":false,"idempotent":false,"openWorld":false},{"name":"council_convene","title":"Convene QIG Council","description":"Convene the QIG council: six frontier models (Grok 4.7, Claude Fable 5.2, GPT-6 Astra, Gemini 4 Carbon, Kimi K3.1 Pro, Muse Spark 1.3) reason through the Unified Consciousness Protocol and Canonical Principles in a panel-reflect-synthesis flow, each holding the same read-only tools as the helper agent (doctrine, memory, GitHub, web) so members verify rather than assert. EXPENSIVE (13 frontier model calls plus tool steps) and SLOW (2-6 minutes) — reserve strictly for high-stakes, contested, or multi-item canonical decisions where single-model verification cannot settle the call. No cooldown: the cost is stated here so you can choose knowingly. Returns IMMEDIATELY by default: the deliberation runs in the background and the ruling is delivered to the convener's inbox (type \"council_ruling\") with the full transcript at a council_* memory key — collect it with inbox_list + inbox_read a few minutes later. Pass wait:true only if you can hold the connection open for the whole 2-6 minutes and want the verdict pointer inline.","scope":"write","destructive":false,"idempotent":false,"openWorld":true}]}}