small reasoning models are overrated, these little ones just doom loop a lot by default. good data will always be the moat when training or finetuning small models and latest sota models like fable 5 and gpt 5.6 are increasingly making this a lot easier to do.
✅ Article highlight: State Formation and Recognition in Persistent Worlds (art-60-242, v0.1)
TL;DR: This article asks a practical design question for persistent simulated worlds:
When NPC societies, settlements, factions, and institutions evolve over time, when does a powerful group become a polity?
242 argues that power is not polityhood. Diplomacy, treaties, succession, migration, and war require a bounded governing subject with explicit formation, authority, continuity, legitimacy, jurisdiction, and recognition surfaces.
Why it matters: • prevents every powerful faction from being treated as a state • separates de facto control from recognized governing-subject status • distinguishes world-internal recognition from operator-side canon recognition • keeps legitimacy, continuity, and governability as separate questions • makes recognition scoped, contestable, and time-aware
What’s inside: • distinctions between faction, settlement, polity, and state • polity formation records • boundary declarations for settled, disputed, layered, or non-territorial jurisdiction • legitimacy registers with explicit limits • recognition claims for WORLD_INTERNAL, OPERATOR_SIDE, DUAL, LIMITED, or NONE • entrance conditions for partition, merger, succession, federation, and diplomacy
Key idea: Do not say:
“this group became powerful, so it is now a state.”
Say:
“this entity formed under this record, governs this bounded jurisdiction, preserves this continuity basis, holds this legitimacy posture, and is recognized only for these declared purposes.”
"Frontier models need a datacenter GPU" rests on a hidden assumption: that the model reads ALL its parameters every token. Decode is memory-bandwidth bound — sweep 34B params/token and an 8 GB card dies at 1–2 tok/s.
So we ran ONE 34.7B reasoning model — Ourbox-35B-JGOS, a sparse Mixture-of-Experts — as the identical weights across the whole hardware spectrum. All measured:
Why it works: Ourbox holds 34.7B params but only ~3B are active per token (256 experts, top-8). Since decode is bandwidth-bound, a dense 34B moves ~16.7 GB/token while Ourbox moves ~1.45 GB — ~11× less traffic. Put the experts in system RAM, keep attention/router/shared on the GPU, and a 34.7B reasoner runs on an 8 GB laptop — or no GPU at all.
Sparsity alone, proven (same laptop, same quant, ~same footprint): Ourbox-35B (A3B) 20.01 tok/s vs Qwen2.5-32B (dense) 5.36 → 3.7× from sparsity alone, ~2× the best dense-32B on any 8 GB machine. Not a toy: GPQA Diamond 86.4% (maj@8).
Try it live (same prompt, GPU vs GPU-less CPU, live tok/s). Honest scope: one machine's measurements; the CPU path proves it RUNS without a GPU, not that it beats one.