@selvajs/solve 0.2.0-beta.4 → 1.0.0-beta.10

package/dist/server.js

@@ -1,2 +1,2 @@
-import{ErrorCodes as I,RhinoComputeError as U,TreeBuilder as q}from"@selvajs/compute";import{gzip as W,gunzipSync as G}from"zlib";import{promisify as N}from"util";import{processInput as $}from"@selvajs/compute";function A(e,n){let t={id:e.id,name:e.nickname,nickname:e.nickname||null,description:e.description||"",paramType:e.paramType==="dynamicValueList"?"valueList":e.paramType,treeAccess:e.inputStructure==="tree",minimum:e.minimum??null,maximum:e.maximum??null,atLeast:1,atMost:1,stepSize:e.stepSize,default:n??e.default},r=$(t),o=n??e.default;return r.default==null&&o!=null&&(Array.isArray(o)||r.paramType==="ValueList"&&typeof o!="object")&&(r.default=o),r}var j=N(W),F=1,_="X-Selva-Compute-Version";function E(e,n){return q.fromInputParams(e.filter(t=>t.paramType).map(t=>A(t,n[t.id])))}async function B(e){let{client:n,signal:t}=e,r=performance.now(),o=e.inputTree??E(e.inputs,e.values),c=performance.now()-r,s=n.solveMeta.seq,m=n.rhinoTiming.seq,i,l=performance.now();try{i=await n.scheduler.solve(e.definitionSource,o,{signal:t})}catch(v){let x=performance.now()-l;if(v instanceof Error&&v.name==="AbortError")return t.aborted?{kind:"client_abort",durationMs:x}:{kind:"timeout",durationMs:x,message:`Solve exceeded the ${Math.round(e.maxSolveDurationMs/1e3)}s deadline.`};if(v instanceof U){if(v.code===I.QUEUE_FULL)return{kind:"shed",durationMs:x,reason:"queue_full",retryAfterSeconds:1,message:"Compute server is at capacity. Retry shortly."};if(v.code===I.QUEUE_TIMEOUT)return{kind:"shed",durationMs:x,reason:"queue_timeout",retryAfterSeconds:1,message:"Compute request waited too long in the queue. Retry shortly."}}return{kind:"compute_error",durationMs:x,error:v}}let d=performance.now()-l,h=performance.now(),a;try{a=JSON.stringify(i)}catch(v){if(v instanceof RangeError)return{kind:"too_large"};throw v}if(a.length>e.responseMaxBytes)return{kind:"too_large"};let p=performance.now()-h,M=/\bgzip\b/i.test(e.acceptEncoding)&&a.length>1024,C=null,S=0;if(M){let v=performance.now();C=await j(Buffer.from(a)),S=performance.now()-v}let y=performance.now()-e.loadStartMs,u=n.solveMeta.seq===s+1?n.solveMeta.last:null,f=u&&!u.fromCache&&n.rhinoTiming.seq===m+1?n.rhinoTiming.last:null,g={"Content-Type":"application/json","Server-Timing":V({defLoadMs:e.defLoadMs,treeBuildMs:c,solveMs:d,serializeMs:p,gzipMs:S,serverTotalMs:y,rhino:f,settle:u,byteRefOutcome:e.byteRefOutcome,prepMarks:e.prepMarks??[]}),[_]:String(F),Vary:"Accept-Encoding"},R={treeBuildMs:c,solveMs:d,serializeMs:p,gzipMs:S,serverTotalMs:y,serializedBytes:a.length,compressedBytes:C?.byteLength??null},D;return C?(g["Content-Encoding"]="gzip",g["Content-Length"]=String(C.byteLength),D={body:new Uint8Array(C),encoding:"gzip",headers:g,result:i,metrics:R}):(g["Content-Length"]=String(Buffer.byteLength(a)),D={body:a,headers:g,result:i,metrics:R}),{kind:"ok",envelope:D,solveMs:d,errorCount:i.errors?.length??0,warningCount:i.warnings?.length??0}}function T(e,n){let t=/\bgzip\b/i.test(n);if(e.encoding==="gzip"&&!t){let r=G(e.body instanceof Uint8Array?e.body:Buffer.from(e.body)).toString("utf8"),o={...e.headers};return delete o["Content-Encoding"],o["Content-Length"]=String(Buffer.byteLength(r)),{body:r,headers:o}}return{body:e.body,headers:e.headers}}function V(e){let n=`load;dur=${e.defLoadMs.toFixed(1)}, tree;dur=${e.treeBuildMs.toFixed(1)}, solve;dur=${e.solveMs.toFixed(1)}, serialize;dur=${e.serializeMs.toFixed(1)}, gzip;dur=${e.gzipMs.toFixed(1)}, total;dur=${e.serverTotalMs.toFixed(1)}`,t=e.rhino;if(t){let c=t.decode+t.solve+t.encode,s=Math.max(0,e.solveMs-c);n+=`, rhino_decode;dur=${t.decode.toFixed(1)}, rhino_solve;dur=${t.solve.toFixed(1)}, rhino_encode;dur=${t.encode.toFixed(1)}, compute_link;dur=${s.toFixed(1)}`}for(let[c,s]of e.prepMarks)n+=`, p_${c};dur=${s.toFixed(1)}`;let r=e.settle;r&&(n+=`, selva_cache;dur=${r.fromCache?1:0}`,r.definitionReuploaded!==void 0&&(n+=`, def_reupload;dur=${r.definitionReuploaded?1:0}`));let o=e.byteRefOutcome;if(o){let c=o.loaded?o.fromCache?"hit":"miss":"skipped";n+=`, def_bytes;desc=${c}`}return n}import{GrasshopperClient as K,enableDebugLogging as Q}from"@selvajs/compute";function H(e){return e.id}var J=16,z=1,X=300*1e3;function k(e){let n=e.maxWarmComputeServers??J,t=new Map,r=new Map;e.debug==="verbose"&&Q();let o=s=>{e.debug&&e.onDebugLog?.(s)};async function c(s,m){let i={last:null,seq:0},l={last:null,seq:0},d=e.debug==="verbose",h={serverUrl:s.serverUrl,apiKey:s.apiKey,debug:d,cachesolve:e.cachesolve,cacheerroredsolves:e.cacheerroredsolves,onServerTiming:y=>{let u=y.decode??0,f=y.solve??0,b=y.encode??0;if(i.seq+=1,i.last={decode:u,solve:f,encode:b},!e.debug)return;let g=u<=1?"HIT (definition reused, no re-upload/parse)":"miss (full parse)",R=e.cachesolve&&f<=1?"HIT (cached result, solve skipped)":e.cachesolve?"miss (solved fresh)":"off";o(`[Compute/rhino-cache] decode=${u}ms solve=${f}ms encode=${b}ms | definition-cache: ${g} | solve-cache (cachesolve): ${R}`)}};m&&(h.headers={"X-Selva-Definition":m});let a=await K.create(h),p=z,w=0,M=!1;async function C(y){if(!M){M=!0;try{let u=await Promise.resolve(a.serverStats?.getActiveChildren({initialize:!1})).catch(()=>null);w=Date.now();let f=!u||u<=0?z:u;if(f===p)return;o(`[Compute/client-cache] concurrency ${p} \u2192 ${f} (server child count)`),p=f,y?.setMaxConcurrent(f)}finally{M=!1}}}await C();let S=a.createScheduler({mode:"queue",maxConcurrent:p,maxQueueDepth:e.maxQueueDepth||void 0,queueWaitMs:e.queueWaitMs||void 0,timeoutMs:e.maxSolveDurationMs,cache:e.responseCacheMaxBytes>0?{maxBytes:e.responseCacheMaxBytes}:!1,reuseServerDefinitionCache:e.reuseServerDefinitionCache,onSettle:(y,u)=>{if(l.seq+=1,u.status==="success"&&(u.fromCache!==!0&&Date.now()-w>=X&&C(S),l.last={fromCache:u.fromCache===!0,definitionReuploaded:u.definitionReuploaded},!!e.debug&&(o(`[Compute/selva-cache] ${u.fromCache?"HIT  \u2014 served from cache (no compute call)":"miss \u2014 went to Rhino.Compute"} (${Math.round(u.durationMs)}ms)`),u.fromCache||o(u.definitionReuploaded===!0?"[Compute/def-cache] miss \u2014 definition RE-UPLOADED (pointer was cold/stale)":u.definitionReuploaded===!1?"[Compute/def-cache] HIT  \u2014 definition reused from server cache (no upload)":"[Compute/def-cache] n/a \u2014 reuse disabled or non-reusable definition"),!u.fromCache))){let f=u.response?.errors,b=Array.isArray(f)?f.length:0;if(b>0){let g=e.cacheerroredsolves?"cached (cacheerroredsolves on)":"not cached (cacheerroredsolves off) \u2014 re-run until fixed";o(`[Compute/rhino-cache] ${b} GH error(s); ${g}. First: ${JSON.stringify(f[0])}`)}}}});return{client:a,scheduler:S,rhinoTiming:i,solveMeta:l}}return{async getClient(s,m){let i=s.id,l=t.get(i);if(l)return t.delete(i),t.set(i,l),l;let d=r.get(i);if(d)return d;o(`[Compute/client-cache] miss \u2014 building warm client for server ${i}`);let h=(async()=>{let a=await c(s,m?.definitionGuid);if(t.size>=n){let p=t.keys().next().value;p!==void 0&&(o(`[Compute/client-cache] LRU evicted warm client for server ${p} (cap ${n})`),t.get(p)?.scheduler.dispose(),t.delete(p))}return t.set(i,a),a})().finally(()=>r.delete(i));return r.set(i,h),h},evict(s){let m=s,i=t.get(m);i&&(o(`[Compute/client-cache] evicted warm client for server ${m} (config change)`),i.scheduler.dispose(),t.delete(m))},solveCacheStats(){let s={warmClients:t.size,entries:0,bytes:0,hits:0,misses:0,evictions:0};for(let m of t.values()){let i=m.scheduler.cacheStats();s.entries+=i.entries,s.bytes+=i.bytes,s.hits+=i.hits,s.misses+=i.misses,s.evictions+=i.evictions}return s},clearSolveCaches(){o(`[Compute/client-cache] cleared solve caches on ${t.size} warm client(s)`);for(let s of t.values())s.scheduler.clearCache()},disposeAll(){o(`[Compute/client-cache] disposing all ${t.size} warm client(s)`);for(let s of t.values())s.scheduler.dispose();t.clear()}}}function P(e){let n=Math.max(0,Math.floor(e)),t=new Map,r=0,o={hits:0,misses:0,evictions:0};function c(i,l){t.delete(i),t.set(i,l)}function s(){for(;r>n&&t.size>0;){let i=t.keys().next().value,l=t.get(i);t.delete(i),r-=l.bytes.byteLength,o.evictions+=1}}function m(i,l){if(n===0||l.byteLength>n)return;let d=t.get(i);d&&(r-=d.bytes.byteLength),t.set(i,{bytes:l}),r+=l.byteLength,s()}return{getOrLoad(i,l){let d={loaded:!1,fromCache:!1};return{key:i,outcome:d,load:async()=>{let h=t.get(i);if(h)return c(i,h),o.hits+=1,d.loaded=!0,d.fromCache=!0,h.bytes;o.misses+=1,d.loaded=!0,d.fromCache=!1;let a=await l();return m(i,a),a}}},stats(){return{hits:o.hits,misses:o.misses,evictions:o.evictions,entries:t.size,bytes:r}},clear(){t.clear(),r=0}}}function O(e={}){let n=new Map;return{run(t,r,o){let c=n.get(t);if(c)return e.onJoin?.(t),c.notifyOwner?.(),c.promise;let s={notifyOwner:o,promise:void 0},m=(async()=>r())().finally(()=>{s.notifyOwner=void 0,n.get(t)===s&&n.delete(t)});return s.promise=m,n.set(t,s),m},inFlight(){return n.size}}}import{isDefinitionRef as Y,stableStringify as Z}from"@selvajs/compute";import{NoopLogger as ee}from"@selvajs/platform";function te(e){return typeof e=="object"&&e!==null&&!(e instanceof Uint8Array)&&"outcome"in e}function ne(e){return typeof e=="object"&&e!==null&&!(e instanceof Uint8Array)&&!("outcome"in e)&&!("key"in e)&&"versionId"in e}var L=class{limits;clientCache;byteCache;singleFlight;constructor(n){this.limits=n.limits;let t=n.logger??new ee;this.clientCache=k({maxSolveDurationMs:this.limits.maxSolveDurationMs,cachesolve:this.limits.computeServerCachesolve,cacheerroredsolves:this.limits.computeCacheErroredSolves,reuseServerDefinitionCache:this.limits.computeReuseDefinitionCache,maxQueueDepth:this.limits.computeMaxQueueDepth,queueWaitMs:this.limits.computeQueueWaitMs,responseCacheMaxBytes:this.limits.computeSolveCacheBytes,debug:n.debug??!1,maxWarmComputeServers:n.maxWarmComputeServers,onDebugLog:n.onDebugLog??(r=>t.debug(r,{component:"Compute/client-cache"}))}),this.byteCache=P(this.limits.computeDefinitionCacheBytes),this.singleFlight=O({onJoin:n.onSolveCoalesced})}getClient(n,t){return this.clientCache.getClient(n,t)}definitionRef(n,t){return this.byteCache.getOrLoad(n,t)}evictServer(n){this.clientCache.evict(n)}clearSolveCaches(){this.clientCache.clearSolveCaches()}stats(){return{client:this.clientCache.solveCacheStats(),definitionBytes:this.byteCache.stats(),coalescing:{inFlight:this.singleFlight.inFlight()}}}async solve(n){let{definitionSource:t,byteRefOutcome:r,identity:o}=this.resolveDefinitionSource(n),c=await this.clientCache.getClient(n.server,{definitionGuid:n.definitionGuid}),s=E(n.inputs,n.values),m=`${o}:${n.server.id}:${Z(s)}`,i=new AbortController,l=!1,d=()=>{l||i.abort()};n.signal.addEventListener("abort",d,{once:!0});let h=n.acceptEncoding??"",a;try{a=await this.singleFlight.run(m,()=>B({definitionSource:t,byteRefOutcome:r,inputs:n.inputs,values:n.values,inputTree:s,client:c,responseMaxBytes:this.limits.computeResponseMaxBytes,maxSolveDurationMs:this.limits.maxSolveDurationMs,acceptEncoding:h,signal:i.signal,loadStartMs:n.loadStartMs??performance.now(),defLoadMs:n.defLoadMs??0,prepMarks:n.prepMarks}),()=>{l=!0})}finally{n.signal.removeEventListener("abort",d)}if(a.kind!=="ok")return a;let p=T(a.envelope,h);return{...a,envelope:{...a.envelope,body:p.body,headers:p.headers}}}toResponse(n,t){let r=(o,c)=>{t?.onError&&t.onError(o,c);let s={"Content-Type":"application/json"};return c.retryAfter!==void 0&&(s["Retry-After"]=String(c.retryAfter)),{status:o,headers:s,body:JSON.stringify(c)}};switch(n.kind){case"ok":return{status:200,headers:n.envelope.headers,body:n.envelope.body};case"timeout":return r(504,{message:n.message});case"client_abort":return r(499,{message:"Client closed request"});case"too_large":return r(413,{message:"Solve result is too large to return. This usually means a file output exceeds the supported size."});case"shed":return r(503,{message:n.message,retryAfter:n.retryAfterSeconds});case"compute_error":throw n.error}}toWebResponse(n){let t=this.toResponse(n);return new Response(typeof t.body=="string"?t.body:new Uint8Array(t.body),{status:t.status,headers:t.headers})}resolveDefinitionSource(n){let t=n.definitionSource;if(ne(t)){let r=this.byteCache.getOrLoad(t.versionId,t.load);return{definitionSource:r,byteRefOutcome:r.outcome,identity:r.key}}if(te(t))return{definitionSource:t,byteRefOutcome:t.outcome,identity:t.key};if(Y(t))return{definitionSource:t,identity:t.key};if(!n.definitionKey)throw new Error("SolveEngine.solve(): definitionKey is required when definitionSource is raw bytes or a string.");return{definitionSource:t,identity:n.definitionKey}}};import{isDefinitionRef as Te}from"@selvajs/compute";export{F as COMPUTE_CONTRACT_VERSION,_ as COMPUTE_VERSION_HEADER,L as SolveEngine,T as adaptEnvelopeToEncoding,E as buildSolveInputTree,k as createClientCache,P as createDefinitionByteCache,O as createSolveCacheSingleFlight,Te as isDefinitionRef,B as runSolvePipeline,H as serverIdentity,A as transformInputParameter};
+import{GrasshopperClient as e,TreeBuilder as t,isDefinitionRef as n,processInput as r,stableStringify as i}from"@selvajs/compute/grasshopper";import{ComputeError as a,ErrorCodes as o,enableDebugLogging as s,isDefinitionRef as c}from"@selvajs/compute/core";import{gunzipSync as l,gzip as u}from"node:zlib";import{promisify as d}from"node:util";import{NoopLogger as f}from"@selvajs/platform";function p(e,t){let n={id:e.id,name:e.nickname,nickname:e.nickname||null,description:e.description||``,paramType:e.paramType===`dynamicValueList`?`valueList`:e.paramType,treeAccess:e.inputStructure===`tree`,minimum:e.minimum??null,maximum:e.maximum??null,atLeast:1,atMost:1,stepSize:e.stepSize,default:t??e.default},i=r(n),a=t??e.default;return i.default==null&&a!=null&&(Array.isArray(a)||i.paramType===`ValueList`&&typeof a!=`object`)&&(i.default=a),i}const m=d(u),h=1,g=`X-Selva-Compute-Version`;function _(e,n){return t.fromInputParams(e.filter(e=>e.paramType).map(e=>p(e,n[e.id])))}async function v(e){let{client:t,signal:n}=e,r=performance.now(),i=e.inputTree??_(e.inputs,e.values),s=performance.now()-r,c=t.solveMeta.seq,l=t.rhinoTiming.seq,u,d=performance.now();try{u=await t.scheduler.solve(e.definitionSource,i,{signal:n})}catch(t){let r=performance.now()-d;if(t instanceof Error&&t.name===`AbortError`)return n.aborted?{kind:`client_abort`,durationMs:r}:{kind:`timeout`,durationMs:r,message:`Solve exceeded the ${Math.round(e.solveDeadlineMs/1e3)}s deadline.`};if(t instanceof a){if(t.code===o.QUEUE_FULL)return{kind:`shed`,durationMs:r,reason:`queue_full`,retryAfterSeconds:1,message:`Compute server is at capacity. Retry shortly.`};if(t.code===o.QUEUE_TIMEOUT)return{kind:`shed`,durationMs:r,reason:`queue_timeout`,retryAfterSeconds:1,message:`Compute request waited too long in the queue. Retry shortly.`}}return{kind:`compute_error`,durationMs:r,error:t}}let f=performance.now()-d,p=performance.now(),h;try{h=JSON.stringify(u)}catch(e){if(e instanceof RangeError)return{kind:`too_large`};throw e}if(h.length>e.responseMaxBytes)return{kind:`too_large`};let v=performance.now()-p,y=/\bgzip\b/i.test(e.acceptEncoding)&&h.length>1024,x=null,S=0;if(y){let e=performance.now();x=await m(Buffer.from(h)),S=performance.now()-e}let C=performance.now()-e.loadStartMs,w=t.solveMeta.seq===c+1?t.solveMeta.last:null,T=w&&!w.fromCache&&t.rhinoTiming.seq===l+1?t.rhinoTiming.last:null,E={"Content-Type":`application/json`,"Server-Timing":b({defLoadMs:e.defLoadMs,treeBuildMs:s,solveMs:f,serializeMs:v,gzipMs:S,serverTotalMs:C,rhino:T,settle:w,byteRefOutcome:e.byteRefOutcome,prepMarks:e.prepMarks??[]}),[g]:`1`,Vary:`Accept-Encoding`},D={treeBuildMs:s,solveMs:f,serializeMs:v,gzipMs:S,serverTotalMs:C,serializedBytes:h.length,compressedBytes:x?.byteLength??null},O;return x?(E[`Content-Encoding`]=`gzip`,E[`Content-Length`]=String(x.byteLength),O={body:new Uint8Array(x),encoding:`gzip`,headers:E,result:u,metrics:D}):(E[`Content-Length`]=String(Buffer.byteLength(h)),O={body:h,headers:E,result:u,metrics:D}),{kind:`ok`,envelope:O,solveMs:f,errorCount:u.errors?.length??0,warningCount:u.warnings?.length??0}}function y(e,t){let n=/\bgzip\b/i.test(t);if(e.encoding===`gzip`&&!n){let t=l(e.body instanceof Uint8Array?e.body:Buffer.from(e.body)).toString(`utf8`),n={...e.headers};return delete n[`Content-Encoding`],n[`Content-Length`]=String(Buffer.byteLength(t)),{body:t,headers:n}}return{body:e.body,headers:e.headers}}function b(e){let t=`load;dur=${e.defLoadMs.toFixed(1)}, tree;dur=${e.treeBuildMs.toFixed(1)}, solve;dur=${e.solveMs.toFixed(1)}, serialize;dur=${e.serializeMs.toFixed(1)}, gzip;dur=${e.gzipMs.toFixed(1)}, total;dur=${e.serverTotalMs.toFixed(1)}`,n=e.rhino;if(n){let r=n.decode+n.solve+n.encode,i=Math.max(0,e.solveMs-r);t+=`, rhino_decode;dur=${n.decode.toFixed(1)}, rhino_solve;dur=${n.solve.toFixed(1)}, rhino_encode;dur=${n.encode.toFixed(1)}, compute_link;dur=${i.toFixed(1)}`}for(let[n,r]of e.prepMarks)t+=`, p_${n};dur=${r.toFixed(1)}`;let r=e.settle;r&&(t+=`, selva_cache;dur=${+!!r.fromCache}`,r.definitionReuploaded!==void 0&&(t+=`, def_reupload;dur=${+!!r.definitionReuploaded}`));let i=e.byteRefOutcome;if(i){let e=i.loaded?i.fromCache?`hit`:`miss`:`skipped`;t+=`, def_bytes;desc=${e}`}return t}function x(e){return e.id}function S(t){let n=t.maxWarmComputeServers??16,r=new Map,i=new Map;t.debug===`verbose`&&s();let a=e=>{t.debug&&t.onDebugLog?.(e)};async function o(n,r){let i={last:null,seq:0},o={last:null,seq:0},s=t.debug===`verbose`,c={serverUrl:n.serverUrl,apiKey:n.apiKey,debug:s,cachesolve:t.cachesolve,cacheerroredsolves:t.cacheerroredsolves,onServerTiming:e=>{let n=e.decode??0,r=e.solve??0,o=e.encode??0;if(i.seq+=1,i.last={decode:n,solve:r,encode:o},!t.debug)return;let s=n<=1?`HIT (definition reused, no re-upload/parse)`:`miss (full parse)`,c=t.cachesolve&&r<=1?`HIT (cached result, solve skipped)`:t.cachesolve?`miss (solved fresh)`:`off`;a(`[Compute/rhino-cache] decode=${n}ms solve=${r}ms encode=${o}ms | definition-cache: ${s} | solve-cache (cachesolve): ${c}`)}};r&&(c.headers={"X-Selva-Definition":r});let l=await e.create(c),u=1,d=0,f=!1;async function p(e){if(!f){f=!0;try{let t=await Promise.resolve(l.serverStats?.getActiveChildren({initialize:!1})).catch(()=>null);d=Date.now();let n=!t||t<=0?1:t;if(n===u)return;a(`[Compute/client-cache] concurrency ${u} → ${n} (server child count)`),u=n,e?.setMaxConcurrent(n)}finally{f=!1}}}await p();let m=l.createScheduler({mode:`queue`,maxConcurrent:u,maxQueueDepth:t.maxQueueDepth||void 0,queueWaitMs:t.queueWaitMs||void 0,timeoutMs:t.solveDeadlineMs,cache:t.responseCacheMaxBytes>0&&{maxBytes:t.responseCacheMaxBytes},reuseServerDefinitionCache:t.reuseServerDefinitionCache,onSettle:(e,n)=>{if(o.seq+=1,n.status===`success`&&(n.fromCache!==!0&&Date.now()-d>=3e5&&p(m),o.last={fromCache:n.fromCache===!0,definitionReuploaded:n.definitionReuploaded},t.debug&&(a(`[Compute/selva-cache] ${n.fromCache?`HIT  — served from cache (no compute call)`:`miss — went to Rhino.Compute`} (${Math.round(n.durationMs)}ms)`),n.fromCache||a(n.definitionReuploaded===!0?`[Compute/def-cache] miss — definition RE-UPLOADED (pointer was cold/stale)`:n.definitionReuploaded===!1?`[Compute/def-cache] HIT  — definition reused from server cache (no upload)`:`[Compute/def-cache] n/a — reuse disabled or non-reusable definition`),!n.fromCache))){let e=n.response?.errors,r=Array.isArray(e)?e.length:0;if(r>0){let n=t.cacheerroredsolves?`cached (cacheerroredsolves on)`:`not cached (cacheerroredsolves off) — re-run until fixed`;a(`[Compute/rhino-cache] ${r} GH error(s); ${n}. First: ${JSON.stringify(e[0])}`)}}}});return{client:l,scheduler:m,rhinoTiming:i,solveMeta:o}}return{async getClient(e,t){let s=e.id,c=r.get(s);if(c)return r.delete(s),r.set(s,c),c;let l=i.get(s);if(l)return l;a(`[Compute/client-cache] miss — building warm client for server ${s}`);let u=(async()=>{let i=await o(e,t?.definitionGuid);if(r.size>=n){let e=r.keys().next().value;e!==void 0&&(a(`[Compute/client-cache] LRU evicted warm client for server ${e} (cap ${n})`),r.get(e)?.scheduler.dispose(),r.delete(e))}return r.set(s,i),i})().finally(()=>i.delete(s));return i.set(s,u),u},evict(e){let t=e,n=r.get(t);n&&(a(`[Compute/client-cache] evicted warm client for server ${t} (config change)`),n.scheduler.dispose(),r.delete(t))},solveCacheStats(){let e={warmClients:r.size,entries:0,bytes:0,hits:0,misses:0,evictions:0};for(let t of r.values()){let n=t.scheduler.cacheStats();e.entries+=n.entries,e.bytes+=n.bytes,e.hits+=n.hits,e.misses+=n.misses,e.evictions+=n.evictions}return e},clearSolveCaches(){a(`[Compute/client-cache] cleared solve caches on ${r.size} warm client(s)`);for(let e of r.values())e.scheduler.clearCache()},disposeAll(){a(`[Compute/client-cache] disposing all ${r.size} warm client(s)`);for(let e of r.values())e.scheduler.dispose();r.clear()}}}function C(e){let t=Math.max(0,Math.floor(e)),n=new Map,r=0,i={hits:0,misses:0,evictions:0};function a(e,t){n.delete(e),n.set(e,t)}function o(){for(;r>t&&n.size>0;){let e=n.keys().next().value,t=n.get(e);n.delete(e),r-=t.bytes.byteLength,i.evictions+=1}}function s(e,i){if(t===0||i.byteLength>t)return;let a=n.get(e);a&&(r-=a.bytes.byteLength),n.set(e,{bytes:i}),r+=i.byteLength,o()}return{getOrLoad(e,t){let r={loaded:!1,fromCache:!1};return{key:e,outcome:r,load:async()=>{let o=n.get(e);if(o)return a(e,o),i.hits+=1,r.loaded=!0,r.fromCache=!0,o.bytes;i.misses+=1,r.loaded=!0,r.fromCache=!1;let c=await t();return s(e,c),c}}},stats(){return{hits:i.hits,misses:i.misses,evictions:i.evictions,entries:n.size,bytes:r}},clear(){n.clear(),r=0}}}function w(e={}){let t=new Map;return{run(n,r,i){let a=t.get(n);if(a)return e.onJoin?.(n),a.notifyOwner?.(),a.promise;let o={notifyOwner:i,promise:void 0},s=(async()=>r())().finally(()=>{o.notifyOwner=void 0,t.get(n)===o&&t.delete(n)});return o.promise=s,t.set(n,o),s},inFlight(){return t.size}}}function T(e){return typeof e==`object`&&!!e&&!(e instanceof Uint8Array)&&`outcome`in e}function E(e){return typeof e==`object`&&!!e&&!(e instanceof Uint8Array)&&!(`outcome`in e)&&!(`key`in e)&&`versionId`in e}var D=class{limits;clientCache;byteCache;singleFlight;constructor(e){this.limits=e.limits;let t=e.logger??new f;this.clientCache=S({solveDeadlineMs:this.limits.solveDeadlineMs,cachesolve:this.limits.computeServerCachesolve,cacheerroredsolves:this.limits.computeCacheErroredSolves,reuseServerDefinitionCache:this.limits.computeReuseDefinitionCache,maxQueueDepth:this.limits.computeMaxQueueDepth,queueWaitMs:this.limits.computeQueueWaitMs,responseCacheMaxBytes:this.limits.computeSolveCacheBytes,debug:e.debug??!1,maxWarmComputeServers:e.maxWarmComputeServers,onDebugLog:e.onDebugLog??(e=>t.debug(e,{component:`Compute/client-cache`}))}),this.byteCache=C(this.limits.computeDefinitionCacheBytes),this.singleFlight=w({onJoin:e.onSolveCoalesced})}getClient(e,t){return this.clientCache.getClient(e,t)}definitionRef(e,t){return this.byteCache.getOrLoad(e,t)}evictServer(e){this.clientCache.evict(e)}clearSolveCaches(){this.clientCache.clearSolveCaches()}stats(){return{client:this.clientCache.solveCacheStats(),definitionBytes:this.byteCache.stats(),coalescing:{inFlight:this.singleFlight.inFlight()}}}async solve(e){let{definitionSource:t,byteRefOutcome:n,identity:r}=this.resolveDefinitionSource(e),a=await this.clientCache.getClient(e.server,{definitionGuid:e.definitionGuid}),o=_(e.inputs,e.values),s=`${r}:${e.server.id}:${i(o)}`,c=new AbortController,l=!1,u=()=>{l||c.abort()};e.signal.addEventListener(`abort`,u,{once:!0});let d=e.acceptEncoding??``,f;try{f=await this.singleFlight.run(s,()=>v({definitionSource:t,byteRefOutcome:n,inputs:e.inputs,values:e.values,inputTree:o,client:a,responseMaxBytes:this.limits.computeResponseMaxBytes,solveDeadlineMs:this.limits.solveDeadlineMs,acceptEncoding:d,signal:c.signal,loadStartMs:e.loadStartMs??performance.now(),defLoadMs:e.defLoadMs??0,prepMarks:e.prepMarks}),()=>{l=!0})}finally{e.signal.removeEventListener(`abort`,u)}if(f.kind!==`ok`)return f;let p=y(f.envelope,d);return{...f,envelope:{...f.envelope,body:p.body,headers:p.headers}}}toResponse(e,t){let n=(e,n)=>{t?.onError&&t.onError(e,n);let r={"Content-Type":`application/json`};return n.retryAfter!==void 0&&(r[`Retry-After`]=String(n.retryAfter)),{status:e,headers:r,body:JSON.stringify(n)}};switch(e.kind){case`ok`:return{status:200,headers:e.envelope.headers,body:e.envelope.body};case`timeout`:return n(504,{message:e.message});case`client_abort`:return n(499,{message:`Client closed request`});case`too_large`:return n(413,{message:`Solve result is too large to return. This usually means a file output exceeds the supported size.`});case`shed`:return n(503,{message:e.message,retryAfter:e.retryAfterSeconds});case`compute_error`:throw e.error}}toWebResponse(e){let t=this.toResponse(e);return new Response(typeof t.body==`string`?t.body:new Uint8Array(t.body),{status:t.status,headers:t.headers})}resolveDefinitionSource(e){let t=e.definitionSource;if(E(t)){let e=this.byteCache.getOrLoad(t.versionId,t.load);return{definitionSource:e,byteRefOutcome:e.outcome,identity:e.key}}if(T(t))return{definitionSource:t,byteRefOutcome:t.outcome,identity:t.key};if(n(t))return{definitionSource:t,identity:t.key};if(!e.definitionKey)throw Error(`SolveEngine.solve(): definitionKey is required when definitionSource is raw bytes or a string.`);return{definitionSource:t,identity:e.definitionKey}}};export{h as COMPUTE_CONTRACT_VERSION,g as COMPUTE_VERSION_HEADER,D as SolveEngine,y as adaptEnvelopeToEncoding,_ as buildSolveInputTree,S as createClientCache,C as createDefinitionByteCache,w as createSolveCacheSingleFlight,c as isDefinitionRef,v as runSolvePipeline,x as serverIdentity,p as transformInputParameter};
 //# sourceMappingURL=server.js.map

