The abstraction made operable. 27 leaf-choices (each −/0/+, weightable) feed a three-level recursion. At every node the gate is strictly greater than 2/3 — a bare two-thirds is not enough, by design. A node that fails its gate returns ⊘ (abstain), never a manufactured winner. The root decides only if it clears 2/3; otherwise it returns ⊘ — no legitimate decision. The 60% that loses cannot also win. Edit any leaf; the verdict recomputes live. Then zoom the fractal to see exactly where two-thirds broke.