Kalshi mispricing scan

[{"_1":2,"_3":-5,"_4":-5},"loaderData",{"_5":6,"_7":8,"_9":10},"actionData","errors","root",{"_154":155,"_156":157},"routes/_app.x.$handle.$name",{"_96":95,"_32":45,"_105":86,"_27":53,"_13":14,"_106":-5,"_11":107,"_108":109,"_110":111,"_112":113,"_114":115,"_20":-5,"_116":-5,"_117":-5,"_118":25,"_119":120,"_121":58,"_122":-5,"_123":-5,"_124":125},"routes/_app.x.$handle.$name.branch.$branch.version.$version.diff",{"_11":12,"_13":14,"_15":16,"_17":-5,"_18":-5},"project",{"_43":44,"_32":45,"_38":46,"_47":-5,"_48":25,"_49":50,"_51":50,"_52":53,"_54":-5,"_18":55,"_56":31,"_57":58,"_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":25},"version",5,"changes",[19],"aiChatInfo","userId",{"_20":21,"_22":23,"_24":25,"_26":25,"_27":28,"_29":28},"file",{"_30":31,"_32":28,"_33":34,"_35":37,"_38":39,"_40":14,"_41":42,"_24":25},"previous",{"_30":31,"_32":28,"_33":34,"_35":36},"deleted",false,"deletedHere","path","main.ts","latestPath","fileId","9e7af346-9cc7-11f1-8726-1607ee4eb77e","name","fileType","http","content","// Val Town HTTP val. Create a new val, type = HTTP, paste this in, open the URL.\n//\n// Scans every open Kalshi market for ARITHMETIC mispricings -- sets of prices\n// that cannot all be right at once. It predicts nothing. Each check is an\n// identity that either holds or doesn't, so a flagged trade that fails to pay\n// is a bug in this file, not bad luck.\n\nconst FEE_COEF = 0.07;\nconst BASES = [\n \"https://api.elections.kalshi.com\",\n \"https://external-api.kalshi.com\",\n];\nconst MAX_PAGES = 6;\nconst PAGE_LIMIT = 200;\n// Sizes to price each opportunity at. Kalshi rounds its fee UP to the next\n// cent PER ORDER, so the same quote can be a loss at 1 contract and a profit\n// at 500. A single per-contract number would be meaningless.\nconst SIZES = [10, 100, 500];\nconst REFERENCE_SIZE = 100;\n\nconst ceilCents = (d) => Math.ceil(d * 100 - 1e-9) / 100;\n// Fee for ONE order of n contracts at price p.\nfunction orderFee(p, n) {\n if (p == null || !isFinite(p) || p <= 0 || p >= 1 || n <= 0) return null;\n return ceilCents(FEE_COEF * n * p * (1 - p));\n}\n\n// A quote within half a cent of 0 or 1 is almost always an unpopulated field,\n// not a real price. Left in, a spurious 0 would manufacture a huge fake arb.\nfunction px(cents, dollars) {\n const raw = dollars != null ? dollars : cents != null ? cents / 100 : null;\n if (raw == null) return null;\n const n = Number(raw);\n if (!isFinite(n)) return null;\n return n >= 0.005 && n <= 0.995 ? n : null;\n}\n\n// Price a set of legs at a given size. payoutPerContract is how many dollars\n// the whole basket is guaranteed to return per contract bought.\nfunction priceAt(legs, contracts, payoutPerContract) {\n let cost = 0, fees = 0;\n for (const l of legs) {\n cost += l.price * contracts;\n const f = orderFee(l.price, contracts);\n if (f == null) return null;\n fees += f;\n }\n const payout = payoutPerContract * contracts;\n return { cost, fees, payout, profit: payout - cost - fees, contracts };\n}\n\nfunction evaluate(legs, payoutPerContract) {\n const sized = SIZES.map((n) => priceAt(legs, n, payoutPerContract)).filter(\n Boolean,\n );\n if (!sized.length) return null;\n const ref = priceAt(legs, REFERENCE_SIZE, payoutPerContract);\n const best = sized[sized.length - 1];\n // Gross shortfall per contract, ignoring fees entirely -- shows whether the\n // book itself is tight or whether fees alone are the obstacle.\n const grossPerContract = payoutPerContract -\n legs.reduce((s, l) => s + l.price, 0);\n const profitable = sized.find((s) => s.profit > 0) || null;\n return {\n legs,\n sized,\n ref,\n best,\n grossPerContract,\n profitable,\n payoutPerContract,\n };\n}\n\nasync function fetchEvents() {\n let lastError = null;\n for (const base of BASES) {\n const out = [];\n let cursor = null, pages = 0, ok = false;\n try {\n while (pages < MAX_PAGES) {\n const url = base +\n \"/trade-api/v2/events?status=open&with_nested_markets=true&limit=\" +\n PAGE_LIMIT +\n (cursor ? \"&cursor=\" + encodeURIComponent(cursor) : \"\");\n const r = await fetch(url);\n if (!r.ok) throw new Error(\"HTTP \" + r.status);\n const j = await r.json();\n for (const e of j.events || []) out.push(e);\n ok = true;\n cursor = j.cursor;\n pages++;\n if (!cursor || !(j.events || []).length) break;\n }\n if (ok) return { events: out, pages, base, error: null };\n } catch (e) {\n lastError = String((e && e.message) || e);\n }\n }\n return {\n events: [],\n pages: 0,\n base: null,\n error: lastError || \"no Kalshi endpoint responded\",\n };\n}\n\nfunction analyse(events) {\n const found = [];\n const shortfalls = []; // cents short of free, per contract, fees included\n let markets = 0, evs = 0, exclusive = 0, rejected = 0, checked = 0;\n\n for (const e of events) {\n const ms = e.markets || [];\n if (!ms.length) continue;\n evs++;\n const rows = ms.map((m) => {\n const yesAsk = px(m.yes_ask, m.yes_ask_dollars);\n const noAsk = px(m.no_ask, m.no_ask_dollars);\n if ((m.yes_ask != null || m.yes_ask_dollars != null) && yesAsk == null) {\n rejected++;\n }\n return {\n label: m.subtitle || m.yes_sub_title || m.ticker,\n ticker: m.ticker,\n yesAsk,\n noAsk,\n volume: m.volume ?? 0,\n oi: m.open_interest ?? 0,\n };\n });\n markets += rows.length;\n\n // --- Check 1: both sides of one market. Exactly one pays $1. -----------\n for (const r of rows) {\n if (r.yesAsk == null || r.noAsk == null) continue;\n checked++;\n const ev = evaluate(\n [{ side: \"YES\", label: r.label, price: r.yesAsk }, {\n side: \"NO\",\n label: r.label,\n price: r.noAsk,\n }],\n 1,\n );\n if (!ev) continue;\n if (ev.ref) shortfalls.push(-ev.ref.profit / ev.ref.contracts);\n if (ev.profitable) {\n found.push({\n ...ev,\n kind: \"Both sides of one market\",\n conditional: false,\n title: e.title || e.event_ticker,\n sub: r.label,\n volume: r.volume,\n oi: r.oi,\n });\n }\n }\n\n // --- Checks 2 & 3: exclusive multi-outcome sets ------------------------\n if (e.mutually_exclusive && rows.length >= 2) {\n exclusive++;\n const minVol = Math.min(...rows.map((r) => r.volume));\n const minOi = Math.min(...rows.map((r) => r.oi));\n\n if (rows.every((r) => r.yesAsk != null)) {\n checked++;\n const ev = evaluate(\n rows.map((r) => ({ side: \"YES\", label: r.label, price: r.yesAsk })),\n 1,\n );\n if (ev && ev.profitable) {\n found.push({\n ...ev,\n kind: \"Buy every outcome (YES)\",\n conditional: true,\n title: e.title || e.event_ticker,\n sub: `${rows.length} outcomes`,\n volume: minVol,\n oi: minOi,\n });\n }\n }\n if (rows.every((r) => r.noAsk != null)) {\n checked++;\n const ev = evaluate(\n rows.map((r) => ({ side: \"NO\", label: r.label, price: r.noAsk })),\n rows.length - 1,\n );\n if (ev && ev.profitable) {\n found.push({\n ...ev,\n kind: \"Buy every outcome (NO)\",\n conditional: false,\n title: e.title || e.event_ticker,\n sub: `${rows.length} outcomes, at least ${\n rows.length - 1\n } must pay`,\n volume: minVol,\n oi: minOi,\n });\n }\n }\n }\n }\n\n found.sort((a, b) => b.best.profit - a.best.profit);\n shortfalls.sort((a, b) => a - b);\n return { found, shortfalls, markets, evs, exclusive, rejected, checked };\n}\n\nconst money = (d) => (d < 0 ? \"\\u2212$\" : \"$\") + Math.abs(d).toFixed(2);\nconst cts = (d) =>\n (d < 0 ? \"\\u2212\" : \"\") + Math.abs(d * 100).toFixed(2) + \"\\u00A2\";\nconst esc = (s) =>\n String(s).replace(\n /[&<>\"]/g,\n (m) => ({ \"&\": \"&\", \"<\": \"<\", \">\": \">\", '\"': \""\" }[m]),\n );\n\nexport default async function (req) {\n const t0 = Date.now();\n const { events, pages, base, error } = await fetchEvents();\n const a = analyse(events);\n const secs = ((Date.now() - t0) / 1000).toFixed(1);\n\n const tightest = a.shortfalls.length ? a.shortfalls[0] : null;\n const median = a.shortfalls.length\n ? a.shortfalls[Math.floor(a.shortfalls.length / 2)]\n : null;\n\n // Histogram of how far each book sits from free, in cents.\n const BUCKETS = [0, 2, 4, 6, 8, 12, 20, Infinity];\n const counts = new Array(BUCKETS.length - 1).fill(0);\n for (const s of a.shortfalls) {\n const c = s * 100;\n for (let i = 0; i < counts.length; i++) {\n if (c < BUCKETS[i + 1]) {\n counts[i]++;\n break;\n }\n }\n }\n const maxCount = Math.max(...counts, 1);\n\n const tradeCard = (f) => `\n

\n ${esc(f.kind)}\n ${f.conditional ? `conditional` : \"\"}\n

${esc(f.title)}

${esc(f.sub)}

\n\n

\n ${\n f.legs.map((l) =>\n `

${l.side}${\n esc(l.label)\n }${cts(l.price)}

`\n ).join(\"\")\n }\n

\n\n \n \n ${\n f.sized.map((s) =>\n ` 0 ? \"win\" : \"lose\"}\">\n \n \n \n \n \n `\n ).join(\"\")\n }\n

	cost	fees	returns	profit
${s.contracts}×	${money(s.cost)}	${money(s.fees)}	${money(s.payout)}	${money(s.profit)}

\n\n

\n Before fees the basket is ${\n cts(f.grossPerContract)\n } from free per contract.\n ${\n f.profitable\n ? `Turns profitable at ${f.profitable.contracts} contracts.`\n : \"\"\n }\n ${\n f.volume === 0\n ? `No traded volume \\u2014 the quote may not be fillable at any size.`\n : `Volume ${f.volume.toLocaleString()}, open interest ${f.oi.toLocaleString()} \\u2014 neither is depth at the touch.`\n }\n

`;\n\n const html = `\n\nKalshi mispricing scan\n

\n\n ${error ? `

Couldn't reach Kalshi: ${esc(error)}

` : \"\"}\n\n

${\n a.found.length === 0\n ? \"No arbitrage\"\n : a.found.length +\n (a.found.length === 1 ? \" opportunity\" : \" opportunities\")\n }

${\n a.found.length === 0\n ? `Every price set checked is internally consistent once fees are counted. That's the expected result \\u2014 and a clean one, because this test can't produce false positives.`\n : `Best returns ${money(a.found[0].best.profit)} on ${\n a.found[0].best.contracts\n } contracts. Check depth before acting \\u2014 a quote is not a fill.`\n }

${a.checked.toLocaleString()} checks \\u00B7 ${a.markets.toLocaleString()} markets \\u00B7 ${a.evs.toLocaleString()} events \\u00B7 ${secs}s

\n\n ${\n a.found.length\n ? `

The trades${\n a.found.map(tradeCard).join(\"\")\n }

`\n : \"\"\n }\n\n

\n How close does it get?\n

${\n tightest != null && tightest < 0\n ? \"Best \\u2014 past free by\"\n : \"Tightest \\u2014 short of free by\"\n }

${tightest != null ? cts(Math.abs(tightest)) : \"\\u2014\"}

Median \\u2014 short of free by

${\n median != null ? cts(median) : \"\\u2014\"\n }

\n ${\n counts.map((c, i) =>\n `

`\n ).join(\"\")\n }\n

${\n BUCKETS.slice(0, -1).map((b, i) =>\n `${BUCKETS[i + 1] === Infinity ? b + \"+\" : b}`\n ).join(\"\")\n }

Cents short of free per contract, fees included, across every two-sided check. The leftmost bucket includes anything at or past zero, i.e. the arbitrages above. At mid-range prices fees alone cost about 3.5\\u00A2, so the amber buckets are the only ones where fees could plausibly be the sole obstacle \\u2014 if the distribution sits well right of those, the books themselves are wide and no fee change would help.

\n\n

\n What was checked\n \n \n \n \n \n \n

Both sides of one market Buy YES and NO on the same contract. Exactly one pays $1. Unconditional.	${a.markets.toLocaleString()} markets
Buy every outcome, NO side At most one outcome wins, so at least N\\u22121 of the NOs pay. Needs only exclusivity, which Kalshi states.	${a.exclusive.toLocaleString()} sets
Buy every outcome, YES side Pays only if a listed outcome actually happens. mutually_exclusive does not mean exhaustive \\u2014 a candidate field with no \"other\" bucket can pay nothing. Flagged conditional.	${a.exclusive.toLocaleString()} sets
Quotes discarded Prices within half a cent of 0 or 100 \\u2014 almost always an unpopulated field. Left in, they would invent enormous fake arbitrages.	${a.rejected.toLocaleString()}
Not checked: depth Whether any size is available at the quoted price. This is the gap most likely to turn a finding here into nothing.	\\u2014

\n\n

Prices are asks \\u2014 what you'd pay to take. Fees are computed per order at each size using Kalshi's round-up-to-the-cent rule, which is why the same quote can lose money at 10 contracts and make it at 500; ${FEE_COEF} \\u00D7 contracts \\u00D7 P \\u00D7 (1\\u2212P) is their published shape but worth re-checking, since it alone decides whether a finding is real. ${pages} page${\n pages === 1 ? \"\" : \"s\"\n } fetched, capped at ${MAX_PAGES}, so this is a large sample of open markets rather than certainly all of them.

\n\n

`;\n\n return new Response(html, {\n headers: {\n \"content-type\": \"text/html; charset=utf-8\",\n \"cache-control\": \"no-store\",\n },\n });\n}","// Val Town HTTP val. Create a new val, type = HTTP, paste this in, open the URL.\n//\n// Scans every open Kalshi market for ARITHMETIC mispricings -- sets of prices\n// that cannot all be right at once. It predicts nothing. Each check is an\n// identity that either holds or doesn't, so a flagged trade that fails to pay\n// is a bug in this file, not bad luck.\n\nconst FEE_COEF = 0.07;\nconst BASES = [\"https://api.elections.kalshi.com\", \"https://external-api.kalshi.com\"];\nconst MAX_PAGES = 6;\nconst PAGE_LIMIT = 200;\n// Sizes to price each opportunity at. Kalshi rounds its fee UP to the next\n// cent PER ORDER, so the same quote can be a loss at 1 contract and a profit\n// at 500. A single per-contract number would be meaningless.\nconst SIZES = [10, 100, 500];\nconst REFERENCE_SIZE = 100;\n// An EXHAUSTIVE set's YES prices must sum to about 100c -- some listed\n// outcome has to happen. A sum far below that is not a mispricing, it is\n// PROOF the set is not exhaustive: the market is pricing a large chance that\n// none of the listed outcomes occurs. \"What will be the 51st state\" summed to\n// 14c, meaning an ~86% chance of nothing happening; buying every YES there\n// loses the entire stake in the likely case. A genuine exhaustive-set arb\n// lands near 90-99c, so anything under this floor is discarded outright.\nconst EXHAUSTIVE_MIN_SUM = 0.85;\n\nconst ceilCents = (d) => Math.ceil(d * 100 - 1e-9) / 100;\n// Fee for ONE order of n contracts at price p.\nfunction orderFee(p, n) {\n if (p == null || !isFinite(p) || p <= 0 || p >= 1 || n <= 0) return null;\n return ceilCents(FEE_COEF * n * p * (1 - p));\n}\n\n// A quote within half a cent of 0 or 1 is almost always an unpopulated field,\n// not a real price. Left in, a spurious 0 would manufacture a huge fake arb.\nfunction px(cents, dollars) {\n const raw = dollars != null ? dollars : cents != null ? cents / 100 : null;\n if (raw == null) return null;\n const n = Number(raw);\n if (!isFinite(n)) return null;\n return n >= 0.005 && n <= 0.995 ? n : null;\n}\n\n// Price a set of legs at a given size. payoutPerContract is how many dollars\n// the whole basket is guaranteed to return per contract bought.\nfunction priceAt(legs, contracts, payoutPerContract) {\n let cost = 0, fees = 0;\n for (const l of legs) {\n cost += l.price * contracts;\n const f = orderFee(l.price, contracts);\n if (f == null) return null;\n fees += f;\n }\n const payout = payoutPerContract * contracts;\n return { cost, fees, payout, profit: payout - cost - fees, contracts };\n}\n\nfunction evaluate(legs, payoutPerContract) {\n const sized = SIZES.map((n) => priceAt(legs, n, payoutPerContract)).filter(Boolean);\n if (!sized.length) return null;\n const ref = priceAt(legs, REFERENCE_SIZE, payoutPerContract);\n const best = sized[sized.length - 1];\n // Gross shortfall per contract, ignoring fees entirely -- shows whether the\n // book itself is tight or whether fees alone are the obstacle.\n const grossPerContract = payoutPerContract - legs.reduce((s, l) => s + l.price, 0);\n const profitable = sized.find((s) => s.profit > 0) || null;\n return { legs, sized, ref, best, grossPerContract, profitable, payoutPerContract };\n}\n\nasync function fetchEvents() {\n let lastError = null;\n for (const base of BASES) {\n const out = [];\n let cursor = null, pages = 0, ok = false;\n try {\n while (pages < MAX_PAGES) {\n const url =\n base + \"/trade-api/v2/events?status=open&with_nested_markets=true&limit=\" + PAGE_LIMIT +\n (cursor ? \"&cursor=\" + encodeURIComponent(cursor) : \"\");\n const r = await fetch(url);\n if (!r.ok) throw new Error(\"HTTP \" + r.status);\n const j = await r.json();\n for (const e of j.events || []) out.push(e);\n ok = true;\n cursor = j.cursor;\n pages++;\n if (!cursor || !(j.events || []).length) break;\n }\n if (ok) return { events: out, pages, base, error: null };\n } catch (e) {\n lastError = String((e && e.message) || e);\n }\n }\n return { events: [], pages: 0, base: null, error: lastError || \"no Kalshi endpoint responded\" };\n}\n\nfunction analyse(events) {\n const found = []; // unconditional -- the money is there if depth is\n const conditional = []; // needs you to confirm the outcome list is complete\n const longshots = []; // rejected: low YES sum proves the set isn't exhaustive\n const shortfalls = []; // cents short of free, per contract, fees included\n let markets = 0, evs = 0, exclusive = 0, rejected = 0, checked = 0;\n\n for (const e of events) {\n const ms = e.markets || [];\n if (!ms.length) continue;\n evs++;\n const rows = ms.map((m) => {\n const yesAsk = px(m.yes_ask, m.yes_ask_dollars);\n const noAsk = px(m.no_ask, m.no_ask_dollars);\n if ((m.yes_ask != null || m.yes_ask_dollars != null) && yesAsk == null) rejected++;\n return {\n label: m.subtitle || m.yes_sub_title || m.ticker,\n ticker: m.ticker, yesAsk, noAsk,\n volume: m.volume ?? 0, oi: m.open_interest ?? 0,\n };\n });\n markets += rows.length;\n\n // --- Check 1: both sides of one market. Exactly one pays $1. -----------\n for (const r of rows) {\n if (r.yesAsk == null || r.noAsk == null) continue;\n checked++;\n const ev = evaluate(\n [{ side: \"YES\", label: r.label, price: r.yesAsk }, { side: \"NO\", label: r.label, price: r.noAsk }],\n 1\n );\n if (!ev) continue;\n if (ev.ref) shortfalls.push(-ev.ref.profit / ev.ref.contracts);\n if (ev.profitable) {\n found.push({ ...ev, kind: \"Both sides of one market\", conditional: false,\n title: e.title || e.event_ticker, sub: r.label, volume: r.volume, oi: r.oi });\n }\n }\n\n // --- Checks 2 & 3: exclusive multi-outcome sets ------------------------\n if (e.mutually_exclusive && rows.length >= 2) {\n exclusive++;\n const minVol = Math.min(...rows.map((r) => r.volume));\n const minOi = Math.min(...rows.map((r) => r.oi));\n\n if (rows.every((r) => r.yesAsk != null)) {\n checked++;\n const yesSum = rows.reduce((s2, r) => s2 + r.yesAsk, 0);\n const ev = evaluate(rows.map((r) => ({ side: \"YES\", label: r.label, price: r.yesAsk })), 1);\n if (ev && ev.profitable) {\n if (yesSum >= EXHAUSTIVE_MIN_SUM) {\n conditional.push({ ...ev, kind: \"Buy every outcome (YES)\", conditional: true, yesSum,\n title: e.title || e.event_ticker, sub: `${rows.length} outcomes`, volume: minVol, oi: minOi });\n } else {\n // Not a finding at all. The low sum proves the set isn't exhaustive.\n longshots.push({ title: e.title || e.event_ticker, legs: rows.length, yesSum });\n }\n }\n }\n if (rows.every((r) => r.noAsk != null)) {\n checked++;\n const ev = evaluate(rows.map((r) => ({ side: \"NO\", label: r.label, price: r.noAsk })), rows.length - 1);\n if (ev && ev.profitable) {\n found.push({ ...ev, kind: \"Buy every outcome (NO)\", conditional: false,\n title: e.title || e.event_ticker, sub: `${rows.length} outcomes, at least ${rows.length - 1} must pay`,\n volume: minVol, oi: minOi });\n }\n }\n }\n }\n\n found.sort((a, b) => b.best.profit - a.best.profit);\n conditional.sort((a, b) => b.best.profit - a.best.profit);\n longshots.sort((a, b) => a.yesSum - b.yesSum);\n shortfalls.sort((a, b) => a - b);\n return { found, conditional, longshots, shortfalls, markets, evs, exclusive, rejected, checked };\n}\n\nconst money = (d) => (d < 0 ? \"\\u2212$\" : \"$\") + Math.abs(d).toFixed(2);\nconst cts = (d) => (d < 0 ? \"\\u2212\" : \"\") + Math.abs(d * 100).toFixed(2) + \"\\u00A2\";\nconst esc = (s) => String(s).replace(/[&<>\"]/g, (m) => ({ \"&\": \"&\", \"<\": \"<\", \">\": \">\", '\"': \""\" }[m]));\n\nexport default async function (req) {\n const t0 = Date.now();\n const { events, pages, base, error } = await fetchEvents();\n const a = analyse(events);\n const secs = ((Date.now() - t0) / 1000).toFixed(1);\n\n const tightest = a.shortfalls.length ? a.shortfalls[0] : null;\n const median = a.shortfalls.length ? a.shortfalls[Math.floor(a.shortfalls.length / 2)] : null;\n\n // Histogram of how far each book sits from free, in cents.\n const BUCKETS = [0, 2, 4, 6, 8, 12, 20, Infinity];\n const counts = new Array(BUCKETS.length - 1).fill(0);\n for (const s of a.shortfalls) {\n const c = s * 100;\n for (let i = 0; i < counts.length; i++) {\n if (c < BUCKETS[i + 1]) { counts[i]++; break; }\n }\n }\n const maxCount = Math.max(...counts, 1);\n\n const tradeCard = (f, isCond) => `\n

\n ${esc(f.kind)}\n ${f.conditional ? `conditional` : \"\"}\n

${esc(f.title)}

${esc(f.sub)}

","createdAt",["D",1787252255885],"branchVersion","branchId","65b424a0-1862-487b-a2eb-74837393dd5e","id","05a27522-8880-4918-9dbb-9a9150158167","Newgeneco",["D",1787251659579],"deletedAt","legacyEnvVars","privacy","public","httpPrivacy","description","","imageUrl","0d0668e7-655b-4c3f-8602-34537c20e4a8","pinnedFileId","pinPreview",true,"pinMigrated","screenshotVersion","likeCount",0,"orgId","019f8050-3a37-73e3-b02c-b23386b6c3b5","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":55,"_101":102,"_103":25},"branch",{"_13":85,"_32":86,"_43":42,"_87":44,"_88":-5,"_89":-5,"_90":-5,"_91":-5,"_92":-5,"_93":45,"_94":95},"isOwned",6,"main","projectId","forkedBranchId","forkedBranchVersion","forkedProjectPrivacy","forkedProjectId","forkedProjectOrgId","projectName","userHandle","jacksonfletcher","handle","displayName","Jackson Fletcher","avatar","https://lh3.googleusercontent.com/a/ACg8ocJMqzuUVu9STAa6peNRYaFwCk02iTiYv5A5jX7kptevo5AyGvMW=s96-c","tier","pro","canRestrictVals","profileImageUrl","branchName","adoptOrgId",{"_43":44,"_32":45,"_38":150,"_47":-5,"_48":25,"_49":50,"_51":50,"_52":53,"_54":-5,"_18":55,"_56":31,"_57":58,"_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":151,"_80":152,"_82":153,"_84":25},"tree",[145],"files",[145],"counts",{"_134":62,"_135":136,"_137":62,"_138":139,"_140":141},"contents",[126],"upstreamProject","upstreamBranch","emptyEnvVars","flags",[],"hasHttpFiles","grants","orgs","customDomains",{},{"_43":127,"_32":28,"_30":31,"_128":-5,"_41":42,"_40":14,"_129":25,"_38":130,"_13":131,"_33":34,"_35":37,"_24":25,"_132":-5,"_27":133},"da811a29-c019-40dd-82ee-f2da5ba55039","parentId","latest",["D",1787252255885],4,"label",[28],"pulls","branches",1,"forks","envVars",{"_142":62,"_144":62},"connections",{"_142":62,"_143":62},"count","unfilledCount","emptyCount",{"_43":127,"_32":28,"_30":31,"_128":-5,"_41":42,"_40":14,"_129":25,"_38":146,"_13":131,"_33":34,"_35":37,"_24":25,"_132":-5,"_147":148,"_27":149},["D",1787252255885],"children",[],[28],["D",1787251659579],{"_96":95,"_104":100},{"_96":95,"_97":98,"_99":100,"_18":55,"_101":102,"_103":25},{"_13":85,"_32":86,"_43":42,"_87":44,"_88":-5,"_89":-5,"_90":-5,"_91":-5,"_92":-5,"_93":45,"_94":95},"ctx",{"_78":-5,"_123":187,"_188":189,"_190":191,"_192":25,"_193":25,"_194":25,"_195":58,"_196":-5,"_197":-7,"_198":-7,"_199":62,"_200":25,"_201":25,"_202":-5,"_203":25,"_204":25,"_205":25,"_206":-5},"ENV",{"_158":159,"_160":161,"_162":86,"_163":164,"_165":166,"_167":168,"_169":170,"_171":172,"_173":174,"_175":176,"_177":178,"_179":180,"_181":182,"_183":184,"_185":186},"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 · v5