package/dist/server.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/server/solve-pipeline.ts","../src/server/transform-input.ts","../src/server/client-cache.ts","../src/server/definition-byte-cache.ts","../src/server/solve-cache-single-flight.ts","../src/server/solve-engine.ts","../src/server/index.ts"],"sourcesContent":["/**\n * Transport-agnostic solve pipeline: given an already-resolved solve context\n * (`.gh` bytes, input params + user values, a warm `SolveScheduler`), runs the\n * solve and returns a discriminated {@link SolveOutcome} instead of throwing\n * for expected failures. Auth, the database, share tokens, rate limits, and\n * metric sinks are the calling route's job, not this file's.\n */\n\nimport {\n\tErrorCodes,\n\tRhinoComputeError,\n\tTreeBuilder,\n\ttype DataTree,\n\ttype GrasshopperComputeResponse,\n\ttype InputParam,\n\ttype SolveDefinition\n} from '@selvajs/compute';\nimport type { SchemaInput } from '@selvajs/schemas';\nimport { gzip, gunzipSync } from 'node:zlib';\nimport { promisify } from 'node:util';\nimport { transformInputParameter } from './transform-input.js';\nimport type { CachedClient } from './client-cache.js';\nimport type { ByteRefOutcome } from './definition-byte-cache.js';\n\n// gzipSync blocks the event loop for multi-MB bodies; promisify(gzip) doesn't.\nconst gzipAsync = promisify(gzip);\n\n// ============================================================================\n// Wire contract version\n// ============================================================================\n\n/** Compute-response contract version. Bump (and document the change) whenever the envelope's shape changes in a way a consumer could observe. */\nexport const COMPUTE_CONTRACT_VERSION = 1 as const;\nexport const COMPUTE_VERSION_HEADER = 'X-Selva-Compute-Version';\n\n// ============================================================================\n// Inputs & outcomes\n// ============================================================================\n\nexport type PipelineInput = SchemaInput & {\n\tminimum?: number;\n\tmaximum?: number;\n\tstepSize?: number;\n};\n\nexport interface SolvePipelineArgs {\n\t/**\n\t * Raw `.gh` bytes, or a byte-cache `DefinitionRef` whose bytes the scheduler\n\t * materializes only when an upload is unavoidable — a pointer-known solve\n\t * moves zero bytes.\n\t */\n\tdefinitionSource: SolveDefinition;\n\t/** Mutable load outcome for a `DefinitionRef` source, so the `def_bytes` Server-Timing verdict can be emitted. Omit for raw-bytes solves. */\n\tbyteRefOutcome?: ByteRefOutcome;\n\t/** Persisted input params; only those with a `paramType` are sent to the solve. */\n\tinputs: PipelineInput[];\n\t/**\n\t * A tree the caller already built with {@link buildSolveInputTree}; skips the\n\t * pipeline's own build and solves this object directly.\n\t *\n\t * A caller coalescing concurrent solves needs this: a single-flight key\n\t * derived from raw `{inputs, values}` would split two requests that transform\n\t * to the same tree, which is the identity the scheduler actually caches on.\n\t */\n\tinputTree?: DataTree[];\n\t/** User-chosen values keyed by input id; missing keys fall back to the schema default. */\n\tvalues: Record<string, unknown>;\n\tclient: CachedClient;\n\tresponseMaxBytes: number;\n\t/** Only phrases the timeout message — the scheduler enforces the deadline itself. */\n\tmaxSolveDurationMs: number;\n\t/** Client's `Accept-Encoding`; gzip is applied only when it advertises `gzip`. */\n\tacceptEncoding: string;\n\t/**\n\t * Forwarded to the scheduler so a client disconnect cancels the upstream\n\t * compute call. Its `aborted` flag also distinguishes a client disconnect\n\t * from the scheduler's own deadline firing.\n\t */\n\tsignal: AbortSignal;\n\t/** Wall-clock origin (`performance.now()` at the top of the request) so `load`/`total` phase timings line up with the caller's pre-solve prep. */\n\tloadStartMs: number;\n\t/** Pre-solve \"load\" phase duration the caller already measured (auth + DB + fetch). */\n\tdefLoadMs: number;\n\t/** Pre-solve prep sub-phase marks (`[label, ms]`), surfaced verbatim as `p_*` Server-Timing entries. */\n\tprepMarks?: [string, number][];\n}\n\n/** Phase timings the pipeline measured; the caller uses them for debug logging. */\nexport interface SolvePhaseMetrics {\n\ttreeBuildMs: number;\n\tsolveMs: number;\n\tserializeMs: number;\n\tgzipMs: number;\n\tserverTotalMs: number;\n\tserializedBytes: number;\n\t/** Null when compression was skipped. */\n\tcompressedBytes: number | null;\n}\n\n/** A ready-to-send response: body + headers + the solve result + phase metrics. */\nexport interface SolveEnvelope {\n\t/** A gzip `Uint8Array` when `encoding === 'gzip'`, else the JSON string. */\n\tbody: string | Uint8Array;\n\tencoding?: 'gzip';\n\theaders: Record<string, string>;\n\tresult: GrasshopperComputeResponse;\n\tmetrics: SolvePhaseMetrics;\n}\n\n/**\n * `ok` carries the envelope; every other variant names an expected failure the\n * calling route maps to a status code (timeout→504, client_abort→499,\n * too_large→413, shed→503+Retry-After, compute_error→generic 500/503).\n * `durationMs` on error variants is the solve wall time up to the failure, for\n * the metric record.\n */\nexport type SolveOutcome =\n\t| {\n\t\t\tkind: 'ok';\n\t\t\tenvelope: SolveEnvelope;\n\t\t\tsolveMs: number;\n\t\t\terrorCount: number;\n\t\t\twarningCount: number;\n\t  }\n\t| { kind: 'timeout'; durationMs: number; message: string }\n\t| { kind: 'client_abort'; durationMs: number }\n\t| { kind: 'too_large' }\n\t/** Scheduler backpressure rejected the solve before it ran: queue was full (`queue_full`) or the wait exceeded the deadline (`queue_timeout`). Retryable — `retryAfterSeconds` is a backoff hint. */\n\t| {\n\t\t\tkind: 'shed';\n\t\t\tdurationMs: number;\n\t\t\treason: 'queue_full' | 'queue_timeout';\n\t\t\tretryAfterSeconds: number;\n\t\t\tmessage: string;\n\t  }\n\t| { kind: 'compute_error'; durationMs: number; error: unknown };\n\n// ============================================================================\n// Pipeline\n// ============================================================================\n\n/** The transformed input tree exactly as handed to the scheduler; `runSolvePipeline` calls this itself unless the caller supplies {@link SolvePipelineArgs.inputTree}. */\nexport function buildSolveInputTree(\n\tinputs: PipelineInput[],\n\tvalues: Record<string, unknown>\n): DataTree[] {\n\treturn TreeBuilder.fromInputParams(\n\t\tinputs\n\t\t\t.filter((input) => input.paramType)\n\t\t\t.map((input): InputParam => transformInputParameter(input, values[input.id]))\n\t);\n}\n\nexport async function runSolvePipeline(args: SolvePipelineArgs): Promise<SolveOutcome> {\n\tconst { client, signal } = args;\n\n\tconst treeBuildStart = performance.now();\n\tconst inputTree = args.inputTree ?? buildSolveInputTree(args.inputs, args.values);\n\tconst treeBuildMs = performance.now() - treeBuildStart;\n\n\t// client.solveMeta/rhinoTiming live on the warm client and are written by\n\t// every request on this server; with scheduler maxConcurrent > 1, another\n\t// request can write them mid-flight. A slot is attributed to THIS request\n\t// only if exactly one write happened since this snapshot — for solveMeta\n\t// that single settle is necessarily ours, since onSettle fires before\n\t// scheduler.solve() resolves. Anything ambiguous is dropped from\n\t// Server-Timing rather than misattributed.\n\tconst settleSeqBefore = client.solveMeta.seq;\n\tconst rhinoSeqBefore = client.rhinoTiming.seq;\n\n\tlet result: GrasshopperComputeResponse;\n\tconst solveStart = performance.now();\n\ttry {\n\t\tresult = await client.scheduler.solve(args.definitionSource, inputTree, { signal });\n\t} catch (err) {\n\t\tconst durationMs = performance.now() - solveStart;\n\t\t// AbortError with the request signal NOT aborted means the scheduler's own\n\t\t// deadline timer fired, not a client disconnect.\n\t\tconst isAbort = err instanceof Error && err.name === 'AbortError';\n\t\tif (isAbort) {\n\t\t\tif (signal.aborted) return { kind: 'client_abort', durationMs };\n\t\t\treturn {\n\t\t\t\tkind: 'timeout',\n\t\t\t\tdurationMs,\n\t\t\t\tmessage: `Solve exceeded the ${Math.round(args.maxSolveDurationMs / 1000)}s deadline.`\n\t\t\t};\n\t\t}\n\t\t// Queue-full or queue-timeout rejects the solve before compute runs — a load\n\t\t// signal, not a failure, so it's `shed` rather than `compute_error`.\n\t\tif (err instanceof RhinoComputeError) {\n\t\t\tif (err.code === ErrorCodes.QUEUE_FULL) {\n\t\t\t\treturn {\n\t\t\t\t\tkind: 'shed',\n\t\t\t\t\tdurationMs,\n\t\t\t\t\treason: 'queue_full',\n\t\t\t\t\tretryAfterSeconds: 1,\n\t\t\t\t\tmessage: 'Compute server is at capacity. Retry shortly.'\n\t\t\t\t};\n\t\t\t}\n\t\t\tif (err.code === ErrorCodes.QUEUE_TIMEOUT) {\n\t\t\t\treturn {\n\t\t\t\t\tkind: 'shed',\n\t\t\t\t\tdurationMs,\n\t\t\t\t\treason: 'queue_timeout',\n\t\t\t\t\tretryAfterSeconds: 1,\n\t\t\t\t\tmessage: 'Compute request waited too long in the queue. Retry shortly.'\n\t\t\t\t};\n\t\t\t}\n\t\t}\n\t\treturn { kind: 'compute_error', durationMs, error: err };\n\t}\n\tconst solveMs = performance.now() - solveStart;\n\n\tconst serializeStart = performance.now();\n\tlet serialized: string;\n\ttry {\n\t\tserialized = JSON.stringify(result);\n\t} catch (err) {\n\t\t// V8 caps a string at ~512 MB; an oversized `file` output trips a RangeError\n\t\t// here. Treat it the same as the byte cap: too_large.\n\t\tif (err instanceof RangeError) return { kind: 'too_large' };\n\t\tthrow err;\n\t}\n\tif (serialized.length > args.responseMaxBytes) return { kind: 'too_large' };\n\tconst serializeMs = performance.now() - serializeStart;\n\n\t// Buffered, not streamed, so Content-Length is known upfront and a connection\n\t// cut mid-transfer fails hard instead of silently truncating the JSON. Below\n\t// 1 KB gzip isn't worth the CPU for the wire savings.\n\tconst clientWantsGzip = /\\bgzip\\b/i.test(args.acceptEncoding);\n\tconst worthSendingGzip = clientWantsGzip && serialized.length > 1024;\n\tlet compressed: Buffer | null = null;\n\tlet gzipMs = 0;\n\tif (worthSendingGzip) {\n\t\tconst gzipStart = performance.now();\n\t\tcompressed = await gzipAsync(Buffer.from(serialized));\n\t\tgzipMs = performance.now() - gzipStart;\n\t}\n\n\tconst serverTotalMs = performance.now() - args.loadStartMs;\n\n\t// rhino is only meaningful when settle is ours AND it was a real compute call\n\t// (a Selva-cache hit never reaches the server), and only unambiguous when\n\t// exactly one Server-Timing callback fired in the window.\n\tconst settle = client.solveMeta.seq === settleSeqBefore + 1 ? client.solveMeta.last : null;\n\tconst rhino =\n\t\tsettle && !settle.fromCache && client.rhinoTiming.seq === rhinoSeqBefore + 1\n\t\t\t? client.rhinoTiming.last\n\t\t\t: null;\n\n\tconst serverTiming = buildServerTiming({\n\t\tdefLoadMs: args.defLoadMs,\n\t\ttreeBuildMs,\n\t\tsolveMs,\n\t\tserializeMs,\n\t\tgzipMs,\n\t\tserverTotalMs,\n\t\trhino,\n\t\tsettle,\n\t\tbyteRefOutcome: args.byteRefOutcome,\n\t\tprepMarks: args.prepMarks ?? []\n\t});\n\n\tconst headers: Record<string, string> = {\n\t\t'Content-Type': 'application/json',\n\t\t'Server-Timing': serverTiming,\n\t\t[COMPUTE_VERSION_HEADER]: String(COMPUTE_CONTRACT_VERSION),\n\t\tVary: 'Accept-Encoding'\n\t};\n\n\tconst metrics: SolvePhaseMetrics = {\n\t\ttreeBuildMs,\n\t\tsolveMs,\n\t\tserializeMs,\n\t\tgzipMs,\n\t\tserverTotalMs,\n\t\tserializedBytes: serialized.length,\n\t\tcompressedBytes: compressed?.byteLength ?? null\n\t};\n\n\tlet envelope: SolveEnvelope;\n\tif (compressed) {\n\t\t// Content-Encoding tells a downstream proxy the body is already compressed,\n\t\t// so it won't gzip it again.\n\t\theaders['Content-Encoding'] = 'gzip';\n\t\theaders['Content-Length'] = String(compressed.byteLength);\n\t\tenvelope = {\n\t\t\tbody: new Uint8Array(compressed),\n\t\t\tencoding: 'gzip',\n\t\t\theaders,\n\t\t\tresult,\n\t\t\tmetrics\n\t\t};\n\t} else {\n\t\theaders['Content-Length'] = String(Buffer.byteLength(serialized));\n\t\tenvelope = { body: serialized, headers, result, metrics };\n\t}\n\n\treturn {\n\t\tkind: 'ok',\n\t\tenvelope,\n\t\tsolveMs,\n\t\terrorCount: result.errors?.length ?? 0,\n\t\twarningCount: result.warnings?.length ?? 0\n\t};\n}\n\n// ============================================================================\n// Per-waiter encoding adaptation\n// ============================================================================\n\n/**\n * Re-key a coalesced envelope to a single waiter's `Accept-Encoding`.\n *\n * The single-flight coalescer runs ONE pipeline execution for N identical\n * concurrent solves and hands every waiter the same {@link SolveEnvelope},\n * baked from the FIRST caller's `Accept-Encoding`. A later waiter with a\n * different `Accept-Encoding` would otherwise get a body labelled with the\n * wrong encoding — `Vary` can't help here, since it's one shared object, not a\n * cache lookup. Encoding is deliberately left out of the coalesce key so mixed\n * clients still coalesce; this adapts the shared result to each waiter instead.\n *\n * Only the correctness-critical direction is adapted: a gzip envelope served to\n * a non-gzip waiter is gunzipped back to JSON. The reverse (plain JSON to a\n * gzip-capable waiter) is left uncompressed — correct, just not maximally small.\n */\nexport function adaptEnvelopeToEncoding(\n\tenvelope: SolveEnvelope,\n\tacceptEncoding: string\n): { body: string | Uint8Array; headers: Record<string, string> } {\n\tconst waiterWantsGzip = /\\bgzip\\b/i.test(acceptEncoding);\n\n\t// Only mismatch that corrupts the response: gzip body, non-gzip waiter.\n\t// Every other combination is already wire-correct.\n\tif (envelope.encoding === 'gzip' && !waiterWantsGzip) {\n\t\tconst json = gunzipSync(\n\t\t\tenvelope.body instanceof Uint8Array ? envelope.body : Buffer.from(envelope.body)\n\t\t).toString('utf8');\n\t\tconst headers = { ...envelope.headers };\n\t\tdelete headers['Content-Encoding'];\n\t\theaders['Content-Length'] = String(Buffer.byteLength(json));\n\t\treturn { body: json, headers };\n\t}\n\n\treturn { body: envelope.body, headers: envelope.headers };\n}\n\n// ============================================================================\n// Server-Timing assembly\n// ============================================================================\n\ninterface ServerTimingParts {\n\tdefLoadMs: number;\n\ttreeBuildMs: number;\n\tsolveMs: number;\n\tserializeMs: number;\n\tgzipMs: number;\n\tserverTotalMs: number;\n\trhino: CachedClient['rhinoTiming']['last'];\n\tsettle: CachedClient['solveMeta']['last'];\n\tbyteRefOutcome?: ByteRefOutcome;\n\tprepMarks: [string, number][];\n}\n\n/**\n * `total` is the server's headers-to-out wall time, so browser `ttfb − total`\n * ≈ network+send latency. When the compute server reports its own\n * decode/solve/encode (VektorNode fork), `rhino_*` is time on the compute\n * server and `compute_link` is everything between it (network + queue wait).\n */\nfunction buildServerTiming(parts: ServerTimingParts): string {\n\tlet header =\n\t\t`load;dur=${parts.defLoadMs.toFixed(1)}, ` +\n\t\t`tree;dur=${parts.treeBuildMs.toFixed(1)}, ` +\n\t\t`solve;dur=${parts.solveMs.toFixed(1)}, ` +\n\t\t`serialize;dur=${parts.serializeMs.toFixed(1)}, ` +\n\t\t`gzip;dur=${parts.gzipMs.toFixed(1)}, ` +\n\t\t`total;dur=${parts.serverTotalMs.toFixed(1)}`;\n\n\tconst rhino = parts.rhino;\n\tif (rhino) {\n\t\tconst onRhinoMs = rhino.decode + rhino.solve + rhino.encode;\n\t\tconst computeLinkMs = Math.max(0, parts.solveMs - onRhinoMs);\n\t\theader +=\n\t\t\t`, rhino_decode;dur=${rhino.decode.toFixed(1)}` +\n\t\t\t`, rhino_solve;dur=${rhino.solve.toFixed(1)}` +\n\t\t\t`, rhino_encode;dur=${rhino.encode.toFixed(1)}` +\n\t\t\t`, compute_link;dur=${computeLinkMs.toFixed(1)}`;\n\t}\n\n\tfor (const [label, ms] of parts.prepMarks) {\n\t\theader += `, p_${label};dur=${ms.toFixed(1)}`;\n\t}\n\n\tconst settle = parts.settle;\n\tif (settle) {\n\t\theader += `, selva_cache;dur=${settle.fromCache ? 1 : 0}`;\n\t\tif (settle.definitionReuploaded !== undefined) {\n\t\t\theader += `, def_reupload;dur=${settle.definitionReuploaded ? 1 : 0}`;\n\t\t}\n\t}\n\n\t// skipped = scheduler never materialized bytes (pointer-known solve, the\n\t// whole point of this path); hit = warm byte cache; miss = fell through to\n\t// storage. Absent for raw-bytes solves.\n\tconst byteRef = parts.byteRefOutcome;\n\tif (byteRef) {\n\t\tconst verdict = !byteRef.loaded ? 'skipped' : byteRef.fromCache ? 'hit' : 'miss';\n\t\theader += `, def_bytes;desc=${verdict}`;\n\t}\n\n\treturn header;\n}\n","import { type InputParam, type InputParamSchema, processInput } from '@selvajs/compute';\nimport type { SchemaInput } from '@selvajs/schemas';\n\n/**\n * `SchemaInput` has no `values`/`acceptedFormats` (those live on the layout item's config), so\n * valueList/file inputs here carry just the selected value with no option list.\n */\nexport function transformInputParameter(\n\tinput: SchemaInput & { minimum?: number; maximum?: number; stepSize?: number },\n\tvalue: unknown\n): InputParam {\n\tconst raw: InputParamSchema = {\n\t\tid: input.id,\n\t\tname: input.nickname,\n\t\tnickname: input.nickname || null,\n\t\tdescription: input.description || '',\n\t\t// processInput has no dynamicValueList handler — the plugin's GetDynamicValueListParameter\n\t\t// reuses TypeName \"ValueList\" on the wire, so map it here or it falls back to Geometry with\n\t\t// a null default and TreeBuilder drops the input (Grasshopper solves on a stale fallback).\n\t\tparamType: input.paramType === 'dynamicValueList' ? 'valueList' : input.paramType,\n\t\ttreeAccess: input.inputStructure === 'tree',\n\t\tminimum: input.minimum ?? null,\n\t\tmaximum: input.maximum ?? null,\n\t\tatLeast: 1,\n\t\tatMost: 1,\n\t\tstepSize: input.stepSize,\n\t\tdefault: value ?? input.default\n\t};\n\n\tconst processed = processInput(raw);\n\t// processInput drops a default in two cases we need to override, or the input is omitted from\n\t// the solve and the user's selection never reaches Grasshopper: a plain array default (e.g. a\n\t// dynamic value list checklist) is rejected as malformed; and ValueList drops a scalar default\n\t// it can't validate against a `values` map — which SchemaInput never carries, so every app\n\t// value-list selection hits this path.\n\tconst effective = value ?? input.default;\n\tif (processed.default == null && effective != null) {\n\t\tif (Array.isArray(effective)) {\n\t\t\t(processed as { default: unknown }).default = effective;\n\t\t} else if (processed.paramType === 'ValueList' && typeof effective !== 'object') {\n\t\t\t// Restoring for other types would mean shipping a value the package rejected as\n\t\t\t// genuinely unparseable — scoped to ValueList only.\n\t\t\t(processed as { default: unknown }).default = effective;\n\t\t}\n\t}\n\treturn processed;\n}\n","import {\n\tGrasshopperClient,\n\tenableDebugLogging,\n\ttype GrasshopperComputeConfig,\n\ttype SolveScheduler\n} from '@selvajs/compute';\n\n// ============================================================================\n// Shared compute client cache\n// ============================================================================\n//\n// One warm `GrasshopperClient` (+ its `SolveScheduler`) per distinct compute\n// server, keyed by the server's `id`, never its URL — a rotated URL/apiKey\n// keeps the same key with stale connection details, so the config-write path\n// MUST call `evict(id)` when a server's config changes.\n//\n// Per-server LRU, not a single shared client: definitions can pin different\n// servers, so two definitions on two servers keep two warm clients, with\n// churn from one-off servers bounded by `maxWarmComputeServers`.\n//\n// Both hot paths share this cache — the solve endpoint uses the entry's\n// `scheduler`; the definition-viewer render path uses the entry's `client`\n// for `getIO` — so a definition that was just solved renders from the same\n// warm client instead of re-handshaking Rhino.Compute per page load.\n\n/**\n * Opaque identity of a compute server — construct only via `serverIdentity()`.\n * Kept opaque so \"a server is now a pool of URLs behind one id\" stays additive.\n */\nexport type ServerIdentity = string & { readonly __brand: 'ServerIdentity' };\n\n/** Minimal resolved-server shape the cache needs (a subset of the app's `ComputeServerConfig`). */\nexport interface ResolvedServer {\n\tid: string;\n\tserverUrl: string;\n\t/** Sent as the `RhinoComputeKey` header. */\n\tapiKey?: string;\n}\n\nexport function serverIdentity(server: Pick<ResolvedServer, 'id'>): ServerIdentity {\n\treturn server.id as ServerIdentity;\n}\n\nexport interface CachedClient {\n\tclient: GrasshopperClient;\n\tscheduler: SolveScheduler;\n\t/**\n\t * Last Server-Timing decode/solve/encode, written by `onServerTiming`. The\n\t * scheduler runs up to `maxConcurrent` solves at once, so `last` alone can't\n\t * be trusted per-request: callers snapshot `seq` before their solve and only\n\t * attribute `last` to themselves if exactly one write happened since (see\n\t * the guard in `runSolvePipeline`), dropping it otherwise rather than risk\n\t * misattributing another request's timing.\n\t */\n\trhinoTiming: { last: { decode: number; solve: number; encode: number } | null; seq: number };\n\t/**\n\t * Same snapshot-and-attribute pattern as `rhinoTiming`, for the scheduler's\n\t * `onSettle` cache verdict. `seq` increments on every settle (success or\n\t * error); `last` is written only on success.\n\t */\n\tsolveMeta: {\n\t\tlast: { fromCache: boolean; definitionReuploaded?: boolean } | null;\n\t\tseq: number;\n\t};\n}\n\n/**\n * Debug verbosity: `false` is silent, `true` gives concise cache/timing logs\n * (`onDebugLog`), `'verbose'` also enables full lib-level request/response\n * dumps (incl. geometry) — a superset of `true`, not an independent setting.\n */\nexport type ClientCacheDebug = boolean | 'verbose';\n\n/** Config injected by the consuming app, so this module stays env-agnostic and testable. */\nexport interface ClientCacheConfig {\n\t/** Per-solve timeout forwarded to the scheduler (`ComputeLimits.maxSolveDurationMs`). */\n\tmaxSolveDurationMs: number;\n\tcachesolve: boolean;\n\t/** Only meaningful with `cachesolve`. */\n\tcacheerroredsolves: boolean;\n\t/** Reference large definitions by server cache key instead of re-uploading. */\n\treuseServerDefinitionCache: boolean;\n\t/**\n\t * Max solves that may wait in the FIFO queue, excluding in-flight solves\n\t * (capped at `maxConcurrent`, itself driven by the server's probed child\n\t * count). `0` = unbounded (`ComputeLimits.computeMaxQueueDepth`); a full\n\t * queue rejects new solves with `QUEUE_FULL`.\n\t */\n\tmaxQueueDepth: number;\n\t/**\n\t * Max ms a solve may sit queued before executing; `0` = no deadline\n\t * (`ComputeLimits.computeQueueWaitMs`). Too long a wait rejects with\n\t * `QUEUE_TIMEOUT`.\n\t */\n\tqueueWaitMs: number;\n\t/**\n\t * Byte budget for this client's in-process solve cache. Applies per warm\n\t * client — worst-case heap is this × `maxWarmComputeServers`. `0` disables\n\t * the cache (`ComputeLimits.computeSolveCacheBytes`, env `COMPUTE_SOLVE_CACHE_MB`).\n\t */\n\tresponseCacheMaxBytes: number;\n\tdebug: ClientCacheDebug;\n\t/** Max distinct warm compute servers before the LRU evicts the oldest. Default 16. */\n\tmaxWarmComputeServers?: number;\n\t/** Sink for the debug lines. `onDebugLog` only fires when `debug` is not `false`. */\n\tonDebugLog?: (message: string) => void;\n}\n\nexport interface ClientCache {\n\t/**\n\t * Get (or create) the warm client + scheduler for a resolved compute server,\n\t * keyed by its `id`. `definitionGuid`, when present, is stamped as the\n\t * `X-Selva-Definition` header on this client's outbound solve/IO requests —\n\t * inert routing/telemetry metadata until a pool router exists.\n\t */\n\tgetClient(server: ResolvedServer, opts?: { definitionGuid?: string }): Promise<CachedClient>;\n\t/** Dispose and drop the warm client for `id`, so the next request rebuilds against fresh connection details. */\n\tevict(id: string | ServerIdentity): void;\n\t/** Solve-cache counters summed across every warm client. Counters die with the client that owns them, so totals can fall over time. */\n\tsolveCacheStats(): SolveCacheStats;\n\t/**\n\t * Drop every retained solve result, keeping the warm clients (and their\n\t * connections and server-side definition pointers) intact. Nothing expires\n\t * these on its own — the byte budget is the only other pressure — so this is\n\t * the operator's release valve when a definition's inputs no longer describe\n\t * its output, e.g. it reads an external source that has since changed.\n\t */\n\tclearSolveCaches(): void;\n\t/** Dispose every warm client. Test seam / shutdown hook. */\n\tdisposeAll(): void;\n}\n\nexport interface SolveCacheStats {\n\twarmClients: number;\n\tentries: number;\n\tbytes: number;\n\thits: number;\n\tmisses: number;\n\t/** Entries dropped under size/byte pressure (not replacement or manual clears). */\n\tevictions: number;\n}\n\nconst DEFAULT_MAX_WARM_COMPUTE_SERVERS = 16;\n\n/**\n * Fallback concurrency while the first probe is still in flight, and the value\n * kept whenever a probe fails or reports 0 — never send more than a single\n * solve to a server whose real capacity is unknown.\n */\nconst FALLBACK_CONCURRENCY = 1;\n\n/**\n * How stale the compute server's child count may get before a solve triggers a\n * re-read. Short enough that a resized pool is picked up within a few solves,\n * long enough that a busy server is probed rarely — the probe rides on solve\n * completion, so an idle server is never polled at all.\n */\nconst CONCURRENCY_PROBE_INTERVAL_MS = 5 * 60 * 1000;\n\nexport function createClientCache(config: ClientCacheConfig): ClientCache {\n\tconst maxWarmComputeServers = config.maxWarmComputeServers ?? DEFAULT_MAX_WARM_COMPUTE_SERVERS;\n\tconst cache = new Map<string, CachedClient>();\n\t// Builds in flight, keyed like `cache`. Concurrent `getClient` calls for the\n\t// same id must share ONE build: without this, both miss, both handshake, and\n\t// the loser's entry is overwritten in the map without ever being disposed.\n\tconst pending = new Map<string, Promise<CachedClient>>();\n\n\tif (config.debug === 'verbose') enableDebugLogging();\n\n\tconst debugLog = (message: string) => {\n\t\tif (config.debug) config.onDebugLog?.(message);\n\t};\n\n\tasync function build(server: ResolvedServer, definitionGuid?: string): Promise<CachedClient> {\n\t\tconst rhinoTiming: CachedClient['rhinoTiming'] = { last: null, seq: 0 };\n\t\tconst solveMeta: CachedClient['solveMeta'] = { last: null, seq: 0 };\n\t\tconst debugVerbose = config.debug === 'verbose';\n\n\t\tconst clientConfig: GrasshopperComputeConfig = {\n\t\t\tserverUrl: server.serverUrl,\n\t\t\tapiKey: server.apiKey,\n\t\t\t// Lib-level debug is the verbose one (full payload logs); keep it on the\n\t\t\t// verbose flag so the concise cache logs can run without the noise.\n\t\t\tdebug: debugVerbose,\n\t\t\tcachesolve: config.cachesolve,\n\t\t\tcacheerroredsolves: config.cacheerroredsolves,\n\t\t\tonServerTiming: (t) => {\n\t\t\t\tconst decode = t.decode ?? 0;\n\t\t\t\tconst solve = t.solve ?? 0;\n\t\t\t\tconst encode = t.encode ?? 0;\n\t\t\t\trhinoTiming.seq += 1;\n\t\t\t\trhinoTiming.last = { decode, solve, encode };\n\t\t\t\tif (!config.debug) return;\n\t\t\t\t// Heuristic thresholds: a genuine parse/solve is many ms; a cache hit\n\t\t\t\t// is sub-millisecond. Only meaningful relative to the first (cold) solve.\n\t\t\t\tconst defCache =\n\t\t\t\t\tdecode <= 1 ? 'HIT (definition reused, no re-upload/parse)' : 'miss (full parse)';\n\t\t\t\tconst solveCache =\n\t\t\t\t\tconfig.cachesolve && solve <= 1\n\t\t\t\t\t\t? 'HIT (cached result, solve skipped)'\n\t\t\t\t\t\t: config.cachesolve\n\t\t\t\t\t\t\t? 'miss (solved fresh)'\n\t\t\t\t\t\t\t: 'off';\n\t\t\t\tdebugLog(\n\t\t\t\t\t`[Compute/rhino-cache] decode=${decode}ms solve=${solve}ms encode=${encode}ms ` +\n\t\t\t\t\t\t`| definition-cache: ${defCache} | solve-cache (cachesolve): ${solveCache}`\n\t\t\t\t);\n\t\t\t}\n\t\t};\n\n\t\t// Baked at client-create time because the scheduler has no per-request\n\t\t// header hook.\n\t\tif (definitionGuid) {\n\t\t\tclientConfig.headers = { 'X-Selva-Definition': definitionGuid };\n\t\t}\n\n\t\tconst client = await GrasshopperClient.create(clientConfig);\n\n\t\t// rhino.compute hands out children in strict rotation and never reports \"busy\",\n\t\t// so nothing downstream enforces a concurrency cap — send more than it has\n\t\t// children and requests silently double up on one. Rhino.Compute is the only\n\t\t// source of truth for its own child count, so this always probes rather than\n\t\t// trusting an operator-supplied guess.\n\t\t//\n\t\t// The count is not static: children exit on their own under `-idlespan`, and\n\t\t// `/launch-child` + `/recycle-children` resize the pool at runtime. So the probe\n\t\t// re-runs after solves (see `refreshConcurrency`) rather than only at connect.\n\t\tlet maxConcurrent = FALLBACK_CONCURRENCY;\n\t\tlet lastProbeAt = 0;\n\t\tlet probing = false;\n\n\t\t/**\n\t\t * Best-effort re-read of the server's child count. Never awaited by a caller:\n\t\t * a probe must not add a round-trip to the solve path, so a changed count takes\n\t\t * effect on the NEXT solve rather than the one that triggered the probe.\n\t\t *\n\t\t * `initialize: false` keeps this from spawning children on an idle server —\n\t\t * which also means a cold server honestly reports 0. Both a failed probe and a\n\t\t * 0 result fall back to `FALLBACK_CONCURRENCY` (1): an unknown-capacity server\n\t\t * is safer under-used than oversent.\n\t\t */\n\t\tasync function refreshConcurrency(scheduler?: { setMaxConcurrent(n: number): void }) {\n\t\t\tif (probing) return;\n\t\t\tprobing = true;\n\t\t\ttry {\n\t\t\t\tconst children = await Promise.resolve(\n\t\t\t\t\tclient.serverStats?.getActiveChildren({ initialize: false })\n\t\t\t\t).catch(() => null);\n\t\t\t\tlastProbeAt = Date.now();\n\t\t\t\tconst next = !children || children <= 0 ? FALLBACK_CONCURRENCY : children;\n\t\t\t\tif (next === maxConcurrent) return;\n\t\t\t\tdebugLog(\n\t\t\t\t\t`[Compute/client-cache] concurrency ${maxConcurrent} → ${next} (server child count)`\n\t\t\t\t);\n\t\t\t\tmaxConcurrent = next;\n\t\t\t\tscheduler?.setMaxConcurrent(next);\n\t\t\t} finally {\n\t\t\t\tprobing = false;\n\t\t\t}\n\t\t}\n\n\t\t// One blocking probe at connect so the first solves already use the right cap.\n\t\tawait refreshConcurrency();\n\n\t\tconst scheduler = client.createScheduler({\n\t\t\tmode: 'queue',\n\t\t\t// Queue mode defaults maxConcurrent to 1, serializing every solve on\n\t\t\t// this server through a single slot while the compute VM's other\n\t\t\t// compute.geometry children idle — always pass it explicitly.\n\t\t\tmaxConcurrent,\n\t\t\t// The scheduler treats undefined as unbounded/no-deadline, so map our\n\t\t\t// `0`-means-off convention to undefined rather than passing 0 (which\n\t\t\t// would reject EVERY queued solve).\n\t\t\tmaxQueueDepth: config.maxQueueDepth || undefined,\n\t\t\tqueueWaitMs: config.queueWaitMs || undefined,\n\t\t\ttimeoutMs: config.maxSolveDurationMs,\n\t\t\t// The byte budget is the only eviction pressure. A solve is a pure\n\t\t\t// function of (definition, inputs), both immutable, so a retained\n\t\t\t// result can never go stale — expiring one only forces a paid re-solve\n\t\t\t// of the identical answer.\n\t\t\tcache: config.responseCacheMaxBytes > 0 ? { maxBytes: config.responseCacheMaxBytes } : false,\n\t\t\treuseServerDefinitionCache: config.reuseServerDefinitionCache,\n\t\t\tonSettle: (_ctx, result) => {\n\t\t\t\tsolveMeta.seq += 1;\n\t\t\t\tif (result.status !== 'success') return;\n\t\t\t\t// Piggyback the pool re-read on real traffic: only servers actually\n\t\t\t\t// being used get probed, at most once per window, and never on the\n\t\t\t\t// request path. A cache hit means we never reached the server, so it\n\t\t\t\t// says nothing about the pool — don't spend a probe on it.\n\t\t\t\tif (\n\t\t\t\t\tresult.fromCache !== true &&\n\t\t\t\t\tDate.now() - lastProbeAt >= CONCURRENCY_PROBE_INTERVAL_MS\n\t\t\t\t) {\n\t\t\t\t\t// Safe despite being referenced from inside its own initializer:\n\t\t\t\t\t// onSettle only ever fires during a solve, long after binding.\n\t\t\t\t\tvoid refreshConcurrency(scheduler);\n\t\t\t\t}\n\t\t\t\tsolveMeta.last = {\n\t\t\t\t\tfromCache: result.fromCache === true,\n\t\t\t\t\tdefinitionReuploaded: result.definitionReuploaded\n\t\t\t\t};\n\t\t\t\tif (!config.debug) return;\n\t\t\t\tdebugLog(\n\t\t\t\t\t`[Compute/selva-cache] ${result.fromCache ? 'HIT  — served from cache (no compute call)' : 'miss — went to Rhino.Compute'} (${Math.round(result.durationMs)}ms)`\n\t\t\t\t);\n\t\t\t\tif (!result.fromCache) {\n\t\t\t\t\tdebugLog(\n\t\t\t\t\t\tresult.definitionReuploaded === true\n\t\t\t\t\t\t\t? '[Compute/def-cache] miss — definition RE-UPLOADED (pointer was cold/stale)'\n\t\t\t\t\t\t\t: result.definitionReuploaded === false\n\t\t\t\t\t\t\t\t? '[Compute/def-cache] HIT  — definition reused from server cache (no upload)'\n\t\t\t\t\t\t\t\t: '[Compute/def-cache] n/a — reuse disabled or non-reusable definition'\n\t\t\t\t\t);\n\t\t\t\t}\n\t\t\t\tif (!result.fromCache) {\n\t\t\t\t\tconst errs = (result.response as { errors?: unknown[] })?.errors;\n\t\t\t\t\tconst errCount = Array.isArray(errs) ? errs.length : 0;\n\t\t\t\t\tif (errCount > 0) {\n\t\t\t\t\t\tconst cacheNote = config.cacheerroredsolves\n\t\t\t\t\t\t\t? 'cached (cacheerroredsolves on)'\n\t\t\t\t\t\t\t: 'not cached (cacheerroredsolves off) — re-run until fixed';\n\t\t\t\t\t\tdebugLog(\n\t\t\t\t\t\t\t`[Compute/rhino-cache] ${errCount} GH error(s); ${cacheNote}. First: ${JSON.stringify((errs as unknown[])[0])}`\n\t\t\t\t\t\t);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t});\n\t\treturn { client, scheduler, rhinoTiming, solveMeta };\n\t}\n\n\treturn {\n\t\tasync getClient(server, opts): Promise<CachedClient> {\n\t\t\tconst key = server.id;\n\t\t\tconst existing = cache.get(key);\n\t\t\tif (existing) {\n\t\t\t\t// Refresh LRU position.\n\t\t\t\tcache.delete(key);\n\t\t\t\tcache.set(key, existing);\n\t\t\t\treturn existing;\n\t\t\t}\n\n\t\t\tconst inFlight = pending.get(key);\n\t\t\tif (inFlight) return inFlight;\n\n\t\t\t// A build is a Rhino.Compute handshake — expensive, and repeated builds for\n\t\t\t// the same id mean churn (LRU thrash or config-rotation evictions).\n\t\t\tdebugLog(`[Compute/client-cache] miss — building warm client for server ${key}`);\n\t\t\tconst buildPromise = (async () => {\n\t\t\t\tconst entry = await build(server, opts?.definitionGuid);\n\n\t\t\t\tif (cache.size >= maxWarmComputeServers) {\n\t\t\t\t\tconst oldestKey = cache.keys().next().value;\n\t\t\t\t\tif (oldestKey !== undefined) {\n\t\t\t\t\t\tdebugLog(\n\t\t\t\t\t\t\t`[Compute/client-cache] LRU evicted warm client for server ${oldestKey} (cap ${maxWarmComputeServers})`\n\t\t\t\t\t\t);\n\t\t\t\t\t\tcache.get(oldestKey)?.scheduler.dispose();\n\t\t\t\t\t\tcache.delete(oldestKey);\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tcache.set(key, entry);\n\t\t\t\treturn entry;\n\t\t\t})().finally(() => pending.delete(key));\n\t\t\tpending.set(key, buildPromise);\n\t\t\treturn buildPromise;\n\t\t},\n\n\t\tevict(id): void {\n\t\t\tconst key = id as string;\n\t\t\tconst entry = cache.get(key);\n\t\t\tif (entry) {\n\t\t\t\tdebugLog(`[Compute/client-cache] evicted warm client for server ${key} (config change)`);\n\t\t\t\tentry.scheduler.dispose();\n\t\t\t\tcache.delete(key);\n\t\t\t}\n\t\t},\n\n\t\tsolveCacheStats(): SolveCacheStats {\n\t\t\tconst total: SolveCacheStats = {\n\t\t\t\twarmClients: cache.size,\n\t\t\t\tentries: 0,\n\t\t\t\tbytes: 0,\n\t\t\t\thits: 0,\n\t\t\t\tmisses: 0,\n\t\t\t\tevictions: 0\n\t\t\t};\n\t\t\tfor (const entry of cache.values()) {\n\t\t\t\tconst s = entry.scheduler.cacheStats();\n\t\t\t\ttotal.entries += s.entries;\n\t\t\t\ttotal.bytes += s.bytes;\n\t\t\t\ttotal.hits += s.hits;\n\t\t\t\ttotal.misses += s.misses;\n\t\t\t\ttotal.evictions += s.evictions;\n\t\t\t}\n\t\t\treturn total;\n\t\t},\n\n\t\tclearSolveCaches(): void {\n\t\t\tdebugLog(`[Compute/client-cache] cleared solve caches on ${cache.size} warm client(s)`);\n\t\t\tfor (const entry of cache.values()) entry.scheduler.clearCache();\n\t\t},\n\n\t\tdisposeAll(): void {\n\t\t\tdebugLog(`[Compute/client-cache] disposing all ${cache.size} warm client(s)`);\n\t\t\tfor (const entry of cache.values()) entry.scheduler.dispose();\n\t\t\tcache.clear();\n\t\t}\n\t};\n}\n","/**\n * In-process cache of `.gh` definition bytes, keyed by immutable **version id**.\n *\n * Turns an eager `storage.get(fileKey)` on every solve request into a lazy\n * `DefinitionRef.load()`: the scheduler calls `load()` only when an upload is\n * unavoidable (a pointer-known re-solve never touches storage or this cache).\n *\n * The key MUST be the version id, never a `fileKey` — a delete-latest-then-\n * reupload can reuse a `fileKey` for different content, which would silently\n * serve one version's bytes for another with no diagnostic. Callers pass\n * `version.id`, and the returned `DefinitionRef.key` is that same id, so the\n * scheduler's own result/pointer cache keys on the same immutable identity.\n *\n * Eviction is LRU by total byte budget, not entry count — definitions range\n * from tens of KB to hundreds of MB, so a count cap would either pin\n * gigabytes or evict uselessly. `COMPUTE_DEFINITION_CACHE_MB` sets the\n * budget (see `createDefinitionByteCache`). No TTL: version ids are\n * immutable, so a cached entry can never go stale. An entry larger than the\n * whole budget is served but never retained.\n */\n\n/**\n * Per-`getOrLoad` outcome, observable after the scheduler has (or hasn't)\n * called `load()` — lets the solve pipeline emit a `def_bytes` Server-Timing\n * verdict (`skipped` / `hit` / `miss`).\n */\nexport interface ByteRefOutcome {\n\tloaded: boolean;\n\tfromCache: boolean;\n}\n\n/** A definition reference shaped for `@selvajs/compute`'s `DefinitionRef`. */\nexport interface ByteCacheRef {\n\tkey: string;\n\tload: () => Promise<Uint8Array>;\n\toutcome: ByteRefOutcome;\n}\n\nexport interface ByteCacheStats {\n\thits: number;\n\tmisses: number;\n\tevictions: number;\n\tentries: number;\n\tbytes: number;\n}\n\nexport interface DefinitionByteCache {\n\tgetOrLoad(versionId: string, load: () => Promise<Uint8Array>): ByteCacheRef;\n\tstats(): ByteCacheStats;\n\tclear(): void;\n}\n\ninterface Entry {\n\tbytes: Uint8Array;\n}\n\n/**\n * @param maxBytes total retained-byte budget; `0` (or negative) disables caching\n *   entirely — every `load()` calls the loader and nothing is retained.\n */\nexport function createDefinitionByteCache(maxBytes: number): DefinitionByteCache {\n\tconst budget = Math.max(0, Math.floor(maxBytes));\n\t// Map iteration order is insertion order, so it doubles as LRU order:\n\t// re-inserting a key on access moves it to the most-recently-used end.\n\tconst cache = new Map<string, Entry>();\n\tlet retainedBytes = 0;\n\tconst stats = { hits: 0, misses: 0, evictions: 0 };\n\n\tfunction touch(key: string, entry: Entry): void {\n\t\tcache.delete(key);\n\t\tcache.set(key, entry);\n\t}\n\n\tfunction evictToFit(): void {\n\t\twhile (retainedBytes > budget && cache.size > 0) {\n\t\t\tconst oldestKey = cache.keys().next().value as string;\n\t\t\tconst oldest = cache.get(oldestKey)!;\n\t\t\tcache.delete(oldestKey);\n\t\t\tretainedBytes -= oldest.bytes.byteLength;\n\t\t\tstats.evictions += 1;\n\t\t}\n\t}\n\n\tfunction store(key: string, bytes: Uint8Array): void {\n\t\tif (budget === 0) return;\n\t\t// Caching an entry bigger than the budget would evict everything\n\t\t// (including itself) on the next evictToFit — serve it, cache nothing.\n\t\tif (bytes.byteLength > budget) return;\n\t\tconst existing = cache.get(key);\n\t\tif (existing) retainedBytes -= existing.bytes.byteLength;\n\t\tcache.set(key, { bytes });\n\t\tretainedBytes += bytes.byteLength;\n\t\tevictToFit();\n\t}\n\n\treturn {\n\t\tgetOrLoad(versionId, load) {\n\t\t\tconst outcome: ByteRefOutcome = { loaded: false, fromCache: false };\n\t\t\treturn {\n\t\t\t\tkey: versionId,\n\t\t\t\toutcome,\n\t\t\t\tload: async () => {\n\t\t\t\t\tconst hit = cache.get(versionId);\n\t\t\t\t\tif (hit) {\n\t\t\t\t\t\ttouch(versionId, hit);\n\t\t\t\t\t\tstats.hits += 1;\n\t\t\t\t\t\toutcome.loaded = true;\n\t\t\t\t\t\toutcome.fromCache = true;\n\t\t\t\t\t\treturn hit.bytes;\n\t\t\t\t\t}\n\t\t\t\t\tstats.misses += 1;\n\t\t\t\t\toutcome.loaded = true;\n\t\t\t\t\toutcome.fromCache = false;\n\t\t\t\t\tconst bytes = await load();\n\t\t\t\t\tstore(versionId, bytes);\n\t\t\t\t\treturn bytes;\n\t\t\t\t}\n\t\t\t};\n\t\t},\n\t\tstats() {\n\t\t\treturn {\n\t\t\t\thits: stats.hits,\n\t\t\t\tmisses: stats.misses,\n\t\t\t\tevictions: stats.evictions,\n\t\t\t\tentries: cache.size,\n\t\t\t\tbytes: retainedBytes\n\t\t\t};\n\t\t},\n\t\tclear() {\n\t\t\tcache.clear();\n\t\t\tretainedBytes = 0;\n\t\t}\n\t};\n}\n","/**\n * In-process single-flight — dogpile protection for every solve.\n *\n * Always on, not gated behind a result cache being configured: the dogpile is worst\n * when nothing else is caching, since N concurrent identical solves each pay a full\n * Rhino round trip (the scheduler doesn't coalesce in-flight requests itself, and\n * Rhino's `cachesolve` still costs a round trip per repeat). An earlier version\n * gated this on cache config and so disabled it in exactly the deployments most\n * exposed to a cold-key stampede — hot public definition plus a deploy.\n *\n * Per app instance, above `ISolveResultCache`. No cross-instance lease (Redis\n * `SET NX`) yet.\n *\n * The shared promise resolves to one value for every waiter, so `work` must return\n * something safe to share by reference — the solve pipeline's envelope qualifies\n * because the app serializes it per response.\n */\n\nexport interface SolveCacheSingleFlight {\n\t/**\n\t * Coalesces concurrent calls under the same key: the first caller runs `work`,\n\t * later callers for that key await the same promise, and the key frees as soon\n\t * as it settles.\n\t *\n\t * `onWaiterJoined` fires only on the owner's call, only while `work` is still\n\t * running, each time another caller joins. Ownership changes what the owner's\n\t * abort signal should mean: a solo run can cancel on its own client's\n\t * disconnect, but a shared run can't without 499-ing every waiter.\n\t */\n\trun<T>(key: string, work: () => Promise<T>, onWaiterJoined?: () => void): Promise<T>;\n\tinFlight(): number;\n}\n\nexport interface SolveCacheSingleFlightOptions {\n\tonJoin?: (key: string) => void;\n}\n\nexport function createSolveCacheSingleFlight(\n\toptions: SolveCacheSingleFlightOptions = {}\n): SolveCacheSingleFlight {\n\tinterface Flight {\n\t\tpromise: Promise<unknown>;\n\t\tnotifyOwner?: () => void;\n\t}\n\tconst inflight = new Map<string, Flight>();\n\n\treturn {\n\t\trun<T>(key: string, work: () => Promise<T>, onWaiterJoined?: () => void): Promise<T> {\n\t\t\tconst existing = inflight.get(key);\n\t\t\tif (existing) {\n\t\t\t\toptions.onJoin?.(key);\n\t\t\t\texisting.notifyOwner?.();\n\t\t\t\treturn existing.promise as Promise<T>;\n\t\t\t}\n\n\t\t\t// Wrapping in an async IIFE means a synchronous throw in `work` still\n\t\t\t// rejects `p` instead of escaping `run` directly.\n\t\t\tconst flight: Flight = { notifyOwner: onWaiterJoined, promise: undefined! };\n\t\t\tconst p = (async () => work())().finally(() => {\n\t\t\t\t// Clear it here so a join after `work` settles can't fire it late.\n\t\t\t\tflight.notifyOwner = undefined;\n\t\t\t\t// Guard against deleting a key a later caller has already re-taken.\n\t\t\t\tif (inflight.get(key) === flight) inflight.delete(key);\n\t\t\t});\n\t\t\tflight.promise = p;\n\t\t\tinflight.set(key, flight);\n\t\t\treturn p;\n\t\t},\n\t\tinFlight(): number {\n\t\t\treturn inflight.size;\n\t\t}\n\t};\n}\n","/**\n * Facade over the warm-client cache, definition-byte cache, single-flight\n * coalescing, and the solve pipeline — the primitives an app route would\n * otherwise wire up by hand.\n *\n * Doesn't read env itself: `@selvajs/server` owns `resolveComputeLimits` and\n * depends on `@selvajs/solve`, so calling it from here would be a circular\n * import. Callers resolve their own limits and pass in the fields below.\n *\n * Stays out of auth, DB reads, share tokens, rate limiting, metrics, and\n * compute-server selection — all app policy, supplied per-call via\n * `SolveEngineSolveArgs.server`.\n */\n\nimport {\n\tisDefinitionRef,\n\tstableStringify,\n\ttype DefinitionRef,\n\ttype SolveDefinition\n} from '@selvajs/compute';\nimport { NoopLogger, type ILogger } from '@selvajs/platform';\nimport {\n\tcreateClientCache,\n\ttype CachedClient,\n\ttype ClientCache,\n\ttype ClientCacheDebug,\n\ttype ResolvedServer,\n\ttype SolveCacheStats\n} from './client-cache.js';\nimport {\n\tcreateDefinitionByteCache,\n\ttype ByteCacheRef,\n\ttype ByteCacheStats,\n\ttype DefinitionByteCache\n} from './definition-byte-cache.js';\nimport {\n\tcreateSolveCacheSingleFlight,\n\ttype SolveCacheSingleFlight\n} from './solve-cache-single-flight.js';\nimport {\n\tadaptEnvelopeToEncoding,\n\tbuildSolveInputTree,\n\trunSolvePipeline,\n\ttype PipelineInput,\n\ttype SolveOutcome\n} from './solve-pipeline.js';\n\n/**\n * Subset of `ComputeLimits` (`@selvajs/server/compute`) the engine needs.\n * Pass the resolved object through as-is — extra fields are ignored.\n */\nexport interface SolveEngineLimits {\n\tmaxSolveDurationMs: number;\n\tcomputeResponseMaxBytes: number;\n\tcomputeReuseDefinitionCache: boolean;\n\tcomputeServerCachesolve: boolean;\n\tcomputeCacheErroredSolves: boolean;\n\tcomputeMaxQueueDepth: number;\n\tcomputeQueueWaitMs: number;\n\tcomputeDefinitionCacheBytes: number;\n\tcomputeSolveCacheBytes: number;\n}\n\nexport interface SolveEngineOptions {\n\tlimits: SolveEngineLimits;\n\tlogger?: ILogger;\n\t/** Max distinct warm compute servers before the LRU evicts the oldest. Default 16. */\n\tmaxWarmComputeServers?: number;\n\t/** Concise cache/timing logs when truthy; `'verbose'` also dumps full lib-level requests/responses. Default off. */\n\tdebug?: ClientCacheDebug;\n\tonDebugLog?: (message: string) => void;\n\t/** Fired when a caller joins an already-in-flight solve instead of running its own. */\n\tonSolveCoalesced?: (key: string) => void;\n}\n\n/**\n * Accepts every form `runSolvePipeline` does, plus `{versionId, load}` sugar\n * that builds (and caches) a `ByteCacheRef` internally. A `ByteCacheRef`\n * obtained ahead of time from `engine.definitionRef()` (e.g. to read bytes for\n * schema extraction before solving) is passed through as-is — detected by its\n * `outcome` field, which a plain `DefinitionRef` never has.\n */\nexport type SolveEngineDefinitionSource =\n\t| Uint8Array\n\t| string\n\t| DefinitionRef\n\t| ByteCacheRef\n\t| { versionId: string; load: () => Promise<Uint8Array> };\n\nexport interface SolveEngineSolveArgs {\n\tserver: ResolvedServer;\n\tdefinitionSource: SolveEngineDefinitionSource;\n\t/**\n\t * Coalesce-key identity for a raw `Uint8Array`/`string` source, which has\n\t * no natural identity the way a `DefinitionRef`'s `.key` does. Required in\n\t * that case — `solve()` throws rather than silently hashing the bytes.\n\t * Ignored for the other source forms.\n\t */\n\tdefinitionKey?: string;\n\tinputs: PipelineInput[];\n\tvalues: Record<string, unknown>;\n\tsignal: AbortSignal;\n\tacceptEncoding?: string;\n\t/** Stamped as `X-Selva-Definition` on this solve's client. */\n\tdefinitionGuid?: string;\n\tloadStartMs?: number;\n\tdefLoadMs?: number;\n\tprepMarks?: [string, number][];\n}\n\nexport interface FrameworkAgnosticResponse {\n\tstatus: number;\n\theaders: Record<string, string>;\n\tbody: string | Uint8Array;\n}\n\nexport interface SolveEngineStats {\n\tclient: SolveCacheStats;\n\tdefinitionBytes: ByteCacheStats;\n\tcoalescing: { inFlight: number };\n}\n\nfunction isByteCacheRef(source: SolveEngineDefinitionSource): source is ByteCacheRef {\n\treturn (\n\t\ttypeof source === 'object' &&\n\t\tsource !== null &&\n\t\t!(source instanceof Uint8Array) &&\n\t\t'outcome' in source\n\t);\n}\n\nfunction isVersionLoadPair(\n\tsource: SolveEngineDefinitionSource\n): source is { versionId: string; load: () => Promise<Uint8Array> } {\n\treturn (\n\t\ttypeof source === 'object' &&\n\t\tsource !== null &&\n\t\t!(source instanceof Uint8Array) &&\n\t\t!('outcome' in source) &&\n\t\t!('key' in source) &&\n\t\t'versionId' in source\n\t);\n}\n\nexport class SolveEngine {\n\tprivate readonly limits: SolveEngineLimits;\n\tprivate readonly clientCache: ClientCache;\n\tprivate readonly byteCache: DefinitionByteCache;\n\tprivate readonly singleFlight: SolveCacheSingleFlight;\n\n\tconstructor(options: SolveEngineOptions) {\n\t\tthis.limits = options.limits;\n\t\tconst logger = options.logger ?? new NoopLogger();\n\n\t\tthis.clientCache = createClientCache({\n\t\t\tmaxSolveDurationMs: this.limits.maxSolveDurationMs,\n\t\t\tcachesolve: this.limits.computeServerCachesolve,\n\t\t\tcacheerroredsolves: this.limits.computeCacheErroredSolves,\n\t\t\treuseServerDefinitionCache: this.limits.computeReuseDefinitionCache,\n\t\t\tmaxQueueDepth: this.limits.computeMaxQueueDepth,\n\t\t\tqueueWaitMs: this.limits.computeQueueWaitMs,\n\t\t\tresponseCacheMaxBytes: this.limits.computeSolveCacheBytes,\n\t\t\tdebug: options.debug ?? false,\n\t\t\tmaxWarmComputeServers: options.maxWarmComputeServers,\n\t\t\tonDebugLog:\n\t\t\t\toptions.onDebugLog ??\n\t\t\t\t((message) => logger.debug(message, { component: 'Compute/client-cache' }))\n\t\t});\n\n\t\tthis.byteCache = createDefinitionByteCache(this.limits.computeDefinitionCacheBytes);\n\n\t\tthis.singleFlight = createSolveCacheSingleFlight({\n\t\t\tonJoin: options.onSolveCoalesced\n\t\t});\n\t}\n\n\tgetClient(server: ResolvedServer, opts?: { definitionGuid?: string }): Promise<CachedClient> {\n\t\treturn this.clientCache.getClient(server, opts);\n\t}\n\n\tdefinitionRef(versionId: string, load: () => Promise<Uint8Array>): ByteCacheRef {\n\t\treturn this.byteCache.getOrLoad(versionId, load);\n\t}\n\n\tevictServer(id: string): void {\n\t\tthis.clientCache.evict(id);\n\t}\n\n\tclearSolveCaches(): void {\n\t\tthis.clientCache.clearSolveCaches();\n\t}\n\n\tstats(): SolveEngineStats {\n\t\treturn {\n\t\t\tclient: this.clientCache.solveCacheStats(),\n\t\t\tdefinitionBytes: this.byteCache.stats(),\n\t\t\tcoalescing: { inFlight: this.singleFlight.inFlight() }\n\t\t};\n\t}\n\n\tasync solve(args: SolveEngineSolveArgs): Promise<SolveOutcome> {\n\t\tconst {\n\t\t\tdefinitionSource: resolvedSource,\n\t\t\tbyteRefOutcome,\n\t\t\tidentity\n\t\t} = this.resolveDefinitionSource(args);\n\n\t\tconst client = await this.clientCache.getClient(args.server, {\n\t\t\tdefinitionGuid: args.definitionGuid\n\t\t});\n\t\tconst inputTree = buildSolveInputTree(args.inputs, args.values);\n\t\tconst coalesceKey = `${identity}:${args.server.id}:${stableStringify(inputTree)}`;\n\n\t\t// A coalesced solve is shared, so one caller's disconnect can't 499 every\n\t\t// other waiter. Only propagate abort if no one else has joined yet.\n\t\tconst abortController = new AbortController();\n\t\tlet hasWaiters = false;\n\t\tconst onCallerAbort = () => {\n\t\t\tif (!hasWaiters) abortController.abort();\n\t\t};\n\t\t// `once: true` doesn't detach on a normal completion, and the caller's signal\n\t\t// outlives this call — a request signal fires `abort` after the response is\n\t\t// consumed, and a session-scoped one never settles at all. Without the\n\t\t// `finally` below, every solve leaks a listener onto it.\n\t\targs.signal.addEventListener('abort', onCallerAbort, { once: true });\n\n\t\tconst acceptEncoding = args.acceptEncoding ?? '';\n\t\tlet outcome: SolveOutcome;\n\t\ttry {\n\t\t\toutcome = await this.singleFlight.run(\n\t\t\t\tcoalesceKey,\n\t\t\t\t() =>\n\t\t\t\t\trunSolvePipeline({\n\t\t\t\t\t\tdefinitionSource: resolvedSource,\n\t\t\t\t\t\tbyteRefOutcome,\n\t\t\t\t\t\tinputs: args.inputs,\n\t\t\t\t\t\tvalues: args.values,\n\t\t\t\t\t\tinputTree,\n\t\t\t\t\t\tclient,\n\t\t\t\t\t\tresponseMaxBytes: this.limits.computeResponseMaxBytes,\n\t\t\t\t\t\tmaxSolveDurationMs: this.limits.maxSolveDurationMs,\n\t\t\t\t\t\tacceptEncoding,\n\t\t\t\t\t\tsignal: abortController.signal,\n\t\t\t\t\t\tloadStartMs: args.loadStartMs ?? performance.now(),\n\t\t\t\t\t\tdefLoadMs: args.defLoadMs ?? 0,\n\t\t\t\t\t\tprepMarks: args.prepMarks\n\t\t\t\t\t}),\n\t\t\t\t() => {\n\t\t\t\t\thasWaiters = true;\n\t\t\t\t}\n\t\t\t);\n\t\t} finally {\n\t\t\targs.signal.removeEventListener('abort', onCallerAbort);\n\t\t}\n\n\t\tif (outcome.kind !== 'ok') return outcome;\n\n\t\t// The envelope may be shared across waiters; re-key it to this caller's\n\t\t// own Accept-Encoding so each one gets the right wire form.\n\t\tconst wire = adaptEnvelopeToEncoding(outcome.envelope, acceptEncoding);\n\t\treturn {\n\t\t\t...outcome,\n\t\t\tenvelope: { ...outcome.envelope, body: wire.body, headers: wire.headers }\n\t\t};\n\t}\n\n\ttoResponse(\n\t\toutcome: SolveOutcome,\n\t\topts?: { onError?: (status: number, body: { message: string; retryAfter?: number }) => never }\n\t): FrameworkAgnosticResponse {\n\t\tconst fail = (\n\t\t\tstatus: number,\n\t\t\tbody: { message: string; retryAfter?: number }\n\t\t): FrameworkAgnosticResponse => {\n\t\t\tif (opts?.onError) opts.onError(status, body);\n\t\t\tconst headers: Record<string, string> = { 'Content-Type': 'application/json' };\n\t\t\tif (body.retryAfter !== undefined) headers['Retry-After'] = String(body.retryAfter);\n\t\t\treturn { status, headers, body: JSON.stringify(body) };\n\t\t};\n\n\t\tswitch (outcome.kind) {\n\t\t\tcase 'ok':\n\t\t\t\treturn { status: 200, headers: outcome.envelope.headers, body: outcome.envelope.body };\n\t\t\tcase 'timeout':\n\t\t\t\treturn fail(504, { message: outcome.message });\n\t\t\tcase 'client_abort':\n\t\t\t\treturn fail(499, { message: 'Client closed request' });\n\t\t\tcase 'too_large':\n\t\t\t\treturn fail(413, {\n\t\t\t\t\tmessage:\n\t\t\t\t\t\t'Solve result is too large to return. This usually means a file output exceeds the supported size.'\n\t\t\t\t});\n\t\t\tcase 'shed':\n\t\t\t\treturn fail(503, { message: outcome.message, retryAfter: outcome.retryAfterSeconds });\n\t\t\tcase 'compute_error':\n\t\t\t\tthrow outcome.error;\n\t\t}\n\t}\n\n\ttoWebResponse(outcome: SolveOutcome): Response {\n\t\tconst r = this.toResponse(outcome);\n\t\treturn new Response(typeof r.body === 'string' ? r.body : new Uint8Array(r.body), {\n\t\t\tstatus: r.status,\n\t\t\theaders: r.headers\n\t\t});\n\t}\n\n\tprivate resolveDefinitionSource(args: SolveEngineSolveArgs): {\n\t\tdefinitionSource: SolveDefinition;\n\t\tbyteRefOutcome?: ByteCacheRef['outcome'];\n\t\tidentity: string;\n\t} {\n\t\tconst source = args.definitionSource;\n\n\t\tif (isVersionLoadPair(source)) {\n\t\t\tconst ref = this.byteCache.getOrLoad(source.versionId, source.load);\n\t\t\treturn { definitionSource: ref, byteRefOutcome: ref.outcome, identity: ref.key };\n\t\t}\n\n\t\tif (isByteCacheRef(source)) {\n\t\t\treturn { definitionSource: source, byteRefOutcome: source.outcome, identity: source.key };\n\t\t}\n\n\t\tif (isDefinitionRef(source)) {\n\t\t\treturn { definitionSource: source, identity: source.key };\n\t\t}\n\n\t\t// Raw Uint8Array | string — no natural identity; require the caller's own.\n\t\tif (!args.definitionKey) {\n\t\t\tthrow new Error(\n\t\t\t\t'SolveEngine.solve(): definitionKey is required when definitionSource is raw bytes or a string.'\n\t\t\t);\n\t\t}\n\t\treturn { definitionSource: source, identity: args.definitionKey };\n\t}\n}\n","// ============================================================================\n// server/ — the solve core behind the wire\n// ============================================================================\n//\n// Given a resolved solve context (definition bytes, inputs + values, a warm scheduler), runs a\n// solve and returns a ready-to-send envelope: build input tree → solve → serialize → gzip →\n// Server-Timing, plus the caches that make a repeat solve cheap (single-flight coalescing,\n// definition-byte cache, Rhino.Compute client cache).\n//\n// **Node-only** (`node:zlib`, `node:crypto`, `process.env`, platform-provider cache backends).\n// `client/` must never import from here — enforced by `no-restricted-imports` in\n// `eslint.config.mjs`, and on the built artifact by having no root barrel join the two halves.\n//\n// Not here, on purpose: HTTP status mapping, auth, tenancy, rate limiting, SSRF guards. Those are\n// request policy and stay in `@selvajs/server` (`/compute`, `/http`) and in the app route.\n\n// ============================================================================\n// Pipeline\n// ============================================================================\n\nexport {\n\trunSolvePipeline,\n\tbuildSolveInputTree,\n\tadaptEnvelopeToEncoding,\n\tCOMPUTE_CONTRACT_VERSION,\n\tCOMPUTE_VERSION_HEADER,\n\ttype SolvePipelineArgs,\n\ttype SolveOutcome,\n\ttype SolveEnvelope,\n\ttype SolvePhaseMetrics,\n\ttype PipelineInput\n} from './solve-pipeline.js';\n\nexport { transformInputParameter } from './transform-input.js';\n\n// ============================================================================\n// Caches\n// ============================================================================\n\nexport {\n\tcreateClientCache,\n\tserverIdentity,\n\ttype ClientCache,\n\ttype ClientCacheConfig,\n\ttype SolveCacheStats,\n\ttype CachedClient,\n\ttype ResolvedServer,\n\ttype ServerIdentity\n} from './client-cache.js';\n\nexport {\n\tcreateDefinitionByteCache,\n\ttype DefinitionByteCache,\n\ttype ByteCacheRef,\n\ttype ByteCacheStats,\n\ttype ByteRefOutcome\n} from './definition-byte-cache.js';\n\nexport {\n\tcreateSolveCacheSingleFlight,\n\ttype SolveCacheSingleFlight,\n\ttype SolveCacheSingleFlightOptions\n} from './solve-cache-single-flight.js';\n\n// ============================================================================\n// Facade\n// ============================================================================\n\nexport {\n\tSolveEngine,\n\ttype SolveEngineOptions,\n\ttype SolveEngineLimits,\n\ttype SolveEngineSolveArgs,\n\ttype SolveEngineDefinitionSource,\n\ttype SolveEngineStats,\n\ttype FrameworkAgnosticResponse\n} from './solve-engine.js';\n\nexport type { DefinitionRef, SolveDefinition } from '@selvajs/compute';\nexport { isDefinitionRef } from '@selvajs/compute';\n\n// ============================================================================\n// Shared vocabulary\n// ============================================================================\n//\n// Re-exported so a server-only consumer needs one import path, matching `client/`.\n\nexport type { SolveInput } from '../shared/solve-input.js';\n"],"mappings":"AAQA,OACC,cAAAA,EACA,qBAAAC,EACA,eAAAC,MAKM,mBAEP,OAAS,QAAAC,EAAM,cAAAC,MAAkB,OACjC,OAAS,aAAAC,MAAiB,OCnB1B,OAAiD,gBAAAC,MAAoB,mBAO9D,SAASC,EACfC,EACAC,EACa,CACb,IAAMC,EAAwB,CAC7B,GAAIF,EAAM,GACV,KAAMA,EAAM,SACZ,SAAUA,EAAM,UAAY,KAC5B,YAAaA,EAAM,aAAe,GAIlC,UAAWA,EAAM,YAAc,mBAAqB,YAAcA,EAAM,UACxE,WAAYA,EAAM,iBAAmB,OACrC,QAASA,EAAM,SAAW,KAC1B,QAASA,EAAM,SAAW,KAC1B,QAAS,EACT,OAAQ,EACR,SAAUA,EAAM,SAChB,QAASC,GAASD,EAAM,OACzB,EAEMG,EAAYL,EAAaI,CAAG,EAM5BE,EAAYH,GAASD,EAAM,QACjC,OAAIG,EAAU,SAAW,MAAQC,GAAa,OACzC,MAAM,QAAQA,CAAS,GAEhBD,EAAU,YAAc,aAAe,OAAOC,GAAc,YAGrED,EAAmC,QAAUC,GAGzCD,CACR,CDrBA,IAAME,EAAYC,EAAUC,CAAI,EAOnBC,EAA2B,EAC3BC,EAAyB,0BA6G/B,SAASC,EACfC,EACAC,EACa,CACb,OAAOC,EAAY,gBAClBF,EACE,OAAQG,GAAUA,EAAM,SAAS,EACjC,IAAKA,GAAsBC,EAAwBD,EAAOF,EAAOE,EAAM,EAAE,CAAC,CAAC,CAC9E,CACD,CAEA,eAAsBE,EAAiBC,EAAgD,CACtF,GAAM,CAAE,OAAAC,EAAQ,OAAAC,CAAO,EAAIF,EAErBG,EAAiB,YAAY,IAAI,EACjCC,EAAYJ,EAAK,WAAaP,EAAoBO,EAAK,OAAQA,EAAK,MAAM,EAC1EK,EAAc,YAAY,IAAI,EAAIF,EASlCG,EAAkBL,EAAO,UAAU,IACnCM,EAAiBN,EAAO,YAAY,IAEtCO,EACEC,EAAa,YAAY,IAAI,EACnC,GAAI,CACHD,EAAS,MAAMP,EAAO,UAAU,MAAMD,EAAK,iBAAkBI,EAAW,CAAE,OAAAF,CAAO,CAAC,CACnF,OAASQ,EAAK,CACb,IAAMC,EAAa,YAAY,IAAI,EAAIF,EAIvC,GADgBC,aAAe,OAASA,EAAI,OAAS,aAEpD,OAAIR,EAAO,QAAgB,CAAE,KAAM,eAAgB,WAAAS,CAAW,EACvD,CACN,KAAM,UACN,WAAAA,EACA,QAAS,sBAAsB,KAAK,MAAMX,EAAK,mBAAqB,GAAI,CAAC,aAC1E,EAID,GAAIU,aAAeE,EAAmB,CACrC,GAAIF,EAAI,OAASG,EAAW,WAC3B,MAAO,CACN,KAAM,OACN,WAAAF,EACA,OAAQ,aACR,kBAAmB,EACnB,QAAS,+CACV,EAED,GAAID,EAAI,OAASG,EAAW,cAC3B,MAAO,CACN,KAAM,OACN,WAAAF,EACA,OAAQ,gBACR,kBAAmB,EACnB,QAAS,8DACV,CAEF,CACA,MAAO,CAAE,KAAM,gBAAiB,WAAAA,EAAY,MAAOD,CAAI,CACxD,CACA,IAAMI,EAAU,YAAY,IAAI,EAAIL,EAE9BM,EAAiB,YAAY,IAAI,EACnCC,EACJ,GAAI,CACHA,EAAa,KAAK,UAAUR,CAAM,CACnC,OAASE,EAAK,CAGb,GAAIA,aAAe,WAAY,MAAO,CAAE,KAAM,WAAY,EAC1D,MAAMA,CACP,CACA,GAAIM,EAAW,OAAShB,EAAK,iBAAkB,MAAO,CAAE,KAAM,WAAY,EAC1E,IAAMiB,EAAc,YAAY,IAAI,EAAIF,EAMlCG,EADkB,YAAY,KAAKlB,EAAK,cAAc,GAChBgB,EAAW,OAAS,KAC5DG,EAA4B,KAC5BC,EAAS,EACb,GAAIF,EAAkB,CACrB,IAAMG,EAAY,YAAY,IAAI,EAClCF,EAAa,MAAM/B,EAAU,OAAO,KAAK4B,CAAU,CAAC,EACpDI,EAAS,YAAY,IAAI,EAAIC,CAC9B,CAEA,IAAMC,EAAgB,YAAY,IAAI,EAAItB,EAAK,YAKzCuB,EAAStB,EAAO,UAAU,MAAQK,EAAkB,EAAIL,EAAO,UAAU,KAAO,KAChFuB,EACLD,GAAU,CAACA,EAAO,WAAatB,EAAO,YAAY,MAAQM,EAAiB,EACxEN,EAAO,YAAY,KACnB,KAeEwB,EAAkC,CACvC,eAAgB,mBAChB,gBAfoBC,EAAkB,CACtC,UAAW1B,EAAK,UAChB,YAAAK,EACA,QAAAS,EACA,YAAAG,EACA,OAAAG,EACA,cAAAE,EACA,MAAAE,EACA,OAAAD,EACA,eAAgBvB,EAAK,eACrB,UAAWA,EAAK,WAAa,CAAC,CAC/B,CAAC,EAKA,CAACR,CAAsB,EAAG,OAAOD,CAAwB,EACzD,KAAM,iBACP,EAEMoC,EAA6B,CAClC,YAAAtB,EACA,QAAAS,EACA,YAAAG,EACA,OAAAG,EACA,cAAAE,EACA,gBAAiBN,EAAW,OAC5B,gBAAiBG,GAAY,YAAc,IAC5C,EAEIS,EACJ,OAAIT,GAGHM,EAAQ,kBAAkB,EAAI,OAC9BA,EAAQ,gBAAgB,EAAI,OAAON,EAAW,UAAU,EACxDS,EAAW,CACV,KAAM,IAAI,WAAWT,CAAU,EAC/B,SAAU,OACV,QAAAM,EACA,OAAAjB,EACA,QAAAmB,CACD,IAEAF,EAAQ,gBAAgB,EAAI,OAAO,OAAO,WAAWT,CAAU,CAAC,EAChEY,EAAW,CAAE,KAAMZ,EAAY,QAAAS,EAAS,OAAAjB,EAAQ,QAAAmB,CAAQ,GAGlD,CACN,KAAM,KACN,SAAAC,EACA,QAAAd,EACA,WAAYN,EAAO,QAAQ,QAAU,EACrC,aAAcA,EAAO,UAAU,QAAU,CAC1C,CACD,CAqBO,SAASqB,EACfD,EACAE,EACiE,CACjE,IAAMC,EAAkB,YAAY,KAAKD,CAAc,EAIvD,GAAIF,EAAS,WAAa,QAAU,CAACG,EAAiB,CACrD,IAAMC,EAAOC,EACZL,EAAS,gBAAgB,WAAaA,EAAS,KAAO,OAAO,KAAKA,EAAS,IAAI,CAChF,EAAE,SAAS,MAAM,EACXH,EAAU,CAAE,GAAGG,EAAS,OAAQ,EACtC,cAAOH,EAAQ,kBAAkB,EACjCA,EAAQ,gBAAgB,EAAI,OAAO,OAAO,WAAWO,CAAI,CAAC,EACnD,CAAE,KAAMA,EAAM,QAAAP,CAAQ,CAC9B,CAEA,MAAO,CAAE,KAAMG,EAAS,KAAM,QAASA,EAAS,OAAQ,CACzD,CAyBA,SAASF,EAAkBQ,EAAkC,CAC5D,IAAIC,EACH,YAAYD,EAAM,UAAU,QAAQ,CAAC,CAAC,cAC1BA,EAAM,YAAY,QAAQ,CAAC,CAAC,eAC3BA,EAAM,QAAQ,QAAQ,CAAC,CAAC,mBACpBA,EAAM,YAAY,QAAQ,CAAC,CAAC,cACjCA,EAAM,OAAO,QAAQ,CAAC,CAAC,eACtBA,EAAM,cAAc,QAAQ,CAAC,CAAC,GAEtCV,EAAQU,EAAM,MACpB,GAAIV,EAAO,CACV,IAAMY,EAAYZ,EAAM,OAASA,EAAM,MAAQA,EAAM,OAC/Ca,EAAgB,KAAK,IAAI,EAAGH,EAAM,QAAUE,CAAS,EAC3DD,GACC,sBAAsBX,EAAM,OAAO,QAAQ,CAAC,CAAC,qBACxBA,EAAM,MAAM,QAAQ,CAAC,CAAC,sBACrBA,EAAM,OAAO,QAAQ,CAAC,CAAC,sBACvBa,EAAc,QAAQ,CAAC,CAAC,EAChD,CAEA,OAAW,CAACC,EAAOC,CAAE,IAAKL,EAAM,UAC/BC,GAAU,OAAOG,CAAK,QAAQC,EAAG,QAAQ,CAAC,CAAC,GAG5C,IAAMhB,EAASW,EAAM,OACjBX,IACHY,GAAU,qBAAqBZ,EAAO,UAAY,EAAI,CAAC,GACnDA,EAAO,uBAAyB,SACnCY,GAAU,sBAAsBZ,EAAO,qBAAuB,EAAI,CAAC,KAOrE,IAAMiB,EAAUN,EAAM,eACtB,GAAIM,EAAS,CACZ,IAAMC,EAAWD,EAAQ,OAAqBA,EAAQ,UAAY,MAAQ,OAAxC,UAClCL,GAAU,oBAAoBM,CAAO,EACtC,CAEA,OAAON,CACR,CE5ZA,OACC,qBAAAO,EACA,sBAAAC,MAGM,mBAkCA,SAASC,EAAeC,EAAoD,CAClF,OAAOA,EAAO,EACf,CAqGA,IAAMC,EAAmC,GAOnCC,EAAuB,EAQvBC,EAAgC,IAAS,IAExC,SAASC,EAAkBC,EAAwC,CACzE,IAAMC,EAAwBD,EAAO,uBAAyBJ,EACxDM,EAAQ,IAAI,IAIZC,EAAU,IAAI,IAEhBH,EAAO,QAAU,WAAWP,EAAmB,EAEnD,IAAMW,EAAYC,GAAoB,CACjCL,EAAO,OAAOA,EAAO,aAAaK,CAAO,CAC9C,EAEA,eAAeC,EAAMX,EAAwBY,EAAgD,CAC5F,IAAMC,EAA2C,CAAE,KAAM,KAAM,IAAK,CAAE,EAChEC,EAAuC,CAAE,KAAM,KAAM,IAAK,CAAE,EAC5DC,EAAeV,EAAO,QAAU,UAEhCW,EAAyC,CAC9C,UAAWhB,EAAO,UAClB,OAAQA,EAAO,OAGf,MAAOe,EACP,WAAYV,EAAO,WACnB,mBAAoBA,EAAO,mBAC3B,eAAiBY,GAAM,CACtB,IAAMC,EAASD,EAAE,QAAU,EACrBE,EAAQF,EAAE,OAAS,EACnBG,EAASH,EAAE,QAAU,EAG3B,GAFAJ,EAAY,KAAO,EACnBA,EAAY,KAAO,CAAE,OAAAK,EAAQ,MAAAC,EAAO,OAAAC,CAAO,EACvC,CAACf,EAAO,MAAO,OAGnB,IAAMgB,EACLH,GAAU,EAAI,8CAAgD,oBACzDI,EACLjB,EAAO,YAAcc,GAAS,EAC3B,qCACAd,EAAO,WACN,sBACA,MACLI,EACC,gCAAgCS,CAAM,YAAYC,CAAK,aAAaC,CAAM,0BAClDC,CAAQ,gCAAgCC,CAAU,EAC3E,CACD,CACD,EAIIV,IACHI,EAAa,QAAU,CAAE,qBAAsBJ,CAAe,GAG/D,IAAMW,EAAS,MAAM1B,EAAkB,OAAOmB,CAAY,EAWtDQ,EAAgBtB,EAChBuB,EAAc,EACdC,EAAU,GAYd,eAAeC,EAAmBC,EAAmD,CACpF,GAAI,CAAAF,EACJ,CAAAA,EAAU,GACV,GAAI,CACH,IAAMG,EAAW,MAAM,QAAQ,QAC9BN,EAAO,aAAa,kBAAkB,CAAE,WAAY,EAAM,CAAC,CAC5D,EAAE,MAAM,IAAM,IAAI,EAClBE,EAAc,KAAK,IAAI,EACvB,IAAMK,EAAO,CAACD,GAAYA,GAAY,EAAI3B,EAAuB2B,EACjE,GAAIC,IAASN,EAAe,OAC5Bf,EACC,sCAAsCe,CAAa,WAAMM,CAAI,uBAC9D,EACAN,EAAgBM,EAChBF,GAAW,iBAAiBE,CAAI,CACjC,QAAE,CACDJ,EAAU,EACX,EACD,CAGA,MAAMC,EAAmB,EAEzB,IAAMC,EAAYL,EAAO,gBAAgB,CACxC,KAAM,QAIN,cAAAC,EAIA,cAAenB,EAAO,eAAiB,OACvC,YAAaA,EAAO,aAAe,OACnC,UAAWA,EAAO,mBAKlB,MAAOA,EAAO,sBAAwB,EAAI,CAAE,SAAUA,EAAO,qBAAsB,EAAI,GACvF,2BAA4BA,EAAO,2BACnC,SAAU,CAAC0B,EAAMC,IAAW,CAE3B,GADAlB,EAAU,KAAO,EACbkB,EAAO,SAAW,YAMrBA,EAAO,YAAc,IACrB,KAAK,IAAI,EAAIP,GAAetB,GAIvBwB,EAAmBC,CAAS,EAElCd,EAAU,KAAO,CAChB,UAAWkB,EAAO,YAAc,GAChC,qBAAsBA,EAAO,oBAC9B,EACI,EAAC3B,EAAO,QACZI,EACC,yBAAyBuB,EAAO,UAAY,kDAA+C,mCAA8B,KAAK,KAAK,MAAMA,EAAO,UAAU,CAAC,KAC5J,EACKA,EAAO,WACXvB,EACCuB,EAAO,uBAAyB,GAC7B,kFACAA,EAAO,uBAAyB,GAC/B,kFACA,0EACL,EAEG,CAACA,EAAO,YAAW,CACtB,IAAMC,EAAQD,EAAO,UAAqC,OACpDE,EAAW,MAAM,QAAQD,CAAI,EAAIA,EAAK,OAAS,EACrD,GAAIC,EAAW,EAAG,CACjB,IAAMC,EAAY9B,EAAO,mBACtB,iCACA,gEACHI,EACC,yBAAyByB,CAAQ,iBAAiBC,CAAS,YAAY,KAAK,UAAWF,EAAmB,CAAC,CAAC,CAAC,EAC9G,CACD,CACD,CACD,CACD,CAAC,EACD,MAAO,CAAE,OAAAV,EAAQ,UAAAK,EAAW,YAAAf,EAAa,UAAAC,CAAU,CACpD,CAEA,MAAO,CACN,MAAM,UAAUd,EAAQoC,EAA6B,CACpD,IAAMC,EAAMrC,EAAO,GACbsC,EAAW/B,EAAM,IAAI8B,CAAG,EAC9B,GAAIC,EAEH,OAAA/B,EAAM,OAAO8B,CAAG,EAChB9B,EAAM,IAAI8B,EAAKC,CAAQ,EAChBA,EAGR,IAAMC,EAAW/B,EAAQ,IAAI6B,CAAG,EAChC,GAAIE,EAAU,OAAOA,EAIrB9B,EAAS,sEAAiE4B,CAAG,EAAE,EAC/E,IAAMG,GAAgB,SAAY,CACjC,IAAMC,EAAQ,MAAM9B,EAAMX,EAAQoC,GAAM,cAAc,EAEtD,GAAI7B,EAAM,MAAQD,EAAuB,CACxC,IAAMoC,EAAYnC,EAAM,KAAK,EAAE,KAAK,EAAE,MAClCmC,IAAc,SACjBjC,EACC,6DAA6DiC,CAAS,SAASpC,CAAqB,GACrG,EACAC,EAAM,IAAImC,CAAS,GAAG,UAAU,QAAQ,EACxCnC,EAAM,OAAOmC,CAAS,EAExB,CAEA,OAAAnC,EAAM,IAAI8B,EAAKI,CAAK,EACbA,CACR,GAAG,EAAE,QAAQ,IAAMjC,EAAQ,OAAO6B,CAAG,CAAC,EACtC,OAAA7B,EAAQ,IAAI6B,EAAKG,CAAY,EACtBA,CACR,EAEA,MAAMG,EAAU,CACf,IAAMN,EAAMM,EACNF,EAAQlC,EAAM,IAAI8B,CAAG,EACvBI,IACHhC,EAAS,yDAAyD4B,CAAG,kBAAkB,EACvFI,EAAM,UAAU,QAAQ,EACxBlC,EAAM,OAAO8B,CAAG,EAElB,EAEA,iBAAmC,CAClC,IAAMO,EAAyB,CAC9B,YAAarC,EAAM,KACnB,QAAS,EACT,MAAO,EACP,KAAM,EACN,OAAQ,EACR,UAAW,CACZ,EACA,QAAWkC,KAASlC,EAAM,OAAO,EAAG,CACnC,IAAMsC,EAAIJ,EAAM,UAAU,WAAW,EACrCG,EAAM,SAAWC,EAAE,QACnBD,EAAM,OAASC,EAAE,MACjBD,EAAM,MAAQC,EAAE,KAChBD,EAAM,QAAUC,EAAE,OAClBD,EAAM,WAAaC,EAAE,SACtB,CACA,OAAOD,CACR,EAEA,kBAAyB,CACxBnC,EAAS,kDAAkDF,EAAM,IAAI,iBAAiB,EACtF,QAAWkC,KAASlC,EAAM,OAAO,EAAGkC,EAAM,UAAU,WAAW,CAChE,EAEA,YAAmB,CAClBhC,EAAS,wCAAwCF,EAAM,IAAI,iBAAiB,EAC5E,QAAWkC,KAASlC,EAAM,OAAO,EAAGkC,EAAM,UAAU,QAAQ,EAC5DlC,EAAM,MAAM,CACb,CACD,CACD,CC9VO,SAASuC,EAA0BC,EAAuC,CAChF,IAAMC,EAAS,KAAK,IAAI,EAAG,KAAK,MAAMD,CAAQ,CAAC,EAGzCE,EAAQ,IAAI,IACdC,EAAgB,EACdC,EAAQ,CAAE,KAAM,EAAG,OAAQ,EAAG,UAAW,CAAE,EAEjD,SAASC,EAAMC,EAAaC,EAAoB,CAC/CL,EAAM,OAAOI,CAAG,EAChBJ,EAAM,IAAII,EAAKC,CAAK,CACrB,CAEA,SAASC,GAAmB,CAC3B,KAAOL,EAAgBF,GAAUC,EAAM,KAAO,GAAG,CAChD,IAAMO,EAAYP,EAAM,KAAK,EAAE,KAAK,EAAE,MAChCQ,EAASR,EAAM,IAAIO,CAAS,EAClCP,EAAM,OAAOO,CAAS,EACtBN,GAAiBO,EAAO,MAAM,WAC9BN,EAAM,WAAa,CACpB,CACD,CAEA,SAASO,EAAML,EAAaM,EAAyB,CAIpD,GAHIX,IAAW,GAGXW,EAAM,WAAaX,EAAQ,OAC/B,IAAMY,EAAWX,EAAM,IAAII,CAAG,EAC1BO,IAAUV,GAAiBU,EAAS,MAAM,YAC9CX,EAAM,IAAII,EAAK,CAAE,MAAAM,CAAM,CAAC,EACxBT,GAAiBS,EAAM,WACvBJ,EAAW,CACZ,CAEA,MAAO,CACN,UAAUM,EAAWC,EAAM,CAC1B,IAAMC,EAA0B,CAAE,OAAQ,GAAO,UAAW,EAAM,EAClE,MAAO,CACN,IAAKF,EACL,QAAAE,EACA,KAAM,SAAY,CACjB,IAAMC,EAAMf,EAAM,IAAIY,CAAS,EAC/B,GAAIG,EACH,OAAAZ,EAAMS,EAAWG,CAAG,EACpBb,EAAM,MAAQ,EACdY,EAAQ,OAAS,GACjBA,EAAQ,UAAY,GACbC,EAAI,MAEZb,EAAM,QAAU,EAChBY,EAAQ,OAAS,GACjBA,EAAQ,UAAY,GACpB,IAAMJ,EAAQ,MAAMG,EAAK,EACzB,OAAAJ,EAAMG,EAAWF,CAAK,EACfA,CACR,CACD,CACD,EACA,OAAQ,CACP,MAAO,CACN,KAAMR,EAAM,KACZ,OAAQA,EAAM,OACd,UAAWA,EAAM,UACjB,QAASF,EAAM,KACf,MAAOC,CACR,CACD,EACA,OAAQ,CACPD,EAAM,MAAM,EACZC,EAAgB,CACjB,CACD,CACD,CChGO,SAASe,EACfC,EAAyC,CAAC,EACjB,CAKzB,IAAMC,EAAW,IAAI,IAErB,MAAO,CACN,IAAOC,EAAaC,EAAwBC,EAAyC,CACpF,IAAMC,EAAWJ,EAAS,IAAIC,CAAG,EACjC,GAAIG,EACH,OAAAL,EAAQ,SAASE,CAAG,EACpBG,EAAS,cAAc,EAChBA,EAAS,QAKjB,IAAMC,EAAiB,CAAE,YAAaF,EAAgB,QAAS,MAAW,EACpEG,GAAK,SAAYJ,EAAK,GAAG,EAAE,QAAQ,IAAM,CAE9CG,EAAO,YAAc,OAEjBL,EAAS,IAAIC,CAAG,IAAMI,GAAQL,EAAS,OAAOC,CAAG,CACtD,CAAC,EACD,OAAAI,EAAO,QAAUC,EACjBN,EAAS,IAAIC,EAAKI,CAAM,EACjBC,CACR,EACA,UAAmB,CAClB,OAAON,EAAS,IACjB,CACD,CACD,CC1DA,OACC,mBAAAO,EACA,mBAAAC,MAGM,mBACP,OAAS,cAAAC,OAAgC,oBAsGzC,SAASC,GAAeC,EAA6D,CACpF,OACC,OAAOA,GAAW,UAClBA,IAAW,MACX,EAAEA,aAAkB,aACpB,YAAaA,CAEf,CAEA,SAASC,GACRD,EACmE,CACnE,OACC,OAAOA,GAAW,UAClBA,IAAW,MACX,EAAEA,aAAkB,aACpB,EAAE,YAAaA,IACf,EAAE,QAASA,IACX,cAAeA,CAEjB,CAEO,IAAME,EAAN,KAAkB,CACP,OACA,YACA,UACA,aAEjB,YAAYC,EAA6B,CACxC,KAAK,OAASA,EAAQ,OACtB,IAAMC,EAASD,EAAQ,QAAU,IAAIE,GAErC,KAAK,YAAcC,EAAkB,CACpC,mBAAoB,KAAK,OAAO,mBAChC,WAAY,KAAK,OAAO,wBACxB,mBAAoB,KAAK,OAAO,0BAChC,2BAA4B,KAAK,OAAO,4BACxC,cAAe,KAAK,OAAO,qBAC3B,YAAa,KAAK,OAAO,mBACzB,sBAAuB,KAAK,OAAO,uBACnC,MAAOH,EAAQ,OAAS,GACxB,sBAAuBA,EAAQ,sBAC/B,WACCA,EAAQ,aACNI,GAAYH,EAAO,MAAMG,EAAS,CAAE,UAAW,sBAAuB,CAAC,EAC3E,CAAC,EAED,KAAK,UAAYC,EAA0B,KAAK,OAAO,2BAA2B,EAElF,KAAK,aAAeC,EAA6B,CAChD,OAAQN,EAAQ,gBACjB,CAAC,CACF,CAEA,UAAUO,EAAwBC,EAA2D,CAC5F,OAAO,KAAK,YAAY,UAAUD,EAAQC,CAAI,CAC/C,CAEA,cAAcC,EAAmBC,EAA+C,CAC/E,OAAO,KAAK,UAAU,UAAUD,EAAWC,CAAI,CAChD,CAEA,YAAYC,EAAkB,CAC7B,KAAK,YAAY,MAAMA,CAAE,CAC1B,CAEA,kBAAyB,CACxB,KAAK,YAAY,iBAAiB,CACnC,CAEA,OAA0B,CACzB,MAAO,CACN,OAAQ,KAAK,YAAY,gBAAgB,EACzC,gBAAiB,KAAK,UAAU,MAAM,EACtC,WAAY,CAAE,SAAU,KAAK,aAAa,SAAS,CAAE,CACtD,CACD,CAEA,MAAM,MAAMC,EAAmD,CAC9D,GAAM,CACL,iBAAkBC,EAClB,eAAAC,EACA,SAAAC,CACD,EAAI,KAAK,wBAAwBH,CAAI,EAE/BI,EAAS,MAAM,KAAK,YAAY,UAAUJ,EAAK,OAAQ,CAC5D,eAAgBA,EAAK,cACtB,CAAC,EACKK,EAAYC,EAAoBN,EAAK,OAAQA,EAAK,MAAM,EACxDO,EAAc,GAAGJ,CAAQ,IAAIH,EAAK,OAAO,EAAE,IAAIQ,EAAgBH,CAAS,CAAC,GAIzEI,EAAkB,IAAI,gBACxBC,EAAa,GACXC,EAAgB,IAAM,CACtBD,GAAYD,EAAgB,MAAM,CACxC,EAKAT,EAAK,OAAO,iBAAiB,QAASW,EAAe,CAAE,KAAM,EAAK,CAAC,EAEnE,IAAMC,EAAiBZ,EAAK,gBAAkB,GAC1Ca,EACJ,GAAI,CACHA,EAAU,MAAM,KAAK,aAAa,IACjCN,EACA,IACCO,EAAiB,CAChB,iBAAkBb,EAClB,eAAAC,EACA,OAAQF,EAAK,OACb,OAAQA,EAAK,OACb,UAAAK,EACA,OAAAD,EACA,iBAAkB,KAAK,OAAO,wBAC9B,mBAAoB,KAAK,OAAO,mBAChC,eAAAQ,EACA,OAAQH,EAAgB,OACxB,YAAaT,EAAK,aAAe,YAAY,IAAI,EACjD,UAAWA,EAAK,WAAa,EAC7B,UAAWA,EAAK,SACjB,CAAC,EACF,IAAM,CACLU,EAAa,EACd,CACD,CACD,QAAE,CACDV,EAAK,OAAO,oBAAoB,QAASW,CAAa,CACvD,CAEA,GAAIE,EAAQ,OAAS,KAAM,OAAOA,EAIlC,IAAME,EAAOC,EAAwBH,EAAQ,SAAUD,CAAc,EACrE,MAAO,CACN,GAAGC,EACH,SAAU,CAAE,GAAGA,EAAQ,SAAU,KAAME,EAAK,KAAM,QAASA,EAAK,OAAQ,CACzE,CACD,CAEA,WACCF,EACAjB,EAC4B,CAC5B,IAAMqB,EAAO,CACZC,EACAC,IAC+B,CAC3BvB,GAAM,SAASA,EAAK,QAAQsB,EAAQC,CAAI,EAC5C,IAAMC,EAAkC,CAAE,eAAgB,kBAAmB,EAC7E,OAAID,EAAK,aAAe,SAAWC,EAAQ,aAAa,EAAI,OAAOD,EAAK,UAAU,GAC3E,CAAE,OAAAD,EAAQ,QAAAE,EAAS,KAAM,KAAK,UAAUD,CAAI,CAAE,CACtD,EAEA,OAAQN,EAAQ,KAAM,CACrB,IAAK,KACJ,MAAO,CAAE,OAAQ,IAAK,QAASA,EAAQ,SAAS,QAAS,KAAMA,EAAQ,SAAS,IAAK,EACtF,IAAK,UACJ,OAAOI,EAAK,IAAK,CAAE,QAASJ,EAAQ,OAAQ,CAAC,EAC9C,IAAK,eACJ,OAAOI,EAAK,IAAK,CAAE,QAAS,uBAAwB,CAAC,EACtD,IAAK,YACJ,OAAOA,EAAK,IAAK,CAChB,QACC,mGACF,CAAC,EACF,IAAK,OACJ,OAAOA,EAAK,IAAK,CAAE,QAASJ,EAAQ,QAAS,WAAYA,EAAQ,iBAAkB,CAAC,EACrF,IAAK,gBACJ,MAAMA,EAAQ,KAChB,CACD,CAEA,cAAcA,EAAiC,CAC9C,IAAMQ,EAAI,KAAK,WAAWR,CAAO,EACjC,OAAO,IAAI,SAAS,OAAOQ,EAAE,MAAS,SAAWA,EAAE,KAAO,IAAI,WAAWA,EAAE,IAAI,EAAG,CACjF,OAAQA,EAAE,OACV,QAASA,EAAE,OACZ,CAAC,CACF,CAEQ,wBAAwBrB,EAI9B,CACD,IAAMf,EAASe,EAAK,iBAEpB,GAAId,GAAkBD,CAAM,EAAG,CAC9B,IAAMqC,EAAM,KAAK,UAAU,UAAUrC,EAAO,UAAWA,EAAO,IAAI,EAClE,MAAO,CAAE,iBAAkBqC,EAAK,eAAgBA,EAAI,QAAS,SAAUA,EAAI,GAAI,CAChF,CAEA,GAAItC,GAAeC,CAAM,EACxB,MAAO,CAAE,iBAAkBA,EAAQ,eAAgBA,EAAO,QAAS,SAAUA,EAAO,GAAI,EAGzF,GAAIsC,EAAgBtC,CAAM,EACzB,MAAO,CAAE,iBAAkBA,EAAQ,SAAUA,EAAO,GAAI,EAIzD,GAAI,CAACe,EAAK,cACT,MAAM,IAAI,MACT,gGACD,EAED,MAAO,CAAE,iBAAkBf,EAAQ,SAAUe,EAAK,aAAc,CACjE,CACD,EChQA,OAAS,mBAAAwB,OAAuB","names":["ErrorCodes","RhinoComputeError","TreeBuilder","gzip","gunzipSync","promisify","processInput","transformInputParameter","input","value","raw","processed","effective","gzipAsync","promisify","gzip","COMPUTE_CONTRACT_VERSION","COMPUTE_VERSION_HEADER","buildSolveInputTree","inputs","values","TreeBuilder","input","transformInputParameter","runSolvePipeline","args","client","signal","treeBuildStart","inputTree","treeBuildMs","settleSeqBefore","rhinoSeqBefore","result","solveStart","err","durationMs","RhinoComputeError","ErrorCodes","solveMs","serializeStart","serialized","serializeMs","worthSendingGzip","compressed","gzipMs","gzipStart","serverTotalMs","settle","rhino","headers","buildServerTiming","metrics","envelope","adaptEnvelopeToEncoding","acceptEncoding","waiterWantsGzip","json","gunzipSync","parts","header","onRhinoMs","computeLinkMs","label","ms","byteRef","verdict","GrasshopperClient","enableDebugLogging","serverIdentity","server","DEFAULT_MAX_WARM_COMPUTE_SERVERS","FALLBACK_CONCURRENCY","CONCURRENCY_PROBE_INTERVAL_MS","createClientCache","config","maxWarmComputeServers","cache","pending","debugLog","message","build","definitionGuid","rhinoTiming","solveMeta","debugVerbose","clientConfig","t","decode","solve","encode","defCache","solveCache","client","maxConcurrent","lastProbeAt","probing","refreshConcurrency","scheduler","children","next","_ctx","result","errs","errCount","cacheNote","opts","key","existing","inFlight","buildPromise","entry","oldestKey","id","total","s","createDefinitionByteCache","maxBytes","budget","cache","retainedBytes","stats","touch","key","entry","evictToFit","oldestKey","oldest","store","bytes","existing","versionId","load","outcome","hit","createSolveCacheSingleFlight","options","inflight","key","work","onWaiterJoined","existing","flight","p","isDefinitionRef","stableStringify","NoopLogger","isByteCacheRef","source","isVersionLoadPair","SolveEngine","options","logger","NoopLogger","createClientCache","message","createDefinitionByteCache","createSolveCacheSingleFlight","server","opts","versionId","load","id","args","resolvedSource","byteRefOutcome","identity","client","inputTree","buildSolveInputTree","coalesceKey","stableStringify","abortController","hasWaiters","onCallerAbort","acceptEncoding","outcome","runSolvePipeline","wire","adaptEnvelopeToEncoding","fail","status","body","headers","r","ref","isDefinitionRef","isDefinitionRef"]}
+{"version":3,"file":"server.js","names":["isDefinitionRef"],"sources":["../src/server/transform-input.ts","../src/server/solve-pipeline.ts","../src/server/client-cache.ts","../src/server/definition-byte-cache.ts","../src/server/solve-cache-single-flight.ts","../src/server/solve-engine.ts"],"sourcesContent":["import { type InputParam, type InputParamSchema, processInput } from '@selvajs/compute/grasshopper';\nimport type { SchemaInput } from '@selvajs/schemas';\n\n/**\n * `SchemaInput` has no `values`/`acceptedFormats` (those live on the layout item's config), so\n * valueList/file inputs here carry just the selected value with no option list.\n */\nexport function transformInputParameter(\n\tinput: SchemaInput & { minimum?: number; maximum?: number; stepSize?: number },\n\tvalue: unknown\n): InputParam {\n\tconst raw: InputParamSchema = {\n\t\tid: input.id,\n\t\tname: input.nickname,\n\t\tnickname: input.nickname || null,\n\t\tdescription: input.description || '',\n\t\t// processInput has no dynamicValueList handler — the plugin's GetDynamicValueListParameter\n\t\t// reuses TypeName \"ValueList\" on the wire, so map it here or it falls back to Geometry with\n\t\t// a null default and TreeBuilder drops the input (Grasshopper solves on a stale fallback).\n\t\tparamType: input.paramType === 'dynamicValueList' ? 'valueList' : input.paramType,\n\t\ttreeAccess: input.inputStructure === 'tree',\n\t\tminimum: input.minimum ?? null,\n\t\tmaximum: input.maximum ?? null,\n\t\tatLeast: 1,\n\t\tatMost: 1,\n\t\tstepSize: input.stepSize,\n\t\tdefault: value ?? input.default\n\t};\n\n\tconst processed = processInput(raw);\n\t// processInput drops a default in two cases we need to override, or the input is omitted from\n\t// the solve and the user's selection never reaches Grasshopper: a plain array default (e.g. a\n\t// dynamic value list checklist) is rejected as malformed; and ValueList drops a scalar default\n\t// it can't validate against a `values` map — which SchemaInput never carries, so every app\n\t// value-list selection hits this path.\n\tconst effective = value ?? input.default;\n\tif (processed.default == null && effective != null) {\n\t\tif (Array.isArray(effective)) {\n\t\t\t(processed as { default: unknown }).default = effective;\n\t\t} else if (processed.paramType === 'ValueList' && typeof effective !== 'object') {\n\t\t\t// Restoring for other types would mean shipping a value the package rejected as\n\t\t\t// genuinely unparseable — scoped to ValueList only.\n\t\t\t(processed as { default: unknown }).default = effective;\n\t\t}\n\t}\n\treturn processed;\n}\n","/**\n * Transport-agnostic solve pipeline: given an already-resolved solve context\n * (`.gh` bytes, input params + user values, a warm `SolveScheduler`), runs the\n * solve and returns a discriminated {@link SolveOutcome} instead of throwing\n * for expected failures. Auth, the database, share tokens, rate limits, and\n * metric sinks are the calling route's job, not this file's.\n */\n\nimport { ErrorCodes, ComputeError, type SolveDefinition } from '@selvajs/compute/core';\nimport {\n\tTreeBuilder,\n\ttype DataTree,\n\ttype GrasshopperComputeResponse,\n\ttype InputParam\n} from '@selvajs/compute/grasshopper';\nimport type { SchemaInput } from '@selvajs/schemas';\nimport { gzip, gunzipSync } from 'node:zlib';\nimport { promisify } from 'node:util';\nimport { transformInputParameter } from './transform-input.js';\nimport type { CachedClient } from './client-cache.js';\nimport type { ByteRefOutcome } from './definition-byte-cache.js';\n\n// gzipSync blocks the event loop for multi-MB bodies; promisify(gzip) doesn't.\nconst gzipAsync = promisify(gzip);\n\n// ============================================================================\n// Wire contract version\n// ============================================================================\n\n/** Compute-response contract version. Bump (and document the change) whenever the envelope's shape changes in a way a consumer could observe. */\nexport const COMPUTE_CONTRACT_VERSION = 1 as const;\nexport const COMPUTE_VERSION_HEADER = 'X-Selva-Compute-Version';\n\n// ============================================================================\n// Inputs & outcomes\n// ============================================================================\n\nexport type PipelineInput = SchemaInput & {\n\tminimum?: number;\n\tmaximum?: number;\n\tstepSize?: number;\n};\n\nexport interface SolvePipelineArgs {\n\t/**\n\t * Raw `.gh` bytes, or a byte-cache `DefinitionRef` whose bytes the scheduler\n\t * materializes only when an upload is unavoidable — a pointer-known solve\n\t * moves zero bytes.\n\t */\n\tdefinitionSource: SolveDefinition;\n\t/** Mutable load outcome for a `DefinitionRef` source, so the `def_bytes` Server-Timing verdict can be emitted. Omit for raw-bytes solves. */\n\tbyteRefOutcome?: ByteRefOutcome;\n\t/** Persisted input params; only those with a `paramType` are sent to the solve. */\n\tinputs: PipelineInput[];\n\t/**\n\t * A tree the caller already built with {@link buildSolveInputTree}; skips the\n\t * pipeline's own build and solves this object directly.\n\t *\n\t * A caller coalescing concurrent solves needs this: a single-flight key\n\t * derived from raw `{inputs, values}` would split two requests that transform\n\t * to the same tree, which is the identity the scheduler actually caches on.\n\t */\n\tinputTree?: DataTree[];\n\t/** User-chosen values keyed by input id; missing keys fall back to the schema default. */\n\tvalues: Record<string, unknown>;\n\tclient: CachedClient;\n\tresponseMaxBytes: number;\n\t/** Only phrases the timeout message — the scheduler enforces the deadline itself. */\n\tsolveDeadlineMs: number;\n\t/** Client's `Accept-Encoding`; gzip is applied only when it advertises `gzip`. */\n\tacceptEncoding: string;\n\t/**\n\t * Forwarded to the scheduler so a client disconnect cancels the upstream\n\t * compute call. Its `aborted` flag also distinguishes a client disconnect\n\t * from the scheduler's own deadline firing.\n\t */\n\tsignal: AbortSignal;\n\t/** Wall-clock origin (`performance.now()` at the top of the request) so `load`/`total` phase timings line up with the caller's pre-solve prep. */\n\tloadStartMs: number;\n\t/** Pre-solve \"load\" phase duration the caller already measured (auth + DB + fetch). */\n\tdefLoadMs: number;\n\t/** Pre-solve prep sub-phase marks (`[label, ms]`), surfaced verbatim as `p_*` Server-Timing entries. */\n\tprepMarks?: [string, number][];\n}\n\n/** Phase timings the pipeline measured; the caller uses them for debug logging. */\nexport interface SolvePhaseMetrics {\n\ttreeBuildMs: number;\n\tsolveMs: number;\n\tserializeMs: number;\n\tgzipMs: number;\n\tserverTotalMs: number;\n\tserializedBytes: number;\n\t/** Null when compression was skipped. */\n\tcompressedBytes: number | null;\n}\n\n/** A ready-to-send response: body + headers + the solve result + phase metrics. */\nexport interface SolveEnvelope {\n\t/** A gzip `Uint8Array` when `encoding === 'gzip'`, else the JSON string. */\n\tbody: string | Uint8Array;\n\tencoding?: 'gzip';\n\theaders: Record<string, string>;\n\tresult: GrasshopperComputeResponse;\n\tmetrics: SolvePhaseMetrics;\n}\n\n/**\n * `ok` carries the envelope; every other variant names an expected failure the\n * calling route maps to a status code (timeout→504, client_abort→499,\n * too_large→413, shed→503+Retry-After, compute_error→generic 500/503).\n * `durationMs` on error variants is the solve wall time up to the failure, for\n * the metric record.\n */\nexport type SolveOutcome =\n\t| {\n\t\t\tkind: 'ok';\n\t\t\tenvelope: SolveEnvelope;\n\t\t\tsolveMs: number;\n\t\t\terrorCount: number;\n\t\t\twarningCount: number;\n\t  }\n\t| { kind: 'timeout'; durationMs: number; message: string }\n\t| { kind: 'client_abort'; durationMs: number }\n\t| { kind: 'too_large' }\n\t/** Scheduler backpressure rejected the solve before it ran: queue was full (`queue_full`) or the wait exceeded the deadline (`queue_timeout`). Retryable — `retryAfterSeconds` is a backoff hint. */\n\t| {\n\t\t\tkind: 'shed';\n\t\t\tdurationMs: number;\n\t\t\treason: 'queue_full' | 'queue_timeout';\n\t\t\tretryAfterSeconds: number;\n\t\t\tmessage: string;\n\t  }\n\t| { kind: 'compute_error'; durationMs: number; error: unknown };\n\n// ============================================================================\n// Pipeline\n// ============================================================================\n\n/** The transformed input tree exactly as handed to the scheduler; `runSolvePipeline` calls this itself unless the caller supplies {@link SolvePipelineArgs.inputTree}. */\nexport function buildSolveInputTree(\n\tinputs: PipelineInput[],\n\tvalues: Record<string, unknown>\n): DataTree[] {\n\treturn TreeBuilder.fromInputParams(\n\t\tinputs\n\t\t\t.filter((input) => input.paramType)\n\t\t\t.map((input): InputParam => transformInputParameter(input, values[input.id]))\n\t);\n}\n\nexport async function runSolvePipeline(args: SolvePipelineArgs): Promise<SolveOutcome> {\n\tconst { client, signal } = args;\n\n\tconst treeBuildStart = performance.now();\n\tconst inputTree = args.inputTree ?? buildSolveInputTree(args.inputs, args.values);\n\tconst treeBuildMs = performance.now() - treeBuildStart;\n\n\t// client.solveMeta/rhinoTiming live on the warm client and are written by\n\t// every request on this server; with scheduler maxConcurrent > 1, another\n\t// request can write them mid-flight. A slot is attributed to THIS request\n\t// only if exactly one write happened since this snapshot — for solveMeta\n\t// that single settle is necessarily ours, since onSettle fires before\n\t// scheduler.solve() resolves. Anything ambiguous is dropped from\n\t// Server-Timing rather than misattributed.\n\tconst settleSeqBefore = client.solveMeta.seq;\n\tconst rhinoSeqBefore = client.rhinoTiming.seq;\n\n\tlet result: GrasshopperComputeResponse;\n\tconst solveStart = performance.now();\n\ttry {\n\t\tresult = await client.scheduler.solve(args.definitionSource, inputTree, { signal });\n\t} catch (err) {\n\t\tconst durationMs = performance.now() - solveStart;\n\t\t// AbortError with the request signal NOT aborted means the scheduler's own\n\t\t// deadline timer fired, not a client disconnect.\n\t\tconst isAbort = err instanceof Error && err.name === 'AbortError';\n\t\tif (isAbort) {\n\t\t\tif (signal.aborted) return { kind: 'client_abort', durationMs };\n\t\t\treturn {\n\t\t\t\tkind: 'timeout',\n\t\t\t\tdurationMs,\n\t\t\t\tmessage: `Solve exceeded the ${Math.round(args.solveDeadlineMs / 1000)}s deadline.`\n\t\t\t};\n\t\t}\n\t\t// Queue-full or queue-timeout rejects the solve before compute runs — a load\n\t\t// signal, not a failure, so it's `shed` rather than `compute_error`.\n\t\tif (err instanceof ComputeError) {\n\t\t\tif (err.code === ErrorCodes.QUEUE_FULL) {\n\t\t\t\treturn {\n\t\t\t\t\tkind: 'shed',\n\t\t\t\t\tdurationMs,\n\t\t\t\t\treason: 'queue_full',\n\t\t\t\t\tretryAfterSeconds: 1,\n\t\t\t\t\tmessage: 'Compute server is at capacity. Retry shortly.'\n\t\t\t\t};\n\t\t\t}\n\t\t\tif (err.code === ErrorCodes.QUEUE_TIMEOUT) {\n\t\t\t\treturn {\n\t\t\t\t\tkind: 'shed',\n\t\t\t\t\tdurationMs,\n\t\t\t\t\treason: 'queue_timeout',\n\t\t\t\t\tretryAfterSeconds: 1,\n\t\t\t\t\tmessage: 'Compute request waited too long in the queue. Retry shortly.'\n\t\t\t\t};\n\t\t\t}\n\t\t}\n\t\treturn { kind: 'compute_error', durationMs, error: err };\n\t}\n\tconst solveMs = performance.now() - solveStart;\n\n\tconst serializeStart = performance.now();\n\tlet serialized: string;\n\ttry {\n\t\tserialized = JSON.stringify(result);\n\t} catch (err) {\n\t\t// V8 caps a string at ~512 MB; an oversized `file` output trips a RangeError\n\t\t// here. Treat it the same as the byte cap: too_large.\n\t\tif (err instanceof RangeError) return { kind: 'too_large' };\n\t\tthrow err;\n\t}\n\tif (serialized.length > args.responseMaxBytes) return { kind: 'too_large' };\n\tconst serializeMs = performance.now() - serializeStart;\n\n\t// Buffered, not streamed, so Content-Length is known upfront and a connection\n\t// cut mid-transfer fails hard instead of silently truncating the JSON. Below\n\t// 1 KB gzip isn't worth the CPU for the wire savings.\n\tconst clientWantsGzip = /\\bgzip\\b/i.test(args.acceptEncoding);\n\tconst worthSendingGzip = clientWantsGzip && serialized.length > 1024;\n\tlet compressed: Buffer | null = null;\n\tlet gzipMs = 0;\n\tif (worthSendingGzip) {\n\t\tconst gzipStart = performance.now();\n\t\tcompressed = await gzipAsync(Buffer.from(serialized));\n\t\tgzipMs = performance.now() - gzipStart;\n\t}\n\n\tconst serverTotalMs = performance.now() - args.loadStartMs;\n\n\t// rhino is only meaningful when settle is ours AND it was a real compute call\n\t// (a Selva-cache hit never reaches the server), and only unambiguous when\n\t// exactly one Server-Timing callback fired in the window.\n\tconst settle = client.solveMeta.seq === settleSeqBefore + 1 ? client.solveMeta.last : null;\n\tconst rhino =\n\t\tsettle && !settle.fromCache && client.rhinoTiming.seq === rhinoSeqBefore + 1\n\t\t\t? client.rhinoTiming.last\n\t\t\t: null;\n\n\tconst serverTiming = buildServerTiming({\n\t\tdefLoadMs: args.defLoadMs,\n\t\ttreeBuildMs,\n\t\tsolveMs,\n\t\tserializeMs,\n\t\tgzipMs,\n\t\tserverTotalMs,\n\t\trhino,\n\t\tsettle,\n\t\tbyteRefOutcome: args.byteRefOutcome,\n\t\tprepMarks: args.prepMarks ?? []\n\t});\n\n\tconst headers: Record<string, string> = {\n\t\t'Content-Type': 'application/json',\n\t\t'Server-Timing': serverTiming,\n\t\t[COMPUTE_VERSION_HEADER]: String(COMPUTE_CONTRACT_VERSION),\n\t\tVary: 'Accept-Encoding'\n\t};\n\n\tconst metrics: SolvePhaseMetrics = {\n\t\ttreeBuildMs,\n\t\tsolveMs,\n\t\tserializeMs,\n\t\tgzipMs,\n\t\tserverTotalMs,\n\t\tserializedBytes: serialized.length,\n\t\tcompressedBytes: compressed?.byteLength ?? null\n\t};\n\n\tlet envelope: SolveEnvelope;\n\tif (compressed) {\n\t\t// Content-Encoding tells a downstream proxy the body is already compressed,\n\t\t// so it won't gzip it again.\n\t\theaders['Content-Encoding'] = 'gzip';\n\t\theaders['Content-Length'] = String(compressed.byteLength);\n\t\tenvelope = {\n\t\t\tbody: new Uint8Array(compressed),\n\t\t\tencoding: 'gzip',\n\t\t\theaders,\n\t\t\tresult,\n\t\t\tmetrics\n\t\t};\n\t} else {\n\t\theaders['Content-Length'] = String(Buffer.byteLength(serialized));\n\t\tenvelope = { body: serialized, headers, result, metrics };\n\t}\n\n\treturn {\n\t\tkind: 'ok',\n\t\tenvelope,\n\t\tsolveMs,\n\t\terrorCount: result.errors?.length ?? 0,\n\t\twarningCount: result.warnings?.length ?? 0\n\t};\n}\n\n// ============================================================================\n// Per-waiter encoding adaptation\n// ============================================================================\n\n/**\n * Re-key a coalesced envelope to a single waiter's `Accept-Encoding`.\n *\n * The single-flight coalescer runs ONE pipeline execution for N identical\n * concurrent solves and hands every waiter the same {@link SolveEnvelope},\n * baked from the FIRST caller's `Accept-Encoding`. A later waiter with a\n * different `Accept-Encoding` would otherwise get a body labelled with the\n * wrong encoding — `Vary` can't help here, since it's one shared object, not a\n * cache lookup. Encoding is deliberately left out of the coalesce key so mixed\n * clients still coalesce; this adapts the shared result to each waiter instead.\n *\n * Only the correctness-critical direction is adapted: a gzip envelope served to\n * a non-gzip waiter is gunzipped back to JSON. The reverse (plain JSON to a\n * gzip-capable waiter) is left uncompressed — correct, just not maximally small.\n */\nexport function adaptEnvelopeToEncoding(\n\tenvelope: SolveEnvelope,\n\tacceptEncoding: string\n): { body: string | Uint8Array; headers: Record<string, string> } {\n\tconst waiterWantsGzip = /\\bgzip\\b/i.test(acceptEncoding);\n\n\t// Only mismatch that corrupts the response: gzip body, non-gzip waiter.\n\t// Every other combination is already wire-correct.\n\tif (envelope.encoding === 'gzip' && !waiterWantsGzip) {\n\t\tconst json = gunzipSync(\n\t\t\tenvelope.body instanceof Uint8Array ? envelope.body : Buffer.from(envelope.body)\n\t\t).toString('utf8');\n\t\tconst headers = { ...envelope.headers };\n\t\tdelete headers['Content-Encoding'];\n\t\theaders['Content-Length'] = String(Buffer.byteLength(json));\n\t\treturn { body: json, headers };\n\t}\n\n\treturn { body: envelope.body, headers: envelope.headers };\n}\n\n// ============================================================================\n// Server-Timing assembly\n// ============================================================================\n\ninterface ServerTimingParts {\n\tdefLoadMs: number;\n\ttreeBuildMs: number;\n\tsolveMs: number;\n\tserializeMs: number;\n\tgzipMs: number;\n\tserverTotalMs: number;\n\trhino: CachedClient['rhinoTiming']['last'];\n\tsettle: CachedClient['solveMeta']['last'];\n\tbyteRefOutcome?: ByteRefOutcome;\n\tprepMarks: [string, number][];\n}\n\n/**\n * `total` is the server's headers-to-out wall time, so browser `ttfb − total`\n * ≈ network+send latency. When the compute server reports its own\n * decode/solve/encode (VektorNode fork), `rhino_*` is time on the compute\n * server and `compute_link` is everything between it (network + queue wait).\n */\nfunction buildServerTiming(parts: ServerTimingParts): string {\n\tlet header =\n\t\t`load;dur=${parts.defLoadMs.toFixed(1)}, ` +\n\t\t`tree;dur=${parts.treeBuildMs.toFixed(1)}, ` +\n\t\t`solve;dur=${parts.solveMs.toFixed(1)}, ` +\n\t\t`serialize;dur=${parts.serializeMs.toFixed(1)}, ` +\n\t\t`gzip;dur=${parts.gzipMs.toFixed(1)}, ` +\n\t\t`total;dur=${parts.serverTotalMs.toFixed(1)}`;\n\n\tconst rhino = parts.rhino;\n\tif (rhino) {\n\t\tconst onRhinoMs = rhino.decode + rhino.solve + rhino.encode;\n\t\tconst computeLinkMs = Math.max(0, parts.solveMs - onRhinoMs);\n\t\theader +=\n\t\t\t`, rhino_decode;dur=${rhino.decode.toFixed(1)}` +\n\t\t\t`, rhino_solve;dur=${rhino.solve.toFixed(1)}` +\n\t\t\t`, rhino_encode;dur=${rhino.encode.toFixed(1)}` +\n\t\t\t`, compute_link;dur=${computeLinkMs.toFixed(1)}`;\n\t}\n\n\tfor (const [label, ms] of parts.prepMarks) {\n\t\theader += `, p_${label};dur=${ms.toFixed(1)}`;\n\t}\n\n\tconst settle = parts.settle;\n\tif (settle) {\n\t\theader += `, selva_cache;dur=${settle.fromCache ? 1 : 0}`;\n\t\tif (settle.definitionReuploaded !== undefined) {\n\t\t\theader += `, def_reupload;dur=${settle.definitionReuploaded ? 1 : 0}`;\n\t\t}\n\t}\n\n\t// skipped = scheduler never materialized bytes (pointer-known solve, the\n\t// whole point of this path); hit = warm byte cache; miss = fell through to\n\t// storage. Absent for raw-bytes solves.\n\tconst byteRef = parts.byteRefOutcome;\n\tif (byteRef) {\n\t\tconst verdict = !byteRef.loaded ? 'skipped' : byteRef.fromCache ? 'hit' : 'miss';\n\t\theader += `, def_bytes;desc=${verdict}`;\n\t}\n\n\treturn header;\n}\n","import {\n\tGrasshopperClient,\n\ttype GrasshopperComputeConfig,\n\ttype SolveScheduler\n} from '@selvajs/compute/grasshopper';\nimport { enableDebugLogging } from '@selvajs/compute/core';\n\n// ============================================================================\n// Shared compute client cache\n// ============================================================================\n//\n// One warm `GrasshopperClient` (+ its `SolveScheduler`) per distinct compute\n// server, keyed by the server's `id`, never its URL — a rotated URL/apiKey\n// keeps the same key with stale connection details, so the config-write path\n// MUST call `evict(id)` when a server's config changes.\n//\n// Per-server LRU, not a single shared client: definitions can pin different\n// servers, so two definitions on two servers keep two warm clients, with\n// churn from one-off servers bounded by `maxWarmComputeServers`.\n//\n// Both hot paths share this cache — the solve endpoint uses the entry's\n// `scheduler`; the definition-viewer render path uses the entry's `client`\n// for `getIO` — so a definition that was just solved renders from the same\n// warm client instead of re-handshaking Rhino.Compute per page load.\n\n/**\n * Opaque identity of a compute server — construct only via `serverIdentity()`.\n * Kept opaque so \"a server is now a pool of URLs behind one id\" stays additive.\n */\nexport type ServerIdentity = string & { readonly __brand: 'ServerIdentity' };\n\n/** Minimal resolved-server shape the cache needs (a subset of the app's `ComputeServerConfig`). */\nexport interface ResolvedServer {\n\tid: string;\n\tserverUrl: string;\n\t/** Sent as the `RhinoComputeKey` header. */\n\tapiKey?: string;\n}\n\nexport function serverIdentity(server: Pick<ResolvedServer, 'id'>): ServerIdentity {\n\treturn server.id as ServerIdentity;\n}\n\nexport interface CachedClient {\n\tclient: GrasshopperClient;\n\tscheduler: SolveScheduler;\n\t/**\n\t * Last Server-Timing decode/solve/encode, written by `onServerTiming`. The\n\t * scheduler runs up to `maxConcurrent` solves at once, so `last` alone can't\n\t * be trusted per-request: callers snapshot `seq` before their solve and only\n\t * attribute `last` to themselves if exactly one write happened since (see\n\t * the guard in `runSolvePipeline`), dropping it otherwise rather than risk\n\t * misattributing another request's timing.\n\t */\n\trhinoTiming: { last: { decode: number; solve: number; encode: number } | null; seq: number };\n\t/**\n\t * Same snapshot-and-attribute pattern as `rhinoTiming`, for the scheduler's\n\t * `onSettle` cache verdict. `seq` increments on every settle (success or\n\t * error); `last` is written only on success.\n\t */\n\tsolveMeta: {\n\t\tlast: { fromCache: boolean; definitionReuploaded?: boolean } | null;\n\t\tseq: number;\n\t};\n}\n\n/**\n * Debug verbosity: `false` is silent, `true` gives concise cache/timing logs\n * (`onDebugLog`), `'verbose'` also enables full lib-level request/response\n * dumps (incl. geometry) — a superset of `true`, not an independent setting.\n */\nexport type ClientCacheDebug = boolean | 'verbose';\n\n/** Config injected by the consuming app, so this module stays env-agnostic and testable. */\nexport interface ClientCacheConfig {\n\t/** Per-solve timeout forwarded to the scheduler (`ComputeLimits.solveDeadlineMs`). */\n\tsolveDeadlineMs: number;\n\tcachesolve: boolean;\n\t/** Only meaningful with `cachesolve`. */\n\tcacheerroredsolves: boolean;\n\t/** Reference large definitions by server cache key instead of re-uploading. */\n\treuseServerDefinitionCache: boolean;\n\t/**\n\t * Max solves that may wait in the FIFO queue, excluding in-flight solves\n\t * (capped at `maxConcurrent`, itself driven by the server's probed child\n\t * count). `0` = unbounded (`ComputeLimits.computeMaxQueueDepth`); a full\n\t * queue rejects new solves with `QUEUE_FULL`.\n\t */\n\tmaxQueueDepth: number;\n\t/**\n\t * Max ms a solve may sit queued before executing; `0` = no deadline\n\t * (`ComputeLimits.computeQueueWaitMs`). Too long a wait rejects with\n\t * `QUEUE_TIMEOUT`.\n\t */\n\tqueueWaitMs: number;\n\t/**\n\t * Byte budget for this client's in-process solve cache. Applies per warm\n\t * client — worst-case heap is this × `maxWarmComputeServers`. `0` disables\n\t * the cache (`ComputeLimits.computeSolveCacheBytes`, env `COMPUTE_SOLVE_CACHE_MB`).\n\t */\n\tresponseCacheMaxBytes: number;\n\tdebug: ClientCacheDebug;\n\t/** Max distinct warm compute servers before the LRU evicts the oldest. Default 16. */\n\tmaxWarmComputeServers?: number;\n\t/** Sink for the debug lines. `onDebugLog` only fires when `debug` is not `false`. */\n\tonDebugLog?: (message: string) => void;\n}\n\nexport interface ClientCache {\n\t/**\n\t * Get (or create) the warm client + scheduler for a resolved compute server,\n\t * keyed by its `id`. `definitionGuid`, when present, is stamped as the\n\t * `X-Selva-Definition` header on this client's outbound solve/IO requests —\n\t * inert routing/telemetry metadata until a pool router exists.\n\t */\n\tgetClient(server: ResolvedServer, opts?: { definitionGuid?: string }): Promise<CachedClient>;\n\t/** Dispose and drop the warm client for `id`, so the next request rebuilds against fresh connection details. */\n\tevict(id: string | ServerIdentity): void;\n\t/** Solve-cache counters summed across every warm client. Counters die with the client that owns them, so totals can fall over time. */\n\tsolveCacheStats(): SolveCacheStats;\n\t/**\n\t * Drop every retained solve result, keeping the warm clients (and their\n\t * connections and server-side definition pointers) intact. Nothing expires\n\t * these on its own — the byte budget is the only other pressure — so this is\n\t * the operator's release valve when a definition's inputs no longer describe\n\t * its output, e.g. it reads an external source that has since changed.\n\t */\n\tclearSolveCaches(): void;\n\t/** Dispose every warm client. Test seam / shutdown hook. */\n\tdisposeAll(): void;\n}\n\nexport interface SolveCacheStats {\n\twarmClients: number;\n\tentries: number;\n\tbytes: number;\n\thits: number;\n\tmisses: number;\n\t/** Entries dropped under size/byte pressure (not replacement or manual clears). */\n\tevictions: number;\n}\n\nconst DEFAULT_MAX_WARM_COMPUTE_SERVERS = 16;\n\n/**\n * Fallback concurrency while the first probe is still in flight, and the value\n * kept whenever a probe fails or reports 0 — never send more than a single\n * solve to a server whose real capacity is unknown.\n */\nconst FALLBACK_CONCURRENCY = 1;\n\n/**\n * How stale the compute server's child count may get before a solve triggers a\n * re-read. Short enough that a resized pool is picked up within a few solves,\n * long enough that a busy server is probed rarely — the probe rides on solve\n * completion, so an idle server is never polled at all.\n */\nconst CONCURRENCY_PROBE_INTERVAL_MS = 5 * 60 * 1000;\n\nexport function createClientCache(config: ClientCacheConfig): ClientCache {\n\tconst maxWarmComputeServers = config.maxWarmComputeServers ?? DEFAULT_MAX_WARM_COMPUTE_SERVERS;\n\tconst cache = new Map<string, CachedClient>();\n\t// Builds in flight, keyed like `cache`. Concurrent `getClient` calls for the\n\t// same id must share ONE build: without this, both miss, both handshake, and\n\t// the loser's entry is overwritten in the map without ever being disposed.\n\tconst pending = new Map<string, Promise<CachedClient>>();\n\n\tif (config.debug === 'verbose') enableDebugLogging();\n\n\tconst debugLog = (message: string) => {\n\t\tif (config.debug) config.onDebugLog?.(message);\n\t};\n\n\tasync function build(server: ResolvedServer, definitionGuid?: string): Promise<CachedClient> {\n\t\tconst rhinoTiming: CachedClient['rhinoTiming'] = { last: null, seq: 0 };\n\t\tconst solveMeta: CachedClient['solveMeta'] = { last: null, seq: 0 };\n\t\tconst debugVerbose = config.debug === 'verbose';\n\n\t\tconst clientConfig: GrasshopperComputeConfig = {\n\t\t\tserverUrl: server.serverUrl,\n\t\t\tapiKey: server.apiKey,\n\t\t\t// Lib-level debug is the verbose one (full payload logs); keep it on the\n\t\t\t// verbose flag so the concise cache logs can run without the noise.\n\t\t\tdebug: debugVerbose,\n\t\t\tcachesolve: config.cachesolve,\n\t\t\tcacheerroredsolves: config.cacheerroredsolves,\n\t\t\tonServerTiming: (t) => {\n\t\t\t\tconst decode = t.decode ?? 0;\n\t\t\t\tconst solve = t.solve ?? 0;\n\t\t\t\tconst encode = t.encode ?? 0;\n\t\t\t\trhinoTiming.seq += 1;\n\t\t\t\trhinoTiming.last = { decode, solve, encode };\n\t\t\t\tif (!config.debug) return;\n\t\t\t\t// Heuristic thresholds: a genuine parse/solve is many ms; a cache hit\n\t\t\t\t// is sub-millisecond. Only meaningful relative to the first (cold) solve.\n\t\t\t\tconst defCache =\n\t\t\t\t\tdecode <= 1 ? 'HIT (definition reused, no re-upload/parse)' : 'miss (full parse)';\n\t\t\t\tconst solveCache =\n\t\t\t\t\tconfig.cachesolve && solve <= 1\n\t\t\t\t\t\t? 'HIT (cached result, solve skipped)'\n\t\t\t\t\t\t: config.cachesolve\n\t\t\t\t\t\t\t? 'miss (solved fresh)'\n\t\t\t\t\t\t\t: 'off';\n\t\t\t\tdebugLog(\n\t\t\t\t\t`[Compute/rhino-cache] decode=${decode}ms solve=${solve}ms encode=${encode}ms ` +\n\t\t\t\t\t\t`| definition-cache: ${defCache} | solve-cache (cachesolve): ${solveCache}`\n\t\t\t\t);\n\t\t\t}\n\t\t};\n\n\t\t// Baked at client-create time because the scheduler has no per-request\n\t\t// header hook.\n\t\tif (definitionGuid) {\n\t\t\tclientConfig.headers = { 'X-Selva-Definition': definitionGuid };\n\t\t}\n\n\t\tconst client = await GrasshopperClient.create(clientConfig);\n\n\t\t// rhino.compute hands out children in strict rotation and never reports \"busy\",\n\t\t// so nothing downstream enforces a concurrency cap — send more than it has\n\t\t// children and requests silently double up on one. Rhino.Compute is the only\n\t\t// source of truth for its own child count, so this always probes rather than\n\t\t// trusting an operator-supplied guess.\n\t\t//\n\t\t// The count is not static: children exit on their own under `-idlespan`, and\n\t\t// `/launch-child` + `/recycle-children` resize the pool at runtime. So the probe\n\t\t// re-runs after solves (see `refreshConcurrency`) rather than only at connect.\n\t\tlet maxConcurrent = FALLBACK_CONCURRENCY;\n\t\tlet lastProbeAt = 0;\n\t\tlet probing = false;\n\n\t\t/**\n\t\t * Best-effort re-read of the server's child count. Never awaited by a caller:\n\t\t * a probe must not add a round-trip to the solve path, so a changed count takes\n\t\t * effect on the NEXT solve rather than the one that triggered the probe.\n\t\t *\n\t\t * `initialize: false` keeps this from spawning children on an idle server —\n\t\t * which also means a cold server honestly reports 0. Both a failed probe and a\n\t\t * 0 result fall back to `FALLBACK_CONCURRENCY` (1): an unknown-capacity server\n\t\t * is safer under-used than oversent.\n\t\t */\n\t\tasync function refreshConcurrency(scheduler?: { setMaxConcurrent(n: number): void }) {\n\t\t\tif (probing) return;\n\t\t\tprobing = true;\n\t\t\ttry {\n\t\t\t\tconst children = await Promise.resolve(\n\t\t\t\t\tclient.serverStats?.getActiveChildren({ initialize: false })\n\t\t\t\t).catch(() => null);\n\t\t\t\tlastProbeAt = Date.now();\n\t\t\t\tconst next = !children || children <= 0 ? FALLBACK_CONCURRENCY : children;\n\t\t\t\tif (next === maxConcurrent) return;\n\t\t\t\tdebugLog(\n\t\t\t\t\t`[Compute/client-cache] concurrency ${maxConcurrent} → ${next} (server child count)`\n\t\t\t\t);\n\t\t\t\tmaxConcurrent = next;\n\t\t\t\tscheduler?.setMaxConcurrent(next);\n\t\t\t} finally {\n\t\t\t\tprobing = false;\n\t\t\t}\n\t\t}\n\n\t\t// One blocking probe at connect so the first solves already use the right cap.\n\t\tawait refreshConcurrency();\n\n\t\tconst scheduler = client.createScheduler({\n\t\t\tmode: 'queue',\n\t\t\t// Queue mode defaults maxConcurrent to 1, serializing every solve on\n\t\t\t// this server through a single slot while the compute VM's other\n\t\t\t// compute.geometry children idle — always pass it explicitly.\n\t\t\tmaxConcurrent,\n\t\t\t// The scheduler treats undefined as unbounded/no-deadline, so map our\n\t\t\t// `0`-means-off convention to undefined rather than passing 0 (which\n\t\t\t// would reject EVERY queued solve).\n\t\t\tmaxQueueDepth: config.maxQueueDepth || undefined,\n\t\t\tqueueWaitMs: config.queueWaitMs || undefined,\n\t\t\ttimeoutMs: config.solveDeadlineMs,\n\t\t\t// The byte budget is the only eviction pressure. A solve is a pure\n\t\t\t// function of (definition, inputs), both immutable, so a retained\n\t\t\t// result can never go stale — expiring one only forces a paid re-solve\n\t\t\t// of the identical answer.\n\t\t\tcache: config.responseCacheMaxBytes > 0 ? { maxBytes: config.responseCacheMaxBytes } : false,\n\t\t\treuseServerDefinitionCache: config.reuseServerDefinitionCache,\n\t\t\tonSettle: (_ctx, result) => {\n\t\t\t\tsolveMeta.seq += 1;\n\t\t\t\tif (result.status !== 'success') return;\n\t\t\t\t// Piggyback the pool re-read on real traffic: only servers actually\n\t\t\t\t// being used get probed, at most once per window, and never on the\n\t\t\t\t// request path. A cache hit means we never reached the server, so it\n\t\t\t\t// says nothing about the pool — don't spend a probe on it.\n\t\t\t\tif (\n\t\t\t\t\tresult.fromCache !== true &&\n\t\t\t\t\tDate.now() - lastProbeAt >= CONCURRENCY_PROBE_INTERVAL_MS\n\t\t\t\t) {\n\t\t\t\t\t// Safe despite being referenced from inside its own initializer:\n\t\t\t\t\t// onSettle only ever fires during a solve, long after binding.\n\t\t\t\t\tvoid refreshConcurrency(scheduler);\n\t\t\t\t}\n\t\t\t\tsolveMeta.last = {\n\t\t\t\t\tfromCache: result.fromCache === true,\n\t\t\t\t\tdefinitionReuploaded: result.definitionReuploaded\n\t\t\t\t};\n\t\t\t\tif (!config.debug) return;\n\t\t\t\tdebugLog(\n\t\t\t\t\t`[Compute/selva-cache] ${result.fromCache ? 'HIT  — served from cache (no compute call)' : 'miss — went to Rhino.Compute'} (${Math.round(result.durationMs)}ms)`\n\t\t\t\t);\n\t\t\t\tif (!result.fromCache) {\n\t\t\t\t\tdebugLog(\n\t\t\t\t\t\tresult.definitionReuploaded === true\n\t\t\t\t\t\t\t? '[Compute/def-cache] miss — definition RE-UPLOADED (pointer was cold/stale)'\n\t\t\t\t\t\t\t: result.definitionReuploaded === false\n\t\t\t\t\t\t\t\t? '[Compute/def-cache] HIT  — definition reused from server cache (no upload)'\n\t\t\t\t\t\t\t\t: '[Compute/def-cache] n/a — reuse disabled or non-reusable definition'\n\t\t\t\t\t);\n\t\t\t\t}\n\t\t\t\tif (!result.fromCache) {\n\t\t\t\t\tconst errs = (result.response as { errors?: unknown[] })?.errors;\n\t\t\t\t\tconst errCount = Array.isArray(errs) ? errs.length : 0;\n\t\t\t\t\tif (errCount > 0) {\n\t\t\t\t\t\tconst cacheNote = config.cacheerroredsolves\n\t\t\t\t\t\t\t? 'cached (cacheerroredsolves on)'\n\t\t\t\t\t\t\t: 'not cached (cacheerroredsolves off) — re-run until fixed';\n\t\t\t\t\t\tdebugLog(\n\t\t\t\t\t\t\t`[Compute/rhino-cache] ${errCount} GH error(s); ${cacheNote}. First: ${JSON.stringify((errs as unknown[])[0])}`\n\t\t\t\t\t\t);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t});\n\t\treturn { client, scheduler, rhinoTiming, solveMeta };\n\t}\n\n\treturn {\n\t\tasync getClient(server, opts): Promise<CachedClient> {\n\t\t\tconst key = server.id;\n\t\t\tconst existing = cache.get(key);\n\t\t\tif (existing) {\n\t\t\t\t// Refresh LRU position.\n\t\t\t\tcache.delete(key);\n\t\t\t\tcache.set(key, existing);\n\t\t\t\treturn existing;\n\t\t\t}\n\n\t\t\tconst inFlight = pending.get(key);\n\t\t\tif (inFlight) return inFlight;\n\n\t\t\t// A build is a Rhino.Compute handshake — expensive, and repeated builds for\n\t\t\t// the same id mean churn (LRU thrash or config-rotation evictions).\n\t\t\tdebugLog(`[Compute/client-cache] miss — building warm client for server ${key}`);\n\t\t\tconst buildPromise = (async () => {\n\t\t\t\tconst entry = await build(server, opts?.definitionGuid);\n\n\t\t\t\tif (cache.size >= maxWarmComputeServers) {\n\t\t\t\t\tconst oldestKey = cache.keys().next().value;\n\t\t\t\t\tif (oldestKey !== undefined) {\n\t\t\t\t\t\tdebugLog(\n\t\t\t\t\t\t\t`[Compute/client-cache] LRU evicted warm client for server ${oldestKey} (cap ${maxWarmComputeServers})`\n\t\t\t\t\t\t);\n\t\t\t\t\t\tcache.get(oldestKey)?.scheduler.dispose();\n\t\t\t\t\t\tcache.delete(oldestKey);\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tcache.set(key, entry);\n\t\t\t\treturn entry;\n\t\t\t})().finally(() => pending.delete(key));\n\t\t\tpending.set(key, buildPromise);\n\t\t\treturn buildPromise;\n\t\t},\n\n\t\tevict(id): void {\n\t\t\tconst key = id as string;\n\t\t\tconst entry = cache.get(key);\n\t\t\tif (entry) {\n\t\t\t\tdebugLog(`[Compute/client-cache] evicted warm client for server ${key} (config change)`);\n\t\t\t\tentry.scheduler.dispose();\n\t\t\t\tcache.delete(key);\n\t\t\t}\n\t\t},\n\n\t\tsolveCacheStats(): SolveCacheStats {\n\t\t\tconst total: SolveCacheStats = {\n\t\t\t\twarmClients: cache.size,\n\t\t\t\tentries: 0,\n\t\t\t\tbytes: 0,\n\t\t\t\thits: 0,\n\t\t\t\tmisses: 0,\n\t\t\t\tevictions: 0\n\t\t\t};\n\t\t\tfor (const entry of cache.values()) {\n\t\t\t\tconst s = entry.scheduler.cacheStats();\n\t\t\t\ttotal.entries += s.entries;\n\t\t\t\ttotal.bytes += s.bytes;\n\t\t\t\ttotal.hits += s.hits;\n\t\t\t\ttotal.misses += s.misses;\n\t\t\t\ttotal.evictions += s.evictions;\n\t\t\t}\n\t\t\treturn total;\n\t\t},\n\n\t\tclearSolveCaches(): void {\n\t\t\tdebugLog(`[Compute/client-cache] cleared solve caches on ${cache.size} warm client(s)`);\n\t\t\tfor (const entry of cache.values()) entry.scheduler.clearCache();\n\t\t},\n\n\t\tdisposeAll(): void {\n\t\t\tdebugLog(`[Compute/client-cache] disposing all ${cache.size} warm client(s)`);\n\t\t\tfor (const entry of cache.values()) entry.scheduler.dispose();\n\t\t\tcache.clear();\n\t\t}\n\t};\n}\n","/**\n * In-process cache of `.gh` definition bytes, keyed by immutable **version id**.\n *\n * Turns an eager `storage.get(fileKey)` on every solve request into a lazy\n * `DefinitionRef.load()`: the scheduler calls `load()` only when an upload is\n * unavoidable (a pointer-known re-solve never touches storage or this cache).\n *\n * The key MUST be the version id, never a `fileKey` — a delete-latest-then-\n * reupload can reuse a `fileKey` for different content, which would silently\n * serve one version's bytes for another with no diagnostic. Callers pass\n * `version.id`, and the returned `DefinitionRef.key` is that same id, so the\n * scheduler's own result/pointer cache keys on the same immutable identity.\n *\n * Eviction is LRU by total byte budget, not entry count — definitions range\n * from tens of KB to hundreds of MB, so a count cap would either pin\n * gigabytes or evict uselessly. `COMPUTE_DEFINITION_CACHE_MB` sets the\n * budget (see `createDefinitionByteCache`). No TTL: version ids are\n * immutable, so a cached entry can never go stale. An entry larger than the\n * whole budget is served but never retained.\n */\n\n/**\n * Per-`getOrLoad` outcome, observable after the scheduler has (or hasn't)\n * called `load()` — lets the solve pipeline emit a `def_bytes` Server-Timing\n * verdict (`skipped` / `hit` / `miss`).\n */\nexport interface ByteRefOutcome {\n\tloaded: boolean;\n\tfromCache: boolean;\n}\n\n/** A definition reference shaped for `@selvajs/compute`'s `DefinitionRef`. */\nexport interface ByteCacheRef {\n\tkey: string;\n\tload: () => Promise<Uint8Array>;\n\toutcome: ByteRefOutcome;\n}\n\nexport interface ByteCacheStats {\n\thits: number;\n\tmisses: number;\n\tevictions: number;\n\tentries: number;\n\tbytes: number;\n}\n\nexport interface DefinitionByteCache {\n\tgetOrLoad(versionId: string, load: () => Promise<Uint8Array>): ByteCacheRef;\n\tstats(): ByteCacheStats;\n\tclear(): void;\n}\n\ninterface Entry {\n\tbytes: Uint8Array;\n}\n\n/**\n * @param maxBytes total retained-byte budget; `0` (or negative) disables caching\n *   entirely — every `load()` calls the loader and nothing is retained.\n */\nexport function createDefinitionByteCache(maxBytes: number): DefinitionByteCache {\n\tconst budget = Math.max(0, Math.floor(maxBytes));\n\t// Map iteration order is insertion order, so it doubles as LRU order:\n\t// re-inserting a key on access moves it to the most-recently-used end.\n\tconst cache = new Map<string, Entry>();\n\tlet retainedBytes = 0;\n\tconst stats = { hits: 0, misses: 0, evictions: 0 };\n\n\tfunction touch(key: string, entry: Entry): void {\n\t\tcache.delete(key);\n\t\tcache.set(key, entry);\n\t}\n\n\tfunction evictToFit(): void {\n\t\twhile (retainedBytes > budget && cache.size > 0) {\n\t\t\tconst oldestKey = cache.keys().next().value as string;\n\t\t\tconst oldest = cache.get(oldestKey)!;\n\t\t\tcache.delete(oldestKey);\n\t\t\tretainedBytes -= oldest.bytes.byteLength;\n\t\t\tstats.evictions += 1;\n\t\t}\n\t}\n\n\tfunction store(key: string, bytes: Uint8Array): void {\n\t\tif (budget === 0) return;\n\t\t// Caching an entry bigger than the budget would evict everything\n\t\t// (including itself) on the next evictToFit — serve it, cache nothing.\n\t\tif (bytes.byteLength > budget) return;\n\t\tconst existing = cache.get(key);\n\t\tif (existing) retainedBytes -= existing.bytes.byteLength;\n\t\tcache.set(key, { bytes });\n\t\tretainedBytes += bytes.byteLength;\n\t\tevictToFit();\n\t}\n\n\treturn {\n\t\tgetOrLoad(versionId, load) {\n\t\t\tconst outcome: ByteRefOutcome = { loaded: false, fromCache: false };\n\t\t\treturn {\n\t\t\t\tkey: versionId,\n\t\t\t\toutcome,\n\t\t\t\tload: async () => {\n\t\t\t\t\tconst hit = cache.get(versionId);\n\t\t\t\t\tif (hit) {\n\t\t\t\t\t\ttouch(versionId, hit);\n\t\t\t\t\t\tstats.hits += 1;\n\t\t\t\t\t\toutcome.loaded = true;\n\t\t\t\t\t\toutcome.fromCache = true;\n\t\t\t\t\t\treturn hit.bytes;\n\t\t\t\t\t}\n\t\t\t\t\tstats.misses += 1;\n\t\t\t\t\toutcome.loaded = true;\n\t\t\t\t\toutcome.fromCache = false;\n\t\t\t\t\tconst bytes = await load();\n\t\t\t\t\tstore(versionId, bytes);\n\t\t\t\t\treturn bytes;\n\t\t\t\t}\n\t\t\t};\n\t\t},\n\t\tstats() {\n\t\t\treturn {\n\t\t\t\thits: stats.hits,\n\t\t\t\tmisses: stats.misses,\n\t\t\t\tevictions: stats.evictions,\n\t\t\t\tentries: cache.size,\n\t\t\t\tbytes: retainedBytes\n\t\t\t};\n\t\t},\n\t\tclear() {\n\t\t\tcache.clear();\n\t\t\tretainedBytes = 0;\n\t\t}\n\t};\n}\n","/**\n * In-process single-flight — dogpile protection for every solve.\n *\n * Always on, not gated behind a result cache being configured: the dogpile is worst\n * when nothing else is caching, since N concurrent identical solves each pay a full\n * Rhino round trip (the scheduler doesn't coalesce in-flight requests itself, and\n * Rhino's `cachesolve` still costs a round trip per repeat). An earlier version\n * gated this on cache config and so disabled it in exactly the deployments most\n * exposed to a cold-key stampede — hot public definition plus a deploy.\n *\n * Per app instance, above `ISolveResultCache`. No cross-instance lease (Redis\n * `SET NX`) yet.\n *\n * The shared promise resolves to one value for every waiter, so `work` must return\n * something safe to share by reference — the solve pipeline's envelope qualifies\n * because the app serializes it per response.\n */\n\nexport interface SolveCacheSingleFlight {\n\t/**\n\t * Coalesces concurrent calls under the same key: the first caller runs `work`,\n\t * later callers for that key await the same promise, and the key frees as soon\n\t * as it settles.\n\t *\n\t * `onWaiterJoined` fires only on the owner's call, only while `work` is still\n\t * running, each time another caller joins. Ownership changes what the owner's\n\t * abort signal should mean: a solo run can cancel on its own client's\n\t * disconnect, but a shared run can't without 499-ing every waiter.\n\t */\n\trun<T>(key: string, work: () => Promise<T>, onWaiterJoined?: () => void): Promise<T>;\n\tinFlight(): number;\n}\n\nexport interface SolveCacheSingleFlightOptions {\n\tonJoin?: (key: string) => void;\n}\n\nexport function createSolveCacheSingleFlight(\n\toptions: SolveCacheSingleFlightOptions = {}\n): SolveCacheSingleFlight {\n\tinterface Flight {\n\t\tpromise: Promise<unknown>;\n\t\tnotifyOwner?: () => void;\n\t}\n\tconst inflight = new Map<string, Flight>();\n\n\treturn {\n\t\trun<T>(key: string, work: () => Promise<T>, onWaiterJoined?: () => void): Promise<T> {\n\t\t\tconst existing = inflight.get(key);\n\t\t\tif (existing) {\n\t\t\t\toptions.onJoin?.(key);\n\t\t\t\texisting.notifyOwner?.();\n\t\t\t\treturn existing.promise as Promise<T>;\n\t\t\t}\n\n\t\t\t// Wrapping in an async IIFE means a synchronous throw in `work` still\n\t\t\t// rejects `p` instead of escaping `run` directly.\n\t\t\tconst flight: Flight = { notifyOwner: onWaiterJoined, promise: undefined! };\n\t\t\tconst p = (async () => work())().finally(() => {\n\t\t\t\t// Clear it here so a join after `work` settles can't fire it late.\n\t\t\t\tflight.notifyOwner = undefined;\n\t\t\t\t// Guard against deleting a key a later caller has already re-taken.\n\t\t\t\tif (inflight.get(key) === flight) inflight.delete(key);\n\t\t\t});\n\t\t\tflight.promise = p;\n\t\t\tinflight.set(key, flight);\n\t\t\treturn p;\n\t\t},\n\t\tinFlight(): number {\n\t\t\treturn inflight.size;\n\t\t}\n\t};\n}\n","/**\n * Facade over the warm-client cache, definition-byte cache, single-flight\n * coalescing, and the solve pipeline — the primitives an app route would\n * otherwise wire up by hand.\n *\n * Doesn't read env itself: `@selvajs/server` owns `resolveComputeLimits` and\n * depends on `@selvajs/solve`, so calling it from here would be a circular\n * import. Callers resolve their own limits and pass in the fields below.\n *\n * Stays out of auth, DB reads, share tokens, rate limiting, metrics, and\n * compute-server selection — all app policy, supplied per-call via\n * `SolveEngineSolveArgs.server`.\n */\n\nimport {\n\tisDefinitionRef,\n\tstableStringify,\n\ttype DefinitionRef,\n\ttype SolveDefinition\n} from '@selvajs/compute/grasshopper';\nimport { NoopLogger, type ILogger } from '@selvajs/platform';\nimport {\n\tcreateClientCache,\n\ttype CachedClient,\n\ttype ClientCache,\n\ttype ClientCacheDebug,\n\ttype ResolvedServer,\n\ttype SolveCacheStats\n} from './client-cache.js';\nimport {\n\tcreateDefinitionByteCache,\n\ttype ByteCacheRef,\n\ttype ByteCacheStats,\n\ttype DefinitionByteCache\n} from './definition-byte-cache.js';\nimport {\n\tcreateSolveCacheSingleFlight,\n\ttype SolveCacheSingleFlight\n} from './solve-cache-single-flight.js';\nimport {\n\tadaptEnvelopeToEncoding,\n\tbuildSolveInputTree,\n\trunSolvePipeline,\n\ttype PipelineInput,\n\ttype SolveOutcome\n} from './solve-pipeline.js';\n\n/**\n * Subset of `ComputeLimits` (`@selvajs/server/compute`) the engine needs.\n * Pass the resolved object through as-is — extra fields are ignored.\n */\nexport interface SolveEngineLimits {\n\tsolveDeadlineMs: number;\n\tcomputeResponseMaxBytes: number;\n\tcomputeReuseDefinitionCache: boolean;\n\tcomputeServerCachesolve: boolean;\n\tcomputeCacheErroredSolves: boolean;\n\tcomputeMaxQueueDepth: number;\n\tcomputeQueueWaitMs: number;\n\tcomputeDefinitionCacheBytes: number;\n\tcomputeSolveCacheBytes: number;\n}\n\nexport interface SolveEngineOptions {\n\tlimits: SolveEngineLimits;\n\tlogger?: ILogger;\n\t/** Max distinct warm compute servers before the LRU evicts the oldest. Default 16. */\n\tmaxWarmComputeServers?: number;\n\t/** Concise cache/timing logs when truthy; `'verbose'` also dumps full lib-level requests/responses. Default off. */\n\tdebug?: ClientCacheDebug;\n\tonDebugLog?: (message: string) => void;\n\t/** Fired when a caller joins an already-in-flight solve instead of running its own. */\n\tonSolveCoalesced?: (key: string) => void;\n}\n\n/**\n * Accepts every form `runSolvePipeline` does, plus `{versionId, load}` sugar\n * that builds (and caches) a `ByteCacheRef` internally. A `ByteCacheRef`\n * obtained ahead of time from `engine.definitionRef()` (e.g. to read bytes for\n * schema extraction before solving) is passed through as-is — detected by its\n * `outcome` field, which a plain `DefinitionRef` never has.\n */\nexport type SolveEngineDefinitionSource =\n\t| Uint8Array\n\t| string\n\t| DefinitionRef\n\t| ByteCacheRef\n\t| { versionId: string; load: () => Promise<Uint8Array> };\n\nexport interface SolveEngineSolveArgs {\n\tserver: ResolvedServer;\n\tdefinitionSource: SolveEngineDefinitionSource;\n\t/**\n\t * Coalesce-key identity for a raw `Uint8Array`/`string` source, which has\n\t * no natural identity the way a `DefinitionRef`'s `.key` does. Required in\n\t * that case — `solve()` throws rather than silently hashing the bytes.\n\t * Ignored for the other source forms.\n\t */\n\tdefinitionKey?: string;\n\tinputs: PipelineInput[];\n\tvalues: Record<string, unknown>;\n\tsignal: AbortSignal;\n\tacceptEncoding?: string;\n\t/** Stamped as `X-Selva-Definition` on this solve's client. */\n\tdefinitionGuid?: string;\n\tloadStartMs?: number;\n\tdefLoadMs?: number;\n\tprepMarks?: [string, number][];\n}\n\nexport interface FrameworkAgnosticResponse {\n\tstatus: number;\n\theaders: Record<string, string>;\n\tbody: string | Uint8Array;\n}\n\nexport interface SolveEngineStats {\n\tclient: SolveCacheStats;\n\tdefinitionBytes: ByteCacheStats;\n\tcoalescing: { inFlight: number };\n}\n\nfunction isByteCacheRef(source: SolveEngineDefinitionSource): source is ByteCacheRef {\n\treturn (\n\t\ttypeof source === 'object' &&\n\t\tsource !== null &&\n\t\t!(source instanceof Uint8Array) &&\n\t\t'outcome' in source\n\t);\n}\n\nfunction isVersionLoadPair(\n\tsource: SolveEngineDefinitionSource\n): source is { versionId: string; load: () => Promise<Uint8Array> } {\n\treturn (\n\t\ttypeof source === 'object' &&\n\t\tsource !== null &&\n\t\t!(source instanceof Uint8Array) &&\n\t\t!('outcome' in source) &&\n\t\t!('key' in source) &&\n\t\t'versionId' in source\n\t);\n}\n\nexport class SolveEngine {\n\tprivate readonly limits: SolveEngineLimits;\n\tprivate readonly clientCache: ClientCache;\n\tprivate readonly byteCache: DefinitionByteCache;\n\tprivate readonly singleFlight: SolveCacheSingleFlight;\n\n\tconstructor(options: SolveEngineOptions) {\n\t\tthis.limits = options.limits;\n\t\tconst logger = options.logger ?? new NoopLogger();\n\n\t\tthis.clientCache = createClientCache({\n\t\t\tsolveDeadlineMs: this.limits.solveDeadlineMs,\n\t\t\tcachesolve: this.limits.computeServerCachesolve,\n\t\t\tcacheerroredsolves: this.limits.computeCacheErroredSolves,\n\t\t\treuseServerDefinitionCache: this.limits.computeReuseDefinitionCache,\n\t\t\tmaxQueueDepth: this.limits.computeMaxQueueDepth,\n\t\t\tqueueWaitMs: this.limits.computeQueueWaitMs,\n\t\t\tresponseCacheMaxBytes: this.limits.computeSolveCacheBytes,\n\t\t\tdebug: options.debug ?? false,\n\t\t\tmaxWarmComputeServers: options.maxWarmComputeServers,\n\t\t\tonDebugLog:\n\t\t\t\toptions.onDebugLog ??\n\t\t\t\t((message) => logger.debug(message, { component: 'Compute/client-cache' }))\n\t\t});\n\n\t\tthis.byteCache = createDefinitionByteCache(this.limits.computeDefinitionCacheBytes);\n\n\t\tthis.singleFlight = createSolveCacheSingleFlight({\n\t\t\tonJoin: options.onSolveCoalesced\n\t\t});\n\t}\n\n\tgetClient(server: ResolvedServer, opts?: { definitionGuid?: string }): Promise<CachedClient> {\n\t\treturn this.clientCache.getClient(server, opts);\n\t}\n\n\tdefinitionRef(versionId: string, load: () => Promise<Uint8Array>): ByteCacheRef {\n\t\treturn this.byteCache.getOrLoad(versionId, load);\n\t}\n\n\tevictServer(id: string): void {\n\t\tthis.clientCache.evict(id);\n\t}\n\n\tclearSolveCaches(): void {\n\t\tthis.clientCache.clearSolveCaches();\n\t}\n\n\tstats(): SolveEngineStats {\n\t\treturn {\n\t\t\tclient: this.clientCache.solveCacheStats(),\n\t\t\tdefinitionBytes: this.byteCache.stats(),\n\t\t\tcoalescing: { inFlight: this.singleFlight.inFlight() }\n\t\t};\n\t}\n\n\tasync solve(args: SolveEngineSolveArgs): Promise<SolveOutcome> {\n\t\tconst {\n\t\t\tdefinitionSource: resolvedSource,\n\t\t\tbyteRefOutcome,\n\t\t\tidentity\n\t\t} = this.resolveDefinitionSource(args);\n\n\t\tconst client = await this.clientCache.getClient(args.server, {\n\t\t\tdefinitionGuid: args.definitionGuid\n\t\t});\n\t\tconst inputTree = buildSolveInputTree(args.inputs, args.values);\n\t\tconst coalesceKey = `${identity}:${args.server.id}:${stableStringify(inputTree)}`;\n\n\t\t// A coalesced solve is shared, so one caller's disconnect can't 499 every\n\t\t// other waiter. Only propagate abort if no one else has joined yet.\n\t\tconst abortController = new AbortController();\n\t\tlet hasWaiters = false;\n\t\tconst onCallerAbort = () => {\n\t\t\tif (!hasWaiters) abortController.abort();\n\t\t};\n\t\t// `once: true` doesn't detach on a normal completion, and the caller's signal\n\t\t// outlives this call — a request signal fires `abort` after the response is\n\t\t// consumed, and a session-scoped one never settles at all. Without the\n\t\t// `finally` below, every solve leaks a listener onto it.\n\t\targs.signal.addEventListener('abort', onCallerAbort, { once: true });\n\n\t\tconst acceptEncoding = args.acceptEncoding ?? '';\n\t\tlet outcome: SolveOutcome;\n\t\ttry {\n\t\t\toutcome = await this.singleFlight.run(\n\t\t\t\tcoalesceKey,\n\t\t\t\t() =>\n\t\t\t\t\trunSolvePipeline({\n\t\t\t\t\t\tdefinitionSource: resolvedSource,\n\t\t\t\t\t\tbyteRefOutcome,\n\t\t\t\t\t\tinputs: args.inputs,\n\t\t\t\t\t\tvalues: args.values,\n\t\t\t\t\t\tinputTree,\n\t\t\t\t\t\tclient,\n\t\t\t\t\t\tresponseMaxBytes: this.limits.computeResponseMaxBytes,\n\t\t\t\t\t\tsolveDeadlineMs: this.limits.solveDeadlineMs,\n\t\t\t\t\t\tacceptEncoding,\n\t\t\t\t\t\tsignal: abortController.signal,\n\t\t\t\t\t\tloadStartMs: args.loadStartMs ?? performance.now(),\n\t\t\t\t\t\tdefLoadMs: args.defLoadMs ?? 0,\n\t\t\t\t\t\tprepMarks: args.prepMarks\n\t\t\t\t\t}),\n\t\t\t\t() => {\n\t\t\t\t\thasWaiters = true;\n\t\t\t\t}\n\t\t\t);\n\t\t} finally {\n\t\t\targs.signal.removeEventListener('abort', onCallerAbort);\n\t\t}\n\n\t\tif (outcome.kind !== 'ok') return outcome;\n\n\t\t// The envelope may be shared across waiters; re-key it to this caller's\n\t\t// own Accept-Encoding so each one gets the right wire form.\n\t\tconst wire = adaptEnvelopeToEncoding(outcome.envelope, acceptEncoding);\n\t\treturn {\n\t\t\t...outcome,\n\t\t\tenvelope: { ...outcome.envelope, body: wire.body, headers: wire.headers }\n\t\t};\n\t}\n\n\ttoResponse(\n\t\toutcome: SolveOutcome,\n\t\topts?: { onError?: (status: number, body: { message: string; retryAfter?: number }) => never }\n\t): FrameworkAgnosticResponse {\n\t\tconst fail = (\n\t\t\tstatus: number,\n\t\t\tbody: { message: string; retryAfter?: number }\n\t\t): FrameworkAgnosticResponse => {\n\t\t\tif (opts?.onError) opts.onError(status, body);\n\t\t\tconst headers: Record<string, string> = { 'Content-Type': 'application/json' };\n\t\t\tif (body.retryAfter !== undefined) headers['Retry-After'] = String(body.retryAfter);\n\t\t\treturn { status, headers, body: JSON.stringify(body) };\n\t\t};\n\n\t\tswitch (outcome.kind) {\n\t\t\tcase 'ok':\n\t\t\t\treturn { status: 200, headers: outcome.envelope.headers, body: outcome.envelope.body };\n\t\t\tcase 'timeout':\n\t\t\t\treturn fail(504, { message: outcome.message });\n\t\t\tcase 'client_abort':\n\t\t\t\treturn fail(499, { message: 'Client closed request' });\n\t\t\tcase 'too_large':\n\t\t\t\treturn fail(413, {\n\t\t\t\t\tmessage:\n\t\t\t\t\t\t'Solve result is too large to return. This usually means a file output exceeds the supported size.'\n\t\t\t\t});\n\t\t\tcase 'shed':\n\t\t\t\treturn fail(503, { message: outcome.message, retryAfter: outcome.retryAfterSeconds });\n\t\t\tcase 'compute_error':\n\t\t\t\tthrow outcome.error;\n\t\t}\n\t}\n\n\ttoWebResponse(outcome: SolveOutcome): Response {\n\t\tconst r = this.toResponse(outcome);\n\t\treturn new Response(typeof r.body === 'string' ? r.body : new Uint8Array(r.body), {\n\t\t\tstatus: r.status,\n\t\t\theaders: r.headers\n\t\t});\n\t}\n\n\tprivate resolveDefinitionSource(args: SolveEngineSolveArgs): {\n\t\tdefinitionSource: SolveDefinition;\n\t\tbyteRefOutcome?: ByteCacheRef['outcome'];\n\t\tidentity: string;\n\t} {\n\t\tconst source = args.definitionSource;\n\n\t\tif (isVersionLoadPair(source)) {\n\t\t\tconst ref = this.byteCache.getOrLoad(source.versionId, source.load);\n\t\t\treturn { definitionSource: ref, byteRefOutcome: ref.outcome, identity: ref.key };\n\t\t}\n\n\t\tif (isByteCacheRef(source)) {\n\t\t\treturn { definitionSource: source, byteRefOutcome: source.outcome, identity: source.key };\n\t\t}\n\n\t\tif (isDefinitionRef(source)) {\n\t\t\treturn { definitionSource: source, identity: source.key };\n\t\t}\n\n\t\t// Raw Uint8Array | string — no natural identity; require the caller's own.\n\t\tif (!args.definitionKey) {\n\t\t\tthrow new Error(\n\t\t\t\t'SolveEngine.solve(): definitionKey is required when definitionSource is raw bytes or a string.'\n\t\t\t);\n\t\t}\n\t\treturn { definitionSource: source, identity: args.definitionKey };\n\t}\n}\n"],"mappings":"sYAOA,SAAgB,EACf,EACA,EACa,CACb,IAAM,EAAwB,CAC7B,GAAI,EAAM,GACV,KAAM,EAAM,SACZ,SAAU,EAAM,UAAY,KAC5B,YAAa,EAAM,aAAe,GAIlC,UAAW,EAAM,YAAc,mBAAqB,YAAc,EAAM,UACxE,WAAY,EAAM,iBAAmB,OACrC,QAAS,EAAM,SAAW,KAC1B,QAAS,EAAM,SAAW,KAC1B,QAAS,EACT,OAAQ,EACR,SAAU,EAAM,SAChB,QAAS,GAAS,EAAM,OACzB,EAEM,EAAY,EAAa,CAAG,EAM5B,EAAY,GAAS,EAAM,QAUjC,OATI,EAAU,SAAW,MAAQ,GAAa,OACzC,MAAM,QAAQ,CAAS,GAEhB,EAAU,YAAc,aAAe,OAAO,GAAc,YADtE,EAAoC,QAAU,GAOzC,CACR,CCvBA,MAAM,EAAY,EAAU,CAAI,EAOnB,EAA2B,EAC3B,EAAyB,0BA6GtC,SAAgB,EACf,EACA,EACa,CACb,OAAO,EAAY,gBAClB,EACE,OAAQ,GAAU,EAAM,SAAS,CAAC,CAClC,IAAK,GAAsB,EAAwB,EAAO,EAAO,EAAM,GAAG,CAAC,CAC9E,CACD,CAEA,eAAsB,EAAiB,EAAgD,CACtF,GAAM,CAAE,SAAQ,UAAW,EAErB,EAAiB,YAAY,IAAI,EACjC,EAAY,EAAK,WAAa,EAAoB,EAAK,OAAQ,EAAK,MAAM,EAC1E,EAAc,YAAY,IAAI,EAAI,EASlC,EAAkB,EAAO,UAAU,IACnC,EAAiB,EAAO,YAAY,IAEtC,EACE,EAAa,YAAY,IAAI,EACnC,GAAI,CACH,EAAS,MAAM,EAAO,UAAU,MAAM,EAAK,iBAAkB,EAAW,CAAE,QAAO,CAAC,CACnF,OAAS,EAAK,CACb,IAAM,EAAa,YAAY,IAAI,EAAI,EAIvC,GADgB,aAAe,OAAS,EAAI,OAAS,aAGpD,OADI,EAAO,QAAgB,CAAE,KAAM,eAAgB,YAAW,EACvD,CACN,KAAM,UACN,aACA,QAAS,sBAAsB,KAAK,MAAM,EAAK,gBAAkB,GAAI,EAAE,YACxE,EAID,GAAI,aAAe,EAAc,CAChC,GAAI,EAAI,OAAS,EAAW,WAC3B,MAAO,CACN,KAAM,OACN,aACA,OAAQ,aACR,kBAAmB,EACnB,QAAS,+CACV,EAED,GAAI,EAAI,OAAS,EAAW,cAC3B,MAAO,CACN,KAAM,OACN,aACA,OAAQ,gBACR,kBAAmB,EACnB,QAAS,8DACV,CAEF,CACA,MAAO,CAAE,KAAM,gBAAiB,aAAY,MAAO,CAAI,CACxD,CACA,IAAM,EAAU,YAAY,IAAI,EAAI,EAE9B,EAAiB,YAAY,IAAI,EACnC,EACJ,GAAI,CACH,EAAa,KAAK,UAAU,CAAM,CACnC,OAAS,EAAK,CAGb,GAAI,aAAe,WAAY,MAAO,CAAE,KAAM,WAAY,EAC1D,MAAM,CACP,CACA,GAAI,EAAW,OAAS,EAAK,iBAAkB,MAAO,CAAE,KAAM,WAAY,EAC1E,IAAM,EAAc,YAAY,IAAI,EAAI,EAMlC,EADkB,YAAY,KAAK,EAAK,cACP,GAAK,EAAW,OAAS,KAC5D,EAA4B,KAC5B,EAAS,EACb,GAAI,EAAkB,CACrB,IAAM,EAAY,YAAY,IAAI,EAClC,EAAa,MAAM,EAAU,OAAO,KAAK,CAAU,CAAC,EACpD,EAAS,YAAY,IAAI,EAAI,CAC9B,CAEA,IAAM,EAAgB,YAAY,IAAI,EAAI,EAAK,YAKzC,EAAS,EAAO,UAAU,MAAQ,EAAkB,EAAI,EAAO,UAAU,KAAO,KAChF,EACL,GAAU,CAAC,EAAO,WAAa,EAAO,YAAY,MAAQ,EAAiB,EACxE,EAAO,YAAY,KACnB,KAeE,EAAkC,CACvC,eAAgB,mBAChB,gBAfoB,EAAkB,CACtC,UAAW,EAAK,UAChB,cACA,UACA,cACA,SACA,gBACA,QACA,SACA,eAAgB,EAAK,eACrB,UAAW,EAAK,WAAa,CAAC,CAC/B,CAI6B,GAC3B,GAAyB,IAC1B,KAAM,iBACP,EAEM,EAA6B,CAClC,cACA,UACA,cACA,SACA,gBACA,gBAAiB,EAAW,OAC5B,gBAAiB,GAAY,YAAc,IAC5C,EAEI,EAkBJ,OAjBI,GAGH,EAAQ,oBAAsB,OAC9B,EAAQ,kBAAoB,OAAO,EAAW,UAAU,EACxD,EAAW,CACV,KAAM,IAAI,WAAW,CAAU,EAC/B,SAAU,OACV,UACA,SACA,SACD,IAEA,EAAQ,kBAAoB,OAAO,OAAO,WAAW,CAAU,CAAC,EAChE,EAAW,CAAE,KAAM,EAAY,UAAS,SAAQ,SAAQ,GAGlD,CACN,KAAM,KACN,WACA,UACA,WAAY,EAAO,QAAQ,QAAU,EACrC,aAAc,EAAO,UAAU,QAAU,CAC1C,CACD,CAqBA,SAAgB,EACf,EACA,EACiE,CACjE,IAAM,EAAkB,YAAY,KAAK,CAAc,EAIvD,GAAI,EAAS,WAAa,QAAU,CAAC,EAAiB,CACrD,IAAM,EAAO,EACZ,EAAS,gBAAgB,WAAa,EAAS,KAAO,OAAO,KAAK,EAAS,IAAI,CAChF,CAAC,CAAC,SAAS,MAAM,EACX,EAAU,CAAE,GAAG,EAAS,OAAQ,EAGtC,OAFA,OAAO,EAAQ,oBACf,EAAQ,kBAAoB,OAAO,OAAO,WAAW,CAAI,CAAC,EACnD,CAAE,KAAM,EAAM,SAAQ,CAC9B,CAEA,MAAO,CAAE,KAAM,EAAS,KAAM,QAAS,EAAS,OAAQ,CACzD,CAyBA,SAAS,EAAkB,EAAkC,CAC5D,IAAI,EACH,YAAY,EAAM,UAAU,QAAQ,CAAC,EAAE,aAC3B,EAAM,YAAY,QAAQ,CAAC,EAAE,cAC5B,EAAM,QAAQ,QAAQ,CAAC,EAAE,kBACrB,EAAM,YAAY,QAAQ,CAAC,EAAE,aAClC,EAAM,OAAO,QAAQ,CAAC,EAAE,cACvB,EAAM,cAAc,QAAQ,CAAC,IAErC,EAAQ,EAAM,MACpB,GAAI,EAAO,CACV,IAAM,EAAY,EAAM,OAAS,EAAM,MAAQ,EAAM,OAC/C,EAAgB,KAAK,IAAI,EAAG,EAAM,QAAU,CAAS,EAC3D,GACC,sBAAsB,EAAM,OAAO,QAAQ,CAAC,EAAA,oBACvB,EAAM,MAAM,QAAQ,CAAC,EAAA,qBACpB,EAAM,OAAO,QAAQ,CAAC,EAAA,qBACtB,EAAc,QAAQ,CAAC,GAC/C,CAEA,IAAK,GAAM,CAAC,EAAO,KAAO,EAAM,UAC/B,GAAU,OAAO,EAAM,OAAO,EAAG,QAAQ,CAAC,IAG3C,IAAM,EAAS,EAAM,OACjB,IACH,GAAU,qBAAqB,KAAO,YAClC,EAAO,uBAAyB,IAAA,KACnC,GAAU,sBAAsB,KAAO,yBAOzC,IAAM,EAAU,EAAM,eACtB,GAAI,EAAS,CACZ,IAAM,EAAW,EAAQ,OAAqB,EAAQ,UAAY,MAAQ,OAAxC,UAClC,GAAU,oBAAoB,GAC/B,CAEA,OAAO,CACR,CCnXA,SAAgB,EAAe,EAAoD,CAClF,OAAO,EAAO,EACf,CAsHA,SAAgB,EAAkB,EAAwC,CACzE,IAAM,EAAwB,EAAO,uBAAyB,GACxD,EAAQ,IAAI,IAIZ,EAAU,IAAI,IAEhB,EAAO,QAAU,WAAW,EAAmB,EAEnD,IAAM,EAAY,GAAoB,CACjC,EAAO,OAAO,EAAO,aAAa,CAAO,CAC9C,EAEA,eAAe,EAAM,EAAwB,EAAgD,CAC5F,IAAM,EAA2C,CAAE,KAAM,KAAM,IAAK,CAAE,EAChE,EAAuC,CAAE,KAAM,KAAM,IAAK,CAAE,EAC5D,EAAe,EAAO,QAAU,UAEhC,EAAyC,CAC9C,UAAW,EAAO,UAClB,OAAQ,EAAO,OAGf,MAAO,EACP,WAAY,EAAO,WACnB,mBAAoB,EAAO,mBAC3B,eAAiB,GAAM,CACtB,IAAM,EAAS,EAAE,QAAU,EACrB,EAAQ,EAAE,OAAS,EACnB,EAAS,EAAE,QAAU,EAG3B,GAFA,EAAY,KAAO,EACnB,EAAY,KAAO,CAAE,SAAQ,QAAO,QAAO,EACvC,CAAC,EAAO,MAAO,OAGnB,IAAM,EACL,GAAU,EAAI,8CAAgD,oBACzD,EACL,EAAO,YAAc,GAAS,EAC3B,qCACA,EAAO,WACN,sBACA,MACL,EACC,gCAAgC,EAAO,WAAW,EAAM,YAAY,EAAO,yBACnD,EAAS,+BAA+B,GACjE,CACD,CACD,EAII,IACH,EAAa,QAAU,CAAE,qBAAsB,CAAe,GAG/D,IAAM,EAAS,MAAM,EAAkB,OAAO,CAAY,EAWtD,EAAgB,EAChB,EAAc,EACd,EAAU,GAYd,eAAe,EAAmB,EAAmD,CAChF,MACJ,GAAU,GACV,GAAI,CACH,IAAM,EAAW,MAAM,QAAQ,QAC9B,EAAO,aAAa,kBAAkB,CAAE,WAAY,EAAM,CAAC,CAC5D,CAAC,CAAC,UAAY,IAAI,EAClB,EAAc,KAAK,IAAI,EACvB,IAAM,EAAO,CAAC,GAAY,GAAY,EAAI,EAAuB,EACjE,GAAI,IAAS,EAAe,OAC5B,EACC,sCAAsC,EAAc,KAAK,EAAK,sBAC/D,EACA,EAAgB,EAChB,GAAW,iBAAiB,CAAI,CACjC,QAAU,CACT,EAAU,EACX,CAfU,CAgBX,CAGA,MAAM,EAAmB,EAEzB,IAAM,EAAY,EAAO,gBAAgB,CACxC,KAAM,QAIN,gBAIA,cAAe,EAAO,eAAiB,IAAA,GACvC,YAAa,EAAO,aAAe,IAAA,GACnC,UAAW,EAAO,gBAKlB,MAAO,EAAO,sBAAwB,GAAI,CAAE,SAAU,EAAO,qBAAsB,EACnF,2BAA4B,EAAO,2BACnC,UAAW,EAAM,IAAW,CAC3B,KAAU,KAAO,EACb,EAAO,SAAW,YAMrB,EAAO,YAAc,IACrB,KAAK,IAAI,EAAI,GAAe,KAI5B,EAAwB,CAAS,EAElC,EAAU,KAAO,CAChB,UAAW,EAAO,YAAc,GAChC,qBAAsB,EAAO,oBAC9B,EACK,EAAO,QACZ,EACC,yBAAyB,EAAO,UAAY,6CAA+C,+BAA+B,IAAI,KAAK,MAAM,EAAO,UAAU,EAAE,IAC7J,EACK,EAAO,WACX,EACC,EAAO,uBAAyB,GAC7B,6EACA,EAAO,uBAAyB,GAC/B,6EACA,qEACL,EAEG,CAAC,EAAO,YAAW,CACtB,IAAM,EAAQ,EAAO,UAAqC,OACpD,EAAW,MAAM,QAAQ,CAAI,EAAI,EAAK,OAAS,EACrD,GAAI,EAAW,EAAG,CACjB,IAAM,EAAY,EAAO,mBACtB,iCACA,2DACH,EACC,yBAAyB,EAAS,gBAAgB,EAAU,WAAW,KAAK,UAAW,EAAmB,EAAE,GAC7G,CACD,CACD,CACD,CACD,CAAC,EACD,MAAO,CAAE,SAAQ,YAAW,cAAa,WAAU,CACpD,CAEA,MAAO,CACN,MAAM,UAAU,EAAQ,EAA6B,CACpD,IAAM,EAAM,EAAO,GACb,EAAW,EAAM,IAAI,CAAG,EAC9B,GAAI,EAIH,OAFA,EAAM,OAAO,CAAG,EAChB,EAAM,IAAI,EAAK,CAAQ,EAChB,EAGR,IAAM,EAAW,EAAQ,IAAI,CAAG,EAChC,GAAI,EAAU,OAAO,EAIrB,EAAS,iEAAiE,GAAK,EAC/E,IAAM,GAAgB,SAAY,CACjC,IAAM,EAAQ,MAAM,EAAM,EAAQ,GAAM,cAAc,EAEtD,GAAI,EAAM,MAAQ,EAAuB,CACxC,IAAM,EAAY,EAAM,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,MAClC,IAAc,IAAA,KACjB,EACC,6DAA6D,EAAU,QAAQ,EAAsB,EACtG,EACA,EAAM,IAAI,CAAS,CAAC,EAAE,UAAU,QAAQ,EACxC,EAAM,OAAO,CAAS,EAExB,CAGA,OADA,EAAM,IAAI,EAAK,CAAK,EACb,CACR,EAAA,CAAG,CAAC,CAAC,YAAc,EAAQ,OAAO,CAAG,CAAC,EAEtC,OADA,EAAQ,IAAI,EAAK,CAAY,EACtB,CACR,EAEA,MAAM,EAAU,CACf,IAAM,EAAM,EACN,EAAQ,EAAM,IAAI,CAAG,EACvB,IACH,EAAS,yDAAyD,EAAI,iBAAiB,EACvF,EAAM,UAAU,QAAQ,EACxB,EAAM,OAAO,CAAG,EAElB,EAEA,iBAAmC,CAClC,IAAM,EAAyB,CAC9B,YAAa,EAAM,KACnB,QAAS,EACT,MAAO,EACP,KAAM,EACN,OAAQ,EACR,UAAW,CACZ,EACA,IAAK,IAAM,KAAS,EAAM,OAAO,EAAG,CACnC,IAAM,EAAI,EAAM,UAAU,WAAW,EACrC,EAAM,SAAW,EAAE,QACnB,EAAM,OAAS,EAAE,MACjB,EAAM,MAAQ,EAAE,KAChB,EAAM,QAAU,EAAE,OAClB,EAAM,WAAa,EAAE,SACtB,CACA,OAAO,CACR,EAEA,kBAAyB,CACxB,EAAS,kDAAkD,EAAM,KAAK,gBAAgB,EACtF,IAAK,IAAM,KAAS,EAAM,OAAO,EAAG,EAAM,UAAU,WAAW,CAChE,EAEA,YAAmB,CAClB,EAAS,wCAAwC,EAAM,KAAK,gBAAgB,EAC5E,IAAK,IAAM,KAAS,EAAM,OAAO,EAAG,EAAM,UAAU,QAAQ,EAC5D,EAAM,MAAM,CACb,CACD,CACD,CC9VA,SAAgB,EAA0B,EAAuC,CAChF,IAAM,EAAS,KAAK,IAAI,EAAG,KAAK,MAAM,CAAQ,CAAC,EAGzC,EAAQ,IAAI,IACd,EAAgB,EACd,EAAQ,CAAE,KAAM,EAAG,OAAQ,EAAG,UAAW,CAAE,EAEjD,SAAS,EAAM,EAAa,EAAoB,CAC/C,EAAM,OAAO,CAAG,EAChB,EAAM,IAAI,EAAK,CAAK,CACrB,CAEA,SAAS,GAAmB,CAC3B,KAAO,EAAgB,GAAU,EAAM,KAAO,GAAG,CAChD,IAAM,EAAY,EAAM,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,MAChC,EAAS,EAAM,IAAI,CAAS,EAClC,EAAM,OAAO,CAAS,EACtB,GAAiB,EAAO,MAAM,WAC9B,EAAM,WAAa,CACpB,CACD,CAEA,SAAS,EAAM,EAAa,EAAyB,CAIpD,GAHI,IAAW,GAGX,EAAM,WAAa,EAAQ,OAC/B,IAAM,EAAW,EAAM,IAAI,CAAG,EAC1B,IAAU,GAAiB,EAAS,MAAM,YAC9C,EAAM,IAAI,EAAK,CAAE,OAAM,CAAC,EACxB,GAAiB,EAAM,WACvB,EAAW,CACZ,CAEA,MAAO,CACN,UAAU,EAAW,EAAM,CAC1B,IAAM,EAA0B,CAAE,OAAQ,GAAO,UAAW,EAAM,EAClE,MAAO,CACN,IAAK,EACL,UACA,KAAM,SAAY,CACjB,IAAM,EAAM,EAAM,IAAI,CAAS,EAC/B,GAAI,EAKH,OAJA,EAAM,EAAW,CAAG,EACpB,EAAM,MAAQ,EACd,EAAQ,OAAS,GACjB,EAAQ,UAAY,GACb,EAAI,MAEZ,EAAM,QAAU,EAChB,EAAQ,OAAS,GACjB,EAAQ,UAAY,GACpB,IAAM,EAAQ,MAAM,EAAK,EAEzB,OADA,EAAM,EAAW,CAAK,EACf,CACR,CACD,CACD,EACA,OAAQ,CACP,MAAO,CACN,KAAM,EAAM,KACZ,OAAQ,EAAM,OACd,UAAW,EAAM,UACjB,QAAS,EAAM,KACf,MAAO,CACR,CACD,EACA,OAAQ,CACP,EAAM,MAAM,EACZ,EAAgB,CACjB,CACD,CACD,CChGA,SAAgB,EACf,EAAyC,CAAC,EACjB,CAKzB,IAAM,EAAW,IAAI,IAErB,MAAO,CACN,IAAO,EAAa,EAAwB,EAAyC,CACpF,IAAM,EAAW,EAAS,IAAI,CAAG,EACjC,GAAI,EAGH,OAFA,EAAQ,SAAS,CAAG,EACpB,EAAS,cAAc,EAChB,EAAS,QAKjB,IAAM,EAAiB,CAAE,YAAa,EAAgB,QAAS,IAAA,EAAW,EACpE,GAAK,SAAY,EAAK,EAAA,CAAG,CAAC,CAAC,YAAc,CAE9C,EAAO,YAAc,IAAA,GAEjB,EAAS,IAAI,CAAG,IAAM,GAAQ,EAAS,OAAO,CAAG,CACtD,CAAC,EAGD,MAFA,GAAO,QAAU,EACjB,EAAS,IAAI,EAAK,CAAM,EACjB,CACR,EACA,UAAmB,CAClB,OAAO,EAAS,IACjB,CACD,CACD,CCkDA,SAAS,EAAe,EAA6D,CACpF,OACC,OAAO,GAAW,YAClB,GACA,EAAE,aAAkB,aACpB,YAAa,CAEf,CAEA,SAAS,EACR,EACmE,CACnE,OACC,OAAO,GAAW,YAClB,GACA,EAAE,aAAkB,aACpB,EAAE,YAAa,IACf,EAAE,QAAS,IACX,cAAe,CAEjB,CAEA,IAAa,EAAb,KAAyB,CACxB,OACA,YACA,UACA,aAEA,YAAY,EAA6B,CACxC,KAAK,OAAS,EAAQ,OACtB,IAAM,EAAS,EAAQ,QAAU,IAAI,EAErC,KAAK,YAAc,EAAkB,CACpC,gBAAiB,KAAK,OAAO,gBAC7B,WAAY,KAAK,OAAO,wBACxB,mBAAoB,KAAK,OAAO,0BAChC,2BAA4B,KAAK,OAAO,4BACxC,cAAe,KAAK,OAAO,qBAC3B,YAAa,KAAK,OAAO,mBACzB,sBAAuB,KAAK,OAAO,uBACnC,MAAO,EAAQ,OAAS,GACxB,sBAAuB,EAAQ,sBAC/B,WACC,EAAQ,aACN,GAAY,EAAO,MAAM,EAAS,CAAE,UAAW,sBAAuB,CAAC,EAC3E,CAAC,EAED,KAAK,UAAY,EAA0B,KAAK,OAAO,2BAA2B,EAElF,KAAK,aAAe,EAA6B,CAChD,OAAQ,EAAQ,gBACjB,CAAC,CACF,CAEA,UAAU,EAAwB,EAA2D,CAC5F,OAAO,KAAK,YAAY,UAAU,EAAQ,CAAI,CAC/C,CAEA,cAAc,EAAmB,EAA+C,CAC/E,OAAO,KAAK,UAAU,UAAU,EAAW,CAAI,CAChD,CAEA,YAAY,EAAkB,CAC7B,KAAK,YAAY,MAAM,CAAE,CAC1B,CAEA,kBAAyB,CACxB,KAAK,YAAY,iBAAiB,CACnC,CAEA,OAA0B,CACzB,MAAO,CACN,OAAQ,KAAK,YAAY,gBAAgB,EACzC,gBAAiB,KAAK,UAAU,MAAM,EACtC,WAAY,CAAE,SAAU,KAAK,aAAa,SAAS,CAAE,CACtD,CACD,CAEA,MAAM,MAAM,EAAmD,CAC9D,GAAM,CACL,iBAAkB,EAClB,iBACA,YACG,KAAK,wBAAwB,CAAI,EAE/B,EAAS,MAAM,KAAK,YAAY,UAAU,EAAK,OAAQ,CAC5D,eAAgB,EAAK,cACtB,CAAC,EACK,EAAY,EAAoB,EAAK,OAAQ,EAAK,MAAM,EACxD,EAAc,GAAG,EAAS,GAAG,EAAK,OAAO,GAAG,GAAG,EAAgB,CAAS,IAIxE,EAAkB,IAAI,gBACxB,EAAa,GACX,MAAsB,CACtB,GAAY,EAAgB,MAAM,CACxC,EAKA,EAAK,OAAO,iBAAiB,QAAS,EAAe,CAAE,KAAM,EAAK,CAAC,EAEnE,IAAM,EAAiB,EAAK,gBAAkB,GAC1C,EACJ,GAAI,CACH,EAAU,MAAM,KAAK,aAAa,IACjC,MAEC,EAAiB,CAChB,iBAAkB,EAClB,iBACA,OAAQ,EAAK,OACb,OAAQ,EAAK,OACb,YACA,SACA,iBAAkB,KAAK,OAAO,wBAC9B,gBAAiB,KAAK,OAAO,gBAC7B,iBACA,OAAQ,EAAgB,OACxB,YAAa,EAAK,aAAe,YAAY,IAAI,EACjD,UAAW,EAAK,WAAa,EAC7B,UAAW,EAAK,SACjB,CAAC,MACI,CACL,EAAa,EACd,CACD,CACD,QAAU,CACT,EAAK,OAAO,oBAAoB,QAAS,CAAa,CACvD,CAEA,GAAI,EAAQ,OAAS,KAAM,OAAO,EAIlC,IAAM,EAAO,EAAwB,EAAQ,SAAU,CAAc,EACrE,MAAO,CACN,GAAG,EACH,SAAU,CAAE,GAAG,EAAQ,SAAU,KAAM,EAAK,KAAM,QAAS,EAAK,OAAQ,CACzE,CACD,CAEA,WACC,EACA,EAC4B,CAC5B,IAAM,GACL,EACA,IAC+B,CAC3B,GAAM,SAAS,EAAK,QAAQ,EAAQ,CAAI,EAC5C,IAAM,EAAkC,CAAE,eAAgB,kBAAmB,EAE7E,OADI,EAAK,aAAe,IAAA,KAAW,EAAQ,eAAiB,OAAO,EAAK,UAAU,GAC3E,CAAE,SAAQ,UAAS,KAAM,KAAK,UAAU,CAAI,CAAE,CACtD,EAEA,OAAQ,EAAQ,KAAhB,CACC,IAAK,KACJ,MAAO,CAAE,OAAQ,IAAK,QAAS,EAAQ,SAAS,QAAS,KAAM,EAAQ,SAAS,IAAK,EACtF,IAAK,UACJ,OAAO,EAAK,IAAK,CAAE,QAAS,EAAQ,OAAQ,CAAC,EAC9C,IAAK,eACJ,OAAO,EAAK,IAAK,CAAE,QAAS,uBAAwB,CAAC,EACtD,IAAK,YACJ,OAAO,EAAK,IAAK,CAChB,QACC,mGACF,CAAC,EACF,IAAK,OACJ,OAAO,EAAK,IAAK,CAAE,QAAS,EAAQ,QAAS,WAAY,EAAQ,iBAAkB,CAAC,EACrF,IAAK,gBACJ,MAAM,EAAQ,KAChB,CACD,CAEA,cAAc,EAAiC,CAC9C,IAAM,EAAI,KAAK,WAAW,CAAO,EACjC,OAAO,IAAI,SAAS,OAAO,EAAE,MAAS,SAAW,EAAE,KAAO,IAAI,WAAW,EAAE,IAAI,EAAG,CACjF,OAAQ,EAAE,OACV,QAAS,EAAE,OACZ,CAAC,CACF,CAEA,wBAAgC,EAI9B,CACD,IAAM,EAAS,EAAK,iBAEpB,GAAI,EAAkB,CAAM,EAAG,CAC9B,IAAM,EAAM,KAAK,UAAU,UAAU,EAAO,UAAW,EAAO,IAAI,EAClE,MAAO,CAAE,iBAAkB,EAAK,eAAgB,EAAI,QAAS,SAAU,EAAI,GAAI,CAChF,CAEA,GAAI,EAAe,CAAM,EACxB,MAAO,CAAE,iBAAkB,EAAQ,eAAgB,EAAO,QAAS,SAAU,EAAO,GAAI,EAGzF,GAAIA,EAAgB,CAAM,EACzB,MAAO,CAAE,iBAAkB,EAAQ,SAAU,EAAO,GAAI,EAIzD,GAAI,CAAC,EAAK,cACT,MAAU,MACT,gGACD,EAED,MAAO,CAAE,iBAAkB,EAAQ,SAAU,EAAK,aAAc,CACjE,CACD"}

