agentic-qe 3.11.2 → 3.11.4

package/dist/cli/chunks/{validate-swarm-5LUQYHPP.js → validate-swarm-QD3LYPUF.js}

@@ -1,5 +1,5 @@
-import{createRequire as __cr}from"module";const require=__cr(import.meta.url);if(process.argv.includes('--version')||process.argv.includes('-v')){console.log("3.11.2");process.exit(0)}
-import{a as i,b as k,c as d,d as p}from"./chunk-S6BWEZKK.js";import"./chunk-YGR54EAA.js";import{a as v}from"./chunk-XY4JS3IZ.js";import{a as h}from"./chunk-3ATEYGVD.js";import"./chunk-NZNXEEZR.js";import"./chunk-MN6W7ZNL.js";import"./chunk-ZBJMVWQR.js";import"./chunk-PFDILSVO.js";import"./chunk-26ZMIYSK.js";import"./chunk-H3LGBH4Y.js";import"./chunk-P7MIOTVP.js";import"./chunk-ZWMXF6AX.js";import"./chunk-P3VRXQ3H.js";import"./chunk-4PYJCIRO.js";import"./chunk-Y4M2HMPR.js";import"./chunk-72VVTMEL.js";import"./chunk-5BDVFFYF.js";import"./chunk-JCH2FHJ7.js";import"./chunk-LY6PTRVL.js";import"./chunk-IXYF5BZY.js";import"./chunk-QZLTIGLB.js";import"./chunk-FYY7OJ6Y.js";import"./chunk-76RO2RHG.js";import"./chunk-AZQ6HDPM.js";import"./chunk-Z2QNTRUX.js";import"./chunk-6SOGYNJG.js";import"./chunk-7MKF52GT.js";import"./chunk-XY2B2BEJ.js";import"./chunk-AINAWVGD.js";import"./chunk-NIW4CLN2.js";import"./chunk-UCXW24HY.js";import"./chunk-WKIYYF3G.js";import"./chunk-LIEA5EON.js";import{Command as x}from"commander";import o from"chalk";function j(e,t,n){let c=new x("validate").description("Validation commands for skills and agents");return c.command("swarm").description("Validate skills in parallel using Claude Flow swarms (ADR-056)").option("-s, --skills <skills>",'Comma-separated list of skills to validate, or "all" for P0 skills',"all").option("-m, --models <models>","Comma-separated list of models to validate against",p.join(",")).option("-t, --topology <topology>","Swarm topology: hierarchical or mesh","hierarchical").option("--max-concurrent <number>","Maximum concurrent skill validations",String(i.maxConcurrentSkills)).option("--max-models <number>","Maximum concurrent models per skill",String(i.maxConcurrentModels)).option("--timeout <ms>","Timeout per validation in milliseconds",String(i.timeout)).option("--no-retry","Disable retries on failure").option("-v, --verbose","Show detailed output").option("--json","Output results as JSON").action(async l=>{if(await n())try{console.log(o.blue(`
+import{createRequire as __cr}from"module";const require=__cr(import.meta.url);if(process.argv.includes('--version')||process.argv.includes('-v')){console.log("3.11.4");process.exit(0)}
+import{a as i,b as k,c as d,d as p}from"./chunk-D6CKKNYC.js";import"./chunk-SL3SNOO2.js";import{a as v}from"./chunk-VO6YJGB4.js";import{a as h}from"./chunk-EONKMHKO.js";import"./chunk-4JFH3MVA.js";import"./chunk-TU6YN43Q.js";import"./chunk-3FJZMQJ7.js";import"./chunk-NFJT7XXR.js";import"./chunk-BRLUNIR4.js";import"./chunk-QSDIY3E2.js";import"./chunk-IF3HPQNV.js";import"./chunk-YKSWC7I4.js";import"./chunk-54B6P2WS.js";import"./chunk-TPMBFARK.js";import"./chunk-LW5DHT3Z.js";import"./chunk-XXRTWG7O.js";import"./chunk-6GYGAW53.js";import"./chunk-LLUPRGOR.js";import"./chunk-VJGHRWMH.js";import"./chunk-NSPCZPTB.js";import"./chunk-O7PVZ32A.js";import"./chunk-PEIQDQXN.js";import"./chunk-BMQDELPA.js";import"./chunk-TCWR6TDN.js";import"./chunk-YUHM72VQ.js";import"./chunk-PQUXFSN6.js";import"./chunk-7AWK43JN.js";import"./chunk-VCUCD3B5.js";import"./chunk-QJ5NCYJ3.js";import"./chunk-TQ373GGI.js";import"./chunk-7QTB5XIQ.js";import"./chunk-7ADD2ZQL.js";import"./chunk-Y4AXOHW4.js";import{Command as x}from"commander";import o from"chalk";function j(e,t,n){let c=new x("validate").description("Validation commands for skills and agents");return c.command("swarm").description("Validate skills in parallel using Claude Flow swarms (ADR-056)").option("-s, --skills <skills>",'Comma-separated list of skills to validate, or "all" for P0 skills',"all").option("-m, --models <models>","Comma-separated list of models to validate against",p.join(",")).option("-t, --topology <topology>","Swarm topology: hierarchical or mesh","hierarchical").option("--max-concurrent <number>","Maximum concurrent skill validations",String(i.maxConcurrentSkills)).option("--max-models <number>","Maximum concurrent models per skill",String(i.maxConcurrentModels)).option("--timeout <ms>","Timeout per validation in milliseconds",String(i.timeout)).option("--no-retry","Disable retries on failure").option("-v, --verbose","Show detailed output").option("--json","Output results as JSON").action(async l=>{if(await n())try{console.log(o.blue(`
  Swarm Skill Validation
 `));let r=l.skills==="all"?[...d]:l.skills.split(",").map(y=>y.trim()),u=l.models.split(",").map(y=>y.trim()),g=P(l.topology),a={topology:g,maxConcurrentSkills:parseInt(l.maxConcurrent,10)||i.maxConcurrentSkills,maxConcurrentModels:parseInt(l.maxModels,10)||i.maxConcurrentModels,timeout:parseInt(l.timeout,10)||i.timeout,continueOnFailure:!0,retry:l.retry!==!1?i.retry:void 0};l.verbose&&(console.log(o.gray("Configuration:")),console.log(o.gray(`  Topology: ${a.topology}`)),console.log(o.gray(`  Skills: ${r.length}`)),console.log(o.gray(`  Models: ${u.length}`)),console.log(o.gray(`  Max Concurrent Skills: ${a.maxConcurrentSkills}`)),console.log(o.gray(`  Max Concurrent Models: ${a.maxConcurrentModels}`)),console.log(o.gray(`  Timeout: ${a.timeout}ms`)),console.log(o.gray(`  Retry: ${a.retry?"enabled":"disabled"}`)),console.log("")),console.log(o.cyan(`  Skills: ${r.join(", ")}`)),console.log(o.cyan(`  Models: ${u.join(", ")}`)),console.log(o.cyan(`  Topology: ${g}`)),console.log("");let m=await R(e),f=h(m),C=k(a,f),$=Date.now();console.log(o.yellow(`  Starting parallel validation...
 `));let b=await C.validateSkillsParallel(r,u),s=C.getSummary(b),w=Date.now()-$;l.json?T(s):D(s,l.verbose),console.log(o.blue(`

package/dist/cli/chunks/{vibium-MJJDANDL.js → vibium-2J3H2ITD.js}

@@ -1,2 +1,2 @@
-import{createRequire as __cr}from"module";const require=__cr(import.meta.url);if(process.argv.includes('--version')||process.argv.includes('-v')){console.log("3.11.2");process.exit(0)}
-import{c as t}from"./chunk-LIEA5EON.js";import{createRequire as o}from"module";var i,e,a,c,l,p,s,m,u,d,A,f,h,_,b,v,L,n=t(()=>{i=o(import.meta.url),e=i("vibium"),a=e,{RuvectorLayer:c,TensorCompress:l,differentiableSearch:p,hierarchicalForward:s,getCompressionLevel:m,init:u,FlashAttention:d,DotProductAttention:A,MultiHeadAttention:f,HyperbolicAttention:h,LinearAttention:_,MoEAttention:b,SonaEngine:v,pipeline:L}=e||{}});n();export{A as DotProductAttention,d as FlashAttention,h as HyperbolicAttention,_ as LinearAttention,b as MoEAttention,f as MultiHeadAttention,c as RuvectorLayer,v as SonaEngine,l as TensorCompress,a as default,p as differentiableSearch,m as getCompressionLevel,s as hierarchicalForward,u as init,L as pipeline};
+import{createRequire as __cr}from"module";const require=__cr(import.meta.url);if(process.argv.includes('--version')||process.argv.includes('-v')){console.log("3.11.4");process.exit(0)}
+import{c as t}from"./chunk-Y4AXOHW4.js";import{createRequire as o}from"module";var i,e,a,c,l,p,s,m,u,d,A,f,h,_,b,v,L,n=t(()=>{i=o(import.meta.url),e=i("vibium"),a=e,{RuvectorLayer:c,TensorCompress:l,differentiableSearch:p,hierarchicalForward:s,getCompressionLevel:m,init:u,FlashAttention:d,DotProductAttention:A,MultiHeadAttention:f,HyperbolicAttention:h,LinearAttention:_,MoEAttention:b,SonaEngine:v,pipeline:L}=e||{}});n();export{A as DotProductAttention,d as FlashAttention,h as HyperbolicAttention,_ as LinearAttention,b as MoEAttention,f as MultiHeadAttention,c as RuvectorLayer,v as SonaEngine,l as TensorCompress,a as default,p as differentiableSearch,m as getCompressionLevel,s as hierarchicalForward,u as init,L as pipeline};

package/dist/cli/chunks/visual-security-MPUG5HPI.js

@@ -0,0 +1,2 @@
+import{createRequire as __cr}from"module";const require=__cr(import.meta.url);if(process.argv.includes('--version')||process.argv.includes('-v')){console.log("3.11.4");process.exit(0)}
+import{a}from"./chunk-A4OMK3FO.js";import"./chunk-ZSA6V5FH.js";import"./chunk-IQBZBUP5.js";import"./chunk-TPMBFARK.js";import"./chunk-LW5DHT3Z.js";import"./chunk-XXRTWG7O.js";import"./chunk-6GYGAW53.js";import"./chunk-LLUPRGOR.js";import"./chunk-VJGHRWMH.js";import"./chunk-NSPCZPTB.js";import"./chunk-PEIQDQXN.js";import"./chunk-BMQDELPA.js";import"./chunk-ICCTQ5LO.js";import"./chunk-TCWR6TDN.js";import"./chunk-YUHM72VQ.js";import"./chunk-PQUXFSN6.js";import"./chunk-7AWK43JN.js";import"./chunk-VCUCD3B5.js";import"./chunk-QJ5NCYJ3.js";import"./chunk-TQ373GGI.js";import"./chunk-7QTB5XIQ.js";import"./chunk-7ADD2ZQL.js";import"./chunk-Y4AXOHW4.js";export{a as VisualSecurityTool};

package/dist/cli/chunks/{web-tree-sitter-5TF4UGB3.js → web-tree-sitter-KRNUOGKI.js}

@@ -1,2 +1,2 @@
-import{createRequire as __cr}from"module";const require=__cr(import.meta.url);if(process.argv.includes('--version')||process.argv.includes('-v')){console.log("3.11.2");process.exit(0)}
-import"./chunk-LIEA5EON.js";import{createRequire as t}from"module";var o=t(import.meta.url),e=o("web-tree-sitter"),i=e,{RuvectorLayer:n,TensorCompress:a,differentiableSearch:c,hierarchicalForward:s,getCompressionLevel:l,init:p,FlashAttention:m,DotProductAttention:u,MultiHeadAttention:d,HyperbolicAttention:A,LinearAttention:f,MoEAttention:h,SonaEngine:_,pipeline:b}=e||{};export{u as DotProductAttention,m as FlashAttention,A as HyperbolicAttention,f as LinearAttention,h as MoEAttention,d as MultiHeadAttention,n as RuvectorLayer,_ as SonaEngine,a as TensorCompress,i as default,c as differentiableSearch,l as getCompressionLevel,s as hierarchicalForward,p as init,b as pipeline};
+import{createRequire as __cr}from"module";const require=__cr(import.meta.url);if(process.argv.includes('--version')||process.argv.includes('-v')){console.log("3.11.4");process.exit(0)}
+import"./chunk-Y4AXOHW4.js";import{createRequire as t}from"module";var o=t(import.meta.url),e=o("web-tree-sitter"),i=e,{RuvectorLayer:n,TensorCompress:a,differentiableSearch:c,hierarchicalForward:s,getCompressionLevel:l,init:p,FlashAttention:m,DotProductAttention:u,MultiHeadAttention:d,HyperbolicAttention:A,LinearAttention:f,MoEAttention:h,SonaEngine:_,pipeline:b}=e||{};export{u as DotProductAttention,m as FlashAttention,A as HyperbolicAttention,f as LinearAttention,h as MoEAttention,d as MultiHeadAttention,n as RuvectorLayer,_ as SonaEngine,a as TensorCompress,i as default,c as differentiableSearch,l as getCompressionLevel,s as hierarchicalForward,p as init,b as pipeline};

package/dist/cli/chunks/{windsurf-installer-NQAOSVCN.js → windsurf-installer-PQIPH3WP.js}

@@ -1,5 +1,5 @@
-import{createRequire as __cr}from"module";const require=__cr(import.meta.url);if(process.argv.includes('--version')||process.argv.includes('-v')){console.log("3.11.2");process.exit(0)}
-import{b as u}from"./chunk-A4ZDKF5F.js";import{a as f,c as d}from"./chunk-FYY7OJ6Y.js";import"./chunk-LIEA5EON.js";d();import{existsSync as i,mkdirSync as h,readFileSync as g,writeFileSync as a}from"fs";import{join as p,dirname as v}from"path";var c=class{projectRoot;overwrite;options;generator;constructor(e){this.projectRoot=e.projectRoot,this.overwrite=e.overwrite??!1,this.options=e,this.generator=u()}async install(){let e={success:!0,mcpConfigured:!1,rulesInstalled:!1,errors:[],configPath:"",rulesPath:""};try{let t=this.generator.generateMcpConfig("windsurf",{memoryBackend:this.options.memoryBackend}),r=p(this.projectRoot,t.path);if(e.configPath=r,!i(r)||this.overwrite){let o=v(r);if(i(o)||h(o,{recursive:!0}),i(r)&&this.overwrite){let m=this.mergeExistingConfig(r,t.content);a(r,m)}else a(r,t.content);e.mcpConfigured=!0}let s=this.generator.generateBehavioralRules("windsurf"),n=p(this.projectRoot,s.path);if(e.rulesPath=n,!i(n)||this.overwrite){if(i(n)&&this.overwrite){let o=this.mergeExistingRules(n,s.content);a(n,o)}else a(n,s.content);e.rulesInstalled=!0}}catch(t){e.success=!1,e.errors.push(`Windsurf installation failed: ${f(t)}`)}return e}mergeExistingConfig(e,t){try{let r=JSON.parse(g(e,"utf-8")),s=JSON.parse(t);return r.mcpServers||(r.mcpServers={}),Object.assign(r.mcpServers,s.mcpServers),JSON.stringify(r,null,2)+`
+import{createRequire as __cr}from"module";const require=__cr(import.meta.url);if(process.argv.includes('--version')||process.argv.includes('-v')){console.log("3.11.4");process.exit(0)}
+import{b as u}from"./chunk-JPENUVCI.js";import{a as f,c as d}from"./chunk-PEIQDQXN.js";import"./chunk-Y4AXOHW4.js";d();import{existsSync as i,mkdirSync as h,readFileSync as g,writeFileSync as a}from"fs";import{join as p,dirname as v}from"path";var c=class{projectRoot;overwrite;options;generator;constructor(e){this.projectRoot=e.projectRoot,this.overwrite=e.overwrite??!1,this.options=e,this.generator=u()}async install(){let e={success:!0,mcpConfigured:!1,rulesInstalled:!1,errors:[],configPath:"",rulesPath:""};try{let t=this.generator.generateMcpConfig("windsurf",{memoryBackend:this.options.memoryBackend}),r=p(this.projectRoot,t.path);if(e.configPath=r,!i(r)||this.overwrite){let o=v(r);if(i(o)||h(o,{recursive:!0}),i(r)&&this.overwrite){let m=this.mergeExistingConfig(r,t.content);a(r,m)}else a(r,t.content);e.mcpConfigured=!0}let s=this.generator.generateBehavioralRules("windsurf"),n=p(this.projectRoot,s.path);if(e.rulesPath=n,!i(n)||this.overwrite){if(i(n)&&this.overwrite){let o=this.mergeExistingRules(n,s.content);a(n,o)}else a(n,s.content);e.rulesInstalled=!0}}catch(t){e.success=!1,e.errors.push(`Windsurf installation failed: ${f(t)}`)}return e}mergeExistingConfig(e,t){try{let r=JSON.parse(g(e,"utf-8")),s=JSON.parse(t);return r.mcpServers||(r.mcpServers={}),Object.assign(r.mcpServers,s.mcpServers),JSON.stringify(r,null,2)+`
 `}catch{return t}}mergeExistingRules(e,t){try{let r=g(e,"utf-8");return r.includes("Agentic QE")||r.includes("fleet_init")?r:r.trimEnd()+`
 
 ---

package/dist/cli/chunks/{witness-chain-23UWK2JT.js → witness-chain-HPLOYPS7.js}

@@ -1,2 +1,2 @@
-import{createRequire as __cr}from"module";const require=__cr(import.meta.url);if(process.argv.includes('--version')||process.argv.includes('-v')){console.log("3.11.2");process.exit(0)}
-import{a,b,c,d,e,f,g}from"./chunk-26ZMIYSK.js";import"./chunk-72VVTMEL.js";import"./chunk-5BDVFFYF.js";import"./chunk-WKIYYF3G.js";import"./chunk-LIEA5EON.js";export{c as PersistentWitnessChain,a as SPRTAccumulator,b as WitnessChain,f as createPersistentWitnessChain,e as createWitnessChain,d as createWitnessChainSQLitePersistence,g as isWitnessChainFeatureEnabled};
+import{createRequire as __cr}from"module";const require=__cr(import.meta.url);if(process.argv.includes('--version')||process.argv.includes('-v')){console.log("3.11.4");process.exit(0)}
+import{a,b,c,d,e,f,g}from"./chunk-BRLUNIR4.js";import"./chunk-XXRTWG7O.js";import"./chunk-6GYGAW53.js";import"./chunk-7ADD2ZQL.js";import"./chunk-Y4AXOHW4.js";export{c as PersistentWitnessChain,a as SPRTAccumulator,b as WitnessChain,f as createPersistentWitnessChain,e as createWitnessChain,d as createWitnessChainSQLitePersistence,g as isWitnessChainFeatureEnabled};

package/dist/cli/chunks/witness-chain-Q4BZHPDF.js

@@ -0,0 +1,2 @@
+import{createRequire as __cr}from"module";const require=__cr(import.meta.url);if(process.argv.includes('--version')||process.argv.includes('-v')){console.log("3.11.4");process.exit(0)}
+import{a,b,c,d,e,f,g,h,i}from"./chunk-5AQ7FXYG.js";import"./chunk-TPMBFARK.js";import"./chunk-LW5DHT3Z.js";import"./chunk-XXRTWG7O.js";import"./chunk-6GYGAW53.js";import"./chunk-LLUPRGOR.js";import"./chunk-VJGHRWMH.js";import"./chunk-NSPCZPTB.js";import"./chunk-PEIQDQXN.js";import"./chunk-TCWR6TDN.js";import"./chunk-YUHM72VQ.js";import"./chunk-PQUXFSN6.js";import"./chunk-7AWK43JN.js";import"./chunk-VCUCD3B5.js";import"./chunk-QJ5NCYJ3.js";import"./chunk-TQ373GGI.js";import"./chunk-7QTB5XIQ.js";import"./chunk-7ADD2ZQL.js";import"./chunk-Y4AXOHW4.js";export{a as GENESIS_PREV_HASH,f as WitnessChain,i as _resetWitnessChainForTests,h as createWitnessChain,g as getWitnessChain,d as hashWith,e as serializeEntry,b as sha256,c as shake256};

package/dist/cli/chunks/{workflow-3QOLXRJC.js → workflow-OAQ3FWCY.js}

@@ -1,5 +1,5 @@
-import{createRequire as __cr}from"module";const require=__cr(import.meta.url);if(process.argv.includes('--version')||process.argv.includes('-v')){console.log("3.11.2");process.exit(0)}
-import{b as $}from"./chunk-XXCSJMSR.js";import"./chunk-QFJDR4HC.js";import{d as R}from"./chunk-4FTVTAMN.js";import{b as k,c as C,d as b}from"./chunk-H4ZPPHOI.js";import{c as W}from"./chunk-LY6PTRVL.js";import"./chunk-QZLTIGLB.js";import"./chunk-FYY7OJ6Y.js";import"./chunk-LIEA5EON.js";import{Command as O}from"commander";import o from"chalk";function P(d,a){let m=d.indexOf("=");return m>0&&(a[d.substring(0,m)]=d.substring(m+1)),a}function x(d,a,m){let y=new O("workflow").description("Manage QE workflows and pipelines (ADR-041)");return y.command("run <file>").description("Execute a QE pipeline from YAML file").option("-w, --watch","Watch execution progress").option("-v, --verbose","Show detailed output").option("--params <json>","Additional parameters as JSON","{}").action(async(t,l)=>{if(!await m())return;let e=await import("fs"),c=(await import("path")).resolve(t);try{console.log(o.blue(`
+import{createRequire as __cr}from"module";const require=__cr(import.meta.url);if(process.argv.includes('--version')||process.argv.includes('-v')){console.log("3.11.4");process.exit(0)}
+import{b as $}from"./chunk-2KNFS3L5.js";import"./chunk-SRVTNG6L.js";import{d as R}from"./chunk-6545AS2J.js";import{b as k,c as C,d as b}from"./chunk-ARPBG6FQ.js";import{c as W}from"./chunk-VJGHRWMH.js";import"./chunk-O7PVZ32A.js";import"./chunk-PEIQDQXN.js";import"./chunk-Y4AXOHW4.js";import{Command as O}from"commander";import o from"chalk";function P(d,a){let m=d.indexOf("=");return m>0&&(a[d.substring(0,m)]=d.substring(m+1)),a}function x(d,a,m){let y=new O("workflow").description("Manage QE workflows and pipelines (ADR-041)");return y.command("run <file>").description("Execute a QE pipeline from YAML file").option("-w, --watch","Watch execution progress").option("-v, --verbose","Show detailed output").option("--params <json>","Additional parameters as JSON","{}").action(async(t,l)=>{if(!await m())return;let e=await import("fs"),c=(await import("path")).resolve(t);try{console.log(o.blue(`
  Running workflow from: ${t}
 `));let s=k(c);if(!s.success||!s.workflow){console.log(o.red("Failed to parse pipeline:"));for(let w of s.errors)console.log(o.red(`   ${w}`));await a(1)}let r={...W(l.params,"params")};if(s.pipeline){for(let w of s.pipeline.stages)if(w.params)for(let[S,h]of Object.entries(w.params))r[S]=h}if(!d.workflowOrchestrator.getWorkflow(s.workflow.id)){let w=d.workflowOrchestrator.registerWorkflow(s.workflow);w.success||(console.log(o.red(`Failed to register workflow: ${w.error.message}`)),await a(1))}let n=await d.workflowOrchestrator.executeWorkflow(s.workflow.id,r);if(!n.success){console.log(o.red(`Failed to start workflow: ${n.error.message}`)),await a(1);return}let p=n.value;if(console.log(o.cyan(`  Execution ID: ${p}`)),console.log(o.gray(`  Workflow: ${s.workflow.name}`)),console.log(o.gray(`  Stages: ${s.workflow.steps.length}`)),console.log(""),l.watch){console.log(o.blue(`Workflow Progress:
 `));let w,S=Date.now();for(;;){let g=d.workflowOrchestrator.getWorkflowStatus(p);if(!g)break;if(!w||w.progress!==g.progress||w.status!==g.status||JSON.stringify(w.currentSteps)!==JSON.stringify(g.currentSteps)){process.stdout.write("\r\x1B[K");let v="\u2588".repeat(Math.floor(g.progress/5))+"\u2591".repeat(20-Math.floor(g.progress/5)),D=g.status==="completed"?o.green:g.status==="failed"?o.red:g.status==="running"?o.yellow:o.gray;console.log(`  [${v}] ${g.progress}% - ${D(g.status)}`),g.currentSteps.length>0&&l.verbose&&console.log(o.gray(`    Running: ${g.currentSteps.join(", ")}`)),w=g}if(g.status==="completed"||g.status==="failed"||g.status==="cancelled")break;await new Promise(v=>setTimeout(v,500))}let h=d.workflowOrchestrator.getWorkflowStatus(p);if(h){console.log("");let g=h.duration||Date.now()-S;h.status==="completed"?(console.log(o.green("Workflow completed successfully")),console.log(o.gray(`   Duration: ${$(g)}`)),console.log(o.gray(`   Completed: ${h.completedSteps.length} stages`)),h.skippedSteps.length>0&&console.log(o.yellow(`   Skipped: ${h.skippedSteps.length} stages`))):h.status==="failed"?(console.log(o.red("Workflow failed")),console.log(o.red(`   Error: ${h.error}`)),console.log(o.gray(`   Failed stages: ${h.failedSteps.join(", ")}`))):console.log(o.yellow(`Workflow ${h.status}`))}}else console.log(o.green("Workflow execution started")),console.log(o.gray(`   Use 'aqe workflow status ${p}' to check progress`));console.log(""),await a(0)}catch(s){console.error(o.red(`
@@ -35,10 +35,10 @@ Workflow cancelled: ${t}
 `)):console.log(o.red(`
 Failed to cancel workflow: ${l.error.message}
 `)),await a(l.success?0:1)}catch(l){console.error(o.red(`
-Failed to cancel workflow:`),l),await a(1)}}),y.command("browser-list").description("List available browser workflow templates").action(async()=>{try{let{BrowserWorkflowTool:t}=await import("./browser-workflow-3HCTJBLR.js"),e=await new t().invoke({});if(e.success&&e.data){console.log(o.blue(`
+Failed to cancel workflow:`),l),await a(1)}}),y.command("browser-list").description("List available browser workflow templates").action(async()=>{try{let{BrowserWorkflowTool:t}=await import("./browser-workflow-4DGHFYY3.js"),e=await new t().invoke({});if(e.success&&e.data){console.log(o.blue(`
  Browser Workflow Templates:
 `));for(let u of e.data.availableTemplates)console.log(`  ${o.cyan(u)}`);console.log("")}else console.log(o.red(`Failed: ${e.error||"Unknown error"}`));await a(0)}catch(t){console.error(o.red(`
-Failed:`),t),await a(1)}}),y.command("browser-load [template]").description("Load and validate a browser workflow template or inline YAML").option("--yaml <yaml>","Inline YAML workflow definition").option("-v, --var <key=value>","Variable override (repeatable)",P,{}).option("-F, --format <format>","Output format (text|json)","text").option("-o, --output <path>","Write output to file").action(async(t,l)=>{try{let{BrowserWorkflowTool:e}=await import("./browser-workflow-3HCTJBLR.js"),{writeOutput:u,toJSON:c}=await import("./ci-output-YYXICZBC.js"),s=new e,f={variables:l.var||{}};if(l.yaml)f.workflowYaml=l.yaml;else if(t)if(t.endsWith(".yaml")||t.endsWith(".yml")){let i=await import("fs"),p=(await import("path")).resolve(t);i.existsSync(p)||(console.log(o.red(`
+Failed:`),t),await a(1)}}),y.command("browser-load [template]").description("Load and validate a browser workflow template or inline YAML").option("--yaml <yaml>","Inline YAML workflow definition").option("-v, --var <key=value>","Variable override (repeatable)",P,{}).option("-F, --format <format>","Output format (text|json)","text").option("-o, --output <path>","Write output to file").action(async(t,l)=>{try{let{BrowserWorkflowTool:e}=await import("./browser-workflow-4DGHFYY3.js"),{writeOutput:u,toJSON:c}=await import("./ci-output-YBVXLA6O.js"),s=new e,f={variables:l.var||{}};if(l.yaml)f.workflowYaml=l.yaml;else if(t)if(t.endsWith(".yaml")||t.endsWith(".yml")){let i=await import("fs"),p=(await import("path")).resolve(t);i.existsSync(p)||(console.log(o.red(`
 File not found: ${p}
 `)),await a(1)),f.workflowYaml=i.readFileSync(p,"utf-8")}else f.templateName=t;else console.log(o.red(`
 Provide a template name or --yaml. Use "workflow browser-list" to see templates.

package/dist/cli/chunks/workflow-orchestrator-4NDWECYK.js

@@ -0,0 +1,2 @@
+import{createRequire as __cr}from"module";const require=__cr(import.meta.url);if(process.argv.includes('--version')||process.argv.includes('-v')){console.log("3.11.4");process.exit(0)}
+import{a,b,c,d}from"./chunk-WMIRAD3J.js";import"./chunk-4BFCLSDN.js";import"./chunk-TPMBFARK.js";import"./chunk-LW5DHT3Z.js";import"./chunk-XXRTWG7O.js";import"./chunk-6GYGAW53.js";import"./chunk-LLUPRGOR.js";import"./chunk-VJGHRWMH.js";import"./chunk-NSPCZPTB.js";import"./chunk-O7PVZ32A.js";import"./chunk-PEIQDQXN.js";import"./chunk-BMQDELPA.js";import"./chunk-TCWR6TDN.js";import"./chunk-YUHM72VQ.js";import"./chunk-PQUXFSN6.js";import"./chunk-7AWK43JN.js";import"./chunk-VCUCD3B5.js";import"./chunk-QJ5NCYJ3.js";import"./chunk-TQ373GGI.js";import"./chunk-7QTB5XIQ.js";import"./chunk-7ADD2ZQL.js";import"./chunk-Y4AXOHW4.js";export{b as DEFAULT_WORKFLOW_CONFIG,a as WorkflowEvents,c as WorkflowOrchestrator,d as createWorkflowOrchestrator};

package/dist/cli/chunks/{wrappers-S6EUZBCX.js → wrappers-UPIU6S5S.js}

@@ -1,2 +1,2 @@
-import{createRequire as __cr}from"module";const require=__cr(import.meta.url);if(process.argv.includes('--version')||process.argv.includes('-v')){console.log("3.11.2");process.exit(0)}
-import{a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v as L,w as M,x as N}from"./chunk-KFE6LB4I.js";import{a as v,b as w,c as x,d as y,e as z,f as A,g as B,h as C,i as D,j as E,k as F,l as G,m as H,n as I,o as J,p as K}from"./chunk-OFUF3APC.js";import"./chunk-4PYJCIRO.js";import"./chunk-Y4M2HMPR.js";import"./chunk-72VVTMEL.js";import"./chunk-5BDVFFYF.js";import"./chunk-JCH2FHJ7.js";import"./chunk-LY6PTRVL.js";import"./chunk-IXYF5BZY.js";import"./chunk-FYY7OJ6Y.js";import"./chunk-AZQ6HDPM.js";import"./chunk-Z2QNTRUX.js";import"./chunk-6SOGYNJG.js";import"./chunk-7MKF52GT.js";import"./chunk-XY2B2BEJ.js";import"./chunk-AINAWVGD.js";import"./chunk-NIW4CLN2.js";import"./chunk-UCXW24HY.js";import"./chunk-WKIYYF3G.js";import"./chunk-LIEA5EON.js";export{z as GNNLayerFactory,i as QEFlashAttention,x as QEGNNEmbeddingIndex,y as QEGNNIndexFactory,a as QESONA,e as QE_FLASH_ATTENTION_CONFIG,g as QE_PERFORMANCE_TARGETS,f as QE_SONA_CONFIG,A as TensorCompressionFactory,u as batchComputeAttention,K as batchDifferentiableSearch,M as checkRuvectorPackagesAvailable,c as createDomainQESONA,j as createQEFlashAttention,b as createQESONA,D as getDifferentiableSearch,F as getGetCompressionLevel,E as getHierarchicalForward,G as getInit,h as getOptimalBlockConfig,k as getQEFlashAttentionConfig,n as getRuvectorDotProductAttention,m as getRuvectorFlashAttention,p as getRuvectorHyperbolicAttention,B as getRuvectorLayer,q as getRuvectorLinearAttention,r as getRuvectorMoEAttention,o as getRuvectorMultiHeadAttention,L as getRuvectorPackageVersions,C as getTensorCompress,l as getWorkloadTypes,N as initAllRuvectorPackages,w as initGNN,d as isAttentionAvailable,v as isGNNAvailable,s as toFloat32Array,H as toFloat32ArrayGNN,J as toIEmbedding,t as toNumberArrayAttn,I as toNumberArrayGNN};
+import{createRequire as __cr}from"module";const require=__cr(import.meta.url);if(process.argv.includes('--version')||process.argv.includes('-v')){console.log("3.11.4");process.exit(0)}
+import{a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v as L,w as M,x as N}from"./chunk-KYTFIP6R.js";import{a as v,b as w,c as x,d as y,e as z,f as A,g as B,h as C,i as D,j as E,k as F,l as G,m as H,n as I,o as J,p as K}from"./chunk-G3TFNY4T.js";import"./chunk-TPMBFARK.js";import"./chunk-LW5DHT3Z.js";import"./chunk-XXRTWG7O.js";import"./chunk-6GYGAW53.js";import"./chunk-LLUPRGOR.js";import"./chunk-VJGHRWMH.js";import"./chunk-NSPCZPTB.js";import"./chunk-PEIQDQXN.js";import"./chunk-TCWR6TDN.js";import"./chunk-YUHM72VQ.js";import"./chunk-PQUXFSN6.js";import"./chunk-7AWK43JN.js";import"./chunk-VCUCD3B5.js";import"./chunk-QJ5NCYJ3.js";import"./chunk-TQ373GGI.js";import"./chunk-7QTB5XIQ.js";import"./chunk-7ADD2ZQL.js";import"./chunk-Y4AXOHW4.js";export{z as GNNLayerFactory,i as QEFlashAttention,x as QEGNNEmbeddingIndex,y as QEGNNIndexFactory,a as QESONA,e as QE_FLASH_ATTENTION_CONFIG,g as QE_PERFORMANCE_TARGETS,f as QE_SONA_CONFIG,A as TensorCompressionFactory,u as batchComputeAttention,K as batchDifferentiableSearch,M as checkRuvectorPackagesAvailable,c as createDomainQESONA,j as createQEFlashAttention,b as createQESONA,D as getDifferentiableSearch,F as getGetCompressionLevel,E as getHierarchicalForward,G as getInit,h as getOptimalBlockConfig,k as getQEFlashAttentionConfig,n as getRuvectorDotProductAttention,m as getRuvectorFlashAttention,p as getRuvectorHyperbolicAttention,B as getRuvectorLayer,q as getRuvectorLinearAttention,r as getRuvectorMoEAttention,o as getRuvectorMultiHeadAttention,L as getRuvectorPackageVersions,C as getTensorCompress,l as getWorkloadTypes,N as initAllRuvectorPackages,w as initGNN,d as isAttentionAvailable,v as isGNNAvailable,s as toFloat32Array,H as toFloat32ArrayGNN,J as toIEmbedding,t as toNumberArrayAttn,I as toNumberArrayGNN};

package/dist/coordination/consensus/providers/ollama-provider.js

@@ -11,6 +11,7 @@
 import { BaseModelProvider } from '../model-provider';
 import { CONSENSUS_CONSTANTS, OLLAMA_CONSTANTS } from '../../constants.js';
 import { toErrorMessage, toError } from '../../../shared/error-utils.js';
+import { resolveOllamaBaseUrl } from '../../../shared/llm/ollama-url.js';
 // ============================================================================
 // Model Information
 // ============================================================================
@@ -51,7 +52,7 @@ export function getCodeOllamaModels() {
 // Ollama Provider Implementation
 // ============================================================================
 const DEFAULT_CONFIG = {
-    baseUrl: OLLAMA_CONSTANTS.DEFAULT_BASE_URL,
+    baseUrl: resolveOllamaBaseUrl(OLLAMA_CONSTANTS.DEFAULT_BASE_URL),
     defaultModel: 'llama3.1',
     defaultTimeout: CONSENSUS_CONSTANTS.OLLAMA_TIMEOUT_MS, // 5 minutes (local models can be slow)
     maxRetries: 2,
@@ -330,7 +331,7 @@ export function createMultiOllamaProviders(models = getRecommendedOllamaModels()
  * @param baseUrl - Ollama server URL
  * @returns True if Ollama is running and accessible
  */
-export async function isOllamaAvailable(baseUrl = 'http://localhost:11434') {
+export async function isOllamaAvailable(baseUrl = resolveOllamaBaseUrl(OLLAMA_CONSTANTS.DEFAULT_BASE_URL)) {
     try {
         const controller = new AbortController();
         const timeoutId = setTimeout(() => controller.abort(), 5000);

package/dist/feedback/regenerability-gate.d.ts

@@ -0,0 +1,70 @@
+/**
+ * Regenerability Gate (ADR-113)
+ *
+ * Answers the Deletion Test per module: "if I deleted this module and
+ * regenerated it, how confident am I that a wrong rebuild would be caught?"
+ * Confidence comes from the oracle tier backing the module (durable > live >
+ * ephemeral > none) scaled by its mutation kill rate. The gate is warn-by-default
+ * and opt-in blocking so it never breaks an existing pipeline on adoption.
+ *
+ * Pure functions only — no I/O. Inputs (tier presence + mutation score) are
+ * produced upstream by the oracle eval runner and test-tier tagging.
+ */
+/** Which durability tier of test backs a module (see qe-test-generation SKILL.md). */
+export type RegenerabilityTier = 'durable' | 'live' | 'ephemeral' | 'none';
+export interface ModuleTestProfile {
+    module: string;
+    /** Mutation kill rate of the module's tests, 0..1. */
+    mutationScore: number;
+    /** Has >=1 durable test (invariant / contract / property at the boundary). */
+    hasDurable: boolean;
+    /** Has live checks (monitoring / drift / cost assertions). */
+    hasLive?: boolean;
+    /** Has ephemeral tests (example-based / mock-call). */
+    hasEphemeral?: boolean;
+}
+export interface RegenerabilityResult {
+    module: string;
+    tier: RegenerabilityTier;
+    /** 0..1 confidence that deleting + regenerating this module is safe. */
+    score: number;
+    reason: string;
+}
+export interface RegenerabilityGateConfig {
+    /** Minimum mutation kill rate per module. */
+    mutationScoreMin: number;
+    /** Minimum regenerability score per module. */
+    regenerabilityMin: number;
+    /** 'warn' reports but never fails CI; 'block' fails CI when thresholds are unmet. */
+    mode: 'warn' | 'block';
+}
+/** Non-blocking by default — adoption must not break existing pipelines. */
+export declare const DEFAULT_REGENERABILITY_GATE: RegenerabilityGateConfig;
+export interface RegenerabilityGateVerdict {
+    /** True when every module meets both thresholds. */
+    passed: boolean;
+    /** True only when the gate should fail CI: mode === 'block' AND not passed. */
+    blocking: boolean;
+    mode: 'warn' | 'block';
+    results: RegenerabilityResult[];
+    failures: Array<{
+        module: string;
+        reasons: string[];
+    }>;
+    summary: string;
+}
+/** Highest tier of test present on the module. Durable wins because it survives a rewrite. */
+export declare function classifyTier(profile: ModuleTestProfile): RegenerabilityTier;
+/**
+ * Regenerability = fault-detection (mutation score) discounted by how well the
+ * backing tests survive a reimplementation. Ephemeral tests are coupled to the
+ * current code, so even a high mutation score earns limited regeneration
+ * confidence; durable tests earn full confidence for their kill rate.
+ */
+export declare function regenerabilityScore(profile: ModuleTestProfile): RegenerabilityResult;
+/**
+ * Evaluate the regenerability gate over a set of modules.
+ * `passed` reflects thresholds; `blocking` reflects whether CI should fail.
+ */
+export declare function evaluateRegenerabilityGate(profiles: ModuleTestProfile[], config?: RegenerabilityGateConfig): RegenerabilityGateVerdict;
+//# sourceMappingURL=regenerability-gate.d.ts.map

package/dist/feedback/regenerability-gate.js

@@ -0,0 +1,91 @@
+/**
+ * Regenerability Gate (ADR-113)
+ *
+ * Answers the Deletion Test per module: "if I deleted this module and
+ * regenerated it, how confident am I that a wrong rebuild would be caught?"
+ * Confidence comes from the oracle tier backing the module (durable > live >
+ * ephemeral > none) scaled by its mutation kill rate. The gate is warn-by-default
+ * and opt-in blocking so it never breaks an existing pipeline on adoption.
+ *
+ * Pure functions only — no I/O. Inputs (tier presence + mutation score) are
+ * produced upstream by the oracle eval runner and test-tier tagging.
+ */
+/** Non-blocking by default — adoption must not break existing pipelines. */
+export const DEFAULT_REGENERABILITY_GATE = {
+    mutationScoreMin: 0.6,
+    regenerabilityMin: 0.5,
+    mode: 'warn',
+};
+const round = (n) => Math.round(n * 10000) / 10000;
+const clamp01 = (n) => Math.max(0, Math.min(1, n));
+/** Highest tier of test present on the module. Durable wins because it survives a rewrite. */
+export function classifyTier(profile) {
+    if (profile.hasDurable)
+        return 'durable';
+    if (profile.hasLive)
+        return 'live';
+    if (profile.hasEphemeral)
+        return 'ephemeral';
+    return 'none';
+}
+/**
+ * Regenerability = fault-detection (mutation score) discounted by how well the
+ * backing tests survive a reimplementation. Ephemeral tests are coupled to the
+ * current code, so even a high mutation score earns limited regeneration
+ * confidence; durable tests earn full confidence for their kill rate.
+ */
+export function regenerabilityScore(profile) {
+    const tier = classifyTier(profile);
+    const mutation = clamp01(profile.mutationScore);
+    let score;
+    let reason;
+    switch (tier) {
+        case 'durable':
+            score = mutation;
+            reason = `durable tests kill ${(mutation * 100).toFixed(0)}% of mutants and survive a reimplementation`;
+            break;
+        case 'live':
+            score = mutation * 0.7;
+            reason = `live checks only; ${(mutation * 100).toFixed(0)}% mutation — add durable boundary tests for full confidence`;
+            break;
+        case 'ephemeral':
+            score = mutation * 0.4;
+            reason = `only ephemeral (example/mock) tests — coupled to the current implementation, would not survive a rewrite`;
+            break;
+        case 'none':
+        default:
+            score = 0;
+            reason = `no tests — deleting this module is unrecoverable (fails the Deletion Test)`;
+            break;
+    }
+    return { module: profile.module, tier, score: round(score), reason };
+}
+/**
+ * Evaluate the regenerability gate over a set of modules.
+ * `passed` reflects thresholds; `blocking` reflects whether CI should fail.
+ */
+export function evaluateRegenerabilityGate(profiles, config = DEFAULT_REGENERABILITY_GATE) {
+    const results = profiles.map(regenerabilityScore);
+    const failures = [];
+    for (let i = 0; i < profiles.length; i++) {
+        const p = profiles[i];
+        const r = results[i];
+        const reasons = [];
+        if (clamp01(p.mutationScore) < config.mutationScoreMin) {
+            reasons.push(`mutation score ${(clamp01(p.mutationScore) * 100).toFixed(0)}% < ${(config.mutationScoreMin * 100).toFixed(0)}%`);
+        }
+        if (r.score < config.regenerabilityMin) {
+            reasons.push(`regenerability ${(r.score * 100).toFixed(0)}% < ${(config.regenerabilityMin * 100).toFixed(0)}% (${r.tier})`);
+        }
+        if (reasons.length > 0)
+            failures.push({ module: p.module, reasons });
+    }
+    const passed = failures.length === 0;
+    const blocking = config.mode === 'block' && !passed;
+    const verb = passed ? 'PASS' : config.mode === 'block' ? 'FAIL (blocking)' : 'WARN (non-blocking)';
+    const summary = profiles.length === 0
+        ? 'regenerability gate: no modules evaluated'
+        : `regenerability gate: ${verb} — ${profiles.length - failures.length}/${profiles.length} modules meet thresholds`;
+    return { passed, blocking, mode: config.mode, results, failures, summary };
+}
+//# sourceMappingURL=regenerability-gate.js.map

package/dist/integrations/ruvector/proof-gate.d.ts

@@ -0,0 +1,68 @@
+/**
+ * Tamper-evident hash-chain audit gate — a faithful, dependency-free TypeScript
+ * port of RuVector's `ruvector-proof-gate` `HashChainGate` (upstream ADR-194;
+ * AQE-side integration decision: ADR-116).
+ *
+ * Why ported rather than bound: the Rust crate ships no NAPI/WASM binding, and
+ * the algorithm is small and exact. This uses only Node's `crypto` (no native
+ * dep) and opens NO database — the chain lives in memory and is serialized via
+ * {@link HashChainGate.toJSON}/{@link HashChainGate.fromJSON} so a caller can
+ * persist it through the existing unified `memory.db` (never a competing store).
+ *
+ * QE use-case: turn AQE's "verify row counts BEFORE and AFTER, never claim a
+ * sync/migration succeeded without proof" mandate into a cryptographic
+ * guarantee. Admit one payload per DB operation (table, op, row-count, content
+ * digest); a later `verifyIntegrity()` proves no admitted entry was mutated,
+ * reordered, or dropped.
+ *
+ * Commitment: commitment[n] = SHA256("ruvector:chain:" || commitment[n-1] ||
+ * payload_hash[n] || u64le(n)), seeded from a fixed genesis. Verification is
+ * O(n): replay from genesis. (Genesis differs from the Rust literal — we do not
+ * interoperate with Rust receipts, only self-verify.)
+ */
+/** Any admissible payload. Objects are canonicalized (sorted keys) before hashing. */
+export type GatePayload = string | Uint8Array | Record<string, unknown>;
+export interface WriteReceipt {
+    /** 0-based admission order. */
+    sequence: number;
+    /** SHA-256 of the canonical payload bytes (hex). */
+    payloadHash: string;
+    /** Chain commitment at this entry (hex) — binds it to every prior entry. */
+    chainCommitment: string;
+}
+/** Serializable chain state for persistence through the unified store. */
+export interface HashChainState {
+    seq: number;
+    head: string;
+    chain: string[];
+    payloadHashes: string[];
+}
+/**
+ * Sequential SHA-256 hash chain. O(1) per `admit`, O(n) `verifyIntegrity`.
+ * In-memory; persist/restore via {@link toJSON}/{@link fromJSON}.
+ */
+export declare class HashChainGate {
+    private seq;
+    private prev;
+    private readonly chain;
+    private readonly payloadHashes;
+    /** Admit a payload; returns a receipt committing the chain state. */
+    admit(payload: GatePayload): WriteReceipt;
+    /** True iff `receipt` matches the commitment recorded at its sequence. */
+    verifyReceipt(receipt: WriteReceipt): boolean;
+    /** Current chain head (hex). Changes after every successful `admit`. */
+    chainRoot(): string;
+    get length(): number;
+    get isEmpty(): boolean;
+    /**
+     * Full cryptographic re-derivation from genesis. Returns false if ANY
+     * commitment fails to re-derive — catches a mutated commitment, a mutated
+     * payload hash, a reorder, or a length mismatch.
+     */
+    verifyIntegrity(): boolean;
+    /** Snapshot for persistence through the unified store (no DB opened here). */
+    toJSON(): HashChainState;
+    /** Restore a chain from a {@link toJSON} snapshot. */
+    static fromJSON(state: HashChainState): HashChainGate;
+}
+//# sourceMappingURL=proof-gate.d.ts.map

package/dist/integrations/ruvector/proof-gate.js

@@ -0,0 +1,135 @@
+/**
+ * Tamper-evident hash-chain audit gate — a faithful, dependency-free TypeScript
+ * port of RuVector's `ruvector-proof-gate` `HashChainGate` (upstream ADR-194;
+ * AQE-side integration decision: ADR-116).
+ *
+ * Why ported rather than bound: the Rust crate ships no NAPI/WASM binding, and
+ * the algorithm is small and exact. This uses only Node's `crypto` (no native
+ * dep) and opens NO database — the chain lives in memory and is serialized via
+ * {@link HashChainGate.toJSON}/{@link HashChainGate.fromJSON} so a caller can
+ * persist it through the existing unified `memory.db` (never a competing store).
+ *
+ * QE use-case: turn AQE's "verify row counts BEFORE and AFTER, never claim a
+ * sync/migration succeeded without proof" mandate into a cryptographic
+ * guarantee. Admit one payload per DB operation (table, op, row-count, content
+ * digest); a later `verifyIntegrity()` proves no admitted entry was mutated,
+ * reordered, or dropped.
+ *
+ * Commitment: commitment[n] = SHA256("ruvector:chain:" || commitment[n-1] ||
+ * payload_hash[n] || u64le(n)), seeded from a fixed genesis. Verification is
+ * O(n): replay from genesis. (Genesis differs from the Rust literal — we do not
+ * interoperate with Rust receipts, only self-verify.)
+ */
+import { createHash } from 'node:crypto';
+const CHAIN_TAG = Buffer.from('ruvector:chain:');
+/** Re-derivation anchor. Self-consistent; not byte-compatible with the Rust crate. */
+const GENESIS = createHash('sha256').update('ruvector-proof-gate-v1').digest();
+function u64le(n) {
+    const b = Buffer.alloc(8);
+    b.writeBigUInt64LE(BigInt(n));
+    return b;
+}
+/** Deterministic, key-sorted serialization so equal payloads hash equally. */
+function canonicalBytes(payload) {
+    if (typeof payload === 'string')
+        return Buffer.from(payload, 'utf8');
+    if (payload instanceof Uint8Array)
+        return Buffer.from(payload);
+    return Buffer.from(canonicalJson(payload), 'utf8');
+}
+function canonicalJson(value) {
+    if (value === null || typeof value !== 'object')
+        return JSON.stringify(value) ?? 'null';
+    if (Array.isArray(value))
+        return `[${value.map(canonicalJson).join(',')}]`;
+    const keys = Object.keys(value).sort();
+    return `{${keys.map((k) => `${JSON.stringify(k)}:${canonicalJson(value[k])}`).join(',')}}`;
+}
+function sha256(...parts) {
+    const h = createHash('sha256');
+    for (const p of parts)
+        h.update(p);
+    return h.digest();
+}
+function commitmentOf(prev, payloadHash, seq) {
+    return sha256(CHAIN_TAG, prev, payloadHash, u64le(seq));
+}
+/**
+ * Sequential SHA-256 hash chain. O(1) per `admit`, O(n) `verifyIntegrity`.
+ * In-memory; persist/restore via {@link toJSON}/{@link fromJSON}.
+ */
+export class HashChainGate {
+    seq = 0;
+    prev = GENESIS;
+    chain = [];
+    payloadHashes = [];
+    /** Admit a payload; returns a receipt committing the chain state. */
+    admit(payload) {
+        const payloadHash = sha256(canonicalBytes(payload));
+        const commitment = commitmentOf(this.prev, payloadHash, this.seq);
+        this.prev = commitment;
+        this.chain.push(commitment);
+        this.payloadHashes.push(payloadHash);
+        const receipt = {
+            sequence: this.seq,
+            payloadHash: payloadHash.toString('hex'),
+            chainCommitment: commitment.toString('hex'),
+        };
+        this.seq += 1;
+        return receipt;
+    }
+    /** True iff `receipt` matches the commitment recorded at its sequence. */
+    verifyReceipt(receipt) {
+        return (receipt.sequence >= 0 &&
+            receipt.sequence < this.chain.length &&
+            this.chain[receipt.sequence].toString('hex') === receipt.chainCommitment);
+    }
+    /** Current chain head (hex). Changes after every successful `admit`. */
+    chainRoot() {
+        return this.prev.toString('hex');
+    }
+    get length() {
+        return this.seq;
+    }
+    get isEmpty() {
+        return this.seq === 0;
+    }
+    /**
+     * Full cryptographic re-derivation from genesis. Returns false if ANY
+     * commitment fails to re-derive — catches a mutated commitment, a mutated
+     * payload hash, a reorder, or a length mismatch.
+     */
+    verifyIntegrity() {
+        if (this.chain.length !== this.payloadHashes.length)
+            return false;
+        let prev = GENESIS;
+        for (let i = 0; i < this.chain.length; i++) {
+            const expected = commitmentOf(prev, this.payloadHashes[i], i);
+            if (!expected.equals(this.chain[i]))
+                return false;
+            prev = this.chain[i];
+        }
+        return prev.equals(this.prev);
+    }
+    /** Snapshot for persistence through the unified store (no DB opened here). */
+    toJSON() {
+        return {
+            seq: this.seq,
+            head: this.prev.toString('hex'),
+            chain: this.chain.map((c) => c.toString('hex')),
+            payloadHashes: this.payloadHashes.map((p) => p.toString('hex')),
+        };
+    }
+    /** Restore a chain from a {@link toJSON} snapshot. */
+    static fromJSON(state) {
+        const g = new HashChainGate();
+        g.seq = state.seq;
+        g.prev = Buffer.from(state.head, 'hex');
+        for (const c of state.chain)
+            g.chain.push(Buffer.from(c, 'hex'));
+        for (const p of state.payloadHashes)
+            g.payloadHashes.push(Buffer.from(p, 'hex'));
+        return g;
+    }
+}
+//# sourceMappingURL=proof-gate.js.map

package/dist/kernel/unified-memory.d.ts

@@ -71,6 +71,10 @@ export declare class UnifiedMemoryManager {
     private preparedStatements;
     private vectorIndex;
     private crdtStore;
+    private proofGate;
+    private proofGateEnvChecked;
+    private static readonly PROOF_NS;
+    private static readonly PROOF_KEY;
     private constructor();
     static getInstance(config?: Partial<UnifiedMemoryConfig>): UnifiedMemoryManager;
     static getInstanceAsync(config?: Partial<UnifiedMemoryConfig>): Promise<UnifiedMemoryManager>;
@@ -94,6 +98,37 @@ export declare class UnifiedMemoryManager {
     kvExists(key: string, namespace?: string): Promise<boolean>;
     kvSearch(pattern: string, namespace?: string, limit?: number): Promise<string[]>;
     kvCleanupExpired(): Promise<number>;
+    /**
+     * Enable the tamper-evident proof-gate audit. OFF by default — once enabled,
+     * every kv write/delete admits a receipt to a persisted SHA-256 hash chain so
+     * {@link verifyMemoryIntegrity} can later prove no admitted write was mutated,
+     * reordered, or dropped. Restores any chain persisted from a prior process.
+     *
+     * Intended for BOUNDED audit windows (a sync / migration / publish gate), not
+     * permanent always-on use: the chain grows O(n) with audited writes and its
+     * snapshot is rewritten per write. Idempotent.
+     */
+    enableProofGate(): void;
+    isProofGateEnabled(): boolean;
+    /**
+     * Re-derive the proof-gate chain from genesis. Returns true iff no admitted
+     * write was mutated, reordered, or dropped. Throws if the gate is not enabled.
+     */
+    verifyMemoryIntegrity(): boolean;
+    /** Current proof-gate chain head (hex), or null if the gate is not enabled. */
+    getProofChainRoot(): string | null;
+    /** Number of writes admitted to the proof-gate chain (0 if not enabled). */
+    getProofChainLength(): number;
+    /**
+     * Best-effort audit of a kv mutation. Admits a content-bound receipt and
+     * persists the chain. NEVER throws into the caller — the actual write has
+     * already committed; a failed audit must not break or alter it.
+     */
+    private auditWrite;
+    /** Persist the chain snapshot via a DIRECT write (bypasses kvSet → no recursion). */
+    private persistProofChain;
+    /** Restore a persisted chain from the reserved namespace, or null if none/corrupt. */
+    private loadProofChain;
     vectorStore(id: string, embedding: number[], namespace?: string, metadata?: unknown): Promise<void>;
     vectorGet(id: string): Promise<{
         embedding: number[];