agentix-cli 0.69.3 → 0.70.0

package/dist/chunk-ML6CNRBK.js

@@ -0,0 +1,105 @@
+import{b as C}from"./chunk-CECHWYJ2.js";import{a as L,b as _,c as R,d as j,e as M}from"./chunk-TFVUOC2C.js";import{c as A,d as D}from"./chunk-QOYAX2FT.js";import{f as I}from"./chunk-WLMQ5JMX.js";import{v as x,w as O}from"./chunk-BBIWAJRX.js";import{readFileSync as y,writeFileSync as b,appendFileSync as P,existsSync as w,mkdirSync as $,readdirSync as v,statSync as B}from"fs";import{resolve as u,join as N,relative as k,dirname as U}from"path";O();var T=class{baseDir;rawDir;log;constructor(t=u(process.cwd(),".agentx/wiki"),e=console.error.bind(console,"[wiki]")){this.baseDir=t,this.rawDir=u(t,"raw/entries"),this.log=e,$(this.rawDir,{recursive:!0}),$(u(t,"raw"),{recursive:!0}),this.ensureSchema()}canRead(t,e){return t.access==="public"?!0:e?!!(t.owner===e||t.access==="shared"&&t.sharedWith?.includes(e)):!1}canWrite(t,e){return t.owner===e}addEntry(t){let e=`${t.date}_${t.id}.md`,r=u(this.rawDir,e),n=["---",`id: ${t.id}`,`date: ${t.date}`,`agent: ${t.agentId}`,`source: ${t.source}`];if(t.sourceContext&&n.push(`context: ${t.sourceContext}`),t.meta)for(let[a,s]of Object.entries(t.meta))n.push(`${a}: ${JSON.stringify(s)}`);return n.push("---","",t.content),b(r,n.join(`
+`)),this.appendLog("ingest",`${t.id} from ${t.agentId} via ${t.source}`),e}listEntries(t){if(!w(this.rawDir))return[];let e=v(this.rawDir).filter(n=>n.endsWith(".md")).sort(),r=[];for(let n of e){let a=y(u(this.rawDir,n),"utf-8"),s=this.parseEntry(a,n);s&&(t?.agentId&&s.agentId!==t.agentId||t?.after&&s.date<t.after||t?.before&&s.date>t.before||r.push(s))}return r}parseEntry(t,e){let r=t.match(/^---\n([\s\S]*?)\n---\n([\s\S]*)$/);if(!r)return null;let n=r[1],a=r[2].trim(),s=c=>n.match(new RegExp(`^${c}:\\s*(.+)$`,"m"))?.[1]?.trim()||"",o=new Set(["id","date","agent","source","context"]),i={};for(let c of n.split(`
+`)){let l=c.match(/^(\w+):\s*(.+)$/);if(!(!l||o.has(l[1])))try{i[l[1]]=JSON.parse(l[2])}catch{i[l[1]]=l[2].trim()}}return{id:s("id")||e.replace(".md",""),date:s("date"),agentId:s("agent"),source:s("source"),sourceContext:s("context")||void 0,content:a,meta:Object.keys(i).length>0?i:void 0}}writeArticle(t,e,r,n){let a=this.readArticle(t);if(a&&!this.canWrite(a.meta,n))return this.log(`Permission denied: "${n}" cannot write "${t}" (owner: ${a.meta.owner})`),!1;e.type&&!C(e.type)&&(this.log(`Dropping invalid article type "${e.type}" for "${t}" \u2014 enum is [person, project, place, concept, event, decision, pattern]`),e={...e,type:void 0});let s=u(this.baseDir,t);a&&this.saveVersion(t,s),$(U(s),{recursive:!0});let o=["---",`title: "${e.title}"`];e.type&&o.push(`type: ${e.type}`),e.related?.length&&o.push(`related: [${e.related.map(c=>`"${c}"`).join(", ")}]`),o.push(`tags: [${(e.tags||[]).map(c=>`"${c}"`).join(", ")}]`,`owner: ${e.owner}`,`access: ${e.access}`),e.sharedWith?.length&&o.push(`shared_with: [${e.sharedWith.map(c=>`"${c}"`).join(", ")}]`),o.push(`created: ${e.created}`,`last_updated: ${e.lastUpdated}`,`sources: [${e.sources.map(c=>`"${c}"`).join(", ")}]`),e.graphPath?.length&&o.push(`graph_path: [${e.graphPath.map(c=>`"${c}"`).join(", ")}]`),o.push("---","",r),b(s,o.join(`
+`));let i=a?"update":"create";return this.appendLog(i,`${e.title} [${(e.tags||[]).slice(0,5).join(", ")}] by ${n} at ${t}`),!0}saveVersion(t,e){try{if(!w(e))return;let r=y(e,"utf-8"),n=new Date().toISOString().replace(/[:.]/g,"-"),a=u(this.baseDir,"_versions",t.replace(/\.md$/,""));$(a,{recursive:!0}),b(u(a,`${n}.md`),r)}catch{}}getVersions(t){let e=u(this.baseDir,"_versions",t.replace(/\.md$/,""));if(!w(e))return[];try{return v(e).filter(r=>r.endsWith(".md")).sort().reverse().map(r=>({timestamp:r.replace(/\.md$/,"").replace(/-/g,(n,a)=>a<19?a===10?"T":a===13||a===16?":":"-":n),path:u(e,r)}))}catch{return[]}}restoreVersion(t,e){let n=this.getVersions(t).find(a=>a.timestamp.startsWith(e));if(!n)return!1;try{let a=y(n.path,"utf-8"),s=u(this.baseDir,t);return this.saveVersion(t,s),b(s,a),this.appendLog("restore",`${t} restored to ${e}`),!0}catch{return!1}}readArticle(t){let e=u(this.baseDir,t);if(!w(e))return null;let r=y(e,"utf-8");return this.parseArticle(r,t)}readArticleAs(t,e){let r=this.readArticle(t);return!r||!this.canRead(r.meta,e)?null:r}parseArticle(t,e){let r=t.match(/^---\n([\s\S]*?)\n---\n([\s\S]*)$/);if(!r)return null;let n=r[1],a=r[2].trim(),s=m=>n.match(new RegExp(`^${m}:\\s*(.+)$`,"m"))?.[1]?.trim().replace(/^"(.*)"$/,"$1")||"",o=m=>{let h=n.match(new RegExp(`^${m}:\\s*\\[(.*)\\]$`,"m"));return h?h[1].split(",").map(f=>f.trim().replace(/^"(.*)"$/,"$1")).filter(Boolean):[]},i=s("type")||s("kind"),l=new Set(["person","project","place","concept","event","decision","pattern"]).has(i)?i:void 0,p=o("tags").filter((m,h,f)=>m&&f.indexOf(m)===h),d=o("related"),g=o("graph_path");return{meta:{title:s("title"),type:l,related:d.length?d:void 0,tags:p,owner:s("owner"),access:s("access")||"public",sharedWith:o("shared_with"),created:s("created"),lastUpdated:s("last_updated"),sources:o("sources"),graphPath:g.length?g:void 0},content:a,path:e}}listCache=new Map;listArticles(t){let e=[],r=[];this.walkDir(this.baseDir,(o,i)=>{if(!o.endsWith(".md"))return;let c=k(this.baseDir,o);c.startsWith("raw/")||c.startsWith("_")||(e.push(c),r.push(`${c}:${i?.mtimeMs??"?"}:${i?.size??"?"}`))});let n=r.join("|"),a=this.listCache.get(t);if(a&&a.signature===n)return a.articles.slice();let s=[];for(let o of e){let i=this.readArticle(o);i&&this.canRead(i.meta,t)&&s.push(i)}return this.listCache.set(t,{signature:n,articles:s}),s.slice()}search(t,e,r=10){let n=t.toLowerCase(),a=[];if(this.walkDir(this.baseDir,d=>{if(!d.endsWith(".md"))return;let g=k(this.baseDir,d);if(g.startsWith("raw/")||g.startsWith("_"))return;let m=this.readArticle(g);!m||!this.canRead(m.meta,e)||a.push(m)}),a.length===0)return[];let s=a.map(d=>d.content),o=u(this.baseDir,"_bm25_cache.json"),i=D(s,o),c=A(t,i),l=new Map(c.map(d=>[d.docIndex,d.score]));return a.map((d,g)=>{let m=l.get(g)??0;return d.meta.title.toLowerCase().includes(n)&&(m+=10),d.meta.tags?.some(h=>h.toLowerCase().includes(n))&&(m+=5),{article:d,score:m}}).filter(d=>d.score>0).sort((d,g)=>g.score-d.score).slice(0,r).map(d=>d.article)}async findRelevantReranked(t,e,r=10,n={}){let a=Math.max(r,n.shortlist??_),s=this.findRelevant(t,e,a);if(s.length<2)return s.slice(0,r);let o=s.map((l,p)=>({id:`c${p}`,title:l.meta.title||`(untitled ${p})`,tags:l.meta.tags,excerpt:l.content})),i=await x(L,R({query:t,candidates:o,excerptChars:n.excerptChars}),j(o),{incumbent:{best:o[0].id},features:{agent:e??"unknown"}});return!i||i.mode!=="active"?s.slice(0,r):M(i.answers,o).ranked.map(l=>s[Number(l.slice(1))]).filter(l=>!!l).slice(0,r)}findRelevant(t,e,r=3,n,a={graph:.6,bm25:.4}){let s=[];if(this.walkDir(this.baseDir,h=>{if(!h.endsWith(".md"))return;let f=k(this.baseDir,h);if(f.startsWith("raw/")||f.startsWith("_"))return;let W=this.readArticle(f);!W||!this.canRead(W.meta,e)||s.push(W)}),s.length===0)return[];let o=s.map(h=>`${h.meta.title} ${(h.meta.tags||[]).join(" ")} ${h.content}`),i=u(this.baseDir,"_bm25_relevance_cache.json"),c=D(o,i),l=A(t,c),p=l.reduce((h,f)=>Math.max(h,f.score),0)||1,d=new Map(l.map(h=>[h.docIndex,h.score/p])),g=!!(n&&n.length>0);return s.map((h,f)=>{let W=d.get(f)??0,S=0;g&&h.meta.graphPath?.length&&(S=I(n,h.meta.graphPath));let E=g?a.graph*S+a.bm25*W:W;return{article:h,score:E}}).filter(h=>h.score>0).sort((h,f)=>f.score-h.score).slice(0,r).map(h=>h.article)}buildContext(t,e=4e3){if(t.length===0)return"";let r=["[Wiki Knowledge]"],n=0;for(let a of t){let s=`
+## ${a.meta.title} [${(a.meta.tags||[]).slice(0,3).join(", ")}]`,o=a.content.length>600?a.content.slice(0,600)+"...":a.content,i=s+`
+`+o;if(n+i.length>e)break;r.push(i),n+=i.length}return r.push(`
+[End Wiki Knowledge]`),r.join(`
+`)}rebuildIndex(){let t=[],e=new Map;this.walkDir(this.baseDir,s=>{if(!s.endsWith(".md"))return;let o=k(this.baseDir,s);if(o.startsWith("raw/")||o.startsWith("_"))return;let i=this.readArticle(o);if(!i)return;let c=i.content.match(/\[\[([^\]]+)\]\]/g)||[];for(let p of c){let d=p.replace(/\[\[|\]\]/g,"");e.set(d,(e.get(d)||0)+1)}let l=[i.meta.title.toLowerCase()];i.meta.tags&&l.push(...i.meta.tags.map(p=>p.toLowerCase())),t.push({path:o,title:i.meta.title,type:i.meta.type,related:i.meta.related,tags:i.meta.tags||[],owner:i.meta.owner,access:i.meta.access,sharedWith:i.meta.sharedWith,aliases:l,backlinks:e.get(i.meta.title)||0,sources:i.meta.sources,lastUpdated:i.meta.lastUpdated,graphPath:i.meta.graphPath})});let r={articles:t,lastRebuilt:new Date().toISOString()};b(u(this.baseDir,"_index.json"),JSON.stringify(r,null,2)),this.writeCatalog(t,r.lastRebuilt);let n=["# Wiki Index","",`Last rebuilt: ${r.lastRebuilt}`,""],a=new Map;for(let s of t){let o=s.access||"public",i=a.get(o)||[];i.push(s),a.set(o,i)}for(let[s,o]of Array.from(a.entries()).sort()){n.push(`## ${s}`,"");for(let i of o.sort((c,l)=>c.title.localeCompare(l.title))){let c=i.type?` [${i.type}]`:"";n.push(`- [${i.title}](${i.path})${c} \u2014 owner: ${i.owner}`)}n.push("")}return b(u(this.baseDir,"WIKI.md"),n.join(`
+`)),this.log(`Index rebuilt: ${t.length} articles`),this.appendLog("rebuild-index",`${t.length} articles indexed`),r}writeCatalog(t,e){let r=["person","project","place","concept","event","decision","pattern","untyped"],n={person:"## People",project:"## Projects",place:"## Places",concept:"## Concepts",event:"## Events",decision:"## Decisions",pattern:"## Patterns",untyped:"## Untyped (needs migration)"},a=new Map;for(let o of t){let i=o.type||"untyped",c=a.get(i)||[];c.push(o),a.set(i,c)}let s=["# Wiki Content Catalog","",`_Last rebuilt: ${e}_`,"","Articles grouped by type. Agentic query walks this file first to pick candidates.",""];for(let o of r){let i=a.get(o);if(!(!i||i.length===0)){s.push(n[o]||`## ${o}`,"");for(let c of i.sort((l,p)=>l.title.localeCompare(p.title))){let l=c.access==="private"?" (private)":c.access==="shared"?" (shared)":"",p=c.related?.length?` \u2192 [[${c.related.slice(0,3).join("]], [[")}]]${c.related.length>3?", \u2026":""}`:"";s.push(`- [${c.title}](${c.path})${l}${p}`)}s.push("")}}b(u(this.baseDir,"_index.md"),s.join(`
+`))}stats(){let t=0,e={},r={},n={};this.walkDir(this.baseDir,s=>{if(!s.endsWith(".md"))return;let o=k(this.baseDir,s);if(o.startsWith("raw/")||o.startsWith("_")||o==="WIKI.md")return;let i=this.readArticle(o);if(i){t++;for(let c of i.meta.tags||[])e[c]=(e[c]||0)+1;r[i.meta.access]=(r[i.meta.access]||0)+1,n[i.meta.owner]=(n[i.meta.owner]||0)+1}});let a=w(this.rawDir)?v(this.rawDir).filter(s=>s.endsWith(".md")).length:0;return{totalArticles:t,totalEntries:a,articlesByType:e,articlesByAccess:r,articlesByOwner:n}}appendLog(t,e){let r=u(this.baseDir,"log.md"),a=`## [${new Date().toISOString().replace("T"," ").slice(0,16)}] ${t} | ${e}
+
+`;w(r)||b(r,`# Wiki Log
+
+Chronological record of all wiki operations.
+
+`),P(r,a)}getLog(t=20){let e=u(this.baseDir,"log.md");return w(e)?y(e,"utf-8").split(/^## /m).filter(a=>a.startsWith("[")).slice(-t).map(a=>a.trim()):[]}ensureSchema(){let t=u(this.baseDir,"_schema.md");if(w(t))return;b(t,`# Wiki Schema
+
+A personal wiki maintained by LLMs. Karpathy pattern: plain files, aggressive tagging,
+structure emerges from data. The wiki is a compounding artifact.
+
+## Structure
+
+\`\`\`
+wiki/
+  _schema.md         # This file
+  worldview.md       # YOUR mental model \u2014 the LLM reads this during absorb
+  raw/entries/       # Immutable raw sources (conversations, imports, anything)
+  [LLM-chosen dirs]  # Structure emerges from data \u2014 the LLM picks paths
+\`\`\`
+
+The LLM decides how to organize articles. You describe YOUR world in worldview.md.
+
+## Article Format
+
+\`\`\`yaml
+---
+title: "Staging Deployment Process"
+tags: ["deploy", "staging", "devops", "process", "2026-04-06"]
+owner: devops-agent
+access: public
+created: 2026-04-06
+last_updated: 2026-04-06
+sources: ["entry-id-1", "entry-id-2"]
+---
+
+Article content with [[wikilinks]] and section tags.
+
+## Deploy Steps
+<!-- tags: process, runbook, staging -->
+Content specific to this section...
+\`\`\`
+
+## Tags
+
+Tags are the primary context-narrowing mechanism. The more tags, the better.
+
+Tag aggressively:
+- **Who**: people, agents, teams involved
+- **What**: project, client, topic, technology
+- **When**: dates, periods, milestones
+- **Where**: server, environment, channel
+- **How**: process, decision, pattern
+- **Your terms**: whatever vocabulary makes sense in YOUR world
+
+Section tags (\`<!-- tags: ... -->\`) let different parts of an article
+match different queries. A deploy article might have sections tagged
+"runbook" and "incident" separately.
+
+## Operations
+
+### Absorb
+Read raw entries \u2192 read worldview.md \u2192 tag aggressively \u2192 create/update articles.
+Also identify GAPS: "We mention X but have no article for it."
+
+### Query
+Match by tags first \u2192 then keyword within matched articles \u2192 synthesize.
+If agent is working on a specific project, only send content tagged for that project.
+
+### Lint
+Check for: orphan articles, broken [[wikilinks]], untagged articles,
+articles over 100 lines that should split, mentioned-but-missing topics.
+
+## Worldview
+
+Edit \`worldview.md\` to describe YOUR world. This is not a schema \u2014 it's your
+mental model. The LLM reads it during absorb to understand where things go.
+
+Example worldview.md:
+\`\`\`
+I'm the founder of Acme Corp.
+We build software products.
+Our agents: Marketing Bot, DevOps Bot, Coordinator.
+Clients: ClientA (enterprise), ClientB (startup).
+Infrastructure: local dev machine, cloud server.
+We use GitLab for version control.
+\`\`\`
+`),this.log("Created _schema.md")}extractWikilinks(t){return(t.match(/\[\[([^\]]+)\]\]/g)||[]).map(r=>r.replace(/\[\[|\]\]/g,""))}buildBacklinks(){let t={};return this.walkDir(this.baseDir,e=>{if(!e.endsWith(".md"))return;let r=k(this.baseDir,e);if(r.startsWith("raw/")||r.startsWith("_")||r==="WIKI.md"||r==="log.md")return;let n=y(e,"utf-8"),a=this.extractWikilinks(n);for(let s of a)t[s]||(t[s]=[]),t[s].push(r)}),b(u(this.baseDir,"_backlinks.json"),JSON.stringify(t,null,2)),t}getBacklinks(t){let e=u(this.baseDir,"_backlinks.json");if(!w(e))return[];try{return JSON.parse(y(e,"utf-8"))[t]||[]}catch{return[]}}findByTags(t,e,r=10){let n=t.map(s=>s.toLowerCase()),a=[];return this.walkDir(this.baseDir,s=>{if(!s.endsWith(".md"))return;let o=k(this.baseDir,s);if(o.startsWith("raw/")||o.startsWith("_"))return;let i=this.readArticle(o);if(!i||e&&!this.canRead(i.meta,e))return;let c=(i.meta.tags||[]).map(g=>g.toLowerCase()),l=(i.content.match(/<!--\s*tags?:\s*([^>]+)\s*-->/gi)||[]).flatMap(g=>g.replace(/<!--\s*tags?:\s*|\s*-->/gi,"").split(",").map(m=>m.trim().toLowerCase())),p=[...c,...l],d=n.filter(g=>p.includes(g)).length;d>0&&a.push({article:i,score:d})}),a.sort((s,o)=>o.score-s.score).slice(0,r).map(s=>s.article)}getAllTags(){let t=new Map;return this.walkDir(this.baseDir,e=>{if(!e.endsWith(".md"))return;let r=k(this.baseDir,e);if(r.startsWith("raw/")||r.startsWith("_"))return;let n=this.readArticle(r);if(n?.meta.tags)for(let a of n.meta.tags)t.set(a,(t.get(a)||0)+1)}),t}getWorldview(){let t=u(this.baseDir,"worldview.md");return w(t)?y(t,"utf-8"):null}setWorldview(t){b(u(this.baseDir,"worldview.md"),t),this.appendLog("worldview","Updated worldview")}lint(){let t=[],e=new Set,r=new Map,n=new Map;this.walkDir(this.baseDir,s=>{if(!s.endsWith(".md"))return;let o=k(this.baseDir,s);if(o.startsWith("raw/")||o.startsWith("_")||o==="WIKI.md"||o==="log.md")return;let i=this.readArticle(o);if(!i)return;e.add(i.meta.title),n.set(i.meta.title,o);let c=this.extractWikilinks(i.content);r.set(o,c);let l=i.content.split(`
+`).length;l>100&&t.push({type:"bloated",article:o,message:`${l} lines \u2014 consider splitting`}),i.meta.sources?.length||t.push({type:"unsourced",article:o,message:"No sources listed in frontmatter"}),l<10&&i.content.trim().length<100&&t.push({type:"stub",article:o,message:"Very short article \u2014 needs enrichment"})});for(let[s,o]of r)for(let i of o)e.has(i)||t.push({type:"broken-link",article:s,message:`[[${i}]] \u2014 target article not found`});let a=this.buildBacklinks();for(let[s,o]of n)(!a[s]||a[s].length===0)&&t.push({type:"orphan",article:o,message:`No other articles link to "${s}"`});return this.appendLog("lint",`Found ${t.length} issues`),t}getUnabsorbedEntries(){let t=new Set;return this.walkDir(this.baseDir,r=>{if(!r.endsWith(".md"))return;let n=k(this.baseDir,r);if(n.startsWith("raw/")||n.startsWith("_"))return;let a=this.readArticle(n);if(a?.meta.sources)for(let s of a.meta.sources)t.add(s)}),this.listEntries().filter(r=>!t.has(r.id))}buildAbsorbPrompt(t=20){let e=this.getUnabsorbedEntries().slice(0,t);if(e.length===0)return null;let r=e.map(n=>`[${n.date} ${n.agentId} via ${n.source}] ${n.content.slice(0,200)}`).join(`
+
+`);return`/wiki absorb
+
+There are ${e.length} unprocessed entries. Read each, understand what it means, and create or update wiki articles.
+
+${r}`}walkDir(t,e){if(w(t))for(let r of v(t)){let n=N(t,r),a=B(n);a.isDirectory()?this.walkDir(n,e):e(n,a)}}};export{T as a};
+//# sourceMappingURL=chunk-ML6CNRBK.js.map