package/dist/shared.cjs

@@ -1 +0,0 @@
-"use strict";//# sourceMappingURL=shared.cjs.map

package/dist/shared.d.cts

@@ -1,3 +1,3 @@
-export { S as SolveFn, a as SolveResult } from './solve-fn-0hPOtZVD.cjs';
-export { S as SolveInput } from './solve-input-CqYtetTA.cjs';
-import '@selvajs/schemas';
+import { n as SolveResult, t as SolveFn } from "./solve-fn-lsWj61m5.cjs";
+import { t as SolveInput } from "./solve-input-BDv_JdvS.cjs";
+export type { SolveFn, SolveInput, SolveResult };

package/dist/shared.d.ts

@@ -1,3 +1,3 @@
-export { S as SolveFn, a as SolveResult } from './solve-fn-0hPOtZVD.js';
-export { S as SolveInput } from './solve-input-CqYtetTA.js';
-import '@selvajs/schemas';
+import { n as SolveResult, t as SolveFn } from "./solve-fn-lsWj61m5.js";
+import { t as SolveInput } from "./solve-input-BDv_JdvS.js";
+export type { SolveFn, SolveInput, SolveResult };

package/dist/shared.js

@@ -1 +1 @@
-//# sourceMappingURL=shared.js.map
+export{};

