[{"_1":2,"_3":-5,"_4":-5},"loaderData",{"_5":6,"_7":8,"_9":10},"actionData","errors","root",{"_231":232,"_233":234},"routes/_app.x.$handle.$name",{"_11":12,"_13":14,"_15":16,"_17":18,"_38":-7,"_121":-5,"_19":122,"_123":124,"_125":126,"_127":128,"_129":130,"_21":131,"_132":-5,"_133":-5,"_134":24,"_135":136,"_137":24,"_138":-5,"_139":-5,"_140":141},"routes/_app.x.$handle.$name.branch.$branch.history_.$",{"_11":12,"_13":14,"_15":16,"_17":18,"_19":20,"_21":22,"_23":24,"_25":26,"_27":28,"_29":24,"_30":-5},"handle","mosadek","name","cfwg-r2-review-9f3c","branchName","main","path","review.ts","project",{"_32":72,"_13":14,"_36":73,"_74":-5,"_75":24,"_76":77,"_78":77,"_79":80,"_81":-5,"_30":68,"_82":-5,"_83":24,"_84":-5,"_85":-5,"_86":26,"_40":41,"_87":-5,"_88":-5,"_89":-5,"_90":-5,"_91":92,"_93":92,"_94":95,"_96":95,"_97":95,"_98":92,"_99":92,"_53":100,"_101":102,"_103":104,"_105":24},"file",{"_63":64,"_13":18,"_65":66,"_67":24,"_71":-5},"isDirectory",false,"page",0,"history",[31],"hasNext","userId",{"_32":33,"_34":35,"_36":37,"_38":39,"_40":41,"_42":43,"_44":-5,"_45":-5,"_46":-5,"_47":-5,"_48":-5,"_49":50,"_51":52,"_53":54,"_21":55,"_56":-5,"_57":-5,"_58":-5,"_59":-5,"_60":61},"id","7f38c7d0-71da-47a9-837a-6407ed28c134","branchId","3a482b85-9344-42eb-8e2f-8e03079e2ef8","createdAt",["D",1788789959736],"version",2,"orgId","01a0715b-703f-741f-ab35-c85020e4a5e0","parentId","f0ff793b-6270-4edf-9326-f1d3f8647495","incomingCommitId","aiChatMessageId","aiChatThreadId","aiChatThreadUserId","aiChatThreadTitle","source","mcp","clientLabel","ChatGPT","user",{"_32":68,"_40":41,"_11":12,"_69":70},{"_63":64,"_13":18,"_65":66,"_67":24},"pull","merge","revert","multiple","commits",[62],{"_32":33,"_34":35,"_36":37,"_38":39,"_40":41,"_42":43,"_44":-5,"_45":-5,"_46":-5,"_47":-5,"_48":-5,"_49":50,"_51":52,"_53":54,"_21":55,"_56":-5,"_57":-5,"_58":-5},"fileId","40cb9a82-aac5-11f1-ace6-1607ee4eb77e","fileType","script","deleted","6be0fc5c-1fef-4bd6-a1e1-67a3f8c0764e","avatar","https://lh3.googleusercontent.com/a/ACg8ocL1eT_LHhKSg5px3nXIO6eez79aZXef466qXKh2gak-0iwrvw=s96-c","deletedAtVersion","362c5283-3a16-4816-835c-5401484577e5",["D",1788789898951],"deletedAt","legacyEnvVars","privacy","public","httpPrivacy","description","Disposable CFWG R2 independent review harness","imageUrl","pinnedFileId","pinPreview","pinMigrated","screenshotVersion","likeCount","tursoName","tursoHostname","tursoMeasuredAt","pinned","userPerm","r","valPerm","blobPerm","rw","emailPerm","sqlitePerm","projectPerm","telemetryPerm",{"_11":12,"_120":70},"org",{"_11":12,"_115":116,"_69":70,"_30":68,"_117":118,"_119":24},"branch",{"_38":106,"_13":16,"_32":35,"_107":72,"_108":-5,"_109":-5,"_110":-5,"_111":-5,"_112":-5,"_113":14,"_114":12},"isOwned",7,"projectId","forkedBranchId","forkedBranchVersion","forkedProjectPrivacy","forkedProjectId","forkedProjectOrgId","projectName","userHandle","displayName","Mo Sadek","tier","free","canRestrictVals","profileImageUrl","adoptOrgId",{"_32":72,"_13":14,"_36":227,"_74":-5,"_75":24,"_76":77,"_78":77,"_79":80,"_81":-5,"_30":68,"_82":-5,"_83":24,"_84":-5,"_85":-5,"_86":26,"_40":41,"_87":-5,"_88":-5,"_89":-5,"_90":-5,"_91":92,"_93":92,"_94":95,"_96":95,"_97":95,"_98":92,"_99":92,"_53":228,"_101":229,"_103":230,"_105":24},"tree",[162,163,164,165,166,167,168,169],"files",[162,163,164,165,166,167,168,169],"counts",{"_151":26,"_152":153,"_154":26,"_155":156,"_157":158},"contents",[],{"_32":142,"_13":18,"_63":64,"_42":-5,"_34":35,"_143":39,"_144":145,"_36":146,"_38":26,"_65":66,"_147":148,"_67":24,"_149":-5,"_17":150},"upstreamProject","upstreamBranch","emptyEnvVars","flags",[],"hasHttpFiles","grants","orgs","customDomains",{},"e5249c02-18f3-476f-b1af-6a4d41e3b18b","branchVersion","latest",true,["D",1788789959736],"content","import { blob } from \"https://esm.town/v/std/blob/main.ts\";\nconst manifest=JSON.parse(await (await blob.get(\"CFWG_R2_DURABILITY_MANIFEST_V2.json\")).text());\nconst enc=new TextEncoder(),dec=new TextDecoder();\nasync function shaBytes(b:Uint8Array){const d=await crypto.subtle.digest(\"SHA-256\",b);return [...new Uint8Array(d)].map(x=>x.toString(16).padStart(2,\"0\")).join(\"\")}\nasync function shaText(s:string){return shaBytes(enc.encode(s))}\nconst parts:string[]=[],partChecks:any[]=[];\nfor(const p of manifest.package.parts){\n const name=p.blob_key.split(\"/\").pop();\n const t=await (await blob.get(name)).text(); parts.push(t);\n const h=await shaText(t);\n partChecks.push({part:p.part,bytes:enc.encode(t).length,sha256:h,expected:p.sha256,pass:h===p.sha256&&enc.encode(t).length===p.bytes});\n}\nconst b64=parts.join(\"\"), raw=atob(b64), gz=new Uint8Array(raw.length);\nfor(let i=0;ix===0))break;\n const name=dec.decode(h.slice(0,100)).replace(/\\0.*$/,\"\"),size=oct(dec.decode(h.slice(124,136)));\n const body=tar.slice(o+512,o+512+size);\n files[name]={bytes:size,sha256:await shaBytes(body),content:dec.decode(body)};\n o+=512+Math.ceil(size/512)*512;\n}\nconst summary={\n schema:\"CFWG_R2_INDEPENDENT_RECONSTRUCTION_9F3C_V1\",\n partChecks,\n base64:{bytes:enc.encode(b64).length,sha256:await shaText(b64),expected:manifest.package.base64_sha256},\n gzip:{bytes:gz.length,sha256:await shaBytes(gz),expected:manifest.package.gzip_sha256},\n tar:{bytes:tar.length,sha256:await shaBytes(tar),expected:manifest.package.tar_sha256},\n files:Object.fromEntries(Object.entries(files).map(([k,v]:any)=>[k,{bytes:v.bytes,sha256:v.sha256,expected:(manifest.files.find((x:any)=>x.path===k)||{}).sha256,pass:v.sha256===(manifest.files.find((x:any)=>x.path===k)||{}).sha256}]))\n};\nawait blob.set(\"RECONSTRUCTION_SUMMARY.json\",JSON.stringify(summary,null,2));\nfor(const [name,v] of Object.entries(files) as any)await blob.set(\"pkg/\"+name,v.content);\nconsole.log(JSON.stringify(summary,null,2));\n","label",[18],"pulls","branches",1,"forks","envVars",{"_159":26,"_161":26},"connections",{"_159":26,"_160":26},"count","unfilledCount","emptyCount",{"_32":220,"_13":221,"_63":222,"_42":-5,"_34":35,"_143":223,"_144":145,"_36":224,"_38":26,"_65":21,"_147":195,"_67":24,"_149":-5,"_176":225,"_17":226},{"_32":213,"_13":214,"_63":215,"_42":-5,"_34":35,"_143":153,"_144":145,"_36":216,"_38":26,"_65":21,"_147":217,"_67":24,"_149":-5,"_176":218,"_17":219},{"_32":205,"_13":206,"_63":207,"_42":-5,"_34":35,"_143":208,"_144":145,"_36":209,"_38":26,"_65":21,"_147":210,"_67":24,"_149":-5,"_176":211,"_17":212},{"_32":198,"_13":199,"_63":200,"_42":-5,"_34":35,"_143":106,"_144":145,"_36":201,"_38":26,"_65":66,"_147":202,"_67":24,"_149":-5,"_176":203,"_17":204},{"_32":190,"_13":191,"_63":192,"_42":-5,"_34":35,"_143":193,"_144":145,"_36":194,"_38":26,"_65":21,"_147":195,"_67":24,"_149":-5,"_176":196,"_17":197},{"_32":182,"_13":183,"_63":184,"_42":-5,"_34":35,"_143":153,"_144":145,"_36":185,"_38":26,"_65":186,"_147":187,"_67":24,"_149":-5,"_176":188,"_17":189},{"_32":142,"_13":18,"_63":64,"_42":-5,"_34":35,"_143":39,"_144":145,"_36":179,"_38":26,"_65":66,"_147":148,"_67":24,"_149":-5,"_176":180,"_17":181},{"_32":170,"_13":171,"_63":172,"_42":-5,"_34":35,"_143":173,"_144":145,"_36":174,"_38":26,"_65":66,"_147":175,"_67":24,"_149":-5,"_176":177,"_17":178},"16b0f45a-4a26-4d13-accf-afc2fb0a9a15","run_exact_test.ts","84431da8-aac5-11f1-971c-1607ee4eb77e",5,["D",1788790072929],"import \"./TEST_GENERATOR_R2.mjs\";","children",[],[171],["D",1788789959736],[],[18],"0fa688e6-ee7b-48e0-b84c-03c815c8e1e7","monitor.ts","01a07c2f-bf31-7409-85f8-bb6dc29d2e41",["D",1788789898951],"interval","import { blob } from \"https://esm.town/v/std/blob/main.ts\";\nimport { email } from \"https://esm.town/v/std/email\";\n\n// The URL to monitor. Change this to your website.\nconst URL_TO_MONITOR = \"https://example.com\";\n\nexport default async function () {\n let up = false;\n let detail = \"\";\n try {\n const res = await fetch(URL_TO_MONITOR);\n up = res.ok;\n detail = `HTTP ${res.status}`;\n } catch (e) {\n detail = String(e);\n }\n\n const last = await blob.getJSON(\"last-status\") as { up: boolean } | undefined;\n if (last?.up === up) return; // no change, stay quiet\n\n await blob.setJSON(\"last-status\", { up });\n if (last === undefined) return; // first run: just record the baseline\n\n await email({\n subject: up\n ? `Recovered: ${URL_TO_MONITOR} is back up (${detail})`\n : `Down: ${URL_TO_MONITOR} (${detail})`,\n text: `${URL_TO_MONITOR} is ${up ? \"back up\" : \"down\"}. ${detail}`,\n });\n}\n",[],[183],"3691e1e0-71f6-4875-a499-9aeda95041d4","causal_frontier_work_generator_r2.mjs","01a07c33-8589-7218-9c61-df70e543895d",6,["D",1788790146441],"export const CONTRIBUTION_CLASSES = [\n {\n id: 'independent_falsification',\n role: 'immune',\n capabilities: ['file_analysis'],\n contribution: 'Try to falsify the parent frontier node result or its current limiting-factor hypothesis using an independent route.'\n },\n {\n id: 'alternative_solution',\n role: 'architect',\n capabilities: ['file_analysis'],\n contribution: 'Develop a materially different solution route that can remove the parent critical path or expose a shorter one.'\n },\n {\n id: 'verification',\n role: 'immune',\n capabilities: ['file_analysis'],\n contribution: 'Independently verify the parent success condition and detect false completion before integration.'\n },\n {\n id: 'decomposition',\n role: 'maker',\n capabilities: ['file_analysis'],\n contribution: 'Decompose the parent into independent causally useful subproblems that can shorten verified completion latency.'\n },\n {\n id: 'lower_bound_attack',\n role: 'scientist',\n capabilities: ['file_analysis'],\n contribution: 'Attack the claimed serial/lower-bound bottleneck and search for reformulations that make more work executable now.'\n },\n {\n id: 'evidence_acquisition',\n role: 'scout',\n capabilities: ['file_analysis', 'web_research'],\n contribution: 'Acquire only evidence whose resolution can change the parent decision or remove a current uncertainty bottleneck.'\n },\n {\n id: 'coordination_resource_optimization',\n role: 'coordinator',\n capabilities: ['file_analysis'],\n contribution: 'Reduce queueing, contention, duplication, integration, or verification overhead on the parent frontier node.'\n },\n {\n id: 'architecture_shortcut',\n role: 'architect',\n capabilities: ['file_analysis'],\n contribution: 'Search for deletion, bypass, reuse, or a simpler architecture that removes the parent limiter rather than optimizing it.'\n }\n];\n\nfunction asArray(v) {\n if (Array.isArray(v)) return v;\n if (typeof v === 'string') {\n try { const x = JSON.parse(v); return Array.isArray(x) ? x : []; } catch { return []; }\n }\n return [];\n}\n\nfunction finiteNumber(v, fallback = null) {\n const n = Number(v);\n return Number.isFinite(n) ? n : fallback;\n}\n\nexport function validateMeasurement(m) {\n const n = finiteNumber(m?.n);\n const t = finiteNumber(m?.verified_latency_s);\n const q = finiteNumber(m?.verified_quality);\n if (!Number.isInteger(n) || n < 1) return { ok: false, reason: 'BAD_N' };\n if (!(t >= 0)) return { ok: false, reason: 'BAD_LATENCY' };\n if (!(q >= 0 && q <= 1)) return { ok: false, reason: 'BAD_QUALITY' };\n return { ok: true, value: { n, verified_latency_s: t, verified_quality: q, note: String(m?.note ?? '') } };\n}\n\nexport function executableFrontier(tasks, frontierNodeIds, completedIds = []) {\n const byId = new Map(tasks.map(t => [String(t.id), t]));\n const completed = new Set(completedIds.map(String));\n for (const t of tasks) if (String(t.state) === 'COMPLETE') completed.add(String(t.id));\n const wanted = new Set(frontierNodeIds.map(String));\n const admitted = [];\n const rejected = [];\n\n for (const id of wanted) {\n const t = byId.get(id);\n if (!t) { rejected.push({ id, reason: 'MISSING_TASK' }); continue; }\n if (!['READY', 'LEASED'].includes(String(t.state))) {\n rejected.push({ id, reason: 'STATE_NOT_EXECUTABLE', state: String(t.state) });\n continue;\n }\n const deps = asArray(t.depends_json ?? t.depends_on ?? t.depends);\n const unmet = deps.filter(d => !completed.has(String(d)));\n if (unmet.length) { rejected.push({ id, reason: 'UNMET_DEPENDENCIES', unmet }); continue; }\n if (t.guards_satisfied === false) { rejected.push({ id, reason: 'UNSATISFIED_GUARDS' }); continue; }\n if (t.frontier_relevance === false) { rejected.push({ id, reason: 'NOT_CURRENT_FRONTIER_RELEVANT' }); continue; }\n admitted.push({ ...t, depends: deps });\n }\n return { admitted, rejected };\n}\n\nexport function allocationDecision(curve = [], opts = {}) {\n const qTarget = finiteNumber(opts.quality_target, 1);\n const epsilon = Math.max(0, finiteNumber(opts.epsilon_s, 0));\n const lowerBound = finiteNumber(opts.lower_bound_s, null);\n const maxN = Math.max(1, Math.floor(finiteNumber(opts.max_runnable_n, 1)));\n const minLatencyGainFraction = Math.max(0, finiteNumber(opts.min_latency_gain_fraction, 0.02));\n const minQualityGain = Math.max(0, finiteNumber(opts.min_quality_gain, 0.001));\n const activeN = Math.max(0, Math.floor(finiteNumber(opts.active_population_n, 0)));\n\n const checked = [];\n for (const raw of curve) {\n const v = validateMeasurement(raw);\n if (!v.ok) return { action: 'INVALID', reason: v.reason, bad_measurement: raw };\n checked.push(v.value);\n }\n checked.sort((a, b) => a.n - b.n);\n for (let i = 1; i < checked.length; i++) {\n if (checked[i].n === checked[i - 1].n) return { action: 'INVALID', reason: 'DUPLICATE_N' };\n }\n\n if (!checked.length) {\n if (activeN > 0) return { action: 'WAIT', reason: 'BASELINE_POPULATION_IN_FLIGHT', current_n: activeN, target_n: activeN, n_star: null };\n return { action: 'ALLOCATE', reason: 'NEED_BASELINE_N1', current_n: 0, target_n: 1, n_star: null };\n }\n\n const curr = checked.at(-1);\n if (activeN > curr.n) return { action: 'WAIT', reason: 'POPULATION_POINT_IN_FLIGHT', current_n: activeN, target_n: activeN, n_star: null };\n if (curr.verified_quality >= qTarget && lowerBound !== null && curr.verified_latency_s <= lowerBound + epsilon) {\n return { action: 'STOP', reason: 'N_STAR_ESTABLISHED', current_n: curr.n, target_n: curr.n, n_star: curr.n };\n }\n if (curr.n >= maxN) {\n return { action: 'STOP', reason: 'CAPACITY_BOUND', current_n: curr.n, target_n: curr.n, n_star: null };\n }\n if (checked.length === 1) {\n return { action: 'ALLOCATE', reason: 'NEED_NEXT_POPULATION_POINT', current_n: curr.n, target_n: Math.min(maxN, curr.n * 2), n_star: null };\n }\n\n const prev = checked.at(-2);\n const qualityDelta = curr.verified_quality - prev.verified_quality;\n const latencyGainFraction = prev.verified_latency_s > 0\n ? (prev.verified_latency_s - curr.verified_latency_s) / prev.verified_latency_s\n : 0;\n\n if (curr.verified_quality < qTarget) {\n if (qualityDelta < minQualityGain) {\n return {\n action: 'STOP', reason: qualityDelta < 0 ? 'QUALITY_REGRESSION' : 'QUALITY_BOUND_NO_MEANINGFUL_GAIN',\n current_n: curr.n, target_n: curr.n, n_star: null, quality_delta: qualityDelta, latency_gain_fraction: latencyGainFraction\n };\n }\n return {\n action: 'ALLOCATE', reason: 'QUALITY_IMPROVING_BELOW_TARGET', current_n: curr.n,\n target_n: Math.min(maxN, curr.n * 2), n_star: null, quality_delta: qualityDelta, latency_gain_fraction: latencyGainFraction\n };\n }\n\n if (prev.verified_quality >= qTarget && curr.verified_quality >= qTarget && latencyGainFraction < minLatencyGainFraction) {\n return {\n action: 'STOP', reason: latencyGainFraction < 0 ? 'CONTENTION_SATURATION' : 'LATENCY_SATURATION_KNEE',\n current_n: curr.n, target_n: curr.n, n_star: curr.n, quality_delta: qualityDelta, latency_gain_fraction: latencyGainFraction\n };\n }\n\n return {\n action: 'ALLOCATE', reason: 'POSITIVE_MARGINAL_VERIFIED_VALUE', current_n: curr.n,\n target_n: Math.min(maxN, curr.n * 2), n_star: null, quality_delta: qualityDelta, latency_gain_fraction: latencyGainFraction\n };\n}\n\nfunction mergeCapabilities(parentRequires, contributionRequires) {\n return [...new Set([...asArray(parentRequires), ...contributionRequires])].sort();\n}\n\nfunction makeTask(parent, contribution, slot, decision, opts) {\n const parentId = String(parent.id);\n const targetN = decision.target_n;\n const dedupe = `${parentId}::N${targetN}::${contribution.id}::S${slot}`;\n return {\n id: `CFWG-R2::${dedupe}`,\n authority_class: 'CANDIDATE_NONAUTHORITY',\n parent_frontier_node: parentId,\n target_population_n: targetN,\n contribution_class: contribution.id,\n proposed_role: contribution.role,\n predicted_causal_contribution: contribution.contribution,\n independence_dedupe_identity: dedupe,\n required_capabilities: mergeCapabilities(parent.requires_json ?? parent.requires, contribution.capabilities),\n required_resources: asArray(parent.writes_json ?? parent.resources),\n stop_consequence: `Stop this slice if ${parentId} verifies complete, this contribution becomes semantically duplicated, or measured marginal verified value at N=${targetN} is non-positive.`,\n invalid_consequence: 'Mark INVALID and return capacity to the current frontier if prerequisites, evidence isolation, resource fencing, or independent execution cannot be satisfied.',\n marginal_value_hypothesis: `This independent ${contribution.id} slice at target population N=${targetN} will reduce verified critical-path latency or increase verified quality for ${parentId}; falsify by T_D(N)/Q_D(N) measurement.`,\n quality_target: finiteNumber(opts.quality_target, 1),\n epsilon_s: Math.max(0, finiteNumber(opts.epsilon_s, 0)),\n allocation_reason: decision.reason,\n later_blocked_stage_capacity: 0\n };\n}\n\nexport function generateFrontierWork(input) {\n const tasks = Array.isArray(input?.tasks) ? input.tasks : [];\n const frontierNodeIds = Array.isArray(input?.frontier_node_ids) ? input.frontier_node_ids : [];\n const curves = input?.curves_by_parent ?? {};\n const options = input?.options_by_parent ?? {};\n const defaultMaxN = Math.max(1, Math.floor(finiteNumber(input?.max_runnable_n, 1)));\n const existingDedupe = new Set((input?.existing_dedupe_identities ?? []).map(String));\n const frontier = executableFrontier(tasks, frontierNodeIds, input?.completed_ids ?? []);\n const generated = [];\n const decisions = [];\n\n for (const parent of frontier.admitted.sort((a, b) => Number(b.priority ?? 0) - Number(a.priority ?? 0))) {\n const opts = { max_runnable_n: defaultMaxN, ...(options[String(parent.id)] ?? {}) };\n const decision = allocationDecision(curves[String(parent.id)] ?? [], opts);\n decisions.push({ parent_frontier_node: String(parent.id), ...decision });\n if (decision.action !== 'ALLOCATE') continue;\n const currentN = decision.current_n;\n const needed = Math.max(0, decision.target_n - currentN);\n for (let slot = 0; slot < needed; slot++) {\n const contribution = CONTRIBUTION_CLASSES[(currentN + slot) % CONTRIBUTION_CLASSES.length];\n const candidate = makeTask(parent, contribution, slot, decision, opts);\n if (!existingDedupe.has(candidate.independence_dedupe_identity)) {\n existingDedupe.add(candidate.independence_dedupe_identity);\n generated.push(candidate);\n }\n }\n }\n\n return {\n schema: 'CAUSAL_FRONTIER_WORK_GENERATOR_R2_OUTPUT_V1',\n admitted_frontier_nodes: frontier.admitted.map(t => String(t.id)),\n rejected_frontier_nodes: frontier.rejected,\n allocation_decisions: decisions,\n generated_tasks: generated,\n invariants: {\n later_blocked_stages_receive_capacity: false,\n correctness_before_latency: true,\n configured_identity_is_not_capacity: true,\n dedupe_is_required: true,\n measured_T_D_N_Q_D_N_controls_scaling: true,\n human_authority_approval: false\n }\n };\n}\n",[],[191],"063aa845-c849-45aa-8210-fd730be6855f","adversarial_review.ts","d891749a-aac5-11f1-b7f2-1607ee4eb77e",["D",1788790214380],"import { allocationDecision, executableFrontier, generateFrontierWork } from \"./causal_frontier_work_generator_r2.mjs\";\n\nconst out:any={schema:\"CFWG_R2_ADVERSARIAL_REVIEW_9F3C_V1\",cases:[]};\n\n// A1: noisy/nonmonotonic curve. Last step improves, but is still worse than best observed N.\n{\n const curve=[\n {n:1,verified_latency_s:100,verified_quality:1},\n {n:2,verified_latency_s:150,verified_quality:1},\n {n:4,verified_latency_s:120,verified_quality:1}\n ];\n const d=allocationDecision(curve,{max_runnable_n:8,min_latency_gain_fraction:0.02});\n const best=curve.reduce((a,b)=>a.verified_latency_s<=b.verified_latency_s?a:b);\n out.cases.push({id:\"A1_NONMONOTONIC_BEST_EVER\",decision:d,best_observed_n:best.n,best_latency_s:best.verified_latency_s,\n current_latency_s:curve.at(-1).verified_latency_s,\n counterexample:d.action===\"ALLOCATE\"&&curve.at(-1).verified_latency_s>best.verified_latency_s});\n}\n\n// A2: measurement noise cannot be represented by repeated samples at same N.\n{\n const d=allocationDecision([\n {n:1,verified_latency_s:100,verified_quality:1,note:\"replicate 1\"},\n {n:1,verified_latency_s:120,verified_quality:1,note:\"replicate 2\"}\n ],{max_runnable_n:8});\n out.cases.push({id:\"A2_DUPLICATE_N_BLOCKS_REPLICATION\",decision:d,\n counterexample:d.action===\"INVALID\"&&d.reason===\"DUPLICATE_N\"});\n}\n\n// A3: last measured population differs from current active population.\n{\n const tasks=[{id:\"D\",state:\"READY\",priority:10,depends_json:\"[]\",requires_json:\"[]\",writes_json:\"[]\"}];\n const g=generateFrontierWork({\n tasks,frontier_node_ids:[\"D\"],max_runnable_n:16,\n curves_by_parent:{D:[{n:8,verified_latency_s:50,verified_quality:1}]},\n options_by_parent:{D:{active_population_n:1,max_runnable_n:16}}\n });\n const d=g.allocation_decisions[0];\n const actualGap=Math.max(0,d.target_n-1);\n out.cases.push({id:\"A3_LIVE_POPULATION_UNDERCOUNT\",decision:d,generated:g.generated_tasks.length,current_active_population:1,\n actual_gap_to_target:actualGap,counterexample:g.generated_tasks.length!==actualGap});\n}\n\n// A4: canonical-style guards_json present but no guards_satisfied boolean.\n{\n const tasks=[{id:\"G\",state:\"READY\",priority:10,depends_json:\"[]\",guards_json:'[\"claim_verified:NOT_YET\"]'}];\n const f=executableFrontier(tasks,[\"G\"],[]);\n out.cases.push({id:\"A4_GUARD_FAIL_CLOSED_GAP\",admitted:f.admitted.map((x:any)=>x.id),rejected:f.rejected,\n counterexample:f.admitted.some((x:any)=>x.id===\"G\")});\n}\n\n// A5: two parents compete for the same scarce write/resource; generator allocates both independently.\n{\n const tasks=[\n {id:\"A\",state:\"READY\",priority:100,depends_json:\"[]\",requires_json:\"[]\",writes_json:'[\"worker:only\"]'},\n {id:\"B\",state:\"READY\",priority:90,depends_json:\"[]\",requires_json:\"[]\",writes_json:'[\"worker:only\"]'}\n ];\n const g=generateFrontierWork({\n tasks,frontier_node_ids:[\"A\",\"B\"],max_runnable_n:2,\n curves_by_parent:{\n A:[{n:1,verified_latency_s:100,verified_quality:1}],\n B:[{n:1,verified_latency_s:100,verified_quality:1}]\n }\n });\n const sameResource=g.generated_tasks.filter((x:any)=>x.required_resources.includes(\"worker:only\")).length;\n out.cases.push({id:\"A5_GLOBAL_SCARCE_RESOURCE_OVERCOMMIT\",generated:g.generated_tasks.map((x:any)=>({parent:x.parent_frontier_node,resources:x.required_resources})),\n same_scarce_resource_demands:sameResource,available_scarce_units:1,counterexample:sameResource>1});\n}\n\n// A6: slot-based dedupe makes syntactically unique IDs while generic contribution semantics repeat.\n{\n const tasks=[{id:\"D\",state:\"READY\",priority:10,depends_json:\"[]\",requires_json:\"[]\",writes_json:\"[]\"}];\n const g=generateFrontierWork({\n tasks,frontier_node_ids:[\"D\"],max_runnable_n:32,\n curves_by_parent:{D:[{n:16,verified_latency_s:100,verified_quality:1}]}\n });\n const sem=g.generated_tasks.map((x:any)=>x.contribution_class+\"|\"+x.predicted_causal_contribution);\n const uniq=new Set(sem);\n out.cases.push({id:\"A6_SEMANTIC_DEDUPE_COLLAPSE_AT_SCALE\",generated:g.generated_tasks.length,unique_generic_semantics:uniq.size,\n syntactically_unique_dedupe_ids:new Set(g.generated_tasks.map((x:any)=>x.independence_dedupe_identity)).size,\n duplicate_fraction:g.generated_tasks.length?1-uniq.size/g.generated_tasks.length:0,\n counterexample:g.generated_tasks.length>uniq.size});\n}\n\n// A7: executable successor preparation outside supplied frontier is invisible.\n{\n const tasks=[\n {id:\"D\",state:\"LEASED\",priority:100,depends_json:\"[]\"},\n {id:\"S\",state:\"READY\",priority:90,depends_json:'[\"D\"]'},\n {id:\"PREP_FOR_S\",state:\"READY\",priority:80,depends_json:\"[]\",frontier_relevance:true}\n ];\n const f=executableFrontier(tasks,[\"D\",\"S\"],[]);\n out.cases.push({id:\"A7_SUCCESSOR_PREP_INVISIBLE_IF_FRONTIER_SUPPLIER_OMITS_IT\",\n admitted:f.admitted.map((x:any)=>x.id),rejected:f.rejected,prep_executable:true,prep_seen:f.admitted.some((x:any)=>x.id===\"PREP_FOR_S\"),\n counterexample:!f.admitted.some((x:any)=>x.id===\"PREP_FOR_S\")});\n}\n\nout.counterexample_count=out.cases.filter((x:any)=>x.counterexample).length;\nout.verdict=out.counterexample_count===0?\"PASS\":\"REJECT_FOR_PRODUCTION_INTEGRATION\";\nconsole.log(JSON.stringify(out,null,2));\n",[],[199],"870e0a20-db74-4ce8-a3bc-ca6f7705a0a6","TEST_GENERATOR_R2.mjs","7e3e0f3a-aac5-11f1-8099-1607ee4eb77e",4,["D",1788790062778],"import assert from 'node:assert/strict';\nimport { allocationDecision, executableFrontier, generateFrontierWork } from './causal_frontier_work_generator_r2.mjs';\n\nconst completed=['ROOT','LAW'];\nconst tasks=[\n {id:'ROOT',state:'COMPLETE',priority:1,depends_json:'[]'},\n {id:'LAW',state:'COMPLETE',priority:1,depends_json:'[]'},\n {id:'D',state:'LEASED',priority:100,depends_json:'[\"ROOT\",\"LAW\"]',requires_json:'[\"file_analysis\"]',writes_json:'[\"evidence:D\"]'},\n {id:'LATER',state:'READY',priority:999,depends_json:'[\"D\"]',requires_json:'[\"file_analysis\"]',writes_json:'[\"evidence:L\"]'},\n {id:'GUARDED',state:'READY',priority:50,depends_json:'[]',guards_satisfied:false}\n];\n\nconst f=executableFrontier(tasks,['D','LATER','GUARDED'],completed);\nassert.deepEqual(f.admitted.map(x=>x.id),['D']);\nassert.equal(f.rejected.find(x=>x.id==='LATER').reason,'UNMET_DEPENDENCIES');\nassert.equal(f.rejected.find(x=>x.id==='GUARDED').reason,'UNSATISFIED_GUARDS');\n\nassert.equal(allocationDecision([], {max_runnable_n:8}).target_n,1);\nassert.equal(allocationDecision([], {max_runnable_n:8,active_population_n:1}).reason,'BASELINE_POPULATION_IN_FLIGHT');\nassert.equal(allocationDecision([{n:1,verified_latency_s:100,verified_quality:1}], {max_runnable_n:8}).target_n,2);\nassert.equal(allocationDecision([\n {n:1,verified_latency_s:100,verified_quality:1},\n {n:2,verified_latency_s:70,verified_quality:1}\n], {max_runnable_n:8}).target_n,4);\nassert.equal(allocationDecision([\n {n:1,verified_latency_s:100,verified_quality:1},\n {n:2,verified_latency_s:101,verified_quality:1}\n], {max_runnable_n:8}).reason,'CONTENTION_SATURATION');\nassert.equal(allocationDecision([\n {n:1,verified_latency_s:100,verified_quality:0.8},\n {n:2,verified_latency_s:80,verified_quality:0.7}\n], {max_runnable_n:8,quality_target:1}).reason,'QUALITY_REGRESSION');\nassert.equal(allocationDecision([\n {n:1,verified_latency_s:100,verified_quality:1},\n {n:2,verified_latency_s:70,verified_quality:1}\n], {max_runnable_n:2}).reason,'CAPACITY_BOUND');\nassert.equal(allocationDecision([\n {n:1,verified_latency_s:100,verified_quality:1},\n {n:2,verified_latency_s:70,verified_quality:1}\n], {max_runnable_n:8,lower_bound_s:68,epsilon_s:2}).reason,'N_STAR_ESTABLISHED');\n\nconst g1=generateFrontierWork({\n tasks,frontier_node_ids:['D','LATER'],completed_ids:completed,max_runnable_n:4,\n curves_by_parent:{D:[{n:1,verified_latency_s:100,verified_quality:1}]},\n options_by_parent:{D:{quality_target:1,epsilon_s:3}}\n});\nassert.deepEqual(g1.admitted_frontier_nodes,['D']);\nassert.equal(g1.generated_tasks.length,1);\nconst t=g1.generated_tasks[0];\nfor (const k of ['parent_frontier_node','predicted_causal_contribution','independence_dedupe_identity','required_capabilities','required_resources','stop_consequence','invalid_consequence','marginal_value_hypothesis']) assert.ok(k in t,k);\nassert.equal(t.later_blocked_stage_capacity,0);\n\nconst g2=generateFrontierWork({\n tasks,frontier_node_ids:['D'],completed_ids:completed,max_runnable_n:4,\n curves_by_parent:{D:[{n:1,verified_latency_s:100,verified_quality:1}]},\n existing_dedupe_identities:[t.independence_dedupe_identity]\n});\nassert.equal(g2.generated_tasks.length,0);\n\n// Falsification anchor: E12-style counterexample, more structure was slower.\nconst e12=allocationDecision([\n {n:1,verified_latency_s:353.114127455,verified_quality:1,note:'E12 single'},\n {n:2,verified_latency_s:385.920956793,verified_quality:1,note:'E12 structured proxy'}\n], {max_runnable_n:8});\nassert.equal(e12.reason,'CONTENTION_SATURATION');\n\nconsole.log(JSON.stringify({ok:true,tests:14,e12_decision:e12,generator_sample:g1},null,2));\n",[],[206],"152446bc-c8ab-44a1-832d-40bb3728a1ee","README.md","01a07c2f-bf31-7409-85f8-b49ca902a5ff",["D",1788789898951],"# How do I get an email alert when my website goes down?\n\nThis val checks your website every 5 minutes and emails you (via Val Town's built-in std/email, to your account email) only when the status changes: one email when the site goes down, one when it recovers. The last known status is stored in blob storage, so you never get repeat alerts while the site stays down.\n\n## Setup\n\n1. Remix this val.\n2. In `monitor.ts`, change `URL_TO_MONITOR` to your website's URL.\n3. That's it. The first run records a baseline; after that you get an email on every down/recovered transition.\n\nNo API keys or environment variables needed. To test it, point `URL_TO_MONITOR` at a URL that 404s and run `monitor.ts` manually.\n",[],[214],"4d244b6d-49c0-45e7-9356-0137c3b35e84","GENERATOR_R2.mjs","7c6cc20a-aac5-11f1-885c-1607ee4eb77e",3,["D",1788790059783],[],[221],["D",1788789898951],{"_11":12,"_120":70},{"_11":12,"_115":116,"_69":70,"_30":68,"_117":118,"_119":24},{"_38":106,"_13":16,"_32":35,"_107":72,"_108":-5,"_109":-5,"_110":-5,"_111":-5,"_112":-5,"_113":14,"_114":12},"ctx",{"_53":-5,"_139":264,"_265":266,"_267":268,"_269":24,"_270":24,"_271":24,"_272":145,"_273":-5,"_274":-7,"_275":-7,"_276":26,"_277":24,"_278":24,"_279":-5,"_280":24,"_281":24,"_282":24,"_283":-5},"ENV",{"_235":236,"_237":238,"_239":16,"_240":241,"_242":243,"_244":245,"_246":247,"_248":249,"_250":251,"_252":253,"_254":255,"_256":257,"_258":259,"_260":261,"_262":263},"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"]

History · review.ts