package/dist/chunk-ML6CNRBK.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/wiki/store.ts"],"sourcesContent":["import { readFileSync, writeFileSync, appendFileSync, existsSync, mkdirSync, readdirSync, statSync, type Stats } from \"fs\"\nimport { resolve, join, relative, dirname } from \"path\"\nimport { isWikiArticleType } from \"./types\"\nimport type { WikiArticle, WikiArticleMeta, WikiEntry, WikiIndex, WikiAccess } from \"./types\"\nimport { buildIndex, buildIndexCached, scoreAll } from \"../memory/bm25\"\nimport { askSeat } from \"../decisions/seat\"\nimport {\n  DEFAULT_SHORTLIST,\n  WIKI_RERANK_SEAT,\n  rerankQuestions,\n  rerankState,\n  toRanking,\n  type RerankCandidate,\n} from \"../decisions/seats/wiki-rerank\"\nimport { ancestryScore as ancestryOf } from \"@/graph\"\n\n// --- Wiki Store: filesystem-based knowledge base with permissions ---\n//\n// Structure:\n//   .agentx/wiki/\n//     _index.md          # Master index with aliases\n//     _backlinks.json    # Reverse link index\n//     raw/entries/        # One .md per ingested entry\n//     {directories}/     # Articles organized by type\n//\n// Permission model:\n//   - private: only owner agent reads/writes\n//   - shared: owner writes, listed agents read\n//   - public: owner writes, all agents read\n\nexport class WikiStore {\n  readonly baseDir: string\n  private rawDir: string\n  private log: (...args: unknown[]) => void\n\n  constructor(\n    baseDir: string = resolve(process.cwd(), \".agentx/wiki\"),\n    log: (...args: unknown[]) => void = console.error.bind(console, \"[wiki]\"),\n  ) {\n    this.baseDir = baseDir\n    this.rawDir = resolve(baseDir, \"raw/entries\")\n    this.log = log\n\n    mkdirSync(this.rawDir, { recursive: true })\n    mkdirSync(resolve(baseDir, \"raw\"), { recursive: true })\n\n    // Initialize schema if missing\n    this.ensureSchema()\n  }\n\n  // --- Permission checks ---\n\n  /**\n   * Check if an agent can read an article.\n   */\n  canRead(article: WikiArticleMeta, agentId?: string): boolean {\n    if (article.access === \"public\") return true\n    if (!agentId) return false\n    if (article.owner === agentId) return true\n    if (article.access === \"shared\" && article.sharedWith?.includes(agentId)) return true\n    return false\n  }\n\n  /**\n   * Check if an agent can write an article.\n   */\n  canWrite(article: WikiArticleMeta, agentId: string): boolean {\n    return article.owner === agentId\n  }\n\n  // --- Raw entries (ingestion) ---\n\n  /**\n   * Add a raw entry (from a conversation, cron result, etc.)\n   */\n  addEntry(entry: WikiEntry): string {\n    const filename = `${entry.date}_${entry.id}.md`\n    const filepath = resolve(this.rawDir, filename)\n\n    const frontmatter = [\n      \"---\",\n      `id: ${entry.id}`,\n      `date: ${entry.date}`,\n      `agent: ${entry.agentId}`,\n      `source: ${entry.source}`,\n    ]\n    if (entry.sourceContext) frontmatter.push(`context: ${entry.sourceContext}`)\n    if (entry.meta) {\n      for (const [k, v] of Object.entries(entry.meta)) {\n        frontmatter.push(`${k}: ${JSON.stringify(v)}`)\n      }\n    }\n    frontmatter.push(\"---\", \"\", entry.content)\n\n    writeFileSync(filepath, frontmatter.join(\"\\n\"))\n    this.appendLog(\"ingest\", `${entry.id} from ${entry.agentId} via ${entry.source}`)\n    return filename\n  }\n\n  /**\n   * List raw entries, optionally filtered by agent or date range.\n   */\n  listEntries(filter?: { agentId?: string; after?: string; before?: string }): WikiEntry[] {\n    if (!existsSync(this.rawDir)) return []\n\n    const files = readdirSync(this.rawDir).filter(f => f.endsWith(\".md\")).sort()\n    const entries: WikiEntry[] = []\n\n    for (const file of files) {\n      const content = readFileSync(resolve(this.rawDir, file), \"utf-8\")\n      const entry = this.parseEntry(content, file)\n      if (!entry) continue\n\n      if (filter?.agentId && entry.agentId !== filter.agentId) continue\n      if (filter?.after && entry.date < filter.after) continue\n      if (filter?.before && entry.date > filter.before) continue\n\n      entries.push(entry)\n    }\n\n    return entries\n  }\n\n  private parseEntry(content: string, filename: string): WikiEntry | null {\n    const fmMatch = content.match(/^---\\n([\\s\\S]*?)\\n---\\n([\\s\\S]*)$/)\n    if (!fmMatch) return null\n\n    const fm = fmMatch[1]\n    const body = fmMatch[2].trim()\n\n    const get = (key: string): string => {\n      const m = fm.match(new RegExp(`^${key}:\\\\s*(.+)$`, \"m\"))\n      return m?.[1]?.trim() || \"\"\n    }\n\n    // Everything addEntry wrote that is not one of the five named keys is\n    // `meta`, JSON-encoded one key per line. Dropping it here is what made\n    // graphPath 0%: the capture path stamps intentPath onto every entry,\n    // `wiki absorb` reads entry.meta.intentPath to propagate it onto the\n    // article, and this parser never returned a meta at all — so absorb\n    // always fell through to a fingerprint lookup its own comment calls\n    // unreliable, and the retrieval scorer multiplied the graph weight\n    // (0.6 of the hybrid score) by zero for every article ever compiled.\n    const KNOWN = new Set([\"id\", \"date\", \"agent\", \"source\", \"context\"])\n    const meta: Record<string, unknown> = {}\n    for (const line of fm.split(\"\\n\")) {\n      const m = line.match(/^(\\w+):\\s*(.+)$/)\n      if (!m || KNOWN.has(m[1])) continue\n      try {\n        meta[m[1]] = JSON.parse(m[2])\n      } catch {\n        meta[m[1]] = m[2].trim()\n      }\n    }\n\n    return {\n      id: get(\"id\") || filename.replace(\".md\", \"\"),\n      date: get(\"date\"),\n      agentId: get(\"agent\"),\n      source: get(\"source\"),\n      sourceContext: get(\"context\") || undefined,\n      content: body,\n      meta: Object.keys(meta).length > 0 ? meta : undefined,\n    }\n  }\n\n  // --- Articles (compiled knowledge) ---\n\n  /**\n   * Write or update a wiki article.\n   */\n  writeArticle(\n    path: string,\n    meta: WikiArticleMeta,\n    content: string,\n    agentId: string,\n  ): boolean {\n    // LLM picks the path. We just write the file.\n    const existing = this.readArticle(path)\n    if (existing && !this.canWrite(existing.meta, agentId)) {\n      this.log(`Permission denied: \"${agentId}\" cannot write \"${path}\" (owner: ${existing.meta.owner})`)\n      return false\n    }\n\n    // Drop invalid `type` at write time. The parser already rejects invalid\n    // values on read (returns type=undefined), so silently serialising a\n    // stray value would cause the round-trip to look fine but the article\n    // to render as \"untyped\" in the catalog. Log + drop beats surprise.\n    if (meta.type && !isWikiArticleType(meta.type)) {\n      this.log(`Dropping invalid article type \"${meta.type}\" for \"${path}\" — enum is [person, project, place, concept, event, decision, pattern]`)\n      meta = { ...meta, type: undefined }\n    }\n\n    const fullPath = resolve(this.baseDir, path)\n\n    // Version the previous content before overwriting (immutable history)\n    if (existing) {\n      this.saveVersion(path, fullPath)\n    }\n\n    mkdirSync(dirname(fullPath), { recursive: true })\n\n    const frontmatter = [\n      \"---\",\n      `title: \"${meta.title}\"`,\n    ]\n    if (meta.type) frontmatter.push(`type: ${meta.type}`)\n    if (meta.related?.length) {\n      frontmatter.push(`related: [${meta.related.map(t => `\"${t}\"`).join(\", \")}]`)\n    }\n    frontmatter.push(\n      `tags: [${(meta.tags || []).map(t => `\"${t}\"`).join(\", \")}]`,\n      `owner: ${meta.owner}`,\n      `access: ${meta.access}`,\n    )\n    if (meta.sharedWith?.length) {\n      frontmatter.push(`shared_with: [${meta.sharedWith.map(s => `\"${s}\"`).join(\", \")}]`)\n    }\n    frontmatter.push(\n      `created: ${meta.created}`,\n      `last_updated: ${meta.lastUpdated}`,\n      `sources: [${meta.sources.map(s => `\"${s}\"`).join(\", \")}]`,\n    )\n    if (meta.graphPath?.length) {\n      frontmatter.push(`graph_path: [${meta.graphPath.map(s => `\"${s}\"`).join(\", \")}]`)\n    }\n    frontmatter.push(\"---\", \"\", content)\n\n    writeFileSync(fullPath, frontmatter.join(\"\\n\"))\n    const action = existing ? \"update\" : \"create\"\n    this.appendLog(action, `${meta.title} [${(meta.tags || []).slice(0, 5).join(\", \")}] by ${agentId} at ${path}`)\n    return true\n  }\n\n  // --- Article Versioning ---\n\n  /**\n   * Save current article content as an immutable version before overwriting.\n   * Versions stored in _versions/{article-path}/{timestamp}.md\n   */\n  private saveVersion(articlePath: string, fullPath: string): void {\n    try {\n      if (!existsSync(fullPath)) return\n      const content = readFileSync(fullPath, \"utf-8\")\n      const ts = new Date().toISOString().replace(/[:.]/g, \"-\")\n      const versionDir = resolve(this.baseDir, \"_versions\", articlePath.replace(/\\.md$/, \"\"))\n      mkdirSync(versionDir, { recursive: true })\n      writeFileSync(resolve(versionDir, `${ts}.md`), content)\n    } catch {\n      // Version save is best-effort\n    }\n  }\n\n  /**\n   * List all versions of an article (newest first).\n   */\n  getVersions(articlePath: string): Array<{ timestamp: string; path: string }> {\n    const versionDir = resolve(this.baseDir, \"_versions\", articlePath.replace(/\\.md$/, \"\"))\n    if (!existsSync(versionDir)) return []\n\n    try {\n      return readdirSync(versionDir)\n        .filter(f => f.endsWith(\".md\"))\n        .sort()\n        .reverse()\n        .map(f => ({\n          timestamp: f.replace(/\\.md$/, \"\").replace(/-/g, (m, i) => i < 19 ? (i === 10 ? \"T\" : i === 13 || i === 16 ? \":\" : \"-\") : m),\n          path: resolve(versionDir, f),\n        }))\n    } catch {\n      return []\n    }\n  }\n\n  /**\n   * Restore a specific version of an article.\n   */\n  restoreVersion(articlePath: string, versionTimestamp: string): boolean {\n    const versions = this.getVersions(articlePath)\n    const version = versions.find(v => v.timestamp.startsWith(versionTimestamp))\n    if (!version) return false\n\n    try {\n      const content = readFileSync(version.path, \"utf-8\")\n      const fullPath = resolve(this.baseDir, articlePath)\n      // Save current as a version too before restoring\n      this.saveVersion(articlePath, fullPath)\n      writeFileSync(fullPath, content)\n      this.appendLog(\"restore\", `${articlePath} restored to ${versionTimestamp}`)\n      return true\n    } catch {\n      return false\n    }\n  }\n\n  /**\n   * Read an article. Returns null if not found.\n   */\n  readArticle(path: string): WikiArticle | null {\n    const fullPath = resolve(this.baseDir, path)\n    if (!existsSync(fullPath)) return null\n\n    const raw = readFileSync(fullPath, \"utf-8\")\n    return this.parseArticle(raw, path)\n  }\n\n  /**\n   * Read an article with permission check.\n   */\n  readArticleAs(path: string, agentId: string): WikiArticle | null {\n    const article = this.readArticle(path)\n    if (!article) return null\n    if (!this.canRead(article.meta, agentId)) return null\n    return article\n  }\n\n  private parseArticle(raw: string, path: string): WikiArticle | null {\n    const fmMatch = raw.match(/^---\\n([\\s\\S]*?)\\n---\\n([\\s\\S]*)$/)\n    if (!fmMatch) return null\n\n    const fm = fmMatch[1]\n    const content = fmMatch[2].trim()\n\n    const get = (key: string): string => {\n      const m = fm.match(new RegExp(`^${key}:\\\\s*(.+)$`, \"m\"))\n      return m?.[1]?.trim().replace(/^\"(.*)\"$/, \"$1\") || \"\"\n    }\n\n    const getArray = (key: string): string[] => {\n      const m = fm.match(new RegExp(`^${key}:\\\\s*\\\\[(.*)\\\\]$`, \"m\"))\n      if (!m) return []\n      return m[1].split(\",\").map(s => s.trim().replace(/^\"(.*)\"$/, \"$1\")).filter(Boolean)\n    }\n\n    // `type` and `kind` are the new structural spine; no longer stuffed into tags.\n    // Legacy articles may have a `kind:` field; we promote it to `type` on read so\n    // the migration (Phase 2) can patch it in place.\n    const rawType = get(\"type\") || get(\"kind\")\n    const validTypes = new Set([\n      \"person\", \"project\", \"place\", \"concept\", \"event\", \"decision\", \"pattern\",\n    ])\n    const type = validTypes.has(rawType) ? (rawType as WikiArticleMeta[\"type\"]) : undefined\n\n    const tags = getArray(\"tags\").filter((v, i, a) => v && a.indexOf(v) === i)\n    const related = getArray(\"related\")\n    const graphPath = getArray(\"graph_path\")\n    return {\n      meta: {\n        title: get(\"title\"),\n        type,\n        related: related.length ? related : undefined,\n        tags,\n        owner: get(\"owner\"),\n        access: (get(\"access\") as WikiAccess) || \"public\",\n        sharedWith: getArray(\"shared_with\"),\n        created: get(\"created\"),\n        lastUpdated: get(\"last_updated\"),\n        sources: getArray(\"sources\"),\n        graphPath: graphPath.length ? graphPath : undefined,\n      },\n      content,\n      path,\n    }\n  }\n\n  // --- Index and discovery ---\n\n  /**\n   * List all articles accessible to an agent.\n   */\n  /** Catalog per agent, valid while no article file changed. The walk is\n   *  repeated (names, mtimes, sizes) but the frontmatter parse of every\n   *  article is not; on a wiki of ten thousand files that parse was the\n   *  cost of every fresh session. */\n  private listCache = new Map<string, { signature: string; articles: WikiArticle[] }>()\n\n  listArticles(agentId: string): WikiArticle[] {\n    const relPaths: string[] = []\n    const sig: string[] = []\n    this.walkDir(this.baseDir, (filePath, stat) => {\n      if (!filePath.endsWith(\".md\")) return\n      const relPath = relative(this.baseDir, filePath)\n      if (relPath.startsWith(\"raw/\") || relPath.startsWith(\"_\")) return\n      relPaths.push(relPath)\n      sig.push(`${relPath}:${stat?.mtimeMs ?? \"?\"}:${stat?.size ?? \"?\"}`)\n    })\n    const signature = sig.join(\"|\")\n    const hit = this.listCache.get(agentId)\n    if (hit && hit.signature === signature) return hit.articles.slice()\n\n    const articles: WikiArticle[] = []\n    for (const relPath of relPaths) {\n      const article = this.readArticle(relPath)\n      if (article && this.canRead(article.meta, agentId)) {\n        articles.push(article)\n      }\n    }\n    this.listCache.set(agentId, { signature, articles })\n    return articles.slice()\n  }\n\n  /**\n   * Search articles by keyword. Returns articles the agent can read.\n   */\n  search(query: string, agentId: string, maxResults: number = 10): WikiArticle[] {\n    const queryLower = query.toLowerCase()\n    const articles: WikiArticle[] = []\n\n    this.walkDir(this.baseDir, (filePath) => {\n      if (!filePath.endsWith(\".md\")) return\n      const relPath = relative(this.baseDir, filePath)\n      if (relPath.startsWith(\"raw/\") || relPath.startsWith(\"_\")) return\n\n      const article = this.readArticle(relPath)\n      if (!article || !this.canRead(article.meta, agentId)) return\n      articles.push(article)\n    })\n\n    if (articles.length === 0) return []\n\n    // BM25 over article content (cached to disk)\n    const docs = articles.map((a) => a.content)\n    const cachePath = resolve(this.baseDir, \"_bm25_cache.json\")\n    const index = buildIndexCached(docs, cachePath)\n    const bm25Scores = scoreAll(query, index)\n    const scoreMap = new Map(bm25Scores.map((r) => [r.docIndex, r.score]))\n\n    const results = articles.map((article, i) => {\n      let score = scoreMap.get(i) ?? 0\n      // Additive bonuses for title and tag matches\n      if (article.meta.title.toLowerCase().includes(queryLower)) score += 10\n      if (article.meta.tags?.some(t => t.toLowerCase().includes(queryLower))) score += 5\n      return { article, score }\n    })\n\n    return results\n      .filter((r) => r.score > 0)\n      .sort((a, b) => b.score - a.score)\n      .slice(0, maxResults)\n      .map((r) => r.article)\n  }\n\n  /**\n   * findRelevant, then re-ranked by the wiki-rerank seat.\n   *\n   * Recall comes from findRelevant rather than search() because\n   * findRelevant is the function everything actually calls — search()\n   * turned out to have no callers at all. Additive on purpose: the\n   * synchronous findRelevant is untouched and its existing callers stay\n   * as they are. Measured on the 12-query eval against this\n   * wiki, re-ranking moves R@1 from 33.3% to 50.0% and R@3 from 41.7% to\n   * 66.7%, for about $0.0005 and 550ms a query.\n   *\n   * Fail-open in every direction. Seat off, backend down, no key, fewer\n   * than two candidates — all return BM25's own order, which is what the\n   * caller would have got anyway.\n   *\n   * Note what this cannot do: it only reorders what BM25 shortlisted. In\n   * the eval R@3 sat exactly on that ceiling, so every remaining miss was\n   * an article BM25 never returned. Widening the shortlist does not fix\n   * that — past 30 the extra candidates measurably diluted the ranking.\n   */\n  async findRelevantReranked(\n    query: string,\n    agentId?: string,\n    maxResults = 10,\n    opts: { shortlist?: number; excerptChars?: number } = {},\n  ): Promise<WikiArticle[]> {\n    const shortlist = Math.max(maxResults, opts.shortlist ?? DEFAULT_SHORTLIST)\n    const pool = this.findRelevant(query, agentId, shortlist)\n    if (pool.length < 2) return pool.slice(0, maxResults)\n\n    const candidates: RerankCandidate[] = pool.map((article, i) => ({\n      // Index, not title: titles are not unique across a wiki and a\n      // Choice needs distinct keys.\n      id: `c${i}`,\n      title: article.meta.title || `(untitled ${i})`,\n      tags: article.meta.tags,\n      excerpt: article.content,\n    }))\n\n    const result = await askSeat(\n      WIKI_RERANK_SEAT,\n      rerankState({ query, candidates, excerptChars: opts.excerptChars }),\n      rerankQuestions(candidates),\n      { incumbent: { best: candidates[0].id }, features: { agent: agentId ?? \"unknown\" } },\n    )\n    if (!result || result.mode !== \"active\") return pool.slice(0, maxResults)\n\n    const ranking = toRanking(result.answers as never, candidates)\n    return ranking.ranked\n      .map((id) => pool[Number(id.slice(1))])\n      .filter((a): a is WikiArticle => Boolean(a))\n      .slice(0, maxResults)\n  }\n\n  /**\n   * Find articles relevant to a message (for context injection).\n   *\n   * Scoring:\n   *   - BM25 over title+tags+content (always)\n   *   - + ancestry bonus if the caller classified the message through the\n   *     intent graph and articles carry `graphPath` from a previous classification\n   *\n   * `weights.graph` is scaled against `weights.bm25`. When the caller omits\n   * `messagePath`, retrieval collapses to pure BM25 and matches legacy behavior.\n   */\n  findRelevant(\n    message: string,\n    agentId?: string,\n    maxArticles: number = 3,\n    messagePath?: string[],\n    weights: { graph: number; bm25: number } = { graph: 0.6, bm25: 0.4 },\n  ): WikiArticle[] {\n    const articles: WikiArticle[] = []\n\n    this.walkDir(this.baseDir, (filePath) => {\n      if (!filePath.endsWith(\".md\")) return\n      const relPath = relative(this.baseDir, filePath)\n      if (relPath.startsWith(\"raw/\") || relPath.startsWith(\"_\")) return\n\n      const article = this.readArticle(relPath)\n      if (!article || !this.canRead(article.meta, agentId)) return\n      articles.push(article)\n    })\n\n    if (articles.length === 0) return []\n\n    const docs = articles.map(\n      (a) => `${a.meta.title} ${(a.meta.tags || []).join(\" \")} ${a.content}`,\n    )\n    const cachePath = resolve(this.baseDir, \"_bm25_relevance_cache.json\")\n    const index = buildIndexCached(docs, cachePath)\n    const bm25Scores = scoreAll(message, index)\n\n    // Normalize BM25 so the two signals live on [0,1] before the weighted sum.\n    const maxBm25 = bm25Scores.reduce((m, s) => Math.max(m, s.score), 0) || 1\n    const bm25Map = new Map(bm25Scores.map((s) => [s.docIndex, s.score / maxBm25]))\n\n    const hasGraph = !!(messagePath && messagePath.length > 0)\n    const scored = articles.map((article, i) => {\n      const bm25 = bm25Map.get(i) ?? 0\n      let ancestry = 0\n      if (hasGraph && article.meta.graphPath?.length) {\n        ancestry = ancestryOf(messagePath!, article.meta.graphPath)\n      }\n      // When the caller passed no path, BM25 gets the full weight.\n      const combined = hasGraph\n        ? weights.graph * ancestry + weights.bm25 * bm25\n        : bm25\n      return { article, score: combined }\n    })\n\n    return scored\n      .filter((r) => r.score > 0)\n      .sort((a, b) => b.score - a.score)\n      .slice(0, maxArticles)\n      .map((r) => r.article)\n  }\n\n  /**\n   * Build context string from relevant wiki articles for prompt injection.\n   * Token-efficient: includes title + first ~500 chars of each article.\n   */\n  buildContext(articles: WikiArticle[], maxChars: number = 4000): string {\n    if (articles.length === 0) return \"\"\n\n    const lines: string[] = [\"[Wiki Knowledge]\"]\n\n    let totalChars = 0\n    for (const article of articles) {\n      const header = `\\n## ${article.meta.title} [${(article.meta.tags || []).slice(0, 3).join(\", \")}]`\n      const body = article.content.length > 600\n        ? article.content.slice(0, 600) + \"...\"\n        : article.content\n\n      const chunk = header + \"\\n\" + body\n      if (totalChars + chunk.length > maxChars) break\n\n      lines.push(chunk)\n      totalChars += chunk.length\n    }\n\n    lines.push(\"\\n[End Wiki Knowledge]\")\n    return lines.join(\"\\n\")\n  }\n\n  /**\n   * Rebuild the master index.\n   */\n  rebuildIndex(): WikiIndex {\n    const articles: WikiIndex[\"articles\"] = []\n    const backlinks = new Map<string, number>()\n\n    this.walkDir(this.baseDir, (filePath) => {\n      if (!filePath.endsWith(\".md\")) return\n      const relPath = relative(this.baseDir, filePath)\n      if (relPath.startsWith(\"raw/\") || relPath.startsWith(\"_\")) return\n\n      const article = this.readArticle(relPath)\n      if (!article) return\n\n      // Count wikilinks for backlinks\n      const links = article.content.match(/\\[\\[([^\\]]+)\\]\\]/g) || []\n      for (const link of links) {\n        const target = link.replace(/\\[\\[|\\]\\]/g, \"\")\n        backlinks.set(target, (backlinks.get(target) || 0) + 1)\n      }\n\n      // Extract aliases from title and tags\n      const aliases = [article.meta.title.toLowerCase()]\n      if (article.meta.tags) {\n        aliases.push(...article.meta.tags.map(t => t.toLowerCase()))\n      }\n\n      articles.push({\n        path: relPath,\n        title: article.meta.title,\n        type: article.meta.type,\n        related: article.meta.related,\n        tags: article.meta.tags || [],\n        owner: article.meta.owner,\n        access: article.meta.access,\n        sharedWith: article.meta.sharedWith,\n        aliases,\n        backlinks: backlinks.get(article.meta.title) || 0,\n        sources: article.meta.sources,\n        lastUpdated: article.meta.lastUpdated,\n        graphPath: article.meta.graphPath,\n      })\n    })\n\n    const index: WikiIndex = {\n      articles,\n      lastRebuilt: new Date().toISOString(),\n    }\n\n    // Machine-readable index\n    writeFileSync(\n      resolve(this.baseDir, \"_index.json\"),\n      JSON.stringify(index, null, 2),\n    )\n\n    // Farzapedia-style content catalog at _index.md — the one file the\n    // agentic query reads to pick candidate articles by `type` + title.\n    // Load-bearing in Phase 3; grouped by type, alphabetical within group.\n    this.writeCatalog(articles, index.lastRebuilt)\n\n    // Human-readable WIKI.md — legacy view, grouped by access level.\n    const md = [\"# Wiki Index\", \"\", `Last rebuilt: ${index.lastRebuilt}`, \"\"]\n    const byAccess = new Map<string, typeof articles>()\n    for (const a of articles) {\n      const bucket = a.access || \"public\"\n      const list = byAccess.get(bucket) || []\n      list.push(a)\n      byAccess.set(bucket, list)\n    }\n    for (const [bucket, list] of Array.from(byAccess.entries()).sort()) {\n      md.push(`## ${bucket}`, \"\")\n      for (const a of list.sort((x, y) => x.title.localeCompare(y.title))) {\n        const t = a.type ? ` [${a.type}]` : \"\"\n        md.push(`- [${a.title}](${a.path})${t} — owner: ${a.owner}`)\n      }\n      md.push(\"\")\n    }\n    writeFileSync(resolve(this.baseDir, \"WIKI.md\"), md.join(\"\\n\"))\n\n    this.log(`Index rebuilt: ${articles.length} articles`)\n    this.appendLog(\"rebuild-index\", `${articles.length} articles indexed`)\n    return index\n  }\n\n  /**\n   * Write `_index.md` — the Farzapedia-style content catalog grouped by\n   * article `type`. This is the one file the agentic query (Phase 3) reads\n   * to pick candidate articles before walking the wikilink subgraph.\n   *\n   * Articles without a `type` land in \"Untyped\" at the bottom; the Phase 2\n   * migration backfills those.\n   */\n  private writeCatalog(\n    articles: WikiIndex[\"articles\"],\n    lastRebuilt: string,\n  ): void {\n    const typeOrder: Array<NonNullable<WikiArticleMeta[\"type\"]> | \"untyped\"> = [\n      \"person\", \"project\", \"place\", \"concept\", \"event\", \"decision\", \"pattern\", \"untyped\",\n    ]\n    const typeHeaders: Record<string, string> = {\n      person: \"## People\",\n      project: \"## Projects\",\n      place: \"## Places\",\n      concept: \"## Concepts\",\n      event: \"## Events\",\n      decision: \"## Decisions\",\n      pattern: \"## Patterns\",\n      untyped: \"## Untyped (needs migration)\",\n    }\n\n    const byType = new Map<string, typeof articles>()\n    for (const a of articles) {\n      const bucket = a.type || \"untyped\"\n      const list = byType.get(bucket) || []\n      list.push(a)\n      byType.set(bucket, list)\n    }\n\n    const lines: string[] = [\n      \"# Wiki Content Catalog\",\n      \"\",\n      `_Last rebuilt: ${lastRebuilt}_`,\n      \"\",\n      \"Articles grouped by type. Agentic query walks this file first to pick candidates.\",\n      \"\",\n    ]\n\n    for (const type of typeOrder) {\n      const list = byType.get(type)\n      if (!list || list.length === 0) continue\n      lines.push(typeHeaders[type] || `## ${type}`, \"\")\n      for (const a of list.sort((x, y) => x.title.localeCompare(y.title))) {\n        const access = a.access === \"private\" ? \" (private)\" : a.access === \"shared\" ? \" (shared)\" : \"\"\n        const related = a.related?.length ? ` → [[${a.related.slice(0, 3).join(\"]], [[\")}]]${a.related.length > 3 ? \", …\" : \"\"}` : \"\"\n        lines.push(`- [${a.title}](${a.path})${access}${related}`)\n      }\n      lines.push(\"\")\n    }\n\n    writeFileSync(resolve(this.baseDir, \"_index.md\"), lines.join(\"\\n\"))\n  }\n\n  /**\n   * Get wiki stats.\n   */\n  stats(): {\n    totalArticles: number\n    totalEntries: number\n    articlesByType: Record<string, number>\n    articlesByAccess: Record<string, number>\n    articlesByOwner: Record<string, number>\n  } {\n    let totalArticles = 0\n    const byType: Record<string, number> = {}\n    const byAccess: Record<string, number> = {}\n    const byOwner: Record<string, number> = {}\n\n    this.walkDir(this.baseDir, (filePath) => {\n      if (!filePath.endsWith(\".md\")) return\n      const relPath = relative(this.baseDir, filePath)\n      if (relPath.startsWith(\"raw/\") || relPath.startsWith(\"_\") || relPath === \"WIKI.md\") return\n\n      const article = this.readArticle(relPath)\n      if (!article) return\n\n      totalArticles++\n      for (const tag of (article.meta.tags || [])) {\n        byType[tag] = (byType[tag] || 0) + 1\n      }\n      byAccess[article.meta.access] = (byAccess[article.meta.access] || 0) + 1\n      byOwner[article.meta.owner] = (byOwner[article.meta.owner] || 0) + 1\n    })\n\n    const entryFiles = existsSync(this.rawDir)\n      ? readdirSync(this.rawDir).filter(f => f.endsWith(\".md\")).length\n      : 0\n\n    return {\n      totalArticles,\n      totalEntries: entryFiles,\n      articlesByType: byType,\n      articlesByAccess: byAccess,\n      articlesByOwner: byOwner,\n    }\n  }\n\n  // --- Helpers ---\n\n  // --- Log (chronological, append-only) ---\n\n  /**\n   * Append an entry to log.md.\n   * Format: ## [YYYY-MM-DD HH:MM] action | details\n   */\n  appendLog(action: string, details: string): void {\n    const logPath = resolve(this.baseDir, \"log.md\")\n    const timestamp = new Date().toISOString().replace(\"T\", \" \").slice(0, 16)\n    const entry = `## [${timestamp}] ${action} | ${details}\\n\\n`\n\n    if (!existsSync(logPath)) {\n      writeFileSync(logPath, \"# Wiki Log\\n\\nChronological record of all wiki operations.\\n\\n\")\n    }\n\n    appendFileSync(logPath, entry)\n  }\n\n  /**\n   * Get recent log entries.\n   */\n  getLog(limit: number = 20): string[] {\n    const logPath = resolve(this.baseDir, \"log.md\")\n    if (!existsSync(logPath)) return []\n\n    const content = readFileSync(logPath, \"utf-8\")\n    const entries = content.split(/^## /m).filter(e => e.startsWith(\"[\")).slice(-limit)\n    return entries.map(e => e.trim())\n  }\n\n  // --- Schema ---\n\n  /**\n   * Create _schema.md if it doesn't exist.\n   * This tells the LLM how to operate on the wiki.\n   */\n  private ensureSchema(): void {\n    const schemaPath = resolve(this.baseDir, \"_schema.md\")\n    if (existsSync(schemaPath)) return\n\n    const schema = `# Wiki Schema\n\nA personal wiki maintained by LLMs. Karpathy pattern: plain files, aggressive tagging,\nstructure emerges from data. The wiki is a compounding artifact.\n\n## Structure\n\n\\`\\`\\`\nwiki/\n  _schema.md         # This file\n  worldview.md       # YOUR mental model — the LLM reads this during absorb\n  raw/entries/       # Immutable raw sources (conversations, imports, anything)\n  [LLM-chosen dirs]  # Structure emerges from data — the LLM picks paths\n\\`\\`\\`\n\nThe LLM decides how to organize articles. You describe YOUR world in worldview.md.\n\n## Article Format\n\n\\`\\`\\`yaml\n---\ntitle: \"Staging Deployment Process\"\ntags: [\"deploy\", \"staging\", \"devops\", \"process\", \"2026-04-06\"]\nowner: devops-agent\naccess: public\ncreated: 2026-04-06\nlast_updated: 2026-04-06\nsources: [\"entry-id-1\", \"entry-id-2\"]\n---\n\nArticle content with [[wikilinks]] and section tags.\n\n## Deploy Steps\n<!-- tags: process, runbook, staging -->\nContent specific to this section...\n\\`\\`\\`\n\n## Tags\n\nTags are the primary context-narrowing mechanism. The more tags, the better.\n\nTag aggressively:\n- **Who**: people, agents, teams involved\n- **What**: project, client, topic, technology\n- **When**: dates, periods, milestones\n- **Where**: server, environment, channel\n- **How**: process, decision, pattern\n- **Your terms**: whatever vocabulary makes sense in YOUR world\n\nSection tags (\\`<!-- tags: ... -->\\`) let different parts of an article\nmatch different queries. A deploy article might have sections tagged\n\"runbook\" and \"incident\" separately.\n\n## Operations\n\n### Absorb\nRead raw entries → read worldview.md → tag aggressively → create/update articles.\nAlso identify GAPS: \"We mention X but have no article for it.\"\n\n### Query\nMatch by tags first → then keyword within matched articles → synthesize.\nIf agent is working on a specific project, only send content tagged for that project.\n\n### Lint\nCheck for: orphan articles, broken [[wikilinks]], untagged articles,\narticles over 100 lines that should split, mentioned-but-missing topics.\n\n## Worldview\n\nEdit \\`worldview.md\\` to describe YOUR world. This is not a schema — it's your\nmental model. The LLM reads it during absorb to understand where things go.\n\nExample worldview.md:\n\\`\\`\\`\nI'm the founder of Acme Corp.\nWe build software products.\nOur agents: Marketing Bot, DevOps Bot, Coordinator.\nClients: ClientA (enterprise), ClientB (startup).\nInfrastructure: local dev machine, cloud server.\nWe use GitLab for version control.\n\\`\\`\\`\n`\n\n    writeFileSync(schemaPath, schema)\n    this.log(\"Created _schema.md\")\n  }\n\n  // --- Wikilinks and Backlinks ---\n\n  /**\n   * Extract all [[wikilinks]] from article content.\n   */\n  extractWikilinks(content: string): string[] {\n    const matches = content.match(/\\[\\[([^\\]]+)\\]\\]/g) || []\n    return matches.map(m => m.replace(/\\[\\[|\\]\\]/g, \"\"))\n  }\n\n  /**\n   * Build backlinks index: for each article, which other articles link to it.\n   */\n  buildBacklinks(): Record<string, string[]> {\n    const backlinks: Record<string, string[]> = {}\n\n    this.walkDir(this.baseDir, (filePath) => {\n      if (!filePath.endsWith(\".md\")) return\n      const relPath = relative(this.baseDir, filePath)\n      if (relPath.startsWith(\"raw/\") || relPath.startsWith(\"_\") || relPath === \"WIKI.md\" || relPath === \"log.md\") return\n\n      const content = readFileSync(filePath, \"utf-8\")\n      const links = this.extractWikilinks(content)\n\n      for (const link of links) {\n        if (!backlinks[link]) backlinks[link] = []\n        backlinks[link].push(relPath)\n      }\n    })\n\n    // Save\n    writeFileSync(\n      resolve(this.baseDir, \"_backlinks.json\"),\n      JSON.stringify(backlinks, null, 2),\n    )\n\n    return backlinks\n  }\n\n  /**\n   * Get backlinks for a specific article title.\n   */\n  getBacklinks(title: string): string[] {\n    const path = resolve(this.baseDir, \"_backlinks.json\")\n    if (!existsSync(path)) return []\n    try {\n      const data = JSON.parse(readFileSync(path, \"utf-8\"))\n      return data[title] || []\n    } catch {\n      return []\n    }\n  }\n\n  // --- Tag-based filtering (Karpathy: tags are the context narrowing mechanism) ---\n\n  /**\n   * Find articles matching ANY of the given tags.\n   * This is how agents get relevant context — only articles tagged with\n   * the client/project/topic they're working on.\n   */\n  findByTags(tags: string[], agentId?: string, limit: number = 10): WikiArticle[] {\n    const lowerTags = tags.map(t => t.toLowerCase())\n    const results: Array<{ article: WikiArticle; score: number }> = []\n\n    this.walkDir(this.baseDir, (filePath) => {\n      if (!filePath.endsWith(\".md\")) return\n      const relPath = relative(this.baseDir, filePath)\n      if (relPath.startsWith(\"raw/\") || relPath.startsWith(\"_\")) return\n\n      const article = this.readArticle(relPath)\n      if (!article) return\n      if (agentId && !this.canRead(article.meta, agentId)) return\n\n      // Score: how many of the requested tags match?\n      const articleTags = (article.meta.tags || []).map(t => t.toLowerCase())\n      // Also check section tags: <!-- tags: foo, bar -->\n      const sectionTags = (article.content.match(/<!--\\s*tags?:\\s*([^>]+)\\s*-->/gi) || [])\n        .flatMap(m => m.replace(/<!--\\s*tags?:\\s*|\\s*-->/gi, \"\").split(\",\").map(t => t.trim().toLowerCase()))\n\n      const allTags = [...articleTags, ...sectionTags]\n      const score = lowerTags.filter(t => allTags.includes(t)).length\n\n      if (score > 0) {\n        results.push({ article, score })\n      }\n    })\n\n    return results\n      .sort((a, b) => b.score - a.score)\n      .slice(0, limit)\n      .map(r => r.article)\n  }\n\n  /**\n   * Get all unique tags across all articles.\n   */\n  getAllTags(): Map<string, number> {\n    const tagCounts = new Map<string, number>()\n\n    this.walkDir(this.baseDir, (filePath) => {\n      if (!filePath.endsWith(\".md\")) return\n      const relPath = relative(this.baseDir, filePath)\n      if (relPath.startsWith(\"raw/\") || relPath.startsWith(\"_\")) return\n\n      const article = this.readArticle(relPath)\n      if (!article?.meta.tags) return\n\n      for (const tag of article.meta.tags) {\n        tagCounts.set(tag, (tagCounts.get(tag) || 0) + 1)\n      }\n    })\n\n    return tagCounts\n  }\n\n  // --- Worldview (user's mental model — input to absorb) ---\n\n  /**\n   * Get the worldview file. This is the user's description of their world —\n   * the LLM uses it during absorb to know where things go.\n   * Returns null if not set.\n   */\n  getWorldview(): string | null {\n    const path = resolve(this.baseDir, \"worldview.md\")\n    if (!existsSync(path)) return null\n    return readFileSync(path, \"utf-8\")\n  }\n\n  /**\n   * Set the worldview. The user describes their world: companies, clients,\n   * projects, team, processes. The LLM uses this as context during absorb.\n   */\n  setWorldview(content: string): void {\n    writeFileSync(resolve(this.baseDir, \"worldview.md\"), content)\n    this.appendLog(\"worldview\", \"Updated worldview\")\n  }\n\n  // --- Lint ---\n\n  /**\n   * Run a lint pass on the wiki. Returns issues found.\n   */\n  lint(): Array<{ type: string; article: string; message: string }> {\n    const issues: Array<{ type: string; article: string; message: string }> = []\n    const allTitles = new Set<string>()\n    const allLinks = new Map<string, string[]>() // article -> outbound links\n    const articlePaths = new Map<string, string>() // title -> path\n\n    this.walkDir(this.baseDir, (filePath) => {\n      if (!filePath.endsWith(\".md\")) return\n      const relPath = relative(this.baseDir, filePath)\n      if (relPath.startsWith(\"raw/\") || relPath.startsWith(\"_\") || relPath === \"WIKI.md\" || relPath === \"log.md\") return\n\n      const article = this.readArticle(relPath)\n      if (!article) return\n\n      allTitles.add(article.meta.title)\n      articlePaths.set(article.meta.title, relPath)\n\n      const links = this.extractWikilinks(article.content)\n      allLinks.set(relPath, links)\n\n      // Check: article too long\n      const lines = article.content.split(\"\\n\").length\n      if (lines > 100) {\n        issues.push({\n          type: \"bloated\",\n          article: relPath,\n          message: `${lines} lines — consider splitting`,\n        })\n      }\n\n      // Check: no sources\n      if (!article.meta.sources?.length) {\n        issues.push({\n          type: \"unsourced\",\n          article: relPath,\n          message: \"No sources listed in frontmatter\",\n        })\n      }\n\n      // Check: stub (too short)\n      if (lines < 10 && article.content.trim().length < 100) {\n        issues.push({\n          type: \"stub\",\n          article: relPath,\n          message: \"Very short article — needs enrichment\",\n        })\n      }\n    })\n\n    // Check: broken wikilinks\n    for (const [articlePath, links] of allLinks) {\n      for (const link of links) {\n        if (!allTitles.has(link)) {\n          issues.push({\n            type: \"broken-link\",\n            article: articlePath,\n            message: `[[${link}]] — target article not found`,\n          })\n        }\n      }\n    }\n\n    // Check: orphan articles (no inbound links)\n    const backlinks = this.buildBacklinks()\n    for (const [title, path] of articlePaths) {\n      if (!backlinks[title] || backlinks[title].length === 0) {\n        issues.push({\n          type: \"orphan\",\n          article: path,\n          message: `No other articles link to \"${title}\"`,\n        })\n      }\n    }\n\n    this.appendLog(\"lint\", `Found ${issues.length} issues`)\n    return issues\n  }\n\n  // --- Absorb summary (for automated cron) ---\n\n  /**\n   * Get unabsorbed entries (entries not referenced by any article's sources field).\n   */\n  getUnabsorbedEntries(): WikiEntry[] {\n    const allSources = new Set<string>()\n\n    // Collect all source IDs referenced by articles\n    this.walkDir(this.baseDir, (filePath) => {\n      if (!filePath.endsWith(\".md\")) return\n      const relPath = relative(this.baseDir, filePath)\n      if (relPath.startsWith(\"raw/\") || relPath.startsWith(\"_\")) return\n\n      const article = this.readArticle(relPath)\n      if (article?.meta.sources) {\n        for (const s of article.meta.sources) allSources.add(s)\n      }\n    })\n\n    // Find entries not in any article's sources\n    const entries = this.listEntries()\n    return entries.filter(e => !allSources.has(e.id))\n  }\n\n  /**\n   * Build an absorb prompt for unprocessed entries.\n   * Returns a prompt string an agent can execute to compile entries into articles.\n   */\n  buildAbsorbPrompt(maxEntries: number = 20): string | null {\n    const unabsorbed = this.getUnabsorbedEntries().slice(0, maxEntries)\n    if (unabsorbed.length === 0) return null\n\n    const entrySummaries = unabsorbed.map(e =>\n      `[${e.date} ${e.agentId} via ${e.source}] ${e.content.slice(0, 200)}`\n    ).join(\"\\n\\n\")\n\n    return `/wiki absorb\\n\\nThere are ${unabsorbed.length} unprocessed entries. Read each, understand what it means, and create or update wiki articles.\\n\\n${entrySummaries}`\n  }\n\n  private walkDir(dir: string, callback: (filePath: string, stat?: Stats) => void): void {\n    if (!existsSync(dir)) return\n    for (const entry of readdirSync(dir)) {\n      const full = join(dir, entry)\n      const stat = statSync(full)\n      if (stat.isDirectory()) {\n        this.walkDir(full, callback)\n      } else {\n        callback(full, stat)\n      }\n    }\n  }\n}\n"],"mappings":"kPAAA,OAAS,gBAAAA,EAAc,iBAAAC,EAAe,kBAAAC,EAAgB,cAAAC,EAAY,aAAAC,EAAW,eAAAC,EAAa,YAAAC,MAA4B,KACtH,OAAS,WAAAC,EAAS,QAAAC,EAAM,YAAAC,EAAU,WAAAC,MAAe,OAIjDC,IAyBO,IAAMC,EAAN,KAAgB,CACZ,QACD,OACA,IAER,YACEC,EAAkBC,EAAQ,QAAQ,IAAI,EAAG,cAAc,EACvDC,EAAoC,QAAQ,MAAM,KAAK,QAAS,QAAQ,EACxE,CACA,KAAK,QAAUF,EACf,KAAK,OAASC,EAAQD,EAAS,aAAa,EAC5C,KAAK,IAAME,EAEXC,EAAU,KAAK,OAAQ,CAAE,UAAW,EAAK,CAAC,EAC1CA,EAAUF,EAAQD,EAAS,KAAK,EAAG,CAAE,UAAW,EAAK,CAAC,EAGtD,KAAK,aAAa,CACpB,CAOA,QAAQI,EAA0BC,EAA2B,CAC3D,OAAID,EAAQ,SAAW,SAAiB,GACnCC,EACD,GAAAD,EAAQ,QAAUC,GAClBD,EAAQ,SAAW,UAAYA,EAAQ,YAAY,SAASC,CAAO,GAFlD,EAIvB,CAKA,SAASD,EAA0BC,EAA0B,CAC3D,OAAOD,EAAQ,QAAUC,CAC3B,CAOA,SAASC,EAA0B,CACjC,IAAMC,EAAW,GAAGD,EAAM,QAAQA,EAAM,QAClCE,EAAWP,EAAQ,KAAK,OAAQM,CAAQ,EAExCE,EAAc,CAClB,MACA,OAAOH,EAAM,KACb,SAASA,EAAM,OACf,UAAUA,EAAM,UAChB,WAAWA,EAAM,QACnB,EAEA,GADIA,EAAM,eAAeG,EAAY,KAAK,YAAYH,EAAM,eAAe,EACvEA,EAAM,KACR,OAAW,CAACI,EAAGC,CAAC,IAAK,OAAO,QAAQL,EAAM,IAAI,EAC5CG,EAAY,KAAK,GAAGC,MAAM,KAAK,UAAUC,CAAC,GAAG,EAGjD,OAAAF,EAAY,KAAK,MAAO,GAAIH,EAAM,OAAO,EAEzCM,EAAcJ,EAAUC,EAAY,KAAK;AAAA,CAAI,CAAC,EAC9C,KAAK,UAAU,SAAU,GAAGH,EAAM,WAAWA,EAAM,eAAeA,EAAM,QAAQ,EACzEC,CACT,CAKA,YAAYM,EAA6E,CACvF,GAAI,CAACC,EAAW,KAAK,MAAM,EAAG,MAAO,CAAC,EAEtC,IAAMC,EAAQC,EAAY,KAAK,MAAM,EAAE,OAAOC,GAAKA,EAAE,SAAS,KAAK,CAAC,EAAE,KAAK,EACrEC,EAAuB,CAAC,EAE9B,QAAWC,KAAQJ,EAAO,CACxB,IAAMK,EAAUC,EAAapB,EAAQ,KAAK,OAAQkB,CAAI,EAAG,OAAO,EAC1Db,EAAQ,KAAK,WAAWc,EAASD,CAAI,EACtCb,IAEDO,GAAQ,SAAWP,EAAM,UAAYO,EAAO,SAC5CA,GAAQ,OAASP,EAAM,KAAOO,EAAO,OACrCA,GAAQ,QAAUP,EAAM,KAAOO,EAAO,QAE1CK,EAAQ,KAAKZ,CAAK,GAGpB,OAAOY,CACT,CAEQ,WAAWE,EAAiBb,EAAoC,CACtE,IAAMe,EAAUF,EAAQ,MAAM,mCAAmC,EACjE,GAAI,CAACE,EAAS,OAAO,KAErB,IAAMC,EAAKD,EAAQ,CAAC,EACdE,EAAOF,EAAQ,CAAC,EAAE,KAAK,EAEvBG,EAAOC,GACDH,EAAG,MAAM,IAAI,OAAO,IAAIG,cAAiB,GAAG,CAAC,IAC5C,CAAC,GAAG,KAAK,GAAK,GAWrBC,EAAQ,IAAI,IAAI,CAAC,KAAM,OAAQ,QAAS,SAAU,SAAS,CAAC,EAC5DC,EAAgC,CAAC,EACvC,QAAWC,KAAQN,EAAG,MAAM;AAAA,CAAI,EAAG,CACjC,IAAMO,EAAID,EAAK,MAAM,iBAAiB,EACtC,GAAI,GAACC,GAAKH,EAAM,IAAIG,EAAE,CAAC,CAAC,GACxB,GAAI,CACFF,EAAKE,EAAE,CAAC,CAAC,EAAI,KAAK,MAAMA,EAAE,CAAC,CAAC,CAC9B,MAAE,CACAF,EAAKE,EAAE,CAAC,CAAC,EAAIA,EAAE,CAAC,EAAE,KAAK,CACzB,EAGF,MAAO,CACL,GAAIL,EAAI,IAAI,GAAKlB,EAAS,QAAQ,MAAO,EAAE,EAC3C,KAAMkB,EAAI,MAAM,EAChB,QAASA,EAAI,OAAO,EACpB,OAAQA,EAAI,QAAQ,EACpB,cAAeA,EAAI,SAAS,GAAK,OACjC,QAASD,EACT,KAAM,OAAO,KAAKI,CAAI,EAAE,OAAS,EAAIA,EAAO,MAC9C,CACF,CAOA,aACEG,EACAH,EACAR,EACAf,EACS,CAET,IAAM2B,EAAW,KAAK,YAAYD,CAAI,EACtC,GAAIC,GAAY,CAAC,KAAK,SAASA,EAAS,KAAM3B,CAAO,EACnD,YAAK,IAAI,uBAAuBA,oBAA0B0B,cAAiBC,EAAS,KAAK,QAAQ,EAC1F,GAOLJ,EAAK,MAAQ,CAACK,EAAkBL,EAAK,IAAI,IAC3C,KAAK,IAAI,kCAAkCA,EAAK,cAAcG,+EAA6E,EAC3IH,EAAO,CAAE,GAAGA,EAAM,KAAM,MAAU,GAGpC,IAAMM,EAAWjC,EAAQ,KAAK,QAAS8B,CAAI,EAGvCC,GACF,KAAK,YAAYD,EAAMG,CAAQ,EAGjC/B,EAAUgC,EAAQD,CAAQ,EAAG,CAAE,UAAW,EAAK,CAAC,EAEhD,IAAMzB,EAAc,CAClB,MACA,WAAWmB,EAAK,QAClB,EACIA,EAAK,MAAMnB,EAAY,KAAK,SAASmB,EAAK,MAAM,EAChDA,EAAK,SAAS,QAChBnB,EAAY,KAAK,aAAamB,EAAK,QAAQ,IAAIQ,GAAK,IAAIA,IAAI,EAAE,KAAK,IAAI,IAAI,EAE7E3B,EAAY,KACV,WAAWmB,EAAK,MAAQ,CAAC,GAAG,IAAIQ,GAAK,IAAIA,IAAI,EAAE,KAAK,IAAI,KACxD,UAAUR,EAAK,QACf,WAAWA,EAAK,QAClB,EACIA,EAAK,YAAY,QACnBnB,EAAY,KAAK,iBAAiBmB,EAAK,WAAW,IAAIS,GAAK,IAAIA,IAAI,EAAE,KAAK,IAAI,IAAI,EAEpF5B,EAAY,KACV,YAAYmB,EAAK,UACjB,iBAAiBA,EAAK,cACtB,aAAaA,EAAK,QAAQ,IAAIS,GAAK,IAAIA,IAAI,EAAE,KAAK,IAAI,IACxD,EACIT,EAAK,WAAW,QAClBnB,EAAY,KAAK,gBAAgBmB,EAAK,UAAU,IAAIS,GAAK,IAAIA,IAAI,EAAE,KAAK,IAAI,IAAI,EAElF5B,EAAY,KAAK,MAAO,GAAIW,CAAO,EAEnCR,EAAcsB,EAAUzB,EAAY,KAAK;AAAA,CAAI,CAAC,EAC9C,IAAM6B,EAASN,EAAW,SAAW,SACrC,YAAK,UAAUM,EAAQ,GAAGV,EAAK,WAAWA,EAAK,MAAQ,CAAC,GAAG,MAAM,EAAG,CAAC,EAAE,KAAK,IAAI,SAASvB,QAAc0B,GAAM,EACtG,EACT,CAQQ,YAAYQ,EAAqBL,EAAwB,CAC/D,GAAI,CACF,GAAI,CAACpB,EAAWoB,CAAQ,EAAG,OAC3B,IAAMd,EAAUC,EAAaa,EAAU,OAAO,EACxCM,EAAK,IAAI,KAAK,EAAE,YAAY,EAAE,QAAQ,QAAS,GAAG,EAClDC,EAAaxC,EAAQ,KAAK,QAAS,YAAasC,EAAY,QAAQ,QAAS,EAAE,CAAC,EACtFpC,EAAUsC,EAAY,CAAE,UAAW,EAAK,CAAC,EACzC7B,EAAcX,EAAQwC,EAAY,GAAGD,MAAO,EAAGpB,CAAO,CACxD,MAAE,CAEF,CACF,CAKA,YAAYmB,EAAiE,CAC3E,IAAME,EAAaxC,EAAQ,KAAK,QAAS,YAAasC,EAAY,QAAQ,QAAS,EAAE,CAAC,EACtF,GAAI,CAACzB,EAAW2B,CAAU,EAAG,MAAO,CAAC,EAErC,GAAI,CACF,OAAOzB,EAAYyB,CAAU,EAC1B,OAAOxB,GAAKA,EAAE,SAAS,KAAK,CAAC,EAC7B,KAAK,EACL,QAAQ,EACR,IAAIA,IAAM,CACT,UAAWA,EAAE,QAAQ,QAAS,EAAE,EAAE,QAAQ,KAAM,CAACa,EAAGY,IAAMA,EAAI,GAAMA,IAAM,GAAK,IAAMA,IAAM,IAAMA,IAAM,GAAK,IAAM,IAAOZ,CAAC,EAC1H,KAAM7B,EAAQwC,EAAYxB,CAAC,CAC7B,EAAE,CACN,MAAE,CACA,MAAO,CAAC,CACV,CACF,CAKA,eAAesB,EAAqBI,EAAmC,CAErE,IAAMC,EADW,KAAK,YAAYL,CAAW,EACpB,KAAK5B,GAAKA,EAAE,UAAU,WAAWgC,CAAgB,CAAC,EAC3E,GAAI,CAACC,EAAS,MAAO,GAErB,GAAI,CACF,IAAMxB,EAAUC,EAAauB,EAAQ,KAAM,OAAO,EAC5CV,EAAWjC,EAAQ,KAAK,QAASsC,CAAW,EAElD,YAAK,YAAYA,EAAaL,CAAQ,EACtCtB,EAAcsB,EAAUd,CAAO,EAC/B,KAAK,UAAU,UAAW,GAAGmB,iBAA2BI,GAAkB,EACnE,EACT,MAAE,CACA,MAAO,EACT,CACF,CAKA,YAAYZ,EAAkC,CAC5C,IAAMG,EAAWjC,EAAQ,KAAK,QAAS8B,CAAI,EAC3C,GAAI,CAACjB,EAAWoB,CAAQ,EAAG,OAAO,KAElC,IAAMW,EAAMxB,EAAaa,EAAU,OAAO,EAC1C,OAAO,KAAK,aAAaW,EAAKd,CAAI,CACpC,CAKA,cAAcA,EAAc1B,EAAqC,CAC/D,IAAMD,EAAU,KAAK,YAAY2B,CAAI,EAErC,MADI,CAAC3B,GACD,CAAC,KAAK,QAAQA,EAAQ,KAAMC,CAAO,EAAU,KAC1CD,CACT,CAEQ,aAAayC,EAAad,EAAkC,CAClE,IAAMT,EAAUuB,EAAI,MAAM,mCAAmC,EAC7D,GAAI,CAACvB,EAAS,OAAO,KAErB,IAAMC,EAAKD,EAAQ,CAAC,EACdF,EAAUE,EAAQ,CAAC,EAAE,KAAK,EAE1BG,EAAOC,GACDH,EAAG,MAAM,IAAI,OAAO,IAAIG,cAAiB,GAAG,CAAC,IAC5C,CAAC,GAAG,KAAK,EAAE,QAAQ,WAAY,IAAI,GAAK,GAG/CoB,EAAYpB,GAA0B,CAC1C,IAAMI,EAAIP,EAAG,MAAM,IAAI,OAAO,IAAIG,oBAAuB,GAAG,CAAC,EAC7D,OAAKI,EACEA,EAAE,CAAC,EAAE,MAAM,GAAG,EAAE,IAAIO,GAAKA,EAAE,KAAK,EAAE,QAAQ,WAAY,IAAI,CAAC,EAAE,OAAO,OAAO,EADnE,CAAC,CAElB,EAKMU,EAAUtB,EAAI,MAAM,GAAKA,EAAI,MAAM,EAInCuB,EAHa,IAAI,IAAI,CACzB,SAAU,UAAW,QAAS,UAAW,QAAS,WAAY,SAChE,CAAC,EACuB,IAAID,CAAO,EAAKA,EAAsC,OAExEE,EAAOH,EAAS,MAAM,EAAE,OAAO,CAACnC,EAAG+B,EAAGQ,IAAMvC,GAAKuC,EAAE,QAAQvC,CAAC,IAAM+B,CAAC,EACnES,EAAUL,EAAS,SAAS,EAC5BM,EAAYN,EAAS,YAAY,EACvC,MAAO,CACL,KAAM,CACJ,MAAOrB,EAAI,OAAO,EAClB,KAAAuB,EACA,QAASG,EAAQ,OAASA,EAAU,OACpC,KAAAF,EACA,MAAOxB,EAAI,OAAO,EAClB,OAASA,EAAI,QAAQ,GAAoB,SACzC,WAAYqB,EAAS,aAAa,EAClC,QAASrB,EAAI,SAAS,EACtB,YAAaA,EAAI,cAAc,EAC/B,QAASqB,EAAS,SAAS,EAC3B,UAAWM,EAAU,OAASA,EAAY,MAC5C,EACA,QAAAhC,EACA,KAAAW,CACF,CACF,CAWQ,UAAY,IAAI,IAExB,aAAa1B,EAAgC,CAC3C,IAAMgD,EAAqB,CAAC,EACtBC,EAAgB,CAAC,EACvB,KAAK,QAAQ,KAAK,QAAS,CAACC,EAAUC,IAAS,CAC7C,GAAI,CAACD,EAAS,SAAS,KAAK,EAAG,OAC/B,IAAME,EAAUC,EAAS,KAAK,QAASH,CAAQ,EAC3CE,EAAQ,WAAW,MAAM,GAAKA,EAAQ,WAAW,GAAG,IACxDJ,EAAS,KAAKI,CAAO,EACrBH,EAAI,KAAK,GAAGG,KAAWD,GAAM,SAAW,OAAOA,GAAM,MAAQ,KAAK,EACpE,CAAC,EACD,IAAMG,EAAYL,EAAI,KAAK,GAAG,EACxBM,EAAM,KAAK,UAAU,IAAIvD,CAAO,EACtC,GAAIuD,GAAOA,EAAI,YAAcD,EAAW,OAAOC,EAAI,SAAS,MAAM,EAElE,IAAMC,EAA0B,CAAC,EACjC,QAAWJ,KAAWJ,EAAU,CAC9B,IAAMjD,EAAU,KAAK,YAAYqD,CAAO,EACpCrD,GAAW,KAAK,QAAQA,EAAQ,KAAMC,CAAO,GAC/CwD,EAAS,KAAKzD,CAAO,EAGzB,YAAK,UAAU,IAAIC,EAAS,CAAE,UAAAsD,EAAW,SAAAE,CAAS,CAAC,EAC5CA,EAAS,MAAM,CACxB,CAKA,OAAOC,EAAezD,EAAiB0D,EAAqB,GAAmB,CAC7E,IAAMC,EAAaF,EAAM,YAAY,EAC/BD,EAA0B,CAAC,EAYjC,GAVA,KAAK,QAAQ,KAAK,QAAUN,GAAa,CACvC,GAAI,CAACA,EAAS,SAAS,KAAK,EAAG,OAC/B,IAAME,EAAUC,EAAS,KAAK,QAASH,CAAQ,EAC/C,GAAIE,EAAQ,WAAW,MAAM,GAAKA,EAAQ,WAAW,GAAG,EAAG,OAE3D,IAAMrD,EAAU,KAAK,YAAYqD,CAAO,EACpC,CAACrD,GAAW,CAAC,KAAK,QAAQA,EAAQ,KAAMC,CAAO,GACnDwD,EAAS,KAAKzD,CAAO,CACvB,CAAC,EAEGyD,EAAS,SAAW,EAAG,MAAO,CAAC,EAGnC,IAAMI,EAAOJ,EAAS,IAAKX,GAAMA,EAAE,OAAO,EACpCgB,EAAYjE,EAAQ,KAAK,QAAS,kBAAkB,EACpDkE,EAAQC,EAAiBH,EAAMC,CAAS,EACxCG,EAAaC,EAASR,EAAOK,CAAK,EAClCI,EAAW,IAAI,IAAIF,EAAW,IAAKG,GAAM,CAACA,EAAE,SAAUA,EAAE,KAAK,CAAC,CAAC,EAUrE,OARgBX,EAAS,IAAI,CAACzD,EAASsC,IAAM,CAC3C,IAAI+B,EAAQF,EAAS,IAAI7B,CAAC,GAAK,EAE/B,OAAItC,EAAQ,KAAK,MAAM,YAAY,EAAE,SAAS4D,CAAU,IAAGS,GAAS,IAChErE,EAAQ,KAAK,MAAM,KAAKgC,GAAKA,EAAE,YAAY,EAAE,SAAS4B,CAAU,CAAC,IAAGS,GAAS,GAC1E,CAAE,QAAArE,EAAS,MAAAqE,CAAM,CAC1B,CAAC,EAGE,OAAQD,GAAMA,EAAE,MAAQ,CAAC,EACzB,KAAK,CAACtB,EAAGwB,IAAMA,EAAE,MAAQxB,EAAE,KAAK,EAChC,MAAM,EAAGa,CAAU,EACnB,IAAKS,GAAMA,EAAE,OAAO,CACzB,CAsBA,MAAM,qBACJV,EACAzD,EACA0D,EAAa,GACbY,EAAsD,CAAC,EAC/B,CACxB,IAAMC,EAAY,KAAK,IAAIb,EAAYY,EAAK,WAAaE,CAAiB,EACpEC,EAAO,KAAK,aAAahB,EAAOzD,EAASuE,CAAS,EACxD,GAAIE,EAAK,OAAS,EAAG,OAAOA,EAAK,MAAM,EAAGf,CAAU,EAEpD,IAAMgB,EAAgCD,EAAK,IAAI,CAAC1E,EAASsC,KAAO,CAG9D,GAAI,IAAIA,IACR,MAAOtC,EAAQ,KAAK,OAAS,aAAasC,KAC1C,KAAMtC,EAAQ,KAAK,KACnB,QAASA,EAAQ,OACnB,EAAE,EAEI4E,EAAS,MAAMC,EACnBC,EACAC,EAAY,CAAE,MAAArB,EAAO,WAAAiB,EAAY,aAAcJ,EAAK,YAAa,CAAC,EAClES,EAAgBL,CAAU,EAC1B,CAAE,UAAW,CAAE,KAAMA,EAAW,CAAC,EAAE,EAAG,EAAG,SAAU,CAAE,MAAO1E,GAAW,SAAU,CAAE,CACrF,EACA,MAAI,CAAC2E,GAAUA,EAAO,OAAS,SAAiBF,EAAK,MAAM,EAAGf,CAAU,EAExDsB,EAAUL,EAAO,QAAkBD,CAAU,EAC9C,OACZ,IAAKO,GAAOR,EAAK,OAAOQ,EAAG,MAAM,CAAC,CAAC,CAAC,CAAC,EACrC,OAAQpC,GAAwB,EAAQA,CAAE,EAC1C,MAAM,EAAGa,CAAU,CACxB,CAaA,aACEwB,EACAlF,EACAmF,EAAsB,EACtBC,EACAC,EAA2C,CAAE,MAAO,GAAK,KAAM,EAAI,EACpD,CACf,IAAM7B,EAA0B,CAAC,EAYjC,GAVA,KAAK,QAAQ,KAAK,QAAUN,GAAa,CACvC,GAAI,CAACA,EAAS,SAAS,KAAK,EAAG,OAC/B,IAAME,EAAUC,EAAS,KAAK,QAASH,CAAQ,EAC/C,GAAIE,EAAQ,WAAW,MAAM,GAAKA,EAAQ,WAAW,GAAG,EAAG,OAE3D,IAAMrD,EAAU,KAAK,YAAYqD,CAAO,EACpC,CAACrD,GAAW,CAAC,KAAK,QAAQA,EAAQ,KAAMC,CAAO,GACnDwD,EAAS,KAAKzD,CAAO,CACvB,CAAC,EAEGyD,EAAS,SAAW,EAAG,MAAO,CAAC,EAEnC,IAAMI,EAAOJ,EAAS,IACnBX,GAAM,GAAGA,EAAE,KAAK,UAAUA,EAAE,KAAK,MAAQ,CAAC,GAAG,KAAK,GAAG,KAAKA,EAAE,SAC/D,EACMgB,EAAYjE,EAAQ,KAAK,QAAS,4BAA4B,EAC9DkE,EAAQC,EAAiBH,EAAMC,CAAS,EACxCG,EAAaC,EAASiB,EAASpB,CAAK,EAGpCwB,EAAUtB,EAAW,OAAO,CAACvC,EAAGO,IAAM,KAAK,IAAIP,EAAGO,EAAE,KAAK,EAAG,CAAC,GAAK,EAClEuD,EAAU,IAAI,IAAIvB,EAAW,IAAKhC,GAAM,CAACA,EAAE,SAAUA,EAAE,MAAQsD,CAAO,CAAC,CAAC,EAExEE,EAAW,CAAC,EAAEJ,GAAeA,EAAY,OAAS,GAcxD,OAbe5B,EAAS,IAAI,CAACzD,EAASsC,IAAM,CAC1C,IAAMoD,EAAOF,EAAQ,IAAIlD,CAAC,GAAK,EAC3BqD,EAAW,EACXF,GAAYzF,EAAQ,KAAK,WAAW,SACtC2F,EAAWC,EAAWP,EAAcrF,EAAQ,KAAK,SAAS,GAG5D,IAAM6F,EAAWJ,EACbH,EAAQ,MAAQK,EAAWL,EAAQ,KAAOI,EAC1CA,EACJ,MAAO,CAAE,QAAA1F,EAAS,MAAO6F,CAAS,CACpC,CAAC,EAGE,OAAQzB,GAAMA,EAAE,MAAQ,CAAC,EACzB,KAAK,CAACtB,EAAGwB,IAAMA,EAAE,MAAQxB,EAAE,KAAK,EAChC,MAAM,EAAGsC,CAAW,EACpB,IAAKhB,GAAMA,EAAE,OAAO,CACzB,CAMA,aAAaX,EAAyBqC,EAAmB,IAAc,CACrE,GAAIrC,EAAS,SAAW,EAAG,MAAO,GAElC,IAAMsC,EAAkB,CAAC,kBAAkB,EAEvCC,EAAa,EACjB,QAAWhG,KAAWyD,EAAU,CAC9B,IAAMwC,EAAS;AAAA,KAAQjG,EAAQ,KAAK,WAAWA,EAAQ,KAAK,MAAQ,CAAC,GAAG,MAAM,EAAG,CAAC,EAAE,KAAK,IAAI,KACvFoB,EAAOpB,EAAQ,QAAQ,OAAS,IAClCA,EAAQ,QAAQ,MAAM,EAAG,GAAG,EAAI,MAChCA,EAAQ,QAENkG,EAAQD,EAAS;AAAA,EAAO7E,EAC9B,GAAI4E,EAAaE,EAAM,OAASJ,EAAU,MAE1CC,EAAM,KAAKG,CAAK,EAChBF,GAAcE,EAAM,OAGtB,OAAAH,EAAM,KAAK;AAAA,qBAAwB,EAC5BA,EAAM,KAAK;AAAA,CAAI,CACxB,CAKA,cAA0B,CACxB,IAAMtC,EAAkC,CAAC,EACnC0C,EAAY,IAAI,IAEtB,KAAK,QAAQ,KAAK,QAAUhD,GAAa,CACvC,GAAI,CAACA,EAAS,SAAS,KAAK,EAAG,OAC/B,IAAME,EAAUC,EAAS,KAAK,QAASH,CAAQ,EAC/C,GAAIE,EAAQ,WAAW,MAAM,GAAKA,EAAQ,WAAW,GAAG,EAAG,OAE3D,IAAMrD,EAAU,KAAK,YAAYqD,CAAO,EACxC,GAAI,CAACrD,EAAS,OAGd,IAAMoG,EAAQpG,EAAQ,QAAQ,MAAM,mBAAmB,GAAK,CAAC,EAC7D,QAAWqG,KAAQD,EAAO,CACxB,IAAME,EAASD,EAAK,QAAQ,aAAc,EAAE,EAC5CF,EAAU,IAAIG,GAASH,EAAU,IAAIG,CAAM,GAAK,GAAK,CAAC,EAIxD,IAAMC,EAAU,CAACvG,EAAQ,KAAK,MAAM,YAAY,CAAC,EAC7CA,EAAQ,KAAK,MACfuG,EAAQ,KAAK,GAAGvG,EAAQ,KAAK,KAAK,IAAIgC,GAAKA,EAAE,YAAY,CAAC,CAAC,EAG7DyB,EAAS,KAAK,CACZ,KAAMJ,EACN,MAAOrD,EAAQ,KAAK,MACpB,KAAMA,EAAQ,KAAK,KACnB,QAASA,EAAQ,KAAK,QACtB,KAAMA,EAAQ,KAAK,MAAQ,CAAC,EAC5B,MAAOA,EAAQ,KAAK,MACpB,OAAQA,EAAQ,KAAK,OACrB,WAAYA,EAAQ,KAAK,WACzB,QAAAuG,EACA,UAAWJ,EAAU,IAAInG,EAAQ,KAAK,KAAK,GAAK,EAChD,QAASA,EAAQ,KAAK,QACtB,YAAaA,EAAQ,KAAK,YAC1B,UAAWA,EAAQ,KAAK,SAC1B,CAAC,CACH,CAAC,EAED,IAAM+D,EAAmB,CACvB,SAAAN,EACA,YAAa,IAAI,KAAK,EAAE,YAAY,CACtC,EAGAjD,EACEX,EAAQ,KAAK,QAAS,aAAa,EACnC,KAAK,UAAUkE,EAAO,KAAM,CAAC,CAC/B,EAKA,KAAK,aAAaN,EAAUM,EAAM,WAAW,EAG7C,IAAMyC,EAAK,CAAC,eAAgB,GAAI,iBAAiBzC,EAAM,cAAe,EAAE,EAClE0C,EAAW,IAAI,IACrB,QAAW3D,KAAKW,EAAU,CACxB,IAAMiD,EAAS5D,EAAE,QAAU,SACrB6D,EAAOF,EAAS,IAAIC,CAAM,GAAK,CAAC,EACtCC,EAAK,KAAK7D,CAAC,EACX2D,EAAS,IAAIC,EAAQC,CAAI,EAE3B,OAAW,CAACD,EAAQC,CAAI,IAAK,MAAM,KAAKF,EAAS,QAAQ,CAAC,EAAE,KAAK,EAAG,CAClED,EAAG,KAAK,MAAME,IAAU,EAAE,EAC1B,QAAW5D,KAAK6D,EAAK,KAAK,CAACC,EAAGC,IAAMD,EAAE,MAAM,cAAcC,EAAE,KAAK,CAAC,EAAG,CACnE,IAAM7E,EAAIc,EAAE,KAAO,KAAKA,EAAE,QAAU,GACpC0D,EAAG,KAAK,MAAM1D,EAAE,UAAUA,EAAE,QAAQd,mBAAcc,EAAE,OAAO,EAE7D0D,EAAG,KAAK,EAAE,EAEZ,OAAAhG,EAAcX,EAAQ,KAAK,QAAS,SAAS,EAAG2G,EAAG,KAAK;AAAA,CAAI,CAAC,EAE7D,KAAK,IAAI,kBAAkB/C,EAAS,iBAAiB,EACrD,KAAK,UAAU,gBAAiB,GAAGA,EAAS,yBAAyB,EAC9DM,CACT,CAUQ,aACNN,EACAqD,EACM,CACN,IAAMC,EAAqE,CACzE,SAAU,UAAW,QAAS,UAAW,QAAS,WAAY,UAAW,SAC3E,EACMC,EAAsC,CAC1C,OAAQ,YACR,QAAS,cACT,MAAO,YACP,QAAS,cACT,MAAO,YACP,SAAU,eACV,QAAS,cACT,QAAS,8BACX,EAEMC,EAAS,IAAI,IACnB,QAAWnE,KAAKW,EAAU,CACxB,IAAMiD,EAAS5D,EAAE,MAAQ,UACnB6D,EAAOM,EAAO,IAAIP,CAAM,GAAK,CAAC,EACpCC,EAAK,KAAK7D,CAAC,EACXmE,EAAO,IAAIP,EAAQC,CAAI,EAGzB,IAAMZ,EAAkB,CACtB,yBACA,GACA,kBAAkBe,KAClB,GACA,oFACA,EACF,EAEA,QAAWlE,KAAQmE,EAAW,CAC5B,IAAMJ,EAAOM,EAAO,IAAIrE,CAAI,EAC5B,GAAI,GAAC+D,GAAQA,EAAK,SAAW,GAC7B,CAAAZ,EAAM,KAAKiB,EAAYpE,CAAI,GAAK,MAAMA,IAAQ,EAAE,EAChD,QAAWE,KAAK6D,EAAK,KAAK,CAACC,EAAGC,IAAMD,EAAE,MAAM,cAAcC,EAAE,KAAK,CAAC,EAAG,CACnE,IAAMK,EAASpE,EAAE,SAAW,UAAY,aAAeA,EAAE,SAAW,SAAW,YAAc,GACvFC,EAAUD,EAAE,SAAS,OAAS,aAAQA,EAAE,QAAQ,MAAM,EAAG,CAAC,EAAE,KAAK,QAAQ,MAAMA,EAAE,QAAQ,OAAS,EAAI,WAAQ,KAAO,GAC3HiD,EAAM,KAAK,MAAMjD,EAAE,UAAUA,EAAE,QAAQoE,IAASnE,GAAS,EAE3DgD,EAAM,KAAK,EAAE,GAGfvF,EAAcX,EAAQ,KAAK,QAAS,WAAW,EAAGkG,EAAM,KAAK;AAAA,CAAI,CAAC,CACpE,CAKA,OAME,CACA,IAAIoB,EAAgB,EACdF,EAAiC,CAAC,EAClCR,EAAmC,CAAC,EACpCW,EAAkC,CAAC,EAEzC,KAAK,QAAQ,KAAK,QAAUjE,GAAa,CACvC,GAAI,CAACA,EAAS,SAAS,KAAK,EAAG,OAC/B,IAAME,EAAUC,EAAS,KAAK,QAASH,CAAQ,EAC/C,GAAIE,EAAQ,WAAW,MAAM,GAAKA,EAAQ,WAAW,GAAG,GAAKA,IAAY,UAAW,OAEpF,IAAMrD,EAAU,KAAK,YAAYqD,CAAO,EACxC,GAAKrD,EAEL,CAAAmH,IACA,QAAWE,KAAQrH,EAAQ,KAAK,MAAQ,CAAC,EACvCiH,EAAOI,CAAG,GAAKJ,EAAOI,CAAG,GAAK,GAAK,EAErCZ,EAASzG,EAAQ,KAAK,MAAM,GAAKyG,EAASzG,EAAQ,KAAK,MAAM,GAAK,GAAK,EACvEoH,EAAQpH,EAAQ,KAAK,KAAK,GAAKoH,EAAQpH,EAAQ,KAAK,KAAK,GAAK,GAAK,EACrE,CAAC,EAED,IAAMsH,EAAa5G,EAAW,KAAK,MAAM,EACrCE,EAAY,KAAK,MAAM,EAAE,OAAOC,GAAKA,EAAE,SAAS,KAAK,CAAC,EAAE,OACxD,EAEJ,MAAO,CACL,cAAAsG,EACA,aAAcG,EACd,eAAgBL,EAChB,iBAAkBR,EAClB,gBAAiBW,CACnB,CACF,CAUA,UAAUlF,EAAgBqF,EAAuB,CAC/C,IAAMC,EAAU3H,EAAQ,KAAK,QAAS,QAAQ,EAExCK,EAAQ,OADI,IAAI,KAAK,EAAE,YAAY,EAAE,QAAQ,IAAK,GAAG,EAAE,MAAM,EAAG,EAAE,MACrCgC,OAAYqF;AAAA;AAAA,EAE1C7G,EAAW8G,CAAO,GACrBhH,EAAcgH,EAAS;AAAA;AAAA;AAAA;AAAA,CAAgE,EAGzFC,EAAeD,EAAStH,CAAK,CAC/B,CAKA,OAAOwH,EAAgB,GAAc,CACnC,IAAMF,EAAU3H,EAAQ,KAAK,QAAS,QAAQ,EAC9C,OAAKa,EAAW8G,CAAO,EAEPvG,EAAauG,EAAS,OAAO,EACrB,MAAM,OAAO,EAAE,OAAOG,GAAKA,EAAE,WAAW,GAAG,CAAC,EAAE,MAAM,CAACD,CAAK,EACnE,IAAIC,GAAKA,EAAE,KAAK,CAAC,EAJC,CAAC,CAKpC,CAQQ,cAAqB,CAC3B,IAAMC,EAAa/H,EAAQ,KAAK,QAAS,YAAY,EACrD,GAAIa,EAAWkH,CAAU,EAAG,OAqF5BpH,EAAcoH,EAnFC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,CAmFiB,EAChC,KAAK,IAAI,oBAAoB,CAC/B,CAOA,iBAAiB5G,EAA2B,CAE1C,OADgBA,EAAQ,MAAM,mBAAmB,GAAK,CAAC,GACxC,IAAIU,GAAKA,EAAE,QAAQ,aAAc,EAAE,CAAC,CACrD,CAKA,gBAA2C,CACzC,IAAMyE,EAAsC,CAAC,EAE7C,YAAK,QAAQ,KAAK,QAAUhD,GAAa,CACvC,GAAI,CAACA,EAAS,SAAS,KAAK,EAAG,OAC/B,IAAME,EAAUC,EAAS,KAAK,QAASH,CAAQ,EAC/C,GAAIE,EAAQ,WAAW,MAAM,GAAKA,EAAQ,WAAW,GAAG,GAAKA,IAAY,WAAaA,IAAY,SAAU,OAE5G,IAAMrC,EAAUC,EAAakC,EAAU,OAAO,EACxCiD,EAAQ,KAAK,iBAAiBpF,CAAO,EAE3C,QAAWqF,KAAQD,EACZD,EAAUE,CAAI,IAAGF,EAAUE,CAAI,EAAI,CAAC,GACzCF,EAAUE,CAAI,EAAE,KAAKhD,CAAO,CAEhC,CAAC,EAGD7C,EACEX,EAAQ,KAAK,QAAS,iBAAiB,EACvC,KAAK,UAAUsG,EAAW,KAAM,CAAC,CACnC,EAEOA,CACT,CAKA,aAAa0B,EAAyB,CACpC,IAAMlG,EAAO9B,EAAQ,KAAK,QAAS,iBAAiB,EACpD,GAAI,CAACa,EAAWiB,CAAI,EAAG,MAAO,CAAC,EAC/B,GAAI,CAEF,OADa,KAAK,MAAMV,EAAaU,EAAM,OAAO,CAAC,EACvCkG,CAAK,GAAK,CAAC,CACzB,MAAE,CACA,MAAO,CAAC,CACV,CACF,CASA,WAAWhF,EAAgB5C,EAAkByH,EAAgB,GAAmB,CAC9E,IAAMI,EAAYjF,EAAK,IAAIb,GAAKA,EAAE,YAAY,CAAC,EACzC+F,EAA0D,CAAC,EAEjE,YAAK,QAAQ,KAAK,QAAU5E,GAAa,CACvC,GAAI,CAACA,EAAS,SAAS,KAAK,EAAG,OAC/B,IAAME,EAAUC,EAAS,KAAK,QAASH,CAAQ,EAC/C,GAAIE,EAAQ,WAAW,MAAM,GAAKA,EAAQ,WAAW,GAAG,EAAG,OAE3D,IAAMrD,EAAU,KAAK,YAAYqD,CAAO,EAExC,GADI,CAACrD,GACDC,GAAW,CAAC,KAAK,QAAQD,EAAQ,KAAMC,CAAO,EAAG,OAGrD,IAAM+H,GAAehI,EAAQ,KAAK,MAAQ,CAAC,GAAG,IAAIgC,GAAKA,EAAE,YAAY,CAAC,EAEhEiG,GAAejI,EAAQ,QAAQ,MAAM,iCAAiC,GAAK,CAAC,GAC/E,QAAQ0B,GAAKA,EAAE,QAAQ,4BAA6B,EAAE,EAAE,MAAM,GAAG,EAAE,IAAIM,GAAKA,EAAE,KAAK,EAAE,YAAY,CAAC,CAAC,EAEhGkG,EAAU,CAAC,GAAGF,EAAa,GAAGC,CAAW,EACzC5D,EAAQyD,EAAU,OAAO9F,GAAKkG,EAAQ,SAASlG,CAAC,CAAC,EAAE,OAErDqC,EAAQ,GACV0D,EAAQ,KAAK,CAAE,QAAA/H,EAAS,MAAAqE,CAAM,CAAC,CAEnC,CAAC,EAEM0D,EACJ,KAAK,CAACjF,EAAGwB,IAAMA,EAAE,MAAQxB,EAAE,KAAK,EAChC,MAAM,EAAG4E,CAAK,EACd,IAAItD,GAAKA,EAAE,OAAO,CACvB,CAKA,YAAkC,CAChC,IAAM+D,EAAY,IAAI,IAEtB,YAAK,QAAQ,KAAK,QAAUhF,GAAa,CACvC,GAAI,CAACA,EAAS,SAAS,KAAK,EAAG,OAC/B,IAAME,EAAUC,EAAS,KAAK,QAASH,CAAQ,EAC/C,GAAIE,EAAQ,WAAW,MAAM,GAAKA,EAAQ,WAAW,GAAG,EAAG,OAE3D,IAAMrD,EAAU,KAAK,YAAYqD,CAAO,EACxC,GAAKrD,GAAS,KAAK,KAEnB,QAAWqH,KAAOrH,EAAQ,KAAK,KAC7BmI,EAAU,IAAId,GAAMc,EAAU,IAAId,CAAG,GAAK,GAAK,CAAC,CAEpD,CAAC,EAEMc,CACT,CASA,cAA8B,CAC5B,IAAMxG,EAAO9B,EAAQ,KAAK,QAAS,cAAc,EACjD,OAAKa,EAAWiB,CAAI,EACbV,EAAaU,EAAM,OAAO,EADH,IAEhC,CAMA,aAAaX,EAAuB,CAClCR,EAAcX,EAAQ,KAAK,QAAS,cAAc,EAAGmB,CAAO,EAC5D,KAAK,UAAU,YAAa,mBAAmB,CACjD,CAOA,MAAkE,CAChE,IAAMoH,EAAoE,CAAC,EACrEC,EAAY,IAAI,IAChBC,EAAW,IAAI,IACfC,EAAe,IAAI,IAEzB,KAAK,QAAQ,KAAK,QAAUpF,GAAa,CACvC,GAAI,CAACA,EAAS,SAAS,KAAK,EAAG,OAC/B,IAAME,EAAUC,EAAS,KAAK,QAASH,CAAQ,EAC/C,GAAIE,EAAQ,WAAW,MAAM,GAAKA,EAAQ,WAAW,GAAG,GAAKA,IAAY,WAAaA,IAAY,SAAU,OAE5G,IAAMrD,EAAU,KAAK,YAAYqD,CAAO,EACxC,GAAI,CAACrD,EAAS,OAEdqI,EAAU,IAAIrI,EAAQ,KAAK,KAAK,EAChCuI,EAAa,IAAIvI,EAAQ,KAAK,MAAOqD,CAAO,EAE5C,IAAM+C,EAAQ,KAAK,iBAAiBpG,EAAQ,OAAO,EACnDsI,EAAS,IAAIjF,EAAS+C,CAAK,EAG3B,IAAML,EAAQ/F,EAAQ,QAAQ,MAAM;AAAA,CAAI,EAAE,OACtC+F,EAAQ,KACVqC,EAAO,KAAK,CACV,KAAM,UACN,QAAS/E,EACT,QAAS,GAAG0C,mCACd,CAAC,EAIE/F,EAAQ,KAAK,SAAS,QACzBoI,EAAO,KAAK,CACV,KAAM,YACN,QAAS/E,EACT,QAAS,kCACX,CAAC,EAIC0C,EAAQ,IAAM/F,EAAQ,QAAQ,KAAK,EAAE,OAAS,KAChDoI,EAAO,KAAK,CACV,KAAM,OACN,QAAS/E,EACT,QAAS,4CACX,CAAC,CAEL,CAAC,EAGD,OAAW,CAAClB,EAAaiE,CAAK,IAAKkC,EACjC,QAAWjC,KAAQD,EACZiC,EAAU,IAAIhC,CAAI,GACrB+B,EAAO,KAAK,CACV,KAAM,cACN,QAASjG,EACT,QAAS,KAAKkE,qCAChB,CAAC,EAMP,IAAMF,EAAY,KAAK,eAAe,EACtC,OAAW,CAAC0B,EAAOlG,CAAI,IAAK4G,GACtB,CAACpC,EAAU0B,CAAK,GAAK1B,EAAU0B,CAAK,EAAE,SAAW,IACnDO,EAAO,KAAK,CACV,KAAM,SACN,QAASzG,EACT,QAAS,8BAA8BkG,IACzC,CAAC,EAIL,YAAK,UAAU,OAAQ,SAASO,EAAO,eAAe,EAC/CA,CACT,CAOA,sBAAoC,CAClC,IAAMI,EAAa,IAAI,IAGvB,YAAK,QAAQ,KAAK,QAAUrF,GAAa,CACvC,GAAI,CAACA,EAAS,SAAS,KAAK,EAAG,OAC/B,IAAME,EAAUC,EAAS,KAAK,QAASH,CAAQ,EAC/C,GAAIE,EAAQ,WAAW,MAAM,GAAKA,EAAQ,WAAW,GAAG,EAAG,OAE3D,IAAMrD,EAAU,KAAK,YAAYqD,CAAO,EACxC,GAAIrD,GAAS,KAAK,QAChB,QAAW,KAAKA,EAAQ,KAAK,QAASwI,EAAW,IAAI,CAAC,CAE1D,CAAC,EAGe,KAAK,YAAY,EAClB,OAAOb,GAAK,CAACa,EAAW,IAAIb,EAAE,EAAE,CAAC,CAClD,CAMA,kBAAkBc,EAAqB,GAAmB,CACxD,IAAMC,EAAa,KAAK,qBAAqB,EAAE,MAAM,EAAGD,CAAU,EAClE,GAAIC,EAAW,SAAW,EAAG,OAAO,KAEpC,IAAMC,EAAiBD,EAAW,IAAIf,GACpC,IAAIA,EAAE,QAAQA,EAAE,eAAeA,EAAE,WAAWA,EAAE,QAAQ,MAAM,EAAG,GAAG,GACpE,EAAE,KAAK;AAAA;AAAA,CAAM,EAEb,MAAO;AAAA;AAAA,YAA6Be,EAAW;AAAA;AAAA,EAA2GC,GAC5J,CAEQ,QAAQC,EAAaC,EAA0D,CACrF,GAAKnI,EAAWkI,CAAG,EACnB,QAAW1I,KAASU,EAAYgI,CAAG,EAAG,CACpC,IAAME,EAAOC,EAAKH,EAAK1I,CAAK,EACtBkD,EAAO4F,EAASF,CAAI,EACtB1F,EAAK,YAAY,EACnB,KAAK,QAAQ0F,EAAMD,CAAQ,EAE3BA,EAASC,EAAM1F,CAAI,EAGzB,CACF","names":["readFileSync","writeFileSync","appendFileSync","existsSync","mkdirSync","readdirSync","statSync","resolve","join","relative","dirname","init_seat","WikiStore","baseDir","resolve","log","mkdirSync","article","agentId","entry","filename","filepath","frontmatter","k","v","writeFileSync","filter","existsSync","files","readdirSync","f","entries","file","content","readFileSync","fmMatch","fm","body","get","key","KNOWN","meta","line","m","path","existing","isWikiArticleType","fullPath","dirname","t","s","action","articlePath","ts","versionDir","i","versionTimestamp","version","raw","getArray","rawType","type","tags","a","related","graphPath","relPaths","sig","filePath","stat","relPath","relative","signature","hit","articles","query","maxResults","queryLower","docs","cachePath","index","buildIndexCached","bm25Scores","scoreAll","scoreMap","r","score","b","opts","shortlist","DEFAULT_SHORTLIST","pool","candidates","result","askSeat","WIKI_RERANK_SEAT","rerankState","rerankQuestions","toRanking","id","message","maxArticles","messagePath","weights","maxBm25","bm25Map","hasGraph","bm25","ancestry","ancestryScore","combined","maxChars","lines","totalChars","header","chunk","backlinks","links","link","target","aliases","md","byAccess","bucket","list","x","y","lastRebuilt","typeOrder","typeHeaders","byType","access","totalArticles","byOwner","tag","entryFiles","details","logPath","appendFileSync","limit","e","schemaPath","title","lowerTags","results","articleTags","sectionTags","allTags","tagCounts","issues","allTitles","allLinks","articlePaths","allSources","maxEntries","unabsorbed","entrySummaries","dir","callback","full","join","statSync"]}

