[{"_1":2,"_3":-5,"_4":-5},"loaderData",{"_5":6,"_7":8,"_9":10},"actionData","errors","root",{"_239":240,"_241":242},"routes/_app.x.$handle.$name",{"_96":95,"_33":46,"_105":86,"_28":106,"_13":14,"_107":-5,"_11":108,"_109":110,"_111":112,"_113":114,"_115":116,"_20":-5,"_117":-5,"_118":-5,"_119":27,"_120":121,"_122":27,"_123":-5,"_124":-5,"_125":126},"routes/_app.x.$handle.$name.branch.$branch.version.$version.diff",{"_11":12,"_13":14,"_15":16,"_17":-5,"_18":-5},"project",{"_44":45,"_33":46,"_39":47,"_48":-5,"_49":27,"_50":51,"_52":51,"_53":54,"_55":-5,"_18":56,"_57":-5,"_58":27,"_59":-5,"_60":-5,"_61":62,"_63":64,"_65":-5,"_66":-5,"_67":-5,"_68":-5,"_69":70,"_71":70,"_72":73,"_74":73,"_75":73,"_76":70,"_77":70,"_78":79,"_80":81,"_82":83,"_84":27},"version",22,"changes",[19],"aiChatInfo","userId",{"_20":21,"_22":23,"_24":25,"_26":27,"_28":29,"_30":29},"file",{"_31":32,"_33":29,"_34":35,"_36":38,"_39":40,"_41":14,"_42":43,"_24":27},"previous",{"_31":32,"_33":29,"_34":35,"_36":37},"deleted",true,"deletedHere",false,"path","brain_router_elimination_probe_20260909.ts","latestPath","fileId","d1a7cbb0-ac5b-11f1-8c0e-1607ee4eb77e","name","fileType","script","content","const endpoint=\"https://api.kilo.ai/api/gateway/chat/completions\";\nconst tasks=[\n {id:\"sched3\",expected:15,prompt:\"Eight indivisible jobs have durations [9,8,7,6,5,4,3,2]. Assign every job to exactly one of 3 identical parallel machines. What is the minimum possible makespan? Return exactly JSON: {\\\\\\\"answer\\\\\\\":NUMBER}\"},\n {id:\"knap\",expected:33,prompt:\"0/1 knapsack, capacity 17. Items are (weight,value): [(4,7),(5,9),(6,12),(3,6),(7,13),(2,4),(8,15)]. What is the maximum total value? Return exactly JSON: {\\\\\\\"answer\\\\\\\":NUMBER}\"},\n {id:\"spath\",expected:11,prompt:\"Directed weighted edges: A-B4,A-C7,A-D10,B-C1,B-E8,B-F12,C-D2,C-E3,C-F9,D-E2,D-G8,E-F2,E-G4,F-G1. What is the shortest-path distance from A to G? Return exactly JSON: {\\\\\\\"answer\\\\\\\":NUMBER}\"}\n];\nconst exact=[\"nex-agi/nex-n2.5-mini:free\",\"stepfun/step-3.7-flash:free\"];\nfunction answerOf(s){ if(!s)return null; const m=s.match(/\"answer\"\\\\s*:\\\\s*(-?\\\\d+(?:\\\\.\\\\d+)?)/); return m?Number(m[1]):null; }\nasync function call(model,task){\n const t0=performance.now();\n try{\n const r=await fetch(endpoint,{method:\"POST\",headers:{\"content-type\":\"application/json\"},body:JSON.stringify({model,messages:[{role:\"user\",content:task.prompt}],temperature:0,max_tokens:300})});\n const txt=await r.text(); let j=null; try{j=JSON.parse(txt)}catch{}\n const content=j?.choices?.[0]?.message?.content??\"\";\n const ans=answerOf(content);\n return {requested:model,resolved:j?.model??null,status:r.status,elapsed_ms:+(performance.now()-t0).toFixed(1),answer:ans,verified:ans===task.expected,cost:j?.usage?.cost??null,content:content.slice(0,300),error:j?.error??null};\n }catch(e){return {requested:model,status:0,elapsed_ms:+(performance.now()-t0).toFixed(1),answer:null,verified:false,error:String(e)}}\n}\nconst out={schema:\"BRAIN_KILO_AUTO_ROUTER_ELIMINATION_PROBE_V1\",started_at:new Date().toISOString(),tasks:[]};\nfor(const task of tasks){\n const auto=await call(\"kilo-auto/free\",task);\n const manual=await Promise.all(exact.map(m=>call(m,task)));\n const verifiedManual=manual.filter(x=>x.verified).sort((a,b)=>a.elapsed_ms-b.elapsed_ms);\n out.tasks.push({id:task.id,expected:task.expected,auto,manual,manual_first_verified:verifiedManual[0]??null});\n}\nout.summary={\n auto_verified:out.tasks.filter(x=>x.auto.verified).length,\n manual_fanout_verified:out.tasks.filter(x=>x.manual_first_verified).length,\n auto_elapsed_verified_ms:out.tasks.filter(x=>x.auto.verified).map(x=>x.auto.elapsed_ms),\n manual_first_verified_ms:out.tasks.filter(x=>x.manual_first_verified).map(x=>x.manual_first_verified.elapsed_ms)\n};\nconsole.log(JSON.stringify(out,null,2));","const endpoint=\"https://api.kilo.ai/api/gateway/chat/completions\";\nconst tasks=[\n {id:\"sched3\",expected:15,prompt:\"Eight indivisible jobs have durations [9,8,7,6,5,4,3,2]. Assign every job to exactly one of 3 identical parallel machines. What is the minimum possible makespan? Return exactly JSON: {\\\\\\\"answer\\\\\\\":NUMBER}\"},\n {id:\"knap\",expected:33,prompt:\"0/1 knapsack, capacity 17. Items are (weight,value): [(4,7),(5,9),(6,12),(3,6),(7,13),(2,4),(8,15)]. What is the maximum total value? Return exactly JSON: {\\\\\\\"answer\\\\\\\":NUMBER}\"},\n {id:\"spath\",expected:11,prompt:\"Directed weighted edges: A-B4,A-C7,A-D10,B-C1,B-E8,B-F12,C-D2,C-E3,C-F9,D-E2,D-G8,E-F2,E-G4,F-G1. What is the shortest-path distance from A to G? Return exactly JSON: {\\\\\\\"answer\\\\\\\":NUMBER}\"}\n];\nconst exact=[\"nex-agi/nex-n2.5-mini:free\",\"stepfun/step-3.7-flash:free\"];\nfunction answerOf(s){ if(!s)return null; const m=s.match(/\"answer\"\\s*:\\s*(-?\\d+(?:\\.\\d+)?)/); return m?Number(m[1]):null; }\nasync function call(model,task){\n const t0=performance.now();\n try{\n const r=await fetch(endpoint,{method:\"POST\",headers:{\"content-type\":\"application/json\"},body:JSON.stringify({model,messages:[{role:\"user\",content:task.prompt}],temperature:0,max_tokens:300})});\n const txt=await r.text(); let j=null; try{j=JSON.parse(txt)}catch{}\n const content=j?.choices?.[0]?.message?.content??\"\";\n const ans=answerOf(content);\n return {requested:model,resolved:j?.model??null,status:r.status,elapsed_ms:+(performance.now()-t0).toFixed(1),answer:ans,verified:ans===task.expected,cost:j?.usage?.cost??null,content:content.slice(0,300),error:j?.error??null};\n }catch(e){return {requested:model,status:0,elapsed_ms:+(performance.now()-t0).toFixed(1),answer:null,verified:false,error:String(e)}}\n}\nconst out={schema:\"BRAIN_KILO_AUTO_ROUTER_ELIMINATION_PROBE_V1\",started_at:new Date().toISOString(),tasks:[]};\nfor(const task of tasks){\n const auto=await call(\"kilo-auto/free\",task);\n const manual=await Promise.all(exact.map(m=>call(m,task)));\n const verifiedManual=manual.filter(x=>x.verified).sort((a,b)=>a.elapsed_ms-b.elapsed_ms);\n out.tasks.push({id:task.id,expected:task.expected,auto,manual,manual_first_verified:verifiedManual[0]??null});\n}\nout.summary={\n auto_verified:out.tasks.filter(x=>x.auto.verified).length,\n manual_fanout_verified:out.tasks.filter(x=>x.manual_first_verified).length,\n auto_elapsed_verified_ms:out.tasks.filter(x=>x.auto.verified).map(x=>x.auto.elapsed_ms),\n manual_first_verified_ms:out.tasks.filter(x=>x.manual_first_verified).map(x=>x.manual_first_verified.elapsed_ms)\n};\nconsole.log(JSON.stringify(out,null,2));","createdAt",["D",1788964702185],"branchVersion","branchId","7d70e020-75da-4570-8234-147962c4563e","id","42e531b3-1ebd-43bd-997b-5ff43a8686fe","gdi-kilo-bridge",["D",1788608283393],"deletedAt","legacyEnvVars","privacy","public","httpPrivacy","description","Zero-cost Kilo HTTP bridge for GDI preflight","imageUrl","6be0fc5c-1fef-4bd6-a1e1-67a3f8c0764e","pinnedFileId","pinPreview","pinMigrated","screenshotVersion","likeCount",0,"orgId","01a0715b-703f-741f-ab35-c85020e4a5e0","tursoName","tursoHostname","tursoMeasuredAt","pinned","userPerm","r","valPerm","blobPerm","rw","emailPerm","sqlitePerm","projectPerm","telemetryPerm","user",{"_96":95,"_104":100},"org",{"_96":95,"_97":98,"_99":100,"_18":56,"_101":102,"_103":27},"branch",{"_13":85,"_33":86,"_44":43,"_87":45,"_88":-5,"_89":-5,"_90":-5,"_91":-5,"_92":-5,"_93":46,"_94":95},"isOwned",30,"main","projectId","forkedBranchId","forkedBranchVersion","forkedProjectPrivacy","forkedProjectId","forkedProjectOrgId","projectName","userHandle","mosadek","handle","displayName","Mo Sadek","avatar","https://lh3.googleusercontent.com/a/ACg8ocL1eT_LHhKSg5px3nXIO6eez79aZXef466qXKh2gak-0iwrvw=s96-c","tier","free","canRestrictVals","profileImageUrl","branchName","","adoptOrgId",{"_44":45,"_33":46,"_39":235,"_48":-5,"_49":27,"_50":51,"_52":51,"_53":54,"_55":-5,"_18":56,"_57":-5,"_58":27,"_59":-5,"_60":-5,"_61":62,"_63":64,"_65":-5,"_66":-5,"_67":-5,"_68":-5,"_69":70,"_71":70,"_72":73,"_74":73,"_75":73,"_76":70,"_77":70,"_78":236,"_80":237,"_82":238,"_84":27},"tree",[202,203,204,205,206,207,208,209],"files",[202,203,204,205,206,207,208,209],"counts",{"_192":62,"_193":190,"_194":62,"_195":196,"_197":198},"contents",[127,128,129,130,131,132,133,134],"upstreamProject","upstreamBranch","emptyEnvVars","flags",[],"hasHttpFiles","grants","orgs","customDomains",{},{"_44":188,"_33":29,"_31":32,"_138":-5,"_42":43,"_41":14,"_140":27,"_39":189,"_13":190,"_34":35,"_36":38,"_24":27,"_143":-5,"_28":191},{"_44":181,"_33":182,"_31":183,"_138":-5,"_42":43,"_41":184,"_140":27,"_39":185,"_13":62,"_34":35,"_36":186,"_24":27,"_143":-5,"_28":187},{"_44":173,"_33":174,"_31":175,"_138":-5,"_42":43,"_41":176,"_140":25,"_39":177,"_13":178,"_34":35,"_36":179,"_24":27,"_143":-5,"_28":180},{"_44":166,"_33":167,"_31":168,"_138":-5,"_42":43,"_41":169,"_140":27,"_39":170,"_13":62,"_34":35,"_36":171,"_24":27,"_143":-5,"_28":172},{"_44":159,"_33":160,"_31":161,"_138":-5,"_42":43,"_41":162,"_140":27,"_39":163,"_13":62,"_34":35,"_36":164,"_24":27,"_143":-5,"_28":165},{"_44":152,"_33":153,"_31":154,"_138":-5,"_42":43,"_41":155,"_140":25,"_39":156,"_13":62,"_34":35,"_36":157,"_24":27,"_143":-5,"_28":158},{"_44":145,"_33":146,"_31":147,"_138":-5,"_42":43,"_41":148,"_140":27,"_39":149,"_13":62,"_34":35,"_36":150,"_24":27,"_143":-5,"_28":151},{"_44":135,"_33":136,"_31":137,"_138":-5,"_42":43,"_41":139,"_140":27,"_39":141,"_13":62,"_34":35,"_36":142,"_24":27,"_143":-5,"_28":144},"ffb41a29-b4d3-4e96-8887-c7494b484407","yield_router_probe_v2.ts","1b542434-ac5c-11f1-869b-1607ee4eb77e","parentId",21,"latest",["D",1788964702054],"\nconst endpoint=\"https://api.kilo.ai/api/gateway/chat/completions\";\nconst models=[\n\"nex-agi/nex-n2.5-mini:free\",\n\"inclusionai/ling-3.0-flash-fin:free\",\n\"inclusionai/ling-3.0-flash-sante:free\",\n\"stepfun/step-3.7-flash:free\",\n\"dots-studio/dots-3-note-preview:free\",\n\"nvidia/nemotron-3.5-lightning:free\",\n\"cohere/north-mini-code:free\",\n\"kilo-auto/free\"\n];\nconst deps={A:[],B:[],C:[],D:[\"A\"],E:[\"A\",\"B\"],F:[\"B\",\"C\"],G:[\"D\",\"E\"],H:[\"F\",\"G\"]};\nconst tasks=Object.keys(deps);\nfunction optimum(){\n let frontier=new Set([0]), waves=0;\n const full=(1<mask&(1<tasks.length) throw new Error(\"NO_SCHEDULE\");\n }\n return waves;\n}\nconst opt=optimum();\nfunction parseContent(s){\n if(typeof s!==\"string\") return null;\n const a=s.indexOf(\"{\"), b=s.lastIndexOf(\"}\");\n if(a<0||b2) return false;\n for(const t of wave){\n if(!tasks.includes(t)||seen.has(t)) return false;\n if(!deps[t].every(d=>seen.has(d))) return false;\n }\n for(const t of wave) seen.add(t);\n }\n return seen.size===tasks.length;\n}\nconst prompt=`A deterministic exact preprocessor has already proven the optimum is ${opt} waves. Produce any valid ${opt}-wave schedule. Tasks: A,B,C,D,E,F,G,H. Dependencies: D depends on A; E depends on A and B; F depends on B and C; G depends on D and E; H depends on F and G. A,B,C have no dependencies. Each wave contains at most 2 tasks. Dependencies must be completed in earlier waves. Return JSON only exactly like {\"waves\":[[\"A\",\"B\"],[\"C\"],[\"D\",\"E\"],[\"F\",\"G\"],[\"H\"]]}. Every task exactly once. No prose.`;\nasync function attempt(model,tag){\n const t=Date.now();\n try{\n const res=await fetch(endpoint,{method:\"POST\",headers:{\"content-type\":\"application/json\"},body:JSON.stringify({model,messages:[{role:\"user\",content:prompt}],temperature:0,max_tokens:500,reasoning:{effort:\"none\",exclude:true}})});\n const text=await res.text();\n let body=null; try{body=JSON.parse(text)}catch{}\n const content=body?.choices?.[0]?.message?.content ?? \"\";\n const obj=parseContent(content);\n return {tag,requested:model,status:res.status,elapsed_ms:Date.now()-t,valid:verify(obj),answer:obj,provider_model:body?.model??null,response_id:body?.id??null,cost:body?.usage?.cost??body?.cost??null,finish:body?.choices?.[0]?.finish_reason??null,error:body?.error??null};\n }catch(e){return {tag,requested:model,status:0,elapsed_ms:Date.now()-t,valid:false,error:String(e)}}\n}\nconst explore=await Promise.all(models.map((m,i)=>attempt(m,`explore-${i+1}`)));\nconst winners=explore.filter(x=>x.valid).sort((a,b)=>a.elapsed_ms-b.elapsed_ms).slice(0,2).map(x=>x.requested);\nconst exploit=[];\nfor(let r=1;r<=3;r++){\n const batch=await Promise.all(winners.map((m,i)=>attempt(m,`exploit-r${r}-${i+1}`)));\n exploit.push(...batch);\n}\nconst all=[...explore,...exploit];\nconst summary={};\nfor(const m of models){\n const xs=all.filter(x=>x.requested===m);\n if(!xs.length) continue;\n const valid=xs.filter(x=>x.valid);\n const ms=valid.map(x=>x.elapsed_ms).sort((a,b)=>a-b);\n summary[m]={attempts:xs.length,valid:valid.length,yield:valid.length/xs.length,median_valid_ms:ms.length?ms[Math.floor(ms.length/2)]:null,first_valid_ms:ms.length?ms[0]:null,statuses:xs.map(x=>x.status),costs:xs.map(x=>x.cost)};\n}\nconsole.log(JSON.stringify({optimum_waves:opt,winners,summary,explore,exploit}));\n","label",[136],"1578aa44-f86c-49bb-8f68-d763dc8bc5c9","yield_router_probe.ts","8df6a724-ac5b-11f1-a520-1607ee4eb77e",14,["D",1788964464872],"\nconst endpoint=\"https://api.kilo.ai/api/gateway/chat/completions\";\nconst models=[\n\"nex-agi/nex-n2.5-mini:free\",\n\"inclusionai/ling-3.0-flash-fin:free\",\n\"inclusionai/ling-3.0-flash-sante:free\",\n\"stepfun/step-3.7-flash:free\",\n\"dots-studio/dots-3-note-preview:free\",\n\"nvidia/nemotron-3.5-lightning:free\",\n\"cohere/north-mini-code:free\",\n\"kilo-auto/free\"\n];\nconst deps={A:[],B:[],C:[],D:[\"A\"],E:[\"A\",\"B\"],F:[\"B\",\"C\"],G:[\"D\",\"E\"],H:[\"F\",\"G\"]};\nconst tasks=Object.keys(deps);\nfunction optimum(){\n let frontier=new Set([0]), waves=0;\n const full=(1<mask&(1<tasks.length) throw new Error(\"NO_SCHEDULE\");\n }\n return waves;\n}\nconst opt=optimum();\nfunction parseContent(s){\n if(typeof s!==\"string\") return null;\n const a=s.indexOf(\"{\"), b=s.lastIndexOf(\"}\");\n if(a<0||b2) return false;\n for(const t of wave){\n if(!tasks.includes(t)||seen.has(t)) return false;\n if(!deps[t].every(d=>seen.has(d))) return false;\n }\n for(const t of wave) seen.add(t);\n }\n return seen.size===tasks.length;\n}\nconst prompt=`Solve this exact scheduling problem. Tasks: A,B,C,D,E,F,G,H. Dependencies: D<-A; E<-A,B; F<-B,C; G<-D,E; H<-F,G. A,B,C have no dependencies. A wave may contain at most 2 tasks. Every dependency must be completed in an earlier wave. Minimize the number of waves. Return JSON only, exactly {\"waves\":[[\"A\",\"B\"],[\"C\"],...]} with each task exactly once. No prose.`;\nasync function attempt(model,tag){\n const t=Date.now();\n try{\n const res=await fetch(endpoint,{method:\"POST\",headers:{\"content-type\":\"application/json\"},body:JSON.stringify({model,messages:[{role:\"user\",content:prompt}],temperature:0,max_tokens:800})});\n const text=await res.text();\n let body=null; try{body=JSON.parse(text)}catch{}\n const content=body?.choices?.[0]?.message?.content ?? \"\";\n const obj=parseContent(content);\n return {tag,requested:model,status:res.status,elapsed_ms:Date.now()-t,valid:verify(obj),answer:obj,provider_model:body?.model??null,response_id:body?.id??null,cost:body?.usage?.cost??body?.cost??null,error:body?.error??null};\n }catch(e){return {tag,requested:model,status:0,elapsed_ms:Date.now()-t,valid:false,error:String(e)}}\n}\nconst explore=await Promise.all(models.map((m,i)=>attempt(m,`explore-${i+1}`)));\nconst winners=explore.filter(x=>x.valid).sort((a,b)=>a.elapsed_ms-b.elapsed_ms).slice(0,2).map(x=>x.requested);\nconst exploit=[];\nfor(let r=1;r<=3;r++){\n const batch=await Promise.all(winners.map((m,i)=>attempt(m,`exploit-r${r}-${i+1}`)));\n exploit.push(...batch);\n}\nconst all=[...explore,...exploit];\nconst summary={};\nfor(const m of models){\n const xs=all.filter(x=>x.requested===m);\n if(!xs.length) continue;\n const valid=xs.filter(x=>x.valid);\n summary[m]={attempts:xs.length,valid:valid.length,yield:valid.length/xs.length,median_valid_ms:valid.length?valid.map(x=>x.elapsed_ms).sort((a,b)=>a-b)[Math.floor(valid.length/2)]:null,statuses:xs.map(x=>x.status)};\n}\nconsole.log(JSON.stringify({optimum_waves:opt,winners,summary,explore,exploit}));\n",[146],"a1ef15b9-cd32-49ee-a93b-387d2651f7fb","response_shape_probe.ts","c900b8aa-ac5b-11f1-a8cf-1607ee4eb77e",16,["D",1788964563927],"\nconst endpoint=\"https://api.kilo.ai/api/gateway/chat/completions\";\nconst res=await fetch(endpoint,{method:\"POST\",headers:{\"content-type\":\"application/json\"},body:JSON.stringify({model:\"nex-agi/nex-n2.5-mini:free\",messages:[{role:\"user\",content:'Return JSON only: {\"x\":437}'}],temperature:0,max_tokens:200})});\nconst text=await res.text();\nconsole.log(JSON.stringify({status:res.status,text:text.slice(0,12000)}));\n",[153],"a8440fd5-5535-4339-b427-9a8dd32a74ec","probe_nex_schedule.ts","011276ac-ac5c-11f1-9bbe-1607ee4eb77e",20,["D",1788964657956],"const endpoint = \"https://api.kilo.ai/api/gateway/chat/completions\";\nconst prompt = \"Solve this exact scheduling problem. Tasks: A,B,C,D,E,F,G,H. Dependencies: D<-A; E<-A,B; F<-B,C; G<-D,E; H<-F,G. A,B,C have no dependencies. A wave may contain at most 2 tasks. Every dependency must be completed in an earlier wave. Minimize the number of waves. Return JSON only with key waves, each wave an array of task letters, every task exactly once. No prose.\";\nconst payload = {model:\"nex-agi/nex-n2.5-mini:free\",messages:[{role:\"user\",content:prompt}],temperature:0,max_tokens:800};\nconst started=Date.now();\nconst res=await fetch(endpoint,{method:\"POST\",headers:{\"content-type\":\"application/json\"},body:JSON.stringify(payload)});\nconst out=await res.text();\nconsole.log(JSON.stringify({ok:res.ok,status:res.status,elapsed_ms:Date.now()-started,body:out}));",[160],"7b61d08e-760e-4a12-bab5-5590737f2ac2","probe_nex.ts","f4ebc37e-ac5b-11f1-9326-1607ee4eb77e",19,["D",1788964637608],"const endpoint = \"https://api.kilo.ai/api/gateway/chat/completions\";\n\nconst payload = {\n model: \"nex-agi/nex-n2.5-mini:free\",\n messages: [{ role: \"user\", content: \"Reply with exactly 437 and nothing else.\" }],\n temperature: 0\n};\n\nconst started = Date.now();\nconst res = await fetch(endpoint, {\n method: \"POST\",\n headers: { \"content-type\": \"application/json\" },\n body: JSON.stringify(payload),\n});\nconst out = await res.text();\nconsole.log(JSON.stringify({\n ok: res.ok,\n status: res.status,\n elapsed_ms: Date.now() - started,\n body: out\n}));",[167],"a10d416f-e878-4895-a8f7-333e642239a0","main.ts","414c9950-a91e-11f1-a1da-1607ee4eb77e",13,["D",1788964388310],11,"const endpoint = \"https://api.kilo.ai/api/gateway/chat/completions\";\n\nconst payload = {\n model: \"kilo-auto/free\",\n messages: [{ role: \"user\", content: \"Reply with exactly KILO_OK and nothing else.\" }],\n temperature: 0\n};\n\nconst started = Date.now();\nconst res = await fetch(endpoint, {\n method: \"POST\",\n headers: { \"content-type\": \"application/json\" },\n body: JSON.stringify(payload),\n});\nconst text = await res.text();\nconsole.log(JSON.stringify({\n ok: res.ok,\n status: res.status,\n elapsed_ms: Date.now() - started,\n body: text\n}));\n",[174],"3bbffb12-b5e3-492f-a24d-5b231f13370a","catalog_probe.ts","5b498cce-ac5b-11f1-bd5d-1607ee4eb77e",12,["D",1788964379821],"const r = await fetch(\"https://api.kilo.ai/api/gateway/models\");\nconst j = await r.json();\nconst arr = Array.isArray(j) ? j : (j.data ?? j.models ?? []);\nconst free = arr.filter((m:any)=>m?.isFree===true || m?.is_free===true || (Number(m?.pricing?.prompt ?? m?.promptPrice ?? 1)===0 && Number(m?.pricing?.completion ?? m?.completionPrice ?? 1)===0));\nconsole.log(JSON.stringify({status:r.status,count:arr.length,free:free.map((m:any)=>({id:m.id,name:m.name,isFree:m.isFree,pricing:m.pricing})).slice(0,100)}));",[182],"766cdc28-0e75-4c49-8278-5d7f3191798d",["D",1788964702185],1,[29],"pulls","branches","forks","envVars",{"_199":62,"_201":62},"connections",{"_199":62,"_200":62},"count","unfilledCount","emptyCount",{"_44":188,"_33":29,"_31":32,"_138":-5,"_42":43,"_41":14,"_140":27,"_39":232,"_13":190,"_34":35,"_36":38,"_24":27,"_143":-5,"_211":233,"_28":234},{"_44":181,"_33":182,"_31":183,"_138":-5,"_42":43,"_41":184,"_140":27,"_39":229,"_13":62,"_34":35,"_36":186,"_24":27,"_143":-5,"_211":230,"_28":231},{"_44":173,"_33":174,"_31":175,"_138":-5,"_42":43,"_41":176,"_140":25,"_39":226,"_13":178,"_34":35,"_36":179,"_24":27,"_143":-5,"_211":227,"_28":228},{"_44":166,"_33":167,"_31":168,"_138":-5,"_42":43,"_41":169,"_140":27,"_39":223,"_13":62,"_34":35,"_36":171,"_24":27,"_143":-5,"_211":224,"_28":225},{"_44":159,"_33":160,"_31":161,"_138":-5,"_42":43,"_41":162,"_140":27,"_39":220,"_13":62,"_34":35,"_36":164,"_24":27,"_143":-5,"_211":221,"_28":222},{"_44":152,"_33":153,"_31":154,"_138":-5,"_42":43,"_41":155,"_140":25,"_39":217,"_13":62,"_34":35,"_36":157,"_24":27,"_143":-5,"_211":218,"_28":219},{"_44":145,"_33":146,"_31":147,"_138":-5,"_42":43,"_41":148,"_140":27,"_39":214,"_13":62,"_34":35,"_36":150,"_24":27,"_143":-5,"_211":215,"_28":216},{"_44":135,"_33":136,"_31":137,"_138":-5,"_42":43,"_41":139,"_140":27,"_39":210,"_13":62,"_34":35,"_36":142,"_24":27,"_143":-5,"_211":212,"_28":213},["D",1788964702054],"children",[],[136],["D",1788964464872],[],[146],["D",1788964563927],[],[153],["D",1788964657956],[],[160],["D",1788964637608],[],[167],["D",1788964388310],[],[174],["D",1788964379821],[],[182],["D",1788964702185],[],[29],["D",1788608283393],{"_96":95,"_104":100},{"_96":95,"_97":98,"_99":100,"_18":56,"_101":102,"_103":27},{"_13":85,"_33":86,"_44":43,"_87":45,"_88":-5,"_89":-5,"_90":-5,"_91":-5,"_92":-5,"_93":46,"_94":95},"ctx",{"_78":-5,"_124":272,"_273":274,"_275":276,"_277":27,"_278":27,"_279":27,"_280":25,"_281":-5,"_282":-7,"_283":-7,"_284":62,"_285":27,"_286":27,"_287":-5,"_288":27,"_289":27,"_290":27,"_291":-5},"ENV",{"_243":244,"_245":246,"_247":86,"_248":249,"_250":251,"_252":253,"_254":255,"_256":257,"_258":259,"_260":261,"_262":263,"_264":265,"_266":267,"_268":269,"_270":271},"REACT_APP_SENTRY_DSN","https://586020d86f05489db63a554690acf1e9@o1398359.ingest.sentry.io/6724499","RENDER_GIT_COMMIT","e87eb04e707cf64e7e532c8e8ec395f209e17f15","RENDER_GIT_BRANCH","POSTHOG_API_TOKEN","phc_nmoyuAkStEZuUp69rYlg1DZgrIt19Gx0Y4Hwf8tGgJP","POSTHOG_API_HOST","https://wart.val.town","WEB_API_TEMPLATE","https://{val}.web.val.run","APP_URL","https://www.val.town","MODULE_URL","https://esm.town","VANITY_WEB_API_TEMPLATE","https://{label}.val.run/","DENOLS_URL","https://lsp.val.town","NODE_ENV","production","CLOUDFLARE_TURNSTILE_SITE_KEY","0x4AAAAAACtaIZJH7s9rBMZ6","GOOGLE_CLIENT_ID","875989696899-jtsqkhlbdv5jrlsk8631p7ipjg3c6o62.apps.googleusercontent.com","STRIPE_PUBLISHABLE_KEY","pk_live_51N2zvWEpZTTLipIkVEwXrUG9AT0yeOOEYxszarZT1jpsZV58Ly6wlg3SltZpHN26CUalOBmUSY7adQRQiSkCZz2500qSXNkf8Y","API_URL","https://api.val.town",[],"preferencesKeybindings","default","preferencesTheme","light","preferencesFixers","preferencesCopilot","preferencesSelectionAi","preferencesCloseBrackets","preferencesChatPanelState","preferencesDprint","preferencesDenofmt","notificationCount","flagDenols","isBusinessOrgMember","businessOrgHandle","isBusinessOrgAdmin","isHigherTownieTier","navCollapsed","currentOrgId"]

Diff · v22