BTL · Research index
We publish the question, the method, the artifacts, the failures, and the code needed to reproduce the result.
Updated September 2026Reasoning over merged states, many branches at once. With the same judge and budget, a frontier of states solves 30 of 30 hard Countdown problems where a single line of thought solves 21, in 3 sequential steps instead of 24.
A measured compression allocation for a 176.94B-parameter hybrid model: byte traffic, engram ablations, exact weight edits, and a 34.67 GiB GPU-resident core.
The BRQ paper: why static one-bit MoE quantization failed, how binary routed experts recovered teacher-forced structure, and why the result did not yet promote as a release artifact.
Behavior-gated two-bit quantization of a 35.1B-parameter mixture-of-experts model into a 9.96 GB stock-format GGUF, with controlled range-selection and expert-level ablations.
The complete BTL-3 Compact compression recipe: failed routes, behavioral cliff localization, measured precision allocation, repair, packing, and native proof under an exact byte ceiling.
An auditable benchmark for whether long-running agents preserve, retrieve, update, and use evidence correctly across sessions.
A stateful perception architecture that lets text-only models operate graphical interfaces through structure, OCR, affordance probes, and change events.
The engineering record behind a complete 27B agentic coding model in one 8.39 GB native GGUF: allocation, packing, behavior repair, kernels, and artifact-faithful validation.
Controlled tasks for separating observational pattern completion from interventional causal reasoning, with exact inference baselines.
HOW WE WORK
Benchmarks stay sealed until representation and training choices freeze. Model claims carry denominators and protocol. Runtime claims come from the exact deployed artifact.
Experiments that fail remain part of the record. Research is useful when another builder can see exactly where the method worked—and exactly where it stopped.