package/dist/solve-fn-lsWj61m5.d.cts

@@ -0,0 +1,48 @@
+//#region src/shared/solve-fn.d.ts
+/**
+ * The solve contract — what a solve returns and what a caller supplies to run one.
+ *
+ * Lives in `shared/` because both halves of the package speak it: `client/` calls a `SolveFn` and
+ * stores its `SolveResult`; `server/` produces the payload one is built from.
+ */
+/**
+ * `TMesh` is deliberately opaque and defaults to `unknown`: this package never inspects meshes, and
+ * typing them would drag a renderer dependency into a package whose whole point is not having one.
+ * The app that owns assembly (parse → `THREE.Object3D[]`) is the only place that knows the concrete
+ * type, and it narrows by writing `SolveResult<THREE.Object3D>` at its own seam.
+ */
+interface SolveResult<TMesh = unknown, TSource = unknown> {
+  outputs: Record<string, unknown>;
+  meshes?: TMesh[];
+  errors?: string[];
+  warnings?: string[];
+  /**
+   * The unparsed payload this result was built from, passed through verbatim. Opaque here for the
+   * same reason as `TMesh`: a consumer that must persist or re-submit exactly what it showed the
+   * user narrows it at its own seam. Travels with the result through the driver's memo, so a
+   * cached hit carries the source that produced it. Unlike `meshes` it needs no ownership policy —
+   * it is inert data, not a GPU-backed handle.
+   *
+   * Supplied by the `SolveFn`, so it is present only when the one in use sets it
+   * (`createComputeFetchSolveFn` does). A transport with no raw payload to hand back leaves it
+   * absent — see `values` on telling absent from unsupported.
+   */
+  source?: TSource;
+  /**
+   * The input set that produced this result, stamped by the driver rather than the `SolveFn` — a
+   * memo hit never calls the `SolveFn`, so a consumer reading values captured inside it would pair
+   * the on-screen result with whatever solved last. Keeping the pair atomic is the point: a commit
+   * path holding a `SolveResult` cannot mismatch artifact and inputs.
+   *
+   * Present only from a driver that owns a request/response pair (`createRequestResponseDriver`).
+   * A push driver cannot attribute an incoming frame to a request and must leave this absent
+   * rather than guess — so `undefined` means "this transport does not supply it", not "no solve
+   * yet", and a consumer that needs the pair requires a request/response driver. See `SolveDriver`.
+   */
+  values?: Record<string, unknown>;
+}
+/** Implementations should listen to `signal` and abort/clean up when it fires. */
+type SolveFn<TMesh = unknown, TSource = unknown> = (values: Record<string, unknown>, signal: AbortSignal) => Promise<SolveResult<TMesh, TSource>>;
+//#endregion
+export { SolveResult as n, SolveFn as t };
+//# sourceMappingURL=solve-fn-lsWj61m5.d.cts.map