package/dist/{chunk-FGFDPYL4.js → chunk-P2RYUODK.js}

@@ -1,2 +1,2 @@
-import{v as l,w}from"./chunk-E7OACKES.js";import{a as i,f as p}from"./chunk-72SZI2UW.js";w();p();var d="task-tier";function u(e){return{task:f(e.message,2e3),agent:e.agent,channel:e.channel??null,continuesExistingSession:e.isFollowUp??!1,...e.toolsAvailable?{toolsAvailable:e.toolsAvailable}:{}}}var c={needsFlagship:i("This task needs the strongest available model to be done correctly.",{true:"Doing it well takes real reasoning: writing or reviewing code, diagnosing a failure, planning work across several steps, weighing a judgement, handling money, touching production or anything irreversible, following a long or ambiguous instruction, or work where being subtly wrong would not be noticed. Anything where a weaker model would produce something that LOOKS right belongs here.",false:"It is mechanical and its result is obvious on sight: acknowledging or confirming a message, restating or formatting something already written, a greeting, a status echo, reading one file and reporting what it says, a lookup with one right answer, a scheduled heartbeat with nothing to decide."})};function g(e){return e.needsFlagship.noul}function f(e,n){return e.length>n?`${e.slice(0,n)}\u2026`:e}var h=.2,m=60*60*1e3;function F(e,n){if(e==="claude-code"){let t=n?.cheapModels?.[e]??n?.cheapModel;return t&&/^(claude-|haiku$|sonnet$|opus$)/.test(t)?t:void 0}if(e==="codex-cli"){let t=n?.cheapModels?.[e];return t&&/^(gpt-|o\d)/.test(t)?t:void 0}}async function M(e){let n=(o,r=null)=>({downgraded:!1,needsFlagship:r,reason:o});if(e.channel==="voice"||e.channel==="desktop"||e.channel==="opencode")return n(`${e.channel} requests retain the configured model`);if(!e.cheapModel)return n("no cheaper model configured");if(e.isFollowUp){let o=e.sessionIdleMs??0,r=e.cacheTtlMs??m;if(o<r)return n(`follow-up on a warm cache (idle ${Math.round(o/1e3)}s) \u2014 swapping would cost more than it saves`)}let t;try{t=await l(d,u(e),c,{incumbent:{needsFlagship:1},features:{agent:e.agent,channel:e.channel??"unknown"}})}catch{return n("routing seat threw \u2014 keeping the flagship")}if(!t)return n("routing seat unavailable \u2014 keeping the flagship");let s=g(t.answers);if(t.mode!=="active")return n(`shadow \u2014 would ${s<(e.threshold??h)?"downgrade":"keep"} (${s.toFixed(2)})`,s);let a=e.threshold??h;return s>=a?n(`needs the flagship (${s.toFixed(2)})`,s):{model:e.cheapModel,downgraded:!0,needsFlagship:s,reason:`mechanical task (${s.toFixed(2)} below ${a}) \u2192 ${e.cheapModel}`}}export{F as a,M as b};
-//# sourceMappingURL=chunk-FGFDPYL4.js.map
+import{v as l,w}from"./chunk-BBIWAJRX.js";import{a as i,f as p}from"./chunk-72SZI2UW.js";w();p();var d="task-tier";function u(e){return{task:m(e.message,2e3),agent:e.agent,channel:e.channel??null,continuesExistingSession:e.isFollowUp??!1,...e.toolsAvailable?{toolsAvailable:e.toolsAvailable}:{}}}var c={needsFlagship:i("This task needs the strongest available model to be done correctly.",{true:"Doing it well takes real reasoning: writing or reviewing code, diagnosing a failure, planning work across several steps, weighing a judgement, handling money, touching production or anything irreversible, following a long or ambiguous instruction, or work where being subtly wrong would not be noticed. Anything where a weaker model would produce something that LOOKS right belongs here.",false:"It is mechanical and its result is obvious on sight: acknowledging or confirming a message, restating or formatting something already written, a greeting, a status echo, reading one file and reporting what it says, a lookup with one right answer, a scheduled heartbeat with nothing to decide."})};function g(e){return e.needsFlagship.noul}function m(e,n){return e.length>n?`${e.slice(0,n)}\u2026`:e}var h=.2,T=60*60*1e3;function F(e,n){if(e==="claude-code"){let t=n?.cheapModels?.[e]??n?.cheapModel;return t&&/^(claude-|haiku$|sonnet$|opus$)/.test(t)?t:void 0}if(e==="codex-cli"){let t=n?.cheapModels?.[e];return t&&/^(gpt-|o\d)/.test(t)?t:void 0}}async function _(e){let n=(s,r=null)=>({downgraded:!1,needsFlagship:r,reason:s});if(e.channel==="voice"||e.channel==="desktop"||e.channel==="opencode")return n(`${e.channel} requests retain the configured model`);if(!e.cheapModel)return n("no cheaper model configured");if(e.isFollowUp){let s=e.sessionIdleMs??0,r=e.cacheTtlMs??T;if(s<r)return n(`follow-up on a warm cache (idle ${Math.round(s/1e3)}s) \u2014 swapping would cost more than it saves`)}let t;try{t=await l(d,u(e),c,{incumbent:{needsFlagship:1},features:{agent:e.agent,channel:e.channel??"unknown"},timeoutMs:1500})}catch{return n("routing seat threw \u2014 keeping the flagship")}if(!t)return n("routing seat unavailable \u2014 keeping the flagship");let o=g(t.answers);if(t.mode!=="active")return n(`shadow \u2014 would ${o<(e.threshold??h)?"downgrade":"keep"} (${o.toFixed(2)})`,o);let a=e.threshold??h;return o>=a?n(`needs the flagship (${o.toFixed(2)})`,o):{model:e.cheapModel,downgraded:!0,needsFlagship:o,reason:`mechanical task (${o.toFixed(2)} below ${a}) \u2192 ${e.cheapModel}`}}export{F as a,_ as b};
+//# sourceMappingURL=chunk-P2RYUODK.js.map

