> ## Documentation Index > Fetch the complete documentation index at: https://docs.tensormesh.ai/llms.txt > Use this file to discover all available pages before exploring further. # Cache Sizing > Paste a chronological trace of token-id requests and simulate the cache hit rate you would get at any L1/L2 capacity, in tokens and bytes. export const CacheSizingCalculator = () => { const DEFAULT_TRACE = JSON.stringify([ [1, 2, 3, 4, 5, 6, 7, 8, 101, 102], [1, 2, 3, 4, 5, 6, 7, 8, 201, 202, 203], [1, 2, 3, 4, 5, 6, 7, 8, 101, 102], [1, 2, 3, 4, 5, 6, 7, 8, 301], [50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65], [1, 2, 3, 4, 5, 6, 7, 8, 101, 102], [1, 2, 3, 4, 5, 6, 7, 8, 201, 202, 203], [70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81], [1, 2, 3, 4, 5, 6, 7, 8, 401, 402], ]); const [traceText, setTraceText] = useState(DEFAULT_TRACE); const [l1Tokens, setL1Tokens] = useState(12); const [l2Tokens, setL2Tokens] = useState(18); const [bytesPerToken, setBytesPerToken] = useState("131072"); function hashA(prev, s) { let h = prev; for (let i = 0; i < s.length; i++) h = (h * 131 + s.charCodeAt(i)) % 2147483647; return h; } function hashB(prev, s) { let h = prev; for (let i = 0; i < s.length; i++) h = (h * 137 + s.charCodeAt(i)) % 2147483629; return h; } const analysis = useMemo(() => { const t = traceText.trim(); if (!t) return { empty: true }; let requests; try { requests = JSON.parse(t); } catch (e) { return { error: String(e.message || e) }; } if (!Array.isArray(requests)) return { error: "Trace must be a JSON array of token-id arrays." }; const reqTok = []; for (const r of requests) { const tok = Array.isArray(r) ? r : r && Array.isArray(r.tokens) ? r.tokens : null; if (!tok) return { error: "Each request must be an array of token ids, e.g. [1, 2, 3]." }; reqTok.push(tok); } if (!reqTok.length) return { empty: true }; const CAP = 200000; let n = 0; let truncated = false; const used = []; for (const tk of reqTok) { used.push(tk); n = n + tk.length; if (n >= CAP) { truncated = true; break; } } const N = Math.min(n, CAP); if (N === 0) return { empty: true }; const bit = new Array(N + 1).fill(0); function add(i, v) { for (; i <= N; i = i + (i & (-i))) bit[i] = bit[i] + v; } function pre(i) { let s = 0; for (; i > 0; i = i - (i & (-i))) s = s + bit[i]; return s; } const lastSeen = new Map(); const required = []; let cold = 0; let step = 0; for (const tk of used) { let a = 16777619; let b = 2166136261 % 2000000011; for (let j = 0; j < tk.length; j++) { const enc = String(tk[j]) + ","; a = hashA(a, enc); b = hashB(b, enc); step = step + 1; if (step > N) break; const key = a + "_" + b; const prev = lastSeen.get(key); if (prev === undefined) { cold = cold + 1; } else { required.push(pre(step - 1) - pre(prev) + 1); add(prev, -1); } add(step, 1); lastSeen.set(key, step); } if (step > N) break; } required.sort((x, y) => x - y); const working = lastSeen.size; const maxD = required.length ? required[required.length - 1] : working; return { requests: reqTok.length, total: step, cold: cold, required: required, working: working, maxD: maxD, truncated: truncated, }; }, [traceText]); const pct = (n, d) => (d ? ((100 * n) / d).toFixed(1) : "0.0"); const fmtTok = (x) => { const v = Math.round(x); if (v >= 1000000) return (v / 1000000).toFixed(1) + "M"; if (v >= 1000) return (v / 1000).toFixed(1) + "K"; return String(v); }; const fmtBytes = (n) => { if (n >= 1073741824) return (n / 1073741824).toFixed(2) + " GB"; if (n >= 1048576) return (n / 1048576).toFixed(1) + " MB"; if (n >= 1024) return (n / 1024).toFixed(1) + " KB"; return Math.round(n) + " B"; }; const bpt = Number(bytesPerToken) || 0; const bytesSuffix = (tokens) => (bpt > 0 ? " · " + fmtBytes(tokens * bpt) : ""); const countLE = (arr, c) => { let lo = 0; let hi = arr.length; while (lo < hi) { const mid = Math.floor((lo + hi) / 2); if (arr[mid] <= c) lo = mid + 1; else hi = mid; } return lo; }; const ready = analysis.required && analysis.total > 0; const splits = ready ? (() => { const l1 = countLE(analysis.required, l1Tokens); const l2 = countLE(analysis.required, l1Tokens + l2Tokens) - l1; const miss = analysis.required.length - l1 - l2 + analysis.cold; return { l1: l1, l2: l2, miss: miss, total: analysis.total }; })() : null; const maxCap = ready ? Math.max(analysis.maxD, l1Tokens + l2Tokens, 8) * 1.1 : 1; const curvePts = ready ? (() => { const N = 120; const pts = []; for (let i = 0; i <= N; i++) { const cap = (maxCap * i) / N; pts.push({ cap: cap, hit: countLE(analysis.required, cap) / analysis.total }); } return pts; })() : []; const sliderMax = Math.max(8, Math.ceil(maxCap)); const sStep = Math.max(1, Math.round(sliderMax / 200)); const W = 640; const H = 240; const PL = 48; const PR = 16; const PT = 14; const PB = 34; const xAt = (cap) => PL + (cap / maxCap) * (W - PL - PR); const yAt = (h) => PT + (1 - h) * (H - PT - PB); const l1x = xAt(l1Tokens); const l2x = xAt(l1Tokens + l2Tokens); const linePts = curvePts.map((p) => xAt(p.cap).toFixed(1) + "," + yAt(p.hit).toFixed(1)).join(" "); const hitAt = (c) => (ready ? countLE(analysis.required, c) / analysis.total : 0); const box = { border: "1px solid #e5e7eb", borderRadius: 12, padding: 16 }; const label = { fontSize: 13, fontWeight: 600, display: "block", marginBottom: 4 }; const ctrl = { width: "100%", padding: "6px 8px", borderRadius: 8, border: "1px solid #d1d5db", fontSize: 14, boxSizing: "border-box" }; const colors = { l1: "#10b981", l2: "#f59e0b", miss: "#9ca3af" }; return (
Trace — ordered list of token-id requests