package/dist/solve-fn-lsWj61m5.d.ts

@@ -0,0 +1,48 @@
+//#region src/shared/solve-fn.d.ts
+/**
+ * The solve contract — what a solve returns and what a caller supplies to run one.
+ *
+ * Lives in `shared/` because both halves of the package speak it: `client/` calls a `SolveFn` and
+ * stores its `SolveResult`; `server/` produces the payload one is built from.
+ */
+/**
+ * `TMesh` is deliberately opaque and defaults to `unknown`: this package never inspects meshes, and
+ * typing them would drag a renderer dependency into a package whose whole point is not having one.
+ * The app that owns assembly (parse → `THREE.Object3D[]`) is the only place that knows the concrete
+ * type, and it narrows by writing `SolveResult<THREE.Object3D>` at its own seam.
+ */
+interface SolveResult<TMesh = unknown, TSource = unknown> {
+  outputs: Record<string, unknown>;
+  meshes?: TMesh[];
+  errors?: string[];
+  warnings?: string[];
+  /**
+   * The unparsed payload this result was built from, passed through verbatim. Opaque here for the
+   * same reason as `TMesh`: a consumer that must persist or re-submit exactly what it showed the
+   * user narrows it at its own seam. Travels with the result through the driver's memo, so a
+   * cached hit carries the source that produced it. Unlike `meshes` it needs no ownership policy —
+   * it is inert data, not a GPU-backed handle.
+   *
+   * Supplied by the `SolveFn`, so it is present only when the one in use sets it
+   * (`createComputeFetchSolveFn` does). A transport with no raw payload to hand back leaves it
+   * absent — see `values` on telling absent from unsupported.
+   */
+  source?: TSource;
+  /**
+   * The input set that produced this result, stamped by the driver rather than the `SolveFn` — a
+   * memo hit never calls the `SolveFn`, so a consumer reading values captured inside it would pair
+   * the on-screen result with whatever solved last. Keeping the pair atomic is the point: a commit
+   * path holding a `SolveResult` cannot mismatch artifact and inputs.
+   *
+   * Present only from a driver that owns a request/response pair (`createRequestResponseDriver`).
+   * A push driver cannot attribute an incoming frame to a request and must leave this absent
+   * rather than guess — so `undefined` means "this transport does not supply it", not "no solve
+   * yet", and a consumer that needs the pair requires a request/response driver. See `SolveDriver`.
+   */
+  values?: Record<string, unknown>;
+}
+/** Implementations should listen to `signal` and abort/clean up when it fires. */
+type SolveFn<TMesh = unknown, TSource = unknown> = (values: Record<string, unknown>, signal: AbortSignal) => Promise<SolveResult<TMesh, TSource>>;
+//#endregion
+export { SolveResult as n, SolveFn as t };
+//# sourceMappingURL=solve-fn-lsWj61m5.d.ts.map