package/dist/chunk-P2RYUODK.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/agents/routing.ts","../src/decisions/seats/task-tier.ts"],"sourcesContent":["import { askSeat } from \"@/decisions/seat\"\nimport { PRE_SPAWN_SEAT_TIMEOUT_MS } from \"@/decisions/limits\"\nimport {\n  TASK_TIER_SEAT,\n  taskTierQuestions,\n  taskTierState,\n  needsFlagship,\n  type TaskTierAnswers,\n  type TaskTierInput,\n} from \"@/decisions/seats/task-tier\"\n\n// Picking a cheaper model for work that does not need an expensive one.\n//\n// The policy, in one line: keep the flagship unless the seat is ACTIVE and\n// confidently says the task is mechanical.\n//\n// Every branch that is not that leads to the flagship — seat off, seat in\n// shadow, backend unreachable, answer above the threshold, no cheap model\n// configured, a follow-up turn. That is not defensiveness for its own\n// sake. Downgrading is invisible in the output: the reply still arrives,\n// still reads fluently, and is simply worse in ways nobody checks. An\n// outage that silently made the whole fleet dumber would cost far more\n// than the tokens it saved, so the failure has to land on the expensive\n// side.\n//\n// Follow-ups are where this gets interesting, and the answer is\n// arithmetic rather than caution.\n//\n// Switching models mid-session is mechanically trivial — the session is a\n// transcript and the model is a per-invocation flag, which is exactly what\n// Claude Code's /model does. The cost is that the PROMPT CACHE IS PER\n// MODEL. Resuming on a different model means that model has no cache for\n// the transcript and reads all of it at full price.\n//\n// Published rates, opus-5 against haiku-4.5:\n//\n//   opus cached read   $0.50/M        haiku uncached read  $1.00/M\n//   opus output       $25.00/M        haiku output          $5.00/M\n//\n// So the swap costs 2x more on input and saves $20/M on output, and it is\n// cheaper only when\n//\n//   session_tokens < 40 x reply_tokens\n//\n// A task worth downgrading is by definition one whose answer is short —\n// an acknowledgement, a status echo. Ten tokens of reply puts the\n// break-even at a 400-token session. On any real conversation the swap\n// LOSES, and it loses precisely on the traffic this seat exists to catch.\n//\n// That reverses once the cache is COLD. After the cache TTL there is no\n// cached read to give up: opus pays $5.00/M and haiku $1.00/M, and the\n// cheap model wins outright. So a follow-up is routable exactly when the\n// session has been idle long enough that nothing is cached any more.\n\n/** Below this P(needs the strongest model), a cheaper one will do.\n *\n *  Low on purpose. This is not the point at which a small model becomes\n *  adequate — it is the point past which being wrong is cheap, and the\n *  asymmetry between \"saved a fraction of a cent\" and \"gave a subtly wrong\n *  answer nobody caught\" is not close. */\nconst DOWNGRADE_BELOW = 0.2\n\n/** How long a cached prefix is assumed to live. Anthropic's default TTL is\n *  five minutes with a one-hour option; an hour is assumed here because it\n *  is the assumption whose error is cheap — see the note above. */\nconst CACHE_TTL_MS = 60 * 60 * 1000\n\n/** Resolve only models compatible with the agent's CLI engine. An omitted\n *  model leaves the agent on its configured default. */\nexport function cheapModelForEngine(\n  tier: string,\n  routing?: { cheapModel?: string; cheapModels?: { \"claude-code\"?: string; \"codex-cli\"?: string } },\n): string | undefined {\n  if (tier === \"claude-code\") {\n    const model = routing?.cheapModels?.[tier] ?? routing?.cheapModel\n    return model && /^(claude-|haiku$|sonnet$|opus$)/.test(model) ? model : undefined\n  }\n  if (tier === \"codex-cli\") {\n    const model = routing?.cheapModels?.[tier]\n    return model && /^(gpt-|o\\d)/.test(model) ? model : undefined\n  }\n  return undefined\n}\n\nexport interface RouteResult {\n  /** The model to use, or undefined to leave the agent's own default. */\n  model?: string\n  /** True when this call moved the task off the flagship. */\n  downgraded: boolean\n  /** P(needs the strongest model), or null when nothing was asked. */\n  needsFlagship: number | null\n  reason: string\n}\n\nexport interface RouteOptions extends TaskTierInput {\n  /** The model to drop to. Usually from config; no downgrade without it. */\n  cheapModel?: string | null\n  threshold?: number\n  /** Idle time on the session being resumed, or null when starting fresh.\n   *  Only consulted for follow-ups. */\n  sessionIdleMs?: number | null\n  /** How long a cached prefix is assumed to survive. */\n  cacheTtlMs?: number\n}\n\n/**\n * Decide whether this task can run on a cheaper model.\n *\n * Never throws and never blocks: a routing decision must not be able to\n * stop a task from running.\n */\nexport async function routeTaskModel(opts: RouteOptions): Promise<RouteResult> {\n  const keep = (reason: string, p: number | null = null): RouteResult => ({\n    downgraded: false, needsFlagship: p, reason,\n  })\n\n  // The person picked this agent's model: in the desktop app, or as\n  // agentx/<agent> in OpenCode's model menu. Downgrading it is overriding them.\n  if (opts.channel === \"voice\" || opts.channel === \"desktop\" || opts.channel === \"opencode\") {\n    return keep(`${opts.channel} requests retain the configured model`)\n  }\n\n  if (!opts.cheapModel) return keep(\"no cheaper model configured\")\n\n  // A follow-up onto a WARM cache is the losing case above. Idle longer\n  // than the TTL and there is nothing left to lose, so it is routable.\n  //\n  // One hour, not the five-minute default, because the assumption has to\n  // be the one that fails safely: over-estimating how long the cache lives\n  // means occasionally keeping the flagship when a swap would have been\n  // free, while under-estimating means routinely paying double on input.\n  if (opts.isFollowUp) {\n    const idle = opts.sessionIdleMs ?? 0\n    const ttl = opts.cacheTtlMs ?? CACHE_TTL_MS\n    if (idle < ttl) {\n      return keep(`follow-up on a warm cache (idle ${Math.round(idle / 1000)}s) — swapping would cost more than it saves`)\n    }\n  }\n\n  let result\n  try {\n    result = await askSeat(\n      TASK_TIER_SEAT,\n      taskTierState(opts),\n      taskTierQuestions,\n      {\n        // The incumbent is \"always flagship\", which is what this has to beat.\n        incumbent: { needsFlagship: 1 },\n        features: { agent: opts.agent, channel: opts.channel ?? \"unknown\" },\n        // Pre-spawn: without this the backend default (30s) bounded the\n        // wait, and the step was seen taking minutes under load.\n        timeoutMs: PRE_SPAWN_SEAT_TIMEOUT_MS,\n      },\n    )\n  } catch {\n    return keep(\"routing seat threw — keeping the flagship\")\n  }\n\n  if (!result) return keep(\"routing seat unavailable — keeping the flagship\")\n\n  const p = needsFlagship(result.answers as TaskTierAnswers)\n\n  // Shadow records the answer and changes nothing. This is the whole\n  // point of a soak: the rows accumulate against real traffic while the\n  // incumbent stays authoritative, so promotion is a decision made on\n  // evidence rather than on how good the idea sounded.\n  if (result.mode !== \"active\") {\n    return keep(`shadow — would ${p < (opts.threshold ?? DOWNGRADE_BELOW) ? \"downgrade\" : \"keep\"} (${p.toFixed(2)})`, p)\n  }\n\n  const threshold = opts.threshold ?? DOWNGRADE_BELOW\n  if (p >= threshold) return keep(`needs the flagship (${p.toFixed(2)})`, p)\n\n  return {\n    model: opts.cheapModel,\n    downgraded: true,\n    needsFlagship: p,\n    reason: `mechanical task (${p.toFixed(2)} below ${threshold}) → ${opts.cheapModel}`,\n  }\n}\n","import { noul } from \"../questions\"\nimport type { AnswersFor, NoulAnswer, StateValue } from \"../types\"\n\n// Whether a task needs the flagship model.\n//\n// Every claude-code agent on both nodes runs claude-opus-5. Much of what\n// they actually do is not hard: acknowledging a message, reading a file\n// and saying what is in it, restating a status, routing a mention. Those\n// turns cost flagship rates for work a small model finishes correctly.\n//\n// A single Noul, not a Choice over model names, and that is deliberate.\n// The models available differ per node, per tier and per provider, and a\n// Choice whose options are a fleet's current model list is a decision that\n// silently changes meaning every time someone edits config. The question\n// that stays stable is about the TASK: does this need the strongest model\n// available. Mapping that answer onto a specific model is policy, and\n// policy belongs in code where it can be read.\n//\n// Direction of failure is the whole design. A seat is fail-open by\n// contract — askSeat returns null when it is off or unreachable — and here\n// \"open\" must mean KEEP THE FLAGSHIP. A missing answer that quietly\n// downgrades a model would turn an outage into silently worse work across\n// the fleet, which is far more expensive than the tokens it saved. So the\n// caller only ever downgrades on an explicit, confident \"no\".\n\nexport const TASK_TIER_SEAT = \"task-tier\"\n\nexport interface TaskTierInput {\n  /** The task, in the words it arrived in. */\n  message: string\n  agent: string\n  /** Where it came from — a cron heartbeat and a customer message are not\n   *  the same kind of work even when they read alike. */\n  channel?: string | null\n  /** True when this continues an existing session. A follow-up inherits\n   *  the difficulty of what it is following up on, and switching models\n   *  mid-conversation is its own hazard. */\n  isFollowUp?: boolean\n  /** Tools the agent could reach for. A task that will touch production\n   *  is not a cheap task however simply it is phrased. */\n  toolsAvailable?: number\n}\n\nexport function taskTierState(input: TaskTierInput): StateValue {\n  return {\n    task: clip(input.message, 2000),\n    agent: input.agent,\n    channel: input.channel ?? null,\n    continuesExistingSession: input.isFollowUp ?? false,\n    ...(input.toolsAvailable ? { toolsAvailable: input.toolsAvailable } : {}),\n  }\n}\n\nexport const taskTierQuestions = {\n  needsFlagship: noul(\n    \"This task needs the strongest available model to be done correctly.\",\n    {\n      true:\n        \"Doing it well takes real reasoning: writing or reviewing code, diagnosing a failure, planning work across several steps, weighing a judgement, handling money, touching production or anything irreversible, following a long or ambiguous instruction, or work where being subtly wrong would not be noticed. Anything where a weaker model would produce something that LOOKS right belongs here.\",\n      false:\n        \"It is mechanical and its result is obvious on sight: acknowledging or confirming a message, restating or formatting something already written, a greeting, a status echo, reading one file and reporting what it says, a lookup with one right answer, a scheduled heartbeat with nothing to decide.\",\n    },\n  ),\n}\n\nexport type TaskTierAnswers = AnswersFor<typeof taskTierQuestions>\n\nexport function needsFlagship(answers: TaskTierAnswers): number {\n  return (answers.needsFlagship as NoulAnswer).noul\n}\n\nfunction clip(s: string, max: number): string {\n  return s.length > max ? `${s.slice(0, max)}…` : s\n}\n"],"mappings":"yFAAAA,ICAAC,IAyBO,IAAMC,EAAiB,YAkBvB,SAASC,EAAcC,EAAkC,CAC9D,MAAO,CACL,KAAMC,EAAKD,EAAM,QAAS,GAAI,EAC9B,MAAOA,EAAM,MACb,QAASA,EAAM,SAAW,KAC1B,yBAA0BA,EAAM,YAAc,GAC9C,GAAIA,EAAM,eAAiB,CAAE,eAAgBA,EAAM,cAAe,EAAI,CAAC,CACzE,CACF,CAEO,IAAME,EAAoB,CAC/B,cAAeC,EACb,sEACA,CACE,KACE,sYACF,MACE,sSACJ,CACF,CACF,EAIO,SAASC,EAAcC,EAAkC,CAC9D,OAAQA,EAAQ,cAA6B,IAC/C,CAEA,SAASJ,EAAKK,EAAWC,EAAqB,CAC5C,OAAOD,EAAE,OAASC,EAAM,GAAGD,EAAE,MAAM,EAAGC,CAAG,UAAOD,CAClD,CDbA,IAAME,EAAkB,GAKlBC,EAAe,GAAK,GAAK,IAIxB,SAASC,EACdC,EACAC,EACoB,CACpB,GAAID,IAAS,cAAe,CAC1B,IAAME,EAAQD,GAAS,cAAcD,CAAI,GAAKC,GAAS,WACvD,OAAOC,GAAS,kCAAkC,KAAKA,CAAK,EAAIA,EAAQ,OAE1E,GAAIF,IAAS,YAAa,CACxB,IAAME,EAAQD,GAAS,cAAcD,CAAI,EACzC,OAAOE,GAAS,cAAc,KAAKA,CAAK,EAAIA,EAAQ,OAGxD,CA6BA,eAAsBC,EAAeC,EAA0C,CAC7E,IAAMC,EAAO,CAACC,EAAgBC,EAAmB,QAAuB,CACtE,WAAY,GAAO,cAAeA,EAAG,OAAAD,CACvC,GAIA,GAAIF,EAAK,UAAY,SAAWA,EAAK,UAAY,WAAaA,EAAK,UAAY,WAC7E,OAAOC,EAAK,GAAGD,EAAK,8CAA8C,EAGpE,GAAI,CAACA,EAAK,WAAY,OAAOC,EAAK,6BAA6B,EAS/D,GAAID,EAAK,WAAY,CACnB,IAAMI,EAAOJ,EAAK,eAAiB,EAC7BK,EAAML,EAAK,YAAcN,EAC/B,GAAIU,EAAOC,EACT,OAAOJ,EAAK,mCAAmC,KAAK,MAAMG,EAAO,GAAI,mDAA8C,EAIvH,IAAIE,EACJ,GAAI,CACFA,EAAS,MAAMC,EACbC,EACAC,EAAcT,CAAI,EAClBU,EACA,CAEE,UAAW,CAAE,cAAe,CAAE,EAC9B,SAAU,CAAE,MAAOV,EAAK,MAAO,QAASA,EAAK,SAAW,SAAU,EAGlE,UAAW,IACb,CACF,CACF,MAAE,CACA,OAAOC,EAAK,gDAA2C,CACzD,CAEA,GAAI,CAACK,EAAQ,OAAOL,EAAK,sDAAiD,EAE1E,IAAME,EAAIQ,EAAcL,EAAO,OAA0B,EAMzD,GAAIA,EAAO,OAAS,SAClB,OAAOL,EAAK,uBAAkBE,GAAKH,EAAK,WAAaP,GAAmB,YAAc,WAAWU,EAAE,QAAQ,CAAC,KAAMA,CAAC,EAGrH,IAAMS,EAAYZ,EAAK,WAAaP,EACpC,OAAIU,GAAKS,EAAkBX,EAAK,uBAAuBE,EAAE,QAAQ,CAAC,KAAMA,CAAC,EAElE,CACL,MAAOH,EAAK,WACZ,WAAY,GACZ,cAAeG,EACf,OAAQ,oBAAoBA,EAAE,QAAQ,CAAC,WAAWS,aAAgBZ,EAAK,YACzE,CACF","names":["init_seat","init_questions","TASK_TIER_SEAT","taskTierState","input","clip","taskTierQuestions","noul","needsFlagship","answers","s","max","DOWNGRADE_BELOW","CACHE_TTL_MS","cheapModelForEngine","tier","routing","model","routeTaskModel","opts","keep","reason","p","idle","ttl","result","askSeat","TASK_TIER_SEAT","taskTierState","taskTierQuestions","needsFlagship","threshold"]}