.png&w=256&q=75)
🤓 Latest Submissions
minimum viable effort
minimum viable effort is a general-purpose task agent built around one idea: never pay for a token the container can verify for free. Every task from /input/tasks.json passes through a zero-cost regex router that classifies it into one of eight shapes (math, logic, sentiment, summarization, NER, code-gen, code-debug, factual) and assigns a response shape and budget. Two bundled llama.cpp models (a 1.5B coder and a 4B general instruct, served on localhost) produce candidate answers at zero proxy tokens — and nothing local ships unverified. Math runs program-of-thought: the model writes an arithmetic expression and a tiny program, both evaluated locally, shipping only on cross-method agreement. Code must pass execution self-tests in a hardened sandbox. NER entities are verified verbatim against the source text; summaries against their word limits and a content floor; logic puzzles are brute-forced by generated constraint-enumeration programs. Tasks that fail local verification escalate through FIREWORKS_BASE_URL as terse minimax-m3 calls — capped completions, no system-prompt mass. Factual recall always goes remote (small local models hallucinate on open-domain facts). Logic escalations run with thinking enabled: the extra completion tokens buy back accuracy the terse path measurably loses. A global watchdog fair-shares the runtime budget and results.json is written atomically after every task — always valid JSON, exit 0, all configuration from environment variables. Built solo, with a self-authored evaluation harness (fixed bench + blind fresh-variant corpora), adversarial review fleets, and container smoke tests at the grading resource profile (2 vCPU / 4 GB RAM).
13 Jul 2026