package/dist/{solve-input-CqYtetTA.d.ts → solve-input-BDv_JdvS.d.cts}

@@ -1,14 +1,15 @@
-import { SchemaInput } from '@selvajs/schemas';
-
+import { SchemaInput } from "@selvajs/schemas";
+//#region src/shared/solve-input.d.ts
 /**
  * A schema input carrying the optional numeric bounds the input transform reads. Bounds are optional
  * because they're only meaningful for numeric params (slider min/max/step) — text or geometry inputs
  * carry none.
  */
 type SolveInput = SchemaInput & {
-    minimum?: number;
-    maximum?: number;
-    stepSize?: number;
+  minimum?: number;
+  maximum?: number;
+  stepSize?: number;
 };
-
-export type { SolveInput as S };
+//#endregion
+export { SolveInput as t };
+//# sourceMappingURL=solve-input-BDv_JdvS.d.cts.map

package/dist/{solve-input-CqYtetTA.d.cts → solve-input-BDv_JdvS.d.ts}

@@ -1,14 +1,15 @@
-import { SchemaInput } from '@selvajs/schemas';
-
+import { SchemaInput } from "@selvajs/schemas";
+//#region src/shared/solve-input.d.ts
 /**
  * A schema input carrying the optional numeric bounds the input transform reads. Bounds are optional
  * because they're only meaningful for numeric params (slider min/max/step) — text or geometry inputs
  * carry none.
  */
 type SolveInput = SchemaInput & {
-    minimum?: number;
-    maximum?: number;
-    stepSize?: number;
+  minimum?: number;
+  maximum?: number;
+  stepSize?: number;
 };
-
-export type { SolveInput as S };
+//#endregion
+export { SolveInput as t };
+//# sourceMappingURL=solve-input-BDv_JdvS.d.ts.map