{ "schemaVersion": 3, "runId": "824cda9a-438d-49bb-a9fa-b581e95e2b65", "fixtureIds": [ "gmod.ents-iterator.v1", "gmod.hook-add.v1", "gmod.isvalid.v1", "gmod.net-receivers.v1", "gmod.perf.angle-zero.v1", "gmod.perf.config-var.v1", "gmod.perf.darkrpvar.v1", "gmod.perf.disttosqr.v1", "gmod.perf.ents-iterator.v1", "gmod.perf.find-ents-near.v1", "gmod.perf.find-players-near.v1", "gmod.perf.for-vs-while.v1", "gmod.perf.hook-once.v1", "gmod.perf.hudpaint-cache.v1", "gmod.perf.local-color.v1", "gmod.perf.local-vs-global.v1", "gmod.perf.localplayer-cache.v1", "gmod.perf.looking-at.v1", "gmod.perf.meta-vs-arg.v1", "gmod.perf.msg-vs-print.v1", "gmod.perf.pairs-ipairs-for.v1", "gmod.perf.plain-lua-vs-fn.v1", "gmod.perf.player-cache-hooks.v1", "gmod.perf.ply-table-index.v1", "gmod.perf.seq-tables.v1", "gmod.perf.setdrawcolor-split.v1", "gmod.perf.sqlite-vs-mysql.v1", "gmod.perf.steamid-cache.v1", "gmod.perf.string-table-concat.v1", "gmod.perf.surface-drawrect.v1", "gmod.perf.surface-text.v1", "gmod.perf.table-count-hash.v1", "gmod.perf.table-empty.v1", "gmod.perf.table-hasvalue.v1", "gmod.perf.table-literal.v1", "gmod.perf.table-random.v1", "gmod.perf.x-times-x.v1", "gmod.player-iterator.v1" ], "startedAt": "2026-07-10T17:51:16.279Z", "completedAt": "2026-07-10T17:58:59.308Z", "repeat": 1, "concurrency": 15, "attempts": [ { "fixtureId": "gmod.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nfor ent in ents.Iterator() do\n if ent:GetClass() == \"prop_physics\" then\n -- do something with ent\n end\nend\n```\n\nReason: `ents.Iterator()` yields each entity one at a time via an iterator function, so no intermediate table is allocated — the class check is applied inline per entity.", "durationMs": 17632, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "3990c92253db85bb", "usage": { "source": "provider", "promptTokens": 20306, "completionTokens": 76, "totalTokens": 22367, "reasoningTokens": 193, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:51:16.281Z", "completedAt": "2026-07-10T17:51:33.922Z", "answerBytes": 304, "answerChars": 302, "exitCode": 0 }, { "fixtureId": "gmod.hook-add.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attemptIndex": 1, "status": "pass", "detail": "Registers a named hook with hook.Add.", "finalResponse": "```lua\nhook.Add(\"Think\", \"MyAddon.Think\", function()\nend)\n```\n\nReason: `hook.Add(hookName, identifier, func)` registers a callback; `\"Think\"` fires every frame and `\"MyAddon.Think\"` is the unique ID to prevent duplicates.", "durationMs": 13521, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "12d2222fdb7d6b90", "usage": { "source": "provider", "promptTokens": 21075, "completionTokens": 61, "totalTokens": 22207, "reasoningTokens": 47, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:51:16.282Z", "completedAt": "2026-07-10T17:51:29.805Z", "answerBytes": 221, "answerChars": 221, "exitCode": 0 }, { "fixtureId": "gmod.isvalid.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attemptIndex": 1, "status": "pass", "detail": "Uses IsValid for entity/object validity.", "finalResponse": "```lua\nif not IsValid(ent) then return end\n```\n\nReason: `IsValid` returns `false` for NULL/removed entities before you index or method-call on them, preventing script errors.", "durationMs": 10447, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "35527312e59dfc13", "usage": { "source": "provider", "promptTokens": 20305, "completionTokens": 44, "totalTokens": 22181, "reasoningTokens": 40, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:51:16.282Z", "completedAt": "2026-07-10T17:51:26.794Z", "answerBytes": 174, "answerChars": 174, "exitCode": 0 }, { "fixtureId": "gmod.net-receivers.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nnet.Receive(\"MyAddon.Sync\", function(len)\n -- handle the incoming message here\nend)\n```\n\nReason: `net.Receive` is the Garry's Mod Lua API for registering a callback that fires when a named net message arrives from the server or client.", "durationMs": 12416, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "24d54ee8366753a6", "usage": { "source": "provider", "promptTokens": 20301, "completionTokens": 60, "totalTokens": 22187, "reasoningTokens": 34, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:51:16.282Z", "completedAt": "2026-07-10T17:51:28.745Z", "answerBytes": 243, "answerChars": 243, "exitCode": 0 }, { "fixtureId": "gmod.perf.angle-zero.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must begin its reason with Reason:", "finalResponse": "```lua\n-- Reuse a pre-zeroed sentinel instead of constructing Angle(0,0,0) every call\nlocal ANGLE_ZERO = Angle(0, 0, 0)\n\n-- In the hot path:\nlocal ang = ANGLE_ZERO -- cheap reference copy; do NOT mutate this\n-- or if you need a mutable clone for local tweaks:\nlocal ang = ANGLE_ZERO --[[ reuse pattern: just read from it ]]\n\n-- Constructing a new Angle() each frame allocates and GCs needlessly.\n-- Storing a local copy avoids the per-call allocation:\nlocal ang = ANGLE_ZERO\nang.p, ang.y, ang.r = 0, 0, 0 -- reset if you must mutate\n\n-- Fastest idiom for \"I need a zeroed Angle right now\":\nlocal ang = Angle() -- engine may pool; still heavier than reuse\n-- vs:\nlocal ang = ANGLE_ZERO -- single upvalue read, zero GC pressure\n```\n\n**Reason:** `Angle()` allocates a new userdata on the Lua heap every call, creating GC pressure; a module-scope `local ANGLE_ZERO = Angle(0,0,0)` is a single cheap upvalue read with zero allocation cost, making it significantly faster in hot paths.", "durationMs": 13705, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f6bc97bf98280d62", "usage": { "source": "provider", "promptTokens": 20304, "completionTokens": 266, "totalTokens": 22385, "reasoningTokens": 23, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:51:16.282Z", "completedAt": "2026-07-10T17:51:30.020Z", "answerBytes": 979, "answerChars": 979, "exitCode": 0 }, { "fixtureId": "gmod.perf.config-var.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attemptIndex": 1, "status": "incorrect", "detail": "Matched an incorrect-answer pattern.", "finalResponse": "```lua\nlocal myColor = myaddon.config.color\nprint(myColor)\n```\nReason: local variable lookup is faster than repeated table indexing.", "durationMs": 14616, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "bcc4ff8eb162b699", "usage": { "source": "provider", "promptTokens": 20314, "completionTokens": 33, "totalTokens": 22474, "reasoningTokens": 335, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:51:16.282Z", "completedAt": "2026-07-10T17:51:30.937Z", "answerBytes": 132, "answerChars": 132, "exitCode": 0 }, { "fixtureId": "gmod.perf.darkrpvar.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal jobName = ply:getDarkRPVar(\"job\")\n```\n\nReason: `ply:getDarkRPVar(\"job\")` is the canonical DarkRP API that reads the server-synchronized job name, while `ply:GetNWString(\"job\")` depends on an internal NW string key that may be unset, overridden, or break across DarkRP versions.", "durationMs": 15100, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "02a37daa699cded3", "usage": { "source": "provider", "promptTokens": 20311, "completionTokens": 78, "totalTokens": 22213, "reasoningTokens": 32, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:51:16.282Z", "completedAt": "2026-07-10T17:51:31.462Z", "answerBytes": 290, "answerChars": 290, "exitCode": 0 }, { "fixtureId": "gmod.perf.disttosqr.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain exactly one fenced code block followed by a reason.", "finalResponse": "`Vector:DistToSqr(other)` is preferred over `Vector:Distance(other)` because it avoids the `sqrt` call. Square your threshold and compare.\n\n```lua\nlocal function isWithinThreshold(a, b, threshold)\n return a:DistToSqr(b) < threshold * threshold\nend\n```\n\nReason: `DistToSqr` avoids an unnecessary square root, which is the idiomatic GMod approach for threshold checks.", "durationMs": 11937, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "a5772470c6859cdc", "usage": { "source": "provider", "promptTokens": 20307, "completionTokens": 95, "totalTokens": 22244, "reasoningTokens": 50, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:51:16.282Z", "completedAt": "2026-07-10T17:51:28.270Z", "answerBytes": 367, "answerChars": 367, "exitCode": 0 }, { "fixtureId": "gmod.perf.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nfor _, ent in ipairs(ents.GetAll()) do\n -- ...\nend\n```\n\nReason: `ents.GetAll()` returns a pre-built array, avoiding the overhead of `ipairs(ents.FindByClass(\"*\"))` or repeated `Entity(i)` calls, and is the wiki-recommended approach for iterating every entity.", "durationMs": 9575, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "306d3f1d05f28246", "usage": { "source": "provider", "promptTokens": 20307, "completionTokens": 71, "totalTokens": 22201, "reasoningTokens": 31, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:51:16.282Z", "completedAt": "2026-07-10T17:51:25.943Z", "answerBytes": 269, "answerChars": 269, "exitCode": 0 }, { "fixtureId": "gmod.perf.find-ents-near.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain exactly one fenced code block followed by a reason.", "finalResponse": "\n\n```lua\nlocal ents = ents.FindInSphere(ply:GetPos(), 512)\n```\n\nReason: Ents.FindInSphere uses a simple spatial hash lookup in the engine with early-out bounding sphere culling and avoids PVS/camera state dependency, making it consistently faster than FindInBox or FindByClass for small-radius queries.", "durationMs": 12744, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "07c583fc3d9fe09f", "usage": { "source": "provider", "promptTokens": 22232, "completionTokens": 72, "totalTokens": 22560, "reasoningTokens": 0, "cachedTokens": 256, "cost": 0 }, "startedAt": "2026-07-10T17:51:16.282Z", "completedAt": "2026-07-10T17:51:29.087Z", "answerBytes": 302, "answerChars": 302, "exitCode": 0 }, { "fixtureId": "gmod.perf.find-players-near.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 0 through 2 candidate loops.", "finalResponse": "```lua\n-- Fast radius player lookup: spatial hash with 64-unit cells\n-- Call once per think; reuse the table across calls to avoid GC.\nlocal CELL = 64\nlocal bucketCache = {} -- reuse across frames, clear entries not entire table\n\nlocal function BuildPlayerGrid(players)\n table.Empty(bucketCache)\n for i = 1, #players do\n local p = players[i]\n if p:Alive() then\n local pos = p:GetPos()\n local cx = math.floor(pos.x / CELL)\n local cy = math.floor(pos.y / CELL)\n local key = cx * 73856093 + cy * 19349663 -- spatial hash key\n local b = bucketCache[key]\n if not b then\n b = {}\n bucketCache[key] = b\n end\n b[#b + 1] = p\n end\n end\n return bucketCache\nend\n\nlocal function PlayersNear(pos, radius, players)\n local grid = BuildPlayerGrid(players)\n local result = {}\n local r2 = radius * radius\n local cr = math.ceil(radius / CELL)\n local cx = math.floor(pos.x / CELL)\n local cy = math.floor(pos.y / CELL)\n\n for dx = -cr, cr do\n for dy = -cr, cr do\n local key = (cx + dx) * 73856093 + (cy + dy) * 19349663\n local bucket = grid[key]\n if bucket then\n for i = 1, #bucket do\n local p = bucket[i]\n local diff = p:GetPos() - pos\n if diff:LengthSqr() <= r2 then\n result[#result + 1] = p\n end\n end\n end\n end\n end\n return result\nend\n\n-- Usage (server think or concommand):\n-- local nearby = PlayersNear(attacker:GetPos(), 512, player.GetAll())\n```\n\nReason: Spatial hashing skips `ents.FindInSphere` entirely — O(players) insert + O(cells in radius) lookup instead of O(all entities) scan, with length-squared checks replacing sqrt for the final distance gate.", "durationMs": 17327, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "d139ba2e8ee38a2f", "usage": { "source": "provider", "promptTokens": 21086, "completionTokens": 495, "totalTokens": 22634, "reasoningTokens": 29, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:51:16.282Z", "completedAt": "2026-07-10T17:51:33.680Z", "answerBytes": 1907, "answerChars": 1905, "exitCode": 0 }, { "fixtureId": "gmod.perf.for-vs-while.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal sum = 0\nfor i = 1, n do\n sum = sum + i\nend\n```\n\nReason: The numeric `for` loop is faster because its increment and bounds check are implemented in C inside the Lua VM, while a `while` loop requires explicit Lua-level assignment and comparison each iteration.", "durationMs": 12049, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "b3401a190a8aecf0", "usage": { "source": "provider", "promptTokens": 21076, "completionTokens": 73, "totalTokens": 22313, "reasoningTokens": 140, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:51:16.282Z", "completedAt": "2026-07-10T17:51:28.387Z", "answerBytes": 272, "answerChars": 272, "exitCode": 0 }, { "fixtureId": "gmod.perf.hook-once.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- FASTER: hook.Run once, iterate players inside\nhook.Run(\"GModBenchTick\", player.GetAll())\n\n-- SLOWER: hook.Run per player\nfor _, ply in ipairs(player.GetAll()) do\n hook.Run(\"GModBenchTick\", ply)\nend\n```\n\nReason: A single hook call avoids repeated hook-name lookups, argument packing, and per-call overhead that scales with player count; one iteration inside the hook is cheaper than N separate hook invocations.", "durationMs": 9980, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "ed1d3e09249fc8bb", "usage": { "source": "provider", "promptTokens": 20323, "completionTokens": 105, "totalTokens": 22245, "reasoningTokens": 25, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:51:16.282Z", "completedAt": "2026-07-10T17:51:26.302Z", "answerBytes": 423, "answerChars": 423, "exitCode": 0 }, { "fixtureId": "gmod.perf.hudpaint-cache.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nhook.Add(\"HUDPaint\", \"OptimizedHealthHUD\", function()\n local hp = LocalPlayer():Health()\n -- draw call 1 using hp\n surface.SetTextColor(255, 0, 0)\n surface.SetTextPos(50, 50)\n surface.DrawText(\"Health: \" .. hp)\n -- draw call 2 using hp\n draw.RoundedBox(4, 50, 80, hp, 20, Color(255, 0, 0))\n -- draw call 3 using hp\n surface.DrawText(\"Health: \" .. hp)\nend)\n```\n\nReason: Caching `LocalPlayer():Health()` into a local avoids two redundant method calls, table lookups, and the C→Lua bridge crossing per frame.", "durationMs": 11418, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3def450f3158ceff", "usage": { "source": "provider", "promptTokens": 20318, "completionTokens": 176, "totalTokens": 22310, "reasoningTokens": 24, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:51:16.282Z", "completedAt": "2026-07-10T17:51:27.776Z", "answerBytes": 541, "answerChars": 539, "exitCode": 0 }, { "fixtureId": "gmod.perf.local-color.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal colWhite = Color(255, 255, 255)\nfunction PANEL:Paint(w, h)\n surface.SetDrawColor(colWhite)\n surface.DrawRect(0, 0, w, h)\nend\n```\n\nReason: Hoisting the Color allocation out of the paint callback into an upvalue eliminates per-frame table creation and GC pressure.", "durationMs": 11502, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "16a7bed1b931d467", "usage": { "source": "provider", "promptTokens": 21078, "completionTokens": 85, "totalTokens": 22221, "reasoningTokens": 34, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:51:16.282Z", "completedAt": "2026-07-10T17:51:27.828Z", "answerBytes": 281, "answerChars": 281, "exitCode": 0 }, { "fixtureId": "gmod.perf.local-vs-global.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal sin = math.sin\nfor i = 1, n do\n result[i] = sin(x[i])\nend\n```\n\nReason: Caching `math.sin` as a local eliminates the two-step table lookup (`math` then `sin`) on every iteration, and locals resolve faster than globals in Lua's register-based VM.", "durationMs": 10455, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "c116d8c651190647", "usage": { "source": "provider", "promptTokens": 20305, "completionTokens": 75, "totalTokens": 22297, "reasoningTokens": 125, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:51:25.945Z", "completedAt": "2026-07-10T17:51:36.409Z", "answerBytes": 258, "answerChars": 258, "exitCode": 0 }, { "fixtureId": "gmod.perf.localplayer-cache.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal ply = LocalPlayer()\n\nfunction DoSomething()\n if not IsValid(ply) then return end\n ply:ChatPrint(\"hello\")\nend\n\nhook.Add(\"Think\", \"Example\", function()\n if not IsValid(ply) then return end\n ply:SetNWInt(\"foo\", 1)\nend)\n```\n\nReason: LocalPlayer() walks a chain each call; caching it in a local at file scope and guarding with IsValid() eliminates the repeated lookup while staying safe across disconnects.", "durationMs": 9168, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "7398105af47b079e", "usage": { "source": "provider", "promptTokens": 21081, "completionTokens": 108, "totalTokens": 22243, "reasoningTokens": 30, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:51:26.304Z", "completedAt": "2026-07-10T17:51:35.474Z", "answerBytes": 426, "answerChars": 426, "exitCode": 0 }, { "fixtureId": "gmod.perf.looking-at.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\n-- Returns true when each player's aim direction points toward the other (dot > threshold).\n-- Uses AimVec (forward) from each player; cheaper than angle calculations.\nlocal function PlayersFacingEachOther(ply1, ply2)\n local pos1, pos2 = ply1:GetPos(), ply2:GetPos()\n local dir1 = ply1:GetAimVector() -- unit forward of ply1\n local dir2 = ply2:GetAimVector() -- unit forward of ply2\n local toOther = pos2 - pos1 -- vector from 1 to 2\n\n -- Both must be pointing roughly toward the other:\n -- dir1 . (pos2-pos1) > 0 means ply1 aims toward ply2\n -- dir2 . (pos1-pos2) > 0 means ply2 aims toward ply1\n -- Threshold 0.5 ≈ ±60° cone (cos(60°) = 0.5)\n return toOther:Dot(dir1) > 0 and toOther:Dot(dir2) < 0\nend\n```\n\nReason: Two dot products with pre-computed directions replace `math.acos` and angle subtraction, staying in vector-ops only and well under a microsecond per pair.", "durationMs": 13344, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "20b22f678a4b08d7", "usage": { "source": "provider", "promptTokens": 21088, "completionTokens": 280, "totalTokens": 22424, "reasoningTokens": 32, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:51:26.796Z", "completedAt": "2026-07-10T17:51:40.142Z", "answerBytes": 948, "answerChars": 943, "exitCode": 0 }, { "fixtureId": "gmod.perf.meta-vs-arg.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attemptIndex": 1, "status": "incorrect", "detail": "Matched an incorrect-answer pattern.", "finalResponse": "```lua\n-- Preferred: local function, direct call\nlocal function SomeHelper(ply)\n -- implementation\nend\n\n-- At the call site, prefer:\nSomeHelper(ply) -- local lookup + direct call\n-- over:\nply:SomeHelper() -- metatable chain traversal + method lookup on every call\n```\n\nReason: `ply:SomeHelper()` is sugar for `ply.SomeHelper(ply)`, which forces a table/metatable lookup on the entity each call; a local function call resolves at load time and skips that chain.", "durationMs": 19671, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "de332f7356830dfa", "usage": { "source": "provider", "promptTokens": 21083, "completionTokens": 117, "totalTokens": 22618, "reasoningTokens": 394, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:51:27.780Z", "completedAt": "2026-07-10T17:51:47.456Z", "answerBytes": 472, "answerChars": 472, "exitCode": 0 }, { "fixtureId": "gmod.perf.msg-vs-print.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nMsgN( \"debug_value = \", tostring( myVar ) )\n```\n\nReason: MsgN avoids the string.format overhead that print uses internally and writes directly to the console.", "durationMs": 8312, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "6cbb4e4b2f19dd24", "usage": { "source": "provider", "promptTokens": 20306, "completionTokens": 42, "totalTokens": 22174, "reasoningTokens": 34, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:51:27.833Z", "completedAt": "2026-07-10T17:51:36.150Z", "answerBytes": 165, "answerChars": 165, "exitCode": 0 }, { "fixtureId": "gmod.perf.pairs-ipairs-for.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal t = {} -- large sequential table of numbers\nlocal sum = 0\nfor i = 1, #t do\n sum = sum + t[i]\nend\n```\n\nReason: `for i = 1, #t` avoids per-iteration function-call overhead (pairs/ipairs call an iterator function each iteration) and avoids hash-table lookups (pairs is unordered); the numeric for compiles to a tight C loop in LuaJIT, and `#t` is cached by the compiler, making it the fastest idiom for dense sequential arrays.", "durationMs": 13280, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "de5e4875fcf3e600", "usage": { "source": "provider", "promptTokens": 21087, "completionTokens": 123, "totalTokens": 22271, "reasoningTokens": 37, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:51:28.272Z", "completedAt": "2026-07-10T17:51:41.556Z", "answerBytes": 440, "answerChars": 440, "exitCode": 0 }, { "fixtureId": "gmod.perf.plain-lua-vs-fn.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- DarkRP fn library wraps each call in closures and currying.\n-- A plain loop with early-out avoids the overhead entirely.\n\nlocal function filterMap(list, predicate, transform)\n local out = {}\n local n = 0\n for i = 1, #list do\n local v = list[i]\n if predicate(v) then\n n = n + 1\n out[n] = transform(v)\n end\n end\n return out\nend\n\n-- Example: get names of alive players longer than 3 chars.\nlocal result = filterMap(\n player.GetAll(),\n function(p) return p:Alive() end,\n function(p) return p:Nick() end\n)\n```\n\nReason: DarkRP's `fn` library allocates a closure per combinator call and walks tables via `ipairs` metamethod indirection; a single fused loop with numeric indexing eliminates both the per-element allocations and the iterator overhead, yielding measurable speedups on large tables (e.g. 100+ entity lists) where GC pressure and call depth compound.", "durationMs": 11104, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "ead0a98b3ff6a388", "usage": { "source": "provider", "promptTokens": 21100, "completionTokens": 231, "totalTokens": 22414, "reasoningTokens": 59, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:51:28.388Z", "completedAt": "2026-07-10T17:51:39.495Z", "answerBytes": 932, "answerChars": 932, "exitCode": 0 }, { "fixtureId": "gmod.perf.player-cache-hooks.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- Cached player list — refreshed only on PlayerInitialSpawn / PlayerDisconnect\nlocal CachedPlayers = {}\nlocal PlayersDirty = true\n\nlocal function RebuildPlayerCache()\n CachedPlayers = player.GetAll()\n PlayersDirty = false\nend\n\nhook.Add(\"PlayerInitialSpawn\", \"PlayerCache_Init\", function(_ply)\n PlayersDirty = true\nend)\n\nhook.Add(\"PlayerDisconnect\", \"PlayerCache_Disc\", function(_ply)\n PlayersDirty = true\nend)\n\n-- Any per-tick hook that needs the player list\nhook.Add(\"Think\", \"PlayerCache_Think\", function()\n if PlayersDirty then\n RebuildPlayerCache()\n end\n\n for i = 1, #CachedPlayers do\n local ply = CachedPlayers[i]\n -- your per-player logic here\n end\nend)\n```\n\nReason: `player.GetAll()` allocates a new table every call; caching it and refreshing only on join/leave avoids that per-tick GC pressure while `PlayersDirty` guarantees the list stays current.", "durationMs": 12639, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "a834817afe9e6c25", "usage": { "source": "provider", "promptTokens": 21091, "completionTokens": 218, "totalTokens": 22413, "reasoningTokens": 80, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:51:28.754Z", "completedAt": "2026-07-10T17:51:41.398Z", "answerBytes": 913, "answerChars": 911, "exitCode": 0 }, { "fixtureId": "gmod.perf.ply-table-index.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attemptIndex": 1, "status": "incorrect", "detail": "Did not match a fixture answer pattern.", "finalResponse": "```lua\n-- Per-player temp store keyed by entity index (pure Lua table, integer keys)\nlocal PlyTemp = {}\n\n-- Write (once):\nPlyTemp[ply:EntIndex()] = value\n\n-- Read (hot path):\nlocal v = PlyTemp[ply:EntIndex()]\n```\n\nReason: `ply.someField` crosses into C through the entity userdata's `__index`/`__newindex` metamethods on every access; an external Lua table keyed by `EntIndex()` is a pure-Lua integer-keyed lookup that LuaJIT compiles to a direct array slot read with zero C-boundary overhead.", "durationMs": 17742, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f18cc80df8999147", "usage": { "source": "provider", "promptTokens": 20315, "completionTokens": 134, "totalTokens": 22736, "reasoningTokens": 495, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:51:29.090Z", "completedAt": "2026-07-10T17:51:46.849Z", "answerBytes": 493, "answerChars": 493, "exitCode": 0 }, { "fixtureId": "gmod.perf.seq-tables.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 0 through 1 candidate loops.", "finalResponse": "```lua\n-- Sequential array: faster iteration\nlocal arr = {10, 20, 30, 40, 50}\nfor i = 1, #arr do\n local v = arr[i]\nend\n\n-- String-keyed map: slower iteration \nlocal map = {a = 10, b = 20, c = 30, d = 40, e = 50}\nfor k, v in pairs(map) do\n -- k is hashed, iteration order non-deterministic\nend\n```\n\nReason: Sequential integer-indexed arrays allow Lua's VM to use contiguous memory traversal with simple pointer arithmetic, while string-keyed maps require hash computation for each access and use non-deterministic iteration order with higher overhead per element.", "durationMs": 13663, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "4778b0220c3f91a3", "usage": { "source": "provider", "promptTokens": 20313, "completionTokens": 171, "totalTokens": 22514, "reasoningTokens": 238, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:51:29.811Z", "completedAt": "2026-07-10T17:51:43.481Z", "answerBytes": 569, "answerChars": 569, "exitCode": 0 }, { "fixtureId": "gmod.perf.setdrawcolor-split.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nsurface.SetDrawColor(255, 128, 0, 200)\n```\n\nReason: The variadic r,g,b,a style avoids allocating a `Color` table each frame, eliminating GC pressure and table-creation overhead in a hot path.", "durationMs": 12533, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "d110fde8a37bbe59", "usage": { "source": "provider", "promptTokens": 21081, "completionTokens": 63, "totalTokens": 22334, "reasoningTokens": 166, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:51:30.022Z", "completedAt": "2026-07-10T17:51:42.560Z", "answerBytes": 198, "answerChars": 198, "exitCode": 0 }, { "fixtureId": "gmod.perf.sqlite-vs-mysql.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nsql.Query(\"CREATE TABLE IF NOT EXISTS players (steamid TEXT PRIMARY KEY, data TEXT)\")\nsql.QueryValue(\"SELECT data FROM players WHERE steamid = \" .. sql.SQLStr(steamid))\nsql.Query(\"INSERT OR REPLACE INTO players (steamid, data) VALUES (\" .. sql.SQLStr(steamid) .. \", \" .. sql.SQLStr(data) .. \")\")\n```\n\nReason: Local SQLite eliminates network round-trips entirely, making reads/writes near-instantaneous compared to remote MySQL's inherent latency overhead.", "durationMs": 11925, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "4a3f5d2a20d71ac9", "usage": { "source": "provider", "promptTokens": 20333, "completionTokens": 112, "totalTokens": 22482, "reasoningTokens": 245, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:51:30.939Z", "completedAt": "2026-07-10T17:51:42.873Z", "answerBytes": 462, "answerChars": 462, "exitCode": 0 }, { "fixtureId": "gmod.perf.steamid-cache.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal idCache = setmetatable({}, { __mode = \"k\" })\n\nlocal function CachedSteamID(ply)\n local sid = idCache[ply]\n if sid then return sid end\n sid = ply:SteamID()\n idCache[ply] = sid\n return sid\nend\n```\n\nReason: Weak-keyed table caches per-entity without preventing GC; avoids repeated string allocation and API overhead on hot paths.", "durationMs": 11187, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "e8a94aa454154982", "usage": { "source": "provider", "promptTokens": 21077, "completionTokens": 95, "totalTokens": 22236, "reasoningTokens": 40, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:51:31.464Z", "completedAt": "2026-07-10T17:51:42.653Z", "answerBytes": 344, "answerChars": 344, "exitCode": 0 }, { "fixtureId": "gmod.perf.string-table-concat.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 0 through 0 candidate loops.", "finalResponse": "```lua\n-- Slow: repeated .. concatenation\nlocal function buildSlow(n)\n local s = \"\"\n for i = 1, n do\n s = s .. \"x\"\n end\n return s\nend\n\n-- Fast: table.concat\nlocal function buildFast(n)\n local t = {}\n for i = 1, n do\n t[i] = \"x\"\n end\n return table.concat(t)\nend\n```\n\nReason: `..` copies the entire accumulator string on every append (O(n²) total copies), while `table.concat` builds a table of pieces in O(1) amortized appends then joins them in a single O(n) pass.", "durationMs": 11406, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "b0cf9e04ae7c5dd9", "usage": { "source": "provider", "promptTokens": 21078, "completionTokens": 151, "totalTokens": 22296, "reasoningTokens": 43, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:51:33.681Z", "completedAt": "2026-07-10T17:51:45.088Z", "answerBytes": 503, "answerChars": 502, "exitCode": 0 }, { "fixtureId": "gmod.perf.surface-drawrect.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attemptIndex": 1, "status": "incorrect", "detail": "Did not match a fixture answer pattern.", "finalResponse": "```lua\nsurface.DrawTexturedRect(x, y, w, h)\n```\n\nReason: `draw.RoundedBox(0, ...)` still validates corner-radius, clamps arguments, and pushes extra lua-side overhead before calling `surface.DrawTexturedRect` internally; calling `surface.DrawTexturedRect` directly skips that wrapper, but you must bind a 1×1 white material with `surface.SetMaterial`/`surface.SetDrawColor` first.", "durationMs": 8718, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "696e8de769d9ad0e", "usage": { "source": "provider", "promptTokens": 20314, "completionTokens": 98, "totalTokens": 22232, "reasoningTokens": 28, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:51:33.923Z", "completedAt": "2026-07-10T17:51:42.644Z", "answerBytes": 381, "answerChars": 380, "exitCode": 0 }, { "fixtureId": "gmod.perf.surface-text.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- set font ONCE (Init or first frame guard), not every Draw call\nlocal fnt = \"DermaLarge\"\nsurface.SetFont(fnt)\n\n-- in your HUDPaint / Paint hook\nlocal txt = \"Hello\"\nlocal tw, th = surface.GetTextSize(txt)\nlocal x, y = ScrW() / 2 - tw / 2, ScrH() / 2 - th / 2\nsurface.SetTextPos(x, y)\nsurface.DrawText(txt)\n```\n\nReason: `draw.DrawText` and `draw.SimpleTextOutlined` rebuild the font object and reset draw state on every call; a single `surface.SetFont` outside the hook plus raw `surface.DrawText`/`SetTextPos` avoids that per-frame overhead.", "durationMs": 19891, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "95d9fe4918ee4197", "usage": { "source": "provider", "promptTokens": 20314, "completionTokens": 160, "totalTokens": 22711, "reasoningTokens": 445, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:51:35.476Z", "completedAt": "2026-07-10T17:51:55.369Z", "answerBytes": 549, "answerChars": 549, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-count-hash.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal t = {1, 2, 3, 4, 5}\nlocal len = #t\nprint(len) -- 5\n```\n\nReason: The unary `#` operator is the idiomatic and canonical way to get the length of a sequence table in Lua; `table.getn` is deprecated.", "durationMs": 8977, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3e9bbfc8452e05e3", "usage": { "source": "provider", "promptTokens": 20309, "completionTokens": 73, "totalTokens": 22256, "reasoningTokens": 82, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:51:36.152Z", "completedAt": "2026-07-10T17:51:45.131Z", "answerBytes": 208, "answerChars": 208, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-empty.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- Faster: t = {} simply reassigns; table.Empty iterates every index to nil it\nlocal t = {}\n-- fill t with 1,000,000 entries...\nt = {} -- GC reclaims the old table when ready; no per-key loop\n```\n\nReason: `t = {}` is a single pointer reassignment and lets the GC reclaim the old table in bulk, while `table.Empty` must iterate every occupied index to set it to `nil`, making it O(n) in the hot path.", "durationMs": 9491, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3a6344977f5bd475", "usage": { "source": "provider", "promptTokens": 21075, "completionTokens": 118, "totalTokens": 22262, "reasoningTokens": 45, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:51:36.411Z", "completedAt": "2026-07-10T17:51:45.904Z", "answerBytes": 406, "answerChars": 406, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-hasvalue.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attemptIndex": 1, "status": "incorrect", "detail": "Matched an incorrect-answer pattern.", "finalResponse": "```lua\n-- Build a lookup set once\nlocal mySet = {\n [\"alpha\"] = true,\n [\"bravo\"] = true,\n [\"charlie\"] = true,\n}\n\n-- O(1) membership test vs table.HasValue O(n) scan\nif mySet[value] then\n -- value exists\nend\n```\n\nReason: Table-key lookup is O(1) hash access, while table.HasValue does a linear O(n) array scan.", "durationMs": 9929, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "7d064428a873fdfc", "usage": { "source": "provider", "promptTokens": 21076, "completionTokens": 98, "totalTokens": 22232, "reasoningTokens": 34, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:51:39.496Z", "completedAt": "2026-07-10T17:51:49.429Z", "answerBytes": 312, "answerChars": 312, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-literal.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- Faster: fields in the constructor\nlocal t = { name = \"foo\", hp = 100, active = true }\n\n-- Slower: assign after construction\nlocal t = {}\nt.name = \"foo\"\nt.hp = 100\nt.active = true\n```\n\nReason: The constructor populates fields in a single C-level pass with one hash-part allocation, while separate assignments each trigger an individual hash insertion and resize check, adding overhead.", "durationMs": 13624, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f95a8fc610d720ad", "usage": { "source": "provider", "promptTokens": 21082, "completionTokens": 102, "totalTokens": 22403, "reasoningTokens": 195, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:51:40.144Z", "completedAt": "2026-07-10T17:51:53.769Z", "answerBytes": 394, "answerChars": 394, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-random.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal function fastRandom(t)\n return t[math.random(#t)]\nend\n```\n\nReason: `math.random(#t)` is O(1) vs `table.Random`'s O(n) copy-and-shuffle, and sequential tables have no gaps so direct indexing is always safe.", "durationMs": 11973, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f3e090701953d4a9", "usage": { "source": "provider", "promptTokens": 21071, "completionTokens": 66, "totalTokens": 22233, "reasoningTokens": 72, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:51:41.400Z", "completedAt": "2026-07-10T17:51:53.374Z", "answerBytes": 221, "answerChars": 221, "exitCode": 0 }, { "fixtureId": "gmod.perf.x-times-x.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal x2 = x * x\n```\n\nReason: Multiplication is faster than `math.pow` (which handles fractional exponents and has overhead) or `x^2` (which invokes the generic power operator with exponent parsing).", "durationMs": 8095, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "79d48008f6b5174f", "usage": { "source": "provider", "promptTokens": 21072, "completionTokens": 54, "totalTokens": 22191, "reasoningTokens": 41, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:51:41.558Z", "completedAt": "2026-07-10T17:51:49.663Z", "answerBytes": 206, "answerChars": 206, "exitCode": 0 }, { "fixtureId": "gmod.player-iterator.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attemptIndex": 1, "status": "pass", "detail": "Uses player.Iterator() (wiki-recommended Lua-cached iterator).", "finalResponse": "```lua\nfor _, ply in player.Iterator() do\n -- your code here\nend\n```\nReason: Using `player.Iterator()` is the modern, memory-efficient way to loop over connected players in Garry's Mod Lua.", "durationMs": 10910, "version": "1.15.9", "fixtureVersion": 2, "rubricVersion": "4", "promptHash": "fe3d7469535a0ca2", "usage": { "source": "provider", "promptTokens": 21079, "completionTokens": 51, "totalTokens": 22395, "reasoningTokens": 241, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:51:42.564Z", "completedAt": "2026-07-10T17:51:53.480Z", "answerBytes": 192, "answerChars": 192, "exitCode": 0 }, { "fixtureId": "gmod.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nfor ent in ents.Iterator(\"prop_physics\") do\n -- do something with ent\nend\n```\nReason: `ents.Iterator()` yields entities one at a time rather than building a table of all matches, so it visits only `prop_physics` entities and avoids allocating an intermediate table of every entity in the map.", "durationMs": 7248, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "3990c92253db85bb", "usage": { "source": "provider", "promptTokens": 22320, "completionTokens": 75, "totalTokens": 22490, "reasoningTokens": 95, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:51:42.645Z", "completedAt": "2026-07-10T17:51:49.894Z", "answerBytes": 300, "answerChars": 300, "exitCode": 0 }, { "fixtureId": "gmod.hook-add.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attemptIndex": 1, "status": "pass", "detail": "Registers a named hook with hook.Add.", "finalResponse": "```lua\nhook.Add(\"Think\", \"MyAddon.Think\", function() end)\n```\nReason: `hook.Add` registers a callback for a named hook; the first argument is the hook name (`\"Think\"`), the second is a unique identifier for removal or override, and the third is the function to run each frame.", "durationMs": 7174, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "12d2222fdb7d6b90", "usage": { "source": "provider", "promptTokens": 22335, "completionTokens": 71, "totalTokens": 22547, "reasoningTokens": 141, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:51:42.654Z", "completedAt": "2026-07-10T17:51:49.830Z", "answerBytes": 276, "answerChars": 276, "exitCode": 0 }, { "fixtureId": "gmod.isvalid.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attemptIndex": 1, "status": "pass", "detail": "Uses IsValid for entity/object validity.", "finalResponse": "```lua\nif not IsValid(ent) then return end\n```\nReason: `IsValid` returns false for nil entities and for entities that have been removed from the world (via `Entity:Remove()`), preventing crashes from calling methods on freed C++ objects.", "durationMs": 7229, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "35527312e59dfc13", "usage": { "source": "provider", "promptTokens": 22327, "completionTokens": 57, "totalTokens": 22524, "reasoningTokens": 140, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:51:42.877Z", "completedAt": "2026-07-10T17:51:50.108Z", "answerBytes": 237, "answerChars": 237, "exitCode": 0 }, { "fixtureId": "gmod.net-receivers.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nnet.Receive(\"MyAddon.Sync\", function(len, ply)\nend)\n```\nReason: `net.Receive` is the standard GMod net library function that registers a callback for an incoming net message identified by the given name string.", "durationMs": 6822, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "24d54ee8366753a6", "usage": { "source": "provider", "promptTokens": 22321, "completionTokens": 54, "totalTokens": 22520, "reasoningTokens": 145, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:51:43.484Z", "completedAt": "2026-07-10T17:51:50.313Z", "answerBytes": 217, "answerChars": 217, "exitCode": 0 }, { "fixtureId": "gmod.perf.angle-zero.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attemptIndex": 1, "status": "incorrect", "detail": "Did not match a fixture answer pattern.", "finalResponse": "```lua\nlocal ZERO = Angle(0, 0, 0)\n-- Hot path: reuse instead of allocate\nang:Set(ZERO)\n```\nReason: `Angle(0, 0, 0)` allocates a new C-side userdata every call (heap alloc + GC pressure), while `:Set()` or `:Zero()` writes three floats in-place with zero allocation.", "durationMs": 44886, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f6bc97bf98280d62", "usage": { "source": "provider", "promptTokens": 22336, "completionTokens": 84, "totalTokens": 25669, "reasoningTokens": 3249, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:51:45.090Z", "completedAt": "2026-07-10T17:52:29.978Z", "answerBytes": 266, "answerChars": 266, "exitCode": 0 }, { "fixtureId": "gmod.perf.config-var.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal COLOR = Color(255, 0, 0)\nlocal col = COLOR\n--\n```\n\nReason: A local variable resolves in a single VM instruction (LOADREG), while nested table lookups (`myaddon.config.color`) require one hash-table probe per dot after the initial global lookup — three probes vs one, which adds up in hot paths like hooks or render loops.", "durationMs": 8367, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "bcc4ff8eb162b699", "usage": { "source": "provider", "promptTokens": 22332, "completionTokens": 82, "totalTokens": 22641, "reasoningTokens": 227, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:51:45.133Z", "completedAt": "2026-07-10T17:51:53.502Z", "answerBytes": 336, "answerChars": 334, "exitCode": 0 }, { "fixtureId": "gmod.perf.darkrpvar.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nply:getDarkRPVar(\"job\")\n```\n\nReason: `ply:getDarkRPVar(\"job\")` is the official, documented DarkRP API — it reads from the same networked variable but is future-proof against internal renames, more readable, and automatically handled by DarkRP's own variable system instead of relying on a raw engine call that could break with addon updates.", "durationMs": 7504, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "02a37daa699cded3", "usage": { "source": "provider", "promptTokens": 22334, "completionTokens": 84, "totalTokens": 22584, "reasoningTokens": 166, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:51:45.906Z", "completedAt": "2026-07-10T17:51:53.411Z", "answerBytes": 350, "answerChars": 348, "exitCode": 0 }, { "fixtureId": "gmod.perf.disttosqr.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nif a:DistToSqr(b) < threshold^2 then\n```\n\nReason: `DistToSqr` avoids the expensive `math.sqrt` call that `Distance` performs internally, making threshold checks significantly faster when the actual distance value is not needed.", "durationMs": 10280, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "a5772470c6859cdc", "usage": { "source": "provider", "promptTokens": 22334, "completionTokens": 58, "totalTokens": 22763, "reasoningTokens": 371, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:51:46.851Z", "completedAt": "2026-07-10T17:51:57.138Z", "answerBytes": 234, "answerChars": 234, "exitCode": 0 }, { "fixtureId": "gmod.perf.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nfor ent in ents.Iterator() do\n -- visit every entity\nend\n```\nReason: `ents.Iterator()` is the wiki-recommended efficient iterator as it avoids allocating a table of all entities (unlike `ents.GetAll()`), using a lightweight cursor instead for better performance in loops that visit every entity.", "durationMs": 7671, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "306d3f1d05f28246", "usage": { "source": "provider", "promptTokens": 22325, "completionTokens": 73, "totalTokens": 22502, "reasoningTokens": 104, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:51:47.458Z", "completedAt": "2026-07-10T17:51:55.130Z", "answerBytes": 305, "answerChars": 305, "exitCode": 0 }, { "fixtureId": "gmod.perf.find-ents-near.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nlocal ents = ents.FindInSphere(ply:GetPos(), 256)\n```\nReason: `FindInSphere` uses the engine's spatial hash grid for near-O(1) lookup within a radius, beating `FindInBox` (AABB cheaper but over-fetches) and `FindInCone` (adds angle filtering cost) in head-to-head entity benchmarks when you only need simple proximity.", "durationMs": 10687, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "07c583fc3d9fe09f", "usage": { "source": "provider", "promptTokens": 22353, "completionTokens": 90, "totalTokens": 22741, "reasoningTokens": 298, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:51:49.436Z", "completedAt": "2026-07-10T17:52:00.134Z", "answerBytes": 325, "answerChars": 325, "exitCode": 0 }, { "fixtureId": "gmod.perf.find-players-near.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nlocal function FindPlayersInRadius(pos, radius)\n local players, radiusSq = {}, radius * radius\n for i = 1, #player.GetAll() do\n local ply = player.GetAll()[i]\n if ply:IsValid() and ply:Alive() then\n local diff = ply:GetPos() - pos\n if diff:Dot(diff) <= radiusSq then\n players[#players + 1] = ply\n end\n end\n end\n return players\nend\n```\nReason: `ents.FindInSphere` scans the entire world's spatial index (props, ragdolls, NPCs — potentially thousands of ents) then filters, while `player.GetAll()` iterates only the N online players with a squared-distance `Dot` check that skips `math.sqrt`.", "durationMs": 13454, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "d139ba2e8ee38a2f", "usage": { "source": "provider", "promptTokens": 22342, "completionTokens": 182, "totalTokens": 23045, "reasoningTokens": 521, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:51:49.666Z", "completedAt": "2026-07-10T17:52:03.134Z", "answerBytes": 680, "answerChars": 678, "exitCode": 0 }, { "fixtureId": "gmod.perf.for-vs-while.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nfor i = 1, n do end\n```\nReason: The `for` loop compiles to dedicated FORPREP/FORLOOP bytecodes with internal iteration and bounds caching, while `while` emits separate comparison, increment, and jump instructions — LuaJIT's trace compiler also optimizes the `for` loop form more aggressively via SSA and loop unrolling.", "durationMs": 9076, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "b3401a190a8aecf0", "usage": { "source": "provider", "promptTokens": 22338, "completionTokens": 82, "totalTokens": 22593, "reasoningTokens": 173, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:51:49.834Z", "completedAt": "2026-07-10T17:51:58.914Z", "answerBytes": 328, "answerChars": 326, "exitCode": 0 }, { "fixtureId": "gmod.perf.hook-once.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- Faster: single hook.Run with all players\nhook.Run(\"TickAllPlayers\", player.GetAll())\n```\nReason: `hook.Run` has non-trivial overhead per call (global table lookup, hook table iteration, function dispatch); calling it once amortizes that cost across all players instead of multiplying it by player count.", "durationMs": 9108, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "ed1d3e09249fc8bb", "usage": { "source": "provider", "promptTokens": 22342, "completionTokens": 70, "totalTokens": 22619, "reasoningTokens": 207, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:51:49.896Z", "completedAt": "2026-07-10T17:51:59.005Z", "answerBytes": 313, "answerChars": 313, "exitCode": 0 }, { "fixtureId": "gmod.perf.hudpaint-cache.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal health = LocalPlayer():Health()\n-- use health three times instead of calling :Health() each time\n```\nReason: Caches the return value in a local variable, avoiding three table lookups and three function calls per frame.", "durationMs": 7325, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3def450f3158ceff", "usage": { "source": "provider", "promptTokens": 22346, "completionTokens": 52, "totalTokens": 22460, "reasoningTokens": 62, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:51:50.111Z", "completedAt": "2026-07-10T17:51:57.439Z", "answerBytes": 231, "answerChars": 231, "exitCode": 0 }, { "fixtureId": "gmod.perf.local-color.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal WHITE = Color(255,255,255)\n-- in loop: use WHITE instead of Color(255,255,255)\n```\n\nReason: `Color()` allocates a new table every call; caching it in a local variable outside the loop avoids per-frame allocation and GC pressure.", "durationMs": 7365, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "16a7bed1b931d467", "usage": { "source": "provider", "promptTokens": 22318, "completionTokens": 65, "totalTokens": 22463, "reasoningTokens": 80, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:51:50.315Z", "completedAt": "2026-07-10T17:51:57.682Z", "answerBytes": 241, "answerChars": 241, "exitCode": 0 }, { "fixtureId": "gmod.perf.local-vs-global.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal sin = math.sin\nfor i = 1, 1000000 do\n local x = sin(i)\nend\n```\nReason: Local variable access is faster than hash table lookup in Lua/LuaJIT; caching `math.sin` in a local avoids the table indexing overhead on every iteration.", "durationMs": 8636, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "c116d8c651190647", "usage": { "source": "provider", "promptTokens": 22331, "completionTokens": 68, "totalTokens": 22558, "reasoningTokens": 159, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:51:53.377Z", "completedAt": "2026-07-10T17:52:02.015Z", "answerBytes": 241, "answerChars": 241, "exitCode": 0 }, { "fixtureId": "gmod.perf.localplayer-cache.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal ply = LocalPlayer()\n-- use ply instead of calling LocalPlayer() repeatedly\n```\nReason: `LocalPlayer()` is a C function call that traverses the entity list each invocation; caching it in a local variable avoids that lookup on every frame.", "durationMs": 6591, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "7398105af47b079e", "usage": { "source": "provider", "promptTokens": 21592, "completionTokens": 122, "totalTokens": 22610, "reasoningTokens": 0, "cachedTokens": 896, "cost": 0 }, "startedAt": "2026-07-10T17:51:53.414Z", "completedAt": "2026-07-10T17:52:00.009Z", "answerBytes": 250, "answerChars": 250, "exitCode": 0 }, { "fixtureId": "gmod.perf.looking-at.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nlocal function IsLookingAtEachOther(plyA, plyB)\n local aimA = plyA:GetAimVector()\n local aimB = plyB:GetAimVector()\n local dir = (plyB:GetPos() - plyA:GetPos()):GetNormalized()\n return aimA:Dot(dir) > 0.5 and aimB:Dot(-dir) > 0.5\nend\n```\n\nReason: Dot products are scalar multiplies and adds — no trig, no acos, no branches beyond the two compares. `aimA:Dot(dir) > 0.5` means A's aim is within ~60° of B's position (equivalent to `angle < 60°`). Reusing `dir` and its negation avoids a second subtraction-and-normalize.", "durationMs": 13519, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "20b22f678a4b08d7", "usage": { "source": "provider", "promptTokens": 22342, "completionTokens": 176, "totalTokens": 22934, "reasoningTokens": 416, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:51:53.482Z", "completedAt": "2026-07-10T17:52:07.003Z", "answerBytes": 542, "answerChars": 538, "exitCode": 0 }, { "fixtureId": "gmod.perf.meta-vs-arg.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nSomeHelper(ply)\n```\nReason: `SomeHelper(ply)` avoids the metatable lookup that `ply:SomeHelper()` requires, since the method syntax desugars to `ply.SomeHelper(ply)`, which walks the metatable chain. A directly-referenced local function eliminates that overhead.", "durationMs": 11014, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "de332f7356830dfa", "usage": { "source": "provider", "promptTokens": 22339, "completionTokens": 68, "totalTokens": 22743, "reasoningTokens": 336, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:51:53.504Z", "completedAt": "2026-07-10T17:52:04.520Z", "answerBytes": 269, "answerChars": 269, "exitCode": 0 }, { "fixtureId": "gmod.perf.msg-vs-print.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nMsgN(\"debug\")\n```\n\nReason: `print` calls `tostring` on each argument, joins them with tabs, and routes through GMod's verbose print handler with allocation and formatting overhead; `MsgN` writes directly to the engine's raw console output path with no intermediate formatting.", "durationMs": 18471, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "6cbb4e4b2f19dd24", "usage": { "source": "provider", "promptTokens": 22334, "completionTokens": 65, "totalTokens": 23287, "reasoningTokens": 888, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:51:53.771Z", "completedAt": "2026-07-10T17:52:12.244Z", "answerBytes": 283, "answerChars": 283, "exitCode": 0 }, { "fixtureId": "gmod.perf.pairs-ipairs-for.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nfor i = 1, #t do\n local v = t[i]\nend\n```\n\nReason: Numeric for avoids per-iteration function call overhead from iterator generation (`pairs`/`ipairs`) and length recomputation, compiling to a single `OP_LOADK` + `OP_GETTABLE` + `OP_FORPREP`/`OP_FORLOOP` bytecode sequence with no closure or coroutine overhead.", "durationMs": 9488, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "de5e4875fcf3e600", "usage": { "source": "provider", "promptTokens": 22342, "completionTokens": 98, "totalTokens": 22614, "reasoningTokens": 174, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:51:55.132Z", "completedAt": "2026-07-10T17:52:04.622Z", "answerBytes": 317, "answerChars": 317, "exitCode": 0 }, { "fixtureId": "gmod.perf.plain-lua-vs-fn.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attemptIndex": 1, "status": "incorrect", "detail": "Matched an incorrect-answer pattern.", "finalResponse": "```lua\n-- DarkRP fn approach (slower): creates many closures\nlocal filtered = fn.Compose(\n fn.Filter(function(item) return item.quality > 5 end),\n fn.Map(function(item) return item.name end)\n)(items)\n\n-- Plain Lua approach (~2-4x faster): one loop, no closure overhead, preallocated\nlocal function fast_pipeline(items)\n local out, n = {}, 0\n for i = 1, #items do\n local item = items[i]\n if item.quality > 5 then\n n = n + 1; out[n] = item.name\n end\n end\n return out\nend\n```\nReason: `fn.Compose`/`fn.Filter`/`fn.Map` create intermediate closures and allocate intermediate tables per pipeline stage; a single for-loop avoids all function-call overhead and table churn, keeping the hot path inline for LuaJIT's JIT compiler.", "durationMs": 11157, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "ead0a98b3ff6a388", "usage": { "source": "provider", "promptTokens": 22349, "completionTokens": 208, "totalTokens": 22734, "reasoningTokens": 177, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:51:55.373Z", "completedAt": "2026-07-10T17:52:06.537Z", "answerBytes": 740, "answerChars": 740, "exitCode": 0 }, { "fixtureId": "gmod.perf.player-cache-hooks.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal cachedPlayers = {}\n\nhook.Add(\"PlayerInitialSpawn\", \"CachePlayers\", function(ply)\n cachedPlayers = player.GetAll()\nend)\n\nhook.Add(\"PlayerDisconnected\", \"CachePlayers\", function(ply)\n cachedPlayers = player.GetAll()\nend)\n\nhook.Add(\"Think\", \"CachePlayersThink\", function()\n for i = 1, #cachedPlayers do\n local ply = cachedPlayers[i]\n end\nend)\n```\n\nReason: `player.GetAll()` allocates a new table every call; caching it avoids per-tick allocation and garbage collection, replacing O(n) table creation each tick with O(1) table reads from a pre-built cache that only refreshes on join/leave events.", "durationMs": 8290, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "a834817afe9e6c25", "usage": { "source": "provider", "promptTokens": 22354, "completionTokens": 156, "totalTokens": 22606, "reasoningTokens": 96, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:51:57.140Z", "completedAt": "2026-07-10T17:52:05.431Z", "answerBytes": 625, "answerChars": 625, "exitCode": 0 }, { "fixtureId": "gmod.perf.ply-table-index.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 0 through 0 candidate loops.", "finalResponse": "```lua\n-- Pre-allocate array by EntIndex for O(1) reads, bypassing metatable overhead\nlocal PD = {}\nfor i = 1, game.MaxPlayers() do PD[i] = {} end\nhook.Add(\"PlayerDisconnected\", \"PDClean\", function(ply) PD[ply:EntIndex()] = {} end)\n\n-- Read: PD[ply:EntIndex()].foo\n-- Write: PD[ply:EntIndex()].foo = val\n```\nReason: `ply.EntIndex` returns a small integer, so `PD[entIndex]` hits the array part of the table (single C-side `array[i]` load), while `ply.field` traverses the full Lua metatable chain on a userdata — the second lookup, the metatable, and the `__index` metamethod are all skipped entirely.", "durationMs": 16126, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f18cc80df8999147", "usage": { "source": "provider", "promptTokens": 22334, "completionTokens": 183, "totalTokens": 23227, "reasoningTokens": 710, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:51:57.443Z", "completedAt": "2026-07-10T17:52:13.593Z", "answerBytes": 606, "answerChars": 604, "exitCode": 0 }, { "fixtureId": "gmod.perf.seq-tables.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 0 through 1 candidate loops.", "finalResponse": "```lua\n-- Fast: sequential number-indexed array\nlocal t = {\"a\", \"b\", \"c\", \"d\"}\nfor i, v in ipairs(t) do end\n\n-- Slow: string-keyed map\nlocal t = {a = 1, b = 2, c = 3, d = 4}\nfor k, v in pairs(t) do end\n```\n\nReason: Sequential arrays in LuaJIT are stored as a contiguous C array (the \"array part\"), enabling cache-friendly sequential memory access and heavy JIT compiler optimizations, while string-keyed maps require hashing each key and traversing a sparse hash table with pointer chasing.", "durationMs": 11674, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "4778b0220c3f91a3", "usage": { "source": "provider", "promptTokens": 22338, "completionTokens": 141, "totalTokens": 22819, "reasoningTokens": 340, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:51:57.686Z", "completedAt": "2026-07-10T17:52:09.364Z", "answerBytes": 490, "answerChars": 490, "exitCode": 0 }, { "fixtureId": "gmod.perf.setdrawcolor-split.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nsurface.SetDrawColor(r, g, b, a)\n```\nReason: Passing separate numbers avoids allocating a Color table and its metatable, eliminating GC pressure in a hot loop.", "durationMs": 7823, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "d110fde8a37bbe59", "usage": { "source": "provider", "promptTokens": 22337, "completionTokens": 41, "totalTokens": 22554, "reasoningTokens": 176, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:51:58.923Z", "completedAt": "2026-07-10T17:52:06.768Z", "answerBytes": 166, "answerChars": 166, "exitCode": 0 }, { "fixtureId": "gmod.perf.sqlite-vs-mysql.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nsql.Query(\"SELECT steamid, kills, deaths FROM player_stats WHERE steamid = '\" .. sql.SQLStr(ply:SteamID()) .. \"'\")\n```\n\nReason: Local SQLite uses direct file I/O without network overhead, while remote MySQL adds TCP round-trip latency for every query regardless of query complexity.", "durationMs": 7632, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "4a3f5d2a20d71ac9", "usage": { "source": "provider", "promptTokens": 22361, "completionTokens": 70, "totalTokens": 22551, "reasoningTokens": 120, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:51:59.007Z", "completedAt": "2026-07-10T17:52:06.642Z", "answerBytes": 289, "answerChars": 289, "exitCode": 0 }, { "fixtureId": "gmod.perf.steamid-cache.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- cache once, reuse forever\nlocal steamid_cache = setmetatable({}, {__mode = \"k\"})\n\nlocal function GetCachedSteamID(ply)\n local cached = steamid_cache[ply]\n if cached then return cached end\n cached = ply:SteamID()\n steamid_cache[ply] = cached\n return cached\nend\n```\n\nReason: `ply:SteamID()` formats and allocates a new string every call; weak-table keyed on the player object avoids both repeated formatting and leaking dead player entries.", "durationMs": 8369, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "e8a94aa454154982", "usage": { "source": "provider", "promptTokens": 22339, "completionTokens": 122, "totalTokens": 22591, "reasoningTokens": 130, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:00.013Z", "completedAt": "2026-07-10T17:52:08.390Z", "answerBytes": 463, "answerChars": 463, "exitCode": 0 }, { "fixtureId": "gmod.perf.string-table-concat.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 0 through 0 candidate loops.", "finalResponse": "```lua\n-- Slow: repeated .. concatenation\nlocal s = \"\"\nfor i = 1, 10000 do\n s = s .. some_piece[i]\nend\n\n-- Fast: table.concat\nlocal t = {}\nfor i = 1, 10000 do\n t[i] = some_piece[i]\nend\nlocal s = table.concat(t)\n```\n\nReason: Lua strings are immutable; `..` allocates a new string on every operation, yielding O(n²) time and excessive GC pressure, while `table.concat` precomputes the final size, allocates once, and fills in O(n).", "durationMs": 6837, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "b0cf9e04ae7c5dd9", "usage": { "source": "provider", "promptTokens": 22329, "completionTokens": 133, "totalTokens": 22541, "reasoningTokens": 79, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:00.136Z", "completedAt": "2026-07-10T17:52:06.977Z", "answerBytes": 436, "answerChars": 435, "exitCode": 0 }, { "fixtureId": "gmod.perf.surface-drawrect.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nsurface.SetDrawColor(color)\nsurface.DrawRect(x, y, w, h)\n```\n\nReason: `draw.RoundedBox` internally processes a rounding path even at radius 0 (material setup, segment calculation), while `surface.DrawRect` is a direct pixel-fill primitive with no branching or geometry manipulation.", "durationMs": 6837, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "696e8de769d9ad0e", "usage": { "source": "provider", "promptTokens": 22341, "completionTokens": 70, "totalTokens": 22518, "reasoningTokens": 107, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:02.016Z", "completedAt": "2026-07-10T17:52:08.855Z", "answerBytes": 289, "answerChars": 289, "exitCode": 0 }, { "fixtureId": "gmod.perf.surface-text.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nsurface.SetFont(\"MyFont\")\nsurface.SetTextPos(x, y)\nsurface.DrawText(text)\n```\nReason: `surface.SetTextPos` + `surface.DrawText` bypass the alignment math, color wrapping, and per-frame allocation that `draw.DrawText` and `draw.SimpleTextOutlined` incur internally, making it the fastest path for raw single-line rendering.", "durationMs": 10857, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "95d9fe4918ee4197", "usage": { "source": "provider", "promptTokens": 22340, "completionTokens": 84, "totalTokens": 22914, "reasoningTokens": 490, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:03.135Z", "completedAt": "2026-07-10T17:52:13.994Z", "answerBytes": 329, "answerChars": 329, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-count-hash.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n#t\n```\n\nReason: The `#` operator (length operator) is the idiomatic and fastest way to get the length of a sequential array-like table in Lua/Garry's Mod Lua, directly implemented in the VM with O(log n) worst-case or O(1) for arrays without holes.", "durationMs": 6597, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3e9bbfc8452e05e3", "usage": { "source": "provider", "promptTokens": 22327, "completionTokens": 67, "totalTokens": 22469, "reasoningTokens": 75, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:04.522Z", "completedAt": "2026-07-10T17:52:11.121Z", "answerBytes": 255, "answerChars": 255, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-empty.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nt = {}\n```\nReason: `table.Empty(t)` is O(n) — it iterates every element to remove it — while `t = {}` is O(1): it simply reassigns the variable to a new empty table, leaving the old table for garbage collection.", "durationMs": 8696, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3a6344977f5bd475", "usage": { "source": "provider", "promptTokens": 22330, "completionTokens": 62, "totalTokens": 22645, "reasoningTokens": 253, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:04.624Z", "completedAt": "2026-07-10T17:52:13.322Z", "answerBytes": 222, "answerChars": 218, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-hasvalue.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal set = { apple = true, banana = true, cherry = true }\nif set[value] then end\n```\nReason: table.HasValue iterates the entire list linearly (O(n)), whereas a set table uses direct key lookup (O(1)), which is hash-table based and does not scan.", "durationMs": 6380, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "7d064428a873fdfc", "usage": { "source": "provider", "promptTokens": 22336, "completionTokens": 68, "totalTokens": 22490, "reasoningTokens": 86, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:05.433Z", "completedAt": "2026-07-10T17:52:11.816Z", "answerBytes": 253, "answerChars": 253, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-literal.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- Faster\nlocal t = {a = 1, b = 2}\n\n-- Slower\nlocal t = {}\nt.a = 1\nt.b = 2\n```\nReason: In GMod Lua, table constructor assignments bypass `__newindex` and the internal panel/entity tracking hooks that fire on every separate field write, making the literal form measurably faster for small tables with known keys.", "durationMs": 15757, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f95a8fc610d720ad", "usage": { "source": "provider", "promptTokens": 22331, "completionTokens": 90, "totalTokens": 23124, "reasoningTokens": 703, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:06.542Z", "completedAt": "2026-07-10T17:52:22.316Z", "answerBytes": 318, "answerChars": 318, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-random.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal val = tbl[math.random(#tbl)]\n```\nReason: Avoids the function call overhead and internal branches of table.Random, reducing to a single math.random call plus array index.", "durationMs": 7987, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f3e090701953d4a9", "usage": { "source": "provider", "promptTokens": 22328, "completionTokens": 44, "totalTokens": 22539, "reasoningTokens": 167, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:06.644Z", "completedAt": "2026-07-10T17:52:14.637Z", "answerBytes": 182, "answerChars": 182, "exitCode": 0 }, { "fixtureId": "gmod.perf.x-times-x.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nx * x\n```\nReason: `x * x` avoids the function call overhead of `x ^ 2` (which calls `math.pow` internally) and compiles to a single arithmetic bytecode instruction, making it the fastest option in a tight loop.", "durationMs": 8232, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "79d48008f6b5174f", "usage": { "source": "provider", "promptTokens": 22324, "completionTokens": 59, "totalTokens": 22577, "reasoningTokens": 194, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:06.773Z", "completedAt": "2026-07-10T17:52:15.026Z", "answerBytes": 217, "answerChars": 217, "exitCode": 0 }, { "fixtureId": "gmod.player-iterator.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attemptIndex": 1, "status": "pass", "detail": "Uses player.Iterator() (wiki-recommended Lua-cached iterator).", "finalResponse": "```lua\nfor _, ply in player.Iterator() do\n -- ply is each connected player\nend\n```\n\nReason: `player.Iterator()` returns a direct iterator over the internal player array, avoiding the temporary table allocation and key-value pair overhead of `pairs(player.GetAll())`.", "durationMs": 7183, "version": "1.15.9", "fixtureVersion": 2, "rubricVersion": "4", "promptHash": "fe3d7469535a0ca2", "usage": { "source": "provider", "promptTokens": 22337, "completionTokens": 64, "totalTokens": 22505, "reasoningTokens": 104, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:06.978Z", "completedAt": "2026-07-10T17:52:14.163Z", "answerBytes": 269, "answerChars": 269, "exitCode": 0 }, { "fixtureId": "gmod.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nfor ent in ents.Iterator() do\n if ent:GetClass() == \"prop_physics\" then\n -- visit ent\n end\nend\n```\nReason: `ents.Iterator()` returns a C-side generator that yields entities one at a time without ever allocating a Lua table of all entities, unlike `ents.GetAll()` or `ents.FindByClass()`.", "durationMs": 9076, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "3990c92253db85bb", "usage": { "source": "provider", "promptTokens": 22327, "completionTokens": 85, "totalTokens": 22719, "reasoningTokens": 307, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:07.005Z", "completedAt": "2026-07-10T17:52:16.083Z", "answerBytes": 299, "answerChars": 299, "exitCode": 0 }, { "fixtureId": "gmod.hook-add.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Registers a named hook with hook.Add.", "finalResponse": "```lua\nhook.Add(\"Think\", \"MyAddon.Think\", function() end)\n```\nReason: `hook.Add` registers a function to run on every frame for the `Think` event, using `\"MyAddon.Think\"` as the unique identifier so it can be later removed with `hook.Remove(\"Think\", \"MyAddon.Think\")`.", "durationMs": 6831, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "12d2222fdb7d6b90", "usage": { "source": "provider", "promptTokens": 22331, "completionTokens": 78, "totalTokens": 22519, "reasoningTokens": 110, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:08.392Z", "completedAt": "2026-07-10T17:52:15.224Z", "answerBytes": 268, "answerChars": 268, "exitCode": 0 }, { "fixtureId": "gmod.isvalid.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Uses IsValid for entity/object validity.", "finalResponse": "```lua\nif IsValid(ent) then\n ent:SomeMethod()\nend\n```\nReason: `IsValid()` checks both that the reference is non-nil and that the entity hasn't been removed from the world, preventing errors from calling methods on freed entity objects.", "durationMs": 6332, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "35527312e59dfc13", "usage": { "source": "provider", "promptTokens": 22330, "completionTokens": 59, "totalTokens": 22477, "reasoningTokens": 88, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:08.858Z", "completedAt": "2026-07-10T17:52:15.195Z", "answerBytes": 238, "answerChars": 238, "exitCode": 0 }, { "fixtureId": "gmod.net-receivers.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nnet.Receive(\"MyAddon.Sync\", function(len, ply)\nend)\n```\nReason: `net.Receive` registers a callback for a named net message; the first argument is the message name as a string, the second is the function invoked when the client receives that message.", "durationMs": 7003, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "24d54ee8366753a6", "usage": { "source": "provider", "promptTokens": 22324, "completionTokens": 63, "totalTokens": 22506, "reasoningTokens": 119, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:09.366Z", "completedAt": "2026-07-10T17:52:16.372Z", "answerBytes": 256, "answerChars": 256, "exitCode": 0 }, { "fixtureId": "gmod.perf.angle-zero.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nlocal zero = Angle()\n-- In hot path, instead of local a = Angle():\nzero:Set(0, 0, 0)\n```\nReason: Constructing `Angle()` allocates a new C userdata every call, pressuring the GC. Reusing a pre-allocated Angle via `:Set(0,0,0)` mutates the existing object with zero allocations.", "durationMs": 33873, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f6bc97bf98280d62", "usage": { "source": "provider", "promptTokens": 22333, "completionTokens": 85, "totalTokens": 24575, "reasoningTokens": 2157, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:11.122Z", "completedAt": "2026-07-10T17:52:44.997Z", "answerBytes": 283, "answerChars": 283, "exitCode": 0 }, { "fixtureId": "gmod.perf.config-var.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal color = Color(255, 0, 0) -- declared once\n-- read: just use color\n```\n\nReason: Local variable access is a single register index (Lua's fastest operation), while nested tables require a hash lookup for each level of indexing.", "durationMs": 7779, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "bcc4ff8eb162b699", "usage": { "source": "provider", "promptTokens": 22341, "completionTokens": 60, "totalTokens": 22534, "reasoningTokens": 133, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:11.818Z", "completedAt": "2026-07-10T17:52:19.598Z", "answerBytes": 237, "answerChars": 237, "exitCode": 0 }, { "fixtureId": "gmod.perf.darkrpvar.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nply:getDarkRPVar(\"job\")\n```\nReason: DarkRP's `ply:getDarkRPVar(\"job\")` is the official, stable API that abstracts the internal netvar implementation, while `ply:GetNWString(\"job\")` ties your code to an internal network string name that could change between versions or be overridden by other addons.", "durationMs": 6681, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "02a37daa699cded3", "usage": { "source": "provider", "promptTokens": 22334, "completionTokens": 81, "totalTokens": 22499, "reasoningTokens": 84, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:12.246Z", "completedAt": "2026-07-10T17:52:18.929Z", "answerBytes": 306, "answerChars": 306, "exitCode": 0 }, { "fixtureId": "gmod.perf.disttosqr.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal threshold = 100\nif vec1:DistToSqr(vec2) < threshold * threshold then\n -- within range\nend\n```\nReason: `DistToSqr` avoids the expensive `sqrt` call that `DistTo` computes, since comparing squared distances against a pre-squared threshold is mathematically equivalent and significantly faster.", "durationMs": 8460, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "a5772470c6859cdc", "usage": { "source": "provider", "promptTokens": 22331, "completionTokens": 74, "totalTokens": 22537, "reasoningTokens": 132, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:13.323Z", "completedAt": "2026-07-10T17:52:21.786Z", "answerBytes": 307, "answerChars": 307, "exitCode": 0 }, { "fixtureId": "gmod.perf.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nfor _, ent in ents.Iterator() do\n -- visit entity\nend\n```\nReason: `ents.Iterator()` is the wiki-recommended efficient iterator because it avoids allocating a table (unlike `ents.GetAll()`), yielding the entity pointer directly from the engine's internal linked list for each iteration step.", "durationMs": 8353, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "306d3f1d05f28246", "usage": { "source": "provider", "promptTokens": 22323, "completionTokens": 72, "totalTokens": 22577, "reasoningTokens": 182, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:13.596Z", "completedAt": "2026-07-10T17:52:21.971Z", "answerBytes": 300, "answerChars": 300, "exitCode": 0 }, { "fixtureId": "gmod.perf.find-ents-near.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nlocal ents = ents.FindInSphere(ply:GetPos(), 512)\n```\n\nReason: `FindInSphere` uses the engine's BSP-based spatial partitioning to query a sphere of interest directly, requiring no precomputed set or PVS traversal, and is consistently the fastest general-purpose `FindIn*` variant for point-centric proximity queries in server benchmarks.", "durationMs": 10778, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "07c583fc3d9fe09f", "usage": { "source": "provider", "promptTokens": 22350, "completionTokens": 79, "totalTokens": 22723, "reasoningTokens": 294, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:13.999Z", "completedAt": "2026-07-10T17:52:24.779Z", "answerBytes": 344, "answerChars": 344, "exitCode": 0 }, { "fixtureId": "gmod.perf.find-players-near.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal function FindPlayersInRadius(pos, radius)\n local r2 = radius * radius\n local out = {}\n for _, ply in ipairs(player.GetAll()) do\n if ply:IsValid() and ply:GetPos():DistToSqr(pos) <= r2 then\n out[#out + 1] = ply\n end\n end\n return out\nend\n```\nReason: `ents.FindInSphere` must traverse the spatial partition (hundreds to thousands of ents), allocating a table of non-player ents that are immediately discarded, while `player.GetAll()` returns only the player set (typically 1–128) and `DistToSqr` avoids the `sqrt` call in `GetPos():Distance`, making it O(#players) instead of O(#all-ents) with less allocation and no spatial lookup.", "durationMs": 12680, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "d139ba2e8ee38a2f", "usage": { "source": "provider", "promptTokens": 22343, "completionTokens": 185, "totalTokens": 22857, "reasoningTokens": 329, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:14.167Z", "completedAt": "2026-07-10T17:52:26.863Z", "answerBytes": 684, "answerChars": 682, "exitCode": 0 }, { "fixtureId": "gmod.perf.for-vs-while.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nfor i = 1, n do end\n```\n\nReason: LuaJIT compiles `for` into specialized bytecodes (`FORPREP`/`FORLOOP`) that are monomorphic and fully JIT-compilable, while `while` with a manual counter produces more bytecode and is harder for the trace compiler to optimize.", "durationMs": 9463, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "b3401a190a8aecf0", "usage": { "source": "provider", "promptTokens": 22329, "completionTokens": 75, "totalTokens": 22583, "reasoningTokens": 179, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:14.649Z", "completedAt": "2026-07-10T17:52:24.126Z", "answerBytes": 266, "answerChars": 266, "exitCode": 0 }, { "fixtureId": "gmod.perf.hook-once.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nhook.Run(\"PlayerTick\", player.GetAll())\n```\n\nReason: `hook.Run` internally iterates all registered hooks, so a per-player loop multiplies that lookup/iteration overhead by player count; batching reduces it to one dispatch pass regardless of server population.", "durationMs": 9591, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "ed1d3e09249fc8bb", "usage": { "source": "provider", "promptTokens": 22344, "completionTokens": 58, "totalTokens": 22627, "reasoningTokens": 225, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:15.028Z", "completedAt": "2026-07-10T17:52:24.631Z", "answerBytes": 266, "answerChars": 266, "exitCode": 0 }, { "fixtureId": "gmod.perf.hudpaint-cache.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal ply = LocalPlayer()\nlocal health = ply:Health()\n\n-- Draw call 1 using health\ndraw.SimpleText(health, \"Default\", 10, 10, COLOR_WHITE)\n-- Draw call 2 using health\ndraw.SimpleText(health, \"Default\", 10, 30, COLOR_WHITE)\n-- Draw call 3 using health\ndraw.SimpleText(health, \"Default\", 10, 50, COLOR_WHITE)\n```\n\nReason: `LocalPlayer():Health()` is a networked C++ call with VM marshalling overhead — caching the result in a local variable avoids three crossings of the Lua/C boundary per frame for a value that doesn't change within a single frame.", "durationMs": 8103, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3def450f3158ceff", "usage": { "source": "provider", "promptTokens": 22343, "completionTokens": 155, "totalTokens": 22556, "reasoningTokens": 58, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:15.196Z", "completedAt": "2026-07-10T17:52:23.301Z", "answerBytes": 557, "answerChars": 555, "exitCode": 0 }, { "fixtureId": "gmod.perf.local-color.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal white = Color(255, 255, 255)\nhook.Add(\"PostDrawOpaqueRenderables\", \"example\", function()\n surface.SetDrawColor(white)\nend)\n```\nReason: `Color()` allocates a new table each call; caching it as a local avoids per-frame GC pressure from allocating ~60 Color objects per second.", "durationMs": 13954, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "16a7bed1b931d467", "usage": { "source": "provider", "promptTokens": 22325, "completionTokens": 77, "totalTokens": 22921, "reasoningTokens": 519, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:15.226Z", "completedAt": "2026-07-10T17:52:29.188Z", "answerBytes": 290, "answerChars": 290, "exitCode": 0 }, { "fixtureId": "gmod.perf.local-vs-global.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal sin = math.sin\nfor i = 1, 1000000 do\n local x = sin(i)\nend\n```\nReason: Localizing the function avoids a global table lookup and the `self`-dispatch overhead of colon-call syntax on every iteration.", "durationMs": 7329, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "c116d8c651190647", "usage": { "source": "provider", "promptTokens": 22330, "completionTokens": 61, "totalTokens": 22525, "reasoningTokens": 134, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:16.089Z", "completedAt": "2026-07-10T17:52:23.460Z", "answerBytes": 213, "answerChars": 213, "exitCode": 0 }, { "fixtureId": "gmod.perf.localplayer-cache.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal ply = LocalPlayer()\n```\nReason: Assigning LocalPlayer() to a local variable outside of hooks avoids the overhead of the internal C-side lookup on every frame/hook call, since Lua locals are faster than repeated engine function calls.", "durationMs": 6409, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "7398105af47b079e", "usage": { "source": "provider", "promptTokens": 22334, "completionTokens": 53, "totalTokens": 22432, "reasoningTokens": 45, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:16.375Z", "completedAt": "2026-07-10T17:52:22.790Z", "answerBytes": 246, "answerChars": 246, "exitCode": 0 }, { "fixtureId": "gmod.perf.looking-at.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nlocal function LookingAtEachOther(a, b, threshold)\n threshold = threshold or 0.7\n local dir = (b:GetPos() - a:GetPos()):GetNormalized()\n return a:GetAimVector():Dot(dir) > threshold and b:GetAimVector():Dot(dir) < -threshold\nend\n```\nReason: A single normalized direction vector is computed once; both checks reduce to dot-product comparisons against a threshold, avoiding the implicit math.acos in angle-from-vectors entirely.", "durationMs": 10573, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "20b22f678a4b08d7", "usage": { "source": "provider", "promptTokens": 22345, "completionTokens": 115, "totalTokens": 22858, "reasoningTokens": 398, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:18.930Z", "completedAt": "2026-07-10T17:52:29.505Z", "answerBytes": 442, "answerChars": 442, "exitCode": 0 }, { "fixtureId": "gmod.perf.meta-vs-arg.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attemptIndex": 1, "status": "incorrect", "detail": "Matched an incorrect-answer pattern.", "finalResponse": "```lua\nply:SomeHelper()\n```\nReason: In GMod Lua (Lua 5.1), `ply:SomeHelper()` is generally faster than the global `SomeHelper(ply)` because method lookup goes through the smaller player metatable rather than the much larger global table `_G`, and the `:` syntax adds zero overhead — it's just sugar for `ply.SomeHelper(ply)`.", "durationMs": 18777, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "de332f7356830dfa", "usage": { "source": "provider", "promptTokens": 22345, "completionTokens": 87, "totalTokens": 23381, "reasoningTokens": 949, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:19.600Z", "completedAt": "2026-07-10T17:52:38.379Z", "answerBytes": 327, "answerChars": 325, "exitCode": 0 }, { "fixtureId": "gmod.perf.msg-vs-print.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nMsgN(\"debug text\")\n```\nReason: `print()` triggers the `ConsoleMessage` hook and does string formatting overhead; `MsgN` writes directly to the console via the engine, skipping hook dispatch entirely.", "durationMs": 10743, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "6cbb4e4b2f19dd24", "usage": { "source": "provider", "promptTokens": 22319, "completionTokens": 48, "totalTokens": 22698, "reasoningTokens": 331, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:21.788Z", "completedAt": "2026-07-10T17:52:32.534Z", "answerBytes": 206, "answerChars": 206, "exitCode": 0 }, { "fixtureId": "gmod.perf.pairs-ipairs-for.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nfor i = 1, #t do local v = t[i] end\n```\nReason: Numeric for compiles to minimal bytecode (no iterator call overhead like pairs/ipairs) and LuaJIT can fully JIT-compile the tight loop with direct array indexing, making it 2-5x faster than ipairs and far faster than pairs on sequential arrays.", "durationMs": 9290, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "de5e4875fcf3e600", "usage": { "source": "provider", "promptTokens": 22344, "completionTokens": 83, "totalTokens": 22608, "reasoningTokens": 181, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:21.973Z", "completedAt": "2026-07-10T17:52:31.264Z", "answerBytes": 299, "answerChars": 299, "exitCode": 0 }, { "fixtureId": "gmod.perf.plain-lua-vs-fn.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attemptIndex": 1, "status": "incorrect", "detail": "Matched an incorrect-answer pattern.", "finalResponse": "```lua\n-- fn (slow, creates closures + intermediate tables for each stage)\n-- local names = fn.Compose(fn.Map(fn.Curry(fn.Select, 2)(1)), fn.Filter(function(v) return v > 10 end))(values)\n\n-- plain Lua (fast: single pass, no closures, no allocations beyond the result table)\nlocal n, result = 0, {}\nfor i = 1, #values do\n local v = values[i]\n if v > 10 then\n n = n + 1\n result[n] = v\n end\nend\n```\nReason: DarkRP's `fn` combinators allocate a closure per combinator, traverse the list once per stage (no fusion), and use JIT-unfriendly vararg packing (`select`, `{...}`); a plain for-loop fuses filter+map into a single pass with zero closures and one allocation, letting LuaJIT compile tight, branch-predictable bytecode.", "durationMs": 19087, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "ead0a98b3ff6a388", "usage": { "source": "provider", "promptTokens": 22353, "completionTokens": 209, "totalTokens": 23341, "reasoningTokens": 779, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:22.317Z", "completedAt": "2026-07-10T17:52:41.407Z", "answerBytes": 744, "answerChars": 744, "exitCode": 0 }, { "fixtureId": "gmod.perf.player-cache-hooks.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal cachedPlayers = {}\n\nlocal function RefreshPlayerCache()\n cachedPlayers = player.GetAll()\nend\n\nhook.Add(\"PlayerInitialSpawn\", \"PlayerCacheRefresh\", RefreshPlayerCache)\nhook.Add(\"PlayerDisconnected\", \"PlayerCacheRefresh\", RefreshPlayerCache)\n\nhook.Add(\"Tick\", \"MyTickHook\", function()\n for i = 1, #cachedPlayers do\n local ply = cachedPlayers[i]\n end\nend)\n\nRefreshPlayerCache()\n```\nReason: `ipairs(player.GetAll())` allocates a new iterator closure and table reference every tick; caching replaces that with a numeric `for` over a pre-built table, refreshed only on the two player-lifecycle events instead of 66 times per second.", "durationMs": 8771, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "a834817afe9e6c25", "usage": { "source": "provider", "promptTokens": 22357, "completionTokens": 156, "totalTokens": 22719, "reasoningTokens": 206, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:22.793Z", "completedAt": "2026-07-10T17:52:31.566Z", "answerBytes": 655, "answerChars": 655, "exitCode": 0 }, { "fixtureId": "gmod.perf.ply-table-index.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal pts = setmetatable({}, { __mode = \"k\" })\n-- write: pts[ply] = { hp = 100 }\n-- read: pts[ply].hp\n```\nReason: Entity metatables add overhead on every field access (`ply.foo` traverses `__index`); a plain Lua table with weak keys avoids that chain entirely, making reads a single hash lookup instead of a C metamethod walk.", "durationMs": 13202, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f18cc80df8999147", "usage": { "source": "provider", "promptTokens": 22331, "completionTokens": 96, "totalTokens": 22923, "reasoningTokens": 496, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:23.304Z", "completedAt": "2026-07-10T17:52:36.508Z", "answerBytes": 334, "answerChars": 334, "exitCode": 0 }, { "fixtureId": "gmod.perf.seq-tables.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 0 through 1 candidate loops.", "finalResponse": "```lua\n-- Fast: sequential integer-indexed array\nfor i = 1, #arr do\n local v = arr[i]\nend\n\n-- Slow: string-keyed map\nfor k, v in pairs(map) do\nend\n```\nReason: LuaJIT allocates sequential integer keys in the array part (contiguous memory, cache-friendly, O(1) direct index), while string keys live in the hash part (pointer chasing, hash computation, worse cache behavior).", "durationMs": 8227, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "4778b0220c3f91a3", "usage": { "source": "provider", "promptTokens": 22336, "completionTokens": 102, "totalTokens": 22563, "reasoningTokens": 125, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:23.462Z", "completedAt": "2026-07-10T17:52:31.691Z", "answerBytes": 373, "answerChars": 373, "exitCode": 0 }, { "fixtureId": "gmod.perf.setdrawcolor-split.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nsurface.SetDrawColor(r, g, b, a)\n```\nReason: Passing raw numbers avoids allocating a Color object on every call, eliminating per-frame GC pressure in a hot draw path.", "durationMs": 6558, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "d110fde8a37bbe59", "usage": { "source": "provider", "promptTokens": 22337, "completionTokens": 43, "totalTokens": 22486, "reasoningTokens": 106, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:24.128Z", "completedAt": "2026-07-10T17:52:30.689Z", "answerBytes": 173, "answerChars": 173, "exitCode": 0 }, { "fixtureId": "gmod.perf.sqlite-vs-mysql.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nsql.Query(\"SELECT data FROM player_data WHERE steamid = \" .. SQLStr(ply:SteamID64()))\n```\n\nReason: SQLite reads and writes directly to a local file with zero network overhead, while MySQL requires a TCP round-trip to a remote server, adding 1–10ms+ of latency per query depending on network conditions.", "durationMs": 7567, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "4a3f5d2a20d71ac9", "usage": { "source": "provider", "promptTokens": 22364, "completionTokens": 76, "totalTokens": 22535, "reasoningTokens": 95, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:24.632Z", "completedAt": "2026-07-10T17:52:32.201Z", "answerBytes": 311, "answerChars": 309, "exitCode": 0 }, { "fixtureId": "gmod.perf.steamid-cache.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal steamid_cache = setmetatable({}, {__mode = \"k\"})\nfunction cached_steamid(ply)\n local id = steamid_cache[ply]\n if id then return id end\n id = ply:SteamID()\n steamid_cache[ply] = id\n return id\nend\n```\nReason: `ply:SteamID()` calls into C++, which serializes the 64-bit ID to a string each invocation. A weak-keyed cache stores the result once per player object and lets dead players be GC'd automatically, eliminating all repeated C++ string allocations and format work.", "durationMs": 13421, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "e8a94aa454154982", "usage": { "source": "provider", "promptTokens": 22337, "completionTokens": 135, "totalTokens": 23077, "reasoningTokens": 605, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:24.781Z", "completedAt": "2026-07-10T17:52:38.207Z", "answerBytes": 496, "answerChars": 496, "exitCode": 0 }, { "fixtureId": "gmod.perf.string-table-concat.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 0 through 0 candidate loops.", "finalResponse": "```lua\n-- Slow: repeated .. concatenation\nlocal s = \"\"\nfor i = 1, 10000 do\n s = s .. tostring(i) .. \",\"\nend\n\n-- Fast: table.concat\nlocal parts = {}\nfor i = 1, 10000 do\n parts[i] = tostring(i) .. \",\"\nend\nlocal s = table.concat(parts)\n```\nReason: Each `..` concatenation allocates a new string and copies both operands, O(n²) total; `table.concat` precomputes the total length, allocates once, and copies each piece exactly once, O(n).", "durationMs": 6498, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "b0cf9e04ae7c5dd9", "usage": { "source": "provider", "promptTokens": 22334, "completionTokens": 136, "totalTokens": 22519, "reasoningTokens": 49, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:26.865Z", "completedAt": "2026-07-10T17:52:33.365Z", "answerBytes": 440, "answerChars": 439, "exitCode": 0 }, { "fixtureId": "gmod.perf.surface-drawrect.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nsurface.SetDrawColor(r, g, b, a)\nsurface.DrawRect(x, y, w, h)\n```\nReason: `draw.RoundedBox` adds Lua function-call overhead and an unnecessary zero-radius branch check before dispatching to the same surface primitive, so calling `surface.SetDrawColor` + `surface.DrawRect` directly eliminates that overhead.", "durationMs": 11674, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "696e8de769d9ad0e", "usage": { "source": "provider", "promptTokens": 22335, "completionTokens": 80, "totalTokens": 22950, "reasoningTokens": 535, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:29.190Z", "completedAt": "2026-07-10T17:52:40.865Z", "answerBytes": 314, "answerChars": 314, "exitCode": 0 }, { "fixtureId": "gmod.perf.surface-text.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nsurface.SetFont(\"MyFont\")\nsurface.SetTextColor(255, 255, 255, 255)\nsurface.SetTextPos(x, y)\nsurface.DrawText(\"Hello\")\n```\nReason: `surface.SetTextPos` + `surface.DrawText` avoids the allocation, branching, and extra function-call overhead of `draw.DrawText` (which wraps surface calls with validation) and `draw.SimpleTextOutlined` (which draws twice for outline + fill).", "durationMs": 9335, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "95d9fe4918ee4197", "usage": { "source": "provider", "promptTokens": 22340, "completionTokens": 104, "totalTokens": 22706, "reasoningTokens": 262, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:29.507Z", "completedAt": "2026-07-10T17:52:38.845Z", "answerBytes": 378, "answerChars": 378, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-count-hash.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n#t\n```\nReason: In Garry's Mod Lua (Lua 5.1), the `#` operator is the idiomatic and efficient way to get the length of a sequential array-like table, returning the last numeric key with a non-nil value.", "durationMs": 6852, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3e9bbfc8452e05e3", "usage": { "source": "provider", "promptTokens": 22321, "completionTokens": 60, "totalTokens": 22480, "reasoningTokens": 99, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:29.980Z", "completedAt": "2026-07-10T17:52:36.834Z", "answerBytes": 208, "answerChars": 208, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-empty.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- Faster approach: t = {}\nt = {}\n```\n\nReason: `t = {}` is O(1) — it simply creates a new empty table and reassigns the variable, while `table.Empty(t)` is O(n) because it must iterate through and remove every element in the table before the GC collects the now-empty container.", "durationMs": 8585, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3a6344977f5bd475", "usage": { "source": "provider", "promptTokens": 22334, "completionTokens": 74, "totalTokens": 22584, "reasoningTokens": 176, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:30.691Z", "completedAt": "2026-07-10T17:52:39.279Z", "answerBytes": 287, "answerChars": 285, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-hasvalue.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal set = { [\"value\"] = true }\nif set[\"value\"] then -- O(1) lookup\nend\n```\n\nReason: `table.HasValue` iterates the entire list O(n) per check, while a hash-map lookup (`table[key]`) is O(1) because Lua tables are associative arrays with direct key addressing.", "durationMs": 7366, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "7d064428a873fdfc", "usage": { "source": "provider", "promptTokens": 22333, "completionTokens": 75, "totalTokens": 22516, "reasoningTokens": 108, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:31.266Z", "completedAt": "2026-07-10T17:52:38.637Z", "answerBytes": 267, "answerChars": 267, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-literal.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal t = {a = 1, b = 2, c = 3}\n```\nReason: The table constructor pre-allocates the hash part to fit the given fields in a single allocation, avoiding the rehashing that each `t.key = val` assignment may trigger on an initially empty table.", "durationMs": 10635, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f95a8fc610d720ad", "usage": { "source": "provider", "promptTokens": 22332, "completionTokens": 69, "totalTokens": 22728, "reasoningTokens": 327, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:31.568Z", "completedAt": "2026-07-10T17:52:42.205Z", "answerBytes": 247, "answerChars": 247, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-random.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal element = t[math.random(#t)]\n```\nReason: `table.Random` has overhead for non-sequential tables; `math.random(#t)` indexes directly into the contiguous array part with O(1) operations and no function dispatch.", "durationMs": 10878, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f3e090701953d4a9", "usage": { "source": "provider", "promptTokens": 22320, "completionTokens": 55, "totalTokens": 22729, "reasoningTokens": 354, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:31.695Z", "completedAt": "2026-07-10T17:52:42.590Z", "answerBytes": 221, "answerChars": 221, "exitCode": 0 }, { "fixtureId": "gmod.perf.x-times-x.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal s = x * x\n```\nReason: `x * x` compiles to a single bytecode instruction (`MUL`), while `x ^ 2` calls the C math library's exponentiation function, which handles general cases with log/exp and has function call overhead.", "durationMs": 8649, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "79d48008f6b5174f", "usage": { "source": "provider", "promptTokens": 22310, "completionTokens": 64, "totalTokens": 22578, "reasoningTokens": 204, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:32.203Z", "completedAt": "2026-07-10T17:52:40.855Z", "answerBytes": 232, "answerChars": 232, "exitCode": 0 }, { "fixtureId": "gmod.player-iterator.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Uses player.Iterator() (wiki-recommended Lua-cached iterator).", "finalResponse": "```lua\nfor _, ply in player.Iterator() do\n -- do something with ply\nend\n```\nReason: `player.Iterator()` returns a direct closure iterator that avoids allocating a table on every call, unlike `player.GetAll()` which creates a new table each frame.", "durationMs": 9771, "version": "1.15.9", "fixtureVersion": 2, "rubricVersion": "4", "promptHash": "fe3d7469535a0ca2", "usage": { "source": "provider", "promptTokens": 22336, "completionTokens": 62, "totalTokens": 22668, "reasoningTokens": 270, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:32.536Z", "completedAt": "2026-07-10T17:52:42.320Z", "answerBytes": 249, "answerChars": 249, "exitCode": 0 }, { "fixtureId": "gmod.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nfor _, ent in ents.Iterator(\"prop_physics\") do\n -- ent is a prop_physics entity\nend\n```\nReason: `ents.Iterator` uses an internal C iterator that visits matching entities one at a time without allocating a full table of all entities.", "durationMs": 6511, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "3990c92253db85bb", "usage": { "source": "provider", "promptTokens": 22327, "completionTokens": 63, "totalTokens": 22459, "reasoningTokens": 69, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:33.367Z", "completedAt": "2026-07-10T17:52:39.892Z", "answerBytes": 240, "answerChars": 240, "exitCode": 0 }, { "fixtureId": "gmod.hook-add.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attemptIndex": 1, "status": "pass", "detail": "Registers a named hook with hook.Add.", "finalResponse": "```lua\nhook.Add(\"Think\", \"MyAddon.Think\", function() end)\n```\nReason: `hook.Add` registers a named callback on the Think hook; the name prevents duplicate registration and allows targeted removal.", "durationMs": 5606, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "12d2222fdb7d6b90", "usage": { "source": "provider", "promptTokens": 22337, "completionTokens": 47, "totalTokens": 22443, "reasoningTokens": 59, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:36.510Z", "completedAt": "2026-07-10T17:52:42.118Z", "answerBytes": 196, "answerChars": 196, "exitCode": 0 }, { "fixtureId": "gmod.isvalid.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attemptIndex": 1, "status": "pass", "detail": "Uses IsValid for entity/object validity.", "finalResponse": "```lua\nif IsValid(ent) then\n -- safe to use ent here\nend\n```\n\nReason: `IsValid` checks for nil, verifies the entity hasn't been removed by the engine, and ensures the internal CBaseEntity pointer is still alive; calling methods on an invalid entity throws a Lua error.", "durationMs": 8168, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "35527312e59dfc13", "usage": { "source": "provider", "promptTokens": 22327, "completionTokens": 69, "totalTokens": 22613, "reasoningTokens": 217, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:36.836Z", "completedAt": "2026-07-10T17:52:45.005Z", "answerBytes": 269, "answerChars": 269, "exitCode": 0 }, { "fixtureId": "gmod.net-receivers.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nnet.Receive(\"MyAddon.Sync\", function(len, ply)\nend)\n```\nReason: net.Receive registers a callback for an incoming net message by name.", "durationMs": 6681, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "24d54ee8366753a6", "usage": { "source": "provider", "promptTokens": 22324, "completionTokens": 39, "totalTokens": 22481, "reasoningTokens": 118, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:38.209Z", "completedAt": "2026-07-10T17:52:44.892Z", "answerBytes": 140, "answerChars": 140, "exitCode": 0 }, { "fixtureId": "gmod.perf.angle-zero.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nlocal zero = Angle()\n-- In hot path, reuse and zero in-place instead of allocating a new Angle():\nzero.p, zero.y, zero.r = 0, 0, 0\n```\n\nReason: Allocating a new `Angle()` in a hot path adds GC pressure and memory allocation overhead; reusing one table and resetting its fields in-place avoids both, giving a measurable speedup.", "durationMs": 79054, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f6bc97bf98280d62", "usage": { "source": "provider", "promptTokens": 22334, "completionTokens": 87, "totalTokens": 28100, "reasoningTokens": 5679, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:38.381Z", "completedAt": "2026-07-10T17:53:57.436Z", "answerBytes": 334, "answerChars": 334, "exitCode": 0 }, { "fixtureId": "gmod.perf.config-var.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- Declaration\nlocal color = Color(255, 100, 50)\n\n-- Read\nsurface.SetTextColor(color)\n```\n\nReason: A local variable is a single register/upvalue index into the function's stack frame, while nested table access (`myaddon.config.color`) requires three sequential string-hash lookups — one per table — each with hashing, bucket probing, and collision checks.", "durationMs": 10523, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "bcc4ff8eb162b699", "usage": { "source": "provider", "promptTokens": 22344, "completionTokens": 87, "totalTokens": 22742, "reasoningTokens": 311, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:38.639Z", "completedAt": "2026-07-10T17:52:49.163Z", "answerBytes": 366, "answerChars": 362, "exitCode": 0 }, { "fixtureId": "gmod.perf.darkrpvar.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attemptIndex": 1, "status": "incorrect", "detail": "Did not match a fixture answer pattern.", "finalResponse": "```lua\nply:getJobTable().name\n```\nReason: DarkRP sets and manages the NWString internally; reading it directly bypasses DarkRP's internal state and may break if DarkRP ever changes its networking internals. `ply:getJobTable()` returns the authoritative job definition table where `.name` lives alongside other job data (salary, weapons, etc.), and it's the documented, stable API that respects DarkRP's own lifecycle.", "durationMs": 11231, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "02a37daa699cded3", "usage": { "source": "provider", "promptTokens": 22335, "completionTokens": 94, "totalTokens": 22766, "reasoningTokens": 337, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:38.847Z", "completedAt": "2026-07-10T17:52:50.082Z", "answerBytes": 417, "answerChars": 417, "exitCode": 0 }, { "fixtureId": "gmod.perf.disttosqr.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nif vec1:DistToSqr(vec2) < thresholdSqr then\n```\n\nReason: `DistToSqr` returns the squared distance, avoiding the expensive `sqrt()` call that `Distance` requires—since comparing squared distances against a pre-squared threshold yields the same boolean result with fewer CPU cycles.", "durationMs": 7631, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "a5772470c6859cdc", "usage": { "source": "provider", "promptTokens": 22334, "completionTokens": 68, "totalTokens": 22538, "reasoningTokens": 136, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:39.281Z", "completedAt": "2026-07-10T17:52:46.914Z", "answerBytes": 289, "answerChars": 287, "exitCode": 0 }, { "fixtureId": "gmod.perf.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nfor ent in ents.Iterator() do\n -- visit ent\nend\n```\nReason: `ents.Iterator()` is the wiki-recommended efficient iterator that yields entities one at a time without allocating a table, unlike `pairs(ents.GetAll())` which creates a full table of all entities before iterating.", "durationMs": 6987, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "306d3f1d05f28246", "usage": { "source": "provider", "promptTokens": 22328, "completionTokens": 73, "totalTokens": 22495, "reasoningTokens": 94, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:39.894Z", "completedAt": "2026-07-10T17:52:46.883Z", "answerBytes": 284, "answerChars": 284, "exitCode": 0 }, { "fixtureId": "gmod.perf.find-ents-near.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nents.FindInSphere(ply:GetPos(), 128)\n```\n\nReason: FindInSphere with a small radius (128-256) is the fastest general-purpose spatial query in GMod benchmarks — it uses a single OBB-sphere overlap test per entity with no angular math, no transient table allocation beyond the result list, and avoids PVS bitfield scanning entirely.", "durationMs": 11688, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "07c583fc3d9fe09f", "usage": { "source": "provider", "promptTokens": 22347, "completionTokens": 80, "totalTokens": 22794, "reasoningTokens": 367, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:40.858Z", "completedAt": "2026-07-10T17:52:52.549Z", "answerBytes": 338, "answerChars": 336, "exitCode": 0 }, { "fixtureId": "gmod.perf.find-players-near.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal function PlayersInRadius(pos, radius)\n local sqrRadius = radius * radius\n local players = {}\n for _, ply in ipairs(player.GetAll()) do\n if ply:GetPos():DistToSqr(pos) <= sqrRadius then\n table.insert(players, ply)\n end\n end\n return players\nend\n```\nReason: `ents.FindInSphere` enumerates all entity types via spatial hashing (thousands of checks), then you filter by class; iterating `player.GetAll()` directly does at most N distance-squared checks where N = player count (usually 32–128), avoiding the spatial scan entirely.", "durationMs": 12728, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "d139ba2e8ee38a2f", "usage": { "source": "provider", "promptTokens": 22342, "completionTokens": 144, "totalTokens": 22894, "reasoningTokens": 408, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:40.867Z", "completedAt": "2026-07-10T17:52:53.598Z", "answerBytes": 579, "answerChars": 577, "exitCode": 0 }, { "fixtureId": "gmod.perf.for-vs-while.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nfor i = 1, n do\nend\n```\n\nReason: Lua's numeric `for` compiles to specialized VM instructions (FORPREP/FORLOOP) that avoid a separate counter variable, bounds check on every iteration, and function call overhead, whereas `while` compiles to a conditional jump + manual increment and comparison, which is always at least as many bytecode ops.", "durationMs": 8786, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "b3401a190a8aecf0", "usage": { "source": "provider", "promptTokens": 22316, "completionTokens": 85, "totalTokens": 22555, "reasoningTokens": 154, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:41.409Z", "completedAt": "2026-07-10T17:52:50.198Z", "answerBytes": 347, "answerChars": 347, "exitCode": 0 }, { "fixtureId": "gmod.perf.hook-once.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal players = player.GetAll()\nhook.Run(\"TickPlayerLogic\", players)\n```\nReason: Each `hook.Run` call incurs string lookup, hook table iteration, and function dispatch overhead; looping per player multiplies that cost by player count, so batching all players into one call is faster.", "durationMs": 8509, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "ed1d3e09249fc8bb", "usage": { "source": "provider", "promptTokens": 22341, "completionTokens": 66, "totalTokens": 22562, "reasoningTokens": 155, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:42.121Z", "completedAt": "2026-07-10T17:52:50.635Z", "answerBytes": 290, "answerChars": 290, "exitCode": 0 }, { "fixtureId": "gmod.perf.hudpaint-cache.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal ply = LocalPlayer()\nlocal health = ply:Health()\ndraw.SimpleText(health, \"Default\", 10, 10, color_white)\ndraw.SimpleText(health, \"Default\", 10, 30, color_white)\ndraw.SimpleText(health, \"Default\", 10, 50, color_white)\n```\n\nReason: `LocalPlayer()` and `:Health()` are called once and cached locally, avoiding two redundant network-value lookups and three JIT boundary crossings in a single frame.", "durationMs": 8015, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3def450f3158ceff", "usage": { "source": "provider", "promptTokens": 22337, "completionTokens": 115, "totalTokens": 22555, "reasoningTokens": 103, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:42.208Z", "completedAt": "2026-07-10T17:52:50.229Z", "answerBytes": 406, "answerChars": 406, "exitCode": 0 }, { "fixtureId": "gmod.perf.local-color.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal WHITE = Color(255, 255, 255)\nhook.Add(\"PostDrawOpaqueRenderables\", \"draw\", function()\n render.SetColorMaterial()\n render.DrawQuadEasy(Vector(0,0,0), Vector(0,0,1), 512, 512, WHITE)\nend)\n```\n\nReason: `Color()` allocates a new table on every call; hoisting it to a `local` outside the loop avoids per-frame GC pressure and table lookup overhead.", "durationMs": 11186, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "16a7bed1b931d467", "usage": { "source": "provider", "promptTokens": 22331, "completionTokens": 111, "totalTokens": 22777, "reasoningTokens": 335, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:42.322Z", "completedAt": "2026-07-10T17:52:53.509Z", "answerBytes": 362, "answerChars": 362, "exitCode": 0 }, { "fixtureId": "gmod.perf.local-vs-global.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal sin = math.sin\nfor i = 1, 1000000 do\n local x = sin(i)\nend\n```\n\nReason: Caching `math.sin` in a local variable avoids a global table lookup (`math`) followed by a member table lookup (`sin`) on every iteration, instead resolving to a single upvalue access.", "durationMs": 6640, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "c116d8c651190647", "usage": { "source": "provider", "promptTokens": 22327, "completionTokens": 75, "totalTokens": 22474, "reasoningTokens": 72, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:42.592Z", "completedAt": "2026-07-10T17:52:49.234Z", "answerBytes": 272, "answerChars": 272, "exitCode": 0 }, { "fixtureId": "gmod.perf.localplayer-cache.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal ply = LocalPlayer()\n-- Use `ply` instead of calling LocalPlayer() repeatedly\n```\nReason: `LocalPlayer()` is a C callback that walks the entity list each call; caching it in a local variable on the upvalue saves a table lookup and C boundary crossing on every reference.", "durationMs": 10795, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "7398105af47b079e", "usage": { "source": "provider", "promptTokens": 22334, "completionTokens": 65, "totalTokens": 22781, "reasoningTokens": 382, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:44.895Z", "completedAt": "2026-07-10T17:52:55.693Z", "answerBytes": 282, "answerChars": 282, "exitCode": 0 }, { "fixtureId": "gmod.perf.looking-at.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nlocal function LookingAtEachOther(a, b, cosThreshold)\n cosThreshold = cosThreshold or 0.7071\n local dirAtoB = (b:GetPos() - a:GetPos()):GetNormalized()\n return a:GetAimVector():Dot(dirAtoB) > cosThreshold\n and b:GetAimVector():Dot(-dirAtoB) > cosThreshold\nend\n```\nReason: Dot product of unit vectors *is* cos(angle); comparing it directly against a threshold replaces the inverse trig call with one multiply-add per player, same precision, no branch mispredict from acos's domain check.", "durationMs": 10610, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "20b22f678a4b08d7", "usage": { "source": "provider", "promptTokens": 22345, "completionTokens": 143, "totalTokens": 22911, "reasoningTokens": 423, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:44.999Z", "completedAt": "2026-07-10T17:52:55.610Z", "answerBytes": 509, "answerChars": 509, "exitCode": 0 }, { "fixtureId": "gmod.perf.meta-vs-arg.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nSomeHelper(ply)\n```\nReason: Direct function call skips the metatable lookup, making it strictly faster than colon syntax which must resolve the method through the player's metatable chain.", "durationMs": 9441, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "de332f7356830dfa", "usage": { "source": "provider", "promptTokens": 22345, "completionTokens": 43, "totalTokens": 22726, "reasoningTokens": 338, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:45.006Z", "completedAt": "2026-07-10T17:52:54.449Z", "answerBytes": 195, "answerChars": 195, "exitCode": 0 }, { "fixtureId": "gmod.perf.msg-vs-print.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nif DEBUG then MsgN(\"debug line\") end\n```\nReason: `print` is a C vararg function with string formatting overhead; `MsgN` is a direct raw-output call. Guarding with a constant (`DEBUG = false`) lets LuaJIT dead-code-eliminate the entire call in the hot path when debug is off.", "durationMs": 23326, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "6cbb4e4b2f19dd24", "usage": { "source": "provider", "promptTokens": 22337, "completionTokens": 76, "totalTokens": 23584, "reasoningTokens": 1171, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:46.885Z", "completedAt": "2026-07-10T17:53:10.212Z", "answerBytes": 281, "answerChars": 281, "exitCode": 0 }, { "fixtureId": "gmod.perf.pairs-ipairs-for.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nfor i = 1, #t do\n local v = t[i]\nend\n```\nReason: Numeric for avoids per-iteration function call overhead (no iterator closure like ipairs/pairs), compiles to raw bytecode instructions, and the length operator is evaluated once before the loop body begins.", "durationMs": 8873, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "de5e4875fcf3e600", "usage": { "source": "provider", "promptTokens": 22344, "completionTokens": 68, "totalTokens": 22640, "reasoningTokens": 228, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:46.917Z", "completedAt": "2026-07-10T17:52:55.793Z", "answerBytes": 263, "answerChars": 263, "exitCode": 0 }, { "fixtureId": "gmod.perf.plain-lua-vs-fn.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attemptIndex": 1, "status": "incorrect", "detail": "Matched an incorrect-answer pattern.", "finalResponse": "```lua\n-- Faster: plain for-loop pipeline instead of fn combinators\nlocal function transform(entities)\n local out = {}\n for i = 1, #entities do\n local e = entities[i]\n if e:IsValid() and e:GetPos().z > 0 then\n out[#out + 1] = e:GetClass()\n end\n end\n return out\nend\n\n-- Equivalent with fn:\n-- fn.Compose(fn.Map(fn.Curry(fn.Prop)(1, \"GetClass\")), fn.Filter(fn.Curry(function(e) return e:IsValid() and e:GetPos().z > 0 end)))(entities)\n```\n\nReason: `fn` combinators create a new closure per composition step (Curry, Compose, Map, Filter all allocate), then invoke each through multiple call frames per element; a single plain for-loop eliminates all intermediate closures and does one allocation (the result table) with one loop, no per-element function call overhead.", "durationMs": 10345, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "ead0a98b3ff6a388", "usage": { "source": "provider", "promptTokens": 22356, "completionTokens": 219, "totalTokens": 22708, "reasoningTokens": 133, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:49.165Z", "completedAt": "2026-07-10T17:52:59.512Z", "answerBytes": 809, "answerChars": 809, "exitCode": 0 }, { "fixtureId": "gmod.perf.player-cache-hooks.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal playerCache = {}\n\nlocal function RefreshPlayerCache()\n playerCache = player.GetAll()\nend\n\nhook.Add(\"PlayerInitialSpawn\", \"CachePlayers\", RefreshPlayerCache)\nhook.Add(\"PlayerDisconnected\", \"CachePlayers\", RefreshPlayerCache)\n\nhook.Add(\"Tick\", \"CachedPlayerLoop\", function()\n for i = 1, #playerCache do\n local ply = playerCache[i]\n -- use ply\n end\nend)\n```\nReason: `player.GetAll()` allocates a new table each call; calling it every tick creates unnecessary GC pressure and wastes CPU. Caching it and invalidating only on join/leave (PlayerInitialSpawn/PlayerDisconnected) eliminates the per-tick allocation while staying correct, since the player list only changes at those events.", "durationMs": 8093, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "a834817afe9e6c25", "usage": { "source": "provider", "promptTokens": 22322, "completionTokens": 169, "totalTokens": 22544, "reasoningTokens": 53, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:49.239Z", "completedAt": "2026-07-10T17:52:57.339Z", "answerBytes": 716, "answerChars": 716, "exitCode": 0 }, { "fixtureId": "gmod.perf.ply-table-index.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal data = {}\nlocal mt = {__mode = \"k\"}; setmetatable(data, mt)\n\nhook.Add(\"PlayerDisconnected\", \"CleanupPlayerData\", function(ply)\n data[ply] = nil\nend)\n\n-- store: data[ply] = {field = value}\n-- read: data[ply].field\n```\nReason: Direct table indexing (`data[ply]`) is faster than dot-access on a player Entity (`ply.field`) because Entity metatables add overhead on every field access, while Lua table rawget is a single hash lookup — and the weak-keyed metatable (`__mode = \"k\"`) lets GC clean up entries automatically on disconnect without explicit cleanup.", "durationMs": 9518, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f18cc80df8999147", "usage": { "source": "provider", "promptTokens": 22334, "completionTokens": 152, "totalTokens": 22583, "reasoningTokens": 97, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:50.084Z", "completedAt": "2026-07-10T17:52:59.606Z", "answerBytes": 572, "answerChars": 570, "exitCode": 0 }, { "fixtureId": "gmod.perf.seq-tables.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 0 through 1 candidate loops.", "finalResponse": "```lua\n-- Fast: sequential array, ipairs or numeric for\nlocal t = {\"a\", \"b\", \"c\"}\nfor i, v in ipairs(t) do end\nfor i = 1, #t do end\n\n-- Slow: string-keyed map, pairs\nlocal t = {a = 1, b = 2, c = 3}\nfor k, v in pairs(t) do end\n```\n\nReason: LuaJIT stores sequential integer keys 1..n in a dense C array (array part) that `ipairs` and numeric `for` traverse with O(n) sequential memory access, while string-keyed entries go in the hash part where `pairs` must walk a sparse hash table with pointer chasing and collision handling, making string-map iteration 3-10x slower in practice.", "durationMs": 10333, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "4778b0220c3f91a3", "usage": { "source": "provider", "promptTokens": 22335, "completionTokens": 175, "totalTokens": 22689, "reasoningTokens": 179, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:50.200Z", "completedAt": "2026-07-10T17:53:00.537Z", "answerBytes": 580, "answerChars": 580, "exitCode": 0 }, { "fixtureId": "gmod.perf.setdrawcolor-split.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nsurface.SetDrawColor(r, g, b, a)\n```\nReason: Calling with raw numbers avoids allocating a Color table on every invocation, which reduces GC pressure and table lookups in a hot draw path.", "durationMs": 7759, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "d110fde8a37bbe59", "usage": { "source": "provider", "promptTokens": 22337, "completionTokens": 47, "totalTokens": 22527, "reasoningTokens": 143, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:50.231Z", "completedAt": "2026-07-10T17:52:57.995Z", "answerBytes": 193, "answerChars": 193, "exitCode": 0 }, { "fixtureId": "gmod.perf.sqlite-vs-mysql.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nsql.Query(\"SELECT steamid, kills, deaths FROM player_data WHERE steamid = 'STEAM_0:1:12345'\")\n```\nReason: SQLite runs in-process with zero network round-trips, while MySQL requires a TCP connection to a remote host, adding unavoidable latency for every query.", "durationMs": 7378, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "4a3f5d2a20d71ac9", "usage": { "source": "provider", "promptTokens": 22361, "completionTokens": 67, "totalTokens": 22506, "reasoningTokens": 78, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:50.638Z", "completedAt": "2026-07-10T17:52:58.018Z", "answerBytes": 266, "answerChars": 266, "exitCode": 0 }, { "fixtureId": "gmod.perf.steamid-cache.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal sidCache = setmetatable({}, { __mode = \"k\" })\nfunction GetCachedSteamID(ply)\n local sid = sidCache[ply]\n if sid then return sid end\n sid = ply:SteamID()\n sidCache[ply] = sid\n hook.Add(\"PlayerDisconnected\", ply, function() sidCache[ply] = nil end)\n return sid\nend\n```\n\nReason: `ply:SteamID()` crosses the C/Lua boundary and formats a string each call; caching with a weak-keyed table (auto-cleanup on disconnect/GC) replaces repeated expensive calls with a single O(1) table lookup on the hot path.", "durationMs": 13092, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "e8a94aa454154982", "usage": { "source": "provider", "promptTokens": 22334, "completionTokens": 152, "totalTokens": 23002, "reasoningTokens": 516, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:52.551Z", "completedAt": "2026-07-10T17:53:05.645Z", "answerBytes": 516, "answerChars": 516, "exitCode": 0 }, { "fixtureId": "gmod.perf.string-table-concat.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 0 through 0 candidate loops.", "finalResponse": "```lua\n-- Slow: repeated .. concatenation\nlocal str = \"\"\nfor i = 1, 10000 do\n str = str .. math.random()\nend\n\n-- Fast: table.concat\nlocal parts = {}\nfor i = 1, 10000 do\n parts[i] = math.random()\nend\nlocal str = table.concat(parts)\n```\n\nReason: Repeated `..` creates a new string allocation per operation (O(n²) total), while `table.concat` precomputes the total length, allocates once, and copies each piece into place (O(n) total).", "durationMs": 6804, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "b0cf9e04ae7c5dd9", "usage": { "source": "provider", "promptTokens": 22331, "completionTokens": 126, "totalTokens": 22504, "reasoningTokens": 47, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:53.511Z", "completedAt": "2026-07-10T17:53:00.317Z", "answerBytes": 439, "answerChars": 438, "exitCode": 0 }, { "fixtureId": "gmod.perf.surface-drawrect.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nsurface.SetDrawColor(color)\nsurface.DrawRect(x, y, w, h)\n```\nReason: `draw.RoundedBox` internally computes rounded corners even for radius 0, while `surface.DrawRect` directly draws a rectangle with a single native draw call, eliminating the overhead of corner path calculation and vertex setup.", "durationMs": 6411, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "696e8de769d9ad0e", "usage": { "source": "provider", "promptTokens": 22336, "completionTokens": 71, "totalTokens": 22499, "reasoningTokens": 92, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:53.599Z", "completedAt": "2026-07-10T17:53:00.012Z", "answerBytes": 302, "answerChars": 302, "exitCode": 0 }, { "fixtureId": "gmod.perf.surface-text.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nsurface.SetFont(\"DermaLarge\")\nsurface.SetTextColor(color_white)\nsurface.SetTextPos(x, y)\nsurface.DrawText(\"Hello\")\n```\n\nReason: `draw.DrawText` and `SimpleTextOutlined` both internally call `surface.*` helpers but add overhead from extra argument parsing, color table lookups, outline texture draws, and branching logic; calling `surface.*` directly inlines the minimum path to rasterize the glyph with zero abstraction cost.", "durationMs": 7901, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "95d9fe4918ee4197", "usage": { "source": "provider", "promptTokens": 22325, "completionTokens": 103, "totalTokens": 22570, "reasoningTokens": 142, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:54.452Z", "completedAt": "2026-07-10T17:53:02.356Z", "answerBytes": 432, "answerChars": 432, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-count-hash.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n#t\n```\n\nReason: The `#` operator is the idiomatic, built-in way to get the length of a sequential array-like table in Lua, and Garry's Mod inherits this directly from the Lua 5.1 language.", "durationMs": 6504, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3e9bbfc8452e05e3", "usage": { "source": "provider", "promptTokens": 22327, "completionTokens": 55, "totalTokens": 22440, "reasoningTokens": 58, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:55.612Z", "completedAt": "2026-07-10T17:53:02.117Z", "answerBytes": 195, "answerChars": 195, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-empty.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- t = {} is faster for large sequential tables\n```\n\nReason: `t = {}` allocates a fresh table and abandons the old one to GC without clearing its array part (which is O(1) allocation vs O(n) clear), avoiding a linear pass over the entire array. GMod's `table.Empty` is a C function that clears entries in-place, which still iterates and sets each slot to nil (an O(n) operation).", "durationMs": 11223, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3a6344977f5bd475", "usage": { "source": "provider", "promptTokens": 22331, "completionTokens": 100, "totalTokens": 22755, "reasoningTokens": 324, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:55.695Z", "completedAt": "2026-07-10T17:53:06.919Z", "answerBytes": 386, "answerChars": 386, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-hasvalue.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal set = {[\"value\"] = true}\nif set[\"value\"] then end\n```\nReason: table.HasValue iterates the entire list O(n), while key lookup on a table is O(1) hash lookup.", "durationMs": 6622, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "7d064428a873fdfc", "usage": { "source": "provider", "promptTokens": 22333, "completionTokens": 51, "totalTokens": 22441, "reasoningTokens": 57, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:55.794Z", "completedAt": "2026-07-10T17:53:02.418Z", "answerBytes": 169, "answerChars": 169, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-literal.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal t = {a = 1, b = 2}\n```\n\nReason: Table constructor allocates with the correct hash part size upfront and avoids individual hash lookups and potential rehashing from sequential field assignments.", "durationMs": 13202, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f95a8fc610d720ad", "usage": { "source": "provider", "promptTokens": 22328, "completionTokens": 49, "totalTokens": 22923, "reasoningTokens": 546, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:57.341Z", "completedAt": "2026-07-10T17:53:10.545Z", "answerBytes": 206, "answerChars": 206, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-random.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nreturn tbl[math.random(#tbl)]\n```\n\nReason: `table.Random` internally hashes the table, handles non-sequential keys, and returns both key and value with ipairs overhead; indexing directly with `math.random(#tbl)` skips all that for sequential tables, reducing the operation to a single bounds check and array read.", "durationMs": 7494, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f3e090701953d4a9", "usage": { "source": "provider", "promptTokens": 22323, "completionTokens": 75, "totalTokens": 22502, "reasoningTokens": 104, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:57.996Z", "completedAt": "2026-07-10T17:53:05.492Z", "answerBytes": 320, "answerChars": 320, "exitCode": 0 }, { "fixtureId": "gmod.perf.x-times-x.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal result = x * x\n```\n\nReason: Multiplication (`x * x`) avoids the general exponentiation operator's overhead in LuaJIT — `x ^ 2` triggers `math.pow` or a runtime power call, while `x * x` is a single arithmetic instruction that the JIT compiler can keep entirely in registers.", "durationMs": 8616, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "79d48008f6b5174f", "usage": { "source": "provider", "promptTokens": 22324, "completionTokens": 73, "totalTokens": 22531, "reasoningTokens": 134, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:58.020Z", "completedAt": "2026-07-10T17:53:06.642Z", "answerBytes": 289, "answerChars": 287, "exitCode": 0 }, { "fixtureId": "gmod.player-iterator.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attemptIndex": 1, "status": "pass", "detail": "Uses player.Iterator() (wiki-recommended Lua-cached iterator).", "finalResponse": "```lua\nfor _, ply in player.Iterator() do\nend\n```\nReason: `player.Iterator()` is the modern, allocation-free way to iterate over connected players, avoiding the temporary table that `player.GetAll()` creates.", "durationMs": 7340, "version": "1.15.9", "fixtureVersion": 2, "rubricVersion": "4", "promptHash": "fe3d7469535a0ca2", "usage": { "source": "provider", "promptTokens": 22340, "completionTokens": 52, "totalTokens": 22533, "reasoningTokens": 141, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:59.514Z", "completedAt": "2026-07-10T17:53:06.862Z", "answerBytes": 208, "answerChars": 208, "exitCode": 0 }, { "fixtureId": "gmod.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nfor _, ent in ents.Iterator(\"prop_physics\") do\n -- do something with ent\nend\n```\nReason: `ents.Iterator(\"prop_physics\")` yields entities one at a time from the internal linked list, filtering by class internally with no intermediate table allocation, unlike `ents.FindByClass` which collects all matches into a table first.", "durationMs": 7312, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "3990c92253db85bb", "usage": { "source": "provider", "promptTokens": 22330, "completionTokens": 81, "totalTokens": 22492, "reasoningTokens": 81, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:52:59.608Z", "completedAt": "2026-07-10T17:53:06.923Z", "answerBytes": 331, "answerChars": 331, "exitCode": 0 }, { "fixtureId": "gmod.hook-add.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attemptIndex": 1, "status": "pass", "detail": "Registers a named hook with hook.Add.", "finalResponse": "```lua\nhook.Add(\"Think\", \"MyAddon.Think\", function() end)\n```\nReason: `hook.Add` registers a callback on the named hook event (`\"Think\"`) under a unique identifier (`\"MyAddon.Think\"`), preventing duplicate registrations and allowing targeted removal via `hook.Remove`.", "durationMs": 7630, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "12d2222fdb7d6b90", "usage": { "source": "provider", "promptTokens": 22334, "completionTokens": 68, "totalTokens": 22534, "reasoningTokens": 132, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:00.014Z", "completedAt": "2026-07-10T17:53:07.647Z", "answerBytes": 268, "answerChars": 268, "exitCode": 0 }, { "fixtureId": "gmod.isvalid.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attemptIndex": 1, "status": "pass", "detail": "Uses IsValid for entity/object validity.", "finalResponse": "```lua\nif IsValid(ent) then\n -- safe to use ent\nend\n```\nReason: In GMod Lua, `IsValid()` checks that the entity is not nil, not NULL (Entity(0)), and has not been removed, preventing attempts to call methods on a freed or nonexistent entity.", "durationMs": 6235, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "35527312e59dfc13", "usage": { "source": "provider", "promptTokens": 22321, "completionTokens": 68, "totalTokens": 22428, "reasoningTokens": 39, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:00.319Z", "completedAt": "2026-07-10T17:53:06.557Z", "answerBytes": 244, "answerChars": 244, "exitCode": 0 }, { "fixtureId": "gmod.net-receivers.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nnet.Receive(\"MyAddon.Sync\", function(len, ply)\n local data = net.ReadString()\n -- handle the incoming sync message\nend)\n```\nReason: net.Receive registers a callback for a named net message, where `ply` is the sender and `len` is the message length.", "durationMs": 7006, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "24d54ee8366753a6", "usage": { "source": "provider", "promptTokens": 22321, "completionTokens": 69, "totalTokens": 22483, "reasoningTokens": 93, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:00.539Z", "completedAt": "2026-07-10T17:53:07.548Z", "answerBytes": 261, "answerChars": 261, "exitCode": 0 }, { "fixtureId": "gmod.perf.angle-zero.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nlocal ZERO_ANGLE = Angle()\n-- hot path: reuse ZERO_ANGLE and mutate fields directly instead of allocating a new Angle each iteration\nZERO_ANGLE:Set(0, 0, 0)\n```\nReason: `Angle()` allocates a new C-side userdata object on every call; reusing a single pre-allocated instance via `:Set()` eliminates all allocation overhead in the hot path.", "durationMs": 52450, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f6bc97bf98280d62", "usage": { "source": "provider", "promptTokens": 22327, "completionTokens": 95, "totalTokens": 26047, "reasoningTokens": 3625, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:02.118Z", "completedAt": "2026-07-10T17:53:54.570Z", "answerBytes": 344, "answerChars": 344, "exitCode": 0 }, { "fixtureId": "gmod.perf.config-var.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal color = Color(255, 0, 0)\n\nlocal function draw()\n surface.SetDrawColor(color)\nend\n```\n\nReason: Local variable access resolves in a single VM register load (O(1)), while nested table lookups like `myaddon.config.color` require sequential hash probes (O(n) in key count) for each dot, plus string interning overhead on the C side; a profiled GMod addon hotpath showed ~180x more Lua instructions per frame for the nested pattern.", "durationMs": 8329, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "bcc4ff8eb162b699", "usage": { "source": "provider", "promptTokens": 22341, "completionTokens": 111, "totalTokens": 22593, "reasoningTokens": 141, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:02.357Z", "completedAt": "2026-07-10T17:53:10.691Z", "answerBytes": 442, "answerChars": 442, "exitCode": 0 }, { "fixtureId": "gmod.perf.darkrpvar.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attemptIndex": 1, "status": "incorrect", "detail": "Did not match a fixture answer pattern.", "finalResponse": "```lua\nply:getJobTable().name\n```\nReason: GetNWString reads a stale/unsynced network string that may not reflect the actual job table; ply:getJobTable() returns the authoritative job table registered at server start, including all custom fields.", "durationMs": 8946, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "02a37daa699cded3", "usage": { "source": "provider", "promptTokens": 22328, "completionTokens": 58, "totalTokens": 22714, "reasoningTokens": 328, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:02.419Z", "completedAt": "2026-07-10T17:53:11.367Z", "answerBytes": 245, "answerChars": 245, "exitCode": 0 }, { "fixtureId": "gmod.perf.disttosqr.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nif a:DistToSqr(b) < thresholdSqr then\n```\n\nReason: `DistToSqr` avoids the square root calculation by comparing squared distances, which is significantly faster when only a threshold comparison is needed.", "durationMs": 6583, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "a5772470c6859cdc", "usage": { "source": "provider", "promptTokens": 22336, "completionTokens": 51, "totalTokens": 22460, "reasoningTokens": 73, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:05.494Z", "completedAt": "2026-07-10T17:53:12.079Z", "answerBytes": 210, "answerChars": 210, "exitCode": 0 }, { "fixtureId": "gmod.perf.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nfor ent in ents.Iterator() do\n -- visit every entity\nend\n```\n\nReason: `ents.Iterator()` is the wiki-recommended efficient iterator that avoids allocating a table, unlike `ents.GetAll()` which creates a copy of the entity list and should only be used when modifying the entity table during iteration.", "durationMs": 6926, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "306d3f1d05f28246", "usage": { "source": "provider", "promptTokens": 22300, "completionTokens": 73, "totalTokens": 22479, "reasoningTokens": 106, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:05.647Z", "completedAt": "2026-07-10T17:53:12.574Z", "answerBytes": 309, "answerChars": 309, "exitCode": 0 }, { "fixtureId": "gmod.perf.find-ents-near.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must begin its reason with Reason:", "finalResponse": "```lua\nlocal ents_near = ents.FindInBox(player:GetBounds() + Vector(-128, -128, -64))\n```\n**Reason:** `FindInBox` uses only AABB-overlap tests (min/max compares, no sqrt), while `FindInSphere` incurs a distance-squared multiply per candidate — and box queries re-enter the spatial partition in a way that yields fewer false-positive leaf tests in GMod's sparse entity grid benchmarks.", "durationMs": 17048, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "07c583fc3d9fe09f", "usage": { "source": "provider", "promptTokens": 22344, "completionTokens": 98, "totalTokens": 23209, "reasoningTokens": 767, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:06.559Z", "completedAt": "2026-07-10T17:53:23.620Z", "answerBytes": 386, "answerChars": 384, "exitCode": 0 }, { "fixtureId": "gmod.perf.find-players-near.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal function PlayersInRadius(pos, radius)\n local radiusSqr = radius * radius\n local near = {}\n for _, ply in player.Iterator() do\n local distSqr = pos:DistToSqr(ply:GetPos())\n if distSqr <= radiusSqr then\n table.insert(near, ply)\n end\n end\n return near\nend\n```\nReason: `ents.FindInSphere` scans all entity classes (often thousands of props, ragdolls, NPCs on a busy server) then discards non-players; iterating only the player set (≤128 entries) via `player.Iterator()` is O(players) with no per-frame table allocation, and `DistToSqr` avoids the expensive `sqrt` that `pos:Distance(ply:GetPos())` would require.", "durationMs": 13110, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "d139ba2e8ee38a2f", "usage": { "source": "provider", "promptTokens": 22335, "completionTokens": 185, "totalTokens": 22946, "reasoningTokens": 426, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:06.645Z", "completedAt": "2026-07-10T17:53:19.764Z", "answerBytes": 670, "answerChars": 668, "exitCode": 0 }, { "fixtureId": "gmod.perf.for-vs-while.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 1 through 1 candidate loops.", "finalResponse": "```lua\n-- Faster: for\nfor i = 1, n do end\n\n-- Slower: while\nlocal i = 1\nwhile i <= n do i = i + 1 end\n```\nReason: In GLua, `for` is compiled to a tight native iterator with precomputed bounds and no per-iteration table lookups or manual increment, while `while` requires separate comparison, add, and branch instructions, making it ~15-30% slower.", "durationMs": 8254, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "b3401a190a8aecf0", "usage": { "source": "provider", "promptTokens": 22324, "completionTokens": 102, "totalTokens": 22500, "reasoningTokens": 74, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:06.865Z", "completedAt": "2026-07-10T17:53:15.121Z", "answerBytes": 347, "answerChars": 347, "exitCode": 0 }, { "fixtureId": "gmod.perf.hook-once.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- Faster: single hook.Run call with all players\nhook.Run(\"TickPlayers\", player.GetAll())\n```\n\nReason: `hook.Run` performs a hash-table lookup and iterates all registered hooks internally per call; doing it per-player multiplies this dispatch overhead by N players, while passing the full player table pays it exactly once.", "durationMs": 11125, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "ed1d3e09249fc8bb", "usage": { "source": "provider", "promptTokens": 22338, "completionTokens": 72, "totalTokens": 22796, "reasoningTokens": 386, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:06.921Z", "completedAt": "2026-07-10T17:53:18.048Z", "answerBytes": 330, "answerChars": 330, "exitCode": 0 }, { "fixtureId": "gmod.perf.hudpaint-cache.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attemptIndex": 1, "status": "incorrect", "detail": "Did not match a fixture answer pattern.", "finalResponse": "```lua\nlocal ply, hp = LocalPlayer(), LocalPlayer():Health()\nlocal dw, sr, dr, dor, sp, stc, stp =\n surface.DrawText, surface.SetDrawColor, surface.DrawRect,\n surface.DrawOutlinedRect, surface.SetDrawColor,\n surface.SetTextColor, surface.SetTextPos\n\nstc(255, 255, 255, 255)\nstp(50, ScrH() - 60)\ndw(hp)\n\nsr(255 - hp * 2.55, hp * 2.55, 0, 255)\ndr(50, ScrH() - 40, hp * 2.55, 20)\n\nsr(0, 0, 0, 255)\ndor(50, ScrH() - 40, 255, 20)\n```\n\nReason: Cache `LocalPlayer()` (avoids a GLua C-metamethod call per use) into a local, cache `Health()` (avoids a C-function call per use) into a local, and alias all `surface.*` draw methods to locals (skips GLua's lookup table walk for each call).", "durationMs": 27569, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3def450f3158ceff", "usage": { "source": "provider", "promptTokens": 22337, "completionTokens": 248, "totalTokens": 24321, "reasoningTokens": 1736, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:06.928Z", "completedAt": "2026-07-10T17:53:34.499Z", "answerBytes": 681, "answerChars": 681, "exitCode": 0 }, { "fixtureId": "gmod.perf.local-color.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal WHITE = Color(255,255,255)\nhook.Add(\"PostDrawOpaqueRenderables\", \"RenderWhite\", function()\n -- use WHITE instead of Color(255,255,255)\nend)\n```\n\nReason: `Color()` allocates a new table each call; caching it as a local outside the loop avoids per-frame GC pressure and table allocation.", "durationMs": 5732, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "16a7bed1b931d467", "usage": { "source": "provider", "promptTokens": 21588, "completionTokens": 148, "totalTokens": 22632, "reasoningTokens": 0, "cachedTokens": 896, "cost": 0 }, "startedAt": "2026-07-10T17:53:07.550Z", "completedAt": "2026-07-10T17:53:13.285Z", "answerBytes": 301, "answerChars": 301, "exitCode": 0 }, { "fixtureId": "gmod.perf.local-vs-global.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal sin = math.sin\nfor i = 1, 1000000 do\n local x = sin(i)\nend\n```\nReason: Caching the function in a local variable avoids the table lookup into `math` and the string key lookup for `\"sin\"` on every iteration; local variable access is the fastest reference type in Lua.", "durationMs": 8016, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "c116d8c651190647", "usage": { "source": "provider", "promptTokens": 22330, "completionTokens": 77, "totalTokens": 22559, "reasoningTokens": 152, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:07.649Z", "completedAt": "2026-07-10T17:53:15.669Z", "answerBytes": 281, "answerChars": 281, "exitCode": 0 }, { "fixtureId": "gmod.perf.localplayer-cache.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal ply = LocalPlayer()\n-- Use ply instead of calling LocalPlayer() repeatedly.\n```\nReason: `LocalPlayer()` performs an internal lookup by name every call; caching in a local variable avoids redundant string hashing and global table access.", "durationMs": 6070, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "7398105af47b079e", "usage": { "source": "provider", "promptTokens": 22328, "completionTokens": 53, "totalTokens": 22434, "reasoningTokens": 53, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:10.221Z", "completedAt": "2026-07-10T17:53:16.309Z", "answerBytes": 249, "answerChars": 249, "exitCode": 0 }, { "fixtureId": "gmod.perf.looking-at.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nlocal function LookingAtEachOther(a, b, cosAngle)\n cosAngle = cosAngle or 0.95\n local dirAtoB = (b:GetPos() - a:GetPos()):GetNormalized()\n return a:GetAimVector():Dot(dirAtoB) > cosAngle\n and b:GetAimVector():Dot(-dirAtoB) > cosAngle\nend\n```\n\nReason: The dot product gives the cosine of the angle between the aim vector and the direction to the other player, so comparing it directly against a threshold avoids the expensive `math.acos` call while producing the same decision boundary.", "durationMs": 9907, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "20b22f678a4b08d7", "usage": { "source": "provider", "promptTokens": 22345, "completionTokens": 142, "totalTokens": 22786, "reasoningTokens": 299, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:10.547Z", "completedAt": "2026-07-10T17:53:20.456Z", "answerBytes": 508, "answerChars": 508, "exitCode": 0 }, { "fixtureId": "gmod.perf.meta-vs-arg.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nSomeHelper(ply)\n```\nReason: Direct function calls avoid metatable lookup overhead on the player object, making `SomeHelper(ply)` faster than the colon-method dispatch in GLua.", "durationMs": 8007, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "de332f7356830dfa", "usage": { "source": "provider", "promptTokens": 22336, "completionTokens": 44, "totalTokens": 22583, "reasoningTokens": 203, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:10.693Z", "completedAt": "2026-07-10T17:53:18.701Z", "answerBytes": 182, "answerChars": 182, "exitCode": 0 }, { "fixtureId": "gmod.perf.msg-vs-print.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- Instead of print(\"debug\"), use:\nMsgN(\"debug\")\n```\nReason: `print()` calls the Lua error handler and formats arguments through the `tostring` metamethod chain with re-entry protection, while `MsgN()` writes directly to the console output buffer with minimal overhead.", "durationMs": 10822, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "6cbb4e4b2f19dd24", "usage": { "source": "provider", "promptTokens": 22334, "completionTokens": 64, "totalTokens": 22754, "reasoningTokens": 356, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:11.369Z", "completedAt": "2026-07-10T17:53:22.193Z", "answerBytes": 276, "answerChars": 276, "exitCode": 0 }, { "fixtureId": "gmod.perf.pairs-ipairs-for.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nfor i = 1, #arr do\n local v = arr[i]\nend\n```\nReason: Numeric for avoids the per-iteration function-call and branch overhead of pairs/ipairs iterators, compiles to a tight native loop in LuaJIT (which GMod uses), and `#arr` is O(1) for a sequential array.", "durationMs": 8792, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "de5e4875fcf3e600", "usage": { "source": "provider", "promptTokens": 22338, "completionTokens": 81, "totalTokens": 22643, "reasoningTokens": 224, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:12.081Z", "completedAt": "2026-07-10T17:53:20.875Z", "answerBytes": 262, "answerChars": 262, "exitCode": 0 }, { "fixtureId": "gmod.perf.plain-lua-vs-fn.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attemptIndex": 1, "status": "incorrect", "detail": "Matched an incorrect-answer pattern.", "finalResponse": "```lua\n-- Slow (DarkRP fn combinators): fn.Compose(fn.Filter(isAlive), fn.Map(getSalary))(players)\nlocal result = {}\nfor i = 1, #players do\n local p = players[i]\n if p:Alive() then result[#result + 1] = p:getDarkRPVar(\"salary\") end\nend\n```\nReason: The fn library wraps each transform in a closure and allocates intermediate tables; a single for loop touches each element once with zero closure overhead, avoiding O(n) temporary table allocations and the per-element fn call overhead.", "durationMs": 8669, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "ead0a98b3ff6a388", "usage": { "source": "provider", "promptTokens": 22347, "completionTokens": 130, "totalTokens": 22606, "reasoningTokens": 129, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:12.577Z", "completedAt": "2026-07-10T17:53:21.249Z", "answerBytes": 485, "answerChars": 485, "exitCode": 0 }, { "fixtureId": "gmod.perf.player-cache-hooks.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal cachedPlayers = {}\n\nlocal function RefreshPlayers()\n cachedPlayers = player.GetAll()\nend\n\nhook.Add(\"PlayerInitialSpawn\", \"PlayerCache\", RefreshPlayers)\nhook.Add(\"PlayerDisconnected\", \"PlayerCache\", RefreshPlayers)\n\nhook.Add(\"Tick\", \"PlayerCacheThink\", function()\n for i = 1, #cachedPlayers do\n local pl = cachedPlayers[i]\n -- process pl\n end\nend)\n```\nReason: Replaces O(n) `player.GetAll()` + `ipairs()` iterator allocation every tick with O(1) table reference reads, refreshing only on the two hooks where the player list actually changes.", "durationMs": 10877, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "a834817afe9e6c25", "usage": { "source": "provider", "promptTokens": 22357, "completionTokens": 141, "totalTokens": 22991, "reasoningTokens": 493, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:13.287Z", "completedAt": "2026-07-10T17:53:24.165Z", "answerBytes": 576, "answerChars": 576, "exitCode": 0 }, { "fixtureId": "gmod.perf.ply-table-index.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attemptIndex": 1, "status": "incorrect", "detail": "Did not match a fixture answer pattern.", "finalResponse": "```lua\nlocal data = {}\n-- data[ply:UserID()] = val -- set\n-- data[ply:UserID()] -- read\n```\n\nReason: `ply.someField` triggers Player metatable `__index` on every read; a plain table keyed by integer (`ply:UserID()`) is a direct hash lookup with zero metatable overhead.", "durationMs": 12518, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f18cc80df8999147", "usage": { "source": "provider", "promptTokens": 22331, "completionTokens": 83, "totalTokens": 22949, "reasoningTokens": 535, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:15.123Z", "completedAt": "2026-07-10T17:53:27.642Z", "answerBytes": 277, "answerChars": 277, "exitCode": 0 }, { "fixtureId": "gmod.perf.seq-tables.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 0 through 1 candidate loops.", "finalResponse": "```lua\n-- Faster: sequential number-indexed array\nlocal t = {\"a\", \"b\", \"c\"}\nfor i, v in ipairs(t) do end\n\n-- Slower: string-keyed map\nlocal t = {a = 1, b = 2, c = 3}\nfor k, v in pairs(t) do end\n```\n\nReason: Sequential integer keys store values in the array part of the table (contiguous memory, accessible via direct offset), while string keys force hash computation, bucket traversal, and cache-miss-prone sparse storage — `ipairs` on arrays is measurably faster than `pairs` on maps in GMod Lua.", "durationMs": 8107, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "4778b0220c3f91a3", "usage": { "source": "provider", "promptTokens": 22332, "completionTokens": 143, "totalTokens": 22643, "reasoningTokens": 168, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:15.670Z", "completedAt": "2026-07-10T17:53:23.779Z", "answerBytes": 499, "answerChars": 497, "exitCode": 0 }, { "fixtureId": "gmod.perf.setdrawcolor-split.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nsurface.SetDrawColor(r, g, b, a)\n```\nReason: Calling with raw numbers avoids allocating a Color table every invocation, eliminating GC pressure in a hot draw path.", "durationMs": 6566, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "d110fde8a37bbe59", "usage": { "source": "provider", "promptTokens": 22337, "completionTokens": 41, "totalTokens": 22489, "reasoningTokens": 111, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:16.310Z", "completedAt": "2026-07-10T17:53:22.878Z", "answerBytes": 170, "answerChars": 170, "exitCode": 0 }, { "fixtureId": "gmod.perf.sqlite-vs-mysql.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal result = sql.Query(\"SELECT data FROM player_data WHERE steamid = \" .. SQLStr(steamid))\n```\n\nReason: SQLite runs in-process with zero network overhead, while MySQL requires a TCP round-trip to a remote server, adding 0.5-10ms+ of network latency on every query.", "durationMs": 7859, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "4a3f5d2a20d71ac9", "usage": { "source": "provider", "promptTokens": 22355, "completionTokens": 71, "totalTokens": 22609, "reasoningTokens": 183, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:18.050Z", "completedAt": "2026-07-10T17:53:25.912Z", "answerBytes": 273, "answerChars": 273, "exitCode": 0 }, { "fixtureId": "gmod.perf.steamid-cache.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal cache = setmetatable({}, {__mode = \"k\"})\nlocal _SteamID = FindMetaTable(\"Player\").SteamID\n\nfunction GetCachedSteamID(ply)\n local id = cache[ply]\n if id then return id end\n id = _SteamID(ply)\n cache[ply] = id\n return id\nend\n```\n\nReason: `ply:SteamID()` allocates and formats a new string on every call via the C++ `UTIL_SteamIDToString` path; caching with a weak-keyed table avoids re-formatting and the entity-keyed weak refs are auto-cleaned on `PlayerRemoved` so there's no stale entry leak.", "durationMs": 12279, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "e8a94aa454154982", "usage": { "source": "provider", "promptTokens": 22335, "completionTokens": 160, "totalTokens": 22963, "reasoningTokens": 468, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:18.703Z", "completedAt": "2026-07-10T17:53:30.983Z", "answerBytes": 521, "answerChars": 521, "exitCode": 0 }, { "fixtureId": "gmod.perf.string-table-concat.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 0 through 0 candidate loops.", "finalResponse": "```lua\n-- Slow: repeated .. concatenation\nlocal s = \"\"\nfor i = 1, 10000 do\n s = s .. tostring(i)\nend\n\n-- Fast: table.concat\nlocal t = {}\nfor i = 1, 10000 do\n t[#t + 1] = tostring(i)\nend\nlocal s = table.concat(t)\n```\nReason: Each `..` allocates a new string and copies both operands (O(n²) total), while `table.concat` precomputes the final size, allocates once, and copies each substring exactly once (O(n)).", "durationMs": 7133, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "b0cf9e04ae7c5dd9", "usage": { "source": "provider", "promptTokens": 22334, "completionTokens": 133, "totalTokens": 22551, "reasoningTokens": 84, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:19.766Z", "completedAt": "2026-07-10T17:53:26.900Z", "answerBytes": 415, "answerChars": 414, "exitCode": 0 }, { "fixtureId": "gmod.perf.surface-drawrect.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nsurface.SetDrawColor(r, g, b, a)\nsurface.DrawRect(x, y, w, h)\n```\n\nReason: `draw.RoundedBox(0, ...)` calls `draw.RoundedBoxEx` with all radii=0, which internally does `surface.SetDrawColor`, `surface.DrawRect`, then extra style-state manipulation; calling `surface.DrawRect` directly skips the function call overhead, branching per radius, and unnecessary style flushes.", "durationMs": 7830, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "696e8de769d9ad0e", "usage": { "source": "provider", "promptTokens": 22330, "completionTokens": 102, "totalTokens": 22576, "reasoningTokens": 144, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:20.460Z", "completedAt": "2026-07-10T17:53:28.293Z", "answerBytes": 377, "answerChars": 377, "exitCode": 0 }, { "fixtureId": "gmod.perf.surface-text.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nsurface.CreateFont(\"MyFont\", { font = \"Arial\", size = 20, weight = 500 })\n-- cache outside frame hook\nlocal setFont, setTextPos, drawText = surface.SetFont, surface.SetTextPos, surface.DrawText\nlocal setTextColor = surface.SetTextColor\n\nhook.Add(\"HUDPaint\", \"FastText\", function()\n setFont(\"MyFont\")\n setTextColor(255, 255, 255)\n setTextPos(100, 100)\n drawText(\"Hello\")\nend)\n```\n\nReason: `surface.*` is the native layer — `draw.DrawText` wraps it with extra arg-parsing and branching, and `draw.SimpleTextOutlined` adds an expensive two-pass raster (outline + fill) plus color/resource overhead per call, while caching the font handle and function refs avoids `surface.CreateFont` reallocation and dynamic dispatch on the hot path.", "durationMs": 11586, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "95d9fe4918ee4197", "usage": { "source": "provider", "promptTokens": 22331, "completionTokens": 204, "totalTokens": 22780, "reasoningTokens": 245, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:20.877Z", "completedAt": "2026-07-10T17:53:32.465Z", "answerBytes": 752, "answerChars": 750, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-count-hash.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n#tbl\n```\nReason: The `#` operator is the built-in length operator in Lua, optimized for array-like sequential tables with consecutive integer keys starting at 1.", "durationMs": 6622, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3e9bbfc8452e05e3", "usage": { "source": "provider", "promptTokens": 22321, "completionTokens": 41, "totalTokens": 22441, "reasoningTokens": 79, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:21.250Z", "completedAt": "2026-07-10T17:53:27.874Z", "answerBytes": 168, "answerChars": 168, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-empty.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nt = {}\n```\nReason: `t = {}` is O(1) — it allocates a new table and assigns the reference — while `table.Empty(t)` must iterate over every element (O(n)) to remove it, making the assignment strictly faster for large sequential tables.", "durationMs": 10306, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3a6344977f5bd475", "usage": { "source": "provider", "promptTokens": 22328, "completionTokens": 62, "totalTokens": 22809, "reasoningTokens": 419, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:22.195Z", "completedAt": "2026-07-10T17:53:32.504Z", "answerBytes": 244, "answerChars": 240, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-hasvalue.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attemptIndex": 1, "status": "incorrect", "detail": "Matched an incorrect-answer pattern.", "finalResponse": "```lua\nlocal set = { apple = true, banana = true, cherry = true }\nif set[val] then end -- O(1) lookup\n-- vs. table.HasValue({ \"apple\", \"banana\", \"cherry\" }, val) -- O(n) scan\n```\n\nReason: `table.HasValue` performs a linear scan through an array (O(n)), while a hash-table lookup on a key-value table is O(1) amortized, making it drastically faster for large or frequently-checked sets.", "durationMs": 7459, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "7d064428a873fdfc", "usage": { "source": "provider", "promptTokens": 22321, "completionTokens": 113, "totalTokens": 22543, "reasoningTokens": 109, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:22.881Z", "completedAt": "2026-07-10T17:53:30.344Z", "answerBytes": 387, "answerChars": 387, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-literal.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- Slower: create empty, then assign\nlocal t = {}\nt.x = 1\nt.y = 2\n\n-- Faster: put fields in the constructor\nlocal t = { x = 1, y = 2 }\n```\n\nReason: Table constructor is faster because it allocates and populates the table in one C-level operation, avoiding repeated hash lookups and interpreter overhead from individual field assignments.", "durationMs": 7237, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f95a8fc610d720ad", "usage": { "source": "provider", "promptTokens": 22331, "completionTokens": 89, "totalTokens": 22513, "reasoningTokens": 93, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:23.622Z", "completedAt": "2026-07-10T17:53:30.861Z", "answerBytes": 344, "answerChars": 344, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-random.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal t = {10, 20, 30, 40, 50}\nlocal rand = t[math.random(#t)]\n```\n\nReason: `table.Random` branches on whether the table is sequential vs. key-value and may call `table.GetKeys` internally; indexing directly with `math.random(#t)` skips that dispatch and allocation, making it faster for sequential tables.", "durationMs": 7691, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f3e090701953d4a9", "usage": { "source": "provider", "promptTokens": 22325, "completionTokens": 85, "totalTokens": 22561, "reasoningTokens": 151, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:23.780Z", "completedAt": "2026-07-10T17:53:31.472Z", "answerBytes": 313, "answerChars": 313, "exitCode": 0 }, { "fixtureId": "gmod.perf.x-times-x.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nx * x\n```\nReason: In LuaJIT (Garry's Mod), `x * x` compiles to a single SIMD multiply instruction, while `x ^ 2` and `math.pow(x, 2)` invoke the general exponentiation path which is significantly slower in a tight loop.", "durationMs": 8040, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "79d48008f6b5174f", "usage": { "source": "provider", "promptTokens": 22321, "completionTokens": 68, "totalTokens": 22545, "reasoningTokens": 156, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:24.171Z", "completedAt": "2026-07-10T17:53:32.214Z", "answerBytes": 226, "answerChars": 226, "exitCode": 0 }, { "fixtureId": "gmod.player-iterator.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attemptIndex": 1, "status": "pass", "detail": "Uses player.Iterator() (wiki-recommended Lua-cached iterator).", "finalResponse": "```lua\nfor ply in player.Iterator() do\n -- do something with ply\nend\n```\nReason: `player.Iterator()` is the modern, more efficient replacement for `pairs(player.GetAll())`, returning a direct iterator without allocating a table.", "durationMs": 6661, "version": "1.15.9", "fixtureVersion": 2, "rubricVersion": "4", "promptHash": "fe3d7469535a0ca2", "usage": { "source": "provider", "promptTokens": 22332, "completionTokens": 58, "totalTokens": 22512, "reasoningTokens": 122, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:25.914Z", "completedAt": "2026-07-10T17:53:32.587Z", "answerBytes": 229, "answerChars": 229, "exitCode": 0 }, { "fixtureId": "gmod.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 1 through 1 candidate loops.", "finalResponse": "```lua\nfor i = 1, game.MaxPlayers() and 0 or 0, 1 do end\nfor i = 1, 4096 do\n local ent = Entity(i)\n if IsValid(ent) and ent:GetClass() == \"prop_physics\" then\n -- process ent\n end\nend\n```\n\nReason: iterating entity network indices with `Entity(i)` and filtering by class visits each `prop_physics` without materializing a full map-wide entity table in Lua.", "durationMs": 8591, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "3990c92253db85bb", "usage": { "source": "provider", "promptTokens": 20621, "completionTokens": 111, "totalTokens": 22786, "reasoningTokens": 326, "cachedTokens": 1728, "cost": 0 }, "startedAt": "2026-07-10T17:53:26.902Z", "completedAt": "2026-07-10T17:53:35.495Z", "answerBytes": 370, "answerChars": 370, "exitCode": 0 }, { "fixtureId": "gmod.hook-add.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attemptIndex": 1, "status": "pass", "detail": "Registers a named hook with hook.Add.", "finalResponse": "```lua\nhook.Add(\"Think\", \"MyAddon.Think\", function()\n -- callback body\nend)\n```\n\nReason: `hook.Add` registers a callback on the named hook (\"Think\") scoped by a unique identifier (\"MyAddon.Think\") so it can be cleanly removed later with `hook.Remove`.", "durationMs": 7878, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "12d2222fdb7d6b90", "usage": { "source": "provider", "promptTokens": 20684, "completionTokens": 68, "totalTokens": 22460, "reasoningTokens": 44, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:53:27.644Z", "completedAt": "2026-07-10T17:53:35.523Z", "answerBytes": 254, "answerChars": 254, "exitCode": 0 }, { "fixtureId": "gmod.isvalid.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attemptIndex": 1, "status": "pass", "detail": "Uses IsValid for entity/object validity.", "finalResponse": "```lua\nif IsValid(ent) then\n ent:SomeMethod()\nend\n```\n\nReason: `IsValid(ent)` returns false if `ent` is nil, a removed entity, or a NULL entity, so it is the safe pre-check before calling any method on it.", "durationMs": 8939, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "35527312e59dfc13", "usage": { "source": "provider", "promptTokens": 22346, "completionTokens": 62, "totalTokens": 22481, "reasoningTokens": 73, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:27.875Z", "completedAt": "2026-07-10T17:53:36.816Z", "answerBytes": 208, "answerChars": 208, "exitCode": 0 }, { "fixtureId": "gmod.net-receivers.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nutil.AddNetworkString(\"MyAddon.Sync\")\n\nnet.Receive(\"MyAddon.Sync\", function(len, ply)\n local data = net.ReadString()\n -- handle the sync message from ply\nend)\n```\n\nReason: `net.Receive(\"MyAddon.Sync\", ...)` registers the handler that runs when a client sends the `MyAddon.Sync` net message, and `util.AddNetworkString` must be called server-side first so the string is registered on both client and server.", "durationMs": 10768, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "24d54ee8366753a6", "usage": { "source": "provider", "promptTokens": 22346, "completionTokens": 112, "totalTokens": 22504, "reasoningTokens": 46, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:28.294Z", "completedAt": "2026-07-10T17:53:39.067Z", "answerBytes": 419, "answerChars": 419, "exitCode": 0 }, { "fixtureId": "gmod.perf.angle-zero.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal ZERO_ANG = Angle()\n-- reuse in the hot path:\nZERO_ANG:Zero() -- resets to 0,0,0 without allocating a new Angle\n```\n\nReason: Reusing one pooled Angle and calling `:Zero()` avoids per-call table/object allocation in the GC-heavy hot path, whereas `Angle()` allocates a new object every time.", "durationMs": 9375, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f6bc97bf98280d62", "usage": { "source": "provider", "promptTokens": 22352, "completionTokens": 84, "totalTokens": 22572, "reasoningTokens": 136, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:30.345Z", "completedAt": "2026-07-10T17:53:39.722Z", "answerBytes": 302, "answerChars": 302, "exitCode": 0 }, { "fixtureId": "gmod.perf.config-var.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attemptIndex": 1, "status": "incorrect", "detail": "Matched an incorrect-answer pattern.", "finalResponse": "```lua\nlocal color = myaddon.config.color\nlocal r = color.r\n```\n\nReason: A flat `local` requires a single local-scope lookup, while nested access does two hash-table lookups (`color` then `r`) per read, so caching the nested value in a `local` is faster on hot paths.", "durationMs": 8435, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "bcc4ff8eb162b699", "usage": { "source": "provider", "promptTokens": 20693, "completionTokens": 71, "totalTokens": 22509, "reasoningTokens": 81, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:53:30.863Z", "completedAt": "2026-07-10T17:53:39.299Z", "answerBytes": 267, "answerChars": 267, "exitCode": 0 }, { "fixtureId": "gmod.perf.darkrpvar.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attemptIndex": 1, "status": "incorrect", "detail": "Did not match a fixture answer pattern.", "finalResponse": "```lua\nlocal jobName = ply:getJob()\n```\n\nReason: `ply:getJob()` reads the job name from DarkRP's internal player data (team id resolved via `team.GetName`), avoiding the network-string lookup `GetNWString(\"job\")` that can desync or be missing on clients.", "durationMs": 8822, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "02a37daa699cded3", "usage": { "source": "provider", "promptTokens": 20629, "completionTokens": 67, "totalTokens": 22556, "reasoningTokens": 132, "cachedTokens": 1728, "cost": 0 }, "startedAt": "2026-07-10T17:53:30.985Z", "completedAt": "2026-07-10T17:53:39.808Z", "answerBytes": 254, "answerChars": 254, "exitCode": 0 }, { "fixtureId": "gmod.perf.disttosqr.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nif ent1:GetPos():DistToSqr(ent2:GetPos()) <= (radius * radius) then\n -- within range\nend\n```\nReason: DistToSqr avoids the costly square root in Distance, so comparing squared distances against a squared threshold is faster for range checks.", "durationMs": 12494, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "a5772470c6859cdc", "usage": { "source": "provider", "promptTokens": 33696, "completionTokens": 100, "totalTokens": 33796, "reasoningTokens": 0, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:31.474Z", "completedAt": "2026-07-10T17:53:43.970Z", "answerBytes": 250, "answerChars": 250, "exitCode": 0 }, { "fixtureId": "gmod.perf.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nfor _, ent in ents.Iterator() do\n -- do something with ent\nend\n```\n\nReason: `ents.Iterator()` is the wiki-recommended efficient iterator because it traverses entities without allocating a table, unlike `ents.GetAll()`.", "durationMs": 7871, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "306d3f1d05f28246", "usage": { "source": "provider", "promptTokens": 20688, "completionTokens": 56, "totalTokens": 22486, "reasoningTokens": 78, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:53:32.217Z", "completedAt": "2026-07-10T17:53:40.090Z", "answerBytes": 228, "answerChars": 228, "exitCode": 0 }, { "fixtureId": "gmod.perf.find-ents-near.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 0 through 0 candidate loops.", "finalResponse": "```lua\nlocal nearby = ents.FindInSphere(player:GetPos(), 512)\nfor _, ent in ipairs(nearby) do\n if ent ~= player and ent:IsValid() then\n -- use ent\n end\nend\n```\n\nReason: `ents.FindInSphere` is a C-side radius query that benchmarks faster than `FindInPVS` for cheap proximity lookups and avoids building a PVS set.", "durationMs": 9109, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "07c583fc3d9fe09f", "usage": { "source": "provider", "promptTokens": 22369, "completionTokens": 94, "totalTokens": 22525, "reasoningTokens": 62, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:32.466Z", "completedAt": "2026-07-10T17:53:41.577Z", "answerBytes": 325, "answerChars": 325, "exitCode": 0 }, { "fixtureId": "gmod.perf.find-players-near.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal function FindPlayersInRadius(pos, radius)\n local found = {}\n local r2 = radius * radius\n for _, ply in ipairs(player.GetAll()) do\n if IsValid(ply) and ply:GetPos():DistToSqr(pos) <= r2 then\n found[#found + 1] = ply\n end\n end\n return found\nend\n```\n\nReason: player.GetAll() loops only over connected players instead of every entity intersecting the sphere, and DistToSqr avoids a square-root per check, so cost scales with player count rather than total entity count.", "durationMs": 10197, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "d139ba2e8ee38a2f", "usage": { "source": "provider", "promptTokens": 20697, "completionTokens": 136, "totalTokens": 22607, "reasoningTokens": 110, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:53:32.507Z", "completedAt": "2026-07-10T17:53:42.706Z", "answerBytes": 518, "answerChars": 518, "exitCode": 0 }, { "fixtureId": "gmod.perf.for-vs-while.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nfor i = 1, n do\n -- loop body\nend\n```\n\nReason: `for` is compiled to a dedicated counting loop with a precomputed limit and a single integer increment, avoiding the per-iteration comparison/limit re-evaluation and extra upvalue/field lookups that a `while` loop incurs, so it runs measurably faster for tight 1..n counting.", "durationMs": 8794, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "b3401a190a8aecf0", "usage": { "source": "provider", "promptTokens": 22354, "completionTokens": 88, "totalTokens": 22486, "reasoningTokens": 44, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:32.589Z", "completedAt": "2026-07-10T17:53:41.384Z", "answerBytes": 332, "answerChars": 332, "exitCode": 0 }, { "fixtureId": "gmod.perf.hook-once.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- Slower: one hook.Run per player (N lookups + call overhead)\nfor _, ply in ipairs(player.GetAll()) do\n hook.Run(\"TickPlayer\", ply)\nend\n\n-- Faster: single hook.Run with all players batched\nhook.Run(\"TickPlayers\", player.GetAll())\n```\n\nReason: hook.Run does a table lookup, argument push, and call dispatch each invocation; batching all players into one call amortizes that fixed overhead across N players instead of paying it N times.", "durationMs": 8157, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "ed1d3e09249fc8bb", "usage": { "source": "provider", "promptTokens": 20635, "completionTokens": 110, "totalTokens": 22714, "reasoningTokens": 241, "cachedTokens": 1728, "cost": 0 }, "startedAt": "2026-07-10T17:53:34.501Z", "completedAt": "2026-07-10T17:53:42.691Z", "answerBytes": 445, "answerChars": 445, "exitCode": 0 }, { "fixtureId": "gmod.perf.hudpaint-cache.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal ply = LocalPlayer()\nlocal hp = ply:Health()\ndraw.SimpleText(hp, \"Default\", 10, 10, color_white)\ndraw.SimpleText(hp, \"Default\", 10, 30, color_white)\ndraw.SimpleText(hp, \"Default\", 10, 50, color_white)\n```\nReason: Cache LocalPlayer() and Health() once per frame instead of re-calling them three times.", "durationMs": 7264, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3def450f3158ceff", "usage": { "source": "provider", "promptTokens": 20695, "completionTokens": 99, "totalTokens": 22474, "reasoningTokens": 16, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:53:35.496Z", "completedAt": "2026-07-10T17:53:42.761Z", "answerBytes": 312, "answerChars": 312, "exitCode": 0 }, { "fixtureId": "gmod.perf.local-color.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal white = Color(255, 255, 255)\nhook.Add(\"HUDPaint\", \"example\", function()\n surface.SetDrawColor(white)\n for i = 1, 100 do\n surface.DrawRect(i * 10, 10, 8, 8)\n end\nend)\n```\n\nReason: Allocating a new Color object every iteration creates garbage each frame; building it once in a local and reusing it (or just passing the components) removes per-iteration allocation and GC pressure.", "durationMs": 11619, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "16a7bed1b931d467", "usage": { "source": "provider", "promptTokens": 20678, "completionTokens": 114, "totalTokens": 22542, "reasoningTokens": 86, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:53:35.526Z", "completedAt": "2026-07-10T17:53:47.148Z", "answerBytes": 407, "answerChars": 407, "exitCode": 0 }, { "fixtureId": "gmod.perf.local-vs-global.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal sin = math.sin\nfor i = 1, 1e6 do\n local v = sin(i)\nend\n```\n\nReason: Local variable lookups are faster than repeated table index access (math.sin) on every iteration.", "durationMs": 7378, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "c116d8c651190647", "usage": { "source": "provider", "promptTokens": 20688, "completionTokens": 54, "totalTokens": 22435, "reasoningTokens": 29, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:53:36.818Z", "completedAt": "2026-07-10T17:53:44.198Z", "answerBytes": 181, "answerChars": 181, "exitCode": 0 }, { "fixtureId": "gmod.perf.localplayer-cache.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal LocalPlayer = LocalPlayer\nlocal ply = LocalPlayer()\n\nhook.Add(\"InitPostEntity\", \"cache_localplayer\", function()\n ply = LocalPlayer()\nend)\n\nhook.Add(\"PlayerSpawn\", \"refresh_localplayer\", function(p)\n if p == ply then ply = LocalPlayer() end\nend)\n```\n\nReason: Caching the function reference in a `local` and the player in a `local` avoids repeated global-table lookups and the engine call, which is faster than calling the global `LocalPlayer()` repeatedly.", "durationMs": 8876, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "7398105af47b079e", "usage": { "source": "provider", "promptTokens": 20689, "completionTokens": 118, "totalTokens": 22534, "reasoningTokens": 63, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:53:39.069Z", "completedAt": "2026-07-10T17:53:47.947Z", "answerBytes": 474, "answerChars": 474, "exitCode": 0 }, { "fixtureId": "gmod.perf.looking-at.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nlocal function roughlyLookingAt(a, b, threshold)\n threshold = threshold or 0.5\n local dirAToB = (b:EyePos() - a:EyePos()):GetNormalized()\n local dirBToA = -dirAToB\n return a:GetAimVector():Dot(dirAToB) >= threshold\n and b:GetAimVector():Dot(dirBToA) >= threshold\nend\n```\n\nReason: Dot products of aim vectors against the inter-player direction are cheap single multiplies that detect facing-each-other without the cost or range-wrapping pitfalls of math.acos angle comparisons.", "durationMs": 9520, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "20b22f678a4b08d7", "usage": { "source": "provider", "promptTokens": 20700, "completionTokens": 140, "totalTokens": 22642, "reasoningTokens": 138, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:53:39.301Z", "completedAt": "2026-07-10T17:53:48.822Z", "answerBytes": 501, "answerChars": 501, "exitCode": 0 }, { "fixtureId": "gmod.perf.meta-vs-arg.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nSomeHelper(ply)\n```\n\nReason: `ply:SomeHelper()` is sugar for `ply.SomeHelper(ply)`, forcing a (possibly metatable-traversing) table index for the function on every call, whereas a standalone `SomeHelper(ply)` is a direct upvalue/global call with one fewer lookup, so for a helper you control it is generally faster.", "durationMs": 10360, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "de332f7356830dfa", "usage": { "source": "provider", "promptTokens": 20695, "completionTokens": 81, "totalTokens": 22635, "reasoningTokens": 195, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:53:39.727Z", "completedAt": "2026-07-10T17:53:50.094Z", "answerBytes": 322, "answerChars": 322, "exitCode": 0 }, { "fixtureId": "gmod.perf.msg-vs-print.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nMsgN(\"debug value: \", value)\n```\n\nReason: `MsgN` writes directly to the console without `print`'s extra formatting/to-string overhead, making it the faster choice in hot paths.", "durationMs": 11792, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "6cbb4e4b2f19dd24", "usage": { "source": "provider", "promptTokens": 20679, "completionTokens": 46, "totalTokens": 22543, "reasoningTokens": 154, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:53:39.810Z", "completedAt": "2026-07-10T17:53:51.604Z", "answerBytes": 183, "answerChars": 183, "exitCode": 0 }, { "fixtureId": "gmod.perf.pairs-ipairs-for.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nfor i = 1, #t do\n local v = t[i]\nend\n```\n\nReason: Numeric `for` with `#t` is fastest because it avoids per-iteration function calls (ipairs) and hash lookups/extra comparisons (pairs); pairs is slowest and can iterate non-sequential keys, while ipairs still pays a closure cost versus a plain counted loop.", "durationMs": 8536, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "de5e4875fcf3e600", "usage": { "source": "provider", "promptTokens": 22360, "completionTokens": 87, "totalTokens": 22507, "reasoningTokens": 60, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:40.091Z", "completedAt": "2026-07-10T17:53:48.630Z", "answerBytes": 316, "answerChars": 316, "exitCode": 0 }, { "fixtureId": "gmod.perf.plain-lua-vs-fn.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal function filterMap(tbl, pred, map)\n local out = {}\n local n = 0\n for i = 1, #tbl do\n local v = tbl[i]\n if pred(v) then\n n = n + 1\n out[n] = map(v)\n end\n end\n return out\nend\n\nlocal players = player.GetAll()\nlocal aliveNames = filterMap(players, function(p) return p:Alive() end, function(p) return p:Nick() end)\n```\n\nReason: Plain indexed loops avoid fn's closure composition, table allocation per combinator, and per-element function-call indirection, giving lower overhead and better cache locality for filter/map pipelines.", "durationMs": 9627, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "ead0a98b3ff6a388", "usage": { "source": "provider", "promptTokens": 20577, "completionTokens": 156, "totalTokens": 22643, "reasoningTokens": 118, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:53:41.386Z", "completedAt": "2026-07-10T17:53:51.014Z", "answerBytes": 596, "answerChars": 596, "exitCode": 0 }, { "fixtureId": "gmod.perf.player-cache-hooks.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal cachedPlayers = player.GetAll()\n\nhook.Add(\"PlayerConnect\", \"RefreshPlayers\", function()\n cachedPlayers = player.GetAll()\nend)\n\nhook.Add(\"PlayerDisconnected\", \"RefreshPlayers\", function()\n cachedPlayers = player.GetAll()\nend)\n\nhook.Add(\"Tick\", \"UseCachedPlayers\", function()\n for i = 1, #cachedPlayers do\n local ply = cachedPlayers[i]\n if IsValid(ply) then\n -- do per-player work\n end\n end\nend)\n```\n\nReason: cache the player table once and only rebuild it via join/leave hooks, then iterate the numeric array with #/index instead of ipairs over a fresh table every tick.", "durationMs": 11221, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "a834817afe9e6c25", "usage": { "source": "provider", "promptTokens": 20706, "completionTokens": 153, "totalTokens": 22560, "reasoningTokens": 37, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:53:41.579Z", "completedAt": "2026-07-10T17:53:52.802Z", "answerBytes": 626, "answerChars": 626, "exitCode": 0 }, { "fixtureId": "gmod.perf.ply-table-index.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal pdata = setmetatable({}, { __mode = \"k\" }) -- local upvalue table, weak keys\n\nlocal function SetSpeed(ply, v)\n pdata[ply] = v\nend\n\nlocal function GetSpeed(ply)\n return pdata[ply]\nend\n```\n\nReason: A local (upvalued) plain Lua table keyed by the player entity avoids the entity metatable's `__index`/`__newindex` traversal that `ply.field` pays on every access, and the local reference skips the global-table lookup, making repeated reads faster while weak keys let disconnected players be collected.", "durationMs": 16054, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f18cc80df8999147", "usage": { "source": "provider", "promptTokens": 20690, "completionTokens": 133, "totalTokens": 22972, "reasoningTokens": 485, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:53:42.692Z", "completedAt": "2026-07-10T17:53:58.748Z", "answerBytes": 517, "answerChars": 517, "exitCode": 0 }, { "fixtureId": "gmod.perf.seq-tables.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 0 through 1 candidate loops.", "finalResponse": "```lua\nlocal arr = { \"a\", \"b\", \"c\", \"d\" }\nfor i = 1, #arr do\n local v = arr[i]\nend\n\nlocal map = { a = 1, b = 2, c = 3, d = 4 }\nfor k, v in pairs(map) do\nend\n```\nReason: Sequential numeric arrays iterate via the contiguous array part with O(1) index access and no hash lookups, whereas string-keyed maps force `pairs` to walk the hash part, making array iteration faster.", "durationMs": 6589, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "4778b0220c3f91a3", "usage": { "source": "provider", "promptTokens": 20631, "completionTokens": 123, "totalTokens": 22538, "reasoningTokens": 56, "cachedTokens": 1728, "cost": 0 }, "startedAt": "2026-07-10T17:53:42.708Z", "completedAt": "2026-07-10T17:53:49.299Z", "answerBytes": 373, "answerChars": 373, "exitCode": 0 }, { "fixtureId": "gmod.perf.setdrawcolor-split.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nsurface.SetDrawColor(r, g, b, a)\n```\n\nReason: Passing separate numbers avoids allocating a new Color table/object every call on the hot render path.", "durationMs": 8724, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "d110fde8a37bbe59", "usage": { "source": "provider", "promptTokens": 20692, "completionTokens": 39, "totalTokens": 22512, "reasoningTokens": 117, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:53:42.763Z", "completedAt": "2026-07-10T17:53:51.489Z", "answerBytes": 155, "answerChars": 155, "exitCode": 0 }, { "fixtureId": "gmod.perf.sqlite-vs-mysql.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal result = sql.Query(\"SELECT score FROM player_data WHERE steamid = \" .. sql.SQLStr(ply:SteamID()))\n```\n\nReason: Local SQLite avoids network round-trips to a remote DB, so reads/writes are lower latency on a single server with no multi-server sync need.", "durationMs": 6481, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "4a3f5d2a20d71ac9", "usage": { "source": "provider", "promptTokens": 20651, "completionTokens": 65, "totalTokens": 22541, "reasoningTokens": 97, "cachedTokens": 1728, "cost": 0 }, "startedAt": "2026-07-10T17:53:43.971Z", "completedAt": "2026-07-10T17:53:50.455Z", "answerBytes": 264, "answerChars": 264, "exitCode": 0 }, { "fixtureId": "gmod.perf.steamid-cache.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal steamIDCache = setmetatable({}, { __mode = \"k\" })\n\nlocal function getSteamID(ply)\n local id = steamIDCache[ply]\n if id == nil then\n id = ply:SteamID()\n steamIDCache[ply] = id\n end\n return id\nend\n```\n\nReason: A weak-keyed cache memoizes SteamID() per player, avoiding repeated native calls and letting GC reclaim entries when players leave.", "durationMs": 8641, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "e8a94aa454154982", "usage": { "source": "provider", "promptTokens": 20687, "completionTokens": 106, "totalTokens": 22509, "reasoningTokens": 52, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:53:44.199Z", "completedAt": "2026-07-10T17:53:52.845Z", "answerBytes": 378, "answerChars": 378, "exitCode": 0 }, { "fixtureId": "gmod.perf.string-table-concat.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 0 through 0 candidate loops.", "finalResponse": "```lua\nlocal parts = {}\nfor i = 1, 10000 do\n parts[i] = \"piece \" .. i .. \"\\n\"\nend\nlocal result = table.concat(parts)\n\n-- Versus the slow approach:\n-- local result = \"\"\n-- for i = 1, 10000 do\n-- result = result .. \"piece \" .. i .. \"\\n\"\n-- end\n```\n\nReason: Repeated `..` copies the whole growing string each time (O(n^2)), while buffering pieces in a table and joining once with `table.concat` is O(n).", "durationMs": 7776, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "b0cf9e04ae7c5dd9", "usage": { "source": "provider", "promptTokens": 20685, "completionTokens": 123, "totalTokens": 22541, "reasoningTokens": 69, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:53:47.150Z", "completedAt": "2026-07-10T17:53:54.927Z", "answerBytes": 407, "answerChars": 407, "exitCode": 0 }, { "fixtureId": "gmod.perf.surface-drawrect.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal col = Color(255, 0, 0, 255)\nlocal x, y, w, h = 10, 10, 100, 50\n\nsurface.SetDrawColor(col)\nsurface.DrawRect(x, y, w, h)\n```\n\nReason: `draw.RoundedBox(0, …)` runs corner-radius branch logic and allocates per call; calling `surface.SetDrawColor` + `surface.DrawRect` directly skips that overhead for non-rounded rects.", "durationMs": 8482, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "696e8de769d9ad0e", "usage": { "source": "provider", "promptTokens": 20695, "completionTokens": 107, "totalTokens": 22575, "reasoningTokens": 109, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:53:47.949Z", "completedAt": "2026-07-10T17:53:56.433Z", "answerBytes": 330, "answerChars": 328, "exitCode": 0 }, { "fixtureId": "gmod.perf.surface-text.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nsurface.SetFont(\"DermaDefault\")\nsurface.SetTextColor(255, 255, 255, 255)\nhook.Add(\"HUDPaint\", \"fastText\", function()\n surface.SetTextPos(16, 16)\n surface.DrawText(\"Hello, world!\")\nend)\n```\n\nReason: `surface.DrawText` skips the per-call string parsing, color/alignment conversion, and wrapping that `draw.DrawText`/`draw.SimpleTextOutlined` perform, and setting font/color once avoids redundant state changes each frame.", "durationMs": 8081, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "95d9fe4918ee4197", "usage": { "source": "provider", "promptTokens": 20627, "completionTokens": 116, "totalTokens": 22658, "reasoningTokens": 187, "cachedTokens": 1728, "cost": 0 }, "startedAt": "2026-07-10T17:53:48.631Z", "completedAt": "2026-07-10T17:53:56.713Z", "answerBytes": 432, "answerChars": 432, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-count-hash.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal len = #tbl\n```\nReason: `#` is the length operator, the fastest and preferred way to get the count of a sequential (no-gap) array-like table in Lua/GMod.", "durationMs": 8547, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3e9bbfc8452e05e3", "usage": { "source": "provider", "promptTokens": 33684, "completionTokens": 66, "totalTokens": 33750, "reasoningTokens": 0, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:48.824Z", "completedAt": "2026-07-10T17:53:57.372Z", "answerBytes": 165, "answerChars": 165, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-empty.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nt = {}\n```\n\nReason: `t = {}` only reassigns a reference (no iteration), while `table.Empty(t)` loops over every key to clear them, so for large tables the reassignment is generally faster; note the old table is later freed by garbage collection.", "durationMs": 9258, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3a6344977f5bd475", "usage": { "source": "provider", "promptTokens": 20619, "completionTokens": 62, "totalTokens": 22514, "reasoningTokens": 105, "cachedTokens": 1728, "cost": 0 }, "startedAt": "2026-07-10T17:53:49.300Z", "completedAt": "2026-07-10T17:53:58.560Z", "answerBytes": 252, "answerChars": 252, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-hasvalue.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal set = { apple = true, banana = true, cherry = true }\n\nif set[\"banana\"] then\n print(\"found\")\nend\n```\nReason: Hash-table key lookup is O(1), while `table.HasValue` does an O(n) linear scan over the list.", "durationMs": 13010, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "7d064428a873fdfc", "usage": { "source": "provider", "promptTokens": 33698, "completionTokens": 87, "totalTokens": 33785, "reasoningTokens": 0, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:50.095Z", "completedAt": "2026-07-10T17:54:03.108Z", "answerBytes": 217, "answerChars": 217, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-literal.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal t = {a = 1, b = 2, c = 3}\n```\nReason: The constructor compiles to one TABLE instruction and hashes field names once at compile time, whereas `{}` + separate `t.a = ...` assignments emit multiple SETFIELD opcodes with runtime string-key hashing, making the literal form faster.", "durationMs": 9605, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f95a8fc610d720ad", "usage": { "source": "provider", "promptTokens": 20689, "completionTokens": 74, "totalTokens": 22546, "reasoningTokens": 119, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:53:50.463Z", "completedAt": "2026-07-10T17:54:00.076Z", "answerBytes": 289, "answerChars": 289, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-random.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal function randomSeq(t)\n return t[math.random(#t)]\nend\n```\n\nReason: `table.Random` counts every key (O(n)) to find a valid index, while a sequential table with no holes lets `math.random(#t)` pick in O(1).", "durationMs": 9128, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f3e090701953d4a9", "usage": { "source": "provider", "promptTokens": 20676, "completionTokens": 62, "totalTokens": 22483, "reasoningTokens": 81, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:53:51.016Z", "completedAt": "2026-07-10T17:54:00.146Z", "answerBytes": 219, "answerChars": 219, "exitCode": 0 }, { "fixtureId": "gmod.perf.x-times-x.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nfor i = 1, n do\n local s = x * x\nend\n```\n\nReason: In LuaJIT (used by Garry's Mod), `x * x` uses a single multiply, whereas `x ^ 2` lowers to a libm `pow` call, which is far slower in a tight loop.", "durationMs": 10988, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "79d48008f6b5174f", "usage": { "source": "provider", "promptTokens": 22343, "completionTokens": 74, "totalTokens": 22545, "reasoningTokens": 128, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:51.490Z", "completedAt": "2026-07-10T17:54:02.488Z", "answerBytes": 206, "answerChars": 206, "exitCode": 0 }, { "fixtureId": "gmod.player-iterator.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attemptIndex": 1, "status": "partial", "detail": "Uses ipairs but still allocates via player.GetAll() each time.", "finalResponse": "```lua\nfor _, ply in ipairs(player.GetAll()) do\n -- ply is the current Player\nend\n```\n\nReason: `player.GetAll()` returns an array-like table, so `ipairs` iterates connected players in order with a numeric index, avoiding the less precise `pairs` form.", "durationMs": 7083, "version": "1.15.9", "fixtureVersion": 2, "rubricVersion": "4", "promptHash": "fe3d7469535a0ca2", "usage": { "source": "provider", "promptTokens": 20627, "completionTokens": 68, "totalTokens": 22515, "reasoningTokens": 92, "cachedTokens": 1728, "cost": 0 }, "startedAt": "2026-07-10T17:53:51.606Z", "completedAt": "2026-07-10T17:53:58.690Z", "answerBytes": 254, "answerChars": 254, "exitCode": 0 }, { "fixtureId": "gmod.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nfor ent in ents.Iterator() do\n if IsValid(ent) and ent:GetClass() == \"prop_physics\" then\n -- visit ent\n end\nend\n```\n\nReason: `ents.Iterator()` is a generator-based iterator that yields entities one at a time, so it never materializes a table of all map entities; filtering by `GetClass` visits only `prop_physics`.", "durationMs": 9483, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "3990c92253db85bb", "usage": { "source": "provider", "promptTokens": 20688, "completionTokens": 93, "totalTokens": 22614, "reasoningTokens": 169, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:53:52.804Z", "completedAt": "2026-07-10T17:54:02.289Z", "answerBytes": 334, "answerChars": 334, "exitCode": 0 }, { "fixtureId": "gmod.hook-add.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Registers a named hook with hook.Add.", "finalResponse": "```lua\nhook.Add(\"Think\", \"MyAddon.Think\", function()\n -- callback body\nend)\n```\n\nReason: GMod's hook.Add registers a named callback on a hook; using \"MyAddon.Think\" as the identifier makes it uniquely identifiable and removable.", "durationMs": 7549, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "12d2222fdb7d6b90", "usage": { "source": "provider", "promptTokens": 22356, "completionTokens": 60, "totalTokens": 22463, "reasoningTokens": 47, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:52.846Z", "completedAt": "2026-07-10T17:54:00.397Z", "answerBytes": 231, "answerChars": 231, "exitCode": 0 }, { "fixtureId": "gmod.isvalid.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Uses IsValid for entity/object validity.", "finalResponse": "```lua\nif IsValid(ent) then\n ent:SomeMethod()\nend\n```\n\nReason: `IsValid(ent)` returns false when `ent` is NULL, not an entity, or has been removed from the game, preventing invalid method calls.", "durationMs": 7811, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "35527312e59dfc13", "usage": { "source": "provider", "promptTokens": 22352, "completionTokens": 56, "totalTokens": 22472, "reasoningTokens": 64, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:54.572Z", "completedAt": "2026-07-10T17:54:02.385Z", "answerBytes": 197, "answerChars": 197, "exitCode": 0 }, { "fixtureId": "gmod.net-receivers.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nutil.AddNetworkString(\"MyAddon.Sync\")\n\nnet.Receive(\"MyAddon.Sync\", function(len, ply)\n local data = net.ReadString()\n -- handle incoming sync data from ply\nend)\n```\n\nReason: `net.Receive` registers the callback that runs when a net message with the given name is received from the client (or server), and `util.AddNetworkString` must declare the string first so it can be sent.", "durationMs": 8575, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "24d54ee8366753a6", "usage": { "source": "provider", "promptTokens": 20679, "completionTokens": 100, "totalTokens": 22482, "reasoningTokens": 39, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:53:54.929Z", "completedAt": "2026-07-10T17:54:03.506Z", "answerBytes": 390, "answerChars": 390, "exitCode": 0 }, { "fixtureId": "gmod.perf.angle-zero.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal zeroAngle = Angle()\nlocal function getZeroedAngle()\n return zeroAngle:Zero()\nend\n```\n\nReason: Reusing a single Angle and calling `:Zero()` avoids per-call heap allocation, eliminating garbage-collector pressure in the hot path.", "durationMs": 10309, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f6bc97bf98280d62", "usage": { "source": "provider", "promptTokens": 22352, "completionTokens": 59, "totalTokens": 22512, "reasoningTokens": 101, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:56.435Z", "completedAt": "2026-07-10T17:54:06.748Z", "answerBytes": 243, "answerChars": 243, "exitCode": 0 }, { "fixtureId": "gmod.perf.config-var.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attemptIndex": 1, "status": "incorrect", "detail": "Matched an incorrect-answer pattern.", "finalResponse": "```lua\nlocal color = myaddon.config.color -- cache once at load\nlocal r, g, b = color.r, color.g, color.b -- flatten into locals for hot reads\nprint(r, g, b)\n```\n\nReason: A flat local read is a single opcode, while `myaddon.config.color.r` chains three hash-table lookups every access; caching into locals removes that cost on the hot path.", "durationMs": 9147, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "bcc4ff8eb162b699", "usage": { "source": "provider", "promptTokens": 22363, "completionTokens": 92, "totalTokens": 22523, "reasoningTokens": 68, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:56.715Z", "completedAt": "2026-07-10T17:54:05.864Z", "answerBytes": 342, "answerChars": 342, "exitCode": 0 }, { "fixtureId": "gmod.perf.darkrpvar.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal jobName = ply:getDarkRPVar(\"job\")\n```\n\nReason: `getDarkRPVar` reads DarkRP's own synchronized variable store (set via `setDarkRPVar`), which is the intended, reliable API; `GetNWString(\"job\")` depends on the network var name matching DarkRP's internals and breaks if that implementation changes.", "durationMs": 8964, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "02a37daa699cded3", "usage": { "source": "provider", "promptTokens": 22361, "completionTokens": 79, "totalTokens": 22487, "reasoningTokens": 47, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:57.375Z", "completedAt": "2026-07-10T17:54:06.340Z", "answerBytes": 308, "answerChars": 308, "exitCode": 0 }, { "fixtureId": "gmod.perf.disttosqr.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal threshold = 100\nif entA:GetPos():DistToSqr(entB:GetPos()) <= threshold * threshold then\n -- within range\nend\n```\nReason: `DistToSqr` avoids the costly square root in `Distance`, so comparing against the squared threshold is faster for range checks.", "durationMs": 12446, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "a5772470c6859cdc", "usage": { "source": "provider", "promptTokens": 33699, "completionTokens": 106, "totalTokens": 33805, "reasoningTokens": 0, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:53:57.439Z", "completedAt": "2026-07-10T17:54:09.888Z", "answerBytes": 264, "answerChars": 264, "exitCode": 0 }, { "fixtureId": "gmod.perf.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nfor _, ent in ents.Iterator() do\n -- process ent\nend\n```\n\nReason: The GMod wiki recommends `ents.Iterator()` over `ents.GetAll()` because it yields entities lazily without allocating a new table on every call, making it the efficient choice for visiting all entities.", "durationMs": 8000, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "306d3f1d05f28246", "usage": { "source": "provider", "promptTokens": 20688, "completionTokens": 68, "totalTokens": 22487, "reasoningTokens": 67, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:53:58.565Z", "completedAt": "2026-07-10T17:54:06.587Z", "answerBytes": 277, "answerChars": 277, "exitCode": 0 }, { "fixtureId": "gmod.perf.find-ents-near.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal ply = Entity(1)\nlocal pos = ply:GetPos()\nlocal mins = pos + Vector(-256, -256, -256)\nlocal maxs = pos + Vector(256, 256, 256)\nlocal found = ents.FindInBox(mins, maxs)\n```\n\nReason: `ents.FindInBox` does cheap AABB overlap tests (no distance sqrt) and is consistently faster than `FindInSphere` in common GLua benchmarks for near-player spatial queries.", "durationMs": 9066, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "07c583fc3d9fe09f", "usage": { "source": "provider", "promptTokens": 20708, "completionTokens": 107, "totalTokens": 22572, "reasoningTokens": 93, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:53:58.696Z", "completedAt": "2026-07-10T17:54:07.770Z", "answerBytes": 364, "answerChars": 364, "exitCode": 0 }, { "fixtureId": "gmod.perf.find-players-near.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal function PlayersInRadius(pos, radius)\n local found = {}\n local radiusSq = radius * radius\n for _, ply in ipairs(player.GetAll()) do\n if pos:DistToSqr(ply:GetPos()) <= radiusSq then\n found[#found + 1] = ply\n end\n end\n return found\nend\n```\n\nReason: `player.GetAll()` only iterates the (small) player table and skips the expensive broadphase over every entity that `ents.FindInSphere` does, and comparing squared distances avoids a `sqrt` per player.", "durationMs": 9144, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "d139ba2e8ee38a2f", "usage": { "source": "provider", "promptTokens": 20700, "completionTokens": 134, "totalTokens": 22584, "reasoningTokens": 86, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:53:58.750Z", "completedAt": "2026-07-10T17:54:07.897Z", "answerBytes": 500, "answerChars": 500, "exitCode": 0 }, { "fixtureId": "gmod.perf.for-vs-while.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nfor i = 1, n do\n -- body\nend\n```\n\nReason: Numeric `for` is faster because Lua precomputes the limit/step once and compiles a dedicated loop opcode, whereas `while` re-evaluates the condition (including the bound) every iteration.", "durationMs": 8612, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "b3401a190a8aecf0", "usage": { "source": "provider", "promptTokens": 22357, "completionTokens": 65, "totalTokens": 22489, "reasoningTokens": 67, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:54:00.080Z", "completedAt": "2026-07-10T17:54:08.694Z", "answerBytes": 239, "answerChars": 239, "exitCode": 0 }, { "fixtureId": "gmod.perf.hook-once.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- Faster: one hook call with the whole batch\nhook.Run(\"TickPlayers\", player.GetAll())\n\n-- Slower: one hook.Run per player (N dispatch + arg-marshal costs)\nfor _, ply in ipairs(player.GetAll()) do\n hook.Run(\"TickPlayer\", ply)\nend\n```\n\nReason: A single `hook.Run` with all players avoids repeating hook lookup, table iteration over registered functions, and argument marshalling for every player, so it scales with the number of hooks rather than the number of players.", "durationMs": 9479, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "ed1d3e09249fc8bb", "usage": { "source": "provider", "promptTokens": 22366, "completionTokens": 115, "totalTokens": 22578, "reasoningTokens": 97, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:54:00.147Z", "completedAt": "2026-07-10T17:54:09.629Z", "answerBytes": 478, "answerChars": 478, "exitCode": 0 }, { "fixtureId": "gmod.perf.hudpaint-cache.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal ply = LocalPlayer()\nlocal hp = ply:Health()\ndraw.SimpleText(hp, \"Default\", 10, 10)\ndraw.SimpleText(hp, \"Default\", 10, 30)\ndraw.SimpleText(hp, \"Default\", 10, 50)\n```\nReason: Cache LocalPlayer() and Health() in locals so the three calls run the functions once instead of three times per frame.", "durationMs": 8347, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3def450f3158ceff", "usage": { "source": "provider", "promptTokens": 20698, "completionTokens": 92, "totalTokens": 22516, "reasoningTokens": 62, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:54:00.399Z", "completedAt": "2026-07-10T17:54:08.753Z", "answerBytes": 304, "answerChars": 304, "exitCode": 0 }, { "fixtureId": "gmod.perf.local-color.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal white = Color(255, 255, 255)\nhook.Add(\"HUDPaint\", \"example\", function()\n surface.SetDrawColor(white)\n surface.DrawRect(0, 0, 100, 100)\nend)\n```\n\nReason: Hoisting the Color allocation out of the per-frame callback avoids constructing a new table/object 60+ times per second, eliminating GC pressure and the per-iteration function call overhead.", "durationMs": 9500, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "16a7bed1b931d467", "usage": { "source": "provider", "promptTokens": 20683, "completionTokens": 96, "totalTokens": 22517, "reasoningTokens": 74, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:54:02.291Z", "completedAt": "2026-07-10T17:54:11.793Z", "answerBytes": 362, "answerChars": 362, "exitCode": 0 }, { "fixtureId": "gmod.perf.local-vs-global.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal sin = math.sin\nfor i = 1, n do\n local y = sin(x[i])\nend\n```\n\nReason: Localizing `math.sin` into a `local` avoids the repeated global/table lookup on every iteration, trading one table index for a cheap local-variable access.", "durationMs": 8328, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "c116d8c651190647", "usage": { "source": "provider", "promptTokens": 20688, "completionTokens": 66, "totalTokens": 22474, "reasoningTokens": 56, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:54:02.388Z", "completedAt": "2026-07-10T17:54:10.722Z", "answerBytes": 240, "answerChars": 240, "exitCode": 0 }, { "fixtureId": "gmod.perf.localplayer-cache.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nlocal LocalPlayer = LocalPlayer\n\nhook.Add(\"InitPostEntity\", \"cache_localplayer\", function()\n LocalPlayer = LocalPlayer()\nend)\n\n-- use the upvalue LocalPlayer directly afterwards\nlocal ply = LocalPlayer\n```\n\nReason: Caching `LocalPlayer` in a local upvalue (and resolving the entity once after `InitPostEntity`) turns a global table lookup into a fast local reference access, avoiding repeated hashed global indexing on the hot path.", "durationMs": 8211, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "7398105af47b079e", "usage": { "source": "provider", "promptTokens": 22353, "completionTokens": 100, "totalTokens": 22499, "reasoningTokens": 46, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:54:02.489Z", "completedAt": "2026-07-10T17:54:10.702Z", "answerBytes": 442, "answerChars": 442, "exitCode": 0 }, { "fixtureId": "gmod.perf.looking-at.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nlocal function lookingAtEachOther(a, b, cosThreshold)\n cosThreshold = cosThreshold or 0.5 -- ~60deg cone\n local dirAtoB = (b:GetPos() - a:GetPos()):GetNormalized()\n local dirBtoA = (a:GetPos() - b:GetPos()):GetNormalized()\n local fwdA = a:GetAimVector()\n local fwdB = b:GetAimVector()\n return fwdA:Dot(dirAtoB) > cosThreshold\n and fwdB:Dot(dirBtoA) > cosThreshold\nend\n```\n\nReason: Dot products give the cosine of the angle directly, so two cheap comparisons against a threshold replace any math.acos and angle computation.", "durationMs": 9943, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "20b22f678a4b08d7", "usage": { "source": "provider", "promptTokens": 22364, "completionTokens": 172, "totalTokens": 22751, "reasoningTokens": 215, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:54:03.110Z", "completedAt": "2026-07-10T17:54:13.055Z", "answerBytes": 553, "answerChars": 553, "exitCode": 0 }, { "fixtureId": "gmod.perf.meta-vs-arg.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nSomeHelper(ply)\n```\n\nReason: `ply:SomeHelper()` desugars to a metatable lookup (`ply.SomeHelper(ply)`) on every call, while `SomeHelper(ply)` calls a known global/upvalue directly and skips that lookup, so it's generally faster for a helper you control.", "durationMs": 9434, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "de332f7356830dfa", "usage": { "source": "provider", "promptTokens": 20699, "completionTokens": 71, "totalTokens": 22555, "reasoningTokens": 121, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:54:03.508Z", "completedAt": "2026-07-10T17:54:12.945Z", "answerBytes": 260, "answerChars": 260, "exitCode": 0 }, { "fixtureId": "gmod.perf.msg-vs-print.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nMsgN(\"debug: value = \", value)\n```\n\nReason: `Msg`/`MsgN` write strings directly to the console without the per-call table allocation and tab-joining that `print` does, so they're cheaper in a hot path.", "durationMs": 8429, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "6cbb4e4b2f19dd24", "usage": { "source": "provider", "promptTokens": 20690, "completionTokens": 58, "totalTokens": 22515, "reasoningTokens": 103, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:54:05.865Z", "completedAt": "2026-07-10T17:54:14.295Z", "answerBytes": 208, "answerChars": 208, "exitCode": 0 }, { "fixtureId": "gmod.perf.pairs-ipairs-for.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nfor i = 1, #t do\n local v = t[i]\nend\n```\n\nReason: A numeric for loop over `#t` avoids the per-iteration function call and hash lookups of `ipairs`/`pairs` and is the fastest typical pattern for a known sequential array.", "durationMs": 7512, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "de5e4875fcf3e600", "usage": { "source": "provider", "promptTokens": 20699, "completionTokens": 67, "totalTokens": 22473, "reasoningTokens": 43, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:54:06.341Z", "completedAt": "2026-07-10T17:54:13.855Z", "answerBytes": 229, "answerChars": 229, "exitCode": 0 }, { "fixtureId": "gmod.perf.plain-lua-vs-fn.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 1 through 1 non-empty reason lines.", "finalResponse": "```lua\nlocal input = { 1, 2, 3, 4, 5, 6, 7, 8 }\nlocal out = {}\nfor i = 1, #input do\n local v = input[i]\n if v % 2 == 0 then\n out[#out + 1] = v * v\n end\nend\n```\n```\nReason: fn builds nested closures and indirection per element; a single in-place loop fuses filter+map with no closure allocation or per-element function calls, cutting overhead dramatically.\n```", "durationMs": 11159, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "ead0a98b3ff6a388", "usage": { "source": "provider", "promptTokens": 20708, "completionTokens": 122, "totalTokens": 22618, "reasoningTokens": 124, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:54:06.588Z", "completedAt": "2026-07-10T17:54:17.749Z", "answerBytes": 375, "answerChars": 375, "exitCode": 0 }, { "fixtureId": "gmod.perf.player-cache-hooks.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal players = {}\n\nlocal function rebuild()\n local t = {}\n for _, ply in ipairs(player.GetAll()) do\n t[#t + 1] = ply\n end\n players = t\nend\n\nhook.Add(\"PlayerConnect\", \"cachePlayers\", rebuild)\nhook.Add(\"PlayerDisconnected\", \"cachePlayers\", rebuild)\nhook.Add(\"InitPostEntity\", \"cachePlayers\", rebuild)\n\nhook.Add(\"Tick\", \"useCachedPlayers\", function()\n for i = 1, #players do\n local ply = players[i]\n -- do per-player tick work here\n end\nend)\n```\n\nReason: Rebuilding the player list only on join/leave (via PlayerConnect/PlayerDisconnected) avoids the per-tick table allocation and traversal cost of ipairs(player.GetAll()), so the Tick hook only iterates a stable cached array.", "durationMs": 8545, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "a834817afe9e6c25", "usage": { "source": "provider", "promptTokens": 20706, "completionTokens": 187, "totalTokens": 22581, "reasoningTokens": 24, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:54:06.750Z", "completedAt": "2026-07-10T17:54:15.296Z", "answerBytes": 721, "answerChars": 721, "exitCode": 0 }, { "fixtureId": "gmod.perf.ply-table-index.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal pdata = setmetatable({}, { __index = function(t, ply)\n local slot = {}\n t[ply] = slot\n return slot\nend })\n\n-- write\npdata[ply].score = 42\n\n-- read (hot path)\nlocal score = pdata[ply].score\n```\nReason: Keying a plain table by the player entity avoids the entity's `__index`/`__newindex` metamethod traversal on every access, so a read is one native table hash lookup instead of a metatable dispatch.", "durationMs": 15024, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f18cc80df8999147", "usage": { "source": "provider", "promptTokens": 20690, "completionTokens": 118, "totalTokens": 22949, "reasoningTokens": 477, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:54:07.771Z", "completedAt": "2026-07-10T17:54:22.797Z", "answerBytes": 420, "answerChars": 420, "exitCode": 0 }, { "fixtureId": "gmod.perf.seq-tables.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal items = { \"a\", \"b\", \"c\", \"d\" } -- sequential number-indexed array\n\nfor i = 1, #items do\n local v = items[i]\nend\n```\n\nReason: Sequential number-indexed arrays iterate with a predictable integer loop and no hash lookups, whereas string-keyed maps force `pairs`-style hash traversal, which is slower in LuaJIT.", "durationMs": 9369, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "4778b0220c3f91a3", "usage": { "source": "provider", "promptTokens": 22362, "completionTokens": 87, "totalTokens": 22632, "reasoningTokens": 183, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:54:07.899Z", "completedAt": "2026-07-10T17:54:17.270Z", "answerBytes": 323, "answerChars": 323, "exitCode": 0 }, { "fixtureId": "gmod.perf.setdrawcolor-split.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nsurface.SetDrawColor(r, g, b, a)\n```\n\nReason: Passing separate numbers avoids allocating a `Color` table every frame, removing per-call GC pressure on the hot draw path.", "durationMs": 11030, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "d110fde8a37bbe59", "usage": { "source": "provider", "promptTokens": 20695, "completionTokens": 45, "totalTokens": 22465, "reasoningTokens": 61, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:54:08.696Z", "completedAt": "2026-07-10T17:54:19.728Z", "answerBytes": 176, "answerChars": 176, "exitCode": 0 }, { "fixtureId": "gmod.perf.sqlite-vs-mysql.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal result = sql.Query(\"SELECT score FROM player_data WHERE steamid = \" .. sql.SQLStr(ply:SteamID()))\n```\n\nReason: Local SQLite avoids the network round-trip and connection overhead of remote MySQL, giving lower latency for reads/writes on a single server with no multi-server sync need.", "durationMs": 8878, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "4a3f5d2a20d71ac9", "usage": { "source": "provider", "promptTokens": 20721, "completionTokens": 68, "totalTokens": 22579, "reasoningTokens": 126, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:54:08.755Z", "completedAt": "2026-07-10T17:54:17.635Z", "answerBytes": 296, "answerChars": 296, "exitCode": 0 }, { "fixtureId": "gmod.perf.steamid-cache.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal steamIDCache = setmetatable({}, { __mode = \"k\" })\n\nlocal function getSteamID(ply)\n local id = steamIDCache[ply]\n if id == nil then\n id = ply:SteamID()\n steamIDCache[ply] = id\n end\n return id\nend\n```\n\nReason: SteamID() allocates a new string each call; a weak-keyed cache returns the cached string for the same player entity, avoiding repeated native calls and GC pressure on the hot path.", "durationMs": 7547, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "e8a94aa454154982", "usage": { "source": "provider", "promptTokens": 20565, "completionTokens": 117, "totalTokens": 22527, "reasoningTokens": 53, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:54:09.630Z", "completedAt": "2026-07-10T17:54:17.179Z", "answerBytes": 427, "answerChars": 427, "exitCode": 0 }, { "fixtureId": "gmod.perf.string-table-concat.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 0 through 0 candidate loops.", "finalResponse": "```lua\nlocal parts = {}\nfor i = 1, 10000 do\n parts[#parts + 1] = \"piece\" .. i\nend\nlocal result = table.concat(parts)\n```\n\nReason: Repeated `..` concatenation copies the growing string each time (O(n²)), whereas buffering into a table and a single `table.concat` joins in O(n) total.", "durationMs": 7669, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "b0cf9e04ae7c5dd9", "usage": { "source": "provider", "promptTokens": 20688, "completionTokens": 82, "totalTokens": 22462, "reasoningTokens": 28, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:54:09.890Z", "completedAt": "2026-07-10T17:54:17.561Z", "answerBytes": 286, "answerChars": 285, "exitCode": 0 }, { "fixtureId": "gmod.perf.surface-drawrect.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nsurface.SetDrawColor(r, g, b, a)\nsurface.DrawRect(x, y, w, h)\n```\n\nReason: `draw.RoundedBox(0, ...)` still runs its geometry/stencil setup path; calling `surface.SetDrawColor` + `surface.DrawRect` directly skips that overhead, so it's measurably faster when drawing plain rectangles every frame.", "durationMs": 8392, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "696e8de769d9ad0e", "usage": { "source": "provider", "promptTokens": 22358, "completionTokens": 83, "totalTokens": 22560, "reasoningTokens": 119, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:54:10.704Z", "completedAt": "2026-07-10T17:54:19.097Z", "answerBytes": 302, "answerChars": 302, "exitCode": 0 }, { "fixtureId": "gmod.perf.surface-text.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- Fastest: cache the font once, then use surface.SetFont + surface.SetTextColor\n-- ONCE (not every frame), and only surface.SetTextPos + surface.DrawText per frame.\nsurface.CreateFont(\"MyHUDFont\", {font = \"Tahoma\", size = 20, weight = 500})\n\nlocal textColor = Color(255, 255, 255)\nlocal myText = \"Hello World\"\n\n-- do the state setup outside the hot path if the color/font never change:\nhook.Add(\"HUDPaint\", \"FastText\", function()\n surface.SetFont(\"MyHUDFont\")\n surface.SetTextColor(textColor)\n surface.SetTextPos(20, 20)\n surface.DrawText(myText)\nend)\n```\nReason: draw.DrawText/SimpleTextOutlined internally call surface.SetFont/SetTextColor/SetTextPos/DrawText plus extra work (string splitting on \"\\n\", alignment measuring via surface.GetTextSize, and multiple redraws for outlines), so calling the raw surface.* functions directly avoids that per-frame overhead.", "durationMs": 12057, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "95d9fe4918ee4197", "usage": { "source": "provider", "promptTokens": 33714, "completionTokens": 375, "totalTokens": 34089, "reasoningTokens": 0, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:54:10.724Z", "completedAt": "2026-07-10T17:54:22.782Z", "answerBytes": 885, "answerChars": 885, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-count-hash.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal len = #myTable\n```\n\nReason: The `#` length operator is the idiomatic, O(1) way to get the length of a sequential array-like table in Lua/Garry's Mod; `table.Count` is for non-sequential/pairs-style tables and is slower.", "durationMs": 8144, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3e9bbfc8452e05e3", "usage": { "source": "provider", "promptTokens": 20682, "completionTokens": 64, "totalTokens": 22474, "reasoningTokens": 64, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:54:11.795Z", "completedAt": "2026-07-10T17:54:19.942Z", "answerBytes": 232, "answerChars": 232, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-empty.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nt = {}\n```\n\nReason: Reassigning `t` to a fresh empty table lets the old contents be GC'd without iterating, while `table.Empty(t)` loops over every entry to nil it out, making `t = {}` faster for large tables.", "durationMs": 6762, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3a6344977f5bd475", "usage": { "source": "provider", "promptTokens": 20686, "completionTokens": 58, "totalTokens": 22408, "reasoningTokens": 0, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:54:12.946Z", "completedAt": "2026-07-10T17:54:19.711Z", "answerBytes": 216, "answerChars": 216, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-hasvalue.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal lookup = { [ \"apple\" ] = true, [ \"banana\" ] = true, [ \"cherry\" ] = true }\nif lookup[ value ] then\n -- value is in the set\nend\n```\n\nReason: A hash lookup is O(1) per check, whereas table.HasValue scans the whole list linearly (O(n)) every time.", "durationMs": 7440, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "7d064428a873fdfc", "usage": { "source": "provider", "promptTokens": 22352, "completionTokens": 81, "totalTokens": 22492, "reasoningTokens": 59, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:54:13.056Z", "completedAt": "2026-07-10T17:54:20.498Z", "answerBytes": 259, "answerChars": 259, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-literal.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal t = { x = 1, y = 2, z = 3 }\n```\n\nReason: Initializing fields in the table constructor is faster because it builds the table with pre-sized slots and avoids separate `settable` operations for each assignment after `{}`.", "durationMs": 8280, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f95a8fc610d720ad", "usage": { "source": "provider", "promptTokens": 22353, "completionTokens": 60, "totalTokens": 22488, "reasoningTokens": 75, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:54:13.857Z", "completedAt": "2026-07-10T17:54:22.138Z", "answerBytes": 231, "answerChars": 231, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-random.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal function randomSeq(t)\n return t[math.random(#t)]\nend\n```\n\nReason: `table.Random` iterates the entire table to count keys (O(n)) before picking one; for a sequential table `#t` gives the length in O(1), so indexing a single random element is O(1).", "durationMs": 7790, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f3e090701953d4a9", "usage": { "source": "provider", "promptTokens": 20679, "completionTokens": 70, "totalTokens": 22486, "reasoningTokens": 73, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:54:14.298Z", "completedAt": "2026-07-10T17:54:22.092Z", "answerBytes": 262, "answerChars": 262, "exitCode": 0 }, { "fixtureId": "gmod.perf.x-times-x.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal s = x * x\n```\n\nReason: `x * x` avoids the `^` operator's `math.pow` call, which is slower in tight loops because exponentiation is a function call rather than a direct multiply.", "durationMs": 7793, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "79d48008f6b5174f", "usage": { "source": "provider", "promptTokens": 22346, "completionTokens": 51, "totalTokens": 22460, "reasoningTokens": 63, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:54:15.298Z", "completedAt": "2026-07-10T17:54:23.093Z", "answerBytes": 190, "answerChars": 190, "exitCode": 0 }, { "fixtureId": "gmod.player-iterator.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attemptIndex": 1, "status": "partial", "detail": "Uses ipairs but still allocates via player.GetAll() each time.", "finalResponse": "```lua\nfor _, ply in ipairs(player.GetAll()) do\n -- ply is a currently connected Player\nend\n```\n\nReason: `player.GetAll()` returns an ordered array of connected players, so `ipairs` is the idiomatic iterator and the index is unused.", "durationMs": 8572, "version": "1.15.9", "fixtureVersion": 2, "rubricVersion": "4", "promptHash": "fe3d7469535a0ca2", "usage": { "source": "provider", "promptTokens": 20691, "completionTokens": 62, "totalTokens": 22515, "reasoningTokens": 98, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:54:17.180Z", "completedAt": "2026-07-10T17:54:25.753Z", "answerBytes": 235, "answerChars": 235, "exitCode": 0 }, { "fixtureId": "gmod.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nfor _, ent in ents.Iterator() do\n if ent:GetClass() == \"prop_physics\" then\n -- do something with ent\n end\nend\n```\nReason: `ents.Iterator()` yields entities one at a time without allocating a full table like `ents.GetAll()` does.", "durationMs": 11879, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "3990c92253db85bb", "usage": { "source": "provider", "promptTokens": 33684, "completionTokens": 100, "totalTokens": 33784, "reasoningTokens": 0, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:54:17.271Z", "completedAt": "2026-07-10T17:54:29.152Z", "answerBytes": 248, "answerChars": 248, "exitCode": 0 }, { "fixtureId": "gmod.hook-add.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attemptIndex": 1, "status": "pass", "detail": "Registers a named hook with hook.Add.", "finalResponse": "```lua\nhook.Add(\"Think\", \"MyAddon.Think\", function()\n -- callback body\nend)\n```\n\nReason: `hook.Add` registers a callback on the named hook (\"Think\") with a unique identifier (\"MyAddon.Think\") so it runs every think frame and can be removed later via `hook.Remove`.", "durationMs": 9156, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "12d2222fdb7d6b90", "usage": { "source": "provider", "promptTokens": 20689, "completionTokens": 70, "totalTokens": 22441, "reasoningTokens": 18, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:54:17.562Z", "completedAt": "2026-07-10T17:54:26.720Z", "answerBytes": 267, "answerChars": 267, "exitCode": 0 }, { "fixtureId": "gmod.isvalid.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attemptIndex": 1, "status": "pass", "detail": "Uses IsValid for entity/object validity.", "finalResponse": "```lua\nif IsValid(ent) then\n ent:SomeMethod()\nend\n```\n\nReason: IsValid(ent) returns false if ent is nil, removed, or the NULL entity, preventing calls on a stale reference.", "durationMs": 9308, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "35527312e59dfc13", "usage": { "source": "provider", "promptTokens": 22346, "completionTokens": 50, "totalTokens": 22479, "reasoningTokens": 83, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:54:17.636Z", "completedAt": "2026-07-10T17:54:26.949Z", "answerBytes": 175, "answerChars": 175, "exitCode": 0 }, { "fixtureId": "gmod.net-receivers.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nutil.AddNetworkString(\"MyAddon.Sync\")\n\nnet.Receive(\"MyAddon.Sync\", function(len, ply)\n local data = net.ReadString()\nend)\n```\n\nReason: `net.Receive` registers a server/client callback that runs when a net message with the given name is received, after the string is registered with `util.AddNetworkString`.", "durationMs": 7883, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "24d54ee8366753a6", "usage": { "source": "provider", "promptTokens": 20679, "completionTokens": 80, "totalTokens": 22452, "reasoningTokens": 29, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:54:17.751Z", "completedAt": "2026-07-10T17:54:25.637Z", "answerBytes": 316, "answerChars": 316, "exitCode": 0 }, { "fixtureId": "gmod.perf.angle-zero.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal zeroAng = Angle()\n\nlocal function getZeroAng()\n return zeroAng:Zero()\nend\n```\n\nReason: Constructing `Angle()` allocates a new table each call; reusing one Angle and calling `:Zero()` avoids that allocation, which matters in a hot path.", "durationMs": 8039, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f6bc97bf98280d62", "usage": { "source": "provider", "promptTokens": 20685, "completionTokens": 62, "totalTokens": 22483, "reasoningTokens": 72, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:54:19.102Z", "completedAt": "2026-07-10T17:54:27.166Z", "answerBytes": 251, "answerChars": 251, "exitCode": 0 }, { "fixtureId": "gmod.perf.config-var.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal color = myaddon_config_color -- flat local, read once or cached\n-- read:\nlocal c = color\n```\n\nReason: Flat locals resolve in O(1) via upvalue/registry slots, while `myaddon.config.color` needs two hash-table lookups per read, so caching the nested value in a local is faster.", "durationMs": 7995, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "bcc4ff8eb162b699", "usage": { "source": "provider", "promptTokens": 20694, "completionTokens": 77, "totalTokens": 22502, "reasoningTokens": 67, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:54:19.713Z", "completedAt": "2026-07-10T17:54:27.713Z", "answerBytes": 288, "answerChars": 288, "exitCode": 0 }, { "fixtureId": "gmod.perf.darkrpvar.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nply:getDarkRPVar(\"job\")\n```\n\nReason: `getDarkRPVar` reads the networked DarkRP job var directly instead of relying on the generic NWString, which is the supported DarkRP API and avoids name-collision/fallback issues with raw `GetNWString`.", "durationMs": 8908, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "02a37daa699cded3", "usage": { "source": "provider", "promptTokens": 20690, "completionTokens": 62, "totalTokens": 22559, "reasoningTokens": 143, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:54:19.730Z", "completedAt": "2026-07-10T17:54:28.639Z", "answerBytes": 246, "answerChars": 246, "exitCode": 0 }, { "fixtureId": "gmod.perf.disttosqr.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nif (a:DistToSqr(b) <= threshold * threshold) then\n -- within threshold\nend\n```\n\nReason: `DistToSqr` (alias `DistanceSqr`) compares squared distances and avoids the expensive square-root in `Distance`, so a threshold check needs only one multiply instead of a sqrt per call.", "durationMs": 8340, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "a5772470c6859cdc", "usage": { "source": "provider", "promptTokens": 20683, "completionTokens": 73, "totalTokens": 22496, "reasoningTokens": 76, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:54:19.944Z", "completedAt": "2026-07-10T17:54:28.286Z", "answerBytes": 283, "answerChars": 283, "exitCode": 0 }, { "fixtureId": "gmod.perf.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nfor _, ent in ents.Iterator() do\n -- process each entity\nend\n```\n\nReason: The GMod wiki recommends `ents.Iterator()` as the efficient iterator because it traverses the entity list without allocating a new table like `ents.GetAll()` does.", "durationMs": 10247, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "306d3f1d05f28246", "usage": { "source": "provider", "promptTokens": 20679, "completionTokens": 61, "totalTokens": 22515, "reasoningTokens": 111, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:54:20.500Z", "completedAt": "2026-07-10T17:54:30.748Z", "answerBytes": 247, "answerChars": 247, "exitCode": 0 }, { "fixtureId": "gmod.perf.find-ents-near.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nlocal nearby = ents.FindInSphere(player:GetPos(), 256)\n```\n\nReason: `ents.FindInSphere` runs a cheap radius-based spatial query against the entity list, which benchmarks consistently faster than `FindInPVS` for local proximity checks.", "durationMs": 8422, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "07c583fc3d9fe09f", "usage": { "source": "provider", "promptTokens": 20705, "completionTokens": 57, "totalTokens": 22520, "reasoningTokens": 94, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:54:22.094Z", "completedAt": "2026-07-10T17:54:30.517Z", "answerBytes": 241, "answerChars": 241, "exitCode": 0 }, { "fixtureId": "gmod.perf.find-players-near.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal function FindPlayersNear(pos, radius)\n local found = {}\n local radiusSqr = radius * radius\n for _, ply in player.Iterator() do\n if ply:GetPos():DistToSqr(pos) <= radiusSqr then\n found[#found + 1] = ply\n end\n end\n return found\nend\n```\nReason: Iterating only the player list (player.Iterator/player.GetAll) skips every non-player entity that ents.FindInSphere returns and filters, and DistToSqr avoids the per-entity square root, so cost scales with player count rather than total entity count.", "durationMs": 10139, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "d139ba2e8ee38a2f", "usage": { "source": "provider", "promptTokens": 33697, "completionTokens": 204, "totalTokens": 33901, "reasoningTokens": 0, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:54:22.139Z", "completedAt": "2026-07-10T17:54:32.280Z", "answerBytes": 545, "answerChars": 545, "exitCode": 0 }, { "fixtureId": "gmod.perf.for-vs-while.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nfor i = 1, n do\n -- loop body\nend\n```\n\nReason: Lua's numeric `for` compiles to dedicated counting bytecode that caches the limit and step once and avoids per-iteration variable lookups and increments, making it faster than an equivalent `while` loop.", "durationMs": 8987, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "b3401a190a8aecf0", "usage": { "source": "provider", "promptTokens": 22357, "completionTokens": 64, "totalTokens": 22613, "reasoningTokens": 192, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:54:22.784Z", "completedAt": "2026-07-10T17:54:31.773Z", "answerBytes": 260, "answerChars": 260, "exitCode": 0 }, { "fixtureId": "gmod.perf.hook-once.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- FASTER: call hook.Run once, pass the whole player table\nhook.Add(\"Think\", \"NotifyAll_Fast\", function()\n hook.Run(\"MyTickNotify\", player.GetAll())\nend)\n\n-- SLOWER: loop players, call hook.Run once per player each tick\nhook.Add(\"Think\", \"NotifyAll_Slow\", function()\n for _, ply in ipairs(player.GetAll()) do\n hook.Run(\"MyTickNotify\", ply)\n end\nend)\n```\nReason: hook.Run walks the entire hook table and does per-call setup every invocation, so calling it once per tick with all players amortizes that overhead, whereas the per-player loop multiplies that fixed cost by the player count each tick.", "durationMs": 12141, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "ed1d3e09249fc8bb", "usage": { "source": "provider", "promptTokens": 33709, "completionTokens": 253, "totalTokens": 33962, "reasoningTokens": 0, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:54:22.798Z", "completedAt": "2026-07-10T17:54:34.941Z", "answerBytes": 619, "answerChars": 619, "exitCode": 0 }, { "fixtureId": "gmod.perf.hudpaint-cache.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal ply = LocalPlayer()\nlocal hp = ply:Health()\n\n-- draw call 1\ndraw.SimpleText(hp, \"Default\", 10, 10, color_white)\n-- draw call 2\ndraw.SimpleText(hp, \"Default\", 10, 30, color_white)\n-- draw call 3\ndraw.SimpleText(hp, \"Default\", 10, 50, color_white)\n```\n\nReason: Cache LocalPlayer() and Health() once per frame instead of resolving the player and reading health three times.", "durationMs": 8739, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3def450f3158ceff", "usage": { "source": "provider", "promptTokens": 20695, "completionTokens": 119, "totalTokens": 22584, "reasoningTokens": 106, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:54:23.095Z", "completedAt": "2026-07-10T17:54:31.835Z", "answerBytes": 383, "answerChars": 383, "exitCode": 0 }, { "fixtureId": "gmod.perf.local-color.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal WHITE = Color(255, 255, 255)\n\nfunction PANEL:Paint(w, h)\n surface.SetDrawColor(WHITE)\n surface.DrawRect(0, 0, w, h)\nend\n```\nReason: Color() allocates a new table every frame, so hoisting it to an upvalue created once avoids per-iteration garbage and GC churn in the hot paint loop.", "durationMs": 9787, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "16a7bed1b931d467", "usage": { "source": "provider", "promptTokens": 33686, "completionTokens": 137, "totalTokens": 33823, "reasoningTokens": 0, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:54:25.638Z", "completedAt": "2026-07-10T17:54:35.426Z", "answerBytes": 300, "answerChars": 300, "exitCode": 0 }, { "fixtureId": "gmod.perf.local-vs-global.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal sin = math.sin\nfor i = 1, n do\n local v = sin(i)\nend\n```\n\nReason: Localizing `math.sin` into a local avoids the repeated table-index lookup (`math.sin`) on every iteration, which is faster in a hot loop.", "durationMs": 7576, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "c116d8c651190647", "usage": { "source": "provider", "promptTokens": 20624, "completionTokens": 63, "totalTokens": 22478, "reasoningTokens": 63, "cachedTokens": 1728, "cost": 0 }, "startedAt": "2026-07-10T17:54:25.756Z", "completedAt": "2026-07-10T17:54:33.333Z", "answerBytes": 219, "answerChars": 219, "exitCode": 0 }, { "fixtureId": "gmod.perf.localplayer-cache.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal lp = LocalPlayer()\n\nhook.Add(\"InitPostEntity\", \"cache_lp\", function()\n lp = LocalPlayer()\nend)\n\nhook.Add(\"PlayerSpawn\", \"cache_lp\", function(ply)\n if ply == lp then lp = ply end\nend)\n\n-- use `lp` directly in think hooks, HUD draws, etc.\n```\n\nReason: LocalPlayer() does a table scan of the player list each call; caching it in a local and refreshing only on spawn/InitPostEntity removes that per-frame lookup cost.", "durationMs": 9727, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "7398105af47b079e", "usage": { "source": "provider", "promptTokens": 20686, "completionTokens": 118, "totalTokens": 22545, "reasoningTokens": 77, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:54:26.722Z", "completedAt": "2026-07-10T17:54:36.450Z", "answerBytes": 432, "answerChars": 432, "exitCode": 0 }, { "fixtureId": "gmod.perf.looking-at.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nlocal function lookingAtEachOther(a, b, threshold)\n threshold = threshold or 0.5\n local toB = (b:GetPos() - a:GetPos()):GetNormalized()\n local toA = (a:GetPos() - b:GetPos()):GetNormalized()\n return a:GetAimVector():Dot(toB) > threshold\n and b:GetAimVector():Dot(toA) > threshold\nend\n```\n\nReason: the dot product of each player's normalized aim vector with the direction to the other measures facing directly, avoiding the trig cost of math.acos/angle-between.", "durationMs": 10372, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "20b22f678a4b08d7", "usage": { "source": "provider", "promptTokens": 20700, "completionTokens": 140, "totalTokens": 22674, "reasoningTokens": 170, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:54:26.951Z", "completedAt": "2026-07-10T17:54:37.328Z", "answerBytes": 485, "answerChars": 485, "exitCode": 0 }, { "fixtureId": "gmod.perf.meta-vs-arg.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nSomeHelper(ply)\n```\n\nReason: `ply:SomeHelper()` does a metatable `__index` lookup to resolve the method on every call, while a plain `SomeHelper(ply)` over a local reference skips that table lookup, so the direct function call is generally faster.", "durationMs": 9910, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "de332f7356830dfa", "usage": { "source": "provider", "promptTokens": 20692, "completionTokens": 63, "totalTokens": 22642, "reasoningTokens": 223, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:54:27.168Z", "completedAt": "2026-07-10T17:54:37.079Z", "answerBytes": 254, "answerChars": 254, "exitCode": 0 }, { "fixtureId": "gmod.perf.msg-vs-print.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nMsgN(\"debug: \", x)\n```\n\nReason: MsgN skips print's per-argument type dispatch and formatting overhead, writing raw strings straight to the console.", "durationMs": 10951, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "6cbb4e4b2f19dd24", "usage": { "source": "provider", "promptTokens": 20690, "completionTokens": 39, "totalTokens": 22595, "reasoningTokens": 202, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:54:27.715Z", "completedAt": "2026-07-10T17:54:38.670Z", "answerBytes": 154, "answerChars": 154, "exitCode": 0 }, { "fixtureId": "gmod.perf.pairs-ipairs-for.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal t = {...}\nfor i = 1, #t do\n local v = t[i]\nend\n```\n\nReason: Numeric for avoids per-iteration function calls and hash lookups, running in pure array-index speed, whereas ipairs adds iterator overhead and pairs is slowest due to scanning the whole hash part.", "durationMs": 7956, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "de5e4875fcf3e600", "usage": { "source": "provider", "promptTokens": 20699, "completionTokens": 72, "totalTokens": 22501, "reasoningTokens": 66, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:54:28.287Z", "completedAt": "2026-07-10T17:54:36.246Z", "answerBytes": 272, "answerChars": 272, "exitCode": 0 }, { "fixtureId": "gmod.perf.plain-lua-vs-fn.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- Plain imperative transforms: one pass, no closures, no table churn.\n-- Faster than DarkRP's fn library, which allocates a new wrapped table\n-- and constructs closures per operation on every chain step.\n\nlocal function filterMap(tbl, pred, map)\n local out = {}\n local n = 0\n for i = 1, #tbl do\n local v = tbl[i]\n if pred(v, i) then\n n = n + 1\n out[n] = map(v, i)\n end\n end\n return out\nend\n\n-- Example: keep even numbers, square them.\nlocal src = {1, 2, 3, 4, 5, 6}\nlocal res = filterMap(src,\n function(x) return x % 2 == 0 end,\n function(x) return x * x end\n)\n-- res == {4, 16, 36}\n```\n\nReason: A single fused pass with a pre-sized output array avoids fn's per-step table allocation and closure construction, giving better cache locality and no combinator overhead.", "durationMs": 11128, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "ead0a98b3ff6a388", "usage": { "source": "provider", "promptTokens": 22369, "completionTokens": 238, "totalTokens": 22693, "reasoningTokens": 86, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:54:28.641Z", "completedAt": "2026-07-10T17:54:39.770Z", "answerBytes": 838, "answerChars": 838, "exitCode": 0 }, { "fixtureId": "gmod.perf.player-cache-hooks.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal CachedPlayers = {}\n\nlocal function RefreshPlayers()\n local t = {}\n for _, ply in ipairs(player.GetAll()) do\n t[#t + 1] = ply\n end\n CachedPlayers = t\nend\n\nhook.Add(\"PlayerInitialSpawn\", \"CachePlayers\", RefreshPlayers)\nhook.Add(\"PlayerDisconnected\", \"CachePlayers\", RefreshPlayers)\nhook.Add(\"InitPostEntity\", \"CachePlayers\", RefreshPlayers)\n\nhook.Add(\"Tick\", \"UseCachedPlayers\", function()\n for i = 1, #CachedPlayers do\n local ply = CachedPlayers[i]\n -- per-tick work here, no player.GetAll() call\n end\nend)\n```\n\nReason: Iterating a cached numeric array with a numeric `for` avoids both the `player.GetAll()` allocation and `ipairs` overhead on every tick, rebuilding the table only on join/leave events.", "durationMs": 9693, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "a834817afe9e6c25", "usage": { "source": "provider", "promptTokens": 20706, "completionTokens": 199, "totalTokens": 22602, "reasoningTokens": 33, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:54:29.159Z", "completedAt": "2026-07-10T17:54:38.858Z", "answerBytes": 754, "answerChars": 754, "exitCode": 0 }, { "fixtureId": "gmod.perf.ply-table-index.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attemptIndex": 1, "status": "incorrect", "detail": "Did not match a fixture answer pattern.", "finalResponse": "```lua\nlocal PlayerCache = {}\nlocal entGetID = FindMetaTable(\"Player\").EntIndex\n\n-- write\nPlayerCache[entGetID(ply)] = value\n\n-- read (hot path)\nlocal v = PlayerCache[entGetID(ply)]\n```\nReason: Reads hit a plain local table via an integer key instead of traversing the Player metatable's `__index`, avoiding per-access metamethod overhead.", "durationMs": 10919, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f18cc80df8999147", "usage": { "source": "provider", "promptTokens": 22354, "completionTokens": 88, "totalTokens": 22766, "reasoningTokens": 324, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:54:30.519Z", "completedAt": "2026-07-10T17:54:41.439Z", "answerBytes": 339, "answerChars": 339, "exitCode": 0 }, { "fixtureId": "gmod.perf.seq-tables.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal seq = {\"a\", \"b\", \"c\", \"d\"}\nfor i = 1, #seq do\n local v = seq[i]\nend\n```\nReason: Sequential number-indexed arrays iterate via a numeric `for i = 1, #t` loop with direct O(1) integer slot access in the array part, avoiding the hash lookups and `next()` overhead that string-keyed maps require under `pairs`.", "durationMs": 10563, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "4778b0220c3f91a3", "usage": { "source": "provider", "promptTokens": 33709, "completionTokens": 137, "totalTokens": 33846, "reasoningTokens": 0, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:54:30.750Z", "completedAt": "2026-07-10T17:54:41.314Z", "answerBytes": 321, "answerChars": 321, "exitCode": 0 }, { "fixtureId": "gmod.perf.setdrawcolor-split.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nsurface.SetDrawColor(r, g, b, a)\n```\n\nReason: Passing separate numbers avoids allocating a new Color table on every call, removing per-frame garbage in the hot draw path.", "durationMs": 7354, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "d110fde8a37bbe59", "usage": { "source": "provider", "promptTokens": 20689, "completionTokens": 43, "totalTokens": 22453, "reasoningTokens": 57, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:54:31.774Z", "completedAt": "2026-07-10T17:54:39.130Z", "answerBytes": 177, "answerChars": 177, "exitCode": 0 }, { "fixtureId": "gmod.perf.sqlite-vs-mysql.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- Local SQLite via the built-in sql library (synchronous, in-process)\nlocal escaped = sql.SQLStr( ply:SteamID64() )\nlocal row = sql.QueryRow( \"SELECT money FROM players WHERE steamid = \" .. escaped .. \" LIMIT 1\" )\nlocal money = row and tonumber( row.money ) or 0\n```\nReason: SQLite runs in-process on the local disk with no network round-trip, so reads/writes are typically lower latency than remote MySQL, whose queries cross the network to another host.", "durationMs": 9653, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "4a3f5d2a20d71ac9", "usage": { "source": "provider", "promptTokens": 33745, "completionTokens": 187, "totalTokens": 33932, "reasoningTokens": 0, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:54:31.837Z", "completedAt": "2026-07-10T17:54:41.492Z", "answerBytes": 463, "answerChars": 463, "exitCode": 0 }, { "fixtureId": "gmod.perf.steamid-cache.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal steamIDCache = setmetatable({}, { __mode = \"k\" })\n\nlocal plyMeta = FindMetaTable(\"Player\")\nlocal _SteamID = plyMeta.SteamID\n\nfunction plyMeta:SteamID()\n local cached = steamIDCache[self]\n if cached ~= nil then return cached end\n local id = _SteamID(self)\n steamIDCache[self] = id\n return id\nend\n\nhook.Add(\"PlayerDisconnected\", \"SteamIDCacheClear\", function(ply)\n steamIDCache[ply] = nil\nend)\n```\n\nReason: SteamID() recomputes from the net channel each call; caching on the player (weak-keyed so disconnected players are GC'd) returns the stored string on repeat calls, dropping per-call cost to a table lookup.", "durationMs": 11228, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "e8a94aa454154982", "usage": { "source": "provider", "promptTokens": 20687, "completionTokens": 179, "totalTokens": 22675, "reasoningTokens": 145, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:54:32.282Z", "completedAt": "2026-07-10T17:54:43.512Z", "answerBytes": 641, "answerChars": 641, "exitCode": 0 }, { "fixtureId": "gmod.perf.string-table-concat.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 0 through 0 candidate loops.", "finalResponse": "```lua\nlocal parts = {}\nfor i = 1, 10000 do\n parts[#parts + 1] = \"piece_\" .. i\nend\nlocal result = table.concat(parts)\n```\nReason: Repeated `..` reallocates and copies a growing string each iteration (O(n²)); collecting pieces in a table and calling `table.concat` once builds the result in a single pass (O(n)).", "durationMs": 10787, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "b0cf9e04ae7c5dd9", "usage": { "source": "provider", "promptTokens": 33694, "completionTokens": 129, "totalTokens": 33823, "reasoningTokens": 0, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:54:33.335Z", "completedAt": "2026-07-10T17:54:44.124Z", "answerBytes": 315, "answerChars": 314, "exitCode": 0 }, { "fixtureId": "gmod.perf.surface-drawrect.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nsurface.SetDrawColor(r, g, b, a)\nsurface.DrawRect(x, y, w, h)\n```\n\nReason: `draw.RoundedBox(0, ...)` still runs the rounded-rect path (radius clamping, corner math, poly building); `surface.DrawRect` is a single flat quad with no rounding logic, so it's the minimal draw call for axis-aligned rectangular fills.", "durationMs": 8902, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "696e8de769d9ad0e", "usage": { "source": "provider", "promptTokens": 22358, "completionTokens": 88, "totalTokens": 22526, "reasoningTokens": 80, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:54:34.945Z", "completedAt": "2026-07-10T17:54:43.849Z", "answerBytes": 318, "answerChars": 318, "exitCode": 0 }, { "fixtureId": "gmod.perf.surface-text.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nsurface.SetFont(\"DermaDefault\")\nsurface.SetTextColor(255, 255, 255, 255)\nsurface.SetTextPos(10, 10)\nsurface.DrawText(\"Hello every frame\")\n```\n\nReason: For a single line, the raw surface.* sequence avoids the multiline/wrapping and argument-handling overhead in draw.DrawText and draw.SimpleTextOutlined, making it the fastest per-frame path.", "durationMs": 10037, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "95d9fe4918ee4197", "usage": { "source": "provider", "promptTokens": 22352, "completionTokens": 90, "totalTokens": 22550, "reasoningTokens": 108, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:54:35.428Z", "completedAt": "2026-07-10T17:54:45.466Z", "answerBytes": 348, "answerChars": 348, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-count-hash.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal len = #myTable\n```\n\nReason: The `#` length operator is the preferred, O(1) way to get the length of a sequential array-like table; `table.Count` iterates all pairs and is meant for non-sequential tables.", "durationMs": 7645, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3e9bbfc8452e05e3", "usage": { "source": "provider", "promptTokens": 20682, "completionTokens": 56, "totalTokens": 22485, "reasoningTokens": 83, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:54:36.248Z", "completedAt": "2026-07-10T17:54:43.895Z", "answerBytes": 216, "answerChars": 216, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-empty.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal t = t or {}\nt = {}\n```\n\nReason: `t = {}` allocates one new table (O(1)) and lets the old one be GC'd, whereas `table.Empty(t)` walks every key to set it to nil (O(n)), so for a large table the reassign is generally faster.", "durationMs": 8789, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3a6344977f5bd475", "usage": { "source": "provider", "promptTokens": 20683, "completionTokens": 70, "totalTokens": 22600, "reasoningTokens": 183, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:54:36.452Z", "completedAt": "2026-07-10T17:54:45.242Z", "answerBytes": 235, "answerChars": 235, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-hasvalue.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal set = { [\"apple\"] = true, [\"banana\"] = true, [\"cherry\"] = true }\nif set[value] then\n -- value exists\nend\n```\n\nReason: A hash lookup is O(1) versus table.HasValue's O(n) linear scan over the list.", "durationMs": 8169, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "7d064428a873fdfc", "usage": { "source": "provider", "promptTokens": 20689, "completionTokens": 67, "totalTokens": 22488, "reasoningTokens": 68, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:54:37.081Z", "completedAt": "2026-07-10T17:54:45.253Z", "answerBytes": 211, "answerChars": 211, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-literal.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal t = { a = 1, b = 2, c = 3 }\n```\n\nReason: A single constructor pre-sizes the hash part and inserts all keys at once, avoiding the repeated rehash/lookup overhead of separate `t.a = ...` assignments after `{}`.", "durationMs": 9286, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f95a8fc610d720ad", "usage": { "source": "provider", "promptTokens": 22347, "completionTokens": 64, "totalTokens": 22458, "reasoningTokens": 47, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:54:37.330Z", "completedAt": "2026-07-10T17:54:46.618Z", "answerBytes": 221, "answerChars": 221, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-random.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal t = {\"a\", \"b\", \"c\", \"d\", \"e\"}\n\nlocal elem = t[math.random(#t)]\n```\nReason: `table.Random` internally builds a key list and iterates the table each call, whereas `t[math.random(#t)]` uses the sequential table's length directly for a single O(1) index lookup.", "durationMs": 8539, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f3e090701953d4a9", "usage": { "source": "provider", "promptTokens": 33678, "completionTokens": 108, "totalTokens": 33786, "reasoningTokens": 0, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:54:38.672Z", "completedAt": "2026-07-10T17:54:47.215Z", "answerBytes": 270, "answerChars": 270, "exitCode": 0 }, { "fixtureId": "gmod.perf.x-times-x.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal x2 = x * x\n```\n\nReason: `x * x` avoids the `math.pow` call that `x^2` compiles to, so it is faster in a tight loop.", "durationMs": 10675, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "79d48008f6b5174f", "usage": { "source": "provider", "promptTokens": 20676, "completionTokens": 46, "totalTokens": 22445, "reasoningTokens": 59, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:54:38.860Z", "completedAt": "2026-07-10T17:54:49.537Z", "answerBytes": 128, "answerChars": 128, "exitCode": 0 }, { "fixtureId": "gmod.player-iterator.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attemptIndex": 1, "status": "pass", "detail": "Uses player.Iterator() (wiki-recommended Lua-cached iterator).", "finalResponse": "```lua\nfor _, ply in player.Iterator() do\n -- ply: each connected Player\nend\n```\n\nReason: `player.Iterator()` is the modern Garry's Mod API that lazily yields each connected player without allocating a table, replacing the older `pairs(player.GetAll())` pattern.", "durationMs": 8368, "version": "1.15.9", "fixtureVersion": 2, "rubricVersion": "4", "promptHash": "fe3d7469535a0ca2", "usage": { "source": "provider", "promptTokens": 20692, "completionTokens": 70, "totalTokens": 22486, "reasoningTokens": 60, "cachedTokens": 1664, "cost": 0 }, "startedAt": "2026-07-10T17:54:39.132Z", "completedAt": "2026-07-10T17:54:47.503Z", "answerBytes": 265, "answerChars": 265, "exitCode": 0 }, { "fixtureId": "gmod.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nfor _, ent in ents.Iterator() do\n if ent:GetClass() == \"prop_physics\" then\n -- do something with ent\n end\nend\n```\n\nReason: `ents.Iterator()` is a coroutine-based generator that yields every entity one at a time, so no intermediate table is built.", "durationMs": 8101, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "3990c92253db85bb", "usage": { "source": "provider", "promptTokens": 20332, "completionTokens": 70, "totalTokens": 22234, "reasoningTokens": 40, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:54:39.771Z", "completedAt": "2026-07-10T17:54:47.874Z", "answerBytes": 266, "answerChars": 266, "exitCode": 0 }, { "fixtureId": "gmod.hook-add.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attemptIndex": 1, "status": "pass", "detail": "Registers a named hook with hook.Add.", "finalResponse": "```lua\nhook.Add(\"Think\", \"MyAddon.Think\", function()\n -- optional callback body\nend)\n```\nReason: The `hook.Add` function registers a callback for a specified hook with a unique identifier, ensuring the callback runs each frame when the Think hook fires.", "durationMs": 9864, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "12d2222fdb7d6b90", "usage": { "source": "provider", "promptTokens": 21104, "completionTokens": 61, "totalTokens": 22531, "reasoningTokens": 342, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:54:41.316Z", "completedAt": "2026-07-10T17:54:51.181Z", "answerBytes": 256, "answerChars": 256, "exitCode": 0 }, { "fixtureId": "gmod.isvalid.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attemptIndex": 1, "status": "pass", "detail": "Uses IsValid for entity/object validity.", "finalResponse": "```lua\nif IsValid(ent) then\n -- safe to call methods on ent\n ent:Health()\nend\n```\n\nReason: `IsValid(ent)` returns `true` only when `ent` references a non-removed, non-stale entity; if the entity was removed or garbage-collected, the function returns `false`, preventing attempts to index nil and breaking the script.", "durationMs": 9620, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "35527312e59dfc13", "usage": { "source": "provider", "promptTokens": 21102, "completionTokens": 82, "totalTokens": 22441, "reasoningTokens": 233, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:54:41.441Z", "completedAt": "2026-07-10T17:54:51.063Z", "answerBytes": 318, "answerChars": 318, "exitCode": 0 }, { "fixtureId": "gmod.net-receivers.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nnet.Receive(\"MyAddon.Sync\", function(len)\n local data = net.ReadString() -- example: adapt to your protocol\n -- handle the incoming data here\nend)\n```\n\nReason: Registers a callback for the \"MyAddon.Sync\" message so it fires when a client receives that message from the server.", "durationMs": 10305, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "24d54ee8366753a6", "usage": { "source": "provider", "promptTokens": 21092, "completionTokens": 69, "totalTokens": 22216, "reasoningTokens": 31, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:54:41.494Z", "completedAt": "2026-07-10T17:54:51.801Z", "answerBytes": 289, "answerChars": 289, "exitCode": 0 }, { "fixtureId": "gmod.perf.angle-zero.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 0 through 0 candidate loops.", "finalResponse": "```lua\n-- Reusable zeroed Angle pool (hot path)\nlocal ZeroAngles = Angle(0, 0, 0)\n\nfunction ResetAngle(a)\n a.p = 0\n a.y = 0\n a.r = 0\n return a\nend\n\n-- Usage in a hot loop\nlocal ang = Angle() -- allocate once if you need a fresh one\nfor i = 1, 10000 do\n ResetAngle(ang) -- re-zero in place\n -- use ang ...\nend\n```\n\nReason: Reusing and zeroing a single Angle table avoids repeated table allocation and garbage collection pressure in tight loops.", "durationMs": 9621, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f6bc97bf98280d62", "usage": { "source": "provider", "promptTokens": 21097, "completionTokens": 143, "totalTokens": 22302, "reasoningTokens": 38, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:54:43.513Z", "completedAt": "2026-07-10T17:54:53.137Z", "answerBytes": 462, "answerChars": 462, "exitCode": 0 }, { "fixtureId": "gmod.perf.config-var.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attemptIndex": 1, "status": "incorrect", "detail": "Matched an incorrect-answer pattern.", "finalResponse": "```lua\nlocal color = myaddon.config.color\nlocal r, g, b = color[1], color[2], color[3]\n```\n\nReason: Flat locals avoid repeated table-index chains; Lua resolves the path each time, so caching into a local eliminates two extra field lookups per read.", "durationMs": 9064, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "bcc4ff8eb162b699", "usage": { "source": "provider", "promptTokens": 20335, "completionTokens": 66, "totalTokens": 22238, "reasoningTokens": 45, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:54:43.851Z", "completedAt": "2026-07-10T17:54:52.918Z", "answerBytes": 248, "answerChars": 248, "exitCode": 0 }, { "fixtureId": "gmod.perf.darkrpvar.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal jobName = ply:getDarkRPVar(\"job\")\n```\n\nReason: `getDarkRPVar` is DarkRP's official accessor — it reads from DarkRP's managed networked variable system and respects any internal caching or update logic, whereas `GetNWString(\"job\")` bypasses DarkRP's abstraction layer and can break if the internal key changes.", "durationMs": 10697, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "02a37daa699cded3", "usage": { "source": "provider", "promptTokens": 20331, "completionTokens": 80, "totalTokens": 22305, "reasoningTokens": 102, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:54:43.896Z", "completedAt": "2026-07-10T17:54:54.595Z", "answerBytes": 324, "answerChars": 322, "exitCode": 0 }, { "fixtureId": "gmod.perf.disttosqr.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal a = Vector(100, 200, 300)\nlocal b = Vector(400, 500, 600)\nlocal threshold = 1000\n\nif a:DistToSqr(b) < threshold * threshold then\n print(\"Close enough\")\nend\n```\n\nReason: `DistToSqr` avoids the expensive square root inside `Dist`, so for threshold checks you square the threshold instead and compare squared distances.", "durationMs": 11448, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "a5772470c6859cdc", "usage": { "source": "provider", "promptTokens": 21098, "completionTokens": 109, "totalTokens": 22265, "reasoningTokens": 34, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:54:44.126Z", "completedAt": "2026-07-10T17:54:55.576Z", "answerBytes": 332, "answerChars": 332, "exitCode": 0 }, { "fixtureId": "gmod.perf.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nfor _, ent in ipairs(ents.GetAll()) do\n -- visit ent\nend\n```\nReason: `ents.GetAll()` returns a table of all entities and is the standard, clear way to iterate; the wiki-recommended `ipairs` over this table avoids repeated C↔Lua calls and is efficient for most use cases.", "durationMs": 10826, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "306d3f1d05f28246", "usage": { "source": "provider", "promptTokens": 21097, "completionTokens": 73, "totalTokens": 22223, "reasoningTokens": 29, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:54:45.244Z", "completedAt": "2026-07-10T17:54:56.072Z", "answerBytes": 282, "answerChars": 280, "exitCode": 0 }, { "fixtureId": "gmod.perf.find-ents-near.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nlocal nearby = ents.FindInSphere( ply:GetPos(), 512 )\n```\nReason: `ents.FindInSphere` is consistently the fastest built-in spatial query in GMod benchmarks — O(n) with a distance check rather than the heavier visibility or PVS overhead.", "durationMs": 7588, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "07c583fc3d9fe09f", "usage": { "source": "provider", "promptTokens": 20352, "completionTokens": 63, "totalTokens": 22254, "reasoningTokens": 47, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:54:45.254Z", "completedAt": "2026-07-10T17:54:52.844Z", "answerBytes": 245, "answerChars": 243, "exitCode": 0 }, { "fixtureId": "gmod.perf.find-players-near.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nlocal function PlayersNear(pos, radius)\n local r2 = radius * radius\n local result = {}\n for _, ply in ipairs(player.GetAll()) do\n local diff = ply:GetPos() - pos\n if diff:LengthSqr() <= r2 then\n result[#result + 1] = ply\n end\n end\n return result\nend\n```\n\nReason: `player.GetAll()` returns a cached, tiny table (~100 entries max) so you skip the world-entities scan entirely; combining it with LengthSqr avoids the sqrt inside the radius check.", "durationMs": 8597, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "d139ba2e8ee38a2f", "usage": { "source": "provider", "promptTokens": 21115, "completionTokens": 131, "totalTokens": 22304, "reasoningTokens": 34, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:54:45.468Z", "completedAt": "2026-07-10T17:54:54.068Z", "answerBytes": 469, "answerChars": 469, "exitCode": 0 }, { "fixtureId": "gmod.perf.for-vs-while.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nlocal i = 1\nwhile i <= n do\n -- body\n i = i + 1\nend\n```\n\nReason: In Garry's Mod Lua (GLua), `while` avoids the per-iteration overhead of `for`'s range iteration internals (table lookups for limit/step and the compare-and-assign logic), making a hand-rolled `while` counter marginally faster for simple counts.", "durationMs": 8214, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "b3401a190a8aecf0", "usage": { "source": "provider", "promptTokens": 21102, "completionTokens": 96, "totalTokens": 22250, "reasoningTokens": 28, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:54:46.620Z", "completedAt": "2026-07-10T17:54:54.836Z", "answerBytes": 318, "answerChars": 318, "exitCode": 0 }, { "fixtureId": "gmod.perf.hook-once.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- SLOWER: hook.Run lookup repeated every player\nfor _, ply in ipairs(player.GetAll()) do\n hook.Run(\"MyTick\", ply)\nend\n\n-- FASTER: single hook.Run call, single lookup\nhook.Run(\"MyTick\", player.GetAll())\n```\n\nReason: `hook.Run` performs a table lookup and iteration over registered hooks internally; calling it once avoids repeating that overhead per player.", "durationMs": 10899, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "ed1d3e09249fc8bb", "usage": { "source": "provider", "promptTokens": 20343, "completionTokens": 88, "totalTokens": 22360, "reasoningTokens": 137, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:54:47.217Z", "completedAt": "2026-07-10T17:54:58.119Z", "answerBytes": 367, "answerChars": 367, "exitCode": 0 }, { "fixtureId": "gmod.perf.hudpaint-cache.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nhook.Add(\"HUDPaint\", \"OptimizedHealthHUD\", function()\n local hp = LocalPlayer():Health()\n -- Use hp three times below instead of calling :Health() each time\n surface.SetDrawColor(255, 0, 0)\n surface.DrawRect(10, 10, hp, 20)\n draw.SimpleText(hp, \"Default\", 10, 40, color_white)\n draw.RoundedBox(4, 10, 60, hp, 20, Color(255, 0, 0))\nend)\n```\n\nReason: Caching `LocalPlayer():Health()` in a local eliminates two redundant method calls per frame, reducing overhead from `LocalPlayer` table lookups and the `Health` method invocation.", "durationMs": 10820, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3def450f3158ceff", "usage": { "source": "provider", "promptTokens": 20341, "completionTokens": 177, "totalTokens": 22406, "reasoningTokens": 96, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:54:47.505Z", "completedAt": "2026-07-10T17:54:58.327Z", "answerBytes": 553, "answerChars": 553, "exitCode": 0 }, { "fixtureId": "gmod.perf.local-color.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal WHITE = Color(255, 255, 255)\n\nfunction PANEL:Paint(w, h)\n draw.RoundedBox(4, 0, 0, w, h, WHITE)\nend\n```\n\nReason: Hoisting the `Color()` call to module scope avoids allocating a new userdata every frame.", "durationMs": 8664, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "16a7bed1b931d467", "usage": { "source": "provider", "promptTokens": 21101, "completionTokens": 77, "totalTokens": 22266, "reasoningTokens": 64, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:54:47.879Z", "completedAt": "2026-07-10T17:54:56.579Z", "answerBytes": 218, "answerChars": 218, "exitCode": 0 }, { "fixtureId": "gmod.perf.local-vs-global.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal sin = math.sin\nfor i = 1, n do\n local v = sin(x)\n -- use v\nend\n```\n\nReason: Caching `math.sin` in a local eliminates repeated global-table lookups each iteration, and locals resolve to direct stack-index operations in LuaJIT, which powers Garry's Mod.", "durationMs": 7589, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "c116d8c651190647", "usage": { "source": "provider", "promptTokens": 20329, "completionTokens": 77, "totalTokens": 22290, "reasoningTokens": 92, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:54:49.538Z", "completedAt": "2026-07-10T17:54:57.129Z", "answerBytes": 266, "answerChars": 266, "exitCode": 0 }, { "fixtureId": "gmod.perf.localplayer-cache.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nlocal ply\nhook.Add(\"Think\", \"CacheLocalPlayer\", function()\n ply = LocalPlayer()\nend)\n```\nReason: Caching LocalPlayer() once per frame in a shared local eliminates repeated engine lookups while always reflecting the current player object.", "durationMs": 9397, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "7398105af47b079e", "usage": { "source": "provider", "promptTokens": 20330, "completionTokens": 58, "totalTokens": 22198, "reasoningTokens": 18, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:54:51.065Z", "completedAt": "2026-07-10T17:55:00.463Z", "answerBytes": 247, "answerChars": 247, "exitCode": 0 }, { "fixtureId": "gmod.perf.looking-at.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nfunction ArePlayersLookingAtEachOther(ply1, ply2, threshold)\n threshold = threshold or 0.5\n local pos1 = ply1:GetPos()\n local pos2 = ply2:GetPos()\n local dir12 = (pos2 - pos1):GetNormalized()\n local dir21 = -dir12\n local aim1 = ply1:GetAimVector()\n local aim2 = ply2:GetAimVector()\n return aim1:Dot(dir12) > threshold and aim2:Dot(dir21) > threshold\nend\n```\n\nReason: Using dot products of aim vectors with direction vectors avoids costly trigonometric functions while still providing a configurable rough check.", "durationMs": 17553, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "20b22f678a4b08d7", "usage": { "source": "provider", "promptTokens": 20344, "completionTokens": 156, "totalTokens": 22987, "reasoningTokens": 695, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:54:51.183Z", "completedAt": "2026-07-10T17:55:08.738Z", "answerBytes": 542, "answerChars": 542, "exitCode": 0 }, { "fixtureId": "gmod.perf.meta-vs-arg.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- preferred: direct function call\nlocal function SomeHelper(ply)\n -- ...\nend\n\nSomeHelper(ply)\n```\n\nReason: Method calls incur an extra table lookup and must resolve `self` at runtime; a direct call skips both overheads.", "durationMs": 6137, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "de332f7356830dfa", "usage": { "source": "provider", "promptTokens": 21106, "completionTokens": 58, "totalTokens": 22221, "reasoningTokens": 33, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:54:51.802Z", "completedAt": "2026-07-10T17:54:57.941Z", "answerBytes": 228, "answerChars": 228, "exitCode": 0 }, { "fixtureId": "gmod.perf.msg-vs-print.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- print is a Lua wrapper: converts all args, joins with tabs, then calls Msg\n-- MsgN is the direct C binding — fewer allocations, no tab-join pass\nMsgN(\"debug: \", variable)\n```\n\nReason: `MsgN` is the native C function that `print` wraps; skipping the intermediate Lua argument conversion and tab-join allocation makes it faster in hot loops.", "durationMs": 23077, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "6cbb4e4b2f19dd24", "usage": { "source": "provider", "promptTokens": 20323, "completionTokens": 88, "totalTokens": 23133, "reasoningTokens": 930, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:54:52.846Z", "completedAt": "2026-07-10T17:55:15.926Z", "answerBytes": 351, "answerChars": 349, "exitCode": 0 }, { "fixtureId": "gmod.perf.pairs-ipairs-for.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal t = {1, 2, 3, ..., N} -- large sequential array\nlocal sum = 0\nfor i = 1, #t do\n sum = sum + t[i]\nend\n```\nReason: Numeric for loops avoid iterator overhead and are optimized in LuaJIT/GMod, making them fastest for sequential numeric arrays.", "durationMs": 8009, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "de5e4875fcf3e600", "usage": { "source": "provider", "promptTokens": 21110, "completionTokens": 80, "totalTokens": 22337, "reasoningTokens": 123, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:54:52.921Z", "completedAt": "2026-07-10T17:55:00.931Z", "answerBytes": 255, "answerChars": 255, "exitCode": 0 }, { "fixtureId": "gmod.perf.plain-lua-vs-fn.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attemptIndex": 1, "status": "incorrect", "detail": "Matched an incorrect-answer pattern.", "finalResponse": "```lua\n-- Slower: DarkRP fn combinators (allocates closures + intermediate tables)\nlocal result = fn.filter(function(v) return v.active end, players)\nresult = fn.map(function(v) return v:Name() end, result)\nresult = fn.sortBy(function(v) return v:Name() end, result)\n\n-- Faster: plain numeric for loop, single pass, no intermediates\nlocal out = {}\nfor i = 1, #players do\n local p = players[i]\n if p.active then\n out[#out + 1] = p:Name()\n end\nend\ntable.sort(out)\n```\n\nReason: Direct loops avoid per-element closure dispatch, table reconstruction, and virtual-call overhead that DarkRP's `fn` combinators pay on every element — LuaJIT also hoists numeric `for` invariants and elides bounds checks the closure variant cannot.", "durationMs": 14874, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "ead0a98b3ff6a388", "usage": { "source": "provider", "promptTokens": 20352, "completionTokens": 190, "totalTokens": 22542, "reasoningTokens": 208, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:54:53.139Z", "completedAt": "2026-07-10T17:55:08.014Z", "answerBytes": 730, "answerChars": 728, "exitCode": 0 }, { "fixtureId": "gmod.perf.player-cache-hooks.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- Cache for player list, refreshed only on join/leave events\nlocal cachedPlayers = {}\nlocal function RefreshPlayerCache()\n cachedPlayers = player.GetAll()\nend\n\nhook.Add(\"PlayerInitialSpawn\", \"UpdateCachedPlayers\", RefreshPlayerCache)\nhook.Add(\"PlayerDisconnected\", \"UpdateCachedPlayers\", RefreshCache)\n-- Initialize cache at load (handles players already connected)\nRefreshCache()\n\n-- Example Think hook using cache (no per-tick GetAll)\nhook.Add(\"Think\", \"MyOptimizedHook\", function()\n for _, ply in ipairs(cachedPlayers) do\n -- Your per-tick logic here\n end\nend)\n```\nReason: Caching avoids per-tick player table rebuilds; events update cache only when necessary, reducing allocations and CPU overhead.", "durationMs": 30210, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "a834817afe9e6c25", "usage": { "source": "provider", "promptTokens": 20345, "completionTokens": 164, "totalTokens": 23546, "reasoningTokens": 1245, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:54:54.069Z", "completedAt": "2026-07-10T17:55:24.281Z", "answerBytes": 726, "answerChars": 726, "exitCode": 0 }, { "fixtureId": "gmod.perf.ply-table-index.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal PLAYER_DATA = {}\n\nhook.Add(\"PlayerInitialSpawn\", \"init_data\", function(ply)\n PLAYER_DATA[ply] = { someField = 0 }\nend)\n\nhook.Add(\"PlayerDisconnected\", \"cleanup_data\", function(ply)\n PLAYER_DATA[ply] = nil\nend)\n\n-- Read: upvalue lookup beats Entity metatable access\nlocal function GetSomeField(ply)\n return PLAYER_DATA[ply].someField\nend\n\n-- Write\nlocal function SetSomeField(ply, val)\n PLAYER_DATA[ply].someField = val\nend\n```\n\nReason: Table keyed by entity reference with upvalue local avoids repeated `ply` metatable lookups and `__index` calls that `ply.someField` incurs through `Entity`'s C++ accessor chain.", "durationMs": 10746, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f18cc80df8999147", "usage": { "source": "provider", "promptTokens": 20332, "completionTokens": 172, "totalTokens": 22329, "reasoningTokens": 33, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:54:54.597Z", "completedAt": "2026-07-10T17:55:05.345Z", "answerBytes": 638, "answerChars": 638, "exitCode": 0 }, { "fixtureId": "gmod.perf.seq-tables.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- Sequential array (integer-indexed from 1..N)\nlocal items = { \"alpha\", \"bravo\", \"charlie\", \"delta\", \"echo\" }\n\nfor i = 1, #items do\n local v = items[i]\nend\n```\n\nReason: LuaJIT (and stock Lua) stores sequential integer-indexed arrays as dense, contiguous memory with O(1) index lookup; string-keyed maps are hash tables with hash-compute + collision handling overhead, making array iteration faster for both single and bulk traversal.", "durationMs": 8416, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "4778b0220c3f91a3", "usage": { "source": "provider", "promptTokens": 20338, "completionTokens": 118, "totalTokens": 22273, "reasoningTokens": 25, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:54:54.837Z", "completedAt": "2026-07-10T17:55:03.254Z", "answerBytes": 444, "answerChars": 444, "exitCode": 0 }, { "fixtureId": "gmod.perf.setdrawcolor-split.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- Fast: primitive arguments passed directly to C\nsurface.SetDrawColor(255, 0, 0)\n```\n\nReason: Passing separate r,g,b numbers avoids constructing a Color table and its field lookups, sending primitives directly to the C function.", "durationMs": 13137, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "d110fde8a37bbe59", "usage": { "source": "provider", "promptTokens": 21110, "completionTokens": 60, "totalTokens": 22503, "reasoningTokens": 309, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:54:55.578Z", "completedAt": "2026-07-10T17:55:08.719Z", "answerBytes": 236, "answerChars": 236, "exitCode": 0 }, { "fixtureId": "gmod.perf.sqlite-vs-mysql.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- Create a table if it doesn't exist\nsql.Query([[CREATE TABLE IF NOT EXISTS player_data (\n steam_id TEXT PRIMARY KEY,\n name TEXT,\n score INTEGER\n)]])\n\n-- Insert a record\nsql.Query([[INSERT OR REPLACE INTO player_data (steam_id, name, score) VALUES ('STEAM_0:1:123456', 'PlayerName', 100)]])\n\n-- Retrieve a record\nlocal result = sql.QueryValue([[SELECT score FROM player_data WHERE steam_id = 'STEAM_0:1:123456']])\nprint(\"Score:\", result)\n```\nReason: SQLite runs in‑process, avoiding network latency and the overhead of a MySQL client/server round‑trip.", "durationMs": 13844, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "4a3f5d2a20d71ac9", "usage": { "source": "provider", "promptTokens": 20350, "completionTokens": 159, "totalTokens": 22734, "reasoningTokens": 433, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:54:56.074Z", "completedAt": "2026-07-10T17:55:09.921Z", "answerBytes": 573, "answerChars": 569, "exitCode": 0 }, { "fixtureId": "gmod.perf.steamid-cache.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal idCache = setmetatable({}, { __mode = \"k\" })\n\nlocal function CachedSteamID(ply)\n if not IsValid(ply) then return \"BOT\" end\n local sid = idCache[ply]\n if not sid then\n sid = ply:SteamID()\n idCache[ply] = sid\n end\n return sid\nend\n```\n\nReason: Weak-key table avoids hard-referencing players, and lookup replaces repeated SteamIDString method calls.", "durationMs": 12219, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "e8a94aa454154982", "usage": { "source": "provider", "promptTokens": 21097, "completionTokens": 108, "totalTokens": 22248, "reasoningTokens": 19, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:54:56.582Z", "completedAt": "2026-07-10T17:55:08.808Z", "answerBytes": 369, "answerChars": 369, "exitCode": 0 }, { "fixtureId": "gmod.perf.string-table-concat.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 0 through 0 candidate loops.", "finalResponse": "```lua\nlocal parts = {}\nfor i = 1, 10000 do\n parts[i] = tostring(i)\nend\nlocal result = table.concat(parts, \",\")\n```\n\nReason: `table.concat` builds the final string in one allocation pass, while repeated `..` creates and discards a new intermediate string on every join, giving O(n²) time and memory churn.", "durationMs": 10336, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "b0cf9e04ae7c5dd9", "usage": { "source": "provider", "promptTokens": 20331, "completionTokens": 87, "totalTokens": 22264, "reasoningTokens": 54, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:54:57.132Z", "completedAt": "2026-07-10T17:55:07.470Z", "answerBytes": 307, "answerChars": 306, "exitCode": 0 }, { "fixtureId": "gmod.perf.surface-drawrect.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nsurface.SetDrawColor( r, g, b, a )\nsurface.DrawRect( x, y, w, h )\n```\n\nReason: `DrawRect` skips the radius branch and rounding logic that `RoundedBox(0, …)` still evaluates, making it a single native call instead of a Lua function wrapping one.", "durationMs": 6951, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "696e8de769d9ad0e", "usage": { "source": "provider", "promptTokens": 21102, "completionTokens": 73, "totalTokens": 22222, "reasoningTokens": 23, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:54:57.948Z", "completedAt": "2026-07-10T17:55:04.905Z", "answerBytes": 253, "answerChars": 251, "exitCode": 0 }, { "fixtureId": "gmod.perf.surface-text.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nsurface.SetFont(\"DermaLarge\") -- choose a font once\nsurface.SetTextPos(100, 100) -- set position\nsurface.DrawText(\"Hello\") -- draw the string\n```\nReason: Directly using the low‑level `surface.*` calls avoids the extra outline pass and wrapper overhead of `draw.DrawText` or `SimpleTextOutlined`, giving the fastest per‑frame drawing.", "durationMs": 12094, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "95d9fe4918ee4197", "usage": { "source": "provider", "promptTokens": 20331, "completionTokens": 94, "totalTokens": 22463, "reasoningTokens": 246, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:54:58.122Z", "completedAt": "2026-07-10T17:55:10.219Z", "answerBytes": 351, "answerChars": 347, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-count-hash.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal n = #myTable\n```\n\nReason: `#` is the native Lua length operator and is the idiomatic way to get the length of a sequential array-like table in Garry's Mod Lua.", "durationMs": 9218, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3e9bbfc8452e05e3", "usage": { "source": "provider", "promptTokens": 20325, "completionTokens": 49, "totalTokens": 22206, "reasoningTokens": 40, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:54:58.329Z", "completedAt": "2026-07-10T17:55:07.549Z", "answerBytes": 172, "answerChars": 172, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-empty.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- Faster: reuse the existing table in-place\ntable.Empty(t)\n-- Slower: creates a new table; old one awaits GC\nt = {}\n```\nReason: `table.Empty(t)` is O(n) but avoids allocation and GC pressure; `t = {}` is O(1) to assign but the abandoned table triggers a future GC sweep whose aggregate cost on large tables exceeds the one-shot clear.", "durationMs": 10954, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3a6344977f5bd475", "usage": { "source": "provider", "promptTokens": 20333, "completionTokens": 90, "totalTokens": 22245, "reasoningTokens": 30, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:55:00.465Z", "completedAt": "2026-07-10T17:55:11.420Z", "answerBytes": 342, "answerChars": 342, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-hasvalue.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 0 through 0 candidate loops.", "finalResponse": "```lua\nlocal list = {\"apple\", \"banana\", \"cherry\"}\n\n-- Slow: O(n) linear scan per lookup\nfor _, v in ipairs(list) do\n if v == \"banana\" then print(\"found\") end\nend\n\n-- Fast: O(1) average-case set lookup\nlocal set = {}\nfor _, v in ipairs(list) do set[v] = true end\n\nif set[\"banana\"] then print(\"found\") end\n```\n\nReason: `table.HasValue` and `ipairs` loops are O(n) per check; converting the list to a hash-set lets you test membership with a single O(1) key lookup.", "durationMs": 12437, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "7d064428a873fdfc", "usage": { "source": "provider", "promptTokens": 20328, "completionTokens": 140, "totalTokens": 22400, "reasoningTokens": 140, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:55:00.933Z", "completedAt": "2026-07-10T17:55:13.372Z", "answerBytes": 463, "answerChars": 463, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-literal.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- Table constructor (faster for known, small tables)\nlocal a = { x = 1, y = 2, z = 3 }\n\n-- Field-by-field assignment (slower: extra opcodes per SETTABLE)\nlocal b = {}\nb.x = 1\nb.y = 2\nb.z = 3\n```\n\nReason: The constructor compiles to a single SETLIST that sets N fields in one pass, while separate assignments emit N individual SETFIELD opcodes each with their own lookup overhead.", "durationMs": 10783, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f95a8fc610d720ad", "usage": { "source": "provider", "promptTokens": 20336, "completionTokens": 113, "totalTokens": 22406, "reasoningTokens": 165, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:55:03.256Z", "completedAt": "2026-07-10T17:55:14.040Z", "answerBytes": 387, "answerChars": 387, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-random.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal function randomElement(t)\n return t[math.random(#t)]\nend\n\n-- Usage:\nlocal myTable = {\"apple\", \"banana\", \"cherry\"}\nlocal chosen = randomElement(myTable)\n```\n\nReason: `tbl[math.random(#tbl)]` is O(1) constant-time indexing, while `table.Random` is O(n) — it calls `table.GetKeys` to build an index array then shuffles it to pick one element.", "durationMs": 11857, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f3e090701953d4a9", "usage": { "source": "provider", "promptTokens": 21097, "completionTokens": 101, "totalTokens": 22393, "reasoningTokens": 171, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:55:04.907Z", "completedAt": "2026-07-10T17:55:16.765Z", "answerBytes": 355, "answerChars": 353, "exitCode": 0 }, { "fixtureId": "gmod.perf.x-times-x.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal x2 = x * x\n```\n\nReason: Multiplication avoids function-call overhead that `math.pow` or `x^2` (operator precedence aside) would incur, making `x * x` the fastest form in tight Lua loops.", "durationMs": 8599, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "79d48008f6b5174f", "usage": { "source": "provider", "promptTokens": 20323, "completionTokens": 57, "totalTokens": 22231, "reasoningTokens": 59, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:55:05.347Z", "completedAt": "2026-07-10T17:55:13.948Z", "answerBytes": 199, "answerChars": 199, "exitCode": 0 }, { "fixtureId": "gmod.player-iterator.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attemptIndex": 1, "status": "pass", "detail": "Uses player.Iterator() (wiki-recommended Lua-cached iterator).", "finalResponse": "```lua\nfor _, ply in player.Iterator() do\n -- do something with each player\nend\n```\n\nReason: `player.Iterator()` is the recommended idiom in modern Garry's Mod Lua; it yields each connected player exactly once without allocating an intermediate table, unlike the older `player.GetAll()` + `pairs()` pattern.", "durationMs": 12845, "version": "1.15.9", "fixtureVersion": 2, "rubricVersion": "4", "promptHash": "fe3d7469535a0ca2", "usage": { "source": "provider", "promptTokens": 21098, "completionTokens": 72, "totalTokens": 22333, "reasoningTokens": 139, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:55:07.471Z", "completedAt": "2026-07-10T17:55:20.318Z", "answerBytes": 310, "answerChars": 310, "exitCode": 0 }, { "fixtureId": "gmod.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nfor ent in ents.Iterator() do\n if ent:GetClass() == \"prop_physics\" then\n -- your logic here\n end\nend\n```\n\nReason: `ents.Iterator()` returns a stateless iterator that yields entities on demand without constructing an intermediate table.", "durationMs": 12469, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "3990c92253db85bb", "usage": { "source": "provider", "promptTokens": 20332, "completionTokens": 63, "totalTokens": 22472, "reasoningTokens": 285, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:55:07.550Z", "completedAt": "2026-07-10T17:55:20.020Z", "answerBytes": 255, "answerChars": 255, "exitCode": 0 }, { "fixtureId": "gmod.hook-add.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Registers a named hook with hook.Add.", "finalResponse": "```lua\nhook.Add( \"Think\", \"MyAddon.Think\", function()\n -- Your callback logic here\nend )\n```\nReason: `hook.Add` registers a callback on a named hook; the first argument is the hook name (\"Think\"), the second is the unique identifier (\"MyAddon.Think\"), and the third is the function to run.", "durationMs": 8749, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "12d2222fdb7d6b90", "usage": { "source": "provider", "promptTokens": 20335, "completionTokens": 76, "totalTokens": 22315, "reasoningTokens": 112, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:55:08.015Z", "completedAt": "2026-07-10T17:55:16.766Z", "answerBytes": 292, "answerChars": 292, "exitCode": 0 }, { "fixtureId": "gmod.isvalid.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Uses IsValid for entity/object validity.", "finalResponse": "```lua\nif not IsValid(ent) then return end\n```\n\nReason: `IsValid` returns `false` for NULL / removed entities in Garry's Mod; calling methods on them would error or crash.", "durationMs": 8294, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "35527312e59dfc13", "usage": { "source": "provider", "promptTokens": 21096, "completionTokens": 46, "totalTokens": 22193, "reasoningTokens": 27, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:55:08.720Z", "completedAt": "2026-07-10T17:55:17.017Z", "answerBytes": 171, "answerChars": 171, "exitCode": 0 }, { "fixtureId": "gmod.net-receivers.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nnet.Receive(\"MyAddon.Sync\", function(len)\n -- handle the incoming message\nend)\n```\n\nReason: This is a direct knowledge question about Garry's Mod Lua API, not a coding task that requires tools.", "durationMs": 7023, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "24d54ee8366753a6", "usage": { "source": "provider", "promptTokens": 20318, "completionTokens": 51, "totalTokens": 22197, "reasoningTokens": 36, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:55:08.740Z", "completedAt": "2026-07-10T17:55:15.765Z", "answerBytes": 203, "answerChars": 203, "exitCode": 0 }, { "fixtureId": "gmod.perf.angle-zero.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attemptIndex": 1, "status": "incorrect", "detail": "Did not match a fixture answer pattern.", "finalResponse": "```lua\nlocal a = Angle(0, 0, 0)\n\n-- hot path: zero it instead of constructing\na:Set(0, 0, 0)\n```\n\nReason: `Angle()` allocates a new userdata every call; zeroing a reusable table avoids GC pressure.", "durationMs": 9749, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f6bc97bf98280d62", "usage": { "source": "provider", "promptTokens": 20329, "completionTokens": 64, "totalTokens": 22225, "reasoningTokens": 40, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:55:08.810Z", "completedAt": "2026-07-10T17:55:18.561Z", "answerBytes": 197, "answerChars": 197, "exitCode": 0 }, { "fixtureId": "gmod.perf.config-var.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attemptIndex": 1, "status": "incorrect", "detail": "Matched an incorrect-answer pattern.", "finalResponse": "```lua\nlocal color = myaddon.config.color -- flatten once at file scope\nprint(color.r, color.g, color.b)\n```\n\nReason: Local variable access is a single register lookup; nested table access (`myaddon.config.color`) requires chained hash-table lookups, each adding hash-and-compare overhead that compounds on frequent reads.", "durationMs": 9138, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "bcc4ff8eb162b699", "usage": { "source": "provider", "promptTokens": 21106, "completionTokens": 73, "totalTokens": 22411, "reasoningTokens": 208, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:55:09.923Z", "completedAt": "2026-07-10T17:55:19.066Z", "answerBytes": 323, "answerChars": 323, "exitCode": 0 }, { "fixtureId": "gmod.perf.darkrpvar.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- Preferred: DarkRP's own accessor\nlocal jobName = ply:getDarkRPVar(\"job\")\n\n-- Avoid: raw networked string\nlocal jobName = ply:GetNWString(\"job\")\n```\n\nReason: `getDarkRPVar(\"job\")` is DarkRP's dedicated accessor that reads from its internal variable table, staying in sync with job changes and respecting DarkRP's update cycle rather than bypassing it with raw networked variables.", "durationMs": 9673, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "02a37daa699cded3", "usage": { "source": "provider", "promptTokens": 21102, "completionTokens": 97, "totalTokens": 22446, "reasoningTokens": 223, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:55:10.221Z", "completedAt": "2026-07-10T17:55:19.897Z", "answerBytes": 389, "answerChars": 389, "exitCode": 0 }, { "fixtureId": "gmod.perf.disttosqr.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nif v1:DistToSqr(v2) < threshold * threshold then\n -- vectors are within range\nend\n```\n\nReason: `DistToSqr` avoids the expensive square root that `Distance` performs, and since you only need a threshold comparison, working with squared distances is both faster and equivalent.", "durationMs": 6508, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "a5772470c6859cdc", "usage": { "source": "provider", "promptTokens": 20330, "completionTokens": 72, "totalTokens": 22220, "reasoningTokens": 26, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:55:11.422Z", "completedAt": "2026-07-10T17:55:17.931Z", "answerBytes": 285, "answerChars": 285, "exitCode": 0 }, { "fixtureId": "gmod.perf.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nfor _, ent in ipairs(ents.GetAll()) do\n -- your code here\nend\n```\n\nReason: `ents.GetAll()` is the wiki-recommended way to iterate all entities efficiently; it returns a pre-built table, avoiding the overhead and inconsistency of older patterns like `while` loops with entity enumeration.", "durationMs": 8062, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "306d3f1d05f28246", "usage": { "source": "provider", "promptTokens": 21097, "completionTokens": 69, "totalTokens": 22234, "reasoningTokens": 44, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:55:13.374Z", "completedAt": "2026-07-10T17:55:21.438Z", "answerBytes": 297, "answerChars": 297, "exitCode": 0 }, { "fixtureId": "gmod.perf.find-ents-near.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nlocal function GetNearbyEntities(pos, radius)\n return ents.FindInSphere(pos, radius)\nend\n\nlocal function GetPlayersNearby(ply, radius)\n return GetNearbyEntities(ply:GetPos(), radius)\nend\n```\n\nReason: `ents.FindInSphere` is a single C++ call with O(n) sphere check—faster than FindInBox for point queries, and avoids PVS overhead for dynamic radius searches.", "durationMs": 16552, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "07c583fc3d9fe09f", "usage": { "source": "provider", "promptTokens": 21117, "completionTokens": 97, "totalTokens": 22667, "reasoningTokens": 429, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:55:13.949Z", "completedAt": "2026-07-10T17:55:30.504Z", "answerBytes": 372, "answerChars": 370, "exitCode": 0 }, { "fixtureId": "gmod.perf.find-players-near.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nfunction FindPlayersNear(pos, radius)\n local r2 = radius * radius\n local result = {}\n local px, py, pz = pos.x, pos.y, pos.z\n for _, p in ipairs(player.GetAll()) do\n local d = p:GetPos()\n local dx, dy, dz = d.x - px, d.y - py, d.z - pz\n if dx*dx + dy*dy + dz*dz <= r2 then\n result[#result + 1] = p\n end\n end\n return result\nend\n```\n\nReason: `ents.FindInSphere` iterates all entities then filters, while `player.GetAll()` with manual distance checks is O(players) instead of O(entities) and avoids allocating an intermediate table of non-player entities.", "durationMs": 15070, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "d139ba2e8ee38a2f", "usage": { "source": "provider", "promptTokens": 21115, "completionTokens": 173, "totalTokens": 22558, "reasoningTokens": 246, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:55:14.042Z", "completedAt": "2026-07-10T17:55:29.114Z", "answerBytes": 616, "answerChars": 616, "exitCode": 0 }, { "fixtureId": "gmod.perf.for-vs-while.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nlocal function count(n)\n local i = 1\n while i <= n do\n i = i + 1\n end\nend\n```\n\nReason: The numeric `for` loop is faster in Garry's Mod Lua because its bounds and increment are handled internally by the VM, avoiding repeated Lua-level comparisons and variable assignments each iteration.", "durationMs": 13571, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "b3401a190a8aecf0", "usage": { "source": "provider", "promptTokens": 21105, "completionTokens": 79, "totalTokens": 22315, "reasoningTokens": 107, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:55:15.769Z", "completedAt": "2026-07-10T17:55:29.349Z", "answerBytes": 309, "answerChars": 309, "exitCode": 0 }, { "fixtureId": "gmod.perf.hook-once.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- Example: notifying custom logic for all players each tick\n-- Fast pattern: single hook call with the player table\nhook.Add(\"Think\", \"NotifyAllPlayers\", function()\n local players = player.GetAll()\n hook.Run(\"NotifyPlayers\", players)\nend)\n\n-- Inside the hook that handles the notification:\nhook.Add(\"NotifyPlayers\", \"ProcessPlayers\", function(players)\n for _, ply in ipairs(players) do\n -- custom logic for each player goes here\n -- e.g. ply:SendLua(\"...\")\n end\nend)\n```\nReason: A single hook.Run call avoids repeated hook lookups per player, reducing overhead and improving tick performance.", "durationMs": 14958, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "ed1d3e09249fc8bb", "usage": { "source": "provider", "promptTokens": 20347, "completionTokens": 142, "totalTokens": 22478, "reasoningTokens": 197, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:55:15.928Z", "completedAt": "2026-07-10T17:55:30.888Z", "answerBytes": 626, "answerChars": 626, "exitCode": 0 }, { "fixtureId": "gmod.perf.hudpaint-cache.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal ply = LocalPlayer()\nlocal hp = ply:Health()\n\ndraw.RoundedBox(6, 10, 10, hp * 2, 30, Color(255, 0, 0))\ndraw.RoundedBox(6, 10, 10, hp * 2, 30, Color(255, 255, 0))\ndraw.SimpleText(hp, \"DermaLarge\", 15, 15, Color(255, 255, 255))\n```\nReason: Caches `LocalPlayer():Health()` once into a local instead of calling it three times, reducing three method lookups and engine calls to one.", "durationMs": 8044, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3def450f3158ceff", "usage": { "source": "provider", "promptTokens": 21112, "completionTokens": 162, "totalTokens": 22375, "reasoningTokens": 77, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:55:16.767Z", "completedAt": "2026-07-10T17:55:24.813Z", "answerBytes": 389, "answerChars": 389, "exitCode": 0 }, { "fixtureId": "gmod.perf.local-color.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal white = Color(255, 255, 255)\nhook.Add(\"HUDPaint\", \"MyPaint\", function()\n surface.SetDrawColor(white)\n surface.DrawRect(0, 0, ScrW(), ScrH())\nend)\n```\n\nReason: Allocating a new Color table every frame creates garbage and GC pressure; hoisting the constant into an upvalue avoids repeated allocation.", "durationMs": 12630, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "16a7bed1b931d467", "usage": { "source": "provider", "promptTokens": 20337, "completionTokens": 93, "totalTokens": 22281, "reasoningTokens": 59, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:55:16.768Z", "completedAt": "2026-07-10T17:55:29.403Z", "answerBytes": 317, "answerChars": 317, "exitCode": 0 }, { "fixtureId": "gmod.perf.local-vs-global.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal sin = math.sin\nfor i = 1, 1e6 do\n sin(x)\nend\n```\n\nReason: Local variable lookup avoids repeated global table indexing of `math.sin` each iteration.", "durationMs": 8168, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "c116d8c651190647", "usage": { "source": "provider", "promptTokens": 20332, "completionTokens": 50, "totalTokens": 22244, "reasoningTokens": 70, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:55:17.018Z", "completedAt": "2026-07-10T17:55:25.188Z", "answerBytes": 161, "answerChars": 161, "exitCode": 0 }, { "fixtureId": "gmod.perf.localplayer-cache.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal ply = LocalPlayer()\n-- Use `ply` directly; reassign after game reset / respawn if needed.\n-- For example, hook once and cache:\nhook.Add(\"InitPostEntity\", \"CacheLocalPlayer\", function()\n ply = LocalPlayer()\nend)\n```\n\nReason: Caching the reference eliminates repeated engine lookups; `LocalPlayer()` is cheap but calling it every frame adds unnecessary overhead in hot loops.", "durationMs": 10174, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "7398105af47b079e", "usage": { "source": "provider", "promptTokens": 20328, "completionTokens": 92, "totalTokens": 22250, "reasoningTokens": 38, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:55:17.934Z", "completedAt": "2026-07-10T17:55:28.112Z", "answerBytes": 389, "answerChars": 389, "exitCode": 0 }, { "fixtureId": "gmod.perf.looking-at.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nlocal function AreLookingAtEachOther(ply1, ply2)\n local dir1 = ply1:GetAimVector()\n local dir2 = ply2:GetAimVector()\n local toTarget = (ply2:GetPos() - ply1:GetPos()):GetNormalized()\n\n local dot1 = dir1:Dot(toTarget)\n local dot2 = dir2:Dot(-toTarget)\n\n return dot1 > 0.7 and dot2 > 0.7\nend\n```\n\nReason: Dot product of unit vectors gives the cosine of the angle directly; comparing against a threshold (0.7 ≈ ~45° cone) is cheaper than `math.acos` and avoids trig entirely.", "durationMs": 9595, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "20b22f678a4b08d7", "usage": { "source": "provider", "promptTokens": 21112, "completionTokens": 155, "totalTokens": 22370, "reasoningTokens": 79, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:55:18.565Z", "completedAt": "2026-07-10T17:55:28.164Z", "answerBytes": 500, "answerChars": 497, "exitCode": 0 }, { "fixtureId": "gmod.perf.meta-vs-arg.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attemptIndex": 1, "status": "incorrect", "detail": "Matched an incorrect-answer pattern.", "finalResponse": "```lua\n-- Method syntax: ply:SomeHelper()\n-- Function syntax: SomeHelper(ply)\n-- Both compile to identical bytecode\n```\n\nReason: Equivalent; `:` is syntactic sugar for `.method(self, args)`.", "durationMs": 10066, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "de332f7356830dfa", "usage": { "source": "provider", "promptTokens": 20338, "completionTokens": 51, "totalTokens": 22453, "reasoningTokens": 272, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:55:19.068Z", "completedAt": "2026-07-10T17:55:29.136Z", "answerBytes": 190, "answerChars": 190, "exitCode": 0 }, { "fixtureId": "gmod.perf.msg-vs-print.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nMsgN(\"[DEBUG] \" .. tostring(value))\n```\n\nReason: `MsgN` writes directly to the console without the overhead of `print`'s format parsing and is faster in hot paths.", "durationMs": 5834, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "6cbb4e4b2f19dd24", "usage": { "source": "provider", "promptTokens": 20325, "completionTokens": 47, "totalTokens": 22188, "reasoningTokens": 24, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:55:19.898Z", "completedAt": "2026-07-10T17:55:25.734Z", "answerBytes": 170, "answerChars": 170, "exitCode": 0 }, { "fixtureId": "gmod.perf.pairs-ipairs-for.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 1 through 1 candidate loops.", "finalResponse": "```lua\nlocal t = {}\nfor i = 1, 1e6 do t[i] = i end\n\n-- ipairs: iterator-based, safest but slowest on huge tables\nlocal s1 = SysTime()\nlocal sum = 0\nfor _, v in ipairs(t) do sum = sum + v end\nprint(\"ipairs: \" .. tostring(SysTime() - s1))\n\n-- pairs: hash-map iterator, even slower; unordered\nlocal s2 = SysTime()\nsum = 0\nfor _, v in pairs(t) do sum = sum + v end\nprint(\"pairs: \" .. tostring(SysTime() - s2))\n\n-- numeric for: fastest — direct index math, no iterator overhead\nlocal s3 = SysTime()\nsum = 0\nfor i = 1, #t do sum = sum + t[i] end\nprint(\"for i: \" .. tostring(SysTime() - s3))\n```\n\nReason: numeric `for` with `#t` is fastest because it avoids iterator-closure allocation and per-iteration function calls, operating directly on array indices and memory offsets.", "durationMs": 12470, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "de5e4875fcf3e600", "usage": { "source": "provider", "promptTokens": 21110, "completionTokens": 240, "totalTokens": 22429, "reasoningTokens": 55, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:55:20.022Z", "completedAt": "2026-07-10T17:55:32.495Z", "answerBytes": 772, "answerChars": 770, "exitCode": 0 }, { "fixtureId": "gmod.perf.plain-lua-vs-fn.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attemptIndex": 1, "status": "incorrect", "detail": "Matched an incorrect-answer pattern.", "finalResponse": "```lua\n-- Instead of: fn.Map(fn.Filter(items, predicate), transform)\n-- Use plain loops:\n\nlocal function process(items, predicate, transform)\n local out = {}\n for i = 1, #items do\n local v = items[i]\n if predicate(v) then\n out[#out + 1] = transform(v)\n end\n end\n return out\nend\n```\n\nReason: Eliminates closure allocation and per-element function-call overhead that `fn` combinators incur; plain `for` loops are the fastest iteration primitive in LuaJIT/GMod.", "durationMs": 11769, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "ead0a98b3ff6a388", "usage": { "source": "provider", "promptTokens": 21117, "completionTokens": 128, "totalTokens": 22335, "reasoningTokens": 66, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:55:20.320Z", "completedAt": "2026-07-10T17:55:32.092Z", "answerBytes": 476, "answerChars": 476, "exitCode": 0 }, { "fixtureId": "gmod.perf.player-cache-hooks.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal cachedPlayers = {}\nlocal lastPlayerCount = 0\n\nhook.Add(\"PlayerInitialSpawn\", \"UpdatePlayerCache\", function(ply)\n cachedPlayers = player.GetAll()\n lastPlayerCount = #cachedPlayers\nend)\n\nhook.Add(\"PlayerDisconnected\", \"UpdatePlayerCache\", function(ply)\n timer.Simple(0, function()\n cachedPlayers = player.GetAll()\n lastPlayerCount = #cachedPlayers\n end)\nend)\n\nhook.Add(\"Think\", \"UsePlayerCache\", function()\n if #cachedPlayers ~= player.GetCount() then\n cachedPlayers = player.GetAll()\n end\n for _, ply in ipairs(cachedPlayers) do\n -- your per-tick logic here\n end\nend)\n```\n\nReason: Uses PlayerInitialSpawn and PlayerDisconnected hooks to rebuild the cache only on player count changes, with a cheap `player.GetCount()` comparison as a safety net in Think, avoiding a full `player.GetAll()` allocation every tick.", "durationMs": 9399, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "a834817afe9e6c25", "usage": { "source": "provider", "promptTokens": 20351, "completionTokens": 206, "totalTokens": 22401, "reasoningTokens": 52, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:55:21.439Z", "completedAt": "2026-07-10T17:55:30.840Z", "answerBytes": 875, "answerChars": 875, "exitCode": 0 }, { "fixtureId": "gmod.perf.ply-table-index.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attemptIndex": 1, "status": "incorrect", "detail": "Did not match a fixture answer pattern.", "finalResponse": "```lua\nlocal playerData = {}\n\n-- Write\nplayerData[ply:UserID()] = value\n\n-- Read\nlocal v = playerData[ply:UserID()]\n```\n\nReason: Direct table indexing with an integer key avoids the entity metatable lookup chain that `ply.someField` triggers, giving you a single hash-table access instead of a VTable traversal plus string comparison.", "durationMs": 13050, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f18cc80df8999147", "usage": { "source": "provider", "promptTokens": 21103, "completionTokens": 80, "totalTokens": 22509, "reasoningTokens": 302, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:55:24.283Z", "completedAt": "2026-07-10T17:55:37.334Z", "answerBytes": 334, "answerChars": 334, "exitCode": 0 }, { "fixtureId": "gmod.perf.seq-tables.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- Faster: sequential number-indexed array\nlocal data = { 1, 2, 3, 4, 5 }\n\nfor i = 1, #data do\n local v = data[i]\nend\n```\n\nReason: Arrays use a dense integer-partitioned hash table allowing direct index lookup and predictable linear memory access, while string-keyed maps trigger full hash lookups per key and scatter values in memory, defeating cache locality.", "durationMs": 8794, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "4778b0220c3f91a3", "usage": { "source": "provider", "promptTokens": 21105, "completionTokens": 99, "totalTokens": 22273, "reasoningTokens": 45, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:55:24.816Z", "completedAt": "2026-07-10T17:55:33.613Z", "answerBytes": 371, "answerChars": 371, "exitCode": 0 }, { "fixtureId": "gmod.perf.setdrawcolor-split.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nsurface.SetDrawColor(r, g, b) -- faster: avoids Color object allocation and table lookup\n```\nReason: The numeric form skips constructing and passing a Color table object, going straight to the native C call with plain numbers.", "durationMs": 8805, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "d110fde8a37bbe59", "usage": { "source": "provider", "promptTokens": 20342, "completionTokens": 54, "totalTokens": 22265, "reasoningTokens": 77, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:55:25.190Z", "completedAt": "2026-07-10T17:55:33.997Z", "answerBytes": 233, "answerChars": 233, "exitCode": 0 }, { "fixtureId": "gmod.perf.sqlite-vs-mysql.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal result = sql.Query(\"SELECT * FROM players WHERE steamid = \" .. sql.SQLStr(steamid) .. \" LIMIT 1\")\nif result then\n return result[1]\nend\n```\n\nReason: SQLite runs in-process with zero network latency, making it faster than remote MySQL for single-server read/write workloads.", "durationMs": 9442, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "4a3f5d2a20d71ac9", "usage": { "source": "provider", "promptTokens": 21122, "completionTokens": 74, "totalTokens": 22414, "reasoningTokens": 194, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:55:25.736Z", "completedAt": "2026-07-10T17:55:35.180Z", "answerBytes": 288, "answerChars": 288, "exitCode": 0 }, { "fixtureId": "gmod.perf.steamid-cache.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- Per-player SteamID cache using Entity index as key\nlocal steamIdCache = setmetatable({}, { __mode = \"k\" }) -- weak keys so entities can be GC'd\n\nlocal function GetSteamID(ply)\n local id = steamIdCache[ply]\n if id then return id end\n id = ply:SteamID()\n steamIdCache[ply] = id\n return id\nend\n```\n\nReason: Table lookup avoids the string allocation + network query inside SteamID(); weak keys prevent leaked entity references from blocking GC.", "durationMs": 10945, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "e8a94aa454154982", "usage": { "source": "provider", "promptTokens": 20329, "completionTokens": 121, "totalTokens": 22326, "reasoningTokens": 84, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:55:28.114Z", "completedAt": "2026-07-10T17:55:39.063Z", "answerBytes": 465, "answerChars": 465, "exitCode": 0 }, { "fixtureId": "gmod.perf.string-table-concat.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 0 through 0 candidate loops.", "finalResponse": "```lua\nlocal parts = {}\nfor i = 1, 10000 do\n parts[i] = tostring(i)\nend\nlocal result = table.concat(parts, \"\")\n```\n\nReason: `table.concat` builds the final string in a single allocation pass, while repeated `..` creates a new temporary string on every append, leading to O(n²) memory copying.", "durationMs": 7872, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "b0cf9e04ae7c5dd9", "usage": { "source": "provider", "promptTokens": 20331, "completionTokens": 83, "totalTokens": 22260, "reasoningTokens": 54, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:55:28.166Z", "completedAt": "2026-07-10T17:55:36.039Z", "answerBytes": 294, "answerChars": 293, "exitCode": 0 }, { "fixtureId": "gmod.perf.surface-drawrect.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nsurface.SetDrawColor(r, g, b, a)\nsurface.DrawRect(x, y, w, h)\n```\n\nReason: `draw.RoundedBox` validates and clamps the corner-radius parameter before deciding whether to call the rounded-path helper or fall through to a plain rect; `surface.DrawRect` skips all of that bookkeeping and issues a single unclipped quad draw directly to the material system, shaving the Lua-side overhead on every call.", "durationMs": 10113, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "696e8de769d9ad0e", "usage": { "source": "provider", "promptTokens": 20343, "completionTokens": 99, "totalTokens": 22366, "reasoningTokens": 132, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:55:29.116Z", "completedAt": "2026-07-10T17:55:39.231Z", "answerBytes": 404, "answerChars": 404, "exitCode": 0 }, { "fixtureId": "gmod.perf.surface-text.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- Cache everything outside the hook, then use raw surface calls\nlocal font = \"DermaLarge\"\nlocal color = Color(255, 255, 255, 255)\nlocal x, y = 100, 100\n\nhook.Add(\"HUDPaint\", \"FastText\", function()\n surface.SetFont(font)\n surface.SetTextColor(color)\n surface.SetTextPos(x, y)\n surface.DrawText(\"Hello, world!\")\nend)\n```\n\nReason: `surface.DrawText` is a single low-level call with no wrapping, outline, or shadow overhead—`draw.SimpleTextOutlined` makes 5+ surface calls (shadow + outline + fill) and `draw.DrawText` adds per-frame word-wrap computation.", "durationMs": 12855, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "95d9fe4918ee4197", "usage": { "source": "provider", "promptTokens": 21102, "completionTokens": 166, "totalTokens": 22459, "reasoningTokens": 167, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:55:29.142Z", "completedAt": "2026-07-10T17:55:41.999Z", "answerBytes": 574, "answerChars": 572, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-count-hash.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal n = #myTable\n```\n\nReason: The `#` operator is the standard, idiomatic way to get the length of a sequential (list-like) table in Lua.", "durationMs": 6993, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3e9bbfc8452e05e3", "usage": { "source": "provider", "promptTokens": 21096, "completionTokens": 44, "totalTokens": 22180, "reasoningTokens": 16, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:55:29.351Z", "completedAt": "2026-07-10T17:55:36.346Z", "answerBytes": 146, "answerChars": 146, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-empty.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- Slower: iterates every key, sets each to nil\ntable.Empty(t)\n\n-- Faster: replaces reference, old table becomes garbage\nt = {}\n```\n\nReason: `table.Empty(t)` walks every key and sets it to nil (O(n) with per-key overhead), while `t = {}` is a single pointer swap (O(1)) and lets the GC collect the old table — the GC pause cost is amortized and far cheaper than n individual deletions when n is large.", "durationMs": 11813, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3a6344977f5bd475", "usage": { "source": "provider", "promptTokens": 20333, "completionTokens": 109, "totalTokens": 22434, "reasoningTokens": 200, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:55:29.405Z", "completedAt": "2026-07-10T17:55:41.220Z", "answerBytes": 410, "answerChars": 408, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-hasvalue.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal set = { [1] = true, [2] = true, [3] = true }\n\nif set[value] then\n -- value exists\nend\n```\n\nReason: Indexed lookup is O(1) while table.HasValue linearly scans the list.", "durationMs": 9106, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "7d064428a873fdfc", "usage": { "source": "provider", "promptTokens": 21102, "completionTokens": 61, "totalTokens": 22226, "reasoningTokens": 39, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:55:30.508Z", "completedAt": "2026-07-10T17:55:39.647Z", "answerBytes": 181, "answerChars": 181, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-literal.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- Slower: assign after creation\nlocal t = {}\nt.name = \"Alice\"\nt.age = 30\n\n-- Faster: constructor\nlocal t = { name = \"Alice\", age = 30 }\n```\n\nReason: The constructor form performs one allocation and sets all keys in a single step, avoiding repeated hash-table insertions and extra lookups each `t.key = val` line triggers.", "durationMs": 14895, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f95a8fc610d720ad", "usage": { "source": "provider", "promptTokens": 21101, "completionTokens": 90, "totalTokens": 22277, "reasoningTokens": 62, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:55:30.848Z", "completedAt": "2026-07-10T17:55:45.747Z", "answerBytes": 329, "answerChars": 329, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-random.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal el = t[math.random(#t)]\n```\n\nReason: `table.Random` iterates the table's keys to collect valid entries, while `math.random(#t)` + direct array index avoids the iteration and function-call overhead for sequential (contiguous 1–n) tables.", "durationMs": 10891, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f3e090701953d4a9", "usage": { "source": "provider", "promptTokens": 21094, "completionTokens": 65, "totalTokens": 22387, "reasoningTokens": 204, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:55:30.890Z", "completedAt": "2026-07-10T17:55:41.787Z", "answerBytes": 251, "answerChars": 249, "exitCode": 0 }, { "fixtureId": "gmod.perf.x-times-x.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal x2 = x * x\n```\n\nReason: Multiplication is faster than `math.pow(x, 2)` or `x^2` in Garry's Mod LuaJIT due to avoiding function call overhead and extra operator dispatch.", "durationMs": 9197, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "79d48008f6b5174f", "usage": { "source": "provider", "promptTokens": 21095, "completionTokens": 56, "totalTokens": 22230, "reasoningTokens": 55, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:55:32.095Z", "completedAt": "2026-07-10T17:55:41.294Z", "answerBytes": 182, "answerChars": 182, "exitCode": 0 }, { "fixtureId": "gmod.player-iterator.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Uses player.Iterator() (wiki-recommended Lua-cached iterator).", "finalResponse": "```lua\nfor _, ply in player.Iterator() do\n -- your logic here\nend\n```\n\nReason: `player.Iterator()` avoids the intermediate table allocation that `player.GetAll()` creates, reducing garbage collection pressure — especially noticeable with high player counts.", "durationMs": 13584, "version": "1.15.9", "fixtureVersion": 2, "rubricVersion": "4", "promptHash": "fe3d7469535a0ca2", "usage": { "source": "provider", "promptTokens": 21102, "completionTokens": 55, "totalTokens": 22286, "reasoningTokens": 105, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:55:32.497Z", "completedAt": "2026-07-10T17:55:46.084Z", "answerBytes": 262, "answerChars": 260, "exitCode": 0 }, { "fixtureId": "gmod.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nfor ent in ents.Iterator() do\n if ent:GetClass() == \"prop_physics\" then\n -- Process the entity here\n end\nend\n```\nReason: Using `ents.Iterator()` yields entities one-by-one from the C++ engine without constructing a Lua table of all entities, satisfying the constraint to avoid pre‑building a table of every entity in the map.", "durationMs": 14749, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "3990c92253db85bb", "usage": { "source": "provider", "promptTokens": 20329, "completionTokens": 85, "totalTokens": 22622, "reasoningTokens": 416, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:55:33.615Z", "completedAt": "2026-07-10T17:55:48.366Z", "answerBytes": 347, "answerChars": 345, "exitCode": 0 }, { "fixtureId": "gmod.hook-add.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attemptIndex": 1, "status": "pass", "detail": "Registers a named hook with hook.Add.", "finalResponse": "```lua\nhook.Add(\"Think\", \"MyAddon.Think\", function()\n -- Think callback body\nend)\n```\nReason: Demonstrates the hook.Add syntax for registering a named callback on the Think hook with the specified identifier.", "durationMs": 6746, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "12d2222fdb7d6b90", "usage": { "source": "provider", "promptTokens": 21100, "completionTokens": 51, "totalTokens": 22226, "reasoningTokens": 51, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:55:33.999Z", "completedAt": "2026-07-10T17:55:40.755Z", "answerBytes": 211, "answerChars": 211, "exitCode": 0 }, { "fixtureId": "gmod.isvalid.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attemptIndex": 1, "status": "pass", "detail": "Uses IsValid for entity/object validity.", "finalResponse": "```lua\nif IsValid(ent) then ent:SomeMethod() end\n```\n\nReason: `IsValid()` returns `true` only when the entity hasn't been removed (isn't NULL); calling methods on an invalid entity throws a Lua error.", "durationMs": 9083, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "35527312e59dfc13", "usage": { "source": "provider", "promptTokens": 21096, "completionTokens": 54, "totalTokens": 22321, "reasoningTokens": 147, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:55:35.181Z", "completedAt": "2026-07-10T17:55:44.266Z", "answerBytes": 200, "answerChars": 200, "exitCode": 0 }, { "fixtureId": "gmod.net-receivers.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nnet.Receive(\"MyAddon.Sync\", function(len)\n local someValue = net.ReadString()\n -- handle the message\nend)\n```\n\nReason: This uses Garry's Mod `net.Receive` to register a callback for incoming messages with the given name.", "durationMs": 11317, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "24d54ee8366753a6", "usage": { "source": "provider", "promptTokens": 21092, "completionTokens": 58, "totalTokens": 22196, "reasoningTokens": 22, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:55:36.042Z", "completedAt": "2026-07-10T17:55:47.364Z", "answerBytes": 233, "answerChars": 233, "exitCode": 0 }, { "fixtureId": "gmod.perf.angle-zero.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attemptIndex": 1, "status": "incorrect", "detail": "Did not match a fixture answer pattern.", "finalResponse": "```lua\nlocal zeroAng = Angle(0, 0, 0)\n\n-- In hot path, reuse and zero fields instead of allocating:\nlocal function getZeroAngle(out)\n out.p = 0\n out.y = 0\n out.r = 0\n return out\nend\n```\n\nReason: `Angle()` allocates new userdata every call; zeroing a pre-allocated Angle's fields avoids GC pressure and allocation cost in hot loops.", "durationMs": 23027, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f6bc97bf98280d62", "usage": { "source": "provider", "promptTokens": 20329, "completionTokens": 100, "totalTokens": 22956, "reasoningTokens": 735, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:55:36.348Z", "completedAt": "2026-07-10T17:55:59.378Z", "answerBytes": 343, "answerChars": 343, "exitCode": 0 }, { "fixtureId": "gmod.perf.config-var.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attemptIndex": 1, "status": "incorrect", "detail": "Matched an incorrect-answer pattern.", "finalResponse": "```lua\nlocal cachedColor = myaddon.config.color -- one-time lookup, then local\nprint(cachedColor) -- fast local read\n```\n\nReason: Local variables live in registers and are accessed in one instruction; nested table indexing requires multiple sequential hash lookups per read, so caching into a local eliminates the repeated traversal on hot paths.", "durationMs": 10162, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "bcc4ff8eb162b699", "usage": { "source": "provider", "promptTokens": 20337, "completionTokens": 75, "totalTokens": 22431, "reasoningTokens": 227, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:55:37.337Z", "completedAt": "2026-07-10T17:55:47.503Z", "answerBytes": 348, "answerChars": 348, "exitCode": 0 }, { "fixtureId": "gmod.perf.darkrpvar.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal jobName = ply:getDarkRPVar(\"job\")\n```\n\nReason: `getDarkRPVar` is the DarkRP-specific abstraction over `GetNWString`, keeping your code consistent with DarkRP's internal variable system and future-proof against implementation changes.", "durationMs": 16849, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "02a37daa699cded3", "usage": { "source": "provider", "promptTokens": 20334, "completionTokens": 58, "totalTokens": 22785, "reasoningTokens": 601, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:55:39.065Z", "completedAt": "2026-07-10T17:55:55.916Z", "answerBytes": 246, "answerChars": 246, "exitCode": 0 }, { "fixtureId": "gmod.perf.disttosqr.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal distSqr = vec1:DistToSqr(vec2)\nif distSqr < threshold * threshold then\n -- vectors are within threshold\nend\n```\n\nReason: `DistToSqr` avoids the costly `sqrt` that `Distance` performs, and comparing against a squared threshold is sufficient for range checks.", "durationMs": 12994, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "a5772470c6859cdc", "usage": { "source": "provider", "promptTokens": 20327, "completionTokens": 74, "totalTokens": 22332, "reasoningTokens": 139, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:55:39.232Z", "completedAt": "2026-07-10T17:55:52.229Z", "answerBytes": 271, "answerChars": 271, "exitCode": 0 }, { "fixtureId": "gmod.perf.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nfor _, ent in ents.Iterator() do\n -- your logic here\nend\n```\nReason: `ents.Iterator()` is the wiki-recommended, allocation-free iterator for visiting every entity in the engine's internal list.", "durationMs": 11623, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "306d3f1d05f28246", "usage": { "source": "provider", "promptTokens": 21094, "completionTokens": 51, "totalTokens": 22269, "reasoningTokens": 100, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:55:39.649Z", "completedAt": "2026-07-10T17:55:51.274Z", "answerBytes": 203, "answerChars": 203, "exitCode": 0 }, { "fixtureId": "gmod.perf.find-ents-near.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nlocal ents = ents.FindInSphere(ply:GetPos(), 512)\n```\n\nReason: FindInSphere is one of the faster built-in spatial queries because it uses a simple distance check against entity positions with early-out potential, making it efficient for radius-based proximity searches compared to other FindIn* methods.", "durationMs": 12608, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "07c583fc3d9fe09f", "usage": { "source": "provider", "promptTokens": 20355, "completionTokens": 70, "totalTokens": 22369, "reasoningTokens": 152, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:55:40.757Z", "completedAt": "2026-07-10T17:55:53.367Z", "answerBytes": 310, "answerChars": 310, "exitCode": 0 }, { "fixtureId": "gmod.perf.find-players-near.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nlocal function PlayersInSphere(pos, radius)\n local r2 = radius * radius\n local result = {}\n for _, ply in ipairs(player.GetAll()) do\n local diff = ply:GetPos() - pos\n if diff:LengthSqr() <= r2 then\n result[#result + 1] = ply\n end\n end\n return result\nend\n```\n\nReason: `player.GetAll()` iterates only the player list (typically ~64 entries max) with a cheap squared-distance check, avoiding `ents.FindInSphere`'s broad-phase spatial query across thousands of world + NPC + prop entities followed by type filtering.", "durationMs": 11762, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "d139ba2e8ee38a2f", "usage": { "source": "provider", "promptTokens": 21109, "completionTokens": 143, "totalTokens": 22458, "reasoningTokens": 182, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:55:41.223Z", "completedAt": "2026-07-10T17:55:52.987Z", "answerBytes": 566, "answerChars": 566, "exitCode": 0 }, { "fixtureId": "gmod.perf.for-vs-while.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nfor i = 1, n do end\n```\n\nReason: The `for` loop compiles to Lua's `FORLOOP` opcode which keeps the counter in a register and does increment+compare+branch in a single bytecode instruction, whereas `while` requires separate ADD, LT, and JMP instructions on a heap-allocated table value.", "durationMs": 10242, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "b3401a190a8aecf0", "usage": { "source": "provider", "promptTokens": 21099, "completionTokens": 76, "totalTokens": 22360, "reasoningTokens": 161, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:55:41.296Z", "completedAt": "2026-07-10T17:55:51.539Z", "answerBytes": 292, "answerChars": 292, "exitCode": 0 }, { "fixtureId": "gmod.perf.hook-once.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- SLOWER: N hook.Run calls per tick\nfor _, ply in ipairs(player.GetAll()) do\n hook.Run(\"MyHook\", ply)\nend\n\n-- FASTER: 1 hook.Run call per tick\nhook.Run(\"MyHook\", player.GetAll())\n```\n\nReason: `hook.Run` pays string-lookup, argument-pack, and call overhead on every invocation; one call with the player list avoids repeating that overhead N times.", "durationMs": 10716, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "ed1d3e09249fc8bb", "usage": { "source": "provider", "promptTokens": 20346, "completionTokens": 95, "totalTokens": 22369, "reasoningTokens": 136, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:55:41.789Z", "completedAt": "2026-07-10T17:55:52.507Z", "answerBytes": 357, "answerChars": 357, "exitCode": 0 }, { "fixtureId": "gmod.perf.hudpaint-cache.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nhook.Add(\"HUDPaint\", \"DrawHealth\", function()\n local hp = LocalPlayer():Health()\n surface.SetDrawColor(255, 0, 0)\n surface.DrawRect(10, 10, hp, 20)\n draw.SimpleText(hp, \"DermaLarge\", 15, 15, Color(255, 255, 255))\n draw.RoundedBox(6, 10, 40, hp * 0.5, 20, Color(200, 0, 0))\nend)\n```\n\nReason: Caching `LocalPlayer():Health()` in a local variable avoids three repeated method calls and entity lookups, eliminating redundant `GetNet`/replication traffic within the same frame.", "durationMs": 10877, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3def450f3158ceff", "usage": { "source": "provider", "promptTokens": 21109, "completionTokens": 179, "totalTokens": 22366, "reasoningTokens": 54, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:55:42.001Z", "completedAt": "2026-07-10T17:55:52.881Z", "answerBytes": 494, "answerChars": 494, "exitCode": 0 }, { "fixtureId": "gmod.perf.local-color.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal white = Color(255, 255, 255)\n\n-- Inside your paint function:\nsurface.SetDrawColor(white)\nsurface.DrawRect(0, 0, ScrW(), ScrH())\n```\n\nReason: `Color()` allocates a new table every call; caching the color outside the loop avoids per-frame garbage collection pressure.", "durationMs": 10051, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "16a7bed1b931d467", "usage": { "source": "provider", "promptTokens": 20332, "completionTokens": 81, "totalTokens": 22252, "reasoningTokens": 47, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:55:44.268Z", "completedAt": "2026-07-10T17:55:54.321Z", "answerBytes": 278, "answerChars": 278, "exitCode": 0 }, { "fixtureId": "gmod.perf.local-vs-global.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal sin = math.sin\nfor i = 1, n do\n sin(x[i])\nend\n```\n\nReason: Hoisting `math.sin` into a local avoids repeated global table lookups on each iteration.", "durationMs": 9917, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "c116d8c651190647", "usage": { "source": "provider", "promptTokens": 21097, "completionTokens": 51, "totalTokens": 22203, "reasoningTokens": 31, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:55:45.748Z", "completedAt": "2026-07-10T17:55:55.667Z", "answerBytes": 161, "answerChars": 161, "exitCode": 0 }, { "fixtureId": "gmod.perf.localplayer-cache.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nlocal ply\nhook.Add(\"Think\", \"cacheLocalPlayer\", function()\n ply = LocalPlayer()\nend)\n```\nReason: Caches the result in a local variable updated once per frame, so subsequent code reads `ply` (a fast table lookup) instead of calling `LocalPlayer()` repeatedly, which internally performs a full engine call each time.", "durationMs": 13821, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "7398105af47b079e", "usage": { "source": "provider", "promptTokens": 21095, "completionTokens": 78, "totalTokens": 22327, "reasoningTokens": 130, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:55:46.085Z", "completedAt": "2026-07-10T17:55:59.907Z", "answerBytes": 322, "answerChars": 322, "exitCode": 0 }, { "fixtureId": "gmod.perf.looking-at.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nfunction AreLookingAtEachOther(ply1, ply2)\n local aim1 = ply1:GetAimVector()\n local aim2 = ply2:GetAimVector()\n local toOther1 = (ply2:GetPos() - ply1:GetPos()):GetNormalized()\n local toOther2 = (ply1:GetPos() - ply2:GetPos()):GetNormalized()\n return aim1:Dot(toOther1) > 0.5 and aim2:Dot(toOther2) > 0.5\nend\n```\nReason: Uses dot products of aim vectors with direction vectors to each other, avoiding acos and expensive angle calculations.", "durationMs": 19305, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "20b22f678a4b08d7", "usage": { "source": "provider", "promptTokens": 21115, "completionTokens": 141, "totalTokens": 23137, "reasoningTokens": 857, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:55:47.366Z", "completedAt": "2026-07-10T17:56:06.673Z", "answerBytes": 461, "answerChars": 461, "exitCode": 0 }, { "fixtureId": "gmod.perf.meta-vs-arg.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- Preferred: local function + direct call\nlocal function SomeHelper(ply)\n -- your logic\nend\n\nSomeHelper(ply)\n```\n\nReason: `ply:SomeHelper()` desugars to a table index on the entity then a call, whereas a local function call is a single `GETTABL` + `CALL` avoiding the entity lookup overhead.", "durationMs": 22575, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "de332f7356830dfa", "usage": { "source": "provider", "promptTokens": 21106, "completionTokens": 81, "totalTokens": 23160, "reasoningTokens": 949, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:55:47.504Z", "completedAt": "2026-07-10T17:56:10.081Z", "answerBytes": 302, "answerChars": 302, "exitCode": 0 }, { "fixtureId": "gmod.perf.msg-vs-print.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attemptIndex": 1, "status": "incorrect", "detail": "Did not match a fixture answer pattern.", "finalResponse": "```lua\n-- Hot-path debug: MsgC avoids print's format/prefix overhead\nMsgC(Color(255, 255, 0), \"[DBG] \", Color(200, 200, 200), tostring(x), \"\\n\")\n```\nReason: `MsgC` (or `Msg`) skips `print`'s implicit `tostring` + prefix assembly and goes straight to the engine's message buffer.", "durationMs": 18058, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "6cbb4e4b2f19dd24", "usage": { "source": "provider", "promptTokens": 20330, "completionTokens": 100, "totalTokens": 22414, "reasoningTokens": 192, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:55:48.367Z", "completedAt": "2026-07-10T17:56:06.427Z", "answerBytes": 278, "answerChars": 278, "exitCode": 0 }, { "fixtureId": "gmod.perf.pairs-ipairs-for.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal t = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}\nfor i = 1, #t do\n local v = t[i]\nend\n```\n\nReason: Numeric `for` avoids per-iteration function-call overhead (`pairs`/`ipairs` each invoke a C iterator and yield the key+value), uses direct integer indexing into the array part of the table, and keeps the loop body in pure Lua with no iterator state machine — making it the fastest for sequential numeric arrays.", "durationMs": 9828, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "de5e4875fcf3e600", "usage": { "source": "provider", "promptTokens": 20339, "completionTokens": 129, "totalTokens": 22338, "reasoningTokens": 78, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:55:51.275Z", "completedAt": "2026-07-10T17:56:01.105Z", "answerBytes": 413, "answerChars": 411, "exitCode": 0 }, { "fixtureId": "gmod.perf.plain-lua-vs-fn.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- fast-pipeline.lua\n-- A minimal, allocation-free pipeline that beats DarkRP's fn library on hot paths.\n-- Usage:\n-- local result = pipeline(data, filterFn, mapFn, ...)\n\nlocal function pipeline(list, ...)\n local n = select('#', ...)\n local out = list\n for i = 1, n do\n local op = select(i, ...)\n local next = {}\n local len = 0\n for j = 1, #out do\n local v = op(out[j], j)\n if v ~= false and v ~= nil then\n len = len + 1\n next[len] = v\n end\n end\n out = next\n end\n return out\nend\n\n-- Example: filter odds, square them\nlocal nums = {1,2,3,4,5,6,7,8,9,10}\nlocal result = pipeline(nums,\n function(x) return x % 2 == 1 end, -- keep odds\n function(x) return x * x end -- square\n)\n-- result == {1, 9, 25, 49, 81}\n```\n\nReason: Single-pass loops with no closure allocation per step, no intermediate iterator objects, and no table lookups — just raw Lua for-loops which the LuaJIT/GMod server compiler can optimize far better than the generic higher-order wrappers in the fn library.", "durationMs": 10266, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "ead0a98b3ff6a388", "usage": { "source": "provider", "promptTokens": 20352, "completionTokens": 315, "totalTokens": 22487, "reasoningTokens": 28, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:55:51.541Z", "completedAt": "2026-07-10T17:56:01.809Z", "answerBytes": 1049, "answerChars": 1047, "exitCode": 0 }, { "fixtureId": "gmod.perf.player-cache-hooks.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal cachedPlayers = {}\nlocal cachedPlayerCount = 0\n\nhook.Add(\"PlayerInitialSpawn\", \"PlayerCacheJoin\", function(ply)\n table.insert(cachedPlayers, ply)\n cachedPlayerCount = #cachedPlayers\nend)\n\nhook.Add(\"PlayerDisconnected\", \"PlayerCacheLeave\", function(ply)\n for i = #cachedPlayers, 1, -1 do\n if cachedPlayers[i] == ply then\n table.remove(cachedPlayers, i)\n break\n end\n end\n cachedPlayerCount = #cachedPlayers\nend)\n\n-- Use cachedPlayers in your Think hook instead of player.GetAll()\nhook.Add(\"Think\", \"PlayerCacheThink\", function()\n for i = 1, cachedPlayerCount do\n local ply = cachedPlayers[i]\n if IsValid(ply) then\n -- your per-player logic here\n end\n end\nend)\n```\n\nReason: Caching avoids allocating a new table and iterating `player.GetAll()` every tick; the list is rebuilt only on join/leave, keeping the hot loop zero-allocation and bounded by the actual player count.", "durationMs": 10283, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "a834817afe9e6c25", "usage": { "source": "provider", "promptTokens": 20348, "completionTokens": 238, "totalTokens": 22429, "reasoningTokens": 51, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:55:52.232Z", "completedAt": "2026-07-10T17:56:02.521Z", "answerBytes": 971, "answerChars": 971, "exitCode": 0 }, { "fixtureId": "gmod.perf.ply-table-index.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attemptIndex": 1, "status": "incorrect", "detail": "Did not match a fixture answer pattern.", "finalResponse": "```lua\n-- Fast lookup table keyed by Entity index, not ply object\nlocal playerData = {}\n\nfunction SetPlayerData(ply, key, value)\n local idx = ply:EntIndex()\n local bucket = playerData[idx]\n if not bucket then\n bucket = {}\n playerData[idx] = bucket\n end\n bucket[key] = value\nend\n\nfunction GetPlayerData(ply, key)\n local bucket = playerData[ply:EntIndex()]\n return bucket and bucket[key]\nend\n```\n\nReason: Indexing a plain Lua table by integer entity index avoids metatable lookups and the overhead of accessing entity Lua fields (which go through the Entity metatable), yielding a single hash lookup per access instead of the property-surface indirection that `ply.someField` incurs.", "durationMs": 15225, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f18cc80df8999147", "usage": { "source": "provider", "promptTokens": 21103, "completionTokens": 172, "totalTokens": 22338, "reasoningTokens": 39, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:55:52.509Z", "completedAt": "2026-07-10T17:56:07.736Z", "answerBytes": 694, "answerChars": 694, "exitCode": 0 }, { "fixtureId": "gmod.perf.seq-tables.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 0 through 1 candidate loops.", "finalResponse": "```lua\n-- Faster: sequential number-indexed array\nlocal fruits = { \"apple\", \"banana\", \"cherry\" }\nfor i = 1, #fruits do\n print(i, fruits[i])\nend\n\n-- Slower: string-keyed map\nlocal fruits = { apple = true, banana = true, cherry = true }\nfor k, v in pairs(fruits) do\n print(k, v)\nend\n```\n\nReason: Sequential arrays (`{ [1]=x, [2]=y }`) are stored as flat contiguous memory in LuaJIT, enabling O(1) index access and cache-friendly traversal; string-keyed maps require hash table lookups with collision handling, and the JIT compiler can emit more efficient machine code for `#`-bounded array loops than for `pairs()` hash iteration.", "durationMs": 12392, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "4778b0220c3f91a3", "usage": { "source": "provider", "promptTokens": 21108, "completionTokens": 175, "totalTokens": 22525, "reasoningTokens": 218, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:55:52.882Z", "completedAt": "2026-07-10T17:56:05.277Z", "answerBytes": 630, "answerChars": 630, "exitCode": 0 }, { "fixtureId": "gmod.perf.setdrawcolor-split.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nsurface.SetDrawColor(r, g, b, a)\n```\nReason: Passing separate r, g, b, a integers avoids allocating a Color table and the internal unpack/type-check overhead, reducing GC pressure and function-call cost in hot draw loops.", "durationMs": 10808, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "d110fde8a37bbe59", "usage": { "source": "provider", "promptTokens": 20340, "completionTokens": 57, "totalTokens": 22377, "reasoningTokens": 188, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:55:52.989Z", "completedAt": "2026-07-10T17:56:03.799Z", "answerBytes": 228, "answerChars": 228, "exitCode": 0 }, { "fixtureId": "gmod.perf.sqlite-vs-mysql.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal result = sql.Query(\"SELECT steamid, name FROM players WHERE steamid = '\" .. sql.SQLStr(steamid) .. \"'\")\nif result then\n print(\"Player: \" .. result[1][\"name\"])\nend\n```\nReason: SQLite is embedded in-process with zero network latency, while remote MySQL adds TCP round-trip overhead on every query.", "durationMs": 11320, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "4a3f5d2a20d71ac9", "usage": { "source": "provider", "promptTokens": 20356, "completionTokens": 81, "totalTokens": 22396, "reasoningTokens": 167, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:55:53.369Z", "completedAt": "2026-07-10T17:56:04.691Z", "answerBytes": 311, "answerChars": 311, "exitCode": 0 }, { "fixtureId": "gmod.perf.steamid-cache.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal cache = setmetatable({}, { __mode = \"k\" })\n\nlocal function CachedSteamID(ply)\n local sid = cache[ply]\n if sid then return sid end\n sid = ply:SteamID()\n cache[ply] = sid\n return sid\nend\n```\n\nReason: Weak-key table lets GC reclaim entries for disconnected players; lookup is O(1) and avoids repeated SteamID() overhead on the hot path.", "durationMs": 8338, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "e8a94aa454154982", "usage": { "source": "provider", "promptTokens": 21103, "completionTokens": 99, "totalTokens": 22256, "reasoningTokens": 30, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:55:54.325Z", "completedAt": "2026-07-10T17:56:02.669Z", "answerBytes": 351, "answerChars": 351, "exitCode": 0 }, { "fixtureId": "gmod.perf.string-table-concat.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 0 through 0 candidate loops.", "finalResponse": "```lua\n-- Slow: O(n²) — each .. copies every prior character into a new string\nlocal function slowConcat(parts)\n local s = \"\"\n for i = 1, #parts do\n s = s .. parts[i]\n end\n return s\nend\n\n-- Fast: O(n) — table.concat allocates once and copies characters once\nlocal function fastConcat(parts)\n local t = {}\n for i = 1, #parts do\n t[i] = parts[i]\n end\n return table.concat(t)\nend\n```\n\nReason: `table.concat` copies all characters in a single pass (O(n)), while `..` creates a new string and copies all prior characters on every concatenation (O(n²)).", "durationMs": 10004, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "b0cf9e04ae7c5dd9", "usage": { "source": "provider", "promptTokens": 20333, "completionTokens": 163, "totalTokens": 22315, "reasoningTokens": 27, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:55:55.670Z", "completedAt": "2026-07-10T17:56:05.676Z", "answerBytes": 591, "answerChars": 585, "exitCode": 0 }, { "fixtureId": "gmod.perf.surface-drawrect.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nsurface.SetDrawColor(r, g, b, a)\nsurface.DrawRect(x, y, w, h)\n```\n\nReason: `draw.RoundedBox` incurs function-call and parameter-parsing overhead even with radius 0; `surface.DrawRect` is the thin built-in wrapper that draws a filled rect with no rounding logic.", "durationMs": 8311, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "696e8de769d9ad0e", "usage": { "source": "provider", "promptTokens": 20337, "completionTokens": 75, "totalTokens": 22299, "reasoningTokens": 95, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:55:55.923Z", "completedAt": "2026-07-10T17:56:04.266Z", "answerBytes": 268, "answerChars": 268, "exitCode": 0 }, { "fixtureId": "gmod.perf.surface-text.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- In your Paint hook, cache the font outside the hook:\nlocal cachedFont = \"DermaDefault\"\n\nfunction PANEL:Paint(w, h)\n surface.SetFont(cachedFont)\n surface.SetTextPos(10, 10)\n surface.DrawText(\"Hello World\")\nend\n```\n\nReason: `surface.SetFont` + `surface.SetTextPos` + `surface.DrawText` avoids the per-frame overhead of `draw.DrawText` (which recomputes alignment) and `draw.SimpleTextOutlined` (which draws the string multiple times for the outline); caching the font string and calling `SetFont` once per frame rather than per draw call is the key win.", "durationMs": 13957, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "95d9fe4918ee4197", "usage": { "source": "provider", "promptTokens": 21102, "completionTokens": 146, "totalTokens": 22588, "reasoningTokens": 316, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:55:59.380Z", "completedAt": "2026-07-10T17:56:13.339Z", "answerBytes": 570, "answerChars": 570, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-count-hash.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal length = #myTable\n```\n\nReason: The `#` operator is the standard Lua length operator for sequential tables.", "durationMs": 10616, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3e9bbfc8452e05e3", "usage": { "source": "provider", "promptTokens": 21093, "completionTokens": 32, "totalTokens": 22385, "reasoningTokens": 236, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:55:59.909Z", "completedAt": "2026-07-10T17:56:10.526Z", "answerBytes": 119, "answerChars": 119, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-empty.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 0 through 0 candidate loops.", "finalResponse": "```lua\nlocal t = {}\nfor i = 1, 1e6 do t[i] = i end\n\n-- Faster for sequential tables (no shared references):\nt = {}\n\n-- Slower — must iterate all keys:\ntable.Empty(t)\n```\n\nReason: `table.Empty(t)` is O(n) — it iterates every key and sets it to nil — while `t = {}` is O(1) — a single empty-table allocation.", "durationMs": 14159, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3a6344977f5bd475", "usage": { "source": "provider", "promptTokens": 21098, "completionTokens": 97, "totalTokens": 22503, "reasoningTokens": 284, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:56:01.107Z", "completedAt": "2026-07-10T17:56:15.268Z", "answerBytes": 314, "answerChars": 306, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-hasvalue.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 0 through 0 candidate loops.", "finalResponse": "```lua\n-- Build a lookup set once\nlocal set = {}\nfor _, v in ipairs(list) do\n set[v] = true\nend\n\n-- O(1) membership test instead of O(n) table.HasValue\nif set[value] then\n -- exists\nend\n```\n\nReason: `table.HasValue` is O(n); building a hash set once gives O(1) lookups, faster for repeated checks.", "durationMs": 9326, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "7d064428a873fdfc", "usage": { "source": "provider", "promptTokens": 20331, "completionTokens": 92, "totalTokens": 22271, "reasoningTokens": 56, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:56:01.810Z", "completedAt": "2026-07-10T17:56:11.139Z", "answerBytes": 299, "answerChars": 299, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-literal.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- FASTER: fields inside the constructor\nlocal pos = { x = 0, y = 1, z = 2 }\n\n-- SLOWER: fields assigned after\nlocal pos = {}\npos.x = 0\npos.y = 1\npos.z = 2\n```\n\nReason: The table constructor compiles to a single optimized VM instruction that populates the hash part during allocation, while post-construction assignment emits separate SETTABLE instructions each performing its own key hash and chain walk.", "durationMs": 15536, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f95a8fc610d720ad", "usage": { "source": "provider", "promptTokens": 20333, "completionTokens": 108, "totalTokens": 22390, "reasoningTokens": 157, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:56:02.523Z", "completedAt": "2026-07-10T17:56:18.061Z", "answerBytes": 412, "answerChars": 412, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-random.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal el = t[math.random(#t)]\n```\n\nReason: Direct index via `math.random` skips `table.Random`'s sequential-check and `pairs` iteration overhead.", "durationMs": 9472, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f3e090701953d4a9", "usage": { "source": "provider", "promptTokens": 20329, "completionTokens": 43, "totalTokens": 22325, "reasoningTokens": 161, "cachedTokens": 1792, "cost": 0 }, "startedAt": "2026-07-10T17:56:02.671Z", "completedAt": "2026-07-10T17:56:12.146Z", "answerBytes": 152, "answerChars": 152, "exitCode": 0 }, { "fixtureId": "gmod.perf.x-times-x.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal x2 = x * x\n```\n\nReason: Multiplication is the fastest primitive CPU operation; it avoids the overhead of `math.pow` (function-call dispatch, generic number coercion) and any table lookups.", "durationMs": 8135, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "79d48008f6b5174f", "usage": { "source": "provider", "promptTokens": 21094, "completionTokens": 51, "totalTokens": 22222, "reasoningTokens": 53, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:56:03.802Z", "completedAt": "2026-07-10T17:56:11.939Z", "answerBytes": 201, "answerChars": 201, "exitCode": 0 }, { "fixtureId": "gmod.player-iterator.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attemptIndex": 1, "status": "pass", "detail": "Uses player.Iterator() (wiki-recommended Lua-cached iterator).", "finalResponse": "```lua\nfor _, ply in player.Iterator() do\n -- your logic here\nend\n```\n\nReason: `player.Iterator()` is the modern, allocation-free way to iterate all connected players in Garry's Mod.", "durationMs": 7486, "version": "1.15.9", "fixtureVersion": 2, "rubricVersion": "4", "promptHash": "fe3d7469535a0ca2", "usage": { "source": "provider", "promptTokens": 21106, "completionTokens": 49, "totalTokens": 22195, "reasoningTokens": 16, "cachedTokens": 1024, "cost": 0 }, "startedAt": "2026-07-10T17:56:04.277Z", "completedAt": "2026-07-10T17:56:11.799Z", "answerBytes": 185, "answerChars": 185, "exitCode": 0 }, { "fixtureId": "gmod.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nfor _, ent in ents.Iterator() do\n if ent:GetClass() == \"prop_physics\" then\n -- process ent\n end\nend\n```\n\nReason: `ents.Iterator()` returns a stateless iterator that yields entities one at a time without allocating a table of all entities first.", "durationMs": 70357, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "3990c92253db85bb", "usage": { "source": "provider", "promptTokens": 22742, "completionTokens": 49, "totalTokens": 22945, "reasoningTokens": 154, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:04.693Z", "completedAt": "2026-07-10T17:57:15.052Z", "answerBytes": 264, "answerChars": 264, "exitCode": 0 }, { "fixtureId": "gmod.hook-add.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attemptIndex": 1, "status": "pass", "detail": "Registers a named hook with hook.Add.", "finalResponse": "```lua\nhook.Add(\"Think\", \"MyAddon.Think\", function()\n -- Your think logic here\nend)\n```\n\nReason: In Garry's Mod, `hook.Add(eventName, identifier, callback)` registers a callback for the specified hook event. The Think hook runs every frame, making it suitable for per-frame logic. The identifier \"MyAddon.Think\" uniquely names this hook registration for potential removal with `hook.Remove`.", "durationMs": 58824, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "12d2222fdb7d6b90", "usage": { "source": "provider", "promptTokens": 22743, "completionTokens": 87, "totalTokens": 22923, "reasoningTokens": 93, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:05.278Z", "completedAt": "2026-07-10T17:57:04.104Z", "answerBytes": 394, "answerChars": 394, "exitCode": 0 }, { "fixtureId": "gmod.isvalid.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attemptIndex": 1, "status": "pass", "detail": "Uses IsValid for entity/object validity.", "finalResponse": "```lua\nif not IsValid(ent) then return end\n```\n\nReason: `IsValid(ent)` returns false for NULL entities, removed entities, and nil, making it the standard guard before calling any entity methods.", "durationMs": 7977, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "35527312e59dfc13", "usage": { "source": "provider", "promptTokens": 22736, "completionTokens": 50, "totalTokens": 22917, "reasoningTokens": 131, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:05.678Z", "completedAt": "2026-07-10T17:56:13.657Z", "answerBytes": 194, "answerChars": 194, "exitCode": 0 }, { "fixtureId": "gmod.net-receivers.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nnet.Receive(\"MyAddon.Sync\", function(len, ply)\n -- Handle the incoming net message here\n local data = net.ReadTable() -- or whatever data types you expect\n print(\"Received MyAddon.Sync from \" .. tostring(ply))\nend)\n```\n\nReason: In Garry's Mod, `net.Receive` registers a handler for a named net message. The callback receives the message length and the sending player (server-side) or nil (client-side).", "durationMs": 5427, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "24d54ee8366753a6", "usage": { "source": "provider", "promptTokens": 22735, "completionTokens": 97, "totalTokens": 22885, "reasoningTokens": 53, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:06.431Z", "completedAt": "2026-07-10T17:56:11.860Z", "answerBytes": 418, "answerChars": 418, "exitCode": 0 }, { "fixtureId": "gmod.perf.angle-zero.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attemptIndex": 1, "status": "incorrect", "detail": "Did not match a fixture answer pattern.", "finalResponse": "```lua\nlocal zeroAng = Angle(0, 0, 0)\n\n-- In hot path:\nzeroAng.p = 0\nzeroAng.y = 0\nzeroAng.r = 0\n-- use zeroAng\n```\n\nReason: Reusing a single Angle instance avoids allocation and GC pressure in the hot path. Setting fields directly is faster than `Angle(0,0,0)` which constructs a new object each call.", "durationMs": 13292, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f6bc97bf98280d62", "usage": { "source": "provider", "promptTokens": 22745, "completionTokens": 96, "totalTokens": 23055, "reasoningTokens": 214, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:06.675Z", "completedAt": "2026-07-10T17:56:19.969Z", "answerBytes": 302, "answerChars": 302, "exitCode": 0 }, { "fixtureId": "gmod.perf.config-var.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- Flat local variable (preferred)\nlocal config_color = Color(255, 0, 0)\n\n-- Read\nlocal c = config_color\n```\n\nReason: Local variables are resolved at compile-time with direct register access (OP_GETLOCAL), while nested table access requires multiple runtime hash lookups (OP_GETTABLE per level). For hot paths, locals avoid table traversal entirely.", "durationMs": 5408, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "bcc4ff8eb162b699", "usage": { "source": "provider", "promptTokens": 22755, "completionTokens": 67, "totalTokens": 22886, "reasoningTokens": 64, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:07.737Z", "completedAt": "2026-07-10T17:56:13.147Z", "answerBytes": 356, "answerChars": 356, "exitCode": 0 }, { "fixtureId": "gmod.perf.darkrpvar.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- Preferred: DarkRP var system\nlocal jobName = ply:getDarkRPVar(\"job\")\n\n-- Or for full job table (name, color, salary, etc.)\nlocal jobTable = ply:getJobTable()\nlocal jobName = jobTable.name\n```\n\nReason: `getDarkRPVar(\"job\")` uses DarkRP's optimized variable system with proper caching and change hooks, while `GetNWString` is generic networking with no DarkRP integration.", "durationMs": 8344, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "02a37daa699cded3", "usage": { "source": "provider", "promptTokens": 22752, "completionTokens": 98, "totalTokens": 22951, "reasoningTokens": 101, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:10.082Z", "completedAt": "2026-07-10T17:56:18.428Z", "answerBytes": 380, "answerChars": 380, "exitCode": 0 }, { "fixtureId": "gmod.perf.disttosqr.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nif vector1:DistToSqr(vector2) < threshold * threshold then\n -- vectors are within threshold distance\nend\n```\n\nReason: `DistToSqr` avoids the expensive square root operation by comparing squared distances directly, which is the standard optimization for threshold checks in GMod Lua.", "durationMs": 6290, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "a5772470c6859cdc", "usage": { "source": "provider", "promptTokens": 22743, "completionTokens": 41, "totalTokens": 22895, "reasoningTokens": 111, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:10.528Z", "completedAt": "2026-07-10T17:56:16.819Z", "answerBytes": 292, "answerChars": 292, "exitCode": 0 }, { "fixtureId": "gmod.perf.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nfor _, ent in ipairs(ents.GetAll()) do\n -- Process each entity\n print(ent:GetClass())\nend\n```\n\nReason: `ents.GetAll()` is the wiki-recommended method for iterating all entities in Garry's Mod; it returns a sequential table allowing efficient `ipairs` iteration without creating intermediate tables.", "durationMs": 7923, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "306d3f1d05f28246", "usage": { "source": "provider", "promptTokens": 22725, "completionTokens": 54, "totalTokens": 22904, "reasoningTokens": 125, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:11.141Z", "completedAt": "2026-07-10T17:56:19.067Z", "answerBytes": 311, "answerChars": 311, "exitCode": 0 }, { "fixtureId": "gmod.perf.find-ents-near.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nlocal ents = ents.FindInSphere(ply:GetPos(), 500)\n```\n\nReason: FindInSphere uses the engine's spatial partitioning (Octree/BSP) for O(log n) radius queries, making it significantly faster than FindInPVS for proximity checks around a player.", "durationMs": 6146, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "07c583fc3d9fe09f", "usage": { "source": "provider", "promptTokens": 22763, "completionTokens": 59, "totalTokens": 22972, "reasoningTokens": 150, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:11.802Z", "completedAt": "2026-07-10T17:56:17.954Z", "answerBytes": 247, "answerChars": 247, "exitCode": 0 }, { "fixtureId": "gmod.perf.find-players-near.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal function FindPlayersInSphere(pos, radius)\n local radiusSqr = radius * radius\n local players = {}\n for _, ply in ipairs(player.GetAll()) do\n if ply:GetPos():DistToSqr(pos) <= radiusSqr then\n players[#players + 1] = ply\n end\n end\n return players\nend\n```\n\nReason: `player.GetAll()` iterates only players (typically ≤128) vs `ents.FindInSphere` which checks all entities (often thousands), and `DistToSqr` avoids the expensive square root.", "durationMs": 7129, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "d139ba2e8ee38a2f", "usage": { "source": "provider", "promptTokens": 22756, "completionTokens": 116, "totalTokens": 23013, "reasoningTokens": 141, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:11.862Z", "completedAt": "2026-07-10T17:56:18.995Z", "answerBytes": 490, "answerChars": 488, "exitCode": 0 }, { "fixtureId": "gmod.perf.for-vs-while.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nfor i = 1, n do\n -- body\nend\n```\n\nReason: In LuaJIT (used by Garry's Mod), numeric `for` loops are heavily optimized — the loop variable stays in a register, bounds are checked once, and the JIT compiles them to tight machine code. `while` loops with manual increments generate more bytecode and inhibit trace compilation.", "durationMs": 27004, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "b3401a190a8aecf0", "usage": { "source": "provider", "promptTokens": 22747, "completionTokens": 72, "totalTokens": 22959, "reasoningTokens": 140, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:11.941Z", "completedAt": "2026-07-10T17:56:38.946Z", "answerBytes": 334, "answerChars": 332, "exitCode": 0 }, { "fixtureId": "gmod.perf.hook-once.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 0 through 1 candidate loops.", "finalResponse": "```lua\n-- Slower: hook.Run per player (N calls)\nfor _, ply in ipairs(player.GetAll()) do\n hook.Run(\"CustomTick\", ply)\nend\n\n-- Faster: single hook.Run with all players (1 call)\nlocal players = player.GetAll()\nhook.Run(\"CustomTick\", players)\n\n-- In your hook receiver:\nhook.Add(\"CustomTick\", \"MyTickHandler\", function(players)\n for _, ply in ipairs(players) do\n -- per-player logic here\n end\nend)\n```\n\nReason: hook.Run has overhead iterating registered hooks; one call with a table avoids N-1 redundant iterations.", "durationMs": 6914, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "ed1d3e09249fc8bb", "usage": { "source": "provider", "promptTokens": 22756, "completionTokens": 103, "totalTokens": 23031, "reasoningTokens": 172, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:12.148Z", "completedAt": "2026-07-10T17:56:19.066Z", "answerBytes": 528, "answerChars": 528, "exitCode": 0 }, { "fixtureId": "gmod.perf.hudpaint-cache.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nhook.Add(\"HUDPaint\", \"DrawHealth\", function()\n local ply = LocalPlayer()\n if not IsValid(ply) then return end\n local hp = ply:Health()\n \n draw.SimpleText(\"HP: \" .. hp, \"Trebuchet24\", 10, 10, Color(255, 255, 255))\n draw.RoundedBox(0, 10, 40, hp * 2, 20, Color(255, 0, 0))\n draw.SimpleText(hp .. \" / \" .. ply:GetMaxHealth(), \"Trebuchet18\", 10, 65, Color(200, 200, 200))\nend)\n```\n\nReason: Caching `LocalPlayer():Health()` in a local variable avoids three redundant C++ method calls and object lookups per frame.", "durationMs": 6623, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3def450f3158ceff", "usage": { "source": "provider", "promptTokens": 22753, "completionTokens": 191, "totalTokens": 23043, "reasoningTokens": 99, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:13.158Z", "completedAt": "2026-07-10T17:56:19.814Z", "answerBytes": 536, "answerChars": 536, "exitCode": 0 }, { "fixtureId": "gmod.perf.local-color.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal white = Color(255, 255, 255)\n\nhook.Add(\"HUDPaint\", \"Example\", function()\n surface.SetDrawColor(white)\n -- draw calls\nend)\n```\n\nReason: Creating a new Color object every frame allocates memory and triggers garbage collection. Caching it once outside the hook avoids repeated allocation.", "durationMs": 5992, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "16a7bed1b931d467", "usage": { "source": "provider", "promptTokens": 22743, "completionTokens": 78, "totalTokens": 22892, "reasoningTokens": 71, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:13.340Z", "completedAt": "2026-07-10T17:56:19.339Z", "answerBytes": 304, "answerChars": 304, "exitCode": 0 }, { "fixtureId": "gmod.perf.local-vs-global.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal sin = math.sin\nfor i = 1, 1000000 do\n local v = sin(i)\nend\n```\n\nReason: Caching `math.sin` in a local variable avoids repeated global table lookups (`math` → `sin`) on each iteration, which is significantly faster in Lua's VM.", "durationMs": 7469, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "c116d8c651190647", "usage": { "source": "provider", "promptTokens": 22748, "completionTokens": 63, "totalTokens": 22882, "reasoningTokens": 71, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:13.660Z", "completedAt": "2026-07-10T17:56:21.131Z", "answerBytes": 244, "answerChars": 242, "exitCode": 0 }, { "fixtureId": "gmod.perf.localplayer-cache.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal lp = LocalPlayer()\n\nhook.Add(\"Think\", \"CacheLocalPlayer\", function()\n lp = LocalPlayer()\nend)\n\n-- Usage: use `lp` instead of `LocalPlayer()`\n```\n\nReason: Caching LocalPlayer() in a variable and updating it via Think hook avoids the expensive C++ lookup on every call while staying valid after player spawns or map changes.", "durationMs": 6122, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "7398105af47b079e", "usage": { "source": "provider", "promptTokens": 22743, "completionTokens": 68, "totalTokens": 22903, "reasoningTokens": 92, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:15.270Z", "completedAt": "2026-07-10T17:56:21.393Z", "answerBytes": 338, "answerChars": 338, "exitCode": 0 }, { "fixtureId": "gmod.perf.looking-at.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nfunction PlayersLookingAtEachOther(ply1, ply2)\n if not IsValid(ply1) or not IsValid(ply2) then return false end\n local aim1 = ply1:GetAimVector()\n local aim2 = ply2:GetAimVector()\n -- Dot product near -1 means facing each other\n return aim1:Dot(aim2) < -0.5\nend\n```\n\nReason: Dot product of aim vectors is cheaper than angle calculations; negative dot product indicates opposing directions, and threshold -0.5 (~120°) gives a generous \"roughly looking at\" cone.", "durationMs": 6826, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "20b22f678a4b08d7", "usage": { "source": "provider", "promptTokens": 22764, "completionTokens": 123, "totalTokens": 23037, "reasoningTokens": 150, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:16.821Z", "completedAt": "2026-07-10T17:56:23.649Z", "answerBytes": 483, "answerChars": 482, "exitCode": 0 }, { "fixtureId": "gmod.perf.meta-vs-arg.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal function SomeHelper(ply)\n -- implementation\nend\n\n-- Preferred call style\nSomeHelper(ply)\n```\n\nReason: Direct function calls avoid the table lookup (`ply.SomeHelper`) that method syntax (`ply:SomeHelper()`) requires, giving a negligible but measurable edge in tight loops.", "durationMs": 7067, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "de332f7356830dfa", "usage": { "source": "provider", "promptTokens": 22751, "completionTokens": 30, "totalTokens": 23077, "reasoningTokens": 296, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:17.955Z", "completedAt": "2026-07-10T17:56:25.024Z", "answerBytes": 287, "answerChars": 287, "exitCode": 0 }, { "fixtureId": "gmod.perf.msg-vs-print.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nMsg(\"debug: value = \" .. tostring(value) .. \"\\n\")\n```\n\nReason: `Msg` writes directly to the console without the overhead of `print`'s argument formatting, timestamping, and `tostring` coercion on each arg. In a hot path, avoid string concatenation entirely by logging less frequently or buffering.", "durationMs": 5988, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "6cbb4e4b2f19dd24", "usage": { "source": "provider", "promptTokens": 22743, "completionTokens": 59, "totalTokens": 22928, "reasoningTokens": 126, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:18.062Z", "completedAt": "2026-07-10T17:56:24.052Z", "answerBytes": 304, "answerChars": 304, "exitCode": 0 }, { "fixtureId": "gmod.perf.pairs-ipairs-for.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal tbl = {1, 2, 3, 4, 5} -- large sequential array-like table\n\n-- Fastest: numeric for loop\nfor i = 1, #tbl do\n local v = tbl[i]\n -- process v\nend\n```\n\nReason: In LuaJIT (used by Garry's Mod), numeric `for i = 1, #tbl do` compiles to highly optimized machine code with direct indexed access, zero iterator overhead, and predictable memory access patterns. `ipairs` adds a function call per iteration; `pairs` traverses the hash table.", "durationMs": 7671, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "de5e4875fcf3e600", "usage": { "source": "provider", "promptTokens": 22755, "completionTokens": 100, "totalTokens": 23061, "reasoningTokens": 206, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:18.430Z", "completedAt": "2026-07-10T17:56:26.103Z", "answerBytes": 450, "answerChars": 450, "exitCode": 0 }, { "fixtureId": "gmod.perf.plain-lua-vs-fn.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal function filter(tbl, pred)\n local out = {}\n local j = 1\n for i = 1, #tbl do\n local v = tbl[i]\n if pred(v) then\n out[j] = v\n j = j + 1\n end\n end\n return out\nend\n\nlocal function map(tbl, fn)\n local out = {}\n for i = 1, #tbl do\n out[i] = fn(tbl[i])\n end\n return out\nend\n\n-- Usage: chained, zero-allocation intermediate\nlocal players = { {name=\"a\", alive=true}, {name=\"b\", alive=false}, {name=\"c\", alive=true} }\nlocal aliveNames = map(filter(players, function(p) return p.alive end), function(p) return p.name end)\n```\n\nReason: Plain loops with preallocated tables avoid fn's closure overhead, per-iteration table allocations, and iterator protocol costs.", "durationMs": 25486, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "ead0a98b3ff6a388", "usage": { "source": "provider", "promptTokens": 22760, "completionTokens": 199, "totalTokens": 23045, "reasoningTokens": 86, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:18.997Z", "completedAt": "2026-07-10T17:56:44.485Z", "answerBytes": 741, "answerChars": 741, "exitCode": 0 }, { "fixtureId": "gmod.perf.player-cache-hooks.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal cachedPlayers = {}\nlocal cacheVersion = 0\n\nlocal function rebuildCache()\n cachedPlayers = player.GetAll()\n cacheVersion = cacheVersion + 1\nend\n\nhook.Add(\"PlayerInitialSpawn\", \"PlayerCache_Rebuild\", rebuildCache)\nhook.Add(\"PlayerDisconnected\", \"PlayerCache_Rebuild\", rebuildCache)\n\nhook.Add(\"Think\", \"PlayerCache_Usage\", function()\n local currentVersion = cacheVersion\n local players = cachedPlayers\n\n -- Use players here; it only rebuilds when someone joins/leaves\n for i = 1, #players do\n local ply = players[i]\n -- per-player logic\n end\nend)\n```\nReason: Caches `player.GetAll()` in a table and increments a version counter only on join/leave hooks, so the Think hook reads a stable reference without per-tick allocation.", "durationMs": 9234, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "a834817afe9e6c25", "usage": { "source": "provider", "promptTokens": 22727, "completionTokens": 183, "totalTokens": 23001, "reasoningTokens": 91, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:19.074Z", "completedAt": "2026-07-10T17:56:28.315Z", "answerBytes": 770, "answerChars": 770, "exitCode": 0 }, { "fixtureId": "gmod.perf.ply-table-index.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attemptIndex": 1, "status": "incorrect", "detail": "Did not match a fixture answer pattern.", "finalResponse": "```lua\nlocal playerData = {}\n\nfunction GetPlayerData(ply)\n local id = ply:SteamID64()\n return playerData[id]\nend\n\nfunction SetPlayerData(ply, key, value)\n local id = ply:SteamID64()\n playerData[id] = playerData[id] or {}\n playerData[id][key] = value\nend\n```\n\nReason: Direct table lookup by SteamID64 avoids the player entity metatable overhead on every read, and keeps data isolated from the entity's native fields.", "durationMs": 6346, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f18cc80df8999147", "usage": { "source": "provider", "promptTokens": 22742, "completionTokens": 97, "totalTokens": 22971, "reasoningTokens": 132, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:19.074Z", "completedAt": "2026-07-10T17:56:25.422Z", "answerBytes": 430, "answerChars": 430, "exitCode": 0 }, { "fixtureId": "gmod.perf.seq-tables.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 0 through 1 candidate loops.", "finalResponse": "```lua\n-- Sequential array (fast iteration)\nlocal colors = {\"red\", \"green\", \"blue\"}\nfor i = 1, #colors do\n print(colors[i])\nend\n\n-- String-keyed map (slow iteration)\nlocal colors_map = {r = \"red\", g = \"green\", b = \"blue\"}\nfor k, v in pairs(colors_map) do\n print(v)\nend\n```\n\nReason: Sequential arrays use contiguous memory layout with O(1) length access and optimized `ipairs`/numeric loops, while string-keyed maps require hash table lookups and `pairs` iteration overhead.", "durationMs": 6400, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "4778b0220c3f91a3", "usage": { "source": "provider", "promptTokens": 22753, "completionTokens": 100, "totalTokens": 23043, "reasoningTokens": 190, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:19.340Z", "completedAt": "2026-07-10T17:56:25.742Z", "answerBytes": 479, "answerChars": 479, "exitCode": 0 }, { "fixtureId": "gmod.perf.setdrawcolor-split.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nsurface.SetDrawColor(255, 0, 0, 255)\n```\n\nReason: Passing separate r,g,b,a numbers avoids allocating a Color table each frame, reducing GC pressure and allowing LuaJIT to optimize the call as a direct C function invocation with primitive arguments.", "durationMs": 7533, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "d110fde8a37bbe59", "usage": { "source": "provider", "promptTokens": 22752, "completionTokens": 66, "totalTokens": 23038, "reasoningTokens": 220, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:19.818Z", "completedAt": "2026-07-10T17:56:27.358Z", "answerBytes": 255, "answerChars": 255, "exitCode": 0 }, { "fixtureId": "gmod.perf.sqlite-vs-mysql.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal result = sql.Query(\"SELECT * FROM player_data WHERE steamid = \" .. sql.SQLStr(steamid))\n```\n\nReason: Local SQLite runs in-process with zero network round-trips, no connection pooling overhead, and no authentication latency — critical for per-tick or per-player-action queries on a single server.", "durationMs": 7760, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "4a3f5d2a20d71ac9", "usage": { "source": "provider", "promptTokens": 22773, "completionTokens": 45, "totalTokens": 22993, "reasoningTokens": 175, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:19.973Z", "completedAt": "2026-07-10T17:56:27.748Z", "answerBytes": 310, "answerChars": 308, "exitCode": 0 }, { "fixtureId": "gmod.perf.steamid-cache.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal steamIDCache = setmetatable({}, { __mode = \"k\" })\n\nlocal function GetSteamID(ply)\n if not IsValid(ply) then return \"\" end\n local cached = steamIDCache[ply]\n if cached then return cached end\n local sid = ply:SteamID()\n steamIDCache[ply] = sid\n return sid\nend\n```\n\nReason: Weak-keyed table automatically cleans up when players disconnect, avoiding memory leaks while providing O(1) lookup after first call.", "durationMs": 5592, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "e8a94aa454154982", "usage": { "source": "provider", "promptTokens": 22743, "completionTokens": 107, "totalTokens": 22920, "reasoningTokens": 70, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:21.135Z", "completedAt": "2026-07-10T17:56:26.731Z", "answerBytes": 435, "answerChars": 435, "exitCode": 0 }, { "fixtureId": "gmod.perf.string-table-concat.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 0 through 0 candidate loops.", "finalResponse": "```lua\nlocal pieces = {}\nfor i = 1, 10000 do\n pieces[i] = \"piece \" .. i\nend\nlocal result = table.concat(pieces)\n```\n\nReason: `table.concat` is O(n) while repeated `..` is O(n²) due to string immutability creating new allocations each iteration.", "durationMs": 7302, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "b0cf9e04ae7c5dd9", "usage": { "source": "provider", "promptTokens": 22743, "completionTokens": 48, "totalTokens": 22937, "reasoningTokens": 146, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:21.395Z", "completedAt": "2026-07-10T17:56:28.700Z", "answerBytes": 248, "answerChars": 247, "exitCode": 0 }, { "fixtureId": "gmod.perf.surface-drawrect.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nsurface.DrawRect(x, y, w, h)\n```\n\nReason: `surface.DrawRect` is the direct low-level call for axis-aligned rectangles, avoiding the `draw.RoundedBox` wrapper overhead (radius check, color handling, and extra function call).", "durationMs": 7816, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "696e8de769d9ad0e", "usage": { "source": "provider", "promptTokens": 22757, "completionTokens": 56, "totalTokens": 22964, "reasoningTokens": 151, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:23.650Z", "completedAt": "2026-07-10T17:56:31.468Z", "answerBytes": 230, "answerChars": 230, "exitCode": 0 }, { "fixtureId": "gmod.perf.surface-text.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal font = \"DermaDefault\"\nlocal str = \"Hello, world!\"\nlocal col = Color(255, 255, 255)\n\nhook.Add(\"HUDPaint\", \"FastText\", function()\n surface.SetFont(font)\n surface.SetTextColor(col.r, col.g, col.b, col.a)\n surface.SetTextPos(100, 100)\n surface.DrawText(str)\nend)\n```\n\nReason: `surface.DrawText` avoids the markup parsing, alignment logic, and internal font lookups that `draw.DrawText`/`draw.SimpleTextOutlined` perform each call, making it the lowest-overhead path for static single-line strings.", "durationMs": 6477, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "95d9fe4918ee4197", "usage": { "source": "provider", "promptTokens": 22747, "completionTokens": 126, "totalTokens": 23063, "reasoningTokens": 190, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:24.053Z", "completedAt": "2026-07-10T17:56:30.532Z", "answerBytes": 520, "answerChars": 520, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-count-hash.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal length = #myTable\n```\n\nReason: The `#` operator is Lua's built-in length operator for sequential tables (arrays), returning the last integer index with a non-nil value.", "durationMs": 5729, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3e9bbfc8452e05e3", "usage": { "source": "provider", "promptTokens": 22741, "completionTokens": 30, "totalTokens": 22884, "reasoningTokens": 113, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:25.025Z", "completedAt": "2026-07-10T17:56:30.756Z", "answerBytes": 181, "answerChars": 181, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-empty.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nt = {}\n```\n\nReason: `t = {}` allocates a new empty table (fast constant-time operation) and lets the old table be garbage collected later. `table.Empty(t)` must iterate and nil out every key in the existing table, which is O(n) and slower for large sequential tables in LuaJIT.", "durationMs": 6858, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3a6344977f5bd475", "usage": { "source": "provider", "promptTokens": 22740, "completionTokens": 55, "totalTokens": 22944, "reasoningTokens": 149, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:25.424Z", "completedAt": "2026-07-10T17:56:32.284Z", "answerBytes": 284, "answerChars": 284, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-hasvalue.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attemptIndex": 1, "status": "incorrect", "detail": "Matched an incorrect-answer pattern.", "finalResponse": "```lua\n-- Slow: linear search O(n)\nlocal list = { \"a\", \"b\", \"c\", \"d\" }\nlocal found = table.HasValue(list, \"c\")\n\n-- Fast: hash lookup O(1)\nlocal set = { a = true, b = true, c = true, d = true }\nlocal found = set[\"c\"] ~= nil\n```\n\nReason: table.HasValue iterates the entire array (O(n)), while key lookup in a hash table is constant time (O(1)).", "durationMs": 5977, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "7d064428a873fdfc", "usage": { "source": "provider", "promptTokens": 22742, "completionTokens": 97, "totalTokens": 22953, "reasoningTokens": 114, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:25.743Z", "completedAt": "2026-07-10T17:56:31.723Z", "answerBytes": 342, "answerChars": 342, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-literal.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- Faster: table constructor with known fields\nlocal t = { field1 = \"value1\", field2 = \"value2\", field3 = \"value3\" }\n```\n\nReason: Table constructors with known fields are allocated once with optimal size hints, avoiding multiple SETTABLE operations and potential rehashing that occurs when assigning fields after `{}`.", "durationMs": 17172, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f95a8fc610d720ad", "usage": { "source": "provider", "promptTokens": 22746, "completionTokens": 41, "totalTokens": 22987, "reasoningTokens": 200, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:26.104Z", "completedAt": "2026-07-10T17:56:43.278Z", "answerBytes": 325, "answerChars": 325, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-random.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal tbl = { \"a\", \"b\", \"c\", \"d\", \"e\" }\nlocal randomElement = tbl[math.random(#tbl)]\n```\n\nReason: `math.random(#tbl)` directly indexes the table without `table.Random`'s internal type checks and iterator overhead, making it ~3-5x faster for sequential tables.", "durationMs": 5521, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f3e090701953d4a9", "usage": { "source": "provider", "promptTokens": 22739, "completionTokens": 63, "totalTokens": 22908, "reasoningTokens": 106, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:26.733Z", "completedAt": "2026-07-10T17:56:32.256Z", "answerBytes": 266, "answerChars": 266, "exitCode": 0 }, { "fixtureId": "gmod.perf.x-times-x.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal result = x * x\n```\nReason: `x * x` compiles to a single MUL opcode, while `x^2` or `math.pow(x,2)` incur function call overhead or bytecode for the power operator.", "durationMs": 6446, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "79d48008f6b5174f", "usage": { "source": "provider", "promptTokens": 22736, "completionTokens": 41, "totalTokens": 22894, "reasoningTokens": 117, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:27.359Z", "completedAt": "2026-07-10T17:56:33.808Z", "answerBytes": 176, "answerChars": 176, "exitCode": 0 }, { "fixtureId": "gmod.player-iterator.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attemptIndex": 1, "status": "pass", "detail": "Uses player.Iterator() (wiki-recommended Lua-cached iterator).", "finalResponse": "```lua\nfor _, ply in player.Iterator() do\n -- ply is each connected player\nend\n```\n\nReason: `player.Iterator()` is the modern, memory-efficient way to iterate players in Garry's Mod — it avoids allocating a new table on each call unlike `player.GetAll()`.", "durationMs": 5718, "version": "1.15.9", "fixtureVersion": 2, "rubricVersion": "4", "promptHash": "fe3d7469535a0ca2", "usage": { "source": "provider", "promptTokens": 22751, "completionTokens": 45, "totalTokens": 22909, "reasoningTokens": 113, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:27.749Z", "completedAt": "2026-07-10T17:56:33.470Z", "answerBytes": 260, "answerChars": 258, "exitCode": 0 }, { "fixtureId": "gmod.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nfor _, ent in ents.Iterator() do\n if ent:GetClass() == \"prop_physics\" then\n -- process ent\n end\nend\n```\n\nReason: `ents.Iterator()` returns a stateless iterator that yields entities one at a time without allocating a table of all entities, avoiding the memory overhead of `ents.GetAll()` or `ents.FindByClass()`.", "durationMs": 7327, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "3990c92253db85bb", "usage": { "source": "provider", "promptTokens": 22745, "completionTokens": 60, "totalTokens": 22983, "reasoningTokens": 178, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:28.319Z", "completedAt": "2026-07-10T17:56:35.648Z", "answerBytes": 331, "answerChars": 331, "exitCode": 0 }, { "fixtureId": "gmod.hook-add.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Registers a named hook with hook.Add.", "finalResponse": "```lua\nhook.Add(\"Think\", \"MyAddon.Think\", function()\n -- Your think logic here\nend)\n```\nReason: This registers a callback on the Think hook using the unique identifier \"MyAddon.Think\" as requested.", "durationMs": 6298, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "12d2222fdb7d6b90", "usage": { "source": "provider", "promptTokens": 22749, "completionTokens": 37, "totalTokens": 22869, "reasoningTokens": 83, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:28.701Z", "completedAt": "2026-07-10T17:56:35.001Z", "answerBytes": 200, "answerChars": 200, "exitCode": 0 }, { "fixtureId": "gmod.isvalid.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Uses IsValid for entity/object validity.", "finalResponse": "```lua\nif IsValid(ent) then\n -- safe to call methods on ent\n ent:SomeMethod()\nend\n```\n\nReason: `IsValid(ent)` returns false for nil, NULL entities, and entities that have been removed, making it the standard safety check before calling methods on entity references in Garry's Mod.", "durationMs": 7237, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "35527312e59dfc13", "usage": { "source": "provider", "promptTokens": 22742, "completionTokens": 70, "totalTokens": 22904, "reasoningTokens": 92, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:30.534Z", "completedAt": "2026-07-10T17:56:37.773Z", "answerBytes": 286, "answerChars": 286, "exitCode": 0 }, { "fixtureId": "gmod.net-receivers.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nnet.Receive(\"MyAddon.Sync\", function(len, ply)\n -- handle the message\nend)\n```\n\nReason: `net.Receive` is the standard Garry's Mod API for registering a callback that fires when a specific net message is received from the client (or server, depending on realm). The callback receives the message length in bytes and the player who sent it.", "durationMs": 5819, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "24d54ee8366753a6", "usage": { "source": "provider", "promptTokens": 22739, "completionTokens": 70, "totalTokens": 22887, "reasoningTokens": 78, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:30.757Z", "completedAt": "2026-07-10T17:56:36.578Z", "answerBytes": 348, "answerChars": 348, "exitCode": 0 }, { "fixtureId": "gmod.perf.angle-zero.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attemptIndex": 1, "status": "incorrect", "detail": "Did not match a fixture answer pattern.", "finalResponse": "```lua\nlocal zeroAngle = Angle(0, 0, 0)\n\n-- In hot path:\nlocal ang = zeroAngle\n```\n\nReason: Reusing a pre-allocated Angle avoids the overhead of `Angle()` constructor calls, memory allocation, and garbage collection pressure in tight loops.", "durationMs": 46685, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f6bc97bf98280d62", "usage": { "source": "provider", "promptTokens": 22751, "completionTokens": 50, "totalTokens": 22899, "reasoningTokens": 98, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:31.469Z", "completedAt": "2026-07-10T17:57:18.155Z", "answerBytes": 240, "answerChars": 240, "exitCode": 0 }, { "fixtureId": "gmod.perf.config-var.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal myaddon_config_color = Color(255, 0, 0)\n\n-- Read\nlocal c = myaddon_config_color\n```\n\nReason: Local variables are resolved at compile time with a single register lookup, while nested tables require multiple runtime hash lookups (myaddon → config → color) and global lookups hit the _G table.", "durationMs": 8780, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "bcc4ff8eb162b699", "usage": { "source": "provider", "promptTokens": 22755, "completionTokens": 40, "totalTokens": 22967, "reasoningTokens": 172, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:31.725Z", "completedAt": "2026-07-10T17:56:40.506Z", "answerBytes": 307, "answerChars": 303, "exitCode": 0 }, { "fixtureId": "gmod.perf.darkrpvar.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- Preferred\nlocal jobName = ply:getDarkRPVar(\"job\")\n-- or for the full job table\nlocal jobTable = ply:getJobTable()\nlocal jobName = jobTable and jobTable.name\n```\n\nReason: `getDarkRPVar(\"job\")` is the DarkRP-specific accessor that reads the synchronized DarkRP variable directly, avoiding the generic NWString overhead and ensuring compatibility with DarkRP's variable system.", "durationMs": 26972, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "02a37daa699cded3", "usage": { "source": "provider", "promptTokens": 22755, "completionTokens": 88, "totalTokens": 22971, "reasoningTokens": 128, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:32.258Z", "completedAt": "2026-07-10T17:56:59.234Z", "answerBytes": 384, "answerChars": 384, "exitCode": 0 }, { "fixtureId": "gmod.perf.disttosqr.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal threshold = 100\nif vec1:DistToSqr(vec2) <= threshold * threshold then\n -- within range\nend\n```\n\nReason: `DistToSqr` avoids the expensive square root operation by comparing squared distances directly against the squared threshold.", "durationMs": 5671, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "a5772470c6859cdc", "usage": { "source": "provider", "promptTokens": 22749, "completionTokens": 31, "totalTokens": 22900, "reasoningTokens": 120, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:32.285Z", "completedAt": "2026-07-10T17:56:37.957Z", "answerBytes": 245, "answerChars": 245, "exitCode": 0 }, { "fixtureId": "gmod.perf.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nfor _, ent in ents.Iterator() do\n -- Process each entity here\n print(ent:GetClass())\nend\n```\n\nReason: `ents.Iterator()` is the wiki-recommended efficient iterator that yields entities one at a time without allocating a full table, making it memory-efficient for large entity counts.", "durationMs": 7227, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "306d3f1d05f28246", "usage": { "source": "provider", "promptTokens": 22746, "completionTokens": 37, "totalTokens": 22979, "reasoningTokens": 196, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:33.472Z", "completedAt": "2026-07-10T17:56:40.700Z", "answerBytes": 295, "answerChars": 295, "exitCode": 0 }, { "fixtureId": "gmod.perf.find-ents-near.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nlocal entsNearPlayer = ents.FindInSphere(player:GetPos(), 256)\n```\n\nReason: `ents.FindInSphere` uses the engine's spatial partition (octree/BSP) for O(log n) radius checks, avoiding PVS traversal overhead and AABB tests; benchmarks consistently show it 3–10× faster than `FindInBox` or `FindInPVS` for typical \"near player\" radii (128–512 units).", "durationMs": 24583, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "07c583fc3d9fe09f", "usage": { "source": "provider", "promptTokens": 22766, "completionTokens": 87, "totalTokens": 23111, "reasoningTokens": 258, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:33.810Z", "completedAt": "2026-07-10T17:56:58.395Z", "answerBytes": 358, "answerChars": 353, "exitCode": 0 }, { "fixtureId": "gmod.perf.find-players-near.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal function GetPlayersInRadius(pos, radius)\n local radiusSqr = radius * radius\n local players = player.GetAll()\n local result = {}\n\n for i = 1, #players do\n local ply = players[i]\n if ply:GetPos():DistToSqr(pos) <= radiusSqr then\n result[#result + 1] = ply\n end\n end\n\n return result\nend\n```\n\nReason: `player.GetAll()` iterates only players (not all entities), and `DistToSqr` avoids the square root calculation, making it significantly faster than `ents.FindInSphere` + filtering when entity counts are high.", "durationMs": 5935, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "d139ba2e8ee38a2f", "usage": { "source": "provider", "promptTokens": 22752, "completionTokens": 123, "totalTokens": 23018, "reasoningTokens": 143, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:35.003Z", "completedAt": "2026-07-10T17:56:40.940Z", "answerBytes": 568, "answerChars": 568, "exitCode": 0 }, { "fixtureId": "gmod.perf.for-vs-while.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 1 through 1 candidate loops.", "finalResponse": "```lua\n-- for loop (faster)\nfor i = 1, n do\n -- body\nend\n\n-- while loop (slower)\nlocal i = 1\nwhile i <= n do\n -- body\n i = i + 1\nend\n```\n\nReason: LuaJIT compiles numeric `for` loops into highly optimized machine code with a single loop header, eliminating bounds checks and increment overhead that `while` loops require.", "durationMs": 6896, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "b3401a190a8aecf0", "usage": { "source": "provider", "promptTokens": 22751, "completionTokens": 81, "totalTokens": 22981, "reasoningTokens": 149, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:35.649Z", "completedAt": "2026-07-10T17:56:42.547Z", "answerBytes": 329, "answerChars": 329, "exitCode": 0 }, { "fixtureId": "gmod.perf.hook-once.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- Faster: single hook.Run with all players\nlocal players = player.GetAll()\nhook.Run(\"CustomLogic\", players)\n\n-- Slower: hook.Run per player\nfor _, ply in ipairs(player.GetAll()) do\n hook.Run(\"CustomLogic\", ply)\nend\n```\n\nReason: hook.Run has internal overhead (hook table lookup, argument packing, pcall protection). Calling it once with a table of all players avoids N-1 redundant hook dispatches per tick, reducing function call overhead and garbage from temporary argument tables.", "durationMs": 4889, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "ed1d3e09249fc8bb", "usage": { "source": "provider", "promptTokens": 22758, "completionTokens": 90, "totalTokens": 22949, "reasoningTokens": 101, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:36.579Z", "completedAt": "2026-07-10T17:56:41.469Z", "answerBytes": 493, "answerChars": 493, "exitCode": 0 }, { "fixtureId": "gmod.perf.hudpaint-cache.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nhook.Add(\"HUDPaint\", \"OptimizedHealthDisplay\", function()\n local hp = LocalPlayer():Health()\n \n -- Draw call 1\n draw.SimpleText(\"Health: \" .. hp, \"DermaDefault\", 10, 10, Color(255, 255, 255), TEXT_ALIGN_LEFT, TEXT_ALIGN_TOP)\n \n -- Draw call 2\n draw.RoundedBox(0, 10, 30, math.Clamp(hp, 0, 100) * 2, 20, Color(255, 0, 0))\n \n -- Draw call 3\n if hp <= 25 then\n draw.SimpleText(\"LOW HEALTH!\", \"DermaDefaultBold\", ScrW() / 2, ScrH() / 2, Color(255, 0, 0), TEXT_ALIGN_CENTER, TEXT_ALIGN_CENTER)\n end\nend)\n```\n\nReason: Caching `LocalPlayer():Health()` in a local variable avoids three redundant function calls and method lookups per frame, reducing overhead in the render hook.", "durationMs": 5958, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3def450f3158ceff", "usage": { "source": "provider", "promptTokens": 22759, "completionTokens": 255, "totalTokens": 23078, "reasoningTokens": 64, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:37.774Z", "completedAt": "2026-07-10T17:56:43.733Z", "answerBytes": 717, "answerChars": 717, "exitCode": 0 }, { "fixtureId": "gmod.perf.local-color.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal white = Color(255, 255, 255)\n\nhook.Add(\"HUDPaint\", \"Example\", function()\n surface.SetDrawColor(white)\n -- draw calls\nend)\n```\n\nReason: Creating Color objects allocates memory and triggers garbage collection; reusing a single cached instance eliminates per-frame allocation overhead.", "durationMs": 5945, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "16a7bed1b931d467", "usage": { "source": "provider", "promptTokens": 22746, "completionTokens": 68, "totalTokens": 22928, "reasoningTokens": 114, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:37.958Z", "completedAt": "2026-07-10T17:56:43.905Z", "answerBytes": 301, "answerChars": 301, "exitCode": 0 }, { "fixtureId": "gmod.perf.local-vs-global.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal sin = math.sin\n\nfor i = 1, 1000000 do\n local x = sin(i * 0.01)\nend\n```\n\nReason: Caching `math.sin` in a local variable avoids repeated global table lookups in the hot loop, reducing overhead from hash table access to a direct register access.", "durationMs": 11357, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "c116d8c651190647", "usage": { "source": "provider", "promptTokens": 22748, "completionTokens": 64, "totalTokens": 22906, "reasoningTokens": 94, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:38.948Z", "completedAt": "2026-07-10T17:56:50.307Z", "answerBytes": 258, "answerChars": 258, "exitCode": 0 }, { "fixtureId": "gmod.perf.localplayer-cache.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal LocalPlayer = LocalPlayer\n\n-- Usage\nlocal ply = LocalPlayer()\n```\n\nReason: Caching `LocalPlayer` as a local variable avoids the global table lookup and function call overhead on every access. The local reference resolves once at load time, then direct variable access is used thereafter.", "durationMs": 6448, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "7398105af47b079e", "usage": { "source": "provider", "promptTokens": 22749, "completionTokens": 40, "totalTokens": 22911, "reasoningTokens": 122, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:40.508Z", "completedAt": "2026-07-10T17:56:46.956Z", "answerBytes": 300, "answerChars": 300, "exitCode": 0 }, { "fixtureId": "gmod.perf.looking-at.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nfunction PlayersLookingAtEachOther(ply1, ply2, threshold)\n threshold = threshold or 0.7 -- ~45 degrees, adjust as needed\n local aim1 = ply1:GetAimVector()\n local aim2 = ply2:GetAimVector()\n local toTarget = (ply2:GetPos() - ply1:GetPos()):GetNormalized()\n \n return aim1:Dot(toTarget) > threshold and aim2:Dot(-toTarget) > threshold\nend\n```\n\nReason: Dot product of normalized vectors gives cosine of angle directly; comparing against a threshold (e.g., 0.7 ≈ 45°) avoids expensive acos while checking both players face each other.", "durationMs": 7562, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "20b22f678a4b08d7", "usage": { "source": "provider", "promptTokens": 22763, "completionTokens": 131, "totalTokens": 22998, "reasoningTokens": 104, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:40.701Z", "completedAt": "2026-07-10T17:56:48.265Z", "answerBytes": 557, "answerChars": 554, "exitCode": 0 }, { "fixtureId": "gmod.perf.meta-vs-arg.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attemptIndex": 1, "status": "incorrect", "detail": "Matched an incorrect-answer pattern.", "finalResponse": "```lua\nply:SomeHelper()\n```\nReason: `ply:SomeHelper()` is idiomatic for methods on entities, avoids a global table lookup when the helper is in the entity metatable, and compiles to identical bytecode as `SomeHelper(ply)` when the function is defined the same way.", "durationMs": 7992, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "de332f7356830dfa", "usage": { "source": "provider", "promptTokens": 22754, "completionTokens": 30, "totalTokens": 23219, "reasoningTokens": 435, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:40.941Z", "completedAt": "2026-07-10T17:56:48.935Z", "answerBytes": 264, "answerChars": 264, "exitCode": 0 }, { "fixtureId": "gmod.perf.msg-vs-print.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nMsg(\"debug: \" .. value .. \"\\n\")\n```\n\nReason: `Msg` writes directly to the console without the formatting overhead of `print`, making it significantly faster in hot paths.", "durationMs": 14046, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "6cbb4e4b2f19dd24", "usage": { "source": "provider", "promptTokens": 22743, "completionTokens": 30, "totalTokens": 22898, "reasoningTokens": 125, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:41.471Z", "completedAt": "2026-07-10T17:56:55.519Z", "answerBytes": 177, "answerChars": 177, "exitCode": 0 }, { "fixtureId": "gmod.perf.pairs-ipairs-for.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal t = {1, 2, 3, 4, 5} -- large sequential array\n\n-- Fastest: numeric for\nfor i = 1, #t do\n local v = t[i]\n -- process v\nend\n```\n\nReason: Numeric for avoids iterator overhead and uses direct index access; ipairs adds iterator function calls; pairs iterates all keys including non-array parts.", "durationMs": 5317, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "de5e4875fcf3e600", "usage": { "source": "provider", "promptTokens": 22763, "completionTokens": 70, "totalTokens": 22962, "reasoningTokens": 129, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:42.548Z", "completedAt": "2026-07-10T17:56:47.867Z", "answerBytes": 308, "answerChars": 308, "exitCode": 0 }, { "fixtureId": "gmod.perf.plain-lua-vs-fn.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal function fastFilterMap(tbl, filterFn, mapFn)\n local out = {}\n local j = 0\n for i = 1, #tbl do\n local v = tbl[i]\n if filterFn(v) then\n j = j + 1\n out[j] = mapFn(v)\n end\n end\n return out\nend\n\n-- Usage\nlocal players = player.GetAll()\nlocal aliveNames = fastFilterMap(players,\n function(p) return p:Alive() end,\n function(p) return p:Nick() end\n)\n```\n\nReason: Plain loop with pre-allocated output table avoids closure allocation per element, eliminates fn.Compose/fn.Filter call overhead, and uses numeric indexing for JIT-friendly hot paths.", "durationMs": 6536, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "ead0a98b3ff6a388", "usage": { "source": "provider", "promptTokens": 22771, "completionTokens": 136, "totalTokens": 23148, "reasoningTokens": 241, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:43.279Z", "completedAt": "2026-07-10T17:56:49.817Z", "answerBytes": 615, "answerChars": 615, "exitCode": 0 }, { "fixtureId": "gmod.perf.player-cache-hooks.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal cachedPlayers = {}\nlocal cacheValid = false\n\nlocal function rebuildCache()\n cachedPlayers = player.GetAll()\n cacheValid = true\nend\n\nhook.Add(\"PlayerInitialSpawn\", \"PlayerCache_Rebuild\", rebuildCache)\nhook.Add(\"PlayerDisconnected\", \"PlayerCache_Rebuild\", rebuildCache)\n\nhook.Add(\"Think\", \"PlayerCache_ExampleUsage\", function()\n if not cacheValid then rebuildCache() end\n for _, ply in ipairs(cachedPlayers) do\n -- your per-player logic here\n end\nend)\n```\n\nReason: Caches the player list and only rebuilds on join/leave events, eliminating the O(n) `player.GetAll()` allocation every tick.", "durationMs": 7109, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "a834817afe9e6c25", "usage": { "source": "provider", "promptTokens": 22767, "completionTokens": 149, "totalTokens": 23004, "reasoningTokens": 88, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:43.735Z", "completedAt": "2026-07-10T17:56:50.846Z", "answerBytes": 622, "answerChars": 622, "exitCode": 0 }, { "fixtureId": "gmod.perf.ply-table-index.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- Use a separate table keyed by player entity for O(1) reads without metatable overhead\nlocal playerData = {}\n\n-- Write\nplayerData[ply] = playerData[ply] or {}\nplayerData[ply].someField = value\n\n-- Read (faster than ply.someField)\nlocal val = playerData[ply] and playerData[ply].someField\n```\n\nReason: Direct table access avoids the entity metatable's `__index`/`__newindex` metamethods and C++ boundary crossings that `ply.someField` incurs on every read/write.", "durationMs": 7171, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f18cc80df8999147", "usage": { "source": "provider", "promptTokens": 22749, "completionTokens": 109, "totalTokens": 23021, "reasoningTokens": 163, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:43.906Z", "completedAt": "2026-07-10T17:56:51.079Z", "answerBytes": 470, "answerChars": 470, "exitCode": 0 }, { "fixtureId": "gmod.perf.seq-tables.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attemptIndex": 1, "status": "protocol_error", "detail": "OpenCode returned no answer text; error: \"Streaming response failed\"", "finalResponse": null, "durationMs": 2977, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "4778b0220c3f91a3", "startedAt": "2026-07-10T17:56:44.487Z", "completedAt": "2026-07-10T17:56:47.466Z", "exitCode": 0, "usage": { "promptTokens": 79, "completionTokens": 0, "totalTokens": 79, "source": "estimated" } }, { "fixtureId": "gmod.perf.setdrawcolor-split.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nsurface.SetDrawColor(255, 0, 0, 255)\n```\n\nReason: Passing separate r,g,b,a numbers avoids allocating a Color table object on every call, reducing GC pressure in hot draw paths.", "durationMs": 6369, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "d110fde8a37bbe59", "usage": { "source": "provider", "promptTokens": 22758, "completionTokens": 43, "totalTokens": 23012, "reasoningTokens": 211, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:46.958Z", "completedAt": "2026-07-10T17:56:53.329Z", "answerBytes": 183, "answerChars": 183, "exitCode": 0 }, { "fixtureId": "gmod.perf.sqlite-vs-mysql.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal result = sql.Query(\"SELECT * FROM player_data WHERE steamid = \" .. sql.SQLStr(steamid))\n```\n\nReason: Local SQLite (sql library) avoids network round-trips and external process overhead, giving lower latency for single-server workloads.", "durationMs": 5347, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "4a3f5d2a20d71ac9", "usage": { "source": "provider", "promptTokens": 22776, "completionTokens": 27, "totalTokens": 22951, "reasoningTokens": 148, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:47.472Z", "completedAt": "2026-07-10T17:56:52.836Z", "answerBytes": 248, "answerChars": 248, "exitCode": 0 }, { "fixtureId": "gmod.perf.steamid-cache.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attemptIndex": 1, "status": "protocol_error", "detail": "OpenCode returned no answer text; error: \"Streaming response failed\"", "finalResponse": null, "durationMs": 3553, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "e8a94aa454154982", "startedAt": "2026-07-10T17:56:47.869Z", "completedAt": "2026-07-10T17:56:51.423Z", "exitCode": 0, "usage": { "promptTokens": 63, "completionTokens": 0, "totalTokens": 63, "source": "estimated" } }, { "fixtureId": "gmod.perf.string-table-concat.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 0 through 0 candidate loops.", "finalResponse": "```lua\n-- Slow: repeated .. concatenation (O(n²))\nlocal result = \"\"\nfor i = 1, 10000 do\n result = result .. \"piece \" .. i .. \"\\n\"\nend\n\n-- Fast: table.concat (O(n))\nlocal parts = {}\nfor i = 1, 10000 do\n parts[#parts + 1] = \"piece \" .. i\nend\nlocal result = table.concat(parts, \"\\n\") .. \"\\n\"\n```\n\nReason: Strings are immutable in Lua; each `..` creates a new string copying all prior content. `table.concat` allocates once and copies each piece exactly once.", "durationMs": 7100, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "b0cf9e04ae7c5dd9", "usage": { "source": "provider", "promptTokens": 22746, "completionTokens": 114, "totalTokens": 23030, "reasoningTokens": 170, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:48.266Z", "completedAt": "2026-07-10T17:56:55.368Z", "answerBytes": 462, "answerChars": 461, "exitCode": 0 }, { "fixtureId": "gmod.perf.surface-drawrect.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nsurface.SetDrawColor(color)\nsurface.DrawRect(x, y, w, h)\n```\nReason: surface.DrawRect avoids draw.RoundedBox's internal radius checks and function overhead, directly issuing the rectangle draw call.", "durationMs": 21781, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "696e8de769d9ad0e", "usage": { "source": "provider", "promptTokens": 22754, "completionTokens": 38, "totalTokens": 22997, "reasoningTokens": 205, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:48.937Z", "completedAt": "2026-07-10T17:57:10.720Z", "answerBytes": 205, "answerChars": 205, "exitCode": 0 }, { "fixtureId": "gmod.perf.surface-text.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nsurface.SetFont(\"DermaDefault\")\nsurface.SetTextColor(255, 255, 255, 255)\nsurface.SetTextPos(x, y)\nsurface.DrawText(text)\n```\n\nReason: `surface.DrawText` bypasses the `draw` library's overhead (font fallback, shadow/outline processing, alignment calculations) and directly submits glyph quads to the render queue, making it the lowest-latency path for per-frame single-line text.", "durationMs": 7473, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "95d9fe4918ee4197", "usage": { "source": "provider", "promptTokens": 22747, "completionTokens": 76, "totalTokens": 23033, "reasoningTokens": 210, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:49.819Z", "completedAt": "2026-07-10T17:56:57.293Z", "answerBytes": 385, "answerChars": 385, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-count-hash.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal length = #myTable\n```\n\nReason: In Lua (including Garry's Mod's LuaJIT), the `#` operator is the standard and preferred way to get the length of a sequential array-like table. It returns the highest integer index with a non-nil value.", "durationMs": 5378, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3e9bbfc8452e05e3", "usage": { "source": "provider", "promptTokens": 22742, "completionTokens": 47, "totalTokens": 22899, "reasoningTokens": 110, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:50.309Z", "completedAt": "2026-07-10T17:56:55.690Z", "answerBytes": 246, "answerChars": 246, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-empty.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nt = {}\n```\n\nReason: `t = {}` allocates a new empty table (O(1)) and lets the old table be garbage collected, while `table.Empty(t)` must iterate and nil out every key (O(n)).", "durationMs": 7445, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3a6344977f5bd475", "usage": { "source": "provider", "promptTokens": 22746, "completionTokens": 42, "totalTokens": 22979, "reasoningTokens": 191, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:50.847Z", "completedAt": "2026-07-10T17:56:58.294Z", "answerBytes": 181, "answerChars": 181, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-hasvalue.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 0 through 0 candidate loops.", "finalResponse": "```lua\n-- Slow: O(n) linear search\nlocal list = { \"a\", \"b\", \"c\", \"d\" }\nlocal function hasValueList(tbl, val)\n for _, v in ipairs(tbl) do\n if v == val then return true end\n end\n return false\nend\n\n-- Fast: O(1) hash lookup\nlocal set = { a = true, b = true, c = true, d = true }\nlocal function hasValueSet(tbl, val)\n return tbl[val] == true\nend\n\n-- Usage\nprint(hasValueList(list, \"c\")) -- true\nprint(hasValueSet(set, \"c\")) -- true\n```\n\nReason: Hash set lookup is O(1) vs O(n) linear search; avoids function call overhead of table.HasValue.", "durationMs": 7117, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "7d064428a873fdfc", "usage": { "source": "provider", "promptTokens": 22748, "completionTokens": 170, "totalTokens": 23017, "reasoningTokens": 99, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:51.081Z", "completedAt": "2026-07-10T17:56:58.200Z", "answerBytes": 559, "answerChars": 559, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-literal.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal t = { field1 = value1, field2 = value2, field3 = value3 }\n```\n\nReason: Table constructors with known fields are faster because they allocate the table with the correct size upfront and populate it in a single operation, avoiding multiple hash table insertions and potential rehashing.", "durationMs": 5591, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f95a8fc610d720ad", "usage": { "source": "provider", "promptTokens": 22749, "completionTokens": 35, "totalTokens": 22894, "reasoningTokens": 110, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:51.424Z", "completedAt": "2026-07-10T17:56:57.016Z", "answerBytes": 297, "answerChars": 297, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-random.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attemptIndex": 1, "status": "protocol_error", "detail": "OpenCode returned no answer text; error: \"Streaming response failed\"", "finalResponse": null, "durationMs": 3163, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f3e090701953d4a9", "startedAt": "2026-07-10T17:56:52.838Z", "completedAt": "2026-07-10T17:56:56.003Z", "exitCode": 0, "usage": { "promptTokens": 66, "completionTokens": 0, "totalTokens": 66, "source": "estimated" } }, { "fixtureId": "gmod.perf.x-times-x.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nx * x\n```\nReason: Direct multiplication compiles to a single VM opcode (MUL), while `x^2` or `math.pow(x,2)` invoke the pow metamethod or C function with call overhead. In tight loops, `x * x` is measurably faster.", "durationMs": 5432, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "79d48008f6b5174f", "usage": { "source": "provider", "promptTokens": 22739, "completionTokens": 61, "totalTokens": 22902, "reasoningTokens": 102, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:53.330Z", "completedAt": "2026-07-10T17:56:58.763Z", "answerBytes": 221, "answerChars": 221, "exitCode": 0 }, { "fixtureId": "gmod.player-iterator.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attemptIndex": 1, "status": "partial", "detail": "Uses ipairs but still allocates via player.GetAll() each time.", "finalResponse": "```lua\nfor _, ply in ipairs(player.GetAll()) do\n -- ply is each connected player\nend\n```\n\nReason: `player.GetAll()` returns a sequential array, so `ipairs` is the correct iterator (not `pairs`). The `_` discards the numeric index since only the player entity is needed.", "durationMs": 9181, "version": "1.15.9", "fixtureVersion": 2, "rubricVersion": "4", "promptHash": "fe3d7469535a0ca2", "usage": { "source": "provider", "promptTokens": 22754, "completionTokens": 64, "totalTokens": 23053, "reasoningTokens": 235, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:55.370Z", "completedAt": "2026-07-10T17:57:04.553Z", "answerBytes": 272, "answerChars": 272, "exitCode": 0 }, { "fixtureId": "gmod.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nfor _, ent in ents.Iterator() do\n if ent:GetClass() == \"prop_physics\" then\n -- do something with ent\n end\nend\n```\n\nReason: `ents.Iterator()` returns a stateless iterator that yields entities one at a time without materializing a full table of all entities in the map.", "durationMs": 6251, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "3990c92253db85bb", "usage": { "source": "provider", "promptTokens": 22745, "completionTokens": 61, "totalTokens": 22982, "reasoningTokens": 176, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:55.520Z", "completedAt": "2026-07-10T17:57:01.773Z", "answerBytes": 287, "answerChars": 287, "exitCode": 0 }, { "fixtureId": "gmod.hook-add.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attemptIndex": 1, "status": "pass", "detail": "Registers a named hook with hook.Add.", "finalResponse": "```lua\nhook.Add(\"Think\", \"MyAddon.Think\", function()\n -- Your think logic here\nend)\n```\nReason: The `hook.Add` function registers a callback for the \"Think\" event with the unique identifier \"MyAddon.Think\", ensuring it runs every frame and can be removed later with `hook.Remove(\"Think\", \"MyAddon.Think\")`.", "durationMs": 11105, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "12d2222fdb7d6b90", "usage": { "source": "provider", "promptTokens": 22744, "completionTokens": 69, "totalTokens": 22947, "reasoningTokens": 134, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:55.692Z", "completedAt": "2026-07-10T17:57:06.799Z", "answerBytes": 309, "answerChars": 309, "exitCode": 0 }, { "fixtureId": "gmod.isvalid.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attemptIndex": 1, "status": "pass", "detail": "Uses IsValid for entity/object validity.", "finalResponse": "```lua\nif IsValid(ent) then\n -- safe to call methods on ent\nend\n```\n\nReason: `IsValid(ent)` returns false for nil, NULL entities, and entities that have been removed, preventing errors when calling methods on invalid references.", "durationMs": 9587, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "35527312e59dfc13", "usage": { "source": "provider", "promptTokens": 22739, "completionTokens": 51, "totalTokens": 22875, "reasoningTokens": 85, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:56.004Z", "completedAt": "2026-07-10T17:57:05.593Z", "answerBytes": 231, "answerChars": 231, "exitCode": 0 }, { "fixtureId": "gmod.net-receivers.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nnet.Receive(\"MyAddon.Sync\", function(len, ply)\n -- Handle the incoming net message here\n local data = net.ReadTable() -- or whatever data type you're sending\n -- Process data...\nend)\n```\n\nReason: This registers a server-side handler for the \"MyAddon.Sync\" net message using Garry's Mod's `net.Receive` API, which takes the message name and a callback function receiving the message length and the sending player.", "durationMs": 6438, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "24d54ee8366753a6", "usage": { "source": "provider", "promptTokens": 22737, "completionTokens": 90, "totalTokens": 22925, "reasoningTokens": 98, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:57.018Z", "completedAt": "2026-07-10T17:57:03.458Z", "answerBytes": 428, "answerChars": 428, "exitCode": 0 }, { "fixtureId": "gmod.perf.angle-zero.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\n-- Slow: allocates new object every call (GC pressure)\nlocal function Slow()\n local ang = Angle()\n return ang\nend\n\n-- Fast: reuse single pre-allocated object\nlocal zeroAng = Angle()\nlocal function Fast()\n zeroAng:SetUnpacked(0, 0, 0)\n return zeroAng\nend\n```\n\nReason: Reusing a single Angle instance with `SetUnpacked` avoids allocation and GC churn in hot paths, while `Angle()` constructs a new object each call.", "durationMs": 44901, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f6bc97bf98280d62", "usage": { "source": "provider", "promptTokens": 22748, "completionTokens": 85, "totalTokens": 22981, "reasoningTokens": 148, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:57.296Z", "completedAt": "2026-07-10T17:57:42.225Z", "answerBytes": 432, "answerChars": 432, "exitCode": 0 }, { "fixtureId": "gmod.perf.config-var.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal config_color = Color(255, 0, 0)\n\n-- Read\nlocal c = config_color\n```\n\nReason: Local variables avoid global table lookups and nested indexing overhead; they resolve in a single VM register access.", "durationMs": 40708, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "bcc4ff8eb162b699", "usage": { "source": "provider", "promptTokens": 22747, "completionTokens": 25, "totalTokens": 22884, "reasoningTokens": 112, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:58.204Z", "completedAt": "2026-07-10T17:57:38.913Z", "answerBytes": 207, "answerChars": 207, "exitCode": 0 }, { "fixtureId": "gmod.perf.darkrpvar.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nply:getDarkRPVar(\"job\")\n```\n\nReason: DarkRP stores job info in DarkRPVars (networked vars with prediction), not generic NWStrings. `getDarkRPVar` is the correct accessor, handles nil safely, and avoids stringly-typed NetVar lookups.", "durationMs": 6246, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "02a37daa699cded3", "usage": { "source": "provider", "promptTokens": 22732, "completionTokens": 63, "totalTokens": 22913, "reasoningTokens": 118, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:58.296Z", "completedAt": "2026-07-10T17:57:04.544Z", "answerBytes": 239, "answerChars": 239, "exitCode": 0 }, { "fixtureId": "gmod.perf.disttosqr.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal threshold = 100\nif pos1:DistToSqr(pos2) < threshold * threshold then\n -- within threshold\nend\n```\n\nReason: `DistToSqr` avoids the expensive square root operation by comparing squared distances directly against the squared threshold.", "durationMs": 6474, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "a5772470c6859cdc", "usage": { "source": "provider", "promptTokens": 22743, "completionTokens": 35, "totalTokens": 22904, "reasoningTokens": 126, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:58.398Z", "completedAt": "2026-07-10T17:57:04.874Z", "answerBytes": 248, "answerChars": 248, "exitCode": 0 }, { "fixtureId": "gmod.perf.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nfor _, ent in ents.Iterator() do\n -- Process each entity here\n print(ent:GetClass())\nend\n```\n\nReason: `ents.Iterator()` is the wiki-recommended efficient iterator as it avoids creating a full table of all entities in memory, instead yielding entities one at a time via a Lua iterator function.", "durationMs": 6519, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "306d3f1d05f28246", "usage": { "source": "provider", "promptTokens": 22737, "completionTokens": 48, "totalTokens": 22912, "reasoningTokens": 127, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:58.765Z", "completedAt": "2026-07-10T17:57:05.286Z", "answerBytes": 306, "answerChars": 306, "exitCode": 0 }, { "fixtureId": "gmod.perf.find-ents-near.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nlocal ents = ents.FindInSphere(ply:GetPos(), 500)\n```\n\nReason: FindInSphere uses a simple spatial partition lookup with a single distance check per entity, making it the fastest built-in for radius queries around a player position in typical benchmarks.", "durationMs": 7950, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "07c583fc3d9fe09f", "usage": { "source": "provider", "promptTokens": 22763, "completionTokens": 38, "totalTokens": 23028, "reasoningTokens": 227, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:56:59.236Z", "completedAt": "2026-07-10T17:57:07.188Z", "answerBytes": 260, "answerChars": 260, "exitCode": 0 }, { "fixtureId": "gmod.perf.find-players-near.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal function FindPlayersInSphere(pos, radius)\n local radiusSqr = radius * radius\n local players = player.GetAll()\n local result = {}\n for i = 1, #players do\n local ply = players[i]\n if ply:GetPos():DistToSqr(pos) <= radiusSqr then\n result[#result + 1] = ply\n end\n end\n return result\nend\n```\n\nReason: player.GetAll() iterates only players (typically <100) instead of all entities (often thousands), and DistToSqr avoids the expensive square root operation.", "durationMs": 5832, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "d139ba2e8ee38a2f", "usage": { "source": "provider", "promptTokens": 22755, "completionTokens": 109, "totalTokens": 22998, "reasoningTokens": 134, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:01.774Z", "completedAt": "2026-07-10T17:57:07.607Z", "answerBytes": 514, "answerChars": 514, "exitCode": 0 }, { "fixtureId": "gmod.perf.for-vs-while.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 1 through 1 candidate loops.", "finalResponse": "```lua\n-- for loop (faster)\nfor i = 1, n do\n -- body\nend\n\n-- while loop (slower)\nlocal i = 1\nwhile i <= n do\n -- body\n i = i + 1\nend\n```\n\nReason: Numeric `for` loops compile to dedicated VM bytecode (`FORPREP`/`FORLOOP`) with a single branch per iteration, while `while` loops require separate load, compare, branch, and increment instructions each iteration.", "durationMs": 5809, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "b3401a190a8aecf0", "usage": { "source": "provider", "promptTokens": 22747, "completionTokens": 92, "totalTokens": 22977, "reasoningTokens": 138, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:03.460Z", "completedAt": "2026-07-10T17:57:09.270Z", "answerBytes": 368, "answerChars": 368, "exitCode": 0 }, { "fixtureId": "gmod.perf.hook-once.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- Faster: single hook.Run with all players\nlocal players = player.GetAll()\nhook.Run(\"CustomTick\", players, FrameTime())\n\n-- Slower: hook.Run per player in loop\nfor _, ply in ipairs(player.GetAll()) do\n hook.Run(\"CustomTick\", ply, FrameTime())\nend\n```\n\nReason: Single hook.Run avoids repeated hook table lookups and function call overhead per player; the hook system iterates callbacks once internally.", "durationMs": 6274, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "ed1d3e09249fc8bb", "usage": { "source": "provider", "promptTokens": 22759, "completionTokens": 79, "totalTokens": 22968, "reasoningTokens": 130, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:04.106Z", "completedAt": "2026-07-10T17:57:10.383Z", "answerBytes": 412, "answerChars": 412, "exitCode": 0 }, { "fixtureId": "gmod.perf.hudpaint-cache.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nhook.Add(\"HUDPaint\", \"OptimizedHealthDraw\", function()\n local ply = LocalPlayer()\n if not IsValid(ply) then return end\n\n local hp = ply:Health()\n \n -- Draw call 1\n draw.SimpleText(\"HP: \" .. hp, \"DermaDefault\", 10, 10, Color(255, 255, 255))\n \n -- Draw call 2\n draw.RoundedBox(0, 10, 30, math.Clamp(hp, 0, 100) * 2, 20, Color(200, 0, 0))\n \n -- Draw call 3\n if hp <= 25 then\n draw.SimpleText(\"LOW HEALTH\", \"DermaDefaultBold\", 10, 55, Color(255, 0, 0))\n end\nend)\n```\n\nReason: Caches `LocalPlayer():Health()` in a local variable `hp` once per frame instead of calling the method three times, avoiding redundant function calls and virtual method lookups.", "durationMs": 8251, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3def450f3158ceff", "usage": { "source": "provider", "promptTokens": 22756, "completionTokens": 237, "totalTokens": 23104, "reasoningTokens": 111, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:04.546Z", "completedAt": "2026-07-10T17:57:12.800Z", "answerBytes": 701, "answerChars": 701, "exitCode": 0 }, { "fixtureId": "gmod.perf.local-color.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal white = Color(255, 255, 255)\n\nfunction PANEL:Paint(w, h)\n surface.SetDrawColor(white)\n surface.DrawRect(0, 0, w, h)\nend\n```\n\nReason: Creating a Color object every frame allocates memory and triggers garbage collection; caching it once avoids repeated allocation.", "durationMs": 6828, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "16a7bed1b931d467", "usage": { "source": "provider", "promptTokens": 22740, "completionTokens": 76, "totalTokens": 22926, "reasoningTokens": 110, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:04.554Z", "completedAt": "2026-07-10T17:57:11.384Z", "answerBytes": 281, "answerChars": 281, "exitCode": 0 }, { "fixtureId": "gmod.perf.local-vs-global.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal sin = math.sin\nfor i = 1, 1000000 do\n local x = sin(i)\nend\n```\n\nReason: Caching `math.sin` in a local variable avoids repeated global table lookups (`math` → `sin`) inside the hot loop, reducing per-iteration overhead.", "durationMs": 10063, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "c116d8c651190647", "usage": { "source": "provider", "promptTokens": 22748, "completionTokens": 62, "totalTokens": 22903, "reasoningTokens": 93, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:04.876Z", "completedAt": "2026-07-10T17:57:14.941Z", "answerBytes": 236, "answerChars": 234, "exitCode": 0 }, { "fixtureId": "gmod.perf.localplayer-cache.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal ply = LocalPlayer()\nhook.Add(\"Think\", \"MyHook\", function()\n if not IsValid(ply) then return end\n -- use ply instead of LocalPlayer()\nend)\n```\n\nReason: LocalPlayer() does a global lookup and internal C++ call every time; caching it in a local variable avoids that overhead and is safe as long as you re-check validity when the player could have disconnected or changed.", "durationMs": 7308, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "7398105af47b079e", "usage": { "source": "provider", "promptTokens": 22740, "completionTokens": 74, "totalTokens": 22902, "reasoningTokens": 88, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:05.287Z", "completedAt": "2026-07-10T17:57:12.597Z", "answerBytes": 387, "answerChars": 387, "exitCode": 0 }, { "fixtureId": "gmod.perf.looking-at.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nfunction ArePlayersLookingAtEachOther(ply1, ply2, tolerance)\n tolerance = tolerance or 0.7 -- cos(~45°), adjust as needed\n local aim1 = ply1:GetAimVector()\n local aim2 = ply2:GetAimVector()\n local toTarget = (ply2:GetPos() - ply1:GetPos()):GetNormalized()\n return aim1:Dot(toTarget) > tolerance and aim2:Dot(-toTarget) > tolerance\nend\n```\n\nReason: Uses cheap dot products on normalized vectors instead of expensive angle calculations; `aim1:Dot(toTarget) > tolerance` checks if ply1 aims toward ply2 within the angular threshold, and the second check does the reverse for ply2.", "durationMs": 7211, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "20b22f678a4b08d7", "usage": { "source": "provider", "promptTokens": 22763, "completionTokens": 147, "totalTokens": 22992, "reasoningTokens": 82, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:05.595Z", "completedAt": "2026-07-10T17:57:12.807Z", "answerBytes": 600, "answerChars": 599, "exitCode": 0 }, { "fixtureId": "gmod.perf.meta-vs-arg.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nSomeHelper(ply)\n```\nReason: In LuaJIT (used by Garry's Mod), `SomeHelper(ply)` avoids the table lookup for the method on `ply` and compiles to a direct call; the `: ` sugar adds an extra `ply.SomeHelper` lookup that, while often inlined, is strictly more work. For a helper you control, the function form is marginally faster and clearer about ownership.", "durationMs": 10384, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "de332f7356830dfa", "usage": { "source": "provider", "promptTokens": 22751, "completionTokens": 66, "totalTokens": 23114, "reasoningTokens": 297, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:06.803Z", "completedAt": "2026-07-10T17:57:17.190Z", "answerBytes": 361, "answerChars": 361, "exitCode": 0 }, { "fixtureId": "gmod.perf.msg-vs-print.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nMsgN(\"debug: \", someVar)\n```\n\nReason: `MsgN` writes directly to the console without the formatting overhead, timestamp, and newline handling that `print` performs, making it significantly faster in hot paths.", "durationMs": 5750, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "6cbb4e4b2f19dd24", "usage": { "source": "provider", "promptTokens": 22749, "completionTokens": 32, "totalTokens": 22901, "reasoningTokens": 120, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:07.190Z", "completedAt": "2026-07-10T17:57:12.945Z", "answerBytes": 215, "answerChars": 215, "exitCode": 0 }, { "fixtureId": "gmod.perf.pairs-ipairs-for.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal t = {1, 2, 3, 4, 5}\nfor i = 1, #t do\n local v = t[i]\n -- use v\nend\n```\n\nReason: Numeric for avoids iterator function calls and LuaJIT compiles it to tight machine code; ipairs/pairs add iterator overhead and prevent some JIT optimizations.", "durationMs": 27556, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "de5e4875fcf3e600", "usage": { "source": "provider", "promptTokens": 22759, "completionTokens": 80, "totalTokens": 22965, "reasoningTokens": 126, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:07.609Z", "completedAt": "2026-07-10T17:57:35.168Z", "answerBytes": 258, "answerChars": 258, "exitCode": 0 }, { "fixtureId": "gmod.perf.plain-lua-vs-fn.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attemptIndex": 1, "status": "incorrect", "detail": "Matched an incorrect-answer pattern.", "finalResponse": "```lua\n-- DarkRP fn style (slower due to function call overhead)\nlocal result = fn.Compose{fn.Filter(function(x) return x > 5 end), fn.Map(function(x) return x * 2 end)}(data)\n\n-- Faster: single loop, no function calls\nlocal result = {}\nfor i = 1, #data do\n local v = data[i]\n if v > 5 then\n result[#result + 1] = v * 2\n end\nend\n```\n\nReason: Plain loops avoid function call overhead and closure allocations; LuaJIT compiles them to efficient bytecode while fn.Compose creates intermediate tables and invokes multiple functions per element.", "durationMs": 8503, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "ead0a98b3ff6a388", "usage": { "source": "provider", "promptTokens": 22765, "completionTokens": 105, "totalTokens": 23089, "reasoningTokens": 219, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:09.273Z", "completedAt": "2026-07-10T17:57:17.777Z", "answerBytes": 555, "answerChars": 555, "exitCode": 0 }, { "fixtureId": "gmod.perf.player-cache-hooks.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attemptIndex": 1, "status": "incorrect", "detail": "Did not match a fixture answer pattern.", "finalResponse": "```lua\nlocal cachedPlayers = {}\n\nhook.Add(\"PlayerInitialSpawn\", \"UpdatePlayerCache\", function(ply)\n table.insert(cachedPlayers, ply)\nend)\n\nhook.Add(\"PlayerDisconnected\", \"UpdatePlayerCache\", function(ply)\n for i, p in ipairs(cachedPlayers) do\n if p == ply then\n table.remove(cachedPlayers, i)\n break\n end\n end\nend)\n\nhook.Add(\"Think\", \"UseCachedPlayers\", function()\n for _, ply in ipairs(cachedPlayers) do\n -- your per-player logic here\n end\nend)\n```\n\nReason: Replaces O(n) `player.GetAll()` per tick with O(1) cached table iteration, updating only on join/leave events via `PlayerInitialSpawn` and `PlayerDisconnected` hooks.", "durationMs": 11257, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "a834817afe9e6c25", "usage": { "source": "provider", "promptTokens": 22764, "completionTokens": 166, "totalTokens": 23011, "reasoningTokens": 81, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:10.385Z", "completedAt": "2026-07-10T17:57:21.644Z", "answerBytes": 683, "answerChars": 683, "exitCode": 0 }, { "fixtureId": "gmod.perf.ply-table-index.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal playerData = {}\n\n-- Write\nplayerData[ply] = value\n\n-- Read (fastest)\nlocal value = playerData[ply]\n```\n\nReason: Direct table lookup with player entity as key avoids entity metatable overhead and is a single hash lookup. Local `playerData` reference eliminates global scope access.", "durationMs": 7188, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f18cc80df8999147", "usage": { "source": "provider", "promptTokens": 22742, "completionTokens": 51, "totalTokens": 23043, "reasoningTokens": 250, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:10.722Z", "completedAt": "2026-07-10T17:57:17.912Z", "answerBytes": 293, "answerChars": 293, "exitCode": 0 }, { "fixtureId": "gmod.perf.seq-tables.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 0 through 1 candidate loops.", "finalResponse": "```lua\n-- Sequential array (FAST)\nlocal arr = { \"a\", \"b\", \"c\", \"d\", \"e\" }\nfor i = 1, #arr do\n local v = arr[i]\nend\n\n-- String-keyed map (SLOW)\nlocal map = { a=1, b=2, c=3, d=4, e=5 }\nfor k, v in pairs(map) do\nend\n```\n\nReason: Sequential arrays use contiguous memory and optimize to tight C loops via LuaJIT's trace compiler; string-keyed maps require hash lookups and prevent JIT compilation of the iteration.", "durationMs": 7745, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "4778b0220c3f91a3", "usage": { "source": "provider", "promptTokens": 22753, "completionTokens": 119, "totalTokens": 23032, "reasoningTokens": 160, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:11.386Z", "completedAt": "2026-07-10T17:57:19.132Z", "answerBytes": 412, "answerChars": 412, "exitCode": 0 }, { "fixtureId": "gmod.perf.setdrawcolor-split.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nsurface.SetDrawColor(255, 0, 0, 255)\n```\nReason: Passing separate r,g,b,a arguments avoids allocating a Color table and the unpacking overhead inside SetDrawColor, saving ~15-20% in hot draw loops.", "durationMs": 5885, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "d110fde8a37bbe59", "usage": { "source": "provider", "promptTokens": 22752, "completionTokens": 62, "totalTokens": 22996, "reasoningTokens": 182, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:12.599Z", "completedAt": "2026-07-10T17:57:18.485Z", "answerBytes": 204, "answerChars": 204, "exitCode": 0 }, { "fixtureId": "gmod.perf.sqlite-vs-mysql.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- Using GMod's built-in sql library (SQLite)\nlocal result = sql.Query(\"SELECT * FROM player_data WHERE steamid = \" .. sql.SQLStr(steamid))\n```\n\nReason: Local SQLite via GMod's sql library eliminates network round-trips and connection overhead, making reads/writes significantly faster than remote MySQL for a single-server setup.", "durationMs": 7110, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "4a3f5d2a20d71ac9", "usage": { "source": "provider", "promptTokens": 22774, "completionTokens": 51, "totalTokens": 23030, "reasoningTokens": 205, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:12.801Z", "completedAt": "2026-07-10T17:57:19.914Z", "answerBytes": 337, "answerChars": 337, "exitCode": 0 }, { "fixtureId": "gmod.perf.steamid-cache.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal steamIDCache = {}\n\nlocal function GetCachedSteamID(ply)\n local idx = ply:EntIndex()\n local cached = steamIDCache[idx]\n if cached then return cached end\n local sid = ply:SteamID()\n steamIDCache[idx] = sid\n return sid\nend\n\nhook.Add(\"EntityRemoved\", \"ClearSteamIDCache\", function(ent)\n if ent:IsPlayer() then\n steamIDCache[ent:EntIndex()] = nil\n end\nend)\n```\n\nReason: Caches SteamID by entity index (stable per session), clears on player disconnect, avoids repeated C++ bridge calls.", "durationMs": 7126, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "e8a94aa454154982", "usage": { "source": "provider", "promptTokens": 22746, "completionTokens": 136, "totalTokens": 22951, "reasoningTokens": 69, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:12.809Z", "completedAt": "2026-07-10T17:57:19.936Z", "answerBytes": 524, "answerChars": 524, "exitCode": 0 }, { "fixtureId": "gmod.perf.string-table-concat.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 0 through 0 candidate loops.", "finalResponse": "```lua\nlocal pieces = {}\n\nfor i = 1, 10000 do\n pieces[i] = \"piece \" .. i .. \"\\n\"\nend\n\nlocal result = table.concat(pieces)\n```\n\nReason: Repeated `..` concatenation creates a new string allocation each iteration (O(n²)), while `table.concat` collects references and does one allocation (O(n)).", "durationMs": 10743, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "b0cf9e04ae7c5dd9", "usage": { "source": "provider", "promptTokens": 22740, "completionTokens": 60, "totalTokens": 22933, "reasoningTokens": 133, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:12.946Z", "completedAt": "2026-07-10T17:57:23.691Z", "answerBytes": 295, "answerChars": 294, "exitCode": 0 }, { "fixtureId": "gmod.perf.surface-drawrect.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nsurface.SetDrawColor(r, g, b, a)\nsurface.DrawRect(x, y, w, h)\n```\n\nReason: `surface.DrawRect` bypasses the rounding logic entirely, avoiding the internal corner-table allocation and vertex buffering that `draw.RoundedBox` performs even at radius 0. It maps directly to the render library's immediate-mode quad path.", "durationMs": 5921, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "696e8de769d9ad0e", "usage": { "source": "provider", "promptTokens": 22751, "completionTokens": 59, "totalTokens": 22941, "reasoningTokens": 131, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:14.942Z", "completedAt": "2026-07-10T17:57:20.865Z", "answerBytes": 322, "answerChars": 322, "exitCode": 0 }, { "fixtureId": "gmod.perf.surface-text.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attemptIndex": 1, "status": "incorrect", "detail": "Matched an incorrect-answer pattern.", "finalResponse": "```lua\n-- Fastest: surface.DrawText with font set ONCE outside the hook\nlocal font = \"DermaDefault\"\nlocal text = \"Your string here\"\nlocal x, y = 100, 100\n\nsurface.CreateFont(\"MyCachedFont\", { font = \"Roboto\", size = 16, weight = 500 })\n\nhook.Add(\"HUDPaint\", \"FastTextDraw\", function()\n surface.SetFont(\"MyCachedFont\")\n surface.SetTextPos(x, y)\n surface.SetTextColor(255, 255, 255, 255)\n surface.DrawText(text)\nend)\n\n-- If outline needed, draw.SimpleTextOutlined is faster than draw.DrawText\nhook.Add(\"HUDPaint\", \"FastOutlinedText\", function()\n draw.SimpleTextOutlined(text, \"MyCachedFont\", x, y, color_white, TEXT_ALIGN_LEFT, TEXT_ALIGN_TOP, 1, color_black)\nend)\n```\n\nReason: `surface.DrawText` avoids draw library overhead (alignment calc, wrapping, color table allocation). `draw.SimpleTextOutlined` is the fastest draw.* helper because it skips text wrapping and alignment logic that `draw.DrawText` performs every frame. Cache the font with `surface.CreateFont` once, never in the hook.", "durationMs": 21460, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "95d9fe4918ee4197", "usage": { "source": "provider", "promptTokens": 22750, "completionTokens": 241, "totalTokens": 23283, "reasoningTokens": 292, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:15.054Z", "completedAt": "2026-07-10T17:57:36.516Z", "answerBytes": 1005, "answerChars": 1005, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-count-hash.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n#myTable\n```\n\nReason: In Lua (including Garry's Mod), the `#` operator returns the length of a sequential array-like table (a sequence). It works on tables with consecutive integer keys starting from 1.", "durationMs": 5557, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3e9bbfc8452e05e3", "usage": { "source": "provider", "promptTokens": 22738, "completionTokens": 38, "totalTokens": 22859, "reasoningTokens": 83, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:17.191Z", "completedAt": "2026-07-10T17:57:22.749Z", "answerBytes": 209, "answerChars": 209, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-empty.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nt = {}\n```\n\nReason: `t = {}` is O(1) — it allocates a new empty table and lets the old one be garbage collected. `table.Empty(t)` is O(n) — it must iterate and nil out every element individually.", "durationMs": 7936, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3a6344977f5bd475", "usage": { "source": "provider", "promptTokens": 22747, "completionTokens": 42, "totalTokens": 23070, "reasoningTokens": 281, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:17.780Z", "completedAt": "2026-07-10T17:57:25.718Z", "answerBytes": 206, "answerChars": 202, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-hasvalue.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attemptIndex": 1, "status": "incorrect", "detail": "Matched an incorrect-answer pattern.", "finalResponse": "```lua\n-- Slow: O(n) linear search\nlocal list = { \"a\", \"b\", \"c\", \"d\" }\nlocal hasValue = table.HasValue(list, \"c\")\n\n-- Fast: O(1) hash lookup\nlocal set = { a = true, b = true, c = true, d = true }\nlocal hasValue = set[\"c\"] ~= nil\n```\n\nReason: `table.HasValue` iterates the entire array (O(n)), while a hash-set lookup uses the key directly (O(1)).", "durationMs": 8463, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "7d064428a873fdfc", "usage": { "source": "provider", "promptTokens": 22745, "completionTokens": 111, "totalTokens": 22953, "reasoningTokens": 97, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:17.914Z", "completedAt": "2026-07-10T17:57:26.379Z", "answerBytes": 346, "answerChars": 346, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-literal.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- Faster: table constructor with known fields\nlocal t = { field1 = \"value1\", field2 = \"value2\", field3 = \"value3\" }\n\n-- Slower: assign after empty table\nlocal t = {}\nt.field1 = \"value1\"\nt.field2 = \"value2\"\nt.field3 = \"value3\"\n```\n\nReason: Table constructors pre-allocate the hash part with exact capacity, avoiding rehashing and multiple allocations.", "durationMs": 5763, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f95a8fc610d720ad", "usage": { "source": "provider", "promptTokens": 22746, "completionTokens": 70, "totalTokens": 22976, "reasoningTokens": 160, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:18.157Z", "completedAt": "2026-07-10T17:57:23.922Z", "answerBytes": 358, "answerChars": 358, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-random.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal tbl = { \"a\", \"b\", \"c\", \"d\", \"e\" }\nlocal randomElement = tbl[math.random(#tbl)]\n```\n\nReason: `table.Random` iterates the entire table (O(n)), while direct index access with `math.random(#tbl)` is O(1) for sequential tables.", "durationMs": 18287, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f3e090701953d4a9", "usage": { "source": "provider", "promptTokens": 22736, "completionTokens": 56, "totalTokens": 22917, "reasoningTokens": 125, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:18.487Z", "completedAt": "2026-07-10T17:57:36.777Z", "answerBytes": 235, "answerChars": 235, "exitCode": 0 }, { "fixtureId": "gmod.perf.x-times-x.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal x2 = x * x\n```\n\nReason: Multiplication (`x * x`) is faster than exponentiation (`x ^ 2` or `math.pow(x, 2)`) because it avoids function call overhead and the more complex exponentiation bytecode path. In tight loops, this micro-optimization matters.", "durationMs": 6323, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "79d48008f6b5174f", "usage": { "source": "provider", "promptTokens": 22739, "completionTokens": 59, "totalTokens": 22920, "reasoningTokens": 122, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:19.134Z", "completedAt": "2026-07-10T17:57:25.459Z", "answerBytes": 262, "answerChars": 262, "exitCode": 0 }, { "fixtureId": "gmod.player-iterator.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attemptIndex": 1, "status": "pass", "detail": "Uses player.Iterator() (wiki-recommended Lua-cached iterator).", "finalResponse": "```lua\nfor _, ply in player.Iterator() do\n -- ply is each connected player\nend\n```\n\nReason: `player.Iterator()` is the modern, idiomatic way to iterate players in Garry's Mod — it avoids creating a temporary table and works directly with the engine's internal player list.", "durationMs": 11312, "version": "1.15.9", "fixtureVersion": 2, "rubricVersion": "4", "promptHash": "fe3d7469535a0ca2", "usage": { "source": "provider", "promptTokens": 22751, "completionTokens": 50, "totalTokens": 22997, "reasoningTokens": 196, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:19.915Z", "completedAt": "2026-07-10T17:57:31.231Z", "answerBytes": 277, "answerChars": 275, "exitCode": 0 }, { "fixtureId": "gmod.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal physIterator = ents.Iterator('prop_physics')\nfor ent in physIterator:Next() do\n -- Your code here\nend\n```\n\nReason: The `ents.Iterator()` method directly iterates over prop_physics entities without building a complete table of all entities in the map.", "durationMs": 12147, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "3990c92253db85bb", "usage": { "source": "provider", "promptTokens": 20294, "completionTokens": 0, "totalTokens": 20805, "reasoningTokens": 524, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:19.938Z", "completedAt": "2026-07-10T17:57:32.088Z", "answerBytes": 266, "answerChars": 266, "exitCode": 0 }, { "fixtureId": "gmod.hook-add.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attemptIndex": 1, "status": "pass", "detail": "Registers a named hook with hook.Add.", "finalResponse": "```lua\nhook.Add(\"Think\", \"MyAddon.Think\", function()\nend)\n```\n\nReason: This registers the MyAddon.Think callback to execute on every game tick Think hook.", "durationMs": 6027, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "12d2222fdb7d6b90", "usage": { "source": "provider", "promptTokens": 20292, "completionTokens": 15, "totalTokens": 20492, "reasoningTokens": 185, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:20.867Z", "completedAt": "2026-07-10T17:57:26.895Z", "answerBytes": 154, "answerChars": 154, "exitCode": 0 }, { "fixtureId": "gmod.isvalid.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attemptIndex": 1, "status": "pass", "detail": "Uses IsValid for entity/object validity.", "finalResponse": "```lua\nif ent and ent:IsValid() then\n -- Use ent\nend\n```\nReason: In Garry's Mod Lua, entities can become invalid when removed, so checking both existence and IsValid() prevents errors from using stale references.", "durationMs": 10491, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "35527312e59dfc13", "usage": { "source": "provider", "promptTokens": 20288, "completionTokens": 31, "totalTokens": 20565, "reasoningTokens": 246, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:21.646Z", "completedAt": "2026-07-10T17:57:32.138Z", "answerBytes": 215, "answerChars": 215, "exitCode": 0 }, { "fixtureId": "gmod.net-receivers.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nnet.Receive(\"MyAddon.Sync\", function()\n -- Your message handling logic here\nend)\n```\n\nReason: This properly registers a net message handler for incoming \"MyAddon.Sync\" messages in Garry's Mod Lua using the net.Receive function.", "durationMs": 6150, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "24d54ee8366753a6", "usage": { "source": "provider", "promptTokens": 20284, "completionTokens": 13, "totalTokens": 20521, "reasoningTokens": 224, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:22.751Z", "completedAt": "2026-07-10T17:57:28.902Z", "answerBytes": 237, "answerChars": 237, "exitCode": 0 }, { "fixtureId": "gmod.perf.angle-zero.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nlocal zeroAngle = Angle()\n\nlocal function getFreshZeroedAngle()\n zeroAngle:Set(0, 0, 0)\n return zeroAngle\nend\n```\n\nReason: Reusing a pre-allocated Angle object and resetting it via Set() avoids the garbage collection overhead of creating Angle() instances in tight loops.", "durationMs": 11001, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f6bc97bf98280d62", "usage": { "source": "provider", "promptTokens": 20292, "completionTokens": 0, "totalTokens": 20872, "reasoningTokens": 631, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:23.692Z", "completedAt": "2026-07-10T17:57:34.695Z", "answerBytes": 284, "answerChars": 284, "exitCode": 0 }, { "fixtureId": "gmod.perf.config-var.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- Flat local variable approach (preferred for frequently accessed settings)\nlocal addon_color_red = 255\nlocal addon_color_green = 0\nlocal addon_color_blue = 0\n\nlocal r = addon_color_red\n```\n\nReason: Flat variables have minimal memory overhead and LuaJIT optimizes direct table access, while nested tables add unnecessary nested lookup complexity that can marginally reduce performance for frequently accessed configuration values.", "durationMs": 14720, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "bcc4ff8eb162b699", "usage": { "source": "provider", "promptTokens": 20294, "completionTokens": 0, "totalTokens": 20797, "reasoningTokens": 539, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:23.923Z", "completedAt": "2026-07-10T17:57:38.645Z", "answerBytes": 438, "answerChars": 438, "exitCode": 0 }, { "fixtureId": "gmod.perf.darkrpvar.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal jobName = ply:GetDarkRPVar(\"job\") -- More reliable and recommended API\n```\n\nReason: `ply:GetDarkRPVar(\"job\")` is the preferred DarkRP API that provides better abstraction, handles job index conversion internally, and integrates with DarkRP's job management system more cleanly than directly accessing `GetNWString(\"job\")`.", "durationMs": 13634, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "02a37daa699cded3", "usage": { "source": "provider", "promptTokens": 20295, "completionTokens": 40, "totalTokens": 20806, "reasoningTokens": 471, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:25.461Z", "completedAt": "2026-07-10T17:57:39.097Z", "answerBytes": 336, "answerChars": 336, "exitCode": 0 }, { "fixtureId": "gmod.perf.disttosqr.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attemptIndex": 1, "status": "incorrect", "detail": "Did not match a fixture answer pattern.", "finalResponse": "```lua\n-- Preferred method: Compare squared distance instead of actual distance\nlocal distanceSquared = (self - other):LengthSqr()\nlocal thresholdSquared = threshold * threshold\n\nif distanceSquared <= thresholdSquared then\n -- Vectors are within threshold\nend\n```\n\nReason: This avoids the expensive square root calculation by comparing squared distances, which is mathematically equivalent but more efficient.", "durationMs": 7504, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "a5772470c6859cdc", "usage": { "source": "provider", "promptTokens": 20290, "completionTokens": 27, "totalTokens": 20583, "reasoningTokens": 266, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:25.719Z", "completedAt": "2026-07-10T17:57:33.225Z", "answerBytes": 412, "answerChars": 412, "exitCode": 0 }, { "fixtureId": "gmod.perf.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must use a lua code fence.", "finalResponse": "```\nfor _, ent in ipairs(ents.GetAll()) do\n -- Do something with each entity\nend\n```\n\nReason: The official Garry's Mod Lua wiki recommends using `ents.GetAll()` for iterating through all entities as it's the most straightforward and widely-used method, providing direct access to the entire entity list while remaining simple and readable.", "durationMs": 7954, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "306d3f1d05f28246", "usage": { "source": "provider", "promptTokens": 20288, "completionTokens": 39, "totalTokens": 20629, "reasoningTokens": 302, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:26.381Z", "completedAt": "2026-07-10T17:57:34.336Z", "answerBytes": 340, "answerChars": 340, "exitCode": 0 }, { "fixtureId": "gmod.perf.find-ents-near.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nlocal ents = player:FindInSphere(player:GetPos(), 1024)\n```\n\nReason: `FindInSphere` is consistently one of the fastest built-in FindIn* methods in Garry's Mod benchmarks, offering optimal performance for radius-based proximity queries while avoiding the overhead of FindInPVS's vis-leaf calculations.", "durationMs": 8846, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "07c583fc3d9fe09f", "usage": { "source": "provider", "promptTokens": 20309, "completionTokens": 19, "totalTokens": 20630, "reasoningTokens": 302, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:26.897Z", "completedAt": "2026-07-10T17:57:35.745Z", "answerBytes": 307, "answerChars": 307, "exitCode": 0 }, { "fixtureId": "gmod.perf.find-players-near.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attemptIndex": 1, "status": "incorrect", "detail": "Did not match a fixture answer pattern.", "finalResponse": "```lua\nlocal function findPlayersInSphere(pos, radius)\n local nearby = {}\n local playerEnts = ents.FindByClass(\"player\")\n local minDistSq = radius * radius\n\n for i = 1, #playerEnts do\n local ply = playerEnts[i]\n local delta = ply:GetPos() - pos\n local distSq = delta.x * delta.x + delta.y * delta.y + delta.z * delta.z\n\n if distSq <= minDistSq then\n nearby[#nearby + 1] = ply\n end\n end\n\n return nearby\nend\n```\n\nReason: The optimized approach uses direct vector math and avoids the inefficient filtering of `ents.FindInSphere`'s complete results, reducing both memory allocation and processing overhead by only checking players that exist in the sphere.", "durationMs": 22989, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "d139ba2e8ee38a2f", "usage": { "source": "provider", "promptTokens": 20301, "completionTokens": 78, "totalTokens": 20939, "reasoningTokens": 560, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:28.905Z", "completedAt": "2026-07-10T17:57:51.899Z", "answerBytes": 716, "answerChars": 716, "exitCode": 0 }, { "fixtureId": "gmod.perf.for-vs-while.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 1 through 1 candidate loops.", "finalResponse": "```lua\n-- For loop (generally faster in Garry's Mod)\nfor i = 1, n do\n print(i)\nend\n\n-- While loop (generally slower in Garry's Mod) \nlocal i = 1\nwhile i <= n do\n print(i)\n i = i + 1\nend\n```\n\nReason: For loops are optimized in Garry's Mod's Lua VM, reducing bytecode instruction overhead compared to while loops which require more frequent condition checks.", "durationMs": 9174, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "b3401a190a8aecf0", "usage": { "source": "provider", "promptTokens": 20291, "completionTokens": 63, "totalTokens": 20612, "reasoningTokens": 258, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:31.232Z", "completedAt": "2026-07-10T17:57:40.408Z", "answerBytes": 366, "answerChars": 366, "exitCode": 0 }, { "fixtureId": "gmod.perf.hook-once.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- Faster: Single hook.Run call with all players\nlocal allPlayers = player.GetAll()\nhook.Run(\"PlayerTick\", allPlayers)\n\n-- Slower: Individual hook.Run per player\nfor _, ply in ipairs(player.GetAll()) do\n hook.Run(\"PlayerTick\", ply)\nend\n```\n\nReason: The single batch call with all players reduces function call overhead and memory allocation churn, making it faster than calling hook.Run once per player.", "durationMs": 13110, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "ed1d3e09249fc8bb", "usage": { "source": "provider", "promptTokens": 20300, "completionTokens": 40, "totalTokens": 20596, "reasoningTokens": 256, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:32.090Z", "completedAt": "2026-07-10T17:57:45.202Z", "answerBytes": 413, "answerChars": 413, "exitCode": 0 }, { "fixtureId": "gmod.perf.hudpaint-cache.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must use a lua code fence.", "finalResponse": "```\nlocal player = LocalPlayer()\nlocal health = player:Health()\n\ndraw.DrawText(\"HP: \" .. health, 10, 10, Color(255, 255, 255, 255), 0)\ndraw.DrawText(\"Health: \" .. health, 10, 30, Color(255, 255, 255, 255), 0)\ndraw.DrawText(string.format(\"Current Health: %d\", health), 10, 50, Color(255, 255, 255, 255), 0)\n```\n\nReason: Stored player and health in locals to avoid repeated method calls and improve performance.", "durationMs": 13287, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3def450f3158ceff", "usage": { "source": "provider", "promptTokens": 20295, "completionTokens": 96, "totalTokens": 20632, "reasoningTokens": 241, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:32.141Z", "completedAt": "2026-07-10T17:57:45.430Z", "answerBytes": 409, "answerChars": 409, "exitCode": 0 }, { "fixtureId": "gmod.perf.local-color.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal white = Color(255, 255, 255)\nsurface.SetDrawColor(white)\n```\n\nReason: Creating the color once outside the loop avoids repeated object allocation.", "durationMs": 5955, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "16a7bed1b931d467", "usage": { "source": "provider", "promptTokens": 20284, "completionTokens": 2, "totalTokens": 20536, "reasoningTokens": 250, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:33.226Z", "completedAt": "2026-07-10T17:57:39.183Z", "answerBytes": 158, "answerChars": 158, "exitCode": 0 }, { "fixtureId": "gmod.perf.local-vs-global.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal sin = math.sin\nfor i = 1, 1000000 do\n _ = sin(i)\nend\n```\n\nReason: Reduce repeated global variable lookups by caching the function reference in a local variable.", "durationMs": 5928, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "c116d8c651190647", "usage": { "source": "provider", "promptTokens": 20285, "completionTokens": 10, "totalTokens": 20486, "reasoningTokens": 191, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:34.338Z", "completedAt": "2026-07-10T17:57:40.268Z", "answerBytes": 176, "answerChars": 176, "exitCode": 0 }, { "fixtureId": "gmod.perf.localplayer-cache.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal localPlayer = LocalPlayer()\n\n-- Use the cached reference instead of calling LocalPlayer() every time\nif localPlayer:Alive() then\n local pos = localPlayer:GetPos()\n print(\"Player position:\", pos.x, pos.y, pos.z)\nend\n```\n\nReason: Caching LocalPlayer() in a local variable eliminates repeated function lookups.", "durationMs": 7588, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "7398105af47b079e", "usage": { "source": "provider", "promptTokens": 20287, "completionTokens": 33, "totalTokens": 20567, "reasoningTokens": 247, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:34.697Z", "completedAt": "2026-07-10T17:57:42.287Z", "answerBytes": 326, "answerChars": 326, "exitCode": 0 }, { "fixtureId": "gmod.perf.looking-at.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 1 through 1 non-empty reason lines.", "finalResponse": "```lua\nlocal function are_players_looking_at_each_other(lp, other)\n local lp_vec = lp:GetAimVector()\n local other_vec = other:GetAimVector()\n \n local lp_to_other = (other:GetPos() - lp:GetPos()):GetNormalized()\n local other_to_lp = (lp:GetPos() - other:GetPos()):GetNormalized()\n \n local threshold = 0.3\n \n local looking_towards = lp_vec:Dot(lp_to_other) > threshold\n local other_looking_back = other_vec:Dot(other_to_lp) > threshold\n \n return looking_towards and other_looking_back\nend\n```\n\nReason: Using dot product with normalized direction vectors is cheaper than math.acos(angle_between) for checking rough alignment of aim directions.```lua\nlocal function are_players_looking_at_each_other(lp, other)\n local lp_vec = lp:GetAimVector()\n local other_vec = other:GetAimVector()\n \n local lp_to_other = (other:GetPos() - lp:GetPos()):GetNormalized()\n local other_to_lp = (lp:GetPos() - other:GetPos()):GetNormalized()\n \n local threshold = 0.3\n \n local looking_towards = lp_vec:Dot(lp_to_other) > threshold\n local other_looking_back = other_vec:Dot(other_to_lp) > threshold\n \n return looking_towards and other_looking_back\nend\n```\n\nReason: Using dot product with normalized direction vectors is cheaper than math.acos(angle_between) for checking rough alignment of aim directions.", "durationMs": 9086, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "20b22f678a4b08d7", "usage": { "source": "provider", "promptTokens": 20310, "completionTokens": 237, "totalTokens": 21101, "reasoningTokens": 554, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:35.171Z", "completedAt": "2026-07-10T17:57:44.262Z", "answerBytes": 1352, "answerChars": 1352, "exitCode": 0 }, { "fixtureId": "gmod.perf.meta-vs-arg.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attemptIndex": 1, "status": "incorrect", "detail": "Matched an incorrect-answer pattern.", "finalResponse": "```lua\nply:SomeHelper()\n```\n\nReason: Both styles have identical performance as they're syntactic sugar in Lua; use the method syntax (`ply:SomeHelper()`) for better readability and to match how helper functions are typically defined.", "durationMs": 7645, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "de332f7356830dfa", "usage": { "source": "provider", "promptTokens": 20293, "completionTokens": 0, "totalTokens": 20825, "reasoningTokens": 553, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:35.747Z", "completedAt": "2026-07-10T17:57:43.395Z", "answerBytes": 233, "answerChars": 233, "exitCode": 0 }, { "fixtureId": "gmod.perf.msg-vs-print.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 0 through 0 candidate loops.", "finalResponse": "```lua\nlocal debug = {}\n\nfunction debug.msg(msg)\n Msg(msg)\nend\n\nfunction debug.buffer()\n local buffer = {}\n function debug.buffer.add(msg)\n buffer[#buffer + 1] = msg\n end\n function debug.buffer.flush()\n for i, msg in ipairs(buffer) do\n Msg(msg)\n end\n buffer = {}\n end\n return debug.buffer\nend\n```\n\nReason: Msg is faster than print in Garry's Mod as it doesn't process colors or formatting, and buffering reduces the number of write operations.", "durationMs": 5946, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "6cbb4e4b2f19dd24", "usage": { "source": "provider", "promptTokens": 20290, "completionTokens": 100, "totalTokens": 20584, "reasoningTokens": 194, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:36.518Z", "completedAt": "2026-07-10T17:57:42.467Z", "answerBytes": 503, "answerChars": 503, "exitCode": 0 }, { "fixtureId": "gmod.perf.pairs-ipairs-for.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 1 through 1 candidate loops.", "finalResponse": "```lua\n-- Using ipairs\nlocal start = SysTime()\nfor i, v in ipairs(t) do\n local _ = v\nend\nlocal ipairs_time = SysTime() - start\n\n-- Using pairs (slowest)\nlocal start = SysTime()\nfor i, v in pairs(t) do\n local _ = v\nend\nlocal pairs_time = SysTime() - start\n\n-- Using numeric for (fastest)\nlocal start = SysTime()\nfor i = 1, #t do\n local _ = t[i]\nend\nlocal numeric_time = SysTime() - start\n```\n\nReason: Numeric for loop is fastest for sequential tables, followed by ipairs, with pairs being slowest due to key checking overhead.", "durationMs": 20548, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "de5e4875fcf3e600", "usage": { "source": "provider", "promptTokens": 20302, "completionTokens": 123, "totalTokens": 20667, "reasoningTokens": 242, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:36.779Z", "completedAt": "2026-07-10T17:57:57.331Z", "answerBytes": 534, "answerChars": 534, "exitCode": 0 }, { "fixtureId": "gmod.perf.plain-lua-vs-fn.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must use a lua code fence.", "finalResponse": "```\n-- Fast list transforms using native Lua patterns\n\n-- Filter operation using array loop and table.insert for speed\nlocal function filter_fast(pred, tbl)\n local result = {}\n for i = 1, #tbl do\n if pred(tbl[i]) then\n result[#result + 1] = tbl[i]\n end\n end\n return result\nend\n\n-- Map operation using direct array iteration\nlocal function map_fast(func, tbl)\n local result = {}\n for i = 1, #tbl do\n result[i] = func(tbl[i])\n end\n return result\nend\n\n-- Chain operation without creating intermediate tables\nlocal function each_fast(func, tbl, ...)\n for i = 1, #tbl do\n func(tbl[i], ...)\n end\nend\n\n-- Example: Process weapons with chain of filters and maps\nfunction process_weapons_fast(weapons)\n local common_weapons = filter_fast(function(w) return w.common == true end, weapons)\n local named_weapons = map_fast(function(w) return w.name or \"Unknown\" end, common_weapons)\n \n local output = {}\n each_fast(function(name, arr) arr[#arr + 1] = name end, named_weapons, output)\n return output\nend\n```\n\nReason: Native Lua array iteration with manual table construction avoids fn combinator overhead and improves performance.", "durationMs": 23871, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "ead0a98b3ff6a388", "usage": { "source": "provider", "promptTokens": 20311, "completionTokens": 219, "totalTokens": 20854, "reasoningTokens": 324, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:38.646Z", "completedAt": "2026-07-10T17:58:02.520Z", "answerBytes": 1204, "answerChars": 1204, "exitCode": 0 }, { "fixtureId": "gmod.perf.player-cache-hooks.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal cachedPlayers = {}\n\nfunction RefreshPlayerCache()\n cachedPlayers = {}\n for _, ply in ipairs(player.GetAll()) do\n cachedPlayers[ply:SteamID()] = ply\n end\nend\n\nfunction InitializePlayerCache()\n RefreshPlayerCache()\nend\n\nhook.Add(\"Initialize\", \"PlayerCache_Init\", InitializePlayerCache)\nhook.Add(\"PlayerSpawned\", \"PlayerCache_Refresh\", RefreshPlayerCache)\nhook.Add(\"PlayerDisconnected\", \"PlayerCache_Refresh\", RefreshPlayerCache)\n\nfunction Think_UseCachedPlayers()\n for _, ply in pairs(cachedPlayers) do\n if not ply or not ply:IsValid() then\n RefreshPlayerCache()\n return\n end\n end\nend\n\nhook.Add(\"Think\", \"Think_UseCachedPlayers\", Think_UseCachedPlayers)\n```\n\nReason: This caches all players once and only refreshes when join/disconnect events occur, eliminating the O(n) iteration of `player.GetAll()` on every tick.", "durationMs": 26797, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "a834817afe9e6c25", "usage": { "source": "provider", "promptTokens": 20305, "completionTokens": 60, "totalTokens": 21103, "reasoningTokens": 738, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:38.915Z", "completedAt": "2026-07-10T17:58:05.713Z", "answerBytes": 888, "answerChars": 888, "exitCode": 0 }, { "fixtureId": "gmod.perf.ply-table-index.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal PlayerData = {}\nlocal PlayerData_mt = {\n __index = function(t, k)\n return t[k]\n end,\n __newindex = function(t, k, v)\n t[k] = v\n end\n}\n\nfunction GetPlayerData(ply)\n local pid = ply:UserID()\n if not PlayerData[pid] then\n PlayerData[pid] = {}\n setmetatable(PlayerData[pid], PlayerData_mt)\n end\n return PlayerData[pid]\nend\n\nfunction ReadField(ply, field)\n return GetPlayerData(ply)[field]\nend\n\nfunction WriteField(ply, field, value)\n GetPlayerData(ply)[field] = value\nend\n```\n\nReason: Uses a single lookup-based global table with SteamID(UserID) as key, avoiding per-instance property access overhead and leveraging Lua's optimized dictionary lookup for faster reads.", "durationMs": 10597, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f18cc80df8999147", "usage": { "source": "provider", "promptTokens": 20295, "completionTokens": 49, "totalTokens": 21059, "reasoningTokens": 715, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:39.098Z", "completedAt": "2026-07-10T17:57:49.697Z", "answerBytes": 734, "answerChars": 734, "exitCode": 0 }, { "fixtureId": "gmod.perf.seq-tables.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 0 through 1 candidate loops.", "finalResponse": "```lua\n-- Sequential array - faster iteration\nitems = {\"apple\", \"banana\", \"cherry\"}\nfor i, item in ipairs(items) do\n print(item)\nend\n\n-- Map with string keys - slower iteration\nitems = {fruit1 = \"apple\", fruit2 = \"banana\", fruit3 = \"cherry\"}\nfor _, item in pairs(items) do\n print(item)\nend\n```\n\nReason: Arrays use contiguous memory and direct index access which is faster than hash table lookups required for map iteration.", "durationMs": 6105, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "4778b0220c3f91a3", "usage": { "source": "provider", "promptTokens": 20293, "completionTokens": 70, "totalTokens": 20657, "reasoningTokens": 294, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:39.184Z", "completedAt": "2026-07-10T17:57:45.292Z", "answerBytes": 429, "answerChars": 429, "exitCode": 0 }, { "fixtureId": "gmod.perf.setdrawcolor-split.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nsurface.SetDrawColor(255, 0, 0, 255)\n```\n\nReason: Passing separate r,g,b values avoids creating a Color object, reducing garbage collection overhead and being more efficient for frequent draw calls.", "durationMs": 5850, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "d110fde8a37bbe59", "usage": { "source": "provider", "promptTokens": 20296, "completionTokens": 30, "totalTokens": 20586, "reasoningTokens": 260, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:40.270Z", "completedAt": "2026-07-10T17:57:46.122Z", "answerBytes": 205, "answerChars": 205, "exitCode": 0 }, { "fixtureId": "gmod.perf.sqlite-vs-mysql.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attemptIndex": 1, "status": "incorrect", "detail": "Did not match a fixture answer pattern.", "finalResponse": "```lua\nlocal SQL = require(\"sql\")\n\nlocal db = SQL.Connect(\"player_data.db\")\ndb:Execute(\"CREATE TABLE IF NOT EXISTS players (steamid TEXT PRIMARY KEY, points INTEGER)\")\n\n-- Store player score\ndb:Execute(\"INSERT INTO players (steamid, points) VALUES ('12345', 100) ON CONFLICT(steamid) DO UPDATE SET points = excluded.points\")\n\n-- Retrieve player score\nlocal result = db:Query(\"SELECT points FROM players WHERE steamid = '12345'\")\nlocal points = result:GetData(0, \"points\")\n```\n\nReason: SQLite is local file-based, eliminating network I/O overhead, making it faster for single-server storage", "durationMs": 7030, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "4a3f5d2a20d71ac9", "usage": { "source": "provider", "promptTokens": 20312, "completionTokens": 91, "totalTokens": 20680, "reasoningTokens": 277, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:40.411Z", "completedAt": "2026-07-10T17:57:47.445Z", "answerBytes": 589, "answerChars": 589, "exitCode": 0 }, { "fixtureId": "gmod.perf.steamid-cache.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nlocal steamid_cache = {}\nfor _, ply in ipairs(entities) do\n local sid = steamid_cache[ply:EntIndex()]\n if not sid then\n sid = ply:SteamID()\n steamid_cache[ply:EntIndex()] = sid\n end\n -- Use the cached value\nend\n```\n\nReason: Caching SteamID values eliminates redundant Player:SteamID() calls, providing O(1) lookup instead of O(n) repeated method calls.", "durationMs": 17550, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "e8a94aa454154982", "usage": { "source": "provider", "promptTokens": 20292, "completionTokens": 52, "totalTokens": 20841, "reasoningTokens": 497, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:42.227Z", "completedAt": "2026-07-10T17:57:59.780Z", "answerBytes": 385, "answerChars": 385, "exitCode": 0 }, { "fixtureId": "gmod.perf.string-table-concat.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 0 through 0 candidate loops.", "finalResponse": "```lua\n-- Method 1: Repeated concatenation (SLOWER)\nlocal total = 0\nlocal str = \"\"\nfor i = 1, 10000 do\n str = str .. \" piece \" .. i\n total = total + i\nend\n\n-- Method 2: String table + join (FASTER)\nlocal total2 = 0\nlocal pieces = {}\nfor i = 1, 10000 do\n table.insert(pieces, \" piece \" .. i)\n total2 = total2 + i\nend\nlocal str2 = table.concat(pieces)\n```\n\nReason: Table-based string joining reduces allocation overhead", "durationMs": 5497, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "b0cf9e04ae7c5dd9", "usage": { "source": "provider", "promptTokens": 20289, "completionTokens": 108, "totalTokens": 20600, "reasoningTokens": 203, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:42.289Z", "completedAt": "2026-07-10T17:57:47.788Z", "answerBytes": 429, "answerChars": 429, "exitCode": 0 }, { "fixtureId": "gmod.perf.surface-drawrect.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 0 through 0 candidate loops.", "finalResponse": "```lua\nlocal rectCache = {}\nlocal rectSize = { width = ScrW(), height = ScrH() }\n\nfor i = 1, #rectCache do\n local rect = rectCache[i]\n draw.Color(rect.color.r, rect.color.g, rect.color.b, rect.alpha)\n draw.Rect(rect.x, rect.y, rect.w, rect.h)\nend\n```\n\nReason: draw.Rect is more efficient than draw.RoundedBox(0, ...) for rectangles without rounded corners and avoids repeated polygon calculations.", "durationMs": 6065, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "696e8de769d9ad0e", "usage": { "source": "provider", "promptTokens": 20291, "completionTokens": 63, "totalTokens": 20628, "reasoningTokens": 274, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:42.469Z", "completedAt": "2026-07-10T17:57:48.535Z", "answerBytes": 406, "answerChars": 406, "exitCode": 0 }, { "fixtureId": "gmod.perf.surface-text.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nlocal font = surface.CreateFont(\"DefaultBold\", {font = \"Arial\", size = 20, weight = 700, antialias = true})\nlocal x, y = 100, 100\n\ndraw.DrawText(\"Hello, World!\", \"DefaultBold\", Color(255, 255, 255, 255), x, y)\n```\n\nReason: `draw.DrawText` and surface font caching are significantly faster than rebuilding strings every frame; using pre-created fonts and direct API calls reduces overhead", "durationMs": 6462, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "95d9fe4918ee4197", "usage": { "source": "provider", "promptTokens": 20290, "completionTokens": 59, "totalTokens": 20618, "reasoningTokens": 269, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:43.397Z", "completedAt": "2026-07-10T17:57:49.860Z", "answerBytes": 394, "answerChars": 394, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-count-hash.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain exactly one fenced code block followed by a reason.", "finalResponse": "# The # operator is the preferred way to get the length of a sequential array in Garry's Mod Lua. It's more efficient and idiomatic than alternatives.\n\n```lua\nlocal array = {1, 2, 3, 4, 5}\nlocal length = #array -- Returns 5\n```\n\nReason: The # operator is the standard, idiomatic way to get array length in Garry's Mod Lua, being more direct and efficient than alternatives like table.Count() or manual iteration.", "durationMs": 8612, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3e9bbfc8452e05e3", "usage": { "source": "provider", "promptTokens": 20285, "completionTokens": 61, "totalTokens": 20561, "reasoningTokens": 215, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:44.264Z", "completedAt": "2026-07-10T17:57:52.878Z", "answerBytes": 412, "answerChars": 412, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-empty.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- Faster approach for large sequential tables:\nt = {} -- Simply reassign to new empty table\n\n-- Slower approach:\ntable.Empty(t) -- Must iterate and clear each entry\n```\n\nReason: Variable reassignment avoids the O(n) iteration needed to clear entries in-place", "durationMs": 6325, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3a6344977f5bd475", "usage": { "source": "provider", "promptTokens": 20293, "completionTokens": 1, "totalTokens": 20657, "reasoningTokens": 363, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:45.204Z", "completedAt": "2026-07-10T17:57:51.531Z", "answerBytes": 268, "answerChars": 268, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-hasvalue.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 0 through 0 candidate loops.", "finalResponse": "```lua\n-- SLOWER: Using table.HasValue (O(n) lookup)\nlocal function HasValue(table, value)\n for _, v in pairs(table) do\n if v == value then\n return true\n end\n end\n return false\nend\n\n-- Create a test table\nlocal myList = {10, 20, 30, 40, 50}\n\n-- Test it\nHasValue(myList, 30) -- true\nHasValue(myList, 60) -- false\n\n-- PRIMARY PROBLEM: Each lookup iterates through entire table!\n-- Multiple calls on same table: O(n*k) time\n\n\n-- FAST: Create lookup index (O(1) lookup after O(n) setup)\nlocal function CreateLookupIndex(table)\n local index = {}\n for _, v in pairs(table) do\n index[v] = true\n end\n return index\nend\n\nlocal function HasValueFast(index, value)\n return index[value] ~= nil\nend\n\n-- Setup once, use repeatedly\nlocal myListIndex = CreateLookupIndex(myList)\n\n-- Fast lookups\nHasValueFast(myListIndex, 30) -- true\nHasValueFast(myListIndex, 60) -- false\n-- Multiple calls: O(n) setup + O(1)*k lookups\n\n\n-- FASTEST: Pre-built index for set operations\nlocal mySet = {\n [10] = true,\n [20] = true,\n [30] = true,\n [40] = true,\n [50] = true\n}\n\nmySet[30] and true or false -- true\nmySet[60] and true or false -- false\n-- Direct numeric key lookups are O(1)!\n```\n\nReason: `table.HasValue` does O(n) iterations per call, while lookup tables and numeric-key sets provide O(1) hash-based access.", "durationMs": 8796, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "7d064428a873fdfc", "usage": { "source": "provider", "promptTokens": 20292, "completionTokens": 352, "totalTokens": 21027, "reasoningTokens": 383, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:45.294Z", "completedAt": "2026-07-10T17:57:54.096Z", "answerBytes": 1365, "answerChars": 1365, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-literal.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- Method 1 (slower): assign fields after {}\nlocal t1 = {}\nt1.name = \"Alice\"\nt1.age = 25\n\n-- Method 2 (faster): put fields in constructor\nlocal t2 = {name = \"Alice\", age = 25}\n```\n\nReason: Table constructor avoids extra memory writes and hash table lookups.", "durationMs": 5684, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f95a8fc610d720ad", "usage": { "source": "provider", "promptTokens": 20287, "completionTokens": 43, "totalTokens": 20545, "reasoningTokens": 215, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:45.432Z", "completedAt": "2026-07-10T17:57:51.119Z", "answerBytes": 264, "answerChars": 264, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-random.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal function getRandomElement(tbl)\n local index = math.random(1, #tbl)\n return tbl[index]\nend\n\nlocal myTable = {1, 2, 3, 4, 5}\nlocal randomElement = getRandomElement(myTable)\nprint(randomElement)\n```\n\nReason: math.random is more efficient than table.Random for direct index-based random selection since it avoids the overhead of a dedicated table method call.", "durationMs": 6279, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f3e090701953d4a9", "usage": { "source": "provider", "promptTokens": 20289, "completionTokens": 75, "totalTokens": 20639, "reasoningTokens": 275, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:46.124Z", "completedAt": "2026-07-10T17:57:52.405Z", "answerBytes": 374, "answerChars": 374, "exitCode": 0 }, { "fixtureId": "gmod.perf.x-times-x.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal x = 5\nlocal squared = x * x\n```\n\nReason: Multiplication is the fastest method for squaring in Garry's Mod Lua tight loops.", "durationMs": 10217, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "79d48008f6b5174f", "usage": { "source": "provider", "promptTokens": 20280, "completionTokens": 39, "totalTokens": 20488, "reasoningTokens": 169, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:47.447Z", "completedAt": "2026-07-10T17:57:57.665Z", "answerBytes": 135, "answerChars": 135, "exitCode": 0 }, { "fixtureId": "gmod.player-iterator.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must use a lua code fence.", "finalResponse": "```\nfor k, v in ipairs(player.GetAll()) do\n if v and v:Alive() then\n -- Loop body for currently connected player k with index v\n end\nend\n```\nReason: Uses ipairs with an alive check to filter for currently connected players only", "durationMs": 8541, "version": "1.15.9", "fixtureVersion": 2, "rubricVersion": "4", "promptHash": "fe3d7469535a0ca2", "usage": { "source": "provider", "promptTokens": 20298, "completionTokens": 0, "totalTokens": 20796, "reasoningTokens": 507, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:47.790Z", "completedAt": "2026-07-10T17:57:56.332Z", "answerBytes": 240, "answerChars": 240, "exitCode": 0 }, { "fixtureId": "gmod.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal entities = ents.FindByClass(\"prop_physics\")\nfor i = 1, #entities do\n local ent = entities[i]\n -- Do something with ent\nend\n```\n\nReason: This approach finds the entities once but doesn't pre-build a complete table of all entities before iterating, using the existing `ents.FindByClass` result which already contains filtered entities.", "durationMs": 8556, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "3990c92253db85bb", "usage": { "source": "provider", "promptTokens": 20297, "completionTokens": 28, "totalTokens": 20823, "reasoningTokens": 498, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:48.536Z", "completedAt": "2026-07-10T17:57:57.093Z", "answerBytes": 352, "answerChars": 352, "exitCode": 0 }, { "fixtureId": "gmod.hook-add.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Registers a named hook with hook.Add.", "finalResponse": "```lua\nhook.Add(\"Think\", \"MyAddon\", function()\n -- Your code here\nend)\n```\n\nReason: This is the standard pattern for attaching a function to GMod's Think hook using the identifier \"MyAddon.Think\" which provides unique identification for hook management.", "durationMs": 9530, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "12d2222fdb7d6b90", "usage": { "source": "provider", "promptTokens": 20292, "completionTokens": 34, "totalTokens": 20514, "reasoningTokens": 188, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:49.699Z", "completedAt": "2026-07-10T17:57:59.233Z", "answerBytes": 256, "answerChars": 256, "exitCode": 0 }, { "fixtureId": "gmod.isvalid.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Uses IsValid for entity/object validity.", "finalResponse": "```lua\nif ent and ent:IsValid() then\n ent:SomeMethod()\nend\n```\n\nReason: Entity references become invalid when the entity is removed", "durationMs": 5107, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "35527312e59dfc13", "usage": { "source": "provider", "promptTokens": 20291, "completionTokens": 18, "totalTokens": 20467, "reasoningTokens": 158, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:49.862Z", "completedAt": "2026-07-10T17:57:54.972Z", "answerBytes": 134, "answerChars": 134, "exitCode": 0 }, { "fixtureId": "gmod.net-receivers.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nnet.Receive(\"MyAddon.Sync\", function()\n local data = net.ReadTable()\n -- Process sync data here\nend)\n```\n\nReason: This registers a handler for \"MyAddon.Sync\" messages and reads the transmitted table data.", "durationMs": 9952, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "24d54ee8366753a6", "usage": { "source": "provider", "promptTokens": 20288, "completionTokens": 21, "totalTokens": 20518, "reasoningTokens": 209, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:51.121Z", "completedAt": "2026-07-10T17:58:01.077Z", "answerBytes": 217, "answerChars": 217, "exitCode": 0 }, { "fixtureId": "gmod.perf.angle-zero.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nlocal zero_angle = Angle()\n\nfunction updateHotPath()\n zero_angle.pitch = 0\n zero_angle.yaw = 0\n zero_angle.roll = 0\n -- use zero_angle\nend\n```\n\nReason: Reusing a single Angle object and resetting properties avoids repeated object creation overhead", "durationMs": 14868, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f6bc97bf98280d62", "usage": { "source": "provider", "promptTokens": 20291, "completionTokens": 0, "totalTokens": 20872, "reasoningTokens": 634, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:51.533Z", "completedAt": "2026-07-10T17:58:06.402Z", "answerBytes": 266, "answerChars": 266, "exitCode": 0 }, { "fixtureId": "gmod.perf.config-var.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- Preferred: Flat local variables for frequently read settings\nlocal MY_ADDON_COLOR = {255, 0, 0, 255}\nlocal MY_ADDON_ENABLED = true\n\n-- Read usage\nlocal r, g, b, a = MY_ADDON_COLOR\nlocal isEnabled = MY_ADDON_ENABLED\n```\n\nReason: Local variable access in LuaJIT (Garry's Mod) is a single bytecode operation, whereas nested table lookups require multiple lookups with hash table accesses, making flat locals significantly faster for frequently read settings.", "durationMs": 7506, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "bcc4ff8eb162b699", "usage": { "source": "provider", "promptTokens": 20297, "completionTokens": 49, "totalTokens": 20651, "reasoningTokens": 305, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:51.901Z", "completedAt": "2026-07-10T17:57:59.409Z", "answerBytes": 465, "answerChars": 465, "exitCode": 0 }, { "fixtureId": "gmod.perf.darkrpvar.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attemptIndex": 1, "status": "incorrect", "detail": "Did not match a fixture answer pattern.", "finalResponse": "```lua\nlocal jobName = ply.DarkRPJob and ply.DarkRPJob.command or DarkRP.getJob(ply)\n```\n\nReason: `ply.DarkRPJob` (or `ply:getDarkRPJob()`) is more idiomatic in DarkRP, it handles None jobs gracefully, and it's the recommended way to access player job data properly.", "durationMs": 7067, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "02a37daa699cded3", "usage": { "source": "provider", "promptTokens": 20289, "completionTokens": 47, "totalTokens": 20615, "reasoningTokens": 279, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:52.406Z", "completedAt": "2026-07-10T17:57:59.475Z", "answerBytes": 266, "answerChars": 266, "exitCode": 0 }, { "fixtureId": "gmod.perf.disttosqr.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attemptIndex": 1, "status": "incorrect", "detail": "Did not match a fixture answer pattern.", "finalResponse": "```lua\nif (self:GetPos() - other:GetPos()):Length2DSquared() < threshold * threshold then\n -- Within range\nend\n```\n\nReason: Uses squared distance to avoid expensive square root calculation", "durationMs": 6639, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "a5772470c6859cdc", "usage": { "source": "provider", "promptTokens": 20293, "completionTokens": 0, "totalTokens": 20769, "reasoningTokens": 513, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:52.879Z", "completedAt": "2026-07-10T17:57:59.521Z", "answerBytes": 191, "answerChars": 191, "exitCode": 0 }, { "fixtureId": "gmod.perf.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must use a lua code fence.", "finalResponse": "```\n-- Loop through all entities efficiently\nfor _, ent in pairs(ents.GetAll()) do\n -- Process each entity here\n print(\"Entity: \" .. ent:EntIndex())\nend\n```\n\nReason: Used `ents.GetAll()` which is the wiki-recommended efficient iterator for visiting all entities, providing a simple and performant way to iterate through every entity in the map.", "durationMs": 6918, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "306d3f1d05f28246", "usage": { "source": "provider", "promptTokens": 20285, "completionTokens": 22, "totalTokens": 20606, "reasoningTokens": 299, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:54.098Z", "completedAt": "2026-07-10T17:58:01.019Z", "answerBytes": 350, "answerChars": 350, "exitCode": 0 }, { "fixtureId": "gmod.perf.find-ents-near.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nlocal player = Entity(1)\nlocal entities = player:FindInSphere(player:GetPos(), 2048)\n```\n\nReason: FindInSphere is the most performant built-in spatial query for general proximity searches, avoiding PVS culling overhead while maintaining accuracy for typical gameplay distances.", "durationMs": 8077, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "07c583fc3d9fe09f", "usage": { "source": "provider", "promptTokens": 20313, "completionTokens": 30, "totalTokens": 20618, "reasoningTokens": 275, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:54.973Z", "completedAt": "2026-07-10T17:58:03.053Z", "answerBytes": 284, "answerChars": 284, "exitCode": 0 }, { "fixtureId": "gmod.perf.find-players-near.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nlocal allPlayers = player.GetAll()\nlocal result = {}\nlocal center = position\nlocal radiusSq = radius * radius\n\nfor i = 1, #allPlayers do\n local ply = allPlayers[i]\n local diff = ply:GetPos() - center\n local distSq = diff.x * diff.x + diff.y * diff.y + diff.z * diff.z\n \n if distSq <= radiusSq then\n result[#result + 1] = ply\n end\nend\n\nreturn result\n```\n\nReason: Eliminates redundant entity search and filtering by directly iterating players with optimized squared distance comparison.", "durationMs": 19469, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "d139ba2e8ee38a2f", "usage": { "source": "provider", "promptTokens": 20302, "completionTokens": 15, "totalTokens": 20906, "reasoningTokens": 589, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:56.334Z", "completedAt": "2026-07-10T17:58:15.805Z", "answerBytes": 516, "answerChars": 516, "exitCode": 0 }, { "fixtureId": "gmod.perf.for-vs-while.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nfor i = 1, n do\n -- loop body\nend\n```\n\nReason: For loops are optimized in Lua's VM and avoid the incremental overhead of while loops, making them faster for tight counting loops.", "durationMs": 10213, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "b3401a190a8aecf0", "usage": { "source": "provider", "promptTokens": 20288, "completionTokens": 21, "totalTokens": 20532, "reasoningTokens": 223, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:57.095Z", "completedAt": "2026-07-10T17:58:07.319Z", "answerBytes": 188, "answerChars": 188, "exitCode": 0 }, { "fixtureId": "gmod.perf.hook-once.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- Fast pattern: Single hook run with all players\nlocal players = player.GetAll()\nhook.Run(\"CustomLogic_Tick\", players)\n\n-- Slow pattern: Loop calling hook per player (for comparison)\nfor _, ply in ipairs(player.GetAll()) do\n hook.Run(\"CustomLogic_Tick\", ply)\nend\n```\n\nReason: Single hook call reduces function call overhead and context switching, making it faster for player notifications.", "durationMs": 14745, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "ed1d3e09249fc8bb", "usage": { "source": "provider", "promptTokens": 20294, "completionTokens": 19, "totalTokens": 20633, "reasoningTokens": 320, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:57.333Z", "completedAt": "2026-07-10T17:58:12.082Z", "answerBytes": 400, "answerChars": 400, "exitCode": 0 }, { "fixtureId": "gmod.perf.hudpaint-cache.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nfunction HUD:Paint()\n local health = LocalPlayer():GetHealth()\n \n draw.RoundedBox(5, 10, 10, 200, 50, health > 50 and color_green or color_red)\n draw.DrawText(\"Health: \" .. health, 20, 20, color_white)\n surface.SetFont(\"Arial\")\n surface.DrawText(\"HP: \" .. health, 30, 40, color_white)\nend\n```\n\nReason: Caching the health value in a variable avoids repeated LocalPlayer():Health() calls, reducing overhead from three separate player references to just one.", "durationMs": 19027, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3def450f3158ceff", "usage": { "source": "provider", "promptTokens": 20301, "completionTokens": 22, "totalTokens": 20956, "reasoningTokens": 633, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:57.667Z", "completedAt": "2026-07-10T17:58:16.696Z", "answerBytes": 480, "answerChars": 480, "exitCode": 0 }, { "fixtureId": "gmod.perf.local-color.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal white = Color(255, 255, 255)\nsurface.SetDrawColor(white)\nfor i = 1, 1000 do\n surface.DrawRect(i * 10, i * 10, 5, 5)\nend\n```\n\nReason: Setting color once outside the loop reduces function call overhead.", "durationMs": 7569, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "16a7bed1b931d467", "usage": { "source": "provider", "promptTokens": 20290, "completionTokens": 29, "totalTokens": 20561, "reasoningTokens": 242, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:59.236Z", "completedAt": "2026-07-10T17:58:06.808Z", "answerBytes": 216, "answerChars": 216, "exitCode": 0 }, { "fixtureId": "gmod.perf.local-vs-global.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal sin = math.sin\nfor i = 1, iterations do\n result = sin(x * i)\nend\n```\n\nReason: The local reference avoids the global table lookup overhead each iteration, dramatically reducing lookup time in hot loops.", "durationMs": 6425, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "c116d8c651190647", "usage": { "source": "provider", "promptTokens": 20285, "completionTokens": 12, "totalTokens": 20529, "reasoningTokens": 232, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:59.424Z", "completedAt": "2026-07-10T17:58:05.961Z", "answerBytes": 217, "answerChars": 217, "exitCode": 0 }, { "fixtureId": "gmod.perf.localplayer-cache.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal function OptimizedMethod()\n local ply = LocalPlayer() -- Cache once, reuse throughout\n \n if ply then\n ply:SomeMethod()\n ply:AnotherMethod()\n ply:YetAnotherMethod()\n end\nend\n```\n\nReason: Caching LocalPlayer() in a local variable avoids the expensive lookup operation on each call.", "durationMs": 7156, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "7398105af47b079e", "usage": { "source": "provider", "promptTokens": 20293, "completionTokens": 11, "totalTokens": 20668, "reasoningTokens": 364, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:59.519Z", "completedAt": "2026-07-10T17:58:06.707Z", "answerBytes": 325, "answerChars": 325, "exitCode": 0 }, { "fixtureId": "gmod.perf.looking-at.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nlocal function ArePlayersLookingAtEachOther(ply1, ply2, threshold)\n local vec1 = ply1:EyeAngles():Forward()\n local vec2 = ply2:EyeAngles():Forward()\n\n local dotProduct = vec1:Dot(vec2)\n\n return dotProduct < threshold\nend\n```\n\nReason: Using dot product of normalized forward vectors avoids expensive acos calls for angle comparison. Negative dot product indicates vectors point in opposite hemispheres, meaning players look at each other.", "durationMs": 7172, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "20b22f678a4b08d7", "usage": { "source": "provider", "promptTokens": 20310, "completionTokens": 62, "totalTokens": 20708, "reasoningTokens": 336, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:59.535Z", "completedAt": "2026-07-10T17:58:06.740Z", "answerBytes": 456, "answerChars": 456, "exitCode": 0 }, { "fixtureId": "gmod.perf.meta-vs-arg.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain exactly one fenced code block followed by a reason.", "finalResponse": "`ply:SomeHelper()`\n\nReason: `__call` metamethods are optimized in LuaJIT for direct table method invocation, avoiding arg table construction and making this style 2-4x faster than `SomeHelper(ply)` for frequently called helpers.", "durationMs": 6111, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "de332f7356830dfa", "usage": { "source": "provider", "promptTokens": 20292, "completionTokens": 13, "totalTokens": 20535, "reasoningTokens": 230, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:57:59.783Z", "completedAt": "2026-07-10T17:58:05.896Z", "answerBytes": 228, "answerChars": 228, "exitCode": 0 }, { "fixtureId": "gmod.perf.msg-vs-print.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal function debugMsg(str)\n Msg(\"[DEBUG] \" .. str .. \"\\n\")\nend\n```\n\nReason: `Msg()` is faster than `print()` in Garry's Mod as it avoids the formatting and newline handling overhead, making it better suited for hot paths.", "durationMs": 8391, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "6cbb4e4b2f19dd24", "usage": { "source": "provider", "promptTokens": 20287, "completionTokens": 0, "totalTokens": 20669, "reasoningTokens": 393, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:01.023Z", "completedAt": "2026-07-10T17:58:09.422Z", "answerBytes": 233, "answerChars": 233, "exitCode": 0 }, { "fixtureId": "gmod.perf.pairs-ipairs-for.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 1 through 1 candidate loops.", "finalResponse": "```lua\nlocal t = {}\nfor i = 1, 1000000 do t[i] = i * 2 end\n\nlocal start = sys.time()\nfor k, v in pairs(t) do end\nlocal pairs_time = sys.time() - start\n\nstart = sys.time()\nfor k, v in ipairs(t) do end\nlocal ipairs_time = sys.time() - start\n\nstart = sys.time()\nfor i = 1, #t do local v = t[i] end\nlocal for_time = sys.time() - start\n\nstart = sys.time()\nfor i = 1, #t do end\nlocal for_noassign_time = sys.time() - start\n\nprint(string.format(\"pairs: %.6f\", pairs_time))\nprint(string.format(\"ipairs: %.6f\", ipairs_time))\nprint(string.format(\"for (with access): %.6f\", for_time))\nprint(string.format(\"for (no access): %.6f\", for_noassign_time))\n```\n\nReason: In Lua (including Garry's Mod), `for i = 1, #t` is fastest because it's a native C loop with minimal overhead, `ipairs` has function call overhead, and `pairs` is slowest as it iterates all keys including non-numeric ones.", "durationMs": 17192, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "de5e4875fcf3e600", "usage": { "source": "provider", "promptTokens": 20299, "completionTokens": 194, "totalTokens": 20932, "reasoningTokens": 439, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:01.079Z", "completedAt": "2026-07-10T17:58:18.274Z", "answerBytes": 874, "answerChars": 874, "exitCode": 0 }, { "fixtureId": "gmod.perf.plain-lua-vs-fn.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n--[[\nEfficient Lua list pipeline for Garry's Mod DarkRP\nCombines filter and map operations in a single pass for better performance\n--]]\n\nlocal function FilterMap(source, filterFunc, mapFunc)\n local result = {}\n local count = 0\n \n -- Single pass through the table\n for i = 1, #source do\n local item = source[i]\n \n -- Apply filter first\n if filterFunc(item) then\n -- Then apply map function\n result[count + 1] = mapFunc(item)\n count = count + 1\n end\n end\n \n return result\nend\n\n-- Alternative high-performance version for larger datasets\nlocal function FilterMapOptimized(source, filterFunc, mapFunc, startIdx)\n startIdx = startIdx or 1\n local result = {}\n local count = 0\n \n -- Numeric for loop is faster than generic for\n for i = startIdx, #source do\n local item = source[i]\n if filterFunc(item) then\n result[count + 1] = mapFunc(item)\n count = count + 1\n end\n end\n \n return result\nend\n\n-- Usage examples:\n-- Get all players with money > 50 and add 10 to their money\nlocal playersWithMoney = FilterMap(player.GetAll(),\n function(ply) return ply:GetMoney() > 50 end,\n function(ply) return ply:GetMoney() + 10 end\n)\n\n-- Get all weapons that start with \"weapon_\" and uppercase their names\nlocal weaponList = FilterMap(weapons.GetList(),\n function(wep) return wep:StartWith(\"weapon_\") end,\n function(wep) return wep:upper() end\n)\n```\n\nReason: A single-pass loop with pre-filtering reduces iteration overhead and memory allocation compared to chained fn.combinator operations.", "durationMs": 17844, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "ead0a98b3ff6a388", "usage": { "source": "provider", "promptTokens": 20311, "completionTokens": 350, "totalTokens": 20933, "reasoningTokens": 272, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:02.522Z", "completedAt": "2026-07-10T17:58:20.368Z", "answerBytes": 1651, "answerChars": 1651, "exitCode": 0 }, { "fixtureId": "gmod.perf.player-cache-hooks.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal cachedPlayers = {}\nlocal playerCacheDirty = true\n\nfunction RefreshPlayerCache()\n cachedPlayers = {}\n for _, ply in ipairs(player.GetAll()) do\n cachedPlayers[#cachedPlayers + 1] = ply\n end\n playerCacheDirty = false\nend\n\nfunction OnPlayerChanged()\n playerCacheDirty = true\nend\n\nhook.Add(\"PlayerInitialSpawn\", \"PlayerCache_Update\", function(ply)\n OnPlayerChanged()\nend)\n\nhook.Add(\"PlayerDisconnected\", \"PlayerCache_Update\", function(ply)\n OnPlayerChanged()\nend)\n\nhook.Add(\"Think\", \"PlayerCache_Think\", function()\n if playerCacheDirty then\n RefreshPlayerCache()\n end\n \n for _, ply in ipairs(cachedPlayers) do\n if ply:IsValid() then\n -- Your tick processing here, using cachedPlayers instead of player.GetAll()\n end\n end\nend)\n```\n\nReason: This pattern reduces the cost from O(n) per tick to O(1) per change, with only a single O(n) operation when the player count changes, rather than every tick.", "durationMs": 11492, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "a834817afe9e6c25", "usage": { "source": "provider", "promptTokens": 20308, "completionTokens": 214, "totalTokens": 20687, "reasoningTokens": 165, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:03.054Z", "completedAt": "2026-07-10T17:58:14.548Z", "answerBytes": 979, "answerChars": 979, "exitCode": 0 }, { "fixtureId": "gmod.perf.ply-table-index.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal plyData = {}\n\nfunction GetPlayerData(ply)\n return plyData[ply] or (plyData[ply] setmetatable({}, getmetatable(ply)))\nend\n```\n\nReason: Direct property access requires Lua's hash table lookup for each field assignment, while indexed table reads bypass this overhead.", "durationMs": 7046, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f18cc80df8999147", "usage": { "source": "provider", "promptTokens": 20295, "completionTokens": 10, "totalTokens": 20762, "reasoningTokens": 457, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:05.715Z", "completedAt": "2026-07-10T17:58:12.762Z", "answerBytes": 280, "answerChars": 280, "exitCode": 0 }, { "fixtureId": "gmod.perf.seq-tables.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 1 through 1 non-empty reason lines.", "finalResponse": "```lua\n-- Sequential number-indexed array (faster)\nfor i = 1, #array do\n local value = array[i]\n -- process value\nend\n```\n\n```lua\n-- String-keyed map (slower for iteration)\nfor key, value in pairs(map) do\n -- process value\nend\n```\n\nReason: Sequential arrays use cheaper iteration that only traverses a single range address, while string-keyed maps require hash table traversal which incurs overhead from hash computation and potential collisions. The `ipairs` iterator for arrays is optimized by the Lua VM, whereas `pairs` for hash tables invokes the generic `next` function that must resolve keys.", "durationMs": 8092, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "4778b0220c3f91a3", "usage": { "source": "provider", "promptTokens": 20293, "completionTokens": 74, "totalTokens": 20661, "reasoningTokens": 294, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:05.900Z", "completedAt": "2026-07-10T17:58:13.997Z", "answerBytes": 608, "answerChars": 608, "exitCode": 0 }, { "fixtureId": "gmod.perf.setdrawcolor-split.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nsurface.SetDrawColor(255, 0, 0, 255)\n```\n\nReason: Passing numbers directly is faster than creating a Color object for frequently called draw functions.", "durationMs": 10214, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "d110fde8a37bbe59", "usage": { "source": "provider", "promptTokens": 20292, "completionTokens": 23, "totalTokens": 20585, "reasoningTokens": 270, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:05.969Z", "completedAt": "2026-07-10T17:58:16.185Z", "answerBytes": 158, "answerChars": 158, "exitCode": 0 }, { "fixtureId": "gmod.perf.sqlite-vs-mysql.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal sql = sql or sql_library\nlocal playerData = sql.Query(\"SELECT * FROM player_data WHERE steamID = '\" .. player:SteamID() .. \"'\")\n```\n\nReason: SQLite has lower latency due to local file access, no network overhead, and same-process operations compared to remote MySQL database communication.", "durationMs": 15887, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "4a3f5d2a20d71ac9", "usage": { "source": "provider", "promptTokens": 20318, "completionTokens": 0, "totalTokens": 20702, "reasoningTokens": 384, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:06.404Z", "completedAt": "2026-07-10T17:58:22.292Z", "answerBytes": 302, "answerChars": 302, "exitCode": 0 }, { "fixtureId": "gmod.perf.steamid-cache.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal SteamIDCache = SteamIDCache or {}\n\nfunction GetSteamID(ply)\n if not SteamIDCache[ply] then\n SteamIDCache[ply] = ply:SteamID()\n end\n return SteamIDCache[ply]\nend\n```\nReason: Avoid repeatedly calling ply:SteamID() for the same players to improve performance in hot paths.", "durationMs": 6555, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "e8a94aa454154982", "usage": { "source": "provider", "promptTokens": 20289, "completionTokens": 56, "totalTokens": 20596, "reasoningTokens": 251, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:06.709Z", "completedAt": "2026-07-10T17:58:13.266Z", "answerBytes": 298, "answerChars": 298, "exitCode": 0 }, { "fixtureId": "gmod.perf.string-table-concat.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 1 through 1 non-empty reason lines.", "finalResponse": "```lua\nlocal str = \"\"\n\nfor i = 1, 10000 do\n str = str .. \"piece_\" .. i .. \"\\n\"\nend\n\nprint(\"Length:\", #str)\n```\n\n```lua\nlocal pieces = {}\n\nfor i = 1, 10000 do\n table.insert(pieces, \"piece_\" .. i .. \"\\n\")\nend\n\nlocal str = table.concat(pieces)\n\nprint(\"Length:\", #str)\n```\n\nReason: Table.concat() creates the final string in a single operation using pre-allocated memory, while repeated .. concatenation creates a new string for each iteration, copying the previous content.", "durationMs": 7337, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "b0cf9e04ae7c5dd9", "usage": { "source": "provider", "promptTokens": 20286, "completionTokens": 119, "totalTokens": 20627, "reasoningTokens": 222, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:06.744Z", "completedAt": "2026-07-10T17:58:14.083Z", "answerBytes": 476, "answerChars": 476, "exitCode": 0 }, { "fixtureId": "gmod.perf.surface-drawrect.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal function fastDrawRect(x, y, w, h, r, g, b, a)\n surface.SetDrawColor(r, g, b, a)\n surface.DrawRect(x, y, w, h)\nend\n```\n\nReason: Using surface.DrawRect is more direct than draw.Rect and significantly faster than draw.RoundedBox for simple rectangular rendering.", "durationMs": 7371, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "696e8de769d9ad0e", "usage": { "source": "provider", "promptTokens": 20291, "completionTokens": 46, "totalTokens": 20605, "reasoningTokens": 268, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:06.812Z", "completedAt": "2026-07-10T17:58:14.186Z", "answerBytes": 278, "answerChars": 278, "exitCode": 0 }, { "fixtureId": "gmod.perf.surface-text.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attemptIndex": 1, "status": "incorrect", "detail": "Matched an incorrect-answer pattern.", "finalResponse": "```lua\nlocal font = surface.CreateFont(\"DefaultLarge\", {\n font = \"Default\",\n size = 20,\n weight = 400,\n blursize = 0,\n scanlines = 0,\n antialias = true,\n underline = false,\n strikeout = false,\n outline = false,\n italic = false,\n addinfo = 0\n})\n\nlocal x, y = 100, 100\nlocal text = \"Performance Test\"\nlocal counter = 0\n\nfunction math.lerp(a, b, t)\n return a + (b - a) * t\nend\n\nhook.Add(\"VGUIMousePressed\", \"test_font\", function(sci, but)\n if but == MOUSE_LEFT then\n font = surface.CreateFont(\"GrowingFont\", {\n font = \"Arial\",\n size = 20,\n weight = 400,\n blursize = 0,\n scanlines = 0,\n antialias = true,\n underline = false,\n strikeout = false,\n outline = false,\n italic = false,\n addinfo = 0\n })\n font = surface.CreateFont(\"BoldFont\", {\n font = \"Calibri Bold\",\n size = 30,\n weight = 700,\n blursize = 0,\n scanlines = 0,\n antialias = true,\n underline = false,\n strikeout = false,\n outline = false,\n italic = false,\n addinfo = 0\n })\n end\nend)\n\nhook.Add(\"Think\", \"performance_test\", function()\n counter = counter + 1\nend)\n\nhook.Add(\"Paint\", \"performance_test\", function()\n draw.DrawText(\"draw.DrawText: \" .. math.floor(FrameTime() * 1000) .. \"ms\", \"DefaultLarge\", x, y, color_white)\n x = x + 5\n \n surface.SetFont(font)\n local tw, th = surface.GetTextSize(\"SimpleTextOutlined\")\n local str = \"SimpleTextOutlined: \" .. (counter % 2 == 0 and \"ON\" or \"OFF\")\n surface.DrawText(str, \"Center\", 400, 200, color_white)\nend)\n```\n\nReason: draw.DrawText is fastest as it directly renders text without intermediate helper functions or extra draw calls", "durationMs": 14922, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "95d9fe4918ee4197", "usage": { "source": "provider", "promptTokens": 20294, "completionTokens": 436, "totalTokens": 21044, "reasoningTokens": 314, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:07.322Z", "completedAt": "2026-07-10T17:58:22.253Z", "answerBytes": 1866, "answerChars": 1866, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-count-hash.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n#myTable\n```\n\nReason: # is the standard operator for getting length of sequential array tables in Garry's Mod Lua.", "durationMs": 5313, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3e9bbfc8452e05e3", "usage": { "source": "provider", "promptTokens": 20280, "completionTokens": 3, "totalTokens": 20504, "reasoningTokens": 221, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:09.424Z", "completedAt": "2026-07-10T17:58:14.739Z", "answerBytes": 121, "answerChars": 121, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-empty.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- For large sequential tables, use table.Empty(t) instead of t = {}\ntable.Empty(large_table)\n```\n\nReason: `table.Empty(t)` is faster as it empties the table in place without losing references or re-allocating memory.", "durationMs": 6672, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3a6344977f5bd475", "usage": { "source": "provider", "promptTokens": 20299, "completionTokens": 0, "totalTokens": 20644, "reasoningTokens": 359, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:12.083Z", "completedAt": "2026-07-10T17:58:18.756Z", "answerBytes": 224, "answerChars": 224, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-hasvalue.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 0 through 0 candidate loops.", "finalResponse": "```lua\n-- Slow approach - O(n) complexity\nfunction HasValue(list, value)\n for _, v in pairs(list) do\n if v == value then\n return true\n end\n end\n return false\nend\n\n-- Fast approach - O(1) complexity\nlocal fastSet = {\n [1] = true,\n [2] = true,\n [3] = true,\n [\"key\"] = true\n}\n\nfunction ContainsFast(set, value)\n return set[value] ~= nil\nend\n```\n\nReason: Using a hash table for O(1) lookup is faster than O(n) linear search with table.HasValue.", "durationMs": 13079, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "7d064428a873fdfc", "usage": { "source": "provider", "promptTokens": 20289, "completionTokens": 100, "totalTokens": 20699, "reasoningTokens": 310, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:12.763Z", "completedAt": "2026-07-10T17:58:25.844Z", "answerBytes": 489, "answerChars": 489, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-literal.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal myTable = {field1 = \"value1\", field2 = \"value2\"}\n```\nReason: The table constructor is faster because it allocates memory once and populates fields immediately during the initial table creation.", "durationMs": 10333, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f95a8fc610d720ad", "usage": { "source": "provider", "promptTokens": 20287, "completionTokens": 16, "totalTokens": 20554, "reasoningTokens": 251, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:13.268Z", "completedAt": "2026-07-10T17:58:23.604Z", "answerBytes": 206, "answerChars": 206, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-random.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal t = { /* your sequential table */ }\nlocal index = math.random(1, #t)\nreturn t[index]\n```\n\nReason: This method bypasses table.Random's O(n) iteration by using direct integer indexing with the table's length, making it significantly faster for sequential tables.", "durationMs": 9886, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f3e090701953d4a9", "usage": { "source": "provider", "promptTokens": 20284, "completionTokens": 36, "totalTokens": 20556, "reasoningTokens": 236, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:14.000Z", "completedAt": "2026-07-10T17:58:23.896Z", "answerBytes": 273, "answerChars": 273, "exitCode": 0 }, { "fixtureId": "gmod.perf.x-times-x.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attemptIndex": 1, "status": "incorrect", "detail": "Did not match a fixture answer pattern.", "finalResponse": "```lua\nx *= x\n```\nReason: Multiplication is fastest in LuaJIT for squaring", "durationMs": 8094, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "79d48008f6b5174f", "usage": { "source": "provider", "promptTokens": 20287, "completionTokens": 18, "totalTokens": 20652, "reasoningTokens": 347, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:14.085Z", "completedAt": "2026-07-10T17:58:22.182Z", "answerBytes": 74, "answerChars": 74, "exitCode": 0 }, { "fixtureId": "gmod.player-iterator.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attemptIndex": 1, "status": "partial", "detail": "Uses ipairs but still allocates via player.GetAll() each time.", "finalResponse": "```lua\nfor _, ply in ipairs(player.GetAll()) do\n if ply:IsConnected() and not ply:IsBot() then\n -- Player-specific code here\n print(\"Player: \" .. ply:Nick())\n end\nend\n```\n\nReason: Provides a Garry's Mod Lua loop that visits every currently connected player, including a connection status check to filter for active players and exclude bots.", "durationMs": 27841, "version": "1.15.9", "fixtureVersion": 2, "rubricVersion": "4", "promptHash": "fe3d7469535a0ca2", "usage": { "source": "provider", "promptTokens": 20298, "completionTokens": 0, "totalTokens": 20826, "reasoningTokens": 558, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:14.189Z", "completedAt": "2026-07-10T17:58:42.044Z", "answerBytes": 360, "answerChars": 360, "exitCode": 0 }, { "fixtureId": "gmod.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal physics_props = ents.FindByClass(\"prop_physics\")\nfor _, ent in ipairs(physics_props) do\n print(\"Found physics prop:\", ent:EntIndex())\nend\n```\nReason: Use `ents.FindByClass` to directly get only prop_physics entities, avoiding the need to first collect all entities then filter.", "durationMs": 9553, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "3990c92253db85bb", "usage": { "source": "provider", "promptTokens": 20294, "completionTokens": 42, "totalTokens": 20600, "reasoningTokens": 264, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:14.552Z", "completedAt": "2026-07-10T17:58:24.113Z", "answerBytes": 293, "answerChars": 293, "exitCode": 0 }, { "fixtureId": "gmod.hook-add.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attemptIndex": 1, "status": "pass", "detail": "Registers a named hook with hook.Add.", "finalResponse": "```lua\nhook.Add(\"Think\", \"MyAddon.Think\", function()\n -- Your think logic here\nend)\n```\n\nReason: Basic Think hook registration example for Garry's Mod with minimal callback body.", "durationMs": 5701, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "12d2222fdb7d6b90", "usage": { "source": "provider", "promptTokens": 20298, "completionTokens": 23, "totalTokens": 20479, "reasoningTokens": 158, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:14.741Z", "completedAt": "2026-07-10T17:58:20.447Z", "answerBytes": 181, "answerChars": 181, "exitCode": 0 }, { "fixtureId": "gmod.isvalid.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attemptIndex": 1, "status": "pass", "detail": "Uses IsValid for entity/object validity.", "finalResponse": "```lua\nif ent and ent:IsValid() then\n -- use ent\nend\n```\nReason: Garry's Mod entities can become invalid when destroyed, so always check IsValid() before use.", "durationMs": 8915, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "35527312e59dfc13", "usage": { "source": "provider", "promptTokens": 20288, "completionTokens": 37, "totalTokens": 20513, "reasoningTokens": 188, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:15.812Z", "completedAt": "2026-07-10T17:58:24.748Z", "answerBytes": 161, "answerChars": 161, "exitCode": 0 }, { "fixtureId": "gmod.net-receivers.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nnet.Receive(\"MyAddon.Sync\", function()\n local data = net.ReadTable()\n -- Process the received data here\nend)\n```\n\nReason: This registers a handler for the \"MyAddon.Sync\" net message using Garry's Mod's net framework, which is the standard method for handling incoming network messages between client and server.", "durationMs": 6862, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "2", "promptHash": "24d54ee8366753a6", "usage": { "source": "provider", "promptTokens": 20287, "completionTokens": 15, "totalTokens": 20723, "reasoningTokens": 421, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:16.189Z", "completedAt": "2026-07-10T17:58:23.066Z", "answerBytes": 324, "answerChars": 324, "exitCode": 0 }, { "fixtureId": "gmod.perf.angle-zero.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 0 through 0 candidate loops.", "finalResponse": "```lua\n-- Slower: Creating new Angle() every iteration\nfor i = 1, 1000000 do\n local angle = Angle()\n -- use angle...\nend\n\n-- Faster: Reusing a single zeroed Angle reference\nlocal ZERO_ANGLE = Angle()\nfor i = 1, 1000000 do\n local angle = ZERO_ANGLE\n -- use angle...\nend\n```\n\nReason: Reusing a single Angle reference avoids the overhead of object construction in tight loops.", "durationMs": 10487, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f6bc97bf98280d62", "usage": { "source": "provider", "promptTokens": 20289, "completionTokens": 77, "totalTokens": 20865, "reasoningTokens": 499, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:16.698Z", "completedAt": "2026-07-10T17:58:27.188Z", "answerBytes": 385, "answerChars": 385, "exitCode": 0 }, { "fixtureId": "gmod.perf.config-var.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attemptIndex": 1, "status": "incorrect", "detail": "Matched an incorrect-answer pattern.", "finalResponse": "```lua\n-- Preferred: Flat variable declaration (global for addon-wide access)\nlocal addon_color = {r = 255, g = 128, b = 0}\n\n-- Read frequently\nlocal color_r = addon_color.r\nlocal color_g = addon_color.g\nlocal color_b = addon_color.b\n\n-- OR: Flat table in file scope for global access (more common in GMod addons)\naddon = addon or {}\naddon.Color = {r = 255, g = 128, b = 0} -- File-level global\n\n-- Read frequently\nlocal r = addon.Color.r\nlocal g = addon.Color.g\nlocal b = addon.Color.b\n```\n\nReason: Flat variables reduce lookup depth and hash table access overhead, improving read performance especially in frequently accessed addon code paths.", "durationMs": 10054, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "bcc4ff8eb162b699", "usage": { "source": "provider", "promptTokens": 20291, "completionTokens": 105, "totalTokens": 20610, "reasoningTokens": 214, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:18.276Z", "completedAt": "2026-07-10T17:58:28.334Z", "answerBytes": 645, "answerChars": 645, "exitCode": 0 }, { "fixtureId": "gmod.perf.darkrpvar.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attemptIndex": 1, "status": "incorrect", "detail": "Did not match a fixture answer pattern.", "finalResponse": "```lua\nlocal jobName = ply:GetJob():GetTitle()\n```\n\nReason: The dedicated DarkRP job API provides the official job object with methods like GetTitle(), which is preferred over the generic GetNWString approach.", "durationMs": 8539, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "02a37daa699cded3", "usage": { "source": "provider", "promptTokens": 20293, "completionTokens": 29, "totalTokens": 20566, "reasoningTokens": 244, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:18.758Z", "completedAt": "2026-07-10T17:58:27.299Z", "answerBytes": 209, "answerChars": 209, "exitCode": 0 }, { "fixtureId": "gmod.perf.disttosqr.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attemptIndex": 1, "status": "incorrect", "detail": "Did not match a fixture answer pattern.", "finalResponse": "```lua\n-- Preferred method: Compare squared distance to avoid sqrt() operation\nif dest:DistanceSqr(src) <= threshold * threshold then\n -- Vectors are within threshold distance\nend\n```\n\nReason: Calculating actual distance uses sqrt() which is slower - squared distance comparison is more efficient for threshold checks.", "durationMs": 7818, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "a5772470c6859cdc", "usage": { "source": "provider", "promptTokens": 20290, "completionTokens": 17, "totalTokens": 20573, "reasoningTokens": 266, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:20.370Z", "completedAt": "2026-07-10T17:58:28.191Z", "answerBytes": 321, "answerChars": 321, "exitCode": 0 }, { "fixtureId": "gmod.perf.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nlocal type = type\nlocal ipairs = ipairs\n\nlocal function visit_all_entities()\n local visited = {}\n\n for _, ent in ipairs(ents.GetAll()) do\n if type(ent) == \"Entity\" and ent:GetClass() ~= \"\" then\n visited[ent] = true\n end\n end\n\n return visited\nend\n\nvisit_all_entities()\n```\n\nReason: Uses the wiki-recommended efficient iterator `ents.GetAll()` for broad entity enumeration, with explicit type checking and empty class filtering to ensure valid entities are processed correctly in Garry's Mod's Lua environment.", "durationMs": 8526, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "306d3f1d05f28246", "usage": { "source": "provider", "promptTokens": 20282, "completionTokens": 54, "totalTokens": 20843, "reasoningTokens": 507, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:20.448Z", "completedAt": "2026-07-10T17:58:28.978Z", "answerBytes": 552, "answerChars": 552, "exitCode": 0 }, { "fixtureId": "gmod.perf.find-ents-near.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nlocal pos = player:GetPos()\nlocal radius = 512\nlocal entities = {}\nplayer:FindInSphere(pos, radius, entities)\n```\n\nReason: FindInSphere is the fastest built-in spatial query method for surrounding areas, typically 30-50% faster than FindInBox for spherical player proximity searches.", "durationMs": 10251, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "07c583fc3d9fe09f", "usage": { "source": "provider", "promptTokens": 20306, "completionTokens": 38, "totalTokens": 20600, "reasoningTokens": 256, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:22.184Z", "completedAt": "2026-07-10T17:58:32.437Z", "answerBytes": 290, "answerChars": 290, "exitCode": 0 }, { "fixtureId": "gmod.perf.find-players-near.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nlocal function GetPlayersInSphere(position, radius)\n local playersInSphere = {}\n local sqRadius = radius * radius\n local players = player.GetAll()\n \n for _, ply in ipairs(players) do\n if ply:IsValid() and not ply:IsBot() then\n local delta = ply:GetPos() - position\n if delta:LengthSqr() <= sqRadius then\n table.insert(playersInSphere, ply)\n end\n end\n end\n \n return playersInSphere\nend\n```\n\nReason: Pre-calculate squared radius and use vector math instead of helper functions for faster distance comparisons, plus check entity validity first to reduce iterations.", "durationMs": 11873, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "d139ba2e8ee38a2f", "usage": { "source": "provider", "promptTokens": 20304, "completionTokens": 83, "totalTokens": 20712, "reasoningTokens": 325, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:22.254Z", "completedAt": "2026-07-10T17:58:34.131Z", "answerBytes": 655, "answerChars": 655, "exitCode": 0 }, { "fixtureId": "gmod.perf.for-vs-while.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal count = n\nlocal start = os.clock()\nfor i = 1, count do\nend\nlocal elapsed = os.clock() - start\n```\n\nReason: For loops in Lua are more efficient because they have minimal overhead, don't require manual variable management, and are optimized by the interpreter for this common pattern.", "durationMs": 7308, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "b3401a190a8aecf0", "usage": { "source": "provider", "promptTokens": 20291, "completionTokens": 46, "totalTokens": 20544, "reasoningTokens": 207, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:22.294Z", "completedAt": "2026-07-10T17:58:29.604Z", "answerBytes": 295, "answerChars": 295, "exitCode": 0 }, { "fixtureId": "gmod.perf.hook-once.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\n-- SLOWER: Loop through players and call hook.Run for each\nfor i = 1, #player.GetAll() do\n local ply = player.GetAll()[i]\n hook.Run(\"PlayerTickNotify\", ply, 0) -- Called once per player\nend\n\n-- FASTER: Call hook.Run once with all players as a single table\nhook.Run(\"PlayerTickNotify\", player.GetAll(), 0) -- Called once for all players\n```\n\nReason: Lua function call overhead is less than repeated hook.Run invoker setup costs, especially when players may not be listening to the hook", "durationMs": 10602, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "ed1d3e09249fc8bb", "usage": { "source": "provider", "promptTokens": 20303, "completionTokens": 82, "totalTokens": 20658, "reasoningTokens": 273, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:23.068Z", "completedAt": "2026-07-10T17:58:33.672Z", "answerBytes": 499, "answerChars": 499, "exitCode": 0 }, { "fixtureId": "gmod.perf.hudpaint-cache.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal ply = LocalPlayer()\nlocal x, y = ply:GetPos()\nlocal health = ply:Health()\n\nsurface.DrawText(\"Health: \" .. health .. \"%\", \"Default\", x, y, Color(255, 255, 255), 1)\nsurface.DrawText(\"Health: \" .. health .. \"%\", \"DefaultBold\", x, y + 30, Color(255, 200, 0), 1)\nsurface.DrawText(\"Health: \" .. health .. \"%\", \"HUDNumber\", x, y + 60, Color(0, 255, 0), 1)\n```\n\nReason: Cached LocalPlayer(), position, and health in local variables to avoid repeated Lua object lookups and string concatenations across three draw calls.", "durationMs": 8514, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3def450f3158ceff", "usage": { "source": "provider", "promptTokens": 20301, "completionTokens": 111, "totalTokens": 20678, "reasoningTokens": 266, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:23.606Z", "completedAt": "2026-07-10T17:58:32.125Z", "answerBytes": 524, "answerChars": 524, "exitCode": 0 }, { "fixtureId": "gmod.perf.local-color.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 0 through 1 candidate loops.", "finalResponse": "```lua\n-- Paint loop - slower pattern (current)\nfunction PaintSlow()\n for i = 1, 100 do\n draw.DrawText(\"Text\", \"default\", 100, 100 + i * 20, Color(255, 255, 255))\n end\nend\n\n-- Paint loop - faster pattern (optimized)\nfunction PaintFast()\n draw.SetColor(255, 255, 255, 255)\n for i = 1, 100 do\n draw.DrawText(\"Text\", \"default\", 100, 100 + i * 20, nil)\n end\nend\n```\n\nReason: Pre-set color once at loop start and pass nil to draw functions instead of recreating identical Color() objects every frame", "durationMs": 17596, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "16a7bed1b931d467", "usage": { "source": "provider", "promptTokens": 20287, "completionTokens": 129, "totalTokens": 20629, "reasoningTokens": 213, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:23.900Z", "completedAt": "2026-07-10T17:58:41.516Z", "answerBytes": 523, "answerChars": 523, "exitCode": 0 }, { "fixtureId": "gmod.perf.local-vs-global.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal sin = math.sin -- Cache the function before the loop\n\nfor i = 1, N do\n result = sin(i) -- Use the local reference\nend\n```\n\nReason: Caching `math.sin` in a local variable before the loop reduces global table lookup overhead for each iteration, providing a significant performance improvement in hot loops.", "durationMs": 9286, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "c116d8c651190647", "usage": { "source": "provider", "promptTokens": 20288, "completionTokens": 42, "totalTokens": 20502, "reasoningTokens": 172, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:24.132Z", "completedAt": "2026-07-10T17:58:33.431Z", "answerBytes": 320, "answerChars": 320, "exitCode": 0 }, { "fixtureId": "gmod.perf.localplayer-cache.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 0 through 0 candidate loops.", "finalResponse": "```lua\nlocal ply = LocalPlayer() -- Cache the reference\n\nhook.Add('Think', 'OptimizedPlayerAccess', function()\n if not IsValid(ply) then return end\n \n -- Use cached reference instead of looking up LocalPlayer() repeatedly\n local pos = ply:GetPos()\n local vel = ply:GetVelocity()\n local ang = ply:EyeAngles()\n \n -- Use cached reference multiple times\n for i = 1, #players do\n if IsValid(players[i]) then\n players[i]:DrawShadow()\n end\n end\nend)\n```\n\nReason: Caching the LocalPlayer reference once reduces repeated function lookup overhead compared to calling LocalPlayer() multiple times within a function or loop.", "durationMs": 13333, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "7398105af47b079e", "usage": { "source": "provider", "promptTokens": 20293, "completionTokens": 78, "totalTokens": 20877, "reasoningTokens": 506, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:24.751Z", "completedAt": "2026-07-10T17:58:38.087Z", "answerBytes": 667, "answerChars": 667, "exitCode": 0 }, { "fixtureId": "gmod.perf.looking-at.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attemptIndex": 1, "status": "partial", "detail": "Matched a partial-answer pattern.", "finalResponse": "```lua\nlocal function are_facing_each_other(ply1, ply2)\n local vec1 = ply1:GetAimVector()\n local vec2 = ply2:GetAimVector()\n return vec1:Dot(vec2) >= 0.8\nend\n```\n\nReason: The dot product of two unit vectors directly measures cosine similarity, with 0.8 threshold providing ~36-degree alignment check that's faster than computing arccos between vectors.", "durationMs": 10992, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "20b22f678a4b08d7", "usage": { "source": "provider", "promptTokens": 20307, "completionTokens": 63, "totalTokens": 20665, "reasoningTokens": 295, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:25.851Z", "completedAt": "2026-07-10T17:58:36.847Z", "answerBytes": 361, "answerChars": 361, "exitCode": 0 }, { "fixtureId": "gmod.perf.meta-vs-arg.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attemptIndex": 1, "status": "incorrect", "detail": "Matched an incorrect-answer pattern.", "finalResponse": "```lua\nply:SomeHelper() -- Preferred style for controlled helpers\n```\n\nReason: Method calls use LuaJIT's colon syntax which is highly optimized and more idiomatic; performance difference is negligible.", "durationMs": 11716, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "de332f7356830dfa", "usage": { "source": "provider", "promptTokens": 20292, "completionTokens": 0, "totalTokens": 20697, "reasoningTokens": 444, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:27.190Z", "completedAt": "2026-07-10T17:58:38.909Z", "answerBytes": 201, "answerChars": 201, "exitCode": 0 }, { "fixtureId": "gmod.perf.msg-vs-print.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attemptIndex": 1, "status": "incorrect", "detail": "Did not match a fixture answer pattern.", "finalResponse": "```lua\nMsgC(\"Debug message\\n\")\n```\n\nReason: The `print()` function in Garry's Mod creates network overhead, while `MsgC()` writes directly to the console without the performance penalty.", "durationMs": 19844, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "6cbb4e4b2f19dd24", "usage": { "source": "provider", "promptTokens": 20290, "completionTokens": 7, "totalTokens": 20541, "reasoningTokens": 244, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:27.301Z", "completedAt": "2026-07-10T17:58:47.146Z", "answerBytes": 186, "answerChars": 186, "exitCode": 0 }, { "fixtureId": "gmod.perf.pairs-ipairs-for.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 1 through 1 candidate loops.", "finalResponse": "```lua\nlocal t = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}\n\n-- ipairs: Stops at first nil, iterates over array portion\nfor i, v in ipairs(t) do\n -- v = t[i]\nend\n\n-- pairs: Iterates all key-value pairs, slower for sequential arrays\nfor k, v in pairs(t) do\n -- v = t[k]\nend\n\n-- Numeric for: Most efficient - direct iteration using length operator\nfor i = 1, #t do\n -- v = t[i]\nend\n```\n\nReason: Numeric for loop is fastest due to direct index iteration without function call overhead.", "durationMs": 10760, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "de5e4875fcf3e600", "usage": { "source": "provider", "promptTokens": 20302, "completionTokens": 140, "totalTokens": 20745, "reasoningTokens": 303, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:28.193Z", "completedAt": "2026-07-10T17:58:38.955Z", "answerBytes": 500, "answerChars": 500, "exitCode": 0 }, { "fixtureId": "gmod.perf.plain-lua-vs-fn.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal function optimizedMap(input, func)\n local result = {}\n local len = #input\n for i = 1, len do\n result[i] = func(input[i], i)\n end\n return result\nend\n\nlocal function optimizedFilter(input, predicate)\n local result = {}\n local idx = 1\n for i = 1, #input do\n if predicate(input[i], i) then\n result[idx] = input[i]\n idx = idx + 1\n end\n end\n return result\nend\n\nlocal originalData = {1, 2, 3, 4, 5}\nlocal doubled = optimizedMap(originalData, function(v, k) return v * 2 end)\nlocal evens = optimizedFilter(originalData, function(v) return v % 2 == 0 end)\n```\n\nReason: Local variables and direct indexing avoid global lookups and overhead", "durationMs": 15977, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "ead0a98b3ff6a388", "usage": { "source": "provider", "promptTokens": 20305, "completionTokens": 155, "totalTokens": 20709, "reasoningTokens": 249, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:28.337Z", "completedAt": "2026-07-10T17:58:44.327Z", "answerBytes": 715, "answerChars": 715, "exitCode": 0 }, { "fixtureId": "gmod.perf.player-cache-hooks.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 0 through 3 candidate loops.", "finalResponse": "```lua\nlocal cachedPlayers = {}\nlocal playerChangeHandlers = {}\n\nhook.Add(\"PlayerInitialSpawn\", \"playerCache_initialSpawn\", function(ply)\n table.insert(cachedPlayers, ply)\n for _, handler in ipairs(playerChangeHandlers) do\n handler(\"join\", ply)\n end\nend)\n\nhook.Add(\"PlayerDisconnected\", \"playerCache_playerDisconnected\", function(ply)\n for i, cachedPly in ipairs(cachedPlayers) do\n if cachedPly == ply then\n table.remove(cachedPlayers, i)\n for _, handler in ipairs(playerChangeHandlers) do\n handler(\"leave\", ply)\n end\n break\n end\n end\nend)\n\nfunction playerCache_getAll()\n return cachedPlayers\nend\n\nfunction playerCache_onChange(callback)\n table.insert(playerChangeHandlers, callback)\nend\n\nfunction playerCache_refresh()\n cachedPlayers = {}\n for _, ply in ipairs(player.GetAll()) do\n table.insert(cachedPlayers, ply)\n end\nend\n\nplayerCache_refresh()\n\nhook.Add(\"Think\", \"playerCache_think\", function()\n for i, ply in ipairs(cachedPlayers) do\n if not IsValid(ply) then\n table.Remove(cachedPlayers, i)\n end\n end\nend)\n```\n\nReason: Cached player table with event-driven refresh avoids expensive GetAll() calls on every tick.", "durationMs": 7583, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "a834817afe9e6c25", "usage": { "source": "provider", "promptTokens": 20312, "completionTokens": 266, "totalTokens": 20781, "reasoningTokens": 203, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:28.990Z", "completedAt": "2026-07-10T17:58:36.606Z", "answerBytes": 1265, "answerChars": 1265, "exitCode": 0 }, { "fixtureId": "gmod.perf.ply-table-index.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 0 through 0 candidate loops.", "finalResponse": "```lua\nlocal plyCache = {}\nplyCache[\"Player1\"] = {}\nplyCache[\"Player2\"] = {}\n\nfor i = 1, #players do\n local ply = players[i]\n plyCache[ ply:UniqueID() ] = {}\nend\n\nlocal function SetPlayerField(ply, fieldName, value)\n plyCache[ ply:UniqueID() ][fieldName] = value\nend\n\nlocal function GetPlayerField(ply, fieldName)\n return plyCache[ ply:UniqueID() ][fieldName]\nend\n```\n\nReason: Arrays are faster than dictionaries when keys are sequential.", "durationMs": 7219, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f18cc80df8999147", "usage": { "source": "provider", "promptTokens": 20298, "completionTokens": 93, "totalTokens": 20594, "reasoningTokens": 203, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:29.606Z", "completedAt": "2026-07-10T17:58:36.827Z", "answerBytes": 442, "answerChars": 442, "exitCode": 0 }, { "fixtureId": "gmod.perf.seq-tables.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 0 through 1 candidate loops.", "finalResponse": "```lua\n-- String-keyed map (object-like table)\nlocal stringMap = {\n [\"key1\"] = \"value1\",\n [\"key2\"] = \"value2\",\n [\"key3\"] = \"value3\",\n [\"key4\"] = \"value4\",\n [\"key5\"] = \"value5\"\n}\n\n-- Sequential number-indexed array\nlocal numericArray = {\n \"value1\",\n \"value2\",\n \"value3\",\n \"value4\",\n \"value5\"\n}\n\n-- Iterate string-keyed map\nlocal sumString = 0\nfor k, v in pairs(stringMap) do\n sumString = sumString + 1\nend\n\n-- Iterate numeric array\nlocal sumNumeric = 0\nfor i, v in ipairs(numericArray) do\n sumNumeric = sumNumeric + 1\nend\n\nprint(\"String-map pairs(): \" .. sumString)\nprint(\"Numeric-array ipairs(): \" .. sumNumeric)\n```\n\nReason: Numeric arrays are faster to iterate because `ipairs()` can directly access sequential integer indices without hashing lookups.", "durationMs": 8874, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "4778b0220c3f91a3", "usage": { "source": "provider", "promptTokens": 20293, "completionTokens": 182, "totalTokens": 20686, "reasoningTokens": 211, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:32.127Z", "completedAt": "2026-07-10T17:58:41.002Z", "answerBytes": 789, "answerChars": 789, "exitCode": 0 }, { "fixtureId": "gmod.perf.setdrawcolor-split.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nsurface.SetDrawColor(255, 0, 0, 255)\n```\n\nReason: Separate r,g,b,a numbers avoid Color object allocation and are faster in hot draw loops.", "durationMs": 6706, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "d110fde8a37bbe59", "usage": { "source": "provider", "promptTokens": 20296, "completionTokens": 14, "totalTokens": 20567, "reasoningTokens": 257, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:32.439Z", "completedAt": "2026-07-10T17:58:39.147Z", "answerBytes": 145, "answerChars": 145, "exitCode": 0 }, { "fixtureId": "gmod.perf.sqlite-vs-mysql.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal sql = require(\"sql\")\nlocal ply = {}\nlocal query = sql.Query(\"SELECT * FROM player_data WHERE steam_id = @steam_id\", { steam_id = player:SteamID() })\nif query and #query > 0 then\n ply = query[1]\nend\n```\nReason: SQLite avoids network overhead, uses simpler setup, and has local file access advantages for single-server game data storage", "durationMs": 7346, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "4a3f5d2a20d71ac9", "usage": { "source": "provider", "promptTokens": 20320, "completionTokens": 36, "totalTokens": 20623, "reasoningTokens": 267, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:33.433Z", "completedAt": "2026-07-10T17:58:40.780Z", "answerBytes": 350, "answerChars": 350, "exitCode": 0 }, { "fixtureId": "gmod.perf.steamid-cache.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal steamid_cache = {}\n\nfunction GetPlayerSteamID(ply)\n local steamid = steamid_cache[ply]\n if not steamid then\n steamid = ply:SteamID()\n steamid_cache[ply] = steamid\n end\n return steamid\nend\n\nfunction MyHotPath(entity)\n local player = entity:GetOwner()\n local steamid = GetPlayerSteamID(player) -- Cached call\n -- Process steamid...\n -- This approach ensures ply:SteamID() is called only once per player\nend\n```\n\nReason: Caching SteamID in a table on first access avoids repeated network lookups for the same player instance.", "durationMs": 6979, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "e8a94aa454154982", "usage": { "source": "provider", "promptTokens": 20289, "completionTokens": 102, "totalTokens": 20663, "reasoningTokens": 272, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:33.674Z", "completedAt": "2026-07-10T17:58:40.655Z", "answerBytes": 574, "answerChars": 574, "exitCode": 0 }, { "fixtureId": "gmod.perf.string-table-concat.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 0 through 0 candidate loops.", "finalResponse": "```lua\n-- SLOWER: Repeated .. concatenation\nlocal strSlow = \"\"\nfor i = 1, 10000 do\n strSlow = strSlow .. \"piece\" .. i .. \" \"\nend\n\n-- FAST: Table-based concatenation\nlocal pieces = {}\nfor i = 1, 10000 do\n pieces[i] = \"piece\" .. i .. \" \"\nend\nlocal strFast = table.concat(pieces)\n```\n\nReason: table.concat minimizes memory allocations vs. repeated string copying in .. loops.", "durationMs": 5265, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "b0cf9e04ae7c5dd9", "usage": { "source": "provider", "promptTokens": 20292, "completionTokens": 76, "totalTokens": 20513, "reasoningTokens": 145, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:34.133Z", "completedAt": "2026-07-10T17:58:39.402Z", "answerBytes": 378, "answerChars": 378, "exitCode": 0 }, { "fixtureId": "gmod.perf.surface-drawrect.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 1 through 1 non-empty reason lines.", "finalResponse": "```lua\nfunction draw.RectFast(x, y, w, h, r, g, b, a)\n surface.SetDrawColor(r, g, b, a)\n surface.DrawRect(x, y, w, h)\nend\n```\n\nReason: Surface API functions are lower-level and have less overhead than DrawLib's wrapper functions, especially for simple rectangles where the rounding radius is 0.```lua\nfunction draw.RectFast(x, y, w, h, r, g, b, a)\n surface.SetDrawColor(r, g, b, a)\n surface.DrawRect(x, y, w, h)\nend\n```\n\nReason: Direct surface API calls bypass DrawLib's rounding calculations and have less function call overhead than draw.RoundedBox, even faster when radius is 0.", "durationMs": 9138, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "696e8de769d9ad0e", "usage": { "source": "provider", "promptTokens": 20291, "completionTokens": 129, "totalTokens": 20826, "reasoningTokens": 406, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:36.607Z", "completedAt": "2026-07-10T17:58:45.747Z", "answerBytes": 593, "answerChars": 593, "exitCode": 0 }, { "fixtureId": "gmod.perf.surface-text.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must use a lua code fence.", "finalResponse": "```\nlocal color = Color(255, 255, 255, 255)\nlocal x, y = 100, 100\ndraw.SimpleTextOutlined(\"FPS: \" .. math.ceil(engine.FPS), \"default\", x, y, color, color, TEXT_ALIGN_LEFT)\n```\n\nReason: draw.DrawText/SimpleTextOutlined are Lua implementations and significantly faster than surface.* helpers which are Python-based.", "durationMs": 7422, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "95d9fe4918ee4197", "usage": { "source": "provider", "promptTokens": 20294, "completionTokens": 44, "totalTokens": 20555, "reasoningTokens": 217, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:36.829Z", "completedAt": "2026-07-10T17:58:44.253Z", "answerBytes": 313, "answerChars": 313, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-count-hash.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal length = #myTable\n```\n\nReason: The `#` operator is the standard Lua 5.1/5.2 operator for retrieving the length of sequential integer-indexed tables, and it's widely used and recommended in Garry's Mod Lua.", "durationMs": 7346, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3e9bbfc8452e05e3", "usage": { "source": "provider", "promptTokens": 20282, "completionTokens": 33, "totalTokens": 20554, "reasoningTokens": 239, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:36.849Z", "completedAt": "2026-07-10T17:58:44.196Z", "answerBytes": 218, "answerChars": 218, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-empty.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nt = {}\n```\n\nReason: Reassigning to an empty table is faster because it creates a new table immediately, avoiding iteration through all key-value pairs like table.Empty() would do.", "durationMs": 21215, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "3a6344977f5bd475", "usage": { "source": "provider", "promptTokens": 20290, "completionTokens": 0, "totalTokens": 20801, "reasoningTokens": 530, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:38.089Z", "completedAt": "2026-07-10T17:58:59.306Z", "answerBytes": 186, "answerChars": 186, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-hasvalue.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attemptIndex": 1, "status": "protocol_error", "detail": "Answer must contain 0 through 0 candidate loops.", "finalResponse": "```lua\n-- Convert list to set for O(1) lookup\nlocal set = {}\nfor _, value in ipairs(your_list) do\n set[value] = true\nend\n\n-- Fast O(1) check\nif set[your_value] then\n -- value exists\nelse\n -- value does not exist\nend\n```\n\nReason: Converting a list to a hash-based set provides O(1) lookup time vs O(n) for table.HasValue, making it exponentially faster for checking membership in large collections.", "durationMs": 11171, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "7d064428a873fdfc", "usage": { "source": "provider", "promptTokens": 20292, "completionTokens": 87, "totalTokens": 20610, "reasoningTokens": 231, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:38.910Z", "completedAt": "2026-07-10T17:58:50.084Z", "answerBytes": 406, "answerChars": 406, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-literal.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal myTable = { field1 = \"value1\", field2 = \"value2\", field3 = \"value3\" }\n```\n\nReason: Table constructor is a single operation vs. multiple assignments, making it more efficient.", "durationMs": 5824, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f95a8fc610d720ad", "usage": { "source": "provider", "promptTokens": 20292, "completionTokens": 20, "totalTokens": 20486, "reasoningTokens": 174, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:38.957Z", "completedAt": "2026-07-10T17:58:44.787Z", "answerBytes": 187, "answerChars": 187, "exitCode": 0 }, { "fixtureId": "gmod.perf.table-random.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nlocal function GetRandomFromSequential(table)\n return table[#table][math.random(#table)]\nend\n```\n\nReason: Using direct indexing with math.random is faster for sequential arrays since it avoids table.Random's function call and lookup overhead.", "durationMs": 6267, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "f3e090701953d4a9", "usage": { "source": "provider", "promptTokens": 20283, "completionTokens": 15, "totalTokens": 20607, "reasoningTokens": 309, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:39.148Z", "completedAt": "2026-07-10T17:58:45.417Z", "answerBytes": 252, "answerChars": 252, "exitCode": 0 }, { "fixtureId": "gmod.perf.x-times-x.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attemptIndex": 1, "status": "pass", "detail": "Matched a pass pattern.", "finalResponse": "```lua\nfunction square(x)\n return x * x\nend\n```\n\nReason: `x * x` is faster than `x^2` in Garry's Mod Lua as multiplication has less overhead than exponentiation in tight loops.", "durationMs": 9048, "version": "1.15.9", "fixtureVersion": 1, "rubricVersion": "1", "promptHash": "79d48008f6b5174f", "usage": { "source": "provider", "promptTokens": 20286, "completionTokens": 42, "totalTokens": 20466, "reasoningTokens": 138, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:39.403Z", "completedAt": "2026-07-10T17:58:48.453Z", "answerBytes": 179, "answerChars": 179, "exitCode": 0 }, { "fixtureId": "gmod.player-iterator.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attemptIndex": 1, "status": "incorrect", "detail": "Keeps pairs() rather than Iterator or a cached numeric for-loop.", "finalResponse": "```lua\nfor _, player in pairs(player.GetAll()) do\n if player:Alive() then\n print(string.format(\"Player %d is connected and alive\", player:UserID()))\n end\nend\n```\n\nReason: This uses the standard Garry's Mod Lua idiom for iterating through connected players with pairs(), where '_' ignores the key and 'player' is the player object for accessing methods like Alive() and UserID().", "durationMs": 5523, "version": "1.15.9", "fixtureVersion": 2, "rubricVersion": "4", "promptHash": "fe3d7469535a0ca2", "usage": { "source": "provider", "promptTokens": 20298, "completionTokens": 41, "totalTokens": 20703, "reasoningTokens": 364, "cachedTokens": 0, "cost": 0 }, "startedAt": "2026-07-10T17:58:40.657Z", "completedAt": "2026-07-10T17:58:46.182Z", "answerBytes": 391, "answerChars": 391, "exitCode": 0 } ], "summary": { "statusCounts": { "pass": 459, "partial": 58, "incorrect": 54, "protocol_error": 75, "policy_violation": 0, "timeout": 0, "unavailable": 0, "unsupported": 0, "trace_error": 0, "scored": 571 }, "groups": [ { "fixtureId": "gmod.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.hook-add.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.hook-add.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.hook-add.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.hook-add.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.hook-add.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.hook-add.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.hook-add.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.hook-add.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.hook-add.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.hook-add.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.hook-add.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.hook-add.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.hook-add.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.hook-add.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.hook-add.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.hook-add.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.hook-add.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.isvalid.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.isvalid.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.isvalid.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.isvalid.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.isvalid.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.isvalid.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.isvalid.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.isvalid.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.isvalid.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.isvalid.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.isvalid.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.isvalid.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.isvalid.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.isvalid.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.isvalid.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.isvalid.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.isvalid.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.net-receivers.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.net-receivers.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.net-receivers.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.net-receivers.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.net-receivers.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.net-receivers.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.net-receivers.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.net-receivers.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.net-receivers.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.net-receivers.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.net-receivers.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.net-receivers.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.net-receivers.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.net-receivers.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.net-receivers.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.net-receivers.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.net-receivers.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.angle-zero.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.angle-zero.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.angle-zero.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.angle-zero.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.angle-zero.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.angle-zero.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.angle-zero.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.angle-zero.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.angle-zero.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.angle-zero.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.angle-zero.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.angle-zero.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.angle-zero.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.angle-zero.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.angle-zero.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.angle-zero.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.angle-zero.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.config-var.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.config-var.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.config-var.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.config-var.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.config-var.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.config-var.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.config-var.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.config-var.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.config-var.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.config-var.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.config-var.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.config-var.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.config-var.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.config-var.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.config-var.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.config-var.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.config-var.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.darkrpvar.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.darkrpvar.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.darkrpvar.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.darkrpvar.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.darkrpvar.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.darkrpvar.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.darkrpvar.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.darkrpvar.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.darkrpvar.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.darkrpvar.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.darkrpvar.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.darkrpvar.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.darkrpvar.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.darkrpvar.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.darkrpvar.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.darkrpvar.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.darkrpvar.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.disttosqr.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.disttosqr.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.disttosqr.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.disttosqr.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.disttosqr.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.disttosqr.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.disttosqr.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.disttosqr.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.disttosqr.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.disttosqr.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.disttosqr.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.disttosqr.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.disttosqr.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.disttosqr.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.disttosqr.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.disttosqr.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.disttosqr.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.ents-iterator.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.find-ents-near.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.find-ents-near.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.find-ents-near.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.find-ents-near.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.find-ents-near.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.find-ents-near.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.find-ents-near.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.find-ents-near.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.find-ents-near.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.find-ents-near.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.find-ents-near.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.find-ents-near.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.find-ents-near.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.find-ents-near.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.find-ents-near.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.find-ents-near.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.find-ents-near.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.find-players-near.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.find-players-near.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.find-players-near.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.find-players-near.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.find-players-near.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.find-players-near.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.find-players-near.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.find-players-near.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.find-players-near.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.find-players-near.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.find-players-near.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.find-players-near.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.find-players-near.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.find-players-near.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.find-players-near.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.find-players-near.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.find-players-near.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.for-vs-while.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.for-vs-while.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.for-vs-while.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.for-vs-while.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.for-vs-while.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.for-vs-while.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.for-vs-while.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.for-vs-while.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.for-vs-while.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.for-vs-while.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.for-vs-while.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.for-vs-while.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.for-vs-while.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.for-vs-while.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.for-vs-while.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.for-vs-while.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.for-vs-while.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.hook-once.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.hook-once.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.hook-once.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.hook-once.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.hook-once.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.hook-once.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.hook-once.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.hook-once.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.hook-once.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.hook-once.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.hook-once.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.hook-once.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.hook-once.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.hook-once.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.hook-once.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.hook-once.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.hook-once.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.hudpaint-cache.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.hudpaint-cache.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.hudpaint-cache.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.hudpaint-cache.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.hudpaint-cache.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.hudpaint-cache.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.hudpaint-cache.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.hudpaint-cache.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.hudpaint-cache.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.hudpaint-cache.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.hudpaint-cache.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.hudpaint-cache.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.hudpaint-cache.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.hudpaint-cache.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.hudpaint-cache.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.hudpaint-cache.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.hudpaint-cache.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.local-color.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.local-color.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.local-color.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.local-color.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.local-color.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.local-color.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.local-color.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.local-color.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.local-color.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.local-color.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.local-color.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.local-color.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.local-color.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.local-color.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.local-color.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.local-color.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.local-color.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.local-vs-global.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.local-vs-global.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.local-vs-global.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.local-vs-global.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.local-vs-global.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.local-vs-global.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.local-vs-global.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.local-vs-global.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.local-vs-global.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.local-vs-global.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.local-vs-global.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.local-vs-global.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.local-vs-global.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.local-vs-global.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.local-vs-global.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.local-vs-global.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.local-vs-global.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.localplayer-cache.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.localplayer-cache.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.localplayer-cache.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.localplayer-cache.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.localplayer-cache.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.localplayer-cache.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.localplayer-cache.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.localplayer-cache.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.localplayer-cache.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.localplayer-cache.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.localplayer-cache.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.localplayer-cache.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.localplayer-cache.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.localplayer-cache.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.localplayer-cache.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.localplayer-cache.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.localplayer-cache.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.looking-at.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.looking-at.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.looking-at.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.looking-at.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.looking-at.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.looking-at.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.looking-at.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.looking-at.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.looking-at.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.looking-at.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.looking-at.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.looking-at.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.looking-at.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.looking-at.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.looking-at.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.looking-at.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.looking-at.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.meta-vs-arg.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.meta-vs-arg.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.meta-vs-arg.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.meta-vs-arg.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.meta-vs-arg.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.meta-vs-arg.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.meta-vs-arg.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.meta-vs-arg.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.meta-vs-arg.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.meta-vs-arg.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.meta-vs-arg.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.meta-vs-arg.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.meta-vs-arg.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.meta-vs-arg.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.meta-vs-arg.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.meta-vs-arg.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.meta-vs-arg.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.msg-vs-print.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.msg-vs-print.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.msg-vs-print.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.msg-vs-print.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.msg-vs-print.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.msg-vs-print.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.msg-vs-print.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.msg-vs-print.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.msg-vs-print.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.msg-vs-print.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.msg-vs-print.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.msg-vs-print.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.msg-vs-print.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.msg-vs-print.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.msg-vs-print.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.msg-vs-print.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.msg-vs-print.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.pairs-ipairs-for.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.pairs-ipairs-for.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.pairs-ipairs-for.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.pairs-ipairs-for.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.pairs-ipairs-for.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.pairs-ipairs-for.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.pairs-ipairs-for.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.pairs-ipairs-for.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.pairs-ipairs-for.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.pairs-ipairs-for.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.pairs-ipairs-for.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.pairs-ipairs-for.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.pairs-ipairs-for.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.pairs-ipairs-for.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.pairs-ipairs-for.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.pairs-ipairs-for.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.pairs-ipairs-for.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.plain-lua-vs-fn.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.plain-lua-vs-fn.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.plain-lua-vs-fn.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.plain-lua-vs-fn.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.plain-lua-vs-fn.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.plain-lua-vs-fn.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.plain-lua-vs-fn.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.plain-lua-vs-fn.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.plain-lua-vs-fn.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.plain-lua-vs-fn.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.plain-lua-vs-fn.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.plain-lua-vs-fn.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.plain-lua-vs-fn.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.plain-lua-vs-fn.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.plain-lua-vs-fn.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.plain-lua-vs-fn.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.plain-lua-vs-fn.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.player-cache-hooks.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.player-cache-hooks.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.player-cache-hooks.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.player-cache-hooks.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.player-cache-hooks.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.player-cache-hooks.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.player-cache-hooks.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.player-cache-hooks.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.player-cache-hooks.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.player-cache-hooks.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.player-cache-hooks.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.player-cache-hooks.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.player-cache-hooks.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.player-cache-hooks.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.player-cache-hooks.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.player-cache-hooks.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.player-cache-hooks.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.ply-table-index.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.ply-table-index.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.ply-table-index.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.ply-table-index.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.ply-table-index.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.ply-table-index.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.ply-table-index.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.ply-table-index.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.ply-table-index.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.ply-table-index.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.ply-table-index.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.ply-table-index.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.ply-table-index.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.ply-table-index.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.ply-table-index.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.ply-table-index.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.ply-table-index.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.seq-tables.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.seq-tables.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.seq-tables.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.seq-tables.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.seq-tables.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.seq-tables.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.seq-tables.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.seq-tables.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.seq-tables.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.seq-tables.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.seq-tables.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.seq-tables.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.seq-tables.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.seq-tables.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.seq-tables.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.seq-tables.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.seq-tables.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.setdrawcolor-split.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.setdrawcolor-split.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.setdrawcolor-split.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.setdrawcolor-split.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.setdrawcolor-split.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.setdrawcolor-split.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.setdrawcolor-split.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.setdrawcolor-split.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.setdrawcolor-split.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.setdrawcolor-split.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.setdrawcolor-split.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.setdrawcolor-split.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.setdrawcolor-split.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.setdrawcolor-split.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.setdrawcolor-split.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.setdrawcolor-split.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.setdrawcolor-split.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.sqlite-vs-mysql.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.sqlite-vs-mysql.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.sqlite-vs-mysql.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.sqlite-vs-mysql.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.sqlite-vs-mysql.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.sqlite-vs-mysql.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.sqlite-vs-mysql.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.sqlite-vs-mysql.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.sqlite-vs-mysql.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.sqlite-vs-mysql.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.sqlite-vs-mysql.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.sqlite-vs-mysql.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.sqlite-vs-mysql.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.sqlite-vs-mysql.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.sqlite-vs-mysql.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.sqlite-vs-mysql.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.sqlite-vs-mysql.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.steamid-cache.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.steamid-cache.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.steamid-cache.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.steamid-cache.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.steamid-cache.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.steamid-cache.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.steamid-cache.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.steamid-cache.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.steamid-cache.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.steamid-cache.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.steamid-cache.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.steamid-cache.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.steamid-cache.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.steamid-cache.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.steamid-cache.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.steamid-cache.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.steamid-cache.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.string-table-concat.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.string-table-concat.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.string-table-concat.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.string-table-concat.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.string-table-concat.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.string-table-concat.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.string-table-concat.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.string-table-concat.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.string-table-concat.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.string-table-concat.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.string-table-concat.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.string-table-concat.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.string-table-concat.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.string-table-concat.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.string-table-concat.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.string-table-concat.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.string-table-concat.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.surface-drawrect.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.surface-drawrect.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.surface-drawrect.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.surface-drawrect.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.surface-drawrect.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.surface-drawrect.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.surface-drawrect.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.surface-drawrect.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.surface-drawrect.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.surface-drawrect.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.surface-drawrect.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.surface-drawrect.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.surface-drawrect.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.surface-drawrect.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.surface-drawrect.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.surface-drawrect.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.surface-drawrect.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.surface-text.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.surface-text.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.surface-text.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.surface-text.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.surface-text.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.surface-text.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.surface-text.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.surface-text.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.surface-text.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.surface-text.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.surface-text.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.surface-text.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.surface-text.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.surface-text.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.surface-text.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.surface-text.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.surface-text.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-count-hash.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-count-hash.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-count-hash.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-count-hash.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-count-hash.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-count-hash.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-count-hash.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-count-hash.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-count-hash.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-count-hash.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-count-hash.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-count-hash.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-count-hash.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-count-hash.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-count-hash.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-count-hash.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.table-count-hash.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-empty.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-empty.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-empty.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-empty.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-empty.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-empty.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-empty.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-empty.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-empty.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.table-empty.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-empty.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-empty.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-empty.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-empty.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-empty.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-empty.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-empty.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-hasvalue.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-hasvalue.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-hasvalue.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-hasvalue.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-hasvalue.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-hasvalue.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-hasvalue.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-hasvalue.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-hasvalue.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.table-hasvalue.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.table-hasvalue.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-hasvalue.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-hasvalue.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-hasvalue.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.table-hasvalue.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.table-hasvalue.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.table-hasvalue.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.table-literal.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-literal.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-literal.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-literal.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-literal.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-literal.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-literal.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-literal.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-literal.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-literal.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-literal.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-literal.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-literal.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-literal.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-literal.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-literal.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-literal.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-random.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-random.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-random.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-random.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-random.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-random.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-random.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-random.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-random.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-random.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-random.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-random.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-random.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-random.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.perf.table-random.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-random.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.table-random.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.x-times-x.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.x-times-x.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.x-times-x.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.x-times-x.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.x-times-x.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.x-times-x.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.x-times-x.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.x-times-x.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.x-times-x.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.x-times-x.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.x-times-x.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.x-times-x.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.x-times-x.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.x-times-x.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.x-times-x.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.x-times-x.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.perf.x-times-x.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.player-iterator.v1", "adapterId": "opencode", "model": "opencode/big-pickle", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.player-iterator.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.player-iterator.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.player-iterator.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@max", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.player-iterator.v1", "adapterId": "opencode", "model": "opencode/deepseek-v4-flash-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.player-iterator.v1", "adapterId": "opencode", "model": "opencode/hy3-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.player-iterator.v1", "adapterId": "opencode", "model": "opencode/hy3-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.player-iterator.v1", "adapterId": "opencode", "model": "opencode/hy3-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.player-iterator.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.player-iterator.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.player-iterator.v1", "adapterId": "opencode", "model": "opencode/mimo-v2.5-free@medium", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.player-iterator.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@high", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.player-iterator.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@low", "attempts": 1, "passCount": 1, "passAtK": true, "bestStatus": "pass", "meanScore": 1, "scoredAttempts": 1 }, { "fixtureId": "gmod.player-iterator.v1", "adapterId": "opencode", "model": "opencode/nemotron-3-ultra-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 }, { "fixtureId": "gmod.player-iterator.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@high", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "incorrect", "meanScore": 0, "scoredAttempts": 1 }, { "fixtureId": "gmod.player-iterator.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@low", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "protocol_error", "meanScore": null, "scoredAttempts": 0 }, { "fixtureId": "gmod.player-iterator.v1", "adapterId": "opencode", "model": "opencode/north-mini-code-free@medium", "attempts": 1, "passCount": 0, "passAtK": false, "bestStatus": "partial", "meanScore": 0.5, "scoredAttempts": 1 } ], "passAtKRate": "459/571", "overallMeanScore": 0.8546409807355516 }, "metadata": { "schemaVersion": 3, "runId": "824cda9a-438d-49bb-a9fa-b581e95e2b65", "startedAt": "2026-07-10T17:51:16.279Z", "completedAt": "2026-07-10T17:58:59.308Z", "repeat": 1, "concurrency": 15, "fixtureIds": [ "gmod.ents-iterator.v1", "gmod.hook-add.v1", "gmod.isvalid.v1", "gmod.net-receivers.v1", "gmod.perf.angle-zero.v1", "gmod.perf.config-var.v1", "gmod.perf.darkrpvar.v1", "gmod.perf.disttosqr.v1", "gmod.perf.ents-iterator.v1", "gmod.perf.find-ents-near.v1", "gmod.perf.find-players-near.v1", "gmod.perf.for-vs-while.v1", "gmod.perf.hook-once.v1", "gmod.perf.hudpaint-cache.v1", "gmod.perf.local-color.v1", "gmod.perf.local-vs-global.v1", "gmod.perf.localplayer-cache.v1", "gmod.perf.looking-at.v1", "gmod.perf.meta-vs-arg.v1", "gmod.perf.msg-vs-print.v1", "gmod.perf.pairs-ipairs-for.v1", "gmod.perf.plain-lua-vs-fn.v1", "gmod.perf.player-cache-hooks.v1", "gmod.perf.ply-table-index.v1", "gmod.perf.seq-tables.v1", "gmod.perf.setdrawcolor-split.v1", "gmod.perf.sqlite-vs-mysql.v1", "gmod.perf.steamid-cache.v1", "gmod.perf.string-table-concat.v1", "gmod.perf.surface-drawrect.v1", "gmod.perf.surface-text.v1", "gmod.perf.table-count-hash.v1", "gmod.perf.table-empty.v1", "gmod.perf.table-hasvalue.v1", "gmod.perf.table-literal.v1", "gmod.perf.table-random.v1", "gmod.perf.x-times-x.v1", "gmod.player-iterator.v1" ], "fixtureCount": 38, "attemptCount": 646, "adapters": [ "opencode" ], "models": [ "opencode/opencode/big-pickle", "opencode/opencode/deepseek-v4-flash-free@high", "opencode/opencode/deepseek-v4-flash-free@low", "opencode/opencode/deepseek-v4-flash-free@max", "opencode/opencode/deepseek-v4-flash-free@medium", "opencode/opencode/hy3-free@high", "opencode/opencode/hy3-free@low", "opencode/opencode/hy3-free@medium", "opencode/opencode/mimo-v2.5-free@high", "opencode/opencode/mimo-v2.5-free@low", "opencode/opencode/mimo-v2.5-free@medium", "opencode/opencode/nemotron-3-ultra-free@high", "opencode/opencode/nemotron-3-ultra-free@low", "opencode/opencode/nemotron-3-ultra-free@medium", "opencode/opencode/north-mini-code-free@high", "opencode/opencode/north-mini-code-free@low", "opencode/opencode/north-mini-code-free@medium" ], "keepRaw": true, "durationSeconds": 463, "usageTotals": { "promptTokens": 13955547, "completionTokens": 56415, "reasoningTokens": 136267, "totalTokens": 14485240, "cachedTokens": 337344, "cacheWriteTokens": 0, "cost": 0, "upstreamInferenceCost": 0, "attemptsWithUsage": 646, "providerUsageAttempts": 643, "estimatedUsageAttempts": 3, "avgDurationMs": 10428, "minDurationMs": 2977, "maxDurationMs": 79054, "totalDurationMs": 6736283, "totalAnswerBytes": 234925 } } }